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.
27 // note: model_shared.c sets up r_notexture, and r_surf_notexture
29 qbyte mod_q1bsp_novis[(MAX_MAP_LEAFS + 7)/ 8];
31 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128"};
32 cvar_t halflifebsp = {0, "halflifebsp", "0"};
33 cvar_t r_novis = {0, "r_novis", "0"};
34 cvar_t r_miplightmaps = {CVAR_SAVE, "r_miplightmaps", "0"};
35 cvar_t r_lightmaprgba = {0, "r_lightmaprgba", "1"};
36 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0"};
37 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4"};
38 cvar_t r_subdivisions_minlevel = {0, "r_subdivisions_minlevel", "0"};
39 cvar_t r_subdivisions_maxlevel = {0, "r_subdivisions_maxlevel", "10"};
40 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536"};
41 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15"};
42 cvar_t r_subdivisions_collision_minlevel = {0, "r_subdivisions_collision_minlevel", "0"};
43 cvar_t r_subdivisions_collision_maxlevel = {0, "r_subdivisions_collision_maxlevel", "10"};
44 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225"};
45 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1"};
46 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1"};
47 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0"};
49 static void Mod_Q1BSP_Collision_Init (void);
50 void Mod_BrushInit(void)
52 // Cvar_RegisterVariable(&r_subdivide_size);
53 Cvar_RegisterVariable(&halflifebsp);
54 Cvar_RegisterVariable(&r_novis);
55 Cvar_RegisterVariable(&r_miplightmaps);
56 Cvar_RegisterVariable(&r_lightmaprgba);
57 Cvar_RegisterVariable(&r_nosurftextures);
58 Cvar_RegisterVariable(&r_subdivisions_tolerance);
59 Cvar_RegisterVariable(&r_subdivisions_minlevel);
60 Cvar_RegisterVariable(&r_subdivisions_maxlevel);
61 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
62 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
63 Cvar_RegisterVariable(&r_subdivisions_collision_minlevel);
64 Cvar_RegisterVariable(&r_subdivisions_collision_maxlevel);
65 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
66 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
67 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
68 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
69 memset(mod_q1bsp_novis, 0xff, sizeof(mod_q1bsp_novis));
70 Mod_Q1BSP_Collision_Init();
73 static mleaf_t *Mod_Q1BSP_PointInLeaf(model_t *model, const vec3_t p)
80 Mod_CheckLoaded(model);
82 // LordHavoc: modified to start at first clip node,
83 // in other words: first node of the (sub)model
84 node = model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode;
85 while (node->contents == 0)
86 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
88 return (mleaf_t *)node;
91 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(model_t *model, const vec3_t p, qbyte *out, int outsize)
95 leaf = Mod_Q1BSP_PointInLeaf(model, p);
98 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
101 memcpy(out, leaf->ambient_sound_level, i);
107 memset(out, 0, outsize);
110 static int Mod_Q1BSP_BoxTouchingPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
112 int clusterindex, side, nodestackindex = 0;
113 mnode_t *node, *nodestack[1024];
114 node = model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode;
119 // node - recurse down the BSP tree
120 side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
123 // box is on one side of plane, take that path
124 node = node->children[side];
128 // box crosses plane, take one path and remember the other
129 if (nodestackindex < 1024)
130 nodestack[nodestackindex++] = node->children[0];
131 node = node->children[1];
136 // leaf - check cluster bit
137 clusterindex = ((mleaf_t *)node)->clusterindex;
138 if (CHECKPVSBIT(pvs, clusterindex))
140 // it is visible, return immediately with the news
145 // nothing to see here, try another path we didn't take earlier
146 if (nodestackindex == 0)
148 node = nodestack[--nodestackindex];
157 static int Mod_Q1BSP_PointContents(model_t *model, const vec3_t p)
162 return CONTENTS_EMPTY;
164 Mod_CheckLoaded(model);
166 // LordHavoc: modified to start at first clip node,
167 // in other words: first node of the (sub)model
168 node = model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode;
169 while (node->contents == 0)
170 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
172 return ((mleaf_t *)node)->contents;
176 typedef struct findnonsolidlocationinfo_s
184 findnonsolidlocationinfo_t;
187 extern cvar_t samelevel;
189 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
191 int i, surfnum, k, *tri, *mark;
192 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
197 for (surfnum = 0, mark = leaf->firstmarksurface;surfnum < leaf->nummarksurfaces;surfnum++, mark++)
199 surf = info->model->brushq1.surfaces + *mark;
200 if (surf->flags & SURF_SOLIDCLIP)
203 VectorCopy(surf->plane->normal, surfnormal);
204 if (surf->flags & SURF_PLANEBACK)
205 VectorNegate(surfnormal, surfnormal);
207 for (k = 0;k < surf->mesh.num_triangles;k++)
209 tri = surf->mesh.data_element3i + k * 3;
210 VectorCopy((surf->mesh.data_vertex3f + tri[0] * 3), vert[0]);
211 VectorCopy((surf->mesh.data_vertex3f + tri[1] * 3), vert[1]);
212 VectorCopy((surf->mesh.data_vertex3f + tri[2] * 3), vert[2]);
213 VectorSubtract(vert[1], vert[0], edge[0]);
214 VectorSubtract(vert[2], vert[1], edge[1]);
215 CrossProduct(edge[1], edge[0], facenormal);
216 if (facenormal[0] || facenormal[1] || facenormal[2])
218 VectorNormalize(facenormal);
220 if (VectorDistance(facenormal, surfnormal) > 0.01f)
221 Con_Printf("a2! %f %f %f != %f %f %f\n", facenormal[0], facenormal[1], facenormal[2], surfnormal[0], surfnormal[1], surfnormal[2]);
223 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
224 if (f <= info->bestdist && f >= -info->bestdist)
226 VectorSubtract(vert[0], vert[2], edge[2]);
227 VectorNormalize(edge[0]);
228 VectorNormalize(edge[1]);
229 VectorNormalize(edge[2]);
230 CrossProduct(facenormal, edge[0], edgenormal[0]);
231 CrossProduct(facenormal, edge[1], edgenormal[1]);
232 CrossProduct(facenormal, edge[2], edgenormal[2]);
234 if (samelevel.integer & 1)
235 VectorNegate(edgenormal[0], edgenormal[0]);
236 if (samelevel.integer & 2)
237 VectorNegate(edgenormal[1], edgenormal[1]);
238 if (samelevel.integer & 4)
239 VectorNegate(edgenormal[2], edgenormal[2]);
240 for (i = 0;i < 3;i++)
241 if (DotProduct(vert[0], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f
242 || DotProduct(vert[1], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f
243 || DotProduct(vert[2], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f)
244 Con_Printf("a! %i : %f %f %f (%f %f %f)\n", i, edgenormal[i][0], edgenormal[i][1], edgenormal[i][2], facenormal[0], facenormal[1], facenormal[2]);
247 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
248 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
249 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
251 // we got lucky, the center is within the face
252 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
256 if (info->bestdist > dist)
258 info->bestdist = dist;
259 VectorScale(facenormal, (info->radius - -dist), info->nudge);
264 if (info->bestdist > dist)
266 info->bestdist = dist;
267 VectorScale(facenormal, (info->radius - dist), info->nudge);
273 // check which edge or vertex the center is nearest
274 for (i = 0;i < 3;i++)
276 f = DotProduct(info->center, edge[i]);
277 if (f >= DotProduct(vert[0], edge[i])
278 && f <= DotProduct(vert[1], edge[i]))
281 VectorMA(info->center, -f, edge[i], point);
282 dist = sqrt(DotProduct(point, point));
283 if (info->bestdist > dist)
285 info->bestdist = dist;
286 VectorScale(point, (info->radius / dist), info->nudge);
288 // skip both vertex checks
289 // (both are further away than this edge)
294 // not on edge, check first vertex of edge
295 VectorSubtract(info->center, vert[i], point);
296 dist = sqrt(DotProduct(point, point));
297 if (info->bestdist > dist)
299 info->bestdist = dist;
300 VectorScale(point, (info->radius / dist), info->nudge);
312 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
316 if (((mleaf_t *)node)->nummarksurfaces)
317 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
321 float f = PlaneDiff(info->center, node->plane);
322 if (f >= -info->bestdist)
323 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
324 if (f <= info->bestdist)
325 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
329 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
332 findnonsolidlocationinfo_t info;
338 VectorCopy(in, info.center);
339 info.radius = radius;
344 VectorClear(info.nudge);
345 info.bestdist = radius;
346 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode);
347 VectorAdd(info.center, info.nudge, info.center);
349 while (info.bestdist < radius && ++i < 10);
350 VectorCopy(info.center, out);
353 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
355 switch(nativecontents)
360 return SUPERCONTENTS_SOLID;
362 return SUPERCONTENTS_WATER;
364 return SUPERCONTENTS_SLIME;
366 return SUPERCONTENTS_LAVA;
368 return SUPERCONTENTS_SKY;
373 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
375 if (supercontents & SUPERCONTENTS_SOLID)
376 return CONTENTS_SOLID;
377 if (supercontents & SUPERCONTENTS_SKY)
379 if (supercontents & SUPERCONTENTS_LAVA)
380 return CONTENTS_LAVA;
381 if (supercontents & SUPERCONTENTS_SLIME)
382 return CONTENTS_SLIME;
383 if (supercontents & SUPERCONTENTS_WATER)
384 return CONTENTS_WATER;
385 return CONTENTS_EMPTY;
390 // the hull we're tracing through
393 // the trace structure to fill in
396 // start, end, and end - start (in model space)
401 RecursiveHullCheckTraceInfo_t;
403 // 1/32 epsilon to keep floating point happy
404 #define DIST_EPSILON (0.03125)
406 #define HULLCHECKSTATE_EMPTY 0
407 #define HULLCHECKSTATE_SOLID 1
408 #define HULLCHECKSTATE_DONE 2
410 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
412 // status variables, these don't need to be saved on the stack when
413 // recursing... but are because this should be thread-safe
414 // (note: tracing against a bbox is not thread-safe, yet)
419 // variables that need to be stored on the stack when recursing
424 // LordHavoc: a goto! everyone flee in terror... :)
429 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
430 if (!t->trace->startfound)
432 t->trace->startfound = true;
433 t->trace->startsupercontents |= num;
435 if (num & SUPERCONTENTS_LIQUIDSMASK)
436 t->trace->inwater = true;
438 t->trace->inopen = true;
439 if (num & t->trace->hitsupercontentsmask)
441 // if the first leaf is solid, set startsolid
442 if (t->trace->allsolid)
443 t->trace->startsolid = true;
444 #if COLLISIONPARANOID >= 3
447 return HULLCHECKSTATE_SOLID;
451 t->trace->allsolid = false;
452 #if COLLISIONPARANOID >= 3
455 return HULLCHECKSTATE_EMPTY;
459 // find the point distances
460 node = t->hull->clipnodes + num;
462 plane = t->hull->planes + node->planenum;
465 t1 = p1[plane->type] - plane->dist;
466 t2 = p2[plane->type] - plane->dist;
470 t1 = DotProduct (plane->normal, p1) - plane->dist;
471 t2 = DotProduct (plane->normal, p2) - plane->dist;
478 #if COLLISIONPARANOID >= 3
481 num = node->children[1];
490 #if COLLISIONPARANOID >= 3
493 num = node->children[0];
499 // the line intersects, find intersection point
500 // LordHavoc: this uses the original trace for maximum accuracy
501 #if COLLISIONPARANOID >= 3
506 t1 = t->start[plane->type] - plane->dist;
507 t2 = t->end[plane->type] - plane->dist;
511 t1 = DotProduct (plane->normal, t->start) - plane->dist;
512 t2 = DotProduct (plane->normal, t->end) - plane->dist;
515 midf = t1 / (t1 - t2);
516 midf = bound(p1f, midf, p2f);
517 VectorMA(t->start, midf, t->dist, mid);
519 // recurse both sides, front side first
520 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
521 // if this side is not empty, return what it is (solid or done)
522 if (ret != HULLCHECKSTATE_EMPTY)
525 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
526 // if other side is not solid, return what it is (empty or done)
527 if (ret != HULLCHECKSTATE_SOLID)
530 // front is air and back is solid, this is the impact point...
533 t->trace->plane.dist = -plane->dist;
534 VectorNegate (plane->normal, t->trace->plane.normal);
538 t->trace->plane.dist = plane->dist;
539 VectorCopy (plane->normal, t->trace->plane.normal);
542 // calculate the true fraction
543 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
544 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
545 midf = t1 / (t1 - t2);
546 t->trace->realfraction = bound(0, midf, 1);
548 // calculate the return fraction which is nudged off the surface a bit
549 midf = (t1 - DIST_EPSILON) / (t1 - t2);
550 t->trace->fraction = bound(0, midf, 1);
552 #if COLLISIONPARANOID >= 3
555 return HULLCHECKSTATE_DONE;
558 #if COLLISIONPARANOID < 2
559 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
562 num = t->hull->clipnodes[num].children[(t->hull->planes[t->hull->clipnodes[num].planenum].type < 3 ? t->start[t->hull->planes[t->hull->clipnodes[num].planenum].type] : DotProduct(t->hull->planes[t->hull->clipnodes[num].planenum].normal, t->start)) < t->hull->planes[t->hull->clipnodes[num].planenum].dist];
563 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
564 t->trace->startsupercontents |= num;
565 if (num & SUPERCONTENTS_LIQUIDSMASK)
566 t->trace->inwater = true;
568 t->trace->inopen = true;
569 if (num & t->trace->hitsupercontentsmask)
571 t->trace->allsolid = t->trace->startsolid = true;
572 return HULLCHECKSTATE_SOLID;
576 t->trace->allsolid = t->trace->startsolid = false;
577 return HULLCHECKSTATE_EMPTY;
582 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t boxstartmins, const vec3_t boxstartmaxs, const vec3_t boxendmins, const vec3_t boxendmaxs, int hitsupercontentsmask)
584 // this function currently only supports same size start and end
586 RecursiveHullCheckTraceInfo_t rhc;
588 memset(&rhc, 0, sizeof(rhc));
589 memset(trace, 0, sizeof(trace_t));
591 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
592 rhc.trace->fraction = 1;
593 rhc.trace->realfraction = 1;
594 rhc.trace->allsolid = true;
595 VectorSubtract(boxstartmaxs, boxstartmins, boxsize);
597 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
598 else if (model->brush.ishlbsp)
600 // LordHavoc: this has to have a minor tolerance (the .1) because of
601 // minor float precision errors from the box being transformed around
602 if (boxsize[0] < 32.1)
604 if (boxsize[2] < 54) // pick the nearest of 36 or 72
605 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
607 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
610 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
614 // LordHavoc: this has to have a minor tolerance (the .1) because of
615 // minor float precision errors from the box being transformed around
616 if (boxsize[0] < 32.1)
617 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
619 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
621 VectorSubtract(boxstartmins, rhc.hull->clip_mins, rhc.start);
622 VectorSubtract(boxendmins, rhc.hull->clip_mins, rhc.end);
623 VectorSubtract(rhc.end, rhc.start, rhc.dist);
624 #if COLLISIONPARANOID >= 2
625 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]);
626 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
629 if (DotProduct(rhc.dist, rhc.dist))
630 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
632 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
636 static hull_t box_hull;
637 static dclipnode_t box_clipnodes[6];
638 static mplane_t box_planes[6];
640 static void Mod_Q1BSP_Collision_Init (void)
645 //Set up the planes and clipnodes so that the six floats of a bounding box
646 //can just be stored out and get a proper hull_t structure.
648 box_hull.clipnodes = box_clipnodes;
649 box_hull.planes = box_planes;
650 box_hull.firstclipnode = 0;
651 box_hull.lastclipnode = 5;
653 for (i = 0;i < 6;i++)
655 box_clipnodes[i].planenum = i;
659 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
661 box_clipnodes[i].children[side^1] = i + 1;
663 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
665 box_planes[i].type = i>>1;
666 box_planes[i].normal[i>>1] = 1;
670 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)
674 colplanef_t cbox_planes[6];
675 cbox.supercontents = boxsupercontents;
678 cbox.numtriangles = 0;
679 cbox.planes = cbox_planes;
681 cbox.elements = NULL;
689 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];
690 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];
691 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];
692 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];
693 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];
694 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];
695 memset(trace, 0, sizeof(trace_t));
696 trace->hitsupercontentsmask = hitsupercontentsmask;
698 trace->realfraction = 1;
699 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
701 RecursiveHullCheckTraceInfo_t rhc;
702 // fill in a default trace
703 memset(&rhc, 0, sizeof(rhc));
704 memset(trace, 0, sizeof(trace_t));
705 //To keep everything totally uniform, bounding boxes are turned into small
706 //BSP trees instead of being compared directly.
707 // create a temp hull from bounding box sizes
708 box_planes[0].dist = cmaxs[0] - mins[0];
709 box_planes[1].dist = cmins[0] - maxs[0];
710 box_planes[2].dist = cmaxs[1] - mins[1];
711 box_planes[3].dist = cmins[1] - maxs[1];
712 box_planes[4].dist = cmaxs[2] - mins[2];
713 box_planes[5].dist = cmins[2] - maxs[2];
714 #if COLLISIONPARANOID >= 3
715 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]);
717 // trace a line through the generated clipping hull
718 //rhc.boxsupercontents = boxsupercontents;
719 rhc.hull = &box_hull;
721 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
722 rhc.trace->fraction = 1;
723 rhc.trace->realfraction = 1;
724 rhc.trace->allsolid = true;
725 VectorCopy(start, rhc.start);
726 VectorCopy(end, rhc.end);
727 VectorSubtract(rhc.end, rhc.start, rhc.dist);
728 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
729 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
730 if (rhc.trace->startsupercontents)
731 rhc.trace->startsupercontents = boxsupercontents;
735 static int Mod_Q1BSP_LightPoint_RecursiveBSPNode(vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal, const mnode_t *node, float x, float y, float startz, float endz)
737 int side, distz = endz - startz;
742 if (node->contents < 0)
743 return false; // didn't hit anything
745 switch (node->plane->type)
748 node = node->children[x < node->plane->dist];
751 node = node->children[y < node->plane->dist];
754 side = startz < node->plane->dist;
755 if ((endz < node->plane->dist) == side)
757 node = node->children[side];
760 // found an intersection
761 mid = node->plane->dist;
764 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
765 front += startz * node->plane->normal[2];
766 back += endz * node->plane->normal[2];
767 side = front < node->plane->dist;
768 if ((back < node->plane->dist) == side)
770 node = node->children[side];
773 // found an intersection
774 mid = startz + distz * (front - node->plane->dist) / (front - back);
778 // go down front side
779 if (node->children[side]->contents >= 0 && Mod_Q1BSP_LightPoint_RecursiveBSPNode(ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
780 return true; // hit something
783 // check for impact on this node
784 if (node->numsurfaces)
789 surf = cl.worldmodel->brushq1.surfaces + node->firstsurface;
790 for (i = 0;i < node->numsurfaces;i++, surf++)
792 if (!(surf->flags & SURF_LIGHTMAP) || !surf->samples)
793 continue; // no lightmaps
795 ds = (int) (x * surf->texinfo->vecs[0][0] + y * surf->texinfo->vecs[0][1] + mid * surf->texinfo->vecs[0][2] + surf->texinfo->vecs[0][3]) - surf->texturemins[0];
796 dt = (int) (x * surf->texinfo->vecs[1][0] + y * surf->texinfo->vecs[1][1] + mid * surf->texinfo->vecs[1][2] + surf->texinfo->vecs[1][3]) - surf->texturemins[1];
798 if (ds >= 0 && ds < surf->extents[0] && dt >= 0 && dt < surf->extents[1])
801 int lmwidth, lmheight, maps, line3, size3, dsfrac = ds & 15, dtfrac = dt & 15, scale = 0, r00 = 0, g00 = 0, b00 = 0, r01 = 0, g01 = 0, b01 = 0, r10 = 0, g10 = 0, b10 = 0, r11 = 0, g11 = 0, b11 = 0;
802 lmwidth = ((surf->extents[0]>>4)+1);
803 lmheight = ((surf->extents[1]>>4)+1);
804 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
805 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
807 lightmap = surf->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
809 for (maps = 0;maps < MAXLIGHTMAPS && surf->styles[maps] != 255;maps++)
811 scale = d_lightstylevalue[surf->styles[maps]];
812 r00 += lightmap[ 0] * scale;g00 += lightmap[ 1] * scale;b00 += lightmap[ 2] * scale;
813 r01 += lightmap[ 3] * scale;g01 += lightmap[ 4] * scale;b01 += lightmap[ 5] * scale;
814 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
815 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
820 LordHavoc: here's the readable version of the interpolation
821 code, not quite as easy for the compiler to optimize...
823 dsfrac is the X position in the lightmap pixel, * 16
824 dtfrac is the Y position in the lightmap pixel, * 16
825 r00 is top left corner, r01 is top right corner
826 r10 is bottom left corner, r11 is bottom right corner
827 g and b are the same layout.
828 r0 and r1 are the top and bottom intermediate results
830 first we interpolate the top two points, to get the top
833 r0 = (((r01-r00) * dsfrac) >> 4) + r00;
834 g0 = (((g01-g00) * dsfrac) >> 4) + g00;
835 b0 = (((b01-b00) * dsfrac) >> 4) + b00;
837 then we interpolate the bottom two points, to get the
840 r1 = (((r11-r10) * dsfrac) >> 4) + r10;
841 g1 = (((g11-g10) * dsfrac) >> 4) + g10;
842 b1 = (((b11-b10) * dsfrac) >> 4) + b10;
844 then we interpolate the top and bottom samples to get the
845 middle sample (the one which was requested)
847 r = (((r1-r0) * dtfrac) >> 4) + r0;
848 g = (((g1-g0) * dtfrac) >> 4) + g0;
849 b = (((b1-b0) * dtfrac) >> 4) + b0;
852 ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
853 ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
854 ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
855 return true; // success
861 node = node->children[side ^ 1];
863 distz = endz - startz;
868 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
870 Mod_Q1BSP_LightPoint_RecursiveBSPNode(ambientcolor, diffusecolor, diffusenormal, cl.worldmodel->brushq1.nodes + cl.worldmodel->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2], p[2] - 65536);
873 static void Mod_Q1BSP_DecompressVis(const qbyte *in, const qbyte *inend, qbyte *out, qbyte *outend)
876 qbyte *outstart = out;
881 Con_DPrintf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
891 Con_DPrintf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
894 for (c = *in++;c > 0;c--)
898 Con_DPrintf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
907 static void Mod_Q1BSP_LoadTextures(lump_t *l)
909 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
911 texture_t *tx, *tx2, *anims[10], *altanims[10];
913 qbyte *data, *mtdata;
916 loadmodel->brushq1.textures = NULL;
918 // add two slots for notexture walls and notexture liquids
921 m = (dmiptexlump_t *)(mod_base + l->fileofs);
922 m->nummiptex = LittleLong (m->nummiptex);
923 loadmodel->brushq1.numtextures = m->nummiptex + 2;
928 loadmodel->brushq1.numtextures = 2;
931 loadmodel->brushq1.textures = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numtextures * sizeof(texture_t));
933 // fill out all slots with notexture
934 for (i = 0, tx = loadmodel->brushq1.textures;i < loadmodel->brushq1.numtextures;i++, tx++)
937 strcpy(tx->name, "NO TEXTURE FOUND");
940 tx->skin.base = r_notexture;
941 if (i == loadmodel->brushq1.numtextures - 1)
942 tx->flags = SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
944 tx->flags = SURF_LIGHTMAP | SURF_SOLIDCLIP;
945 tx->currentframe = tx;
951 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
953 // LordHavoc: mostly rewritten map texture loader
954 for (i = 0;i < m->nummiptex;i++)
956 dofs[i] = LittleLong(dofs[i]);
957 if (dofs[i] == -1 || r_nosurftextures.integer)
959 dmiptex = (miptex_t *)((qbyte *)m + dofs[i]);
961 // make sure name is no more than 15 characters
962 for (j = 0;dmiptex->name[j] && j < 15;j++)
963 name[j] = dmiptex->name[j];
966 mtwidth = LittleLong(dmiptex->width);
967 mtheight = LittleLong(dmiptex->height);
969 j = LittleLong(dmiptex->offsets[0]);
973 if (j < 40 || j + mtwidth * mtheight > l->filelen)
975 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
978 mtdata = (qbyte *)dmiptex + j;
981 if ((mtwidth & 15) || (mtheight & 15))
982 Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
984 // LordHavoc: force all names to lowercase
985 for (j = 0;name[j];j++)
986 if (name[j] >= 'A' && name[j] <= 'Z')
987 name[j] += 'a' - 'A';
989 tx = loadmodel->brushq1.textures + i;
990 strcpy(tx->name, name);
992 tx->height = mtheight;
996 sprintf(tx->name, "unnamed%i", i);
997 Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1000 // LordHavoc: HL sky textures are entirely different than quake
1001 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1003 if (loadmodel->isworldmodel)
1005 data = loadimagepixels(tx->name, false, 0, 0);
1008 if (image_width == 256 && image_height == 128)
1016 Con_Printf("Invalid replacement texture for sky \"%s\" in %\"%s\", must be 256x128 pixels\n", tx->name, loadmodel->name);
1018 R_InitSky(mtdata, 1);
1021 else if (mtdata != NULL)
1022 R_InitSky(mtdata, 1);
1027 if (!Mod_LoadSkinFrame(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true, true))
1029 // did not find external texture, load it from the bsp or wad3
1030 if (loadmodel->brush.ishlbsp)
1032 // internal texture overrides wad
1033 qbyte *pixels, *freepixels, *fogpixels;
1034 pixels = freepixels = NULL;
1036 pixels = W_ConvertWAD3Texture(dmiptex);
1038 pixels = freepixels = W_GetTexture(tx->name);
1041 tx->width = image_width;
1042 tx->height = image_height;
1043 tx->skin.base = tx->skin.merged = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, NULL);
1044 if (Image_CheckAlpha(pixels, image_width * image_height, true))
1046 fogpixels = Mem_Alloc(tempmempool, image_width * image_height * 4);
1047 for (j = 0;j < image_width * image_height * 4;j += 4)
1049 fogpixels[j + 0] = 255;
1050 fogpixels[j + 1] = 255;
1051 fogpixels[j + 2] = 255;
1052 fogpixels[j + 3] = pixels[j + 3];
1054 tx->skin.fog = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, NULL);
1055 Mem_Free(fogpixels);
1059 Mem_Free(freepixels);
1061 else if (mtdata) // texture included
1062 Mod_LoadSkinFrame_Internal(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_PICMIP, false, true, tx->name[0] != '*' && r_fullbrights.integer, mtdata, tx->width, tx->height);
1065 if (tx->skin.base == NULL)
1070 tx->skin.base = r_notexture;
1073 if (tx->name[0] == '*')
1075 // turb does not block movement
1076 tx->flags = SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
1077 // LordHavoc: some turbulent textures should be fullbright and solid
1078 if (!strncmp(tx->name,"*lava",5)
1079 || !strncmp(tx->name,"*teleport",9)
1080 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1081 tx->flags |= SURF_DRAWFULLBRIGHT | SURF_DRAWNOALPHA;
1083 tx->flags |= SURF_WATERALPHA;
1085 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1086 tx->flags = SURF_DRAWSKY | SURF_SOLIDCLIP;
1088 tx->flags = SURF_LIGHTMAP | SURF_SOLIDCLIP;
1090 // start out with no animation
1091 tx->currentframe = tx;
1094 // sequence the animations
1095 for (i = 0;i < m->nummiptex;i++)
1097 tx = loadmodel->brushq1.textures + i;
1098 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1100 if (tx->anim_total[0] || tx->anim_total[1])
1101 continue; // already sequenced
1103 // find the number of frames in the animation
1104 memset(anims, 0, sizeof(anims));
1105 memset(altanims, 0, sizeof(altanims));
1107 for (j = i;j < m->nummiptex;j++)
1109 tx2 = loadmodel->brushq1.textures + j;
1110 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1114 if (num >= '0' && num <= '9')
1115 anims[num - '0'] = tx2;
1116 else if (num >= 'a' && num <= 'j')
1117 altanims[num - 'a'] = tx2;
1119 Con_Printf("Bad animating texture %s\n", tx->name);
1123 for (j = 0;j < 10;j++)
1130 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1133 for (j = 0;j < max;j++)
1137 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1141 for (j = 0;j < altmax;j++)
1145 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1154 // if there is no alternate animation, duplicate the primary
1155 // animation into the alternate
1157 for (k = 0;k < 10;k++)
1158 altanims[k] = anims[k];
1161 // link together the primary animation
1162 for (j = 0;j < max;j++)
1165 tx2->animated = true;
1166 tx2->anim_total[0] = max;
1167 tx2->anim_total[1] = altmax;
1168 for (k = 0;k < 10;k++)
1170 tx2->anim_frames[0][k] = anims[k];
1171 tx2->anim_frames[1][k] = altanims[k];
1175 // if there really is an alternate anim...
1176 if (anims[0] != altanims[0])
1178 // link together the alternate animation
1179 for (j = 0;j < altmax;j++)
1182 tx2->animated = true;
1183 // the primary/alternate are reversed here
1184 tx2->anim_total[0] = altmax;
1185 tx2->anim_total[1] = max;
1186 for (k = 0;k < 10;k++)
1188 tx2->anim_frames[0][k] = altanims[k];
1189 tx2->anim_frames[1][k] = anims[k];
1196 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1199 qbyte *in, *out, *data, d;
1200 char litfilename[1024];
1201 loadmodel->brushq1.lightdata = NULL;
1202 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1204 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen);
1205 for (i=0; i<l->filelen; i++)
1206 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1208 else // LordHavoc: bsp version 29 (normal white lighting)
1210 // LordHavoc: hope is not lost yet, check for a .lit file to load
1211 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1212 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1213 strlcat (litfilename, ".lit", sizeof (litfilename));
1214 data = (qbyte*) FS_LoadFile(litfilename, tempmempool, false);
1217 if (fs_filesize > 8 && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1219 i = LittleLong(((int *)data)[1]);
1222 Con_DPrintf("loaded %s\n", litfilename);
1223 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, fs_filesize - 8);
1224 memcpy(loadmodel->brushq1.lightdata, data + 8, fs_filesize - 8);
1230 Con_Printf("Unknown .lit file version (%d)\n", i);
1236 if (fs_filesize == 8)
1237 Con_Print("Empty .lit file, ignoring\n");
1239 Con_Print("Corrupt .lit file (old version?), ignoring\n");
1243 // LordHavoc: oh well, expand the white lighting data
1246 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen*3);
1247 in = loadmodel->brushq1.lightdata + l->filelen*2; // place the file at the end, so it will not be overwritten until the very last write
1248 out = loadmodel->brushq1.lightdata;
1249 memcpy(in, mod_base + l->fileofs, l->filelen);
1250 for (i = 0;i < l->filelen;i++)
1260 static void Mod_Q1BSP_LoadLightList(void)
1262 int a, n, numlights;
1263 char lightsfilename[1024], *s, *t, *lightsstring;
1266 strlcpy (lightsfilename, loadmodel->name, sizeof (lightsfilename));
1267 FS_StripExtension (lightsfilename, lightsfilename, sizeof(lightsfilename));
1268 strlcat (lightsfilename, ".lights", sizeof (lightsfilename));
1269 s = lightsstring = (char *) FS_LoadFile(lightsfilename, tempmempool, false);
1275 while (*s && *s != '\n')
1279 Mem_Free(lightsstring);
1280 Host_Error("lights file must end with a newline\n");
1285 loadmodel->brushq1.lights = Mem_Alloc(loadmodel->mempool, numlights * sizeof(mlight_t));
1288 while (*s && n < numlights)
1291 while (*s && *s != '\n')
1295 Mem_Free(lightsstring);
1296 Host_Error("misparsed lights file!\n");
1298 e = loadmodel->brushq1.lights + n;
1300 a = sscanf(t, "%f %f %f %f %f %f %f %f %f %f %f %f %f %d", &e->origin[0], &e->origin[1], &e->origin[2], &e->falloff, &e->light[0], &e->light[1], &e->light[2], &e->subtract, &e->spotdir[0], &e->spotdir[1], &e->spotdir[2], &e->spotcone, &e->distbias, &e->style);
1304 Mem_Free(lightsstring);
1305 Host_Error("invalid lights file, found %d parameters on line %i, should be 14 parameters (origin[0] origin[1] origin[2] falloff light[0] light[1] light[2] subtract spotdir[0] spotdir[1] spotdir[2] spotcone distancebias style)\n", a, n + 1);
1312 Mem_Free(lightsstring);
1313 Host_Error("misparsed lights file!\n");
1315 loadmodel->brushq1.numlights = numlights;
1316 Mem_Free(lightsstring);
1320 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1322 loadmodel->brushq1.num_compressedpvs = 0;
1323 loadmodel->brushq1.data_compressedpvs = NULL;
1326 loadmodel->brushq1.num_compressedpvs = l->filelen;
1327 loadmodel->brushq1.data_compressedpvs = Mem_Alloc(loadmodel->mempool, l->filelen);
1328 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1331 // used only for HalfLife maps
1332 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1334 char key[128], value[4096];
1339 if (!COM_ParseToken(&data, false))
1341 if (com_token[0] != '{')
1345 if (!COM_ParseToken(&data, false))
1347 if (com_token[0] == '}')
1348 break; // end of worldspawn
1349 if (com_token[0] == '_')
1350 strcpy(key, com_token + 1);
1352 strcpy(key, com_token);
1353 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1354 key[strlen(key)-1] = 0;
1355 if (!COM_ParseToken(&data, false))
1357 strcpy(value, com_token);
1358 if (!strcmp("wad", key)) // for HalfLife maps
1360 if (loadmodel->brush.ishlbsp)
1363 for (i = 0;i < 4096;i++)
1364 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1370 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1371 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1373 else if (value[i] == ';' || value[i] == 0)
1377 strcpy(wadname, "textures/");
1378 strcat(wadname, &value[j]);
1379 W_LoadTextureWadFile(wadname, false);
1391 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1393 loadmodel->brush.entities = NULL;
1396 loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
1397 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1398 if (loadmodel->brush.ishlbsp)
1399 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1403 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1409 in = (void *)(mod_base + l->fileofs);
1410 if (l->filelen % sizeof(*in))
1411 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1412 count = l->filelen / sizeof(*in);
1413 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1415 loadmodel->brushq1.vertexes = out;
1416 loadmodel->brushq1.numvertexes = count;
1418 for ( i=0 ; i<count ; i++, in++, out++)
1420 out->position[0] = LittleFloat(in->point[0]);
1421 out->position[1] = LittleFloat(in->point[1]);
1422 out->position[2] = LittleFloat(in->point[2]);
1426 static void Mod_Q1BSP_LoadSubmodels(lump_t *l)
1432 in = (void *)(mod_base + l->fileofs);
1433 if (l->filelen % sizeof(*in))
1434 Host_Error("Mod_Q1BSP_LoadSubmodels: funny lump size in %s",loadmodel->name);
1435 count = l->filelen / sizeof(*in);
1436 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1438 loadmodel->brushq1.submodels = out;
1439 loadmodel->brush.numsubmodels = count;
1441 for ( i=0 ; i<count ; i++, in++, out++)
1443 for (j=0 ; j<3 ; j++)
1445 // spread the mins / maxs by a pixel
1446 out->mins[j] = LittleFloat(in->mins[j]) - 1;
1447 out->maxs[j] = LittleFloat(in->maxs[j]) + 1;
1448 out->origin[j] = LittleFloat(in->origin[j]);
1450 for (j=0 ; j<MAX_MAP_HULLS ; j++)
1451 out->headnode[j] = LittleLong(in->headnode[j]);
1452 out->visleafs = LittleLong(in->visleafs);
1453 out->firstface = LittleLong(in->firstface);
1454 out->numfaces = LittleLong(in->numfaces);
1458 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1464 in = (void *)(mod_base + l->fileofs);
1465 if (l->filelen % sizeof(*in))
1466 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1467 count = l->filelen / sizeof(*in);
1468 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1470 loadmodel->brushq1.edges = out;
1471 loadmodel->brushq1.numedges = count;
1473 for ( i=0 ; i<count ; i++, in++, out++)
1475 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1476 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1480 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1484 int i, j, k, count, miptex;
1486 in = (void *)(mod_base + l->fileofs);
1487 if (l->filelen % sizeof(*in))
1488 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1489 count = l->filelen / sizeof(*in);
1490 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1492 loadmodel->brushq1.texinfo = out;
1493 loadmodel->brushq1.numtexinfo = count;
1495 for (i = 0;i < count;i++, in++, out++)
1497 for (k = 0;k < 2;k++)
1498 for (j = 0;j < 4;j++)
1499 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1501 miptex = LittleLong(in->miptex);
1502 out->flags = LittleLong(in->flags);
1504 out->texture = NULL;
1505 if (loadmodel->brushq1.textures)
1507 if ((unsigned int) miptex >= (unsigned int) loadmodel->brushq1.numtextures)
1508 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->brushq1.numtextures);
1510 out->texture = loadmodel->brushq1.textures + miptex;
1512 if (out->flags & TEX_SPECIAL)
1514 // if texture chosen is NULL or the shader needs a lightmap,
1515 // force to notexture water shader
1516 if (out->texture == NULL || out->texture->flags & SURF_LIGHTMAP)
1517 out->texture = loadmodel->brushq1.textures + (loadmodel->brushq1.numtextures - 1);
1521 // if texture chosen is NULL, force to notexture
1522 if (out->texture == NULL)
1523 out->texture = loadmodel->brushq1.textures + (loadmodel->brushq1.numtextures - 2);
1529 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1534 mins[0] = mins[1] = mins[2] = 9999;
1535 maxs[0] = maxs[1] = maxs[2] = -9999;
1537 for (i = 0;i < numverts;i++)
1539 for (j = 0;j < 3;j++, v++)
1549 #define MAX_SUBDIVPOLYTRIANGLES 4096
1550 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1552 static int subdivpolyverts, subdivpolytriangles;
1553 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1554 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1556 static int subdivpolylookupvert(vec3_t v)
1559 for (i = 0;i < subdivpolyverts;i++)
1560 if (subdivpolyvert[i][0] == v[0]
1561 && subdivpolyvert[i][1] == v[1]
1562 && subdivpolyvert[i][2] == v[2])
1564 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1565 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1566 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1567 return subdivpolyverts++;
1570 static void SubdividePolygon(int numverts, float *verts)
1572 int i, i1, i2, i3, f, b, c, p;
1573 vec3_t mins, maxs, front[256], back[256];
1574 float m, *pv, *cv, dist[256], frac;
1577 Host_Error("SubdividePolygon: ran out of verts in buffer");
1579 BoundPoly(numverts, verts, mins, maxs);
1581 for (i = 0;i < 3;i++)
1583 m = (mins[i] + maxs[i]) * 0.5;
1584 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1585 if (maxs[i] - m < 8)
1587 if (m - mins[i] < 8)
1591 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1592 dist[c] = cv[i] - m;
1595 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1599 VectorCopy(pv, front[f]);
1604 VectorCopy(pv, back[b]);
1607 if (dist[p] == 0 || dist[c] == 0)
1609 if ((dist[p] > 0) != (dist[c] > 0) )
1612 frac = dist[p] / (dist[p] - dist[c]);
1613 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1614 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1615 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1621 SubdividePolygon(f, front[0]);
1622 SubdividePolygon(b, back[0]);
1626 i1 = subdivpolylookupvert(verts);
1627 i2 = subdivpolylookupvert(verts + 3);
1628 for (i = 2;i < numverts;i++)
1630 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1632 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1636 i3 = subdivpolylookupvert(verts + i * 3);
1637 subdivpolyindex[subdivpolytriangles][0] = i1;
1638 subdivpolyindex[subdivpolytriangles][1] = i2;
1639 subdivpolyindex[subdivpolytriangles][2] = i3;
1641 subdivpolytriangles++;
1645 //Breaks a polygon up along axial 64 unit
1646 //boundaries so that turbulent and sky warps
1647 //can be done reasonably.
1648 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surf)
1654 subdivpolytriangles = 0;
1655 subdivpolyverts = 0;
1656 SubdividePolygon(surf->poly_numverts, surf->poly_verts);
1657 if (subdivpolytriangles < 1)
1658 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?\n");
1660 surf->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
1661 mesh->num_vertices = subdivpolyverts;
1662 mesh->num_triangles = subdivpolytriangles;
1663 mesh->vertex = (surfvertex_t *)(mesh + 1);
1664 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
1665 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
1667 for (i = 0;i < mesh->num_triangles;i++)
1668 for (j = 0;j < 3;j++)
1669 mesh->index[i*3+j] = subdivpolyindex[i][j];
1671 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
1673 VectorCopy(subdivpolyvert[i], v->v);
1674 v->st[0] = DotProduct(v->v, surf->texinfo->vecs[0]);
1675 v->st[1] = DotProduct(v->v, surf->texinfo->vecs[1]);
1680 static surfmesh_t *Mod_Q1BSP_AllocSurfMesh(int numverts, int numtriangles)
1683 mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + numtriangles * sizeof(int[6]) + numverts * (3 + 2 + 2 + 2 + 3 + 3 + 3 + 1) * sizeof(float));
1684 mesh->num_vertices = numverts;
1685 mesh->num_triangles = numtriangles;
1686 mesh->data_vertex3f = (float *)(mesh + 1);
1687 mesh->data_texcoordtexture2f = mesh->data_vertex3f + mesh->num_vertices * 3;
1688 mesh->data_texcoordlightmap2f = mesh->data_texcoordtexture2f + mesh->num_vertices * 2;
1689 mesh->data_texcoorddetail2f = mesh->data_texcoordlightmap2f + mesh->num_vertices * 2;
1690 mesh->data_svector3f = (float *)(mesh->data_texcoorddetail2f + mesh->num_vertices * 2);
1691 mesh->data_tvector3f = mesh->data_svector3f + mesh->num_vertices * 3;
1692 mesh->data_normal3f = mesh->data_tvector3f + mesh->num_vertices * 3;
1693 mesh->data_lightmapoffsets = (int *)(mesh->data_normal3f + mesh->num_vertices * 3);
1694 mesh->data_element3i = mesh->data_lightmapoffsets + mesh->num_vertices;
1695 mesh->data_neighbor3i = mesh->data_element3i + mesh->num_triangles * 3;
1699 static void Mod_Q1BSP_GenerateSurfacePolygon(msurface_t *surf, int firstedge, int numedges)
1702 float *vec, *vert, mins[3], maxs[3], val, *v;
1705 // convert edges back to a normal polygon
1706 surf->poly_numverts = numedges;
1707 vert = surf->poly_verts = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * numedges);
1708 for (i = 0;i < numedges;i++)
1710 lindex = loadmodel->brushq1.surfedges[firstedge + i];
1712 vec = loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position;
1714 vec = loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position;
1715 VectorCopy(vec, vert);
1719 // calculate polygon bounding box and center
1720 vert = surf->poly_verts;
1721 VectorCopy(vert, mins);
1722 VectorCopy(vert, maxs);
1724 for (i = 1;i < surf->poly_numverts;i++, vert += 3)
1726 if (mins[0] > vert[0]) mins[0] = vert[0];if (maxs[0] < vert[0]) maxs[0] = vert[0];
1727 if (mins[1] > vert[1]) mins[1] = vert[1];if (maxs[1] < vert[1]) maxs[1] = vert[1];
1728 if (mins[2] > vert[2]) mins[2] = vert[2];if (maxs[2] < vert[2]) maxs[2] = vert[2];
1730 VectorCopy(mins, surf->poly_mins);
1731 VectorCopy(maxs, surf->poly_maxs);
1732 surf->poly_center[0] = (mins[0] + maxs[0]) * 0.5f;
1733 surf->poly_center[1] = (mins[1] + maxs[1]) * 0.5f;
1734 surf->poly_center[2] = (mins[2] + maxs[2]) * 0.5f;
1736 // generate surface extents information
1737 tex = surf->texinfo;
1738 mins[0] = maxs[0] = DotProduct(surf->poly_verts, tex->vecs[0]) + tex->vecs[0][3];
1739 mins[1] = maxs[1] = DotProduct(surf->poly_verts, tex->vecs[1]) + tex->vecs[1][3];
1740 for (i = 1, v = surf->poly_verts + 3;i < surf->poly_numverts;i++, v += 3)
1742 for (j = 0;j < 2;j++)
1744 val = DotProduct(v, tex->vecs[j]) + tex->vecs[j][3];
1751 for (i = 0;i < 2;i++)
1753 surf->texturemins[i] = (int) floor(mins[i] / 16) * 16;
1754 surf->extents[i] = (int) ceil(maxs[i] / 16) * 16 - surf->texturemins[i];
1758 static void Mod_Q1BSP_LoadFaces(lump_t *l)
1762 int i, count, surfnum, planenum, ssize, tsize, firstedge, numedges, totalverts, totaltris, totalmeshes;
1766 in = (void *)(mod_base + l->fileofs);
1767 if (l->filelen % sizeof(*in))
1768 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
1769 count = l->filelen / sizeof(*in);
1770 loadmodel->brushq1.surfaces = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
1772 loadmodel->brushq1.numsurfaces = count;
1773 loadmodel->brushq1.surfacevisframes = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
1774 loadmodel->brushq1.surfacepvsframes = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
1775 loadmodel->brushq1.pvssurflist = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
1777 for (surfnum = 0, surf = loadmodel->brushq1.surfaces, totalverts = 0, totaltris = 0, totalmeshes = 0;surfnum < count;surfnum++, totalverts += surf->poly_numverts, totaltris += surf->poly_numverts - 2, totalmeshes++, in++, surf++)
1779 surf->number = surfnum;
1780 // FIXME: validate edges, texinfo, etc?
1781 firstedge = LittleLong(in->firstedge);
1782 numedges = LittleShort(in->numedges);
1783 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)
1784 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)\n", firstedge, numedges, loadmodel->brushq1.numsurfedges);
1785 i = LittleShort(in->texinfo);
1786 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
1787 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)\n", i, loadmodel->brushq1.numtexinfo);
1788 surf->texinfo = loadmodel->brushq1.texinfo + i;
1789 surf->flags = surf->texinfo->texture->flags;
1791 planenum = LittleShort(in->planenum);
1792 if ((unsigned int) planenum >= (unsigned int) loadmodel->brushq1.numplanes)
1793 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)\n", planenum, loadmodel->brushq1.numplanes);
1795 if (LittleShort(in->side))
1796 surf->flags |= SURF_PLANEBACK;
1798 surf->plane = loadmodel->brushq1.planes + planenum;
1800 // clear lightmap (filled in later)
1801 surf->lightmaptexture = NULL;
1803 // force lightmap upload on first time seeing the surface
1804 surf->cached_dlight = true;
1806 Mod_Q1BSP_GenerateSurfacePolygon(surf, firstedge, numedges);
1808 ssize = (surf->extents[0] >> 4) + 1;
1809 tsize = (surf->extents[1] >> 4) + 1;
1812 for (i = 0;i < MAXLIGHTMAPS;i++)
1813 surf->styles[i] = in->styles[i];
1814 i = LittleLong(in->lightofs);
1816 surf->samples = NULL;
1817 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
1818 surf->samples = loadmodel->brushq1.lightdata + i;
1819 else // LordHavoc: white lighting (bsp version 29)
1820 surf->samples = loadmodel->brushq1.lightdata + (i * 3);
1822 if (surf->texinfo->texture->flags & SURF_LIGHTMAP)
1824 if ((surf->extents[0] >> 4) + 1 > (256) || (surf->extents[1] >> 4) + 1 > (256))
1825 Host_Error("Bad surface extents");
1826 // stainmap for permanent marks on walls
1827 surf->stainsamples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
1829 memset(surf->stainsamples, 255, ssize * tsize * 3);
1833 loadmodel->brushq1.entiremesh = Mod_Q1BSP_AllocSurfMesh(totalverts, totaltris);
1835 for (surfnum = 0, surf = loadmodel->brushq1.surfaces, totalverts = 0, totaltris = 0, totalmeshes = 0;surfnum < count;surfnum++, totalverts += surf->poly_numverts, totaltris += surf->poly_numverts - 2, totalmeshes++, surf++)
1838 mesh->num_vertices = surf->poly_numverts;
1839 mesh->num_triangles = surf->poly_numverts - 2;
1840 mesh->data_vertex3f = loadmodel->brushq1.entiremesh->data_vertex3f + totalverts * 3;
1841 mesh->data_texcoordtexture2f = loadmodel->brushq1.entiremesh->data_texcoordtexture2f + totalverts * 2;
1842 mesh->data_texcoordlightmap2f = loadmodel->brushq1.entiremesh->data_texcoordlightmap2f + totalverts * 2;
1843 mesh->data_texcoorddetail2f = loadmodel->brushq1.entiremesh->data_texcoorddetail2f + totalverts * 2;
1844 mesh->data_svector3f = loadmodel->brushq1.entiremesh->data_svector3f + totalverts * 3;
1845 mesh->data_tvector3f = loadmodel->brushq1.entiremesh->data_tvector3f + totalverts * 3;
1846 mesh->data_normal3f = loadmodel->brushq1.entiremesh->data_normal3f + totalverts * 3;
1847 mesh->data_lightmapoffsets = loadmodel->brushq1.entiremesh->data_lightmapoffsets + totalverts;
1848 mesh->data_element3i = loadmodel->brushq1.entiremesh->data_element3i + totaltris * 3;
1849 mesh->data_neighbor3i = loadmodel->brushq1.entiremesh->data_neighbor3i + totaltris * 3;
1851 surf->lightmaptexturestride = 0;
1852 surf->lightmaptexture = NULL;
1854 for (i = 0;i < mesh->num_vertices;i++)
1856 mesh->data_vertex3f[i * 3 + 0] = surf->poly_verts[i * 3 + 0];
1857 mesh->data_vertex3f[i * 3 + 1] = surf->poly_verts[i * 3 + 1];
1858 mesh->data_vertex3f[i * 3 + 2] = surf->poly_verts[i * 3 + 2];
1859 s = DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3];
1860 t = DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3];
1861 mesh->data_texcoordtexture2f[i * 2 + 0] = s / surf->texinfo->texture->width;
1862 mesh->data_texcoordtexture2f[i * 2 + 1] = t / surf->texinfo->texture->height;
1863 mesh->data_texcoorddetail2f[i * 2 + 0] = s * (1.0f / 16.0f);
1864 mesh->data_texcoorddetail2f[i * 2 + 1] = t * (1.0f / 16.0f);
1865 mesh->data_texcoordlightmap2f[i * 2 + 0] = 0;
1866 mesh->data_texcoordlightmap2f[i * 2 + 1] = 0;
1867 mesh->data_lightmapoffsets[i] = 0;
1870 for (i = 0;i < mesh->num_triangles;i++)
1872 mesh->data_element3i[i * 3 + 0] = 0;
1873 mesh->data_element3i[i * 3 + 1] = i + 1;
1874 mesh->data_element3i[i * 3 + 2] = i + 2;
1877 Mod_BuildTriangleNeighbors(mesh->data_neighbor3i, mesh->data_element3i, mesh->num_triangles);
1878 Mod_BuildTextureVectorsAndNormals(mesh->num_vertices, mesh->num_triangles, mesh->data_vertex3f, mesh->data_texcoordtexture2f, mesh->data_element3i, mesh->data_svector3f, mesh->data_tvector3f, mesh->data_normal3f);
1880 if (surf->texinfo->texture->flags & SURF_LIGHTMAP)
1882 int i, iu, iv, smax, tmax;
1883 float u, v, ubase, vbase, uscale, vscale;
1885 smax = surf->extents[0] >> 4;
1886 tmax = surf->extents[1] >> 4;
1888 if (r_miplightmaps.integer)
1890 surf->lightmaptexturestride = smax+1;
1891 surf->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surf->lightmaptexturestride, (surf->extents[1]>>4)+1, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_MIPMAP | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
1895 surf->lightmaptexturestride = R_CompatibleFragmentWidth(smax+1, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, 0);
1896 surf->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surf->lightmaptexturestride, (surf->extents[1]>>4)+1, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FRAGMENT | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
1898 R_FragmentLocation(surf->lightmaptexture, NULL, NULL, &ubase, &vbase, &uscale, &vscale);
1899 uscale = (uscale - ubase) / (smax + 1);
1900 vscale = (vscale - vbase) / (tmax + 1);
1902 for (i = 0;i < mesh->num_vertices;i++)
1904 u = ((DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3]) + 8 - surf->texturemins[0]) * (1.0 / 16.0);
1905 v = ((DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3]) + 8 - surf->texturemins[1]) * (1.0 / 16.0);
1906 mesh->data_texcoordlightmap2f[i * 2 + 0] = u * uscale + ubase;
1907 mesh->data_texcoordlightmap2f[i * 2 + 1] = v * vscale + vbase;
1908 // LordHavoc: calc lightmap data offset for vertex lighting to use
1911 mesh->data_lightmapoffsets[i] = (bound(0, iv, tmax) * (smax+1) + bound(0, iu, smax)) * 3;
1917 static void Mod_Q1BSP_SetParent(mnode_t *node, mnode_t *parent)
1919 node->parent = parent;
1920 if (node->contents < 0)
1922 Mod_Q1BSP_SetParent(node->children[0], node);
1923 Mod_Q1BSP_SetParent(node->children[1], node);
1926 static void Mod_Q1BSP_LoadNodes(lump_t *l)
1932 in = (void *)(mod_base + l->fileofs);
1933 if (l->filelen % sizeof(*in))
1934 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
1935 count = l->filelen / sizeof(*in);
1936 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1938 loadmodel->brushq1.nodes = out;
1939 loadmodel->brushq1.numnodes = count;
1941 for ( i=0 ; i<count ; i++, in++, out++)
1943 for (j=0 ; j<3 ; j++)
1945 out->mins[j] = LittleShort(in->mins[j]);
1946 out->maxs[j] = LittleShort(in->maxs[j]);
1949 p = LittleLong(in->planenum);
1950 out->plane = loadmodel->brushq1.planes + p;
1952 out->firstsurface = LittleShort(in->firstface);
1953 out->numsurfaces = LittleShort(in->numfaces);
1955 for (j=0 ; j<2 ; j++)
1957 p = LittleShort(in->children[j]);
1959 out->children[j] = loadmodel->brushq1.nodes + p;
1961 out->children[j] = (mnode_t *)(loadmodel->brushq1.data_leafs + (-1 - p));
1965 Mod_Q1BSP_SetParent(loadmodel->brushq1.nodes, NULL); // sets nodes and leafs
1968 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
1974 in = (void *)(mod_base + l->fileofs);
1975 if (l->filelen % sizeof(*in))
1976 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
1977 count = l->filelen / sizeof(*in);
1978 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1980 loadmodel->brushq1.data_leafs = out;
1981 loadmodel->brushq1.num_leafs = count;
1982 // get visleafs from the submodel data
1983 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
1984 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
1985 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
1986 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
1988 for ( i=0 ; i<count ; i++, in++, out++)
1990 for (j=0 ; j<3 ; j++)
1992 out->mins[j] = LittleShort(in->mins[j]);
1993 out->maxs[j] = LittleShort(in->maxs[j]);
1996 // FIXME: this function could really benefit from some error checking
1998 out->contents = LittleLong(in->contents);
2000 out->firstmarksurface = loadmodel->brushq1.marksurfaces + LittleShort(in->firstmarksurface);
2001 out->nummarksurfaces = LittleShort(in->nummarksurfaces);
2002 if (out->firstmarksurface < 0 || LittleShort(in->firstmarksurface) + out->nummarksurfaces > loadmodel->brushq1.nummarksurfaces)
2004 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid marksurface range %i:%i outside range %i:%i\n", out->firstmarksurface, out->firstmarksurface + out->nummarksurfaces, 0, loadmodel->brushq1.nummarksurfaces);
2005 out->firstmarksurface = NULL;
2006 out->nummarksurfaces = 0;
2009 out->clusterindex = i - 1;
2010 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2011 out->clusterindex = -1;
2013 p = LittleLong(in->visofs);
2014 // ignore visofs errors on leaf 0 (solid)
2015 if (p >= 0 && out->clusterindex >= 0)
2017 if (p >= loadmodel->brushq1.num_compressedpvs)
2018 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2020 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);
2023 for (j = 0;j < 4;j++)
2024 out->ambient_sound_level[j] = in->ambient_level[j];
2026 // FIXME: Insert caustics here
2030 static void Mod_Q1BSP_LoadClipnodes(lump_t *l)
2032 dclipnode_t *in, *out;
2036 in = (void *)(mod_base + l->fileofs);
2037 if (l->filelen % sizeof(*in))
2038 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2039 count = l->filelen / sizeof(*in);
2040 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2042 loadmodel->brushq1.clipnodes = out;
2043 loadmodel->brushq1.numclipnodes = count;
2045 if (loadmodel->brush.ishlbsp)
2047 hull = &loadmodel->brushq1.hulls[1];
2048 hull->clipnodes = out;
2049 hull->firstclipnode = 0;
2050 hull->lastclipnode = count-1;
2051 hull->planes = loadmodel->brushq1.planes;
2052 hull->clip_mins[0] = -16;
2053 hull->clip_mins[1] = -16;
2054 hull->clip_mins[2] = -36;
2055 hull->clip_maxs[0] = 16;
2056 hull->clip_maxs[1] = 16;
2057 hull->clip_maxs[2] = 36;
2058 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2060 hull = &loadmodel->brushq1.hulls[2];
2061 hull->clipnodes = out;
2062 hull->firstclipnode = 0;
2063 hull->lastclipnode = count-1;
2064 hull->planes = loadmodel->brushq1.planes;
2065 hull->clip_mins[0] = -32;
2066 hull->clip_mins[1] = -32;
2067 hull->clip_mins[2] = -32;
2068 hull->clip_maxs[0] = 32;
2069 hull->clip_maxs[1] = 32;
2070 hull->clip_maxs[2] = 32;
2071 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2073 hull = &loadmodel->brushq1.hulls[3];
2074 hull->clipnodes = out;
2075 hull->firstclipnode = 0;
2076 hull->lastclipnode = count-1;
2077 hull->planes = loadmodel->brushq1.planes;
2078 hull->clip_mins[0] = -16;
2079 hull->clip_mins[1] = -16;
2080 hull->clip_mins[2] = -18;
2081 hull->clip_maxs[0] = 16;
2082 hull->clip_maxs[1] = 16;
2083 hull->clip_maxs[2] = 18;
2084 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2088 hull = &loadmodel->brushq1.hulls[1];
2089 hull->clipnodes = out;
2090 hull->firstclipnode = 0;
2091 hull->lastclipnode = count-1;
2092 hull->planes = loadmodel->brushq1.planes;
2093 hull->clip_mins[0] = -16;
2094 hull->clip_mins[1] = -16;
2095 hull->clip_mins[2] = -24;
2096 hull->clip_maxs[0] = 16;
2097 hull->clip_maxs[1] = 16;
2098 hull->clip_maxs[2] = 32;
2099 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2101 hull = &loadmodel->brushq1.hulls[2];
2102 hull->clipnodes = out;
2103 hull->firstclipnode = 0;
2104 hull->lastclipnode = count-1;
2105 hull->planes = loadmodel->brushq1.planes;
2106 hull->clip_mins[0] = -32;
2107 hull->clip_mins[1] = -32;
2108 hull->clip_mins[2] = -24;
2109 hull->clip_maxs[0] = 32;
2110 hull->clip_maxs[1] = 32;
2111 hull->clip_maxs[2] = 64;
2112 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2115 for (i=0 ; i<count ; i++, out++, in++)
2117 out->planenum = LittleLong(in->planenum);
2118 out->children[0] = LittleShort(in->children[0]);
2119 out->children[1] = LittleShort(in->children[1]);
2120 if (out->children[0] >= count || out->children[1] >= count)
2121 Host_Error("Corrupt clipping hull(out of range child)\n");
2125 //Duplicate the drawing hull structure as a clipping hull
2126 static void Mod_Q1BSP_MakeHull0(void)
2133 hull = &loadmodel->brushq1.hulls[0];
2135 in = loadmodel->brushq1.nodes;
2136 out = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numnodes * sizeof(dclipnode_t));
2138 hull->clipnodes = out;
2139 hull->firstclipnode = 0;
2140 hull->lastclipnode = loadmodel->brushq1.numnodes - 1;
2141 hull->planes = loadmodel->brushq1.planes;
2143 for (i = 0;i < loadmodel->brushq1.numnodes;i++, out++, in++)
2145 out->planenum = in->plane - loadmodel->brushq1.planes;
2146 out->children[0] = in->children[0]->contents < 0 ? in->children[0]->contents : in->children[0] - loadmodel->brushq1.nodes;
2147 out->children[1] = in->children[1]->contents < 0 ? in->children[1]->contents : in->children[1] - loadmodel->brushq1.nodes;
2151 static void Mod_Q1BSP_LoadMarksurfaces(lump_t *l)
2156 in = (void *)(mod_base + l->fileofs);
2157 if (l->filelen % sizeof(*in))
2158 Host_Error("Mod_Q1BSP_LoadMarksurfaces: funny lump size in %s",loadmodel->name);
2159 loadmodel->brushq1.nummarksurfaces = l->filelen / sizeof(*in);
2160 loadmodel->brushq1.marksurfaces = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.nummarksurfaces * sizeof(int));
2162 for (i = 0;i < loadmodel->brushq1.nummarksurfaces;i++)
2164 j = (unsigned) LittleShort(in[i]);
2165 if (j >= loadmodel->brushq1.numsurfaces)
2166 Host_Error("Mod_Q1BSP_LoadMarksurfaces: bad surface number");
2167 loadmodel->brushq1.marksurfaces[i] = j;
2171 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2176 in = (void *)(mod_base + l->fileofs);
2177 if (l->filelen % sizeof(*in))
2178 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2179 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2180 loadmodel->brushq1.surfedges = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2182 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2183 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2187 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2193 in = (void *)(mod_base + l->fileofs);
2194 if (l->filelen % sizeof(*in))
2195 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2197 loadmodel->brushq1.numplanes = l->filelen / sizeof(*in);
2198 loadmodel->brushq1.planes = out = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numplanes * sizeof(*out));
2200 for (i = 0;i < loadmodel->brushq1.numplanes;i++, in++, out++)
2202 out->normal[0] = LittleFloat(in->normal[0]);
2203 out->normal[1] = LittleFloat(in->normal[1]);
2204 out->normal[2] = LittleFloat(in->normal[2]);
2205 out->dist = LittleFloat(in->dist);
2211 #define MAX_PORTALPOINTS 64
2213 typedef struct portal_s
2216 mnode_t *nodes[2]; // [0] = front side of plane
2217 struct portal_s *next[2];
2219 double points[3*MAX_PORTALPOINTS];
2220 struct portal_s *chain; // all portals are linked into a list
2224 static portal_t *portalchain;
2231 static portal_t *AllocPortal(void)
2234 p = Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2235 p->chain = portalchain;
2240 static void FreePortal(portal_t *p)
2245 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2247 // calculate children first
2248 if (node->children[0]->contents >= 0)
2249 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2250 if (node->children[1]->contents >= 0)
2251 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2253 // make combined bounding box from children
2254 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2255 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2256 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2257 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2258 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2259 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2262 static void Mod_Q1BSP_FinalizePortals(void)
2264 int i, j, numportals, numpoints;
2265 portal_t *p, *pnext;
2268 mleaf_t *leaf, *endleaf;
2270 // recalculate bounding boxes for all leafs(because qbsp is very sloppy)
2271 leaf = loadmodel->brushq1.data_leafs;
2272 endleaf = leaf + loadmodel->brushq1.num_leafs;
2273 for (;leaf < endleaf;leaf++)
2275 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2276 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2281 if (p->numpoints >= 3)
2283 for (i = 0;i < 2;i++)
2285 leaf = (mleaf_t *)p->nodes[i];
2286 for (j = 0;j < p->numpoints;j++)
2288 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2289 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2290 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2291 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2292 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2293 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2300 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brushq1.nodes);
2302 // tally up portal and point counts
2308 // note: this check must match the one below or it will usually corrupt memory
2309 // 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
2310 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1]
2311 && p->nodes[0]->contents != CONTENTS_SOLID && p->nodes[1]->contents != CONTENTS_SOLID
2312 && p->nodes[0]->contents != CONTENTS_SKY && p->nodes[1]->contents != CONTENTS_SKY)
2315 numpoints += p->numpoints * 2;
2319 loadmodel->brushq1.portals = Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2320 loadmodel->brushq1.numportals = numportals;
2321 loadmodel->brushq1.portalpoints = (void *)((qbyte *) loadmodel->brushq1.portals + numportals * sizeof(mportal_t));
2322 loadmodel->brushq1.numportalpoints = numpoints;
2323 // clear all leaf portal chains
2324 for (i = 0;i < loadmodel->brushq1.num_leafs;i++)
2325 loadmodel->brushq1.data_leafs[i].portals = NULL;
2326 // process all portals in the global portal chain, while freeing them
2327 portal = loadmodel->brushq1.portals;
2328 point = loadmodel->brushq1.portalpoints;
2335 if (p->numpoints >= 3)
2337 // note: this check must match the one above or it will usually corrupt memory
2338 // 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
2339 if (p->nodes[0] != p->nodes[1]
2340 && p->nodes[0]->contents != CONTENTS_SOLID && p->nodes[1]->contents != CONTENTS_SOLID
2341 && p->nodes[0]->contents != CONTENTS_SKY && p->nodes[1]->contents != CONTENTS_SKY)
2343 // first make the back to front portal(forward portal)
2344 portal->points = point;
2345 portal->numpoints = p->numpoints;
2346 portal->plane.dist = p->plane.dist;
2347 VectorCopy(p->plane.normal, portal->plane.normal);
2348 portal->here = (mleaf_t *)p->nodes[1];
2349 portal->past = (mleaf_t *)p->nodes[0];
2351 for (j = 0;j < portal->numpoints;j++)
2353 VectorCopy(p->points + j*3, point->position);
2356 PlaneClassify(&portal->plane);
2358 // link into leaf's portal chain
2359 portal->next = portal->here->portals;
2360 portal->here->portals = portal;
2362 // advance to next portal
2365 // then make the front to back portal(backward portal)
2366 portal->points = point;
2367 portal->numpoints = p->numpoints;
2368 portal->plane.dist = -p->plane.dist;
2369 VectorNegate(p->plane.normal, portal->plane.normal);
2370 portal->here = (mleaf_t *)p->nodes[0];
2371 portal->past = (mleaf_t *)p->nodes[1];
2373 for (j = portal->numpoints - 1;j >= 0;j--)
2375 VectorCopy(p->points + j*3, point->position);
2378 PlaneClassify(&portal->plane);
2380 // link into leaf's portal chain
2381 portal->next = portal->here->portals;
2382 portal->here->portals = portal;
2384 // advance to next portal
2398 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2401 Host_Error("AddPortalToNodes: NULL front node");
2403 Host_Error("AddPortalToNodes: NULL back node");
2404 if (p->nodes[0] || p->nodes[1])
2405 Host_Error("AddPortalToNodes: already included");
2406 // 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
2408 p->nodes[0] = front;
2409 p->next[0] = (portal_t *)front->portals;
2410 front->portals = (mportal_t *)p;
2413 p->next[1] = (portal_t *)back->portals;
2414 back->portals = (mportal_t *)p;
2419 RemovePortalFromNode
2422 static void RemovePortalFromNodes(portal_t *portal)
2426 void **portalpointer;
2428 for (i = 0;i < 2;i++)
2430 node = portal->nodes[i];
2432 portalpointer = (void **) &node->portals;
2437 Host_Error("RemovePortalFromNodes: portal not in leaf");
2441 if (portal->nodes[0] == node)
2443 *portalpointer = portal->next[0];
2444 portal->nodes[0] = NULL;
2446 else if (portal->nodes[1] == node)
2448 *portalpointer = portal->next[1];
2449 portal->nodes[1] = NULL;
2452 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2456 if (t->nodes[0] == node)
2457 portalpointer = (void **) &t->next[0];
2458 else if (t->nodes[1] == node)
2459 portalpointer = (void **) &t->next[1];
2461 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2466 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2469 mnode_t *front, *back, *other_node;
2470 mplane_t clipplane, *plane;
2471 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2472 int numfrontpoints, numbackpoints;
2473 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2475 // if a leaf, we're done
2479 plane = node->plane;
2481 front = node->children[0];
2482 back = node->children[1];
2484 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2486 // create the new portal by generating a polygon for the node plane,
2487 // and clipping it by all of the other portals(which came from nodes above this one)
2488 nodeportal = AllocPortal();
2489 nodeportal->plane = *plane;
2491 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);
2492 nodeportal->numpoints = 4;
2493 side = 0; // shut up compiler warning
2494 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2496 clipplane = portal->plane;
2497 if (portal->nodes[0] == portal->nodes[1])
2498 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2499 if (portal->nodes[0] == node)
2501 else if (portal->nodes[1] == node)
2503 clipplane.dist = -clipplane.dist;
2504 VectorNegate(clipplane.normal, clipplane.normal);
2508 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2510 for (i = 0;i < nodeportal->numpoints*3;i++)
2511 frontpoints[i] = nodeportal->points[i];
2512 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, 1.0/32.0, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL);
2513 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
2517 if (nodeportal->numpoints < 3)
2519 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2520 nodeportal->numpoints = 0;
2522 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
2524 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
2525 nodeportal->numpoints = 0;
2529 AddPortalToNodes(nodeportal, front, back);
2531 // split the portals of this node along this node's plane and assign them to the children of this node
2532 // (migrating the portals downward through the tree)
2533 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2535 if (portal->nodes[0] == portal->nodes[1])
2536 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2537 if (portal->nodes[0] == node)
2539 else if (portal->nodes[1] == node)
2542 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2543 nextportal = portal->next[side];
2545 other_node = portal->nodes[!side];
2546 RemovePortalFromNodes(portal);
2548 // cut the portal into two portals, one on each side of the node plane
2549 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, 1.0/32.0, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints);
2551 if (!numfrontpoints)
2554 AddPortalToNodes(portal, back, other_node);
2556 AddPortalToNodes(portal, other_node, back);
2562 AddPortalToNodes(portal, front, other_node);
2564 AddPortalToNodes(portal, other_node, front);
2568 // the portal is split
2569 splitportal = AllocPortal();
2570 temp = splitportal->chain;
2571 *splitportal = *portal;
2572 splitportal->chain = temp;
2573 for (i = 0;i < numbackpoints*3;i++)
2574 splitportal->points[i] = backpoints[i];
2575 splitportal->numpoints = numbackpoints;
2576 for (i = 0;i < numfrontpoints*3;i++)
2577 portal->points[i] = frontpoints[i];
2578 portal->numpoints = numfrontpoints;
2582 AddPortalToNodes(portal, front, other_node);
2583 AddPortalToNodes(splitportal, back, other_node);
2587 AddPortalToNodes(portal, other_node, front);
2588 AddPortalToNodes(splitportal, other_node, back);
2593 Mod_Q1BSP_RecursiveNodePortals(front);
2594 Mod_Q1BSP_RecursiveNodePortals(back);
2597 static void Mod_Q1BSP_MakePortals(void)
2600 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brushq1.nodes);
2601 Mod_Q1BSP_FinalizePortals();
2604 static void Mod_Q1BSP_BuildSurfaceNeighbors(msurface_t *surfaces, int numsurfaces, mempool_t *mempool)
2607 int surfnum, vertnum, vertnum2, snum, vnum, vnum2;
2608 msurface_t *surf, *s;
2609 float *v0, *v1, *v2, *v3;
2610 for (surf = surfaces, surfnum = 0;surfnum < numsurfaces;surf++, surfnum++)
2611 surf->neighborsurfaces = Mem_Alloc(mempool, surf->poly_numverts * sizeof(msurface_t *));
2612 for (surf = surfaces, surfnum = 0;surfnum < numsurfaces;surf++, surfnum++)
2614 for (vertnum = surf->poly_numverts - 1, vertnum2 = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = surf->poly_verts;vertnum2 < surf->poly_numverts;vertnum = vertnum2, vertnum2++, v0 = v1, v1 += 3)
2616 if (surf->neighborsurfaces[vertnum])
2618 surf->neighborsurfaces[vertnum] = NULL;
2619 for (s = surfaces, snum = 0;snum < numsurfaces;s++, snum++)
2621 if (s->poly_mins[0] > (surf->poly_maxs[0] + 1) || s->poly_maxs[0] < (surf->poly_mins[0] - 1)
2622 || s->poly_mins[1] > (surf->poly_maxs[1] + 1) || s->poly_maxs[1] < (surf->poly_mins[1] - 1)
2623 || s->poly_mins[2] > (surf->poly_maxs[2] + 1) || s->poly_maxs[2] < (surf->poly_mins[2] - 1)
2626 for (vnum = 0;vnum < s->poly_numverts;vnum++)
2627 if (s->neighborsurfaces[vnum] == surf)
2629 if (vnum < s->poly_numverts)
2631 for (vnum = s->poly_numverts - 1, vnum2 = 0, v2 = s->poly_verts + (s->poly_numverts - 1) * 3, v3 = s->poly_verts;vnum2 < s->poly_numverts;vnum = vnum2, vnum2++, v2 = v3, v3 += 3)
2633 if (s->neighborsurfaces[vnum] == NULL
2634 && ((v0[0] == v2[0] && v0[1] == v2[1] && v0[2] == v2[2] && v1[0] == v3[0] && v1[1] == v3[1] && v1[2] == v3[2])
2635 || (v1[0] == v2[0] && v1[1] == v2[1] && v1[2] == v2[2] && v0[0] == v3[0] && v0[1] == v3[1] && v0[2] == v3[2])))
2637 surf->neighborsurfaces[vertnum] = s;
2638 s->neighborsurfaces[vnum] = surf;
2642 if (vnum < s->poly_numverts)
2650 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2652 int i, j, stylecounts[256], totalcount, remapstyles[256];
2654 memset(stylecounts, 0, sizeof(stylecounts));
2655 for (i = 0;i < model->nummodelsurfaces;i++)
2657 surf = model->brushq1.surfaces + model->firstmodelsurface + i;
2658 for (j = 0;j < MAXLIGHTMAPS;j++)
2659 stylecounts[surf->styles[j]]++;
2662 model->brushq1.light_styles = 0;
2663 for (i = 0;i < 255;i++)
2667 remapstyles[i] = model->brushq1.light_styles++;
2668 totalcount += stylecounts[i] + 1;
2673 model->brushq1.light_style = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(qbyte));
2674 model->brushq1.light_stylevalue = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
2675 model->brushq1.light_styleupdatechains = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
2676 model->brushq1.light_styleupdatechainsbuffer = Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
2677 model->brushq1.light_styles = 0;
2678 for (i = 0;i < 255;i++)
2680 model->brushq1.light_style[model->brushq1.light_styles++] = i;
2682 for (i = 0;i < model->brushq1.light_styles;i++)
2684 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2685 j += stylecounts[model->brushq1.light_style[i]] + 1;
2687 for (i = 0;i < model->nummodelsurfaces;i++)
2689 surf = model->brushq1.surfaces + model->firstmodelsurface + i;
2690 for (j = 0;j < MAXLIGHTMAPS;j++)
2691 if (surf->styles[j] != 255)
2692 *model->brushq1.light_styleupdatechains[remapstyles[surf->styles[j]]]++ = surf;
2695 for (i = 0;i < model->brushq1.light_styles;i++)
2697 *model->brushq1.light_styleupdatechains[i] = NULL;
2698 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2699 j += stylecounts[model->brushq1.light_style[i]] + 1;
2703 static void Mod_Q1BSP_BuildPVSTextureChains(model_t *model)
2706 for (i = 0;i < model->brushq1.numtextures;i++)
2707 model->brushq1.pvstexturechainslength[i] = 0;
2708 for (i = 0, j = model->firstmodelsurface;i < model->nummodelsurfaces;i++, j++)
2710 if (model->brushq1.surfacepvsframes[j] == model->brushq1.pvsframecount)
2712 model->brushq1.pvssurflist[model->brushq1.pvssurflistlength++] = j;
2713 model->brushq1.pvstexturechainslength[model->brushq1.surfaces[j].texinfo->texture->number]++;
2716 for (i = 0, j = 0;i < model->brushq1.numtextures;i++)
2718 if (model->brushq1.pvstexturechainslength[i])
2720 model->brushq1.pvstexturechains[i] = model->brushq1.pvstexturechainsbuffer + j;
2721 j += model->brushq1.pvstexturechainslength[i] + 1;
2724 model->brushq1.pvstexturechains[i] = NULL;
2726 for (i = 0, j = model->firstmodelsurface;i < model->nummodelsurfaces;i++, j++)
2727 if (model->brushq1.surfacepvsframes[j] == model->brushq1.pvsframecount)
2728 *model->brushq1.pvstexturechains[model->brushq1.surfaces[j].texinfo->texture->number]++ = model->brushq1.surfaces + j;
2729 for (i = 0;i < model->brushq1.numtextures;i++)
2731 if (model->brushq1.pvstexturechainslength[i])
2733 *model->brushq1.pvstexturechains[i] = NULL;
2734 model->brushq1.pvstexturechains[i] -= model->brushq1.pvstexturechainslength[i];
2739 //Returns PVS data for a given point
2740 //(note: can return NULL)
2741 static qbyte *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
2744 Mod_CheckLoaded(model);
2745 node = model->brushq1.nodes;
2747 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
2748 if (((mleaf_t *)node)->clusterindex >= 0)
2749 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2754 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, mnode_t *node)
2758 float d = PlaneDiff(org, node->plane);
2760 node = node->children[0];
2761 else if (d < -radius)
2762 node = node->children[1];
2765 // go down both sides
2766 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
2767 node = node->children[1];
2770 // if this leaf is in a cluster, accumulate the pvs bits
2771 if (((mleaf_t *)node)->clusterindex >= 0)
2774 qbyte *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2775 for (i = 0;i < pvsbytes;i++)
2776 pvsbuffer[i] |= pvs[i];
2780 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
2781 //of the given point.
2782 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
2784 int bytes = ((model->brushq1.num_leafs - 1) + 7) >> 3;
2785 bytes = min(bytes, pvsbufferlength);
2786 if (r_novis.integer || !Mod_Q1BSP_GetPVS(model, org))
2788 memset(pvsbuffer, 0xFF, bytes);
2791 memset(pvsbuffer, 0, bytes);
2792 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brushq1.nodes);
2796 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
2801 VectorSubtract(inmaxs, inmins, size);
2802 if (cmodel->brush.ishlbsp)
2805 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2806 else if (size[0] <= 32)
2808 if (size[2] < 54) // pick the nearest of 36 or 72
2809 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
2811 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
2814 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
2819 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2820 else if (size[0] <= 32)
2821 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
2823 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
2825 VectorCopy(inmins, outmins);
2826 VectorAdd(inmins, hull->clip_size, outmaxs);
2830 void Mod_Q1BSP_RecursiveGetVisible(mnode_t *node, model_t *model, const vec3_t point, const vec3_t mins, const vec3_t maxs, int maxleafs, mleaf_t *leaflist, int *numleafs, int maxsurfaces, msurface_t *surfacelist, int *numsurfaces, const qbyte *pvs)
2835 if (!BoxesOverlap(node->mins, node->maxs, mins, maxs))
2839 Mod_Q1BSP_RecursiveGetVisible(node->children[0], model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces, pvs);
2840 node = node->children[1];
2842 leaf = (mleaf_t *)node;
2843 if ((pvs == NULL || CHECKPVSBIT(pvs, leaf->clusterindex)))
2847 if (maxleafs && *numleafs < maxleafs)
2848 leaflist[(*numleafs)++] = leaf;
2851 for (marksurfacenum = 0;marksurfacenum < leaf->nummarksurfaces;marksurfacenum++)
2853 surf = model->brushq1.surfaces + leaf->firstmarksurface[marksurfacenum];
2854 if (surf->shadowmark != shadowmarkcount)
2856 surf->shadowmark = shadowmarkcount;
2857 if (BoxesOverlap(mins, maxs, surf->poly_mins, surf->poly_maxs) && ((surf->flags & SURF_PLANEBACK) ? PlaneDiff(point, surf->plane) < 0 : PlaneDiff(point, surf->plane) > 0) && *numsurfaces < maxsurfaces)
2858 surfacelist[(*numsurfaces)++] = surf;
2865 void Mod_Q1BSP_GetVisible(model_t *model, const vec3_t point, const vec3_t mins, const vec3_t maxs, int maxleafs, mleaf_t *leaflist, int *numleafs, int maxsurfaces, msurface_t *surfacelist, int *numsurfaces)
2867 // FIXME: support portals
2872 pvs = ent->model->brush.GetPVS(ent->model, relativelightorigin);
2873 Mod_Q1BSP_RecursiveGetVisible(ent->model->brushq1.nodes + ent->model->brushq1.firstclipnode, model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces);
2877 extern void R_Q1BSP_DrawSky(entity_render_t *ent);
2878 extern void R_Q1BSP_Draw(entity_render_t *ent);
2879 extern void R_Q1BSP_GetLightInfo(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, vec3_t outmins, vec3_t outmaxs, int *outclusterlist, qbyte *outclusterpvs, int *outnumclusterspointer, int *outsurfacelist, qbyte *outsurfacepvs, int *outnumsurfacespointer);
2880 extern void R_Q1BSP_DrawShadowVolume(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, int numsurfaces, const int *surfacelist);
2881 extern void R_Q1BSP_DrawLight(entity_render_t *ent, vec3_t relativelightorigin, vec3_t relativeeyeorigin, float lightradius, float *lightcolor, const matrix4x4_t *matrix_modeltolight, const matrix4x4_t *matrix_modeltoattenuationxyz, const matrix4x4_t *matrix_modeltoattenuationz, rtexture_t *lightcubemap, int numsurfaces, const int *surfacelist);
2882 void Mod_Q1BSP_Load(model_t *mod, void *buffer)
2887 mempool_t *mainmempool;
2888 float dist, modelyawradius, modelradius, *vec;
2890 int numshadowmeshtriangles;
2892 mod->type = mod_brushq1;
2894 header = (dheader_t *)buffer;
2896 i = LittleLong(header->version);
2897 if (i != BSPVERSION && i != 30)
2898 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife))", mod->name, i, BSPVERSION);
2899 mod->brush.ishlbsp = i == 30;
2901 mod->soundfromcenter = true;
2902 mod->TraceBox = Mod_Q1BSP_TraceBox;
2903 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
2904 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
2905 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
2906 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
2907 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
2908 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
2909 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
2910 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
2911 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
2912 mod->brushq1.PointInLeaf = Mod_Q1BSP_PointInLeaf;
2913 mod->brushq1.BuildPVSTextureChains = Mod_Q1BSP_BuildPVSTextureChains;
2915 if (loadmodel->isworldmodel)
2917 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
2918 // until we get a texture for it...
2922 // swap all the lumps
2923 mod_base = (qbyte *)header;
2925 header->version = LittleLong(header->version);
2926 for (i = 0;i < HEADER_LUMPS;i++)
2928 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
2929 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
2934 // store which lightmap format to use
2935 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
2937 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
2938 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
2939 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
2940 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
2941 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
2942 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
2943 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
2944 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
2945 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
2946 Mod_Q1BSP_LoadMarksurfaces(&header->lumps[LUMP_MARKSURFACES]);
2947 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
2948 // load submodels before leafs because they contain the number of vis leafs
2949 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS]);
2950 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
2951 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
2952 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES]);
2954 if (!mod->brushq1.lightdata)
2955 mod->brush.LightPoint = NULL;
2957 if (mod->brushq1.data_compressedpvs)
2958 Mem_Free(mod->brushq1.data_compressedpvs);
2959 mod->brushq1.data_compressedpvs = NULL;
2960 mod->brushq1.num_compressedpvs = 0;
2962 Mod_Q1BSP_MakeHull0();
2963 Mod_Q1BSP_MakePortals();
2965 mod->numframes = 2; // regular and alternate animation
2967 mainmempool = mod->mempool;
2969 Mod_Q1BSP_LoadLightList();
2970 loadmodel = loadmodel;
2972 // make a single combined shadow mesh to allow optimized shadow volume creation
2973 numshadowmeshtriangles = 0;
2974 for (j = 0, surf = loadmodel->brushq1.surfaces;j < loadmodel->brushq1.numsurfaces;j++, surf++)
2976 surf->num_firstshadowmeshtriangle = numshadowmeshtriangles;
2977 numshadowmeshtriangles += surf->mesh.num_triangles;
2979 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
2980 for (j = 0, surf = loadmodel->brushq1.surfaces;j < loadmodel->brushq1.numsurfaces;j++, surf++)
2981 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, surf->mesh.data_vertex3f, NULL, NULL, NULL, NULL, surf->mesh.num_triangles, surf->mesh.data_element3i);
2982 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
2983 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
2985 // LordHavoc: to clear the fog around the original quake submodel code, I
2987 // first of all, some background info on the submodels:
2988 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
2989 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
2990 // now the weird for loop itself:
2991 // the loop functions in an odd way, on each iteration it sets up the
2992 // current 'mod' model (which despite the confusing code IS the model of
2993 // the number i), at the end of the loop it duplicates the model to become
2994 // the next submodel, and loops back to set up the new submodel.
2996 // LordHavoc: now the explanation of my sane way (which works identically):
2997 // set up the world model, then on each submodel copy from the world model
2998 // and set up the submodel with the respective model info.
2999 for (i = 0;i < mod->brush.numsubmodels;i++)
3001 // LordHavoc: this code was originally at the end of this loop, but
3002 // has been transformed to something more readable at the start here.
3007 // LordHavoc: only register submodels if it is the world
3008 // (prevents external bsp models from replacing world submodels with
3010 if (!loadmodel->isworldmodel)
3012 // duplicate the basic information
3013 sprintf(name, "*%i", i);
3014 mod = Mod_FindName(name);
3015 // copy the base model to this one
3017 // rename the clone back to its proper name
3018 strcpy(mod->name, name);
3019 // textures and memory belong to the main model
3020 mod->texturepool = NULL;
3021 mod->mempool = NULL;
3024 bm = &mod->brushq1.submodels[i];
3026 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3027 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3029 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3030 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3033 mod->firstmodelsurface = bm->firstface;
3034 mod->nummodelsurfaces = bm->numfaces;
3036 // make the model surface list (used by shadowing/lighting)
3037 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
3038 for (j = 0;j < mod->nummodelsurfaces;j++)
3039 mod->surfacelist[j] = mod->firstmodelsurface + j;
3041 // this gets altered below if sky is used
3042 mod->DrawSky = NULL;
3043 mod->Draw = R_Q1BSP_Draw;
3044 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3045 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3046 mod->DrawLight = R_Q1BSP_DrawLight;
3049 mod->brush.GetPVS = NULL;
3050 mod->brush.FatPVS = NULL;
3051 mod->brush.BoxTouchingPVS = NULL;
3052 mod->brush.LightPoint = NULL;
3053 mod->brush.AmbientSoundLevelsForPoint = NULL;
3055 mod->brushq1.pvstexturechains = Mem_Alloc(loadmodel->mempool, mod->brushq1.numtextures * sizeof(msurface_t **));
3056 mod->brushq1.pvstexturechainsbuffer = Mem_Alloc(loadmodel->mempool,(mod->nummodelsurfaces + mod->brushq1.numtextures) * sizeof(msurface_t *));
3057 mod->brushq1.pvstexturechainslength = Mem_Alloc(loadmodel->mempool, mod->brushq1.numtextures * sizeof(int));
3058 Mod_Q1BSP_BuildPVSTextureChains(mod);
3059 Mod_Q1BSP_BuildLightmapUpdateChains(loadmodel->mempool, mod);
3060 if (mod->nummodelsurfaces)
3062 // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3063 mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3064 mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3067 for (j = 0, surf = &mod->brushq1.surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surf++)
3069 // we only need to have a drawsky function if it is used(usually only on world model)
3070 if (surf->texinfo->texture->flags & SURF_DRAWSKY)
3071 mod->DrawSky = R_Q1BSP_DrawSky;
3072 // LordHavoc: submodels always clip, even if water
3073 if (mod->brush.numsubmodels - 1)
3074 surf->flags |= SURF_SOLIDCLIP;
3075 // calculate bounding shapes
3076 for (k = 0, vec = surf->mesh.data_vertex3f;k < surf->mesh.num_vertices;k++, vec += 3)
3078 if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3079 if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3080 if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3081 if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3082 if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3083 if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3084 dist = vec[0]*vec[0]+vec[1]*vec[1];
3085 if (modelyawradius < dist)
3086 modelyawradius = dist;
3087 dist += vec[2]*vec[2];
3088 if (modelradius < dist)
3092 modelyawradius = sqrt(modelyawradius);
3093 modelradius = sqrt(modelradius);
3094 mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3095 mod->yawmins[2] = mod->normalmins[2];
3096 mod->yawmaxs[2] = mod->normalmaxs[2];
3097 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3098 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3099 mod->radius = modelradius;
3100 mod->radius2 = modelradius * modelradius;
3104 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3105 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3107 Mod_Q1BSP_BuildSurfaceNeighbors(mod->brushq1.surfaces + mod->firstmodelsurface, mod->nummodelsurfaces, loadmodel->mempool);
3109 mod->brushq1.num_visleafs = bm->visleafs;
3112 //Mod_Q1BSP_ProcessLightList();
3114 if (developer.integer)
3115 Con_Printf("Some stats for q1bsp model \"%s\": %i faces, %i nodes, %i leafs, %i visleafs, %i visleafportals\n", loadmodel->name, loadmodel->brushq1.numsurfaces, loadmodel->brushq1.numnodes, loadmodel->brushq1.num_leafs, loadmodel->brushq1.num_visleafs, loadmodel->brushq1.numportals);
3118 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3122 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3129 in = (void *)(mod_base + l->fileofs);
3130 if (l->filelen % sizeof(*in))
3131 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3132 count = l->filelen / sizeof(*in);
3133 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3136 loadmodel->num = count;
3138 for (i = 0;i < count;i++, in++, out++)
3144 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3151 in = (void *)(mod_base + l->fileofs);
3152 if (l->filelen % sizeof(*in))
3153 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3154 count = l->filelen / sizeof(*in);
3155 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3158 loadmodel->num = count;
3160 for (i = 0;i < count;i++, in++, out++)
3166 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3173 in = (void *)(mod_base + l->fileofs);
3174 if (l->filelen % sizeof(*in))
3175 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3176 count = l->filelen / sizeof(*in);
3177 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3180 loadmodel->num = count;
3182 for (i = 0;i < count;i++, in++, out++)
3188 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3195 in = (void *)(mod_base + l->fileofs);
3196 if (l->filelen % sizeof(*in))
3197 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3198 count = l->filelen / sizeof(*in);
3199 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3202 loadmodel->num = count;
3204 for (i = 0;i < count;i++, in++, out++)
3210 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3217 in = (void *)(mod_base + l->fileofs);
3218 if (l->filelen % sizeof(*in))
3219 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3220 count = l->filelen / sizeof(*in);
3221 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3224 loadmodel->num = count;
3226 for (i = 0;i < count;i++, in++, out++)
3232 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3239 in = (void *)(mod_base + l->fileofs);
3240 if (l->filelen % sizeof(*in))
3241 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3242 count = l->filelen / sizeof(*in);
3243 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3246 loadmodel->num = count;
3248 for (i = 0;i < count;i++, in++, out++)
3254 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3261 in = (void *)(mod_base + l->fileofs);
3262 if (l->filelen % sizeof(*in))
3263 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3264 count = l->filelen / sizeof(*in);
3265 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3268 loadmodel->num = count;
3270 for (i = 0;i < count;i++, in++, out++)
3276 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3283 in = (void *)(mod_base + l->fileofs);
3284 if (l->filelen % sizeof(*in))
3285 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3286 count = l->filelen / sizeof(*in);
3287 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3290 loadmodel->num = count;
3292 for (i = 0;i < count;i++, in++, out++)
3298 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3305 in = (void *)(mod_base + l->fileofs);
3306 if (l->filelen % sizeof(*in))
3307 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3308 count = l->filelen / sizeof(*in);
3309 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3312 loadmodel->num = count;
3314 for (i = 0;i < count;i++, in++, out++)
3320 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3327 in = (void *)(mod_base + l->fileofs);
3328 if (l->filelen % sizeof(*in))
3329 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3330 count = l->filelen / sizeof(*in);
3331 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3334 loadmodel->num = count;
3336 for (i = 0;i < count;i++, in++, out++)
3342 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3349 in = (void *)(mod_base + l->fileofs);
3350 if (l->filelen % sizeof(*in))
3351 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3352 count = l->filelen / sizeof(*in);
3353 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3356 loadmodel->num = count;
3358 for (i = 0;i < count;i++, in++, out++)
3364 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3371 in = (void *)(mod_base + l->fileofs);
3372 if (l->filelen % sizeof(*in))
3373 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3374 count = l->filelen / sizeof(*in);
3375 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3378 loadmodel->num = count;
3380 for (i = 0;i < count;i++, in++, out++)
3386 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3393 in = (void *)(mod_base + l->fileofs);
3394 if (l->filelen % sizeof(*in))
3395 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3396 count = l->filelen / sizeof(*in);
3397 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3400 loadmodel->num = count;
3402 for (i = 0;i < count;i++, in++, out++)
3408 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3415 in = (void *)(mod_base + l->fileofs);
3416 if (l->filelen % sizeof(*in))
3417 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3418 count = l->filelen / sizeof(*in);
3419 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3422 loadmodel->num = count;
3424 for (i = 0;i < count;i++, in++, out++)
3430 static void Mod_Q2BSP_LoadAreas(lump_t *l)
3437 in = (void *)(mod_base + l->fileofs);
3438 if (l->filelen % sizeof(*in))
3439 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
3440 count = l->filelen / sizeof(*in);
3441 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3444 loadmodel->num = count;
3446 for (i = 0;i < count;i++, in++, out++)
3452 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
3459 in = (void *)(mod_base + l->fileofs);
3460 if (l->filelen % sizeof(*in))
3461 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
3462 count = l->filelen / sizeof(*in);
3463 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3466 loadmodel->num = count;
3468 for (i = 0;i < count;i++, in++, out++)
3474 static void Mod_Q2BSP_LoadModels(lump_t *l)
3481 in = (void *)(mod_base + l->fileofs);
3482 if (l->filelen % sizeof(*in))
3483 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
3484 count = l->filelen / sizeof(*in);
3485 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3488 loadmodel->num = count;
3490 for (i = 0;i < count;i++, in++, out++)
3496 void static Mod_Q2BSP_Load(model_t *mod, void *buffer)
3499 q2dheader_t *header;
3501 Host_Error("Mod_Q2BSP_Load: not yet implemented\n");
3503 mod->type = mod_brushq2;
3505 header = (q2dheader_t *)buffer;
3507 i = LittleLong(header->version);
3508 if (i != Q2BSPVERSION)
3509 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
3510 mod->brush.ishlbsp = false;
3511 if (loadmodel->isworldmodel)
3513 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3514 // until we get a texture for it...
3518 mod_base = (qbyte *)header;
3520 // swap all the lumps
3521 for (i = 0;i < (int) sizeof(*header) / 4;i++)
3522 ((int *)header)[i] = LittleLong(((int *)header)[i]);
3524 // store which lightmap format to use
3525 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3527 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
3528 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
3529 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
3530 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
3531 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
3532 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
3533 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
3534 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
3535 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
3536 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
3537 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
3538 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
3539 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
3540 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
3541 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
3542 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
3543 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
3544 // LordHavoc: must go last because this makes the submodels
3545 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
3548 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
3549 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
3551 static void Mod_Q3BSP_LoadEntities(lump_t *l)
3554 char key[128], value[4096];
3556 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
3557 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
3558 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
3561 loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
3562 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
3563 data = loadmodel->brush.entities;
3564 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
3565 if (data && COM_ParseToken(&data, false) && com_token[0] == '{')
3569 if (!COM_ParseToken(&data, false))
3571 if (com_token[0] == '}')
3572 break; // end of worldspawn
3573 if (com_token[0] == '_')
3574 strcpy(key, com_token + 1);
3576 strcpy(key, com_token);
3577 while (key[strlen(key)-1] == ' ') // remove trailing spaces
3578 key[strlen(key)-1] = 0;
3579 if (!COM_ParseToken(&data, false))
3581 strcpy(value, com_token);
3582 if (!strcmp("gridsize", key))
3584 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
3585 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
3591 static void Mod_Q3BSP_LoadTextures(lump_t *l)
3601 char shadername[Q3PATHLENGTH];
3602 char sky[Q3PATHLENGTH];
3604 in = (void *)(mod_base + l->fileofs);
3605 if (l->filelen % sizeof(*in))
3606 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
3607 count = l->filelen / sizeof(*in);
3608 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3610 loadmodel->brushq3.data_textures = out;
3611 loadmodel->brushq3.num_textures = count;
3613 for (i = 0;i < count;i++, in++, out++)
3616 strlcpy (out->name, in->name, sizeof (out->name));
3617 out->surfaceflags = LittleLong(in->surfaceflags);
3618 out->nativecontents = LittleLong(in->contents);
3619 out->supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, out->nativecontents);
3620 Mod_LoadSkinFrame(&out->skin, out->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true, true);
3621 out->surfaceparms = -1;
3624 // do a quick parse of shader files to get surfaceparms
3625 if ((search = FS_Search("scripts/*.shader", true, false)))
3627 for (i = 0;i < search->numfilenames;i++)
3629 if ((f = FS_LoadFile(search->filenames[i], tempmempool, false)))
3632 while (COM_ParseToken(&text, false))
3634 strlcpy (shadername, com_token, sizeof (shadername));
3637 if (COM_ParseToken(&text, false) && !strcasecmp(com_token, "{"))
3639 while (COM_ParseToken(&text, false))
3641 if (!strcasecmp(com_token, "}"))
3643 else if (!strcasecmp(com_token, "{"))
3645 while (COM_ParseToken(&text, false))
3647 if (!strcasecmp(com_token, "}"))
3651 else if (!strcasecmp(com_token, "surfaceparm"))
3653 if (COM_ParseToken(&text, true) && strcasecmp(com_token, "\n"))
3655 if (!strcasecmp(com_token, "alphashadow"))
3656 flags |= Q3SURFACEPARM_ALPHASHADOW;
3657 else if (!strcasecmp(com_token, "areaportal"))
3658 flags |= Q3SURFACEPARM_AREAPORTAL;
3659 else if (!strcasecmp(com_token, "clusterportal"))
3660 flags |= Q3SURFACEPARM_CLUSTERPORTAL;
3661 else if (!strcasecmp(com_token, "detail"))
3662 flags |= Q3SURFACEPARM_DETAIL;
3663 else if (!strcasecmp(com_token, "donotenter"))
3664 flags |= Q3SURFACEPARM_DONOTENTER;
3665 else if (!strcasecmp(com_token, "fog"))
3666 flags |= Q3SURFACEPARM_FOG;
3667 else if (!strcasecmp(com_token, "lava"))
3668 flags |= Q3SURFACEPARM_LAVA;
3669 else if (!strcasecmp(com_token, "lightfilter"))
3670 flags |= Q3SURFACEPARM_LIGHTFILTER;
3671 else if (!strcasecmp(com_token, "metalsteps"))
3672 flags |= Q3SURFACEPARM_METALSTEPS;
3673 else if (!strcasecmp(com_token, "nodamage"))
3674 flags |= Q3SURFACEPARM_NODAMAGE;
3675 else if (!strcasecmp(com_token, "nodlight"))
3676 flags |= Q3SURFACEPARM_NODLIGHT;
3677 else if (!strcasecmp(com_token, "nodraw"))
3678 flags |= Q3SURFACEPARM_NODRAW;
3679 else if (!strcasecmp(com_token, "nodrop"))
3680 flags |= Q3SURFACEPARM_NODROP;
3681 else if (!strcasecmp(com_token, "noimpact"))
3682 flags |= Q3SURFACEPARM_NOIMPACT;
3683 else if (!strcasecmp(com_token, "nolightmap"))
3684 flags |= Q3SURFACEPARM_NOLIGHTMAP;
3685 else if (!strcasecmp(com_token, "nomarks"))
3686 flags |= Q3SURFACEPARM_NOMARKS;
3687 else if (!strcasecmp(com_token, "nomipmaps"))
3688 flags |= Q3SURFACEPARM_NOMIPMAPS;
3689 else if (!strcasecmp(com_token, "nonsolid"))
3690 flags |= Q3SURFACEPARM_NONSOLID;
3691 else if (!strcasecmp(com_token, "origin"))
3692 flags |= Q3SURFACEPARM_ORIGIN;
3693 else if (!strcasecmp(com_token, "playerclip"))
3694 flags |= Q3SURFACEPARM_PLAYERCLIP;
3695 else if (!strcasecmp(com_token, "sky"))
3696 flags |= Q3SURFACEPARM_SKY;
3697 else if (!strcasecmp(com_token, "slick"))
3698 flags |= Q3SURFACEPARM_SLICK;
3699 else if (!strcasecmp(com_token, "slime"))
3700 flags |= Q3SURFACEPARM_SLIME;
3701 else if (!strcasecmp(com_token, "structural"))
3702 flags |= Q3SURFACEPARM_STRUCTURAL;
3703 else if (!strcasecmp(com_token, "trans"))
3704 flags |= Q3SURFACEPARM_TRANS;
3705 else if (!strcasecmp(com_token, "water"))
3706 flags |= Q3SURFACEPARM_WATER;
3708 Con_Printf("%s parsing warning: unknown surfaceparm \"%s\"\n", search->filenames[i], com_token);
3709 if (!COM_ParseToken(&text, true) || strcasecmp(com_token, "\n"))
3711 Con_Printf("%s parsing error: surfaceparm only takes one parameter.\n", search->filenames[i]);
3717 Con_Printf("%s parsing error: surfaceparm expects a parameter.\n", search->filenames[i]);
3721 else if (!strcasecmp(com_token, "sky"))
3723 if (COM_ParseToken(&text, true) && strcasecmp(com_token, "\n"))
3724 if (strlen(com_token) < sizeof(sky))
3725 strcpy(sky, com_token);
3727 else if (!strcasecmp(com_token, "skyparms"))
3729 if (COM_ParseToken(&text, true) && strcasecmp(com_token, "\n"))
3731 if (strlen(com_token) < sizeof(sky) && !atoi(com_token) && strcasecmp(com_token, "-"))
3732 strcpy(sky, com_token);
3733 if (COM_ParseToken(&text, true) && strcasecmp(com_token, "\n"))
3734 COM_ParseToken(&text, true);
3739 // look for linebreak or }
3740 while(COM_ParseToken(&text, true) && strcasecmp(com_token, "\n") && strcasecmp(com_token, "}"));
3741 // break out to top level if it was }
3742 if (!strcasecmp(com_token, "}"))
3746 // add shader to list (shadername and flags)
3747 // actually here we just poke into the texture settings
3748 for (j = 0, out = loadmodel->brushq3.data_textures;j < loadmodel->brushq3.num_textures;j++, out++)
3750 if (!strcasecmp(out->name, shadername))
3752 out->surfaceparms = flags;
3753 if ((flags & Q3SURFACEPARM_SKY) && sky[0])
3755 // quake3 seems to append a _ to the skybox name, so this must do so as well
3756 snprintf(loadmodel->brush.skybox, sizeof(loadmodel->brush.skybox), "%s_", sky);
3763 Con_Printf("%s parsing error - expected \"{\", found \"%s\"\n", search->filenames[i], com_token);
3774 for (j = 0, out = loadmodel->brushq3.data_textures;j < loadmodel->brushq3.num_textures;j++, out++)
3776 if (out->surfaceparms == -1)
3779 Con_DPrintf("%s: No shader found for texture \"%s\"\n", loadmodel->name, out->name);
3780 out->surfaceparms = 0;
3781 // these are defaults
3782 if (!strcmp(out->name, "caulk") || !strcmp(out->name, "common/caulk") || !strcmp(out->name, "textures/common/caulk")
3783 || !strcmp(out->name, "nodraw") || !strcmp(out->name, "common/nodraw") || !strcmp(out->name, "textures/common/nodraw"))
3784 out->surfaceparms |= Q3SURFACEPARM_NODRAW;
3785 if (!strncmp(out->name, "textures/skies/", 15))
3786 out->surfaceparms |= Q3SURFACEPARM_SKY;
3787 if (R_TextureHasAlpha(out->skin.base))
3788 out->surfaceparms |= Q3SURFACEPARM_TRANS;
3791 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
3794 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
3800 in = (void *)(mod_base + l->fileofs);
3801 if (l->filelen % sizeof(*in))
3802 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3803 count = l->filelen / sizeof(*in);
3804 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3806 loadmodel->brushq3.data_planes = out;
3807 loadmodel->brushq3.num_planes = count;
3809 for (i = 0;i < count;i++, in++, out++)
3811 out->normal[0] = LittleLong(in->normal[0]);
3812 out->normal[1] = LittleLong(in->normal[1]);
3813 out->normal[2] = LittleLong(in->normal[2]);
3814 out->dist = LittleLong(in->dist);
3819 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
3822 q3mbrushside_t *out;
3825 in = (void *)(mod_base + l->fileofs);
3826 if (l->filelen % sizeof(*in))
3827 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3828 count = l->filelen / sizeof(*in);
3829 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3831 loadmodel->brushq3.data_brushsides = out;
3832 loadmodel->brushq3.num_brushsides = count;
3834 for (i = 0;i < count;i++, in++, out++)
3836 n = LittleLong(in->planeindex);
3837 if (n < 0 || n >= loadmodel->brushq3.num_planes)
3838 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)\n", n, loadmodel->brushq3.num_planes);
3839 out->plane = loadmodel->brushq3.data_planes + n;
3840 n = LittleLong(in->textureindex);
3841 if (n < 0 || n >= loadmodel->brushq3.num_textures)
3842 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)\n", n, loadmodel->brushq3.num_textures);
3843 out->texture = loadmodel->brushq3.data_textures + n;
3847 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
3851 int i, j, n, c, count, maxplanes;
3854 in = (void *)(mod_base + l->fileofs);
3855 if (l->filelen % sizeof(*in))
3856 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3857 count = l->filelen / sizeof(*in);
3858 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3860 loadmodel->brushq3.data_brushes = out;
3861 loadmodel->brushq3.num_brushes = count;
3866 for (i = 0;i < count;i++, in++, out++)
3868 n = LittleLong(in->firstbrushside);
3869 c = LittleLong(in->numbrushsides);
3870 if (n < 0 || n + c > loadmodel->brushq3.num_brushsides)
3871 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)\n", n, n + c, loadmodel->brushq3.num_brushsides);
3872 out->firstbrushside = loadmodel->brushq3.data_brushsides + n;
3873 out->numbrushsides = c;
3874 n = LittleLong(in->textureindex);
3875 if (n < 0 || n >= loadmodel->brushq3.num_textures)
3876 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)\n", n, loadmodel->brushq3.num_textures);
3877 out->texture = loadmodel->brushq3.data_textures + n;
3879 // make a list of mplane_t structs to construct a colbrush from
3880 if (maxplanes < out->numbrushsides)
3882 maxplanes = out->numbrushsides;
3885 planes = Mem_Alloc(tempmempool, sizeof(mplane_t) * maxplanes);
3887 for (j = 0;j < out->numbrushsides;j++)
3889 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
3890 planes[j].dist = out->firstbrushside[j].plane->dist;
3892 // make the colbrush from the planes
3893 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
3899 static void Mod_Q3BSP_LoadEffects(lump_t *l)
3905 in = (void *)(mod_base + l->fileofs);
3906 if (l->filelen % sizeof(*in))
3907 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
3908 count = l->filelen / sizeof(*in);
3909 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3911 loadmodel->brushq3.data_effects = out;
3912 loadmodel->brushq3.num_effects = count;
3914 for (i = 0;i < count;i++, in++, out++)
3916 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
3917 n = LittleLong(in->brushindex);
3918 if (n < 0 || n >= loadmodel->brushq3.num_brushes)
3919 Host_Error("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes)\n", n, loadmodel->brushq3.num_brushes);
3920 out->brush = loadmodel->brushq3.data_brushes + n;
3921 out->unknown = LittleLong(in->unknown);
3925 static void Mod_Q3BSP_LoadVertices(lump_t *l)
3930 in = (void *)(mod_base + l->fileofs);
3931 if (l->filelen % sizeof(*in))
3932 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3933 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
3934 loadmodel->brushq3.data_vertex3f = Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 2 + 2 + 3 + 3 + 3 + 4)));
3935 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + count * 3;
3936 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
3937 loadmodel->brushq3.data_svector3f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
3938 loadmodel->brushq3.data_tvector3f = loadmodel->brushq3.data_svector3f + count * 3;
3939 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_tvector3f + count * 3;
3940 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_normal3f + count * 3;
3942 for (i = 0;i < count;i++, in++)
3944 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
3945 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
3946 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
3947 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
3948 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
3949 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
3950 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
3951 // svector/tvector are calculated later in face loading
3952 loadmodel->brushq3.data_svector3f[i * 3 + 0] = 0;
3953 loadmodel->brushq3.data_svector3f[i * 3 + 1] = 0;
3954 loadmodel->brushq3.data_svector3f[i * 3 + 2] = 0;
3955 loadmodel->brushq3.data_tvector3f[i * 3 + 0] = 0;
3956 loadmodel->brushq3.data_tvector3f[i * 3 + 1] = 0;
3957 loadmodel->brushq3.data_tvector3f[i * 3 + 2] = 0;
3958 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
3959 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
3960 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
3961 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
3962 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
3963 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
3964 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
3968 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
3974 in = (void *)(mod_base + l->fileofs);
3975 if (l->filelen % sizeof(int[3]))
3976 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
3977 count = l->filelen / sizeof(*in);
3978 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out) * 2);
3980 loadmodel->brushq3.num_triangles = count / 3;
3981 loadmodel->brushq3.data_element3i = out;
3982 loadmodel->brushq3.data_neighbor3i = out + count;
3984 for (i = 0;i < count;i++, in++, out++)
3986 *out = LittleLong(*in);
3987 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
3989 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
3995 static void Mod_Q3BSP_LoadLightmaps(lump_t *l)
4003 in = (void *)(mod_base + l->fileofs);
4004 if (l->filelen % sizeof(*in))
4005 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4006 count = l->filelen / sizeof(*in);
4007 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4009 loadmodel->brushq3.data_lightmaps = out;
4010 loadmodel->brushq3.num_lightmaps = count;
4012 for (i = 0;i < count;i++, in++, out++)
4013 *out = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", i), 128, 128, in->rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4016 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4020 int i, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xlevel, ylevel, row0, row1, x, y, *e, finalvertices, finaltriangles, firstvertex, firstelement, type;
4021 //int *originalelement3i;
4022 //int *originalneighbor3i;
4023 float *originalvertex3f;
4024 //float *originalsvector3f;
4025 //float *originaltvector3f;
4026 //float *originalnormal3f;
4027 float *originalcolor4f;
4028 float *originaltexcoordtexture2f;
4029 float *originaltexcoordlightmap2f;
4032 in = (void *)(mod_base + l->fileofs);
4033 if (l->filelen % sizeof(*in))
4034 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4035 count = l->filelen / sizeof(*in);
4036 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4038 loadmodel->brushq3.data_faces = out;
4039 loadmodel->brushq3.num_faces = count;
4041 for (i = 0;i < count;i++, in++, out++)
4043 // check face type first
4044 type = LittleLong(in->type);
4045 if (type != Q3FACETYPE_POLYGON
4046 && type != Q3FACETYPE_PATCH
4047 && type != Q3FACETYPE_MESH
4048 && type != Q3FACETYPE_FLARE)
4050 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4051 out->num_vertices = 0;
4052 out->num_triangles = 0;
4057 n = LittleLong(in->textureindex);
4058 if (n < 0 || n >= loadmodel->brushq3.num_textures)
4060 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->brushq3.num_textures);
4061 out->num_vertices = 0;
4062 out->num_triangles = 0;
4067 out->texture = loadmodel->brushq3.data_textures + n;
4068 n = LittleLong(in->effectindex);
4069 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4071 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4077 out->effect = loadmodel->brushq3.data_effects + n;
4078 n = LittleLong(in->lightmapindex);
4079 if (n < -1 || n >= loadmodel->brushq3.num_lightmaps)
4081 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_lightmaps);
4085 out->lightmaptexture = NULL;
4087 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n];
4089 firstvertex = LittleLong(in->firstvertex);
4090 out->num_vertices = LittleLong(in->numvertices);
4091 firstelement = LittleLong(in->firstelement);
4092 out->num_triangles = LittleLong(in->numelements) / 3;
4093 if (out->num_triangles * 3 != LittleLong(in->numelements))
4095 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));
4096 out->num_vertices = 0;
4097 out->num_triangles = 0;
4101 if (firstvertex < 0 || firstvertex + out->num_vertices > loadmodel->brushq3.num_vertices)
4103 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid vertex range %i : %i (%i vertices)\n", i, out->texture->name, firstvertex, firstvertex + out->num_vertices, loadmodel->brushq3.num_vertices);
4104 out->num_vertices = 0;
4105 out->num_triangles = 0;
4109 if (firstelement < 0 || firstelement + out->num_triangles * 3 > loadmodel->brushq3.num_triangles * 3)
4111 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid element range %i : %i (%i elements)\n", i, out->texture->name, firstelement, firstelement + out->num_triangles * 3, loadmodel->brushq3.num_triangles * 3);
4112 out->num_vertices = 0;
4113 out->num_triangles = 0;
4119 case Q3FACETYPE_POLYGON:
4120 case Q3FACETYPE_MESH:
4121 // no processing necessary
4122 out->data_vertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4123 out->data_texcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4124 out->data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4125 out->data_svector3f = loadmodel->brushq3.data_svector3f + firstvertex * 3;
4126 out->data_tvector3f = loadmodel->brushq3.data_tvector3f + firstvertex * 3;
4127 out->data_normal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
4128 out->data_color4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4129 out->data_element3i = loadmodel->brushq3.data_element3i + firstelement;
4130 out->data_neighbor3i = loadmodel->brushq3.data_neighbor3i + firstelement;
4132 case Q3FACETYPE_PATCH:
4133 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4134 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4135 if (patchsize[0] < 1 || patchsize[1] < 1)
4137 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4138 out->num_vertices = 0;
4139 out->num_triangles = 0;
4143 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4144 //originalsvector3f = loadmodel->brushq3.data_svector3f + firstvertex * 3;
4145 //originaltvector3f = loadmodel->brushq3.data_tvector3f + firstvertex * 3;
4146 //originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
4147 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4148 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4149 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4150 //originalelement3i = loadmodel->brushq3.data_element3i + firstelement;
4151 //originalneighbor3i = loadmodel->brushq3.data_neighbor3i + firstelement;
4153 originalvertex3f = out->data_vertex3f;
4154 //originalsvector3f = out->data_svector3f;
4155 //originaltvector3f = out->data_tvector3f;
4156 //originalnormal3f = out->data_normal3f;
4157 originalcolor4f = out->data_color4f;
4158 originaltexcoordtexture2f = out->data_texcoordtexture2f;
4159 originaltexcoordlightmap2f = out->data_texcoordlightmap2f;
4160 //originalelement3i = out->data_element3i;
4161 //originalneighbor3i = out->data_neighbor3i;
4163 // convert patch to Q3FACETYPE_MESH
4164 xlevel = QuadraticBSplinePatchSubdivisionLevelOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value, 10);
4165 ylevel = QuadraticBSplinePatchSubdivisionLevelOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value, 10);
4166 // bound to user settings
4167 xlevel = bound(r_subdivisions_minlevel.integer, xlevel, r_subdivisions_maxlevel.integer);
4168 ylevel = bound(r_subdivisions_minlevel.integer, ylevel, r_subdivisions_maxlevel.integer);
4169 // bound to sanity settings
4170 xlevel = bound(0, xlevel, 10);
4171 ylevel = bound(0, ylevel, 10);
4172 // bound to user limit on vertices
4173 while ((xlevel > 0 || ylevel > 0) && (((patchsize[0] - 1) << xlevel) + 1) * (((patchsize[1] - 1) << ylevel) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4175 if (xlevel > ylevel)
4180 finalwidth = ((patchsize[0] - 1) << xlevel) + 1;
4181 finalheight = ((patchsize[1] - 1) << ylevel) + 1;
4182 finalvertices = finalwidth * finalheight;
4183 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4184 out->data_vertex3f = Mem_Alloc(loadmodel->mempool, sizeof(float[20]) * finalvertices);
4185 out->data_svector3f = out->data_vertex3f + finalvertices * 3;
4186 out->data_tvector3f = out->data_svector3f + finalvertices * 3;
4187 out->data_normal3f = out->data_tvector3f + finalvertices * 3;
4188 out->data_color4f = out->data_normal3f + finalvertices * 3;
4189 out->data_texcoordtexture2f = out->data_color4f + finalvertices * 4;
4190 out->data_texcoordlightmap2f = out->data_texcoordtexture2f + finalvertices * 2;
4191 out->data_element3i = Mem_Alloc(loadmodel->mempool, sizeof(int[6]) * finaltriangles);
4192 out->data_neighbor3i = out->data_element3i + finaltriangles * 3;
4193 type = Q3FACETYPE_MESH;
4195 out->num_vertices = finalvertices;
4197 out->num_triangles = finaltriangles;
4198 // generate geometry
4199 // (note: normals are skipped because they get recalculated)
4200 QuadraticBSplinePatchSubdivideFloatBuffer(patchsize[0], patchsize[1], xlevel, ylevel, 3, originalvertex3f, out->data_vertex3f);
4201 QuadraticBSplinePatchSubdivideFloatBuffer(patchsize[0], patchsize[1], xlevel, ylevel, 2, originaltexcoordtexture2f, out->data_texcoordtexture2f);
4202 QuadraticBSplinePatchSubdivideFloatBuffer(patchsize[0], patchsize[1], xlevel, ylevel, 2, originaltexcoordlightmap2f, out->data_texcoordlightmap2f);
4203 QuadraticBSplinePatchSubdivideFloatBuffer(patchsize[0], patchsize[1], xlevel, ylevel, 4, originalcolor4f, out->data_color4f);
4204 // generate elements
4205 e = out->data_element3i;
4206 for (y = 0;y < finalheight - 1;y++)
4208 row0 = (y + 0) * finalwidth;
4209 row1 = (y + 1) * finalwidth;
4210 for (x = 0;x < finalwidth - 1;x++)
4222 out->num_triangles = Mod_RemoveDegenerateTriangles(out->num_triangles, out->data_element3i, out->data_element3i, out->data_vertex3f);
4223 if (developer.integer)
4225 if (out->num_triangles < finaltriangles)
4226 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);
4228 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);
4230 // q3map does not put in collision brushes for curves... ugh
4231 // build the lower quality collision geometry
4232 xlevel = QuadraticBSplinePatchSubdivisionLevelOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value, 10);
4233 ylevel = QuadraticBSplinePatchSubdivisionLevelOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value, 10);
4234 // bound to user settings
4235 xlevel = bound(r_subdivisions_collision_minlevel.integer, xlevel, r_subdivisions_collision_maxlevel.integer);
4236 ylevel = bound(r_subdivisions_collision_minlevel.integer, ylevel, r_subdivisions_collision_maxlevel.integer);
4237 // bound to sanity settings
4238 xlevel = bound(0, xlevel, 10);
4239 ylevel = bound(0, ylevel, 10);
4240 // bound to user limit on vertices
4241 while ((xlevel > 0 || ylevel > 0) && (((patchsize[0] - 1) << xlevel) + 1) * (((patchsize[1] - 1) << ylevel) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4243 if (xlevel > ylevel)
4248 finalwidth = ((patchsize[0] - 1) << xlevel) + 1;
4249 finalheight = ((patchsize[1] - 1) << ylevel) + 1;
4250 finalvertices = finalwidth * finalheight;
4251 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4252 out->data_collisionvertex3f = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4253 out->data_collisionelement3i = Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4254 out->num_collisionvertices = finalvertices;
4255 out->num_collisiontriangles = finaltriangles;
4256 QuadraticBSplinePatchSubdivideFloatBuffer(patchsize[0], patchsize[1], xlevel, ylevel, 3, originalvertex3f, out->data_collisionvertex3f);
4257 // generate elements
4258 e = out->data_collisionelement3i;
4259 for (y = 0;y < finalheight - 1;y++)
4261 row0 = (y + 0) * finalwidth;
4262 row1 = (y + 1) * finalwidth;
4263 for (x = 0;x < finalwidth - 1;x++)
4275 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4276 if (developer.integer)
4278 if (out->num_collisiontriangles < finaltriangles)
4279 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided for collisions to %i vertices / %i triangles, %i degenerate triangles removed (leaving %i)\n", patchsize[0], patchsize[1], out->num_collisionvertices, finaltriangles, finaltriangles - out->num_collisiontriangles, out->num_collisiontriangles);
4281 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided for collisions to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->num_collisionvertices, out->num_collisiontriangles);
4284 case Q3FACETYPE_FLARE:
4285 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4287 out->num_vertices = 0;
4288 out->num_triangles = 0;
4292 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4293 if (out->data_element3i[j] < 0 || out->data_element3i[j] >= out->num_vertices)
4295 if (invalidelements)
4297 Con_Printf("Mod_Q3BSP_LoadFaces: Warning: face #%i has %i invalid elements, type = %i, texture->name = \"%s\", texture->surfaceflags = %i, texture->nativecontents = %i, firstvertex = %i, numvertices = %i, firstelement = %i, numelements = %i, elements list:\n", i, invalidelements, type, out->texture->name, out->texture->surfaceflags, out->texture->nativecontents, firstvertex, out->num_vertices, firstelement, out->num_triangles * 3);
4298 for (j = 0;j < out->num_triangles * 3;j++)
4300 Con_Printf(" %i", out->data_element3i[j]);
4301 if (out->data_element3i[j] < 0 || out->data_element3i[j] >= out->num_vertices)
4302 out->data_element3i[j] = 0;
4306 // for shadow volumes
4307 Mod_BuildTriangleNeighbors(out->data_neighbor3i, out->data_element3i, out->num_triangles);
4308 // for per pixel lighting
4309 Mod_BuildTextureVectorsAndNormals(out->num_vertices, out->num_triangles, out->data_vertex3f, out->data_texcoordtexture2f, out->data_element3i, out->data_svector3f, out->data_tvector3f, out->data_normal3f);
4310 // calculate a bounding box
4311 VectorClear(out->mins);
4312 VectorClear(out->maxs);
4313 if (out->num_vertices)
4315 VectorCopy(out->data_vertex3f, out->mins);
4316 VectorCopy(out->data_vertex3f, out->maxs);
4317 for (j = 1, v = out->data_vertex3f + 3;j < out->num_vertices;j++, v += 3)
4319 out->mins[0] = min(out->mins[0], v[0]);
4320 out->maxs[0] = max(out->maxs[0], v[0]);
4321 out->mins[1] = min(out->mins[1], v[1]);
4322 out->maxs[1] = max(out->maxs[1], v[1]);
4323 out->mins[2] = min(out->mins[2], v[2]);
4324 out->maxs[2] = max(out->maxs[2], v[2]);
4326 out->mins[0] -= 1.0f;
4327 out->mins[1] -= 1.0f;
4328 out->mins[2] -= 1.0f;
4329 out->maxs[0] += 1.0f;
4330 out->maxs[1] += 1.0f;
4331 out->maxs[2] += 1.0f;
4335 // LordHavoc: experimental array merger (disabled because it wastes time and uses 2x memory while merging)
4338 int totalverts, totaltris;
4339 int originalnum_vertices;
4340 float *originaldata_vertex3f;
4341 float *originaldata_texcoordtexture2f;
4342 float *originaldata_texcoordlightmap2f;
4343 float *originaldata_svector3f;
4344 float *originaldata_tvector3f;
4345 float *originaldata_normal3f;
4346 float *originaldata_color4f;
4347 int originalnum_triangles;
4348 int *originaldata_element3i;
4349 int *originaldata_neighbor3i;
4353 for (i = 0, out = loadmodel->brushq3.data_faces;i < count;i++, out++)
4357 totalverts += out->num_vertices;
4358 totaltris += out->num_triangles;
4361 originalnum_vertices = loadmodel->brushq3.num_vertices;
4362 originaldata_vertex3f = loadmodel->brushq3.data_vertex3f;
4363 originaldata_texcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f;
4364 originaldata_texcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f;
4365 originaldata_svector3f = loadmodel->brushq3.data_svector3f;
4366 originaldata_tvector3f = loadmodel->brushq3.data_tvector3f;
4367 originaldata_normal3f = loadmodel->brushq3.data_normal3f;
4368 originaldata_color4f = loadmodel->brushq3.data_color4f;
4369 originalnum_triangles = loadmodel->brushq3.num_triangles;
4370 originaldata_element3i = loadmodel->brushq3.data_element3i;
4371 originaldata_neighbor3i = loadmodel->brushq3.data_neighbor3i;
4372 loadmodel->brushq3.num_vertices = totalverts;
4373 loadmodel->brushq3.data_vertex3f = Mem_Alloc(loadmodel->mempool, totalverts * (sizeof(float) * (3 + 2 + 2 + 3 + 3 + 3 + 4)) + totaltris * (sizeof(int) * (3 * 2)));
4374 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + totalverts * 3;
4375 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + totalverts * 2;
4376 loadmodel->brushq3.data_svector3f = loadmodel->brushq3.data_texcoordlightmap2f + totalverts * 2;
4377 loadmodel->brushq3.data_tvector3f = loadmodel->brushq3.data_svector3f + totalverts * 3;
4378 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_tvector3f + totalverts * 3;
4379 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_normal3f + totalverts * 3;
4380 loadmodel->brushq3.num_triangles = totaltris;
4381 loadmodel->brushq3.data_element3i = (int *)(loadmodel->brushq3.data_color4f + totalverts * 4);
4382 loadmodel->brushq3.data_neighbor3i = loadmodel->brushq3.data_element3i + totaltris * 3;
4385 for (i = 0, out = loadmodel->brushq3.data_faces;i < count;i++, out++)
4389 Con_Printf("totalverts %i, totaltris %i\n", totalverts, totaltris);
4390 memcpy(loadmodel->brushq3.data_vertex3f + totalverts * 3, out->data_vertex3f, out->num_vertices * 3 * sizeof(float));
4391 memcpy(loadmodel->brushq3.data_texcoordtexture2f + totalverts * 2, out->data_texcoordtexture2f, out->num_vertices * 2 * sizeof(float));
4392 memcpy(loadmodel->brushq3.data_texcoordlightmap2f + totalverts * 2, out->data_texcoordlightmap2f, out->num_vertices * 2 * sizeof(float));
4393 memcpy(loadmodel->brushq3.data_svector3f + totalverts * 3, out->data_svector3f, out->num_vertices * 3 * sizeof(float));
4394 memcpy(loadmodel->brushq3.data_tvector3f + totalverts * 3, out->data_tvector3f, out->num_vertices * 3 * sizeof(float));
4395 memcpy(loadmodel->brushq3.data_normal3f + totalverts * 3, out->data_normal3f, out->num_vertices * 3 * sizeof(float));
4396 memcpy(loadmodel->brushq3.data_color4f + totalverts * 4, out->data_color4f, out->num_vertices * 4 * sizeof(float));
4397 memcpy(loadmodel->brushq3.data_element3i + totaltris * 3, out->data_element3i, out->num_triangles * 3 * sizeof(int));
4398 memcpy(loadmodel->brushq3.data_neighbor3i + totaltris * 3, out->data_neighbor3i, out->num_triangles * 3 * sizeof(int));
4399 if (out->firstvertex == -1)
4400 Mem_Free(out->data_vertex3f);
4401 if (out->firstelement == -1)
4402 Mem_Free(out->data_element3i);
4403 out->firstvertex = totalverts;
4404 out->data_vertex3f = loadmodel->brushq3.data_vertex3f + out->firstvertex * 3;
4405 out->data_texcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + out->firstvertex * 2;
4406 out->data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + out->firstvertex * 2;
4407 out->data_svector3f = loadmodel->brushq3.data_svector3f + out->firstvertex * 3;
4408 out->data_tvector3f = loadmodel->brushq3.data_tvector3f + out->firstvertex * 3;
4409 out->data_normal3f = loadmodel->brushq3.data_normal3f + out->firstvertex * 3;
4410 out->data_color4f = loadmodel->brushq3.data_color4f + out->firstvertex * 4;
4411 out->firstelement = totaltris * 3;
4412 out->data_element3i = loadmodel->brushq3.data_element3i + out->firstelement;
4413 out->data_neighbor3i = loadmodel->brushq3.data_neighbor3i + out->firstelement;
4414 //for (j = 0;j < out->numtriangles * 3;j++)
4415 // out->data_element3i[j] += totalverts - out->firstvertex;
4416 totalverts += out->num_vertices;
4417 totaltris += out->num_triangles;
4419 Mem_Free(originaldata_vertex3f);
4420 Mem_Free(originaldata_element3i);
4425 static void Mod_Q3BSP_LoadModels(lump_t *l)
4429 int i, j, n, c, count;
4431 in = (void *)(mod_base + l->fileofs);
4432 if (l->filelen % sizeof(*in))
4433 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4434 count = l->filelen / sizeof(*in);
4435 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4437 loadmodel->brushq3.data_models = out;
4438 loadmodel->brushq3.num_models = count;
4440 for (i = 0;i < count;i++, in++, out++)
4442 for (j = 0;j < 3;j++)
4444 out->mins[j] = LittleFloat(in->mins[j]);
4445 out->maxs[j] = LittleFloat(in->maxs[j]);
4447 n = LittleLong(in->firstface);
4448 c = LittleLong(in->numfaces);
4449 if (n < 0 || n + c > loadmodel->brushq3.num_faces)
4450 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)\n", n, n + c, loadmodel->brushq3.num_faces);
4451 out->firstface = loadmodel->brushq3.data_faces + n;
4453 n = LittleLong(in->firstbrush);
4454 c = LittleLong(in->numbrushes);
4455 if (n < 0 || n + c > loadmodel->brushq3.num_brushes)
4456 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)\n", n, n + c, loadmodel->brushq3.num_brushes);
4457 out->firstbrush = loadmodel->brushq3.data_brushes + n;
4458 out->numbrushes = c;
4462 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4468 in = (void *)(mod_base + l->fileofs);
4469 if (l->filelen % sizeof(*in))
4470 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4471 count = l->filelen / sizeof(*in);
4472 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4474 loadmodel->brushq3.data_leafbrushes = out;
4475 loadmodel->brushq3.num_leafbrushes = count;
4477 for (i = 0;i < count;i++, in++, out++)
4479 n = LittleLong(*in);
4480 if (n < 0 || n >= loadmodel->brushq3.num_brushes)
4481 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)\n", n, loadmodel->brushq3.num_brushes);
4482 *out = loadmodel->brushq3.data_brushes + n;
4486 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4492 in = (void *)(mod_base + l->fileofs);
4493 if (l->filelen % sizeof(*in))
4494 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4495 count = l->filelen / sizeof(*in);
4496 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4498 loadmodel->brushq3.data_leaffaces = out;
4499 loadmodel->brushq3.num_leaffaces = count;
4501 loadmodel->brushq3.data_leaffacenums = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
4503 for (i = 0;i < count;i++, in++, out++)
4505 n = LittleLong(*in);
4506 if (n < 0 || n >= loadmodel->brushq3.num_faces)
4507 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)\n", n, loadmodel->brushq3.num_faces);
4508 *out = loadmodel->brushq3.data_faces + n;
4509 loadmodel->brushq3.data_leaffacenums[i] = n;
4513 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4517 int i, j, n, c, count;
4519 in = (void *)(mod_base + l->fileofs);
4520 if (l->filelen % sizeof(*in))
4521 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4522 count = l->filelen / sizeof(*in);
4523 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4525 loadmodel->brushq3.data_leafs = out;
4526 loadmodel->brushq3.num_leafs = count;
4528 for (i = 0;i < count;i++, in++, out++)
4532 out->clusterindex = LittleLong(in->clusterindex);
4533 out->areaindex = LittleLong(in->areaindex);
4534 for (j = 0;j < 3;j++)
4536 // yes the mins/maxs are ints
4537 out->mins[j] = LittleLong(in->mins[j]) - 1;
4538 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4540 n = LittleLong(in->firstleafface);
4541 c = LittleLong(in->numleaffaces);
4542 if (n < 0 || n + c > loadmodel->brushq3.num_leaffaces)
4543 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafface range %i : %i (%i leaffaces)\n", n, n + c, loadmodel->brushq3.num_leaffaces);
4544 out->firstleafface = loadmodel->brushq3.data_leaffaces + n;
4545 out->firstleaffacenum = loadmodel->brushq3.data_leaffacenums + n;
4546 out->numleaffaces = c;
4547 n = LittleLong(in->firstleafbrush);
4548 c = LittleLong(in->numleafbrushes);
4549 if (n < 0 || n + c > loadmodel->brushq3.num_leafbrushes)
4550 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)\n", n, n + c, loadmodel->brushq3.num_leafbrushes);
4551 out->firstleafbrush = loadmodel->brushq3.data_leafbrushes + n;
4552 out->numleafbrushes = c;
4556 static void Mod_Q3BSP_LoadNodes_RecursiveSetParent(q3mnode_t *node, q3mnode_t *parent)
4559 Host_Error("Mod_Q3BSP_LoadNodes_RecursiveSetParent: runaway recursion\n");
4560 node->parent = parent;
4563 Mod_Q3BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
4564 Mod_Q3BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
4568 static void Mod_Q3BSP_LoadNodes(lump_t *l)
4574 in = (void *)(mod_base + l->fileofs);
4575 if (l->filelen % sizeof(*in))
4576 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4577 count = l->filelen / sizeof(*in);
4578 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4580 loadmodel->brushq3.data_nodes = out;
4581 loadmodel->brushq3.num_nodes = count;
4583 for (i = 0;i < count;i++, in++, out++)
4586 n = LittleLong(in->planeindex);
4587 if (n < 0 || n >= loadmodel->brushq3.num_planes)
4588 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)\n", n, loadmodel->brushq3.num_planes);
4589 out->plane = loadmodel->brushq3.data_planes + n;
4590 for (j = 0;j < 2;j++)
4592 n = LittleLong(in->childrenindex[j]);
4595 if (n >= loadmodel->brushq3.num_nodes)
4596 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)\n", n, loadmodel->brushq3.num_nodes);
4597 out->children[j] = loadmodel->brushq3.data_nodes + n;
4602 if (n >= loadmodel->brushq3.num_leafs)
4603 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)\n", n, loadmodel->brushq3.num_leafs);
4604 out->children[j] = (q3mnode_t *)(loadmodel->brushq3.data_leafs + n);
4607 for (j = 0;j < 3;j++)
4609 // yes the mins/maxs are ints
4610 out->mins[j] = LittleLong(in->mins[j]) - 1;
4611 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4615 // set the parent pointers
4616 Mod_Q3BSP_LoadNodes_RecursiveSetParent(loadmodel->brushq3.data_nodes, NULL);
4619 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
4622 q3dlightgrid_t *out;
4625 in = (void *)(mod_base + l->fileofs);
4626 if (l->filelen % sizeof(*in))
4627 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
4628 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
4629 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
4630 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
4631 loadmodel->brushq3.num_lightgrid_imins[0] = ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4632 loadmodel->brushq3.num_lightgrid_imins[1] = ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4633 loadmodel->brushq3.num_lightgrid_imins[2] = ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4634 loadmodel->brushq3.num_lightgrid_imaxs[0] = floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4635 loadmodel->brushq3.num_lightgrid_imaxs[1] = floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4636 loadmodel->brushq3.num_lightgrid_imaxs[2] = floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4637 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
4638 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
4639 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
4640 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
4643 if (l->filelen < count * (int)sizeof(*in))
4644 Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)\n", l->filelen, count * sizeof(*in), loadmodel->brushq3.num_lightgrid_dimensions[0], loadmodel->brushq3.num_lightgrid_dimensions[1], loadmodel->brushq3.num_lightgrid_dimensions[2]);
4645 if (l->filelen != count * (int)sizeof(*in))
4646 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", count * sizeof(*in), l->filelen);
4649 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4650 loadmodel->brushq3.data_lightgrid = out;
4651 loadmodel->brushq3.num_lightgrid = count;
4653 // no swapping or validation necessary
4655 memcpy(out, in, count * (int)sizeof(*out));
4658 // no data, fill with white
4660 for (i = 0;i < count;i++)
4662 out[i].ambientrgb[0] = 128;
4663 out[i].ambientrgb[1] = 128;
4664 out[i].ambientrgb[2] = 128;
4665 out[i].diffusergb[0] = 0;
4666 out[i].diffusergb[1] = 0;
4667 out[i].diffusergb[2] = 0;
4668 out[i].diffusepitch = 0;
4669 out[i].diffuseyaw = 0;
4673 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]);
4674 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]);
4677 static void Mod_Q3BSP_LoadPVS(lump_t *l)
4682 if (l->filelen == 0)
4685 // unvised maps often have cluster indices even without pvs, so check
4686 // leafs to find real number of clusters
4687 loadmodel->brush.num_pvsclusters = 1;
4688 for (i = 0;i < loadmodel->brushq3.num_leafs;i++)
4689 loadmodel->brush.num_pvsclusters = min(loadmodel->brush.num_pvsclusters, loadmodel->brushq3.data_leafs[i].clusterindex + 1);
4692 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
4693 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4694 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4695 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
4699 in = (void *)(mod_base + l->fileofs);
4701 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
4703 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
4704 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
4705 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
4706 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8\n", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
4707 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4708 if (l->filelen < totalchains + (int)sizeof(*in))
4709 Host_Error("Mod_Q3BSP_LoadPVS: lump too small ((numclusters = %i) * (chainlength = %i) + sizeof(q3dpvs_t) == %i bytes, lump is %i bytes)\n", loadmodel->brush.num_pvsclusters, loadmodel->brush.num_pvsclusterbytes, totalchains + sizeof(*in), l->filelen);
4711 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4712 memcpy(loadmodel->brush.data_pvsclusters, (qbyte *)(in + 1), totalchains);
4715 static void Mod_Q3BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, vec_t radius)
4717 // FIXME: finish this code
4718 VectorCopy(in, out);
4721 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
4723 int i, j, k, index[3];
4724 float transformed[3], blend1, blend2, blend, yaw, pitch, sinpitch;
4725 q3dlightgrid_t *a, *s;
4726 // FIXME: write this
4727 if (!model->brushq3.num_lightgrid)
4729 ambientcolor[0] = 1;
4730 ambientcolor[1] = 1;
4731 ambientcolor[2] = 1;
4734 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
4735 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
4736 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
4737 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
4738 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
4739 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
4740 index[0] = (int)floor(transformed[0]);
4741 index[1] = (int)floor(transformed[1]);
4742 index[2] = (int)floor(transformed[2]);
4743 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
4744 // now lerp the values
4745 VectorClear(diffusenormal);
4746 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
4747 for (k = 0;k < 2;k++)
4749 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
4750 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
4752 for (j = 0;j < 2;j++)
4754 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
4755 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
4757 for (i = 0;i < 2;i++)
4759 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0])));
4760 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
4762 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
4763 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
4764 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
4765 pitch = s->diffusepitch * M_PI / 128;
4766 yaw = s->diffuseyaw * M_PI / 128;
4767 sinpitch = sin(pitch);
4768 diffusenormal[0] += blend * (cos(yaw) * sinpitch);
4769 diffusenormal[1] += blend * (sin(yaw) * sinpitch);
4770 diffusenormal[2] += blend * (cos(pitch));
4771 //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)));
4775 VectorNormalize(diffusenormal);
4776 //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]);
4779 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, q3mnode_t *node, const vec3_t point, int markframe)
4784 // find which leaf the point is in
4786 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
4787 // point trace the brushes
4788 leaf = (q3mleaf_t *)node;
4789 for (i = 0;i < leaf->numleafbrushes;i++)
4791 brush = leaf->firstleafbrush[i]->colbrushf;
4792 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
4794 brush->markframe = markframe;
4795 Collision_TracePointBrushFloat(trace, point, leaf->firstleafbrush[i]->colbrushf);
4798 // can't do point traces on curves (they have no thickness)
4801 static void Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace_t *trace, q3mnode_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)
4803 int i, startside, endside;
4804 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
4808 if (startfrac > trace->realfraction)
4810 // note: all line fragments past first impact fraction are ignored
4811 if (VectorCompare(start, end))
4813 // find which leaf the point is in
4815 node = node->children[DotProduct(start, node->plane->normal) < node->plane->dist];
4819 // find which nodes the line is in and recurse for them
4822 // recurse down node sides
4823 dist1 = PlaneDiff(start, node->plane);
4824 dist2 = PlaneDiff(end, node->plane);
4825 startside = dist1 < 0;
4826 endside = dist2 < 0;
4827 if (startside == endside)
4829 // most of the time the line fragment is on one side of the plane
4830 node = node->children[startside];
4834 // line crosses node plane, split the line
4835 midfrac = dist1 / (dist1 - dist2);
4836 VectorLerp(start, midfrac, end, mid);
4837 // take the near side first
4838 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4839 if (midfrac <= trace->realfraction)
4840 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4846 nodesegmentmins[0] = min(start[0], end[0]);
4847 nodesegmentmins[1] = min(start[1], end[1]);
4848 nodesegmentmins[2] = min(start[2], end[2]);
4849 nodesegmentmaxs[0] = max(start[0], end[0]);
4850 nodesegmentmaxs[1] = max(start[1], end[1]);
4851 nodesegmentmaxs[2] = max(start[2], end[2]);
4852 // line trace the brushes
4853 leaf = (q3mleaf_t *)node;
4854 for (i = 0;i < leaf->numleafbrushes;i++)
4856 brush = leaf->firstleafbrush[i]->colbrushf;
4857 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
4859 brush->markframe = markframe;
4860 Collision_TraceLineBrushFloat(trace, linestart, lineend, leaf->firstleafbrush[i]->colbrushf, leaf->firstleafbrush[i]->colbrushf);
4861 if (startfrac > trace->realfraction)
4865 // can't do point traces on curves (they have no thickness)
4866 if (mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
4868 // line trace the curves
4869 for (i = 0;i < leaf->numleaffaces;i++)
4871 face = leaf->firstleafface[i];
4872 if (face->num_collisiontriangles && face->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, face->mins, face->maxs))
4874 face->collisionmarkframe = markframe;
4875 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, face->num_collisiontriangles, face->data_collisionelement3i, face->data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
4876 if (startfrac > trace->realfraction)
4883 static void Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace_t *trace, q3mnode_t *node, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, int markframe, const vec3_t segmentmins, const vec3_t segmentmaxs)
4887 float nodesegmentmins[3], nodesegmentmaxs[3];
4892 // find which nodes the line is in and recurse for them
4895 // recurse down node sides
4896 int startside, endside;
4897 float dist1near, dist1far, dist2near, dist2far;
4898 BoxPlaneCornerDistances(thisbrush_start->mins, thisbrush_start->maxs, node->plane, &dist1near, &dist1far);
4899 BoxPlaneCornerDistances(thisbrush_end->mins, thisbrush_end->maxs, node->plane, &dist2near, &dist2far);
4900 startside = dist1near < 0;
4901 startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
4902 endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
4903 if (startside == 2 || endside == 2)
4905 // brushes cross plane
4906 // do not clip anything, just take both sides
4907 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
4908 node = node->children[1];
4915 node = node->children[0];
4920 //midf0 = dist1near / (dist1near - dist2near);
4921 //midf1 = dist1far / (dist1far - dist2far);
4922 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
4923 node = node->children[1];
4931 //midf0 = dist1near / (dist1near - dist2near);
4932 //midf1 = dist1far / (dist1far - dist2far);
4933 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
4934 node = node->children[1];
4939 node = node->children[1];
4944 if (dist1near < 0 && dist2near < 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
4945 if (dist1near < 0 && dist2near < 0 && dist1far < 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
4946 if (dist1near < 0 && dist2near < 0 && dist1far >= 0 && dist2far < 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
4947 if (dist1near < 0 && dist2near < 0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
4948 if (dist1near < 0 && dist2near >= 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
4949 if (dist1near < 0 && dist2near >= 0 && dist1far < 0 && dist2far >= 0){}
4950 if (dist1near < 0 && dist2near >= 0 && dist1far >= 0 && dist2far < 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
4951 if (dist1near < 0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
4952 if (dist1near >= 0 && dist2near < 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
4953 if (dist1near >= 0 && dist2near < 0 && dist1far < 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
4954 if (dist1near >= 0 && dist2near < 0 && dist1far >= 0 && dist2far < 0){}
4955 if (dist1near >= 0 && dist2near < 0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
4956 if (dist1near >= 0 && dist2near >= 0 && dist1far < 0 && dist2far < 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
4957 if (dist1near >= 0 && dist2near >= 0 && dist1far < 0 && dist2far >= 0){node = node->children[0];continue;}
4958 if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far < 0){node = node->children[0];continue;}
4959 if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){node = node->children[0];continue;}
4961 if (dist2near < 0) // d1n<0 && d2n<0
4963 if (dist2near < 0) // d1n<0 && d2n<0
4965 if (dist2near < 0) // d1n<0 && d2n<0
4968 else // d1n<0 && d2n>0
4972 else // d1n<0 && d2n>0
4974 if (dist2near < 0) // d1n<0 && d2n<0
4977 else // d1n<0 && d2n>0
4982 else // d1n<0 && d2n>0
4988 if (dist2near < 0) // d1n>0 && d2n<0
4991 else // d1n>0 && d2n>0
4995 if (dist1near < 0 == dist1far < 0 == dist2near < 0 == dist2far < 0)
4997 node = node->children[startside];
5000 if (dist1near < dist2near)
5005 node = node->children[0];
5010 node = node->children[1];
5013 // dist1near < 0 && dist2far >= 0
5019 startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
5020 endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
5021 if (startside == 2 || endside == 2)
5023 // brushes cross plane
5024 // do not clip anything, just take both sides
5025 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5026 node = node->children[1];
5028 else if (startside == endside)
5029 node = node->children[startside];
5030 else if (startside == 0) // endside = 1 (start infront, end behind)
5033 else // startside == 1 endside = 0 (start behind, end infront)
5039 node = node->children[startside];
5042 // start and end brush cross plane
5048 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5049 node = node->children[1];
5050 else if (dist1near < 0 && dist1far < 0 && dist2near >= 0 && dist2far >= 0)
5051 else if (dist1near >= 0 && dist1far >= 0 && dist2near < 0 && dist2far < 0)
5052 else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5053 node = node->children[0];
5055 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5056 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5057 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5058 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5059 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5062 else if (dist1near >= 0 && dist1far >= 0)
5065 else // mixed (lying on plane)
5069 if (dist2near < 0 && dist2far < 0)
5073 node = node->children[1];
5075 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5076 node = node->children[0];
5077 else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5078 node = node->children[1];
5082 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5083 node = node->children[1];
5085 sides = dist1near || dist1near < 0 | dist1far < 0 | dist2near < 0 | dist
5086 startside = dist1 < 0;
5087 endside = dist2 < 0;
5088 if (startside == endside)
5090 // most of the time the line fragment is on one side of the plane
5091 node = node->children[startside];
5095 // line crosses node plane, split the line
5096 midfrac = dist1 / (dist1 - dist2);
5097 VectorLerp(start, midfrac, end, mid);
5098 // take the near side first
5099 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5100 if (midfrac <= trace->fraction)
5101 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5109 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5110 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5111 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5112 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5113 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5114 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5115 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5119 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5120 node = node->children[1];
5123 // FIXME: could be made faster by copying TraceLine code and making it use
5124 // box plane distances... (variant on the BoxOnPlaneSide code)
5127 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5128 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5129 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5130 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5131 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5132 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5133 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5137 if (mod_q3bsp_debugtracebrush.integer == 2)
5139 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5140 node = node->children[1];
5143 else if (mod_q3bsp_debugtracebrush.integer == 1)
5145 // recurse down node sides
5146 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5149 // segment box crosses plane
5150 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5151 node = node->children[1];
5154 // take whichever side the segment box is on
5155 node = node->children[sides - 1];
5160 // recurse down node sides
5161 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5164 // segment box crosses plane
5165 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5166 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5169 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5170 node = node->children[1];
5174 // take whichever side the segment box is on
5175 node = node->children[sides - 1];
5181 // FIXME: could be made faster by copying TraceLine code and making it use
5182 // box plane distances... (variant on the BoxOnPlaneSide code)
5185 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5186 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5187 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5188 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5189 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5190 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5191 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5195 if (mod_q3bsp_debugtracebrush.integer == 2)
5197 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5198 node = node->children[1];
5200 else if (mod_q3bsp_debugtracebrush.integer == 1)
5202 // recurse down node sides
5203 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5206 // segment box crosses plane
5207 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5208 node = node->children[1];
5212 // take whichever side the segment box is on
5213 node = node->children[sides - 1];
5218 // recurse down node sides
5219 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5222 // segment box crosses plane
5223 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5224 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5227 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5231 // take whichever side the segment box is on
5232 node = node->children[sides - 1];
5237 leaf = (q3mleaf_t *)node;
5238 for (i = 0;i < leaf->numleafbrushes;i++)
5240 brush = leaf->firstleafbrush[i]->colbrushf;
5241 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5243 brush->markframe = markframe;
5244 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, leaf->firstleafbrush[i]->colbrushf, leaf->firstleafbrush[i]->colbrushf);
5247 if (mod_q3bsp_curves_collisions.integer)
5249 for (i = 0;i < leaf->numleaffaces;i++)
5251 face = leaf->firstleafface[i];
5252 if (face->num_collisiontriangles && face->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, face->mins, face->maxs))
5254 face->collisionmarkframe = markframe;
5255 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, face->num_collisiontriangles, face->data_collisionelement3i, face->data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5261 static void Mod_Q3BSP_TraceBox(model_t *model, int frame, trace_t *trace, const vec3_t boxstartmins, const vec3_t boxstartmaxs, const vec3_t boxendmins, const vec3_t boxendmaxs, int hitsupercontentsmask)
5264 float segmentmins[3], segmentmaxs[3];
5265 colbrushf_t *thisbrush_start, *thisbrush_end;
5266 matrix4x4_t startmatrix, endmatrix;
5267 static int markframe = 0;
5269 memset(trace, 0, sizeof(*trace));
5270 trace->fraction = 1;
5271 trace->realfraction = 1;
5272 trace->hitsupercontentsmask = hitsupercontentsmask;
5273 Matrix4x4_CreateIdentity(&startmatrix);
5274 Matrix4x4_CreateIdentity(&endmatrix);
5275 segmentmins[0] = min(boxstartmins[0], boxendmins[0]);
5276 segmentmins[1] = min(boxstartmins[1], boxendmins[1]);
5277 segmentmins[2] = min(boxstartmins[2], boxendmins[2]);
5278 segmentmaxs[0] = max(boxstartmaxs[0], boxendmaxs[0]);
5279 segmentmaxs[1] = max(boxstartmaxs[1], boxendmaxs[1]);
5280 segmentmaxs[2] = max(boxstartmaxs[2], boxendmaxs[2]);
5281 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxstartmins, boxstartmaxs) && VectorCompare(boxendmins, boxendmaxs))
5283 if (VectorCompare(boxstartmins, boxendmins))
5286 if (model->brushq3.submodel)
5288 for (i = 0;i < model->brushq3.data_thismodel->numbrushes;i++)
5289 if (model->brushq3.data_thismodel->firstbrush[i].colbrushf)
5290 Collision_TracePointBrushFloat(trace, boxstartmins, model->brushq3.data_thismodel->firstbrush[i].colbrushf);
5293 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model->brushq3.data_nodes, boxstartmins, ++markframe);
5298 if (model->brushq3.submodel)
5300 for (i = 0;i < model->brushq3.data_thismodel->numbrushes;i++)
5301 if (model->brushq3.data_thismodel->firstbrush[i].colbrushf)
5302 Collision_TraceLineBrushFloat(trace, boxstartmins, boxendmins, model->brushq3.data_thismodel->firstbrush[i].colbrushf, model->brushq3.data_thismodel->firstbrush[i].colbrushf);
5303 if (mod_q3bsp_curves_collisions.integer)
5305 for (i = 0;i < model->brushq3.data_thismodel->numfaces;i++)
5307 face = model->brushq3.data_thismodel->firstface + i;
5308 if (face->num_collisiontriangles)
5309 Collision_TraceLineTriangleMeshFloat(trace, boxstartmins, boxendmins, face->num_collisiontriangles, face->data_collisionelement3i, face->data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5314 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model->brushq3.data_nodes, boxstartmins, boxendmins, 0, 1, boxstartmins, boxendmins, ++markframe, segmentmins, segmentmaxs);
5319 // box trace, performed as brush trace
5320 thisbrush_start = Collision_BrushForBox(&startmatrix, boxstartmins, boxstartmaxs);
5321 thisbrush_end = Collision_BrushForBox(&endmatrix, boxendmins, boxendmaxs);
5322 if (model->brushq3.submodel)
5324 for (i = 0;i < model->brushq3.data_thismodel->numbrushes;i++)
5325 if (model->brushq3.data_thismodel->firstbrush[i].colbrushf)
5326 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, model->brushq3.data_thismodel->firstbrush[i].colbrushf, model->brushq3.data_thismodel->firstbrush[i].colbrushf);
5327 if (mod_q3bsp_curves_collisions.integer)
5329 for (i = 0;i < model->brushq3.data_thismodel->numfaces;i++)
5331 face = model->brushq3.data_thismodel->firstface + i;
5332 if (face->num_collisiontriangles)
5333 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, face->num_collisiontriangles, face->data_collisionelement3i, face->data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5338 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model->brushq3.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5342 static int Mod_Q3BSP_BoxTouchingPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
5344 int clusterindex, side, nodestackindex = 0;
5345 q3mnode_t *node, *nodestack[1024];
5346 node = model->brushq3.data_nodes;
5347 if (!model->brush.num_pvsclusters)
5353 // node - recurse down the BSP tree
5354 side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
5357 // box is on one side of plane, take that path
5358 node = node->children[side];
5362 // box crosses plane, take one path and remember the other
5363 if (nodestackindex < 1024)
5364 nodestack[nodestackindex++] = node->children[0];
5365 node = node->children[1];
5370 // leaf - check cluster bit
5371 clusterindex = ((q3mleaf_t *)node)->clusterindex;
5373 if (clusterindex >= model->brush.num_pvsclusters)
5375 Con_Printf("%i >= %i\n", clusterindex, model->brush.num_pvsclusters);
5379 if (CHECKPVSBIT(pvs, clusterindex))
5381 // it is visible, return immediately with the news
5386 // nothing to see here, try another path we didn't take earlier
5387 if (nodestackindex == 0)
5389 node = nodestack[--nodestackindex];
5393 // it is not visible
5397 //Returns PVS data for a given point
5398 //(note: can return NULL)
5399 static qbyte *Mod_Q3BSP_GetPVS(model_t *model, const vec3_t p)
5402 Mod_CheckLoaded(model);
5403 node = model->brushq3.data_nodes;
5405 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
5406 if (((q3mleaf_t *)node)->clusterindex >= 0)
5407 return model->brush.data_pvsclusters + ((q3mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
5412 static void Mod_Q3BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, q3mnode_t *node)
5416 float d = PlaneDiff(org, node->plane);
5418 node = node->children[0];
5419 else if (d < -radius)
5420 node = node->children[1];
5423 // go down both sides
5424 Mod_Q3BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
5425 node = node->children[1];
5428 // if this leaf is in a cluster, accumulate the pvs bits
5429 if (((q3mleaf_t *)node)->clusterindex >= 0)
5432 qbyte *pvs = model->brush.data_pvsclusters + ((q3mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
5433 for (i = 0;i < pvsbytes;i++)
5434 pvsbuffer[i] |= pvs[i];
5438 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
5439 //of the given point.
5440 static int Mod_Q3BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
5442 int bytes = model->brush.num_pvsclusterbytes;
5443 bytes = min(bytes, pvsbufferlength);
5444 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q3BSP_GetPVS(model, org))
5446 memset(pvsbuffer, 0xFF, bytes);
5449 memset(pvsbuffer, 0, bytes);
5450 Mod_Q3BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brushq3.data_nodes);
5455 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5457 int supercontents = 0;
5458 if (nativecontents & Q2CONTENTS_SOLID)
5459 supercontents |= SUPERCONTENTS_SOLID;
5460 if (nativecontents & Q2CONTENTS_WATER)
5461 supercontents |= SUPERCONTENTS_WATER;
5462 if (nativecontents & Q2CONTENTS_SLIME)
5463 supercontents |= SUPERCONTENTS_SLIME;
5464 if (nativecontents & Q2CONTENTS_LAVA)
5465 supercontents |= SUPERCONTENTS_LAVA;
5466 return supercontents;
5469 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5471 int nativecontents = 0;
5472 if (supercontents & SUPERCONTENTS_SOLID)
5473 nativecontents |= Q2CONTENTS_SOLID;
5474 if (supercontents & SUPERCONTENTS_WATER)
5475 nativecontents |= Q2CONTENTS_WATER;
5476 if (supercontents & SUPERCONTENTS_SLIME)
5477 nativecontents |= Q2CONTENTS_SLIME;
5478 if (supercontents & SUPERCONTENTS_LAVA)
5479 nativecontents |= Q2CONTENTS_LAVA;
5480 return nativecontents;
5484 void Mod_Q3BSP_RecursiveGetVisible(q3mnode_t *node, model_t *model, const vec3_t point, const vec3_t mins, const vec3_t maxs, int maxleafs, q3mleaf_t *leaflist, int *numleafs, int maxsurfaces, q3msurface_t *surfacelist, int *numsurfaces, const qbyte *pvs)
5489 if (!BoxesOverlap(node->mins, node->maxs, mins, maxs))
5493 Mod_Q3BSP_RecursiveGetVisible(node->children[0], model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces, pvs);
5494 node = node->children[1];
5496 leaf = (mleaf_t *)node;
5497 if ((pvs == NULL || CHECKPVSBIT(pvs, leaf->clusterindex)))
5501 if (maxleafs && *numleafs < maxleafs)
5502 leaflist[(*numleaf)++] = leaf;
5505 for (marksurfacenum = 0;marksurfacenum < leaf->nummarksurfaces;marksurfacenum++)
5507 face = leaf->firstleafface[marksurfacenum];
5508 if (face->shadowmark != shadowmarkcount)
5510 face->shadowmark = shadowmarkcount;
5511 if (BoxesOverlap(mins, maxs, face->mins, face->maxs) && *numsurfaces < maxsurfaces)
5512 surfacelist[(*numsurfaces)++] = face;
5519 void Mod_Q3BSP_GetVisible(model_t *model, const vec3_t point, const vec3_t mins, const vec3_t maxs, int maxleafs, q3mleaf_t *leaflist, int *numleafs, int maxsurfaces, q3msurface_t *surfacelist, int *numsurfaces)
5521 // FIXME: support portals
5526 if (model->submodel)
5530 for (marksurfacenum = 0;marksurfacenum < leaf->nummarksurfaces;marksurfacenum++)
5532 face = ent->model->brushq3.surfaces + leaf->firstmarksurface[marksurfacenum];
5533 if (BoxesOverlap(mins, maxs, face->mins, face->maxs) && *numsurfaces < maxsurfaces)
5534 surfacelist[(*numsurfaces)++] = face;
5540 pvs = ent->model->brush.GetPVS(ent->model, relativelightorigin);
5541 Mod_Q3BSP_RecursiveGetVisible(ent->model->brushq3.data_nodes, model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces, pvs);
5546 void Mod_Q3BSP_BuildTextureFaceLists(void)
5549 loadmodel->brushq3.data_texturefaces = Mem_Alloc(loadmodel->mempool, loadmodel->nummodelsurfaces * sizeof(q3msurface_t *));
5550 loadmodel->brushq3.data_texturefacenums = Mem_Alloc(loadmodel->mempool, loadmodel->nummodelsurfaces * sizeof(int));
5551 for (i = 0;i < loadmodel->brushq3.num_textures;i++)
5552 loadmodel->brushq3.data_textures[i].numfaces = 0;
5553 for (i = 0;i < loadmodel->nummodelsurfaces;i++)
5554 loadmodel->brushq3.data_faces[loadmodel->surfacelist[i]].texture->numfaces++;
5556 for (i = 0;i < loadmodel->brushq3.num_textures;i++)
5558 loadmodel->brushq3.data_textures[i].facelist = loadmodel->brushq3.data_texturefaces + j;
5559 loadmodel->brushq3.data_textures[i].facenumlist = loadmodel->brushq3.data_texturefacenums + j;
5560 j += loadmodel->brushq3.data_textures[i].numfaces;
5561 loadmodel->brushq3.data_textures[i].numfaces = 0;
5563 for (i = 0;i < loadmodel->nummodelsurfaces;i++)
5565 loadmodel->brushq3.data_faces[loadmodel->surfacelist[i]].texture->facenumlist[loadmodel->brushq3.data_faces[loadmodel->surfacelist[i]].texture->numfaces] = loadmodel->surfacelist[i];
5566 loadmodel->brushq3.data_faces[loadmodel->surfacelist[i]].texture->facelist[loadmodel->brushq3.data_faces[loadmodel->surfacelist[i]].texture->numfaces++] = loadmodel->brushq3.data_faces + loadmodel->surfacelist[i];
5570 void Mod_Q3BSP_RecursiveFindNumLeafs(q3mnode_t *node)
5575 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5576 node = node->children[1];
5578 numleafs = ((q3mleaf_t *)node - loadmodel->brushq3.data_leafs) + 1;
5579 if (loadmodel->brushq3.num_leafs < numleafs)
5580 loadmodel->brushq3.num_leafs = numleafs;
5583 extern void R_Q3BSP_DrawSky(struct entity_render_s *ent);
5584 extern void R_Q3BSP_Draw(struct entity_render_s *ent);
5585 extern void R_Q3BSP_GetLightInfo(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, vec3_t outmins, vec3_t outmaxs, int *outclusterlist, qbyte *outclusterpvs, int *outnumclusterspointer, int *outsurfacelist, qbyte *outsurfacepvs, int *outnumsurfacespointer);
5586 extern void R_Q3BSP_DrawShadowVolume(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, int numsurfaces, const int *surfacelist);
5587 extern void R_Q3BSP_DrawLight(entity_render_t *ent, vec3_t relativelightorigin, vec3_t relativeeyeorigin, float lightradius, float *lightcolor, const matrix4x4_t *matrix_modeltolight, const matrix4x4_t *matrix_modeltoattenuationxyz, const matrix4x4_t *matrix_modeltoattenuationz, rtexture_t *lightcubemap, int numsurfaces, const int *surfacelist);
5588 void Mod_Q3BSP_Load(model_t *mod, void *buffer)
5590 int i, j, numshadowmeshtriangles;
5591 q3dheader_t *header;
5592 float corner[3], yawradius, modelradius;
5595 mod->type = mod_brushq3;
5599 header = (q3dheader_t *)buffer;
5601 i = LittleLong(header->version);
5602 if (i != Q3BSPVERSION)
5603 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5604 if (mod->isworldmodel)
5606 Cvar_SetValue("halflifebsp", false);
5607 // until we get a texture for it...
5611 mod->soundfromcenter = true;
5612 mod->TraceBox = Mod_Q3BSP_TraceBox;
5613 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5614 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5615 mod->brush.GetPVS = Mod_Q3BSP_GetPVS;
5616 mod->brush.FatPVS = Mod_Q3BSP_FatPVS;
5617 mod->brush.BoxTouchingPVS = Mod_Q3BSP_BoxTouchingPVS;
5618 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5619 mod->brush.FindNonSolidLocation = Mod_Q3BSP_FindNonSolidLocation;
5620 //mod->DrawSky = R_Q3BSP_DrawSky;
5621 mod->Draw = R_Q3BSP_Draw;
5622 mod->GetLightInfo = R_Q3BSP_GetLightInfo;
5623 mod->DrawShadowVolume = R_Q3BSP_DrawShadowVolume;
5624 mod->DrawLight = R_Q3BSP_DrawLight;
5626 mod_base = (qbyte *)header;
5628 // swap all the lumps
5629 header->ident = LittleLong(header->ident);
5630 header->version = LittleLong(header->version);
5631 for (i = 0;i < Q3HEADER_LUMPS;i++)
5633 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5634 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5637 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5638 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5639 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5640 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5641 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5642 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5643 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5644 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5645 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS]);
5646 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5647 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5648 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5649 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5650 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5651 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5652 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5653 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5654 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5656 // make a single combined shadow mesh to allow optimized shadow volume creation
5657 numshadowmeshtriangles = 0;
5658 for (j = 0, face = loadmodel->brushq3.data_faces;j < loadmodel->brushq3.num_faces;j++, face++)
5660 face->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5661 numshadowmeshtriangles += face->num_triangles;
5663 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5664 for (j = 0, face = loadmodel->brushq3.data_faces;j < loadmodel->brushq3.num_faces;j++, face++)
5665 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, face->data_vertex3f, NULL, NULL, NULL, NULL, face->num_triangles, face->data_element3i);
5666 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
5667 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5669 loadmodel->brushq3.num_leafs = 0;
5670 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brushq3.data_nodes);
5673 for (i = 0;i < loadmodel->brushq3.num_models;i++)
5678 // LordHavoc: only register submodels if it is the world
5679 // (prevents external bsp models from replacing world submodels with
5681 if (!loadmodel->isworldmodel)
5683 // duplicate the basic information
5684 sprintf(name, "*%i", i);
5685 mod = Mod_FindName(name);
5687 strcpy(mod->name, name);
5688 // textures and memory belong to the main model
5689 mod->texturepool = NULL;
5690 mod->mempool = NULL;
5691 mod->brush.GetPVS = NULL;
5692 mod->brush.FatPVS = NULL;
5693 mod->brush.BoxTouchingPVS = NULL;
5694 mod->brush.LightPoint = NULL;
5695 mod->brush.FindNonSolidLocation = Mod_Q3BSP_FindNonSolidLocation;
5697 mod->brushq3.data_thismodel = loadmodel->brushq3.data_models + i;
5698 mod->brushq3.submodel = i;
5700 // make the model surface list (used by shadowing/lighting)
5701 mod->nummodelsurfaces = mod->brushq3.data_thismodel->numfaces;
5702 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5703 for (j = 0;j < mod->nummodelsurfaces;j++)
5704 mod->surfacelist[j] = (mod->brushq3.data_thismodel->firstface - mod->brushq3.data_faces) + j;
5706 VectorCopy(mod->brushq3.data_thismodel->mins, mod->normalmins);
5707 VectorCopy(mod->brushq3.data_thismodel->maxs, mod->normalmaxs);
5708 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5709 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5710 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5711 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5712 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5713 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5714 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5715 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5716 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5717 mod->yawmins[2] = mod->normalmins[2];
5718 mod->yawmaxs[2] = mod->normalmaxs[2];
5719 mod->radius = modelradius;
5720 mod->radius2 = modelradius * modelradius;
5722 for (j = 0;j < mod->brushq3.data_thismodel->numfaces;j++)
5723 if (mod->brushq3.data_thismodel->firstface[j].texture->surfaceflags & Q3SURFACEFLAG_SKY)
5725 if (j < mod->brushq3.data_thismodel->numfaces)
5726 mod->DrawSky = R_Q3BSP_DrawSky;
5729 Mod_Q3BSP_BuildTextureFaceLists();
5732 void Mod_IBSP_Load(model_t *mod, void *buffer)
5734 int i = LittleLong(((int *)buffer)[1]);
5735 if (i == Q3BSPVERSION)
5736 Mod_Q3BSP_Load(mod,buffer);
5737 else if (i == Q2BSPVERSION)
5738 Mod_Q2BSP_Load(mod,buffer);
5740 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i\n", i);
5743 void Mod_MAP_Load(model_t *mod, void *buffer)
5745 Host_Error("Mod_MAP_Load: not yet implemented\n");