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_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
32 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0", "pretends there was no texture lump found in the q1bsp/hlbsp loading (useful for debugging this rare case)"};
33 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4", "maximum error tolerance on curve subdivision for rendering purposes (in other words, the curves will be given as many polygons as necessary to represent curves at this quality)"};
34 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
35 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
36 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
37 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15", "maximum error tolerance on curve subdivision for collision purposes (usually a larger error tolerance than for rendering)"};
38 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
39 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
40 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
41 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
42 cvar_t mod_q3bsp_curves_collisions_stride = {0, "mod_q3bsp_curves_collisions_stride", "16", "collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
43 cvar_t mod_q3bsp_curves_stride = {0, "mod_q3bsp_curves_stride", "16", "particle effect collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
44 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
45 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
46 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_SAVE, "mod_q3bsp_lightmapmergepower", "4", "merges the quake3 128x128 lightmap textures into larger lightmap group textures to speed up rendering, 1 = 256x256, 2 = 512x512, 3 = 1024x1024, 4 = 2048x2048, 5 = 4096x4096, ..."};
47 cvar_t mod_q3bsp_nolightmaps = {CVAR_SAVE, "mod_q3bsp_nolightmaps", "0", "do not load lightmaps in Q3BSP maps (to save video RAM, but be warned: it looks ugly)"};
48 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
50 static texture_t mod_q1bsp_texture_solid;
51 static texture_t mod_q1bsp_texture_sky;
52 static texture_t mod_q1bsp_texture_lava;
53 static texture_t mod_q1bsp_texture_slime;
54 static texture_t mod_q1bsp_texture_water;
56 void Mod_BrushInit(void)
58 // Cvar_RegisterVariable(&r_subdivide_size);
59 Cvar_RegisterVariable(&r_novis);
60 Cvar_RegisterVariable(&r_picmipworld);
61 Cvar_RegisterVariable(&r_nosurftextures);
62 Cvar_RegisterVariable(&r_subdivisions_tolerance);
63 Cvar_RegisterVariable(&r_subdivisions_mintess);
64 Cvar_RegisterVariable(&r_subdivisions_maxtess);
65 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
66 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
67 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
68 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
69 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
70 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
71 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
72 Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
73 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
74 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
75 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
76 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
77 Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
79 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
80 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
81 mod_q1bsp_texture_solid.surfaceflags = 0;
82 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
84 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
85 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
86 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
87 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
89 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
90 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
91 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
92 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
94 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
95 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
96 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
97 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
99 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
100 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
101 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
102 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
105 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
112 // LordHavoc: modified to start at first clip node,
113 // in other words: first node of the (sub)model
114 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
116 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
118 return (mleaf_t *)node;
121 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
125 leaf = Mod_Q1BSP_PointInLeaf(model, p);
128 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
131 memcpy(out, leaf->ambient_sound_level, i);
137 memset(out, 0, outsize);
140 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
143 int nodestackindex = 0;
144 mnode_t *node, *nodestack[1024];
145 if (!model->brush.num_pvsclusters)
147 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
153 // node - recurse down the BSP tree
154 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
158 return -1; // ERROR: NAN bounding box!
159 // box is on one side of plane, take that path
160 node = node->children[sides-1];
164 // box crosses plane, take one path and remember the other
165 if (nodestackindex < 1024)
166 nodestack[nodestackindex++] = node->children[0];
167 node = node->children[1];
173 // leaf - add clusterindex to list
174 if (numclusters < maxclusters)
175 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
179 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
183 if (nodestackindex < 1024)
184 nodestack[nodestackindex++] = node->children[0];
185 node = node->children[1];
190 // leaf - add clusterindex to list
191 if (numclusters < maxclusters)
192 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
197 // try another path we didn't take earlier
198 if (nodestackindex == 0)
200 node = nodestack[--nodestackindex];
202 // return number of clusters found (even if more than the maxclusters)
206 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
208 int nodestackindex = 0;
209 mnode_t *node, *nodestack[1024];
210 if (!model->brush.num_pvsclusters)
212 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
218 // node - recurse down the BSP tree
219 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
223 return -1; // ERROR: NAN bounding box!
224 // box is on one side of plane, take that path
225 node = node->children[sides-1];
229 // box crosses plane, take one path and remember the other
230 if (nodestackindex < 1024)
231 nodestack[nodestackindex++] = node->children[0];
232 node = node->children[1];
238 // leaf - check cluster bit
239 int clusterindex = ((mleaf_t *)node)->clusterindex;
240 if (CHECKPVSBIT(pvs, clusterindex))
242 // it is visible, return immediately with the news
247 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
251 if (nodestackindex < 1024)
252 nodestack[nodestackindex++] = node->children[0];
253 node = node->children[1];
258 // leaf - check cluster bit
259 int clusterindex = ((mleaf_t *)node)->clusterindex;
260 if (CHECKPVSBIT(pvs, clusterindex))
262 // it is visible, return immediately with the news
268 // nothing to see here, try another path we didn't take earlier
269 if (nodestackindex == 0)
271 node = nodestack[--nodestackindex];
277 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
279 int nodestackindex = 0;
280 mnode_t *node, *nodestack[1024];
281 if (!model->brush.num_leafs)
283 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
289 // node - recurse down the BSP tree
290 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
294 return -1; // ERROR: NAN bounding box!
295 // box is on one side of plane, take that path
296 node = node->children[sides-1];
300 // box crosses plane, take one path and remember the other
301 if (nodestackindex < 1024)
302 nodestack[nodestackindex++] = node->children[0];
303 node = node->children[1];
309 // leaf - check cluster bit
310 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
311 if (CHECKPVSBIT(pvs, clusterindex))
313 // it is visible, return immediately with the news
318 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
322 if (nodestackindex < 1024)
323 nodestack[nodestackindex++] = node->children[0];
324 node = node->children[1];
329 // leaf - check cluster bit
330 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
331 if (CHECKPVSBIT(pvs, clusterindex))
333 // it is visible, return immediately with the news
339 // nothing to see here, try another path we didn't take earlier
340 if (nodestackindex == 0)
342 node = nodestack[--nodestackindex];
348 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
350 int nodestackindex = 0;
351 mnode_t *node, *nodestack[1024];
352 if (!model->brush.num_leafs)
354 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
360 // node - recurse down the BSP tree
361 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
365 return -1; // ERROR: NAN bounding box!
366 // box is on one side of plane, take that path
367 node = node->children[sides-1];
371 // box crosses plane, take one path and remember the other
372 if (nodestackindex < 1024)
373 nodestack[nodestackindex++] = node->children[0];
374 node = node->children[1];
380 // leaf - check if it is visible
381 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
383 // it is visible, return immediately with the news
388 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
392 if (nodestackindex < 1024)
393 nodestack[nodestackindex++] = node->children[0];
394 node = node->children[1];
399 // leaf - check if it is visible
400 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
402 // it is visible, return immediately with the news
408 // nothing to see here, try another path we didn't take earlier
409 if (nodestackindex == 0)
411 node = nodestack[--nodestackindex];
417 typedef struct findnonsolidlocationinfo_s
420 vec3_t absmin, absmax;
426 findnonsolidlocationinfo_t;
428 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
431 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
433 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
434 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
435 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
436 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
437 VectorSubtract(vert[1], vert[0], edge[0]);
438 VectorSubtract(vert[2], vert[1], edge[1]);
439 CrossProduct(edge[1], edge[0], facenormal);
440 if (facenormal[0] || facenormal[1] || facenormal[2])
442 VectorNormalize(facenormal);
443 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
444 if (f <= info->bestdist && f >= -info->bestdist)
446 VectorSubtract(vert[0], vert[2], edge[2]);
447 VectorNormalize(edge[0]);
448 VectorNormalize(edge[1]);
449 VectorNormalize(edge[2]);
450 CrossProduct(facenormal, edge[0], edgenormal[0]);
451 CrossProduct(facenormal, edge[1], edgenormal[1]);
452 CrossProduct(facenormal, edge[2], edgenormal[2]);
454 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
455 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
456 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
458 // we got lucky, the center is within the face
459 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
463 if (info->bestdist > dist)
465 info->bestdist = dist;
466 VectorScale(facenormal, (info->radius - -dist), info->nudge);
471 if (info->bestdist > dist)
473 info->bestdist = dist;
474 VectorScale(facenormal, (info->radius - dist), info->nudge);
480 // check which edge or vertex the center is nearest
481 for (i = 0;i < 3;i++)
483 f = DotProduct(info->center, edge[i]);
484 if (f >= DotProduct(vert[0], edge[i])
485 && f <= DotProduct(vert[1], edge[i]))
488 VectorMA(info->center, -f, edge[i], point);
489 dist = sqrt(DotProduct(point, point));
490 if (info->bestdist > dist)
492 info->bestdist = dist;
493 VectorScale(point, (info->radius / dist), info->nudge);
495 // skip both vertex checks
496 // (both are further away than this edge)
501 // not on edge, check first vertex of edge
502 VectorSubtract(info->center, vert[i], point);
503 dist = sqrt(DotProduct(point, point));
504 if (info->bestdist > dist)
506 info->bestdist = dist;
507 VectorScale(point, (info->radius / dist), info->nudge);
516 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
518 int surfacenum, k, *mark;
520 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
522 surface = info->model->data_surfaces + *mark;
523 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
525 if(surface->num_bboxstride)
528 cnt = (surface->num_triangles + surface->num_bboxstride - 1) / surface->num_bboxstride;
529 for(i = 0; i < cnt; ++i)
531 if(BoxesOverlap(surface->data_bbox6f + i * 6, surface->data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
533 for(k = 0; k < surface->num_bboxstride; ++k)
535 tri = i * surface->num_bboxstride + k;
536 if(tri >= surface->num_triangles)
538 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
545 for (k = 0;k < surface->num_triangles;k++)
547 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
554 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
558 float f = PlaneDiff(info->center, node->plane);
559 if (f >= -info->bestdist)
560 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
561 if (f <= info->bestdist)
562 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
566 if (((mleaf_t *)node)->numleafsurfaces)
567 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
571 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
574 findnonsolidlocationinfo_t info;
580 VectorCopy(in, info.center);
581 info.radius = radius;
586 VectorClear(info.nudge);
587 info.bestdist = radius;
588 VectorCopy(info.center, info.absmin);
589 VectorCopy(info.center, info.absmax);
590 info.absmin[0] -= info.radius + 1;
591 info.absmin[1] -= info.radius + 1;
592 info.absmin[2] -= info.radius + 1;
593 info.absmax[0] += info.radius + 1;
594 info.absmax[1] += info.radius + 1;
595 info.absmax[2] += info.radius + 1;
596 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
597 VectorAdd(info.center, info.nudge, info.center);
599 while (info.bestdist < radius && ++i < 10);
600 VectorCopy(info.center, out);
603 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
605 switch(nativecontents)
610 return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
612 return SUPERCONTENTS_WATER;
614 return SUPERCONTENTS_SLIME;
616 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
618 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
623 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
625 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
626 return CONTENTS_SOLID;
627 if (supercontents & SUPERCONTENTS_SKY)
629 if (supercontents & SUPERCONTENTS_LAVA)
630 return CONTENTS_LAVA;
631 if (supercontents & SUPERCONTENTS_SLIME)
632 return CONTENTS_SLIME;
633 if (supercontents & SUPERCONTENTS_WATER)
634 return CONTENTS_WATER;
635 return CONTENTS_EMPTY;
638 typedef struct RecursiveHullCheckTraceInfo_s
640 // the hull we're tracing through
643 // the trace structure to fill in
646 // start, end, and end - start (in model space)
651 RecursiveHullCheckTraceInfo_t;
653 // 1/32 epsilon to keep floating point happy
654 #define DIST_EPSILON (0.03125)
656 #define HULLCHECKSTATE_EMPTY 0
657 #define HULLCHECKSTATE_SOLID 1
658 #define HULLCHECKSTATE_DONE 2
660 extern cvar_t collision_prefernudgedfraction;
661 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
663 // status variables, these don't need to be saved on the stack when
664 // recursing... but are because this should be thread-safe
665 // (note: tracing against a bbox is not thread-safe, yet)
670 // variables that need to be stored on the stack when recursing
675 // LordHavoc: a goto! everyone flee in terror... :)
680 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
681 if (!t->trace->startfound)
683 t->trace->startfound = true;
684 t->trace->startsupercontents |= num;
686 if (num & SUPERCONTENTS_LIQUIDSMASK)
687 t->trace->inwater = true;
689 t->trace->inopen = true;
690 if (num & SUPERCONTENTS_SOLID)
691 t->trace->hittexture = &mod_q1bsp_texture_solid;
692 else if (num & SUPERCONTENTS_SKY)
693 t->trace->hittexture = &mod_q1bsp_texture_sky;
694 else if (num & SUPERCONTENTS_LAVA)
695 t->trace->hittexture = &mod_q1bsp_texture_lava;
696 else if (num & SUPERCONTENTS_SLIME)
697 t->trace->hittexture = &mod_q1bsp_texture_slime;
699 t->trace->hittexture = &mod_q1bsp_texture_water;
700 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
701 t->trace->hitsupercontents = num;
702 if (num & t->trace->hitsupercontentsmask)
704 // if the first leaf is solid, set startsolid
705 if (t->trace->allsolid)
706 t->trace->startsolid = true;
707 #if COLLISIONPARANOID >= 3
710 return HULLCHECKSTATE_SOLID;
714 t->trace->allsolid = false;
715 #if COLLISIONPARANOID >= 3
718 return HULLCHECKSTATE_EMPTY;
722 // find the point distances
723 node = t->hull->clipnodes + num;
725 plane = t->hull->planes + node->planenum;
728 t1 = p1[plane->type] - plane->dist;
729 t2 = p2[plane->type] - plane->dist;
733 t1 = DotProduct (plane->normal, p1) - plane->dist;
734 t2 = DotProduct (plane->normal, p2) - plane->dist;
741 #if COLLISIONPARANOID >= 3
744 num = node->children[1];
753 #if COLLISIONPARANOID >= 3
756 num = node->children[0];
762 // the line intersects, find intersection point
763 // LordHavoc: this uses the original trace for maximum accuracy
764 #if COLLISIONPARANOID >= 3
769 t1 = t->start[plane->type] - plane->dist;
770 t2 = t->end[plane->type] - plane->dist;
774 t1 = DotProduct (plane->normal, t->start) - plane->dist;
775 t2 = DotProduct (plane->normal, t->end) - plane->dist;
778 midf = t1 / (t1 - t2);
779 midf = bound(p1f, midf, p2f);
780 VectorMA(t->start, midf, t->dist, mid);
782 // recurse both sides, front side first
783 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
784 // if this side is not empty, return what it is (solid or done)
785 if (ret != HULLCHECKSTATE_EMPTY)
788 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
789 // if other side is not solid, return what it is (empty or done)
790 if (ret != HULLCHECKSTATE_SOLID)
793 // front is air and back is solid, this is the impact point...
796 t->trace->plane.dist = -plane->dist;
797 VectorNegate (plane->normal, t->trace->plane.normal);
801 t->trace->plane.dist = plane->dist;
802 VectorCopy (plane->normal, t->trace->plane.normal);
805 // calculate the true fraction
806 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
807 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
808 midf = t1 / (t1 - t2);
809 t->trace->realfraction = bound(0, midf, 1);
811 // calculate the return fraction which is nudged off the surface a bit
812 midf = (t1 - DIST_EPSILON) / (t1 - t2);
813 t->trace->fraction = bound(0, midf, 1);
815 if (collision_prefernudgedfraction.integer)
816 t->trace->realfraction = t->trace->fraction;
818 #if COLLISIONPARANOID >= 3
821 return HULLCHECKSTATE_DONE;
824 //#if COLLISIONPARANOID < 2
825 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
828 mclipnode_t *nodes = t->hull->clipnodes;
829 mplane_t *planes = t->hull->planes;
831 VectorCopy(t->start, point);
834 plane = planes + nodes[num].planenum;
835 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
837 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
838 t->trace->startsupercontents |= num;
839 if (num & SUPERCONTENTS_LIQUIDSMASK)
840 t->trace->inwater = true;
842 t->trace->inopen = true;
843 if (num & t->trace->hitsupercontentsmask)
845 t->trace->allsolid = t->trace->startsolid = true;
846 return HULLCHECKSTATE_SOLID;
850 t->trace->allsolid = t->trace->startsolid = false;
851 return HULLCHECKSTATE_EMPTY;
856 static void Mod_Q1BSP_TracePoint(struct model_s *model, int frame, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
858 RecursiveHullCheckTraceInfo_t rhc;
860 memset(&rhc, 0, sizeof(rhc));
861 memset(trace, 0, sizeof(trace_t));
863 rhc.trace->fraction = 1;
864 rhc.trace->realfraction = 1;
865 rhc.trace->allsolid = true;
866 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
867 VectorCopy(start, rhc.start);
868 VectorCopy(start, rhc.end);
869 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
872 static void Mod_Q1BSP_TraceLine(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
874 RecursiveHullCheckTraceInfo_t rhc;
876 if (VectorCompare(start, end))
878 Mod_Q1BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
882 memset(&rhc, 0, sizeof(rhc));
883 memset(trace, 0, sizeof(trace_t));
885 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
886 rhc.trace->fraction = 1;
887 rhc.trace->realfraction = 1;
888 rhc.trace->allsolid = true;
889 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
890 VectorCopy(start, rhc.start);
891 VectorCopy(end, rhc.end);
892 VectorSubtract(rhc.end, rhc.start, rhc.dist);
893 #if COLLISIONPARANOID >= 2
894 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]);
895 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
900 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
901 memset(&testtrace, 0, sizeof(trace_t));
902 rhc.trace = &testtrace;
903 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
904 rhc.trace->fraction = 1;
905 rhc.trace->realfraction = 1;
906 rhc.trace->allsolid = true;
907 VectorCopy(test, rhc.start);
908 VectorCopy(test, rhc.end);
909 VectorClear(rhc.dist);
910 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
911 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
912 if (!trace->startsolid && testtrace.startsolid)
913 Con_Printf(" - ended in solid!\n");
917 if (VectorLength2(rhc.dist))
918 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
920 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
924 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
926 // this function currently only supports same size start and end
928 RecursiveHullCheckTraceInfo_t rhc;
930 if (VectorCompare(boxmins, boxmaxs))
932 if (VectorCompare(start, end))
933 Mod_Q1BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
935 Mod_Q1BSP_TraceLine(model, frame, trace, start, end, hitsupercontentsmask);
939 memset(&rhc, 0, sizeof(rhc));
940 memset(trace, 0, sizeof(trace_t));
942 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
943 rhc.trace->fraction = 1;
944 rhc.trace->realfraction = 1;
945 rhc.trace->allsolid = true;
946 VectorSubtract(boxmaxs, boxmins, boxsize);
948 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
949 else if (model->brush.ishlbsp)
951 // LordHavoc: this has to have a minor tolerance (the .1) because of
952 // minor float precision errors from the box being transformed around
953 if (boxsize[0] < 32.1)
955 if (boxsize[2] < 54) // pick the nearest of 36 or 72
956 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
958 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
961 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
965 // LordHavoc: this has to have a minor tolerance (the .1) because of
966 // minor float precision errors from the box being transformed around
967 if (boxsize[0] < 32.1)
968 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
970 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
972 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
973 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
974 VectorSubtract(rhc.end, rhc.start, rhc.dist);
975 #if COLLISIONPARANOID >= 2
976 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]);
977 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
982 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
983 memset(&testtrace, 0, sizeof(trace_t));
984 rhc.trace = &testtrace;
985 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
986 rhc.trace->fraction = 1;
987 rhc.trace->realfraction = 1;
988 rhc.trace->allsolid = true;
989 VectorCopy(test, rhc.start);
990 VectorCopy(test, rhc.end);
991 VectorClear(rhc.dist);
992 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
993 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
994 if (!trace->startsolid && testtrace.startsolid)
995 Con_Printf(" - ended in solid!\n");
999 if (VectorLength2(rhc.dist))
1000 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1002 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1006 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1008 int num = model->brushq1.hulls[0].firstclipnode;
1010 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1011 mplane_t *planes = model->brushq1.hulls[0].planes;
1014 plane = planes + nodes[num].planenum;
1015 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1017 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1020 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, texture_t *boxtexture)
1024 colplanef_t cbox_planes[6];
1026 cbox.hasaabbplanes = true;
1027 cbox.supercontents = boxsupercontents;
1030 cbox.numtriangles = 0;
1031 cbox.planes = cbox_planes;
1033 cbox.elements = NULL;
1041 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];
1042 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];
1043 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];
1044 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];
1045 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];
1046 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];
1047 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1048 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1049 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1050 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1051 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1052 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1053 memset(trace, 0, sizeof(trace_t));
1054 trace->hitsupercontentsmask = hitsupercontentsmask;
1055 trace->fraction = 1;
1056 trace->realfraction = 1;
1057 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1059 RecursiveHullCheckTraceInfo_t rhc;
1060 static hull_t box_hull;
1061 static mclipnode_t box_clipnodes[6];
1062 static mplane_t box_planes[6];
1063 // fill in a default trace
1064 memset(&rhc, 0, sizeof(rhc));
1065 memset(trace, 0, sizeof(trace_t));
1066 //To keep everything totally uniform, bounding boxes are turned into small
1067 //BSP trees instead of being compared directly.
1068 // create a temp hull from bounding box sizes
1069 box_planes[0].dist = cmaxs[0] - mins[0];
1070 box_planes[1].dist = cmins[0] - maxs[0];
1071 box_planes[2].dist = cmaxs[1] - mins[1];
1072 box_planes[3].dist = cmins[1] - maxs[1];
1073 box_planes[4].dist = cmaxs[2] - mins[2];
1074 box_planes[5].dist = cmins[2] - maxs[2];
1075 #if COLLISIONPARANOID >= 3
1076 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]);
1079 if (box_hull.clipnodes == NULL)
1083 //Set up the planes and clipnodes so that the six floats of a bounding box
1084 //can just be stored out and get a proper hull_t structure.
1086 box_hull.clipnodes = box_clipnodes;
1087 box_hull.planes = box_planes;
1088 box_hull.firstclipnode = 0;
1089 box_hull.lastclipnode = 5;
1091 for (i = 0;i < 6;i++)
1093 box_clipnodes[i].planenum = i;
1097 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1099 box_clipnodes[i].children[side^1] = i + 1;
1101 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1103 box_planes[i].type = i>>1;
1104 box_planes[i].normal[i>>1] = 1;
1108 // trace a line through the generated clipping hull
1109 //rhc.boxsupercontents = boxsupercontents;
1110 rhc.hull = &box_hull;
1112 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1113 rhc.trace->fraction = 1;
1114 rhc.trace->realfraction = 1;
1115 rhc.trace->allsolid = true;
1116 VectorCopy(start, rhc.start);
1117 VectorCopy(end, rhc.end);
1118 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1119 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1120 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1121 if (rhc.trace->startsupercontents)
1122 rhc.trace->startsupercontents = boxsupercontents;
1126 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, texture_t *boxtexture)
1128 memset(trace, 0, sizeof(trace_t));
1129 trace->fraction = 1;
1130 trace->realfraction = 1;
1131 if (BoxesOverlap(start, start, cmins, cmaxs))
1133 trace->startsupercontents |= boxsupercontents;
1134 if (hitsupercontentsmask & boxsupercontents)
1136 trace->startsolid = true;
1137 trace->allsolid = true;
1142 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1145 model->TraceLine(model, 0, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1146 return trace.fraction == 1;
1149 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)
1153 float mid, distz = endz - startz;
1157 return false; // didn't hit anything
1159 switch (node->plane->type)
1162 node = node->children[x < node->plane->dist];
1165 node = node->children[y < node->plane->dist];
1168 side = startz < node->plane->dist;
1169 if ((endz < node->plane->dist) == side)
1171 node = node->children[side];
1174 // found an intersection
1175 mid = node->plane->dist;
1178 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1179 front += startz * node->plane->normal[2];
1180 back += endz * node->plane->normal[2];
1181 side = front < node->plane->dist;
1182 if ((back < node->plane->dist) == side)
1184 node = node->children[side];
1187 // found an intersection
1188 mid = startz + distz * (front - node->plane->dist) / (front - back);
1192 // go down front side
1193 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1194 return true; // hit something
1197 // check for impact on this node
1198 if (node->numsurfaces)
1200 int i, dsi, dti, lmwidth, lmheight;
1202 msurface_t *surface;
1203 unsigned char *lightmap;
1204 int maps, line3, size3;
1207 float scale, w, w00, w01, w10, w11;
1209 surface = model->data_surfaces + node->firstsurface;
1210 for (i = 0;i < node->numsurfaces;i++, surface++)
1212 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1213 continue; // no lightmaps
1215 // location we want to sample in the lightmap
1216 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;
1217 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;
1222 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1223 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1226 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1228 // calculate bilinear interpolation factors
1229 // and also multiply by fixedpoint conversion factors
1232 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1233 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1234 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1235 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1237 // values for pointer math
1238 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1239 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1241 // look up the pixel
1242 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1244 // bilinear filter each lightmap style, and sum them
1245 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1247 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1248 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1249 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1250 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1251 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1255 return true; // success
1260 // go down back side
1261 node = node->children[side ^ 1];
1263 distz = endz - startz;
1268 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1270 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1271 VectorSet(diffusenormal, 0, 0, 1);
1273 if (!model->brushq1.lightdata)
1275 VectorSet(ambientcolor, 1, 1, 1);
1276 VectorSet(diffusecolor, 0, 0, 0);
1280 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);
1283 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1286 unsigned char *outstart = out;
1287 while (out < outend)
1291 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));
1301 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));
1304 for (c = *in++;c > 0;c--)
1308 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));
1319 R_Q1BSP_LoadSplitSky
1321 A sky texture is 256*128, with the right side being a masked overlay
1324 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1329 unsigned *solidpixels = Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1330 unsigned *alphapixels = Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1332 // allocate a texture pool if we need it
1333 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1334 loadmodel->texturepool = R_AllocTexturePool();
1336 if (bytesperpixel == 4)
1338 for (y = 0;y < h;y++)
1340 for (x = 0;x < w;x++)
1342 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1343 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1349 // make an average value for the back to avoid
1350 // a fringe on the top level
1359 for (y = 0;y < h;y++)
1361 for (x = 0;x < w;x++)
1363 p = src[x*width+y+w];
1364 r += palette_rgb[p][0];
1365 g += palette_rgb[p][1];
1366 b += palette_rgb[p][2];
1369 bgra.b[2] = r/(w*h);
1370 bgra.b[1] = g/(w*h);
1371 bgra.b[0] = b/(w*h);
1373 for (y = 0;y < h;y++)
1375 for (x = 0;x < w;x++)
1377 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1379 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1384 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", w, h, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1385 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", w, h, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1386 Mem_Free(solidpixels);
1387 Mem_Free(alphapixels);
1390 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1392 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1393 skinframe_t *skinframe;
1395 texture_t *tx, *tx2, *anims[10], *altanims[10];
1397 unsigned char *data, *mtdata;
1399 char mapname[MAX_QPATH], name[MAX_QPATH];
1400 unsigned char zero[4];
1402 memset(zero, 0, sizeof(zero));
1404 loadmodel->data_textures = NULL;
1406 // add two slots for notexture walls and notexture liquids
1409 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1410 m->nummiptex = LittleLong (m->nummiptex);
1411 loadmodel->num_textures = m->nummiptex + 2;
1412 loadmodel->num_texturesperskin = loadmodel->num_textures;
1417 loadmodel->num_textures = 2;
1418 loadmodel->num_texturesperskin = loadmodel->num_textures;
1421 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1423 // fill out all slots with notexture
1424 if (cls.state != ca_dedicated)
1425 skinframe = R_SkinFrame_LoadMissing();
1428 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1430 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1433 if (cls.state != ca_dedicated)
1435 tx->numskinframes = 1;
1436 tx->skinframerate = 1;
1437 tx->skinframes[0] = skinframe;
1438 tx->currentskinframe = tx->skinframes[0];
1440 tx->basematerialflags = MATERIALFLAG_WALL;
1441 if (i == loadmodel->num_textures - 1)
1443 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1444 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1445 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1449 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1450 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1452 tx->currentframe = tx;
1454 // clear water settings
1457 tx->refractfactor = 1;
1458 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1459 tx->reflectfactor = 1;
1460 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1461 tx->r_water_wateralpha = 1;
1466 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1470 s = loadmodel->name;
1471 if (!strncasecmp(s, "maps/", 5))
1473 FS_StripExtension(s, mapname, sizeof(mapname));
1475 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1477 // LordHavoc: mostly rewritten map texture loader
1478 for (i = 0;i < m->nummiptex;i++)
1480 dofs[i] = LittleLong(dofs[i]);
1481 if (r_nosurftextures.integer)
1485 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1488 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1490 // copy name, but only up to 16 characters
1491 // (the output buffer can hold more than this, but the input buffer is
1493 for (j = 0;j < 16 && dmiptex->name[j];j++)
1494 name[j] = dmiptex->name[j];
1499 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1500 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1503 mtwidth = LittleLong(dmiptex->width);
1504 mtheight = LittleLong(dmiptex->height);
1506 j = LittleLong(dmiptex->offsets[0]);
1510 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1512 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1515 mtdata = (unsigned char *)dmiptex + j;
1518 if ((mtwidth & 15) || (mtheight & 15))
1519 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1521 // LordHavoc: force all names to lowercase
1522 for (j = 0;name[j];j++)
1523 if (name[j] >= 'A' && name[j] <= 'Z')
1524 name[j] += 'a' - 'A';
1526 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1529 tx = loadmodel->data_textures + i;
1530 strlcpy(tx->name, name, sizeof(tx->name));
1531 tx->width = mtwidth;
1532 tx->height = mtheight;
1534 if (tx->name[0] == '*')
1536 if (!strncmp(tx->name, "*lava", 5))
1538 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1539 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1541 else if (!strncmp(tx->name, "*slime", 6))
1543 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1544 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1548 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1549 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1552 else if (!strncmp(tx->name, "sky", 3))
1554 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1555 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1559 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1560 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1563 if (cls.state != ca_dedicated)
1565 // LordHavoc: HL sky textures are entirely different than quake
1566 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1568 data = loadimagepixelsbgra(tx->name, false, false);
1569 if (data && image_width == image_height * 2)
1571 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1574 else if (mtdata != NULL)
1575 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1579 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1581 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1584 // did not find external texture, load it from the bsp or wad3
1585 if (loadmodel->brush.ishlbsp)
1587 // internal texture overrides wad
1588 unsigned char *pixels, *freepixels;
1589 pixels = freepixels = NULL;
1591 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1593 pixels = freepixels = W_GetTextureBGRA(tx->name);
1596 tx->width = image_width;
1597 tx->height = image_height;
1598 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1601 Mem_Free(freepixels);
1603 else if (mtdata) // texture included
1604 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1606 // if skinframe is still NULL the "missing" texture will be used
1608 tx->skinframes[0] = skinframe;
1611 tx->basematerialflags = MATERIALFLAG_WALL;
1612 if (tx->name[0] == '*')
1614 // LordHavoc: some turbulent textures should not be affected by wateralpha
1615 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1617 // replace the texture with transparent black
1618 Vector4Set(zero, 128, 128, 128, 128);
1619 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1620 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1622 else if (!strncmp(tx->name,"*lava",5)
1623 || !strncmp(tx->name,"*teleport",9)
1624 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1625 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1627 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1628 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1629 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1631 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1633 // replace the texture with black
1634 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1635 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1637 else if (!strncmp(tx->name, "sky", 3))
1638 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1639 else if (!strcmp(tx->name, "caulk"))
1640 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1641 else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1642 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1644 // start out with no animation
1645 tx->currentframe = tx;
1646 tx->currentskinframe = tx->skinframes[0];
1650 // sequence the animations
1651 for (i = 0;i < m->nummiptex;i++)
1653 tx = loadmodel->data_textures + i;
1654 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1656 if (tx->anim_total[0] || tx->anim_total[1])
1657 continue; // already sequenced
1659 // find the number of frames in the animation
1660 memset(anims, 0, sizeof(anims));
1661 memset(altanims, 0, sizeof(altanims));
1663 for (j = i;j < m->nummiptex;j++)
1665 tx2 = loadmodel->data_textures + j;
1666 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1670 if (num >= '0' && num <= '9')
1671 anims[num - '0'] = tx2;
1672 else if (num >= 'a' && num <= 'j')
1673 altanims[num - 'a'] = tx2;
1675 Con_Printf("Bad animating texture %s\n", tx->name);
1679 for (j = 0;j < 10;j++)
1686 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1689 for (j = 0;j < max;j++)
1693 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1697 for (j = 0;j < altmax;j++)
1701 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1710 // if there is no alternate animation, duplicate the primary
1711 // animation into the alternate
1713 for (k = 0;k < 10;k++)
1714 altanims[k] = anims[k];
1717 // link together the primary animation
1718 for (j = 0;j < max;j++)
1721 tx2->animated = true;
1722 tx2->anim_total[0] = max;
1723 tx2->anim_total[1] = altmax;
1724 for (k = 0;k < 10;k++)
1726 tx2->anim_frames[0][k] = anims[k];
1727 tx2->anim_frames[1][k] = altanims[k];
1731 // if there really is an alternate anim...
1732 if (anims[0] != altanims[0])
1734 // link together the alternate animation
1735 for (j = 0;j < altmax;j++)
1738 tx2->animated = true;
1739 // the primary/alternate are reversed here
1740 tx2->anim_total[0] = altmax;
1741 tx2->anim_total[1] = max;
1742 for (k = 0;k < 10;k++)
1744 tx2->anim_frames[0][k] = altanims[k];
1745 tx2->anim_frames[1][k] = anims[k];
1752 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1755 unsigned char *in, *out, *data, d;
1756 char litfilename[MAX_QPATH];
1757 char dlitfilename[MAX_QPATH];
1758 fs_offset_t filesize;
1759 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1761 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1762 for (i=0; i<l->filelen; i++)
1763 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1765 else // LordHavoc: bsp version 29 (normal white lighting)
1767 // LordHavoc: hope is not lost yet, check for a .lit file to load
1768 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1769 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1770 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1771 strlcat (litfilename, ".lit", sizeof (litfilename));
1772 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1773 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1776 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1778 i = LittleLong(((int *)data)[1]);
1781 if (developer_loading.integer)
1782 Con_Printf("loaded %s\n", litfilename);
1783 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1784 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1786 data = (unsigned char*) FS_LoadFile(dlitfilename, 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", dlitfilename);
1796 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1797 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1798 loadmodel->brushq3.deluxemapping_modelspace = false;
1799 loadmodel->brushq3.deluxemapping = true;
1808 Con_Printf("Unknown .lit file version (%d)\n", i);
1810 else if (filesize == 8)
1811 Con_Print("Empty .lit file, ignoring\n");
1813 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1820 // LordHavoc: oh well, expand the white lighting data
1823 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1824 in = mod_base + l->fileofs;
1825 out = loadmodel->brushq1.lightdata;
1826 for (i = 0;i < l->filelen;i++)
1836 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1838 loadmodel->brushq1.num_compressedpvs = 0;
1839 loadmodel->brushq1.data_compressedpvs = NULL;
1842 loadmodel->brushq1.num_compressedpvs = l->filelen;
1843 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1844 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1847 // used only for HalfLife maps
1848 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1850 char key[128], value[4096];
1854 if (!COM_ParseToken_Simple(&data, false, false))
1856 if (com_token[0] != '{')
1860 if (!COM_ParseToken_Simple(&data, false, false))
1862 if (com_token[0] == '}')
1863 break; // end of worldspawn
1864 if (com_token[0] == '_')
1865 strlcpy(key, com_token + 1, sizeof(key));
1867 strlcpy(key, com_token, sizeof(key));
1868 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1869 key[strlen(key)-1] = 0;
1870 if (!COM_ParseToken_Simple(&data, false, false))
1872 dpsnprintf(value, sizeof(value), "%s", com_token);
1873 if (!strcmp("wad", key)) // for HalfLife maps
1875 if (loadmodel->brush.ishlbsp)
1878 for (i = 0;i < (int)sizeof(value);i++)
1879 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1883 for (;i < (int)sizeof(value);i++)
1885 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1886 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1888 else if (value[i] == ';' || value[i] == 0)
1892 W_LoadTextureWadFile(&value[j], false);
1904 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1906 loadmodel->brush.entities = NULL;
1909 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1910 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1911 loadmodel->brush.entities[l->filelen] = 0;
1912 if (loadmodel->brush.ishlbsp)
1913 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1917 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1923 in = (dvertex_t *)(mod_base + l->fileofs);
1924 if (l->filelen % sizeof(*in))
1925 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1926 count = l->filelen / sizeof(*in);
1927 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1929 loadmodel->brushq1.vertexes = out;
1930 loadmodel->brushq1.numvertexes = count;
1932 for ( i=0 ; i<count ; i++, in++, out++)
1934 out->position[0] = LittleFloat(in->point[0]);
1935 out->position[1] = LittleFloat(in->point[1]);
1936 out->position[2] = LittleFloat(in->point[2]);
1940 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1941 // can be used for this
1943 int SB_ReadInt (unsigned char **buffer)
1946 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1952 float SB_ReadFloat (unsigned char **buffer)
1960 u.i = SB_ReadInt (buffer);
1964 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1966 unsigned char *index;
1970 index = (unsigned char *)(mod_base + l->fileofs);
1971 if (l->filelen % (48+4*hullinfo->filehulls))
1972 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1974 count = l->filelen / (48+4*hullinfo->filehulls);
1975 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1977 loadmodel->brushq1.submodels = out;
1978 loadmodel->brush.numsubmodels = count;
1980 for (i = 0; i < count; i++, out++)
1982 // spread out the mins / maxs by a pixel
1983 out->mins[0] = SB_ReadFloat (&index) - 1;
1984 out->mins[1] = SB_ReadFloat (&index) - 1;
1985 out->mins[2] = SB_ReadFloat (&index) - 1;
1986 out->maxs[0] = SB_ReadFloat (&index) + 1;
1987 out->maxs[1] = SB_ReadFloat (&index) + 1;
1988 out->maxs[2] = SB_ReadFloat (&index) + 1;
1989 out->origin[0] = SB_ReadFloat (&index);
1990 out->origin[1] = SB_ReadFloat (&index);
1991 out->origin[2] = SB_ReadFloat (&index);
1992 for (j = 0; j < hullinfo->filehulls; j++)
1993 out->headnode[j] = SB_ReadInt (&index);
1994 out->visleafs = SB_ReadInt (&index);
1995 out->firstface = SB_ReadInt (&index);
1996 out->numfaces = SB_ReadInt (&index);
2000 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2006 in = (dedge_t *)(mod_base + l->fileofs);
2007 if (l->filelen % sizeof(*in))
2008 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2009 count = l->filelen / sizeof(*in);
2010 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2012 loadmodel->brushq1.edges = out;
2013 loadmodel->brushq1.numedges = count;
2015 for ( i=0 ; i<count ; i++, in++, out++)
2017 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2018 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2019 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2021 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);
2022 if(!loadmodel->brushq1.numvertexes)
2023 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2031 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2035 int i, j, k, count, miptex;
2037 in = (texinfo_t *)(mod_base + l->fileofs);
2038 if (l->filelen % sizeof(*in))
2039 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2040 count = l->filelen / sizeof(*in);
2041 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2043 loadmodel->brushq1.texinfo = out;
2044 loadmodel->brushq1.numtexinfo = count;
2046 for (i = 0;i < count;i++, in++, out++)
2048 for (k = 0;k < 2;k++)
2049 for (j = 0;j < 4;j++)
2050 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2052 miptex = LittleLong(in->miptex);
2053 out->flags = LittleLong(in->flags);
2055 out->texture = NULL;
2056 if (loadmodel->data_textures)
2058 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2059 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2061 out->texture = loadmodel->data_textures + miptex;
2063 if (out->flags & TEX_SPECIAL)
2065 // if texture chosen is NULL or the shader needs a lightmap,
2066 // force to notexture water shader
2067 if (out->texture == NULL)
2068 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2072 // if texture chosen is NULL, force to notexture
2073 if (out->texture == NULL)
2074 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2080 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2085 mins[0] = mins[1] = mins[2] = 9999;
2086 maxs[0] = maxs[1] = maxs[2] = -9999;
2088 for (i = 0;i < numverts;i++)
2090 for (j = 0;j < 3;j++, v++)
2100 #define MAX_SUBDIVPOLYTRIANGLES 4096
2101 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2103 static int subdivpolyverts, subdivpolytriangles;
2104 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2105 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2107 static int subdivpolylookupvert(vec3_t v)
2110 for (i = 0;i < subdivpolyverts;i++)
2111 if (subdivpolyvert[i][0] == v[0]
2112 && subdivpolyvert[i][1] == v[1]
2113 && subdivpolyvert[i][2] == v[2])
2115 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2116 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2117 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2118 return subdivpolyverts++;
2121 static void SubdividePolygon(int numverts, float *verts)
2123 int i, i1, i2, i3, f, b, c, p;
2124 vec3_t mins, maxs, front[256], back[256];
2125 float m, *pv, *cv, dist[256], frac;
2128 Host_Error("SubdividePolygon: ran out of verts in buffer");
2130 BoundPoly(numverts, verts, mins, maxs);
2132 for (i = 0;i < 3;i++)
2134 m = (mins[i] + maxs[i]) * 0.5;
2135 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2136 if (maxs[i] - m < 8)
2138 if (m - mins[i] < 8)
2142 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2143 dist[c] = cv[i] - m;
2146 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2150 VectorCopy(pv, front[f]);
2155 VectorCopy(pv, back[b]);
2158 if (dist[p] == 0 || dist[c] == 0)
2160 if ((dist[p] > 0) != (dist[c] > 0) )
2163 frac = dist[p] / (dist[p] - dist[c]);
2164 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2165 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2166 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2172 SubdividePolygon(f, front[0]);
2173 SubdividePolygon(b, back[0]);
2177 i1 = subdivpolylookupvert(verts);
2178 i2 = subdivpolylookupvert(verts + 3);
2179 for (i = 2;i < numverts;i++)
2181 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2183 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2187 i3 = subdivpolylookupvert(verts + i * 3);
2188 subdivpolyindex[subdivpolytriangles][0] = i1;
2189 subdivpolyindex[subdivpolytriangles][1] = i2;
2190 subdivpolyindex[subdivpolytriangles][2] = i3;
2192 subdivpolytriangles++;
2196 //Breaks a polygon up along axial 64 unit
2197 //boundaries so that turbulent and sky warps
2198 //can be done reasonably.
2199 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2205 subdivpolytriangles = 0;
2206 subdivpolyverts = 0;
2207 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2208 if (subdivpolytriangles < 1)
2209 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2211 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2212 mesh->num_vertices = subdivpolyverts;
2213 mesh->num_triangles = subdivpolytriangles;
2214 mesh->vertex = (surfvertex_t *)(mesh + 1);
2215 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2216 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2218 for (i = 0;i < mesh->num_triangles;i++)
2219 for (j = 0;j < 3;j++)
2220 mesh->index[i*3+j] = subdivpolyindex[i][j];
2222 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2224 VectorCopy(subdivpolyvert[i], v->v);
2225 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2226 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2231 /* Maximum size of a single LM */
2232 #define MAX_SINGLE_LM_SIZE 256
2240 struct alloc_lm_state
2243 struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2246 static void init_alloc_lm_state (struct alloc_lm_state* state)
2250 state->currentY = 0;
2251 for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2253 state->rows[r].currentX = 0;
2254 state->rows[r].rowY = -1;
2258 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2260 struct alloc_lm_row* row;
2263 row = &(state->rows[blockheight]);
2264 if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2266 if (state->currentY + blockheight <= totalheight)
2268 row->rowY = state->currentY;
2270 state->currentY += blockheight;
2274 /* See if we can stuff the block into a higher row */
2276 for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2278 if ((state->rows[r].rowY >= 0)
2279 && (state->rows[r].currentX + blockwidth <= totalwidth))
2281 row = &(state->rows[r]);
2285 if (row == NULL) return false;
2289 *outx = row->currentX;
2290 row->currentX += blockwidth;
2295 extern cvar_t gl_max_size;
2296 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2299 msurface_t *surface;
2300 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2301 float texmins[2], texmaxs[2], val;
2302 rtexture_t *lightmaptexture, *deluxemaptexture;
2304 in = (dface_t *)(mod_base + l->fileofs);
2305 if (l->filelen % sizeof(*in))
2306 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2307 count = l->filelen / sizeof(*in);
2308 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2309 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2311 loadmodel->num_surfaces = count;
2313 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2317 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2319 numedges = (unsigned short)LittleShort(in->numedges);
2320 totalverts += numedges;
2321 totaltris += numedges - 2;
2324 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2326 lightmaptexture = NULL;
2327 deluxemaptexture = r_texture_blanknormalmap;
2329 lightmapsize = max(256, gl_max_size.integer);
2330 totallightmapsamples = 0;
2334 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2336 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2338 // FIXME: validate edges, texinfo, etc?
2339 firstedge = LittleLong(in->firstedge);
2340 numedges = (unsigned short)LittleShort(in->numedges);
2341 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)
2342 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2343 i = (unsigned short)LittleShort(in->texinfo);
2344 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2345 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2346 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2347 surface->texture = surface->lightmapinfo->texinfo->texture;
2349 planenum = (unsigned short)LittleShort(in->planenum);
2350 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2351 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2353 //surface->flags = surface->texture->flags;
2354 //if (LittleShort(in->side))
2355 // surface->flags |= SURF_PLANEBACK;
2356 //surface->plane = loadmodel->brush.data_planes + planenum;
2358 surface->num_firstvertex = totalverts;
2359 surface->num_vertices = numedges;
2360 surface->num_firsttriangle = totaltris;
2361 surface->num_triangles = numedges - 2;
2362 totalverts += numedges;
2363 totaltris += numedges - 2;
2365 // convert edges back to a normal polygon
2366 for (i = 0;i < surface->num_vertices;i++)
2368 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2370 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2372 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2374 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2375 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2376 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2377 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2378 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2379 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2380 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2381 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2384 for (i = 0;i < surface->num_triangles;i++)
2386 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2387 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2388 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2391 // compile additional data about the surface geometry
2392 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);
2393 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);
2394 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2396 // generate surface extents information
2397 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2398 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2399 for (i = 1;i < surface->num_vertices;i++)
2401 for (j = 0;j < 2;j++)
2403 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2404 texmins[j] = min(texmins[j], val);
2405 texmaxs[j] = max(texmaxs[j], val);
2408 for (i = 0;i < 2;i++)
2410 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2411 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2414 smax = surface->lightmapinfo->extents[0] >> 4;
2415 tmax = surface->lightmapinfo->extents[1] >> 4;
2416 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2417 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2420 for (i = 0;i < MAXLIGHTMAPS;i++)
2421 surface->lightmapinfo->styles[i] = in->styles[i];
2422 surface->lightmaptexture = NULL;
2423 surface->deluxemaptexture = r_texture_blanknormalmap;
2424 i = LittleLong(in->lightofs);
2427 surface->lightmapinfo->samples = NULL;
2429 // give non-lightmapped water a 1x white lightmap
2430 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2432 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2433 surface->lightmapinfo->styles[0] = 0;
2434 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2438 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2439 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2440 else // LordHavoc: white lighting (bsp version 29)
2442 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2443 if (loadmodel->brushq1.nmaplightdata)
2444 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2447 // check if we should apply a lightmap to this
2448 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2450 if (ssize > 256 || tsize > 256)
2451 Host_Error("Bad surface extents");
2453 if (lightmapsize < ssize)
2454 lightmapsize = ssize;
2455 if (lightmapsize < tsize)
2456 lightmapsize = tsize;
2458 totallightmapsamples += ssize*tsize;
2460 // force lightmap upload on first time seeing the surface
2462 // additionally this is used by the later code to see if a
2463 // lightmap is needed on this surface (rather than duplicating the
2465 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2469 // small maps (such as ammo boxes especially) don't need big lightmap
2470 // textures, so this code tries to guess a good size based on
2471 // totallightmapsamples (size of the lightmaps lump basically), as well as
2472 // trying to max out the gl_max_size if there is a lot of lightmap data to
2474 // additionally, never choose a lightmapsize that is smaller than the
2475 // largest surface encountered (as it would fail)
2477 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2480 // now that we've decided the lightmap texture size, we can do the rest
2481 if (cls.state != ca_dedicated)
2483 int stainmapsize = 0;
2484 struct alloc_lm_state allocState;
2486 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2488 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2489 float u, v, ubase, vbase, uscale, vscale;
2491 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2494 smax = surface->lightmapinfo->extents[0] >> 4;
2495 tmax = surface->lightmapinfo->extents[1] >> 4;
2496 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2497 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2498 stainmapsize += ssize * tsize * 3;
2500 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2502 // allocate a texture pool if we need it
2503 if (loadmodel->texturepool == NULL)
2504 loadmodel->texturepool = R_AllocTexturePool();
2505 // could not find room, make a new lightmap
2506 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2507 if (loadmodel->brushq1.nmaplightdata)
2508 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2510 init_alloc_lm_state (&allocState);
2511 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2513 surface->lightmaptexture = lightmaptexture;
2514 surface->deluxemaptexture = deluxemaptexture;
2515 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2516 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2518 uscale = 1.0f / (float)lightmapsize;
2519 vscale = 1.0f / (float)lightmapsize;
2520 ubase = lightmapx * uscale;
2521 vbase = lightmapy * vscale;
2523 for (i = 0;i < surface->num_vertices;i++)
2525 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);
2526 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);
2527 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2528 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2529 // LordHavoc: calc lightmap data offset for vertex lighting to use
2532 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2536 if (cl_stainmaps.integer)
2538 // allocate stainmaps for permanent marks on walls and clear white
2539 unsigned char *stainsamples = NULL;
2540 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2541 memset(stainsamples, 255, stainmapsize);
2543 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2545 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2547 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2548 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2549 surface->lightmapinfo->stainsamples = stainsamples;
2550 stainsamples += ssize * tsize * 3;
2555 // generate ushort elements array if possible
2556 if (loadmodel->surfmesh.data_element3s)
2557 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2558 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2561 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2564 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2565 node->parent = parent;
2568 // this is a node, recurse to children
2569 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2570 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2571 // combine supercontents of children
2572 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2577 mleaf_t *leaf = (mleaf_t *)node;
2578 // if this is a leaf, calculate supercontents mask from all collidable
2579 // primitives in the leaf (brushes and collision surfaces)
2580 // also flag if the leaf contains any collision surfaces
2581 leaf->combinedsupercontents = 0;
2582 // combine the supercontents values of all brushes in this leaf
2583 for (j = 0;j < leaf->numleafbrushes;j++)
2584 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2585 // check if this leaf contains any collision surfaces (q3 patches)
2586 for (j = 0;j < leaf->numleafsurfaces;j++)
2588 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2589 if (surface->num_collisiontriangles)
2591 leaf->containscollisionsurfaces = true;
2592 leaf->combinedsupercontents |= surface->texture->supercontents;
2598 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2604 in = (dnode_t *)(mod_base + l->fileofs);
2605 if (l->filelen % sizeof(*in))
2606 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2607 count = l->filelen / sizeof(*in);
2608 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2610 loadmodel->brush.data_nodes = out;
2611 loadmodel->brush.num_nodes = count;
2613 for ( i=0 ; i<count ; i++, in++, out++)
2615 for (j=0 ; j<3 ; j++)
2617 out->mins[j] = LittleShort(in->mins[j]);
2618 out->maxs[j] = LittleShort(in->maxs[j]);
2621 p = LittleLong(in->planenum);
2622 out->plane = loadmodel->brush.data_planes + p;
2624 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2625 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2627 for (j=0 ; j<2 ; j++)
2629 // LordHavoc: this code supports broken bsp files produced by
2630 // arguire qbsp which can produce more than 32768 nodes, any value
2631 // below count is assumed to be a node number, any other value is
2632 // assumed to be a leaf number
2633 p = (unsigned short)LittleShort(in->children[j]);
2636 if (p < loadmodel->brush.num_nodes)
2637 out->children[j] = loadmodel->brush.data_nodes + p;
2640 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2641 // map it to the solid leaf
2642 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2647 // note this uses 65535 intentionally, -1 is leaf 0
2649 if (p < loadmodel->brush.num_leafs)
2650 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2653 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2654 // map it to the solid leaf
2655 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2661 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2664 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2670 in = (dleaf_t *)(mod_base + l->fileofs);
2671 if (l->filelen % sizeof(*in))
2672 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2673 count = l->filelen / sizeof(*in);
2674 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2676 loadmodel->brush.data_leafs = out;
2677 loadmodel->brush.num_leafs = count;
2678 // get visleafs from the submodel data
2679 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2680 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2681 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2682 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2684 for ( i=0 ; i<count ; i++, in++, out++)
2686 for (j=0 ; j<3 ; j++)
2688 out->mins[j] = LittleShort(in->mins[j]);
2689 out->maxs[j] = LittleShort(in->maxs[j]);
2692 // FIXME: this function could really benefit from some error checking
2694 out->contents = LittleLong(in->contents);
2696 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2697 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2698 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2700 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);
2701 out->firstleafsurface = NULL;
2702 out->numleafsurfaces = 0;
2705 out->clusterindex = i - 1;
2706 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2707 out->clusterindex = -1;
2709 p = LittleLong(in->visofs);
2710 // ignore visofs errors on leaf 0 (solid)
2711 if (p >= 0 && out->clusterindex >= 0)
2713 if (p >= loadmodel->brushq1.num_compressedpvs)
2714 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2716 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);
2719 for (j = 0;j < 4;j++)
2720 out->ambient_sound_level[j] = in->ambient_level[j];
2722 // FIXME: Insert caustics here
2726 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2730 const unsigned char *pvs;
2731 // if there's no vis data, assume supported (because everything is visible all the time)
2732 if (!loadmodel->brush.data_pvsclusters)
2734 // check all liquid leafs to see if they can see into empty leafs, if any
2735 // can we can assume this map supports r_wateralpha
2736 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2738 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2740 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2741 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2742 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2749 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2756 in = (dclipnode_t *)(mod_base + l->fileofs);
2757 if (l->filelen % sizeof(*in))
2758 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2759 count = l->filelen / sizeof(*in);
2760 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2762 loadmodel->brushq1.clipnodes = out;
2763 loadmodel->brushq1.numclipnodes = count;
2765 for (i = 1; i < MAX_MAP_HULLS; i++)
2767 hull = &loadmodel->brushq1.hulls[i];
2768 hull->clipnodes = out;
2769 hull->firstclipnode = 0;
2770 hull->lastclipnode = count-1;
2771 hull->planes = loadmodel->brush.data_planes;
2772 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2773 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2774 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2775 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2776 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2777 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2778 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2781 for (i=0 ; i<count ; i++, out++, in++)
2783 out->planenum = LittleLong(in->planenum);
2784 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2785 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2786 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2787 if (out->children[0] >= count)
2788 out->children[0] -= 65536;
2789 if (out->children[1] >= count)
2790 out->children[1] -= 65536;
2791 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2792 Host_Error("Corrupt clipping hull(out of range planenum)");
2796 //Duplicate the drawing hull structure as a clipping hull
2797 static void Mod_Q1BSP_MakeHull0(void)
2804 hull = &loadmodel->brushq1.hulls[0];
2806 in = loadmodel->brush.data_nodes;
2807 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2809 hull->clipnodes = out;
2810 hull->firstclipnode = 0;
2811 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2812 hull->planes = loadmodel->brush.data_planes;
2814 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2816 out->planenum = in->plane - loadmodel->brush.data_planes;
2817 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2818 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2822 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2827 in = (short *)(mod_base + l->fileofs);
2828 if (l->filelen % sizeof(*in))
2829 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2830 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2831 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2833 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2835 j = (unsigned short) LittleShort(in[i]);
2836 if (j >= loadmodel->num_surfaces)
2837 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2838 loadmodel->brush.data_leafsurfaces[i] = j;
2842 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2847 in = (int *)(mod_base + l->fileofs);
2848 if (l->filelen % sizeof(*in))
2849 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2850 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2851 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2853 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2854 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2858 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2864 in = (dplane_t *)(mod_base + l->fileofs);
2865 if (l->filelen % sizeof(*in))
2866 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2868 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2869 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2871 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2873 out->normal[0] = LittleFloat(in->normal[0]);
2874 out->normal[1] = LittleFloat(in->normal[1]);
2875 out->normal[2] = LittleFloat(in->normal[2]);
2876 out->dist = LittleFloat(in->dist);
2882 static void Mod_Q1BSP_LoadMapBrushes(void)
2886 int submodel, numbrushes;
2887 qboolean firstbrush;
2888 char *text, *maptext;
2889 char mapfilename[MAX_QPATH];
2890 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2891 strlcat (mapfilename, ".map", sizeof (mapfilename));
2892 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2896 if (!COM_ParseToken_Simple(&data, false, false))
2901 if (!COM_ParseToken_Simple(&data, false, false))
2903 if (com_token[0] != '{')
2909 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2912 if (!COM_ParseToken_Simple(&data, false, false))
2914 if (com_token[0] == '}')
2915 break; // end of entity
2916 if (com_token[0] == '{')
2923 if (submodel > loadmodel->brush.numsubmodels)
2925 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2929 model = loadmodel->brush.submodels[submodel];
2936 if (!COM_ParseToken_Simple(&data, false, false))
2938 if (com_token[0] == '}')
2939 break; // end of brush
2940 // each brush face should be this format:
2941 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2942 // FIXME: support hl .map format
2943 for (pointnum = 0;pointnum < 3;pointnum++)
2945 COM_ParseToken_Simple(&data, false, false);
2946 for (componentnum = 0;componentnum < 3;componentnum++)
2948 COM_ParseToken_Simple(&data, false, false);
2949 point[pointnum][componentnum] = atof(com_token);
2951 COM_ParseToken_Simple(&data, false, false);
2953 COM_ParseToken_Simple(&data, false, false);
2954 strlcpy(facetexture, com_token, sizeof(facetexture));
2955 COM_ParseToken_Simple(&data, false, false);
2956 //scroll_s = atof(com_token);
2957 COM_ParseToken_Simple(&data, false, false);
2958 //scroll_t = atof(com_token);
2959 COM_ParseToken_Simple(&data, false, false);
2960 //rotate = atof(com_token);
2961 COM_ParseToken_Simple(&data, false, false);
2962 //scale_s = atof(com_token);
2963 COM_ParseToken_Simple(&data, false, false);
2964 //scale_t = atof(com_token);
2965 TriangleNormal(point[0], point[1], point[2], planenormal);
2966 VectorNormalizeDouble(planenormal);
2967 planedist = DotProduct(point[0], planenormal);
2968 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2978 #define MAX_PORTALPOINTS 64
2980 typedef struct portal_s
2983 mnode_t *nodes[2]; // [0] = front side of plane
2984 struct portal_s *next[2];
2986 double points[3*MAX_PORTALPOINTS];
2987 struct portal_s *chain; // all portals are linked into a list
2991 static portal_t *portalchain;
2998 static portal_t *AllocPortal(void)
3001 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
3002 p->chain = portalchain;
3007 static void FreePortal(portal_t *p)
3012 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3014 // process only nodes (leafs already had their box calculated)
3018 // calculate children first
3019 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3020 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3022 // make combined bounding box from children
3023 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3024 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3025 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3026 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3027 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3028 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3031 static void Mod_Q1BSP_FinalizePortals(void)
3033 int i, j, numportals, numpoints;
3034 portal_t *p, *pnext;
3037 mleaf_t *leaf, *endleaf;
3039 // tally up portal and point counts and recalculate bounding boxes for all
3040 // leafs (because qbsp is very sloppy)
3041 leaf = loadmodel->brush.data_leafs;
3042 endleaf = leaf + loadmodel->brush.num_leafs;
3043 for (;leaf < endleaf;leaf++)
3045 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3046 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3053 // note: this check must match the one below or it will usually corrupt memory
3054 // 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
3055 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3058 numpoints += p->numpoints * 2;
3062 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3063 loadmodel->brush.num_portals = numportals;
3064 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3065 loadmodel->brush.num_portalpoints = numpoints;
3066 // clear all leaf portal chains
3067 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3068 loadmodel->brush.data_leafs[i].portals = NULL;
3069 // process all portals in the global portal chain, while freeing them
3070 portal = loadmodel->brush.data_portals;
3071 point = loadmodel->brush.data_portalpoints;
3078 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3080 // note: this check must match the one above or it will usually corrupt memory
3081 // 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
3082 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3084 // first make the back to front portal(forward portal)
3085 portal->points = point;
3086 portal->numpoints = p->numpoints;
3087 portal->plane.dist = p->plane.dist;
3088 VectorCopy(p->plane.normal, portal->plane.normal);
3089 portal->here = (mleaf_t *)p->nodes[1];
3090 portal->past = (mleaf_t *)p->nodes[0];
3092 for (j = 0;j < portal->numpoints;j++)
3094 VectorCopy(p->points + j*3, point->position);
3097 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3098 PlaneClassify(&portal->plane);
3100 // link into leaf's portal chain
3101 portal->next = portal->here->portals;
3102 portal->here->portals = portal;
3104 // advance to next portal
3107 // then make the front to back portal(backward portal)
3108 portal->points = point;
3109 portal->numpoints = p->numpoints;
3110 portal->plane.dist = -p->plane.dist;
3111 VectorNegate(p->plane.normal, portal->plane.normal);
3112 portal->here = (mleaf_t *)p->nodes[0];
3113 portal->past = (mleaf_t *)p->nodes[1];
3115 for (j = portal->numpoints - 1;j >= 0;j--)
3117 VectorCopy(p->points + j*3, point->position);
3120 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3121 PlaneClassify(&portal->plane);
3123 // link into leaf's portal chain
3124 portal->next = portal->here->portals;
3125 portal->here->portals = portal;
3127 // advance to next portal
3130 // add the portal's polygon points to the leaf bounding boxes
3131 for (i = 0;i < 2;i++)
3133 leaf = (mleaf_t *)p->nodes[i];
3134 for (j = 0;j < p->numpoints;j++)
3136 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3137 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3138 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3139 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3140 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3141 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3148 // now recalculate the node bounding boxes from the leafs
3149 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3157 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3160 Host_Error("AddPortalToNodes: NULL front node");
3162 Host_Error("AddPortalToNodes: NULL back node");
3163 if (p->nodes[0] || p->nodes[1])
3164 Host_Error("AddPortalToNodes: already included");
3165 // 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
3167 p->nodes[0] = front;
3168 p->next[0] = (portal_t *)front->portals;
3169 front->portals = (mportal_t *)p;
3172 p->next[1] = (portal_t *)back->portals;
3173 back->portals = (mportal_t *)p;
3178 RemovePortalFromNode
3181 static void RemovePortalFromNodes(portal_t *portal)
3185 void **portalpointer;
3187 for (i = 0;i < 2;i++)
3189 node = portal->nodes[i];
3191 portalpointer = (void **) &node->portals;
3194 t = (portal_t *)*portalpointer;
3196 Host_Error("RemovePortalFromNodes: portal not in leaf");
3200 if (portal->nodes[0] == node)
3202 *portalpointer = portal->next[0];
3203 portal->nodes[0] = NULL;
3205 else if (portal->nodes[1] == node)
3207 *portalpointer = portal->next[1];
3208 portal->nodes[1] = NULL;
3211 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3215 if (t->nodes[0] == node)
3216 portalpointer = (void **) &t->next[0];
3217 else if (t->nodes[1] == node)
3218 portalpointer = (void **) &t->next[1];
3220 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3225 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3226 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3229 mnode_t *front, *back, *other_node;
3230 mplane_t clipplane, *plane;
3231 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3232 int numfrontpoints, numbackpoints;
3233 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3235 // if a leaf, we're done
3239 plane = node->plane;
3241 front = node->children[0];
3242 back = node->children[1];
3244 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3246 // create the new portal by generating a polygon for the node plane,
3247 // and clipping it by all of the other portals(which came from nodes above this one)
3248 nodeportal = AllocPortal();
3249 nodeportal->plane = *plane;
3251 // 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)
3252 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);
3253 nodeportal->numpoints = 4;
3254 side = 0; // shut up compiler warning
3255 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3257 clipplane = portal->plane;
3258 if (portal->nodes[0] == portal->nodes[1])
3259 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3260 if (portal->nodes[0] == node)
3262 else if (portal->nodes[1] == node)
3264 clipplane.dist = -clipplane.dist;
3265 VectorNegate(clipplane.normal, clipplane.normal);
3269 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3271 for (i = 0;i < nodeportal->numpoints*3;i++)
3272 frontpoints[i] = nodeportal->points[i];
3273 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);
3274 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3278 if (nodeportal->numpoints < 3)
3280 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3281 nodeportal->numpoints = 0;
3283 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3285 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3286 nodeportal->numpoints = 0;
3289 AddPortalToNodes(nodeportal, front, back);
3291 // split the portals of this node along this node's plane and assign them to the children of this node
3292 // (migrating the portals downward through the tree)
3293 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3295 if (portal->nodes[0] == portal->nodes[1])
3296 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3297 if (portal->nodes[0] == node)
3299 else if (portal->nodes[1] == node)
3302 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3303 nextportal = portal->next[side];
3304 if (!portal->numpoints)
3307 other_node = portal->nodes[!side];
3308 RemovePortalFromNodes(portal);
3310 // cut the portal into two portals, one on each side of the node plane
3311 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);
3313 if (!numfrontpoints)
3316 AddPortalToNodes(portal, back, other_node);
3318 AddPortalToNodes(portal, other_node, back);
3324 AddPortalToNodes(portal, front, other_node);
3326 AddPortalToNodes(portal, other_node, front);
3330 // the portal is split
3331 splitportal = AllocPortal();
3332 temp = splitportal->chain;
3333 *splitportal = *portal;
3334 splitportal->chain = temp;
3335 for (i = 0;i < numbackpoints*3;i++)
3336 splitportal->points[i] = backpoints[i];
3337 splitportal->numpoints = numbackpoints;
3338 for (i = 0;i < numfrontpoints*3;i++)
3339 portal->points[i] = frontpoints[i];
3340 portal->numpoints = numfrontpoints;
3344 AddPortalToNodes(portal, front, other_node);
3345 AddPortalToNodes(splitportal, back, other_node);
3349 AddPortalToNodes(portal, other_node, front);
3350 AddPortalToNodes(splitportal, other_node, back);
3354 Mod_Q1BSP_RecursiveNodePortals(front);
3355 Mod_Q1BSP_RecursiveNodePortals(back);
3358 static void Mod_Q1BSP_MakePortals(void)
3361 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3362 Mod_Q1BSP_FinalizePortals();
3365 //Returns PVS data for a given point
3366 //(note: can return NULL)
3367 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3370 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3372 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3373 if (((mleaf_t *)node)->clusterindex >= 0)
3374 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3379 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)
3383 float d = PlaneDiff(org, node->plane);
3385 node = node->children[0];
3386 else if (d < -radius)
3387 node = node->children[1];
3390 // go down both sides
3391 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3392 node = node->children[1];
3395 // if this leaf is in a cluster, accumulate the pvs bits
3396 if (((mleaf_t *)node)->clusterindex >= 0)
3399 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3400 for (i = 0;i < pvsbytes;i++)
3401 pvsbuffer[i] |= pvs[i];
3405 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3406 //of the given point.
3407 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3409 int bytes = model->brush.num_pvsclusterbytes;
3410 bytes = min(bytes, pvsbufferlength);
3411 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3413 memset(pvsbuffer, 0xFF, bytes);
3417 memset(pvsbuffer, 0, bytes);
3418 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3422 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3427 VectorSubtract(inmaxs, inmins, size);
3428 if (cmodel->brush.ishlbsp)
3431 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3432 else if (size[0] <= 32)
3434 if (size[2] < 54) // pick the nearest of 36 or 72
3435 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3437 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3440 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3445 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3446 else if (size[0] <= 32)
3447 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3449 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3451 VectorCopy(inmins, outmins);
3452 VectorAdd(inmins, hull->clip_size, outmaxs);
3455 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3460 mempool_t *mainmempool;
3461 float dist, modelyawradius, modelradius;
3462 msurface_t *surface;
3463 int numshadowmeshtriangles;
3464 hullinfo_t hullinfo;
3465 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3466 model_brush_lightstyleinfo_t styleinfo[256];
3467 unsigned char *datapointer;
3469 mod->modeldatatypestring = "Q1BSP";
3471 mod->type = mod_brushq1;
3473 header = (dheader_t *)buffer;
3475 i = LittleLong(header->version);
3476 if (i != BSPVERSION && i != 30)
3477 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3478 mod->brush.ishlbsp = i == 30;
3480 // fill in hull info
3481 VectorClear (hullinfo.hullsizes[0][0]);
3482 VectorClear (hullinfo.hullsizes[0][1]);
3483 if (mod->brush.ishlbsp)
3485 mod->modeldatatypestring = "HLBSP";
3487 hullinfo.filehulls = 4;
3488 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3489 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3490 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3491 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3492 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3493 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3497 hullinfo.filehulls = 4;
3498 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3499 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3500 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3501 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3505 mod_base = (unsigned char*)buffer;
3506 for (i = 0; i < HEADER_LUMPS; i++)
3508 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3509 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3512 mod->soundfromcenter = true;
3513 mod->TraceBox = Mod_Q1BSP_TraceBox;
3514 mod->TraceLine = Mod_Q1BSP_TraceLine;
3515 mod->TracePoint = Mod_Q1BSP_TracePoint;
3516 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3517 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3518 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3519 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3520 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3521 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3522 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3523 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3524 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3525 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3526 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3527 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3528 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3529 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3530 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3531 mod->Draw = R_Q1BSP_Draw;
3532 mod->DrawDepth = R_Q1BSP_DrawDepth;
3533 mod->DrawDebug = R_Q1BSP_DrawDebug;
3534 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3535 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3536 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3537 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3538 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3539 mod->DrawLight = R_Q1BSP_DrawLight;
3543 mod->brush.qw_md4sum = 0;
3544 mod->brush.qw_md4sum2 = 0;
3545 for (i = 0;i < HEADER_LUMPS;i++)
3547 if (i == LUMP_ENTITIES)
3549 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3550 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3552 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3555 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3556 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3557 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3558 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3559 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3560 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3561 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3562 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3563 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3564 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3565 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3566 // load submodels before leafs because they contain the number of vis leafs
3567 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3568 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3569 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3570 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3572 // check if the map supports transparent water rendering
3573 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3575 if (mod->brushq1.data_compressedpvs)
3576 Mem_Free(mod->brushq1.data_compressedpvs);
3577 mod->brushq1.data_compressedpvs = NULL;
3578 mod->brushq1.num_compressedpvs = 0;
3580 Mod_Q1BSP_MakeHull0();
3581 Mod_Q1BSP_MakePortals();
3583 mod->numframes = 2; // regular and alternate animation
3586 mainmempool = mod->mempool;
3588 // make a single combined shadow mesh to allow optimized shadow volume creation
3589 numshadowmeshtriangles = 0;
3590 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3592 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3593 numshadowmeshtriangles += surface->num_triangles;
3595 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3596 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3597 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
3598 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3599 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3601 if (loadmodel->brush.numsubmodels)
3602 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3604 // LordHavoc: to clear the fog around the original quake submodel code, I
3606 // first of all, some background info on the submodels:
3607 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3608 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3609 // now the weird for loop itself:
3610 // the loop functions in an odd way, on each iteration it sets up the
3611 // current 'mod' model (which despite the confusing code IS the model of
3612 // the number i), at the end of the loop it duplicates the model to become
3613 // the next submodel, and loops back to set up the new submodel.
3615 // LordHavoc: now the explanation of my sane way (which works identically):
3616 // set up the world model, then on each submodel copy from the world model
3617 // and set up the submodel with the respective model info.
3618 totalstylesurfaces = 0;
3620 for (i = 0;i < mod->brush.numsubmodels;i++)
3622 memset(stylecounts, 0, sizeof(stylecounts));
3623 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3625 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3626 for (j = 0;j < MAXLIGHTMAPS;j++)
3627 stylecounts[surface->lightmapinfo->styles[j]]++;
3629 for (k = 0;k < 255;k++)
3633 totalstylesurfaces += stylecounts[k];
3636 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3637 for (i = 0;i < mod->brush.numsubmodels;i++)
3639 // LordHavoc: this code was originally at the end of this loop, but
3640 // has been transformed to something more readable at the start here.
3645 // duplicate the basic information
3646 dpsnprintf(name, sizeof(name), "*%i", i);
3647 mod = Mod_FindName(name, loadmodel->name);
3648 // copy the base model to this one
3650 // rename the clone back to its proper name
3651 strlcpy(mod->name, name, sizeof(mod->name));
3652 mod->brush.parentmodel = loadmodel;
3653 // textures and memory belong to the main model
3654 mod->texturepool = NULL;
3655 mod->mempool = NULL;
3656 mod->brush.GetPVS = NULL;
3657 mod->brush.FatPVS = NULL;
3658 mod->brush.BoxTouchingPVS = NULL;
3659 mod->brush.BoxTouchingLeafPVS = NULL;
3660 mod->brush.BoxTouchingVisibleLeafs = NULL;
3661 mod->brush.FindBoxClusters = NULL;
3662 mod->brush.LightPoint = NULL;
3663 mod->brush.AmbientSoundLevelsForPoint = NULL;
3666 mod->brush.submodel = i;
3668 if (loadmodel->brush.submodels)
3669 loadmodel->brush.submodels[i] = mod;
3671 bm = &mod->brushq1.submodels[i];
3673 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3674 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3676 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3677 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3680 mod->firstmodelsurface = bm->firstface;
3681 mod->nummodelsurfaces = bm->numfaces;
3683 // set node/leaf parents for this submodel
3684 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3686 // make the model surface list (used by shadowing/lighting)
3687 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3688 Mod_MakeSortedSurfaces(mod);
3690 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3691 // (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)
3692 VectorCopy(bm->mins, mod->normalmins);
3693 VectorCopy(bm->maxs, mod->normalmaxs);
3694 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3695 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3696 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3697 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3698 modelradius = modelyawradius + modelradius * modelradius;
3699 modelyawradius = sqrt(modelyawradius);
3700 modelradius = sqrt(modelradius);
3701 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3702 mod->yawmins[2] = mod->normalmins[2];
3703 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3704 mod->yawmaxs[2] = mod->normalmaxs[2];
3705 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3706 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3707 mod->radius = modelradius;
3708 mod->radius2 = modelradius * modelradius;
3710 // this gets altered below if sky or water is used
3711 mod->DrawSky = NULL;
3712 mod->DrawAddWaterPlanes = NULL;
3714 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3715 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3716 if (mod->nummodelsurfaces)
3718 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3719 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3721 if (j < mod->nummodelsurfaces)
3722 mod->DrawSky = R_Q1BSP_DrawSky;
3724 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3725 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3727 if (j < mod->nummodelsurfaces)
3728 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3730 // build lightstyle update chains
3731 // (used to rapidly mark lightmapupdateflags on many surfaces
3732 // when d_lightstylevalue changes)
3733 memset(stylecounts, 0, sizeof(stylecounts));
3734 for (k = 0;k < mod->nummodelsurfaces;k++)
3736 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3737 for (j = 0;j < MAXLIGHTMAPS;j++)
3738 stylecounts[surface->lightmapinfo->styles[j]]++;
3740 mod->brushq1.num_lightstyles = 0;
3741 for (k = 0;k < 255;k++)
3745 styleinfo[mod->brushq1.num_lightstyles].style = k;
3746 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3747 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3748 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3749 remapstyles[k] = mod->brushq1.num_lightstyles;
3750 mod->brushq1.num_lightstyles++;
3753 for (k = 0;k < mod->nummodelsurfaces;k++)
3755 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3756 for (j = 0;j < MAXLIGHTMAPS;j++)
3758 if (surface->lightmapinfo->styles[j] != 255)
3760 int r = remapstyles[surface->lightmapinfo->styles[j]];
3761 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3765 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3766 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3770 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3771 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3773 //mod->brushq1.num_visleafs = bm->visleafs;
3776 Mod_Q1BSP_LoadMapBrushes();
3778 //Mod_Q1BSP_ProcessLightList();
3780 if (developer.integer >= 10)
3781 Con_Printf("Some stats for q1bsp model \"%s\": %i faces, %i nodes, %i leafs, %i visleafs, %i visleafportals\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals);
3784 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3788 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3795 in = (void *)(mod_base + l->fileofs);
3796 if (l->filelen % sizeof(*in))
3797 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3798 count = l->filelen / sizeof(*in);
3799 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3802 loadmodel->num = count;
3804 for (i = 0;i < count;i++, in++, out++)
3810 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3817 in = (void *)(mod_base + l->fileofs);
3818 if (l->filelen % sizeof(*in))
3819 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3820 count = l->filelen / sizeof(*in);
3821 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3824 loadmodel->num = count;
3826 for (i = 0;i < count;i++, in++, out++)
3832 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3839 in = (void *)(mod_base + l->fileofs);
3840 if (l->filelen % sizeof(*in))
3841 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3842 count = l->filelen / sizeof(*in);
3843 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3846 loadmodel->num = count;
3848 for (i = 0;i < count;i++, in++, out++)
3854 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3861 in = (void *)(mod_base + l->fileofs);
3862 if (l->filelen % sizeof(*in))
3863 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3864 count = l->filelen / sizeof(*in);
3865 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3868 loadmodel->num = count;
3870 for (i = 0;i < count;i++, in++, out++)
3876 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3883 in = (void *)(mod_base + l->fileofs);
3884 if (l->filelen % sizeof(*in))
3885 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3886 count = l->filelen / sizeof(*in);
3887 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3890 loadmodel->num = count;
3892 for (i = 0;i < count;i++, in++, out++)
3898 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3905 in = (void *)(mod_base + l->fileofs);
3906 if (l->filelen % sizeof(*in))
3907 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3908 count = l->filelen / sizeof(*in);
3909 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3912 loadmodel->num = count;
3914 for (i = 0;i < count;i++, in++, out++)
3920 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3927 in = (void *)(mod_base + l->fileofs);
3928 if (l->filelen % sizeof(*in))
3929 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3930 count = l->filelen / sizeof(*in);
3931 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3934 loadmodel->num = count;
3936 for (i = 0;i < count;i++, in++, out++)
3942 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3949 in = (void *)(mod_base + l->fileofs);
3950 if (l->filelen % sizeof(*in))
3951 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3952 count = l->filelen / sizeof(*in);
3953 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3956 loadmodel->num = count;
3958 for (i = 0;i < count;i++, in++, out++)
3964 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3971 in = (void *)(mod_base + l->fileofs);
3972 if (l->filelen % sizeof(*in))
3973 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3974 count = l->filelen / sizeof(*in);
3975 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3978 loadmodel->num = count;
3980 for (i = 0;i < count;i++, in++, out++)
3986 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3993 in = (void *)(mod_base + l->fileofs);
3994 if (l->filelen % sizeof(*in))
3995 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3996 count = l->filelen / sizeof(*in);
3997 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4000 loadmodel->num = count;
4002 for (i = 0;i < count;i++, in++, out++)
4008 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4015 in = (void *)(mod_base + l->fileofs);
4016 if (l->filelen % sizeof(*in))
4017 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4018 count = l->filelen / sizeof(*in);
4019 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4022 loadmodel->num = count;
4024 for (i = 0;i < count;i++, in++, out++)
4030 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4037 in = (void *)(mod_base + l->fileofs);
4038 if (l->filelen % sizeof(*in))
4039 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4040 count = l->filelen / sizeof(*in);
4041 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4044 loadmodel->num = count;
4046 for (i = 0;i < count;i++, in++, out++)
4052 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4059 in = (void *)(mod_base + l->fileofs);
4060 if (l->filelen % sizeof(*in))
4061 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4062 count = l->filelen / sizeof(*in);
4063 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4066 loadmodel->num = count;
4068 for (i = 0;i < count;i++, in++, out++)
4074 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4081 in = (void *)(mod_base + l->fileofs);
4082 if (l->filelen % sizeof(*in))
4083 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4084 count = l->filelen / sizeof(*in);
4085 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4088 loadmodel->num = count;
4090 for (i = 0;i < count;i++, in++, out++)
4096 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4103 in = (void *)(mod_base + l->fileofs);
4104 if (l->filelen % sizeof(*in))
4105 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4106 count = l->filelen / sizeof(*in);
4107 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4110 loadmodel->num = count;
4112 for (i = 0;i < count;i++, in++, out++)
4118 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4125 in = (void *)(mod_base + l->fileofs);
4126 if (l->filelen % sizeof(*in))
4127 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4128 count = l->filelen / sizeof(*in);
4129 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4132 loadmodel->num = count;
4134 for (i = 0;i < count;i++, in++, out++)
4140 static void Mod_Q2BSP_LoadModels(lump_t *l)
4147 in = (void *)(mod_base + l->fileofs);
4148 if (l->filelen % sizeof(*in))
4149 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4150 count = l->filelen / sizeof(*in);
4151 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4154 loadmodel->num = count;
4156 for (i = 0;i < count;i++, in++, out++)
4162 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4165 q2dheader_t *header;
4167 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4169 mod->modeldatatypestring = "Q2BSP";
4171 mod->type = mod_brushq2;
4173 header = (q2dheader_t *)buffer;
4175 i = LittleLong(header->version);
4176 if (i != Q2BSPVERSION)
4177 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4179 mod_base = (unsigned char *)header;
4181 // swap all the lumps
4182 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4183 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4185 mod->brush.qw_md4sum = 0;
4186 mod->brush.qw_md4sum2 = 0;
4187 for (i = 0;i < Q2HEADER_LUMPS;i++)
4189 if (i == Q2LUMP_ENTITIES)
4191 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4192 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4194 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4197 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4198 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4199 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4200 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4201 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4202 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4203 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4204 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4205 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4206 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4207 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4208 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4209 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4210 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4211 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4212 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4213 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4214 // LordHavoc: must go last because this makes the submodels
4215 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4218 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4219 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4221 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4224 char key[128], value[MAX_INPUTLINE];
4226 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4227 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4228 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4231 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4232 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4233 loadmodel->brush.entities[l->filelen] = 0;
4234 data = loadmodel->brush.entities;
4235 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4236 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4237 loadmodel->brushq3.deluxemapping = false;
4238 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4242 if (!COM_ParseToken_Simple(&data, false, false))
4244 if (com_token[0] == '}')
4245 break; // end of worldspawn
4246 if (com_token[0] == '_')
4247 strlcpy(key, com_token + 1, sizeof(key));
4249 strlcpy(key, com_token, sizeof(key));
4250 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4251 key[strlen(key)-1] = 0;
4252 if (!COM_ParseToken_Simple(&data, false, false))
4254 strlcpy(value, com_token, sizeof(value));
4255 if (!strcmp("gridsize", key))
4257 #if _MSC_VER >= 1400
4258 #define sscanf sscanf_s
4260 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4261 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));
4303 if (cls.state == ca_dedicated)
4306 for (i = 0;i < count;i++, in++, out++)
4307 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4310 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4316 in = (q3dplane_t *)(mod_base + l->fileofs);
4317 if (l->filelen % sizeof(*in))
4318 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4319 count = l->filelen / sizeof(*in);
4320 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4322 loadmodel->brush.data_planes = out;
4323 loadmodel->brush.num_planes = count;
4325 for (i = 0;i < count;i++, in++, out++)
4327 out->normal[0] = LittleFloat(in->normal[0]);
4328 out->normal[1] = LittleFloat(in->normal[1]);
4329 out->normal[2] = LittleFloat(in->normal[2]);
4330 out->dist = LittleFloat(in->dist);
4335 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4338 q3mbrushside_t *out;
4341 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4342 if (l->filelen % sizeof(*in))
4343 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4344 count = l->filelen / sizeof(*in);
4345 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4347 loadmodel->brush.data_brushsides = out;
4348 loadmodel->brush.num_brushsides = count;
4350 for (i = 0;i < count;i++, in++, out++)
4352 n = LittleLong(in->planeindex);
4353 if (n < 0 || n >= loadmodel->brush.num_planes)
4354 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4355 out->plane = loadmodel->brush.data_planes + n;
4356 n = LittleLong(in->textureindex);
4357 if (n < 0 || n >= loadmodel->num_textures)
4358 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4359 out->texture = loadmodel->data_textures + n;
4363 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4365 q3dbrushside_ig_t *in;
4366 q3mbrushside_t *out;
4369 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4370 if (l->filelen % sizeof(*in))
4371 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4372 count = l->filelen / sizeof(*in);
4373 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4375 loadmodel->brush.data_brushsides = out;
4376 loadmodel->brush.num_brushsides = count;
4378 for (i = 0;i < count;i++, in++, out++)
4380 n = LittleLong(in->planeindex);
4381 if (n < 0 || n >= loadmodel->brush.num_planes)
4382 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4383 out->plane = loadmodel->brush.data_planes + n;
4384 n = LittleLong(in->textureindex);
4385 if (n < 0 || n >= loadmodel->num_textures)
4386 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4387 out->texture = loadmodel->data_textures + n;
4391 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4395 int i, j, n, c, count, maxplanes, q3surfaceflags;
4396 colplanef_t *planes;
4398 in = (q3dbrush_t *)(mod_base + l->fileofs);
4399 if (l->filelen % sizeof(*in))
4400 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4401 count = l->filelen / sizeof(*in);
4402 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4404 loadmodel->brush.data_brushes = out;
4405 loadmodel->brush.num_brushes = count;
4410 for (i = 0;i < count;i++, in++, out++)
4412 n = LittleLong(in->firstbrushside);
4413 c = LittleLong(in->numbrushsides);
4414 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4415 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4416 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4417 out->numbrushsides = c;
4418 n = LittleLong(in->textureindex);
4419 if (n < 0 || n >= loadmodel->num_textures)
4420 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4421 out->texture = loadmodel->data_textures + n;
4423 // make a list of mplane_t structs to construct a colbrush from
4424 if (maxplanes < out->numbrushsides)
4426 maxplanes = out->numbrushsides;
4429 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4432 for (j = 0;j < out->numbrushsides;j++)
4434 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4435 planes[j].dist = out->firstbrushside[j].plane->dist;
4436 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4437 planes[j].texture = out->firstbrushside[j].texture;
4438 q3surfaceflags |= planes[j].q3surfaceflags;
4440 // make the colbrush from the planes
4441 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4443 // this whole loop can take a while (e.g. on redstarrepublic4)
4444 CL_KeepaliveMessage(false);
4450 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4456 in = (q3deffect_t *)(mod_base + l->fileofs);
4457 if (l->filelen % sizeof(*in))
4458 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4459 count = l->filelen / sizeof(*in);
4460 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4462 loadmodel->brushq3.data_effects = out;
4463 loadmodel->brushq3.num_effects = count;
4465 for (i = 0;i < count;i++, in++, out++)
4467 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4468 n = LittleLong(in->brushindex);
4469 if (n >= loadmodel->brush.num_brushes)
4471 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4474 out->brushindex = n;
4475 out->unknown = LittleLong(in->unknown);
4479 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4484 in = (q3dvertex_t *)(mod_base + l->fileofs);
4485 if (l->filelen % sizeof(*in))
4486 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4487 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4488 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4489 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4490 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4491 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4492 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4494 for (i = 0;i < count;i++, in++)
4496 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4497 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4498 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4499 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4500 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4501 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4502 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4503 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4504 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4505 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4506 // svector/tvector are calculated later in face loading
4507 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4508 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4509 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4510 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4514 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4520 in = (int *)(mod_base + l->fileofs);
4521 if (l->filelen % sizeof(int[3]))
4522 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4523 count = l->filelen / sizeof(*in);
4524 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4526 loadmodel->brushq3.num_triangles = count / 3;
4527 loadmodel->brushq3.data_element3i = out;
4529 for (i = 0;i < count;i++, in++, out++)
4531 *out = LittleLong(*in);
4532 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4534 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4535 if(!loadmodel->brushq3.num_vertices)
4536 Host_Error("Mod_Q1BSP_LoadTrianglles: %s has triangles but no vertexes, cannot fix\n", loadmodel->name);
4542 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4544 q3dlightmap_t *input_pointer;
4545 int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4548 unsigned char *convertedpixels;
4549 char mapname[MAX_QPATH];
4550 int size, bytesperpixel, rgbmap[3];
4552 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4554 // defaults for q3bsp
4561 loadmodel->brushq3.lightmapsize = 128;
4563 if (cls.state == ca_dedicated)
4566 if(mod_q3bsp_nolightmaps.integer)
4572 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4573 if (developer_loading.integer)
4574 Con_Printf("Using internal lightmaps\n");
4575 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4576 if (l->filelen % sizeof(*input_pointer))
4577 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4578 count = l->filelen / sizeof(*input_pointer);
4579 for(i = 0; i < count; ++i)
4580 inpixels[i] = input_pointer[i].rgb;
4584 // no internal lightmaps
4585 // try external lightmaps
4586 if (developer_loading.integer)
4587 Con_Printf("Using external lightmaps\n");
4588 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4589 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4593 // using EXTERNAL lightmaps instead
4594 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4596 Mem_Free(inpixels[0]);
4597 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4607 for(count = 1; ; ++count)
4609 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4610 if(!inpixels[count])
4611 break; // we got all of them
4612 if(image_width != size || image_height != size)
4614 for(i = 0; i <= count; ++i)
4615 Mem_Free(inpixels[i]);
4616 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4621 convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4622 loadmodel->brushq3.lightmapsize = size;
4623 loadmodel->brushq3.num_originallightmaps = count;
4625 // now check the surfaces to see if any of them index an odd numbered
4626 // lightmap, if so this is not a deluxemapped bsp file
4628 // also check what lightmaps are actually used, because q3map2 sometimes
4629 // (always?) makes an unused one at the end, which
4630 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4631 // reason when only one lightmap is used, which can throw off the
4632 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4633 // to see if the second lightmap is blank, if so it is not deluxemapped.
4634 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4635 // in Mod_Q3BSP_LoadEntities was failed
4636 if (!loadmodel->brushq3.deluxemapping)
4638 loadmodel->brushq3.deluxemapping = !(count & 1);
4639 loadmodel->brushq3.deluxemapping_modelspace = true;
4641 if (loadmodel->brushq3.deluxemapping)
4643 int facecount = faceslump->filelen / sizeof(q3dface_t);
4644 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4645 for (i = 0;i < facecount;i++)
4647 j = LittleLong(faces[i].lightmapindex);
4650 endlightmap = max(endlightmap, j + 1);
4651 if ((j & 1) || j + 1 >= count)
4653 loadmodel->brushq3.deluxemapping = false;
4660 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4661 // reason when only one lightmap is used, which can throw off the
4662 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4663 // to see if the second lightmap is blank, if so it is not deluxemapped.
4665 // further research has shown q3map2 sometimes creates a deluxemap and two
4666 // blank lightmaps, which must be handled properly as well
4667 if (endlightmap == 1 && count > 1)
4670 for (i = 0;i < size*size;i++)
4672 if (c[bytesperpixel*i + rgbmap[0]])
4674 if (c[bytesperpixel*i + rgbmap[1]])
4676 if (c[bytesperpixel*i + rgbmap[2]])
4681 // all pixels in the unused lightmap were black...
4682 loadmodel->brushq3.deluxemapping = false;
4687 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4689 // figure out what the most reasonable merge power is within limits
4691 loadmodel->brushq3.num_lightmapmergepower = 0;
4693 for(i = 0; (128 << i) < size; ++i)
4695 // i is now 0 for 128, 1 for 256, etc
4697 for (power = 1;power + i <= mod_q3bsp_lightmapmergepower.integer && (size << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)); power++)
4698 loadmodel->brushq3.num_lightmapmergepower = power;
4700 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4702 loadmodel->brushq3.num_mergedlightmaps = ((count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4703 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4704 if (loadmodel->brushq3.deluxemapping)
4705 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4707 // allocate a texture pool if we need it
4708 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4709 loadmodel->texturepool = R_AllocTexturePool();
4711 power = loadmodel->brushq3.num_lightmapmergepower;
4713 mask = (1 << power) - 1;
4714 for (i = 0;i < count;i++)
4716 // figure out which merged lightmap texture this fits into
4717 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4718 for (k = 0;k < size*size;k++)
4720 convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4721 convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4722 convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4723 convertedpixels[k*4+3] = 255;
4725 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4727 // if the lightmap has not been allocated yet, create it
4728 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4730 // create a lightmap only as large as necessary to hold the
4731 // remaining size*size blocks
4732 // if there are multiple merged lightmap textures then they will
4733 // all be full size except the last one which may be smaller
4734 // because it only needs to the remaining blocks, and it will often
4735 // be odd sizes like 2048x512 due to only being 25% full or so.
4736 j = (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) - (lightmapindex << power2);
4737 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4739 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4741 if (developer_loading.integer)
4742 Con_Printf("lightmap merge texture #%i is %ix%i (%i of %i used)\n", lightmapindex, mergewidth*size, mergeheight*size, min(j, mergewidth*mergeheight), mergewidth*mergeheight);
4743 loadmodel->brushq3.data_lightmaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergewidth * size, mergeheight * size, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4744 if (loadmodel->brushq3.data_deluxemaps)
4745 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergewidth * size, mergeheight * size, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4747 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4748 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4749 j = (i >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) & ((1 << power2) - 1);
4750 if (loadmodel->brushq3.deluxemapping && (i & 1))
4751 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4753 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4757 // figure out which merged lightmap texture this fits into
4758 if (loadmodel->brushq3.deluxemapping && (i & 1))
4759 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), size, size, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4761 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), size, size, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4765 Mem_Free(convertedpixels);
4768 for(i = 0; i < count; ++i)
4769 Mem_Free(inpixels[i]);
4773 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4780 *collisionstride = stride;
4781 cnt = (num_triangles + stride - 1) / stride;
4782 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4783 for(j = 0; j < cnt; ++j)
4785 mins = &((*collisionbbox6f)[6 * j + 0]);
4786 maxs = &((*collisionbbox6f)[6 * j + 3]);
4787 for(k = 0; k < stride; ++k)
4789 tri = j * stride + k;
4790 if(tri >= num_triangles)
4792 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4793 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4794 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4795 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4796 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4797 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4798 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4799 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4800 if(vert[0] < mins[0]) mins[0] = vert[0];
4801 if(vert[1] < mins[1]) mins[1] = vert[1];
4802 if(vert[2] < mins[2]) mins[2] = vert[2];
4803 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4804 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4805 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4806 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
4807 if(vert[0] < mins[0]) mins[0] = vert[0];
4808 if(vert[1] < mins[1]) mins[1] = vert[1];
4809 if(vert[2] < mins[2]) mins[2] = vert[2];
4810 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4811 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4812 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4818 *collisionstride = 0;
4819 *collisionbbox6f = NULL;
4823 typedef struct patchtess_s
4827 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4830 float *originalvertex3f;
4833 #define PATCHTESS_SAME_LODGROUP(a,b) \
4835 (a).lodgroup[0] == (b).lodgroup[0] && \
4836 (a).lodgroup[1] == (b).lodgroup[1] && \
4837 (a).lodgroup[2] == (b).lodgroup[2] && \
4838 (a).lodgroup[3] == (b).lodgroup[3] && \
4839 (a).lodgroup[4] == (b).lodgroup[4] && \
4840 (a).lodgroup[5] == (b).lodgroup[5] \
4843 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4845 q3dface_t *in, *oldin;
4846 msurface_t *out, *oldout;
4847 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles, cxtess, cytess;
4848 float lightmaptcbase[2], lightmaptcscale[2];
4849 //int *originalelement3i;
4850 //int *originalneighbor3i;
4851 float *originalvertex3f;
4852 //float *originalsvector3f;
4853 //float *originaltvector3f;
4854 float *originalnormal3f;
4855 float *originalcolor4f;
4856 float *originaltexcoordtexture2f;
4857 float *originaltexcoordlightmap2f;
4859 patchtess_t *patchtess = NULL;
4860 int patchtesscount = 0;
4863 in = (q3dface_t *)(mod_base + l->fileofs);
4864 if (l->filelen % sizeof(*in))
4865 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4866 count = l->filelen / sizeof(*in);
4867 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4869 loadmodel->data_surfaces = out;
4870 loadmodel->num_surfaces = count;
4873 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4881 for (;i < count;i++, in++, out++)
4883 // check face type first
4884 type = LittleLong(in->type);
4885 if (type != Q3FACETYPE_FLAT
4886 && type != Q3FACETYPE_PATCH
4887 && type != Q3FACETYPE_MESH
4888 && type != Q3FACETYPE_FLARE)
4890 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4894 n = LittleLong(in->textureindex);
4895 if (n < 0 || n >= loadmodel->num_textures)
4897 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4900 out->texture = loadmodel->data_textures + n;
4901 n = LittleLong(in->effectindex);
4902 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4904 if (developer.integer >= 100)
4905 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4911 out->effect = loadmodel->brushq3.data_effects + n;
4913 if (cls.state != ca_dedicated)
4915 out->lightmaptexture = NULL;
4916 out->deluxemaptexture = r_texture_blanknormalmap;
4917 n = LittleLong(in->lightmapindex);
4920 else if (n >= loadmodel->brushq3.num_originallightmaps)
4922 if(loadmodel->brushq3.num_originallightmaps != 0)
4923 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4928 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4929 if (loadmodel->brushq3.deluxemapping)
4930 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4934 firstvertex = LittleLong(in->firstvertex);
4935 numvertices = LittleLong(in->numvertices);
4936 firstelement = LittleLong(in->firstelement);
4937 numtriangles = LittleLong(in->numelements) / 3;
4938 if (numtriangles * 3 != LittleLong(in->numelements))
4940 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));
4943 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4945 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);
4948 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4950 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);
4955 case Q3FACETYPE_FLAT:
4956 case Q3FACETYPE_MESH:
4957 // no processing necessary
4959 case Q3FACETYPE_PATCH:
4960 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4961 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4962 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))
4964 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4967 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4969 // convert patch to Q3FACETYPE_MESH
4970 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4971 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4972 // bound to user settings
4973 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4974 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4975 // bound to sanity settings
4976 xtess = bound(0, xtess, 1024);
4977 ytess = bound(0, ytess, 1024);
4979 // lower quality collision patches! Same procedure as before, but different cvars
4980 // convert patch to Q3FACETYPE_MESH
4981 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4982 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4983 // bound to user settings
4984 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
4985 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
4986 // bound to sanity settings
4987 cxtess = bound(0, cxtess, 1024);
4988 cytess = bound(0, cytess, 1024);
4990 // store it for the LOD grouping step
4991 patchtess[patchtesscount].info.xsize = patchsize[0];
4992 patchtess[patchtesscount].info.ysize = patchsize[1];
4993 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
4994 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
4995 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
4996 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
4998 patchtess[patchtesscount].surface_id = i;
4999 patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
5000 patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
5001 patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
5002 patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
5003 patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
5004 patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
5005 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5008 case Q3FACETYPE_FLARE:
5009 if (developer.integer >= 100)
5010 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5014 out->num_vertices = numvertices;
5015 out->num_triangles = numtriangles;
5016 meshvertices += out->num_vertices;
5017 meshtriangles += out->num_triangles;
5020 // Fix patches tesselations so that they make no seams
5024 for(i = 0; i < patchtesscount; ++i)
5026 for(j = i+1; j < patchtesscount; ++j)
5028 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5031 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5038 // Calculate resulting number of triangles
5039 for(i = 0; i < patchtesscount; ++i)
5041 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5042 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5043 numvertices = finalwidth * finalheight;
5044 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5046 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5047 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5048 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5049 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5055 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5058 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5060 if (out->num_vertices < 3 || out->num_triangles < 1)
5063 type = LittleLong(in->type);
5064 firstvertex = LittleLong(in->firstvertex);
5065 firstelement = LittleLong(in->firstelement);
5066 out->num_firstvertex = meshvertices;
5067 out->num_firsttriangle = meshtriangles;
5070 case Q3FACETYPE_FLAT:
5071 case Q3FACETYPE_MESH:
5072 // no processing necessary, except for lightmap merging
5073 for (j = 0;j < out->num_vertices;j++)
5075 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5076 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5077 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5078 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5079 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5080 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5081 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5082 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5083 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5084 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5085 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5086 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5087 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5088 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5090 for (j = 0;j < out->num_triangles*3;j++)
5091 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5093 case Q3FACETYPE_PATCH:
5094 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5095 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5096 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5097 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5098 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5099 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5100 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5102 xtess = ytess = cxtess = cytess = -1;
5103 for(j = 0; j < patchtesscount; ++j)
5104 if(patchtess[j].surface_id == i)
5106 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5107 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5108 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5109 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5114 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5115 xtess = ytess = cxtess = cytess = 0;
5118 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5119 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5120 finalvertices = finalwidth * finalheight;
5121 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5122 type = Q3FACETYPE_MESH;
5123 // generate geometry
5124 // (note: normals are skipped because they get recalculated)
5125 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5126 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5127 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5128 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5129 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5130 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5132 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);
5134 if (developer.integer >= 100)
5136 if (out->num_triangles < finaltriangles)
5137 Con_Printf("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);
5139 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->num_vertices, out->num_triangles);
5141 // q3map does not put in collision brushes for curves... ugh
5142 // build the lower quality collision geometry
5143 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5144 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5145 finalvertices = finalwidth * finalheight;
5146 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5148 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5149 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5150 out->num_collisionvertices = finalvertices;
5151 out->num_collisiontriangles = finaltriangles;
5152 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5153 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
5155 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5156 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
5158 oldnumtriangles = out->num_triangles;
5159 oldnumtriangles2 = out->num_collisiontriangles;
5160 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
5162 // now optimize the collision mesh by finding triangle bboxes...
5163 Mod_Q3BSP_BuildBBoxes(out->data_collisionelement3i, out->num_collisiontriangles, out->data_collisionvertex3f, &out->data_collisionbbox6f, &out->num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5164 Mod_Q3BSP_BuildBBoxes(loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle, out->num_triangles, loadmodel->surfmesh.data_vertex3f, &out->data_bbox6f, &out->num_bboxstride, mod_q3bsp_curves_stride.integer);
5166 if (developer.integer >= 100)
5167 Con_Printf("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);
5172 meshvertices += out->num_vertices;
5173 meshtriangles += out->num_triangles;
5174 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5175 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)
5177 if (invalidelements)
5179 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);
5180 for (j = 0;j < out->num_triangles * 3;j++)
5182 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5183 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)
5184 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5188 // calculate a bounding box
5189 VectorClear(out->mins);
5190 VectorClear(out->maxs);
5191 if (out->num_vertices)
5193 if (cls.state != ca_dedicated && out->lightmaptexture)
5195 // figure out which part of the merged lightmap this fits into
5196 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5197 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5198 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5199 lightmapindex &= mergewidth * mergeheight - 1;
5200 lightmaptcscale[0] = 1.0f / mergewidth;
5201 lightmaptcscale[1] = 1.0f / mergeheight;
5202 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5203 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5204 // modify the lightmap texcoords to match this region of the merged lightmap
5205 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5207 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5208 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5211 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5212 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5213 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5215 out->mins[0] = min(out->mins[0], v[0]);
5216 out->maxs[0] = max(out->maxs[0], v[0]);
5217 out->mins[1] = min(out->mins[1], v[1]);
5218 out->maxs[1] = max(out->maxs[1], v[1]);
5219 out->mins[2] = min(out->mins[2], v[2]);
5220 out->maxs[2] = max(out->maxs[2], v[2]);
5222 out->mins[0] -= 1.0f;
5223 out->mins[1] -= 1.0f;
5224 out->mins[2] -= 1.0f;
5225 out->maxs[0] += 1.0f;
5226 out->maxs[1] += 1.0f;
5227 out->maxs[2] += 1.0f;
5229 // set lightmap styles for consistency with q1bsp
5230 //out->lightmapinfo->styles[0] = 0;
5231 //out->lightmapinfo->styles[1] = 255;
5232 //out->lightmapinfo->styles[2] = 255;
5233 //out->lightmapinfo->styles[3] = 255;
5238 for (;i < count;i++, out++)
5240 if(out->num_vertices && out->num_triangles)
5242 if(out->num_vertices == 0)
5243 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5244 if(out->num_triangles == 0)
5245 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5248 // for per pixel lighting
5249 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);
5251 // generate ushort elements array if possible
5252 if (loadmodel->surfmesh.data_element3s)
5253 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5254 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5256 // free the no longer needed vertex data
5257 loadmodel->brushq3.num_vertices = 0;
5258 if (loadmodel->brushq3.data_vertex3f)
5259 Mem_Free(loadmodel->brushq3.data_vertex3f);
5260 loadmodel->brushq3.data_vertex3f = NULL;
5261 loadmodel->brushq3.data_normal3f = NULL;
5262 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5263 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5264 loadmodel->brushq3.data_color4f = NULL;
5265 // free the no longer needed triangle data
5266 loadmodel->brushq3.num_triangles = 0;
5267 if (loadmodel->brushq3.data_element3i)
5268 Mem_Free(loadmodel->brushq3.data_element3i);
5269 loadmodel->brushq3.data_element3i = NULL;
5272 Mem_Free(patchtess);
5275 static void Mod_Q3BSP_LoadModels(lump_t *l)
5279 int i, j, n, c, count;
5281 in = (q3dmodel_t *)(mod_base + l->fileofs);
5282 if (l->filelen % sizeof(*in))
5283 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5284 count = l->filelen / sizeof(*in);
5285 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5287 loadmodel->brushq3.data_models = out;
5288 loadmodel->brushq3.num_models = count;
5290 for (i = 0;i < count;i++, in++, out++)
5292 for (j = 0;j < 3;j++)
5294 out->mins[j] = LittleFloat(in->mins[j]);
5295 out->maxs[j] = LittleFloat(in->maxs[j]);
5297 n = LittleLong(in->firstface);
5298 c = LittleLong(in->numfaces);
5299 if (n < 0 || n + c > loadmodel->num_surfaces)
5300 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5303 n = LittleLong(in->firstbrush);
5304 c = LittleLong(in->numbrushes);
5305 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5306 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5307 out->firstbrush = n;
5308 out->numbrushes = c;
5312 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5318 in = (int *)(mod_base + l->fileofs);
5319 if (l->filelen % sizeof(*in))
5320 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5321 count = l->filelen / sizeof(*in);
5322 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5324 loadmodel->brush.data_leafbrushes = out;
5325 loadmodel->brush.num_leafbrushes = count;
5327 for (i = 0;i < count;i++, in++, out++)
5329 n = LittleLong(*in);
5330 if (n < 0 || n >= loadmodel->brush.num_brushes)
5331 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5336 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5342 in = (int *)(mod_base + l->fileofs);
5343 if (l->filelen % sizeof(*in))
5344 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5345 count = l->filelen / sizeof(*in);
5346 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5348 loadmodel->brush.data_leafsurfaces = out;
5349 loadmodel->brush.num_leafsurfaces = count;
5351 for (i = 0;i < count;i++, in++, out++)
5353 n = LittleLong(*in);
5354 if (n < 0 || n >= loadmodel->num_surfaces)
5355 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5360 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5364 int i, j, n, c, count;
5366 in = (q3dleaf_t *)(mod_base + l->fileofs);
5367 if (l->filelen % sizeof(*in))
5368 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5369 count = l->filelen / sizeof(*in);
5370 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5372 loadmodel->brush.data_leafs = out;
5373 loadmodel->brush.num_leafs = count;
5375 for (i = 0;i < count;i++, in++, out++)
5379 out->clusterindex = LittleLong(in->clusterindex);
5380 out->areaindex = LittleLong(in->areaindex);
5381 for (j = 0;j < 3;j++)
5383 // yes the mins/maxs are ints
5384 out->mins[j] = LittleLong(in->mins[j]) - 1;
5385 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5387 n = LittleLong(in->firstleafface);
5388 c = LittleLong(in->numleaffaces);
5389 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5390 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5391 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5392 out->numleafsurfaces = c;
5393 n = LittleLong(in->firstleafbrush);
5394 c = LittleLong(in->numleafbrushes);
5395 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5396 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5397 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5398 out->numleafbrushes = c;
5402 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5408 in = (q3dnode_t *)(mod_base + l->fileofs);
5409 if (l->filelen % sizeof(*in))
5410 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5411 count = l->filelen / sizeof(*in);
5412 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5414 loadmodel->brush.data_nodes = out;
5415 loadmodel->brush.num_nodes = count;
5417 for (i = 0;i < count;i++, in++, out++)
5420 n = LittleLong(in->planeindex);
5421 if (n < 0 || n >= loadmodel->brush.num_planes)
5422 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5423 out->plane = loadmodel->brush.data_planes + n;
5424 for (j = 0;j < 2;j++)
5426 n = LittleLong(in->childrenindex[j]);
5429 if (n >= loadmodel->brush.num_nodes)
5430 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5431 out->children[j] = loadmodel->brush.data_nodes + n;
5436 if (n >= loadmodel->brush.num_leafs)
5437 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5438 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5441 for (j = 0;j < 3;j++)
5443 // yes the mins/maxs are ints
5444 out->mins[j] = LittleLong(in->mins[j]) - 1;
5445 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5449 // set the parent pointers
5450 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5453 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5456 q3dlightgrid_t *out;
5459 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5460 if (l->filelen % sizeof(*in))
5461 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5462 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5463 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5464 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5465 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5466 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5467 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5468 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5469 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5470 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5471 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5472 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5473 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5474 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5475 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]);
5476 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]);
5478 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5481 if (l->filelen < count * (int)sizeof(*in))
5482 Host_Error("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]);
5483 if (l->filelen != count * (int)sizeof(*in))
5484 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5485 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5486 loadmodel->brushq3.data_lightgrid = out;
5487 loadmodel->brushq3.num_lightgrid = count;
5488 // no swapping or validation necessary
5489 memcpy(out, in, count * (int)sizeof(*out));
5493 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5498 if (l->filelen == 0)
5501 // unvised maps often have cluster indices even without pvs, so check
5502 // leafs to find real number of clusters
5503 loadmodel->brush.num_pvsclusters = 1;
5504 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5505 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5508 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5509 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5510 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5511 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5515 in = (q3dpvs_t *)(mod_base + l->fileofs);
5517 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5519 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5520 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5521 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5522 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5523 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5524 if (l->filelen < totalchains + (int)sizeof(*in))
5525 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);
5527 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5528 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5531 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5533 int i, j, k, index[3];
5534 float transformed[3], blend1, blend2, blend, stylescale;
5535 q3dlightgrid_t *a, *s;
5537 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5538 stylescale = r_refdef.scene.rtlightstylevalue[0];
5540 if (!model->brushq3.num_lightgrid)
5542 ambientcolor[0] = stylescale;
5543 ambientcolor[1] = stylescale;
5544 ambientcolor[2] = stylescale;
5548 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5549 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5550 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5551 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5552 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5553 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5554 index[0] = (int)floor(transformed[0]);
5555 index[1] = (int)floor(transformed[1]);
5556 index[2] = (int)floor(transformed[2]);
5557 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5559 // now lerp the values
5560 VectorClear(diffusenormal);
5561 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5562 for (k = 0;k < 2;k++)
5564 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5565 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5567 for (j = 0;j < 2;j++)
5569 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5570 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5572 for (i = 0;i < 2;i++)
5574 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5575 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5577 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5578 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5579 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5580 // this uses the mod_md3_sin table because the values are
5581 // already in the 0-255 range, the 64+ bias fetches a cosine
5582 // instead of a sine value
5583 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5584 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5585 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5586 //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)));
5591 // normalize the light direction before turning
5592 VectorNormalize(diffusenormal);
5593 //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]);
5596 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5599 double midf, mid[3];
5605 // find the point distances
5606 mplane_t *plane = node->plane;
5607 if (plane->type < 3)
5609 t1 = p1[plane->type] - plane->dist;
5610 t2 = p2[plane->type] - plane->dist;
5614 t1 = DotProduct (plane->normal, p1) - plane->dist;
5615 t2 = DotProduct (plane->normal, p2) - plane->dist;
5622 node = node->children[1];
5631 node = node->children[0];
5637 midf = t1 / (t1 - t2);
5638 VectorLerp(p1, midf, p2, mid);
5640 // recurse both sides, front side first
5641 // return 2 if empty is followed by solid (hit something)
5642 // do not return 2 if both are solid or both empty,
5643 // or if start is solid and end is empty
5644 // as these degenerate cases usually indicate the eye is in solid and
5645 // should see the target point anyway
5646 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
5649 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5654 return ((mleaf_t *)node)->clusterindex < 0;
5657 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5659 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5662 model->TraceLine(model, 0, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5663 return trace.fraction == 1;
5667 double tracestart[3], traceend[3];
5668 VectorCopy(start, tracestart);
5669 VectorCopy(end, traceend);
5670 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5674 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5679 // find which leaf the point is in
5681 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5682 // point trace the brushes
5683 leaf = (mleaf_t *)node;
5684 for (i = 0;i < leaf->numleafbrushes;i++)
5686 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5687 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5689 brush->markframe = markframe;
5690 Collision_TracePointBrushFloat(trace, point, brush);
5693 // can't do point traces on curves (they have no thickness)
5696 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)
5698 int i, startside, endside;
5699 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5701 msurface_t *surface;
5704 // walk the tree until we hit a leaf, recursing for any split cases
5707 // abort if this part of the bsp tree can not be hit by this trace
5708 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5710 plane = node->plane;
5711 // axial planes are much more common than non-axial, so an optimized
5712 // axial case pays off here
5713 if (plane->type < 3)
5715 dist1 = start[plane->type] - plane->dist;
5716 dist2 = end[plane->type] - plane->dist;
5720 dist1 = DotProduct(start, plane->normal) - plane->dist;
5721 dist2 = DotProduct(end, plane->normal) - plane->dist;
5723 startside = dist1 < 0;
5724 endside = dist2 < 0;
5725 if (startside == endside)
5727 // most of the time the line fragment is on one side of the plane
5728 node = node->children[startside];
5732 // line crosses node plane, split the line
5733 dist1 = PlaneDiff(linestart, plane);
5734 dist2 = PlaneDiff(lineend, plane);
5735 midfrac = dist1 / (dist1 - dist2);
5736 VectorLerp(linestart, midfrac, lineend, mid);
5737 // take the near side first
5738 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5739 // if we found an impact on the front side, don't waste time
5740 // exploring the far side
5741 if (midfrac <= trace->realfraction)
5742 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5746 // abort if this part of the bsp tree can not be hit by this trace
5747 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5750 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5751 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5752 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5753 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5754 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5755 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5756 // line trace the brushes
5757 leaf = (mleaf_t *)node;
5758 for (i = 0;i < leaf->numleafbrushes;i++)
5760 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5761 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5763 brush->markframe = markframe;
5764 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5767 // can't do point traces on curves (they have no thickness)
5768 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5770 // line trace the curves
5771 for (i = 0;i < leaf->numleafsurfaces;i++)
5773 surface = model->data_surfaces + leaf->firstleafsurface[i];
5774 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5776 surface->collisionmarkframe = markframe;
5777 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5783 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)
5789 msurface_t *surface;
5791 float nodesegmentmins[3], nodesegmentmaxs[3];
5792 // walk the tree until we hit a leaf, recursing for any split cases
5795 // abort if this part of the bsp tree can not be hit by this trace
5796 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5798 plane = node->plane;
5799 // axial planes are much more common than non-axial, so an optimized
5800 // axial case pays off here
5801 if (plane->type < 3)
5803 // this is an axial plane, compare bounding box directly to it and
5804 // recurse sides accordingly
5805 // recurse down node sides
5806 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5807 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5808 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5809 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5813 // this is a non-axial plane, so check if the start and end boxes
5814 // are both on one side of the plane to handle 'diagonal' cases
5815 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5819 // segment crosses plane
5820 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5823 // if sides == 0 then the trace itself is bogus (Not A Number values),
5824 // in this case we simply pretend the trace hit nothing
5826 return; // ERROR: NAN bounding box!
5827 // take whichever side the segment box is on
5828 node = node->children[sides - 1];
5830 // abort if this part of the bsp tree can not be hit by this trace
5831 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5833 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5834 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5835 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5836 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5837 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5838 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5840 leaf = (mleaf_t *)node;
5841 for (i = 0;i < leaf->numleafbrushes;i++)
5843 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5844 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5846 brush->markframe = markframe;
5847 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5850 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5852 for (i = 0;i < leaf->numleafsurfaces;i++)
5854 surface = model->data_surfaces + leaf->firstleafsurface[i];
5855 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5857 surface->collisionmarkframe = markframe;
5858 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5864 static int markframe = 0;
5866 static void Mod_Q3BSP_TracePoint(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
5870 memset(trace, 0, sizeof(*trace));
5871 trace->fraction = 1;
5872 trace->realfraction = 1;
5873 trace->hitsupercontentsmask = hitsupercontentsmask;
5874 if (model->brush.submodel)
5876 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5877 if (brush->colbrushf)
5878 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5881 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5884 static void Mod_Q3BSP_TraceLine(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
5887 float segmentmins[3], segmentmaxs[3];
5888 msurface_t *surface;
5891 if (VectorCompare(start, end))
5893 Mod_Q3BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
5897 memset(trace, 0, sizeof(*trace));
5898 trace->fraction = 1;
5899 trace->realfraction = 1;
5900 trace->hitsupercontentsmask = hitsupercontentsmask;
5901 segmentmins[0] = min(start[0], end[0]) - 1;
5902 segmentmins[1] = min(start[1], end[1]) - 1;
5903 segmentmins[2] = min(start[2], end[2]) - 1;
5904 segmentmaxs[0] = max(start[0], end[0]) + 1;
5905 segmentmaxs[1] = max(start[1], end[1]) + 1;
5906 segmentmaxs[2] = max(start[2], end[2]) + 1;
5907 if (model->brush.submodel)
5909 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5910 if (brush->colbrushf)
5911 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5912 if (mod_q3bsp_curves_collisions.integer)
5913 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5914 if (surface->num_collisiontriangles)
5915 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5918 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5921 static void Mod_Q3BSP_TraceBox(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
5924 float segmentmins[3], segmentmaxs[3];
5925 msurface_t *surface;
5927 colboxbrushf_t thisbrush_start, thisbrush_end;
5928 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5930 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
5932 vec3_t shiftstart, shiftend;
5933 VectorAdd(start, boxmins, shiftstart);
5934 VectorAdd(end, boxmins, shiftend);
5935 if (VectorCompare(start, end))
5936 Mod_Q3BSP_TracePoint(model, frame, trace, shiftstart, hitsupercontentsmask);
5939 Mod_Q3BSP_TraceLine(model, frame, trace, shiftstart, shiftend, hitsupercontentsmask);
5940 VectorSubtract(trace->endpos, boxmins, trace->endpos);
5945 // box trace, performed as brush trace
5946 memset(trace, 0, sizeof(*trace));
5947 trace->fraction = 1;
5948 trace->realfraction = 1;
5949 trace->hitsupercontentsmask = hitsupercontentsmask;
5950 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5951 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5952 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5953 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5954 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5955 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5956 VectorAdd(start, boxmins, boxstartmins);
5957 VectorAdd(start, boxmaxs, boxstartmaxs);
5958 VectorAdd(end, boxmins, boxendmins);
5959 VectorAdd(end, boxmaxs, boxendmaxs);
5960 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
5961 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
5962 if (model->brush.submodel)
5964 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5965 if (brush->colbrushf)
5966 Collision_TraceBrushBrushFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, brush->colbrushf, brush->colbrushf);
5967 if (mod_q3bsp_curves_collisions.integer)
5968 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5969 if (surface->num_collisiontriangles)
5970 Collision_TraceBrushTriangleMeshFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5973 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, &thisbrush_start.brush, &thisbrush_end.brush, ++markframe, segmentmins, segmentmaxs);
5976 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5979 int supercontents = 0;
5981 // test if the point is inside each brush
5982 if (model->brush.submodel)
5984 // submodels are effectively one leaf
5985 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5986 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5987 supercontents |= brush->colbrushf->supercontents;
5991 mnode_t *node = model->brush.data_nodes;
5993 // find which leaf the point is in
5995 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5996 leaf = (mleaf_t *)node;
5997 // now check the brushes in the leaf
5998 for (i = 0;i < leaf->numleafbrushes;i++)
6000 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
6001 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6002 supercontents |= brush->colbrushf->supercontents;
6005 return supercontents;
6008 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
6010 int supercontents = 0;
6011 if (nativecontents & CONTENTSQ3_SOLID)
6012 supercontents |= SUPERCONTENTS_SOLID;
6013 if (nativecontents & CONTENTSQ3_WATER)
6014 supercontents |= SUPERCONTENTS_WATER;
6015 if (nativecontents & CONTENTSQ3_SLIME)
6016 supercontents |= SUPERCONTENTS_SLIME;
6017 if (nativecontents & CONTENTSQ3_LAVA)
6018 supercontents |= SUPERCONTENTS_LAVA;
6019 if (nativecontents & CONTENTSQ3_BODY)
6020 supercontents |= SUPERCONTENTS_BODY;
6021 if (nativecontents & CONTENTSQ3_CORPSE)
6022 supercontents |= SUPERCONTENTS_CORPSE;
6023 if (nativecontents & CONTENTSQ3_NODROP)
6024 supercontents |= SUPERCONTENTS_NODROP;
6025 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
6026 supercontents |= SUPERCONTENTS_PLAYERCLIP;
6027 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
6028 supercontents |= SUPERCONTENTS_MONSTERCLIP;
6029 if (nativecontents & CONTENTSQ3_DONOTENTER)
6030 supercontents |= SUPERCONTENTS_DONOTENTER;
6031 if (nativecontents & CONTENTSQ3_BOTCLIP)
6032 supercontents |= SUPERCONTENTS_BOTCLIP;
6033 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
6034 supercontents |= SUPERCONTENTS_OPAQUE;
6035 return supercontents;
6038 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
6040 int nativecontents = 0;
6041 if (supercontents & SUPERCONTENTS_SOLID)
6042 nativecontents |= CONTENTSQ3_SOLID;
6043 if (supercontents & SUPERCONTENTS_WATER)
6044 nativecontents |= CONTENTSQ3_WATER;
6045 if (supercontents & SUPERCONTENTS_SLIME)
6046 nativecontents |= CONTENTSQ3_SLIME;
6047 if (supercontents & SUPERCONTENTS_LAVA)
6048 nativecontents |= CONTENTSQ3_LAVA;
6049 if (supercontents & SUPERCONTENTS_BODY)
6050 nativecontents |= CONTENTSQ3_BODY;
6051 if (supercontents & SUPERCONTENTS_CORPSE)
6052 nativecontents |= CONTENTSQ3_CORPSE;
6053 if (supercontents & SUPERCONTENTS_NODROP)
6054 nativecontents |= CONTENTSQ3_NODROP;
6055 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
6056 nativecontents |= CONTENTSQ3_PLAYERCLIP;
6057 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
6058 nativecontents |= CONTENTSQ3_MONSTERCLIP;
6059 if (supercontents & SUPERCONTENTS_DONOTENTER)
6060 nativecontents |= CONTENTSQ3_DONOTENTER;
6061 if (supercontents & SUPERCONTENTS_BOTCLIP)
6062 nativecontents |= CONTENTSQ3_BOTCLIP;
6063 if (!(supercontents & SUPERCONTENTS_OPAQUE))
6064 nativecontents |= CONTENTSQ3_TRANSLUCENT;
6065 return nativecontents;
6068 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
6073 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
6074 node = node->children[1];
6076 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
6077 if (loadmodel->brush.num_leafs < numleafs)
6078 loadmodel->brush.num_leafs = numleafs;
6081 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6083 int i, j, numshadowmeshtriangles, lumps;
6084 q3dheader_t *header;
6085 float corner[3], yawradius, modelradius;
6086 msurface_t *surface;
6088 mod->modeldatatypestring = "Q3BSP";
6090 mod->type = mod_brushq3;
6091 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
6094 header = (q3dheader_t *)buffer;
6095 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
6096 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
6098 i = LittleLong(header->version);
6099 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
6100 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
6102 mod->soundfromcenter = true;
6103 mod->TraceBox = Mod_Q3BSP_TraceBox;
6104 mod->TraceLine = Mod_Q3BSP_TraceLine;
6105 mod->TracePoint = Mod_Q3BSP_TracePoint;
6106 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
6107 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
6108 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
6109 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
6110 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
6111 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
6112 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
6113 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
6114 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
6115 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
6116 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
6117 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6118 mod->brush.AmbientSoundLevelsForPoint = NULL;
6119 mod->brush.RoundUpToHullSize = NULL;
6120 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
6121 mod->Draw = R_Q1BSP_Draw;
6122 mod->DrawDepth = R_Q1BSP_DrawDepth;
6123 mod->DrawDebug = R_Q1BSP_DrawDebug;
6124 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
6125 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6126 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6127 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6128 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6129 mod->DrawLight = R_Q1BSP_DrawLight;
6131 mod_base = (unsigned char *)header;
6133 // swap all the lumps
6134 header->ident = LittleLong(header->ident);
6135 header->version = LittleLong(header->version);
6136 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
6137 for (i = 0;i < lumps;i++)
6139 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
6140 if((char *) bufferend < (char *) buffer + j)
6141 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
6142 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
6143 if((char *) bufferend < (char *) buffer + j)
6144 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
6147 * NO, do NOT clear them!
6148 * they contain actual data referenced by other stuff.
6149 * Instead, before using the advertisements lump, check header->versio
6151 * Sorry, but otherwise it breaks memory of the first lump.
6152 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
6154 header->lumps[i].fileofs = 0;
6155 header->lumps[i].filelen = 0;
6159 mod->brush.qw_md4sum = 0;
6160 mod->brush.qw_md4sum2 = 0;
6161 for (i = 0;i < lumps;i++)
6163 if (i == Q3LUMP_ENTITIES)
6165 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6166 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
6168 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6170 // all this checksumming can take a while, so let's send keepalives here too
6171 CL_KeepaliveMessage(false);
6174 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
6175 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
6176 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
6177 if (header->version == Q3BSPVERSION_IG)
6178 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
6180 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
6181 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
6182 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
6183 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
6184 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
6185 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
6186 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
6187 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
6188 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
6189 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
6190 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
6191 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
6192 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
6193 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
6194 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
6196 // the MakePortals code works fine on the q3bsp data as well
6197 Mod_Q1BSP_MakePortals();
6199 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
6200 loadmodel->brush.supportwateralpha = true;
6202 // make a single combined shadow mesh to allow optimized shadow volume creation
6203 numshadowmeshtriangles = 0;
6204 if (cls.state != ca_dedicated)
6206 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6208 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
6209 numshadowmeshtriangles += surface->num_triangles;
6211 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
6212 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6213 if (surface->num_triangles > 0)
6214 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
6215 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
6216 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
6219 loadmodel->brush.num_leafs = 0;
6220 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6223 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6228 // duplicate the basic information
6229 dpsnprintf(name, sizeof(name), "*%i", i);
6230 mod = Mod_FindName(name, loadmodel->name);
6231 // copy the base model to this one
6233 // rename the clone back to its proper name
6234 strlcpy(mod->name, name, sizeof(mod->name));
6235 mod->brush.parentmodel = loadmodel;
6236 // textures and memory belong to the main model
6237 mod->texturepool = NULL;
6238 mod->mempool = NULL;
6239 mod->brush.GetPVS = NULL;
6240 mod->brush.FatPVS = NULL;
6241 mod->brush.BoxTouchingPVS = NULL;
6242 mod->brush.BoxTouchingLeafPVS = NULL;
6243 mod->brush.BoxTouchingVisibleLeafs = NULL;
6244 mod->brush.FindBoxClusters = NULL;
6245 mod->brush.LightPoint = NULL;
6246 mod->brush.AmbientSoundLevelsForPoint = NULL;
6248 mod->brush.submodel = i;
6250 // make the model surface list (used by shadowing/lighting)
6251 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6252 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6253 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6254 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6255 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
6256 Mod_MakeSortedSurfaces(mod);
6258 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6259 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6260 // enlarge the bounding box to enclose all geometry of this model,
6261 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6262 // which can in turn mess up the farclip (as well as culling when
6263 // outside the level - an unimportant concern)
6265 //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]);
6266 for (j = 0;j < mod->nummodelsurfaces;j++)
6268 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6269 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6271 if (!surface->num_vertices)
6273 for (k = 0;k < surface->num_vertices;k++, v += 3)
6275 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6276 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6277 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6278 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6279 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6280 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6283 //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]);
6284 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6285 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6286 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6287 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6288 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6289 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6290 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6291 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6292 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6293 mod->yawmins[2] = mod->normalmins[2];
6294 mod->yawmaxs[2] = mod->normalmaxs[2];
6295 mod->radius = modelradius;
6296 mod->radius2 = modelradius * modelradius;
6298 // this gets altered below if sky or water is used
6299 mod->DrawSky = NULL;
6300 mod->DrawAddWaterPlanes = NULL;
6302 for (j = 0;j < mod->nummodelsurfaces;j++)
6303 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6305 if (j < mod->nummodelsurfaces)
6306 mod->DrawSky = R_Q1BSP_DrawSky;
6308 for (j = 0;j < mod->nummodelsurfaces;j++)
6309 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6311 if (j < mod->nummodelsurfaces)
6312 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6316 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6318 int i = LittleLong(((int *)buffer)[1]);
6319 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6320 Mod_Q3BSP_Load(mod,buffer, bufferend);
6321 else if (i == Q2BSPVERSION)
6322 Mod_Q2BSP_Load(mod,buffer, bufferend);
6324 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6327 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6329 Host_Error("Mod_MAP_Load: not yet implemented");
6332 typedef struct objvertex_s
6340 typedef struct objtriangle_s
6342 objvertex_t vertex[3];
6347 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
6350 const char *textbase = (char *)buffer, *text = textbase;
6354 char materialname[MAX_QPATH];
6355 int j, index1, index2, index3, first, prev, index;
6358 int numtriangles = 0;
6359 int maxtriangles = 131072;
6360 objtriangle_t *triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
6362 int maxtextures = 256, numtextures = 0, textureindex = 0;
6363 int maxv = 1024, numv = 0;
6364 int maxvt = 1024, numvt = 0;
6365 int maxvn = 1024, numvn = 0;
6366 char **texturenames;
6367 float *v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
6368 float *vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
6369 float *vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
6370 objvertex_t vfirst, vprev, vcurrent;
6373 int maxverthash = 65536, numverthash = 0;
6374 int numhashindex = 65536;
6375 struct objverthash_s
6377 struct objverthash_s *next;
6383 *hash, **verthash = Mem_Alloc(tempmempool, numhashindex * sizeof(*verthash)), *verthashdata = Mem_Alloc(tempmempool, maxverthash * sizeof(*verthashdata)), *oldverthashdata;
6386 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
6388 loadmodel->modeldatatypestring = "OBJ";
6390 loadmodel->type = mod_obj;
6391 loadmodel->soundfromcenter = true;
6392 loadmodel->TraceBox = Mod_OBJ_TraceBox;
6393 loadmodel->TraceLine = Mod_OBJ_TraceLine;
6394 loadmodel->TracePoint = Mod_OBJ_TracePoint;
6395 loadmodel->PointSuperContents = Mod_OBJ_PointSuperContents;
6396 loadmodel->brush.TraceLineOfSight = Mod_OBJ_TraceLineOfSight;
6397 loadmodel->brush.SuperContentsFromNativeContents = Mod_OBJ_SuperContentsFromNativeContents;
6398 loadmodel->brush.NativeContentsFromSuperContents = Mod_OBJ_NativeContentsFromSuperContents;
6399 loadmodel->brush.GetPVS = Mod_OBJ_GetPVS;
6400 loadmodel->brush.FatPVS = Mod_OBJ_FatPVS;
6401 loadmodel->brush.BoxTouchingPVS = Mod_OBJ_BoxTouchingPVS;
6402 loadmodel->brush.BoxTouchingLeafPVS = Mod_OBJ_BoxTouchingLeafPVS;
6403 loadmodel->brush.BoxTouchingVisibleLeafs = Mod_OBJ_BoxTouchingVisibleLeafs;
6404 loadmodel->brush.FindBoxClusters = Mod_OBJ_FindBoxClusters;
6405 loadmodel->brush.LightPoint = Mod_OBJ_LightPoint;
6406 loadmodel->brush.FindNonSolidLocation = Mod_OBJ_FindNonSolidLocation;
6407 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
6408 loadmodel->brush.RoundUpToHullSize = NULL;
6409 loadmodel->brush.PointInLeaf = Mod_OBJ_PointInLeaf;
6410 loadmodel->Draw = R_Q1BSP_Draw;
6411 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
6412 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
6413 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
6414 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6415 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6416 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6417 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6418 loadmodel->DrawLight = R_Q1BSP_DrawLight;
6420 // parse the OBJ text now
6427 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
6428 line[linelen] = text[linelen];
6430 for (argc = 0;argc < (int)(sizeof(argv)/sizeof(argv[0]));argc++)
6434 while (*s == ' ' || *s == '\t')
6444 while (*s == ' ' || *s == '\t')
6449 if (argv[0][0] == '#')
6451 if (!strcmp(argv[0], "v"))
6457 v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
6460 memcpy(v, oldv, numv * sizeof(float[3]));
6464 v[numv*3+0] = atof(argv[1]);
6465 v[numv*3+1] = atof(argv[2]);
6466 v[numv*3+2] = atof(argv[3]);
6469 else if (!strcmp(argv[0], "vt"))
6475 vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
6478 memcpy(vt, oldvt, numvt * sizeof(float[2]));
6482 vt[numvt*2+0] = atof(argv[1]);
6483 vt[numvt*2+1] = atof(argv[2]);
6486 else if (!strcmp(argv[0], "vn"))
6492 vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
6495 memcpy(vn, oldvn, numvn * sizeof(float[3]));
6499 vn[numvn*3+0] = atof(argv[1]);
6500 vn[numvn*3+1] = atof(argv[2]);
6501 vn[numvn*3+2] = atof(argv[3]);
6504 else if (!strcmp(argv[0], "f"))
6506 for (j = 1;j < argc;j++)
6508 index1 = atoi(argv[j]);
6509 while(argv[j][0] && argv[j][0] != '/')
6513 index2 = atoi(argv[j]);
6514 while(argv[j][0] && argv[j][0] != '/')
6518 index3 = atoi(argv[j]);
6519 // negative refers to a recent vertex
6520 // zero means not specified
6521 // positive means an absolute vertex index
6523 index1 = numv - index1;
6525 index2 = numvt - index2;
6527 index3 = numvn - index3;
6528 VectorCopy(v + 3*index1, vcurrent.v);
6529 Vector2Copy(vt + 2*index2, vcurrent.vt);
6530 VectorCopy(vn + 3*index3, vcurrent.vn);
6535 if (maxtriangles <= numtriangles)
6537 objtriangle_t *oldtriangles = triangles;
6539 triangles = Mem_Alloc(tempmempool, numtriangles * sizeof(*triangles));
6542 memcpy(triangles, oldtriangles, numtriangles * sizeof(*triangles));
6543 Mem_Free(oldtriangles);
6546 triangles[numtriangles].textureindex = textureindex;
6547 triangles[numtriangles].vertex[0] = vfirst;
6548 triangles[numtriangles].vertex[1] = vprev;
6549 triangles[numtriangles].vertex[2] = vcurrent;
6556 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
6558 else if (!!strcmp(argv[0], "usemtl"))
6560 for (i = 0;i < numtextures;i++)
6561 if (!strcmp(texturenames[numtextures], argv[1]))
6563 if (i < numtextures)
6564 texture = textures + i;
6567 if (maxtextures <= numtextures)
6569 texture_t *oldtextures = textures;
6571 textures = Mem_Alloc(tempmempool, maxtextures * sizeof(*textures));
6574 memcpy(textures, oldtextures, numtexutres * sizeof(*textures));
6575 Mem_Free(oldtextures);
6578 textureindex = numtextures++;
6579 texturenames[textureindex] = Mem_Alloc(tempmempool, strlen(argv[1]) + 1);
6580 memcpy(texturenames[textureindex], argv[1], strlen(argv[1]) + 1);
6590 // now that we have the OBJ data loaded as-is, we can convert it
6592 // load the textures
6593 loadmodel->num_textures = numtextures;
6594 loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
6595 for (i = 0;i < numtextures;i++)
6596 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, texturenames[i], true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
6598 // free the texturenames array since we are now done with it
6599 for (i = 0;i < numtextures;i++)
6601 Mem_Free(texturenames[i]);
6602 texturenames[i] = NULL;
6604 Mem_Free(texturenames);
6605 texturenames = NULL;
6607 // 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
6609 // generate surfaces by recursing triangles into BSP tree and ensuring they do not overlap in the lightmap projection axis
6611 loadmodel->numskins = LittleLong(pinmodel->num_skins);
6612 numxyz = LittleLong(pinmodel->num_xyz);
6613 numst = LittleLong(pinmodel->num_st);
6614 loadmodel->surfmesh.num_triangles = LittleLong(pinmodel->num_tris);
6615 loadmodel->numframes = LittleLong(pinmodel->num_frames);
6616 loadmodel->surfmesh.num_morphframes = loadmodel->numframes;
6617 loadmodel->num_poses = loadmodel->surfmesh.num_morphframes;
6618 skinwidth = LittleLong(pinmodel->skinwidth);
6619 skinheight = LittleLong(pinmodel->skinheight);
6620 iskinwidth = 1.0f / skinwidth;
6621 iskinheight = 1.0f / skinheight;
6623 loadmodel->num_surfaces = 1;
6624 loadmodel->nummodelsurfaces = loadmodel->num_surfaces;
6625 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]));
6626 loadmodel->data_surfaces = (msurface_t *)data;data += loadmodel->num_surfaces * sizeof(msurface_t);
6627 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
6628 loadmodel->sortedmodelsurfaces[0] = 0;
6629 loadmodel->animscenes = (animscene_t *)data;data += loadmodel->numframes * sizeof(animscene_t);
6630 loadmodel->surfmesh.data_morphmd2framesize6f = (float *)data;data += loadmodel->numframes * sizeof(float[6]);
6631 loadmodel->surfmesh.data_element3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
6632 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
6634 loadmodel->synctype = ST_RAND;
6637 inskin = (char *)(base + LittleLong(pinmodel->ofs_skins));
6638 skinfiles = Mod_LoadSkinFiles();
6641 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
6642 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
6643 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
6644 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures, skinfiles, "default", "");
6645 Mod_FreeSkinFiles(skinfiles);
6647 else if (loadmodel->numskins)
6649 // skins found (most likely not a player model)
6650 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
6651 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
6652 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
6653 for (i = 0;i < loadmodel->numskins;i++, inskin += MD2_SKINNAME)
6654 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i * loadmodel->num_surfaces, inskin, true, true, (r_mipskins.integer ? TEXF_MIPMAP : 0) | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP | TEXF_COMPRESS);
6658 // no skins (most likely a player model)
6659 loadmodel->numskins = 1;
6660 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
6661 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
6662 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
6663 Mod_BuildAliasSkinFromSkinFrame(loadmodel->data_textures, NULL);
6666 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
6667 for (i = 0;i < loadmodel->numskins;i++)
6669 loadmodel->skinscenes[i].firstframe = i;
6670 loadmodel->skinscenes[i].framecount = 1;
6671 loadmodel->skinscenes[i].loop = true;
6672 loadmodel->skinscenes[i].framerate = 10;
6675 // load the triangles and stvert data
6676 inst = (unsigned short *)(base + LittleLong(pinmodel->ofs_st));
6677 intri = (md2triangle_t *)(base + LittleLong(pinmodel->ofs_tris));
6678 md2verthash = (struct md2verthash_s **)Mem_Alloc(tempmempool, 65536 * sizeof(hash));
6679 md2verthashdata = (struct md2verthash_s *)Mem_Alloc(tempmempool, loadmodel->surfmesh.num_triangles * 3 * sizeof(*hash));
6680 // swap the triangle list
6681 loadmodel->surfmesh.num_vertices = 0;
6682 for (i = 0;i < loadmodel->surfmesh.num_triangles;i++)
6684 for (j = 0;j < 3;j++)
6686 xyz = (unsigned short) LittleShort (intri[i].index_xyz[j]);
6687 st = (unsigned short) LittleShort (intri[i].index_st[j]);
6690 Con_Printf("%s has an invalid xyz index (%i) on triangle %i, resetting to 0\n", loadmodel->name, xyz, i);
6695 Con_Printf("%s has an invalid st index (%i) on triangle %i, resetting to 0\n", loadmodel->name, st, i);
6698 hashindex = (xyz * 256 + st) & 65535;
6699 for (hash = md2verthash[hashindex];hash;hash = hash->next)
6700 if (hash->xyz == xyz && hash->st == st)
6704 hash = md2verthashdata + loadmodel->surfmesh.num_vertices++;
6707 hash->next = md2verthash[hashindex];
6708 md2verthash[hashindex] = hash;
6710 loadmodel->surfmesh.data_element3i[i*3+j] = (hash - md2verthashdata);
6714 vertremap = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(int));
6715 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));
6716 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += loadmodel->surfmesh.num_vertices * sizeof(float[2]);
6717 loadmodel->surfmesh.data_morphmdlvertex = (trivertx_t *)data;data += loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t);
6718 for (i = 0;i < loadmodel->surfmesh.num_vertices;i++)
6721 hash = md2verthashdata + i;
6722 vertremap[i] = hash->xyz;
6723 sts = LittleShort(inst[hash->st*2+0]);
6724 stt = LittleShort(inst[hash->st*2+1]);
6725 if (sts < 0 || sts >= skinwidth || stt < 0 || stt >= skinheight)
6727 Con_Printf("%s has an invalid skin coordinate (%i %i) on vert %i, changing to 0 0\n", loadmodel->name, sts, stt, i);
6731 loadmodel->surfmesh.data_texcoordtexture2f[i*2+0] = sts * iskinwidth;
6732 loadmodel->surfmesh.data_texcoordtexture2f[i*2+1] = stt * iskinheight;
6735 Mem_Free(md2verthash);
6736 Mem_Free(md2verthashdata);
6738 // generate ushort elements array if possible
6739 if (loadmodel->surfmesh.num_vertices <= 65536)
6740 loadmodel->surfmesh.data_element3s = (unsigned short *)Mem_Alloc(loadmodel->mempool, sizeof(unsigned short[3]) * loadmodel->surfmesh.num_triangles);
6743 datapointer = (base + LittleLong(pinmodel->ofs_frames));
6744 for (i = 0;i < loadmodel->surfmesh.num_morphframes;i++)
6749 pinframe = (md2frame_t *)datapointer;
6750 datapointer += sizeof(md2frame_t);
6751 // store the frame scale/translate into the appropriate array
6752 for (j = 0;j < 3;j++)
6754 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+j] = LittleFloat(pinframe->scale[j]);
6755 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+3+j] = LittleFloat(pinframe->translate[j]);
6757 // convert the vertices
6758 v = (trivertx_t *)datapointer;
6759 out = loadmodel->surfmesh.data_morphmdlvertex + i * loadmodel->surfmesh.num_vertices;
6760 for (k = 0;k < loadmodel->surfmesh.num_vertices;k++)
6761 out[k] = v[vertremap[k]];
6762 datapointer += numxyz * sizeof(trivertx_t);
6764 strlcpy(loadmodel->animscenes[i].name, pinframe->name, sizeof(loadmodel->animscenes[i].name));
6765 loadmodel->animscenes[i].firstframe = i;
6766 loadmodel->animscenes[i].framecount = 1;
6767 loadmodel->animscenes[i].framerate = 10;
6768 loadmodel->animscenes[i].loop = true;
6771 Mem_Free(vertremap);
6773 Mod_MakeSortedSurfaces(loadmodel);
6774 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
6775 Mod_Alias_CalculateBoundingBox();
6776 Mod_Alias_MorphMesh_CompileFrames();
6778 surface = loadmodel->data_surfaces;
6779 surface->texture = loadmodel->data_textures;
6780 surface->num_firsttriangle = 0;
6781 surface->num_triangles = loadmodel->surfmesh.num_triangles;
6782 surface->num_firstvertex = 0;
6783 surface->num_vertices = loadmodel->surfmesh.num_vertices;
6785 loadmodel->surfmesh.isanimated = false;
6787 if (loadmodel->surfmesh.data_element3s)
6788 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
6789 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
6793 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
6795 // we already have done PVS culling at this point...
6796 // so we don't need to do it again.
6799 vec3_t testorigin, mins, maxs;
6801 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
6802 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
6803 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
6805 if(model->brush.TraceLineOfSight(model, eye, testorigin))
6808 // expand the box a little
6809 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
6810 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
6811 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
6812 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
6813 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
6814 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
6816 for(i = 0; i != numsamples; ++i)
6818 testorigin[0] = lhrandom(mins[0], maxs[0]);
6819 testorigin[1] = lhrandom(mins[1], maxs[1]);
6820 testorigin[2] = lhrandom(mins[2], maxs[2]);
6822 if(model->brush.TraceLineOfSight(model, eye, testorigin))