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 nodestack[nodestackindex++] = node->children[0];
130 node = node->children[1];
135 // leaf - check cluster bit
136 clusterindex = ((mleaf_t *)node)->clusterindex;
137 if (CHECKPVSBIT(pvs, clusterindex))
139 // it is visible, return immediately with the news
144 // nothing to see here, try another path we didn't take earlier
145 if (nodestackindex == 0)
147 node = nodestack[--nodestackindex];
156 static int Mod_Q1BSP_PointContents(model_t *model, const vec3_t p)
161 return CONTENTS_EMPTY;
163 Mod_CheckLoaded(model);
165 // LordHavoc: modified to start at first clip node,
166 // in other words: first node of the (sub)model
167 node = model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode;
168 while (node->contents == 0)
169 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
171 return ((mleaf_t *)node)->contents;
175 typedef struct findnonsolidlocationinfo_s
183 findnonsolidlocationinfo_t;
186 extern cvar_t samelevel;
188 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
190 int i, surfnum, k, *tri, *mark;
191 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
196 for (surfnum = 0, mark = leaf->firstmarksurface;surfnum < leaf->nummarksurfaces;surfnum++, mark++)
198 surf = info->model->brushq1.surfaces + *mark;
199 if (surf->flags & SURF_SOLIDCLIP)
202 VectorCopy(surf->plane->normal, surfnormal);
203 if (surf->flags & SURF_PLANEBACK)
204 VectorNegate(surfnormal, surfnormal);
206 for (k = 0;k < surf->mesh.num_triangles;k++)
208 tri = surf->mesh.data_element3i + k * 3;
209 VectorCopy((surf->mesh.data_vertex3f + tri[0] * 3), vert[0]);
210 VectorCopy((surf->mesh.data_vertex3f + tri[1] * 3), vert[1]);
211 VectorCopy((surf->mesh.data_vertex3f + tri[2] * 3), vert[2]);
212 VectorSubtract(vert[1], vert[0], edge[0]);
213 VectorSubtract(vert[2], vert[1], edge[1]);
214 CrossProduct(edge[1], edge[0], facenormal);
215 if (facenormal[0] || facenormal[1] || facenormal[2])
217 VectorNormalize(facenormal);
219 if (VectorDistance(facenormal, surfnormal) > 0.01f)
220 Con_Printf("a2! %f %f %f != %f %f %f\n", facenormal[0], facenormal[1], facenormal[2], surfnormal[0], surfnormal[1], surfnormal[2]);
222 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
223 if (f <= info->bestdist && f >= -info->bestdist)
225 VectorSubtract(vert[0], vert[2], edge[2]);
226 VectorNormalize(edge[0]);
227 VectorNormalize(edge[1]);
228 VectorNormalize(edge[2]);
229 CrossProduct(facenormal, edge[0], edgenormal[0]);
230 CrossProduct(facenormal, edge[1], edgenormal[1]);
231 CrossProduct(facenormal, edge[2], edgenormal[2]);
233 if (samelevel.integer & 1)
234 VectorNegate(edgenormal[0], edgenormal[0]);
235 if (samelevel.integer & 2)
236 VectorNegate(edgenormal[1], edgenormal[1]);
237 if (samelevel.integer & 4)
238 VectorNegate(edgenormal[2], edgenormal[2]);
239 for (i = 0;i < 3;i++)
240 if (DotProduct(vert[0], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f
241 || DotProduct(vert[1], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f
242 || DotProduct(vert[2], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f)
243 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]);
246 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
247 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
248 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
250 // we got lucky, the center is within the face
251 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
255 if (info->bestdist > dist)
257 info->bestdist = dist;
258 VectorScale(facenormal, (info->radius - -dist), info->nudge);
263 if (info->bestdist > dist)
265 info->bestdist = dist;
266 VectorScale(facenormal, (info->radius - dist), info->nudge);
272 // check which edge or vertex the center is nearest
273 for (i = 0;i < 3;i++)
275 f = DotProduct(info->center, edge[i]);
276 if (f >= DotProduct(vert[0], edge[i])
277 && f <= DotProduct(vert[1], edge[i]))
280 VectorMA(info->center, -f, edge[i], point);
281 dist = sqrt(DotProduct(point, point));
282 if (info->bestdist > dist)
284 info->bestdist = dist;
285 VectorScale(point, (info->radius / dist), info->nudge);
287 // skip both vertex checks
288 // (both are further away than this edge)
293 // not on edge, check first vertex of edge
294 VectorSubtract(info->center, vert[i], point);
295 dist = sqrt(DotProduct(point, point));
296 if (info->bestdist > dist)
298 info->bestdist = dist;
299 VectorScale(point, (info->radius / dist), info->nudge);
311 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
315 if (((mleaf_t *)node)->nummarksurfaces)
316 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
320 float f = PlaneDiff(info->center, node->plane);
321 if (f >= -info->bestdist)
322 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
323 if (f <= info->bestdist)
324 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
328 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
331 findnonsolidlocationinfo_t info;
337 VectorCopy(in, info.center);
338 info.radius = radius;
343 VectorClear(info.nudge);
344 info.bestdist = radius;
345 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode);
346 VectorAdd(info.center, info.nudge, info.center);
348 while (info.bestdist < radius && ++i < 10);
349 VectorCopy(info.center, out);
352 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
354 switch(nativecontents)
359 return SUPERCONTENTS_SOLID;
361 return SUPERCONTENTS_WATER;
363 return SUPERCONTENTS_SLIME;
365 return SUPERCONTENTS_LAVA;
367 return SUPERCONTENTS_SKY;
372 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
374 if (supercontents & SUPERCONTENTS_SOLID)
375 return CONTENTS_SOLID;
376 if (supercontents & SUPERCONTENTS_SKY)
378 if (supercontents & SUPERCONTENTS_LAVA)
379 return CONTENTS_LAVA;
380 if (supercontents & SUPERCONTENTS_SLIME)
381 return CONTENTS_SLIME;
382 if (supercontents & SUPERCONTENTS_WATER)
383 return CONTENTS_WATER;
384 return CONTENTS_EMPTY;
389 // the hull we're tracing through
392 // the trace structure to fill in
395 // start, end, and end - start (in model space)
400 RecursiveHullCheckTraceInfo_t;
402 // 1/32 epsilon to keep floating point happy
403 #define DIST_EPSILON (0.03125)
405 #define HULLCHECKSTATE_EMPTY 0
406 #define HULLCHECKSTATE_SOLID 1
407 #define HULLCHECKSTATE_DONE 2
409 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
411 // status variables, these don't need to be saved on the stack when
412 // recursing... but are because this should be thread-safe
413 // (note: tracing against a bbox is not thread-safe, yet)
418 // variables that need to be stored on the stack when recursing
423 // LordHavoc: a goto! everyone flee in terror... :)
428 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
429 if (!t->trace->startfound)
431 t->trace->startfound = true;
432 t->trace->startsupercontents |= num;
434 if (num & SUPERCONTENTS_LIQUIDSMASK)
435 t->trace->inwater = true;
437 t->trace->inopen = true;
438 if (num & t->trace->hitsupercontentsmask)
440 // if the first leaf is solid, set startsolid
441 if (t->trace->allsolid)
442 t->trace->startsolid = true;
443 #if COLLISIONPARANOID >= 3
446 return HULLCHECKSTATE_SOLID;
450 t->trace->allsolid = false;
451 #if COLLISIONPARANOID >= 3
454 return HULLCHECKSTATE_EMPTY;
458 // find the point distances
459 node = t->hull->clipnodes + num;
461 plane = t->hull->planes + node->planenum;
464 t1 = p1[plane->type] - plane->dist;
465 t2 = p2[plane->type] - plane->dist;
469 t1 = DotProduct (plane->normal, p1) - plane->dist;
470 t2 = DotProduct (plane->normal, p2) - plane->dist;
477 #if COLLISIONPARANOID >= 3
480 num = node->children[1];
489 #if COLLISIONPARANOID >= 3
492 num = node->children[0];
498 // the line intersects, find intersection point
499 // LordHavoc: this uses the original trace for maximum accuracy
500 #if COLLISIONPARANOID >= 3
505 t1 = t->start[plane->type] - plane->dist;
506 t2 = t->end[plane->type] - plane->dist;
510 t1 = DotProduct (plane->normal, t->start) - plane->dist;
511 t2 = DotProduct (plane->normal, t->end) - plane->dist;
514 midf = t1 / (t1 - t2);
515 midf = bound(p1f, midf, p2f);
516 VectorMA(t->start, midf, t->dist, mid);
518 // recurse both sides, front side first
519 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
520 // if this side is not empty, return what it is (solid or done)
521 if (ret != HULLCHECKSTATE_EMPTY)
524 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
525 // if other side is not solid, return what it is (empty or done)
526 if (ret != HULLCHECKSTATE_SOLID)
529 // front is air and back is solid, this is the impact point...
532 t->trace->plane.dist = -plane->dist;
533 VectorNegate (plane->normal, t->trace->plane.normal);
537 t->trace->plane.dist = plane->dist;
538 VectorCopy (plane->normal, t->trace->plane.normal);
541 // calculate the true fraction
542 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
543 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
544 midf = t1 / (t1 - t2);
545 t->trace->realfraction = bound(0, midf, 1);
547 // calculate the return fraction which is nudged off the surface a bit
548 midf = (t1 - DIST_EPSILON) / (t1 - t2);
549 t->trace->fraction = bound(0, midf, 1);
551 #if COLLISIONPARANOID >= 3
554 return HULLCHECKSTATE_DONE;
557 #if COLLISIONPARANOID < 2
558 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
561 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];
562 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
563 t->trace->startsupercontents |= num;
564 if (num & SUPERCONTENTS_LIQUIDSMASK)
565 t->trace->inwater = true;
567 t->trace->inopen = true;
568 if (num & t->trace->hitsupercontentsmask)
570 t->trace->allsolid = t->trace->startsolid = true;
571 return HULLCHECKSTATE_SOLID;
575 t->trace->allsolid = t->trace->startsolid = false;
576 return HULLCHECKSTATE_EMPTY;
581 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)
583 // this function currently only supports same size start and end
585 RecursiveHullCheckTraceInfo_t rhc;
587 memset(&rhc, 0, sizeof(rhc));
588 memset(trace, 0, sizeof(trace_t));
590 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
591 rhc.trace->fraction = 1;
592 rhc.trace->realfraction = 1;
593 rhc.trace->allsolid = true;
594 VectorSubtract(boxstartmaxs, boxstartmins, boxsize);
596 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
597 else if (model->brush.ishlbsp)
599 // LordHavoc: this has to have a minor tolerance (the .1) because of
600 // minor float precision errors from the box being transformed around
601 if (boxsize[0] < 32.1)
603 if (boxsize[2] < 54) // pick the nearest of 36 or 72
604 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
606 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
609 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
613 // LordHavoc: this has to have a minor tolerance (the .1) because of
614 // minor float precision errors from the box being transformed around
615 if (boxsize[0] < 32.1)
616 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
618 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
620 VectorSubtract(boxstartmins, rhc.hull->clip_mins, rhc.start);
621 VectorSubtract(boxendmins, rhc.hull->clip_mins, rhc.end);
622 VectorSubtract(rhc.end, rhc.start, rhc.dist);
623 #if COLLISIONPARANOID >= 2
624 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]);
625 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
628 if (DotProduct(rhc.dist, rhc.dist))
629 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
631 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
635 static hull_t box_hull;
636 static dclipnode_t box_clipnodes[6];
637 static mplane_t box_planes[6];
639 static void Mod_Q1BSP_Collision_Init (void)
644 //Set up the planes and clipnodes so that the six floats of a bounding box
645 //can just be stored out and get a proper hull_t structure.
647 box_hull.clipnodes = box_clipnodes;
648 box_hull.planes = box_planes;
649 box_hull.firstclipnode = 0;
650 box_hull.lastclipnode = 5;
652 for (i = 0;i < 6;i++)
654 box_clipnodes[i].planenum = i;
658 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
660 box_clipnodes[i].children[side^1] = i + 1;
662 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
664 box_planes[i].type = i>>1;
665 box_planes[i].normal[i>>1] = 1;
669 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)
673 colplanef_t cbox_planes[6];
674 cbox.supercontents = boxsupercontents;
677 cbox.numtriangles = 0;
678 cbox.planes = cbox_planes;
680 cbox.elements = NULL;
688 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];
689 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];
690 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];
691 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];
692 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];
693 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];
694 memset(trace, 0, sizeof(trace_t));
695 trace->hitsupercontentsmask = hitsupercontentsmask;
697 trace->realfraction = 1;
698 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
700 RecursiveHullCheckTraceInfo_t rhc;
701 // fill in a default trace
702 memset(&rhc, 0, sizeof(rhc));
703 memset(trace, 0, sizeof(trace_t));
704 //To keep everything totally uniform, bounding boxes are turned into small
705 //BSP trees instead of being compared directly.
706 // create a temp hull from bounding box sizes
707 box_planes[0].dist = cmaxs[0] - mins[0];
708 box_planes[1].dist = cmins[0] - maxs[0];
709 box_planes[2].dist = cmaxs[1] - mins[1];
710 box_planes[3].dist = cmins[1] - maxs[1];
711 box_planes[4].dist = cmaxs[2] - mins[2];
712 box_planes[5].dist = cmins[2] - maxs[2];
713 #if COLLISIONPARANOID >= 3
714 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]);
716 // trace a line through the generated clipping hull
717 //rhc.boxsupercontents = boxsupercontents;
718 rhc.hull = &box_hull;
720 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
721 rhc.trace->fraction = 1;
722 rhc.trace->realfraction = 1;
723 rhc.trace->allsolid = true;
724 VectorCopy(start, rhc.start);
725 VectorCopy(end, rhc.end);
726 VectorSubtract(rhc.end, rhc.start, rhc.dist);
727 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
728 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
729 if (rhc.trace->startsupercontents)
730 rhc.trace->startsupercontents = boxsupercontents;
734 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)
736 int side, distz = endz - startz;
741 if (node->contents < 0)
742 return false; // didn't hit anything
744 switch (node->plane->type)
747 node = node->children[x < node->plane->dist];
750 node = node->children[y < node->plane->dist];
753 side = startz < node->plane->dist;
754 if ((endz < node->plane->dist) == side)
756 node = node->children[side];
759 // found an intersection
760 mid = node->plane->dist;
763 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
764 front += startz * node->plane->normal[2];
765 back += endz * node->plane->normal[2];
766 side = front < node->plane->dist;
767 if ((back < node->plane->dist) == side)
769 node = node->children[side];
772 // found an intersection
773 mid = startz + distz * (front - node->plane->dist) / (front - back);
777 // go down front side
778 if (node->children[side]->contents >= 0 && Mod_Q1BSP_LightPoint_RecursiveBSPNode(ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
779 return true; // hit something
782 // check for impact on this node
783 if (node->numsurfaces)
788 surf = cl.worldmodel->brushq1.surfaces + node->firstsurface;
789 for (i = 0;i < node->numsurfaces;i++, surf++)
791 if (!(surf->flags & SURF_LIGHTMAP))
792 continue; // no lightmaps
794 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];
795 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];
796 ds = bound(0, ds, surf->extents[0]);
797 dt = bound(0, dt, surf->extents[1]);
802 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;
803 lmwidth = ((surf->extents[0]>>4)+1);
804 lmheight = ((surf->extents[1]>>4)+1);
805 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
806 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
808 lightmap = surf->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
810 for (maps = 0;maps < MAXLIGHTMAPS && surf->styles[maps] != 255;maps++)
812 scale = d_lightstylevalue[surf->styles[maps]];
813 r00 += lightmap[ 0] * scale;g00 += lightmap[ 1] * scale;b00 += lightmap[ 2] * scale;
814 r01 += lightmap[ 3] * scale;g01 += lightmap[ 4] * scale;b01 += lightmap[ 5] * scale;
815 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
816 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
821 LordHavoc: here's the readable version of the interpolation
822 code, not quite as easy for the compiler to optimize...
824 dsfrac is the X position in the lightmap pixel, * 16
825 dtfrac is the Y position in the lightmap pixel, * 16
826 r00 is top left corner, r01 is top right corner
827 r10 is bottom left corner, r11 is bottom right corner
828 g and b are the same layout.
829 r0 and r1 are the top and bottom intermediate results
831 first we interpolate the top two points, to get the top
834 r0 = (((r01-r00) * dsfrac) >> 4) + r00;
835 g0 = (((g01-g00) * dsfrac) >> 4) + g00;
836 b0 = (((b01-b00) * dsfrac) >> 4) + b00;
838 then we interpolate the bottom two points, to get the
841 r1 = (((r11-r10) * dsfrac) >> 4) + r10;
842 g1 = (((g11-g10) * dsfrac) >> 4) + g10;
843 b1 = (((b11-b10) * dsfrac) >> 4) + b10;
845 then we interpolate the top and bottom samples to get the
846 middle sample (the one which was requested)
848 r = (((r1-r0) * dtfrac) >> 4) + r0;
849 g = (((g1-g0) * dtfrac) >> 4) + g0;
850 b = (((b1-b0) * dtfrac) >> 4) + b0;
853 ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
854 ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
855 ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
857 return true; // success
862 node = node->children[side ^ 1];
864 distz = endz - startz;
869 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
871 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);
874 static void Mod_Q1BSP_DecompressVis(const qbyte *in, const qbyte *inend, qbyte *out, qbyte *outend)
877 qbyte *outstart = out;
882 Con_DPrintf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
892 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);
895 for (c = *in++;c > 0;c--)
899 Con_DPrintf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
908 static void Mod_Q1BSP_LoadTextures(lump_t *l)
910 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
912 texture_t *tx, *tx2, *anims[10], *altanims[10];
914 qbyte *data, *mtdata;
917 loadmodel->brushq1.textures = NULL;
919 // add two slots for notexture walls and notexture liquids
922 m = (dmiptexlump_t *)(mod_base + l->fileofs);
923 m->nummiptex = LittleLong (m->nummiptex);
924 loadmodel->brushq1.numtextures = m->nummiptex + 2;
929 loadmodel->brushq1.numtextures = 2;
932 loadmodel->brushq1.textures = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numtextures * sizeof(texture_t));
934 // fill out all slots with notexture
935 for (i = 0, tx = loadmodel->brushq1.textures;i < loadmodel->brushq1.numtextures;i++, tx++)
938 strcpy(tx->name, "NO TEXTURE FOUND");
941 tx->skin.base = r_notexture;
942 tx->shader = &Cshader_wall_lightmap;
943 tx->flags = SURF_SOLIDCLIP;
944 if (i == loadmodel->brushq1.numtextures - 1)
946 tx->flags |= SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
947 tx->shader = &Cshader_water;
949 tx->currentframe = tx;
955 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
957 // LordHavoc: mostly rewritten map texture loader
958 for (i = 0;i < m->nummiptex;i++)
960 dofs[i] = LittleLong(dofs[i]);
961 if (dofs[i] == -1 || r_nosurftextures.integer)
963 dmiptex = (miptex_t *)((qbyte *)m + dofs[i]);
965 // make sure name is no more than 15 characters
966 for (j = 0;dmiptex->name[j] && j < 15;j++)
967 name[j] = dmiptex->name[j];
970 mtwidth = LittleLong(dmiptex->width);
971 mtheight = LittleLong(dmiptex->height);
973 j = LittleLong(dmiptex->offsets[0]);
977 if (j < 40 || j + mtwidth * mtheight > l->filelen)
979 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
982 mtdata = (qbyte *)dmiptex + j;
985 if ((mtwidth & 15) || (mtheight & 15))
986 Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned", dmiptex->name, loadmodel->name);
988 // LordHavoc: force all names to lowercase
989 for (j = 0;name[j];j++)
990 if (name[j] >= 'A' && name[j] <= 'Z')
991 name[j] += 'a' - 'A';
993 tx = loadmodel->brushq1.textures + i;
994 strcpy(tx->name, name);
996 tx->height = mtheight;
1000 sprintf(tx->name, "unnamed%i", i);
1001 Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1004 // LordHavoc: HL sky textures are entirely different than quake
1005 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1007 if (loadmodel->isworldmodel)
1009 data = loadimagepixels(tx->name, false, 0, 0);
1012 if (image_width == 256 && image_height == 128)
1020 Con_Printf("Invalid replacement texture for sky \"%s\" in %\"%s\", must be 256x128 pixels\n", tx->name, loadmodel->name);
1022 R_InitSky(mtdata, 1);
1025 else if (mtdata != NULL)
1026 R_InitSky(mtdata, 1);
1031 if (!Mod_LoadSkinFrame(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE, false, true, true))
1033 // did not find external texture, load it from the bsp or wad3
1034 if (loadmodel->brush.ishlbsp)
1036 // internal texture overrides wad
1037 qbyte *pixels, *freepixels, *fogpixels;
1038 pixels = freepixels = NULL;
1040 pixels = W_ConvertWAD3Texture(dmiptex);
1042 pixels = freepixels = W_GetTexture(tx->name);
1045 tx->width = image_width;
1046 tx->height = image_height;
1047 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, NULL);
1048 if (Image_CheckAlpha(pixels, image_width * image_height, true))
1050 fogpixels = Mem_Alloc(tempmempool, image_width * image_height * 4);
1051 for (j = 0;j < image_width * image_height * 4;j += 4)
1053 fogpixels[j + 0] = 255;
1054 fogpixels[j + 1] = 255;
1055 fogpixels[j + 2] = 255;
1056 fogpixels[j + 3] = pixels[j + 3];
1058 tx->skin.fog = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE, NULL);
1059 Mem_Free(fogpixels);
1063 Mem_Free(freepixels);
1065 else if (mtdata) // texture included
1066 Mod_LoadSkinFrame_Internal(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_PRECACHE, false, true, tx->name[0] != '*' && r_fullbrights.integer, mtdata, tx->width, tx->height);
1069 if (tx->skin.base == NULL)
1074 tx->skin.base = r_notexture;
1077 if (tx->name[0] == '*')
1079 // turb does not block movement
1080 tx->flags &= ~SURF_SOLIDCLIP;
1081 tx->flags |= SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
1082 // LordHavoc: some turbulent textures should be fullbright and solid
1083 if (!strncmp(tx->name,"*lava",5)
1084 || !strncmp(tx->name,"*teleport",9)
1085 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1086 tx->flags |= SURF_DRAWFULLBRIGHT | SURF_DRAWNOALPHA;
1088 tx->flags |= SURF_WATERALPHA;
1089 tx->shader = &Cshader_water;
1091 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1093 tx->flags |= SURF_DRAWSKY;
1094 tx->shader = &Cshader_sky;
1098 tx->flags |= SURF_LIGHTMAP;
1100 tx->flags |= SURF_SHADOWCAST | SURF_SHADOWLIGHT;
1101 tx->shader = &Cshader_wall_lightmap;
1104 // start out with no animation
1105 tx->currentframe = tx;
1108 // sequence the animations
1109 for (i = 0;i < m->nummiptex;i++)
1111 tx = loadmodel->brushq1.textures + i;
1112 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1114 if (tx->anim_total[0] || tx->anim_total[1])
1115 continue; // already sequenced
1117 // find the number of frames in the animation
1118 memset(anims, 0, sizeof(anims));
1119 memset(altanims, 0, sizeof(altanims));
1121 for (j = i;j < m->nummiptex;j++)
1123 tx2 = loadmodel->brushq1.textures + j;
1124 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1128 if (num >= '0' && num <= '9')
1129 anims[num - '0'] = tx2;
1130 else if (num >= 'a' && num <= 'j')
1131 altanims[num - 'a'] = tx2;
1133 Con_Printf("Bad animating texture %s\n", tx->name);
1137 for (j = 0;j < 10;j++)
1144 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1147 for (j = 0;j < max;j++)
1151 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1155 for (j = 0;j < altmax;j++)
1159 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1168 // if there is no alternate animation, duplicate the primary
1169 // animation into the alternate
1171 for (k = 0;k < 10;k++)
1172 altanims[k] = anims[k];
1175 // link together the primary animation
1176 for (j = 0;j < max;j++)
1179 tx2->animated = true;
1180 tx2->anim_total[0] = max;
1181 tx2->anim_total[1] = altmax;
1182 for (k = 0;k < 10;k++)
1184 tx2->anim_frames[0][k] = anims[k];
1185 tx2->anim_frames[1][k] = altanims[k];
1189 // if there really is an alternate anim...
1190 if (anims[0] != altanims[0])
1192 // link together the alternate animation
1193 for (j = 0;j < altmax;j++)
1196 tx2->animated = true;
1197 // the primary/alternate are reversed here
1198 tx2->anim_total[0] = altmax;
1199 tx2->anim_total[1] = max;
1200 for (k = 0;k < 10;k++)
1202 tx2->anim_frames[0][k] = altanims[k];
1203 tx2->anim_frames[1][k] = anims[k];
1210 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1213 qbyte *in, *out, *data, d;
1214 char litfilename[1024];
1215 loadmodel->brushq1.lightdata = NULL;
1216 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1218 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen);
1219 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1221 else // LordHavoc: bsp version 29 (normal white lighting)
1223 // LordHavoc: hope is not lost yet, check for a .lit file to load
1224 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1225 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1226 strlcat (litfilename, ".lit", sizeof (litfilename));
1227 data = (qbyte*) FS_LoadFile(litfilename, false);
1230 if (fs_filesize > 8 && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1232 i = LittleLong(((int *)data)[1]);
1235 Con_DPrintf("loaded %s\n", litfilename);
1236 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, fs_filesize - 8);
1237 memcpy(loadmodel->brushq1.lightdata, data + 8, fs_filesize - 8);
1243 Con_Printf("Unknown .lit file version (%d)\n", i);
1249 if (fs_filesize == 8)
1250 Con_Printf("Empty .lit file, ignoring\n");
1252 Con_Printf("Corrupt .lit file (old version?), ignoring\n");
1256 // LordHavoc: oh well, expand the white lighting data
1259 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen*3);
1260 in = loadmodel->brushq1.lightdata + l->filelen*2; // place the file at the end, so it will not be overwritten until the very last write
1261 out = loadmodel->brushq1.lightdata;
1262 memcpy(in, mod_base + l->fileofs, l->filelen);
1263 for (i = 0;i < l->filelen;i++)
1273 static void Mod_Q1BSP_LoadLightList(void)
1275 int a, n, numlights;
1276 char lightsfilename[1024], *s, *t, *lightsstring;
1279 strlcpy (lightsfilename, loadmodel->name, sizeof (lightsfilename));
1280 FS_StripExtension (lightsfilename, lightsfilename, sizeof(lightsfilename));
1281 strlcat (lightsfilename, ".lights", sizeof (lightsfilename));
1282 s = lightsstring = (char *) FS_LoadFile(lightsfilename, false);
1288 while (*s && *s != '\n')
1292 Mem_Free(lightsstring);
1293 Host_Error("lights file must end with a newline\n");
1298 loadmodel->brushq1.lights = Mem_Alloc(loadmodel->mempool, numlights * sizeof(mlight_t));
1301 while (*s && n < numlights)
1304 while (*s && *s != '\n')
1308 Mem_Free(lightsstring);
1309 Host_Error("misparsed lights file!\n");
1311 e = loadmodel->brushq1.lights + n;
1313 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);
1317 Mem_Free(lightsstring);
1318 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);
1325 Mem_Free(lightsstring);
1326 Host_Error("misparsed lights file!\n");
1328 loadmodel->brushq1.numlights = numlights;
1329 Mem_Free(lightsstring);
1333 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1335 loadmodel->brushq1.num_compressedpvs = 0;
1336 loadmodel->brushq1.data_compressedpvs = NULL;
1339 loadmodel->brushq1.num_compressedpvs = l->filelen;
1340 loadmodel->brushq1.data_compressedpvs = Mem_Alloc(loadmodel->mempool, l->filelen);
1341 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1344 // used only for HalfLife maps
1345 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1347 char key[128], value[4096];
1352 if (!COM_ParseToken(&data, false))
1354 if (com_token[0] != '{')
1358 if (!COM_ParseToken(&data, false))
1360 if (com_token[0] == '}')
1361 break; // end of worldspawn
1362 if (com_token[0] == '_')
1363 strcpy(key, com_token + 1);
1365 strcpy(key, com_token);
1366 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1367 key[strlen(key)-1] = 0;
1368 if (!COM_ParseToken(&data, false))
1370 strcpy(value, com_token);
1371 if (!strcmp("wad", key)) // for HalfLife maps
1373 if (loadmodel->brush.ishlbsp)
1376 for (i = 0;i < 4096;i++)
1377 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1383 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1384 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1386 else if (value[i] == ';' || value[i] == 0)
1390 strcpy(wadname, "textures/");
1391 strcat(wadname, &value[j]);
1392 W_LoadTextureWadFile(wadname, false);
1404 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1406 loadmodel->brush.entities = NULL;
1409 loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
1410 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1411 if (loadmodel->brush.ishlbsp)
1412 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1416 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1422 in = (void *)(mod_base + l->fileofs);
1423 if (l->filelen % sizeof(*in))
1424 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1425 count = l->filelen / sizeof(*in);
1426 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1428 loadmodel->brushq1.vertexes = out;
1429 loadmodel->brushq1.numvertexes = count;
1431 for ( i=0 ; i<count ; i++, in++, out++)
1433 out->position[0] = LittleFloat(in->point[0]);
1434 out->position[1] = LittleFloat(in->point[1]);
1435 out->position[2] = LittleFloat(in->point[2]);
1439 static void Mod_Q1BSP_LoadSubmodels(lump_t *l)
1445 in = (void *)(mod_base + l->fileofs);
1446 if (l->filelen % sizeof(*in))
1447 Host_Error("Mod_Q1BSP_LoadSubmodels: funny lump size in %s",loadmodel->name);
1448 count = l->filelen / sizeof(*in);
1449 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1451 loadmodel->brushq1.submodels = out;
1452 loadmodel->brush.numsubmodels = count;
1454 for ( i=0 ; i<count ; i++, in++, out++)
1456 for (j=0 ; j<3 ; j++)
1458 // spread the mins / maxs by a pixel
1459 out->mins[j] = LittleFloat(in->mins[j]) - 1;
1460 out->maxs[j] = LittleFloat(in->maxs[j]) + 1;
1461 out->origin[j] = LittleFloat(in->origin[j]);
1463 for (j=0 ; j<MAX_MAP_HULLS ; j++)
1464 out->headnode[j] = LittleLong(in->headnode[j]);
1465 out->visleafs = LittleLong(in->visleafs);
1466 out->firstface = LittleLong(in->firstface);
1467 out->numfaces = LittleLong(in->numfaces);
1471 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1477 in = (void *)(mod_base + l->fileofs);
1478 if (l->filelen % sizeof(*in))
1479 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1480 count = l->filelen / sizeof(*in);
1481 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1483 loadmodel->brushq1.edges = out;
1484 loadmodel->brushq1.numedges = count;
1486 for ( i=0 ; i<count ; i++, in++, out++)
1488 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1489 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1493 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1497 int i, j, k, count, miptex;
1499 in = (void *)(mod_base + l->fileofs);
1500 if (l->filelen % sizeof(*in))
1501 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1502 count = l->filelen / sizeof(*in);
1503 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1505 loadmodel->brushq1.texinfo = out;
1506 loadmodel->brushq1.numtexinfo = count;
1508 for (i = 0;i < count;i++, in++, out++)
1510 for (k = 0;k < 2;k++)
1511 for (j = 0;j < 4;j++)
1512 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1514 miptex = LittleLong(in->miptex);
1515 out->flags = LittleLong(in->flags);
1517 out->texture = NULL;
1518 if (loadmodel->brushq1.textures)
1520 if ((unsigned int) miptex >= (unsigned int) loadmodel->brushq1.numtextures)
1521 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->brushq1.numtextures);
1523 out->texture = loadmodel->brushq1.textures + miptex;
1525 if (out->flags & TEX_SPECIAL)
1527 // if texture chosen is NULL or the shader needs a lightmap,
1528 // force to notexture water shader
1529 if (out->texture == NULL || out->texture->shader->flags & SHADERFLAGS_NEEDLIGHTMAP)
1530 out->texture = loadmodel->brushq1.textures + (loadmodel->brushq1.numtextures - 1);
1534 // if texture chosen is NULL, force to notexture
1535 if (out->texture == NULL)
1536 out->texture = loadmodel->brushq1.textures + (loadmodel->brushq1.numtextures - 2);
1542 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1547 mins[0] = mins[1] = mins[2] = 9999;
1548 maxs[0] = maxs[1] = maxs[2] = -9999;
1550 for (i = 0;i < numverts;i++)
1552 for (j = 0;j < 3;j++, v++)
1562 #define MAX_SUBDIVPOLYTRIANGLES 4096
1563 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1565 static int subdivpolyverts, subdivpolytriangles;
1566 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1567 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1569 static int subdivpolylookupvert(vec3_t v)
1572 for (i = 0;i < subdivpolyverts;i++)
1573 if (subdivpolyvert[i][0] == v[0]
1574 && subdivpolyvert[i][1] == v[1]
1575 && subdivpolyvert[i][2] == v[2])
1577 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1578 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1579 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1580 return subdivpolyverts++;
1583 static void SubdividePolygon(int numverts, float *verts)
1585 int i, i1, i2, i3, f, b, c, p;
1586 vec3_t mins, maxs, front[256], back[256];
1587 float m, *pv, *cv, dist[256], frac;
1590 Host_Error("SubdividePolygon: ran out of verts in buffer");
1592 BoundPoly(numverts, verts, mins, maxs);
1594 for (i = 0;i < 3;i++)
1596 m = (mins[i] + maxs[i]) * 0.5;
1597 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1598 if (maxs[i] - m < 8)
1600 if (m - mins[i] < 8)
1604 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1605 dist[c] = cv[i] - m;
1608 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1612 VectorCopy(pv, front[f]);
1617 VectorCopy(pv, back[b]);
1620 if (dist[p] == 0 || dist[c] == 0)
1622 if ((dist[p] > 0) != (dist[c] > 0) )
1625 frac = dist[p] / (dist[p] - dist[c]);
1626 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1627 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1628 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1634 SubdividePolygon(f, front[0]);
1635 SubdividePolygon(b, back[0]);
1639 i1 = subdivpolylookupvert(verts);
1640 i2 = subdivpolylookupvert(verts + 3);
1641 for (i = 2;i < numverts;i++)
1643 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1645 Con_Printf("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1649 i3 = subdivpolylookupvert(verts + i * 3);
1650 subdivpolyindex[subdivpolytriangles][0] = i1;
1651 subdivpolyindex[subdivpolytriangles][1] = i2;
1652 subdivpolyindex[subdivpolytriangles][2] = i3;
1654 subdivpolytriangles++;
1658 //Breaks a polygon up along axial 64 unit
1659 //boundaries so that turbulent and sky warps
1660 //can be done reasonably.
1661 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surf)
1667 subdivpolytriangles = 0;
1668 subdivpolyverts = 0;
1669 SubdividePolygon(surf->poly_numverts, surf->poly_verts);
1670 if (subdivpolytriangles < 1)
1671 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?\n");
1673 surf->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
1674 mesh->num_vertices = subdivpolyverts;
1675 mesh->num_triangles = subdivpolytriangles;
1676 mesh->vertex = (surfvertex_t *)(mesh + 1);
1677 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
1678 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
1680 for (i = 0;i < mesh->num_triangles;i++)
1681 for (j = 0;j < 3;j++)
1682 mesh->index[i*3+j] = subdivpolyindex[i][j];
1684 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
1686 VectorCopy(subdivpolyvert[i], v->v);
1687 v->st[0] = DotProduct(v->v, surf->texinfo->vecs[0]);
1688 v->st[1] = DotProduct(v->v, surf->texinfo->vecs[1]);
1693 static surfmesh_t *Mod_Q1BSP_AllocSurfMesh(int numverts, int numtriangles)
1696 mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + numtriangles * sizeof(int[6]) + numverts * (3 + 2 + 2 + 2 + 3 + 3 + 3 + 1) * sizeof(float));
1697 mesh->num_vertices = numverts;
1698 mesh->num_triangles = numtriangles;
1699 mesh->data_vertex3f = (float *)(mesh + 1);
1700 mesh->data_texcoordtexture2f = mesh->data_vertex3f + mesh->num_vertices * 3;
1701 mesh->data_texcoordlightmap2f = mesh->data_texcoordtexture2f + mesh->num_vertices * 2;
1702 mesh->data_texcoorddetail2f = mesh->data_texcoordlightmap2f + mesh->num_vertices * 2;
1703 mesh->data_svector3f = (float *)(mesh->data_texcoorddetail2f + mesh->num_vertices * 2);
1704 mesh->data_tvector3f = mesh->data_svector3f + mesh->num_vertices * 3;
1705 mesh->data_normal3f = mesh->data_tvector3f + mesh->num_vertices * 3;
1706 mesh->data_lightmapoffsets = (int *)(mesh->data_normal3f + mesh->num_vertices * 3);
1707 mesh->data_element3i = mesh->data_lightmapoffsets + mesh->num_vertices;
1708 mesh->data_neighbor3i = mesh->data_element3i + mesh->num_triangles * 3;
1712 static void Mod_Q1BSP_GenerateSurfacePolygon(msurface_t *surf, int firstedge, int numedges)
1715 float *vec, *vert, mins[3], maxs[3], val, *v;
1718 // convert edges back to a normal polygon
1719 surf->poly_numverts = numedges;
1720 vert = surf->poly_verts = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * numedges);
1721 for (i = 0;i < numedges;i++)
1723 lindex = loadmodel->brushq1.surfedges[firstedge + i];
1725 vec = loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position;
1727 vec = loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position;
1728 VectorCopy(vec, vert);
1732 // calculate polygon bounding box and center
1733 vert = surf->poly_verts;
1734 VectorCopy(vert, mins);
1735 VectorCopy(vert, maxs);
1737 for (i = 1;i < surf->poly_numverts;i++, vert += 3)
1739 if (mins[0] > vert[0]) mins[0] = vert[0];if (maxs[0] < vert[0]) maxs[0] = vert[0];
1740 if (mins[1] > vert[1]) mins[1] = vert[1];if (maxs[1] < vert[1]) maxs[1] = vert[1];
1741 if (mins[2] > vert[2]) mins[2] = vert[2];if (maxs[2] < vert[2]) maxs[2] = vert[2];
1743 VectorCopy(mins, surf->poly_mins);
1744 VectorCopy(maxs, surf->poly_maxs);
1745 surf->poly_center[0] = (mins[0] + maxs[0]) * 0.5f;
1746 surf->poly_center[1] = (mins[1] + maxs[1]) * 0.5f;
1747 surf->poly_center[2] = (mins[2] + maxs[2]) * 0.5f;
1749 // generate surface extents information
1750 tex = surf->texinfo;
1751 mins[0] = maxs[0] = DotProduct(surf->poly_verts, tex->vecs[0]) + tex->vecs[0][3];
1752 mins[1] = maxs[1] = DotProduct(surf->poly_verts, tex->vecs[1]) + tex->vecs[1][3];
1753 for (i = 1, v = surf->poly_verts + 3;i < surf->poly_numverts;i++, v += 3)
1755 for (j = 0;j < 2;j++)
1757 val = DotProduct(v, tex->vecs[j]) + tex->vecs[j][3];
1764 for (i = 0;i < 2;i++)
1766 surf->texturemins[i] = (int) floor(mins[i] / 16) * 16;
1767 surf->extents[i] = (int) ceil(maxs[i] / 16) * 16 - surf->texturemins[i];
1771 static void Mod_Q1BSP_LoadFaces(lump_t *l)
1775 int i, count, surfnum, planenum, ssize, tsize, firstedge, numedges, totalverts, totaltris, totalmeshes;
1779 in = (void *)(mod_base + l->fileofs);
1780 if (l->filelen % sizeof(*in))
1781 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
1782 count = l->filelen / sizeof(*in);
1783 loadmodel->brushq1.surfaces = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
1785 loadmodel->brushq1.numsurfaces = count;
1786 loadmodel->brushq1.surfacevisframes = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
1787 loadmodel->brushq1.surfacepvsframes = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
1788 loadmodel->brushq1.pvssurflist = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
1790 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++)
1792 surf->number = surfnum;
1793 // FIXME: validate edges, texinfo, etc?
1794 firstedge = LittleLong(in->firstedge);
1795 numedges = LittleShort(in->numedges);
1796 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)
1797 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)\n", firstedge, numedges, loadmodel->brushq1.numsurfedges);
1798 i = LittleShort(in->texinfo);
1799 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
1800 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)\n", i, loadmodel->brushq1.numtexinfo);
1801 surf->texinfo = loadmodel->brushq1.texinfo + i;
1802 surf->flags = surf->texinfo->texture->flags;
1804 planenum = LittleShort(in->planenum);
1805 if ((unsigned int) planenum >= (unsigned int) loadmodel->brushq1.numplanes)
1806 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)\n", planenum, loadmodel->brushq1.numplanes);
1808 if (LittleShort(in->side))
1809 surf->flags |= SURF_PLANEBACK;
1811 surf->plane = loadmodel->brushq1.planes + planenum;
1813 // clear lightmap (filled in later)
1814 surf->lightmaptexture = NULL;
1816 // force lightmap upload on first time seeing the surface
1817 surf->cached_dlight = true;
1819 Mod_Q1BSP_GenerateSurfacePolygon(surf, firstedge, numedges);
1821 ssize = (surf->extents[0] >> 4) + 1;
1822 tsize = (surf->extents[1] >> 4) + 1;
1825 for (i = 0;i < MAXLIGHTMAPS;i++)
1826 surf->styles[i] = in->styles[i];
1827 i = LittleLong(in->lightofs);
1829 surf->samples = NULL;
1830 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
1831 surf->samples = loadmodel->brushq1.lightdata + i;
1832 else // LordHavoc: white lighting (bsp version 29)
1833 surf->samples = loadmodel->brushq1.lightdata + (i * 3);
1835 if (surf->texinfo->texture->shader == &Cshader_wall_lightmap)
1837 if ((surf->extents[0] >> 4) + 1 > (256) || (surf->extents[1] >> 4) + 1 > (256))
1838 Host_Error("Bad surface extents");
1839 // stainmap for permanent marks on walls
1840 surf->stainsamples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
1842 memset(surf->stainsamples, 255, ssize * tsize * 3);
1846 loadmodel->brushq1.entiremesh = Mod_Q1BSP_AllocSurfMesh(totalverts, totaltris);
1848 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++)
1851 mesh->num_vertices = surf->poly_numverts;
1852 mesh->num_triangles = surf->poly_numverts - 2;
1853 mesh->data_vertex3f = loadmodel->brushq1.entiremesh->data_vertex3f + totalverts * 3;
1854 mesh->data_texcoordtexture2f = loadmodel->brushq1.entiremesh->data_texcoordtexture2f + totalverts * 2;
1855 mesh->data_texcoordlightmap2f = loadmodel->brushq1.entiremesh->data_texcoordlightmap2f + totalverts * 2;
1856 mesh->data_texcoorddetail2f = loadmodel->brushq1.entiremesh->data_texcoorddetail2f + totalverts * 2;
1857 mesh->data_svector3f = loadmodel->brushq1.entiremesh->data_svector3f + totalverts * 3;
1858 mesh->data_tvector3f = loadmodel->brushq1.entiremesh->data_tvector3f + totalverts * 3;
1859 mesh->data_normal3f = loadmodel->brushq1.entiremesh->data_normal3f + totalverts * 3;
1860 mesh->data_lightmapoffsets = loadmodel->brushq1.entiremesh->data_lightmapoffsets + totalverts;
1861 mesh->data_element3i = loadmodel->brushq1.entiremesh->data_element3i + totaltris * 3;
1862 mesh->data_neighbor3i = loadmodel->brushq1.entiremesh->data_neighbor3i + totaltris * 3;
1864 surf->lightmaptexturestride = 0;
1865 surf->lightmaptexture = NULL;
1867 for (i = 0;i < mesh->num_vertices;i++)
1869 mesh->data_vertex3f[i * 3 + 0] = surf->poly_verts[i * 3 + 0];
1870 mesh->data_vertex3f[i * 3 + 1] = surf->poly_verts[i * 3 + 1];
1871 mesh->data_vertex3f[i * 3 + 2] = surf->poly_verts[i * 3 + 2];
1872 s = DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3];
1873 t = DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3];
1874 mesh->data_texcoordtexture2f[i * 2 + 0] = s / surf->texinfo->texture->width;
1875 mesh->data_texcoordtexture2f[i * 2 + 1] = t / surf->texinfo->texture->height;
1876 mesh->data_texcoorddetail2f[i * 2 + 0] = s * (1.0f / 16.0f);
1877 mesh->data_texcoorddetail2f[i * 2 + 1] = t * (1.0f / 16.0f);
1878 mesh->data_texcoordlightmap2f[i * 2 + 0] = 0;
1879 mesh->data_texcoordlightmap2f[i * 2 + 1] = 0;
1880 mesh->data_lightmapoffsets[i] = 0;
1883 for (i = 0;i < mesh->num_triangles;i++)
1885 mesh->data_element3i[i * 3 + 0] = 0;
1886 mesh->data_element3i[i * 3 + 1] = i + 1;
1887 mesh->data_element3i[i * 3 + 2] = i + 2;
1890 Mod_BuildTriangleNeighbors(mesh->data_neighbor3i, mesh->data_element3i, mesh->num_triangles);
1891 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);
1893 if (surf->texinfo->texture->shader == &Cshader_wall_lightmap)
1895 int i, iu, iv, smax, tmax;
1896 float u, v, ubase, vbase, uscale, vscale;
1898 smax = surf->extents[0] >> 4;
1899 tmax = surf->extents[1] >> 4;
1901 surf->flags |= SURF_LIGHTMAP;
1902 if (r_miplightmaps.integer)
1904 surf->lightmaptexturestride = smax+1;
1905 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);
1909 surf->lightmaptexturestride = R_CompatibleFragmentWidth(smax+1, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, 0);
1910 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);
1912 R_FragmentLocation(surf->lightmaptexture, NULL, NULL, &ubase, &vbase, &uscale, &vscale);
1913 uscale = (uscale - ubase) / (smax + 1);
1914 vscale = (vscale - vbase) / (tmax + 1);
1916 for (i = 0;i < mesh->num_vertices;i++)
1918 u = ((DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3]) + 8 - surf->texturemins[0]) * (1.0 / 16.0);
1919 v = ((DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3]) + 8 - surf->texturemins[1]) * (1.0 / 16.0);
1920 mesh->data_texcoordlightmap2f[i * 2 + 0] = u * uscale + ubase;
1921 mesh->data_texcoordlightmap2f[i * 2 + 1] = v * vscale + vbase;
1922 // LordHavoc: calc lightmap data offset for vertex lighting to use
1925 mesh->data_lightmapoffsets[i] = (bound(0, iv, tmax) * (smax+1) + bound(0, iu, smax)) * 3;
1931 static void Mod_Q1BSP_SetParent(mnode_t *node, mnode_t *parent)
1933 node->parent = parent;
1934 if (node->contents < 0)
1936 Mod_Q1BSP_SetParent(node->children[0], node);
1937 Mod_Q1BSP_SetParent(node->children[1], node);
1940 static void Mod_Q1BSP_LoadNodes(lump_t *l)
1946 in = (void *)(mod_base + l->fileofs);
1947 if (l->filelen % sizeof(*in))
1948 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
1949 count = l->filelen / sizeof(*in);
1950 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1952 loadmodel->brushq1.nodes = out;
1953 loadmodel->brushq1.numnodes = count;
1955 for ( i=0 ; i<count ; i++, in++, out++)
1957 for (j=0 ; j<3 ; j++)
1959 out->mins[j] = LittleShort(in->mins[j]);
1960 out->maxs[j] = LittleShort(in->maxs[j]);
1963 p = LittleLong(in->planenum);
1964 out->plane = loadmodel->brushq1.planes + p;
1966 out->firstsurface = LittleShort(in->firstface);
1967 out->numsurfaces = LittleShort(in->numfaces);
1969 for (j=0 ; j<2 ; j++)
1971 p = LittleShort(in->children[j]);
1973 out->children[j] = loadmodel->brushq1.nodes + p;
1975 out->children[j] = (mnode_t *)(loadmodel->brushq1.data_leafs + (-1 - p));
1979 Mod_Q1BSP_SetParent(loadmodel->brushq1.nodes, NULL); // sets nodes and leafs
1982 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
1988 in = (void *)(mod_base + l->fileofs);
1989 if (l->filelen % sizeof(*in))
1990 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
1991 count = l->filelen / sizeof(*in);
1992 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1994 loadmodel->brushq1.data_leafs = out;
1995 loadmodel->brushq1.num_leafs = count;
1996 // get visleafs from the submodel data
1997 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
1998 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
1999 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2000 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2002 for ( i=0 ; i<count ; i++, in++, out++)
2004 for (j=0 ; j<3 ; j++)
2006 out->mins[j] = LittleShort(in->mins[j]);
2007 out->maxs[j] = LittleShort(in->maxs[j]);
2010 // FIXME: this function could really benefit from some error checking
2012 out->contents = LittleLong(in->contents);
2014 out->firstmarksurface = loadmodel->brushq1.marksurfaces + LittleShort(in->firstmarksurface);
2015 out->nummarksurfaces = LittleShort(in->nummarksurfaces);
2016 if (out->firstmarksurface < 0 || LittleShort(in->firstmarksurface) + out->nummarksurfaces > loadmodel->brushq1.nummarksurfaces)
2018 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);
2019 out->firstmarksurface = NULL;
2020 out->nummarksurfaces = 0;
2023 out->clusterindex = i - 1;
2024 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2025 out->clusterindex = -1;
2027 p = LittleLong(in->visofs);
2028 // ignore visofs errors on leaf 0 (solid)
2029 if (p >= 0 && out->clusterindex >= 0)
2031 if (p >= loadmodel->brushq1.num_compressedpvs)
2032 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2034 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);
2037 for (j = 0;j < 4;j++)
2038 out->ambient_sound_level[j] = in->ambient_level[j];
2040 // FIXME: Insert caustics here
2044 static void Mod_Q1BSP_LoadClipnodes(lump_t *l)
2046 dclipnode_t *in, *out;
2050 in = (void *)(mod_base + l->fileofs);
2051 if (l->filelen % sizeof(*in))
2052 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2053 count = l->filelen / sizeof(*in);
2054 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2056 loadmodel->brushq1.clipnodes = out;
2057 loadmodel->brushq1.numclipnodes = count;
2059 if (loadmodel->brush.ishlbsp)
2061 hull = &loadmodel->brushq1.hulls[1];
2062 hull->clipnodes = out;
2063 hull->firstclipnode = 0;
2064 hull->lastclipnode = count-1;
2065 hull->planes = loadmodel->brushq1.planes;
2066 hull->clip_mins[0] = -16;
2067 hull->clip_mins[1] = -16;
2068 hull->clip_mins[2] = -36;
2069 hull->clip_maxs[0] = 16;
2070 hull->clip_maxs[1] = 16;
2071 hull->clip_maxs[2] = 36;
2072 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2074 hull = &loadmodel->brushq1.hulls[2];
2075 hull->clipnodes = out;
2076 hull->firstclipnode = 0;
2077 hull->lastclipnode = count-1;
2078 hull->planes = loadmodel->brushq1.planes;
2079 hull->clip_mins[0] = -32;
2080 hull->clip_mins[1] = -32;
2081 hull->clip_mins[2] = -32;
2082 hull->clip_maxs[0] = 32;
2083 hull->clip_maxs[1] = 32;
2084 hull->clip_maxs[2] = 32;
2085 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2087 hull = &loadmodel->brushq1.hulls[3];
2088 hull->clipnodes = out;
2089 hull->firstclipnode = 0;
2090 hull->lastclipnode = count-1;
2091 hull->planes = loadmodel->brushq1.planes;
2092 hull->clip_mins[0] = -16;
2093 hull->clip_mins[1] = -16;
2094 hull->clip_mins[2] = -18;
2095 hull->clip_maxs[0] = 16;
2096 hull->clip_maxs[1] = 16;
2097 hull->clip_maxs[2] = 18;
2098 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2102 hull = &loadmodel->brushq1.hulls[1];
2103 hull->clipnodes = out;
2104 hull->firstclipnode = 0;
2105 hull->lastclipnode = count-1;
2106 hull->planes = loadmodel->brushq1.planes;
2107 hull->clip_mins[0] = -16;
2108 hull->clip_mins[1] = -16;
2109 hull->clip_mins[2] = -24;
2110 hull->clip_maxs[0] = 16;
2111 hull->clip_maxs[1] = 16;
2112 hull->clip_maxs[2] = 32;
2113 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2115 hull = &loadmodel->brushq1.hulls[2];
2116 hull->clipnodes = out;
2117 hull->firstclipnode = 0;
2118 hull->lastclipnode = count-1;
2119 hull->planes = loadmodel->brushq1.planes;
2120 hull->clip_mins[0] = -32;
2121 hull->clip_mins[1] = -32;
2122 hull->clip_mins[2] = -24;
2123 hull->clip_maxs[0] = 32;
2124 hull->clip_maxs[1] = 32;
2125 hull->clip_maxs[2] = 64;
2126 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2129 for (i=0 ; i<count ; i++, out++, in++)
2131 out->planenum = LittleLong(in->planenum);
2132 out->children[0] = LittleShort(in->children[0]);
2133 out->children[1] = LittleShort(in->children[1]);
2134 if (out->children[0] >= count || out->children[1] >= count)
2135 Host_Error("Corrupt clipping hull(out of range child)\n");
2139 //Duplicate the drawing hull structure as a clipping hull
2140 static void Mod_Q1BSP_MakeHull0(void)
2147 hull = &loadmodel->brushq1.hulls[0];
2149 in = loadmodel->brushq1.nodes;
2150 out = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numnodes * sizeof(dclipnode_t));
2152 hull->clipnodes = out;
2153 hull->firstclipnode = 0;
2154 hull->lastclipnode = loadmodel->brushq1.numnodes - 1;
2155 hull->planes = loadmodel->brushq1.planes;
2157 for (i = 0;i < loadmodel->brushq1.numnodes;i++, out++, in++)
2159 out->planenum = in->plane - loadmodel->brushq1.planes;
2160 out->children[0] = in->children[0]->contents < 0 ? in->children[0]->contents : in->children[0] - loadmodel->brushq1.nodes;
2161 out->children[1] = in->children[1]->contents < 0 ? in->children[1]->contents : in->children[1] - loadmodel->brushq1.nodes;
2165 static void Mod_Q1BSP_LoadMarksurfaces(lump_t *l)
2170 in = (void *)(mod_base + l->fileofs);
2171 if (l->filelen % sizeof(*in))
2172 Host_Error("Mod_Q1BSP_LoadMarksurfaces: funny lump size in %s",loadmodel->name);
2173 loadmodel->brushq1.nummarksurfaces = l->filelen / sizeof(*in);
2174 loadmodel->brushq1.marksurfaces = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.nummarksurfaces * sizeof(int));
2176 for (i = 0;i < loadmodel->brushq1.nummarksurfaces;i++)
2178 j = (unsigned) LittleShort(in[i]);
2179 if (j >= loadmodel->brushq1.numsurfaces)
2180 Host_Error("Mod_Q1BSP_LoadMarksurfaces: bad surface number");
2181 loadmodel->brushq1.marksurfaces[i] = j;
2185 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2190 in = (void *)(mod_base + l->fileofs);
2191 if (l->filelen % sizeof(*in))
2192 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2193 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2194 loadmodel->brushq1.surfedges = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2196 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2197 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2201 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2207 in = (void *)(mod_base + l->fileofs);
2208 if (l->filelen % sizeof(*in))
2209 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2211 loadmodel->brushq1.numplanes = l->filelen / sizeof(*in);
2212 loadmodel->brushq1.planes = out = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numplanes * sizeof(*out));
2214 for (i = 0;i < loadmodel->brushq1.numplanes;i++, in++, out++)
2216 out->normal[0] = LittleFloat(in->normal[0]);
2217 out->normal[1] = LittleFloat(in->normal[1]);
2218 out->normal[2] = LittleFloat(in->normal[2]);
2219 out->dist = LittleFloat(in->dist);
2225 typedef struct portal_s
2228 mnode_t *nodes[2]; // [0] = front side of plane
2229 struct portal_s *next[2];
2231 struct portal_s *chain; // all portals are linked into a list
2235 static portal_t *portalchain;
2242 static portal_t *AllocPortal(void)
2245 p = Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2246 p->chain = portalchain;
2251 static void FreePortal(portal_t *p)
2256 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2258 // calculate children first
2259 if (node->children[0]->contents >= 0)
2260 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2261 if (node->children[1]->contents >= 0)
2262 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2264 // make combined bounding box from children
2265 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2266 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2267 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2268 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2269 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2270 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2273 static void Mod_Q1BSP_FinalizePortals(void)
2275 int i, j, numportals, numpoints;
2276 portal_t *p, *pnext;
2279 mleaf_t *leaf, *endleaf;
2282 // recalculate bounding boxes for all leafs(because qbsp is very sloppy)
2283 leaf = loadmodel->brushq1.data_leafs;
2284 endleaf = leaf + loadmodel->brushq1.num_leafs;
2285 for (;leaf < endleaf;leaf++)
2287 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2288 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2295 for (i = 0;i < 2;i++)
2297 leaf = (mleaf_t *)p->nodes[i];
2299 for (j = 0;j < w->numpoints;j++)
2301 if (leaf->mins[0] > w->points[j][0]) leaf->mins[0] = w->points[j][0];
2302 if (leaf->mins[1] > w->points[j][1]) leaf->mins[1] = w->points[j][1];
2303 if (leaf->mins[2] > w->points[j][2]) leaf->mins[2] = w->points[j][2];
2304 if (leaf->maxs[0] < w->points[j][0]) leaf->maxs[0] = w->points[j][0];
2305 if (leaf->maxs[1] < w->points[j][1]) leaf->maxs[1] = w->points[j][1];
2306 if (leaf->maxs[2] < w->points[j][2]) leaf->maxs[2] = w->points[j][2];
2313 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brushq1.nodes);
2315 // tally up portal and point counts
2321 // note: this check must match the one below or it will usually corrupt memory
2322 // 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
2323 if (p->winding && p->nodes[0] != p->nodes[1]
2324 && p->nodes[0]->contents != CONTENTS_SOLID && p->nodes[1]->contents != CONTENTS_SOLID
2325 && p->nodes[0]->contents != CONTENTS_SKY && p->nodes[1]->contents != CONTENTS_SKY)
2328 numpoints += p->winding->numpoints * 2;
2332 loadmodel->brushq1.portals = Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2333 loadmodel->brushq1.numportals = numportals;
2334 loadmodel->brushq1.portalpoints = (void *)((qbyte *) loadmodel->brushq1.portals + numportals * sizeof(mportal_t));
2335 loadmodel->brushq1.numportalpoints = numpoints;
2336 // clear all leaf portal chains
2337 for (i = 0;i < loadmodel->brushq1.num_leafs;i++)
2338 loadmodel->brushq1.data_leafs[i].portals = NULL;
2339 // process all portals in the global portal chain, while freeing them
2340 portal = loadmodel->brushq1.portals;
2341 point = loadmodel->brushq1.portalpoints;
2350 // note: this check must match the one above or it will usually corrupt memory
2351 // 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
2352 if (p->nodes[0] != p->nodes[1]
2353 && p->nodes[0]->contents != CONTENTS_SOLID && p->nodes[1]->contents != CONTENTS_SOLID
2354 && p->nodes[0]->contents != CONTENTS_SKY && p->nodes[1]->contents != CONTENTS_SKY)
2356 // first make the back to front portal(forward portal)
2357 portal->points = point;
2358 portal->numpoints = p->winding->numpoints;
2359 portal->plane.dist = p->plane.dist;
2360 VectorCopy(p->plane.normal, portal->plane.normal);
2361 portal->here = (mleaf_t *)p->nodes[1];
2362 portal->past = (mleaf_t *)p->nodes[0];
2364 for (j = 0;j < portal->numpoints;j++)
2366 VectorCopy(p->winding->points[j], point->position);
2369 PlaneClassify(&portal->plane);
2371 // link into leaf's portal chain
2372 portal->next = portal->here->portals;
2373 portal->here->portals = portal;
2375 // advance to next portal
2378 // then make the front to back portal(backward portal)
2379 portal->points = point;
2380 portal->numpoints = p->winding->numpoints;
2381 portal->plane.dist = -p->plane.dist;
2382 VectorNegate(p->plane.normal, portal->plane.normal);
2383 portal->here = (mleaf_t *)p->nodes[0];
2384 portal->past = (mleaf_t *)p->nodes[1];
2386 for (j = portal->numpoints - 1;j >= 0;j--)
2388 VectorCopy(p->winding->points[j], point->position);
2391 PlaneClassify(&portal->plane);
2393 // link into leaf's portal chain
2394 portal->next = portal->here->portals;
2395 portal->here->portals = portal;
2397 // advance to next portal
2400 Winding_Free(p->winding);
2412 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2415 Host_Error("AddPortalToNodes: NULL front node");
2417 Host_Error("AddPortalToNodes: NULL back node");
2418 if (p->nodes[0] || p->nodes[1])
2419 Host_Error("AddPortalToNodes: already included");
2420 // 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
2422 p->nodes[0] = front;
2423 p->next[0] = (portal_t *)front->portals;
2424 front->portals = (mportal_t *)p;
2427 p->next[1] = (portal_t *)back->portals;
2428 back->portals = (mportal_t *)p;
2433 RemovePortalFromNode
2436 static void RemovePortalFromNodes(portal_t *portal)
2440 void **portalpointer;
2442 for (i = 0;i < 2;i++)
2444 node = portal->nodes[i];
2446 portalpointer = (void **) &node->portals;
2451 Host_Error("RemovePortalFromNodes: portal not in leaf");
2455 if (portal->nodes[0] == node)
2457 *portalpointer = portal->next[0];
2458 portal->nodes[0] = NULL;
2460 else if (portal->nodes[1] == node)
2462 *portalpointer = portal->next[1];
2463 portal->nodes[1] = NULL;
2466 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2470 if (t->nodes[0] == node)
2471 portalpointer = (void **) &t->next[0];
2472 else if (t->nodes[1] == node)
2473 portalpointer = (void **) &t->next[1];
2475 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2480 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2483 mnode_t *front, *back, *other_node;
2484 mplane_t clipplane, *plane;
2485 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2486 winding_t *nodeportalwinding, *frontwinding, *backwinding;
2488 // if a leaf, we're done
2492 plane = node->plane;
2494 front = node->children[0];
2495 back = node->children[1];
2497 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2499 // create the new portal by generating a polygon for the node plane,
2500 // and clipping it by all of the other portals(which came from nodes above this one)
2501 nodeportal = AllocPortal();
2502 nodeportal->plane = *plane;
2504 nodeportalwinding = Winding_NewFromPlane(nodeportal->plane.normal[0], nodeportal->plane.normal[1], nodeportal->plane.normal[2], nodeportal->plane.dist);
2505 side = 0; // shut up compiler warning
2506 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2508 clipplane = portal->plane;
2509 if (portal->nodes[0] == portal->nodes[1])
2510 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2511 if (portal->nodes[0] == node)
2513 else if (portal->nodes[1] == node)
2515 clipplane.dist = -clipplane.dist;
2516 VectorNegate(clipplane.normal, clipplane.normal);
2520 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2522 nodeportalwinding = Winding_Clip(nodeportalwinding, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, true);
2523 if (!nodeportalwinding)
2525 Con_Printf("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2530 if (nodeportalwinding)
2532 // if the plane was not clipped on all sides, there was an error
2533 nodeportal->winding = nodeportalwinding;
2534 AddPortalToNodes(nodeportal, front, back);
2537 // split the portals of this node along this node's plane and assign them to the children of this node
2538 // (migrating the portals downward through the tree)
2539 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2541 if (portal->nodes[0] == portal->nodes[1])
2542 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2543 if (portal->nodes[0] == node)
2545 else if (portal->nodes[1] == node)
2548 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2549 nextportal = portal->next[side];
2551 other_node = portal->nodes[!side];
2552 RemovePortalFromNodes(portal);
2554 // cut the portal into two portals, one on each side of the node plane
2555 Winding_Divide(portal->winding, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, &frontwinding, &backwinding);
2560 AddPortalToNodes(portal, back, other_node);
2562 AddPortalToNodes(portal, other_node, back);
2568 AddPortalToNodes(portal, front, other_node);
2570 AddPortalToNodes(portal, other_node, front);
2574 // the winding is split
2575 splitportal = AllocPortal();
2576 temp = splitportal->chain;
2577 *splitportal = *portal;
2578 splitportal->chain = temp;
2579 splitportal->winding = backwinding;
2580 Winding_Free(portal->winding);
2581 portal->winding = frontwinding;
2585 AddPortalToNodes(portal, front, other_node);
2586 AddPortalToNodes(splitportal, back, other_node);
2590 AddPortalToNodes(portal, other_node, front);
2591 AddPortalToNodes(splitportal, other_node, back);
2595 Mod_Q1BSP_RecursiveNodePortals(front);
2596 Mod_Q1BSP_RecursiveNodePortals(back);
2599 static void Mod_Q1BSP_MakePortals(void)
2602 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brushq1.nodes);
2603 Mod_Q1BSP_FinalizePortals();
2606 static void Mod_Q1BSP_BuildSurfaceNeighbors(msurface_t *surfaces, int numsurfaces, mempool_t *mempool)
2609 int surfnum, vertnum, vertnum2, snum, vnum, vnum2;
2610 msurface_t *surf, *s;
2611 float *v0, *v1, *v2, *v3;
2612 for (surf = surfaces, surfnum = 0;surfnum < numsurfaces;surf++, surfnum++)
2613 surf->neighborsurfaces = Mem_Alloc(mempool, surf->poly_numverts * sizeof(msurface_t *));
2614 for (surf = surfaces, surfnum = 0;surfnum < numsurfaces;surf++, surfnum++)
2616 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)
2618 if (surf->neighborsurfaces[vertnum])
2620 surf->neighborsurfaces[vertnum] = NULL;
2621 for (s = surfaces, snum = 0;snum < numsurfaces;s++, snum++)
2623 if (s->poly_mins[0] > (surf->poly_maxs[0] + 1) || s->poly_maxs[0] < (surf->poly_mins[0] - 1)
2624 || s->poly_mins[1] > (surf->poly_maxs[1] + 1) || s->poly_maxs[1] < (surf->poly_mins[1] - 1)
2625 || s->poly_mins[2] > (surf->poly_maxs[2] + 1) || s->poly_maxs[2] < (surf->poly_mins[2] - 1)
2628 for (vnum = 0;vnum < s->poly_numverts;vnum++)
2629 if (s->neighborsurfaces[vnum] == surf)
2631 if (vnum < s->poly_numverts)
2633 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)
2635 if (s->neighborsurfaces[vnum] == NULL
2636 && ((v0[0] == v2[0] && v0[1] == v2[1] && v0[2] == v2[2] && v1[0] == v3[0] && v1[1] == v3[1] && v1[2] == v3[2])
2637 || (v1[0] == v2[0] && v1[1] == v2[1] && v1[2] == v2[2] && v0[0] == v3[0] && v0[1] == v3[1] && v0[2] == v3[2])))
2639 surf->neighborsurfaces[vertnum] = s;
2640 s->neighborsurfaces[vnum] = surf;
2644 if (vnum < s->poly_numverts)
2652 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2654 int i, j, stylecounts[256], totalcount, remapstyles[256];
2656 memset(stylecounts, 0, sizeof(stylecounts));
2657 for (i = 0;i < model->brushq1.nummodelsurfaces;i++)
2659 surf = model->brushq1.surfaces + model->brushq1.firstmodelsurface + i;
2660 for (j = 0;j < MAXLIGHTMAPS;j++)
2661 stylecounts[surf->styles[j]]++;
2664 model->brushq1.light_styles = 0;
2665 for (i = 0;i < 255;i++)
2669 remapstyles[i] = model->brushq1.light_styles++;
2670 totalcount += stylecounts[i] + 1;
2675 model->brushq1.light_style = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(qbyte));
2676 model->brushq1.light_stylevalue = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
2677 model->brushq1.light_styleupdatechains = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
2678 model->brushq1.light_styleupdatechainsbuffer = Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
2679 model->brushq1.light_styles = 0;
2680 for (i = 0;i < 255;i++)
2682 model->brushq1.light_style[model->brushq1.light_styles++] = i;
2684 for (i = 0;i < model->brushq1.light_styles;i++)
2686 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2687 j += stylecounts[model->brushq1.light_style[i]] + 1;
2689 for (i = 0;i < model->brushq1.nummodelsurfaces;i++)
2691 surf = model->brushq1.surfaces + model->brushq1.firstmodelsurface + i;
2692 for (j = 0;j < MAXLIGHTMAPS;j++)
2693 if (surf->styles[j] != 255)
2694 *model->brushq1.light_styleupdatechains[remapstyles[surf->styles[j]]]++ = surf;
2697 for (i = 0;i < model->brushq1.light_styles;i++)
2699 *model->brushq1.light_styleupdatechains[i] = NULL;
2700 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2701 j += stylecounts[model->brushq1.light_style[i]] + 1;
2705 static void Mod_Q1BSP_BuildPVSTextureChains(model_t *model)
2708 for (i = 0;i < model->brushq1.numtextures;i++)
2709 model->brushq1.pvstexturechainslength[i] = 0;
2710 for (i = 0, j = model->brushq1.firstmodelsurface;i < model->brushq1.nummodelsurfaces;i++, j++)
2712 if (model->brushq1.surfacepvsframes[j] == model->brushq1.pvsframecount)
2714 model->brushq1.pvssurflist[model->brushq1.pvssurflistlength++] = j;
2715 model->brushq1.pvstexturechainslength[model->brushq1.surfaces[j].texinfo->texture->number]++;
2718 for (i = 0, j = 0;i < model->brushq1.numtextures;i++)
2720 if (model->brushq1.pvstexturechainslength[i])
2722 model->brushq1.pvstexturechains[i] = model->brushq1.pvstexturechainsbuffer + j;
2723 j += model->brushq1.pvstexturechainslength[i] + 1;
2726 model->brushq1.pvstexturechains[i] = NULL;
2728 for (i = 0, j = model->brushq1.firstmodelsurface;i < model->brushq1.nummodelsurfaces;i++, j++)
2729 if (model->brushq1.surfacepvsframes[j] == model->brushq1.pvsframecount)
2730 *model->brushq1.pvstexturechains[model->brushq1.surfaces[j].texinfo->texture->number]++ = model->brushq1.surfaces + j;
2731 for (i = 0;i < model->brushq1.numtextures;i++)
2733 if (model->brushq1.pvstexturechainslength[i])
2735 *model->brushq1.pvstexturechains[i] = NULL;
2736 model->brushq1.pvstexturechains[i] -= model->brushq1.pvstexturechainslength[i];
2741 //Returns PVS data for a given point
2742 //(note: can return NULL)
2743 static qbyte *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
2746 Mod_CheckLoaded(model);
2747 node = model->brushq1.nodes;
2749 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
2750 if (((mleaf_t *)node)->clusterindex >= 0)
2751 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2756 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, mnode_t *node)
2760 float d = PlaneDiff(org, node->plane);
2762 node = node->children[0];
2763 else if (d < -radius)
2764 node = node->children[1];
2767 // go down both sides
2768 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
2769 node = node->children[1];
2772 // if this leaf is in a cluster, accumulate the pvs bits
2773 if (((mleaf_t *)node)->clusterindex >= 0)
2776 qbyte *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2777 for (i = 0;i < pvsbytes;i++)
2778 pvsbuffer[i] |= pvs[i];
2782 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
2783 //of the given point.
2784 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
2786 int bytes = ((model->brushq1.num_leafs - 1) + 7) >> 3;
2787 bytes = min(bytes, pvsbufferlength);
2788 if (r_novis.integer || !Mod_Q1BSP_GetPVS(model, org))
2790 memset(pvsbuffer, 0xFF, bytes);
2793 memset(pvsbuffer, 0, bytes);
2794 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brushq1.nodes);
2798 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
2803 VectorSubtract(inmaxs, inmins, size);
2804 if (cmodel->brush.ishlbsp)
2807 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2808 else if (size[0] <= 32)
2810 if (size[2] < 54) // pick the nearest of 36 or 72
2811 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
2813 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
2816 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
2821 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2822 else if (size[0] <= 32)
2823 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
2825 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
2827 VectorCopy(inmins, outmins);
2828 VectorAdd(inmins, hull->clip_size, outmaxs);
2832 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)
2837 if (!BoxesOverlap(node->mins, node->maxs, mins, maxs))
2841 Mod_Q1BSP_RecursiveGetVisible(node->children[0], model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces, pvs);
2842 node = node->children[1];
2844 leaf = (mleaf_t *)node;
2845 if ((pvs == NULL || CHECKPVSBIT(pvs, leaf->clusterindex)))
2849 if (maxleafs && *numleafs < maxleafs)
2850 leaflist[(*numleafs)++] = leaf;
2853 for (marksurfacenum = 0;marksurfacenum < leaf->nummarksurfaces;marksurfacenum++)
2855 surf = model->brushq1.surfaces + leaf->firstmarksurface[marksurfacenum];
2856 if (surf->shadowmark != shadowmarkcount)
2858 surf->shadowmark = shadowmarkcount;
2859 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)
2860 surfacelist[(*numsurfaces)++] = surf;
2867 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)
2869 // FIXME: support portals
2874 pvs = ent->model->brush.GetPVS(ent->model, relativelightorigin);
2875 Mod_Q1BSP_RecursiveGetVisible(ent->model->brushq1.nodes + ent->model->brushq1.firstclipnode, model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces);
2879 extern void R_Model_Brush_DrawSky(entity_render_t *ent);
2880 extern void R_Model_Brush_Draw(entity_render_t *ent);
2881 extern void R_Model_Brush_DrawShadowVolume(entity_render_t *ent, vec3_t relativelightorigin, float lightradius);
2882 extern void R_Model_Brush_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);
2883 void Mod_Q1BSP_Load(model_t *mod, void *buffer)
2888 mempool_t *mainmempool;
2890 model_t *originalloadmodel;
2891 float dist, modelyawradius, modelradius, *vec;
2893 int numshadowmeshtriangles;
2895 mod->type = mod_brush;
2897 header = (dheader_t *)buffer;
2899 i = LittleLong(header->version);
2900 if (i != BSPVERSION && i != 30)
2901 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife))", mod->name, i, BSPVERSION);
2902 mod->brush.ishlbsp = i == 30;
2904 mod->soundfromcenter = true;
2905 mod->TraceBox = Mod_Q1BSP_TraceBox;
2906 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
2907 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
2908 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
2909 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
2910 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
2911 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
2912 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
2913 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
2914 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
2915 mod->brushq1.PointInLeaf = Mod_Q1BSP_PointInLeaf;
2916 mod->brushq1.BuildPVSTextureChains = Mod_Q1BSP_BuildPVSTextureChains;
2918 if (loadmodel->isworldmodel)
2920 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
2921 // until we get a texture for it...
2925 // swap all the lumps
2926 mod_base = (qbyte *)header;
2928 for (i = 0;i < (int) sizeof(dheader_t) / 4;i++)
2929 ((int *)header)[i] = LittleLong(((int *)header)[i]);
2933 // store which lightmap format to use
2934 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
2936 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
2937 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
2938 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
2939 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
2940 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
2941 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
2942 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
2943 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
2944 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
2945 Mod_Q1BSP_LoadMarksurfaces(&header->lumps[LUMP_MARKSURFACES]);
2946 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
2947 // load submodels before leafs because they contain the number of vis leafs
2948 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS]);
2949 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
2950 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
2951 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES]);
2953 if (mod->brushq1.data_compressedpvs)
2954 Mem_Free(mod->brushq1.data_compressedpvs);
2955 mod->brushq1.data_compressedpvs = NULL;
2956 mod->brushq1.num_compressedpvs = 0;
2958 Mod_Q1BSP_MakeHull0();
2959 Mod_Q1BSP_MakePortals();
2961 mod->numframes = 2; // regular and alternate animation
2963 mainmempool = mod->mempool;
2964 loadname = mod->name;
2966 Mod_Q1BSP_LoadLightList();
2967 originalloadmodel = loadmodel;
2969 // make a single combined shadow mesh to allow optimized shadow volume creation
2970 numshadowmeshtriangles = 0;
2971 for (j = 0, surf = loadmodel->brushq1.surfaces;j < loadmodel->brushq1.numsurfaces;j++, surf++)
2973 surf->num_firstshadowmeshtriangle = numshadowmeshtriangles;
2974 numshadowmeshtriangles += surf->mesh.num_triangles;
2976 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
2977 for (j = 0, surf = loadmodel->brushq1.surfaces;j < loadmodel->brushq1.numsurfaces;j++, surf++)
2978 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);
2979 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
2980 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
2983 // set up the submodels(FIXME: this is confusing)
2985 for (i = 0;i < mod->brush.numsubmodels;i++)
2987 bm = &mod->brushq1.submodels[i];
2989 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
2990 for (j=1 ; j<MAX_MAP_HULLS ; j++)
2992 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
2993 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
2996 mod->brushq1.firstmodelsurface = bm->firstface;
2997 mod->brushq1.nummodelsurfaces = bm->numfaces;
2999 // this gets altered below if sky is used
3000 mod->DrawSky = NULL;
3001 mod->Draw = R_Model_Brush_Draw;
3002 mod->DrawShadowVolume = R_Model_Brush_DrawShadowVolume;
3003 mod->DrawLight = R_Model_Brush_DrawLight;
3006 mod->brush.GetPVS = NULL;
3007 mod->brush.FatPVS = NULL;
3008 mod->brush.BoxTouchingPVS = NULL;
3009 mod->brush.LightPoint = NULL;
3010 mod->brush.AmbientSoundLevelsForPoint = NULL;
3012 mod->brushq1.pvstexturechains = Mem_Alloc(originalloadmodel->mempool, mod->brushq1.numtextures * sizeof(msurface_t **));
3013 mod->brushq1.pvstexturechainsbuffer = Mem_Alloc(originalloadmodel->mempool,(mod->brushq1.nummodelsurfaces + mod->brushq1.numtextures) * sizeof(msurface_t *));
3014 mod->brushq1.pvstexturechainslength = Mem_Alloc(originalloadmodel->mempool, mod->brushq1.numtextures * sizeof(int));
3015 Mod_Q1BSP_BuildPVSTextureChains(mod);
3016 Mod_Q1BSP_BuildLightmapUpdateChains(originalloadmodel->mempool, mod);
3017 if (mod->brushq1.nummodelsurfaces)
3019 // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3020 mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3021 mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3024 for (j = 0, surf = &mod->brushq1.surfaces[mod->brushq1.firstmodelsurface];j < mod->brushq1.nummodelsurfaces;j++, surf++)
3026 // we only need to have a drawsky function if it is used(usually only on world model)
3027 if (surf->texinfo->texture->shader == &Cshader_sky)
3028 mod->DrawSky = R_Model_Brush_DrawSky;
3029 // LordHavoc: submodels always clip, even if water
3030 if (mod->brush.numsubmodels - 1)
3031 surf->flags |= SURF_SOLIDCLIP;
3032 // calculate bounding shapes
3033 for (k = 0, vec = surf->mesh.data_vertex3f;k < surf->mesh.num_vertices;k++, vec += 3)
3035 if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3036 if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3037 if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3038 if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3039 if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3040 if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3041 dist = vec[0]*vec[0]+vec[1]*vec[1];
3042 if (modelyawradius < dist)
3043 modelyawradius = dist;
3044 dist += vec[2]*vec[2];
3045 if (modelradius < dist)
3049 modelyawradius = sqrt(modelyawradius);
3050 modelradius = sqrt(modelradius);
3051 mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3052 mod->yawmins[2] = mod->normalmins[2];
3053 mod->yawmaxs[2] = mod->normalmaxs[2];
3054 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3055 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3056 mod->radius = modelradius;
3057 mod->radius2 = modelradius * modelradius;
3061 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3062 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadname);
3064 Mod_Q1BSP_BuildSurfaceNeighbors(mod->brushq1.surfaces + mod->brushq1.firstmodelsurface, mod->brushq1.nummodelsurfaces, originalloadmodel->mempool);
3066 mod->brushq1.num_visleafs = bm->visleafs;
3068 // LordHavoc: only register submodels if it is the world
3069 // (prevents bsp models from replacing world submodels)
3070 if (loadmodel->isworldmodel && i < (mod->brush.numsubmodels - 1))
3073 // duplicate the basic information
3074 sprintf(name, "*%i", i+1);
3075 loadmodel = Mod_FindName(name);
3077 strcpy(loadmodel->name, name);
3078 // textures and memory belong to the main model
3079 loadmodel->texturepool = NULL;
3080 loadmodel->mempool = NULL;
3085 loadmodel = originalloadmodel;
3086 //Mod_Q1BSP_ProcessLightList();
3088 if (developer.integer)
3089 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);
3092 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3096 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3103 in = (void *)(mod_base + l->fileofs);
3104 if (l->filelen % sizeof(*in))
3105 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3106 count = l->filelen / sizeof(*in);
3107 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3110 loadmodel->num = count;
3112 for (i = 0;i < count;i++, in++, out++)
3118 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3125 in = (void *)(mod_base + l->fileofs);
3126 if (l->filelen % sizeof(*in))
3127 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3128 count = l->filelen / sizeof(*in);
3129 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3132 loadmodel->num = count;
3134 for (i = 0;i < count;i++, in++, out++)
3140 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3147 in = (void *)(mod_base + l->fileofs);
3148 if (l->filelen % sizeof(*in))
3149 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3150 count = l->filelen / sizeof(*in);
3151 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3154 loadmodel->num = count;
3156 for (i = 0;i < count;i++, in++, out++)
3162 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3169 in = (void *)(mod_base + l->fileofs);
3170 if (l->filelen % sizeof(*in))
3171 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3172 count = l->filelen / sizeof(*in);
3173 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3176 loadmodel->num = count;
3178 for (i = 0;i < count;i++, in++, out++)
3184 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3191 in = (void *)(mod_base + l->fileofs);
3192 if (l->filelen % sizeof(*in))
3193 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3194 count = l->filelen / sizeof(*in);
3195 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3198 loadmodel->num = count;
3200 for (i = 0;i < count;i++, in++, out++)
3206 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3213 in = (void *)(mod_base + l->fileofs);
3214 if (l->filelen % sizeof(*in))
3215 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3216 count = l->filelen / sizeof(*in);
3217 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3220 loadmodel->num = count;
3222 for (i = 0;i < count;i++, in++, out++)
3228 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3235 in = (void *)(mod_base + l->fileofs);
3236 if (l->filelen % sizeof(*in))
3237 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3238 count = l->filelen / sizeof(*in);
3239 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3242 loadmodel->num = count;
3244 for (i = 0;i < count;i++, in++, out++)
3250 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3257 in = (void *)(mod_base + l->fileofs);
3258 if (l->filelen % sizeof(*in))
3259 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3260 count = l->filelen / sizeof(*in);
3261 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3264 loadmodel->num = count;
3266 for (i = 0;i < count;i++, in++, out++)
3272 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3279 in = (void *)(mod_base + l->fileofs);
3280 if (l->filelen % sizeof(*in))
3281 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3282 count = l->filelen / sizeof(*in);
3283 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3286 loadmodel->num = count;
3288 for (i = 0;i < count;i++, in++, out++)
3294 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3301 in = (void *)(mod_base + l->fileofs);
3302 if (l->filelen % sizeof(*in))
3303 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3304 count = l->filelen / sizeof(*in);
3305 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3308 loadmodel->num = count;
3310 for (i = 0;i < count;i++, in++, out++)
3316 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3323 in = (void *)(mod_base + l->fileofs);
3324 if (l->filelen % sizeof(*in))
3325 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3326 count = l->filelen / sizeof(*in);
3327 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3330 loadmodel->num = count;
3332 for (i = 0;i < count;i++, in++, out++)
3338 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3345 in = (void *)(mod_base + l->fileofs);
3346 if (l->filelen % sizeof(*in))
3347 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3348 count = l->filelen / sizeof(*in);
3349 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3352 loadmodel->num = count;
3354 for (i = 0;i < count;i++, in++, out++)
3360 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3367 in = (void *)(mod_base + l->fileofs);
3368 if (l->filelen % sizeof(*in))
3369 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3370 count = l->filelen / sizeof(*in);
3371 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3374 loadmodel->num = count;
3376 for (i = 0;i < count;i++, in++, out++)
3382 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3389 in = (void *)(mod_base + l->fileofs);
3390 if (l->filelen % sizeof(*in))
3391 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3392 count = l->filelen / sizeof(*in);
3393 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3396 loadmodel->num = count;
3398 for (i = 0;i < count;i++, in++, out++)
3404 static void Mod_Q2BSP_LoadAreas(lump_t *l)
3411 in = (void *)(mod_base + l->fileofs);
3412 if (l->filelen % sizeof(*in))
3413 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
3414 count = l->filelen / sizeof(*in);
3415 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3418 loadmodel->num = count;
3420 for (i = 0;i < count;i++, in++, out++)
3426 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
3433 in = (void *)(mod_base + l->fileofs);
3434 if (l->filelen % sizeof(*in))
3435 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
3436 count = l->filelen / sizeof(*in);
3437 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3440 loadmodel->num = count;
3442 for (i = 0;i < count;i++, in++, out++)
3448 static void Mod_Q2BSP_LoadModels(lump_t *l)
3455 in = (void *)(mod_base + l->fileofs);
3456 if (l->filelen % sizeof(*in))
3457 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
3458 count = l->filelen / sizeof(*in);
3459 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3462 loadmodel->num = count;
3464 for (i = 0;i < count;i++, in++, out++)
3470 void static Mod_Q2BSP_Load(model_t *mod, void *buffer)
3473 q2dheader_t *header;
3475 Host_Error("Mod_Q2BSP_Load: not yet implemented\n");
3477 mod->type = mod_brushq2;
3479 header = (q2dheader_t *)buffer;
3481 i = LittleLong(header->version);
3482 if (i != Q2BSPVERSION)
3483 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
3484 mod->brush.ishlbsp = false;
3485 if (loadmodel->isworldmodel)
3487 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3488 // until we get a texture for it...
3492 mod_base = (qbyte *)header;
3494 // swap all the lumps
3495 for (i = 0;i < (int) sizeof(*header) / 4;i++)
3496 ((int *)header)[i] = LittleLong(((int *)header)[i]);
3498 // store which lightmap format to use
3499 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3501 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
3502 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
3503 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
3504 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
3505 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
3506 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
3507 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
3508 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
3509 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
3510 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
3511 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
3512 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
3513 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
3514 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
3515 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
3516 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
3517 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
3518 // LordHavoc: must go last because this makes the submodels
3519 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
3522 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
3523 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
3525 static void Mod_Q3BSP_LoadEntities(lump_t *l)
3528 char key[128], value[4096];
3530 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
3531 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
3532 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
3535 loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
3536 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
3537 data = loadmodel->brush.entities;
3538 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
3539 if (data && COM_ParseToken(&data, false) && com_token[0] == '{')
3543 if (!COM_ParseToken(&data, false))
3545 if (com_token[0] == '}')
3546 break; // end of worldspawn
3547 if (com_token[0] == '_')
3548 strcpy(key, com_token + 1);
3550 strcpy(key, com_token);
3551 while (key[strlen(key)-1] == ' ') // remove trailing spaces
3552 key[strlen(key)-1] = 0;
3553 if (!COM_ParseToken(&data, false))
3555 strcpy(value, com_token);
3556 if (!strcmp("gridsize", key))
3558 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
3559 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
3565 static void Mod_Q3BSP_LoadTextures(lump_t *l)
3575 char shadername[Q3PATHLENGTH];
3576 char sky[Q3PATHLENGTH];
3578 in = (void *)(mod_base + l->fileofs);
3579 if (l->filelen % sizeof(*in))
3580 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
3581 count = l->filelen / sizeof(*in);
3582 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3584 loadmodel->brushq3.data_textures = out;
3585 loadmodel->brushq3.num_textures = count;
3587 for (i = 0;i < count;i++, in++, out++)
3590 strlcpy (out->name, in->name, sizeof (out->name));
3591 out->surfaceflags = LittleLong(in->surfaceflags);
3592 out->nativecontents = LittleLong(in->contents);
3593 out->supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, out->nativecontents);
3594 Mod_LoadSkinFrame(&out->skin, out->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE, false, true, true);
3595 out->surfaceparms = -1;
3598 // do a quick parse of shader files to get surfaceparms
3599 if ((search = FS_Search("scripts/*.shader", true, false)))
3601 for (i = 0;i < search->numfilenames;i++)
3603 if ((f = FS_LoadFile(search->filenames[i], false)))
3606 while (COM_ParseToken(&text, false))
3608 snprintf(shadername, sizeof(shadername), "%s", com_token);
3611 if (COM_ParseToken(&text, false) && !strcasecmp(com_token, "{"))
3613 while (COM_ParseToken(&text, false))
3615 if (!strcasecmp(com_token, "}"))
3617 else if (!strcasecmp(com_token, "{"))
3619 while (COM_ParseToken(&text, false))
3621 if (!strcasecmp(com_token, "}"))
3625 else if (!strcasecmp(com_token, "surfaceparm"))
3627 if (COM_ParseToken(&text, true) && strcasecmp(com_token, "\n"))
3629 if (!strcasecmp(com_token, "alphashadow"))
3630 flags |= Q3SURFACEPARM_ALPHASHADOW;
3631 else if (!strcasecmp(com_token, "areaportal"))
3632 flags |= Q3SURFACEPARM_AREAPORTAL;
3633 else if (!strcasecmp(com_token, "clusterportal"))
3634 flags |= Q3SURFACEPARM_CLUSTERPORTAL;
3635 else if (!strcasecmp(com_token, "detail"))
3636 flags |= Q3SURFACEPARM_DETAIL;
3637 else if (!strcasecmp(com_token, "donotenter"))
3638 flags |= Q3SURFACEPARM_DONOTENTER;
3639 else if (!strcasecmp(com_token, "fog"))
3640 flags |= Q3SURFACEPARM_FOG;
3641 else if (!strcasecmp(com_token, "lava"))
3642 flags |= Q3SURFACEPARM_LAVA;
3643 else if (!strcasecmp(com_token, "lightfilter"))
3644 flags |= Q3SURFACEPARM_LIGHTFILTER;
3645 else if (!strcasecmp(com_token, "metalsteps"))
3646 flags |= Q3SURFACEPARM_METALSTEPS;
3647 else if (!strcasecmp(com_token, "nodamage"))
3648 flags |= Q3SURFACEPARM_NODAMAGE;
3649 else if (!strcasecmp(com_token, "nodlight"))
3650 flags |= Q3SURFACEPARM_NODLIGHT;
3651 else if (!strcasecmp(com_token, "nodraw"))
3652 flags |= Q3SURFACEPARM_NODRAW;
3653 else if (!strcasecmp(com_token, "nodrop"))
3654 flags |= Q3SURFACEPARM_NODROP;
3655 else if (!strcasecmp(com_token, "noimpact"))
3656 flags |= Q3SURFACEPARM_NOIMPACT;
3657 else if (!strcasecmp(com_token, "nolightmap"))
3658 flags |= Q3SURFACEPARM_NOLIGHTMAP;
3659 else if (!strcasecmp(com_token, "nomarks"))
3660 flags |= Q3SURFACEPARM_NOMARKS;
3661 else if (!strcasecmp(com_token, "nomipmaps"))
3662 flags |= Q3SURFACEPARM_NOMIPMAPS;
3663 else if (!strcasecmp(com_token, "nonsolid"))
3664 flags |= Q3SURFACEPARM_NONSOLID;
3665 else if (!strcasecmp(com_token, "origin"))
3666 flags |= Q3SURFACEPARM_ORIGIN;
3667 else if (!strcasecmp(com_token, "playerclip"))
3668 flags |= Q3SURFACEPARM_PLAYERCLIP;
3669 else if (!strcasecmp(com_token, "sky"))
3670 flags |= Q3SURFACEPARM_SKY;
3671 else if (!strcasecmp(com_token, "slick"))
3672 flags |= Q3SURFACEPARM_SLICK;
3673 else if (!strcasecmp(com_token, "slime"))
3674 flags |= Q3SURFACEPARM_SLIME;
3675 else if (!strcasecmp(com_token, "structural"))
3676 flags |= Q3SURFACEPARM_STRUCTURAL;
3677 else if (!strcasecmp(com_token, "trans"))
3678 flags |= Q3SURFACEPARM_TRANS;
3679 else if (!strcasecmp(com_token, "water"))
3680 flags |= Q3SURFACEPARM_WATER;
3682 Con_Printf("%s parsing warning: unknown surfaceparm \"%s\"\n", search->filenames[i], com_token);
3683 if (!COM_ParseToken(&text, true) || strcasecmp(com_token, "\n"))
3685 Con_Printf("%s parsing error: surfaceparm only takes one parameter.\n", search->filenames[i]);
3691 Con_Printf("%s parsing error: surfaceparm expects a parameter.\n", search->filenames[i]);
3695 else if (!strcasecmp(com_token, "sky"))
3697 if (COM_ParseToken(&text, true) && strcasecmp(com_token, "\n"))
3698 if (strlen(com_token) < sizeof(sky))
3699 strcpy(sky, com_token);
3701 else if (!strcasecmp(com_token, "skyparms"))
3703 if (COM_ParseToken(&text, true) && strcasecmp(com_token, "\n"))
3705 if (strlen(com_token) < sizeof(sky) && !atoi(com_token) && strcasecmp(com_token, "-"))
3706 strcpy(sky, com_token);
3707 if (COM_ParseToken(&text, true) && strcasecmp(com_token, "\n"))
3708 COM_ParseToken(&text, true);
3713 // look for linebreak or }
3714 while(COM_ParseToken(&text, true) && strcasecmp(com_token, "\n") && strcasecmp(com_token, "}"));
3715 // break out to top level if it was }
3716 if (!strcasecmp(com_token, "}"))
3720 // add shader to list (shadername and flags)
3721 // actually here we just poke into the texture settings
3722 for (j = 0, out = loadmodel->brushq3.data_textures;j < loadmodel->brushq3.num_textures;j++, out++)
3724 if (!strcasecmp(out->name, shadername))
3726 out->surfaceparms = flags;
3727 if ((flags & Q3SURFACEPARM_SKY) && sky[0])
3728 strcpy(loadmodel->brush.skybox, sky);
3734 Con_Printf("%s parsing error - expected \"{\", found \"%s\"\n", search->filenames[i], com_token);
3745 for (j = 0, out = loadmodel->brushq3.data_textures;j < loadmodel->brushq3.num_textures;j++, out++)
3747 if (out->surfaceparms == -1)
3750 Con_DPrintf("%s: No shader found for texture \"%s\"\n", loadmodel->name, out->name);
3751 out->surfaceparms = 0;
3752 // these are defaults
3753 if (!strcmp(out->name, "caulk") || !strcmp(out->name, "common/caulk") || !strcmp(out->name, "textures/common/caulk")
3754 || !strcmp(out->name, "nodraw") || !strcmp(out->name, "common/nodraw") || !strcmp(out->name, "textures/common/nodraw"))
3755 out->surfaceparms |= Q3SURFACEPARM_NODRAW;
3756 if (!strncmp(out->name, "textures/skies/", 15))
3757 out->surfaceparms |= Q3SURFACEPARM_SKY;
3758 if (R_TextureHasAlpha(out->skin.base))
3759 out->surfaceparms |= Q3SURFACEPARM_TRANS;
3762 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
3765 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
3771 in = (void *)(mod_base + l->fileofs);
3772 if (l->filelen % sizeof(*in))
3773 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3774 count = l->filelen / sizeof(*in);
3775 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3777 loadmodel->brushq3.data_planes = out;
3778 loadmodel->brushq3.num_planes = count;
3780 for (i = 0;i < count;i++, in++, out++)
3782 out->normal[0] = LittleLong(in->normal[0]);
3783 out->normal[1] = LittleLong(in->normal[1]);
3784 out->normal[2] = LittleLong(in->normal[2]);
3785 out->dist = LittleLong(in->dist);
3790 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
3793 q3mbrushside_t *out;
3796 in = (void *)(mod_base + l->fileofs);
3797 if (l->filelen % sizeof(*in))
3798 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3799 count = l->filelen / sizeof(*in);
3800 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3802 loadmodel->brushq3.data_brushsides = out;
3803 loadmodel->brushq3.num_brushsides = count;
3805 for (i = 0;i < count;i++, in++, out++)
3807 n = LittleLong(in->planeindex);
3808 if (n < 0 || n >= loadmodel->brushq3.num_planes)
3809 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)\n", n, loadmodel->brushq3.num_planes);
3810 out->plane = loadmodel->brushq3.data_planes + n;
3811 n = LittleLong(in->textureindex);
3812 if (n < 0 || n >= loadmodel->brushq3.num_textures)
3813 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)\n", n, loadmodel->brushq3.num_textures);
3814 out->texture = loadmodel->brushq3.data_textures + n;
3818 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
3822 int i, j, n, c, count, maxplanes;
3824 winding_t *temp1, *temp2;
3826 in = (void *)(mod_base + l->fileofs);
3827 if (l->filelen % sizeof(*in))
3828 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3829 count = l->filelen / sizeof(*in);
3830 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3832 loadmodel->brushq3.data_brushes = out;
3833 loadmodel->brushq3.num_brushes = count;
3835 temp1 = Winding_New(64);
3836 temp2 = Winding_New(64);
3841 for (i = 0;i < count;i++, in++, out++)
3843 n = LittleLong(in->firstbrushside);
3844 c = LittleLong(in->numbrushsides);
3845 if (n < 0 || n + c > loadmodel->brushq3.num_brushsides)
3846 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)\n", n, n + c, loadmodel->brushq3.num_brushsides);
3847 out->firstbrushside = loadmodel->brushq3.data_brushsides + n;
3848 out->numbrushsides = c;
3849 n = LittleLong(in->textureindex);
3850 if (n < 0 || n >= loadmodel->brushq3.num_textures)
3851 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)\n", n, loadmodel->brushq3.num_textures);
3852 out->texture = loadmodel->brushq3.data_textures + n;
3854 // make a list of mplane_t structs to construct a colbrush from
3855 if (maxplanes < out->numbrushsides)
3857 maxplanes = out->numbrushsides;
3860 planes = Mem_Alloc(tempmempool, sizeof(mplane_t) * maxplanes);
3862 for (j = 0;j < out->numbrushsides;j++)
3864 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
3865 planes[j].dist = out->firstbrushside[j].plane->dist;
3867 // make the colbrush from the planes
3868 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, temp1, temp2);
3872 Winding_Free(temp1);
3873 Winding_Free(temp2);
3876 static void Mod_Q3BSP_LoadEffects(lump_t *l)
3882 in = (void *)(mod_base + l->fileofs);
3883 if (l->filelen % sizeof(*in))
3884 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
3885 count = l->filelen / sizeof(*in);
3886 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3888 loadmodel->brushq3.data_effects = out;
3889 loadmodel->brushq3.num_effects = count;
3891 for (i = 0;i < count;i++, in++, out++)
3893 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
3894 n = LittleLong(in->brushindex);
3895 if (n < 0 || n >= loadmodel->brushq3.num_brushes)
3896 Host_Error("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes)\n", n, loadmodel->brushq3.num_brushes);
3897 out->brush = loadmodel->brushq3.data_brushes + n;
3898 out->unknown = LittleLong(in->unknown);
3902 static void Mod_Q3BSP_LoadVertices(lump_t *l)
3907 in = (void *)(mod_base + l->fileofs);
3908 if (l->filelen % sizeof(*in))
3909 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3910 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
3911 loadmodel->brushq3.data_vertex3f = Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 2 + 2 + 3 + 3 + 3 + 4)));
3912 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + count * 3;
3913 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
3914 loadmodel->brushq3.data_svector3f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
3915 loadmodel->brushq3.data_tvector3f = loadmodel->brushq3.data_svector3f + count * 3;
3916 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_tvector3f + count * 3;
3917 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_normal3f + count * 3;
3919 for (i = 0;i < count;i++, in++)
3921 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
3922 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
3923 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
3924 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
3925 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
3926 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
3927 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
3928 // svector/tvector are calculated later in face loading
3929 loadmodel->brushq3.data_svector3f[i * 3 + 0] = 0;
3930 loadmodel->brushq3.data_svector3f[i * 3 + 1] = 0;
3931 loadmodel->brushq3.data_svector3f[i * 3 + 2] = 0;
3932 loadmodel->brushq3.data_tvector3f[i * 3 + 0] = 0;
3933 loadmodel->brushq3.data_tvector3f[i * 3 + 1] = 0;
3934 loadmodel->brushq3.data_tvector3f[i * 3 + 2] = 0;
3935 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
3936 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
3937 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
3938 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
3939 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
3940 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
3941 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
3945 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
3951 in = (void *)(mod_base + l->fileofs);
3952 if (l->filelen % sizeof(int[3]))
3953 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
3954 count = l->filelen / sizeof(*in);
3955 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out) * 2);
3957 loadmodel->brushq3.num_triangles = count / 3;
3958 loadmodel->brushq3.data_element3i = out;
3959 loadmodel->brushq3.data_neighbor3i = out + count;
3961 for (i = 0;i < count;i++, in++, out++)
3963 *out = LittleLong(*in);
3964 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
3966 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
3972 static void Mod_Q3BSP_LoadLightmaps(lump_t *l)
3980 in = (void *)(mod_base + l->fileofs);
3981 if (l->filelen % sizeof(*in))
3982 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
3983 count = l->filelen / sizeof(*in);
3984 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3986 loadmodel->brushq3.data_lightmaps = out;
3987 loadmodel->brushq3.num_lightmaps = count;
3989 for (i = 0;i < count;i++, in++, out++)
3990 *out = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", i), 128, 128, in->rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
3993 static void Mod_Q3BSP_LoadFaces(lump_t *l)
3997 int i, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xlevel, ylevel, row0, row1, x, y, *e, finalvertices, finaltriangles;
3998 //int *originalelement3i;
3999 //int *originalneighbor3i;
4000 float *originalvertex3f;
4001 //float *originalsvector3f;
4002 //float *originaltvector3f;
4003 //float *originalnormal3f;
4004 float *originalcolor4f;
4005 float *originaltexcoordtexture2f;
4006 float *originaltexcoordlightmap2f;
4009 in = (void *)(mod_base + l->fileofs);
4010 if (l->filelen % sizeof(*in))
4011 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4012 count = l->filelen / sizeof(*in);
4013 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4015 loadmodel->brushq3.data_faces = out;
4016 loadmodel->brushq3.num_faces = count;
4018 for (i = 0;i < count;i++, in++, out++)
4020 // check face type first
4021 out->type = LittleLong(in->type);
4022 if (out->type != Q3FACETYPE_POLYGON
4023 && out->type != Q3FACETYPE_PATCH
4024 && out->type != Q3FACETYPE_MESH
4025 && out->type != Q3FACETYPE_FLARE)
4027 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, out->type);
4028 out->num_vertices = 0;
4029 out->num_triangles = 0;
4030 out->type = 0; // error
4034 n = LittleLong(in->textureindex);
4035 if (n < 0 || n >= loadmodel->brushq3.num_textures)
4037 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->brushq3.num_textures);
4038 out->num_vertices = 0;
4039 out->num_triangles = 0;
4040 out->type = 0; // error
4044 out->texture = loadmodel->brushq3.data_textures + n;
4045 n = LittleLong(in->effectindex);
4046 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4048 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4054 out->effect = loadmodel->brushq3.data_effects + n;
4055 n = LittleLong(in->lightmapindex);
4056 if (n < -1 || n >= loadmodel->brushq3.num_lightmaps)
4058 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_lightmaps);
4062 out->lightmaptexture = NULL;
4064 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n];
4066 out->firstvertex = LittleLong(in->firstvertex);
4067 out->num_vertices = LittleLong(in->numvertices);
4068 out->firstelement = LittleLong(in->firstelement);
4069 out->num_triangles = LittleLong(in->numelements) / 3;
4070 if (out->num_triangles * 3 != LittleLong(in->numelements))
4072 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));
4073 out->num_vertices = 0;
4074 out->num_triangles = 0;
4075 out->type = 0; // error
4078 if (out->firstvertex < 0 || out->firstvertex + out->num_vertices > loadmodel->brushq3.num_vertices)
4080 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid vertex range %i : %i (%i vertices)\n", i, out->texture->name, out->firstvertex, out->firstvertex + out->num_vertices, loadmodel->brushq3.num_vertices);
4081 out->num_vertices = 0;
4082 out->num_triangles = 0;
4083 out->type = 0; // error
4086 if (out->firstelement < 0 || out->firstelement + out->num_triangles * 3 > loadmodel->brushq3.num_triangles * 3)
4088 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid element range %i : %i (%i elements)\n", i, out->texture->name, out->firstelement, out->firstelement + out->num_triangles * 3, loadmodel->brushq3.num_triangles * 3);
4089 out->num_vertices = 0;
4090 out->num_triangles = 0;
4091 out->type = 0; // error
4096 case Q3FACETYPE_POLYGON:
4097 case Q3FACETYPE_MESH:
4098 // no processing necessary
4099 out->data_vertex3f = loadmodel->brushq3.data_vertex3f + out->firstvertex * 3;
4100 out->data_texcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + out->firstvertex * 2;
4101 out->data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + out->firstvertex * 2;
4102 out->data_svector3f = loadmodel->brushq3.data_svector3f + out->firstvertex * 3;
4103 out->data_tvector3f = loadmodel->brushq3.data_tvector3f + out->firstvertex * 3;
4104 out->data_normal3f = loadmodel->brushq3.data_normal3f + out->firstvertex * 3;
4105 out->data_color4f = loadmodel->brushq3.data_color4f + out->firstvertex * 4;
4106 out->data_element3i = loadmodel->brushq3.data_element3i + out->firstelement;
4107 out->data_neighbor3i = loadmodel->brushq3.data_neighbor3i + out->firstelement;
4109 case Q3FACETYPE_PATCH:
4110 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4111 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4112 if (patchsize[0] < 1 || patchsize[1] < 1)
4114 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4115 out->num_vertices = 0;
4116 out->num_triangles = 0;
4117 out->type = 0; // error
4120 originalvertex3f = loadmodel->brushq3.data_vertex3f + out->firstvertex * 3;
4121 //originalsvector3f = loadmodel->brushq3.data_svector3f + out->firstvertex * 3;
4122 //originaltvector3f = loadmodel->brushq3.data_tvector3f + out->firstvertex * 3;
4123 //originalnormal3f = loadmodel->brushq3.data_normal3f + out->firstvertex * 3;
4124 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + out->firstvertex * 2;
4125 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + out->firstvertex * 2;
4126 originalcolor4f = loadmodel->brushq3.data_color4f + out->firstvertex * 4;
4127 //originalelement3i = loadmodel->brushq3.data_element3i + out->firstelement;
4128 //originalneighbor3i = loadmodel->brushq3.data_neighbor3i + out->firstelement;
4130 originalvertex3f = out->data_vertex3f;
4131 //originalsvector3f = out->data_svector3f;
4132 //originaltvector3f = out->data_tvector3f;
4133 //originalnormal3f = out->data_normal3f;
4134 originalcolor4f = out->data_color4f;
4135 originaltexcoordtexture2f = out->data_texcoordtexture2f;
4136 originaltexcoordlightmap2f = out->data_texcoordlightmap2f;
4137 //originalelement3i = out->data_element3i;
4138 //originalneighbor3i = out->data_neighbor3i;
4140 // convert patch to Q3FACETYPE_MESH
4141 xlevel = QuadraticSplinePatchSubdivisionLevelOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value, 10);
4142 ylevel = QuadraticSplinePatchSubdivisionLevelOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value, 10);
4143 // bound to user settings
4144 xlevel = bound(r_subdivisions_minlevel.integer, xlevel, r_subdivisions_maxlevel.integer);
4145 ylevel = bound(r_subdivisions_minlevel.integer, ylevel, r_subdivisions_maxlevel.integer);
4146 // bound to sanity settings
4147 xlevel = bound(0, xlevel, 10);
4148 ylevel = bound(0, ylevel, 10);
4149 // bound to user limit on vertices
4150 while ((xlevel > 0 || ylevel > 0) && (((patchsize[0] - 1) << xlevel) + 1) * (((patchsize[1] - 1) << ylevel) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4152 if (xlevel > ylevel)
4157 finalwidth = ((patchsize[0] - 1) << xlevel) + 1;
4158 finalheight = ((patchsize[1] - 1) << ylevel) + 1;
4159 finalvertices = finalwidth * finalheight;
4160 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4161 out->data_vertex3f = Mem_Alloc(loadmodel->mempool, sizeof(float[20]) * finalvertices);
4162 out->data_svector3f = out->data_vertex3f + finalvertices * 3;
4163 out->data_tvector3f = out->data_svector3f + finalvertices * 3;
4164 out->data_normal3f = out->data_tvector3f + finalvertices * 3;
4165 out->data_color4f = out->data_normal3f + finalvertices * 3;
4166 out->data_texcoordtexture2f = out->data_color4f + finalvertices * 4;
4167 out->data_texcoordlightmap2f = out->data_texcoordtexture2f + finalvertices * 2;
4168 out->data_element3i = Mem_Alloc(loadmodel->mempool, sizeof(int[6]) * finaltriangles);
4169 out->data_neighbor3i = out->data_element3i + finaltriangles * 3;
4170 out->type = Q3FACETYPE_MESH;
4171 out->firstvertex = -1;
4172 out->num_vertices = finalvertices;
4173 out->firstelement = -1;
4174 out->num_triangles = finaltriangles;
4175 // generate geometry
4176 // (note: normals are skipped because they get recalculated)
4177 QuadraticSplinePatchSubdivideFloatBuffer(patchsize[0], patchsize[1], xlevel, ylevel, 3, originalvertex3f, out->data_vertex3f);
4178 QuadraticSplinePatchSubdivideFloatBuffer(patchsize[0], patchsize[1], xlevel, ylevel, 2, originaltexcoordtexture2f, out->data_texcoordtexture2f);
4179 QuadraticSplinePatchSubdivideFloatBuffer(patchsize[0], patchsize[1], xlevel, ylevel, 2, originaltexcoordlightmap2f, out->data_texcoordlightmap2f);
4180 QuadraticSplinePatchSubdivideFloatBuffer(patchsize[0], patchsize[1], xlevel, ylevel, 4, originalcolor4f, out->data_color4f);
4181 // generate elements
4182 e = out->data_element3i;
4183 for (y = 0;y < finalheight - 1;y++)
4185 row0 = (y + 0) * finalwidth;
4186 row1 = (y + 1) * finalwidth;
4187 for (x = 0;x < finalwidth - 1;x++)
4199 out->num_triangles = Mod_RemoveDegenerateTriangles(out->num_triangles, out->data_element3i, out->data_element3i, out->data_vertex3f);
4200 if (developer.integer)
4202 if (out->num_triangles < finaltriangles)
4203 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);
4205 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);
4207 // q3map does not put in collision brushes for curves... ugh
4208 // build the lower quality collision geometry
4209 out->collisions = true;
4210 xlevel = QuadraticSplinePatchSubdivisionLevelOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value, 10);
4211 ylevel = QuadraticSplinePatchSubdivisionLevelOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value, 10);
4212 // bound to user settings
4213 xlevel = bound(r_subdivisions_collision_minlevel.integer, xlevel, r_subdivisions_collision_maxlevel.integer);
4214 ylevel = bound(r_subdivisions_collision_minlevel.integer, ylevel, r_subdivisions_collision_maxlevel.integer);
4215 // bound to sanity settings
4216 xlevel = bound(0, xlevel, 10);
4217 ylevel = bound(0, ylevel, 10);
4218 // bound to user limit on vertices
4219 while ((xlevel > 0 || ylevel > 0) && (((patchsize[0] - 1) << xlevel) + 1) * (((patchsize[1] - 1) << ylevel) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4221 if (xlevel > ylevel)
4226 finalwidth = ((patchsize[0] - 1) << xlevel) + 1;
4227 finalheight = ((patchsize[1] - 1) << ylevel) + 1;
4228 finalvertices = finalwidth * finalheight;
4229 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4230 out->data_collisionvertex3f = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4231 out->data_collisionelement3i = Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4232 out->num_collisionvertices = finalvertices;
4233 out->num_collisiontriangles = finaltriangles;
4234 QuadraticSplinePatchSubdivideFloatBuffer(patchsize[0], patchsize[1], xlevel, ylevel, 3, originalvertex3f, out->data_collisionvertex3f);
4235 // generate elements
4236 e = out->data_collisionelement3i;
4237 for (y = 0;y < finalheight - 1;y++)
4239 row0 = (y + 0) * finalwidth;
4240 row1 = (y + 1) * finalwidth;
4241 for (x = 0;x < finalwidth - 1;x++)
4253 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4254 if (developer.integer)
4256 if (out->num_collisiontriangles < finaltriangles)
4257 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);
4259 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);
4262 case Q3FACETYPE_FLARE:
4263 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4265 out->num_vertices = 0;
4266 out->num_triangles = 0;
4270 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4271 if (out->data_element3i[j] < 0 || out->data_element3i[j] >= out->num_vertices)
4273 if (invalidelements)
4275 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, out->type, out->texture->name, out->texture->surfaceflags, out->texture->nativecontents, out->firstvertex, out->num_vertices, out->firstelement, out->num_triangles * 3);
4276 for (j = 0;j < out->num_triangles * 3;j++)
4278 Con_Printf(" %i", out->data_element3i[j]);
4279 if (out->data_element3i[j] < 0 || out->data_element3i[j] >= out->num_vertices)
4280 out->data_element3i[j] = 0;
4284 // for shadow volumes
4285 Mod_BuildTriangleNeighbors(out->data_neighbor3i, out->data_element3i, out->num_triangles);
4286 // for per pixel lighting
4287 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);
4288 // calculate a bounding box
4289 VectorClear(out->mins);
4290 VectorClear(out->maxs);
4291 if (out->num_vertices)
4293 VectorCopy(out->data_vertex3f, out->mins);
4294 VectorCopy(out->data_vertex3f, out->maxs);
4295 for (j = 1, v = out->data_vertex3f + 3;j < out->num_vertices;j++, v += 3)
4297 out->mins[0] = min(out->mins[0], v[0]);
4298 out->maxs[0] = max(out->maxs[0], v[0]);
4299 out->mins[1] = min(out->mins[1], v[1]);
4300 out->maxs[1] = max(out->maxs[1], v[1]);
4301 out->mins[2] = min(out->mins[2], v[2]);
4302 out->maxs[2] = max(out->maxs[2], v[2]);
4304 out->mins[0] -= 1.0f;
4305 out->mins[1] -= 1.0f;
4306 out->mins[2] -= 1.0f;
4307 out->maxs[0] += 1.0f;
4308 out->maxs[1] += 1.0f;
4309 out->maxs[2] += 1.0f;
4313 // LordHavoc: experimental array merger (disabled because it wastes time and uses 2x memory while merging)
4316 int totalverts, totaltris;
4317 int originalnum_vertices;
4318 float *originaldata_vertex3f;
4319 float *originaldata_texcoordtexture2f;
4320 float *originaldata_texcoordlightmap2f;
4321 float *originaldata_svector3f;
4322 float *originaldata_tvector3f;
4323 float *originaldata_normal3f;
4324 float *originaldata_color4f;
4325 int originalnum_triangles;
4326 int *originaldata_element3i;
4327 int *originaldata_neighbor3i;
4331 for (i = 0, out = loadmodel->brushq3.data_faces;i < count;i++, out++)
4335 totalverts += out->num_vertices;
4336 totaltris += out->num_triangles;
4339 originalnum_vertices = loadmodel->brushq3.num_vertices;
4340 originaldata_vertex3f = loadmodel->brushq3.data_vertex3f;
4341 originaldata_texcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f;
4342 originaldata_texcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f;
4343 originaldata_svector3f = loadmodel->brushq3.data_svector3f;
4344 originaldata_tvector3f = loadmodel->brushq3.data_tvector3f;
4345 originaldata_normal3f = loadmodel->brushq3.data_normal3f;
4346 originaldata_color4f = loadmodel->brushq3.data_color4f;
4347 originalnum_triangles = loadmodel->brushq3.num_triangles;
4348 originaldata_element3i = loadmodel->brushq3.data_element3i;
4349 originaldata_neighbor3i = loadmodel->brushq3.data_neighbor3i;
4350 loadmodel->brushq3.num_vertices = totalverts;
4351 loadmodel->brushq3.data_vertex3f = Mem_Alloc(loadmodel->mempool, totalverts * (sizeof(float) * (3 + 2 + 2 + 3 + 3 + 3 + 4)) + totaltris * (sizeof(int) * (3 * 2)));
4352 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + totalverts * 3;
4353 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + totalverts * 2;
4354 loadmodel->brushq3.data_svector3f = loadmodel->brushq3.data_texcoordlightmap2f + totalverts * 2;
4355 loadmodel->brushq3.data_tvector3f = loadmodel->brushq3.data_svector3f + totalverts * 3;
4356 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_tvector3f + totalverts * 3;
4357 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_normal3f + totalverts * 3;
4358 loadmodel->brushq3.num_triangles = totaltris;
4359 loadmodel->brushq3.data_element3i = (int *)(loadmodel->brushq3.data_color4f + totalverts * 4);
4360 loadmodel->brushq3.data_neighbor3i = loadmodel->brushq3.data_element3i + totaltris * 3;
4363 for (i = 0, out = loadmodel->brushq3.data_faces;i < count;i++, out++)
4367 Con_Printf("totalverts %i, totaltris %i\n", totalverts, totaltris);
4368 memcpy(loadmodel->brushq3.data_vertex3f + totalverts * 3, out->data_vertex3f, out->num_vertices * 3 * sizeof(float));
4369 memcpy(loadmodel->brushq3.data_texcoordtexture2f + totalverts * 2, out->data_texcoordtexture2f, out->num_vertices * 2 * sizeof(float));
4370 memcpy(loadmodel->brushq3.data_texcoordlightmap2f + totalverts * 2, out->data_texcoordlightmap2f, out->num_vertices * 2 * sizeof(float));
4371 memcpy(loadmodel->brushq3.data_svector3f + totalverts * 3, out->data_svector3f, out->num_vertices * 3 * sizeof(float));
4372 memcpy(loadmodel->brushq3.data_tvector3f + totalverts * 3, out->data_tvector3f, out->num_vertices * 3 * sizeof(float));
4373 memcpy(loadmodel->brushq3.data_normal3f + totalverts * 3, out->data_normal3f, out->num_vertices * 3 * sizeof(float));
4374 memcpy(loadmodel->brushq3.data_color4f + totalverts * 4, out->data_color4f, out->num_vertices * 4 * sizeof(float));
4375 memcpy(loadmodel->brushq3.data_element3i + totaltris * 3, out->data_element3i, out->num_triangles * 3 * sizeof(int));
4376 memcpy(loadmodel->brushq3.data_neighbor3i + totaltris * 3, out->data_neighbor3i, out->num_triangles * 3 * sizeof(int));
4377 if (out->firstvertex == -1)
4378 Mem_Free(out->data_vertex3f);
4379 if (out->firstelement == -1)
4380 Mem_Free(out->data_element3i);
4381 out->firstvertex = totalverts;
4382 out->data_vertex3f = loadmodel->brushq3.data_vertex3f + out->firstvertex * 3;
4383 out->data_texcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + out->firstvertex * 2;
4384 out->data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + out->firstvertex * 2;
4385 out->data_svector3f = loadmodel->brushq3.data_svector3f + out->firstvertex * 3;
4386 out->data_tvector3f = loadmodel->brushq3.data_tvector3f + out->firstvertex * 3;
4387 out->data_normal3f = loadmodel->brushq3.data_normal3f + out->firstvertex * 3;
4388 out->data_color4f = loadmodel->brushq3.data_color4f + out->firstvertex * 4;
4389 out->firstelement = totaltris * 3;
4390 out->data_element3i = loadmodel->brushq3.data_element3i + out->firstelement;
4391 out->data_neighbor3i = loadmodel->brushq3.data_neighbor3i + out->firstelement;
4392 //for (j = 0;j < out->numtriangles * 3;j++)
4393 // out->data_element3i[j] += totalverts - out->firstvertex;
4394 totalverts += out->num_vertices;
4395 totaltris += out->num_triangles;
4397 Mem_Free(originaldata_vertex3f);
4398 Mem_Free(originaldata_element3i);
4403 static void Mod_Q3BSP_LoadModels(lump_t *l)
4407 int i, j, n, c, count;
4409 in = (void *)(mod_base + l->fileofs);
4410 if (l->filelen % sizeof(*in))
4411 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4412 count = l->filelen / sizeof(*in);
4413 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4415 loadmodel->brushq3.data_models = out;
4416 loadmodel->brushq3.num_models = count;
4418 for (i = 0;i < count;i++, in++, out++)
4420 for (j = 0;j < 3;j++)
4422 out->mins[j] = LittleFloat(in->mins[j]);
4423 out->maxs[j] = LittleFloat(in->maxs[j]);
4425 n = LittleLong(in->firstface);
4426 c = LittleLong(in->numfaces);
4427 if (n < 0 || n + c > loadmodel->brushq3.num_faces)
4428 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)\n", n, n + c, loadmodel->brushq3.num_faces);
4429 out->firstface = loadmodel->brushq3.data_faces + n;
4431 n = LittleLong(in->firstbrush);
4432 c = LittleLong(in->numbrushes);
4433 if (n < 0 || n + c > loadmodel->brushq3.num_brushes)
4434 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)\n", n, n + c, loadmodel->brushq3.num_brushes);
4435 out->firstbrush = loadmodel->brushq3.data_brushes + n;
4436 out->numbrushes = c;
4440 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4446 in = (void *)(mod_base + l->fileofs);
4447 if (l->filelen % sizeof(*in))
4448 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4449 count = l->filelen / sizeof(*in);
4450 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4452 loadmodel->brushq3.data_leafbrushes = out;
4453 loadmodel->brushq3.num_leafbrushes = count;
4455 for (i = 0;i < count;i++, in++, out++)
4457 n = LittleLong(*in);
4458 if (n < 0 || n >= loadmodel->brushq3.num_brushes)
4459 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)\n", n, loadmodel->brushq3.num_brushes);
4460 *out = loadmodel->brushq3.data_brushes + n;
4464 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4470 in = (void *)(mod_base + l->fileofs);
4471 if (l->filelen % sizeof(*in))
4472 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4473 count = l->filelen / sizeof(*in);
4474 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4476 loadmodel->brushq3.data_leaffaces = out;
4477 loadmodel->brushq3.num_leaffaces = count;
4479 for (i = 0;i < count;i++, in++, out++)
4481 n = LittleLong(*in);
4482 if (n < 0 || n >= loadmodel->brushq3.num_faces)
4483 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)\n", n, loadmodel->brushq3.num_faces);
4484 *out = loadmodel->brushq3.data_faces + n;
4488 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4492 int i, j, n, c, count;
4494 in = (void *)(mod_base + l->fileofs);
4495 if (l->filelen % sizeof(*in))
4496 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4497 count = l->filelen / sizeof(*in);
4498 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4500 loadmodel->brushq3.data_leafs = out;
4501 loadmodel->brushq3.num_leafs = count;
4503 for (i = 0;i < count;i++, in++, out++)
4507 out->clusterindex = LittleLong(in->clusterindex);
4508 out->areaindex = LittleLong(in->areaindex);
4509 for (j = 0;j < 3;j++)
4511 // yes the mins/maxs are ints
4512 out->mins[j] = LittleLong(in->mins[j]) - 1;
4513 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4515 n = LittleLong(in->firstleafface);
4516 c = LittleLong(in->numleaffaces);
4517 if (n < 0 || n + c > loadmodel->brushq3.num_leaffaces)
4518 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafface range %i : %i (%i leaffaces)\n", n, n + c, loadmodel->brushq3.num_leaffaces);
4519 out->firstleafface = loadmodel->brushq3.data_leaffaces + n;
4520 out->numleaffaces = c;
4521 n = LittleLong(in->firstleafbrush);
4522 c = LittleLong(in->numleafbrushes);
4523 if (n < 0 || n + c > loadmodel->brushq3.num_leafbrushes)
4524 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)\n", n, n + c, loadmodel->brushq3.num_leafbrushes);
4525 out->firstleafbrush = loadmodel->brushq3.data_leafbrushes + n;
4526 out->numleafbrushes = c;
4530 static void Mod_Q3BSP_LoadNodes_RecursiveSetParent(q3mnode_t *node, q3mnode_t *parent)
4533 Host_Error("Mod_Q3BSP_LoadNodes_RecursiveSetParent: runaway recursion\n");
4534 node->parent = parent;
4537 Mod_Q3BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
4538 Mod_Q3BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
4542 static void Mod_Q3BSP_LoadNodes(lump_t *l)
4548 in = (void *)(mod_base + l->fileofs);
4549 if (l->filelen % sizeof(*in))
4550 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4551 count = l->filelen / sizeof(*in);
4552 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4554 loadmodel->brushq3.data_nodes = out;
4555 loadmodel->brushq3.num_nodes = count;
4557 for (i = 0;i < count;i++, in++, out++)
4560 n = LittleLong(in->planeindex);
4561 if (n < 0 || n >= loadmodel->brushq3.num_planes)
4562 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)\n", n, loadmodel->brushq3.num_planes);
4563 out->plane = loadmodel->brushq3.data_planes + n;
4564 for (j = 0;j < 2;j++)
4566 n = LittleLong(in->childrenindex[j]);
4569 if (n >= loadmodel->brushq3.num_nodes)
4570 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)\n", n, loadmodel->brushq3.num_nodes);
4571 out->children[j] = loadmodel->brushq3.data_nodes + n;
4576 if (n >= loadmodel->brushq3.num_leafs)
4577 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)\n", n, loadmodel->brushq3.num_leafs);
4578 out->children[j] = (q3mnode_t *)(loadmodel->brushq3.data_leafs + n);
4581 for (j = 0;j < 3;j++)
4583 // yes the mins/maxs are ints
4584 out->mins[j] = LittleLong(in->mins[j]) - 1;
4585 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4589 // set the parent pointers
4590 Mod_Q3BSP_LoadNodes_RecursiveSetParent(loadmodel->brushq3.data_nodes, NULL);
4593 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
4596 q3dlightgrid_t *out;
4599 in = (void *)(mod_base + l->fileofs);
4600 if (l->filelen % sizeof(*in))
4601 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
4602 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
4603 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
4604 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
4605 loadmodel->brushq3.num_lightgrid_imins[0] = ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4606 loadmodel->brushq3.num_lightgrid_imins[1] = ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4607 loadmodel->brushq3.num_lightgrid_imins[2] = ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4608 loadmodel->brushq3.num_lightgrid_imaxs[0] = floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4609 loadmodel->brushq3.num_lightgrid_imaxs[1] = floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4610 loadmodel->brushq3.num_lightgrid_imaxs[2] = floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4611 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
4612 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
4613 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
4614 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
4617 if (l->filelen < count * (int)sizeof(*in))
4618 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]);
4619 if (l->filelen != count * (int)sizeof(*in))
4620 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", count * sizeof(*in), l->filelen);
4623 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4624 loadmodel->brushq3.data_lightgrid = out;
4625 loadmodel->brushq3.num_lightgrid = count;
4627 // no swapping or validation necessary
4629 memcpy(out, in, count * (int)sizeof(*out));
4632 // no data, fill with white
4634 for (i = 0;i < count;i++)
4636 out[i].ambientrgb[0] = 128;
4637 out[i].ambientrgb[1] = 128;
4638 out[i].ambientrgb[2] = 128;
4639 out[i].diffusergb[0] = 0;
4640 out[i].diffusergb[1] = 0;
4641 out[i].diffusergb[2] = 0;
4642 out[i].diffusepitch = 0;
4643 out[i].diffuseyaw = 0;
4647 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]);
4648 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]);
4651 static void Mod_Q3BSP_LoadPVS(lump_t *l)
4656 if (l->filelen == 0)
4659 // unvised maps often have cluster indices even without pvs, so check
4660 // leafs to find real number of clusters
4661 loadmodel->brush.num_pvsclusters = 1;
4662 for (i = 0;i < loadmodel->brushq3.num_leafs;i++)
4663 loadmodel->brush.num_pvsclusters = min(loadmodel->brush.num_pvsclusters, loadmodel->brushq3.data_leafs[i].clusterindex + 1);
4666 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
4667 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4668 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4669 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
4673 in = (void *)(mod_base + l->fileofs);
4675 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
4677 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
4678 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
4679 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
4680 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8\n", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
4681 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4682 if (l->filelen < totalchains + (int)sizeof(*in))
4683 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);
4685 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4686 memcpy(loadmodel->brush.data_pvsclusters, (qbyte *)(in + 1), totalchains);
4689 static void Mod_Q3BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, vec_t radius)
4691 // FIXME: finish this code
4692 VectorCopy(in, out);
4695 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
4697 int i, j, k, index[3];
4698 float transformed[3], blend1, blend2, blend, yaw, pitch, sinpitch;
4699 q3dlightgrid_t *a, *s;
4700 // FIXME: write this
4701 if (!model->brushq3.num_lightgrid)
4703 ambientcolor[0] = 1;
4704 ambientcolor[1] = 1;
4705 ambientcolor[2] = 1;
4708 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
4709 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
4710 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
4711 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
4712 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
4713 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
4714 index[0] = (int)floor(transformed[0]);
4715 index[1] = (int)floor(transformed[1]);
4716 index[2] = (int)floor(transformed[2]);
4717 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
4718 // now lerp the values
4719 VectorClear(diffusenormal);
4720 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
4721 for (k = 0;k < 2;k++)
4723 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
4724 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
4726 for (j = 0;j < 2;j++)
4728 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
4729 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
4731 for (i = 0;i < 2;i++)
4733 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0])));
4734 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
4736 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
4737 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
4738 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
4739 pitch = s->diffusepitch * M_PI / 128;
4740 yaw = s->diffuseyaw * M_PI / 128;
4741 sinpitch = sin(pitch);
4742 diffusenormal[0] += blend * (cos(yaw) * sinpitch);
4743 diffusenormal[1] += blend * (sin(yaw) * sinpitch);
4744 diffusenormal[2] += blend * (cos(pitch));
4745 //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)));
4749 VectorNormalize(diffusenormal);
4750 //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]);
4753 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, q3mnode_t *node, const vec3_t point, int markframe)
4758 // find which leaf the point is in
4760 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
4761 // point trace the brushes
4762 leaf = (q3mleaf_t *)node;
4763 for (i = 0;i < leaf->numleafbrushes;i++)
4765 brush = leaf->firstleafbrush[i]->colbrushf;
4766 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
4768 brush->markframe = markframe;
4769 Collision_TracePointBrushFloat(trace, point, leaf->firstleafbrush[i]->colbrushf);
4772 // can't do point traces on curves (they have no thickness)
4775 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)
4777 int i, startside, endside;
4778 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
4782 if (startfrac > trace->realfraction)
4784 // note: all line fragments past first impact fraction are ignored
4785 if (VectorCompare(start, end))
4787 // find which leaf the point is in
4789 node = node->children[DotProduct(start, node->plane->normal) < node->plane->dist];
4793 // find which nodes the line is in and recurse for them
4796 // recurse down node sides
4797 dist1 = PlaneDiff(start, node->plane);
4798 dist2 = PlaneDiff(end, node->plane);
4799 startside = dist1 < 0;
4800 endside = dist2 < 0;
4801 if (startside == endside)
4803 // most of the time the line fragment is on one side of the plane
4804 node = node->children[startside];
4808 // line crosses node plane, split the line
4809 midfrac = dist1 / (dist1 - dist2);
4810 VectorLerp(start, midfrac, end, mid);
4811 // take the near side first
4812 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4813 if (midfrac <= trace->realfraction)
4814 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4820 nodesegmentmins[0] = min(start[0], end[0]);
4821 nodesegmentmins[1] = min(start[1], end[1]);
4822 nodesegmentmins[2] = min(start[2], end[2]);
4823 nodesegmentmaxs[0] = max(start[0], end[0]);
4824 nodesegmentmaxs[1] = max(start[1], end[1]);
4825 nodesegmentmaxs[2] = max(start[2], end[2]);
4826 // line trace the brushes
4827 leaf = (q3mleaf_t *)node;
4828 for (i = 0;i < leaf->numleafbrushes;i++)
4830 brush = leaf->firstleafbrush[i]->colbrushf;
4831 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
4833 brush->markframe = markframe;
4834 Collision_TraceLineBrushFloat(trace, linestart, lineend, leaf->firstleafbrush[i]->colbrushf, leaf->firstleafbrush[i]->colbrushf);
4835 if (startfrac > trace->realfraction)
4839 // can't do point traces on curves (they have no thickness)
4840 if (mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
4842 // line trace the curves
4843 for (i = 0;i < leaf->numleaffaces;i++)
4845 face = leaf->firstleafface[i];
4846 if (face->collisions && face->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, face->mins, face->maxs))
4848 face->collisionmarkframe = markframe;
4849 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, face->num_collisiontriangles, face->data_collisionelement3i, face->data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
4850 if (startfrac > trace->realfraction)
4857 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)
4861 float nodesegmentmins[3], nodesegmentmaxs[3];
4866 // find which nodes the line is in and recurse for them
4869 // recurse down node sides
4870 int startside, endside;
4871 float dist1near, dist1far, dist2near, dist2far;
4872 BoxPlaneCornerDistances(thisbrush_start->mins, thisbrush_start->maxs, node->plane, &dist1near, &dist1far);
4873 BoxPlaneCornerDistances(thisbrush_end->mins, thisbrush_end->maxs, node->plane, &dist2near, &dist2far);
4874 startside = dist1near < 0;
4875 startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
4876 endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
4877 if (startside == 2 || endside == 2)
4879 // brushes cross plane
4880 // do not clip anything, just take both sides
4881 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
4882 node = node->children[1];
4889 node = node->children[0];
4894 //midf0 = dist1near / (dist1near - dist2near);
4895 //midf1 = dist1far / (dist1far - dist2far);
4896 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
4897 node = node->children[1];
4905 //midf0 = dist1near / (dist1near - dist2near);
4906 //midf1 = dist1far / (dist1far - dist2far);
4907 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
4908 node = node->children[1];
4913 node = node->children[1];
4918 if (dist1near < 0 && dist2near < 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
4919 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;}
4920 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;}
4921 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;}
4922 if (dist1near < 0 && dist2near >= 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
4923 if (dist1near < 0 && dist2near >= 0 && dist1far < 0 && dist2far >= 0){}
4924 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;}
4925 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;}
4926 if (dist1near >= 0 && dist2near < 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
4927 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;}
4928 if (dist1near >= 0 && dist2near < 0 && dist1far >= 0 && dist2far < 0){}
4929 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;}
4930 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;}
4931 if (dist1near >= 0 && dist2near >= 0 && dist1far < 0 && dist2far >= 0){node = node->children[0];continue;}
4932 if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far < 0){node = node->children[0];continue;}
4933 if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){node = node->children[0];continue;}
4935 if (dist2near < 0) // d1n<0 && d2n<0
4937 if (dist2near < 0) // d1n<0 && d2n<0
4939 if (dist2near < 0) // d1n<0 && d2n<0
4942 else // d1n<0 && d2n>0
4946 else // d1n<0 && d2n>0
4948 if (dist2near < 0) // d1n<0 && d2n<0
4951 else // d1n<0 && d2n>0
4956 else // d1n<0 && d2n>0
4962 if (dist2near < 0) // d1n>0 && d2n<0
4965 else // d1n>0 && d2n>0
4969 if (dist1near < 0 == dist1far < 0 == dist2near < 0 == dist2far < 0)
4971 node = node->children[startside];
4974 if (dist1near < dist2near)
4979 node = node->children[0];
4984 node = node->children[1];
4987 // dist1near < 0 && dist2far >= 0
4993 startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
4994 endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
4995 if (startside == 2 || endside == 2)
4997 // brushes cross plane
4998 // do not clip anything, just take both sides
4999 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5000 node = node->children[1];
5002 else if (startside == endside)
5003 node = node->children[startside];
5004 else if (startside == 0) // endside = 1 (start infront, end behind)
5007 else // startside == 1 endside = 0 (start behind, end infront)
5013 node = node->children[startside];
5016 // start and end brush cross plane
5022 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5023 node = node->children[1];
5024 else if (dist1near < 0 && dist1far < 0 && dist2near >= 0 && dist2far >= 0)
5025 else if (dist1near >= 0 && dist1far >= 0 && dist2near < 0 && dist2far < 0)
5026 else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5027 node = node->children[0];
5029 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5030 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5031 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5032 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5033 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5036 else if (dist1near >= 0 && dist1far >= 0)
5039 else // mixed (lying on plane)
5043 if (dist2near < 0 && dist2far < 0)
5047 node = node->children[1];
5049 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5050 node = node->children[0];
5051 else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5052 node = node->children[1];
5056 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5057 node = node->children[1];
5059 sides = dist1near || dist1near < 0 | dist1far < 0 | dist2near < 0 | dist
5060 startside = dist1 < 0;
5061 endside = dist2 < 0;
5062 if (startside == endside)
5064 // most of the time the line fragment is on one side of the plane
5065 node = node->children[startside];
5069 // line crosses node plane, split the line
5070 midfrac = dist1 / (dist1 - dist2);
5071 VectorLerp(start, midfrac, end, mid);
5072 // take the near side first
5073 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5074 if (midfrac <= trace->fraction)
5075 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5083 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5084 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5085 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5086 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5087 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5088 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5089 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5093 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5094 node = node->children[1];
5097 // FIXME: could be made faster by copying TraceLine code and making it use
5098 // box plane distances... (variant on the BoxOnPlaneSide code)
5101 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5102 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5103 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5104 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5105 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5106 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5107 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5111 if (mod_q3bsp_debugtracebrush.integer == 2)
5113 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5114 node = node->children[1];
5117 else if (mod_q3bsp_debugtracebrush.integer == 1)
5119 // recurse down node sides
5120 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5123 // segment box crosses plane
5124 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5125 node = node->children[1];
5128 // take whichever side the segment box is on
5129 node = node->children[sides - 1];
5134 // recurse down node sides
5135 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5138 // segment box crosses plane
5139 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5140 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5143 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5144 node = node->children[1];
5148 // take whichever side the segment box is on
5149 node = node->children[sides - 1];
5155 // FIXME: could be made faster by copying TraceLine code and making it use
5156 // box plane distances... (variant on the BoxOnPlaneSide code)
5159 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5160 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5161 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5162 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5163 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5164 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5165 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5169 if (mod_q3bsp_debugtracebrush.integer == 2)
5171 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5172 node = node->children[1];
5174 else if (mod_q3bsp_debugtracebrush.integer == 1)
5176 // recurse down node sides
5177 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5180 // segment box crosses plane
5181 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5182 node = node->children[1];
5186 // take whichever side the segment box is on
5187 node = node->children[sides - 1];
5192 // recurse down node sides
5193 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5196 // segment box crosses plane
5197 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5198 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5201 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5205 // take whichever side the segment box is on
5206 node = node->children[sides - 1];
5211 leaf = (q3mleaf_t *)node;
5212 for (i = 0;i < leaf->numleafbrushes;i++)
5214 brush = leaf->firstleafbrush[i]->colbrushf;
5215 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5217 brush->markframe = markframe;
5218 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, leaf->firstleafbrush[i]->colbrushf, leaf->firstleafbrush[i]->colbrushf);
5221 if (mod_q3bsp_curves_collisions.integer)
5223 for (i = 0;i < leaf->numleaffaces;i++)
5225 face = leaf->firstleafface[i];
5226 if (face->collisions && face->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, face->mins, face->maxs))
5228 face->markframe = markframe;
5229 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, face->num_collisiontriangles, face->data_collisionelement3i, face->data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5235 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)
5238 float segmentmins[3], segmentmaxs[3];
5239 colbrushf_t *thisbrush_start, *thisbrush_end;
5240 matrix4x4_t startmatrix, endmatrix;
5241 static int markframe = 0;
5243 memset(trace, 0, sizeof(*trace));
5244 trace->fraction = 1;
5245 trace->realfraction = 1;
5246 trace->hitsupercontentsmask = hitsupercontentsmask;
5247 Matrix4x4_CreateIdentity(&startmatrix);
5248 Matrix4x4_CreateIdentity(&endmatrix);
5249 segmentmins[0] = min(boxstartmins[0], boxendmins[0]);
5250 segmentmins[1] = min(boxstartmins[1], boxendmins[1]);
5251 segmentmins[2] = min(boxstartmins[2], boxendmins[2]);
5252 segmentmaxs[0] = max(boxstartmaxs[0], boxendmaxs[0]);
5253 segmentmaxs[1] = max(boxstartmaxs[1], boxendmaxs[1]);
5254 segmentmaxs[2] = max(boxstartmaxs[2], boxendmaxs[2]);
5255 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxstartmins, boxstartmaxs) && VectorCompare(boxendmins, boxendmaxs))
5257 if (VectorCompare(boxstartmins, boxendmins))
5260 if (model->brushq3.submodel)
5262 for (i = 0;i < model->brushq3.data_thismodel->numbrushes;i++)
5263 if (model->brushq3.data_thismodel->firstbrush[i].colbrushf)
5264 Collision_TracePointBrushFloat(trace, boxstartmins, model->brushq3.data_thismodel->firstbrush[i].colbrushf);
5267 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model->brushq3.data_nodes, boxstartmins, ++markframe);
5272 if (model->brushq3.submodel)
5274 for (i = 0;i < model->brushq3.data_thismodel->numbrushes;i++)
5275 if (model->brushq3.data_thismodel->firstbrush[i].colbrushf)
5276 Collision_TraceLineBrushFloat(trace, boxstartmins, boxendmins, model->brushq3.data_thismodel->firstbrush[i].colbrushf, model->brushq3.data_thismodel->firstbrush[i].colbrushf);
5277 if (mod_q3bsp_curves_collisions.integer)
5279 for (i = 0;i < model->brushq3.data_thismodel->numfaces;i++)
5281 face = model->brushq3.data_thismodel->firstface + i;
5282 if (face->collisions)
5283 Collision_TraceLineTriangleMeshFloat(trace, boxstartmins, boxendmins, face->num_collisiontriangles, face->data_collisionelement3i, face->data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5288 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model->brushq3.data_nodes, boxstartmins, boxendmins, 0, 1, boxstartmins, boxendmins, ++markframe, segmentmins, segmentmaxs);
5293 // box trace, performed as brush trace
5294 thisbrush_start = Collision_BrushForBox(&startmatrix, boxstartmins, boxstartmaxs);
5295 thisbrush_end = Collision_BrushForBox(&endmatrix, boxendmins, boxendmaxs);
5296 if (model->brushq3.submodel)
5298 for (i = 0;i < model->brushq3.data_thismodel->numbrushes;i++)
5299 if (model->brushq3.data_thismodel->firstbrush[i].colbrushf)
5300 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, model->brushq3.data_thismodel->firstbrush[i].colbrushf, model->brushq3.data_thismodel->firstbrush[i].colbrushf);
5301 if (mod_q3bsp_curves_collisions.integer)
5303 for (i = 0;i < model->brushq3.data_thismodel->numfaces;i++)
5305 face = model->brushq3.data_thismodel->firstface + i;
5306 if (face->collisions)
5307 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, face->num_collisiontriangles, face->data_collisionelement3i, face->data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5312 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model->brushq3.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5316 static int Mod_Q3BSP_BoxTouchingPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
5318 int clusterindex, side, nodestackindex = 0;
5319 q3mnode_t *node, *nodestack[1024];
5320 node = model->brushq3.data_nodes;
5321 if (!loadmodel->brush.num_pvsclusters)
5327 // node - recurse down the BSP tree
5328 side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
5331 // box is on one side of plane, take that path
5332 node = node->children[side];
5336 // box crosses plane, take one path and remember the other
5337 nodestack[nodestackindex++] = node->children[0];
5338 node = node->children[1];
5343 // leaf - check cluster bit
5344 clusterindex = ((q3mleaf_t *)node)->clusterindex;
5346 if (clusterindex >= loadmodel->brush.num_pvsclusters)
5348 Con_Printf("%i >= %i\n", clusterindex, loadmodel->brush.num_pvsclusters);
5352 if (CHECKPVSBIT(pvs, clusterindex))
5354 // it is visible, return immediately with the news
5359 // nothing to see here, try another path we didn't take earlier
5360 if (nodestackindex == 0)
5362 node = nodestack[--nodestackindex];
5366 // it is not visible
5370 //Returns PVS data for a given point
5371 //(note: can return NULL)
5372 static qbyte *Mod_Q3BSP_GetPVS(model_t *model, const vec3_t p)
5375 Mod_CheckLoaded(model);
5376 node = model->brushq3.data_nodes;
5378 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
5379 if (((q3mleaf_t *)node)->clusterindex >= 0)
5380 return model->brush.data_pvsclusters + ((q3mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
5385 static void Mod_Q3BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, q3mnode_t *node)
5389 float d = PlaneDiff(org, node->plane);
5391 node = node->children[0];
5392 else if (d < -radius)
5393 node = node->children[1];
5396 // go down both sides
5397 Mod_Q3BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
5398 node = node->children[1];
5401 // if this leaf is in a cluster, accumulate the pvs bits
5402 if (((q3mleaf_t *)node)->clusterindex >= 0)
5405 qbyte *pvs = model->brush.data_pvsclusters + ((q3mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
5406 for (i = 0;i < pvsbytes;i++)
5407 pvsbuffer[i] |= pvs[i];
5411 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
5412 //of the given point.
5413 static int Mod_Q3BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
5415 int bytes = model->brush.num_pvsclusterbytes;
5416 bytes = min(bytes, pvsbufferlength);
5417 if (r_novis.integer || !loadmodel->brush.num_pvsclusters || !Mod_Q3BSP_GetPVS(model, org))
5419 memset(pvsbuffer, 0xFF, bytes);
5422 memset(pvsbuffer, 0, bytes);
5423 Mod_Q3BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brushq3.data_nodes);
5428 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5430 int supercontents = 0;
5431 if (nativecontents & Q2CONTENTS_SOLID)
5432 supercontents |= SUPERCONTENTS_SOLID;
5433 if (nativecontents & Q2CONTENTS_WATER)
5434 supercontents |= SUPERCONTENTS_WATER;
5435 if (nativecontents & Q2CONTENTS_SLIME)
5436 supercontents |= SUPERCONTENTS_SLIME;
5437 if (nativecontents & Q2CONTENTS_LAVA)
5438 supercontents |= SUPERCONTENTS_LAVA;
5439 return supercontents;
5442 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5444 int nativecontents = 0;
5445 if (supercontents & SUPERCONTENTS_SOLID)
5446 nativecontents |= Q2CONTENTS_SOLID;
5447 if (supercontents & SUPERCONTENTS_WATER)
5448 nativecontents |= Q2CONTENTS_WATER;
5449 if (supercontents & SUPERCONTENTS_SLIME)
5450 nativecontents |= Q2CONTENTS_SLIME;
5451 if (supercontents & SUPERCONTENTS_LAVA)
5452 nativecontents |= Q2CONTENTS_LAVA;
5453 return nativecontents;
5457 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)
5462 if (!BoxesOverlap(node->mins, node->maxs, mins, maxs))
5466 Mod_Q3BSP_RecursiveGetVisible(node->children[0], model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces, pvs);
5467 node = node->children[1];
5469 leaf = (mleaf_t *)node;
5470 if ((pvs == NULL || CHECKPVSBIT(pvs, leaf->clusterindex)))
5474 if (maxleafs && *numleafs < maxleafs)
5475 leaflist[(*numleaf)++] = leaf;
5478 for (marksurfacenum = 0;marksurfacenum < leaf->nummarksurfaces;marksurfacenum++)
5480 face = leaf->firstleafface[marksurfacenum];
5481 if (face->shadowmark != shadowmarkcount)
5483 face->shadowmark = shadowmarkcount;
5484 if (BoxesOverlap(mins, maxs, face->mins, face->maxs) && *numsurfaces < maxsurfaces)
5485 surfacelist[(*numsurfaces)++] = face;
5492 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)
5494 // FIXME: support portals
5499 if (model->submodel)
5503 for (marksurfacenum = 0;marksurfacenum < leaf->nummarksurfaces;marksurfacenum++)
5505 face = ent->model->brushq3.surfaces + leaf->firstmarksurface[marksurfacenum];
5506 if (BoxesOverlap(mins, maxs, face->mins, face->maxs) && *numsurfaces < maxsurfaces)
5507 surfacelist[(*numsurfaces)++] = face;
5513 pvs = ent->model->brush.GetPVS(ent->model, relativelightorigin);
5514 Mod_Q3BSP_RecursiveGetVisible(ent->model->brushq3.data_nodes, model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces, pvs);
5519 extern void R_Q3BSP_DrawSky(struct entity_render_s *ent);
5520 extern void R_Q3BSP_Draw(struct entity_render_s *ent);
5521 extern void R_Q3BSP_DrawShadowVolume(struct entity_render_s *ent, vec3_t relativelightorigin, float lightradius);
5522 extern void R_Q3BSP_DrawLight(struct entity_render_s *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);
5523 void Mod_Q3BSP_Load(model_t *mod, void *buffer)
5525 int i, j, numshadowmeshtriangles;
5526 q3dheader_t *header;
5527 float corner[3], yawradius, modelradius;
5530 mod->type = mod_brushq3;
5534 header = (q3dheader_t *)buffer;
5536 i = LittleLong(header->version);
5537 if (i != Q3BSPVERSION)
5538 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5539 if (loadmodel->isworldmodel)
5541 Cvar_SetValue("halflifebsp", false);
5542 // until we get a texture for it...
5546 mod->soundfromcenter = true;
5547 mod->TraceBox = Mod_Q3BSP_TraceBox;
5548 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5549 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5550 mod->brush.GetPVS = Mod_Q3BSP_GetPVS;
5551 mod->brush.FatPVS = Mod_Q3BSP_FatPVS;
5552 mod->brush.BoxTouchingPVS = Mod_Q3BSP_BoxTouchingPVS;
5553 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5554 mod->brush.FindNonSolidLocation = Mod_Q3BSP_FindNonSolidLocation;
5555 //mod->DrawSky = R_Q3BSP_DrawSky;
5556 mod->Draw = R_Q3BSP_Draw;
5557 mod->DrawShadowVolume = R_Q3BSP_DrawShadowVolume;
5558 mod->DrawLight = R_Q3BSP_DrawLight;
5560 mod_base = (qbyte *)header;
5562 // swap all the lumps
5563 for (i = 0;i < (int) sizeof(*header) / 4;i++)
5564 ((int *)header)[i] = LittleLong(((int *)header)[i]);
5566 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5567 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5568 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5569 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5570 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5571 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5572 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5573 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5574 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS]);
5575 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5576 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5577 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5578 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5579 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5580 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5581 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5582 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5583 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5585 // make a single combined shadow mesh to allow optimized shadow volume creation
5586 numshadowmeshtriangles = 0;
5587 for (j = 0, face = loadmodel->brushq3.data_faces;j < loadmodel->brushq3.num_faces;j++, face++)
5589 face->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5590 numshadowmeshtriangles += face->num_triangles;
5592 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5593 for (j = 0, face = loadmodel->brushq3.data_faces;j < loadmodel->brushq3.num_faces;j++, face++)
5594 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, face->data_vertex3f, NULL, NULL, NULL, NULL, face->num_triangles, face->data_element3i);
5595 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
5596 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5598 for (i = 0;i < loadmodel->brushq3.num_models;i++)
5605 // LordHavoc: only register submodels if it is the world
5606 // (prevents bsp models from replacing world submodels)
5607 if (!loadmodel->isworldmodel)
5609 // duplicate the basic information
5610 sprintf(name, "*%i", i);
5611 mod = Mod_FindName(name);
5613 strcpy(mod->name, name);
5614 // textures and memory belong to the main model
5615 mod->texturepool = NULL;
5616 mod->mempool = NULL;
5617 mod->brush.GetPVS = NULL;
5618 mod->brush.FatPVS = NULL;
5619 mod->brush.BoxTouchingPVS = NULL;
5620 mod->brush.LightPoint = NULL;
5621 mod->brush.FindNonSolidLocation = Mod_Q3BSP_FindNonSolidLocation;
5623 mod->brushq3.data_thismodel = loadmodel->brushq3.data_models + i;
5624 mod->brushq3.submodel = i;
5626 VectorCopy(mod->brushq3.data_thismodel->mins, mod->normalmins);
5627 VectorCopy(mod->brushq3.data_thismodel->maxs, mod->normalmaxs);
5628 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5629 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5630 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5631 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5632 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5633 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5634 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5635 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5636 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5637 mod->yawmins[2] = mod->normalmins[2];
5638 mod->yawmaxs[2] = mod->normalmaxs[2];
5639 mod->radius = modelradius;
5640 mod->radius2 = modelradius * modelradius;
5642 for (j = 0;j < mod->brushq3.data_thismodel->numfaces;j++)
5643 if (mod->brushq3.data_thismodel->firstface[j].texture->surfaceflags & Q3SURFACEFLAG_SKY)
5645 if (j < mod->brushq3.data_thismodel->numfaces)
5646 mod->DrawSky = R_Q3BSP_DrawSky;
5650 void Mod_IBSP_Load(model_t *mod, void *buffer)
5652 int i = LittleLong(((int *)buffer)[1]);
5653 if (i == Q3BSPVERSION)
5654 Mod_Q3BSP_Load(mod,buffer);
5655 else if (i == Q2BSPVERSION)
5656 Mod_Q2BSP_Load(mod,buffer);
5658 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i\n", i);
5661 void Mod_MAP_Load(model_t *mod, void *buffer)
5663 Host_Error("Mod_MAP_Load: not yet implemented\n");