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 r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
31 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)"};
32 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)"};
33 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)"};
34 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
35 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
36 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)"};
37 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)"};
38 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)"};
39 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
40 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
41 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)"};
42 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)"};
43 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
44 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
45 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, ..."};
46 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)"};
47 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
48 cvar_t mod_q3shader_default_offsetmapping = {CVAR_SAVE, "mod_q3shader_default_offsetmapping", "1", "use offsetmapping by default on all surfaces"};
50 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)"};
51 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"};
52 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"};
54 static texture_t mod_q1bsp_texture_solid;
55 static texture_t mod_q1bsp_texture_sky;
56 static texture_t mod_q1bsp_texture_lava;
57 static texture_t mod_q1bsp_texture_slime;
58 static texture_t mod_q1bsp_texture_water;
60 void Mod_BrushInit(void)
62 // Cvar_RegisterVariable(&r_subdivide_size);
63 Cvar_RegisterVariable(&r_novis);
64 Cvar_RegisterVariable(&r_nosurftextures);
65 Cvar_RegisterVariable(&r_subdivisions_tolerance);
66 Cvar_RegisterVariable(&r_subdivisions_mintess);
67 Cvar_RegisterVariable(&r_subdivisions_maxtess);
68 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
69 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
70 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
71 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
72 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
73 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
74 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
75 Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
76 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
77 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
78 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
79 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
80 Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
81 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping);
82 Cvar_RegisterVariable(&mod_q1bsp_polygoncollisions);
83 Cvar_RegisterVariable(&mod_collision_bih);
84 Cvar_RegisterVariable(&mod_recalculatenodeboxes);
86 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
87 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
88 mod_q1bsp_texture_solid.surfaceflags = 0;
89 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
91 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
92 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
93 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
94 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
96 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
97 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
98 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
99 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
101 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
102 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
103 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
104 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
106 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
107 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
108 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
109 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
112 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
119 // LordHavoc: modified to start at first clip node,
120 // in other words: first node of the (sub)model
121 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
123 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
125 return (mleaf_t *)node;
128 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
132 leaf = Mod_Q1BSP_PointInLeaf(model, p);
135 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
138 memcpy(out, leaf->ambient_sound_level, i);
144 memset(out, 0, outsize);
147 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
150 int nodestackindex = 0;
151 mnode_t *node, *nodestack[1024];
152 if (!model->brush.num_pvsclusters)
154 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
160 // node - recurse down the BSP tree
161 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
165 return -1; // ERROR: NAN bounding box!
166 // box is on one side of plane, take that path
167 node = node->children[sides-1];
171 // box crosses plane, take one path and remember the other
172 if (nodestackindex < 1024)
173 nodestack[nodestackindex++] = node->children[0];
174 node = node->children[1];
180 // leaf - add clusterindex to list
181 if (numclusters < maxclusters)
182 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
186 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
190 if (nodestackindex < 1024)
191 nodestack[nodestackindex++] = node->children[0];
192 node = node->children[1];
197 // leaf - add clusterindex to list
198 if (numclusters < maxclusters)
199 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
204 // try another path we didn't take earlier
205 if (nodestackindex == 0)
207 node = nodestack[--nodestackindex];
209 // return number of clusters found (even if more than the maxclusters)
213 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
215 int nodestackindex = 0;
216 mnode_t *node, *nodestack[1024];
217 if (!model->brush.num_pvsclusters)
219 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
225 // node - recurse down the BSP tree
226 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
230 return -1; // ERROR: NAN bounding box!
231 // box is on one side of plane, take that path
232 node = node->children[sides-1];
236 // box crosses plane, take one path and remember the other
237 if (nodestackindex < 1024)
238 nodestack[nodestackindex++] = node->children[0];
239 node = node->children[1];
245 // leaf - check cluster bit
246 int clusterindex = ((mleaf_t *)node)->clusterindex;
247 if (CHECKPVSBIT(pvs, clusterindex))
249 // it is visible, return immediately with the news
254 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
258 if (nodestackindex < 1024)
259 nodestack[nodestackindex++] = node->children[0];
260 node = node->children[1];
265 // leaf - check cluster bit
266 int clusterindex = ((mleaf_t *)node)->clusterindex;
267 if (CHECKPVSBIT(pvs, clusterindex))
269 // it is visible, return immediately with the news
275 // nothing to see here, try another path we didn't take earlier
276 if (nodestackindex == 0)
278 node = nodestack[--nodestackindex];
284 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
286 int nodestackindex = 0;
287 mnode_t *node, *nodestack[1024];
288 if (!model->brush.num_leafs)
290 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
296 // node - recurse down the BSP tree
297 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
301 return -1; // ERROR: NAN bounding box!
302 // box is on one side of plane, take that path
303 node = node->children[sides-1];
307 // box crosses plane, take one path and remember the other
308 if (nodestackindex < 1024)
309 nodestack[nodestackindex++] = node->children[0];
310 node = node->children[1];
316 // leaf - check cluster bit
317 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
318 if (CHECKPVSBIT(pvs, clusterindex))
320 // it is visible, return immediately with the news
325 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
329 if (nodestackindex < 1024)
330 nodestack[nodestackindex++] = node->children[0];
331 node = node->children[1];
336 // leaf - check cluster bit
337 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
338 if (CHECKPVSBIT(pvs, clusterindex))
340 // it is visible, return immediately with the news
346 // nothing to see here, try another path we didn't take earlier
347 if (nodestackindex == 0)
349 node = nodestack[--nodestackindex];
355 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
357 int nodestackindex = 0;
358 mnode_t *node, *nodestack[1024];
359 if (!model->brush.num_leafs)
361 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
367 // node - recurse down the BSP tree
368 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
372 return -1; // ERROR: NAN bounding box!
373 // box is on one side of plane, take that path
374 node = node->children[sides-1];
378 // box crosses plane, take one path and remember the other
379 if (nodestackindex < 1024)
380 nodestack[nodestackindex++] = node->children[0];
381 node = node->children[1];
387 // leaf - check if it is visible
388 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
390 // it is visible, return immediately with the news
395 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
399 if (nodestackindex < 1024)
400 nodestack[nodestackindex++] = node->children[0];
401 node = node->children[1];
406 // leaf - check if it is visible
407 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
409 // it is visible, return immediately with the news
415 // nothing to see here, try another path we didn't take earlier
416 if (nodestackindex == 0)
418 node = nodestack[--nodestackindex];
424 typedef struct findnonsolidlocationinfo_s
427 vec3_t absmin, absmax;
433 findnonsolidlocationinfo_t;
435 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
438 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
440 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
441 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
442 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
443 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
444 VectorSubtract(vert[1], vert[0], edge[0]);
445 VectorSubtract(vert[2], vert[1], edge[1]);
446 CrossProduct(edge[1], edge[0], facenormal);
447 if (facenormal[0] || facenormal[1] || facenormal[2])
449 VectorNormalize(facenormal);
450 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
451 if (f <= info->bestdist && f >= -info->bestdist)
453 VectorSubtract(vert[0], vert[2], edge[2]);
454 VectorNormalize(edge[0]);
455 VectorNormalize(edge[1]);
456 VectorNormalize(edge[2]);
457 CrossProduct(facenormal, edge[0], edgenormal[0]);
458 CrossProduct(facenormal, edge[1], edgenormal[1]);
459 CrossProduct(facenormal, edge[2], edgenormal[2]);
461 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
462 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
463 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
465 // we got lucky, the center is within the face
466 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
470 if (info->bestdist > dist)
472 info->bestdist = dist;
473 VectorScale(facenormal, (info->radius - -dist), info->nudge);
478 if (info->bestdist > dist)
480 info->bestdist = dist;
481 VectorScale(facenormal, (info->radius - dist), info->nudge);
487 // check which edge or vertex the center is nearest
488 for (i = 0;i < 3;i++)
490 f = DotProduct(info->center, edge[i]);
491 if (f >= DotProduct(vert[0], edge[i])
492 && f <= DotProduct(vert[1], edge[i]))
495 VectorMA(info->center, -f, edge[i], point);
496 dist = sqrt(DotProduct(point, point));
497 if (info->bestdist > dist)
499 info->bestdist = dist;
500 VectorScale(point, (info->radius / dist), info->nudge);
502 // skip both vertex checks
503 // (both are further away than this edge)
508 // not on edge, check first vertex of edge
509 VectorSubtract(info->center, vert[i], point);
510 dist = sqrt(DotProduct(point, point));
511 if (info->bestdist > dist)
513 info->bestdist = dist;
514 VectorScale(point, (info->radius / dist), info->nudge);
523 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
525 int surfacenum, k, *mark;
527 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
529 surface = info->model->data_surfaces + *mark;
530 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
532 if(surface->deprecatedq3num_bboxstride > 0)
535 cnt = (surface->num_triangles + surface->deprecatedq3num_bboxstride - 1) / surface->deprecatedq3num_bboxstride;
536 for(i = 0; i < cnt; ++i)
538 if(BoxesOverlap(surface->deprecatedq3data_bbox6f + i * 6, surface->deprecatedq3data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
540 for(k = 0; k < surface->deprecatedq3num_bboxstride; ++k)
542 tri = i * surface->deprecatedq3num_bboxstride + k;
543 if(tri >= surface->num_triangles)
545 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
552 for (k = 0;k < surface->num_triangles;k++)
554 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
561 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
565 float f = PlaneDiff(info->center, node->plane);
566 if (f >= -info->bestdist)
567 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
568 if (f <= info->bestdist)
569 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
573 if (((mleaf_t *)node)->numleafsurfaces)
574 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
578 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
581 findnonsolidlocationinfo_t info;
587 VectorCopy(in, info.center);
588 info.radius = radius;
593 VectorClear(info.nudge);
594 info.bestdist = radius;
595 VectorCopy(info.center, info.absmin);
596 VectorCopy(info.center, info.absmax);
597 info.absmin[0] -= info.radius + 1;
598 info.absmin[1] -= info.radius + 1;
599 info.absmin[2] -= info.radius + 1;
600 info.absmax[0] += info.radius + 1;
601 info.absmax[1] += info.radius + 1;
602 info.absmax[2] += info.radius + 1;
603 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
604 VectorAdd(info.center, info.nudge, info.center);
606 while (info.bestdist < radius && ++i < 10);
607 VectorCopy(info.center, out);
610 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
612 switch(nativecontents)
617 return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
619 return SUPERCONTENTS_WATER;
621 return SUPERCONTENTS_SLIME;
623 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
625 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
630 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
632 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
633 return CONTENTS_SOLID;
634 if (supercontents & SUPERCONTENTS_SKY)
636 if (supercontents & SUPERCONTENTS_LAVA)
637 return CONTENTS_LAVA;
638 if (supercontents & SUPERCONTENTS_SLIME)
639 return CONTENTS_SLIME;
640 if (supercontents & SUPERCONTENTS_WATER)
641 return CONTENTS_WATER;
642 return CONTENTS_EMPTY;
645 typedef struct RecursiveHullCheckTraceInfo_s
647 // the hull we're tracing through
650 // the trace structure to fill in
653 // start, end, and end - start (in model space)
658 RecursiveHullCheckTraceInfo_t;
660 // 1/32 epsilon to keep floating point happy
661 #define DIST_EPSILON (0.03125)
663 #define HULLCHECKSTATE_EMPTY 0
664 #define HULLCHECKSTATE_SOLID 1
665 #define HULLCHECKSTATE_DONE 2
667 extern cvar_t collision_prefernudgedfraction;
668 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
670 // status variables, these don't need to be saved on the stack when
671 // recursing... but are because this should be thread-safe
672 // (note: tracing against a bbox is not thread-safe, yet)
677 // variables that need to be stored on the stack when recursing
682 // LordHavoc: a goto! everyone flee in terror... :)
687 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
688 if (!t->trace->startfound)
690 t->trace->startfound = true;
691 t->trace->startsupercontents |= num;
693 if (num & SUPERCONTENTS_LIQUIDSMASK)
694 t->trace->inwater = true;
696 t->trace->inopen = true;
697 if (num & SUPERCONTENTS_SOLID)
698 t->trace->hittexture = &mod_q1bsp_texture_solid;
699 else if (num & SUPERCONTENTS_SKY)
700 t->trace->hittexture = &mod_q1bsp_texture_sky;
701 else if (num & SUPERCONTENTS_LAVA)
702 t->trace->hittexture = &mod_q1bsp_texture_lava;
703 else if (num & SUPERCONTENTS_SLIME)
704 t->trace->hittexture = &mod_q1bsp_texture_slime;
706 t->trace->hittexture = &mod_q1bsp_texture_water;
707 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
708 t->trace->hitsupercontents = num;
709 if (num & t->trace->hitsupercontentsmask)
711 // if the first leaf is solid, set startsolid
712 if (t->trace->allsolid)
713 t->trace->startsolid = true;
714 #if COLLISIONPARANOID >= 3
717 return HULLCHECKSTATE_SOLID;
721 t->trace->allsolid = false;
722 #if COLLISIONPARANOID >= 3
725 return HULLCHECKSTATE_EMPTY;
729 // find the point distances
730 node = t->hull->clipnodes + num;
732 plane = t->hull->planes + node->planenum;
735 t1 = p1[plane->type] - plane->dist;
736 t2 = p2[plane->type] - plane->dist;
740 t1 = DotProduct (plane->normal, p1) - plane->dist;
741 t2 = DotProduct (plane->normal, p2) - plane->dist;
748 #if COLLISIONPARANOID >= 3
751 num = node->children[1];
760 #if COLLISIONPARANOID >= 3
763 num = node->children[0];
769 // the line intersects, find intersection point
770 // LordHavoc: this uses the original trace for maximum accuracy
771 #if COLLISIONPARANOID >= 3
776 t1 = t->start[plane->type] - plane->dist;
777 t2 = t->end[plane->type] - plane->dist;
781 t1 = DotProduct (plane->normal, t->start) - plane->dist;
782 t2 = DotProduct (plane->normal, t->end) - plane->dist;
785 midf = t1 / (t1 - t2);
786 midf = bound(p1f, midf, p2f);
787 VectorMA(t->start, midf, t->dist, mid);
789 // recurse both sides, front side first
790 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
791 // if this side is not empty, return what it is (solid or done)
792 if (ret != HULLCHECKSTATE_EMPTY)
795 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
796 // if other side is not solid, return what it is (empty or done)
797 if (ret != HULLCHECKSTATE_SOLID)
800 // front is air and back is solid, this is the impact point...
803 t->trace->plane.dist = -plane->dist;
804 VectorNegate (plane->normal, t->trace->plane.normal);
808 t->trace->plane.dist = plane->dist;
809 VectorCopy (plane->normal, t->trace->plane.normal);
812 // calculate the true fraction
813 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
814 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
815 midf = t1 / (t1 - t2);
816 t->trace->realfraction = bound(0, midf, 1);
818 // calculate the return fraction which is nudged off the surface a bit
819 midf = (t1 - DIST_EPSILON) / (t1 - t2);
820 t->trace->fraction = bound(0, midf, 1);
822 if (collision_prefernudgedfraction.integer)
823 t->trace->realfraction = t->trace->fraction;
825 #if COLLISIONPARANOID >= 3
828 return HULLCHECKSTATE_DONE;
831 //#if COLLISIONPARANOID < 2
832 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
835 mclipnode_t *nodes = t->hull->clipnodes;
836 mplane_t *planes = t->hull->planes;
838 VectorCopy(t->start, point);
841 plane = planes + nodes[num].planenum;
842 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
844 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
845 t->trace->startsupercontents |= num;
846 if (num & SUPERCONTENTS_LIQUIDSMASK)
847 t->trace->inwater = true;
849 t->trace->inopen = true;
850 if (num & t->trace->hitsupercontentsmask)
852 t->trace->allsolid = t->trace->startsolid = true;
853 return HULLCHECKSTATE_SOLID;
857 t->trace->allsolid = t->trace->startsolid = false;
858 return HULLCHECKSTATE_EMPTY;
863 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)
865 RecursiveHullCheckTraceInfo_t rhc;
867 memset(&rhc, 0, sizeof(rhc));
868 memset(trace, 0, sizeof(trace_t));
870 rhc.trace->fraction = 1;
871 rhc.trace->realfraction = 1;
872 rhc.trace->allsolid = true;
873 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
874 VectorCopy(start, rhc.start);
875 VectorCopy(start, rhc.end);
876 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
879 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)
881 RecursiveHullCheckTraceInfo_t rhc;
883 if (VectorCompare(start, end))
885 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
889 memset(&rhc, 0, sizeof(rhc));
890 memset(trace, 0, sizeof(trace_t));
892 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
893 rhc.trace->fraction = 1;
894 rhc.trace->realfraction = 1;
895 rhc.trace->allsolid = true;
896 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
897 VectorCopy(start, rhc.start);
898 VectorCopy(end, rhc.end);
899 VectorSubtract(rhc.end, rhc.start, rhc.dist);
900 #if COLLISIONPARANOID >= 2
901 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]);
902 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
907 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
908 memset(&testtrace, 0, sizeof(trace_t));
909 rhc.trace = &testtrace;
910 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
911 rhc.trace->fraction = 1;
912 rhc.trace->realfraction = 1;
913 rhc.trace->allsolid = true;
914 VectorCopy(test, rhc.start);
915 VectorCopy(test, rhc.end);
916 VectorClear(rhc.dist);
917 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
918 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
919 if (!trace->startsolid && testtrace.startsolid)
920 Con_Printf(" - ended in solid!\n");
924 if (VectorLength2(rhc.dist))
925 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
927 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
931 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)
933 // this function currently only supports same size start and end
935 RecursiveHullCheckTraceInfo_t rhc;
937 if (VectorCompare(boxmins, boxmaxs))
939 if (VectorCompare(start, end))
940 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
942 Mod_Q1BSP_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
946 memset(&rhc, 0, sizeof(rhc));
947 memset(trace, 0, sizeof(trace_t));
949 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
950 rhc.trace->fraction = 1;
951 rhc.trace->realfraction = 1;
952 rhc.trace->allsolid = true;
953 VectorSubtract(boxmaxs, boxmins, boxsize);
955 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
956 else if (model->brush.ishlbsp)
958 // LordHavoc: this has to have a minor tolerance (the .1) because of
959 // minor float precision errors from the box being transformed around
960 if (boxsize[0] < 32.1)
962 if (boxsize[2] < 54) // pick the nearest of 36 or 72
963 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
965 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
968 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
972 // LordHavoc: this has to have a minor tolerance (the .1) because of
973 // minor float precision errors from the box being transformed around
974 if (boxsize[0] < 32.1)
975 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
977 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
979 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
980 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
981 VectorSubtract(rhc.end, rhc.start, rhc.dist);
982 #if COLLISIONPARANOID >= 2
983 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]);
984 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
989 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
990 memset(&testtrace, 0, sizeof(trace_t));
991 rhc.trace = &testtrace;
992 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
993 rhc.trace->fraction = 1;
994 rhc.trace->realfraction = 1;
995 rhc.trace->allsolid = true;
996 VectorCopy(test, rhc.start);
997 VectorCopy(test, rhc.end);
998 VectorClear(rhc.dist);
999 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1000 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
1001 if (!trace->startsolid && testtrace.startsolid)
1002 Con_Printf(" - ended in solid!\n");
1006 if (VectorLength2(rhc.dist))
1007 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1009 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1013 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1015 int num = model->brushq1.hulls[0].firstclipnode;
1017 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1018 mplane_t *planes = model->brushq1.hulls[0].planes;
1021 plane = planes + nodes[num].planenum;
1022 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1024 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1027 void Collision_ClipTrace_Box(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, const texture_t *boxtexture)
1031 colplanef_t cbox_planes[6];
1033 cbox.hasaabbplanes = true;
1034 cbox.supercontents = boxsupercontents;
1037 cbox.numtriangles = 0;
1038 cbox.planes = cbox_planes;
1040 cbox.elements = NULL;
1048 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];
1049 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];
1050 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];
1051 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];
1052 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];
1053 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];
1054 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1055 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1056 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1057 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1058 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1059 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1060 memset(trace, 0, sizeof(trace_t));
1061 trace->hitsupercontentsmask = hitsupercontentsmask;
1062 trace->fraction = 1;
1063 trace->realfraction = 1;
1064 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1066 RecursiveHullCheckTraceInfo_t rhc;
1067 static hull_t box_hull;
1068 static mclipnode_t box_clipnodes[6];
1069 static mplane_t box_planes[6];
1070 // fill in a default trace
1071 memset(&rhc, 0, sizeof(rhc));
1072 memset(trace, 0, sizeof(trace_t));
1073 //To keep everything totally uniform, bounding boxes are turned into small
1074 //BSP trees instead of being compared directly.
1075 // create a temp hull from bounding box sizes
1076 box_planes[0].dist = cmaxs[0] - mins[0];
1077 box_planes[1].dist = cmins[0] - maxs[0];
1078 box_planes[2].dist = cmaxs[1] - mins[1];
1079 box_planes[3].dist = cmins[1] - maxs[1];
1080 box_planes[4].dist = cmaxs[2] - mins[2];
1081 box_planes[5].dist = cmins[2] - maxs[2];
1082 #if COLLISIONPARANOID >= 3
1083 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]);
1086 if (box_hull.clipnodes == NULL)
1090 //Set up the planes and clipnodes so that the six floats of a bounding box
1091 //can just be stored out and get a proper hull_t structure.
1093 box_hull.clipnodes = box_clipnodes;
1094 box_hull.planes = box_planes;
1095 box_hull.firstclipnode = 0;
1096 box_hull.lastclipnode = 5;
1098 for (i = 0;i < 6;i++)
1100 box_clipnodes[i].planenum = i;
1104 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1106 box_clipnodes[i].children[side^1] = i + 1;
1108 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1110 box_planes[i].type = i>>1;
1111 box_planes[i].normal[i>>1] = 1;
1115 // trace a line through the generated clipping hull
1116 //rhc.boxsupercontents = boxsupercontents;
1117 rhc.hull = &box_hull;
1119 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1120 rhc.trace->fraction = 1;
1121 rhc.trace->realfraction = 1;
1122 rhc.trace->allsolid = true;
1123 VectorCopy(start, rhc.start);
1124 VectorCopy(end, rhc.end);
1125 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1126 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1127 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1128 if (rhc.trace->startsupercontents)
1129 rhc.trace->startsupercontents = boxsupercontents;
1133 void Collision_ClipTrace_Point(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, const texture_t *boxtexture)
1135 memset(trace, 0, sizeof(trace_t));
1136 trace->fraction = 1;
1137 trace->realfraction = 1;
1138 if (BoxesOverlap(start, start, cmins, cmaxs))
1140 trace->startsupercontents |= boxsupercontents;
1141 if (hitsupercontentsmask & boxsupercontents)
1143 trace->startsolid = true;
1144 trace->allsolid = true;
1149 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1152 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1153 return trace.fraction == 1;
1156 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)
1160 float mid, distz = endz - startz;
1164 return false; // didn't hit anything
1166 switch (node->plane->type)
1169 node = node->children[x < node->plane->dist];
1172 node = node->children[y < node->plane->dist];
1175 side = startz < node->plane->dist;
1176 if ((endz < node->plane->dist) == side)
1178 node = node->children[side];
1181 // found an intersection
1182 mid = node->plane->dist;
1185 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1186 front += startz * node->plane->normal[2];
1187 back += endz * node->plane->normal[2];
1188 side = front < node->plane->dist;
1189 if ((back < node->plane->dist) == side)
1191 node = node->children[side];
1194 // found an intersection
1195 mid = startz + distz * (front - node->plane->dist) / (front - back);
1199 // go down front side
1200 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1201 return true; // hit something
1204 // check for impact on this node
1205 if (node->numsurfaces)
1207 int i, dsi, dti, lmwidth, lmheight;
1209 msurface_t *surface;
1210 unsigned char *lightmap;
1211 int maps, line3, size3;
1214 float scale, w, w00, w01, w10, w11;
1216 surface = model->data_surfaces + node->firstsurface;
1217 for (i = 0;i < node->numsurfaces;i++, surface++)
1219 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo || !surface->lightmapinfo->samples)
1220 continue; // no lightmaps
1222 // location we want to sample in the lightmap
1223 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;
1224 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;
1229 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1230 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1233 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1235 // calculate bilinear interpolation factors
1236 // and also multiply by fixedpoint conversion factors
1239 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1240 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1241 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1242 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1244 // values for pointer math
1245 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1246 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1248 // look up the pixel
1249 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1251 // bilinear filter each lightmap style, and sum them
1252 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1254 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1255 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1256 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1257 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1258 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1262 return true; // success
1267 // go down back side
1268 node = node->children[side ^ 1];
1270 distz = endz - startz;
1275 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1277 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1278 VectorSet(diffusenormal, 0, 0, 1);
1280 if (!model->brushq1.lightdata)
1282 VectorSet(ambientcolor, 1, 1, 1);
1283 VectorSet(diffusecolor, 0, 0, 0);
1287 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);
1290 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1293 unsigned char *outstart = out;
1294 while (out < outend)
1298 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));
1308 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));
1311 for (c = *in++;c > 0;c--)
1315 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));
1326 R_Q1BSP_LoadSplitSky
1328 A sky texture is 256*128, with the right side being a masked overlay
1331 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1336 unsigned int *solidpixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1337 unsigned int *alphapixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1339 // allocate a texture pool if we need it
1340 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1341 loadmodel->texturepool = R_AllocTexturePool();
1343 if (bytesperpixel == 4)
1345 for (y = 0;y < h;y++)
1347 for (x = 0;x < w;x++)
1349 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1350 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1356 // make an average value for the back to avoid
1357 // a fringe on the top level
1366 for (y = 0;y < h;y++)
1368 for (x = 0;x < w;x++)
1370 p = src[x*width+y+w];
1371 r += palette_rgb[p][0];
1372 g += palette_rgb[p][1];
1373 b += palette_rgb[p][2];
1376 bgra.b[2] = r/(w*h);
1377 bgra.b[1] = g/(w*h);
1378 bgra.b[0] = b/(w*h);
1380 for (y = 0;y < h;y++)
1382 for (x = 0;x < w;x++)
1384 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1386 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1391 loadmodel->brush.solidskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_solidtexture", 0 , (unsigned char *) solidpixels, w, h);
1392 loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA, (unsigned char *) alphapixels, w, h);
1393 Mem_Free(solidpixels);
1394 Mem_Free(alphapixels);
1397 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1399 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1400 skinframe_t *skinframe;
1402 texture_t *tx, *tx2, *anims[10], *altanims[10];
1404 unsigned char *data, *mtdata;
1406 char mapname[MAX_QPATH], name[MAX_QPATH];
1407 unsigned char zero[4];
1409 memset(zero, 0, sizeof(zero));
1411 loadmodel->data_textures = NULL;
1413 // add two slots for notexture walls and notexture liquids
1416 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1417 m->nummiptex = LittleLong (m->nummiptex);
1418 loadmodel->num_textures = m->nummiptex + 2;
1419 loadmodel->num_texturesperskin = loadmodel->num_textures;
1424 loadmodel->num_textures = 2;
1425 loadmodel->num_texturesperskin = loadmodel->num_textures;
1428 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1430 // fill out all slots with notexture
1431 if (cls.state != ca_dedicated)
1432 skinframe = R_SkinFrame_LoadMissing();
1435 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1437 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1440 if (cls.state != ca_dedicated)
1442 tx->numskinframes = 1;
1443 tx->skinframerate = 1;
1444 tx->skinframes[0] = skinframe;
1445 tx->currentskinframe = tx->skinframes[0];
1447 tx->basematerialflags = MATERIALFLAG_WALL;
1448 if (i == loadmodel->num_textures - 1)
1450 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1451 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1452 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1456 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1457 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1459 tx->currentframe = tx;
1461 // clear water settings
1464 tx->refractfactor = 1;
1465 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1466 tx->reflectfactor = 1;
1467 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1468 tx->r_water_wateralpha = 1;
1469 tx->offsetmapping = OFFSETMAPPING_OFF;
1470 tx->offsetscale = 1;
1471 tx->specularscalemod = 1;
1472 tx->specularpowermod = 1;
1477 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1481 s = loadmodel->name;
1482 if (!strncasecmp(s, "maps/", 5))
1484 FS_StripExtension(s, mapname, sizeof(mapname));
1486 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1488 // LordHavoc: mostly rewritten map texture loader
1489 for (i = 0;i < m->nummiptex;i++)
1491 dofs[i] = LittleLong(dofs[i]);
1492 if (r_nosurftextures.integer)
1496 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1499 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1501 // copy name, but only up to 16 characters
1502 // (the output buffer can hold more than this, but the input buffer is
1504 for (j = 0;j < 16 && dmiptex->name[j];j++)
1505 name[j] = dmiptex->name[j];
1510 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1511 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1514 mtwidth = LittleLong(dmiptex->width);
1515 mtheight = LittleLong(dmiptex->height);
1517 j = LittleLong(dmiptex->offsets[0]);
1521 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1523 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1526 mtdata = (unsigned char *)dmiptex + j;
1529 if ((mtwidth & 15) || (mtheight & 15))
1530 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1532 // LordHavoc: force all names to lowercase
1533 for (j = 0;name[j];j++)
1534 if (name[j] >= 'A' && name[j] <= 'Z')
1535 name[j] += 'a' - 'A';
1537 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1540 tx = loadmodel->data_textures + i;
1541 strlcpy(tx->name, name, sizeof(tx->name));
1542 tx->width = mtwidth;
1543 tx->height = mtheight;
1545 if (tx->name[0] == '*')
1547 if (!strncmp(tx->name, "*lava", 5))
1549 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1550 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1552 else if (!strncmp(tx->name, "*slime", 6))
1554 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1555 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1559 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1560 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1563 else if (!strncmp(tx->name, "sky", 3))
1565 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1566 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1570 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1571 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1574 if (cls.state != ca_dedicated)
1576 // LordHavoc: HL sky textures are entirely different than quake
1577 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1579 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), false, false, r_texture_convertsRGB_skin.integer != 0, NULL);
1581 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), false, false, r_texture_convertsRGB_skin.integer != 0, NULL);
1582 if (data && image_width == image_height * 2)
1584 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1587 else if (mtdata != NULL)
1588 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1592 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false);
1594 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false);
1597 // did not find external texture, load it from the bsp or wad3
1598 if (loadmodel->brush.ishlbsp)
1600 // internal texture overrides wad
1601 unsigned char *pixels, *freepixels;
1602 pixels = freepixels = NULL;
1604 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1606 pixels = freepixels = W_GetTextureBGRA(tx->name);
1609 tx->width = image_width;
1610 tx->height = image_height;
1611 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, pixels, image_width, image_height);
1614 Mem_Free(freepixels);
1616 else if (mtdata) // texture included
1617 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1619 // if skinframe is still NULL the "missing" texture will be used
1621 tx->skinframes[0] = skinframe;
1624 tx->basematerialflags = MATERIALFLAG_WALL;
1625 if (tx->name[0] == '*')
1627 // LordHavoc: some turbulent textures should not be affected by wateralpha
1628 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1630 // replace the texture with transparent black
1631 Vector4Set(zero, 128, 128, 128, 128);
1632 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA, zero, 1, 1);
1633 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1635 else if (!strncmp(tx->name,"*lava",5)
1636 || !strncmp(tx->name,"*teleport",9)
1637 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1638 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1640 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1641 if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1642 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1644 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1646 // replace the texture with black
1647 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, 0, zero, 1, 1);
1648 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1650 else if (!strncmp(tx->name, "sky", 3))
1651 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1652 else if (!strcmp(tx->name, "caulk"))
1653 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1654 else if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1655 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1657 // start out with no animation
1658 tx->currentframe = tx;
1659 tx->currentskinframe = tx->skinframes[0];
1663 // sequence the animations
1664 for (i = 0;i < m->nummiptex;i++)
1666 tx = loadmodel->data_textures + i;
1667 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1669 if (tx->anim_total[0] || tx->anim_total[1])
1670 continue; // already sequenced
1672 // find the number of frames in the animation
1673 memset(anims, 0, sizeof(anims));
1674 memset(altanims, 0, sizeof(altanims));
1676 for (j = i;j < m->nummiptex;j++)
1678 tx2 = loadmodel->data_textures + j;
1679 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1683 if (num >= '0' && num <= '9')
1684 anims[num - '0'] = tx2;
1685 else if (num >= 'a' && num <= 'j')
1686 altanims[num - 'a'] = tx2;
1688 Con_Printf("Bad animating texture %s\n", tx->name);
1692 for (j = 0;j < 10;j++)
1699 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1702 for (j = 0;j < max;j++)
1706 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1710 for (j = 0;j < altmax;j++)
1714 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1723 // if there is no alternate animation, duplicate the primary
1724 // animation into the alternate
1726 for (k = 0;k < 10;k++)
1727 altanims[k] = anims[k];
1730 // link together the primary animation
1731 for (j = 0;j < max;j++)
1734 tx2->animated = true;
1735 tx2->anim_total[0] = max;
1736 tx2->anim_total[1] = altmax;
1737 for (k = 0;k < 10;k++)
1739 tx2->anim_frames[0][k] = anims[k];
1740 tx2->anim_frames[1][k] = altanims[k];
1744 // if there really is an alternate anim...
1745 if (anims[0] != altanims[0])
1747 // link together the alternate animation
1748 for (j = 0;j < altmax;j++)
1751 tx2->animated = true;
1752 // the primary/alternate are reversed here
1753 tx2->anim_total[0] = altmax;
1754 tx2->anim_total[1] = max;
1755 for (k = 0;k < 10;k++)
1757 tx2->anim_frames[0][k] = altanims[k];
1758 tx2->anim_frames[1][k] = anims[k];
1765 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1768 unsigned char *in, *out, *data, d;
1769 char litfilename[MAX_QPATH];
1770 char dlitfilename[MAX_QPATH];
1771 fs_offset_t filesize;
1772 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1774 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1775 for (i=0; i<l->filelen; i++)
1776 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1778 else // LordHavoc: bsp version 29 (normal white lighting)
1780 // LordHavoc: hope is not lost yet, check for a .lit file to load
1781 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1782 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1783 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1784 strlcat (litfilename, ".lit", sizeof (litfilename));
1785 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1786 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1789 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1791 i = LittleLong(((int *)data)[1]);
1794 if (developer_loading.integer)
1795 Con_Printf("loaded %s\n", litfilename);
1796 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1797 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1799 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1802 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1804 i = LittleLong(((int *)data)[1]);
1807 if (developer_loading.integer)
1808 Con_Printf("loaded %s\n", dlitfilename);
1809 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1810 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1811 loadmodel->brushq3.deluxemapping_modelspace = false;
1812 loadmodel->brushq3.deluxemapping = true;
1821 Con_Printf("Unknown .lit file version (%d)\n", i);
1823 else if (filesize == 8)
1824 Con_Print("Empty .lit file, ignoring\n");
1826 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1833 // LordHavoc: oh well, expand the white lighting data
1836 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1837 in = mod_base + l->fileofs;
1838 out = loadmodel->brushq1.lightdata;
1839 for (i = 0;i < l->filelen;i++)
1849 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1851 loadmodel->brushq1.num_compressedpvs = 0;
1852 loadmodel->brushq1.data_compressedpvs = NULL;
1855 loadmodel->brushq1.num_compressedpvs = l->filelen;
1856 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1857 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1860 // used only for HalfLife maps
1861 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1863 char key[128], value[4096];
1867 if (!COM_ParseToken_Simple(&data, false, false))
1869 if (com_token[0] != '{')
1873 if (!COM_ParseToken_Simple(&data, false, false))
1875 if (com_token[0] == '}')
1876 break; // end of worldspawn
1877 if (com_token[0] == '_')
1878 strlcpy(key, com_token + 1, sizeof(key));
1880 strlcpy(key, com_token, sizeof(key));
1881 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1882 key[strlen(key)-1] = 0;
1883 if (!COM_ParseToken_Simple(&data, false, false))
1885 dpsnprintf(value, sizeof(value), "%s", com_token);
1886 if (!strcmp("wad", key)) // for HalfLife maps
1888 if (loadmodel->brush.ishlbsp)
1891 for (i = 0;i < (int)sizeof(value);i++)
1892 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1896 for (;i < (int)sizeof(value);i++)
1898 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1899 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1901 else if (value[i] == ';' || value[i] == 0)
1905 W_LoadTextureWadFile(&value[j], false);
1917 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1919 loadmodel->brush.entities = NULL;
1922 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1923 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1924 loadmodel->brush.entities[l->filelen] = 0;
1925 if (loadmodel->brush.ishlbsp)
1926 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1930 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1936 in = (dvertex_t *)(mod_base + l->fileofs);
1937 if (l->filelen % sizeof(*in))
1938 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1939 count = l->filelen / sizeof(*in);
1940 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1942 loadmodel->brushq1.vertexes = out;
1943 loadmodel->brushq1.numvertexes = count;
1945 for ( i=0 ; i<count ; i++, in++, out++)
1947 out->position[0] = LittleFloat(in->point[0]);
1948 out->position[1] = LittleFloat(in->point[1]);
1949 out->position[2] = LittleFloat(in->point[2]);
1953 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1954 // can be used for this
1956 int SB_ReadInt (unsigned char **buffer)
1959 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1965 float SB_ReadFloat (unsigned char **buffer)
1973 u.i = SB_ReadInt (buffer);
1977 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1979 unsigned char *index;
1983 index = (unsigned char *)(mod_base + l->fileofs);
1984 if (l->filelen % (48+4*hullinfo->filehulls))
1985 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1987 count = l->filelen / (48+4*hullinfo->filehulls);
1988 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1990 loadmodel->brushq1.submodels = out;
1991 loadmodel->brush.numsubmodels = count;
1993 for (i = 0; i < count; i++, out++)
1995 // spread out the mins / maxs by a pixel
1996 out->mins[0] = SB_ReadFloat (&index) - 1;
1997 out->mins[1] = SB_ReadFloat (&index) - 1;
1998 out->mins[2] = SB_ReadFloat (&index) - 1;
1999 out->maxs[0] = SB_ReadFloat (&index) + 1;
2000 out->maxs[1] = SB_ReadFloat (&index) + 1;
2001 out->maxs[2] = SB_ReadFloat (&index) + 1;
2002 out->origin[0] = SB_ReadFloat (&index);
2003 out->origin[1] = SB_ReadFloat (&index);
2004 out->origin[2] = SB_ReadFloat (&index);
2005 for (j = 0; j < hullinfo->filehulls; j++)
2006 out->headnode[j] = SB_ReadInt (&index);
2007 out->visleafs = SB_ReadInt (&index);
2008 out->firstface = SB_ReadInt (&index);
2009 out->numfaces = SB_ReadInt (&index);
2013 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2019 in = (dedge_t *)(mod_base + l->fileofs);
2020 if (l->filelen % sizeof(*in))
2021 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2022 count = l->filelen / sizeof(*in);
2023 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2025 loadmodel->brushq1.edges = out;
2026 loadmodel->brushq1.numedges = count;
2028 for ( i=0 ; i<count ; i++, in++, out++)
2030 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2031 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2032 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2034 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);
2035 if(!loadmodel->brushq1.numvertexes)
2036 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2044 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2048 int i, j, k, count, miptex;
2050 in = (texinfo_t *)(mod_base + l->fileofs);
2051 if (l->filelen % sizeof(*in))
2052 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2053 count = l->filelen / sizeof(*in);
2054 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2056 loadmodel->brushq1.texinfo = out;
2057 loadmodel->brushq1.numtexinfo = count;
2059 for (i = 0;i < count;i++, in++, out++)
2061 for (k = 0;k < 2;k++)
2062 for (j = 0;j < 4;j++)
2063 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2065 miptex = LittleLong(in->miptex);
2066 out->flags = LittleLong(in->flags);
2068 out->texture = NULL;
2069 if (loadmodel->data_textures)
2071 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2072 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2074 out->texture = loadmodel->data_textures + miptex;
2076 if (out->flags & TEX_SPECIAL)
2078 // if texture chosen is NULL or the shader needs a lightmap,
2079 // force to notexture water shader
2080 if (out->texture == NULL)
2081 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2085 // if texture chosen is NULL, force to notexture
2086 if (out->texture == NULL)
2087 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2093 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2098 mins[0] = mins[1] = mins[2] = 9999;
2099 maxs[0] = maxs[1] = maxs[2] = -9999;
2101 for (i = 0;i < numverts;i++)
2103 for (j = 0;j < 3;j++, v++)
2113 #define MAX_SUBDIVPOLYTRIANGLES 4096
2114 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2116 static int subdivpolyverts, subdivpolytriangles;
2117 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2118 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2120 static int subdivpolylookupvert(vec3_t v)
2123 for (i = 0;i < subdivpolyverts;i++)
2124 if (subdivpolyvert[i][0] == v[0]
2125 && subdivpolyvert[i][1] == v[1]
2126 && subdivpolyvert[i][2] == v[2])
2128 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2129 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2130 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2131 return subdivpolyverts++;
2134 static void SubdividePolygon(int numverts, float *verts)
2136 int i, i1, i2, i3, f, b, c, p;
2137 vec3_t mins, maxs, front[256], back[256];
2138 float m, *pv, *cv, dist[256], frac;
2141 Host_Error("SubdividePolygon: ran out of verts in buffer");
2143 BoundPoly(numverts, verts, mins, maxs);
2145 for (i = 0;i < 3;i++)
2147 m = (mins[i] + maxs[i]) * 0.5;
2148 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2149 if (maxs[i] - m < 8)
2151 if (m - mins[i] < 8)
2155 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2156 dist[c] = cv[i] - m;
2159 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2163 VectorCopy(pv, front[f]);
2168 VectorCopy(pv, back[b]);
2171 if (dist[p] == 0 || dist[c] == 0)
2173 if ((dist[p] > 0) != (dist[c] > 0) )
2176 frac = dist[p] / (dist[p] - dist[c]);
2177 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2178 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2179 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2185 SubdividePolygon(f, front[0]);
2186 SubdividePolygon(b, back[0]);
2190 i1 = subdivpolylookupvert(verts);
2191 i2 = subdivpolylookupvert(verts + 3);
2192 for (i = 2;i < numverts;i++)
2194 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2196 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2200 i3 = subdivpolylookupvert(verts + i * 3);
2201 subdivpolyindex[subdivpolytriangles][0] = i1;
2202 subdivpolyindex[subdivpolytriangles][1] = i2;
2203 subdivpolyindex[subdivpolytriangles][2] = i3;
2205 subdivpolytriangles++;
2209 //Breaks a polygon up along axial 64 unit
2210 //boundaries so that turbulent and sky warps
2211 //can be done reasonably.
2212 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2218 subdivpolytriangles = 0;
2219 subdivpolyverts = 0;
2220 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2221 if (subdivpolytriangles < 1)
2222 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2224 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2225 mesh->num_vertices = subdivpolyverts;
2226 mesh->num_triangles = subdivpolytriangles;
2227 mesh->vertex = (surfvertex_t *)(mesh + 1);
2228 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2229 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2231 for (i = 0;i < mesh->num_triangles;i++)
2232 for (j = 0;j < 3;j++)
2233 mesh->index[i*3+j] = subdivpolyindex[i][j];
2235 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2237 VectorCopy(subdivpolyvert[i], v->v);
2238 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2239 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2244 extern cvar_t gl_max_lightmapsize;
2245 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2248 msurface_t *surface;
2249 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2250 float texmins[2], texmaxs[2], val;
2251 rtexture_t *lightmaptexture, *deluxemaptexture;
2253 in = (dface_t *)(mod_base + l->fileofs);
2254 if (l->filelen % sizeof(*in))
2255 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2256 count = l->filelen / sizeof(*in);
2257 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2258 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2260 loadmodel->num_surfaces = count;
2262 loadmodel->brushq1.firstrender = true;
2263 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2267 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2269 numedges = (unsigned short)LittleShort(in->numedges);
2270 totalverts += numedges;
2271 totaltris += numedges - 2;
2274 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2276 lightmaptexture = NULL;
2277 deluxemaptexture = r_texture_blanknormalmap;
2279 lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2280 totallightmapsamples = 0;
2284 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2286 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2288 // FIXME: validate edges, texinfo, etc?
2289 firstedge = LittleLong(in->firstedge);
2290 numedges = (unsigned short)LittleShort(in->numedges);
2291 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)
2292 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2293 i = (unsigned short)LittleShort(in->texinfo);
2294 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2295 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2296 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2297 surface->texture = surface->lightmapinfo->texinfo->texture;
2299 planenum = (unsigned short)LittleShort(in->planenum);
2300 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2301 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2303 //surface->flags = surface->texture->flags;
2304 //if (LittleShort(in->side))
2305 // surface->flags |= SURF_PLANEBACK;
2306 //surface->plane = loadmodel->brush.data_planes + planenum;
2308 surface->num_firstvertex = totalverts;
2309 surface->num_vertices = numedges;
2310 surface->num_firsttriangle = totaltris;
2311 surface->num_triangles = numedges - 2;
2312 totalverts += numedges;
2313 totaltris += numedges - 2;
2315 // convert edges back to a normal polygon
2316 for (i = 0;i < surface->num_vertices;i++)
2318 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2320 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2322 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2324 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2325 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2326 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2327 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2328 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2329 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2330 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2331 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2334 for (i = 0;i < surface->num_triangles;i++)
2336 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2337 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2338 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2341 // compile additional data about the surface geometry
2342 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, true);
2343 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, true);
2344 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2346 // generate surface extents information
2347 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2348 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2349 for (i = 1;i < surface->num_vertices;i++)
2351 for (j = 0;j < 2;j++)
2353 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2354 texmins[j] = min(texmins[j], val);
2355 texmaxs[j] = max(texmaxs[j], val);
2358 for (i = 0;i < 2;i++)
2360 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2361 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2364 smax = surface->lightmapinfo->extents[0] >> 4;
2365 tmax = surface->lightmapinfo->extents[1] >> 4;
2366 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2367 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2370 for (i = 0;i < MAXLIGHTMAPS;i++)
2371 surface->lightmapinfo->styles[i] = in->styles[i];
2372 surface->lightmaptexture = NULL;
2373 surface->deluxemaptexture = r_texture_blanknormalmap;
2374 i = LittleLong(in->lightofs);
2377 surface->lightmapinfo->samples = NULL;
2379 // give non-lightmapped water a 1x white lightmap
2380 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2382 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2383 surface->lightmapinfo->styles[0] = 0;
2384 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2388 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2389 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2390 else // LordHavoc: white lighting (bsp version 29)
2392 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2393 if (loadmodel->brushq1.nmaplightdata)
2394 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2397 // check if we should apply a lightmap to this
2398 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2400 if (ssize > 256 || tsize > 256)
2401 Host_Error("Bad surface extents");
2403 if (lightmapsize < ssize)
2404 lightmapsize = ssize;
2405 if (lightmapsize < tsize)
2406 lightmapsize = tsize;
2408 totallightmapsamples += ssize*tsize;
2410 // force lightmap upload on first time seeing the surface
2412 // additionally this is used by the later code to see if a
2413 // lightmap is needed on this surface (rather than duplicating the
2415 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2419 // small maps (such as ammo boxes especially) don't need big lightmap
2420 // textures, so this code tries to guess a good size based on
2421 // totallightmapsamples (size of the lightmaps lump basically), as well as
2422 // trying to max out the size if there is a lot of lightmap data to store
2423 // additionally, never choose a lightmapsize that is smaller than the
2424 // largest surface encountered (as it would fail)
2426 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2429 // now that we've decided the lightmap texture size, we can do the rest
2430 if (cls.state != ca_dedicated)
2432 int stainmapsize = 0;
2433 mod_alloclightmap_state_t allocState;
2435 Mod_AllocLightmap_Init(&allocState, lightmapsize, lightmapsize);
2436 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2438 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2439 float u, v, ubase, vbase, uscale, vscale;
2441 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2444 smax = surface->lightmapinfo->extents[0] >> 4;
2445 tmax = surface->lightmapinfo->extents[1] >> 4;
2446 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2447 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2448 stainmapsize += ssize * tsize * 3;
2450 if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2452 // allocate a texture pool if we need it
2453 if (loadmodel->texturepool == NULL)
2454 loadmodel->texturepool = R_AllocTexturePool();
2455 // could not find room, make a new lightmap
2456 loadmodel->brushq3.num_mergedlightmaps = lightmapnumber + 1;
2457 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_lightmaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_lightmaps[0]));
2458 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_deluxemaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_deluxemaps[0]));
2459 loadmodel->brushq3.data_lightmaps[lightmapnumber] = lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2460 if (loadmodel->brushq1.nmaplightdata)
2461 loadmodel->brushq3.data_deluxemaps[lightmapnumber] = deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2463 Mod_AllocLightmap_Reset(&allocState);
2464 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2466 surface->lightmaptexture = lightmaptexture;
2467 surface->deluxemaptexture = deluxemaptexture;
2468 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2469 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2471 uscale = 1.0f / (float)lightmapsize;
2472 vscale = 1.0f / (float)lightmapsize;
2473 ubase = lightmapx * uscale;
2474 vbase = lightmapy * vscale;
2476 for (i = 0;i < surface->num_vertices;i++)
2478 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);
2479 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);
2480 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2481 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2482 // LordHavoc: calc lightmap data offset for vertex lighting to use
2485 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2489 if (cl_stainmaps.integer)
2491 // allocate stainmaps for permanent marks on walls and clear white
2492 unsigned char *stainsamples = NULL;
2493 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2494 memset(stainsamples, 255, stainmapsize);
2496 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2498 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2500 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2501 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2502 surface->lightmapinfo->stainsamples = stainsamples;
2503 stainsamples += ssize * tsize * 3;
2508 // generate ushort elements array if possible
2509 if (loadmodel->surfmesh.data_element3s)
2510 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2511 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2514 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2517 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2518 node->parent = parent;
2521 // this is a node, recurse to children
2522 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2523 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2524 // combine supercontents of children
2525 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2530 mleaf_t *leaf = (mleaf_t *)node;
2531 // if this is a leaf, calculate supercontents mask from all collidable
2532 // primitives in the leaf (brushes and collision surfaces)
2533 // also flag if the leaf contains any collision surfaces
2534 leaf->combinedsupercontents = 0;
2535 // combine the supercontents values of all brushes in this leaf
2536 for (j = 0;j < leaf->numleafbrushes;j++)
2537 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2538 // check if this leaf contains any collision surfaces (q3 patches)
2539 for (j = 0;j < leaf->numleafsurfaces;j++)
2541 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2542 if (surface->num_collisiontriangles)
2544 leaf->containscollisionsurfaces = true;
2545 leaf->combinedsupercontents |= surface->texture->supercontents;
2551 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2557 in = (dnode_t *)(mod_base + l->fileofs);
2558 if (l->filelen % sizeof(*in))
2559 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2560 count = l->filelen / sizeof(*in);
2561 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2563 loadmodel->brush.data_nodes = out;
2564 loadmodel->brush.num_nodes = count;
2566 for ( i=0 ; i<count ; i++, in++, out++)
2568 for (j=0 ; j<3 ; j++)
2570 out->mins[j] = LittleShort(in->mins[j]);
2571 out->maxs[j] = LittleShort(in->maxs[j]);
2574 p = LittleLong(in->planenum);
2575 out->plane = loadmodel->brush.data_planes + p;
2577 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2578 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2580 for (j=0 ; j<2 ; j++)
2582 // LordHavoc: this code supports broken bsp files produced by
2583 // arguire qbsp which can produce more than 32768 nodes, any value
2584 // below count is assumed to be a node number, any other value is
2585 // assumed to be a leaf number
2586 p = (unsigned short)LittleShort(in->children[j]);
2589 if (p < loadmodel->brush.num_nodes)
2590 out->children[j] = loadmodel->brush.data_nodes + p;
2593 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2594 // map it to the solid leaf
2595 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2600 // note this uses 65535 intentionally, -1 is leaf 0
2602 if (p < loadmodel->brush.num_leafs)
2603 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2606 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2607 // map it to the solid leaf
2608 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2614 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2617 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2623 in = (dleaf_t *)(mod_base + l->fileofs);
2624 if (l->filelen % sizeof(*in))
2625 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2626 count = l->filelen / sizeof(*in);
2627 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2629 loadmodel->brush.data_leafs = out;
2630 loadmodel->brush.num_leafs = count;
2631 // get visleafs from the submodel data
2632 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2633 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2634 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2635 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2637 for ( i=0 ; i<count ; i++, in++, out++)
2639 for (j=0 ; j<3 ; j++)
2641 out->mins[j] = LittleShort(in->mins[j]);
2642 out->maxs[j] = LittleShort(in->maxs[j]);
2645 // FIXME: this function could really benefit from some error checking
2647 out->contents = LittleLong(in->contents);
2649 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2650 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2651 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2653 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", (int)(out->firstleafsurface - loadmodel->brush.data_leafsurfaces), (int)(out->firstleafsurface + out->numleafsurfaces - loadmodel->brush.data_leafsurfaces), 0, loadmodel->brush.num_leafsurfaces);
2654 out->firstleafsurface = NULL;
2655 out->numleafsurfaces = 0;
2658 out->clusterindex = i - 1;
2659 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2660 out->clusterindex = -1;
2662 p = LittleLong(in->visofs);
2663 // ignore visofs errors on leaf 0 (solid)
2664 if (p >= 0 && out->clusterindex >= 0)
2666 if (p >= loadmodel->brushq1.num_compressedpvs)
2667 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2669 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);
2672 for (j = 0;j < 4;j++)
2673 out->ambient_sound_level[j] = in->ambient_level[j];
2675 // FIXME: Insert caustics here
2679 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2683 const unsigned char *pvs;
2684 // if there's no vis data, assume supported (because everything is visible all the time)
2685 if (!loadmodel->brush.data_pvsclusters)
2687 // check all liquid leafs to see if they can see into empty leafs, if any
2688 // can we can assume this map supports r_wateralpha
2689 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2691 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2693 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2694 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2695 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2702 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2709 in = (dclipnode_t *)(mod_base + l->fileofs);
2710 if (l->filelen % sizeof(*in))
2711 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2712 count = l->filelen / sizeof(*in);
2713 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2715 loadmodel->brushq1.clipnodes = out;
2716 loadmodel->brushq1.numclipnodes = count;
2718 for (i = 1; i < MAX_MAP_HULLS; i++)
2720 hull = &loadmodel->brushq1.hulls[i];
2721 hull->clipnodes = out;
2722 hull->firstclipnode = 0;
2723 hull->lastclipnode = count-1;
2724 hull->planes = loadmodel->brush.data_planes;
2725 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2726 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2727 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2728 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2729 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2730 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2731 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2734 for (i=0 ; i<count ; i++, out++, in++)
2736 out->planenum = LittleLong(in->planenum);
2737 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2738 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2739 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2740 if (out->children[0] >= count)
2741 out->children[0] -= 65536;
2742 if (out->children[1] >= count)
2743 out->children[1] -= 65536;
2744 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2745 Host_Error("Corrupt clipping hull(out of range planenum)");
2749 //Duplicate the drawing hull structure as a clipping hull
2750 static void Mod_Q1BSP_MakeHull0(void)
2757 hull = &loadmodel->brushq1.hulls[0];
2759 in = loadmodel->brush.data_nodes;
2760 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2762 hull->clipnodes = out;
2763 hull->firstclipnode = 0;
2764 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2765 hull->planes = loadmodel->brush.data_planes;
2767 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2769 out->planenum = in->plane - loadmodel->brush.data_planes;
2770 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2771 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2775 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2780 in = (short *)(mod_base + l->fileofs);
2781 if (l->filelen % sizeof(*in))
2782 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2783 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2784 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2786 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2788 j = (unsigned short) LittleShort(in[i]);
2789 if (j >= loadmodel->num_surfaces)
2790 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2791 loadmodel->brush.data_leafsurfaces[i] = j;
2795 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2800 in = (int *)(mod_base + l->fileofs);
2801 if (l->filelen % sizeof(*in))
2802 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2803 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2804 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2806 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2807 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2811 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2817 in = (dplane_t *)(mod_base + l->fileofs);
2818 if (l->filelen % sizeof(*in))
2819 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2821 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2822 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2824 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2826 out->normal[0] = LittleFloat(in->normal[0]);
2827 out->normal[1] = LittleFloat(in->normal[1]);
2828 out->normal[2] = LittleFloat(in->normal[2]);
2829 out->dist = LittleFloat(in->dist);
2835 static void Mod_Q1BSP_LoadMapBrushes(void)
2839 int submodel, numbrushes;
2840 qboolean firstbrush;
2841 char *text, *maptext;
2842 char mapfilename[MAX_QPATH];
2843 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2844 strlcat (mapfilename, ".map", sizeof (mapfilename));
2845 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2849 if (!COM_ParseToken_Simple(&data, false, false))
2854 if (!COM_ParseToken_Simple(&data, false, false))
2856 if (com_token[0] != '{')
2862 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2865 if (!COM_ParseToken_Simple(&data, false, false))
2867 if (com_token[0] == '}')
2868 break; // end of entity
2869 if (com_token[0] == '{')
2876 if (submodel > loadmodel->brush.numsubmodels)
2878 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2882 model = loadmodel->brush.submodels[submodel];
2889 if (!COM_ParseToken_Simple(&data, false, false))
2891 if (com_token[0] == '}')
2892 break; // end of brush
2893 // each brush face should be this format:
2894 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2895 // FIXME: support hl .map format
2896 for (pointnum = 0;pointnum < 3;pointnum++)
2898 COM_ParseToken_Simple(&data, false, false);
2899 for (componentnum = 0;componentnum < 3;componentnum++)
2901 COM_ParseToken_Simple(&data, false, false);
2902 point[pointnum][componentnum] = atof(com_token);
2904 COM_ParseToken_Simple(&data, false, false);
2906 COM_ParseToken_Simple(&data, false, false);
2907 strlcpy(facetexture, com_token, sizeof(facetexture));
2908 COM_ParseToken_Simple(&data, false, false);
2909 //scroll_s = atof(com_token);
2910 COM_ParseToken_Simple(&data, false, false);
2911 //scroll_t = atof(com_token);
2912 COM_ParseToken_Simple(&data, false, false);
2913 //rotate = atof(com_token);
2914 COM_ParseToken_Simple(&data, false, false);
2915 //scale_s = atof(com_token);
2916 COM_ParseToken_Simple(&data, false, false);
2917 //scale_t = atof(com_token);
2918 TriangleNormal(point[0], point[1], point[2], planenormal);
2919 VectorNormalizeDouble(planenormal);
2920 planedist = DotProduct(point[0], planenormal);
2921 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2931 #define MAX_PORTALPOINTS 64
2933 typedef struct portal_s
2936 mnode_t *nodes[2]; // [0] = front side of plane
2937 struct portal_s *next[2];
2939 double points[3*MAX_PORTALPOINTS];
2940 struct portal_s *chain; // all portals are linked into a list
2944 static memexpandablearray_t portalarray;
2946 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2948 // process only nodes (leafs already had their box calculated)
2952 // calculate children first
2953 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2954 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2956 // make combined bounding box from children
2957 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2958 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2959 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2960 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2961 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2962 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2965 static void Mod_Q1BSP_FinalizePortals(void)
2967 int i, j, numportals, numpoints, portalindex, portalrange = Mem_ExpandableArray_IndexRange(&portalarray);
2971 mleaf_t *leaf, *endleaf;
2973 // tally up portal and point counts and recalculate bounding boxes for all
2974 // leafs (because qbsp is very sloppy)
2975 leaf = loadmodel->brush.data_leafs;
2976 endleaf = leaf + loadmodel->brush.num_leafs;
2977 if (mod_recalculatenodeboxes.integer)
2979 for (;leaf < endleaf;leaf++)
2981 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2982 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2987 for (portalindex = 0;portalindex < portalrange;portalindex++)
2989 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
2992 // note: this check must match the one below or it will usually corrupt memory
2993 // 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
2994 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2997 numpoints += p->numpoints * 2;
3000 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3001 loadmodel->brush.num_portals = numportals;
3002 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3003 loadmodel->brush.num_portalpoints = numpoints;
3004 // clear all leaf portal chains
3005 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3006 loadmodel->brush.data_leafs[i].portals = NULL;
3007 // process all portals in the global portal chain, while freeing them
3008 portal = loadmodel->brush.data_portals;
3009 point = loadmodel->brush.data_portalpoints;
3010 for (portalindex = 0;portalindex < portalrange;portalindex++)
3012 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3015 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3017 // note: this check must match the one above or it will usually corrupt memory
3018 // 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
3019 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3021 // first make the back to front portal(forward portal)
3022 portal->points = point;
3023 portal->numpoints = p->numpoints;
3024 portal->plane.dist = p->plane.dist;
3025 VectorCopy(p->plane.normal, portal->plane.normal);
3026 portal->here = (mleaf_t *)p->nodes[1];
3027 portal->past = (mleaf_t *)p->nodes[0];
3029 for (j = 0;j < portal->numpoints;j++)
3031 VectorCopy(p->points + j*3, point->position);
3034 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3035 PlaneClassify(&portal->plane);
3037 // link into leaf's portal chain
3038 portal->next = portal->here->portals;
3039 portal->here->portals = portal;
3041 // advance to next portal
3044 // then make the front to back portal(backward portal)
3045 portal->points = point;
3046 portal->numpoints = p->numpoints;
3047 portal->plane.dist = -p->plane.dist;
3048 VectorNegate(p->plane.normal, portal->plane.normal);
3049 portal->here = (mleaf_t *)p->nodes[0];
3050 portal->past = (mleaf_t *)p->nodes[1];
3052 for (j = portal->numpoints - 1;j >= 0;j--)
3054 VectorCopy(p->points + j*3, point->position);
3057 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3058 PlaneClassify(&portal->plane);
3060 // link into leaf's portal chain
3061 portal->next = portal->here->portals;
3062 portal->here->portals = portal;
3064 // advance to next portal
3067 // add the portal's polygon points to the leaf bounding boxes
3068 if (mod_recalculatenodeboxes.integer)
3070 for (i = 0;i < 2;i++)
3072 leaf = (mleaf_t *)p->nodes[i];
3073 for (j = 0;j < p->numpoints;j++)
3075 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3076 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3077 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3078 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3079 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3080 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3086 // now recalculate the node bounding boxes from the leafs
3087 if (mod_recalculatenodeboxes.integer)
3088 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3096 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3099 Host_Error("AddPortalToNodes: NULL front node");
3101 Host_Error("AddPortalToNodes: NULL back node");
3102 if (p->nodes[0] || p->nodes[1])
3103 Host_Error("AddPortalToNodes: already included");
3104 // 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
3106 p->nodes[0] = front;
3107 p->next[0] = (portal_t *)front->portals;
3108 front->portals = (mportal_t *)p;
3111 p->next[1] = (portal_t *)back->portals;
3112 back->portals = (mportal_t *)p;
3117 RemovePortalFromNode
3120 static void RemovePortalFromNodes(portal_t *portal)
3124 void **portalpointer;
3126 for (i = 0;i < 2;i++)
3128 node = portal->nodes[i];
3130 portalpointer = (void **) &node->portals;
3133 t = (portal_t *)*portalpointer;
3135 Host_Error("RemovePortalFromNodes: portal not in leaf");
3139 if (portal->nodes[0] == node)
3141 *portalpointer = portal->next[0];
3142 portal->nodes[0] = NULL;
3144 else if (portal->nodes[1] == node)
3146 *portalpointer = portal->next[1];
3147 portal->nodes[1] = NULL;
3150 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3154 if (t->nodes[0] == node)
3155 portalpointer = (void **) &t->next[0];
3156 else if (t->nodes[1] == node)
3157 portalpointer = (void **) &t->next[1];
3159 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3164 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3165 static double *portalpointsbuffer;
3166 static int portalpointsbufferoffset;
3167 static int portalpointsbuffersize;
3168 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3171 mnode_t *front, *back, *other_node;
3172 mplane_t clipplane, *plane;
3173 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3174 int numfrontpoints, numbackpoints;
3175 double *frontpoints, *backpoints;
3177 // if a leaf, we're done
3181 // get some space for our clipping operations to use
3182 if (portalpointsbuffersize < portalpointsbufferoffset + 6*MAX_PORTALPOINTS)
3184 portalpointsbuffersize = portalpointsbufferoffset * 2;
3185 portalpointsbuffer = (double *)Mem_Realloc(loadmodel->mempool, portalpointsbuffer, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3187 frontpoints = portalpointsbuffer + portalpointsbufferoffset;
3188 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3189 backpoints = portalpointsbuffer + portalpointsbufferoffset;
3190 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3192 plane = node->plane;
3194 front = node->children[0];
3195 back = node->children[1];
3197 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3199 // create the new portal by generating a polygon for the node plane,
3200 // and clipping it by all of the other portals(which came from nodes above this one)
3201 nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3202 nodeportal->plane = *plane;
3204 // 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)
3205 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);
3206 nodeportal->numpoints = 4;
3207 side = 0; // shut up compiler warning
3208 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3210 clipplane = portal->plane;
3211 if (portal->nodes[0] == portal->nodes[1])
3212 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3213 if (portal->nodes[0] == node)
3215 else if (portal->nodes[1] == node)
3217 clipplane.dist = -clipplane.dist;
3218 VectorNegate(clipplane.normal, clipplane.normal);
3222 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3224 for (i = 0;i < nodeportal->numpoints*3;i++)
3225 frontpoints[i] = nodeportal->points[i];
3226 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);
3227 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3231 if (nodeportal->numpoints < 3)
3233 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3234 nodeportal->numpoints = 0;
3236 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3238 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3239 nodeportal->numpoints = 0;
3242 AddPortalToNodes(nodeportal, front, back);
3244 // split the portals of this node along this node's plane and assign them to the children of this node
3245 // (migrating the portals downward through the tree)
3246 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3248 if (portal->nodes[0] == portal->nodes[1])
3249 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3250 if (portal->nodes[0] == node)
3252 else if (portal->nodes[1] == node)
3255 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3256 nextportal = portal->next[side];
3257 if (!portal->numpoints)
3260 other_node = portal->nodes[!side];
3261 RemovePortalFromNodes(portal);
3263 // cut the portal into two portals, one on each side of the node plane
3264 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);
3266 if (!numfrontpoints)
3269 AddPortalToNodes(portal, back, other_node);
3271 AddPortalToNodes(portal, other_node, back);
3277 AddPortalToNodes(portal, front, other_node);
3279 AddPortalToNodes(portal, other_node, front);
3283 // the portal is split
3284 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3285 temp = splitportal->chain;
3286 *splitportal = *portal;
3287 splitportal->chain = temp;
3288 for (i = 0;i < numbackpoints*3;i++)
3289 splitportal->points[i] = backpoints[i];
3290 splitportal->numpoints = numbackpoints;
3291 for (i = 0;i < numfrontpoints*3;i++)
3292 portal->points[i] = frontpoints[i];
3293 portal->numpoints = numfrontpoints;
3297 AddPortalToNodes(portal, front, other_node);
3298 AddPortalToNodes(splitportal, back, other_node);
3302 AddPortalToNodes(portal, other_node, front);
3303 AddPortalToNodes(splitportal, other_node, back);
3307 Mod_Q1BSP_RecursiveNodePortals(front);
3308 Mod_Q1BSP_RecursiveNodePortals(back);
3310 portalpointsbufferoffset -= 6*MAX_PORTALPOINTS;
3313 static void Mod_Q1BSP_MakePortals(void)
3315 Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3316 portalpointsbufferoffset = 0;
3317 portalpointsbuffersize = 6*MAX_PORTALPOINTS*128;
3318 portalpointsbuffer = (double *)Mem_Alloc(loadmodel->mempool, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3319 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3320 Mem_Free(portalpointsbuffer);
3321 portalpointsbuffer = NULL;
3322 portalpointsbufferoffset = 0;
3323 portalpointsbuffersize = 0;
3324 Mod_Q1BSP_FinalizePortals();
3325 Mem_ExpandableArray_FreeArray(&portalarray);
3328 //Returns PVS data for a given point
3329 //(note: can return NULL)
3330 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3333 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3335 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3336 if (((mleaf_t *)node)->clusterindex >= 0)
3337 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3342 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)
3346 float d = PlaneDiff(org, node->plane);
3348 node = node->children[0];
3349 else if (d < -radius)
3350 node = node->children[1];
3353 // go down both sides
3354 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3355 node = node->children[1];
3358 // if this leaf is in a cluster, accumulate the pvs bits
3359 if (((mleaf_t *)node)->clusterindex >= 0)
3362 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3363 for (i = 0;i < pvsbytes;i++)
3364 pvsbuffer[i] |= pvs[i];
3368 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3369 //of the given point.
3370 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3372 int bytes = model->brush.num_pvsclusterbytes;
3373 bytes = min(bytes, pvsbufferlength);
3374 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3376 memset(pvsbuffer, 0xFF, bytes);
3380 memset(pvsbuffer, 0, bytes);
3381 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3385 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3390 VectorSubtract(inmaxs, inmins, size);
3391 if (cmodel->brush.ishlbsp)
3394 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3395 else if (size[0] <= 32)
3397 if (size[2] < 54) // pick the nearest of 36 or 72
3398 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3400 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3403 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3408 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3409 else if (size[0] <= 32)
3410 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3412 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3414 VectorCopy(inmins, outmins);
3415 VectorAdd(inmins, hull->clip_size, outmaxs);
3418 static int Mod_Q1BSP_CreateShadowMesh(dp_model_t *mod)
3421 int numshadowmeshtriangles = 0;
3422 msurface_t *surface;
3423 if (cls.state == ca_dedicated)
3425 // make a single combined shadow mesh to allow optimized shadow volume creation
3427 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3429 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3430 numshadowmeshtriangles += surface->num_triangles;
3432 mod->brush.shadowmesh = Mod_ShadowMesh_Begin(mod->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3433 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3434 if (surface->num_triangles > 0)
3435 Mod_ShadowMesh_AddMesh(mod->mempool, mod->brush.shadowmesh, NULL, NULL, NULL, mod->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (mod->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
3436 mod->brush.shadowmesh = Mod_ShadowMesh_Finish(mod->mempool, mod->brush.shadowmesh, false, true, false);
3437 if (mod->brush.shadowmesh)
3438 Mod_BuildTriangleNeighbors(mod->brush.shadowmesh->neighbor3i, mod->brush.shadowmesh->element3i, mod->brush.shadowmesh->numtriangles);
3440 return numshadowmeshtriangles;
3443 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3448 float dist, modelyawradius, modelradius;
3449 msurface_t *surface;
3450 hullinfo_t hullinfo;
3451 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3452 model_brush_lightstyleinfo_t styleinfo[256];
3453 unsigned char *datapointer;
3455 mod->modeldatatypestring = "Q1BSP";
3457 mod->type = mod_brushq1;
3459 header = (dheader_t *)buffer;
3461 i = LittleLong(header->version);
3462 if (i != BSPVERSION && i != 30)
3463 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3464 mod->brush.ishlbsp = i == 30;
3466 // fill in hull info
3467 VectorClear (hullinfo.hullsizes[0][0]);
3468 VectorClear (hullinfo.hullsizes[0][1]);
3469 if (mod->brush.ishlbsp)
3471 mod->modeldatatypestring = "HLBSP";
3473 hullinfo.filehulls = 4;
3474 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3475 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3476 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3477 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3478 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3479 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3483 hullinfo.filehulls = 4;
3484 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3485 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3486 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3487 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3491 mod_base = (unsigned char*)buffer;
3492 for (i = 0; i < HEADER_LUMPS; i++)
3494 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3495 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3498 mod->soundfromcenter = true;
3499 mod->TraceBox = Mod_Q1BSP_TraceBox;
3500 mod->TraceLine = Mod_Q1BSP_TraceLine;
3501 mod->TracePoint = Mod_Q1BSP_TracePoint;
3502 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3503 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3504 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3505 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3506 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3507 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3508 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3509 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3510 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3511 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3512 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3513 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3514 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3515 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3516 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3517 mod->Draw = R_Q1BSP_Draw;
3518 mod->DrawDepth = R_Q1BSP_DrawDepth;
3519 mod->DrawDebug = R_Q1BSP_DrawDebug;
3520 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3521 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3522 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3523 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3524 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3525 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3526 mod->DrawLight = R_Q1BSP_DrawLight;
3530 mod->brush.qw_md4sum = 0;
3531 mod->brush.qw_md4sum2 = 0;
3532 for (i = 0;i < HEADER_LUMPS;i++)
3535 if (i == LUMP_ENTITIES)
3537 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3538 mod->brush.qw_md4sum ^= LittleLong(temp);
3539 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3541 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3542 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3545 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3546 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3547 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3548 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3549 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3550 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3551 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3552 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3553 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3554 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3555 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3556 // load submodels before leafs because they contain the number of vis leafs
3557 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3558 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3559 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3560 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3562 // check if the map supports transparent water rendering
3563 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3565 if (mod->brushq1.data_compressedpvs)
3566 Mem_Free(mod->brushq1.data_compressedpvs);
3567 mod->brushq1.data_compressedpvs = NULL;
3568 mod->brushq1.num_compressedpvs = 0;
3570 Mod_Q1BSP_MakeHull0();
3571 Mod_Q1BSP_MakePortals();
3573 mod->numframes = 2; // regular and alternate animation
3576 // make a single combined shadow mesh to allow optimized shadow volume creation
3577 Mod_Q1BSP_CreateShadowMesh(loadmodel);
3579 if (loadmodel->brush.numsubmodels)
3580 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3582 // LordHavoc: to clear the fog around the original quake submodel code, I
3584 // first of all, some background info on the submodels:
3585 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3586 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3587 // now the weird for loop itself:
3588 // the loop functions in an odd way, on each iteration it sets up the
3589 // current 'mod' model (which despite the confusing code IS the model of
3590 // the number i), at the end of the loop it duplicates the model to become
3591 // the next submodel, and loops back to set up the new submodel.
3593 // LordHavoc: now the explanation of my sane way (which works identically):
3594 // set up the world model, then on each submodel copy from the world model
3595 // and set up the submodel with the respective model info.
3596 totalstylesurfaces = 0;
3598 for (i = 0;i < mod->brush.numsubmodels;i++)
3600 memset(stylecounts, 0, sizeof(stylecounts));
3601 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3603 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3604 for (j = 0;j < MAXLIGHTMAPS;j++)
3605 stylecounts[surface->lightmapinfo->styles[j]]++;
3607 for (k = 0;k < 255;k++)
3611 totalstylesurfaces += stylecounts[k];
3614 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3615 for (i = 0;i < mod->brush.numsubmodels;i++)
3617 // LordHavoc: this code was originally at the end of this loop, but
3618 // has been transformed to something more readable at the start here.
3623 // duplicate the basic information
3624 dpsnprintf(name, sizeof(name), "*%i", i);
3625 mod = Mod_FindName(name, loadmodel->name);
3626 // copy the base model to this one
3628 // rename the clone back to its proper name
3629 strlcpy(mod->name, name, sizeof(mod->name));
3630 mod->brush.parentmodel = loadmodel;
3631 // textures and memory belong to the main model
3632 mod->texturepool = NULL;
3633 mod->mempool = NULL;
3634 mod->brush.GetPVS = NULL;
3635 mod->brush.FatPVS = NULL;
3636 mod->brush.BoxTouchingPVS = NULL;
3637 mod->brush.BoxTouchingLeafPVS = NULL;
3638 mod->brush.BoxTouchingVisibleLeafs = NULL;
3639 mod->brush.FindBoxClusters = NULL;
3640 mod->brush.LightPoint = NULL;
3641 mod->brush.AmbientSoundLevelsForPoint = NULL;
3644 mod->brush.submodel = i;
3646 if (loadmodel->brush.submodels)
3647 loadmodel->brush.submodels[i] = mod;
3649 bm = &mod->brushq1.submodels[i];
3651 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3652 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3654 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3655 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3658 mod->firstmodelsurface = bm->firstface;
3659 mod->nummodelsurfaces = bm->numfaces;
3661 // set node/leaf parents for this submodel
3662 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3664 // make the model surface list (used by shadowing/lighting)
3665 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3666 Mod_MakeSortedSurfaces(mod);
3668 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3669 // (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)
3670 VectorCopy(bm->mins, mod->normalmins);
3671 VectorCopy(bm->maxs, mod->normalmaxs);
3672 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3673 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3674 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3675 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3676 modelradius = modelyawradius + modelradius * modelradius;
3677 modelyawradius = sqrt(modelyawradius);
3678 modelradius = sqrt(modelradius);
3679 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3680 mod->yawmins[2] = mod->normalmins[2];
3681 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3682 mod->yawmaxs[2] = mod->normalmaxs[2];
3683 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3684 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3685 mod->radius = modelradius;
3686 mod->radius2 = modelradius * modelradius;
3688 // this gets altered below if sky or water is used
3689 mod->DrawSky = NULL;
3690 mod->DrawAddWaterPlanes = NULL;
3692 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3693 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3694 if (mod->nummodelsurfaces)
3696 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3697 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3699 if (j < mod->nummodelsurfaces)
3700 mod->DrawSky = R_Q1BSP_DrawSky;
3702 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3703 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
3705 if (j < mod->nummodelsurfaces)
3706 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3708 // build lightstyle update chains
3709 // (used to rapidly mark lightmapupdateflags on many surfaces
3710 // when d_lightstylevalue changes)
3711 memset(stylecounts, 0, sizeof(stylecounts));
3712 for (k = 0;k < mod->nummodelsurfaces;k++)
3714 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3715 for (j = 0;j < MAXLIGHTMAPS;j++)
3716 stylecounts[surface->lightmapinfo->styles[j]]++;
3718 mod->brushq1.num_lightstyles = 0;
3719 for (k = 0;k < 255;k++)
3723 styleinfo[mod->brushq1.num_lightstyles].style = k;
3724 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3725 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3726 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3727 remapstyles[k] = mod->brushq1.num_lightstyles;
3728 mod->brushq1.num_lightstyles++;
3731 for (k = 0;k < mod->nummodelsurfaces;k++)
3733 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3734 for (j = 0;j < MAXLIGHTMAPS;j++)
3736 if (surface->lightmapinfo->styles[j] != 255)
3738 int r = remapstyles[surface->lightmapinfo->styles[j]];
3739 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3743 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3744 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3748 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3749 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3751 //mod->brushq1.num_visleafs = bm->visleafs;
3753 if (mod_q1bsp_polygoncollisions.integer)
3755 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
3756 // point traces and contents checks still use the bsp tree
3757 mod->TraceLine = Mod_CollisionBIH_TraceLine;
3758 mod->TraceBox = Mod_CollisionBIH_TraceBox;
3759 mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
3762 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
3764 // generate VBOs and other shared data before cloning submodels
3768 Mod_Q1BSP_LoadMapBrushes();
3769 //Mod_Q1BSP_ProcessLightList();
3773 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);
3776 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3780 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3787 in = (void *)(mod_base + l->fileofs);
3788 if (l->filelen % sizeof(*in))
3789 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3790 count = l->filelen / sizeof(*in);
3791 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3794 loadmodel->num = count;
3796 for (i = 0;i < count;i++, in++, out++)
3802 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3809 in = (void *)(mod_base + l->fileofs);
3810 if (l->filelen % sizeof(*in))
3811 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3812 count = l->filelen / sizeof(*in);
3813 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3816 loadmodel->num = count;
3818 for (i = 0;i < count;i++, in++, out++)
3824 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3831 in = (void *)(mod_base + l->fileofs);
3832 if (l->filelen % sizeof(*in))
3833 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3834 count = l->filelen / sizeof(*in);
3835 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3838 loadmodel->num = count;
3840 for (i = 0;i < count;i++, in++, out++)
3846 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3853 in = (void *)(mod_base + l->fileofs);
3854 if (l->filelen % sizeof(*in))
3855 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3856 count = l->filelen / sizeof(*in);
3857 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3860 loadmodel->num = count;
3862 for (i = 0;i < count;i++, in++, out++)
3868 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3875 in = (void *)(mod_base + l->fileofs);
3876 if (l->filelen % sizeof(*in))
3877 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3878 count = l->filelen / sizeof(*in);
3879 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3882 loadmodel->num = count;
3884 for (i = 0;i < count;i++, in++, out++)
3890 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3897 in = (void *)(mod_base + l->fileofs);
3898 if (l->filelen % sizeof(*in))
3899 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3900 count = l->filelen / sizeof(*in);
3901 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3904 loadmodel->num = count;
3906 for (i = 0;i < count;i++, in++, out++)
3912 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3919 in = (void *)(mod_base + l->fileofs);
3920 if (l->filelen % sizeof(*in))
3921 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3922 count = l->filelen / sizeof(*in);
3923 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3926 loadmodel->num = count;
3928 for (i = 0;i < count;i++, in++, out++)
3934 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3941 in = (void *)(mod_base + l->fileofs);
3942 if (l->filelen % sizeof(*in))
3943 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3944 count = l->filelen / sizeof(*in);
3945 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3948 loadmodel->num = count;
3950 for (i = 0;i < count;i++, in++, out++)
3956 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3963 in = (void *)(mod_base + l->fileofs);
3964 if (l->filelen % sizeof(*in))
3965 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3966 count = l->filelen / sizeof(*in);
3967 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3970 loadmodel->num = count;
3972 for (i = 0;i < count;i++, in++, out++)
3978 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3985 in = (void *)(mod_base + l->fileofs);
3986 if (l->filelen % sizeof(*in))
3987 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3988 count = l->filelen / sizeof(*in);
3989 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3992 loadmodel->num = count;
3994 for (i = 0;i < count;i++, in++, out++)
4000 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4007 in = (void *)(mod_base + l->fileofs);
4008 if (l->filelen % sizeof(*in))
4009 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4010 count = l->filelen / sizeof(*in);
4011 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4014 loadmodel->num = count;
4016 for (i = 0;i < count;i++, in++, out++)
4022 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4029 in = (void *)(mod_base + l->fileofs);
4030 if (l->filelen % sizeof(*in))
4031 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4032 count = l->filelen / sizeof(*in);
4033 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4036 loadmodel->num = count;
4038 for (i = 0;i < count;i++, in++, out++)
4044 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4051 in = (void *)(mod_base + l->fileofs);
4052 if (l->filelen % sizeof(*in))
4053 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4054 count = l->filelen / sizeof(*in);
4055 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4058 loadmodel->num = count;
4060 for (i = 0;i < count;i++, in++, out++)
4066 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4073 in = (void *)(mod_base + l->fileofs);
4074 if (l->filelen % sizeof(*in))
4075 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4076 count = l->filelen / sizeof(*in);
4077 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4080 loadmodel->num = count;
4082 for (i = 0;i < count;i++, in++, out++)
4088 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4095 in = (void *)(mod_base + l->fileofs);
4096 if (l->filelen % sizeof(*in))
4097 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4098 count = l->filelen / sizeof(*in);
4099 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4102 loadmodel->num = count;
4104 for (i = 0;i < count;i++, in++, out++)
4110 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4117 in = (void *)(mod_base + l->fileofs);
4118 if (l->filelen % sizeof(*in))
4119 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4120 count = l->filelen / sizeof(*in);
4121 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4124 loadmodel->num = count;
4126 for (i = 0;i < count;i++, in++, out++)
4132 static void Mod_Q2BSP_LoadModels(lump_t *l)
4139 in = (void *)(mod_base + l->fileofs);
4140 if (l->filelen % sizeof(*in))
4141 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4142 count = l->filelen / sizeof(*in);
4143 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4146 loadmodel->num = count;
4148 for (i = 0;i < count;i++, in++, out++)
4154 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4157 q2dheader_t *header;
4159 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4161 mod->modeldatatypestring = "Q2BSP";
4163 mod->type = mod_brushq2;
4165 header = (q2dheader_t *)buffer;
4167 i = LittleLong(header->version);
4168 if (i != Q2BSPVERSION)
4169 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4171 mod_base = (unsigned char *)header;
4173 // swap all the lumps
4174 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4175 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4177 mod->brush.qw_md4sum = 0;
4178 mod->brush.qw_md4sum2 = 0;
4179 for (i = 0;i < Q2HEADER_LUMPS;i++)
4181 if (i == Q2LUMP_ENTITIES)
4183 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4184 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4186 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4189 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4190 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4191 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4192 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4193 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4194 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4195 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4196 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4197 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4198 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4199 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4200 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4201 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4202 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4203 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4204 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4205 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4206 // LordHavoc: must go last because this makes the submodels
4207 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4210 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4211 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4213 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4216 char key[128], value[MAX_INPUTLINE];
4218 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4219 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4220 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4223 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4224 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4225 loadmodel->brush.entities[l->filelen] = 0;
4226 data = loadmodel->brush.entities;
4227 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4228 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4229 loadmodel->brushq3.deluxemapping = false;
4230 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4234 if (!COM_ParseToken_Simple(&data, false, false))
4236 if (com_token[0] == '}')
4237 break; // end of worldspawn
4238 if (com_token[0] == '_')
4239 strlcpy(key, com_token + 1, sizeof(key));
4241 strlcpy(key, com_token, sizeof(key));
4242 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4243 key[strlen(key)-1] = 0;
4244 if (!COM_ParseToken_Simple(&data, false, false))
4246 strlcpy(value, com_token, sizeof(value));
4247 if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
4249 #if _MSC_VER >= 1400
4250 #define sscanf sscanf_s
4253 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4254 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4256 VectorSet(v, 64, 64, 128);
4257 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
4258 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]);
4259 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
4260 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4263 else if (!strcmp("deluxeMaps", key))
4265 if (!strcmp(com_token, "1"))
4267 loadmodel->brushq3.deluxemapping = true;
4268 loadmodel->brushq3.deluxemapping_modelspace = true;
4270 else if (!strcmp(com_token, "2"))
4272 loadmodel->brushq3.deluxemapping = true;
4273 loadmodel->brushq3.deluxemapping_modelspace = false;
4280 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4286 in = (q3dtexture_t *)(mod_base + l->fileofs);
4287 if (l->filelen % sizeof(*in))
4288 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4289 count = l->filelen / sizeof(*in);
4290 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4292 loadmodel->data_textures = out;
4293 loadmodel->num_textures = count;
4294 loadmodel->num_texturesperskin = loadmodel->num_textures;
4296 for (i = 0;i < count;i++)
4298 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4299 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4300 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4301 Mod_LoadTextureFromQ3Shader(out + i, out[i].name, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
4302 // restore the surfaceflags and supercontents
4303 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4304 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4308 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4314 in = (q3dplane_t *)(mod_base + l->fileofs);
4315 if (l->filelen % sizeof(*in))
4316 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4317 count = l->filelen / sizeof(*in);
4318 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4320 loadmodel->brush.data_planes = out;
4321 loadmodel->brush.num_planes = count;
4323 for (i = 0;i < count;i++, in++, out++)
4325 out->normal[0] = LittleFloat(in->normal[0]);
4326 out->normal[1] = LittleFloat(in->normal[1]);
4327 out->normal[2] = LittleFloat(in->normal[2]);
4328 out->dist = LittleFloat(in->dist);
4333 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4336 q3mbrushside_t *out;
4339 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4340 if (l->filelen % sizeof(*in))
4341 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4342 count = l->filelen / sizeof(*in);
4343 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4345 loadmodel->brush.data_brushsides = out;
4346 loadmodel->brush.num_brushsides = count;
4348 for (i = 0;i < count;i++, in++, out++)
4350 n = LittleLong(in->planeindex);
4351 if (n < 0 || n >= loadmodel->brush.num_planes)
4352 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4353 out->plane = loadmodel->brush.data_planes + n;
4354 n = LittleLong(in->textureindex);
4355 if (n < 0 || n >= loadmodel->num_textures)
4356 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4357 out->texture = loadmodel->data_textures + n;
4361 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4363 q3dbrushside_ig_t *in;
4364 q3mbrushside_t *out;
4367 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4368 if (l->filelen % sizeof(*in))
4369 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4370 count = l->filelen / sizeof(*in);
4371 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4373 loadmodel->brush.data_brushsides = out;
4374 loadmodel->brush.num_brushsides = count;
4376 for (i = 0;i < count;i++, in++, out++)
4378 n = LittleLong(in->planeindex);
4379 if (n < 0 || n >= loadmodel->brush.num_planes)
4380 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4381 out->plane = loadmodel->brush.data_planes + n;
4382 n = LittleLong(in->textureindex);
4383 if (n < 0 || n >= loadmodel->num_textures)
4384 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4385 out->texture = loadmodel->data_textures + n;
4389 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4393 int i, j, n, c, count, maxplanes, q3surfaceflags;
4394 colplanef_t *planes;
4396 in = (q3dbrush_t *)(mod_base + l->fileofs);
4397 if (l->filelen % sizeof(*in))
4398 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4399 count = l->filelen / sizeof(*in);
4400 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4402 loadmodel->brush.data_brushes = out;
4403 loadmodel->brush.num_brushes = count;
4408 for (i = 0;i < count;i++, in++, out++)
4410 n = LittleLong(in->firstbrushside);
4411 c = LittleLong(in->numbrushsides);
4412 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4413 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4414 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4415 out->numbrushsides = c;
4416 n = LittleLong(in->textureindex);
4417 if (n < 0 || n >= loadmodel->num_textures)
4418 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4419 out->texture = loadmodel->data_textures + n;
4421 // make a list of mplane_t structs to construct a colbrush from
4422 if (maxplanes < out->numbrushsides)
4424 maxplanes = out->numbrushsides;
4427 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4430 for (j = 0;j < out->numbrushsides;j++)
4432 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4433 planes[j].dist = out->firstbrushside[j].plane->dist;
4434 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4435 planes[j].texture = out->firstbrushside[j].texture;
4436 q3surfaceflags |= planes[j].q3surfaceflags;
4438 // make the colbrush from the planes
4439 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4441 // this whole loop can take a while (e.g. on redstarrepublic4)
4442 CL_KeepaliveMessage(false);
4448 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4454 in = (q3deffect_t *)(mod_base + l->fileofs);
4455 if (l->filelen % sizeof(*in))
4456 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4457 count = l->filelen / sizeof(*in);
4458 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4460 loadmodel->brushq3.data_effects = out;
4461 loadmodel->brushq3.num_effects = count;
4463 for (i = 0;i < count;i++, in++, out++)
4465 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4466 n = LittleLong(in->brushindex);
4467 if (n >= loadmodel->brush.num_brushes)
4469 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4472 out->brushindex = n;
4473 out->unknown = LittleLong(in->unknown);
4477 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4482 in = (q3dvertex_t *)(mod_base + l->fileofs);
4483 if (l->filelen % sizeof(*in))
4484 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4485 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4486 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4487 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4488 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4489 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4490 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4492 for (i = 0;i < count;i++, in++)
4494 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4495 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4496 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4497 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4498 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4499 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4500 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4501 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4502 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4503 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4504 // svector/tvector are calculated later in face loading
4505 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4506 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4507 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4508 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4512 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4518 in = (int *)(mod_base + l->fileofs);
4519 if (l->filelen % sizeof(int[3]))
4520 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4521 count = l->filelen / sizeof(*in);
4523 if(!loadmodel->brushq3.num_vertices)
4526 Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
4527 loadmodel->brushq3.num_triangles = 0;
4531 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4532 loadmodel->brushq3.num_triangles = count / 3;
4533 loadmodel->brushq3.data_element3i = out;
4535 for (i = 0;i < count;i++, in++, out++)
4537 *out = LittleLong(*in);
4538 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4540 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4546 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4548 q3dlightmap_t *input_pointer;
4566 int mergedrowsxcolumns;
4571 unsigned char *mergedpixels;
4572 unsigned char *mergeddeluxepixels;
4573 unsigned char *mergebuf;
4574 char mapname[MAX_QPATH];
4576 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4578 // defaults for q3bsp
4585 loadmodel->brushq3.lightmapsize = 128;
4587 if (cls.state == ca_dedicated)
4590 if(mod_q3bsp_nolightmaps.integer)
4596 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4597 if (developer_loading.integer)
4598 Con_Printf("Using internal lightmaps\n");
4599 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4600 if (l->filelen % sizeof(*input_pointer))
4601 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4602 count = l->filelen / sizeof(*input_pointer);
4603 for(i = 0; i < count; ++i)
4604 inpixels[i] = input_pointer[i].rgb;
4608 // no internal lightmaps
4609 // try external lightmaps
4610 if (developer_loading.integer)
4611 Con_Printf("Using external lightmaps\n");
4612 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4613 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false, false, NULL);
4617 // using EXTERNAL lightmaps instead
4618 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4620 Mem_Free(inpixels[0]);
4621 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4631 for(count = 1; ; ++count)
4633 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false, false, NULL);
4634 if(!inpixels[count])
4635 break; // we got all of them
4636 if(image_width != size || image_height != size)
4638 Mem_Free(inpixels[count]);
4639 inpixels[count] = NULL;
4640 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);
4646 loadmodel->brushq3.lightmapsize = size;
4647 loadmodel->brushq3.num_originallightmaps = count;
4649 // now check the surfaces to see if any of them index an odd numbered
4650 // lightmap, if so this is not a deluxemapped bsp file
4652 // also check what lightmaps are actually used, because q3map2 sometimes
4653 // (always?) makes an unused one at the end, which
4654 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4655 // reason when only one lightmap is used, which can throw off the
4656 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4657 // to see if the second lightmap is blank, if so it is not deluxemapped.
4658 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4659 // in Mod_Q3BSP_LoadEntities was failed
4660 if (!loadmodel->brushq3.deluxemapping)
4662 loadmodel->brushq3.deluxemapping = !(count & 1);
4663 loadmodel->brushq3.deluxemapping_modelspace = true;
4665 if (loadmodel->brushq3.deluxemapping)
4667 int facecount = faceslump->filelen / sizeof(q3dface_t);
4668 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4669 for (i = 0;i < facecount;i++)
4671 j = LittleLong(faces[i].lightmapindex);
4674 endlightmap = max(endlightmap, j + 1);
4675 if ((j & 1) || j + 1 >= count)
4677 loadmodel->brushq3.deluxemapping = false;
4684 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4685 // reason when only one lightmap is used, which can throw off the
4686 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4687 // to see if the second lightmap is blank, if so it is not deluxemapped.
4689 // further research has shown q3map2 sometimes creates a deluxemap and two
4690 // blank lightmaps, which must be handled properly as well
4691 if (endlightmap == 1 && count > 1)
4694 for (i = 0;i < size*size;i++)
4696 if (c[bytesperpixel*i + rgbmap[0]])
4698 if (c[bytesperpixel*i + rgbmap[1]])
4700 if (c[bytesperpixel*i + rgbmap[2]])
4705 // all pixels in the unused lightmap were black...
4706 loadmodel->brushq3.deluxemapping = false;
4711 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4713 // figure out what the most reasonable merge power is within limits
4715 // find the appropriate NxN dimensions to merge to, to avoid wasted space
4716 realcount = count >> (int)loadmodel->brushq3.deluxemapping;
4718 // figure out how big the merged texture has to be
4719 mergegoal = 128<<bound(0, mod_q3bsp_lightmapmergepower.integer, 6);
4720 mergegoal = bound(size, mergegoal, (int)vid.maxtexturesize_2d);
4721 while (mergegoal > size && mergegoal * mergegoal / 4 >= size * size * realcount)
4723 mergedwidth = mergegoal;
4724 mergedheight = mergegoal;
4725 // choose non-square size (2x1 aspect) if only half the space is used;
4726 // this really only happens when the entire set fits in one texture, if
4727 // there are multiple textures, we don't worry about shrinking the last
4728 // one to fit, because the driver prefers the same texture size on
4729 // consecutive draw calls...
4730 if (mergedwidth * mergedheight / 2 >= size*size*realcount)
4733 loadmodel->brushq3.num_lightmapmergedwidthpower = 0;
4734 loadmodel->brushq3.num_lightmapmergedheightpower = 0;
4735 while (mergedwidth > size<<loadmodel->brushq3.num_lightmapmergedwidthpower)
4736 loadmodel->brushq3.num_lightmapmergedwidthpower++;
4737 while (mergedheight > size<<loadmodel->brushq3.num_lightmapmergedheightpower)
4738 loadmodel->brushq3.num_lightmapmergedheightpower++;
4739 loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower = loadmodel->brushq3.num_lightmapmergedwidthpower + loadmodel->brushq3.num_lightmapmergedheightpower + (loadmodel->brushq3.deluxemapping ? 1 : 0);
4741 powerx = loadmodel->brushq3.num_lightmapmergedwidthpower;
4742 powery = loadmodel->brushq3.num_lightmapmergedheightpower;
4743 powerxy = powerx+powery;
4744 powerdxy = loadmodel->brushq3.deluxemapping + powerxy;
4746 mergedcolumns = 1 << powerx;
4747 mergedrows = 1 << powery;
4748 mergedrowsxcolumns = 1 << powerxy;
4750 loadmodel->brushq3.num_mergedlightmaps = (realcount + (1 << powerxy) - 1) >> powerxy;
4751 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4752 if (loadmodel->brushq3.deluxemapping)
4753 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4755 // allocate a texture pool if we need it
4756 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4757 loadmodel->texturepool = R_AllocTexturePool();
4759 mergedpixels = (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4);
4760 mergeddeluxepixels = loadmodel->brushq3.deluxemapping ? (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4) : NULL;
4761 for (i = 0;i < count;i++)
4763 // figure out which merged lightmap texture this fits into
4764 realindex = i >> (int)loadmodel->brushq3.deluxemapping;
4765 lightmapindex = i >> powerdxy;
4767 // choose the destination address
4768 mergebuf = (loadmodel->brushq3.deluxemapping && (i & 1)) ? mergeddeluxepixels : mergedpixels;
4769 mergebuf += 4 * (realindex & (mergedcolumns-1))*size + 4 * ((realindex >> powerx) & (mergedrows-1))*mergedwidth*size;
4770 if ((i & 1) == 0 || !loadmodel->brushq3.deluxemapping)
4771 Con_Printf("copying original lightmap %i (%ix%i) to %i (at %i,%i)\n", i, size, size, lightmapindex, (realindex & (mergedcolumns-1))*size, ((realindex >> powerx) & (mergedrows-1))*size);
4773 // convert pixels from RGB or BGRA while copying them into the destination rectangle
4774 for (j = 0;j < size;j++)
4775 for (k = 0;k < size;k++)
4777 mergebuf[(j*mergedwidth+k)*4+0] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[0]];
4778 mergebuf[(j*mergedwidth+k)*4+1] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[1]];
4779 mergebuf[(j*mergedwidth+k)*4+2] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[2]];
4780 mergebuf[(j*mergedwidth+k)*4+3] = 255;
4783 // upload texture if this was the last tile being written to the texture
4784 if (((realindex + 1) & (mergedrowsxcolumns - 1)) == 0 || (realindex + 1) == realcount)
4786 if (loadmodel->brushq3.deluxemapping && (i & 1))
4787 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergedwidth, mergedheight, mergeddeluxepixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
4789 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergedwidth, mergedheight, mergedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
4793 if (mergeddeluxepixels)
4794 Mem_Free(mergeddeluxepixels);
4795 Mem_Free(mergedpixels);
4798 for(i = 0; i < count; ++i)
4799 Mem_Free(inpixels[i]);
4803 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4808 *collisionstride = stride;
4811 cnt = (num_triangles + stride - 1) / stride;
4812 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4813 for(j = 0; j < cnt; ++j)
4815 mins = &((*collisionbbox6f)[6 * j + 0]);
4816 maxs = &((*collisionbbox6f)[6 * j + 3]);
4817 for(k = 0; k < stride; ++k)
4819 tri = j * stride + k;
4820 if(tri >= num_triangles)
4822 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4823 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4824 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4825 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4826 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4827 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4828 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4829 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4830 if(vert[0] < mins[0]) mins[0] = vert[0];
4831 if(vert[1] < mins[1]) mins[1] = vert[1];
4832 if(vert[2] < mins[2]) mins[2] = vert[2];
4833 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4834 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4835 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4836 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
4837 if(vert[0] < mins[0]) mins[0] = vert[0];
4838 if(vert[1] < mins[1]) mins[1] = vert[1];
4839 if(vert[2] < mins[2]) mins[2] = vert[2];
4840 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4841 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4842 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4847 *collisionbbox6f = NULL;
4850 typedef struct patchtess_s
4854 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4857 float *originalvertex3f;
4860 #define PATCHTESS_SAME_LODGROUP(a,b) \
4862 (a).lodgroup[0] == (b).lodgroup[0] && \
4863 (a).lodgroup[1] == (b).lodgroup[1] && \
4864 (a).lodgroup[2] == (b).lodgroup[2] && \
4865 (a).lodgroup[3] == (b).lodgroup[3] && \
4866 (a).lodgroup[4] == (b).lodgroup[4] && \
4867 (a).lodgroup[5] == (b).lodgroup[5] \
4870 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4872 q3dface_t *in, *oldin;
4873 msurface_t *out, *oldout;
4874 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;
4875 float lightmaptcbase[2], lightmaptcscale[2];
4876 //int *originalelement3i;
4877 //int *originalneighbor3i;
4878 float *originalvertex3f;
4879 //float *originalsvector3f;
4880 //float *originaltvector3f;
4881 float *originalnormal3f;
4882 float *originalcolor4f;
4883 float *originaltexcoordtexture2f;
4884 float *originaltexcoordlightmap2f;
4885 float *surfacecollisionvertex3f;
4886 int *surfacecollisionelement3i;
4888 patchtess_t *patchtess = NULL;
4889 int patchtesscount = 0;
4892 in = (q3dface_t *)(mod_base + l->fileofs);
4893 if (l->filelen % sizeof(*in))
4894 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4895 count = l->filelen / sizeof(*in);
4896 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4898 loadmodel->data_surfaces = out;
4899 loadmodel->num_surfaces = count;
4902 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4910 for (;i < count;i++, in++, out++)
4912 // check face type first
4913 type = LittleLong(in->type);
4914 if (type != Q3FACETYPE_FLAT
4915 && type != Q3FACETYPE_PATCH
4916 && type != Q3FACETYPE_MESH
4917 && type != Q3FACETYPE_FLARE)
4919 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4923 n = LittleLong(in->textureindex);
4924 if (n < 0 || n >= loadmodel->num_textures)
4926 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4929 out->texture = loadmodel->data_textures + n;
4930 n = LittleLong(in->effectindex);
4931 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4933 if (developer_extra.integer)
4934 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4940 out->effect = loadmodel->brushq3.data_effects + n;
4942 if (cls.state != ca_dedicated)
4944 out->lightmaptexture = NULL;
4945 out->deluxemaptexture = r_texture_blanknormalmap;
4946 n = LittleLong(in->lightmapindex);
4949 else if (n >= loadmodel->brushq3.num_originallightmaps)
4951 if(loadmodel->brushq3.num_originallightmaps != 0)
4952 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4957 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
4958 if (loadmodel->brushq3.deluxemapping)
4959 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
4963 firstvertex = LittleLong(in->firstvertex);
4964 numvertices = LittleLong(in->numvertices);
4965 firstelement = LittleLong(in->firstelement);
4966 numtriangles = LittleLong(in->numelements) / 3;
4967 if (numtriangles * 3 != LittleLong(in->numelements))
4969 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));
4972 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4974 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);
4977 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4979 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);
4984 case Q3FACETYPE_FLAT:
4985 case Q3FACETYPE_MESH:
4986 // no processing necessary
4988 case Q3FACETYPE_PATCH:
4989 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4990 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4991 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))
4993 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4996 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4998 // convert patch to Q3FACETYPE_MESH
4999 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5000 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5001 // bound to user settings
5002 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
5003 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
5004 // bound to sanity settings
5005 xtess = bound(0, xtess, 1024);
5006 ytess = bound(0, ytess, 1024);
5008 // lower quality collision patches! Same procedure as before, but different cvars
5009 // convert patch to Q3FACETYPE_MESH
5010 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5011 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5012 // bound to user settings
5013 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
5014 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
5015 // bound to sanity settings
5016 cxtess = bound(0, cxtess, 1024);
5017 cytess = bound(0, cytess, 1024);
5019 // store it for the LOD grouping step
5020 patchtess[patchtesscount].info.xsize = patchsize[0];
5021 patchtess[patchtesscount].info.ysize = patchsize[1];
5022 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
5023 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
5024 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
5025 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
5027 patchtess[patchtesscount].surface_id = i;
5028 patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
5029 patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
5030 patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
5031 patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
5032 patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
5033 patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
5034 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5037 case Q3FACETYPE_FLARE:
5038 if (developer_extra.integer)
5039 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5043 out->num_vertices = numvertices;
5044 out->num_triangles = numtriangles;
5045 meshvertices += out->num_vertices;
5046 meshtriangles += out->num_triangles;
5049 // Fix patches tesselations so that they make no seams
5053 for(i = 0; i < patchtesscount; ++i)
5055 for(j = i+1; j < patchtesscount; ++j)
5057 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5060 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5067 // Calculate resulting number of triangles
5068 collisionvertices = 0;
5069 collisiontriangles = 0;
5070 for(i = 0; i < patchtesscount; ++i)
5072 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5073 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5074 numvertices = finalwidth * finalheight;
5075 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5077 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5078 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5079 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5080 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5082 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
5083 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
5084 numvertices = finalwidth * finalheight;
5085 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5087 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
5088 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
5089 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
5090 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
5096 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5097 if (collisiontriangles)
5099 loadmodel->brush.data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
5100 loadmodel->brush.data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
5104 collisionvertices = 0;
5105 collisiontriangles = 0;
5106 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5108 if (out->num_vertices < 3 || out->num_triangles < 1)
5111 type = LittleLong(in->type);
5112 firstvertex = LittleLong(in->firstvertex);
5113 firstelement = LittleLong(in->firstelement);
5114 out->num_firstvertex = meshvertices;
5115 out->num_firsttriangle = meshtriangles;
5116 out->num_firstcollisiontriangle = collisiontriangles;
5119 case Q3FACETYPE_FLAT:
5120 case Q3FACETYPE_MESH:
5121 // no processing necessary, except for lightmap merging
5122 for (j = 0;j < out->num_vertices;j++)
5124 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5125 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5126 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5127 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5128 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5129 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5130 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5131 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5132 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5133 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5134 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5135 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5136 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5137 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5139 for (j = 0;j < out->num_triangles*3;j++)
5140 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5142 case Q3FACETYPE_PATCH:
5143 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5144 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5145 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5146 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5147 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5148 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5149 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5151 xtess = ytess = cxtess = cytess = -1;
5152 for(j = 0; j < patchtesscount; ++j)
5153 if(patchtess[j].surface_id == i)
5155 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5156 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5157 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5158 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5163 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5164 xtess = ytess = cxtess = cytess = 0;
5167 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5168 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5169 finalvertices = finalwidth * finalheight;
5170 oldnumtriangles = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5171 type = Q3FACETYPE_MESH;
5172 // generate geometry
5173 // (note: normals are skipped because they get recalculated)
5174 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5175 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5176 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5177 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5178 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5179 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5181 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);
5183 if (developer_extra.integer)
5185 if (out->num_triangles < finaltriangles)
5186 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);
5188 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);
5190 // q3map does not put in collision brushes for curves... ugh
5191 // build the lower quality collision geometry
5192 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5193 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5194 finalvertices = finalwidth * finalheight;
5195 oldnumtriangles2 = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5197 // legacy collision geometry implementation
5198 out->deprecatedq3data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5199 out->deprecatedq3data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5200 out->num_collisionvertices = finalvertices;
5201 out->num_collisiontriangles = finaltriangles;
5202 Q3PatchTesselateFloat(3, sizeof(float[3]), out->deprecatedq3data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5203 Q3PatchTriangleElements(out->deprecatedq3data_collisionelement3i, finalwidth, finalheight, 0);
5205 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5206 Mod_SnapVertices(3, finalvertices, out->deprecatedq3data_collisionvertex3f, 1);
5208 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionvertex3f);
5210 // now optimize the collision mesh by finding triangle bboxes...
5211 Mod_Q3BSP_BuildBBoxes(out->deprecatedq3data_collisionelement3i, out->num_collisiontriangles, out->deprecatedq3data_collisionvertex3f, &out->deprecatedq3data_collisionbbox6f, &out->deprecatedq3num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5212 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);
5214 // store collision geometry for BIH collision tree
5215 surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
5216 surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
5217 Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5218 Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
5219 Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
5221 // remove this once the legacy code is removed
5223 int nc = out->num_collisiontriangles;
5225 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
5227 if(nc != out->num_collisiontriangles)
5229 Con_Printf("number of collision triangles differs between BIH and BSP. FAIL.\n");
5234 if (developer_extra.integer)
5235 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);
5237 collisionvertices += finalvertices;
5238 collisiontriangles += out->num_collisiontriangles;
5243 meshvertices += out->num_vertices;
5244 meshtriangles += out->num_triangles;
5245 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5246 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)
5248 if (invalidelements)
5250 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);
5251 for (j = 0;j < out->num_triangles * 3;j++)
5253 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5254 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)
5255 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5259 // calculate a bounding box
5260 VectorClear(out->mins);
5261 VectorClear(out->maxs);
5262 if (out->num_vertices)
5264 if (cls.state != ca_dedicated && out->lightmaptexture)
5266 // figure out which part of the merged lightmap this fits into
5267 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5268 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5269 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5270 lightmapindex &= mergewidth * mergeheight - 1;
5271 lightmaptcscale[0] = 1.0f / mergewidth;
5272 lightmaptcscale[1] = 1.0f / mergeheight;
5273 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5274 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5275 // modify the lightmap texcoords to match this region of the merged lightmap
5276 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5278 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5279 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5282 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5283 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5284 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5286 out->mins[0] = min(out->mins[0], v[0]);
5287 out->maxs[0] = max(out->maxs[0], v[0]);
5288 out->mins[1] = min(out->mins[1], v[1]);
5289 out->maxs[1] = max(out->maxs[1], v[1]);
5290 out->mins[2] = min(out->mins[2], v[2]);
5291 out->maxs[2] = max(out->maxs[2], v[2]);
5293 out->mins[0] -= 1.0f;
5294 out->mins[1] -= 1.0f;
5295 out->mins[2] -= 1.0f;
5296 out->maxs[0] += 1.0f;
5297 out->maxs[1] += 1.0f;
5298 out->maxs[2] += 1.0f;
5300 // set lightmap styles for consistency with q1bsp
5301 //out->lightmapinfo->styles[0] = 0;
5302 //out->lightmapinfo->styles[1] = 255;
5303 //out->lightmapinfo->styles[2] = 255;
5304 //out->lightmapinfo->styles[3] = 255;
5309 for (;i < count;i++, out++)
5311 if(out->num_vertices && out->num_triangles)
5313 if(out->num_vertices == 0)
5314 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5315 if(out->num_triangles == 0)
5316 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5319 // for per pixel lighting
5320 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, true);
5322 // generate ushort elements array if possible
5323 if (loadmodel->surfmesh.data_element3s)
5324 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5325 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5327 // free the no longer needed vertex data
5328 loadmodel->brushq3.num_vertices = 0;
5329 if (loadmodel->brushq3.data_vertex3f)
5330 Mem_Free(loadmodel->brushq3.data_vertex3f);
5331 loadmodel->brushq3.data_vertex3f = NULL;
5332 loadmodel->brushq3.data_normal3f = NULL;
5333 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5334 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5335 loadmodel->brushq3.data_color4f = NULL;
5336 // free the no longer needed triangle data
5337 loadmodel->brushq3.num_triangles = 0;
5338 if (loadmodel->brushq3.data_element3i)
5339 Mem_Free(loadmodel->brushq3.data_element3i);
5340 loadmodel->brushq3.data_element3i = NULL;
5343 Mem_Free(patchtess);
5346 static void Mod_Q3BSP_LoadModels(lump_t *l)
5350 int i, j, n, c, count;
5352 in = (q3dmodel_t *)(mod_base + l->fileofs);
5353 if (l->filelen % sizeof(*in))
5354 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5355 count = l->filelen / sizeof(*in);
5356 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5358 loadmodel->brushq3.data_models = out;
5359 loadmodel->brushq3.num_models = count;
5361 for (i = 0;i < count;i++, in++, out++)
5363 for (j = 0;j < 3;j++)
5365 out->mins[j] = LittleFloat(in->mins[j]);
5366 out->maxs[j] = LittleFloat(in->maxs[j]);
5368 n = LittleLong(in->firstface);
5369 c = LittleLong(in->numfaces);
5370 if (n < 0 || n + c > loadmodel->num_surfaces)
5371 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5374 n = LittleLong(in->firstbrush);
5375 c = LittleLong(in->numbrushes);
5376 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5377 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5378 out->firstbrush = n;
5379 out->numbrushes = c;
5383 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5389 in = (int *)(mod_base + l->fileofs);
5390 if (l->filelen % sizeof(*in))
5391 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5392 count = l->filelen / sizeof(*in);
5393 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5395 loadmodel->brush.data_leafbrushes = out;
5396 loadmodel->brush.num_leafbrushes = count;
5398 for (i = 0;i < count;i++, in++, out++)
5400 n = LittleLong(*in);
5401 if (n < 0 || n >= loadmodel->brush.num_brushes)
5402 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5407 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5413 in = (int *)(mod_base + l->fileofs);
5414 if (l->filelen % sizeof(*in))
5415 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5416 count = l->filelen / sizeof(*in);
5417 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5419 loadmodel->brush.data_leafsurfaces = out;
5420 loadmodel->brush.num_leafsurfaces = count;
5422 for (i = 0;i < count;i++, in++, out++)
5424 n = LittleLong(*in);
5425 if (n < 0 || n >= loadmodel->num_surfaces)
5426 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5431 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5435 int i, j, n, c, count;
5437 in = (q3dleaf_t *)(mod_base + l->fileofs);
5438 if (l->filelen % sizeof(*in))
5439 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5440 count = l->filelen / sizeof(*in);
5441 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5443 loadmodel->brush.data_leafs = out;
5444 loadmodel->brush.num_leafs = count;
5446 for (i = 0;i < count;i++, in++, out++)
5450 out->clusterindex = LittleLong(in->clusterindex);
5451 out->areaindex = LittleLong(in->areaindex);
5452 for (j = 0;j < 3;j++)
5454 // yes the mins/maxs are ints
5455 out->mins[j] = LittleLong(in->mins[j]) - 1;
5456 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5458 n = LittleLong(in->firstleafface);
5459 c = LittleLong(in->numleaffaces);
5460 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5461 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5462 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5463 out->numleafsurfaces = c;
5464 n = LittleLong(in->firstleafbrush);
5465 c = LittleLong(in->numleafbrushes);
5466 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5467 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5468 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5469 out->numleafbrushes = c;
5473 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5479 in = (q3dnode_t *)(mod_base + l->fileofs);
5480 if (l->filelen % sizeof(*in))
5481 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5482 count = l->filelen / sizeof(*in);
5483 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5485 loadmodel->brush.data_nodes = out;
5486 loadmodel->brush.num_nodes = count;
5488 for (i = 0;i < count;i++, in++, out++)
5491 n = LittleLong(in->planeindex);
5492 if (n < 0 || n >= loadmodel->brush.num_planes)
5493 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5494 out->plane = loadmodel->brush.data_planes + n;
5495 for (j = 0;j < 2;j++)
5497 n = LittleLong(in->childrenindex[j]);
5500 if (n >= loadmodel->brush.num_nodes)
5501 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5502 out->children[j] = loadmodel->brush.data_nodes + n;
5507 if (n >= loadmodel->brush.num_leafs)
5508 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5509 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5512 for (j = 0;j < 3;j++)
5514 // yes the mins/maxs are ints
5515 out->mins[j] = LittleLong(in->mins[j]) - 1;
5516 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5520 // set the parent pointers
5521 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5524 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5527 q3dlightgrid_t *out;
5530 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5531 if (l->filelen % sizeof(*in))
5532 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5533 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5534 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5535 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5536 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5537 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5538 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5539 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5540 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5541 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5542 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5543 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5544 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5545 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5546 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]);
5547 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]);
5549 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5552 if (l->filelen < count * (int)sizeof(*in))
5554 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]);
5555 return; // ignore the grid if we cannot understand it
5557 if (l->filelen != count * (int)sizeof(*in))
5558 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5559 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5560 loadmodel->brushq3.data_lightgrid = out;
5561 loadmodel->brushq3.num_lightgrid = count;
5562 // no swapping or validation necessary
5563 memcpy(out, in, count * (int)sizeof(*out));
5567 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5572 if (l->filelen == 0)
5575 // unvised maps often have cluster indices even without pvs, so check
5576 // leafs to find real number of clusters
5577 loadmodel->brush.num_pvsclusters = 1;
5578 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5579 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5582 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5583 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5584 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5585 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5589 in = (q3dpvs_t *)(mod_base + l->fileofs);
5591 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5593 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5594 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5595 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5596 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5597 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5598 if (l->filelen < totalchains + (int)sizeof(*in))
5599 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);
5601 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5602 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5605 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5607 int i, j, k, index[3];
5608 float transformed[3], blend1, blend2, blend, stylescale;
5609 q3dlightgrid_t *a, *s;
5611 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5612 stylescale = r_refdef.scene.rtlightstylevalue[0];
5614 if (!model->brushq3.num_lightgrid)
5616 ambientcolor[0] = stylescale;
5617 ambientcolor[1] = stylescale;
5618 ambientcolor[2] = stylescale;
5622 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5623 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5624 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5625 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5626 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5627 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5628 index[0] = (int)floor(transformed[0]);
5629 index[1] = (int)floor(transformed[1]);
5630 index[2] = (int)floor(transformed[2]);
5631 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5633 // now lerp the values
5634 VectorClear(diffusenormal);
5635 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5636 for (k = 0;k < 2;k++)
5638 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5639 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5641 for (j = 0;j < 2;j++)
5643 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5644 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5646 for (i = 0;i < 2;i++)
5648 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5649 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5651 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5652 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5653 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5654 // this uses the mod_md3_sin table because the values are
5655 // already in the 0-255 range, the 64+ bias fetches a cosine
5656 // instead of a sine value
5657 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5658 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5659 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5660 //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)));
5665 // normalize the light direction before turning
5666 VectorNormalize(diffusenormal);
5667 //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]);
5670 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5673 double midf, mid[3];
5679 // find the point distances
5680 mplane_t *plane = node->plane;
5681 if (plane->type < 3)
5683 t1 = p1[plane->type] - plane->dist;
5684 t2 = p2[plane->type] - plane->dist;
5688 t1 = DotProduct (plane->normal, p1) - plane->dist;
5689 t2 = DotProduct (plane->normal, p2) - plane->dist;
5696 node = node->children[1];
5705 node = node->children[0];
5711 midf = t1 / (t1 - t2);
5712 VectorLerp(p1, midf, p2, mid);
5714 // recurse both sides, front side first
5715 // return 2 if empty is followed by solid (hit something)
5716 // do not return 2 if both are solid or both empty,
5717 // or if start is solid and end is empty
5718 // as these degenerate cases usually indicate the eye is in solid and
5719 // should see the target point anyway
5720 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
5723 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5728 return ((mleaf_t *)node)->clusterindex < 0;
5731 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5733 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5736 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5737 return trace.fraction == 1;
5741 double tracestart[3], traceend[3];
5742 VectorCopy(start, tracestart);
5743 VectorCopy(end, traceend);
5744 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5748 static void Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace_t *trace, dp_model_t *model, int nodenum, const vec3_t point)
5750 const bih_leaf_t *leaf;
5751 const bih_node_t *node;
5752 const colbrushf_t *brush;
5754 while (nodenum >= 0)
5756 node = model->collision_bih.nodes + nodenum;
5757 axis = node->type - BIH_SPLITX;
5758 if (point[axis] <= node->backmax)
5760 if (point[axis] >= node->frontmin)
5761 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, node->front, point);
5762 nodenum = node->back;
5764 else if (point[axis] >= node->frontmin)
5765 nodenum = node->front;
5766 else // no overlap with either child? just return
5769 if (!model->collision_bih.leafs)
5771 leaf = model->collision_bih.leafs + (-1-nodenum);
5775 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
5776 Collision_TracePointBrushFloat(trace, point, brush);
5778 case BIH_COLLISIONTRIANGLE:
5779 // collision triangle - skipped because they have no volume
5781 case BIH_RENDERTRIANGLE:
5782 // render triangle - skipped because they have no volume
5787 static void Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace_t *trace, dp_model_t *model, int nodenum, const vec3_t start, const vec3_t end, const vec3_t linestart, const vec3_t lineend)
5789 const bih_leaf_t *leaf;
5790 const bih_node_t *node;
5791 const colbrushf_t *brush;
5793 const texture_t *texture;
5804 vec3_t clipped, newstart, newend;
5808 segmentmins[0] = min(start[0], end[0]);
5809 segmentmins[1] = min(start[1], end[1]);
5810 segmentmins[2] = min(start[2], end[2]);
5811 segmentmaxs[0] = max(start[0], end[0]);
5812 segmentmaxs[1] = max(start[1], end[1]);
5813 segmentmaxs[2] = max(start[2], end[2]);
5814 while (nodenum >= 0)
5816 node = model->collision_bih.nodes + nodenum;
5818 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
5821 axis = node->type - BIH_SPLITX;
5823 if (segmentmins[axis] <= node->backmax)
5825 if (segmentmaxs[axis] >= node->frontmin)
5826 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
5827 nodenum = node->back;
5829 else if (segmentmaxs[axis] >= node->frontmin)
5830 nodenum = node->front;
5832 return; // trace falls between children
5834 frontdist1 = start[axis] - node->frontmin;
5835 frontdist2 = end[axis] - node->frontmin;
5836 backdist1 = start[axis] - node->backmax;
5837 backdist2 = end[axis] - node->backmax;
5850 if ((sideflags & 3) != 3)
5851 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
5852 nodenum = node->back;
5854 else if ((sideflags & 3) != 3)
5855 nodenum = node->front;
5857 return; // trace falls between children
5862 // start end START END
5863 nodenum = node->front;
5866 // START end START END
5868 frontfrac = frontdist1 / (frontdist1 - frontdist2);
5869 VectorLerp(start, frontfrac, end, newstart); start = newstart;
5870 segmentmins[0] = min(start[0], end[0]);
5871 segmentmins[1] = min(start[1], end[1]);
5872 segmentmins[2] = min(start[2], end[2]);
5873 segmentmaxs[0] = max(start[0], end[0]);
5874 segmentmaxs[1] = max(start[1], end[1]);
5875 segmentmaxs[2] = max(start[2], end[2]);
5877 nodenum = node->front;
5881 // start END START END
5882 frontfrac = frontdist1 / (frontdist1 - frontdist2);
5883 VectorLerp(start, frontfrac, end, newend); end = newend;
5884 segmentmins[0] = min(start[0], end[0]);
5885 segmentmins[1] = min(start[1], end[1]);
5886 segmentmins[2] = min(start[2], end[2]);
5887 segmentmaxs[0] = max(start[0], end[0]);
5888 segmentmaxs[1] = max(start[1], end[1]);
5889 segmentmaxs[2] = max(start[2], end[2]);
5891 nodenum = node->front;
5894 // START END START END
5895 return; // line falls in gap between children
5897 // start end start END
5898 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
5900 backfrac = backdist1 / (backdist1 - backdist2);
5901 VectorLerp(start, backfrac, end, newend); end = newend;
5902 segmentmins[0] = min(start[0], end[0]);
5903 segmentmins[1] = min(start[1], end[1]);
5904 segmentmins[2] = min(start[2], end[2]);
5905 segmentmaxs[0] = max(start[0], end[0]);
5906 segmentmaxs[1] = max(start[1], end[1]);
5907 segmentmaxs[2] = max(start[2], end[2]);
5909 nodenum = node->back;
5912 // START end start END
5914 frontfrac = frontdist1 / (frontdist1 - frontdist2);
5915 VectorLerp(start, frontfrac, end, clipped);
5916 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, clipped, end, linestart, lineend);
5917 backfrac = backdist1 / (backdist1 - backdist2);
5918 VectorLerp(start, backfrac, end, newend); end = newend;
5919 segmentmins[0] = min(start[0], end[0]);
5920 segmentmins[1] = min(start[1], end[1]);
5921 segmentmins[2] = min(start[2], end[2]);
5922 segmentmaxs[0] = max(start[0], end[0]);
5923 segmentmaxs[1] = max(start[1], end[1]);
5924 segmentmaxs[2] = max(start[2], end[2]);
5926 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
5928 nodenum = node->back;
5931 // start END start END
5933 frontfrac = frontdist1 / (frontdist1 - frontdist2);
5934 VectorLerp(start, frontfrac, end, clipped);
5935 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, clipped, linestart, lineend);
5936 backfrac = backdist1 / (backdist1 - backdist2);
5937 VectorLerp(start, backfrac, end, newend); end = newend;
5938 segmentmins[0] = min(start[0], end[0]);
5939 segmentmins[1] = min(start[1], end[1]);
5940 segmentmins[2] = min(start[2], end[2]);
5941 segmentmaxs[0] = max(start[0], end[0]);
5942 segmentmaxs[1] = max(start[1], end[1]);
5943 segmentmaxs[2] = max(start[2], end[2]);
5945 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
5947 nodenum = node->back;
5950 // START END start END
5952 backfrac = backdist1 / (backdist1 - backdist2);
5953 VectorLerp(start, backfrac, end, newend); end = newend;
5954 segmentmins[0] = min(start[0], end[0]);
5955 segmentmins[1] = min(start[1], end[1]);
5956 segmentmins[2] = min(start[2], end[2]);
5957 segmentmaxs[0] = max(start[0], end[0]);
5958 segmentmaxs[1] = max(start[1], end[1]);
5959 segmentmaxs[2] = max(start[2], end[2]);
5961 nodenum = node->back;
5964 // start end START end
5965 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
5967 backfrac = backdist1 / (backdist1 - backdist2);
5968 VectorLerp(start, backfrac, end, newstart); start = newstart;
5969 segmentmins[0] = min(start[0], end[0]);
5970 segmentmins[1] = min(start[1], end[1]);
5971 segmentmins[2] = min(start[2], end[2]);
5972 segmentmaxs[0] = max(start[0], end[0]);
5973 segmentmaxs[1] = max(start[1], end[1]);
5974 segmentmaxs[2] = max(start[2], end[2]);
5976 nodenum = node->back;
5979 // START end START end
5981 frontfrac = frontdist1 / (frontdist1 - frontdist2);
5982 VectorLerp(start, frontfrac, end, clipped);
5983 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, clipped, end, linestart, lineend);
5984 backfrac = backdist1 / (backdist1 - backdist2);
5985 VectorLerp(start, backfrac, end, newstart); start = newstart;
5986 segmentmins[0] = min(start[0], end[0]);
5987 segmentmins[1] = min(start[1], end[1]);
5988 segmentmins[2] = min(start[2], end[2]);
5989 segmentmaxs[0] = max(start[0], end[0]);
5990 segmentmaxs[1] = max(start[1], end[1]);
5991 segmentmaxs[2] = max(start[2], end[2]);
5993 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
5995 nodenum = node->back;
5998 // start END START end
6000 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6001 VectorLerp(start, frontfrac, end, clipped);
6002 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, clipped, linestart, lineend);
6003 backfrac = backdist1 / (backdist1 - backdist2);
6004 VectorLerp(start, backfrac, end, newstart); start = newstart;
6005 segmentmins[0] = min(start[0], end[0]);
6006 segmentmins[1] = min(start[1], end[1]);
6007 segmentmins[2] = min(start[2], end[2]);
6008 segmentmaxs[0] = max(start[0], end[0]);
6009 segmentmaxs[1] = max(start[1], end[1]);
6010 segmentmaxs[2] = max(start[2], end[2]);
6012 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
6014 nodenum = node->back;
6017 // START END START end
6019 backfrac = backdist1 / (backdist1 - backdist2);
6020 VectorLerp(start, backfrac, end, newstart); start = newstart;
6021 segmentmins[0] = min(start[0], end[0]);
6022 segmentmins[1] = min(start[1], end[1]);
6023 segmentmins[2] = min(start[2], end[2]);
6024 segmentmaxs[0] = max(start[0], end[0]);
6025 segmentmaxs[1] = max(start[1], end[1]);
6026 segmentmaxs[2] = max(start[2], end[2]);
6028 nodenum = node->back;
6031 // start end start end
6032 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
6033 nodenum = node->back;
6036 // START end start end
6038 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6039 VectorLerp(start, frontfrac, end, clipped);
6040 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, clipped, end, linestart, lineend);
6042 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
6044 nodenum = node->back;
6047 // start END start end
6049 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6050 VectorLerp(start, frontfrac, end, clipped);
6051 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, clipped, linestart, lineend);
6053 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, node->front, start, end, linestart, lineend);
6055 nodenum = node->back;
6058 // START END start end
6059 nodenum = node->back;
6065 if (!model->collision_bih.leafs)
6067 leaf = model->collision_bih.leafs + (-1-nodenum);
6069 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6075 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6076 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6078 case BIH_COLLISIONTRIANGLE:
6079 if (!mod_q3bsp_curves_collisions.integer)
6081 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6082 texture = model->data_textures + leaf->textureindex;
6083 Collision_TraceLineTriangleFloat(trace, linestart, lineend, model->brush.data_collisionvertex3f + e[0] * 3, model->brush.data_collisionvertex3f + e[1] * 3, model->brush.data_collisionvertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6085 case BIH_RENDERTRIANGLE:
6086 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6087 texture = model->data_textures + leaf->textureindex;
6088 Collision_TraceLineTriangleFloat(trace, linestart, lineend, model->surfmesh.data_vertex3f + e[0] * 3, model->surfmesh.data_vertex3f + e[1] * 3, model->surfmesh.data_vertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6093 static void Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace_t *trace, dp_model_t *model, int nodenum, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, const vec3_t segmentmins, const vec3_t segmentmaxs)
6095 const bih_leaf_t *leaf;
6096 const bih_node_t *node;
6097 const colbrushf_t *brush;
6099 const texture_t *texture;
6101 while (nodenum >= 0)
6103 node = model->collision_bih.nodes + nodenum;
6104 axis = node->type - BIH_SPLITX;
6106 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6110 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, node->front, thisbrush_start, thisbrush_end, segmentmins, segmentmaxs);
6111 nodenum = node->back;
6114 if (segmentmins[axis] <= node->backmax)
6116 if (segmentmaxs[axis] >= node->frontmin)
6117 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, node->front, thisbrush_start, thisbrush_end, segmentmins, segmentmaxs);
6118 nodenum = node->back;
6120 else if (segmentmaxs[axis] >= node->frontmin)
6121 nodenum = node->front;
6123 return; // trace falls between children
6125 if (!model->collision_bih.leafs)
6127 leaf = model->collision_bih.leafs + (-1-nodenum);
6129 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6135 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6136 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6138 case BIH_COLLISIONTRIANGLE:
6139 if (!mod_q3bsp_curves_collisions.integer)
6141 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6142 texture = model->data_textures + leaf->textureindex;
6143 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);
6145 case BIH_RENDERTRIANGLE:
6146 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6147 texture = model->data_textures + leaf->textureindex;
6148 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);
6153 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)
6155 memset(trace, 0, sizeof(*trace));
6156 trace->fraction = 1;
6157 trace->realfraction = 1;
6158 trace->hitsupercontentsmask = hitsupercontentsmask;
6159 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start);
6162 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)
6164 if (VectorCompare(start, end))
6166 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6170 memset(trace, 0, sizeof(*trace));
6171 trace->fraction = 1;
6172 trace->realfraction = 1;
6173 trace->hitsupercontentsmask = hitsupercontentsmask;
6174 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, start, end);
6177 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)
6179 float segmentmins[3], segmentmaxs[3];
6180 colboxbrushf_t thisbrush_start, thisbrush_end;
6181 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6183 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
6185 vec3_t shiftstart, shiftend;
6186 VectorAdd(start, boxmins, shiftstart);
6187 VectorAdd(end, boxmins, shiftend);
6188 if (VectorCompare(start, end))
6189 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
6191 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
6195 // box trace, performed as brush trace
6196 memset(trace, 0, sizeof(*trace));
6197 trace->fraction = 1;
6198 trace->realfraction = 1;
6199 trace->hitsupercontentsmask = hitsupercontentsmask;
6200 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
6201 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
6202 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
6203 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
6204 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
6205 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
6206 VectorAdd(start, boxmins, boxstartmins);
6207 VectorAdd(start, boxmaxs, boxstartmaxs);
6208 VectorAdd(end, boxmins, boxendmins);
6209 VectorAdd(end, boxmaxs, boxendmaxs);
6210 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6211 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6212 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, &thisbrush_start.brush, &thisbrush_end.brush, segmentmins, segmentmaxs);
6215 void Mod_CollisionBIH_TraceBrush(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, colbrushf_t *start, colbrushf_t *end, int hitsupercontentsmask)
6217 float segmentmins[3], segmentmaxs[3];
6219 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6221 if (VectorCompare(start->mins, end->mins))
6222 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6224 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6228 // box trace, performed as brush trace
6229 memset(trace, 0, sizeof(*trace));
6230 trace->fraction = 1;
6231 trace->realfraction = 1;
6232 trace->hitsupercontentsmask = hitsupercontentsmask;
6233 segmentmins[0] = min(start->mins[0], end->mins[0]);
6234 segmentmins[1] = min(start->mins[1], end->mins[1]);
6235 segmentmins[2] = min(start->mins[2], end->mins[2]);
6236 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6237 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6238 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6239 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, segmentmins, segmentmaxs);
6242 int Mod_CollisionBIH_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6245 Mod_CollisionBIH_TracePoint(model, NULL, NULL, &trace, point, 0);
6246 return trace.startsupercontents;
6249 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)
6252 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6254 int hitsupercontents;
6255 VectorSet(end, start[0], start[1], model->normalmins[2]);
6257 memset(trace, 0, sizeof(*trace));
6258 trace->fraction = 1;
6259 trace->realfraction = 1;
6260 trace->hitsupercontentsmask = hitsupercontentsmask;
6262 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, start, end);
6263 hitsupercontents = trace->hitsupercontents;
6264 memset(trace, 0, sizeof(*trace));
6265 trace->fraction = 1;
6266 trace->realfraction = 1;
6267 trace->hitsupercontentsmask = hitsupercontentsmask;
6268 trace->startsupercontents = hitsupercontents;
6272 int Mod_CollisionBIH_PointSuperContents_Mesh(struct model_s *model, int frame, const vec3_t start)
6275 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6278 VectorSet(end, start[0], start[1], model->normalmins[2]);
6279 memset(&trace, 0, sizeof(trace));
6281 trace.realfraction = 1;
6282 trace.hitsupercontentsmask = 0;
6283 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(&trace, model, model->collision_bih.rootnode, start, end, start, end);
6284 return trace.hitsupercontents;
6290 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
6295 // find which leaf the point is in
6297 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6298 // point trace the brushes
6299 leaf = (mleaf_t *)node;
6300 for (i = 0;i < leaf->numleafbrushes;i++)
6302 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6303 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
6305 brush->markframe = markframe;
6306 Collision_TracePointBrushFloat(trace, point, brush);
6309 // can't do point traces on curves (they have no thickness)
6312 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)
6314 int i, startside, endside;
6315 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
6317 msurface_t *surface;
6320 // walk the tree until we hit a leaf, recursing for any split cases
6324 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6326 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[0], start, end, startfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6327 node = node->children[1];
6329 // abort if this part of the bsp tree can not be hit by this trace
6330 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6332 plane = node->plane;
6333 // axial planes are much more common than non-axial, so an optimized
6334 // axial case pays off here
6335 if (plane->type < 3)
6337 dist1 = start[plane->type] - plane->dist;
6338 dist2 = end[plane->type] - plane->dist;
6342 dist1 = DotProduct(start, plane->normal) - plane->dist;
6343 dist2 = DotProduct(end, plane->normal) - plane->dist;
6345 startside = dist1 < 0;
6346 endside = dist2 < 0;
6347 if (startside == endside)
6349 // most of the time the line fragment is on one side of the plane
6350 node = node->children[startside];
6354 // line crosses node plane, split the line
6355 dist1 = PlaneDiff(linestart, plane);
6356 dist2 = PlaneDiff(lineend, plane);
6357 midfrac = dist1 / (dist1 - dist2);
6358 VectorLerp(linestart, midfrac, lineend, mid);
6359 // take the near side first
6360 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6361 // if we found an impact on the front side, don't waste time
6362 // exploring the far side
6363 if (midfrac <= trace->realfraction)
6364 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6369 // abort if this part of the bsp tree can not be hit by this trace
6370 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6373 nodesegmentmins[0] = min(start[0], end[0]) - 1;
6374 nodesegmentmins[1] = min(start[1], end[1]) - 1;
6375 nodesegmentmins[2] = min(start[2], end[2]) - 1;
6376 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
6377 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
6378 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
6379 // line trace the brushes
6380 leaf = (mleaf_t *)node;
6382 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6385 for (i = 0;i < leaf->numleafbrushes;i++)
6387 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6388 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6390 brush->markframe = markframe;
6391 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6394 // can't do point traces on curves (they have no thickness)
6395 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
6397 // line trace the curves
6398 for (i = 0;i < leaf->numleafsurfaces;i++)
6400 surface = model->data_surfaces + leaf->firstleafsurface[i];
6401 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6403 surface->deprecatedq3collisionmarkframe = markframe;
6404 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);
6410 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)
6416 msurface_t *surface;
6418 float nodesegmentmins[3], nodesegmentmaxs[3];
6419 // walk the tree until we hit a leaf, recursing for any split cases
6423 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6425 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6426 node = node->children[1];
6428 // abort if this part of the bsp tree can not be hit by this trace
6429 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6431 plane = node->plane;
6432 // axial planes are much more common than non-axial, so an optimized
6433 // axial case pays off here
6434 if (plane->type < 3)
6436 // this is an axial plane, compare bounding box directly to it and
6437 // recurse sides accordingly
6438 // recurse down node sides
6439 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
6440 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
6441 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
6442 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
6446 // this is a non-axial plane, so check if the start and end boxes
6447 // are both on one side of the plane to handle 'diagonal' cases
6448 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
6452 // segment crosses plane
6453 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6456 // if sides == 0 then the trace itself is bogus (Not A Number values),
6457 // in this case we simply pretend the trace hit nothing
6459 return; // ERROR: NAN bounding box!
6460 // take whichever side the segment box is on
6461 node = node->children[sides - 1];
6464 // abort if this part of the bsp tree can not be hit by this trace
6465 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6467 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
6468 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
6469 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
6470 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
6471 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
6472 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
6474 leaf = (mleaf_t *)node;
6476 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6479 for (i = 0;i < leaf->numleafbrushes;i++)
6481 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6482 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6484 brush->markframe = markframe;
6485 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6488 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
6490 for (i = 0;i < leaf->numleafsurfaces;i++)
6492 surface = model->data_surfaces + leaf->firstleafsurface[i];
6493 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6495 surface->deprecatedq3collisionmarkframe = markframe;
6496 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);
6503 static int markframe = 0;
6505 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)
6509 memset(trace, 0, sizeof(*trace));
6510 trace->fraction = 1;
6511 trace->realfraction = 1;
6512 trace->hitsupercontentsmask = hitsupercontentsmask;
6513 if (mod_collision_bih.integer)
6514 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start);
6515 else if (model->brush.submodel)
6517 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6518 if (brush->colbrushf)
6519 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
6522 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
6525 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)
6528 float segmentmins[3], segmentmaxs[3];
6529 msurface_t *surface;
6532 if (VectorCompare(start, end))
6534 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6538 memset(trace, 0, sizeof(*trace));
6539 trace->fraction = 1;
6540 trace->realfraction = 1;
6541 trace->hitsupercontentsmask = hitsupercontentsmask;
6542 segmentmins[0] = min(start[0], end[0]) - 1;
6543 segmentmins[1] = min(start[1], end[1]) - 1;
6544 segmentmins[2] = min(start[2], end[2]) - 1;
6545 segmentmaxs[0] = max(start[0], end[0]) + 1;
6546 segmentmaxs[1] = max(start[1], end[1]) + 1;
6547 segmentmaxs[2] = max(start[2], end[2]) + 1;
6548 if (mod_collision_bih.integer)
6549 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, start, end);
6550 else if (model->brush.submodel)
6552 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6553 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6554 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6555 if (mod_q3bsp_curves_collisions.integer)
6556 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6557 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6558 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);
6561 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
6564 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)
6567 float segmentmins[3], segmentmaxs[3];
6568 msurface_t *surface;
6570 colboxbrushf_t thisbrush_start, thisbrush_end;
6571 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6573 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
6575 vec3_t shiftstart, shiftend;
6576 VectorAdd(start, boxmins, shiftstart);
6577 VectorAdd(end, boxmins, shiftend);
6578 if (VectorCompare(start, end))
6579 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
6581 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
6585 // box trace, performed as brush trace
6586 memset(trace, 0, sizeof(*trace));
6587 trace->fraction = 1;
6588 trace->realfraction = 1;
6589 trace->hitsupercontentsmask = hitsupercontentsmask;
6590 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
6591 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
6592 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
6593 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
6594 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
6595 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
6596 VectorAdd(start, boxmins, boxstartmins);
6597 VectorAdd(start, boxmaxs, boxstartmaxs);
6598 VectorAdd(end, boxmins, boxendmins);
6599 VectorAdd(end, boxmaxs, boxendmaxs);
6600 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6601 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6602 if (mod_collision_bih.integer)
6603 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, &thisbrush_start.brush, &thisbrush_end.brush, segmentmins, segmentmaxs);
6604 else if (model->brush.submodel)
6606 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6607 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6608 Collision_TraceBrushBrushFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, brush->colbrushf, brush->colbrushf);
6609 if (mod_q3bsp_curves_collisions.integer)
6610 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6611 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6612 Collision_TraceBrushTriangleMeshFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
6615 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, &thisbrush_start.brush, &thisbrush_end.brush, ++markframe, segmentmins, segmentmaxs);
6618 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)
6620 float segmentmins[3], segmentmaxs[3];
6622 msurface_t *surface;
6625 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6627 if (VectorCompare(start->mins, end->mins))
6628 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6630 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6634 // box trace, performed as brush trace
6635 memset(trace, 0, sizeof(*trace));
6636 trace->fraction = 1;
6637 trace->realfraction = 1;
6638 trace->hitsupercontentsmask = hitsupercontentsmask;
6639 segmentmins[0] = min(start->mins[0], end->mins[0]);
6640 segmentmins[1] = min(start->mins[1], end->mins[1]);
6641 segmentmins[2] = min(start->mins[2], end->mins[2]);
6642 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6643 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6644 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6645 if (mod_collision_bih.integer)
6646 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, segmentmins, segmentmaxs);
6647 else if (model->brush.submodel)
6649 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6650 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6651 Collision_TraceBrushBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6652 if (mod_q3bsp_curves_collisions.integer)
6653 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6654 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6655 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);
6658 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, ++markframe, segmentmins, segmentmaxs);
6661 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6664 int supercontents = 0;
6666 if (mod_collision_bih.integer)
6669 Mod_Q3BSP_TracePoint(model, NULL, NULL, &trace, point, 0);
6670 supercontents = trace.startsupercontents;
6672 // test if the point is inside each brush
6673 else if (model->brush.submodel)
6675 // submodels are effectively one leaf
6676 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6677 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6678 supercontents |= brush->colbrushf->supercontents;
6682 mnode_t *node = model->brush.data_nodes;
6684 // find which leaf the point is in
6686 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6687 leaf = (mleaf_t *)node;
6688 // now check the brushes in the leaf
6689 for (i = 0;i < leaf->numleafbrushes;i++)
6691 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
6692 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6693 supercontents |= brush->colbrushf->supercontents;
6696 return supercontents;
6699 bih_t *Mod_MakeCollisionBIH(dp_model_t *model, qboolean userendersurfaces, bih_t *out)
6707 int nummodelbrushes = model->nummodelbrushes;
6708 int nummodelsurfaces = model->nummodelsurfaces;
6710 const int *collisionelement3i;
6711 const float *collisionvertex3f;
6712 const int *renderelement3i;
6713 const float *rendervertex3f;
6714 bih_leaf_t *bihleafs;
6715 bih_node_t *bihnodes;
6717 int *temp_leafsortscratch;
6718 const msurface_t *surface;
6719 const q3mbrush_t *brush;
6721 // find out how many BIH leaf nodes we need
6723 if (userendersurfaces)
6725 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6726 bihnumleafs += surface->num_triangles;
6730 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6731 if (brush->colbrushf)
6733 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6735 if (surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS)
6736 bihnumleafs += surface->num_triangles + surface->num_collisiontriangles;
6738 bihnumleafs += surface->num_collisiontriangles;
6745 // allocate the memory for the BIH leaf nodes
6746 bihleafs = (bih_leaf_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
6748 // now populate the BIH leaf nodes
6751 // add render surfaces
6752 renderelement3i = model->surfmesh.data_element3i;
6753 rendervertex3f = model->surfmesh.data_vertex3f;
6754 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6756 for (triangleindex = 0, e = renderelement3i + 3*surface->num_firsttriangle;triangleindex < surface->num_triangles;triangleindex++, e += 3)
6758 if (!userendersurfaces && !(surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS))
6760 bihleafs[bihleafindex].type = BIH_RENDERTRIANGLE;
6761 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
6762 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
6763 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firsttriangle;
6764 bihleafs[bihleafindex].mins[0] = min(rendervertex3f[3*e[0]+0], min(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) - 1;
6765 bihleafs[bihleafindex].mins[1] = min(rendervertex3f[3*e[0]+1], min(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) - 1;
6766 bihleafs[bihleafindex].mins[2] = min(rendervertex3f[3*e[0]+2], min(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) - 1;
6767 bihleafs[bihleafindex].maxs[0] = max(rendervertex3f[3*e[0]+0], max(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) + 1;
6768 bihleafs[bihleafindex].maxs[1] = max(rendervertex3f[3*e[0]+1], max(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) + 1;
6769 bihleafs[bihleafindex].maxs[2] = max(rendervertex3f[3*e[0]+2], max(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) + 1;
6774 if (!userendersurfaces)
6776 // add collision brushes
6777 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6779 if (!brush->colbrushf)
6781 bihleafs[bihleafindex].type = BIH_BRUSH;
6782 bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
6783 bihleafs[bihleafindex].surfaceindex = -1;
6784 bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
6785 VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
6786 VectorCopy(brush->colbrushf->maxs, bihleafs[bihleafindex].maxs);
6790 // add collision surfaces
6791 collisionelement3i = model->brush.data_collisionelement3i;
6792 collisionvertex3f = model->brush.data_collisionvertex3f;
6793 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6795 for (triangleindex = 0, e = collisionelement3i + 3*surface->num_firstcollisiontriangle;triangleindex < surface->num_collisiontriangles;triangleindex++, e += 3)
6797 bihleafs[bihleafindex].type = BIH_COLLISIONTRIANGLE;
6798 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
6799 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
6800 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
6801 bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) - 1;
6802 bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) - 1;
6803 bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) - 1;
6804 bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) + 1;
6805 bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) + 1;
6806 bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) + 1;
6812 // allocate buffers for the produced and temporary data
6813 bihmaxnodes = bihnumleafs - 1;
6814 bihnodes = (bih_node_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
6815 temp_leafsort = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
6816 temp_leafsortscratch = temp_leafsort + bihnumleafs;
6819 BIH_Build(out, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch);
6821 // we're done with the temporary data
6822 Mem_Free(temp_leafsort);
6824 // resize the BIH nodes array if it over-allocated
6825 if (out->maxnodes > out->numnodes)
6827 out->maxnodes = out->numnodes;
6828 out->nodes = (bih_node_t *)Mem_Realloc(loadmodel->mempool, out->nodes, out->numnodes * sizeof(bih_node_t));
6834 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
6836 int supercontents = 0;
6837 if (nativecontents & CONTENTSQ3_SOLID)
6838 supercontents |= SUPERCONTENTS_SOLID;
6839 if (nativecontents & CONTENTSQ3_WATER)
6840 supercontents |= SUPERCONTENTS_WATER;
6841 if (nativecontents & CONTENTSQ3_SLIME)
6842 supercontents |= SUPERCONTENTS_SLIME;
6843 if (nativecontents & CONTENTSQ3_LAVA)
6844 supercontents |= SUPERCONTENTS_LAVA;
6845 if (nativecontents & CONTENTSQ3_BODY)
6846 supercontents |= SUPERCONTENTS_BODY;
6847 if (nativecontents & CONTENTSQ3_CORPSE)
6848 supercontents |= SUPERCONTENTS_CORPSE;
6849 if (nativecontents & CONTENTSQ3_NODROP)
6850 supercontents |= SUPERCONTENTS_NODROP;
6851 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
6852 supercontents |= SUPERCONTENTS_PLAYERCLIP;
6853 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
6854 supercontents |= SUPERCONTENTS_MONSTERCLIP;
6855 if (nativecontents & CONTENTSQ3_DONOTENTER)
6856 supercontents |= SUPERCONTENTS_DONOTENTER;
6857 if (nativecontents & CONTENTSQ3_BOTCLIP)
6858 supercontents |= SUPERCONTENTS_BOTCLIP;
6859 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
6860 supercontents |= SUPERCONTENTS_OPAQUE;
6861 return supercontents;
6864 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
6866 int nativecontents = 0;
6867 if (supercontents & SUPERCONTENTS_SOLID)
6868 nativecontents |= CONTENTSQ3_SOLID;
6869 if (supercontents & SUPERCONTENTS_WATER)
6870 nativecontents |= CONTENTSQ3_WATER;
6871 if (supercontents & SUPERCONTENTS_SLIME)
6872 nativecontents |= CONTENTSQ3_SLIME;
6873 if (supercontents & SUPERCONTENTS_LAVA)
6874 nativecontents |= CONTENTSQ3_LAVA;
6875 if (supercontents & SUPERCONTENTS_BODY)
6876 nativecontents |= CONTENTSQ3_BODY;
6877 if (supercontents & SUPERCONTENTS_CORPSE)
6878 nativecontents |= CONTENTSQ3_CORPSE;
6879 if (supercontents & SUPERCONTENTS_NODROP)
6880 nativecontents |= CONTENTSQ3_NODROP;
6881 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
6882 nativecontents |= CONTENTSQ3_PLAYERCLIP;
6883 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
6884 nativecontents |= CONTENTSQ3_MONSTERCLIP;
6885 if (supercontents & SUPERCONTENTS_DONOTENTER)
6886 nativecontents |= CONTENTSQ3_DONOTENTER;
6887 if (supercontents & SUPERCONTENTS_BOTCLIP)
6888 nativecontents |= CONTENTSQ3_BOTCLIP;
6889 if (!(supercontents & SUPERCONTENTS_OPAQUE))
6890 nativecontents |= CONTENTSQ3_TRANSLUCENT;
6891 return nativecontents;
6894 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
6899 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
6900 node = node->children[1];
6902 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
6903 if (loadmodel->brush.num_leafs < numleafs)
6904 loadmodel->brush.num_leafs = numleafs;
6907 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6910 q3dheader_t *header;
6911 float corner[3], yawradius, modelradius;
6913 mod->modeldatatypestring = "Q3BSP";
6915 mod->type = mod_brushq3;
6916 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
6919 header = (q3dheader_t *)buffer;
6920 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
6921 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
6923 i = LittleLong(header->version);
6924 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
6925 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
6927 mod->soundfromcenter = true;
6928 mod->TraceBox = Mod_Q3BSP_TraceBox;
6929 mod->TraceBrush = Mod_Q3BSP_TraceBrush;
6930 mod->TraceLine = Mod_Q3BSP_TraceLine;
6931 mod->TracePoint = Mod_Q3BSP_TracePoint;
6932 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
6933 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
6934 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
6935 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
6936 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
6937 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
6938 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
6939 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
6940 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
6941 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
6942 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
6943 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6944 mod->brush.AmbientSoundLevelsForPoint = NULL;
6945 mod->brush.RoundUpToHullSize = NULL;
6946 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
6947 mod->Draw = R_Q1BSP_Draw;
6948 mod->DrawDepth = R_Q1BSP_DrawDepth;
6949 mod->DrawDebug = R_Q1BSP_DrawDebug;
6950 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
6951 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
6952 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6953 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6954 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6955 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6956 mod->DrawLight = R_Q1BSP_DrawLight;
6958 mod_base = (unsigned char *)header;
6960 // swap all the lumps
6961 header->ident = LittleLong(header->ident);
6962 header->version = LittleLong(header->version);
6963 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
6964 for (i = 0;i < lumps;i++)
6966 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
6967 if((char *) bufferend < (char *) buffer + j)
6968 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
6969 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
6970 if((char *) bufferend < (char *) buffer + j)
6971 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
6974 * NO, do NOT clear them!
6975 * they contain actual data referenced by other stuff.
6976 * Instead, before using the advertisements lump, check header->versio
6978 * Sorry, but otherwise it breaks memory of the first lump.
6979 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
6981 header->lumps[i].fileofs = 0;
6982 header->lumps[i].filelen = 0;
6986 mod->brush.qw_md4sum = 0;
6987 mod->brush.qw_md4sum2 = 0;
6988 for (i = 0;i < lumps;i++)
6990 if (i == Q3LUMP_ENTITIES)
6992 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6993 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
6995 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6997 // all this checksumming can take a while, so let's send keepalives here too
6998 CL_KeepaliveMessage(false);
7001 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
7002 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
7003 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
7004 if (header->version == Q3BSPVERSION_IG)
7005 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
7007 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
7008 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
7009 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
7010 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
7011 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
7012 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
7013 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
7014 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
7015 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
7016 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
7017 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
7018 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
7019 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
7020 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
7021 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
7023 // the MakePortals code works fine on the q3bsp data as well
7024 Mod_Q1BSP_MakePortals();
7026 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
7027 loadmodel->brush.supportwateralpha = true;
7029 // make a single combined shadow mesh to allow optimized shadow volume creation
7030 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7032 loadmodel->brush.num_leafs = 0;
7033 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
7035 if (loadmodel->brush.numsubmodels)
7036 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7039 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7044 // duplicate the basic information
7045 dpsnprintf(name, sizeof(name), "*%i", i);
7046 mod = Mod_FindName(name, loadmodel->name);
7047 // copy the base model to this one
7049 // rename the clone back to its proper name
7050 strlcpy(mod->name, name, sizeof(mod->name));
7051 mod->brush.parentmodel = loadmodel;
7052 // textures and memory belong to the main model
7053 mod->texturepool = NULL;
7054 mod->mempool = NULL;
7055 mod->brush.GetPVS = NULL;
7056 mod->brush.FatPVS = NULL;
7057 mod->brush.BoxTouchingPVS = NULL;
7058 mod->brush.BoxTouchingLeafPVS = NULL;
7059 mod->brush.BoxTouchingVisibleLeafs = NULL;
7060 mod->brush.FindBoxClusters = NULL;
7061 mod->brush.LightPoint = NULL;
7062 mod->brush.AmbientSoundLevelsForPoint = NULL;
7064 mod->brush.submodel = i;
7065 if (loadmodel->brush.submodels)
7066 loadmodel->brush.submodels[i] = mod;
7068 // make the model surface list (used by shadowing/lighting)
7069 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
7070 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
7071 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
7072 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
7073 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
7074 Mod_MakeSortedSurfaces(mod);
7076 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
7077 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
7078 // enlarge the bounding box to enclose all geometry of this model,
7079 // because q3map2 sometimes lies (mostly to affect the lightgrid),
7080 // which can in turn mess up the farclip (as well as culling when
7081 // outside the level - an unimportant concern)
7083 //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]);
7084 for (j = 0;j < mod->nummodelsurfaces;j++)
7086 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7087 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7089 if (!surface->num_vertices)
7091 for (k = 0;k < surface->num_vertices;k++, v += 3)
7093 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7094 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7095 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7096 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7097 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7098 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7101 //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]);
7102 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7103 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7104 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7105 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7106 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7107 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7108 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7109 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7110 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7111 mod->yawmins[2] = mod->normalmins[2];
7112 mod->yawmaxs[2] = mod->normalmaxs[2];
7113 mod->radius = modelradius;
7114 mod->radius2 = modelradius * modelradius;
7116 // this gets altered below if sky or water is used
7117 mod->DrawSky = NULL;
7118 mod->DrawAddWaterPlanes = NULL;
7120 for (j = 0;j < mod->nummodelsurfaces;j++)
7121 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7123 if (j < mod->nummodelsurfaces)
7124 mod->DrawSky = R_Q1BSP_DrawSky;
7126 for (j = 0;j < mod->nummodelsurfaces;j++)
7127 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7129 if (j < mod->nummodelsurfaces)
7130 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7132 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
7133 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
7135 // generate VBOs and other shared data before cloning submodels
7140 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);
7143 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7145 int i = LittleLong(((int *)buffer)[1]);
7146 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
7147 Mod_Q3BSP_Load(mod,buffer, bufferend);
7148 else if (i == Q2BSPVERSION)
7149 Mod_Q2BSP_Load(mod,buffer, bufferend);
7151 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
7154 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7156 Host_Error("Mod_MAP_Load: not yet implemented");
7162 typedef struct objvertex_s
7173 static unsigned char nobsp_pvs[1] = {1};
7175 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
7177 const char *textbase = (char *)buffer, *text = textbase;
7181 char materialname[MAX_QPATH];
7182 int i, j, l, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, surfacevertices, surfacetriangles, surfaceelements, submodelindex = 0;
7183 int index1, index2, index3;
7184 objvertex_t vfirst, vprev, vcurrent;
7187 int numtriangles = 0;
7188 int maxtriangles = 0;
7189 objvertex_t *vertices = NULL;
7191 int maxtextures = 0, numtextures = 0, textureindex = 0;
7192 int maxv = 0, numv = 1;
7193 int maxvt = 0, numvt = 1;
7194 int maxvn = 0, numvn = 1;
7195 char *texturenames = NULL;
7196 float dist, modelradius, modelyawradius, yawradius;
7203 objvertex_t *thisvertex = NULL;
7204 int vertexhashindex;
7205 int *vertexhashtable = NULL;
7206 objvertex_t *vertexhashdata = NULL;
7207 objvertex_t *vdata = NULL;
7208 int vertexhashsize = 0;
7209 int vertexhashcount = 0;
7210 skinfile_t *skinfiles = NULL;
7211 unsigned char *data = NULL;
7212 int *submodelfirstsurface;
7213 msurface_t *surface;
7214 msurface_t *tempsurfaces;
7216 memset(&vfirst, 0, sizeof(vfirst));
7217 memset(&vprev, 0, sizeof(vprev));
7218 memset(&vcurrent, 0, sizeof(vcurrent));
7220 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
7222 loadmodel->modeldatatypestring = "OBJ";
7224 loadmodel->type = mod_obj;
7225 loadmodel->soundfromcenter = true;
7226 loadmodel->TraceBox = Mod_CollisionBIH_TraceBox;
7227 loadmodel->TraceBrush = Mod_CollisionBIH_TraceBrush;
7228 loadmodel->TraceLine = Mod_CollisionBIH_TraceLine;
7229 loadmodel->TracePoint = Mod_CollisionBIH_TracePoint_Mesh;
7230 loadmodel->PointSuperContents = Mod_CollisionBIH_PointSuperContents_Mesh;
7231 loadmodel->brush.TraceLineOfSight = NULL;
7232 loadmodel->brush.SuperContentsFromNativeContents = NULL;
7233 loadmodel->brush.NativeContentsFromSuperContents = NULL;
7234 loadmodel->brush.GetPVS = NULL;
7235 loadmodel->brush.FatPVS = NULL;
7236 loadmodel->brush.BoxTouchingPVS = NULL;
7237 loadmodel->brush.BoxTouchingLeafPVS = NULL;
7238 loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
7239 loadmodel->brush.FindBoxClusters = NULL;
7240 loadmodel->brush.LightPoint = NULL;
7241 loadmodel->brush.FindNonSolidLocation = NULL;
7242 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
7243 loadmodel->brush.RoundUpToHullSize = NULL;
7244 loadmodel->brush.PointInLeaf = NULL;
7245 loadmodel->Draw = R_Q1BSP_Draw;
7246 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
7247 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
7248 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
7249 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
7250 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7251 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7252 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7253 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7254 loadmodel->DrawLight = R_Q1BSP_DrawLight;
7256 skinfiles = Mod_LoadSkinFiles();
7257 if (loadmodel->numskins < 1)
7258 loadmodel->numskins = 1;
7260 // make skinscenes for the skins (no groups)
7261 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7262 for (i = 0;i < loadmodel->numskins;i++)
7264 loadmodel->skinscenes[i].firstframe = i;
7265 loadmodel->skinscenes[i].framecount = 1;
7266 loadmodel->skinscenes[i].loop = true;
7267 loadmodel->skinscenes[i].framerate = 10;
7273 // parse the OBJ text now
7276 static char emptyarg[1] = "";
7281 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
7282 line[linelen] = text[linelen];
7284 for (argc = 0;argc < 4;argc++)
7285 argv[argc] = emptyarg;
7288 while (*s == ' ' || *s == '\t')
7298 while (*s == ' ' || *s == '\t')
7308 if (argv[0][0] == '#')
7310 if (!strcmp(argv[0], "v"))
7314 maxv = max(maxv * 2, 1024);
7315 v = (float *)Mem_Realloc(tempmempool, v, maxv * sizeof(float[3]));
7317 v[numv*3+0] = atof(argv[1]);
7318 v[numv*3+2] = atof(argv[2]);
7319 v[numv*3+1] = atof(argv[3]);
7322 else if (!strcmp(argv[0], "vt"))
7326 maxvt = max(maxvt * 2, 1024);
7327 vt = (float *)Mem_Realloc(tempmempool, vt, maxvt * sizeof(float[2]));
7329 vt[numvt*2+0] = atof(argv[1]);
7330 vt[numvt*2+1] = 1-atof(argv[2]);
7333 else if (!strcmp(argv[0], "vn"))
7337 maxvn = max(maxvn * 2, 1024);
7338 vn = (float *)Mem_Realloc(tempmempool, vn, maxvn * sizeof(float[3]));
7340 vn[numvn*3+0] = atof(argv[1]);
7341 vn[numvn*3+2] = atof(argv[2]);
7342 vn[numvn*3+1] = atof(argv[3]);
7345 else if (!strcmp(argv[0], "f"))
7349 if (maxtextures <= numtextures)
7351 maxtextures = max(maxtextures * 2, 256);
7352 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7354 textureindex = numtextures++;
7355 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
7357 for (j = 1;j < argc;j++)
7359 index1 = atoi(argv[j]);
7360 while(argv[j][0] && argv[j][0] != '/')
7364 index2 = atoi(argv[j]);
7365 while(argv[j][0] && argv[j][0] != '/')
7369 index3 = atoi(argv[j]);
7370 // negative refers to a recent vertex
7371 // zero means not specified
7372 // positive means an absolute vertex index
7374 index1 = numv - index1;
7376 index2 = numvt - index2;
7378 index3 = numvn - index3;
7379 vcurrent.nextindex = -1;
7380 vcurrent.textureindex = textureindex;
7381 vcurrent.submodelindex = submodelindex;
7382 VectorCopy(v + 3*index1, vcurrent.v);
7383 Vector2Copy(vt + 2*index2, vcurrent.vt);
7384 VectorCopy(vn + 3*index3, vcurrent.vn);
7385 if (numtriangles == 0)
7387 VectorCopy(vcurrent.v, mins);
7388 VectorCopy(vcurrent.v, maxs);
7392 mins[0] = min(mins[0], vcurrent.v[0]);
7393 mins[1] = min(mins[1], vcurrent.v[1]);
7394 mins[2] = min(mins[2], vcurrent.v[2]);
7395 maxs[0] = max(maxs[0], vcurrent.v[0]);
7396 maxs[1] = max(maxs[1], vcurrent.v[1]);
7397 maxs[2] = max(maxs[2], vcurrent.v[2]);
7403 if (maxtriangles <= numtriangles)
7405 maxtriangles = max(maxtriangles * 2, 32768);
7406 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
7408 vertices[numtriangles*3+0] = vfirst;
7409 vertices[numtriangles*3+1] = vprev;
7410 vertices[numtriangles*3+2] = vcurrent;
7416 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
7418 submodelindex = atof(argv[1]);
7419 loadmodel->brush.numsubmodels = max(submodelindex + 1, loadmodel->brush.numsubmodels);
7421 else if (!strcmp(argv[0], "usemtl"))
7423 for (i = 0;i < numtextures;i++)
7424 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
7426 if (i < numtextures)
7430 if (maxtextures <= numtextures)
7432 maxtextures = max(maxtextures * 2, 256);
7433 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7435 textureindex = numtextures++;
7436 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
7441 // now that we have the OBJ data loaded as-is, we can convert it
7443 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
7444 VectorCopy(mins, loadmodel->normalmins);
7445 VectorCopy(maxs, loadmodel->normalmaxs);
7446 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
7447 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
7448 modelyawradius = dist*dist+modelyawradius*modelyawradius;
7449 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
7450 modelradius = modelyawradius + modelradius * modelradius;
7451 modelyawradius = sqrt(modelyawradius);
7452 modelradius = sqrt(modelradius);
7453 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
7454 loadmodel->yawmins[2] = loadmodel->normalmins[2];
7455 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
7456 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
7457 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
7458 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
7459 loadmodel->radius = modelradius;
7460 loadmodel->radius2 = modelradius * modelradius;
7462 // allocate storage for triangles
7463 loadmodel->surfmesh.data_element3i = (int *)Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
7464 // allocate vertex hash structures to build an optimal vertex subset
7465 vertexhashsize = numtriangles*2;
7466 vertexhashtable = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
7467 memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
7468 vertexhashdata = (objvertex_t *)Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
7469 vertexhashcount = 0;
7471 // gather surface stats for assigning vertex/triangle ranges
7475 loadmodel->num_surfaces = 0;
7476 // allocate storage for the worst case number of surfaces, later we resize
7477 tempsurfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, numtextures * loadmodel->brush.numsubmodels * sizeof(msurface_t));
7478 submodelfirstsurface = (int *)Mem_Alloc(loadmodel->mempool, (loadmodel->brush.numsubmodels+1) * sizeof(int));
7479 surface = tempsurfaces;
7480 for (submodelindex = 0;submodelindex < loadmodel->brush.numsubmodels;submodelindex++)
7482 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7483 for (textureindex = 0;textureindex < numtextures;textureindex++)
7485 for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
7487 thisvertex = vertices + vertexindex;
7488 if (thisvertex->submodelindex == submodelindex && thisvertex->textureindex == textureindex)
7491 // skip the surface creation if there are no triangles for it
7492 if (vertexindex == numtriangles*3)
7494 // create a surface for these vertices
7495 surfacevertices = 0;
7496 surfaceelements = 0;
7497 // we hack in a texture index in the surface to be fixed up later...
7498 surface->texture = (texture_t *)((size_t)textureindex);
7499 // calculate bounds as we go
7500 VectorCopy(thisvertex->v, surface->mins);
7501 VectorCopy(thisvertex->v, surface->maxs);
7502 for (;vertexindex < numtriangles*3;vertexindex++)
7504 thisvertex = vertices + vertexindex;
7505 if (thisvertex->submodelindex != submodelindex)
7507 if (thisvertex->textureindex != textureindex)
7509 // add vertex to surface bounds
7510 surface->mins[0] = min(surface->mins[0], thisvertex->v[0]);
7511 surface->mins[1] = min(surface->mins[1], thisvertex->v[1]);
7512 surface->mins[2] = min(surface->mins[2], thisvertex->v[2]);
7513 surface->maxs[0] = max(surface->maxs[0], thisvertex->v[0]);
7514 surface->maxs[1] = max(surface->maxs[1], thisvertex->v[1]);
7515 surface->maxs[2] = max(surface->maxs[2], thisvertex->v[2]);
7516 // add the vertex if it is not found in the merged set, and
7517 // get its index (triangle element) for the surface
7518 vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
7519 for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
7521 vdata = vertexhashdata + i;
7522 if (vdata->submodelindex == thisvertex->submodelindex && vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
7527 i = vertexhashcount++;
7528 vdata = vertexhashdata + i;
7529 *vdata = *thisvertex;
7530 vdata->nextindex = vertexhashtable[vertexhashindex];
7531 vertexhashtable[vertexhashindex] = i;
7534 loadmodel->surfmesh.data_element3i[elementindex++] = i;
7537 surfacetriangles = surfaceelements / 3;
7538 surface->num_vertices = surfacevertices;
7539 surface->num_triangles = surfacetriangles;
7540 surface->num_firstvertex = firstvertex;
7541 surface->num_firsttriangle = firsttriangle;
7542 firstvertex += surface->num_vertices;
7543 firsttriangle += surface->num_triangles;
7545 loadmodel->num_surfaces++;
7548 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7549 numvertices = firstvertex;
7550 loadmodel->data_surfaces = (msurface_t *)Mem_Realloc(loadmodel->mempool, tempsurfaces, loadmodel->num_surfaces * sizeof(msurface_t));
7551 tempsurfaces = NULL;
7553 // allocate storage for final mesh data
7554 loadmodel->num_textures = numtextures * loadmodel->numskins;
7555 loadmodel->num_texturesperskin = numtextures;
7556 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 *));
7557 loadmodel->brush.submodels = (dp_model_t **)data;data += loadmodel->brush.numsubmodels * sizeof(dp_model_t *);
7558 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
7559 loadmodel->data_textures = (texture_t *)data;data += loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t);
7560 loadmodel->surfmesh.num_vertices = numvertices;
7561 loadmodel->surfmesh.num_triangles = numtriangles;
7562 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += numtriangles * sizeof(int[3]);
7563 loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
7564 loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
7565 loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
7566 loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
7567 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
7568 if (loadmodel->surfmesh.num_vertices <= 65536)
7569 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
7571 for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
7573 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
7574 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
7575 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
7578 // load the textures
7579 for (textureindex = 0;textureindex < numtextures;textureindex++)
7580 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
7581 Mod_FreeSkinFiles(skinfiles);
7583 // set the surface textures to their real values now that we loaded them...
7584 for (i = 0;i < loadmodel->num_surfaces;i++)
7585 loadmodel->data_surfaces[i].texture = loadmodel->data_textures + (size_t)loadmodel->data_surfaces[i].texture;
7589 Mem_Free(texturenames);
7593 Mem_Free(vertexhashtable);
7594 Mem_Free(vertexhashdata);
7596 // make a single combined shadow mesh to allow optimized shadow volume creation
7597 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7599 // compute all the mesh information that was not loaded from the file
7600 if (loadmodel->surfmesh.data_element3s)
7601 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
7602 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
7603 Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
7604 // generate normals if the file did not have them
7605 if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
7606 Mod_BuildNormals(0, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.data_normal3f, true);
7607 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, true);
7608 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
7610 // if this is a worldmodel and has no BSP tree, create a fake one for the purpose
7611 loadmodel->brush.num_visleafs = 1;
7612 loadmodel->brush.num_leafs = 1;
7613 loadmodel->brush.num_nodes = 0;
7614 loadmodel->brush.num_leafsurfaces = loadmodel->num_surfaces;
7615 loadmodel->brush.data_leafs = (mleaf_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
7616 loadmodel->brush.data_nodes = (mnode_t *)loadmodel->brush.data_leafs;
7617 loadmodel->brush.num_pvsclusters = 1;
7618 loadmodel->brush.num_pvsclusterbytes = 1;
7619 loadmodel->brush.data_pvsclusters = nobsp_pvs;
7620 //if (loadmodel->num_nodes) loadmodel->data_nodes = (mnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_nodes * sizeof(mnode_t));
7621 //loadmodel->data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->num_leafsurfaces * sizeof(int));
7622 loadmodel->brush.data_leafsurfaces = loadmodel->sortedmodelsurfaces;
7623 VectorCopy(loadmodel->normalmins, loadmodel->brush.data_leafs->mins);
7624 VectorCopy(loadmodel->normalmaxs, loadmodel->brush.data_leafs->maxs);
7625 loadmodel->brush.data_leafs->combinedsupercontents = 0; // FIXME?
7626 loadmodel->brush.data_leafs->clusterindex = 0;
7627 loadmodel->brush.data_leafs->areaindex = 0;
7628 loadmodel->brush.data_leafs->numleafsurfaces = loadmodel->brush.num_leafsurfaces;
7629 loadmodel->brush.data_leafs->firstleafsurface = loadmodel->brush.data_leafsurfaces;
7630 loadmodel->brush.data_leafs->numleafbrushes = 0;
7631 loadmodel->brush.data_leafs->firstleafbrush = NULL;
7632 loadmodel->brush.supportwateralpha = true;
7634 if (loadmodel->brush.numsubmodels)
7635 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7638 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7643 // duplicate the basic information
7644 dpsnprintf(name, sizeof(name), "*%i", i);
7645 mod = Mod_FindName(name, loadmodel->name);
7646 // copy the base model to this one
7648 // rename the clone back to its proper name
7649 strlcpy(mod->name, name, sizeof(mod->name));
7650 mod->brush.parentmodel = loadmodel;
7651 // textures and memory belong to the main model
7652 mod->texturepool = NULL;
7653 mod->mempool = NULL;
7654 mod->brush.GetPVS = NULL;
7655 mod->brush.FatPVS = NULL;
7656 mod->brush.BoxTouchingPVS = NULL;
7657 mod->brush.BoxTouchingLeafPVS = NULL;
7658 mod->brush.BoxTouchingVisibleLeafs = NULL;
7659 mod->brush.FindBoxClusters = NULL;
7660 mod->brush.LightPoint = NULL;
7661 mod->brush.AmbientSoundLevelsForPoint = NULL;
7663 mod->brush.submodel = i;
7664 if (loadmodel->brush.submodels)
7665 loadmodel->brush.submodels[i] = mod;
7667 // make the model surface list (used by shadowing/lighting)
7668 mod->firstmodelsurface = submodelfirstsurface[i];
7669 mod->nummodelsurfaces = submodelfirstsurface[i+1] - submodelfirstsurface[i];
7670 mod->firstmodelbrush = 0;
7671 mod->nummodelbrushes = 0;
7672 mod->sortedmodelsurfaces = loadmodel->sortedmodelsurfaces + mod->firstmodelsurface;
7673 Mod_MakeSortedSurfaces(mod);
7675 VectorClear(mod->normalmins);
7676 VectorClear(mod->normalmaxs);
7678 for (j = 0;j < mod->nummodelsurfaces;j++)
7680 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7681 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7683 if (!surface->num_vertices)
7688 VectorCopy(v, mod->normalmins);
7689 VectorCopy(v, mod->normalmaxs);
7691 for (k = 0;k < surface->num_vertices;k++, v += 3)
7693 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7694 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7695 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7696 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7697 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7698 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7701 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7702 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7703 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7704 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7705 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7706 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7707 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7708 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7709 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7710 mod->yawmins[2] = mod->normalmins[2];
7711 mod->yawmaxs[2] = mod->normalmaxs[2];
7712 mod->radius = modelradius;
7713 mod->radius2 = modelradius * modelradius;
7715 // this gets altered below if sky or water is used
7716 mod->DrawSky = NULL;
7717 mod->DrawAddWaterPlanes = NULL;
7719 for (j = 0;j < mod->nummodelsurfaces;j++)
7720 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7722 if (j < mod->nummodelsurfaces)
7723 mod->DrawSky = R_Q1BSP_DrawSky;
7725 for (j = 0;j < mod->nummodelsurfaces;j++)
7726 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7728 if (j < mod->nummodelsurfaces)
7729 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7731 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
7732 mod->render_bih = mod->collision_bih;
7734 // generate VBOs and other shared data before cloning submodels
7739 Mem_Free(submodelfirstsurface);
7741 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);
7756 typedef struct objvertex_s
7764 typedef struct objtriangle_s
7766 objvertex_t vertex[3];
7768 // these fields are used only in conversion to surfaces
7771 int surfacevertexindex[3];
7772 float edgeplane[3][4];
7778 struct objnode_s *children[2];
7779 struct objnode_s *parent;
7780 objtriangle_t *triangles;
7789 objnode_t *Mod_OBJ_BSPNodeForTriangles(objnode_t *parent, objtriangle_t *triangles, int numtriangles, const float *mins, const float *maxs, mem_expandablearray_t *nodesarray, int maxclippedtriangles, objtriangle_t *clippedfronttriangles, objtriangle_t *clippedbacktriangles)
7795 float bestnormal[3];
7800 int numfronttriangles;
7801 int numbacktriangles;
7806 float outfrontpoints[5][3];
7807 float outbackpoints[5][3];
7808 int neededfrontpoints;
7809 int neededbackpoints;
7813 node = (objnode_t *)Mem_ExpandableArray_AllocRecord(array);
7814 node->parent = parent;
7817 VectorCopy(triangles[0].vertex[0].v, mins);
7818 VectorCopy(triangles[0].vertex[0].v, maxs);
7820 else if (parent && parent->children[0] == node)
7822 VectorCopy(parent->mins, mins);
7823 Vectorcopy(parent->maxs, maxs);
7825 else if (parent && parent->children[1] == node)
7827 VectorCopy(parent->mins, mins);
7828 Vectorcopy(parent->maxs, maxs);
7835 for (i = 0;i < numtriangles;i++)
7837 for (j = 0;j < 3;j++)
7839 mins[0] = min(mins[0], triangles[i].vertex[j].v[0]);
7840 mins[1] = min(mins[1], triangles[i].vertex[j].v[1]);
7841 mins[2] = min(mins[2], triangles[i].vertex[j].v[2]);
7842 maxs[0] = max(maxs[0], triangles[i].vertex[j].v[0]);
7843 maxs[1] = max(maxs[1], triangles[i].vertex[j].v[1]);
7844 maxs[2] = max(maxs[2], triangles[i].vertex[j].v[2]);
7847 VectorCopy(mins, node->mins);
7848 VectorCopy(maxs, node->maxs);
7849 if (numtriangles <= mod_obj_leaftriangles.integer)
7852 loadmodel->brush.num_leafs++;
7853 node->triangles = triangles;
7854 node->numtriangles = numtriangles;
7859 loadmodel->brush.num_nodes++;
7860 // pick a splitting plane from the various choices available to us...
7861 // early splits simply halve the interval
7863 VectorClear(bestnormal);
7865 if (numtriangles <= mod_obj_splitterlimit.integer)
7866 limit = numtriangles;
7869 for (i = -3;i < limit;i++)
7873 // first we try 3 axial splits (kdtree-like)
7875 VectorClear(normal);
7877 dist = (mins[j] + maxs[j]) * 0.5f;
7881 // then we try each triangle plane
7882 TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
7883 VectorNormalize(normal);
7884 dist = DotProduct(normal, triangles[i].vertex[0].v);
7885 // use positive axial values whenever possible
7886 if (normal[0] == -1)
7888 if (normal[1] == -1)
7890 if (normal[2] == -1)
7892 // skip planes that match the current best
7893 if (VectorCompare(normal, bestnormal) && dist == bestdist)
7900 for (j = 0;j < numtriangles;j++)
7902 dists[0] = DotProduct(normal, triangles[j].vertex[0].v) - dist;
7903 dists[1] = DotProduct(normal, triangles[j].vertex[1].v) - dist;
7904 dists[2] = DotProduct(normal, triangles[j].vertex[2].v) - dist;
7905 if (dists[0] < -DIST_EPSILON || dists[1] < -DIST_EPSILON || dists[2] < -DIST_EPSILON)
7907 if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
7912 else if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
7917 // score is supposed to:
7918 // prefer axial splits
7919 // prefer evenly dividing the input triangles
7920 // prefer triangles on the plane
7921 // avoid triangles crossing the plane
7922 score = count_on*count_on - count_both*count_both + min(count_front, count_back)*(count_front+count_back);
7923 if (normal[0] == 1 || normal[1] == 1 || normal[2] == 1)
7925 if (i == -3 || bestscore < score)
7927 VectorCopy(normal, bestnormal);
7933 // now we have chosen an optimal split plane...
7935 // divide triangles by the splitting plane
7936 numfronttriangles = 0;
7937 numbacktriangles = 0;
7938 for (i = 0;i < numtriangles;i++)
7940 neededfrontpoints = 0;
7941 neededbackpoints = 0;
7943 PolygonF_Divide(3, triangles[i].vertex[0].v, bestnormal[0], bestnormal[1], bestnormal[2], bestdist, DIST_EPSILON, 5, outfrontpoints[0], &neededfrontpoints, 5, outbackpoints[0], &neededbackpoints, &countonpoints);
7944 if (countonpoints > 1)
7946 // triangle lies on plane, assign it to one child only
7947 TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
7948 if (DotProduct(bestnormal, normal) >= 0)
7950 // assign to front side child
7951 obj_fronttriangles[numfronttriangles++] = triangles[i];
7955 // assign to back side child
7956 obj_backtriangles[numbacktriangles++] = triangles[i];
7961 // convert clipped polygons to triangles
7962 for (j = 0;j < neededfrontpoints-2;j++)
7964 obj_fronttriangles[numfronttriangles] = triangles[i];
7965 VectorCopy(outfrontpoints[0], obj_fronttriangles[numfronttriangles].vertex[0].v);
7966 VectorCopy(outfrontpoints[j+1], obj_fronttriangles[numfronttriangles].vertex[1].v);
7967 VectorCopy(outfrontpoints[j+2], obj_fronttriangles[numfronttriangles].vertex[2].v);
7968 numfronttriangles++;
7970 for (j = 0;j < neededbackpoints-2;j++)
7972 obj_backtriangles[numbacktriangles] = triangles[i];
7973 VectorCopy(outbackpoints[0], obj_backtriangles[numbacktriangles].vertex[0].v);
7974 VectorCopy(outbackpoints[j+1], obj_backtriangles[numbacktriangles].vertex[1].v);
7975 VectorCopy(outbackpoints[j+2], obj_backtriangles[numbacktriangles].vertex[2].v);
7981 // now copy the triangles out of the big buffer
7982 if (numfronttriangles)
7984 fronttriangles = Mem_Alloc(loadmodel->mempool, fronttriangles * sizeof(*fronttriangles));
7985 memcpy(fronttriangles, obj_fronttriangles, numfronttriangles * sizeof(*fronttriangles));
7988 fronttriangles = NULL;
7989 if (numbacktriangles)
7991 backtriangles = Mem_Alloc(loadmodel->mempool, backtriangles * sizeof(*backtriangles));
7992 memcpy(backtriangles, obj_backtriangles, numbacktriangles * sizeof(*backtriangles));
7995 backtriangles = NULL;
7997 // free the original triangles we were given
7999 Mem_Free(triangles);
8003 // now create the children...
8004 node->children[0] = Mod_OBJ_BSPNodeForTriangles(node, fronttriangles, numfronttriangles, frontmins, frontmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8005 node->children[1] = Mod_OBJ_BSPNodeForTriangles(node, backtriangles, numbacktriangles, backmins, backmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8009 void Mod_OBJ_SnapVertex(float *v)
8012 float a = mod_obj_vertexprecision.value;
8014 v[0] -= floor(v[0] * a + 0.5f) * b;
8015 v[1] -= floor(v[1] * a + 0.5f) * b;
8016 v[2] -= floor(v[2] * a + 0.5f) * b;
8019 void Mod_OBJ_ConvertBSPNode(objnode_t *objnode, mnode_t *mnodeparent)
8021 if (objnode->children[0])
8023 // convert to mnode_t
8024 mnode_t *mnode = loadmodel->brush.data_nodes + loadmodel->brush.num_nodes++;
8025 mnode->parent = mnodeparent;
8026 mnode->plane = loadmodel->brush.data_planes + loadmodel->brush.num_planes++;
8027 VectorCopy(objnode->normal, mnode->plane->normal);
8028 mnode->plane->dist = objnode->dist;
8029 PlaneClassify(mnode->plane);
8030 VectorCopy(objnode->mins, mnode->mins);
8031 VectorCopy(objnode->maxs, mnode->maxs);
8032 // push combinedsupercontents up to the parent
8034 mnodeparent->combinedsupercontents |= mnode->combinedsupercontents;
8035 mnode->children[0] = Mod_OBJ_ConvertBSPNode(objnode->children[0], mnode);
8036 mnode->children[1] = Mod_OBJ_ConvertBSPNode(objnode->children[1], mnode);
8040 // convert to mleaf_t
8041 mleaf_t *mleaf = loadmodel->brush.data_leafs + loadmodel->brush.num_leafs++;
8042 mleaf->parent = mnodeparent;
8043 VectorCopy(objnode->mins, mleaf->mins);
8044 VectorCopy(objnode->maxs, mleaf->maxs);
8045 mleaf->clusterindex = loadmodel->brush.num_leafs - 1;
8046 if (objnode->numtriangles)
8048 objtriangle_t *triangles = objnode->triangles;
8049 int numtriangles = objnode->numtriangles;
8053 objvertex_t vertex[3];
8055 maxsurfaces = numtriangles;
8057 // calculate some more data on each triangle for surface gathering
8058 for (i = 0;i < numtriangles;i++)
8060 triangle = triangles + i;
8061 texture = loadmodel->data_textures + triangle->textureindex;
8062 Mod_OBJ_SnapVertex(triangle->vertex[0].v);
8063 Mod_OBJ_SnapVertex(triangle->vertex[1].v);
8064 Mod_OBJ_SnapVertex(triangle->vertex[2].v);
8065 TriangleNormal(triangle->vertex[0].v, triangle->vertex[1].v, triangle->vertex[2].v, normal);
8067 if (fabs(normal[axis]) < fabs(normal[1]))
8069 if (fabs(normal[axis]) < fabs(normal[2]))
8071 VectorClear(normal);
8073 triangle->axis = axis;
8074 VectorSubtract(triangle->vertex[1].v, triangle->vertex[0].v, edge[0]);
8075 VectorSubtract(triangle->vertex[2].v, triangle->vertex[1].v, edge[1]);
8076 VectorSubtract(triangle->vertex[0].v, triangle->vertex[2].v, edge[2]);
8077 CrossProduct(edge[0], normal, triangle->edgeplane[0]);
8078 CrossProduct(edge[1], normal, triangle->edgeplane[1]);
8079 CrossProduct(edge[2], normal, triangle->edgeplane[2]);
8080 VectorNormalize(triangle->edgeplane[0]);
8081 VectorNormalize(triangle->edgeplane[1]);
8082 VectorNormalize(triangle->edgeplane[2]);
8083 triangle->edgeplane[0][3] = DotProduct(triangle->edgeplane[0], triangle->vertex[0].v);
8084 triangle->edgeplane[1][3] = DotProduct(triangle->edgeplane[1], triangle->vertex[1].v);
8085 triangle->edgeplane[2][3] = DotProduct(triangle->edgeplane[2], triangle->vertex[2].v);
8086 triangle->surfaceindex = 0;
8087 // add to the combined supercontents while we're here...
8088 mleaf->combinedsupercontents |= texture->supercontents;
8091 for (i = 0;i < numtriangles;i++)
8093 // skip already-assigned triangles
8094 if (triangles[i].surfaceindex)
8096 texture = loadmodel->data_textures + triangles[i].textureindex;
8097 // assign a new surface to this triangle
8098 triangles[i].surfaceindex = surfaceindex++;
8099 axis = triangles[i].axis;
8101 // find the triangle's neighbors, this can take multiple passes
8106 for (j = i+1;j < numtriangles;j++)
8108 if (triangles[j].surfaceindex || triangles[j].axis != axis || triangles[j].texture != texture)
8110 triangle = triangles + j;
8111 for (k = i;k < j;k++)
8113 if (triangles[k].surfaceindex != surfaceindex)
8115 if (VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[0].v)
8116 || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[1].v)
8117 || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[2].v)
8118 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[0].v)
8119 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[1].v)
8120 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[2].v)
8121 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[0].v)
8122 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[1].v)
8123 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[2].v))
8125 // shares a vertex position
8129 for (k = 0;k < numvertices;k++)
8130 if (!VectorCompare(vertex[k].v, triangles[j].vertex[0].v) || !VectorCompare(vertex[k].v, triangles[j].vertex[1].v) || !VectorCompare(vertex[k].v, triangles[j].vertex[2].v))
8132 if (k == numvertices)
8133 break; // not a neighbor
8134 // this triangle is a neighbor and has the same axis and texture
8135 // check now if it overlaps in lightmap projection space
8136 triangles[j].surfaceindex;
8140 //triangles[i].surfaceindex = surfaceindex++;
8141 for (surfaceindex = 0;surfaceindex < numsurfaces;surfaceindex++)
8143 if (surfaces[surfaceindex].texture != texture)
8145 // check if any triangles already in this surface overlap in lightmap projection space
8152 // let the collision code simply use the surfaces
8153 mleaf->containscollisionsurfaces = mleaf->combinedsupercontents != 0;
8154 mleaf->numleafsurfaces = ?;
8155 mleaf->firstleafsurface = ?;
8157 // push combinedsupercontents up to the parent
8159 mnodeparent->combinedsupercontents |= mleaf->combinedsupercontents;
8164 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
8167 const char *textbase = (char *)buffer, *text = textbase;
8171 char materialname[MAX_QPATH];
8172 int j, index1, index2, index3, first, prev, index;
8175 int numtriangles = 0;
8176 int maxtriangles = 131072;
8177 objtriangle_t *triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
8179 int maxtextures = 256, numtextures = 0, textureindex = 0;
8180 int maxv = 1024, numv = 0;
8181 int maxvt = 1024, numvt = 0;
8182 int maxvn = 1024, numvn = 0;
8183 char **texturenames;
8184 float *v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
8185 float *vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
8186 float *vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
8187 objvertex_t vfirst, vprev, vcurrent;
8192 int maxverthash = 65536, numverthash = 0;
8193 int numhashindex = 65536;
8194 struct objverthash_s
8196 struct objverthash_s *next;
8202 *hash, **verthash = Mem_Alloc(tempmempool, numhashindex * sizeof(*verthash)), *verthashdata = Mem_Alloc(tempmempool, maxverthash * sizeof(*verthashdata)), *oldverthashdata;
8205 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
8207 loadmodel->modeldatatypestring = "OBJ";
8209 loadmodel->type = mod_obj;
8210 loadmodel->soundfromcenter = true;
8211 loadmodel->TraceBox = Mod_OBJ_TraceBox;
8212 loadmodel->TraceLine = Mod_OBJ_TraceLine;
8213 loadmodel->TracePoint = Mod_OBJ_TracePoint;
8214 loadmodel->PointSuperContents = Mod_OBJ_PointSuperContents;
8215 loadmodel->brush.TraceLineOfSight = Mod_OBJ_TraceLineOfSight;
8216 loadmodel->brush.SuperContentsFromNativeContents = Mod_OBJ_SuperContentsFromNativeContents;
8217 loadmodel->brush.NativeContentsFromSuperContents = Mod_OBJ_NativeContentsFromSuperContents;
8218 loadmodel->brush.GetPVS = Mod_OBJ_GetPVS;
8219 loadmodel->brush.FatPVS = Mod_OBJ_FatPVS;
8220 loadmodel->brush.BoxTouchingPVS = Mod_OBJ_BoxTouchingPVS;
8221 loadmodel->brush.BoxTouchingLeafPVS = Mod_OBJ_BoxTouchingLeafPVS;
8222 loadmodel->brush.BoxTouchingVisibleLeafs = Mod_OBJ_BoxTouchingVisibleLeafs;
8223 loadmodel->brush.FindBoxClusters = Mod_OBJ_FindBoxClusters;
8224 loadmodel->brush.LightPoint = Mod_OBJ_LightPoint;
8225 loadmodel->brush.FindNonSolidLocation = Mod_OBJ_FindNonSolidLocation;
8226 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
8227 loadmodel->brush.RoundUpToHullSize = NULL;
8228 loadmodel->brush.PointInLeaf = Mod_OBJ_PointInLeaf;
8229 loadmodel->Draw = R_Q1BSP_Draw;
8230 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
8231 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
8232 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
8233 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
8234 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
8235 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
8236 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
8237 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
8238 loadmodel->DrawLight = R_Q1BSP_DrawLight;
8243 // parse the OBJ text now
8250 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
8251 line[linelen] = text[linelen];
8253 for (argc = 0;argc < (int)(sizeof(argv)/sizeof(argv[0]));argc++)
8257 while (*s == ' ' || *s == '\t')
8267 while (*s == ' ' || *s == '\t')
8272 if (argv[0][0] == '#')
8274 if (!strcmp(argv[0], "v"))
8280 v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
8283 memcpy(v, oldv, numv * sizeof(float[3]));
8287 v[numv*3+0] = atof(argv[1]);
8288 v[numv*3+1] = atof(argv[2]);
8289 v[numv*3+2] = atof(argv[3]);
8292 else if (!strcmp(argv[0], "vt"))
8298 vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
8301 memcpy(vt, oldvt, numvt * sizeof(float[2]));
8305 vt[numvt*2+0] = atof(argv[1]);
8306 vt[numvt*2+1] = atof(argv[2]);
8309 else if (!strcmp(argv[0], "vn"))
8315 vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
8318 memcpy(vn, oldvn, numvn * sizeof(float[3]));
8322 vn[numvn*3+0] = atof(argv[1]);
8323 vn[numvn*3+1] = atof(argv[2]);
8324 vn[numvn*3+2] = atof(argv[3]);
8327 else if (!strcmp(argv[0], "f"))
8329 for (j = 1;j < argc;j++)
8331 index1 = atoi(argv[j]);
8332 while(argv[j][0] && argv[j][0] != '/')
8336 index2 = atoi(argv[j]);
8337 while(argv[j][0] && argv[j][0] != '/')
8341 index3 = atoi(argv[j]);
8342 // negative refers to a recent vertex
8343 // zero means not specified
8344 // positive means an absolute vertex index
8346 index1 = numv - index1;
8348 index2 = numvt - index2;
8350 index3 = numvn - index3;
8351 VectorCopy(v + 3*index1, vcurrent.v);
8352 Vector2Copy(vt + 2*index2, vcurrent.vt);
8353 VectorCopy(vn + 3*index3, vcurrent.vn);
8354 if (numtriangles == 0)
8356 VectorCopy(vcurrent.v, mins);
8357 VectorCopy(vcurrent.v, maxs);
8361 mins[0] = min(mins[0], vcurrent.v[0]);
8362 mins[1] = min(mins[1], vcurrent.v[1]);
8363 mins[2] = min(mins[2], vcurrent.v[2]);
8364 maxs[0] = max(maxs[0], vcurrent.v[0]);
8365 maxs[1] = max(maxs[1], vcurrent.v[1]);
8366 maxs[2] = max(maxs[2], vcurrent.v[2]);
8372 if (maxtriangles <= numtriangles)
8374 objtriangle_t *oldtriangles = triangles;
8376 triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
8379 memcpy(triangles, oldtriangles, maxtriangles * sizeof(*triangles));
8380 Mem_Free(oldtriangles);
8383 triangles[numtriangles].textureindex = textureindex;
8384 triangles[numtriangles].vertex[0] = vfirst;
8385 triangles[numtriangles].vertex[1] = vprev;
8386 triangles[numtriangles].vertex[2] = vcurrent;
8393 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
8395 else if (!!strcmp(argv[0], "usemtl"))
8397 for (i = 0;i < numtextures;i++)
8398 if (!strcmp(texturenames[numtextures], argv[1]))
8400 if (i < numtextures)
8401 texture = textures + i;
8404 if (maxtextures <= numtextures)
8406 texture_t *oldtextures = textures;
8408 textures = Mem_Alloc(tempmempool, maxtextures * sizeof(*textures));
8411 memcpy(textures, oldtextures, numtextures * sizeof(*textures));
8412 Mem_Free(oldtextures);
8415 textureindex = numtextures++;
8416 texturenames[textureindex] = Mem_Alloc(tempmempool, strlen(argv[1]) + 1);
8417 memcpy(texturenames[textureindex], argv[1], strlen(argv[1]) + 1);
8427 // now that we have the OBJ data loaded as-is, we can convert it
8429 // load the textures
8430 loadmodel->num_textures = numtextures;
8431 loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
8432 for (i = 0;i < numtextures;i++)
8433 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, texturenames[i], true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
8435 // free the texturenames array since we are now done with it
8436 for (i = 0;i < numtextures;i++)
8438 Mem_Free(texturenames[i]);
8439 texturenames[i] = NULL;
8441 Mem_Free(texturenames);
8442 texturenames = NULL;
8444 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
8445 VectorCopy(mins, loadmodel->normalmins);
8446 VectorCopy(maxs, loadmodel->normalmaxs);
8447 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
8448 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
8449 modelyawradius = dist*dist+modelyawradius*modelyawradius;
8450 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
8451 modelradius = modelyawradius + modelradius * modelradius;
8452 modelyawradius = sqrt(modelyawradius);
8453 modelradius = sqrt(modelradius);
8454 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
8455 loadmodel->yawmins[2] = loadmodel->normalmins[2];
8456 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
8457 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
8458 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
8459 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
8460 loadmodel->radius = modelradius;
8461 loadmodel->radius2 = modelradius * modelradius;
8463 // make sure the temp triangle buffer is big enough for BSP building
8464 maxclippedtriangles = numtriangles*4;
8465 if (numtriangles > 0)
8467 clippedfronttriangles = Mem_Alloc(loadmodel->mempool, maxclippedtriangles * 2 * sizeof(objtriangle_t));
8468 clippedbacktriangles = clippedfronttriangles + maxclippedtriangles;
8471 // generate a rough BSP tree from triangle data, we don't have to be too careful here, it only has to define the basic areas of the map
8472 loadmodel->brush.num_leafs = 0;
8473 loadmodel->brush.num_nodes = 0;
8474 Mem_ExpandableArray_NewArray(&nodesarray, loadmodel->mempool, sizeof(objnode_t), 1024);
8475 rootnode = Mod_OBJ_BSPNodeForTriangles(triangles, numtriangles, mins, maxs, &nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8477 // convert the BSP tree to mnode_t and mleaf_t structures and convert the triangles to msurface_t...
8478 loadmodel->brush.data_leafs = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
8479 loadmodel->brush.data_nodes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mnode_t));
8480 loadmodel->brush.data_planes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mplane_t));
8481 loadmodel->brush.num_leafs = 0;
8482 loadmodel->brush.num_nodes = 0;
8483 loadmodel->brush.num_planes = 0;
8484 Mod_OBJ_ConvertAndFreeBSPNode(rootnode);
8486 if (clippedfronttriangles)
8487 Mem_Free(clippedfronttriangles);
8488 maxclippedtriangles = 0;
8489 clippedfronttriangles = NULL;
8490 clippedbacktriangles = NULL;
8492 --- NOTHING DONE PAST THIS POINT ---
8494 loadmodel->numskins = LittleLong(pinmodel->num_skins);
8495 numxyz = LittleLong(pinmodel->num_xyz);
8496 numst = LittleLong(pinmodel->num_st);
8497 loadmodel->surfmesh.num_triangles = LittleLong(pinmodel->num_tris);
8498 loadmodel->numframes = LittleLong(pinmodel->num_frames);
8499 loadmodel->surfmesh.num_morphframes = loadmodel->numframes;
8500 loadmodel->num_poses = loadmodel->surfmesh.num_morphframes;
8501 skinwidth = LittleLong(pinmodel->skinwidth);
8502 skinheight = LittleLong(pinmodel->skinheight);
8503 iskinwidth = 1.0f / skinwidth;
8504 iskinheight = 1.0f / skinheight;
8506 loadmodel->num_surfaces = 1;
8507 loadmodel->nummodelsurfaces = loadmodel->num_surfaces;
8508 data = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * sizeof(msurface_t) + loadmodel->num_surfaces * sizeof(int) + loadmodel->numframes * sizeof(animscene_t) + loadmodel->numframes * sizeof(float[6]) + loadmodel->surfmesh.num_triangles * sizeof(int[3]) + loadmodel->surfmesh.num_triangles * sizeof(int[3]));
8509 loadmodel->data_surfaces = (msurface_t *)data;data += loadmodel->num_surfaces * sizeof(msurface_t);
8510 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
8511 loadmodel->sortedmodelsurfaces[0] = 0;
8512 loadmodel->animscenes = (animscene_t *)data;data += loadmodel->numframes * sizeof(animscene_t);
8513 loadmodel->surfmesh.data_morphmd2framesize6f = (float *)data;data += loadmodel->numframes * sizeof(float[6]);
8514 loadmodel->surfmesh.data_element3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
8515 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
8517 loadmodel->synctype = ST_RAND;
8520 inskin = (char *)(base + LittleLong(pinmodel->ofs_skins));
8521 skinfiles = Mod_LoadSkinFiles();
8524 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8525 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8526 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8527 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures, skinfiles, "default", "");
8528 Mod_FreeSkinFiles(skinfiles);
8530 else if (loadmodel->numskins)
8532 // skins found (most likely not a player model)
8533 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8534 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8535 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8536 for (i = 0;i < loadmodel->numskins;i++, inskin += MD2_SKINNAME)
8537 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i * loadmodel->num_surfaces, inskin, true, true, (r_mipskins.integer ? TEXF_MIPMAP : 0) | TEXF_ALPHA | TEXF_PICMIP | TEXF_COMPRESS);
8541 // no skins (most likely a player model)
8542 loadmodel->numskins = 1;
8543 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8544 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8545 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8546 Mod_BuildAliasSkinFromSkinFrame(loadmodel->data_textures, NULL);
8549 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
8550 for (i = 0;i < loadmodel->numskins;i++)
8552 loadmodel->skinscenes[i].firstframe = i;
8553 loadmodel->skinscenes[i].framecount = 1;
8554 loadmodel->skinscenes[i].loop = true;
8555 loadmodel->skinscenes[i].framerate = 10;
8558 // load the triangles and stvert data
8559 inst = (unsigned short *)(base + LittleLong(pinmodel->ofs_st));
8560 intri = (md2triangle_t *)(base + LittleLong(pinmodel->ofs_tris));
8561 md2verthash = (struct md2verthash_s **)Mem_Alloc(tempmempool, 65536 * sizeof(hash));
8562 md2verthashdata = (struct md2verthash_s *)Mem_Alloc(tempmempool, loadmodel->surfmesh.num_triangles * 3 * sizeof(*hash));
8563 // swap the triangle list
8564 loadmodel->surfmesh.num_vertices = 0;
8565 for (i = 0;i < loadmodel->surfmesh.num_triangles;i++)
8567 for (j = 0;j < 3;j++)
8569 xyz = (unsigned short) LittleShort (intri[i].index_xyz[j]);
8570 st = (unsigned short) LittleShort (intri[i].index_st[j]);
8573 Con_Printf("%s has an invalid xyz index (%i) on triangle %i, resetting to 0\n", loadmodel->name, xyz, i);
8578 Con_Printf("%s has an invalid st index (%i) on triangle %i, resetting to 0\n", loadmodel->name, st, i);
8581 hashindex = (xyz * 256 + st) & 65535;
8582 for (hash = md2verthash[hashindex];hash;hash = hash->next)
8583 if (hash->xyz == xyz && hash->st == st)
8587 hash = md2verthashdata + loadmodel->surfmesh.num_vertices++;
8590 hash->next = md2verthash[hashindex];
8591 md2verthash[hashindex] = hash;
8593 loadmodel->surfmesh.data_element3i[i*3+j] = (hash - md2verthashdata);
8597 vertremap = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(int));
8598 data = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(float[2]) + loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t));
8599 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += loadmodel->surfmesh.num_vertices * sizeof(float[2]);
8600 loadmodel->surfmesh.data_morphmdlvertex = (trivertx_t *)data;data += loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t);
8601 for (i = 0;i < loadmodel->surfmesh.num_vertices;i++)
8604 hash = md2verthashdata + i;
8605 vertremap[i] = hash->xyz;
8606 sts = LittleShort(inst[hash->st*2+0]);
8607 stt = LittleShort(inst[hash->st*2+1]);
8608 if (sts < 0 || sts >= skinwidth || stt < 0 || stt >= skinheight)
8610 Con_Printf("%s has an invalid skin coordinate (%i %i) on vert %i, changing to 0 0\n", loadmodel->name, sts, stt, i);
8614 loadmodel->surfmesh.data_texcoordtexture2f[i*2+0] = sts * iskinwidth;
8615 loadmodel->surfmesh.data_texcoordtexture2f[i*2+1] = stt * iskinheight;
8618 Mem_Free(md2verthash);
8619 Mem_Free(md2verthashdata);
8621 // generate ushort elements array if possible
8622 if (loadmodel->surfmesh.num_vertices <= 65536)
8623 loadmodel->surfmesh.data_element3s = (unsigned short *)Mem_Alloc(loadmodel->mempool, sizeof(unsigned short[3]) * loadmodel->surfmesh.num_triangles);
8626 datapointer = (base + LittleLong(pinmodel->ofs_frames));
8627 for (i = 0;i < loadmodel->surfmesh.num_morphframes;i++)
8632 pinframe = (md2frame_t *)datapointer;
8633 datapointer += sizeof(md2frame_t);
8634 // store the frame scale/translate into the appropriate array
8635 for (j = 0;j < 3;j++)
8637 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+j] = LittleFloat(pinframe->scale[j]);
8638 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+3+j] = LittleFloat(pinframe->translate[j]);
8640 // convert the vertices
8641 v = (trivertx_t *)datapointer;
8642 out = loadmodel->surfmesh.data_morphmdlvertex + i * loadmodel->surfmesh.num_vertices;
8643 for (k = 0;k < loadmodel->surfmesh.num_vertices;k++)
8644 out[k] = v[vertremap[k]];
8645 datapointer += numxyz * sizeof(trivertx_t);
8647 strlcpy(loadmodel->animscenes[i].name, pinframe->name, sizeof(loadmodel->animscenes[i].name));
8648 loadmodel->animscenes[i].firstframe = i;
8649 loadmodel->animscenes[i].framecount = 1;
8650 loadmodel->animscenes[i].framerate = 10;
8651 loadmodel->animscenes[i].loop = true;
8654 Mem_Free(vertremap);
8656 Mod_MakeSortedSurfaces(loadmodel);
8657 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
8658 Mod_Alias_CalculateBoundingBox();
8659 Mod_Alias_MorphMesh_CompileFrames();
8661 surface = loadmodel->data_surfaces;
8662 surface->texture = loadmodel->data_textures;
8663 surface->num_firsttriangle = 0;
8664 surface->num_triangles = loadmodel->surfmesh.num_triangles;
8665 surface->num_firstvertex = 0;
8666 surface->num_vertices = loadmodel->surfmesh.num_vertices;
8668 loadmodel->surfmesh.isanimated = false;
8670 if (loadmodel->surfmesh.data_element3s)
8671 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
8672 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
8675 #endif // !OBJASMODEL
8677 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
8679 // we already have done PVS culling at this point...
8680 // so we don't need to do it again.
8683 vec3_t testorigin, mins, maxs;
8685 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
8686 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
8687 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
8689 if(model->brush.TraceLineOfSight(model, eye, testorigin))
8692 // expand the box a little
8693 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
8694 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
8695 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
8696 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
8697 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
8698 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
8700 for(i = 0; i != numsamples; ++i)
8702 testorigin[0] = lhrandom(mins[0], maxs[0]);
8703 testorigin[1] = lhrandom(mins[1], maxs[1]);
8704 testorigin[2] = lhrandom(mins[2], maxs[2]);
8706 if(model->brush.TraceLineOfSight(model, eye, testorigin))