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];
1025 cbox.supercontents = boxsupercontents;
1028 cbox.numtriangles = 0;
1029 cbox.planes = cbox_planes;
1031 cbox.elements = NULL;
1039 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];
1040 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];
1041 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];
1042 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];
1043 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];
1044 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];
1045 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1046 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1047 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1048 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1049 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1050 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1051 memset(trace, 0, sizeof(trace_t));
1052 trace->hitsupercontentsmask = hitsupercontentsmask;
1053 trace->fraction = 1;
1054 trace->realfraction = 1;
1055 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1057 RecursiveHullCheckTraceInfo_t rhc;
1058 static hull_t box_hull;
1059 static mclipnode_t box_clipnodes[6];
1060 static mplane_t box_planes[6];
1061 // fill in a default trace
1062 memset(&rhc, 0, sizeof(rhc));
1063 memset(trace, 0, sizeof(trace_t));
1064 //To keep everything totally uniform, bounding boxes are turned into small
1065 //BSP trees instead of being compared directly.
1066 // create a temp hull from bounding box sizes
1067 box_planes[0].dist = cmaxs[0] - mins[0];
1068 box_planes[1].dist = cmins[0] - maxs[0];
1069 box_planes[2].dist = cmaxs[1] - mins[1];
1070 box_planes[3].dist = cmins[1] - maxs[1];
1071 box_planes[4].dist = cmaxs[2] - mins[2];
1072 box_planes[5].dist = cmins[2] - maxs[2];
1073 #if COLLISIONPARANOID >= 3
1074 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]);
1077 if (box_hull.clipnodes == NULL)
1081 //Set up the planes and clipnodes so that the six floats of a bounding box
1082 //can just be stored out and get a proper hull_t structure.
1084 box_hull.clipnodes = box_clipnodes;
1085 box_hull.planes = box_planes;
1086 box_hull.firstclipnode = 0;
1087 box_hull.lastclipnode = 5;
1089 for (i = 0;i < 6;i++)
1091 box_clipnodes[i].planenum = i;
1095 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1097 box_clipnodes[i].children[side^1] = i + 1;
1099 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1101 box_planes[i].type = i>>1;
1102 box_planes[i].normal[i>>1] = 1;
1106 // trace a line through the generated clipping hull
1107 //rhc.boxsupercontents = boxsupercontents;
1108 rhc.hull = &box_hull;
1110 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1111 rhc.trace->fraction = 1;
1112 rhc.trace->realfraction = 1;
1113 rhc.trace->allsolid = true;
1114 VectorCopy(start, rhc.start);
1115 VectorCopy(end, rhc.end);
1116 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1117 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1118 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1119 if (rhc.trace->startsupercontents)
1120 rhc.trace->startsupercontents = boxsupercontents;
1124 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)
1126 memset(trace, 0, sizeof(trace_t));
1127 trace->fraction = 1;
1128 trace->realfraction = 1;
1129 if (BoxesOverlap(start, start, cmins, cmaxs))
1131 trace->startsupercontents |= boxsupercontents;
1132 if (hitsupercontentsmask & boxsupercontents)
1134 trace->startsolid = true;
1135 trace->allsolid = true;
1140 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1143 model->TraceLine(model, 0, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1144 return trace.fraction == 1;
1147 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)
1151 float mid, distz = endz - startz;
1155 return false; // didn't hit anything
1157 switch (node->plane->type)
1160 node = node->children[x < node->plane->dist];
1163 node = node->children[y < node->plane->dist];
1166 side = startz < node->plane->dist;
1167 if ((endz < node->plane->dist) == side)
1169 node = node->children[side];
1172 // found an intersection
1173 mid = node->plane->dist;
1176 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1177 front += startz * node->plane->normal[2];
1178 back += endz * node->plane->normal[2];
1179 side = front < node->plane->dist;
1180 if ((back < node->plane->dist) == side)
1182 node = node->children[side];
1185 // found an intersection
1186 mid = startz + distz * (front - node->plane->dist) / (front - back);
1190 // go down front side
1191 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1192 return true; // hit something
1195 // check for impact on this node
1196 if (node->numsurfaces)
1198 int i, dsi, dti, lmwidth, lmheight;
1200 msurface_t *surface;
1201 unsigned char *lightmap;
1202 int maps, line3, size3;
1205 float scale, w, w00, w01, w10, w11;
1207 surface = model->data_surfaces + node->firstsurface;
1208 for (i = 0;i < node->numsurfaces;i++, surface++)
1210 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1211 continue; // no lightmaps
1213 // location we want to sample in the lightmap
1214 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;
1215 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;
1220 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1221 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1224 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1226 // calculate bilinear interpolation factors
1227 // and also multiply by fixedpoint conversion factors
1230 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1231 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1232 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1233 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1235 // values for pointer math
1236 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1237 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1239 // look up the pixel
1240 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1242 // bilinear filter each lightmap style, and sum them
1243 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1245 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1246 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1247 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1248 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1249 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1253 return true; // success
1258 // go down back side
1259 node = node->children[side ^ 1];
1261 distz = endz - startz;
1266 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1268 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1269 VectorSet(diffusenormal, 0, 0, 1);
1271 if (!model->brushq1.lightdata)
1273 VectorSet(ambientcolor, 1, 1, 1);
1274 VectorSet(diffusecolor, 0, 0, 0);
1278 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);
1281 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1284 unsigned char *outstart = out;
1285 while (out < outend)
1289 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));
1299 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));
1302 for (c = *in++;c > 0;c--)
1306 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));
1317 R_Q1BSP_LoadSplitSky
1319 A sky texture is 256*128, with the right side being a masked overlay
1322 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1325 unsigned solidpixels[128*128], alphapixels[128*128];
1327 // allocate a texture pool if we need it
1328 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1329 loadmodel->texturepool = R_AllocTexturePool();
1331 if (bytesperpixel == 4)
1333 for (i = 0;i < 128;i++)
1335 for (j = 0;j < 128;j++)
1337 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1338 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1344 // make an average value for the back to avoid
1345 // a fringe on the top level
1354 for (i = 0;i < 128;i++)
1356 for (j = 0;j < 128;j++)
1358 p = src[i*256 + j + 128];
1359 r += palette_rgb[p][0];
1360 g += palette_rgb[p][1];
1361 b += palette_rgb[p][2];
1364 bgra.b[2] = r/(128*128);
1365 bgra.b[1] = g/(128*128);
1366 bgra.b[0] = b/(128*128);
1368 for (i = 0;i < 128;i++)
1370 for (j = 0;j < 128;j++)
1372 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1374 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1379 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1380 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1383 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1385 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1386 skinframe_t *skinframe;
1388 texture_t *tx, *tx2, *anims[10], *altanims[10];
1390 unsigned char *data, *mtdata;
1392 char mapname[MAX_QPATH], name[MAX_QPATH];
1393 unsigned char zero[4];
1395 memset(zero, 0, sizeof(zero));
1397 loadmodel->data_textures = NULL;
1399 // add two slots for notexture walls and notexture liquids
1402 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1403 m->nummiptex = LittleLong (m->nummiptex);
1404 loadmodel->num_textures = m->nummiptex + 2;
1405 loadmodel->num_texturesperskin = loadmodel->num_textures;
1410 loadmodel->num_textures = 2;
1411 loadmodel->num_texturesperskin = loadmodel->num_textures;
1414 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1416 // fill out all slots with notexture
1417 if (cls.state != ca_dedicated)
1418 skinframe = R_SkinFrame_LoadMissing();
1421 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1423 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1426 if (cls.state != ca_dedicated)
1428 tx->numskinframes = 1;
1429 tx->skinframerate = 1;
1430 tx->skinframes[0] = skinframe;
1431 tx->currentskinframe = tx->skinframes[0];
1433 tx->basematerialflags = MATERIALFLAG_WALL;
1434 if (i == loadmodel->num_textures - 1)
1436 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1437 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1438 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1442 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1443 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1445 tx->currentframe = tx;
1447 // clear water settings
1450 tx->refractfactor = 1;
1451 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1452 tx->reflectfactor = 1;
1453 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1454 tx->r_water_wateralpha = 1;
1459 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1463 s = loadmodel->name;
1464 if (!strncasecmp(s, "maps/", 5))
1466 FS_StripExtension(s, mapname, sizeof(mapname));
1468 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1470 // LordHavoc: mostly rewritten map texture loader
1471 for (i = 0;i < m->nummiptex;i++)
1473 dofs[i] = LittleLong(dofs[i]);
1474 if (r_nosurftextures.integer)
1478 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1481 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1483 // copy name, but only up to 16 characters
1484 // (the output buffer can hold more than this, but the input buffer is
1486 for (j = 0;j < 16 && dmiptex->name[j];j++)
1487 name[j] = dmiptex->name[j];
1492 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1493 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1496 mtwidth = LittleLong(dmiptex->width);
1497 mtheight = LittleLong(dmiptex->height);
1499 j = LittleLong(dmiptex->offsets[0]);
1503 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1505 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1508 mtdata = (unsigned char *)dmiptex + j;
1511 if ((mtwidth & 15) || (mtheight & 15))
1512 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1514 // LordHavoc: force all names to lowercase
1515 for (j = 0;name[j];j++)
1516 if (name[j] >= 'A' && name[j] <= 'Z')
1517 name[j] += 'a' - 'A';
1519 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1522 tx = loadmodel->data_textures + i;
1523 strlcpy(tx->name, name, sizeof(tx->name));
1524 tx->width = mtwidth;
1525 tx->height = mtheight;
1527 if (tx->name[0] == '*')
1529 if (!strncmp(tx->name, "*lava", 5))
1531 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1532 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1534 else if (!strncmp(tx->name, "*slime", 6))
1536 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1537 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1541 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1542 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1545 else if (!strncmp(tx->name, "sky", 3))
1547 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1548 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1552 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1553 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1556 if (cls.state != ca_dedicated)
1558 // LordHavoc: HL sky textures are entirely different than quake
1559 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1561 data = loadimagepixelsbgra(tx->name, false, false);
1562 if (data && image_width == 256 && image_height == 128)
1564 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1567 else if (mtdata != NULL)
1568 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1572 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);
1574 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);
1577 // did not find external texture, load it from the bsp or wad3
1578 if (loadmodel->brush.ishlbsp)
1580 // internal texture overrides wad
1581 unsigned char *pixels, *freepixels;
1582 pixels = freepixels = NULL;
1584 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1586 pixels = freepixels = W_GetTextureBGRA(tx->name);
1589 tx->width = image_width;
1590 tx->height = image_height;
1591 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1594 Mem_Free(freepixels);
1596 else if (mtdata) // texture included
1597 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);
1599 // if skinframe is still NULL the "missing" texture will be used
1601 tx->skinframes[0] = skinframe;
1604 tx->basematerialflags = MATERIALFLAG_WALL;
1605 if (tx->name[0] == '*')
1607 // LordHavoc: some turbulent textures should not be affected by wateralpha
1608 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1610 // replace the texture with transparent black
1611 Vector4Set(zero, 128, 128, 128, 128);
1612 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1613 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1615 else if (!strncmp(tx->name,"*lava",5)
1616 || !strncmp(tx->name,"*teleport",9)
1617 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1618 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1620 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1621 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1622 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1624 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1626 // replace the texture with black
1627 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1628 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1630 else if (!strncmp(tx->name, "sky", 3))
1631 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1632 else if (!strcmp(tx->name, "caulk"))
1633 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1634 else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1635 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1637 // start out with no animation
1638 tx->currentframe = tx;
1639 tx->currentskinframe = tx->skinframes[0];
1643 // sequence the animations
1644 for (i = 0;i < m->nummiptex;i++)
1646 tx = loadmodel->data_textures + i;
1647 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1649 if (tx->anim_total[0] || tx->anim_total[1])
1650 continue; // already sequenced
1652 // find the number of frames in the animation
1653 memset(anims, 0, sizeof(anims));
1654 memset(altanims, 0, sizeof(altanims));
1656 for (j = i;j < m->nummiptex;j++)
1658 tx2 = loadmodel->data_textures + j;
1659 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1663 if (num >= '0' && num <= '9')
1664 anims[num - '0'] = tx2;
1665 else if (num >= 'a' && num <= 'j')
1666 altanims[num - 'a'] = tx2;
1668 Con_Printf("Bad animating texture %s\n", tx->name);
1672 for (j = 0;j < 10;j++)
1679 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1682 for (j = 0;j < max;j++)
1686 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1690 for (j = 0;j < altmax;j++)
1694 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1703 // if there is no alternate animation, duplicate the primary
1704 // animation into the alternate
1706 for (k = 0;k < 10;k++)
1707 altanims[k] = anims[k];
1710 // link together the primary animation
1711 for (j = 0;j < max;j++)
1714 tx2->animated = true;
1715 tx2->anim_total[0] = max;
1716 tx2->anim_total[1] = altmax;
1717 for (k = 0;k < 10;k++)
1719 tx2->anim_frames[0][k] = anims[k];
1720 tx2->anim_frames[1][k] = altanims[k];
1724 // if there really is an alternate anim...
1725 if (anims[0] != altanims[0])
1727 // link together the alternate animation
1728 for (j = 0;j < altmax;j++)
1731 tx2->animated = true;
1732 // the primary/alternate are reversed here
1733 tx2->anim_total[0] = altmax;
1734 tx2->anim_total[1] = max;
1735 for (k = 0;k < 10;k++)
1737 tx2->anim_frames[0][k] = altanims[k];
1738 tx2->anim_frames[1][k] = anims[k];
1745 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1748 unsigned char *in, *out, *data, d;
1749 char litfilename[MAX_QPATH];
1750 char dlitfilename[MAX_QPATH];
1751 fs_offset_t filesize;
1752 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1754 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1755 for (i=0; i<l->filelen; i++)
1756 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1758 else // LordHavoc: bsp version 29 (normal white lighting)
1760 // LordHavoc: hope is not lost yet, check for a .lit file to load
1761 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1762 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1763 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1764 strlcat (litfilename, ".lit", sizeof (litfilename));
1765 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1766 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1769 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1771 i = LittleLong(((int *)data)[1]);
1774 if (developer_loading.integer)
1775 Con_Printf("loaded %s\n", litfilename);
1776 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1777 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1779 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1782 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1784 i = LittleLong(((int *)data)[1]);
1787 if (developer_loading.integer)
1788 Con_Printf("loaded %s\n", dlitfilename);
1789 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1790 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1791 loadmodel->brushq3.deluxemapping_modelspace = false;
1792 loadmodel->brushq3.deluxemapping = true;
1801 Con_Printf("Unknown .lit file version (%d)\n", i);
1803 else if (filesize == 8)
1804 Con_Print("Empty .lit file, ignoring\n");
1806 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1813 // LordHavoc: oh well, expand the white lighting data
1816 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1817 in = mod_base + l->fileofs;
1818 out = loadmodel->brushq1.lightdata;
1819 for (i = 0;i < l->filelen;i++)
1829 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1831 loadmodel->brushq1.num_compressedpvs = 0;
1832 loadmodel->brushq1.data_compressedpvs = NULL;
1835 loadmodel->brushq1.num_compressedpvs = l->filelen;
1836 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1837 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1840 // used only for HalfLife maps
1841 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1843 char key[128], value[4096];
1847 if (!COM_ParseToken_Simple(&data, false, false))
1849 if (com_token[0] != '{')
1853 if (!COM_ParseToken_Simple(&data, false, false))
1855 if (com_token[0] == '}')
1856 break; // end of worldspawn
1857 if (com_token[0] == '_')
1858 strlcpy(key, com_token + 1, sizeof(key));
1860 strlcpy(key, com_token, sizeof(key));
1861 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1862 key[strlen(key)-1] = 0;
1863 if (!COM_ParseToken_Simple(&data, false, false))
1865 dpsnprintf(value, sizeof(value), "%s", com_token);
1866 if (!strcmp("wad", key)) // for HalfLife maps
1868 if (loadmodel->brush.ishlbsp)
1871 for (i = 0;i < (int)sizeof(value);i++)
1872 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1876 for (;i < (int)sizeof(value);i++)
1878 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1879 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1881 else if (value[i] == ';' || value[i] == 0)
1885 W_LoadTextureWadFile(&value[j], false);
1897 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1899 loadmodel->brush.entities = NULL;
1902 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1903 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1904 loadmodel->brush.entities[l->filelen] = 0;
1905 if (loadmodel->brush.ishlbsp)
1906 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1910 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1916 in = (dvertex_t *)(mod_base + l->fileofs);
1917 if (l->filelen % sizeof(*in))
1918 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1919 count = l->filelen / sizeof(*in);
1920 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1922 loadmodel->brushq1.vertexes = out;
1923 loadmodel->brushq1.numvertexes = count;
1925 for ( i=0 ; i<count ; i++, in++, out++)
1927 out->position[0] = LittleFloat(in->point[0]);
1928 out->position[1] = LittleFloat(in->point[1]);
1929 out->position[2] = LittleFloat(in->point[2]);
1933 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1934 // can be used for this
1936 int SB_ReadInt (unsigned char **buffer)
1939 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1945 float SB_ReadFloat (unsigned char **buffer)
1953 u.i = SB_ReadInt (buffer);
1957 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1959 unsigned char *index;
1963 index = (unsigned char *)(mod_base + l->fileofs);
1964 if (l->filelen % (48+4*hullinfo->filehulls))
1965 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1967 count = l->filelen / (48+4*hullinfo->filehulls);
1968 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1970 loadmodel->brushq1.submodels = out;
1971 loadmodel->brush.numsubmodels = count;
1973 for (i = 0; i < count; i++, out++)
1975 // spread out the mins / maxs by a pixel
1976 out->mins[0] = SB_ReadFloat (&index) - 1;
1977 out->mins[1] = SB_ReadFloat (&index) - 1;
1978 out->mins[2] = SB_ReadFloat (&index) - 1;
1979 out->maxs[0] = SB_ReadFloat (&index) + 1;
1980 out->maxs[1] = SB_ReadFloat (&index) + 1;
1981 out->maxs[2] = SB_ReadFloat (&index) + 1;
1982 out->origin[0] = SB_ReadFloat (&index);
1983 out->origin[1] = SB_ReadFloat (&index);
1984 out->origin[2] = SB_ReadFloat (&index);
1985 for (j = 0; j < hullinfo->filehulls; j++)
1986 out->headnode[j] = SB_ReadInt (&index);
1987 out->visleafs = SB_ReadInt (&index);
1988 out->firstface = SB_ReadInt (&index);
1989 out->numfaces = SB_ReadInt (&index);
1993 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1999 in = (dedge_t *)(mod_base + l->fileofs);
2000 if (l->filelen % sizeof(*in))
2001 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2002 count = l->filelen / sizeof(*in);
2003 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2005 loadmodel->brushq1.edges = out;
2006 loadmodel->brushq1.numedges = count;
2008 for ( i=0 ; i<count ; i++, in++, out++)
2010 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2011 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2012 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2014 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);
2015 if(!loadmodel->brushq1.numvertexes)
2016 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2024 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2028 int i, j, k, count, miptex;
2030 in = (texinfo_t *)(mod_base + l->fileofs);
2031 if (l->filelen % sizeof(*in))
2032 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2033 count = l->filelen / sizeof(*in);
2034 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2036 loadmodel->brushq1.texinfo = out;
2037 loadmodel->brushq1.numtexinfo = count;
2039 for (i = 0;i < count;i++, in++, out++)
2041 for (k = 0;k < 2;k++)
2042 for (j = 0;j < 4;j++)
2043 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2045 miptex = LittleLong(in->miptex);
2046 out->flags = LittleLong(in->flags);
2048 out->texture = NULL;
2049 if (loadmodel->data_textures)
2051 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2052 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2054 out->texture = loadmodel->data_textures + miptex;
2056 if (out->flags & TEX_SPECIAL)
2058 // if texture chosen is NULL or the shader needs a lightmap,
2059 // force to notexture water shader
2060 if (out->texture == NULL)
2061 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2065 // if texture chosen is NULL, force to notexture
2066 if (out->texture == NULL)
2067 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2073 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2078 mins[0] = mins[1] = mins[2] = 9999;
2079 maxs[0] = maxs[1] = maxs[2] = -9999;
2081 for (i = 0;i < numverts;i++)
2083 for (j = 0;j < 3;j++, v++)
2093 #define MAX_SUBDIVPOLYTRIANGLES 4096
2094 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2096 static int subdivpolyverts, subdivpolytriangles;
2097 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2098 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2100 static int subdivpolylookupvert(vec3_t v)
2103 for (i = 0;i < subdivpolyverts;i++)
2104 if (subdivpolyvert[i][0] == v[0]
2105 && subdivpolyvert[i][1] == v[1]
2106 && subdivpolyvert[i][2] == v[2])
2108 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2109 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2110 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2111 return subdivpolyverts++;
2114 static void SubdividePolygon(int numverts, float *verts)
2116 int i, i1, i2, i3, f, b, c, p;
2117 vec3_t mins, maxs, front[256], back[256];
2118 float m, *pv, *cv, dist[256], frac;
2121 Host_Error("SubdividePolygon: ran out of verts in buffer");
2123 BoundPoly(numverts, verts, mins, maxs);
2125 for (i = 0;i < 3;i++)
2127 m = (mins[i] + maxs[i]) * 0.5;
2128 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2129 if (maxs[i] - m < 8)
2131 if (m - mins[i] < 8)
2135 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2136 dist[c] = cv[i] - m;
2139 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2143 VectorCopy(pv, front[f]);
2148 VectorCopy(pv, back[b]);
2151 if (dist[p] == 0 || dist[c] == 0)
2153 if ((dist[p] > 0) != (dist[c] > 0) )
2156 frac = dist[p] / (dist[p] - dist[c]);
2157 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2158 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2159 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2165 SubdividePolygon(f, front[0]);
2166 SubdividePolygon(b, back[0]);
2170 i1 = subdivpolylookupvert(verts);
2171 i2 = subdivpolylookupvert(verts + 3);
2172 for (i = 2;i < numverts;i++)
2174 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2176 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2180 i3 = subdivpolylookupvert(verts + i * 3);
2181 subdivpolyindex[subdivpolytriangles][0] = i1;
2182 subdivpolyindex[subdivpolytriangles][1] = i2;
2183 subdivpolyindex[subdivpolytriangles][2] = i3;
2185 subdivpolytriangles++;
2189 //Breaks a polygon up along axial 64 unit
2190 //boundaries so that turbulent and sky warps
2191 //can be done reasonably.
2192 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2198 subdivpolytriangles = 0;
2199 subdivpolyverts = 0;
2200 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2201 if (subdivpolytriangles < 1)
2202 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2204 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2205 mesh->num_vertices = subdivpolyverts;
2206 mesh->num_triangles = subdivpolytriangles;
2207 mesh->vertex = (surfvertex_t *)(mesh + 1);
2208 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2209 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2211 for (i = 0;i < mesh->num_triangles;i++)
2212 for (j = 0;j < 3;j++)
2213 mesh->index[i*3+j] = subdivpolyindex[i][j];
2215 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2217 VectorCopy(subdivpolyvert[i], v->v);
2218 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2219 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2224 /* Maximum size of a single LM */
2225 #define MAX_SINGLE_LM_SIZE 256
2233 struct alloc_lm_state
2236 struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2239 static void init_alloc_lm_state (struct alloc_lm_state* state)
2243 state->currentY = 0;
2244 for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2246 state->rows[r].currentX = 0;
2247 state->rows[r].rowY = -1;
2251 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2253 struct alloc_lm_row* row;
2256 row = &(state->rows[blockheight]);
2257 if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2259 if (state->currentY + blockheight <= totalheight)
2261 row->rowY = state->currentY;
2263 state->currentY += blockheight;
2267 /* See if we can stuff the block into a higher row */
2269 for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2271 if ((state->rows[r].rowY >= 0)
2272 && (state->rows[r].currentX + blockwidth <= totalwidth))
2274 row = &(state->rows[r]);
2278 if (row == NULL) return false;
2282 *outx = row->currentX;
2283 row->currentX += blockwidth;
2288 extern cvar_t gl_max_size;
2289 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2292 msurface_t *surface;
2293 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2294 float texmins[2], texmaxs[2], val;
2295 rtexture_t *lightmaptexture, *deluxemaptexture;
2297 in = (dface_t *)(mod_base + l->fileofs);
2298 if (l->filelen % sizeof(*in))
2299 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2300 count = l->filelen / sizeof(*in);
2301 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2302 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2304 loadmodel->num_surfaces = count;
2306 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2310 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2312 numedges = (unsigned short)LittleShort(in->numedges);
2313 totalverts += numedges;
2314 totaltris += numedges - 2;
2317 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2319 lightmaptexture = NULL;
2320 deluxemaptexture = r_texture_blanknormalmap;
2322 lightmapsize = max(256, gl_max_size.integer);
2323 totallightmapsamples = 0;
2327 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2329 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2331 // FIXME: validate edges, texinfo, etc?
2332 firstedge = LittleLong(in->firstedge);
2333 numedges = (unsigned short)LittleShort(in->numedges);
2334 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)
2335 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2336 i = (unsigned short)LittleShort(in->texinfo);
2337 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2338 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2339 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2340 surface->texture = surface->lightmapinfo->texinfo->texture;
2342 planenum = (unsigned short)LittleShort(in->planenum);
2343 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2344 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2346 //surface->flags = surface->texture->flags;
2347 //if (LittleShort(in->side))
2348 // surface->flags |= SURF_PLANEBACK;
2349 //surface->plane = loadmodel->brush.data_planes + planenum;
2351 surface->num_firstvertex = totalverts;
2352 surface->num_vertices = numedges;
2353 surface->num_firsttriangle = totaltris;
2354 surface->num_triangles = numedges - 2;
2355 totalverts += numedges;
2356 totaltris += numedges - 2;
2358 // convert edges back to a normal polygon
2359 for (i = 0;i < surface->num_vertices;i++)
2361 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2363 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2365 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2367 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2368 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2369 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2370 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2371 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2372 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2373 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2374 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2377 for (i = 0;i < surface->num_triangles;i++)
2379 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2380 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2381 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2384 // compile additional data about the surface geometry
2385 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);
2386 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);
2387 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2389 // generate surface extents information
2390 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2391 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2392 for (i = 1;i < surface->num_vertices;i++)
2394 for (j = 0;j < 2;j++)
2396 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2397 texmins[j] = min(texmins[j], val);
2398 texmaxs[j] = max(texmaxs[j], val);
2401 for (i = 0;i < 2;i++)
2403 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2404 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2407 smax = surface->lightmapinfo->extents[0] >> 4;
2408 tmax = surface->lightmapinfo->extents[1] >> 4;
2409 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2410 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2413 for (i = 0;i < MAXLIGHTMAPS;i++)
2414 surface->lightmapinfo->styles[i] = in->styles[i];
2415 surface->lightmaptexture = NULL;
2416 surface->deluxemaptexture = r_texture_blanknormalmap;
2417 i = LittleLong(in->lightofs);
2420 surface->lightmapinfo->samples = NULL;
2422 // give non-lightmapped water a 1x white lightmap
2423 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2425 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2426 surface->lightmapinfo->styles[0] = 0;
2427 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2431 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2432 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2433 else // LordHavoc: white lighting (bsp version 29)
2435 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2436 if (loadmodel->brushq1.nmaplightdata)
2437 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2440 // check if we should apply a lightmap to this
2441 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2443 if (ssize > 256 || tsize > 256)
2444 Host_Error("Bad surface extents");
2446 if (lightmapsize < ssize)
2447 lightmapsize = ssize;
2448 if (lightmapsize < tsize)
2449 lightmapsize = tsize;
2451 totallightmapsamples += ssize*tsize;
2453 // force lightmap upload on first time seeing the surface
2455 // additionally this is used by the later code to see if a
2456 // lightmap is needed on this surface (rather than duplicating the
2458 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2462 // small maps (such as ammo boxes especially) don't need big lightmap
2463 // textures, so this code tries to guess a good size based on
2464 // totallightmapsamples (size of the lightmaps lump basically), as well as
2465 // trying to max out the gl_max_size if there is a lot of lightmap data to
2467 // additionally, never choose a lightmapsize that is smaller than the
2468 // largest surface encountered (as it would fail)
2470 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2473 // now that we've decided the lightmap texture size, we can do the rest
2474 if (cls.state != ca_dedicated)
2476 int stainmapsize = 0;
2477 struct alloc_lm_state allocState;
2479 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2481 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2482 float u, v, ubase, vbase, uscale, vscale;
2484 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2487 smax = surface->lightmapinfo->extents[0] >> 4;
2488 tmax = surface->lightmapinfo->extents[1] >> 4;
2489 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2490 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2491 stainmapsize += ssize * tsize * 3;
2493 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2495 // allocate a texture pool if we need it
2496 if (loadmodel->texturepool == NULL)
2497 loadmodel->texturepool = R_AllocTexturePool();
2498 // could not find room, make a new lightmap
2499 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2500 if (loadmodel->brushq1.nmaplightdata)
2501 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2503 init_alloc_lm_state (&allocState);
2504 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2506 surface->lightmaptexture = lightmaptexture;
2507 surface->deluxemaptexture = deluxemaptexture;
2508 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2509 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2511 uscale = 1.0f / (float)lightmapsize;
2512 vscale = 1.0f / (float)lightmapsize;
2513 ubase = lightmapx * uscale;
2514 vbase = lightmapy * vscale;
2516 for (i = 0;i < surface->num_vertices;i++)
2518 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);
2519 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);
2520 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2521 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2522 // LordHavoc: calc lightmap data offset for vertex lighting to use
2525 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2529 if (cl_stainmaps.integer)
2531 // allocate stainmaps for permanent marks on walls and clear white
2532 unsigned char *stainsamples = NULL;
2533 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2534 memset(stainsamples, 255, stainmapsize);
2536 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2538 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2540 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2541 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2542 surface->lightmapinfo->stainsamples = stainsamples;
2543 stainsamples += ssize * tsize * 3;
2548 // generate ushort elements array if possible
2549 if (loadmodel->surfmesh.data_element3s)
2550 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2551 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2554 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2557 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2558 node->parent = parent;
2561 // this is a node, recurse to children
2562 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2563 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2564 // combine supercontents of children
2565 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2570 mleaf_t *leaf = (mleaf_t *)node;
2571 // if this is a leaf, calculate supercontents mask from all collidable
2572 // primitives in the leaf (brushes and collision surfaces)
2573 // also flag if the leaf contains any collision surfaces
2574 leaf->combinedsupercontents = 0;
2575 // combine the supercontents values of all brushes in this leaf
2576 for (j = 0;j < leaf->numleafbrushes;j++)
2577 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2578 // check if this leaf contains any collision surfaces (q3 patches)
2579 for (j = 0;j < leaf->numleafsurfaces;j++)
2581 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2582 if (surface->num_collisiontriangles)
2584 leaf->containscollisionsurfaces = true;
2585 leaf->combinedsupercontents |= surface->texture->supercontents;
2591 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2597 in = (dnode_t *)(mod_base + l->fileofs);
2598 if (l->filelen % sizeof(*in))
2599 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2600 count = l->filelen / sizeof(*in);
2601 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2603 loadmodel->brush.data_nodes = out;
2604 loadmodel->brush.num_nodes = count;
2606 for ( i=0 ; i<count ; i++, in++, out++)
2608 for (j=0 ; j<3 ; j++)
2610 out->mins[j] = LittleShort(in->mins[j]);
2611 out->maxs[j] = LittleShort(in->maxs[j]);
2614 p = LittleLong(in->planenum);
2615 out->plane = loadmodel->brush.data_planes + p;
2617 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2618 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2620 for (j=0 ; j<2 ; j++)
2622 // LordHavoc: this code supports broken bsp files produced by
2623 // arguire qbsp which can produce more than 32768 nodes, any value
2624 // below count is assumed to be a node number, any other value is
2625 // assumed to be a leaf number
2626 p = (unsigned short)LittleShort(in->children[j]);
2629 if (p < loadmodel->brush.num_nodes)
2630 out->children[j] = loadmodel->brush.data_nodes + p;
2633 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2634 // map it to the solid leaf
2635 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2640 // note this uses 65535 intentionally, -1 is leaf 0
2642 if (p < loadmodel->brush.num_leafs)
2643 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2646 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2647 // map it to the solid leaf
2648 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2654 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2657 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2663 in = (dleaf_t *)(mod_base + l->fileofs);
2664 if (l->filelen % sizeof(*in))
2665 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2666 count = l->filelen / sizeof(*in);
2667 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2669 loadmodel->brush.data_leafs = out;
2670 loadmodel->brush.num_leafs = count;
2671 // get visleafs from the submodel data
2672 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2673 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2674 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2675 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2677 for ( i=0 ; i<count ; i++, in++, out++)
2679 for (j=0 ; j<3 ; j++)
2681 out->mins[j] = LittleShort(in->mins[j]);
2682 out->maxs[j] = LittleShort(in->maxs[j]);
2685 // FIXME: this function could really benefit from some error checking
2687 out->contents = LittleLong(in->contents);
2689 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2690 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2691 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2693 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);
2694 out->firstleafsurface = NULL;
2695 out->numleafsurfaces = 0;
2698 out->clusterindex = i - 1;
2699 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2700 out->clusterindex = -1;
2702 p = LittleLong(in->visofs);
2703 // ignore visofs errors on leaf 0 (solid)
2704 if (p >= 0 && out->clusterindex >= 0)
2706 if (p >= loadmodel->brushq1.num_compressedpvs)
2707 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2709 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);
2712 for (j = 0;j < 4;j++)
2713 out->ambient_sound_level[j] = in->ambient_level[j];
2715 // FIXME: Insert caustics here
2719 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2723 const unsigned char *pvs;
2724 // if there's no vis data, assume supported (because everything is visible all the time)
2725 if (!loadmodel->brush.data_pvsclusters)
2727 // check all liquid leafs to see if they can see into empty leafs, if any
2728 // can we can assume this map supports r_wateralpha
2729 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2731 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2733 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2734 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2735 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2742 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2749 in = (dclipnode_t *)(mod_base + l->fileofs);
2750 if (l->filelen % sizeof(*in))
2751 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2752 count = l->filelen / sizeof(*in);
2753 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2755 loadmodel->brushq1.clipnodes = out;
2756 loadmodel->brushq1.numclipnodes = count;
2758 for (i = 1; i < MAX_MAP_HULLS; i++)
2760 hull = &loadmodel->brushq1.hulls[i];
2761 hull->clipnodes = out;
2762 hull->firstclipnode = 0;
2763 hull->lastclipnode = count-1;
2764 hull->planes = loadmodel->brush.data_planes;
2765 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2766 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2767 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2768 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2769 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2770 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2771 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2774 for (i=0 ; i<count ; i++, out++, in++)
2776 out->planenum = LittleLong(in->planenum);
2777 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2778 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2779 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2780 if (out->children[0] >= count)
2781 out->children[0] -= 65536;
2782 if (out->children[1] >= count)
2783 out->children[1] -= 65536;
2784 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2785 Host_Error("Corrupt clipping hull(out of range planenum)");
2789 //Duplicate the drawing hull structure as a clipping hull
2790 static void Mod_Q1BSP_MakeHull0(void)
2797 hull = &loadmodel->brushq1.hulls[0];
2799 in = loadmodel->brush.data_nodes;
2800 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2802 hull->clipnodes = out;
2803 hull->firstclipnode = 0;
2804 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2805 hull->planes = loadmodel->brush.data_planes;
2807 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2809 out->planenum = in->plane - loadmodel->brush.data_planes;
2810 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2811 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2815 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2820 in = (short *)(mod_base + l->fileofs);
2821 if (l->filelen % sizeof(*in))
2822 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2823 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2824 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2826 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2828 j = (unsigned short) LittleShort(in[i]);
2829 if (j >= loadmodel->num_surfaces)
2830 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2831 loadmodel->brush.data_leafsurfaces[i] = j;
2835 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2840 in = (int *)(mod_base + l->fileofs);
2841 if (l->filelen % sizeof(*in))
2842 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2843 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2844 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2846 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2847 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2851 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2857 in = (dplane_t *)(mod_base + l->fileofs);
2858 if (l->filelen % sizeof(*in))
2859 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2861 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2862 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2864 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2866 out->normal[0] = LittleFloat(in->normal[0]);
2867 out->normal[1] = LittleFloat(in->normal[1]);
2868 out->normal[2] = LittleFloat(in->normal[2]);
2869 out->dist = LittleFloat(in->dist);
2875 static void Mod_Q1BSP_LoadMapBrushes(void)
2879 int submodel, numbrushes;
2880 qboolean firstbrush;
2881 char *text, *maptext;
2882 char mapfilename[MAX_QPATH];
2883 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2884 strlcat (mapfilename, ".map", sizeof (mapfilename));
2885 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2889 if (!COM_ParseToken_Simple(&data, false, false))
2894 if (!COM_ParseToken_Simple(&data, false, false))
2896 if (com_token[0] != '{')
2902 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2905 if (!COM_ParseToken_Simple(&data, false, false))
2907 if (com_token[0] == '}')
2908 break; // end of entity
2909 if (com_token[0] == '{')
2916 if (submodel > loadmodel->brush.numsubmodels)
2918 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2922 model = loadmodel->brush.submodels[submodel];
2929 if (!COM_ParseToken_Simple(&data, false, false))
2931 if (com_token[0] == '}')
2932 break; // end of brush
2933 // each brush face should be this format:
2934 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2935 // FIXME: support hl .map format
2936 for (pointnum = 0;pointnum < 3;pointnum++)
2938 COM_ParseToken_Simple(&data, false, false);
2939 for (componentnum = 0;componentnum < 3;componentnum++)
2941 COM_ParseToken_Simple(&data, false, false);
2942 point[pointnum][componentnum] = atof(com_token);
2944 COM_ParseToken_Simple(&data, false, false);
2946 COM_ParseToken_Simple(&data, false, false);
2947 strlcpy(facetexture, com_token, sizeof(facetexture));
2948 COM_ParseToken_Simple(&data, false, false);
2949 //scroll_s = atof(com_token);
2950 COM_ParseToken_Simple(&data, false, false);
2951 //scroll_t = atof(com_token);
2952 COM_ParseToken_Simple(&data, false, false);
2953 //rotate = atof(com_token);
2954 COM_ParseToken_Simple(&data, false, false);
2955 //scale_s = atof(com_token);
2956 COM_ParseToken_Simple(&data, false, false);
2957 //scale_t = atof(com_token);
2958 TriangleNormal(point[0], point[1], point[2], planenormal);
2959 VectorNormalizeDouble(planenormal);
2960 planedist = DotProduct(point[0], planenormal);
2961 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2971 #define MAX_PORTALPOINTS 64
2973 typedef struct portal_s
2976 mnode_t *nodes[2]; // [0] = front side of plane
2977 struct portal_s *next[2];
2979 double points[3*MAX_PORTALPOINTS];
2980 struct portal_s *chain; // all portals are linked into a list
2984 static portal_t *portalchain;
2991 static portal_t *AllocPortal(void)
2994 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2995 p->chain = portalchain;
3000 static void FreePortal(portal_t *p)
3005 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3007 // process only nodes (leafs already had their box calculated)
3011 // calculate children first
3012 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3013 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3015 // make combined bounding box from children
3016 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3017 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3018 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3019 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3020 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3021 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3024 static void Mod_Q1BSP_FinalizePortals(void)
3026 int i, j, numportals, numpoints;
3027 portal_t *p, *pnext;
3030 mleaf_t *leaf, *endleaf;
3032 // tally up portal and point counts and recalculate bounding boxes for all
3033 // leafs (because qbsp is very sloppy)
3034 leaf = loadmodel->brush.data_leafs;
3035 endleaf = leaf + loadmodel->brush.num_leafs;
3036 for (;leaf < endleaf;leaf++)
3038 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3039 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3046 // note: this check must match the one below or it will usually corrupt memory
3047 // 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
3048 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3051 numpoints += p->numpoints * 2;
3055 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3056 loadmodel->brush.num_portals = numportals;
3057 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3058 loadmodel->brush.num_portalpoints = numpoints;
3059 // clear all leaf portal chains
3060 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3061 loadmodel->brush.data_leafs[i].portals = NULL;
3062 // process all portals in the global portal chain, while freeing them
3063 portal = loadmodel->brush.data_portals;
3064 point = loadmodel->brush.data_portalpoints;
3071 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3073 // note: this check must match the one above or it will usually corrupt memory
3074 // 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
3075 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3077 // first make the back to front portal(forward portal)
3078 portal->points = point;
3079 portal->numpoints = p->numpoints;
3080 portal->plane.dist = p->plane.dist;
3081 VectorCopy(p->plane.normal, portal->plane.normal);
3082 portal->here = (mleaf_t *)p->nodes[1];
3083 portal->past = (mleaf_t *)p->nodes[0];
3085 for (j = 0;j < portal->numpoints;j++)
3087 VectorCopy(p->points + j*3, point->position);
3090 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3091 PlaneClassify(&portal->plane);
3093 // link into leaf's portal chain
3094 portal->next = portal->here->portals;
3095 portal->here->portals = portal;
3097 // advance to next portal
3100 // then make the front to back portal(backward portal)
3101 portal->points = point;
3102 portal->numpoints = p->numpoints;
3103 portal->plane.dist = -p->plane.dist;
3104 VectorNegate(p->plane.normal, portal->plane.normal);
3105 portal->here = (mleaf_t *)p->nodes[0];
3106 portal->past = (mleaf_t *)p->nodes[1];
3108 for (j = portal->numpoints - 1;j >= 0;j--)
3110 VectorCopy(p->points + j*3, point->position);
3113 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3114 PlaneClassify(&portal->plane);
3116 // link into leaf's portal chain
3117 portal->next = portal->here->portals;
3118 portal->here->portals = portal;
3120 // advance to next portal
3123 // add the portal's polygon points to the leaf bounding boxes
3124 for (i = 0;i < 2;i++)
3126 leaf = (mleaf_t *)p->nodes[i];
3127 for (j = 0;j < p->numpoints;j++)
3129 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3130 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3131 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3132 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3133 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3134 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3141 // now recalculate the node bounding boxes from the leafs
3142 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3150 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3153 Host_Error("AddPortalToNodes: NULL front node");
3155 Host_Error("AddPortalToNodes: NULL back node");
3156 if (p->nodes[0] || p->nodes[1])
3157 Host_Error("AddPortalToNodes: already included");
3158 // 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
3160 p->nodes[0] = front;
3161 p->next[0] = (portal_t *)front->portals;
3162 front->portals = (mportal_t *)p;
3165 p->next[1] = (portal_t *)back->portals;
3166 back->portals = (mportal_t *)p;
3171 RemovePortalFromNode
3174 static void RemovePortalFromNodes(portal_t *portal)
3178 void **portalpointer;
3180 for (i = 0;i < 2;i++)
3182 node = portal->nodes[i];
3184 portalpointer = (void **) &node->portals;
3187 t = (portal_t *)*portalpointer;
3189 Host_Error("RemovePortalFromNodes: portal not in leaf");
3193 if (portal->nodes[0] == node)
3195 *portalpointer = portal->next[0];
3196 portal->nodes[0] = NULL;
3198 else if (portal->nodes[1] == node)
3200 *portalpointer = portal->next[1];
3201 portal->nodes[1] = NULL;
3204 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3208 if (t->nodes[0] == node)
3209 portalpointer = (void **) &t->next[0];
3210 else if (t->nodes[1] == node)
3211 portalpointer = (void **) &t->next[1];
3213 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3218 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3219 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3222 mnode_t *front, *back, *other_node;
3223 mplane_t clipplane, *plane;
3224 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3225 int numfrontpoints, numbackpoints;
3226 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3228 // if a leaf, we're done
3232 plane = node->plane;
3234 front = node->children[0];
3235 back = node->children[1];
3237 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3239 // create the new portal by generating a polygon for the node plane,
3240 // and clipping it by all of the other portals(which came from nodes above this one)
3241 nodeportal = AllocPortal();
3242 nodeportal->plane = *plane;
3244 // 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)
3245 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);
3246 nodeportal->numpoints = 4;
3247 side = 0; // shut up compiler warning
3248 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3250 clipplane = portal->plane;
3251 if (portal->nodes[0] == portal->nodes[1])
3252 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3253 if (portal->nodes[0] == node)
3255 else if (portal->nodes[1] == node)
3257 clipplane.dist = -clipplane.dist;
3258 VectorNegate(clipplane.normal, clipplane.normal);
3262 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3264 for (i = 0;i < nodeportal->numpoints*3;i++)
3265 frontpoints[i] = nodeportal->points[i];
3266 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);
3267 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3271 if (nodeportal->numpoints < 3)
3273 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3274 nodeportal->numpoints = 0;
3276 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3278 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3279 nodeportal->numpoints = 0;
3282 AddPortalToNodes(nodeportal, front, back);
3284 // split the portals of this node along this node's plane and assign them to the children of this node
3285 // (migrating the portals downward through the tree)
3286 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3288 if (portal->nodes[0] == portal->nodes[1])
3289 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3290 if (portal->nodes[0] == node)
3292 else if (portal->nodes[1] == node)
3295 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3296 nextportal = portal->next[side];
3297 if (!portal->numpoints)
3300 other_node = portal->nodes[!side];
3301 RemovePortalFromNodes(portal);
3303 // cut the portal into two portals, one on each side of the node plane
3304 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);
3306 if (!numfrontpoints)
3309 AddPortalToNodes(portal, back, other_node);
3311 AddPortalToNodes(portal, other_node, back);
3317 AddPortalToNodes(portal, front, other_node);
3319 AddPortalToNodes(portal, other_node, front);
3323 // the portal is split
3324 splitportal = AllocPortal();
3325 temp = splitportal->chain;
3326 *splitportal = *portal;
3327 splitportal->chain = temp;
3328 for (i = 0;i < numbackpoints*3;i++)
3329 splitportal->points[i] = backpoints[i];
3330 splitportal->numpoints = numbackpoints;
3331 for (i = 0;i < numfrontpoints*3;i++)
3332 portal->points[i] = frontpoints[i];
3333 portal->numpoints = numfrontpoints;
3337 AddPortalToNodes(portal, front, other_node);
3338 AddPortalToNodes(splitportal, back, other_node);
3342 AddPortalToNodes(portal, other_node, front);
3343 AddPortalToNodes(splitportal, other_node, back);
3347 Mod_Q1BSP_RecursiveNodePortals(front);
3348 Mod_Q1BSP_RecursiveNodePortals(back);
3351 static void Mod_Q1BSP_MakePortals(void)
3354 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3355 Mod_Q1BSP_FinalizePortals();
3358 //Returns PVS data for a given point
3359 //(note: can return NULL)
3360 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3363 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3365 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3366 if (((mleaf_t *)node)->clusterindex >= 0)
3367 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3372 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)
3376 float d = PlaneDiff(org, node->plane);
3378 node = node->children[0];
3379 else if (d < -radius)
3380 node = node->children[1];
3383 // go down both sides
3384 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3385 node = node->children[1];
3388 // if this leaf is in a cluster, accumulate the pvs bits
3389 if (((mleaf_t *)node)->clusterindex >= 0)
3392 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3393 for (i = 0;i < pvsbytes;i++)
3394 pvsbuffer[i] |= pvs[i];
3398 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3399 //of the given point.
3400 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3402 int bytes = model->brush.num_pvsclusterbytes;
3403 bytes = min(bytes, pvsbufferlength);
3404 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3406 memset(pvsbuffer, 0xFF, bytes);
3410 memset(pvsbuffer, 0, bytes);
3411 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3415 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3420 VectorSubtract(inmaxs, inmins, size);
3421 if (cmodel->brush.ishlbsp)
3424 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3425 else if (size[0] <= 32)
3427 if (size[2] < 54) // pick the nearest of 36 or 72
3428 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3430 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3433 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3438 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3439 else if (size[0] <= 32)
3440 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3442 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3444 VectorCopy(inmins, outmins);
3445 VectorAdd(inmins, hull->clip_size, outmaxs);
3448 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3453 mempool_t *mainmempool;
3454 float dist, modelyawradius, modelradius;
3455 msurface_t *surface;
3456 int numshadowmeshtriangles;
3457 hullinfo_t hullinfo;
3458 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3459 model_brush_lightstyleinfo_t styleinfo[256];
3460 unsigned char *datapointer;
3462 mod->modeldatatypestring = "Q1BSP";
3464 mod->type = mod_brushq1;
3466 header = (dheader_t *)buffer;
3468 i = LittleLong(header->version);
3469 if (i != BSPVERSION && i != 30)
3470 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3471 mod->brush.ishlbsp = i == 30;
3473 // fill in hull info
3474 VectorClear (hullinfo.hullsizes[0][0]);
3475 VectorClear (hullinfo.hullsizes[0][1]);
3476 if (mod->brush.ishlbsp)
3478 mod->modeldatatypestring = "HLBSP";
3480 hullinfo.filehulls = 4;
3481 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3482 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3483 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3484 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3485 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3486 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3490 hullinfo.filehulls = 4;
3491 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3492 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3493 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3494 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3498 mod_base = (unsigned char*)buffer;
3499 for (i = 0; i < HEADER_LUMPS; i++)
3501 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3502 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3505 mod->soundfromcenter = true;
3506 mod->TraceBox = Mod_Q1BSP_TraceBox;
3507 mod->TraceLine = Mod_Q1BSP_TraceLine;
3508 mod->TracePoint = Mod_Q1BSP_TracePoint;
3509 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3510 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3511 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3512 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3513 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3514 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3515 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3516 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3517 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3518 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3519 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3520 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3521 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3522 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3523 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3524 mod->Draw = R_Q1BSP_Draw;
3525 mod->DrawDepth = R_Q1BSP_DrawDepth;
3526 mod->DrawDebug = R_Q1BSP_DrawDebug;
3527 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3528 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3529 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3530 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3531 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3532 mod->DrawLight = R_Q1BSP_DrawLight;
3536 mod->brush.qw_md4sum = 0;
3537 mod->brush.qw_md4sum2 = 0;
3538 for (i = 0;i < HEADER_LUMPS;i++)
3540 if (i == LUMP_ENTITIES)
3542 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3543 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3545 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3548 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3549 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3550 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3551 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3552 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3553 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3554 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3555 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3556 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3557 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3558 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3559 // load submodels before leafs because they contain the number of vis leafs
3560 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3561 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3562 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3563 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3565 // check if the map supports transparent water rendering
3566 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3568 if (mod->brushq1.data_compressedpvs)
3569 Mem_Free(mod->brushq1.data_compressedpvs);
3570 mod->brushq1.data_compressedpvs = NULL;
3571 mod->brushq1.num_compressedpvs = 0;
3573 Mod_Q1BSP_MakeHull0();
3574 Mod_Q1BSP_MakePortals();
3576 mod->numframes = 2; // regular and alternate animation
3579 mainmempool = mod->mempool;
3581 // make a single combined shadow mesh to allow optimized shadow volume creation
3582 numshadowmeshtriangles = 0;
3583 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3585 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3586 numshadowmeshtriangles += surface->num_triangles;
3588 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3589 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3590 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));
3591 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3592 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3594 if (loadmodel->brush.numsubmodels)
3595 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3597 // LordHavoc: to clear the fog around the original quake submodel code, I
3599 // first of all, some background info on the submodels:
3600 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3601 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3602 // now the weird for loop itself:
3603 // the loop functions in an odd way, on each iteration it sets up the
3604 // current 'mod' model (which despite the confusing code IS the model of
3605 // the number i), at the end of the loop it duplicates the model to become
3606 // the next submodel, and loops back to set up the new submodel.
3608 // LordHavoc: now the explanation of my sane way (which works identically):
3609 // set up the world model, then on each submodel copy from the world model
3610 // and set up the submodel with the respective model info.
3611 totalstylesurfaces = 0;
3613 for (i = 0;i < mod->brush.numsubmodels;i++)
3615 memset(stylecounts, 0, sizeof(stylecounts));
3616 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3618 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3619 for (j = 0;j < MAXLIGHTMAPS;j++)
3620 stylecounts[surface->lightmapinfo->styles[j]]++;
3622 for (k = 0;k < 255;k++)
3626 totalstylesurfaces += stylecounts[k];
3629 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3630 for (i = 0;i < mod->brush.numsubmodels;i++)
3632 // LordHavoc: this code was originally at the end of this loop, but
3633 // has been transformed to something more readable at the start here.
3638 // duplicate the basic information
3639 dpsnprintf(name, sizeof(name), "*%i", i);
3640 mod = Mod_FindName(name, loadmodel->name);
3641 // copy the base model to this one
3643 // rename the clone back to its proper name
3644 strlcpy(mod->name, name, sizeof(mod->name));
3645 mod->brush.parentmodel = loadmodel;
3646 // textures and memory belong to the main model
3647 mod->texturepool = NULL;
3648 mod->mempool = NULL;
3649 mod->brush.GetPVS = NULL;
3650 mod->brush.FatPVS = NULL;
3651 mod->brush.BoxTouchingPVS = NULL;
3652 mod->brush.BoxTouchingLeafPVS = NULL;
3653 mod->brush.BoxTouchingVisibleLeafs = NULL;
3654 mod->brush.FindBoxClusters = NULL;
3655 mod->brush.LightPoint = NULL;
3656 mod->brush.AmbientSoundLevelsForPoint = NULL;
3659 mod->brush.submodel = i;
3661 if (loadmodel->brush.submodels)
3662 loadmodel->brush.submodels[i] = mod;
3664 bm = &mod->brushq1.submodels[i];
3666 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3667 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3669 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3670 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3673 mod->firstmodelsurface = bm->firstface;
3674 mod->nummodelsurfaces = bm->numfaces;
3676 // set node/leaf parents for this submodel
3677 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3679 // make the model surface list (used by shadowing/lighting)
3680 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3681 Mod_MakeSortedSurfaces(mod);
3683 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3684 // (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)
3685 VectorCopy(bm->mins, mod->normalmins);
3686 VectorCopy(bm->maxs, mod->normalmaxs);
3687 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3688 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3689 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3690 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3691 modelradius = modelyawradius + modelradius * modelradius;
3692 modelyawradius = sqrt(modelyawradius);
3693 modelradius = sqrt(modelradius);
3694 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3695 mod->yawmins[2] = mod->normalmins[2];
3696 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3697 mod->yawmaxs[2] = mod->normalmaxs[2];
3698 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3699 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3700 mod->radius = modelradius;
3701 mod->radius2 = modelradius * modelradius;
3703 // this gets altered below if sky or water is used
3704 mod->DrawSky = NULL;
3705 mod->DrawAddWaterPlanes = NULL;
3707 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3708 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3709 if (mod->nummodelsurfaces)
3711 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3712 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3714 if (j < mod->nummodelsurfaces)
3715 mod->DrawSky = R_Q1BSP_DrawSky;
3717 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3718 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3720 if (j < mod->nummodelsurfaces)
3721 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3723 // build lightstyle update chains
3724 // (used to rapidly mark lightmapupdateflags on many surfaces
3725 // when d_lightstylevalue changes)
3726 memset(stylecounts, 0, sizeof(stylecounts));
3727 for (k = 0;k < mod->nummodelsurfaces;k++)
3729 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3730 for (j = 0;j < MAXLIGHTMAPS;j++)
3731 stylecounts[surface->lightmapinfo->styles[j]]++;
3733 mod->brushq1.num_lightstyles = 0;
3734 for (k = 0;k < 255;k++)
3738 styleinfo[mod->brushq1.num_lightstyles].style = k;
3739 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3740 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3741 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3742 remapstyles[k] = mod->brushq1.num_lightstyles;
3743 mod->brushq1.num_lightstyles++;
3746 for (k = 0;k < mod->nummodelsurfaces;k++)
3748 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3749 for (j = 0;j < MAXLIGHTMAPS;j++)
3751 if (surface->lightmapinfo->styles[j] != 255)
3753 int r = remapstyles[surface->lightmapinfo->styles[j]];
3754 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3758 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3759 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3763 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3764 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3766 //mod->brushq1.num_visleafs = bm->visleafs;
3769 Mod_Q1BSP_LoadMapBrushes();
3771 //Mod_Q1BSP_ProcessLightList();
3773 if (developer.integer >= 10)
3774 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);
3777 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3781 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3788 in = (void *)(mod_base + l->fileofs);
3789 if (l->filelen % sizeof(*in))
3790 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3791 count = l->filelen / sizeof(*in);
3792 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3795 loadmodel->num = count;
3797 for (i = 0;i < count;i++, in++, out++)
3803 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3810 in = (void *)(mod_base + l->fileofs);
3811 if (l->filelen % sizeof(*in))
3812 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3813 count = l->filelen / sizeof(*in);
3814 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3817 loadmodel->num = count;
3819 for (i = 0;i < count;i++, in++, out++)
3825 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3832 in = (void *)(mod_base + l->fileofs);
3833 if (l->filelen % sizeof(*in))
3834 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3835 count = l->filelen / sizeof(*in);
3836 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3839 loadmodel->num = count;
3841 for (i = 0;i < count;i++, in++, out++)
3847 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3854 in = (void *)(mod_base + l->fileofs);
3855 if (l->filelen % sizeof(*in))
3856 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3857 count = l->filelen / sizeof(*in);
3858 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3861 loadmodel->num = count;
3863 for (i = 0;i < count;i++, in++, out++)
3869 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3876 in = (void *)(mod_base + l->fileofs);
3877 if (l->filelen % sizeof(*in))
3878 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3879 count = l->filelen / sizeof(*in);
3880 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3883 loadmodel->num = count;
3885 for (i = 0;i < count;i++, in++, out++)
3891 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3898 in = (void *)(mod_base + l->fileofs);
3899 if (l->filelen % sizeof(*in))
3900 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3901 count = l->filelen / sizeof(*in);
3902 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3905 loadmodel->num = count;
3907 for (i = 0;i < count;i++, in++, out++)
3913 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3920 in = (void *)(mod_base + l->fileofs);
3921 if (l->filelen % sizeof(*in))
3922 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3923 count = l->filelen / sizeof(*in);
3924 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3927 loadmodel->num = count;
3929 for (i = 0;i < count;i++, in++, out++)
3935 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3942 in = (void *)(mod_base + l->fileofs);
3943 if (l->filelen % sizeof(*in))
3944 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3945 count = l->filelen / sizeof(*in);
3946 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3949 loadmodel->num = count;
3951 for (i = 0;i < count;i++, in++, out++)
3957 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3964 in = (void *)(mod_base + l->fileofs);
3965 if (l->filelen % sizeof(*in))
3966 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3967 count = l->filelen / sizeof(*in);
3968 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3971 loadmodel->num = count;
3973 for (i = 0;i < count;i++, in++, out++)
3979 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3986 in = (void *)(mod_base + l->fileofs);
3987 if (l->filelen % sizeof(*in))
3988 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3989 count = l->filelen / sizeof(*in);
3990 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3993 loadmodel->num = count;
3995 for (i = 0;i < count;i++, in++, out++)
4001 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4008 in = (void *)(mod_base + l->fileofs);
4009 if (l->filelen % sizeof(*in))
4010 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4011 count = l->filelen / sizeof(*in);
4012 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4015 loadmodel->num = count;
4017 for (i = 0;i < count;i++, in++, out++)
4023 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4030 in = (void *)(mod_base + l->fileofs);
4031 if (l->filelen % sizeof(*in))
4032 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4033 count = l->filelen / sizeof(*in);
4034 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4037 loadmodel->num = count;
4039 for (i = 0;i < count;i++, in++, out++)
4045 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4052 in = (void *)(mod_base + l->fileofs);
4053 if (l->filelen % sizeof(*in))
4054 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4055 count = l->filelen / sizeof(*in);
4056 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4059 loadmodel->num = count;
4061 for (i = 0;i < count;i++, in++, out++)
4067 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4074 in = (void *)(mod_base + l->fileofs);
4075 if (l->filelen % sizeof(*in))
4076 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4077 count = l->filelen / sizeof(*in);
4078 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4081 loadmodel->num = count;
4083 for (i = 0;i < count;i++, in++, out++)
4089 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4096 in = (void *)(mod_base + l->fileofs);
4097 if (l->filelen % sizeof(*in))
4098 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4099 count = l->filelen / sizeof(*in);
4100 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4103 loadmodel->num = count;
4105 for (i = 0;i < count;i++, in++, out++)
4111 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4118 in = (void *)(mod_base + l->fileofs);
4119 if (l->filelen % sizeof(*in))
4120 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4121 count = l->filelen / sizeof(*in);
4122 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4125 loadmodel->num = count;
4127 for (i = 0;i < count;i++, in++, out++)
4133 static void Mod_Q2BSP_LoadModels(lump_t *l)
4140 in = (void *)(mod_base + l->fileofs);
4141 if (l->filelen % sizeof(*in))
4142 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4143 count = l->filelen / sizeof(*in);
4144 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4147 loadmodel->num = count;
4149 for (i = 0;i < count;i++, in++, out++)
4155 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4158 q2dheader_t *header;
4160 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4162 mod->modeldatatypestring = "Q2BSP";
4164 mod->type = mod_brushq2;
4166 header = (q2dheader_t *)buffer;
4168 i = LittleLong(header->version);
4169 if (i != Q2BSPVERSION)
4170 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4172 mod_base = (unsigned char *)header;
4174 // swap all the lumps
4175 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4176 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4178 mod->brush.qw_md4sum = 0;
4179 mod->brush.qw_md4sum2 = 0;
4180 for (i = 0;i < Q2HEADER_LUMPS;i++)
4182 if (i == Q2LUMP_ENTITIES)
4184 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4185 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4187 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4190 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4191 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4192 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4193 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4194 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4195 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4196 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4197 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4198 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4199 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4200 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4201 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4202 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4203 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4204 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4205 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4206 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4207 // LordHavoc: must go last because this makes the submodels
4208 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4211 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4212 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4214 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4217 char key[128], value[MAX_INPUTLINE];
4219 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4220 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4221 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4224 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4225 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4226 loadmodel->brush.entities[l->filelen] = 0;
4227 data = loadmodel->brush.entities;
4228 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4229 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4230 loadmodel->brushq3.deluxemapping = false;
4231 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4235 if (!COM_ParseToken_Simple(&data, false, false))
4237 if (com_token[0] == '}')
4238 break; // end of worldspawn
4239 if (com_token[0] == '_')
4240 strlcpy(key, com_token + 1, sizeof(key));
4242 strlcpy(key, com_token, sizeof(key));
4243 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4244 key[strlen(key)-1] = 0;
4245 if (!COM_ParseToken_Simple(&data, false, false))
4247 strlcpy(value, com_token, sizeof(value));
4248 if (!strcmp("gridsize", key))
4250 #if _MSC_VER >= 1400
4251 #define sscanf sscanf_s
4253 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4254 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4256 else if (!strcmp("deluxeMaps", key))
4258 if (!strcmp(com_token, "1"))
4260 loadmodel->brushq3.deluxemapping = true;
4261 loadmodel->brushq3.deluxemapping_modelspace = true;
4263 else if (!strcmp(com_token, "2"))
4265 loadmodel->brushq3.deluxemapping = true;
4266 loadmodel->brushq3.deluxemapping_modelspace = false;
4273 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4279 in = (q3dtexture_t *)(mod_base + l->fileofs);
4280 if (l->filelen % sizeof(*in))
4281 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4282 count = l->filelen / sizeof(*in);
4283 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4285 loadmodel->data_textures = out;
4286 loadmodel->num_textures = count;
4287 loadmodel->num_texturesperskin = loadmodel->num_textures;
4289 for (i = 0;i < count;i++)
4291 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4292 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4293 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4296 if (cls.state == ca_dedicated)
4299 for (i = 0;i < count;i++, in++, out++)
4300 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4303 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4309 in = (q3dplane_t *)(mod_base + l->fileofs);
4310 if (l->filelen % sizeof(*in))
4311 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4312 count = l->filelen / sizeof(*in);
4313 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4315 loadmodel->brush.data_planes = out;
4316 loadmodel->brush.num_planes = count;
4318 for (i = 0;i < count;i++, in++, out++)
4320 out->normal[0] = LittleFloat(in->normal[0]);
4321 out->normal[1] = LittleFloat(in->normal[1]);
4322 out->normal[2] = LittleFloat(in->normal[2]);
4323 out->dist = LittleFloat(in->dist);
4328 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4331 q3mbrushside_t *out;
4334 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4335 if (l->filelen % sizeof(*in))
4336 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4337 count = l->filelen / sizeof(*in);
4338 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4340 loadmodel->brush.data_brushsides = out;
4341 loadmodel->brush.num_brushsides = count;
4343 for (i = 0;i < count;i++, in++, out++)
4345 n = LittleLong(in->planeindex);
4346 if (n < 0 || n >= loadmodel->brush.num_planes)
4347 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4348 out->plane = loadmodel->brush.data_planes + n;
4349 n = LittleLong(in->textureindex);
4350 if (n < 0 || n >= loadmodel->num_textures)
4351 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4352 out->texture = loadmodel->data_textures + n;
4356 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4358 q3dbrushside_ig_t *in;
4359 q3mbrushside_t *out;
4362 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4363 if (l->filelen % sizeof(*in))
4364 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4365 count = l->filelen / sizeof(*in);
4366 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4368 loadmodel->brush.data_brushsides = out;
4369 loadmodel->brush.num_brushsides = count;
4371 for (i = 0;i < count;i++, in++, out++)
4373 n = LittleLong(in->planeindex);
4374 if (n < 0 || n >= loadmodel->brush.num_planes)
4375 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4376 out->plane = loadmodel->brush.data_planes + n;
4377 n = LittleLong(in->textureindex);
4378 if (n < 0 || n >= loadmodel->num_textures)
4379 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4380 out->texture = loadmodel->data_textures + n;
4384 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4388 int i, j, n, c, count, maxplanes;
4389 colplanef_t *planes;
4391 in = (q3dbrush_t *)(mod_base + l->fileofs);
4392 if (l->filelen % sizeof(*in))
4393 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4394 count = l->filelen / sizeof(*in);
4395 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4397 loadmodel->brush.data_brushes = out;
4398 loadmodel->brush.num_brushes = count;
4403 for (i = 0;i < count;i++, in++, out++)
4405 n = LittleLong(in->firstbrushside);
4406 c = LittleLong(in->numbrushsides);
4407 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4408 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4409 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4410 out->numbrushsides = c;
4411 n = LittleLong(in->textureindex);
4412 if (n < 0 || n >= loadmodel->num_textures)
4413 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4414 out->texture = loadmodel->data_textures + n;
4416 // make a list of mplane_t structs to construct a colbrush from
4417 if (maxplanes < out->numbrushsides)
4419 maxplanes = out->numbrushsides;
4422 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4424 for (j = 0;j < out->numbrushsides;j++)
4426 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4427 planes[j].dist = out->firstbrushside[j].plane->dist;
4428 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4429 planes[j].texture = out->firstbrushside[j].texture;
4431 // make the colbrush from the planes
4432 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4434 // this whole loop can take a while (e.g. on redstarrepublic4)
4435 CL_KeepaliveMessage(false);
4441 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4447 in = (q3deffect_t *)(mod_base + l->fileofs);
4448 if (l->filelen % sizeof(*in))
4449 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4450 count = l->filelen / sizeof(*in);
4451 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4453 loadmodel->brushq3.data_effects = out;
4454 loadmodel->brushq3.num_effects = count;
4456 for (i = 0;i < count;i++, in++, out++)
4458 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4459 n = LittleLong(in->brushindex);
4460 if (n >= loadmodel->brush.num_brushes)
4462 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4465 out->brushindex = n;
4466 out->unknown = LittleLong(in->unknown);
4470 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4475 in = (q3dvertex_t *)(mod_base + l->fileofs);
4476 if (l->filelen % sizeof(*in))
4477 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4478 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4479 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4480 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4481 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4482 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4483 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4485 for (i = 0;i < count;i++, in++)
4487 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4488 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4489 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4490 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4491 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4492 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4493 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4494 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4495 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4496 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4497 // svector/tvector are calculated later in face loading
4498 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4499 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4500 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4501 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4505 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4511 in = (int *)(mod_base + l->fileofs);
4512 if (l->filelen % sizeof(int[3]))
4513 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4514 count = l->filelen / sizeof(*in);
4515 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4517 loadmodel->brushq3.num_triangles = count / 3;
4518 loadmodel->brushq3.data_element3i = out;
4520 for (i = 0;i < count;i++, in++, out++)
4522 *out = LittleLong(*in);
4523 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4525 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4526 if(!loadmodel->brushq3.num_vertices)
4527 Host_Error("Mod_Q1BSP_LoadTrianglles: %s has triangles but no vertexes, cannot fix\n", loadmodel->name);
4533 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4535 q3dlightmap_t *input_pointer;
4536 int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4539 unsigned char *convertedpixels;
4540 char mapname[MAX_QPATH];
4541 int size, bytesperpixel, rgbmap[3];
4543 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4545 // defaults for q3bsp
4552 loadmodel->brushq3.lightmapsize = 128;
4554 if (cls.state == ca_dedicated)
4557 if(mod_q3bsp_nolightmaps.integer)
4563 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4564 if (developer_loading.integer)
4565 Con_Printf("Using internal lightmaps\n");
4566 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4567 if (l->filelen % sizeof(*input_pointer))
4568 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4569 count = l->filelen / sizeof(*input_pointer);
4570 for(i = 0; i < count; ++i)
4571 inpixels[i] = input_pointer[i].rgb;
4575 // no internal lightmaps
4576 // try external lightmaps
4577 if (developer_loading.integer)
4578 Con_Printf("Using external lightmaps\n");
4579 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4580 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4584 // using EXTERNAL lightmaps instead
4585 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4587 Mem_Free(inpixels[0]);
4588 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4598 for(count = 1; ; ++count)
4600 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4601 if(!inpixels[count])
4602 break; // we got all of them
4603 if(image_width != size || image_height != size)
4605 for(i = 0; i <= count; ++i)
4606 Mem_Free(inpixels[i]);
4607 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4612 convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4613 loadmodel->brushq3.lightmapsize = size;
4614 loadmodel->brushq3.num_originallightmaps = count;
4616 // now check the surfaces to see if any of them index an odd numbered
4617 // lightmap, if so this is not a deluxemapped bsp file
4619 // also check what lightmaps are actually used, because q3map2 sometimes
4620 // (always?) makes an unused one at the end, which
4621 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4622 // reason when only one lightmap is used, which can throw off the
4623 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4624 // to see if the second lightmap is blank, if so it is not deluxemapped.
4625 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4626 // in Mod_Q3BSP_LoadEntities was failed
4627 if (!loadmodel->brushq3.deluxemapping)
4629 loadmodel->brushq3.deluxemapping = !(count & 1);
4630 loadmodel->brushq3.deluxemapping_modelspace = true;
4632 if (loadmodel->brushq3.deluxemapping)
4634 int facecount = faceslump->filelen / sizeof(q3dface_t);
4635 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4636 for (i = 0;i < facecount;i++)
4638 j = LittleLong(faces[i].lightmapindex);
4641 endlightmap = max(endlightmap, j + 1);
4642 if ((j & 1) || j + 1 >= count)
4644 loadmodel->brushq3.deluxemapping = false;
4651 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4652 // reason when only one lightmap is used, which can throw off the
4653 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4654 // to see if the second lightmap is blank, if so it is not deluxemapped.
4656 // further research has shown q3map2 sometimes creates a deluxemap and two
4657 // blank lightmaps, which must be handled properly as well
4658 if (endlightmap == 1 && count > 1)
4661 for (i = 0;i < size*size;i++)
4663 if (c[bytesperpixel*i + rgbmap[0]])
4665 if (c[bytesperpixel*i + rgbmap[1]])
4667 if (c[bytesperpixel*i + rgbmap[2]])
4672 // all pixels in the unused lightmap were black...
4673 loadmodel->brushq3.deluxemapping = false;
4678 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4680 // figure out what the most reasonable merge power is within limits
4682 loadmodel->brushq3.num_lightmapmergepower = 0;
4684 for(i = 0; (128 << i) < size; ++i)
4686 // i is now 0 for 128, 1 for 256, etc
4688 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++)
4689 loadmodel->brushq3.num_lightmapmergepower = power;
4691 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4693 loadmodel->brushq3.num_mergedlightmaps = ((count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4694 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4695 if (loadmodel->brushq3.deluxemapping)
4696 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4698 // allocate a texture pool if we need it
4699 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4700 loadmodel->texturepool = R_AllocTexturePool();
4702 power = loadmodel->brushq3.num_lightmapmergepower;
4704 mask = (1 << power) - 1;
4705 for (i = 0;i < count;i++)
4707 // figure out which merged lightmap texture this fits into
4708 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4709 for (k = 0;k < size*size;k++)
4711 convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4712 convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4713 convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4714 convertedpixels[k*4+3] = 255;
4716 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4718 // if the lightmap has not been allocated yet, create it
4719 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4721 // create a lightmap only as large as necessary to hold the
4722 // remaining size*size blocks
4723 // if there are multiple merged lightmap textures then they will
4724 // all be full size except the last one which may be smaller
4725 // because it only needs to the remaining blocks, and it will often
4726 // be odd sizes like 2048x512 due to only being 25% full or so.
4727 j = (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) - (lightmapindex << power2);
4728 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4730 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4732 if (developer_loading.integer)
4733 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);
4734 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);
4735 if (loadmodel->brushq3.data_deluxemaps)
4736 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);
4738 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4739 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4740 j = (i >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) & ((1 << power2) - 1);
4741 if (loadmodel->brushq3.deluxemapping && (i & 1))
4742 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4744 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4748 // figure out which merged lightmap texture this fits into
4749 if (loadmodel->brushq3.deluxemapping && (i & 1))
4750 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);
4752 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);
4756 Mem_Free(convertedpixels);
4759 for(i = 0; i < count; ++i)
4760 Mem_Free(inpixels[i]);
4764 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4771 *collisionstride = stride;
4772 cnt = (num_triangles + stride - 1) / stride;
4773 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4774 for(j = 0; j < cnt; ++j)
4776 mins = &((*collisionbbox6f)[6 * j + 0]);
4777 maxs = &((*collisionbbox6f)[6 * j + 3]);
4778 for(k = 0; k < stride; ++k)
4780 tri = j * stride + k;
4781 if(tri >= num_triangles)
4783 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4784 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4785 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4786 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4787 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4788 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4789 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4790 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4791 if(vert[0] < mins[0]) mins[0] = vert[0];
4792 if(vert[1] < mins[1]) mins[1] = vert[1];
4793 if(vert[2] < mins[2]) mins[2] = vert[2];
4794 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4795 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4796 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4797 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
4798 if(vert[0] < mins[0]) mins[0] = vert[0];
4799 if(vert[1] < mins[1]) mins[1] = vert[1];
4800 if(vert[2] < mins[2]) mins[2] = vert[2];
4801 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4802 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4803 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4809 *collisionstride = 0;
4810 *collisionbbox6f = NULL;
4814 typedef struct patchtess_s
4818 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4821 float *originalvertex3f;
4824 #define PATCHTESS_SAME_LODGROUP(a,b) \
4826 (a).lodgroup[0] == (b).lodgroup[0] && \
4827 (a).lodgroup[1] == (b).lodgroup[1] && \
4828 (a).lodgroup[2] == (b).lodgroup[2] && \
4829 (a).lodgroup[3] == (b).lodgroup[3] && \
4830 (a).lodgroup[4] == (b).lodgroup[4] && \
4831 (a).lodgroup[5] == (b).lodgroup[5] \
4834 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4836 q3dface_t *in, *oldin;
4837 msurface_t *out, *oldout;
4838 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;
4839 float lightmaptcbase[2], lightmaptcscale[2];
4840 //int *originalelement3i;
4841 //int *originalneighbor3i;
4842 float *originalvertex3f;
4843 //float *originalsvector3f;
4844 //float *originaltvector3f;
4845 float *originalnormal3f;
4846 float *originalcolor4f;
4847 float *originaltexcoordtexture2f;
4848 float *originaltexcoordlightmap2f;
4850 patchtess_t *patchtess = NULL;
4851 int patchtesscount = 0;
4854 in = (q3dface_t *)(mod_base + l->fileofs);
4855 if (l->filelen % sizeof(*in))
4856 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4857 count = l->filelen / sizeof(*in);
4858 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4860 loadmodel->data_surfaces = out;
4861 loadmodel->num_surfaces = count;
4864 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4872 for (;i < count;i++, in++, out++)
4874 // check face type first
4875 type = LittleLong(in->type);
4876 if (type != Q3FACETYPE_FLAT
4877 && type != Q3FACETYPE_PATCH
4878 && type != Q3FACETYPE_MESH
4879 && type != Q3FACETYPE_FLARE)
4881 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4885 n = LittleLong(in->textureindex);
4886 if (n < 0 || n >= loadmodel->num_textures)
4888 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4891 out->texture = loadmodel->data_textures + n;
4892 n = LittleLong(in->effectindex);
4893 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4895 if (developer.integer >= 100)
4896 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4902 out->effect = loadmodel->brushq3.data_effects + n;
4904 if (cls.state != ca_dedicated)
4906 out->lightmaptexture = NULL;
4907 out->deluxemaptexture = r_texture_blanknormalmap;
4908 n = LittleLong(in->lightmapindex);
4911 else if (n >= loadmodel->brushq3.num_originallightmaps)
4913 if(loadmodel->brushq3.num_originallightmaps != 0)
4914 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4919 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4920 if (loadmodel->brushq3.deluxemapping)
4921 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4925 firstvertex = LittleLong(in->firstvertex);
4926 numvertices = LittleLong(in->numvertices);
4927 firstelement = LittleLong(in->firstelement);
4928 numtriangles = LittleLong(in->numelements) / 3;
4929 if (numtriangles * 3 != LittleLong(in->numelements))
4931 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));
4934 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4936 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);
4939 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4941 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);
4946 case Q3FACETYPE_FLAT:
4947 case Q3FACETYPE_MESH:
4948 // no processing necessary
4950 case Q3FACETYPE_PATCH:
4951 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4952 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4953 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))
4955 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4958 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4960 // convert patch to Q3FACETYPE_MESH
4961 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4962 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4963 // bound to user settings
4964 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4965 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4966 // bound to sanity settings
4967 xtess = bound(0, xtess, 1024);
4968 ytess = bound(0, ytess, 1024);
4970 // lower quality collision patches! Same procedure as before, but different cvars
4971 // convert patch to Q3FACETYPE_MESH
4972 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4973 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4974 // bound to user settings
4975 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
4976 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
4977 // bound to sanity settings
4978 cxtess = bound(0, cxtess, 1024);
4979 cytess = bound(0, cytess, 1024);
4981 // store it for the LOD grouping step
4982 patchtess[patchtesscount].info.xsize = patchsize[0];
4983 patchtess[patchtesscount].info.ysize = patchsize[1];
4984 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
4985 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
4986 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
4987 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
4989 patchtess[patchtesscount].surface_id = i;
4990 patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
4991 patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
4992 patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
4993 patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
4994 patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
4995 patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
4996 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
4999 case Q3FACETYPE_FLARE:
5000 if (developer.integer >= 100)
5001 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5005 out->num_vertices = numvertices;
5006 out->num_triangles = numtriangles;
5007 meshvertices += out->num_vertices;
5008 meshtriangles += out->num_triangles;
5011 // Fix patches tesselations so that they make no seams
5015 for(i = 0; i < patchtesscount; ++i)
5017 for(j = i+1; j < patchtesscount; ++j)
5019 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5022 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5029 // Calculate resulting number of triangles
5030 for(i = 0; i < patchtesscount; ++i)
5032 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5033 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5034 numvertices = finalwidth * finalheight;
5035 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5037 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5038 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5039 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5040 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5046 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5049 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5051 if (out->num_vertices < 3 || out->num_triangles < 1)
5054 type = LittleLong(in->type);
5055 firstvertex = LittleLong(in->firstvertex);
5056 firstelement = LittleLong(in->firstelement);
5057 out->num_firstvertex = meshvertices;
5058 out->num_firsttriangle = meshtriangles;
5061 case Q3FACETYPE_FLAT:
5062 case Q3FACETYPE_MESH:
5063 // no processing necessary, except for lightmap merging
5064 for (j = 0;j < out->num_vertices;j++)
5066 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5067 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5068 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5069 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5070 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5071 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5072 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5073 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5074 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5075 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5076 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5077 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5078 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5079 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5081 for (j = 0;j < out->num_triangles*3;j++)
5082 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5084 case Q3FACETYPE_PATCH:
5085 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5086 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5087 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5088 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5089 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5090 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5091 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5093 xtess = ytess = cxtess = cytess = -1;
5094 for(j = 0; j < patchtesscount; ++j)
5095 if(patchtess[j].surface_id == i)
5097 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5098 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5099 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5100 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5105 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5106 xtess = ytess = cxtess = cytess = 0;
5109 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5110 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5111 finalvertices = finalwidth * finalheight;
5112 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5113 type = Q3FACETYPE_MESH;
5114 // generate geometry
5115 // (note: normals are skipped because they get recalculated)
5116 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5117 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5118 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5119 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5120 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5121 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5123 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);
5125 if (developer.integer >= 100)
5127 if (out->num_triangles < finaltriangles)
5128 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);
5130 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);
5132 // q3map does not put in collision brushes for curves... ugh
5133 // build the lower quality collision geometry
5134 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5135 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5136 finalvertices = finalwidth * finalheight;
5137 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5139 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5140 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5141 out->num_collisionvertices = finalvertices;
5142 out->num_collisiontriangles = finaltriangles;
5143 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5144 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
5146 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5147 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
5149 oldnumtriangles = out->num_triangles;
5150 oldnumtriangles2 = out->num_collisiontriangles;
5151 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
5153 // now optimize the collision mesh by finding triangle bboxes...
5154 Mod_Q3BSP_BuildBBoxes(out->data_collisionelement3i, out->num_collisiontriangles, out->data_collisionvertex3f, &out->data_collisionbbox6f, &out->num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5155 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);
5157 if (developer.integer >= 100)
5158 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);
5163 meshvertices += out->num_vertices;
5164 meshtriangles += out->num_triangles;
5165 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5166 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)
5168 if (invalidelements)
5170 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);
5171 for (j = 0;j < out->num_triangles * 3;j++)
5173 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5174 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)
5175 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5179 // calculate a bounding box
5180 VectorClear(out->mins);
5181 VectorClear(out->maxs);
5182 if (out->num_vertices)
5184 if (cls.state != ca_dedicated && out->lightmaptexture)
5186 // figure out which part of the merged lightmap this fits into
5187 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5188 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5189 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5190 lightmapindex &= mergewidth * mergeheight - 1;
5191 lightmaptcscale[0] = 1.0f / mergewidth;
5192 lightmaptcscale[1] = 1.0f / mergeheight;
5193 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5194 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5195 // modify the lightmap texcoords to match this region of the merged lightmap
5196 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5198 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5199 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5202 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5203 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5204 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5206 out->mins[0] = min(out->mins[0], v[0]);
5207 out->maxs[0] = max(out->maxs[0], v[0]);
5208 out->mins[1] = min(out->mins[1], v[1]);
5209 out->maxs[1] = max(out->maxs[1], v[1]);
5210 out->mins[2] = min(out->mins[2], v[2]);
5211 out->maxs[2] = max(out->maxs[2], v[2]);
5213 out->mins[0] -= 1.0f;
5214 out->mins[1] -= 1.0f;
5215 out->mins[2] -= 1.0f;
5216 out->maxs[0] += 1.0f;
5217 out->maxs[1] += 1.0f;
5218 out->maxs[2] += 1.0f;
5220 // set lightmap styles for consistency with q1bsp
5221 //out->lightmapinfo->styles[0] = 0;
5222 //out->lightmapinfo->styles[1] = 255;
5223 //out->lightmapinfo->styles[2] = 255;
5224 //out->lightmapinfo->styles[3] = 255;
5229 for (;i < count;i++, out++)
5231 if(out->num_vertices && out->num_triangles)
5233 if(out->num_vertices == 0)
5234 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5235 if(out->num_triangles == 0)
5236 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5239 // for per pixel lighting
5240 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);
5242 // generate ushort elements array if possible
5243 if (loadmodel->surfmesh.data_element3s)
5244 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5245 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5247 // free the no longer needed vertex data
5248 loadmodel->brushq3.num_vertices = 0;
5249 if (loadmodel->brushq3.data_vertex3f)
5250 Mem_Free(loadmodel->brushq3.data_vertex3f);
5251 loadmodel->brushq3.data_vertex3f = NULL;
5252 loadmodel->brushq3.data_normal3f = NULL;
5253 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5254 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5255 loadmodel->brushq3.data_color4f = NULL;
5256 // free the no longer needed triangle data
5257 loadmodel->brushq3.num_triangles = 0;
5258 if (loadmodel->brushq3.data_element3i)
5259 Mem_Free(loadmodel->brushq3.data_element3i);
5260 loadmodel->brushq3.data_element3i = NULL;
5263 Mem_Free(patchtess);
5266 static void Mod_Q3BSP_LoadModels(lump_t *l)
5270 int i, j, n, c, count;
5272 in = (q3dmodel_t *)(mod_base + l->fileofs);
5273 if (l->filelen % sizeof(*in))
5274 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5275 count = l->filelen / sizeof(*in);
5276 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5278 loadmodel->brushq3.data_models = out;
5279 loadmodel->brushq3.num_models = count;
5281 for (i = 0;i < count;i++, in++, out++)
5283 for (j = 0;j < 3;j++)
5285 out->mins[j] = LittleFloat(in->mins[j]);
5286 out->maxs[j] = LittleFloat(in->maxs[j]);
5288 n = LittleLong(in->firstface);
5289 c = LittleLong(in->numfaces);
5290 if (n < 0 || n + c > loadmodel->num_surfaces)
5291 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5294 n = LittleLong(in->firstbrush);
5295 c = LittleLong(in->numbrushes);
5296 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5297 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5298 out->firstbrush = n;
5299 out->numbrushes = c;
5303 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5309 in = (int *)(mod_base + l->fileofs);
5310 if (l->filelen % sizeof(*in))
5311 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5312 count = l->filelen / sizeof(*in);
5313 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5315 loadmodel->brush.data_leafbrushes = out;
5316 loadmodel->brush.num_leafbrushes = count;
5318 for (i = 0;i < count;i++, in++, out++)
5320 n = LittleLong(*in);
5321 if (n < 0 || n >= loadmodel->brush.num_brushes)
5322 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5327 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5333 in = (int *)(mod_base + l->fileofs);
5334 if (l->filelen % sizeof(*in))
5335 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5336 count = l->filelen / sizeof(*in);
5337 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5339 loadmodel->brush.data_leafsurfaces = out;
5340 loadmodel->brush.num_leafsurfaces = count;
5342 for (i = 0;i < count;i++, in++, out++)
5344 n = LittleLong(*in);
5345 if (n < 0 || n >= loadmodel->num_surfaces)
5346 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5351 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5355 int i, j, n, c, count;
5357 in = (q3dleaf_t *)(mod_base + l->fileofs);
5358 if (l->filelen % sizeof(*in))
5359 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5360 count = l->filelen / sizeof(*in);
5361 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5363 loadmodel->brush.data_leafs = out;
5364 loadmodel->brush.num_leafs = count;
5366 for (i = 0;i < count;i++, in++, out++)
5370 out->clusterindex = LittleLong(in->clusterindex);
5371 out->areaindex = LittleLong(in->areaindex);
5372 for (j = 0;j < 3;j++)
5374 // yes the mins/maxs are ints
5375 out->mins[j] = LittleLong(in->mins[j]) - 1;
5376 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5378 n = LittleLong(in->firstleafface);
5379 c = LittleLong(in->numleaffaces);
5380 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5381 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5382 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5383 out->numleafsurfaces = c;
5384 n = LittleLong(in->firstleafbrush);
5385 c = LittleLong(in->numleafbrushes);
5386 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5387 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5388 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5389 out->numleafbrushes = c;
5393 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5399 in = (q3dnode_t *)(mod_base + l->fileofs);
5400 if (l->filelen % sizeof(*in))
5401 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5402 count = l->filelen / sizeof(*in);
5403 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5405 loadmodel->brush.data_nodes = out;
5406 loadmodel->brush.num_nodes = count;
5408 for (i = 0;i < count;i++, in++, out++)
5411 n = LittleLong(in->planeindex);
5412 if (n < 0 || n >= loadmodel->brush.num_planes)
5413 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5414 out->plane = loadmodel->brush.data_planes + n;
5415 for (j = 0;j < 2;j++)
5417 n = LittleLong(in->childrenindex[j]);
5420 if (n >= loadmodel->brush.num_nodes)
5421 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5422 out->children[j] = loadmodel->brush.data_nodes + n;
5427 if (n >= loadmodel->brush.num_leafs)
5428 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5429 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5432 for (j = 0;j < 3;j++)
5434 // yes the mins/maxs are ints
5435 out->mins[j] = LittleLong(in->mins[j]) - 1;
5436 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5440 // set the parent pointers
5441 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5444 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5447 q3dlightgrid_t *out;
5450 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5451 if (l->filelen % sizeof(*in))
5452 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5453 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5454 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5455 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5456 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5457 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5458 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5459 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5460 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5461 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5462 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5463 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5464 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5465 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5466 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]);
5467 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]);
5469 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5472 if (l->filelen < count * (int)sizeof(*in))
5473 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]);
5474 if (l->filelen != count * (int)sizeof(*in))
5475 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5476 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5477 loadmodel->brushq3.data_lightgrid = out;
5478 loadmodel->brushq3.num_lightgrid = count;
5479 // no swapping or validation necessary
5480 memcpy(out, in, count * (int)sizeof(*out));
5484 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5489 if (l->filelen == 0)
5492 // unvised maps often have cluster indices even without pvs, so check
5493 // leafs to find real number of clusters
5494 loadmodel->brush.num_pvsclusters = 1;
5495 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5496 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5499 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5500 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5501 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5502 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5506 in = (q3dpvs_t *)(mod_base + l->fileofs);
5508 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5510 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5511 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5512 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5513 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5514 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5515 if (l->filelen < totalchains + (int)sizeof(*in))
5516 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);
5518 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5519 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5522 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5524 int i, j, k, index[3];
5525 float transformed[3], blend1, blend2, blend, stylescale;
5526 q3dlightgrid_t *a, *s;
5528 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5529 stylescale = r_refdef.scene.rtlightstylevalue[0];
5531 if (!model->brushq3.num_lightgrid)
5533 ambientcolor[0] = stylescale;
5534 ambientcolor[1] = stylescale;
5535 ambientcolor[2] = stylescale;
5539 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5540 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5541 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5542 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5543 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5544 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5545 index[0] = (int)floor(transformed[0]);
5546 index[1] = (int)floor(transformed[1]);
5547 index[2] = (int)floor(transformed[2]);
5548 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5550 // now lerp the values
5551 VectorClear(diffusenormal);
5552 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5553 for (k = 0;k < 2;k++)
5555 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5556 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5558 for (j = 0;j < 2;j++)
5560 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5561 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5563 for (i = 0;i < 2;i++)
5565 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5566 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5568 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5569 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5570 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5571 // this uses the mod_md3_sin table because the values are
5572 // already in the 0-255 range, the 64+ bias fetches a cosine
5573 // instead of a sine value
5574 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5575 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5576 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5577 //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)));
5582 // normalize the light direction before turning
5583 VectorNormalize(diffusenormal);
5584 //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]);
5587 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5590 double midf, mid[3];
5596 // find the point distances
5597 mplane_t *plane = node->plane;
5598 if (plane->type < 3)
5600 t1 = p1[plane->type] - plane->dist;
5601 t2 = p2[plane->type] - plane->dist;
5605 t1 = DotProduct (plane->normal, p1) - plane->dist;
5606 t2 = DotProduct (plane->normal, p2) - plane->dist;
5613 node = node->children[1];
5622 node = node->children[0];
5628 midf = t1 / (t1 - t2);
5629 VectorLerp(p1, midf, p2, mid);
5631 // recurse both sides, front side first
5632 // return 2 if empty is followed by solid (hit something)
5633 // do not return 2 if both are solid or both empty,
5634 // or if start is solid and end is empty
5635 // as these degenerate cases usually indicate the eye is in solid and
5636 // should see the target point anyway
5637 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
5640 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5645 return ((mleaf_t *)node)->clusterindex < 0;
5648 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5650 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5653 model->TraceLine(model, 0, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5654 return trace.fraction == 1;
5658 double tracestart[3], traceend[3];
5659 VectorCopy(start, tracestart);
5660 VectorCopy(end, traceend);
5661 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5665 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5670 // find which leaf the point is in
5672 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5673 // point trace the brushes
5674 leaf = (mleaf_t *)node;
5675 for (i = 0;i < leaf->numleafbrushes;i++)
5677 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5678 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5680 brush->markframe = markframe;
5681 Collision_TracePointBrushFloat(trace, point, brush);
5684 // can't do point traces on curves (they have no thickness)
5687 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)
5689 int i, startside, endside;
5690 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5692 msurface_t *surface;
5695 // walk the tree until we hit a leaf, recursing for any split cases
5698 // abort if this part of the bsp tree can not be hit by this trace
5699 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5701 plane = node->plane;
5702 // axial planes are much more common than non-axial, so an optimized
5703 // axial case pays off here
5704 if (plane->type < 3)
5706 dist1 = start[plane->type] - plane->dist;
5707 dist2 = end[plane->type] - plane->dist;
5711 dist1 = DotProduct(start, plane->normal) - plane->dist;
5712 dist2 = DotProduct(end, plane->normal) - plane->dist;
5714 startside = dist1 < 0;
5715 endside = dist2 < 0;
5716 if (startside == endside)
5718 // most of the time the line fragment is on one side of the plane
5719 node = node->children[startside];
5723 // line crosses node plane, split the line
5724 dist1 = PlaneDiff(linestart, plane);
5725 dist2 = PlaneDiff(lineend, plane);
5726 midfrac = dist1 / (dist1 - dist2);
5727 VectorLerp(linestart, midfrac, lineend, mid);
5728 // take the near side first
5729 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5730 // if we found an impact on the front side, don't waste time
5731 // exploring the far side
5732 if (midfrac <= trace->realfraction)
5733 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5737 // abort if this part of the bsp tree can not be hit by this trace
5738 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5741 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5742 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5743 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5744 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5745 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5746 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5747 // line trace the brushes
5748 leaf = (mleaf_t *)node;
5749 for (i = 0;i < leaf->numleafbrushes;i++)
5751 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5752 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5754 brush->markframe = markframe;
5755 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5758 // can't do point traces on curves (they have no thickness)
5759 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5761 // line trace the curves
5762 for (i = 0;i < leaf->numleafsurfaces;i++)
5764 surface = model->data_surfaces + leaf->firstleafsurface[i];
5765 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5767 surface->collisionmarkframe = markframe;
5768 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);
5774 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)
5780 msurface_t *surface;
5782 float nodesegmentmins[3], nodesegmentmaxs[3];
5783 // walk the tree until we hit a leaf, recursing for any split cases
5786 // abort if this part of the bsp tree can not be hit by this trace
5787 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5789 plane = node->plane;
5790 // axial planes are much more common than non-axial, so an optimized
5791 // axial case pays off here
5792 if (plane->type < 3)
5794 // this is an axial plane, compare bounding box directly to it and
5795 // recurse sides accordingly
5796 // recurse down node sides
5797 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5798 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5799 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5800 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5804 // this is a non-axial plane, so check if the start and end boxes
5805 // are both on one side of the plane to handle 'diagonal' cases
5806 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5810 // segment crosses plane
5811 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5814 // if sides == 0 then the trace itself is bogus (Not A Number values),
5815 // in this case we simply pretend the trace hit nothing
5817 return; // ERROR: NAN bounding box!
5818 // take whichever side the segment box is on
5819 node = node->children[sides - 1];
5821 // abort if this part of the bsp tree can not be hit by this trace
5822 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5824 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5825 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5826 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5827 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5828 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5829 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5831 leaf = (mleaf_t *)node;
5832 for (i = 0;i < leaf->numleafbrushes;i++)
5834 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5835 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5837 brush->markframe = markframe;
5838 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5841 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5843 for (i = 0;i < leaf->numleafsurfaces;i++)
5845 surface = model->data_surfaces + leaf->firstleafsurface[i];
5846 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5848 surface->collisionmarkframe = markframe;
5849 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);
5855 static int markframe = 0;
5857 static void Mod_Q3BSP_TracePoint(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
5861 memset(trace, 0, sizeof(*trace));
5862 trace->fraction = 1;
5863 trace->realfraction = 1;
5864 trace->hitsupercontentsmask = hitsupercontentsmask;
5865 if (model->brush.submodel)
5867 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5868 if (brush->colbrushf)
5869 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5872 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5875 static void Mod_Q3BSP_TraceLine(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
5878 float segmentmins[3], segmentmaxs[3];
5879 msurface_t *surface;
5882 if (VectorCompare(start, end))
5884 Mod_Q3BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
5888 memset(trace, 0, sizeof(*trace));
5889 trace->fraction = 1;
5890 trace->realfraction = 1;
5891 trace->hitsupercontentsmask = hitsupercontentsmask;
5892 segmentmins[0] = min(start[0], end[0]) - 1;
5893 segmentmins[1] = min(start[1], end[1]) - 1;
5894 segmentmins[2] = min(start[2], end[2]) - 1;
5895 segmentmaxs[0] = max(start[0], end[0]) + 1;
5896 segmentmaxs[1] = max(start[1], end[1]) + 1;
5897 segmentmaxs[2] = max(start[2], end[2]) + 1;
5898 if (model->brush.submodel)
5900 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5901 if (brush->colbrushf)
5902 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5903 if (mod_q3bsp_curves_collisions.integer)
5904 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5905 if (surface->num_collisiontriangles)
5906 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);
5909 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5912 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)
5915 float segmentmins[3], segmentmaxs[3];
5916 msurface_t *surface;
5918 colbrushf_t *thisbrush_start, *thisbrush_end;
5919 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5921 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
5923 vec3_t shiftstart, shiftend;
5924 VectorAdd(start, boxmins, shiftstart);
5925 VectorAdd(end, boxmins, shiftend);
5926 if (VectorCompare(start, end))
5927 Mod_Q3BSP_TracePoint(model, frame, trace, shiftstart, hitsupercontentsmask);
5930 Mod_Q3BSP_TraceLine(model, frame, trace, shiftstart, shiftend, hitsupercontentsmask);
5931 VectorSubtract(trace->endpos, boxmins, trace->endpos);
5936 // box trace, performed as brush trace
5937 memset(trace, 0, sizeof(*trace));
5938 trace->fraction = 1;
5939 trace->realfraction = 1;
5940 trace->hitsupercontentsmask = hitsupercontentsmask;
5941 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5942 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5943 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5944 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5945 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5946 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5947 VectorAdd(start, boxmins, boxstartmins);
5948 VectorAdd(start, boxmaxs, boxstartmaxs);
5949 VectorAdd(end, boxmins, boxendmins);
5950 VectorAdd(end, boxmaxs, boxendmaxs);
5951 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5952 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5953 if (model->brush.submodel)
5955 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5956 if (brush->colbrushf)
5957 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5958 if (mod_q3bsp_curves_collisions.integer)
5959 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5960 if (surface->num_collisiontriangles)
5961 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);
5964 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5967 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5970 int supercontents = 0;
5972 // test if the point is inside each brush
5973 if (model->brush.submodel)
5975 // submodels are effectively one leaf
5976 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5977 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5978 supercontents |= brush->colbrushf->supercontents;
5982 mnode_t *node = model->brush.data_nodes;
5984 // find which leaf the point is in
5986 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5987 leaf = (mleaf_t *)node;
5988 // now check the brushes in the leaf
5989 for (i = 0;i < leaf->numleafbrushes;i++)
5991 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5992 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5993 supercontents |= brush->colbrushf->supercontents;
5996 return supercontents;
5999 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
6001 int supercontents = 0;
6002 if (nativecontents & CONTENTSQ3_SOLID)
6003 supercontents |= SUPERCONTENTS_SOLID;
6004 if (nativecontents & CONTENTSQ3_WATER)
6005 supercontents |= SUPERCONTENTS_WATER;
6006 if (nativecontents & CONTENTSQ3_SLIME)
6007 supercontents |= SUPERCONTENTS_SLIME;
6008 if (nativecontents & CONTENTSQ3_LAVA)
6009 supercontents |= SUPERCONTENTS_LAVA;
6010 if (nativecontents & CONTENTSQ3_BODY)
6011 supercontents |= SUPERCONTENTS_BODY;
6012 if (nativecontents & CONTENTSQ3_CORPSE)
6013 supercontents |= SUPERCONTENTS_CORPSE;
6014 if (nativecontents & CONTENTSQ3_NODROP)
6015 supercontents |= SUPERCONTENTS_NODROP;
6016 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
6017 supercontents |= SUPERCONTENTS_PLAYERCLIP;
6018 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
6019 supercontents |= SUPERCONTENTS_MONSTERCLIP;
6020 if (nativecontents & CONTENTSQ3_DONOTENTER)
6021 supercontents |= SUPERCONTENTS_DONOTENTER;
6022 if (nativecontents & CONTENTSQ3_BOTCLIP)
6023 supercontents |= SUPERCONTENTS_BOTCLIP;
6024 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
6025 supercontents |= SUPERCONTENTS_OPAQUE;
6026 return supercontents;
6029 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
6031 int nativecontents = 0;
6032 if (supercontents & SUPERCONTENTS_SOLID)
6033 nativecontents |= CONTENTSQ3_SOLID;
6034 if (supercontents & SUPERCONTENTS_WATER)
6035 nativecontents |= CONTENTSQ3_WATER;
6036 if (supercontents & SUPERCONTENTS_SLIME)
6037 nativecontents |= CONTENTSQ3_SLIME;
6038 if (supercontents & SUPERCONTENTS_LAVA)
6039 nativecontents |= CONTENTSQ3_LAVA;
6040 if (supercontents & SUPERCONTENTS_BODY)
6041 nativecontents |= CONTENTSQ3_BODY;
6042 if (supercontents & SUPERCONTENTS_CORPSE)
6043 nativecontents |= CONTENTSQ3_CORPSE;
6044 if (supercontents & SUPERCONTENTS_NODROP)
6045 nativecontents |= CONTENTSQ3_NODROP;
6046 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
6047 nativecontents |= CONTENTSQ3_PLAYERCLIP;
6048 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
6049 nativecontents |= CONTENTSQ3_MONSTERCLIP;
6050 if (supercontents & SUPERCONTENTS_DONOTENTER)
6051 nativecontents |= CONTENTSQ3_DONOTENTER;
6052 if (supercontents & SUPERCONTENTS_BOTCLIP)
6053 nativecontents |= CONTENTSQ3_BOTCLIP;
6054 if (!(supercontents & SUPERCONTENTS_OPAQUE))
6055 nativecontents |= CONTENTSQ3_TRANSLUCENT;
6056 return nativecontents;
6059 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
6064 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
6065 node = node->children[1];
6067 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
6068 if (loadmodel->brush.num_leafs < numleafs)
6069 loadmodel->brush.num_leafs = numleafs;
6072 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6074 int i, j, numshadowmeshtriangles, lumps;
6075 q3dheader_t *header;
6076 float corner[3], yawradius, modelradius;
6077 msurface_t *surface;
6079 mod->modeldatatypestring = "Q3BSP";
6081 mod->type = mod_brushq3;
6082 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
6085 header = (q3dheader_t *)buffer;
6086 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
6087 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
6089 i = LittleLong(header->version);
6090 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
6091 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
6093 mod->soundfromcenter = true;
6094 mod->TraceBox = Mod_Q3BSP_TraceBox;
6095 mod->TraceLine = Mod_Q3BSP_TraceLine;
6096 mod->TracePoint = Mod_Q3BSP_TracePoint;
6097 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
6098 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
6099 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
6100 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
6101 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
6102 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
6103 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
6104 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
6105 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
6106 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
6107 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
6108 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6109 mod->brush.AmbientSoundLevelsForPoint = NULL;
6110 mod->brush.RoundUpToHullSize = NULL;
6111 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
6112 mod->Draw = R_Q1BSP_Draw;
6113 mod->DrawDepth = R_Q1BSP_DrawDepth;
6114 mod->DrawDebug = R_Q1BSP_DrawDebug;
6115 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
6116 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6117 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6118 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6119 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6120 mod->DrawLight = R_Q1BSP_DrawLight;
6122 mod_base = (unsigned char *)header;
6124 // swap all the lumps
6125 header->ident = LittleLong(header->ident);
6126 header->version = LittleLong(header->version);
6127 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
6128 for (i = 0;i < lumps;i++)
6130 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
6131 if((char *) bufferend < (char *) buffer + j)
6132 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
6133 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
6134 if((char *) bufferend < (char *) buffer + j)
6135 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
6138 * NO, do NOT clear them!
6139 * they contain actual data referenced by other stuff.
6140 * Instead, before using the advertisements lump, check header->versio
6142 * Sorry, but otherwise it breaks memory of the first lump.
6143 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
6145 header->lumps[i].fileofs = 0;
6146 header->lumps[i].filelen = 0;
6150 mod->brush.qw_md4sum = 0;
6151 mod->brush.qw_md4sum2 = 0;
6152 for (i = 0;i < lumps;i++)
6154 if (i == Q3LUMP_ENTITIES)
6156 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6157 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
6159 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6161 // all this checksumming can take a while, so let's send keepalives here too
6162 CL_KeepaliveMessage(false);
6165 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
6166 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
6167 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
6168 if (header->version == Q3BSPVERSION_IG)
6169 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
6171 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
6172 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
6173 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
6174 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
6175 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
6176 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
6177 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
6178 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
6179 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
6180 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
6181 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
6182 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
6183 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
6184 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
6185 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
6187 // the MakePortals code works fine on the q3bsp data as well
6188 Mod_Q1BSP_MakePortals();
6190 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
6191 loadmodel->brush.supportwateralpha = true;
6193 // make a single combined shadow mesh to allow optimized shadow volume creation
6194 numshadowmeshtriangles = 0;
6195 if (cls.state != ca_dedicated)
6197 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6199 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
6200 numshadowmeshtriangles += surface->num_triangles;
6202 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
6203 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6204 if (surface->num_triangles > 0)
6205 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));
6206 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
6207 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
6210 loadmodel->brush.num_leafs = 0;
6211 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6214 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6219 // duplicate the basic information
6220 dpsnprintf(name, sizeof(name), "*%i", i);
6221 mod = Mod_FindName(name, loadmodel->name);
6222 // copy the base model to this one
6224 // rename the clone back to its proper name
6225 strlcpy(mod->name, name, sizeof(mod->name));
6226 mod->brush.parentmodel = loadmodel;
6227 // textures and memory belong to the main model
6228 mod->texturepool = NULL;
6229 mod->mempool = NULL;
6230 mod->brush.GetPVS = NULL;
6231 mod->brush.FatPVS = NULL;
6232 mod->brush.BoxTouchingPVS = NULL;
6233 mod->brush.BoxTouchingLeafPVS = NULL;
6234 mod->brush.BoxTouchingVisibleLeafs = NULL;
6235 mod->brush.FindBoxClusters = NULL;
6236 mod->brush.LightPoint = NULL;
6237 mod->brush.AmbientSoundLevelsForPoint = NULL;
6239 mod->brush.submodel = i;
6241 // make the model surface list (used by shadowing/lighting)
6242 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6243 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6244 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6245 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6246 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
6247 Mod_MakeSortedSurfaces(mod);
6249 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6250 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6251 // enlarge the bounding box to enclose all geometry of this model,
6252 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6253 // which can in turn mess up the farclip (as well as culling when
6254 // outside the level - an unimportant concern)
6256 //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]);
6257 for (j = 0;j < mod->nummodelsurfaces;j++)
6259 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6260 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6262 if (!surface->num_vertices)
6264 for (k = 0;k < surface->num_vertices;k++, v += 3)
6266 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6267 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6268 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6269 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6270 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6271 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6274 //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]);
6275 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6276 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6277 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6278 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6279 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6280 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6281 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6282 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6283 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6284 mod->yawmins[2] = mod->normalmins[2];
6285 mod->yawmaxs[2] = mod->normalmaxs[2];
6286 mod->radius = modelradius;
6287 mod->radius2 = modelradius * modelradius;
6289 // this gets altered below if sky or water is used
6290 mod->DrawSky = NULL;
6291 mod->DrawAddWaterPlanes = NULL;
6293 for (j = 0;j < mod->nummodelsurfaces;j++)
6294 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6296 if (j < mod->nummodelsurfaces)
6297 mod->DrawSky = R_Q1BSP_DrawSky;
6299 for (j = 0;j < mod->nummodelsurfaces;j++)
6300 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6302 if (j < mod->nummodelsurfaces)
6303 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6307 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6309 int i = LittleLong(((int *)buffer)[1]);
6310 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6311 Mod_Q3BSP_Load(mod,buffer, bufferend);
6312 else if (i == Q2BSPVERSION)
6313 Mod_Q2BSP_Load(mod,buffer, bufferend);
6315 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6318 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6320 Host_Error("Mod_MAP_Load: not yet implemented");
6323 typedef struct objvertex_s
6331 typedef struct objtriangle_s
6333 objvertex_t vertex[3];
6338 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
6341 const char *textbase = (char *)buffer, *text = textbase;
6345 char materialname[MAX_QPATH];
6346 int j, index1, index2, index3, first, prev, index;
6349 int numtriangles = 0;
6350 int maxtriangles = 131072;
6351 objtriangle_t *triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
6353 int maxtextures = 256, numtextures = 0, textureindex = 0;
6354 int maxv = 1024, numv = 0;
6355 int maxvt = 1024, numvt = 0;
6356 int maxvn = 1024, numvn = 0;
6357 char **texturenames;
6358 float *v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
6359 float *vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
6360 float *vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
6361 objvertex_t vfirst, vprev, vcurrent;
6364 int maxverthash = 65536, numverthash = 0;
6365 int numhashindex = 65536;
6366 struct objverthash_s
6368 struct objverthash_s *next;
6374 *hash, **verthash = Mem_Alloc(tempmempool, numhashindex * sizeof(*verthash)), *verthashdata = Mem_Alloc(tempmempool, maxverthash * sizeof(*verthashdata)), *oldverthashdata;
6377 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
6379 loadmodel->modeldatatypestring = "OBJ";
6381 loadmodel->type = mod_obj;
6382 loadmodel->soundfromcenter = true;
6383 loadmodel->TraceBox = Mod_OBJ_TraceBox;
6384 loadmodel->TraceLine = Mod_OBJ_TraceLine;
6385 loadmodel->TracePoint = Mod_OBJ_TracePoint;
6386 loadmodel->PointSuperContents = Mod_OBJ_PointSuperContents;
6387 loadmodel->brush.TraceLineOfSight = Mod_OBJ_TraceLineOfSight;
6388 loadmodel->brush.SuperContentsFromNativeContents = Mod_OBJ_SuperContentsFromNativeContents;
6389 loadmodel->brush.NativeContentsFromSuperContents = Mod_OBJ_NativeContentsFromSuperContents;
6390 loadmodel->brush.GetPVS = Mod_OBJ_GetPVS;
6391 loadmodel->brush.FatPVS = Mod_OBJ_FatPVS;
6392 loadmodel->brush.BoxTouchingPVS = Mod_OBJ_BoxTouchingPVS;
6393 loadmodel->brush.BoxTouchingLeafPVS = Mod_OBJ_BoxTouchingLeafPVS;
6394 loadmodel->brush.BoxTouchingVisibleLeafs = Mod_OBJ_BoxTouchingVisibleLeafs;
6395 loadmodel->brush.FindBoxClusters = Mod_OBJ_FindBoxClusters;
6396 loadmodel->brush.LightPoint = Mod_OBJ_LightPoint;
6397 loadmodel->brush.FindNonSolidLocation = Mod_OBJ_FindNonSolidLocation;
6398 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
6399 loadmodel->brush.RoundUpToHullSize = NULL;
6400 loadmodel->brush.PointInLeaf = Mod_OBJ_PointInLeaf;
6401 loadmodel->Draw = R_Q1BSP_Draw;
6402 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
6403 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
6404 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
6405 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6406 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6407 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6408 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6409 loadmodel->DrawLight = R_Q1BSP_DrawLight;
6411 // parse the OBJ text now
6418 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
6419 line[linelen] = text[linelen];
6421 for (argc = 0;argc < (int)(sizeof(argv)/sizeof(argv[0]));argc++)
6425 while (*s == ' ' || *s == '\t')
6435 while (*s == ' ' || *s == '\t')
6440 if (argv[0][0] == '#')
6442 if (!strcmp(argv[0], "v"))
6448 v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
6451 memcpy(v, oldv, numv * sizeof(float[3]));
6455 v[numv*3+0] = atof(argv[1]);
6456 v[numv*3+1] = atof(argv[2]);
6457 v[numv*3+2] = atof(argv[3]);
6460 else if (!strcmp(argv[0], "vt"))
6466 vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
6469 memcpy(vt, oldvt, numvt * sizeof(float[2]));
6473 vt[numvt*2+0] = atof(argv[1]);
6474 vt[numvt*2+1] = atof(argv[2]);
6477 else if (!strcmp(argv[0], "vn"))
6483 vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
6486 memcpy(vn, oldvn, numvn * sizeof(float[3]));
6490 vn[numvn*3+0] = atof(argv[1]);
6491 vn[numvn*3+1] = atof(argv[2]);
6492 vn[numvn*3+2] = atof(argv[3]);
6495 else if (!strcmp(argv[0], "f"))
6497 for (j = 1;j < argc;j++)
6499 index1 = atoi(argv[j]);
6500 while(argv[j][0] && argv[j][0] != '/')
6504 index2 = atoi(argv[j]);
6505 while(argv[j][0] && argv[j][0] != '/')
6509 index3 = atoi(argv[j]);
6510 // negative refers to a recent vertex
6511 // zero means not specified
6512 // positive means an absolute vertex index
6514 index1 = numv - index1;
6516 index2 = numvt - index2;
6518 index3 = numvn - index3;
6519 VectorCopy(v + 3*index1, vcurrent.v);
6520 Vector2Copy(vt + 2*index2, vcurrent.vt);
6521 VectorCopy(vn + 3*index3, vcurrent.vn);
6526 if (maxtriangles <= numtriangles)
6528 objtriangle_t *oldtriangles = triangles;
6530 triangles = Mem_Alloc(tempmempool, numtriangles * sizeof(*triangles));
6533 memcpy(triangles, oldtriangles, numtriangles * sizeof(*triangles));
6534 Mem_Free(oldtriangles);
6537 triangles[numtriangles].textureindex = textureindex;
6538 triangles[numtriangles].vertex[0] = vfirst;
6539 triangles[numtriangles].vertex[1] = vprev;
6540 triangles[numtriangles].vertex[2] = vcurrent;
6547 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
6549 else if (!!strcmp(argv[0], "usemtl"))
6551 for (i = 0;i < numtextures;i++)
6552 if (!strcmp(texturenames[numtextures], argv[1]))
6554 if (i < numtextures)
6555 texture = textures + i;
6558 if (maxtextures <= numtextures)
6560 texture_t *oldtextures = textures;
6562 textures = Mem_Alloc(tempmempool, maxtextures * sizeof(*textures));
6565 memcpy(textures, oldtextures, numtexutres * sizeof(*textures));
6566 Mem_Free(oldtextures);
6569 textureindex = numtextures++;
6570 texturenames[textureindex] = Mem_Alloc(tempmempool, strlen(argv[1]) + 1);
6571 memcpy(texturenames[textureindex], argv[1], strlen(argv[1]) + 1);
6581 // now that we have the OBJ data loaded as-is, we can convert it
6583 // load the textures
6584 loadmodel->num_textures = numtextures;
6585 loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
6586 for (i = 0;i < numtextures;i++)
6587 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, texturenames[i], true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
6589 // free the texturenames array since we are now done with it
6590 for (i = 0;i < numtextures;i++)
6592 Mem_Free(texturenames[i]);
6593 texturenames[i] = NULL;
6595 Mem_Free(texturenames);
6596 texturenames = NULL;
6598 // 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
6600 // generate surfaces by recursing triangles into BSP tree and ensuring they do not overlap in the lightmap projection axis
6602 loadmodel->numskins = LittleLong(pinmodel->num_skins);
6603 numxyz = LittleLong(pinmodel->num_xyz);
6604 numst = LittleLong(pinmodel->num_st);
6605 loadmodel->surfmesh.num_triangles = LittleLong(pinmodel->num_tris);
6606 loadmodel->numframes = LittleLong(pinmodel->num_frames);
6607 loadmodel->surfmesh.num_morphframes = loadmodel->numframes;
6608 loadmodel->num_poses = loadmodel->surfmesh.num_morphframes;
6609 skinwidth = LittleLong(pinmodel->skinwidth);
6610 skinheight = LittleLong(pinmodel->skinheight);
6611 iskinwidth = 1.0f / skinwidth;
6612 iskinheight = 1.0f / skinheight;
6614 loadmodel->num_surfaces = 1;
6615 loadmodel->nummodelsurfaces = loadmodel->num_surfaces;
6616 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]));
6617 loadmodel->data_surfaces = (msurface_t *)data;data += loadmodel->num_surfaces * sizeof(msurface_t);
6618 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
6619 loadmodel->sortedmodelsurfaces[0] = 0;
6620 loadmodel->animscenes = (animscene_t *)data;data += loadmodel->numframes * sizeof(animscene_t);
6621 loadmodel->surfmesh.data_morphmd2framesize6f = (float *)data;data += loadmodel->numframes * sizeof(float[6]);
6622 loadmodel->surfmesh.data_element3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
6623 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
6625 loadmodel->synctype = ST_RAND;
6628 inskin = (char *)(base + LittleLong(pinmodel->ofs_skins));
6629 skinfiles = Mod_LoadSkinFiles();
6632 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
6633 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
6634 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
6635 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures, skinfiles, "default", "");
6636 Mod_FreeSkinFiles(skinfiles);
6638 else if (loadmodel->numskins)
6640 // skins found (most likely not a player model)
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 for (i = 0;i < loadmodel->numskins;i++, inskin += MD2_SKINNAME)
6645 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);
6649 // no skins (most likely a player model)
6650 loadmodel->numskins = 1;
6651 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
6652 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
6653 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
6654 Mod_BuildAliasSkinFromSkinFrame(loadmodel->data_textures, NULL);
6657 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
6658 for (i = 0;i < loadmodel->numskins;i++)
6660 loadmodel->skinscenes[i].firstframe = i;
6661 loadmodel->skinscenes[i].framecount = 1;
6662 loadmodel->skinscenes[i].loop = true;
6663 loadmodel->skinscenes[i].framerate = 10;
6666 // load the triangles and stvert data
6667 inst = (unsigned short *)(base + LittleLong(pinmodel->ofs_st));
6668 intri = (md2triangle_t *)(base + LittleLong(pinmodel->ofs_tris));
6669 md2verthash = (struct md2verthash_s **)Mem_Alloc(tempmempool, 65536 * sizeof(hash));
6670 md2verthashdata = (struct md2verthash_s *)Mem_Alloc(tempmempool, loadmodel->surfmesh.num_triangles * 3 * sizeof(*hash));
6671 // swap the triangle list
6672 loadmodel->surfmesh.num_vertices = 0;
6673 for (i = 0;i < loadmodel->surfmesh.num_triangles;i++)
6675 for (j = 0;j < 3;j++)
6677 xyz = (unsigned short) LittleShort (intri[i].index_xyz[j]);
6678 st = (unsigned short) LittleShort (intri[i].index_st[j]);
6681 Con_Printf("%s has an invalid xyz index (%i) on triangle %i, resetting to 0\n", loadmodel->name, xyz, i);
6686 Con_Printf("%s has an invalid st index (%i) on triangle %i, resetting to 0\n", loadmodel->name, st, i);
6689 hashindex = (xyz * 256 + st) & 65535;
6690 for (hash = md2verthash[hashindex];hash;hash = hash->next)
6691 if (hash->xyz == xyz && hash->st == st)
6695 hash = md2verthashdata + loadmodel->surfmesh.num_vertices++;
6698 hash->next = md2verthash[hashindex];
6699 md2verthash[hashindex] = hash;
6701 loadmodel->surfmesh.data_element3i[i*3+j] = (hash - md2verthashdata);
6705 vertremap = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(int));
6706 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));
6707 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += loadmodel->surfmesh.num_vertices * sizeof(float[2]);
6708 loadmodel->surfmesh.data_morphmdlvertex = (trivertx_t *)data;data += loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t);
6709 for (i = 0;i < loadmodel->surfmesh.num_vertices;i++)
6712 hash = md2verthashdata + i;
6713 vertremap[i] = hash->xyz;
6714 sts = LittleShort(inst[hash->st*2+0]);
6715 stt = LittleShort(inst[hash->st*2+1]);
6716 if (sts < 0 || sts >= skinwidth || stt < 0 || stt >= skinheight)
6718 Con_Printf("%s has an invalid skin coordinate (%i %i) on vert %i, changing to 0 0\n", loadmodel->name, sts, stt, i);
6722 loadmodel->surfmesh.data_texcoordtexture2f[i*2+0] = sts * iskinwidth;
6723 loadmodel->surfmesh.data_texcoordtexture2f[i*2+1] = stt * iskinheight;
6726 Mem_Free(md2verthash);
6727 Mem_Free(md2verthashdata);
6729 // generate ushort elements array if possible
6730 if (loadmodel->surfmesh.num_vertices <= 65536)
6731 loadmodel->surfmesh.data_element3s = (unsigned short *)Mem_Alloc(loadmodel->mempool, sizeof(unsigned short[3]) * loadmodel->surfmesh.num_triangles);
6734 datapointer = (base + LittleLong(pinmodel->ofs_frames));
6735 for (i = 0;i < loadmodel->surfmesh.num_morphframes;i++)
6740 pinframe = (md2frame_t *)datapointer;
6741 datapointer += sizeof(md2frame_t);
6742 // store the frame scale/translate into the appropriate array
6743 for (j = 0;j < 3;j++)
6745 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+j] = LittleFloat(pinframe->scale[j]);
6746 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+3+j] = LittleFloat(pinframe->translate[j]);
6748 // convert the vertices
6749 v = (trivertx_t *)datapointer;
6750 out = loadmodel->surfmesh.data_morphmdlvertex + i * loadmodel->surfmesh.num_vertices;
6751 for (k = 0;k < loadmodel->surfmesh.num_vertices;k++)
6752 out[k] = v[vertremap[k]];
6753 datapointer += numxyz * sizeof(trivertx_t);
6755 strlcpy(loadmodel->animscenes[i].name, pinframe->name, sizeof(loadmodel->animscenes[i].name));
6756 loadmodel->animscenes[i].firstframe = i;
6757 loadmodel->animscenes[i].framecount = 1;
6758 loadmodel->animscenes[i].framerate = 10;
6759 loadmodel->animscenes[i].loop = true;
6762 Mem_Free(vertremap);
6764 Mod_MakeSortedSurfaces(loadmodel);
6765 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
6766 Mod_Alias_CalculateBoundingBox();
6767 Mod_Alias_MorphMesh_CompileFrames();
6769 surface = loadmodel->data_surfaces;
6770 surface->texture = loadmodel->data_textures;
6771 surface->num_firsttriangle = 0;
6772 surface->num_triangles = loadmodel->surfmesh.num_triangles;
6773 surface->num_firstvertex = 0;
6774 surface->num_vertices = loadmodel->surfmesh.num_vertices;
6776 loadmodel->surfmesh.isanimated = false;
6778 if (loadmodel->surfmesh.data_element3s)
6779 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
6780 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
6784 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
6786 // we already have done PVS culling at this point...
6787 // so we don't need to do it again.
6790 vec3_t testorigin, mins, maxs;
6792 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
6793 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
6794 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
6796 if(model->brush.TraceLineOfSight(model, eye, testorigin))
6799 // expand the box a little
6800 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
6801 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
6802 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
6803 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
6804 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
6805 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
6807 for(i = 0; i != numsamples; ++i)
6809 testorigin[0] = lhrandom(mins[0], maxs[0]);
6810 testorigin[1] = lhrandom(mins[1], maxs[1]);
6811 testorigin[2] = lhrandom(mins[2], maxs[2]);
6813 if(model->brush.TraceLineOfSight(model, eye, testorigin))