2 Copyright (C) 1996-1997 Id Software, Inc.
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License
6 as published by the Free Software Foundation; either version 2
7 of the License, or (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
13 See the GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 // note: model_shared.c sets up r_notexture, and r_surf_notexture
31 qbyte mod_q1bsp_novis[(MAX_MAP_LEAFS + 7)/ 8];
33 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128"};
34 cvar_t halflifebsp = {0, "halflifebsp", "0"};
35 cvar_t r_novis = {0, "r_novis", "0"};
36 cvar_t r_miplightmaps = {CVAR_SAVE, "r_miplightmaps", "0"};
37 cvar_t r_lightmaprgba = {0, "r_lightmaprgba", "1"};
38 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0"};
39 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4"};
40 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "1"};
41 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024"};
42 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536"};
43 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15"};
44 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "1"};
45 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024"};
46 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225"};
47 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1"};
48 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1"};
49 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0"};
51 static void Mod_Q1BSP_Collision_Init (void);
52 void Mod_BrushInit(void)
54 // Cvar_RegisterVariable(&r_subdivide_size);
55 Cvar_RegisterVariable(&halflifebsp);
56 Cvar_RegisterVariable(&r_novis);
57 Cvar_RegisterVariable(&r_miplightmaps);
58 Cvar_RegisterVariable(&r_lightmaprgba);
59 Cvar_RegisterVariable(&r_nosurftextures);
60 Cvar_RegisterVariable(&r_subdivisions_tolerance);
61 Cvar_RegisterVariable(&r_subdivisions_mintess);
62 Cvar_RegisterVariable(&r_subdivisions_maxtess);
63 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
64 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
65 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
66 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
67 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
68 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
69 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
70 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
71 memset(mod_q1bsp_novis, 0xff, sizeof(mod_q1bsp_novis));
72 Mod_Q1BSP_Collision_Init();
75 static mleaf_t *Mod_Q1BSP_PointInLeaf(model_t *model, const vec3_t p)
82 Mod_CheckLoaded(model);
84 // LordHavoc: modified to start at first clip node,
85 // in other words: first node of the (sub)model
86 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
88 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
90 return (mleaf_t *)node;
93 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(model_t *model, const vec3_t p, qbyte *out, int outsize)
97 leaf = Mod_Q1BSP_PointInLeaf(model, p);
100 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
103 memcpy(out, leaf->ambient_sound_level, i);
109 memset(out, 0, outsize);
112 static int Mod_Q1BSP_BoxTouchingPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
114 int clusterindex, side, nodestackindex = 0;
115 mnode_t *node, *nodestack[1024];
116 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
121 // node - recurse down the BSP tree
122 side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
125 // box is on one side of plane, take that path
126 node = node->children[side];
130 // box crosses plane, take one path and remember the other
131 if (nodestackindex < 1024)
132 nodestack[nodestackindex++] = node->children[0];
133 node = node->children[1];
138 // leaf - check cluster bit
139 clusterindex = ((mleaf_t *)node)->clusterindex;
140 if (CHECKPVSBIT(pvs, clusterindex))
142 // it is visible, return immediately with the news
147 // nothing to see here, try another path we didn't take earlier
148 if (nodestackindex == 0)
150 node = nodestack[--nodestackindex];
158 typedef struct findnonsolidlocationinfo_s
166 findnonsolidlocationinfo_t;
169 extern cvar_t samelevel;
171 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
173 int i, surfnum, k, *tri, *mark;
174 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
179 for (surfnum = 0, mark = leaf->firstleafface;surfnum < leaf->numleaffaces;surfnum++, mark++)
181 surf = info->model->brushq1.surfaces + *mark;
182 if (surf->flags & SURF_SOLIDCLIP)
185 VectorCopy(surf->plane->normal, surfnormal);
186 if (surf->flags & SURF_PLANEBACK)
187 VectorNegate(surfnormal, surfnormal);
189 for (k = 0;k < surf->mesh.num_triangles;k++)
191 tri = surf->mesh.data_element3i + k * 3;
192 VectorCopy((surf->mesh.data_vertex3f + tri[0] * 3), vert[0]);
193 VectorCopy((surf->mesh.data_vertex3f + tri[1] * 3), vert[1]);
194 VectorCopy((surf->mesh.data_vertex3f + tri[2] * 3), vert[2]);
195 VectorSubtract(vert[1], vert[0], edge[0]);
196 VectorSubtract(vert[2], vert[1], edge[1]);
197 CrossProduct(edge[1], edge[0], facenormal);
198 if (facenormal[0] || facenormal[1] || facenormal[2])
200 VectorNormalize(facenormal);
202 if (VectorDistance(facenormal, surfnormal) > 0.01f)
203 Con_Printf("a2! %f %f %f != %f %f %f\n", facenormal[0], facenormal[1], facenormal[2], surfnormal[0], surfnormal[1], surfnormal[2]);
205 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
206 if (f <= info->bestdist && f >= -info->bestdist)
208 VectorSubtract(vert[0], vert[2], edge[2]);
209 VectorNormalize(edge[0]);
210 VectorNormalize(edge[1]);
211 VectorNormalize(edge[2]);
212 CrossProduct(facenormal, edge[0], edgenormal[0]);
213 CrossProduct(facenormal, edge[1], edgenormal[1]);
214 CrossProduct(facenormal, edge[2], edgenormal[2]);
216 if (samelevel.integer & 1)
217 VectorNegate(edgenormal[0], edgenormal[0]);
218 if (samelevel.integer & 2)
219 VectorNegate(edgenormal[1], edgenormal[1]);
220 if (samelevel.integer & 4)
221 VectorNegate(edgenormal[2], edgenormal[2]);
222 for (i = 0;i < 3;i++)
223 if (DotProduct(vert[0], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f
224 || DotProduct(vert[1], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f
225 || DotProduct(vert[2], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f)
226 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]);
229 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
230 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
231 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
233 // we got lucky, the center is within the face
234 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
238 if (info->bestdist > dist)
240 info->bestdist = dist;
241 VectorScale(facenormal, (info->radius - -dist), info->nudge);
246 if (info->bestdist > dist)
248 info->bestdist = dist;
249 VectorScale(facenormal, (info->radius - dist), info->nudge);
255 // check which edge or vertex the center is nearest
256 for (i = 0;i < 3;i++)
258 f = DotProduct(info->center, edge[i]);
259 if (f >= DotProduct(vert[0], edge[i])
260 && f <= DotProduct(vert[1], edge[i]))
263 VectorMA(info->center, -f, edge[i], point);
264 dist = sqrt(DotProduct(point, point));
265 if (info->bestdist > dist)
267 info->bestdist = dist;
268 VectorScale(point, (info->radius / dist), info->nudge);
270 // skip both vertex checks
271 // (both are further away than this edge)
276 // not on edge, check first vertex of edge
277 VectorSubtract(info->center, vert[i], point);
278 dist = sqrt(DotProduct(point, point));
279 if (info->bestdist > dist)
281 info->bestdist = dist;
282 VectorScale(point, (info->radius / dist), info->nudge);
294 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
298 float f = PlaneDiff(info->center, node->plane);
299 if (f >= -info->bestdist)
300 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
301 if (f <= info->bestdist)
302 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
306 if (((mleaf_t *)node)->numleaffaces)
307 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
311 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
314 findnonsolidlocationinfo_t info;
320 VectorCopy(in, info.center);
321 info.radius = radius;
326 VectorClear(info.nudge);
327 info.bestdist = radius;
328 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
329 VectorAdd(info.center, info.nudge, info.center);
331 while (info.bestdist < radius && ++i < 10);
332 VectorCopy(info.center, out);
335 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
337 switch(nativecontents)
342 return SUPERCONTENTS_SOLID;
344 return SUPERCONTENTS_WATER;
346 return SUPERCONTENTS_SLIME;
348 return SUPERCONTENTS_LAVA;
350 return SUPERCONTENTS_SKY;
355 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
357 if (supercontents & SUPERCONTENTS_SOLID)
358 return CONTENTS_SOLID;
359 if (supercontents & SUPERCONTENTS_SKY)
361 if (supercontents & SUPERCONTENTS_LAVA)
362 return CONTENTS_LAVA;
363 if (supercontents & SUPERCONTENTS_SLIME)
364 return CONTENTS_SLIME;
365 if (supercontents & SUPERCONTENTS_WATER)
366 return CONTENTS_WATER;
367 return CONTENTS_EMPTY;
372 // the hull we're tracing through
375 // the trace structure to fill in
378 // start, end, and end - start (in model space)
383 RecursiveHullCheckTraceInfo_t;
385 // 1/32 epsilon to keep floating point happy
386 #define DIST_EPSILON (0.03125)
388 #define HULLCHECKSTATE_EMPTY 0
389 #define HULLCHECKSTATE_SOLID 1
390 #define HULLCHECKSTATE_DONE 2
392 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
394 // status variables, these don't need to be saved on the stack when
395 // recursing... but are because this should be thread-safe
396 // (note: tracing against a bbox is not thread-safe, yet)
401 // variables that need to be stored on the stack when recursing
406 // LordHavoc: a goto! everyone flee in terror... :)
411 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
412 if (!t->trace->startfound)
414 t->trace->startfound = true;
415 t->trace->startsupercontents |= num;
417 if (num & SUPERCONTENTS_LIQUIDSMASK)
418 t->trace->inwater = true;
420 t->trace->inopen = true;
421 if (num & t->trace->hitsupercontentsmask)
423 // if the first leaf is solid, set startsolid
424 if (t->trace->allsolid)
425 t->trace->startsolid = true;
426 #if COLLISIONPARANOID >= 3
429 return HULLCHECKSTATE_SOLID;
433 t->trace->allsolid = false;
434 #if COLLISIONPARANOID >= 3
437 return HULLCHECKSTATE_EMPTY;
441 // find the point distances
442 node = t->hull->clipnodes + num;
444 plane = t->hull->planes + node->planenum;
447 t1 = p1[plane->type] - plane->dist;
448 t2 = p2[plane->type] - plane->dist;
452 t1 = DotProduct (plane->normal, p1) - plane->dist;
453 t2 = DotProduct (plane->normal, p2) - plane->dist;
460 #if COLLISIONPARANOID >= 3
463 num = node->children[1];
472 #if COLLISIONPARANOID >= 3
475 num = node->children[0];
481 // the line intersects, find intersection point
482 // LordHavoc: this uses the original trace for maximum accuracy
483 #if COLLISIONPARANOID >= 3
488 t1 = t->start[plane->type] - plane->dist;
489 t2 = t->end[plane->type] - plane->dist;
493 t1 = DotProduct (plane->normal, t->start) - plane->dist;
494 t2 = DotProduct (plane->normal, t->end) - plane->dist;
497 midf = t1 / (t1 - t2);
498 midf = bound(p1f, midf, p2f);
499 VectorMA(t->start, midf, t->dist, mid);
501 // recurse both sides, front side first
502 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
503 // if this side is not empty, return what it is (solid or done)
504 if (ret != HULLCHECKSTATE_EMPTY)
507 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
508 // if other side is not solid, return what it is (empty or done)
509 if (ret != HULLCHECKSTATE_SOLID)
512 // front is air and back is solid, this is the impact point...
515 t->trace->plane.dist = -plane->dist;
516 VectorNegate (plane->normal, t->trace->plane.normal);
520 t->trace->plane.dist = plane->dist;
521 VectorCopy (plane->normal, t->trace->plane.normal);
524 // calculate the true fraction
525 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
526 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
527 midf = t1 / (t1 - t2);
528 t->trace->realfraction = bound(0, midf, 1);
530 // calculate the return fraction which is nudged off the surface a bit
531 midf = (t1 - DIST_EPSILON) / (t1 - t2);
532 t->trace->fraction = bound(0, midf, 1);
534 #if COLLISIONPARANOID >= 3
537 return HULLCHECKSTATE_DONE;
540 #if COLLISIONPARANOID < 2
541 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
544 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];
545 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
546 t->trace->startsupercontents |= num;
547 if (num & SUPERCONTENTS_LIQUIDSMASK)
548 t->trace->inwater = true;
550 t->trace->inopen = true;
551 if (num & t->trace->hitsupercontentsmask)
553 t->trace->allsolid = t->trace->startsolid = true;
554 return HULLCHECKSTATE_SOLID;
558 t->trace->allsolid = t->trace->startsolid = false;
559 return HULLCHECKSTATE_EMPTY;
564 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)
566 // this function currently only supports same size start and end
568 RecursiveHullCheckTraceInfo_t rhc;
570 memset(&rhc, 0, sizeof(rhc));
571 memset(trace, 0, sizeof(trace_t));
573 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
574 rhc.trace->fraction = 1;
575 rhc.trace->realfraction = 1;
576 rhc.trace->allsolid = true;
577 VectorSubtract(boxstartmaxs, boxstartmins, boxsize);
579 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
580 else if (model->brush.ishlbsp)
582 // LordHavoc: this has to have a minor tolerance (the .1) because of
583 // minor float precision errors from the box being transformed around
584 if (boxsize[0] < 32.1)
586 if (boxsize[2] < 54) // pick the nearest of 36 or 72
587 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
589 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
592 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
596 // LordHavoc: this has to have a minor tolerance (the .1) because of
597 // minor float precision errors from the box being transformed around
598 if (boxsize[0] < 32.1)
599 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
601 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
603 VectorSubtract(boxstartmins, rhc.hull->clip_mins, rhc.start);
604 VectorSubtract(boxendmins, rhc.hull->clip_mins, rhc.end);
605 VectorSubtract(rhc.end, rhc.start, rhc.dist);
606 #if COLLISIONPARANOID >= 2
607 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]);
608 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
611 if (DotProduct(rhc.dist, rhc.dist))
612 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
614 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
618 static hull_t box_hull;
619 static dclipnode_t box_clipnodes[6];
620 static mplane_t box_planes[6];
622 static void Mod_Q1BSP_Collision_Init (void)
627 //Set up the planes and clipnodes so that the six floats of a bounding box
628 //can just be stored out and get a proper hull_t structure.
630 box_hull.clipnodes = box_clipnodes;
631 box_hull.planes = box_planes;
632 box_hull.firstclipnode = 0;
633 box_hull.lastclipnode = 5;
635 for (i = 0;i < 6;i++)
637 box_clipnodes[i].planenum = i;
641 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
643 box_clipnodes[i].children[side^1] = i + 1;
645 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
647 box_planes[i].type = i>>1;
648 box_planes[i].normal[i>>1] = 1;
652 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)
656 colplanef_t cbox_planes[6];
657 cbox.supercontents = boxsupercontents;
660 cbox.numtriangles = 0;
661 cbox.planes = cbox_planes;
663 cbox.elements = NULL;
671 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];
672 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];
673 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];
674 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];
675 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];
676 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];
677 memset(trace, 0, sizeof(trace_t));
678 trace->hitsupercontentsmask = hitsupercontentsmask;
680 trace->realfraction = 1;
681 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
683 RecursiveHullCheckTraceInfo_t rhc;
684 // fill in a default trace
685 memset(&rhc, 0, sizeof(rhc));
686 memset(trace, 0, sizeof(trace_t));
687 //To keep everything totally uniform, bounding boxes are turned into small
688 //BSP trees instead of being compared directly.
689 // create a temp hull from bounding box sizes
690 box_planes[0].dist = cmaxs[0] - mins[0];
691 box_planes[1].dist = cmins[0] - maxs[0];
692 box_planes[2].dist = cmaxs[1] - mins[1];
693 box_planes[3].dist = cmins[1] - maxs[1];
694 box_planes[4].dist = cmaxs[2] - mins[2];
695 box_planes[5].dist = cmins[2] - maxs[2];
696 #if COLLISIONPARANOID >= 3
697 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]);
699 // trace a line through the generated clipping hull
700 //rhc.boxsupercontents = boxsupercontents;
701 rhc.hull = &box_hull;
703 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
704 rhc.trace->fraction = 1;
705 rhc.trace->realfraction = 1;
706 rhc.trace->allsolid = true;
707 VectorCopy(start, rhc.start);
708 VectorCopy(end, rhc.end);
709 VectorSubtract(rhc.end, rhc.start, rhc.dist);
710 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
711 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
712 if (rhc.trace->startsupercontents)
713 rhc.trace->startsupercontents = boxsupercontents;
717 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)
719 int side, distz = endz - startz;
725 return false; // didn't hit anything
727 switch (node->plane->type)
730 node = node->children[x < node->plane->dist];
733 node = node->children[y < node->plane->dist];
736 side = startz < node->plane->dist;
737 if ((endz < node->plane->dist) == side)
739 node = node->children[side];
742 // found an intersection
743 mid = node->plane->dist;
746 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
747 front += startz * node->plane->normal[2];
748 back += endz * node->plane->normal[2];
749 side = front < node->plane->dist;
750 if ((back < node->plane->dist) == side)
752 node = node->children[side];
755 // found an intersection
756 mid = startz + distz * (front - node->plane->dist) / (front - back);
760 // go down front side
761 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
762 return true; // hit something
765 // check for impact on this node
766 if (node->numsurfaces)
771 surf = r_refdef.worldmodel->brushq1.surfaces + node->firstsurface;
772 for (i = 0;i < node->numsurfaces;i++, surf++)
774 if (!(surf->flags & SURF_LIGHTMAP) || !surf->samples)
775 continue; // no lightmaps
777 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];
778 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];
780 if (ds >= 0 && ds < surf->extents[0] && dt >= 0 && dt < surf->extents[1])
783 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;
784 lmwidth = ((surf->extents[0]>>4)+1);
785 lmheight = ((surf->extents[1]>>4)+1);
786 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
787 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
789 lightmap = surf->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
791 for (maps = 0;maps < MAXLIGHTMAPS && surf->styles[maps] != 255;maps++)
793 scale = d_lightstylevalue[surf->styles[maps]];
794 r00 += lightmap[ 0] * scale;g00 += lightmap[ 1] * scale;b00 += lightmap[ 2] * scale;
795 r01 += lightmap[ 3] * scale;g01 += lightmap[ 4] * scale;b01 += lightmap[ 5] * scale;
796 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
797 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
802 LordHavoc: here's the readable version of the interpolation
803 code, not quite as easy for the compiler to optimize...
805 dsfrac is the X position in the lightmap pixel, * 16
806 dtfrac is the Y position in the lightmap pixel, * 16
807 r00 is top left corner, r01 is top right corner
808 r10 is bottom left corner, r11 is bottom right corner
809 g and b are the same layout.
810 r0 and r1 are the top and bottom intermediate results
812 first we interpolate the top two points, to get the top
815 r0 = (((r01-r00) * dsfrac) >> 4) + r00;
816 g0 = (((g01-g00) * dsfrac) >> 4) + g00;
817 b0 = (((b01-b00) * dsfrac) >> 4) + b00;
819 then we interpolate the bottom two points, to get the
822 r1 = (((r11-r10) * dsfrac) >> 4) + r10;
823 g1 = (((g11-g10) * dsfrac) >> 4) + g10;
824 b1 = (((b11-b10) * dsfrac) >> 4) + b10;
826 then we interpolate the top and bottom samples to get the
827 middle sample (the one which was requested)
829 r = (((r1-r0) * dtfrac) >> 4) + r0;
830 g = (((g1-g0) * dtfrac) >> 4) + g0;
831 b = (((b1-b0) * dtfrac) >> 4) + b0;
834 ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
835 ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
836 ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
837 return true; // success
843 node = node->children[side ^ 1];
845 distz = endz - startz;
850 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
852 Mod_Q1BSP_LightPoint_RecursiveBSPNode(ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2], p[2] - 65536);
855 static void Mod_Q1BSP_DecompressVis(const qbyte *in, const qbyte *inend, qbyte *out, qbyte *outend)
858 qbyte *outstart = out;
863 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
873 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
876 for (c = *in++;c > 0;c--)
880 Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
893 A sky texture is 256*128, with the right side being a masked overlay
896 void R_Q1BSP_LoadSplitSky (qbyte *src, int width, int height, int bytesperpixel)
899 unsigned solidpixels[128*128], alphapixels[128*128];
901 // if sky isn't the right size, just use it as a solid layer
902 if (width != 256 || height != 128)
904 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", width, height, src, bytesperpixel == 4 ? TEXTYPE_RGBA : TEXTYPE_PALETTE, TEXF_PRECACHE, bytesperpixel == 1 ? palette_complete : NULL);
905 loadmodel->brush.alphaskytexture = NULL;;
909 if (bytesperpixel == 4)
911 for (i = 0;i < 128;i++)
913 for (j = 0;j < 128;j++)
915 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
916 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
922 // make an average value for the back to avoid
923 // a fringe on the top level
932 for (i = 0;i < 128;i++)
934 for (j = 0;j < 128;j++)
936 rgba.i = palette_complete[src[i*256 + j + 128]];
942 rgba.b[0] = r/(128*128);
943 rgba.b[1] = g/(128*128);
944 rgba.b[2] = b/(128*128);
946 for (i = 0;i < 128;i++)
948 for (j = 0;j < 128;j++)
950 solidpixels[(i*128) + j] = palette_complete[src[i*256 + j + 128]];
951 alphapixels[(i*128) + j] = (p = src[i*256 + j]) ? palette_complete[p] : rgba.i;
956 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (qbyte *) solidpixels, TEXTYPE_RGBA, TEXF_PRECACHE, NULL);
957 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (qbyte *) alphapixels, TEXTYPE_RGBA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
960 static void Mod_Q1BSP_LoadTextures(lump_t *l)
962 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
964 texture_t *tx, *tx2, *anims[10], *altanims[10];
966 qbyte *data, *mtdata;
969 loadmodel->brushq1.textures = NULL;
971 // add two slots for notexture walls and notexture liquids
974 m = (dmiptexlump_t *)(mod_base + l->fileofs);
975 m->nummiptex = LittleLong (m->nummiptex);
976 loadmodel->brushq1.numtextures = m->nummiptex + 2;
981 loadmodel->brushq1.numtextures = 2;
984 loadmodel->brushq1.textures = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numtextures * sizeof(texture_t));
986 // fill out all slots with notexture
987 for (i = 0, tx = loadmodel->brushq1.textures;i < loadmodel->brushq1.numtextures;i++, tx++)
990 strcpy(tx->name, "NO TEXTURE FOUND");
993 tx->skin.base = r_notexture;
994 if (i == loadmodel->brushq1.numtextures - 1)
995 tx->flags = SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
997 tx->flags = SURF_LIGHTMAP | SURF_SOLIDCLIP;
998 tx->currentframe = tx;
1004 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1006 // LordHavoc: mostly rewritten map texture loader
1007 for (i = 0;i < m->nummiptex;i++)
1009 dofs[i] = LittleLong(dofs[i]);
1010 if (dofs[i] == -1 || r_nosurftextures.integer)
1012 dmiptex = (miptex_t *)((qbyte *)m + dofs[i]);
1014 // make sure name is no more than 15 characters
1015 for (j = 0;dmiptex->name[j] && j < 15;j++)
1016 name[j] = dmiptex->name[j];
1019 mtwidth = LittleLong(dmiptex->width);
1020 mtheight = LittleLong(dmiptex->height);
1022 j = LittleLong(dmiptex->offsets[0]);
1026 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1028 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1031 mtdata = (qbyte *)dmiptex + j;
1034 if ((mtwidth & 15) || (mtheight & 15))
1035 Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1037 // LordHavoc: force all names to lowercase
1038 for (j = 0;name[j];j++)
1039 if (name[j] >= 'A' && name[j] <= 'Z')
1040 name[j] += 'a' - 'A';
1042 tx = loadmodel->brushq1.textures + i;
1043 strcpy(tx->name, name);
1044 tx->width = mtwidth;
1045 tx->height = mtheight;
1049 sprintf(tx->name, "unnamed%i", i);
1050 Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1053 // LordHavoc: HL sky textures are entirely different than quake
1054 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1056 if (loadmodel->isworldmodel)
1058 data = loadimagepixels(tx->name, false, 0, 0);
1061 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1064 else if (mtdata != NULL)
1065 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1070 if (!Mod_LoadSkinFrame(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true, true))
1072 // did not find external texture, load it from the bsp or wad3
1073 if (loadmodel->brush.ishlbsp)
1075 // internal texture overrides wad
1076 qbyte *pixels, *freepixels, *fogpixels;
1077 pixels = freepixels = NULL;
1079 pixels = W_ConvertWAD3Texture(dmiptex);
1081 pixels = freepixels = W_GetTexture(tx->name);
1084 tx->width = image_width;
1085 tx->height = image_height;
1086 tx->skin.base = tx->skin.merged = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, NULL);
1087 if (Image_CheckAlpha(pixels, image_width * image_height, true))
1089 fogpixels = Mem_Alloc(tempmempool, image_width * image_height * 4);
1090 for (j = 0;j < image_width * image_height * 4;j += 4)
1092 fogpixels[j + 0] = 255;
1093 fogpixels[j + 1] = 255;
1094 fogpixels[j + 2] = 255;
1095 fogpixels[j + 3] = pixels[j + 3];
1097 tx->skin.fog = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, NULL);
1098 Mem_Free(fogpixels);
1102 Mem_Free(freepixels);
1104 else if (mtdata) // texture included
1105 Mod_LoadSkinFrame_Internal(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_PICMIP, false, true, tx->name[0] != '*' && r_fullbrights.integer, mtdata, tx->width, tx->height);
1108 if (tx->skin.base == NULL)
1113 tx->skin.base = r_notexture;
1116 if (tx->name[0] == '*')
1118 // turb does not block movement
1119 tx->flags = SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
1120 // LordHavoc: some turbulent textures should be fullbright and solid
1121 if (!strncmp(tx->name,"*lava",5)
1122 || !strncmp(tx->name,"*teleport",9)
1123 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1124 tx->flags |= SURF_DRAWFULLBRIGHT | SURF_DRAWNOALPHA;
1126 tx->flags |= SURF_WATERALPHA;
1128 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1129 tx->flags = SURF_DRAWSKY | SURF_SOLIDCLIP;
1131 tx->flags = SURF_LIGHTMAP | SURF_SOLIDCLIP;
1133 // start out with no animation
1134 tx->currentframe = tx;
1137 // sequence the animations
1138 for (i = 0;i < m->nummiptex;i++)
1140 tx = loadmodel->brushq1.textures + i;
1141 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1143 if (tx->anim_total[0] || tx->anim_total[1])
1144 continue; // already sequenced
1146 // find the number of frames in the animation
1147 memset(anims, 0, sizeof(anims));
1148 memset(altanims, 0, sizeof(altanims));
1150 for (j = i;j < m->nummiptex;j++)
1152 tx2 = loadmodel->brushq1.textures + j;
1153 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1157 if (num >= '0' && num <= '9')
1158 anims[num - '0'] = tx2;
1159 else if (num >= 'a' && num <= 'j')
1160 altanims[num - 'a'] = tx2;
1162 Con_Printf("Bad animating texture %s\n", tx->name);
1166 for (j = 0;j < 10;j++)
1173 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1176 for (j = 0;j < max;j++)
1180 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1184 for (j = 0;j < altmax;j++)
1188 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1197 // if there is no alternate animation, duplicate the primary
1198 // animation into the alternate
1200 for (k = 0;k < 10;k++)
1201 altanims[k] = anims[k];
1204 // link together the primary animation
1205 for (j = 0;j < max;j++)
1208 tx2->animated = true;
1209 tx2->anim_total[0] = max;
1210 tx2->anim_total[1] = altmax;
1211 for (k = 0;k < 10;k++)
1213 tx2->anim_frames[0][k] = anims[k];
1214 tx2->anim_frames[1][k] = altanims[k];
1218 // if there really is an alternate anim...
1219 if (anims[0] != altanims[0])
1221 // link together the alternate animation
1222 for (j = 0;j < altmax;j++)
1225 tx2->animated = true;
1226 // the primary/alternate are reversed here
1227 tx2->anim_total[0] = altmax;
1228 tx2->anim_total[1] = max;
1229 for (k = 0;k < 10;k++)
1231 tx2->anim_frames[0][k] = altanims[k];
1232 tx2->anim_frames[1][k] = anims[k];
1239 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1242 qbyte *in, *out, *data, d;
1243 char litfilename[1024];
1244 loadmodel->brushq1.lightdata = NULL;
1245 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1247 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen);
1248 for (i=0; i<l->filelen; i++)
1249 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1251 else // LordHavoc: bsp version 29 (normal white lighting)
1253 // LordHavoc: hope is not lost yet, check for a .lit file to load
1254 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1255 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1256 strlcat (litfilename, ".lit", sizeof (litfilename));
1257 data = (qbyte*) FS_LoadFile(litfilename, tempmempool, false);
1260 if (fs_filesize > 8 && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1262 i = LittleLong(((int *)data)[1]);
1265 Con_DPrintf("loaded %s\n", litfilename);
1266 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, fs_filesize - 8);
1267 memcpy(loadmodel->brushq1.lightdata, data + 8, fs_filesize - 8);
1273 Con_Printf("Unknown .lit file version (%d)\n", i);
1279 if (fs_filesize == 8)
1280 Con_Print("Empty .lit file, ignoring\n");
1282 Con_Print("Corrupt .lit file (old version?), ignoring\n");
1286 // LordHavoc: oh well, expand the white lighting data
1289 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen*3);
1290 in = loadmodel->brushq1.lightdata + l->filelen*2; // place the file at the end, so it will not be overwritten until the very last write
1291 out = loadmodel->brushq1.lightdata;
1292 memcpy(in, mod_base + l->fileofs, l->filelen);
1293 for (i = 0;i < l->filelen;i++)
1303 static void Mod_Q1BSP_LoadLightList(void)
1305 int a, n, numlights;
1306 char tempchar, *s, *t, *lightsstring, lightsfilename[1024];
1309 strlcpy (lightsfilename, loadmodel->name, sizeof (lightsfilename));
1310 FS_StripExtension (lightsfilename, lightsfilename, sizeof(lightsfilename));
1311 strlcat (lightsfilename, ".lights", sizeof (lightsfilename));
1312 s = lightsstring = (char *) FS_LoadFile(lightsfilename, tempmempool, false);
1318 while (*s && *s != '\n' && *s != '\r')
1322 Mem_Free(lightsstring);
1323 Con_Printf("lights file must end with a newline\n");
1329 loadmodel->brushq1.lights = Mem_Alloc(loadmodel->mempool, numlights * sizeof(mlight_t));
1332 while (*s && n < numlights)
1335 while (*s && *s != '\n' && *s != '\r')
1339 Con_Printf("misparsed lights file!\n");
1342 e = loadmodel->brushq1.lights + n;
1345 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);
1349 Con_Printf("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);
1359 Con_Printf("misparsed lights file!\n");
1360 loadmodel->brushq1.numlights = numlights;
1361 Mem_Free(lightsstring);
1365 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1367 loadmodel->brushq1.num_compressedpvs = 0;
1368 loadmodel->brushq1.data_compressedpvs = NULL;
1371 loadmodel->brushq1.num_compressedpvs = l->filelen;
1372 loadmodel->brushq1.data_compressedpvs = Mem_Alloc(loadmodel->mempool, l->filelen);
1373 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1376 // used only for HalfLife maps
1377 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1379 char key[128], value[4096];
1384 if (!COM_ParseToken(&data, false))
1386 if (com_token[0] != '{')
1390 if (!COM_ParseToken(&data, false))
1392 if (com_token[0] == '}')
1393 break; // end of worldspawn
1394 if (com_token[0] == '_')
1395 strcpy(key, com_token + 1);
1397 strcpy(key, com_token);
1398 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1399 key[strlen(key)-1] = 0;
1400 if (!COM_ParseToken(&data, false))
1402 strcpy(value, com_token);
1403 if (!strcmp("wad", key)) // for HalfLife maps
1405 if (loadmodel->brush.ishlbsp)
1408 for (i = 0;i < 4096;i++)
1409 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1415 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1416 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1418 else if (value[i] == ';' || value[i] == 0)
1422 strcpy(wadname, "textures/");
1423 strcat(wadname, &value[j]);
1424 W_LoadTextureWadFile(wadname, false);
1436 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1438 loadmodel->brush.entities = NULL;
1441 loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
1442 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1443 if (loadmodel->brush.ishlbsp)
1444 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1448 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1454 in = (void *)(mod_base + l->fileofs);
1455 if (l->filelen % sizeof(*in))
1456 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1457 count = l->filelen / sizeof(*in);
1458 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1460 loadmodel->brushq1.vertexes = out;
1461 loadmodel->brushq1.numvertexes = count;
1463 for ( i=0 ; i<count ; i++, in++, out++)
1465 out->position[0] = LittleFloat(in->point[0]);
1466 out->position[1] = LittleFloat(in->point[1]);
1467 out->position[2] = LittleFloat(in->point[2]);
1471 static void Mod_Q1BSP_LoadSubmodels(lump_t *l)
1477 in = (void *)(mod_base + l->fileofs);
1478 if (l->filelen % sizeof(*in))
1479 Host_Error("Mod_Q1BSP_LoadSubmodels: 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.submodels = out;
1484 loadmodel->brush.numsubmodels = count;
1486 for ( i=0 ; i<count ; i++, in++, out++)
1488 for (j=0 ; j<3 ; j++)
1490 // spread the mins / maxs by a pixel
1491 out->mins[j] = LittleFloat(in->mins[j]) - 1;
1492 out->maxs[j] = LittleFloat(in->maxs[j]) + 1;
1493 out->origin[j] = LittleFloat(in->origin[j]);
1495 for (j=0 ; j<MAX_MAP_HULLS ; j++)
1496 out->headnode[j] = LittleLong(in->headnode[j]);
1497 out->visleafs = LittleLong(in->visleafs);
1498 out->firstface = LittleLong(in->firstface);
1499 out->numfaces = LittleLong(in->numfaces);
1503 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1509 in = (void *)(mod_base + l->fileofs);
1510 if (l->filelen % sizeof(*in))
1511 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1512 count = l->filelen / sizeof(*in);
1513 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1515 loadmodel->brushq1.edges = out;
1516 loadmodel->brushq1.numedges = count;
1518 for ( i=0 ; i<count ; i++, in++, out++)
1520 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1521 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1525 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1529 int i, j, k, count, miptex;
1531 in = (void *)(mod_base + l->fileofs);
1532 if (l->filelen % sizeof(*in))
1533 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1534 count = l->filelen / sizeof(*in);
1535 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1537 loadmodel->brushq1.texinfo = out;
1538 loadmodel->brushq1.numtexinfo = count;
1540 for (i = 0;i < count;i++, in++, out++)
1542 for (k = 0;k < 2;k++)
1543 for (j = 0;j < 4;j++)
1544 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1546 miptex = LittleLong(in->miptex);
1547 out->flags = LittleLong(in->flags);
1549 out->texture = NULL;
1550 if (loadmodel->brushq1.textures)
1552 if ((unsigned int) miptex >= (unsigned int) loadmodel->brushq1.numtextures)
1553 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->brushq1.numtextures);
1555 out->texture = loadmodel->brushq1.textures + miptex;
1557 if (out->flags & TEX_SPECIAL)
1559 // if texture chosen is NULL or the shader needs a lightmap,
1560 // force to notexture water shader
1561 if (out->texture == NULL || out->texture->flags & SURF_LIGHTMAP)
1562 out->texture = loadmodel->brushq1.textures + (loadmodel->brushq1.numtextures - 1);
1566 // if texture chosen is NULL, force to notexture
1567 if (out->texture == NULL)
1568 out->texture = loadmodel->brushq1.textures + (loadmodel->brushq1.numtextures - 2);
1574 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1579 mins[0] = mins[1] = mins[2] = 9999;
1580 maxs[0] = maxs[1] = maxs[2] = -9999;
1582 for (i = 0;i < numverts;i++)
1584 for (j = 0;j < 3;j++, v++)
1594 #define MAX_SUBDIVPOLYTRIANGLES 4096
1595 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1597 static int subdivpolyverts, subdivpolytriangles;
1598 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1599 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1601 static int subdivpolylookupvert(vec3_t v)
1604 for (i = 0;i < subdivpolyverts;i++)
1605 if (subdivpolyvert[i][0] == v[0]
1606 && subdivpolyvert[i][1] == v[1]
1607 && subdivpolyvert[i][2] == v[2])
1609 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1610 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1611 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1612 return subdivpolyverts++;
1615 static void SubdividePolygon(int numverts, float *verts)
1617 int i, i1, i2, i3, f, b, c, p;
1618 vec3_t mins, maxs, front[256], back[256];
1619 float m, *pv, *cv, dist[256], frac;
1622 Host_Error("SubdividePolygon: ran out of verts in buffer");
1624 BoundPoly(numverts, verts, mins, maxs);
1626 for (i = 0;i < 3;i++)
1628 m = (mins[i] + maxs[i]) * 0.5;
1629 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1630 if (maxs[i] - m < 8)
1632 if (m - mins[i] < 8)
1636 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1637 dist[c] = cv[i] - m;
1640 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1644 VectorCopy(pv, front[f]);
1649 VectorCopy(pv, back[b]);
1652 if (dist[p] == 0 || dist[c] == 0)
1654 if ((dist[p] > 0) != (dist[c] > 0) )
1657 frac = dist[p] / (dist[p] - dist[c]);
1658 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1659 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1660 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1666 SubdividePolygon(f, front[0]);
1667 SubdividePolygon(b, back[0]);
1671 i1 = subdivpolylookupvert(verts);
1672 i2 = subdivpolylookupvert(verts + 3);
1673 for (i = 2;i < numverts;i++)
1675 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1677 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1681 i3 = subdivpolylookupvert(verts + i * 3);
1682 subdivpolyindex[subdivpolytriangles][0] = i1;
1683 subdivpolyindex[subdivpolytriangles][1] = i2;
1684 subdivpolyindex[subdivpolytriangles][2] = i3;
1686 subdivpolytriangles++;
1690 //Breaks a polygon up along axial 64 unit
1691 //boundaries so that turbulent and sky warps
1692 //can be done reasonably.
1693 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surf)
1699 subdivpolytriangles = 0;
1700 subdivpolyverts = 0;
1701 SubdividePolygon(surf->poly_numverts, surf->poly_verts);
1702 if (subdivpolytriangles < 1)
1703 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?\n");
1705 surf->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
1706 mesh->num_vertices = subdivpolyverts;
1707 mesh->num_triangles = subdivpolytriangles;
1708 mesh->vertex = (surfvertex_t *)(mesh + 1);
1709 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
1710 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
1712 for (i = 0;i < mesh->num_triangles;i++)
1713 for (j = 0;j < 3;j++)
1714 mesh->index[i*3+j] = subdivpolyindex[i][j];
1716 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
1718 VectorCopy(subdivpolyvert[i], v->v);
1719 v->st[0] = DotProduct(v->v, surf->texinfo->vecs[0]);
1720 v->st[1] = DotProduct(v->v, surf->texinfo->vecs[1]);
1725 static void Mod_Q1BSP_GenerateSurfacePolygon(msurface_t *surf, int firstedge, int numedges)
1728 float *vec, *vert, mins[3], maxs[3], val, *v;
1731 // convert edges back to a normal polygon
1732 surf->poly_numverts = numedges;
1733 vert = surf->poly_verts = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * numedges);
1734 for (i = 0;i < numedges;i++)
1736 lindex = loadmodel->brushq1.surfedges[firstedge + i];
1738 vec = loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position;
1740 vec = loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position;
1741 VectorCopy(vec, vert);
1745 // calculate polygon bounding box and center
1746 vert = surf->poly_verts;
1747 VectorCopy(vert, mins);
1748 VectorCopy(vert, maxs);
1750 for (i = 1;i < surf->poly_numverts;i++, vert += 3)
1752 if (mins[0] > vert[0]) mins[0] = vert[0];if (maxs[0] < vert[0]) maxs[0] = vert[0];
1753 if (mins[1] > vert[1]) mins[1] = vert[1];if (maxs[1] < vert[1]) maxs[1] = vert[1];
1754 if (mins[2] > vert[2]) mins[2] = vert[2];if (maxs[2] < vert[2]) maxs[2] = vert[2];
1756 VectorCopy(mins, surf->poly_mins);
1757 VectorCopy(maxs, surf->poly_maxs);
1758 surf->poly_center[0] = (mins[0] + maxs[0]) * 0.5f;
1759 surf->poly_center[1] = (mins[1] + maxs[1]) * 0.5f;
1760 surf->poly_center[2] = (mins[2] + maxs[2]) * 0.5f;
1762 // generate surface extents information
1763 tex = surf->texinfo;
1764 mins[0] = maxs[0] = DotProduct(surf->poly_verts, tex->vecs[0]) + tex->vecs[0][3];
1765 mins[1] = maxs[1] = DotProduct(surf->poly_verts, tex->vecs[1]) + tex->vecs[1][3];
1766 for (i = 1, v = surf->poly_verts + 3;i < surf->poly_numverts;i++, v += 3)
1768 for (j = 0;j < 2;j++)
1770 val = DotProduct(v, tex->vecs[j]) + tex->vecs[j][3];
1777 for (i = 0;i < 2;i++)
1779 surf->texturemins[i] = (int) floor(mins[i] / 16) * 16;
1780 surf->extents[i] = (int) ceil(maxs[i] / 16) * 16 - surf->texturemins[i];
1784 static void Mod_Q1BSP_LoadFaces(lump_t *l)
1788 int i, count, surfnum, planenum, ssize, tsize, firstedge, numedges, totalverts, totaltris, totalmeshes;
1792 in = (void *)(mod_base + l->fileofs);
1793 if (l->filelen % sizeof(*in))
1794 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
1795 count = l->filelen / sizeof(*in);
1796 loadmodel->brushq1.surfaces = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
1798 loadmodel->brushq1.numsurfaces = count;
1800 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++)
1802 surf->number = surfnum;
1803 // FIXME: validate edges, texinfo, etc?
1804 firstedge = LittleLong(in->firstedge);
1805 numedges = LittleShort(in->numedges);
1806 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)
1807 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)\n", firstedge, numedges, loadmodel->brushq1.numsurfedges);
1808 i = LittleShort(in->texinfo);
1809 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
1810 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)\n", i, loadmodel->brushq1.numtexinfo);
1811 surf->texinfo = loadmodel->brushq1.texinfo + i;
1812 surf->flags = surf->texinfo->texture->flags;
1814 planenum = LittleShort(in->planenum);
1815 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
1816 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)\n", planenum, loadmodel->brush.num_planes);
1818 if (LittleShort(in->side))
1819 surf->flags |= SURF_PLANEBACK;
1821 surf->plane = loadmodel->brush.data_planes + planenum;
1823 // clear lightmap (filled in later)
1824 surf->lightmaptexture = NULL;
1826 // force lightmap upload on first time seeing the surface
1827 surf->cached_dlight = true;
1829 Mod_Q1BSP_GenerateSurfacePolygon(surf, firstedge, numedges);
1831 ssize = (surf->extents[0] >> 4) + 1;
1832 tsize = (surf->extents[1] >> 4) + 1;
1835 for (i = 0;i < MAXLIGHTMAPS;i++)
1836 surf->styles[i] = in->styles[i];
1837 i = LittleLong(in->lightofs);
1839 surf->samples = NULL;
1840 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
1841 surf->samples = loadmodel->brushq1.lightdata + i;
1842 else // LordHavoc: white lighting (bsp version 29)
1843 surf->samples = loadmodel->brushq1.lightdata + (i * 3);
1845 if (surf->texinfo->texture->flags & SURF_LIGHTMAP)
1847 if ((surf->extents[0] >> 4) + 1 > (256) || (surf->extents[1] >> 4) + 1 > (256))
1848 Host_Error("Bad surface extents");
1849 // stainmap for permanent marks on walls
1850 surf->stainsamples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
1852 memset(surf->stainsamples, 255, ssize * tsize * 3);
1856 // TODO: split up into multiple meshes as needed to avoid exceeding 65536
1858 loadmodel->nummeshes = 1;
1859 loadmodel->meshlist = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *));
1860 loadmodel->meshlist[0] = Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, 0, 0, true, true, false);
1862 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++)
1865 mesh->num_vertices = surf->poly_numverts;
1866 mesh->num_triangles = surf->poly_numverts - 2;
1867 mesh->data_vertex3f = loadmodel->meshlist[0]->data_vertex3f + totalverts * 3;
1868 mesh->data_texcoordtexture2f = loadmodel->meshlist[0]->data_texcoordtexture2f + totalverts * 2;
1869 mesh->data_texcoordlightmap2f = loadmodel->meshlist[0]->data_texcoordlightmap2f + totalverts * 2;
1870 mesh->data_texcoorddetail2f = loadmodel->meshlist[0]->data_texcoorddetail2f + totalverts * 2;
1871 mesh->data_svector3f = loadmodel->meshlist[0]->data_svector3f + totalverts * 3;
1872 mesh->data_tvector3f = loadmodel->meshlist[0]->data_tvector3f + totalverts * 3;
1873 mesh->data_normal3f = loadmodel->meshlist[0]->data_normal3f + totalverts * 3;
1874 mesh->data_lightmapoffsets = loadmodel->meshlist[0]->data_lightmapoffsets + totalverts;
1875 mesh->data_element3i = loadmodel->meshlist[0]->data_element3i + totaltris * 3;
1876 mesh->data_neighbor3i = loadmodel->meshlist[0]->data_neighbor3i + totaltris * 3;
1878 surf->lightmaptexturestride = 0;
1879 surf->lightmaptexture = NULL;
1881 for (i = 0;i < mesh->num_vertices;i++)
1883 mesh->data_vertex3f[i * 3 + 0] = surf->poly_verts[i * 3 + 0];
1884 mesh->data_vertex3f[i * 3 + 1] = surf->poly_verts[i * 3 + 1];
1885 mesh->data_vertex3f[i * 3 + 2] = surf->poly_verts[i * 3 + 2];
1886 s = DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3];
1887 t = DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3];
1888 mesh->data_texcoordtexture2f[i * 2 + 0] = s / surf->texinfo->texture->width;
1889 mesh->data_texcoordtexture2f[i * 2 + 1] = t / surf->texinfo->texture->height;
1890 mesh->data_texcoorddetail2f[i * 2 + 0] = s * (1.0f / 16.0f);
1891 mesh->data_texcoorddetail2f[i * 2 + 1] = t * (1.0f / 16.0f);
1892 mesh->data_texcoordlightmap2f[i * 2 + 0] = 0;
1893 mesh->data_texcoordlightmap2f[i * 2 + 1] = 0;
1894 mesh->data_lightmapoffsets[i] = 0;
1897 for (i = 0;i < mesh->num_triangles;i++)
1899 mesh->data_element3i[i * 3 + 0] = 0;
1900 mesh->data_element3i[i * 3 + 1] = i + 1;
1901 mesh->data_element3i[i * 3 + 2] = i + 2;
1904 Mod_BuildTriangleNeighbors(mesh->data_neighbor3i, mesh->data_element3i, mesh->num_triangles);
1905 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);
1907 if (surf->texinfo->texture->flags & SURF_LIGHTMAP)
1909 int i, iu, iv, smax, tmax;
1910 float u, v, ubase, vbase, uscale, vscale;
1912 smax = surf->extents[0] >> 4;
1913 tmax = surf->extents[1] >> 4;
1915 if (r_miplightmaps.integer)
1917 surf->lightmaptexturestride = smax+1;
1918 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);
1922 surf->lightmaptexturestride = R_CompatibleFragmentWidth(smax+1, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, 0);
1923 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);
1925 R_FragmentLocation(surf->lightmaptexture, NULL, NULL, &ubase, &vbase, &uscale, &vscale);
1926 uscale = (uscale - ubase) / (smax + 1);
1927 vscale = (vscale - vbase) / (tmax + 1);
1929 for (i = 0;i < mesh->num_vertices;i++)
1931 u = ((DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3]) + 8 - surf->texturemins[0]) * (1.0 / 16.0);
1932 v = ((DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3]) + 8 - surf->texturemins[1]) * (1.0 / 16.0);
1933 mesh->data_texcoordlightmap2f[i * 2 + 0] = u * uscale + ubase;
1934 mesh->data_texcoordlightmap2f[i * 2 + 1] = v * vscale + vbase;
1935 // LordHavoc: calc lightmap data offset for vertex lighting to use
1938 mesh->data_lightmapoffsets[i] = (bound(0, iv, tmax) * (smax+1) + bound(0, iu, smax)) * 3;
1944 static void Mod_Q1BSP_SetParent(mnode_t *node, mnode_t *parent)
1946 node->parent = parent;
1949 Mod_Q1BSP_SetParent(node->children[0], node);
1950 Mod_Q1BSP_SetParent(node->children[1], node);
1954 static void Mod_Q1BSP_LoadNodes(lump_t *l)
1960 in = (void *)(mod_base + l->fileofs);
1961 if (l->filelen % sizeof(*in))
1962 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
1963 count = l->filelen / sizeof(*in);
1964 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1966 loadmodel->brush.data_nodes = out;
1967 loadmodel->brush.num_nodes = count;
1969 for ( i=0 ; i<count ; i++, in++, out++)
1971 for (j=0 ; j<3 ; j++)
1973 out->mins[j] = LittleShort(in->mins[j]);
1974 out->maxs[j] = LittleShort(in->maxs[j]);
1977 p = LittleLong(in->planenum);
1978 out->plane = loadmodel->brush.data_planes + p;
1980 out->firstsurface = LittleShort(in->firstface);
1981 out->numsurfaces = LittleShort(in->numfaces);
1983 for (j=0 ; j<2 ; j++)
1985 p = LittleShort(in->children[j]);
1987 out->children[j] = loadmodel->brush.data_nodes + p;
1989 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
1993 Mod_Q1BSP_SetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
1996 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2002 in = (void *)(mod_base + l->fileofs);
2003 if (l->filelen % sizeof(*in))
2004 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2005 count = l->filelen / sizeof(*in);
2006 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2008 loadmodel->brush.data_leafs = out;
2009 loadmodel->brush.num_leafs = count;
2010 // get visleafs from the submodel data
2011 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2012 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2013 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2014 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2016 for ( i=0 ; i<count ; i++, in++, out++)
2018 for (j=0 ; j<3 ; j++)
2020 out->mins[j] = LittleShort(in->mins[j]);
2021 out->maxs[j] = LittleShort(in->maxs[j]);
2024 // FIXME: this function could really benefit from some error checking
2026 out->contents = LittleLong(in->contents);
2028 out->firstleafface = loadmodel->brush.data_leaffaces + LittleShort(in->firstmarksurface);
2029 out->numleaffaces = LittleShort(in->nummarksurfaces);
2030 if (out->firstleafface < 0 || LittleShort(in->firstmarksurface) + out->numleaffaces > loadmodel->brush.num_leaffaces)
2032 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafface range %i:%i outside range %i:%i\n", out->firstleafface, out->firstleafface + out->numleaffaces, 0, loadmodel->brush.num_leaffaces);
2033 out->firstleafface = NULL;
2034 out->numleaffaces = 0;
2037 out->clusterindex = i - 1;
2038 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2039 out->clusterindex = -1;
2041 p = LittleLong(in->visofs);
2042 // ignore visofs errors on leaf 0 (solid)
2043 if (p >= 0 && out->clusterindex >= 0)
2045 if (p >= loadmodel->brushq1.num_compressedpvs)
2046 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2048 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);
2051 for (j = 0;j < 4;j++)
2052 out->ambient_sound_level[j] = in->ambient_level[j];
2054 // FIXME: Insert caustics here
2058 static void Mod_Q1BSP_LoadClipnodes(lump_t *l)
2060 dclipnode_t *in, *out;
2064 in = (void *)(mod_base + l->fileofs);
2065 if (l->filelen % sizeof(*in))
2066 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2067 count = l->filelen / sizeof(*in);
2068 out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2070 loadmodel->brushq1.clipnodes = out;
2071 loadmodel->brushq1.numclipnodes = count;
2073 if (loadmodel->brush.ishlbsp)
2075 hull = &loadmodel->brushq1.hulls[1];
2076 hull->clipnodes = out;
2077 hull->firstclipnode = 0;
2078 hull->lastclipnode = count-1;
2079 hull->planes = loadmodel->brush.data_planes;
2080 hull->clip_mins[0] = -16;
2081 hull->clip_mins[1] = -16;
2082 hull->clip_mins[2] = -36;
2083 hull->clip_maxs[0] = 16;
2084 hull->clip_maxs[1] = 16;
2085 hull->clip_maxs[2] = 36;
2086 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2088 hull = &loadmodel->brushq1.hulls[2];
2089 hull->clipnodes = out;
2090 hull->firstclipnode = 0;
2091 hull->lastclipnode = count-1;
2092 hull->planes = loadmodel->brush.data_planes;
2093 hull->clip_mins[0] = -32;
2094 hull->clip_mins[1] = -32;
2095 hull->clip_mins[2] = -32;
2096 hull->clip_maxs[0] = 32;
2097 hull->clip_maxs[1] = 32;
2098 hull->clip_maxs[2] = 32;
2099 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2101 hull = &loadmodel->brushq1.hulls[3];
2102 hull->clipnodes = out;
2103 hull->firstclipnode = 0;
2104 hull->lastclipnode = count-1;
2105 hull->planes = loadmodel->brush.data_planes;
2106 hull->clip_mins[0] = -16;
2107 hull->clip_mins[1] = -16;
2108 hull->clip_mins[2] = -18;
2109 hull->clip_maxs[0] = 16;
2110 hull->clip_maxs[1] = 16;
2111 hull->clip_maxs[2] = 18;
2112 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2116 hull = &loadmodel->brushq1.hulls[1];
2117 hull->clipnodes = out;
2118 hull->firstclipnode = 0;
2119 hull->lastclipnode = count-1;
2120 hull->planes = loadmodel->brush.data_planes;
2121 hull->clip_mins[0] = -16;
2122 hull->clip_mins[1] = -16;
2123 hull->clip_mins[2] = -24;
2124 hull->clip_maxs[0] = 16;
2125 hull->clip_maxs[1] = 16;
2126 hull->clip_maxs[2] = 32;
2127 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2129 hull = &loadmodel->brushq1.hulls[2];
2130 hull->clipnodes = out;
2131 hull->firstclipnode = 0;
2132 hull->lastclipnode = count-1;
2133 hull->planes = loadmodel->brush.data_planes;
2134 hull->clip_mins[0] = -32;
2135 hull->clip_mins[1] = -32;
2136 hull->clip_mins[2] = -24;
2137 hull->clip_maxs[0] = 32;
2138 hull->clip_maxs[1] = 32;
2139 hull->clip_maxs[2] = 64;
2140 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2143 for (i=0 ; i<count ; i++, out++, in++)
2145 out->planenum = LittleLong(in->planenum);
2146 out->children[0] = LittleShort(in->children[0]);
2147 out->children[1] = LittleShort(in->children[1]);
2148 if (out->children[0] >= count || out->children[1] >= count)
2149 Host_Error("Corrupt clipping hull(out of range child)\n");
2153 //Duplicate the drawing hull structure as a clipping hull
2154 static void Mod_Q1BSP_MakeHull0(void)
2161 hull = &loadmodel->brushq1.hulls[0];
2163 in = loadmodel->brush.data_nodes;
2164 out = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2166 hull->clipnodes = out;
2167 hull->firstclipnode = 0;
2168 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2169 hull->planes = loadmodel->brush.data_planes;
2171 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2173 out->planenum = in->plane - loadmodel->brush.data_planes;
2174 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2175 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2179 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2184 in = (void *)(mod_base + l->fileofs);
2185 if (l->filelen % sizeof(*in))
2186 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2187 loadmodel->brush.num_leaffaces = l->filelen / sizeof(*in);
2188 loadmodel->brush.data_leaffaces = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leaffaces * sizeof(int));
2190 for (i = 0;i < loadmodel->brush.num_leaffaces;i++)
2192 j = (unsigned) LittleShort(in[i]);
2193 if (j >= loadmodel->brushq1.numsurfaces)
2194 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2195 loadmodel->brush.data_leaffaces[i] = j;
2199 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2204 in = (void *)(mod_base + l->fileofs);
2205 if (l->filelen % sizeof(*in))
2206 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2207 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2208 loadmodel->brushq1.surfedges = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2210 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2211 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2215 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2221 in = (void *)(mod_base + l->fileofs);
2222 if (l->filelen % sizeof(*in))
2223 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2225 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2226 loadmodel->brush.data_planes = out = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2228 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2230 out->normal[0] = LittleFloat(in->normal[0]);
2231 out->normal[1] = LittleFloat(in->normal[1]);
2232 out->normal[2] = LittleFloat(in->normal[2]);
2233 out->dist = LittleFloat(in->dist);
2239 static void Mod_Q1BSP_LoadMapBrushes(void)
2243 int submodel, numbrushes;
2244 qboolean firstbrush;
2245 char *text, *maptext;
2246 char mapfilename[MAX_QPATH];
2247 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2248 strlcat (mapfilename, ".map", sizeof (mapfilename));
2249 maptext = (qbyte*) FS_LoadFile(mapfilename, tempmempool, false);
2253 if (!COM_ParseToken(&data, false))
2258 if (!COM_ParseToken(&data, false))
2260 if (com_token[0] != '{')
2266 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2269 if (!COM_ParseToken(&data, false))
2271 if (com_token[0] == '}')
2272 break; // end of entity
2273 if (com_token[0] == '{')
2280 if (submodel > loadmodel->brush.numsubmodels)
2282 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2286 model = loadmodel->brush.submodels[submodel];
2293 if (!COM_ParseToken(&data, false))
2295 if (com_token[0] == '}')
2296 break; // end of brush
2297 // each brush face should be this format:
2298 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2299 // FIXME: support hl .map format
2300 for (pointnum = 0;pointnum < 3;pointnum++)
2302 COM_ParseToken(&data, false);
2303 for (componentnum = 0;componentnum < 3;componentnum++)
2305 COM_ParseToken(&data, false);
2306 point[pointnum][componentnum] = atof(com_token);
2308 COM_ParseToken(&data, false);
2310 COM_ParseToken(&data, false);
2311 strlcpy(facetexture, com_token, sizeof(facetexture));
2312 COM_ParseToken(&data, false);
2313 //scroll_s = atof(com_token);
2314 COM_ParseToken(&data, false);
2315 //scroll_t = atof(com_token);
2316 COM_ParseToken(&data, false);
2317 //rotate = atof(com_token);
2318 COM_ParseToken(&data, false);
2319 //scale_s = atof(com_token);
2320 COM_ParseToken(&data, false);
2321 //scale_t = atof(com_token);
2322 TriangleNormal(point[0], point[1], point[2], planenormal);
2323 VectorNormalizeDouble(planenormal);
2324 planedist = DotProduct(point[0], planenormal);
2325 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2335 #define MAX_PORTALPOINTS 64
2337 typedef struct portal_s
2340 mnode_t *nodes[2]; // [0] = front side of plane
2341 struct portal_s *next[2];
2343 double points[3*MAX_PORTALPOINTS];
2344 struct portal_s *chain; // all portals are linked into a list
2348 static portal_t *portalchain;
2355 static portal_t *AllocPortal(void)
2358 p = Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2359 p->chain = portalchain;
2364 static void FreePortal(portal_t *p)
2369 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2371 // process only nodes (leafs already had their box calculated)
2375 // calculate children first
2376 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2377 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2379 // make combined bounding box from children
2380 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2381 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2382 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2383 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2384 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2385 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2388 static void Mod_Q1BSP_FinalizePortals(void)
2390 int i, j, numportals, numpoints;
2391 portal_t *p, *pnext;
2394 mleaf_t *leaf, *endleaf;
2396 // recalculate bounding boxes for all leafs(because qbsp is very sloppy)
2397 leaf = loadmodel->brush.data_leafs;
2398 endleaf = leaf + loadmodel->brush.num_leafs;
2399 for (;leaf < endleaf;leaf++)
2401 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2402 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2407 if (p->numpoints >= 3)
2409 for (i = 0;i < 2;i++)
2411 leaf = (mleaf_t *)p->nodes[i];
2412 for (j = 0;j < p->numpoints;j++)
2414 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2415 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2416 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2417 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2418 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2419 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2426 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2428 // tally up portal and point counts
2434 // note: this check must match the one below or it will usually corrupt memory
2435 // 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
2436 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2439 numpoints += p->numpoints * 2;
2443 loadmodel->brush.data_portals = Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2444 loadmodel->brush.num_portals = numportals;
2445 loadmodel->brush.data_portalpoints = (void *)((qbyte *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2446 loadmodel->brush.num_portalpoints = numpoints;
2447 // clear all leaf portal chains
2448 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2449 loadmodel->brush.data_leafs[i].portals = NULL;
2450 // process all portals in the global portal chain, while freeing them
2451 portal = loadmodel->brush.data_portals;
2452 point = loadmodel->brush.data_portalpoints;
2459 // note: this check must match the one above or it will usually corrupt memory
2460 // 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
2461 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2463 // first make the back to front portal(forward portal)
2464 portal->points = point;
2465 portal->numpoints = p->numpoints;
2466 portal->plane.dist = p->plane.dist;
2467 VectorCopy(p->plane.normal, portal->plane.normal);
2468 portal->here = (mleaf_t *)p->nodes[1];
2469 portal->past = (mleaf_t *)p->nodes[0];
2471 for (j = 0;j < portal->numpoints;j++)
2473 VectorCopy(p->points + j*3, point->position);
2476 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2477 PlaneClassify(&portal->plane);
2479 // link into leaf's portal chain
2480 portal->next = portal->here->portals;
2481 portal->here->portals = portal;
2483 // advance to next portal
2486 // then make the front to back portal(backward portal)
2487 portal->points = point;
2488 portal->numpoints = p->numpoints;
2489 portal->plane.dist = -p->plane.dist;
2490 VectorNegate(p->plane.normal, portal->plane.normal);
2491 portal->here = (mleaf_t *)p->nodes[0];
2492 portal->past = (mleaf_t *)p->nodes[1];
2494 for (j = portal->numpoints - 1;j >= 0;j--)
2496 VectorCopy(p->points + j*3, point->position);
2499 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2500 PlaneClassify(&portal->plane);
2502 // link into leaf's portal chain
2503 portal->next = portal->here->portals;
2504 portal->here->portals = portal;
2506 // advance to next portal
2519 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2522 Host_Error("AddPortalToNodes: NULL front node");
2524 Host_Error("AddPortalToNodes: NULL back node");
2525 if (p->nodes[0] || p->nodes[1])
2526 Host_Error("AddPortalToNodes: already included");
2527 // 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
2529 p->nodes[0] = front;
2530 p->next[0] = (portal_t *)front->portals;
2531 front->portals = (mportal_t *)p;
2534 p->next[1] = (portal_t *)back->portals;
2535 back->portals = (mportal_t *)p;
2540 RemovePortalFromNode
2543 static void RemovePortalFromNodes(portal_t *portal)
2547 void **portalpointer;
2549 for (i = 0;i < 2;i++)
2551 node = portal->nodes[i];
2553 portalpointer = (void **) &node->portals;
2558 Host_Error("RemovePortalFromNodes: portal not in leaf");
2562 if (portal->nodes[0] == node)
2564 *portalpointer = portal->next[0];
2565 portal->nodes[0] = NULL;
2567 else if (portal->nodes[1] == node)
2569 *portalpointer = portal->next[1];
2570 portal->nodes[1] = NULL;
2573 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2577 if (t->nodes[0] == node)
2578 portalpointer = (void **) &t->next[0];
2579 else if (t->nodes[1] == node)
2580 portalpointer = (void **) &t->next[1];
2582 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2587 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2590 mnode_t *front, *back, *other_node;
2591 mplane_t clipplane, *plane;
2592 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2593 int numfrontpoints, numbackpoints;
2594 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2596 // if a leaf, we're done
2600 plane = node->plane;
2602 front = node->children[0];
2603 back = node->children[1];
2605 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2607 // create the new portal by generating a polygon for the node plane,
2608 // and clipping it by all of the other portals(which came from nodes above this one)
2609 nodeportal = AllocPortal();
2610 nodeportal->plane = *plane;
2612 PolygonD_QuadForPlane(nodeportal->points, nodeportal->plane.normal[0], nodeportal->plane.normal[1], nodeportal->plane.normal[2], nodeportal->plane.dist, 1024.0*1024.0*1024.0);
2613 nodeportal->numpoints = 4;
2614 side = 0; // shut up compiler warning
2615 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2617 clipplane = portal->plane;
2618 if (portal->nodes[0] == portal->nodes[1])
2619 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2620 if (portal->nodes[0] == node)
2622 else if (portal->nodes[1] == node)
2624 clipplane.dist = -clipplane.dist;
2625 VectorNegate(clipplane.normal, clipplane.normal);
2629 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2631 for (i = 0;i < nodeportal->numpoints*3;i++)
2632 frontpoints[i] = nodeportal->points[i];
2633 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, 1.0/32.0, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL);
2634 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
2638 if (nodeportal->numpoints < 3)
2640 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2641 nodeportal->numpoints = 0;
2643 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
2645 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
2646 nodeportal->numpoints = 0;
2650 AddPortalToNodes(nodeportal, front, back);
2652 // split the portals of this node along this node's plane and assign them to the children of this node
2653 // (migrating the portals downward through the tree)
2654 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2656 if (portal->nodes[0] == portal->nodes[1])
2657 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2658 if (portal->nodes[0] == node)
2660 else if (portal->nodes[1] == node)
2663 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2664 nextportal = portal->next[side];
2666 other_node = portal->nodes[!side];
2667 RemovePortalFromNodes(portal);
2669 // cut the portal into two portals, one on each side of the node plane
2670 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, 1.0/32.0, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints);
2672 if (!numfrontpoints)
2675 AddPortalToNodes(portal, back, other_node);
2677 AddPortalToNodes(portal, other_node, back);
2683 AddPortalToNodes(portal, front, other_node);
2685 AddPortalToNodes(portal, other_node, front);
2689 // the portal is split
2690 splitportal = AllocPortal();
2691 temp = splitportal->chain;
2692 *splitportal = *portal;
2693 splitportal->chain = temp;
2694 for (i = 0;i < numbackpoints*3;i++)
2695 splitportal->points[i] = backpoints[i];
2696 splitportal->numpoints = numbackpoints;
2697 for (i = 0;i < numfrontpoints*3;i++)
2698 portal->points[i] = frontpoints[i];
2699 portal->numpoints = numfrontpoints;
2703 AddPortalToNodes(portal, front, other_node);
2704 AddPortalToNodes(splitportal, back, other_node);
2708 AddPortalToNodes(portal, other_node, front);
2709 AddPortalToNodes(splitportal, other_node, back);
2714 Mod_Q1BSP_RecursiveNodePortals(front);
2715 Mod_Q1BSP_RecursiveNodePortals(back);
2718 static void Mod_Q1BSP_MakePortals(void)
2721 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
2722 Mod_Q1BSP_FinalizePortals();
2725 static void Mod_Q1BSP_BuildSurfaceNeighbors(msurface_t *surfaces, int numsurfaces, mempool_t *mempool)
2728 int surfnum, vertnum, vertnum2, snum, vnum, vnum2;
2729 msurface_t *surf, *s;
2730 float *v0, *v1, *v2, *v3;
2731 for (surf = surfaces, surfnum = 0;surfnum < numsurfaces;surf++, surfnum++)
2732 surf->neighborsurfaces = Mem_Alloc(mempool, surf->poly_numverts * sizeof(msurface_t *));
2733 for (surf = surfaces, surfnum = 0;surfnum < numsurfaces;surf++, surfnum++)
2735 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)
2737 if (surf->neighborsurfaces[vertnum])
2739 surf->neighborsurfaces[vertnum] = NULL;
2740 for (s = surfaces, snum = 0;snum < numsurfaces;s++, snum++)
2742 if (s->poly_mins[0] > (surf->poly_maxs[0] + 1) || s->poly_maxs[0] < (surf->poly_mins[0] - 1)
2743 || s->poly_mins[1] > (surf->poly_maxs[1] + 1) || s->poly_maxs[1] < (surf->poly_mins[1] - 1)
2744 || s->poly_mins[2] > (surf->poly_maxs[2] + 1) || s->poly_maxs[2] < (surf->poly_mins[2] - 1)
2747 for (vnum = 0;vnum < s->poly_numverts;vnum++)
2748 if (s->neighborsurfaces[vnum] == surf)
2750 if (vnum < s->poly_numverts)
2752 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)
2754 if (s->neighborsurfaces[vnum] == NULL
2755 && ((v0[0] == v2[0] && v0[1] == v2[1] && v0[2] == v2[2] && v1[0] == v3[0] && v1[1] == v3[1] && v1[2] == v3[2])
2756 || (v1[0] == v2[0] && v1[1] == v2[1] && v1[2] == v2[2] && v0[0] == v3[0] && v0[1] == v3[1] && v0[2] == v3[2])))
2758 surf->neighborsurfaces[vertnum] = s;
2759 s->neighborsurfaces[vnum] = surf;
2763 if (vnum < s->poly_numverts)
2771 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2773 int i, j, stylecounts[256], totalcount, remapstyles[256];
2775 memset(stylecounts, 0, sizeof(stylecounts));
2776 for (i = 0;i < model->nummodelsurfaces;i++)
2778 surf = model->brushq1.surfaces + model->firstmodelsurface + i;
2779 for (j = 0;j < MAXLIGHTMAPS;j++)
2780 stylecounts[surf->styles[j]]++;
2783 model->brushq1.light_styles = 0;
2784 for (i = 0;i < 255;i++)
2788 remapstyles[i] = model->brushq1.light_styles++;
2789 totalcount += stylecounts[i] + 1;
2794 model->brushq1.light_style = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(qbyte));
2795 model->brushq1.light_stylevalue = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
2796 model->brushq1.light_styleupdatechains = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
2797 model->brushq1.light_styleupdatechainsbuffer = Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
2798 model->brushq1.light_styles = 0;
2799 for (i = 0;i < 255;i++)
2801 model->brushq1.light_style[model->brushq1.light_styles++] = i;
2803 for (i = 0;i < model->brushq1.light_styles;i++)
2805 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2806 j += stylecounts[model->brushq1.light_style[i]] + 1;
2808 for (i = 0;i < model->nummodelsurfaces;i++)
2810 surf = model->brushq1.surfaces + model->firstmodelsurface + i;
2811 for (j = 0;j < MAXLIGHTMAPS;j++)
2812 if (surf->styles[j] != 255)
2813 *model->brushq1.light_styleupdatechains[remapstyles[surf->styles[j]]]++ = surf;
2816 for (i = 0;i < model->brushq1.light_styles;i++)
2818 *model->brushq1.light_styleupdatechains[i] = NULL;
2819 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2820 j += stylecounts[model->brushq1.light_style[i]] + 1;
2824 //Returns PVS data for a given point
2825 //(note: can return NULL)
2826 static qbyte *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
2829 Mod_CheckLoaded(model);
2830 node = model->brush.data_nodes;
2832 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
2833 if (((mleaf_t *)node)->clusterindex >= 0)
2834 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2839 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, mnode_t *node)
2843 float d = PlaneDiff(org, node->plane);
2845 node = node->children[0];
2846 else if (d < -radius)
2847 node = node->children[1];
2850 // go down both sides
2851 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
2852 node = node->children[1];
2855 // if this leaf is in a cluster, accumulate the pvs bits
2856 if (((mleaf_t *)node)->clusterindex >= 0)
2859 qbyte *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2860 for (i = 0;i < pvsbytes;i++)
2861 pvsbuffer[i] |= pvs[i];
2865 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
2866 //of the given point.
2867 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
2869 int bytes = ((model->brush.num_leafs - 1) + 7) >> 3;
2870 bytes = min(bytes, pvsbufferlength);
2871 if (r_novis.integer || !Mod_Q1BSP_GetPVS(model, org))
2873 memset(pvsbuffer, 0xFF, bytes);
2876 memset(pvsbuffer, 0, bytes);
2877 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
2881 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
2886 VectorSubtract(inmaxs, inmins, size);
2887 if (cmodel->brush.ishlbsp)
2890 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2891 else if (size[0] <= 32)
2893 if (size[2] < 54) // pick the nearest of 36 or 72
2894 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
2896 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
2899 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
2904 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2905 else if (size[0] <= 32)
2906 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
2908 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
2910 VectorCopy(inmins, outmins);
2911 VectorAdd(inmins, hull->clip_size, outmaxs);
2915 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)
2920 if (!BoxesOverlap(node->mins, node->maxs, mins, maxs))
2924 Mod_Q1BSP_RecursiveGetVisible(node->children[0], model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces, pvs);
2925 node = node->children[1];
2927 leaf = (mleaf_t *)node;
2928 if ((pvs == NULL || CHECKPVSBIT(pvs, leaf->clusterindex)))
2932 if (maxleafs && *numleafs < maxleafs)
2933 leaflist[(*numleafs)++] = leaf;
2936 for (leaffacenum = 0;leaffacenum < leaf->numleaffaces;leaffacenum++)
2938 surf = model->brushq1.surfaces + leaf->firstleafface[leaffacenum];
2939 if (surf->shadowmark != shadowmarkcount)
2941 surf->shadowmark = shadowmarkcount;
2942 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)
2943 surfacelist[(*numsurfaces)++] = surf;
2950 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)
2952 // FIXME: support portals
2957 pvs = ent->model->brush.GetPVS(ent->model, relativelightorigin);
2958 Mod_Q1BSP_RecursiveGetVisible(ent->model->brush.data_nodes + ent->model->brushq1.firstclipnode, model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces);
2962 extern void R_Q1BSP_DrawSky(entity_render_t *ent);
2963 extern void R_Q1BSP_Draw(entity_render_t *ent);
2964 extern void R_Q1BSP_GetLightInfo(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, vec3_t outmins, vec3_t outmaxs, int *outclusterlist, qbyte *outclusterpvs, int *outnumclusterspointer, int *outsurfacelist, qbyte *outsurfacepvs, int *outnumsurfacespointer);
2965 extern void R_Q1BSP_DrawShadowVolume(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, int numsurfaces, const int *surfacelist);
2966 extern void R_Q1BSP_DrawLight(entity_render_t *ent, vec3_t relativelightorigin, vec3_t relativeeyeorigin, float lightradius, float *lightcolor, const matrix4x4_t *matrix_modeltolight, const matrix4x4_t *matrix_modeltoattenuationxyz, const matrix4x4_t *matrix_modeltoattenuationz, rtexture_t *lightcubemap, vec_t ambientscale, vec_t diffusescale, vec_t specularscale, int numsurfaces, const int *surfacelist);
2967 void Mod_Q1BSP_Load(model_t *mod, void *buffer)
2972 mempool_t *mainmempool;
2973 float dist, modelyawradius, modelradius, *vec;
2975 int numshadowmeshtriangles;
2977 mod->type = mod_brushq1;
2979 header = (dheader_t *)buffer;
2981 i = LittleLong(header->version);
2982 if (i != BSPVERSION && i != 30)
2983 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife))", mod->name, i, BSPVERSION);
2984 mod->brush.ishlbsp = i == 30;
2986 mod->soundfromcenter = true;
2987 mod->TraceBox = Mod_Q1BSP_TraceBox;
2988 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
2989 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
2990 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
2991 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
2992 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
2993 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
2994 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
2995 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
2996 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
2997 mod->brushq1.PointInLeaf = Mod_Q1BSP_PointInLeaf;
2999 if (loadmodel->isworldmodel)
3000 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3002 // swap all the lumps
3003 mod_base = (qbyte *)header;
3005 header->version = LittleLong(header->version);
3006 for (i = 0;i < HEADER_LUMPS;i++)
3008 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3009 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3014 // store which lightmap format to use
3015 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3017 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3018 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3019 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3020 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3021 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3022 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3023 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3024 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3025 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3026 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3027 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3028 // load submodels before leafs because they contain the number of vis leafs
3029 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS]);
3030 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3031 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3032 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES]);
3034 if (!mod->brushq1.lightdata)
3035 mod->brush.LightPoint = NULL;
3037 if (mod->brushq1.data_compressedpvs)
3038 Mem_Free(mod->brushq1.data_compressedpvs);
3039 mod->brushq1.data_compressedpvs = NULL;
3040 mod->brushq1.num_compressedpvs = 0;
3042 Mod_Q1BSP_MakeHull0();
3043 Mod_Q1BSP_MakePortals();
3045 mod->numframes = 2; // regular and alternate animation
3048 mainmempool = mod->mempool;
3050 Mod_Q1BSP_LoadLightList();
3052 // make a single combined shadow mesh to allow optimized shadow volume creation
3053 numshadowmeshtriangles = 0;
3054 for (j = 0, surf = loadmodel->brushq1.surfaces;j < loadmodel->brushq1.numsurfaces;j++, surf++)
3056 surf->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3057 numshadowmeshtriangles += surf->mesh.num_triangles;
3059 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3060 for (j = 0, surf = loadmodel->brushq1.surfaces;j < loadmodel->brushq1.numsurfaces;j++, surf++)
3061 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);
3062 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
3063 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3065 if (loadmodel->brush.numsubmodels)
3066 loadmodel->brush.submodels = Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3068 // LordHavoc: to clear the fog around the original quake submodel code, I
3070 // first of all, some background info on the submodels:
3071 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3072 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3073 // now the weird for loop itself:
3074 // the loop functions in an odd way, on each iteration it sets up the
3075 // current 'mod' model (which despite the confusing code IS the model of
3076 // the number i), at the end of the loop it duplicates the model to become
3077 // the next submodel, and loops back to set up the new submodel.
3079 // LordHavoc: now the explanation of my sane way (which works identically):
3080 // set up the world model, then on each submodel copy from the world model
3081 // and set up the submodel with the respective model info.
3082 for (i = 0;i < mod->brush.numsubmodels;i++)
3084 // LordHavoc: this code was originally at the end of this loop, but
3085 // has been transformed to something more readable at the start here.
3090 // LordHavoc: only register submodels if it is the world
3091 // (prevents external bsp models from replacing world submodels with
3093 if (!loadmodel->isworldmodel)
3095 // duplicate the basic information
3096 sprintf(name, "*%i", i);
3097 mod = Mod_FindName(name);
3098 // copy the base model to this one
3100 // rename the clone back to its proper name
3101 strcpy(mod->name, name);
3102 // textures and memory belong to the main model
3103 mod->texturepool = NULL;
3104 mod->mempool = NULL;
3107 mod->brush.submodel = i;
3109 if (loadmodel->brush.submodels)
3110 loadmodel->brush.submodels[i] = mod;
3112 bm = &mod->brushq1.submodels[i];
3114 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3115 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3117 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3118 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3121 mod->firstmodelsurface = bm->firstface;
3122 mod->nummodelsurfaces = bm->numfaces;
3124 // make the model surface list (used by shadowing/lighting)
3125 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
3126 for (j = 0;j < mod->nummodelsurfaces;j++)
3127 mod->surfacelist[j] = mod->firstmodelsurface + j;
3129 // this gets altered below if sky is used
3130 mod->DrawSky = NULL;
3131 mod->Draw = R_Q1BSP_Draw;
3132 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3133 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3134 mod->DrawLight = R_Q1BSP_DrawLight;
3137 mod->brush.GetPVS = NULL;
3138 mod->brush.FatPVS = NULL;
3139 mod->brush.BoxTouchingPVS = NULL;
3140 mod->brush.LightPoint = NULL;
3141 mod->brush.AmbientSoundLevelsForPoint = NULL;
3143 Mod_Q1BSP_BuildLightmapUpdateChains(loadmodel->mempool, mod);
3144 if (mod->nummodelsurfaces)
3146 // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3147 mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3148 mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3151 for (j = 0, surf = &mod->brushq1.surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surf++)
3153 // we only need to have a drawsky function if it is used(usually only on world model)
3154 if (surf->texinfo->texture->flags & SURF_DRAWSKY)
3155 mod->DrawSky = R_Q1BSP_DrawSky;
3156 // LordHavoc: submodels always clip, even if water
3157 if (mod->brush.numsubmodels - 1)
3158 surf->flags |= SURF_SOLIDCLIP;
3159 // calculate bounding shapes
3160 for (k = 0, vec = surf->mesh.data_vertex3f;k < surf->mesh.num_vertices;k++, vec += 3)
3162 if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3163 if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3164 if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3165 if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3166 if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3167 if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3168 dist = vec[0]*vec[0]+vec[1]*vec[1];
3169 if (modelyawradius < dist)
3170 modelyawradius = dist;
3171 dist += vec[2]*vec[2];
3172 if (modelradius < dist)
3176 modelyawradius = sqrt(modelyawradius);
3177 modelradius = sqrt(modelradius);
3178 mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3179 mod->yawmins[2] = mod->normalmins[2];
3180 mod->yawmaxs[2] = mod->normalmaxs[2];
3181 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3182 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3183 mod->radius = modelradius;
3184 mod->radius2 = modelradius * modelradius;
3188 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3189 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3191 Mod_Q1BSP_BuildSurfaceNeighbors(mod->brushq1.surfaces + mod->firstmodelsurface, mod->nummodelsurfaces, loadmodel->mempool);
3193 //mod->brushq1.num_visleafs = bm->visleafs;
3196 Mod_Q1BSP_LoadMapBrushes();
3198 //Mod_Q1BSP_ProcessLightList();
3200 if (developer.integer)
3201 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->brush.num_nodes, loadmodel->brush.num_leafs, mod->brushq1.submodels[i].visleafs, loadmodel->brush.num_portals);
3204 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3208 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3215 in = (void *)(mod_base + l->fileofs);
3216 if (l->filelen % sizeof(*in))
3217 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3218 count = l->filelen / sizeof(*in);
3219 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3222 loadmodel->num = count;
3224 for (i = 0;i < count;i++, in++, out++)
3230 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3237 in = (void *)(mod_base + l->fileofs);
3238 if (l->filelen % sizeof(*in))
3239 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3240 count = l->filelen / sizeof(*in);
3241 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3244 loadmodel->num = count;
3246 for (i = 0;i < count;i++, in++, out++)
3252 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3259 in = (void *)(mod_base + l->fileofs);
3260 if (l->filelen % sizeof(*in))
3261 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3262 count = l->filelen / sizeof(*in);
3263 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3266 loadmodel->num = count;
3268 for (i = 0;i < count;i++, in++, out++)
3274 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3281 in = (void *)(mod_base + l->fileofs);
3282 if (l->filelen % sizeof(*in))
3283 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3284 count = l->filelen / sizeof(*in);
3285 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3288 loadmodel->num = count;
3290 for (i = 0;i < count;i++, in++, out++)
3296 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3303 in = (void *)(mod_base + l->fileofs);
3304 if (l->filelen % sizeof(*in))
3305 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3306 count = l->filelen / sizeof(*in);
3307 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3310 loadmodel->num = count;
3312 for (i = 0;i < count;i++, in++, out++)
3318 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3325 in = (void *)(mod_base + l->fileofs);
3326 if (l->filelen % sizeof(*in))
3327 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3328 count = l->filelen / sizeof(*in);
3329 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3332 loadmodel->num = count;
3334 for (i = 0;i < count;i++, in++, out++)
3340 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3347 in = (void *)(mod_base + l->fileofs);
3348 if (l->filelen % sizeof(*in))
3349 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3350 count = l->filelen / sizeof(*in);
3351 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3354 loadmodel->num = count;
3356 for (i = 0;i < count;i++, in++, out++)
3362 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3369 in = (void *)(mod_base + l->fileofs);
3370 if (l->filelen % sizeof(*in))
3371 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3372 count = l->filelen / sizeof(*in);
3373 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3376 loadmodel->num = count;
3378 for (i = 0;i < count;i++, in++, out++)
3384 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3391 in = (void *)(mod_base + l->fileofs);
3392 if (l->filelen % sizeof(*in))
3393 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3394 count = l->filelen / sizeof(*in);
3395 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3398 loadmodel->num = count;
3400 for (i = 0;i < count;i++, in++, out++)
3406 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3413 in = (void *)(mod_base + l->fileofs);
3414 if (l->filelen % sizeof(*in))
3415 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3416 count = l->filelen / sizeof(*in);
3417 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3420 loadmodel->num = count;
3422 for (i = 0;i < count;i++, in++, out++)
3428 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3435 in = (void *)(mod_base + l->fileofs);
3436 if (l->filelen % sizeof(*in))
3437 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3438 count = l->filelen / sizeof(*in);
3439 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3442 loadmodel->num = count;
3444 for (i = 0;i < count;i++, in++, out++)
3450 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3457 in = (void *)(mod_base + l->fileofs);
3458 if (l->filelen % sizeof(*in))
3459 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3460 count = l->filelen / sizeof(*in);
3461 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3464 loadmodel->num = count;
3466 for (i = 0;i < count;i++, in++, out++)
3472 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3479 in = (void *)(mod_base + l->fileofs);
3480 if (l->filelen % sizeof(*in))
3481 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3482 count = l->filelen / sizeof(*in);
3483 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3486 loadmodel->num = count;
3488 for (i = 0;i < count;i++, in++, out++)
3494 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3501 in = (void *)(mod_base + l->fileofs);
3502 if (l->filelen % sizeof(*in))
3503 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3504 count = l->filelen / sizeof(*in);
3505 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3508 loadmodel->num = count;
3510 for (i = 0;i < count;i++, in++, out++)
3516 static void Mod_Q2BSP_LoadAreas(lump_t *l)
3523 in = (void *)(mod_base + l->fileofs);
3524 if (l->filelen % sizeof(*in))
3525 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
3526 count = l->filelen / sizeof(*in);
3527 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3530 loadmodel->num = count;
3532 for (i = 0;i < count;i++, in++, out++)
3538 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
3545 in = (void *)(mod_base + l->fileofs);
3546 if (l->filelen % sizeof(*in))
3547 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
3548 count = l->filelen / sizeof(*in);
3549 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3552 loadmodel->num = count;
3554 for (i = 0;i < count;i++, in++, out++)
3560 static void Mod_Q2BSP_LoadModels(lump_t *l)
3567 in = (void *)(mod_base + l->fileofs);
3568 if (l->filelen % sizeof(*in))
3569 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
3570 count = l->filelen / sizeof(*in);
3571 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3574 loadmodel->num = count;
3576 for (i = 0;i < count;i++, in++, out++)
3582 void static Mod_Q2BSP_Load(model_t *mod, void *buffer)
3585 q2dheader_t *header;
3587 Host_Error("Mod_Q2BSP_Load: not yet implemented\n");
3589 mod->type = mod_brushq2;
3591 header = (q2dheader_t *)buffer;
3593 i = LittleLong(header->version);
3594 if (i != Q2BSPVERSION)
3595 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
3596 mod->brush.ishlbsp = false;
3597 if (loadmodel->isworldmodel)
3598 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3600 mod_base = (qbyte *)header;
3602 // swap all the lumps
3603 for (i = 0;i < (int) sizeof(*header) / 4;i++)
3604 ((int *)header)[i] = LittleLong(((int *)header)[i]);
3606 // store which lightmap format to use
3607 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3609 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
3610 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
3611 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
3612 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
3613 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
3614 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
3615 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
3616 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
3617 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
3618 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
3619 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
3620 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
3621 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
3622 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
3623 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
3624 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
3625 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
3626 // LordHavoc: must go last because this makes the submodels
3627 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
3630 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
3631 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
3633 static void Mod_Q3BSP_LoadEntities(lump_t *l)
3636 char key[128], value[4096];
3638 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
3639 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
3640 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
3643 loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
3644 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
3645 data = loadmodel->brush.entities;
3646 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
3647 if (data && COM_ParseToken(&data, false) && com_token[0] == '{')
3651 if (!COM_ParseToken(&data, false))
3653 if (com_token[0] == '}')
3654 break; // end of worldspawn
3655 if (com_token[0] == '_')
3656 strcpy(key, com_token + 1);
3658 strcpy(key, com_token);
3659 while (key[strlen(key)-1] == ' ') // remove trailing spaces
3660 key[strlen(key)-1] = 0;
3661 if (!COM_ParseToken(&data, false))
3663 strcpy(value, com_token);
3664 if (!strcmp("gridsize", key))
3666 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
3667 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
3673 static void Mod_Q3BSP_LoadTextures(lump_t *l)
3682 int flags, flags2, numparameters, passnumber;
3683 char shadername[Q3PATHLENGTH];
3684 char sky[Q3PATHLENGTH];
3685 char firstpasstexturename[Q3PATHLENGTH];
3686 char parameter[4][Q3PATHLENGTH];
3688 in = (void *)(mod_base + l->fileofs);
3689 if (l->filelen % sizeof(*in))
3690 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
3691 count = l->filelen / sizeof(*in);
3692 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3694 loadmodel->brushq3.data_textures = out;
3695 loadmodel->brushq3.num_textures = count;
3697 for (i = 0;i < count;i++, in++, out++)
3700 strlcpy (out->name, in->name, sizeof (out->name));
3701 out->surfaceflags = LittleLong(in->surfaceflags);
3702 out->supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in->contents));
3703 out->surfaceparms = -1;
3706 // do a quick parse of shader files to get surfaceparms
3707 if ((search = FS_Search("scripts/*.shader", true, false)))
3709 for (i = 0;i < search->numfilenames;i++)
3711 if ((f = FS_LoadFile(search->filenames[i], tempmempool, false)))
3714 while (COM_ParseToken(&text, false))
3716 strlcpy (shadername, com_token, sizeof (shadername));
3721 firstpasstexturename[0] = 0;
3722 if (COM_ParseToken(&text, false) && !strcasecmp(com_token, "{"))
3724 while (COM_ParseToken(&text, false))
3726 if (!strcasecmp(com_token, "}"))
3728 else if (!strcasecmp(com_token, "{"))
3730 while (COM_ParseToken(&text, false))
3732 if (!strcasecmp(com_token, "}"))
3734 if (!strcasecmp(com_token, "\n"))
3737 for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3741 strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3742 numparameters = j + 1;
3744 if (!COM_ParseToken(&text, true))
3747 if (developer.integer >= 2)
3749 Con_Printf("%s %i: ", shadername, passnumber);
3750 for (j = 0;j < numparameters;j++)
3751 Con_Printf(" %s", parameter[j]);
3754 if (passnumber == 0 && numparameters >= 1)
3756 if (!strcasecmp(parameter[0], "blendfunc"))
3758 if (numparameters == 2 && !strcasecmp(parameter[1], "add"))
3759 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3760 else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_one") && !strcasecmp(parameter[2], "gl_one"))
3761 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3762 else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_src_alpha") && !strcasecmp(parameter[2], "gl_one"))
3763 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3765 else if (numparameters >= 2 && (!strcasecmp(parameter[0], "map") || !strcasecmp(parameter[0], "clampmap")))
3766 strlcpy(firstpasstexturename, parameter[1], sizeof(firstpasstexturename));
3767 else if (numparameters >= 3 && !strcasecmp(parameter[0], "animmap"))
3768 strlcpy(firstpasstexturename, parameter[2], sizeof(firstpasstexturename));
3770 if (!strcasecmp(parameter[0], "alphafunc"))
3771 flags2 |= Q3TEXTUREFLAG_ALPHATEST;
3772 // break out a level if it was }
3773 if (!strcasecmp(com_token, "}"))
3780 for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3784 strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3785 numparameters = j + 1;
3787 if (!COM_ParseToken(&text, true))
3790 if (i == 0 && !strcasecmp(com_token, "}"))
3792 if (developer.integer >= 2)
3794 Con_Printf("%s: ", shadername);
3795 for (j = 0;j < numparameters;j++)
3796 Con_Printf(" %s", parameter[j]);
3799 if (numparameters < 1)
3801 if (!strcasecmp(parameter[0], "surfaceparm") && numparameters >= 2)
3803 if (!strcasecmp(parameter[1], "alphashadow"))
3804 flags |= Q3SURFACEPARM_ALPHASHADOW;
3805 else if (!strcasecmp(parameter[1], "areaportal"))
3806 flags |= Q3SURFACEPARM_AREAPORTAL;
3807 else if (!strcasecmp(parameter[1], "clusterportal"))
3808 flags |= Q3SURFACEPARM_CLUSTERPORTAL;
3809 else if (!strcasecmp(parameter[1], "detail"))
3810 flags |= Q3SURFACEPARM_DETAIL;
3811 else if (!strcasecmp(parameter[1], "donotenter"))
3812 flags |= Q3SURFACEPARM_DONOTENTER;
3813 else if (!strcasecmp(parameter[1], "fog"))
3814 flags |= Q3SURFACEPARM_FOG;
3815 else if (!strcasecmp(parameter[1], "lava"))
3816 flags |= Q3SURFACEPARM_LAVA;
3817 else if (!strcasecmp(parameter[1], "lightfilter"))
3818 flags |= Q3SURFACEPARM_LIGHTFILTER;
3819 else if (!strcasecmp(parameter[1], "metalsteps"))
3820 flags |= Q3SURFACEPARM_METALSTEPS;
3821 else if (!strcasecmp(parameter[1], "nodamage"))
3822 flags |= Q3SURFACEPARM_NODAMAGE;
3823 else if (!strcasecmp(parameter[1], "nodlight"))
3824 flags |= Q3SURFACEPARM_NODLIGHT;
3825 else if (!strcasecmp(parameter[1], "nodraw"))
3826 flags |= Q3SURFACEPARM_NODRAW;
3827 else if (!strcasecmp(parameter[1], "nodrop"))
3828 flags |= Q3SURFACEPARM_NODROP;
3829 else if (!strcasecmp(parameter[1], "noimpact"))
3830 flags |= Q3SURFACEPARM_NOIMPACT;
3831 else if (!strcasecmp(parameter[1], "nolightmap"))
3832 flags |= Q3SURFACEPARM_NOLIGHTMAP;
3833 else if (!strcasecmp(parameter[1], "nomarks"))
3834 flags |= Q3SURFACEPARM_NOMARKS;
3835 else if (!strcasecmp(parameter[1], "nomipmaps"))
3836 flags |= Q3SURFACEPARM_NOMIPMAPS;
3837 else if (!strcasecmp(parameter[1], "nonsolid"))
3838 flags |= Q3SURFACEPARM_NONSOLID;
3839 else if (!strcasecmp(parameter[1], "origin"))
3840 flags |= Q3SURFACEPARM_ORIGIN;
3841 else if (!strcasecmp(parameter[1], "playerclip"))
3842 flags |= Q3SURFACEPARM_PLAYERCLIP;
3843 else if (!strcasecmp(parameter[1], "sky"))
3844 flags |= Q3SURFACEPARM_SKY;
3845 else if (!strcasecmp(parameter[1], "slick"))
3846 flags |= Q3SURFACEPARM_SLICK;
3847 else if (!strcasecmp(parameter[1], "slime"))
3848 flags |= Q3SURFACEPARM_SLIME;
3849 else if (!strcasecmp(parameter[1], "structural"))
3850 flags |= Q3SURFACEPARM_STRUCTURAL;
3851 else if (!strcasecmp(parameter[1], "trans"))
3852 flags |= Q3SURFACEPARM_TRANS;
3853 else if (!strcasecmp(parameter[1], "water"))
3854 flags |= Q3SURFACEPARM_WATER;
3855 else if (!strcasecmp(parameter[1], "pointlight"))
3856 flags |= Q3SURFACEPARM_POINTLIGHT;
3858 Con_Printf("%s parsing warning: unknown surfaceparm \"%s\"\n", search->filenames[i], parameter[1]);
3860 else if (!strcasecmp(parameter[0], "sky") && numparameters >= 2)
3861 strlcpy(sky, parameter[1], sizeof(sky));
3862 else if (!strcasecmp(parameter[0], "skyparms") && numparameters >= 2)
3864 if (!atoi(parameter[1]) && strcasecmp(parameter[1], "-"))
3865 strlcpy(sky, parameter[1], sizeof(sky));
3867 else if (!strcasecmp(parameter[0], "cull") && numparameters >= 2)
3869 if (!strcasecmp(parameter[1], "disable") || !strcasecmp(parameter[1], "none") || !strcasecmp(parameter[1], "twosided"))
3870 flags2 |= Q3TEXTUREFLAG_TWOSIDED;
3872 else if (!strcasecmp(parameter[0], "nomipmaps"))
3873 flags2 |= Q3TEXTUREFLAG_NOMIPMAPS;
3874 else if (!strcasecmp(parameter[0], "nopicmip"))
3875 flags2 |= Q3TEXTUREFLAG_NOPICMIP;
3876 else if (!strcasecmp(parameter[0], "deformvertexes") && numparameters >= 2)
3878 if (!strcasecmp(parameter[1], "autosprite") && numparameters == 2)
3879 flags2 |= Q3TEXTUREFLAG_AUTOSPRITE;
3880 if (!strcasecmp(parameter[1], "autosprite2") && numparameters == 2)
3881 flags2 |= Q3TEXTUREFLAG_AUTOSPRITE2;
3884 // force transparent render path for a number of odd
3885 // shader effects to avoid bogging down the normal
3886 // render path unnecessarily
3887 if (flags2 & (Q3TEXTUREFLAG_ADDITIVE | Q3TEXTUREFLAG_AUTOSPRITE | Q3TEXTUREFLAG_AUTOSPRITE2 | Q3TEXTUREFLAG_ALPHATEST))
3888 flags |= Q3SURFACEPARM_TRANS;
3889 // add shader to list (shadername and flags)
3890 // actually here we just poke into the texture settings
3891 for (j = 0, out = loadmodel->brushq3.data_textures;j < loadmodel->brushq3.num_textures;j++, out++)
3893 if (!strcasecmp(out->name, shadername))
3895 out->surfaceparms = flags;
3896 out->textureflags = flags2;
3897 strlcpy(out->firstpasstexturename, firstpasstexturename, sizeof(out->firstpasstexturename));
3898 if ((flags & Q3SURFACEPARM_SKY) && sky[0])
3900 // quake3 seems to append a _ to the skybox name, so this must do so as well
3901 dpsnprintf(loadmodel->brush.skybox, sizeof(loadmodel->brush.skybox), "%s_", sky);
3908 Con_Printf("%s parsing error - expected \"{\", found \"%s\"\n", search->filenames[i], com_token);
3919 for (j = 0, out = loadmodel->brushq3.data_textures;j < loadmodel->brushq3.num_textures;j++, out++)
3921 if (out->surfaceparms == -1)
3924 Con_DPrintf("%s: No shader found for texture \"%s\"\n", loadmodel->name, out->name);
3925 out->surfaceparms = 0;
3926 // these are defaults
3927 //if (!strncmp(out->name, "textures/skies/", 15))
3928 // out->surfaceparms |= Q3SURFACEPARM_SKY;
3929 //if (!strcmp(out->name, "caulk") || !strcmp(out->name, "common/caulk") || !strcmp(out->name, "textures/common/caulk")
3930 // || !strcmp(out->name, "nodraw") || !strcmp(out->name, "common/nodraw") || !strcmp(out->name, "textures/common/nodraw"))
3931 // out->surfaceparms |= Q3SURFACEPARM_NODRAW;
3932 //if (R_TextureHasAlpha(out->skin.base))
3933 // out->surfaceparms |= Q3SURFACEPARM_TRANS;
3935 if (!Mod_LoadSkinFrame(&out->skin, out->name, (((out->textureflags & Q3TEXTUREFLAG_NOMIPMAPS) || (out->surfaceparms & Q3SURFACEPARM_NOMIPMAPS)) ? 0 : TEXF_MIPMAP) | TEXF_ALPHA | TEXF_PRECACHE | (out->textureflags & Q3TEXTUREFLAG_NOPICMIP ? 0 : TEXF_PICMIP), false, true, true))
3936 if (!Mod_LoadSkinFrame(&out->skin, out->firstpasstexturename, (((out->textureflags & Q3TEXTUREFLAG_NOMIPMAPS) || (out->surfaceparms & Q3SURFACEPARM_NOMIPMAPS)) ? 0 : TEXF_MIPMAP) | TEXF_ALPHA | TEXF_PRECACHE | (out->textureflags & Q3TEXTUREFLAG_NOPICMIP ? 0 : TEXF_PICMIP), false, true, true))
3937 Con_Printf("%s: texture loading for shader \"%s\" failed (first layer \"%s\" not found either)\n", loadmodel->name, out->name, out->firstpasstexturename);
3940 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
3943 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
3949 in = (void *)(mod_base + l->fileofs);
3950 if (l->filelen % sizeof(*in))
3951 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3952 count = l->filelen / sizeof(*in);
3953 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3955 loadmodel->brush.data_planes = out;
3956 loadmodel->brush.num_planes = count;
3958 for (i = 0;i < count;i++, in++, out++)
3960 out->normal[0] = LittleLong(in->normal[0]);
3961 out->normal[1] = LittleLong(in->normal[1]);
3962 out->normal[2] = LittleLong(in->normal[2]);
3963 out->dist = LittleLong(in->dist);
3968 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
3971 q3mbrushside_t *out;
3974 in = (void *)(mod_base + l->fileofs);
3975 if (l->filelen % sizeof(*in))
3976 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3977 count = l->filelen / sizeof(*in);
3978 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3980 loadmodel->brushq3.data_brushsides = out;
3981 loadmodel->brushq3.num_brushsides = count;
3983 for (i = 0;i < count;i++, in++, out++)
3985 n = LittleLong(in->planeindex);
3986 if (n < 0 || n >= loadmodel->brush.num_planes)
3987 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)\n", n, loadmodel->brush.num_planes);
3988 out->plane = loadmodel->brush.data_planes + n;
3989 n = LittleLong(in->textureindex);
3990 if (n < 0 || n >= loadmodel->brushq3.num_textures)
3991 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)\n", n, loadmodel->brushq3.num_textures);
3992 out->texture = loadmodel->brushq3.data_textures + n;
3996 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4000 int i, j, n, c, count, maxplanes;
4003 in = (void *)(mod_base + l->fileofs);
4004 if (l->filelen % sizeof(*in))
4005 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4006 count = l->filelen / sizeof(*in);
4007 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4009 loadmodel->brushq3.data_brushes = out;
4010 loadmodel->brushq3.num_brushes = count;
4015 for (i = 0;i < count;i++, in++, out++)
4017 n = LittleLong(in->firstbrushside);
4018 c = LittleLong(in->numbrushsides);
4019 if (n < 0 || n + c > loadmodel->brushq3.num_brushsides)
4020 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)\n", n, n + c, loadmodel->brushq3.num_brushsides);
4021 out->firstbrushside = loadmodel->brushq3.data_brushsides + n;
4022 out->numbrushsides = c;
4023 n = LittleLong(in->textureindex);
4024 if (n < 0 || n >= loadmodel->brushq3.num_textures)
4025 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)\n", n, loadmodel->brushq3.num_textures);
4026 out->texture = loadmodel->brushq3.data_textures + n;
4028 // make a list of mplane_t structs to construct a colbrush from
4029 if (maxplanes < out->numbrushsides)
4031 maxplanes = out->numbrushsides;
4034 planes = Mem_Alloc(tempmempool, sizeof(mplane_t) * maxplanes);
4036 for (j = 0;j < out->numbrushsides;j++)
4038 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4039 planes[j].dist = out->firstbrushside[j].plane->dist;
4041 // make the colbrush from the planes
4042 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4048 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4054 in = (void *)(mod_base + l->fileofs);
4055 if (l->filelen % sizeof(*in))
4056 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4057 count = l->filelen / sizeof(*in);
4058 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4060 loadmodel->brushq3.data_effects = out;
4061 loadmodel->brushq3.num_effects = count;
4063 for (i = 0;i < count;i++, in++, out++)
4065 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4066 n = LittleLong(in->brushindex);
4067 if (n < 0 || n >= loadmodel->brushq3.num_brushes)
4068 Host_Error("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes)\n", n, loadmodel->brushq3.num_brushes);
4069 out->brush = loadmodel->brushq3.data_brushes + n;
4070 out->unknown = LittleLong(in->unknown);
4074 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4079 in = (void *)(mod_base + l->fileofs);
4080 if (l->filelen % sizeof(*in))
4081 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4082 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4083 loadmodel->brushq3.data_vertex3f = Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 2 + 2 + 4)));
4084 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + count * 3;
4085 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4086 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4088 for (i = 0;i < count;i++, in++)
4090 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4091 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4092 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4093 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4094 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4095 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4096 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4097 // svector/tvector are calculated later in face loading
4098 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4099 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4100 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4101 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4105 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4111 in = (void *)(mod_base + l->fileofs);
4112 if (l->filelen % sizeof(int[3]))
4113 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4114 count = l->filelen / sizeof(*in);
4115 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4117 loadmodel->brushq3.num_triangles = count / 3;
4118 loadmodel->brushq3.data_element3i = out;
4120 for (i = 0;i < count;i++, in++, out++)
4122 *out = LittleLong(*in);
4123 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4125 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4131 static void Mod_Q3BSP_LoadLightmaps(lump_t *l)
4139 in = (void *)(mod_base + l->fileofs);
4140 if (l->filelen % sizeof(*in))
4141 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4142 count = l->filelen / sizeof(*in);
4143 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4145 loadmodel->brushq3.data_lightmaps = out;
4146 loadmodel->brushq3.num_lightmaps = count;
4148 for (i = 0;i < count;i++, in++, out++)
4149 *out = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", i), 128, 128, in->rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4152 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4154 q3dface_t *in, *oldin;
4155 q3msurface_t *out, *oldout;
4156 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshnum, meshvertices, meshtriangles, numvertices, numtriangles;
4157 //int *originalelement3i;
4158 //int *originalneighbor3i;
4159 float *originalvertex3f;
4160 //float *originalsvector3f;
4161 //float *originaltvector3f;
4162 //float *originalnormal3f;
4163 float *originalcolor4f;
4164 float *originaltexcoordtexture2f;
4165 float *originaltexcoordlightmap2f;
4167 surfmesh_t *mesh, *tempmeshlist[1024];
4169 in = (void *)(mod_base + l->fileofs);
4170 if (l->filelen % sizeof(*in))
4171 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4172 count = l->filelen / sizeof(*in);
4173 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4175 loadmodel->brushq3.data_faces = out;
4176 loadmodel->brushq3.num_faces = count;
4179 for (meshnum = 0;i < count;meshnum++)
4186 for (;i < count;i++, in++, out++)
4188 // check face type first
4189 type = LittleLong(in->type);
4190 if (type != Q3FACETYPE_POLYGON
4191 && type != Q3FACETYPE_PATCH
4192 && type != Q3FACETYPE_MESH
4193 && type != Q3FACETYPE_FLARE)
4195 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4199 n = LittleLong(in->textureindex);
4200 if (n < 0 || n >= loadmodel->brushq3.num_textures)
4202 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->brushq3.num_textures);
4205 out->texture = loadmodel->brushq3.data_textures + n;
4206 n = LittleLong(in->effectindex);
4207 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4209 if (developer.integer >= 2)
4210 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4216 out->effect = loadmodel->brushq3.data_effects + n;
4217 n = LittleLong(in->lightmapindex);
4218 if (n >= loadmodel->brushq3.num_lightmaps)
4220 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_lightmaps);
4226 out->lightmaptexture = NULL;
4228 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n];
4230 firstvertex = LittleLong(in->firstvertex);
4231 numvertices = LittleLong(in->numvertices);
4232 firstelement = LittleLong(in->firstelement);
4233 numtriangles = LittleLong(in->numelements) / 3;
4234 if (numtriangles * 3 != LittleLong(in->numelements))
4236 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));
4239 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4241 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid vertex range %i : %i (%i vertices)\n", i, out->texture->name, firstvertex, firstvertex + numvertices, loadmodel->brushq3.num_vertices);
4244 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4246 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid element range %i : %i (%i elements)\n", i, out->texture->name, firstelement, firstelement + numtriangles * 3, loadmodel->brushq3.num_triangles * 3);
4251 case Q3FACETYPE_POLYGON:
4252 case Q3FACETYPE_MESH:
4253 // no processing necessary
4255 case Q3FACETYPE_PATCH:
4256 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4257 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4258 if (numvertices != (patchsize[0] * patchsize[1]) || patchsize[0] < 3 || patchsize[1] < 3 || !(patchsize[0] & 1) || !(patchsize[1] & 1) || patchsize[0] * patchsize[1] >= min(r_subdivisions_maxvertices.integer, r_subdivisions_collision_maxvertices.integer))
4260 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4263 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4264 // convert patch to Q3FACETYPE_MESH
4265 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4266 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4267 // bound to user settings
4268 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4269 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4270 // bound to sanity settings
4271 xtess = bound(1, xtess, 1024);
4272 ytess = bound(1, ytess, 1024);
4273 // bound to user limit on vertices
4274 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4281 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4282 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4283 numvertices = finalwidth * finalheight;
4284 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4286 case Q3FACETYPE_FLARE:
4287 if (developer.integer >= 2)
4288 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4292 out->mesh.num_vertices = numvertices;
4293 out->mesh.num_triangles = numtriangles;
4294 if (meshvertices + out->mesh.num_vertices > 65536)
4296 meshvertices += out->mesh.num_vertices;
4297 meshtriangles += out->mesh.num_triangles;
4303 mesh = tempmeshlist[meshnum] = Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, 0, 0, false, false, true);
4306 for (;i < count && meshvertices + out->mesh.num_vertices <= mesh->num_vertices;i++, in++, out++)
4308 if (out->mesh.num_vertices < 3 || out->mesh.num_triangles < 1)
4311 type = LittleLong(in->type);
4312 firstvertex = LittleLong(in->firstvertex);
4313 firstelement = LittleLong(in->firstelement);
4314 out->mesh.data_vertex3f = mesh->data_vertex3f + meshvertices * 3;
4315 out->mesh.data_svector3f = mesh->data_svector3f + meshvertices * 3;
4316 out->mesh.data_tvector3f = mesh->data_tvector3f + meshvertices * 3;
4317 out->mesh.data_normal3f = mesh->data_normal3f + meshvertices * 3;
4318 out->mesh.data_texcoordtexture2f = mesh->data_texcoordtexture2f + meshvertices * 2;
4319 out->mesh.data_texcoordlightmap2f = mesh->data_texcoordlightmap2f + meshvertices * 2;
4320 out->mesh.data_lightmapcolor4f = mesh->data_lightmapcolor4f + meshvertices * 4;
4321 out->mesh.data_element3i = mesh->data_element3i + meshtriangles * 3;
4322 out->mesh.data_neighbor3i = mesh->data_neighbor3i + meshtriangles * 3;
4325 case Q3FACETYPE_POLYGON:
4326 case Q3FACETYPE_MESH:
4327 // no processing necessary
4328 for (j = 0;j < out->mesh.num_vertices;j++)
4330 out->mesh.data_vertex3f[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4331 out->mesh.data_vertex3f[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4332 out->mesh.data_vertex3f[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4333 out->mesh.data_texcoordtexture2f[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4334 out->mesh.data_texcoordtexture2f[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4335 out->mesh.data_texcoordlightmap2f[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4336 out->mesh.data_texcoordlightmap2f[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4337 out->mesh.data_lightmapcolor4f[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4338 out->mesh.data_lightmapcolor4f[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4339 out->mesh.data_lightmapcolor4f[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4340 out->mesh.data_lightmapcolor4f[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4342 for (j = 0;j < out->mesh.num_triangles*3;j++)
4343 out->mesh.data_element3i[j] = loadmodel->brushq3.data_element3i[firstelement + j];
4345 case Q3FACETYPE_PATCH:
4346 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4347 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4348 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4349 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4350 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4351 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4352 // convert patch to Q3FACETYPE_MESH
4353 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4354 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4355 // bound to user settings
4356 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4357 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4358 // bound to sanity settings
4359 xtess = bound(1, xtess, 1024);
4360 ytess = bound(1, ytess, 1024);
4361 // bound to user limit on vertices
4362 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4369 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4370 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4371 finalvertices = finalwidth * finalheight;
4372 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4373 type = Q3FACETYPE_MESH;
4374 // generate geometry
4375 // (note: normals are skipped because they get recalculated)
4376 Q3PatchTesselateFloat(3, sizeof(float[3]), out->mesh.data_vertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4377 Q3PatchTesselateFloat(2, sizeof(float[2]), out->mesh.data_texcoordtexture2f, patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4378 Q3PatchTesselateFloat(2, sizeof(float[2]), out->mesh.data_texcoordlightmap2f, patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4379 Q3PatchTesselateFloat(4, sizeof(float[4]), out->mesh.data_lightmapcolor4f, patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4380 Q3PatchTriangleElements(out->mesh.data_element3i, finalwidth, finalheight);
4381 out->mesh.num_triangles = Mod_RemoveDegenerateTriangles(out->mesh.num_triangles, out->mesh.data_element3i, out->mesh.data_element3i, out->mesh.data_vertex3f);
4382 if (developer.integer >= 2)
4384 if (out->mesh.num_triangles < finaltriangles)
4385 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->mesh.num_vertices, finaltriangles, finaltriangles - out->mesh.num_triangles, out->mesh.num_triangles);
4387 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->mesh.num_vertices, out->mesh.num_triangles);
4389 // q3map does not put in collision brushes for curves... ugh
4390 // build the lower quality collision geometry
4391 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4392 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4393 // bound to user settings
4394 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4395 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4396 // bound to sanity settings
4397 xtess = bound(1, xtess, 1024);
4398 ytess = bound(1, ytess, 1024);
4399 // bound to user limit on vertices
4400 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4407 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4408 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4409 finalvertices = finalwidth * finalheight;
4410 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4412 out->mesh.data_collisionvertex3f = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4413 out->mesh.data_collisionelement3i = Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4414 out->mesh.num_collisionvertices = finalvertices;
4415 out->mesh.num_collisiontriangles = finaltriangles;
4416 Q3PatchTesselateFloat(3, sizeof(float[3]), out->mesh.data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4417 Q3PatchTriangleElements(out->mesh.data_collisionelement3i, finalwidth, finalheight);
4419 //Mod_SnapVertices(3, out->mesh.num_vertices, out->mesh.data_vertex3f, 0.25);
4420 Mod_SnapVertices(3, out->mesh.num_collisionvertices, out->mesh.data_collisionvertex3f, 1);
4422 oldnumtriangles = out->mesh.num_triangles;
4423 oldnumtriangles2 = out->mesh.num_collisiontriangles;
4424 out->mesh.num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->mesh.num_collisiontriangles, out->mesh.data_collisionelement3i, out->mesh.data_collisionelement3i, out->mesh.data_collisionvertex3f);
4425 if (developer.integer)
4426 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve became %i:%i vertices / %i:%i triangles (%i:%i degenerate)\n", patchsize[0], patchsize[1], out->mesh.num_vertices, out->mesh.num_collisionvertices, oldnumtriangles, oldnumtriangles2, oldnumtriangles - out->mesh.num_triangles, oldnumtriangles2 - out->mesh.num_collisiontriangles);
4431 meshvertices += out->mesh.num_vertices;
4432 meshtriangles += out->mesh.num_triangles;
4433 for (j = 0, invalidelements = 0;j < out->mesh.num_triangles * 3;j++)
4434 if (out->mesh.data_element3i[j] < 0 || out->mesh.data_element3i[j] >= out->mesh.num_vertices)
4436 if (invalidelements)
4438 Con_Printf("Mod_Q3BSP_LoadFaces: Warning: face #%i has %i invalid elements, type = %i, texture->name = \"%s\", texture->surfaceflags = %i, firstvertex = %i, numvertices = %i, firstelement = %i, numelements = %i, elements list:\n", i, invalidelements, type, out->texture->name, out->texture->surfaceflags, firstvertex, out->mesh.num_vertices, firstelement, out->mesh.num_triangles * 3);
4439 for (j = 0;j < out->mesh.num_triangles * 3;j++)
4441 Con_Printf(" %i", out->mesh.data_element3i[j]);
4442 if (out->mesh.data_element3i[j] < 0 || out->mesh.data_element3i[j] >= out->mesh.num_vertices)
4443 out->mesh.data_element3i[j] = 0;
4447 // for shadow volumes
4448 Mod_BuildTriangleNeighbors(out->mesh.data_neighbor3i, out->mesh.data_element3i, out->mesh.num_triangles);
4449 // for per pixel lighting
4450 Mod_BuildTextureVectorsAndNormals(out->mesh.num_vertices, out->mesh.num_triangles, out->mesh.data_vertex3f, out->mesh.data_texcoordtexture2f, out->mesh.data_element3i, out->mesh.data_svector3f, out->mesh.data_tvector3f, out->mesh.data_normal3f);
4451 // calculate a bounding box
4452 VectorClear(out->mins);
4453 VectorClear(out->maxs);
4454 if (out->mesh.num_vertices)
4456 VectorCopy(out->mesh.data_vertex3f, out->mins);
4457 VectorCopy(out->mesh.data_vertex3f, out->maxs);
4458 for (j = 1, v = out->mesh.data_vertex3f + 3;j < out->mesh.num_vertices;j++, v += 3)
4460 out->mins[0] = min(out->mins[0], v[0]);
4461 out->maxs[0] = max(out->maxs[0], v[0]);
4462 out->mins[1] = min(out->mins[1], v[1]);
4463 out->maxs[1] = max(out->maxs[1], v[1]);
4464 out->mins[2] = min(out->mins[2], v[2]);
4465 out->maxs[2] = max(out->maxs[2], v[2]);
4467 out->mins[0] -= 1.0f;
4468 out->mins[1] -= 1.0f;
4469 out->mins[2] -= 1.0f;
4470 out->maxs[0] += 1.0f;
4471 out->maxs[1] += 1.0f;
4472 out->maxs[2] += 1.0f;
4477 // now store the completed list of meshes
4478 loadmodel->nummeshes = meshnum;
4479 if (loadmodel->nummeshes)
4481 loadmodel->meshlist = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4482 memcpy(loadmodel->meshlist, tempmeshlist, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4485 // free the no longer needed vertex data
4486 loadmodel->brushq3.num_vertices = 0;
4487 Mem_Free(loadmodel->brushq3.data_vertex3f);
4488 loadmodel->brushq3.data_vertex3f = NULL;
4489 loadmodel->brushq3.data_texcoordtexture2f = NULL;
4490 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4491 loadmodel->brushq3.data_color4f = NULL;
4492 // free the no longer needed triangle data
4493 loadmodel->brushq3.num_triangles = 0;
4494 Mem_Free(loadmodel->brushq3.data_element3i);
4495 loadmodel->brushq3.data_element3i = NULL;
4498 static void Mod_Q3BSP_LoadModels(lump_t *l)
4502 int i, j, n, c, count;
4504 in = (void *)(mod_base + l->fileofs);
4505 if (l->filelen % sizeof(*in))
4506 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4507 count = l->filelen / sizeof(*in);
4508 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4510 loadmodel->brushq3.data_models = out;
4511 loadmodel->brushq3.num_models = count;
4513 for (i = 0;i < count;i++, in++, out++)
4515 for (j = 0;j < 3;j++)
4517 out->mins[j] = LittleFloat(in->mins[j]);
4518 out->maxs[j] = LittleFloat(in->maxs[j]);
4520 n = LittleLong(in->firstface);
4521 c = LittleLong(in->numfaces);
4522 if (n < 0 || n + c > loadmodel->brushq3.num_faces)
4523 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)\n", n, n + c, loadmodel->brushq3.num_faces);
4524 out->firstface = loadmodel->brushq3.data_faces + n;
4526 n = LittleLong(in->firstbrush);
4527 c = LittleLong(in->numbrushes);
4528 if (n < 0 || n + c > loadmodel->brushq3.num_brushes)
4529 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)\n", n, n + c, loadmodel->brushq3.num_brushes);
4530 out->firstbrush = loadmodel->brushq3.data_brushes + n;
4531 out->numbrushes = c;
4535 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4541 in = (void *)(mod_base + l->fileofs);
4542 if (l->filelen % sizeof(*in))
4543 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4544 count = l->filelen / sizeof(*in);
4545 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4547 loadmodel->brush.data_leafbrushes = out;
4548 loadmodel->brush.num_leafbrushes = count;
4550 for (i = 0;i < count;i++, in++, out++)
4552 n = LittleLong(*in);
4553 if (n < 0 || n >= loadmodel->brushq3.num_brushes)
4554 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)\n", n, loadmodel->brushq3.num_brushes);
4559 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4565 in = (void *)(mod_base + l->fileofs);
4566 if (l->filelen % sizeof(*in))
4567 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4568 count = l->filelen / sizeof(*in);
4569 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4571 loadmodel->brush.data_leaffaces = out;
4572 loadmodel->brush.num_leaffaces = count;
4574 for (i = 0;i < count;i++, in++, out++)
4576 n = LittleLong(*in);
4577 if (n < 0 || n >= loadmodel->brushq3.num_faces)
4578 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)\n", n, loadmodel->brushq3.num_faces);
4583 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4587 int i, j, n, c, count;
4589 in = (void *)(mod_base + l->fileofs);
4590 if (l->filelen % sizeof(*in))
4591 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4592 count = l->filelen / sizeof(*in);
4593 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4595 loadmodel->brush.data_leafs = out;
4596 loadmodel->brush.num_leafs = count;
4598 for (i = 0;i < count;i++, in++, out++)
4602 out->clusterindex = LittleLong(in->clusterindex);
4603 out->areaindex = LittleLong(in->areaindex);
4604 for (j = 0;j < 3;j++)
4606 // yes the mins/maxs are ints
4607 out->mins[j] = LittleLong(in->mins[j]) - 1;
4608 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4610 n = LittleLong(in->firstleafface);
4611 c = LittleLong(in->numleaffaces);
4612 if (n < 0 || n + c > loadmodel->brush.num_leaffaces)
4613 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafface range %i : %i (%i leaffaces)\n", n, n + c, loadmodel->brush.num_leaffaces);
4614 out->firstleafface = loadmodel->brush.data_leaffaces + n;
4615 out->numleaffaces = c;
4616 n = LittleLong(in->firstleafbrush);
4617 c = LittleLong(in->numleafbrushes);
4618 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
4619 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)\n", n, n + c, loadmodel->brush.num_leafbrushes);
4620 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
4621 out->numleafbrushes = c;
4625 static void Mod_Q3BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
4628 Host_Error("Mod_Q3BSP_LoadNodes_RecursiveSetParent: runaway recursion\n");
4629 node->parent = parent;
4632 Mod_Q3BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
4633 Mod_Q3BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
4637 static void Mod_Q3BSP_LoadNodes(lump_t *l)
4643 in = (void *)(mod_base + l->fileofs);
4644 if (l->filelen % sizeof(*in))
4645 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4646 count = l->filelen / sizeof(*in);
4647 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4649 loadmodel->brush.data_nodes = out;
4650 loadmodel->brush.num_nodes = count;
4652 for (i = 0;i < count;i++, in++, out++)
4655 n = LittleLong(in->planeindex);
4656 if (n < 0 || n >= loadmodel->brush.num_planes)
4657 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)\n", n, loadmodel->brush.num_planes);
4658 out->plane = loadmodel->brush.data_planes + n;
4659 for (j = 0;j < 2;j++)
4661 n = LittleLong(in->childrenindex[j]);
4664 if (n >= loadmodel->brush.num_nodes)
4665 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)\n", n, loadmodel->brush.num_nodes);
4666 out->children[j] = loadmodel->brush.data_nodes + n;
4671 if (n >= loadmodel->brush.num_leafs)
4672 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)\n", n, loadmodel->brush.num_leafs);
4673 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
4676 for (j = 0;j < 3;j++)
4678 // yes the mins/maxs are ints
4679 out->mins[j] = LittleLong(in->mins[j]) - 1;
4680 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4684 // set the parent pointers
4685 Mod_Q3BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
4688 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
4691 q3dlightgrid_t *out;
4694 in = (void *)(mod_base + l->fileofs);
4695 if (l->filelen % sizeof(*in))
4696 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
4697 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
4698 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
4699 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
4700 loadmodel->brushq3.num_lightgrid_imins[0] = ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4701 loadmodel->brushq3.num_lightgrid_imins[1] = ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4702 loadmodel->brushq3.num_lightgrid_imins[2] = ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4703 loadmodel->brushq3.num_lightgrid_imaxs[0] = floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4704 loadmodel->brushq3.num_lightgrid_imaxs[1] = floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4705 loadmodel->brushq3.num_lightgrid_imaxs[2] = floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4706 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
4707 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
4708 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
4709 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
4712 if (l->filelen < count * (int)sizeof(*in))
4713 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]);
4714 if (l->filelen != count * (int)sizeof(*in))
4715 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", count * sizeof(*in), l->filelen);
4718 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4719 loadmodel->brushq3.data_lightgrid = out;
4720 loadmodel->brushq3.num_lightgrid = count;
4722 // no swapping or validation necessary
4724 memcpy(out, in, count * (int)sizeof(*out));
4727 // no data, fill with white
4729 for (i = 0;i < count;i++)
4731 out[i].ambientrgb[0] = 128;
4732 out[i].ambientrgb[1] = 128;
4733 out[i].ambientrgb[2] = 128;
4734 out[i].diffusergb[0] = 0;
4735 out[i].diffusergb[1] = 0;
4736 out[i].diffusergb[2] = 0;
4737 out[i].diffusepitch = 0;
4738 out[i].diffuseyaw = 0;
4742 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]);
4743 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]);
4746 static void Mod_Q3BSP_LoadPVS(lump_t *l)
4751 if (l->filelen == 0)
4754 // unvised maps often have cluster indices even without pvs, so check
4755 // leafs to find real number of clusters
4756 loadmodel->brush.num_pvsclusters = 1;
4757 for (i = 0;i < loadmodel->brush.num_leafs;i++)
4758 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
4761 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
4762 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4763 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4764 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
4768 in = (void *)(mod_base + l->fileofs);
4770 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
4772 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
4773 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
4774 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
4775 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8\n", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
4776 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4777 if (l->filelen < totalchains + (int)sizeof(*in))
4778 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);
4780 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4781 memcpy(loadmodel->brush.data_pvsclusters, (qbyte *)(in + 1), totalchains);
4784 static void Mod_Q3BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, vec_t radius)
4786 // FIXME: finish this code
4787 VectorCopy(in, out);
4790 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
4792 int i, j, k, index[3];
4793 float transformed[3], blend1, blend2, blend, yaw, pitch, sinpitch;
4794 q3dlightgrid_t *a, *s;
4795 // FIXME: write this
4796 if (!model->brushq3.num_lightgrid)
4798 ambientcolor[0] = 1;
4799 ambientcolor[1] = 1;
4800 ambientcolor[2] = 1;
4803 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
4804 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
4805 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
4806 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
4807 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
4808 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
4809 index[0] = (int)floor(transformed[0]);
4810 index[1] = (int)floor(transformed[1]);
4811 index[2] = (int)floor(transformed[2]);
4812 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
4813 // now lerp the values
4814 VectorClear(diffusenormal);
4815 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
4816 for (k = 0;k < 2;k++)
4818 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
4819 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
4821 for (j = 0;j < 2;j++)
4823 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
4824 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
4826 for (i = 0;i < 2;i++)
4828 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0])));
4829 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
4831 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
4832 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
4833 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
4834 pitch = s->diffusepitch * M_PI / 128;
4835 yaw = s->diffuseyaw * M_PI / 128;
4836 sinpitch = sin(pitch);
4837 diffusenormal[0] += blend * (cos(yaw) * sinpitch);
4838 diffusenormal[1] += blend * (sin(yaw) * sinpitch);
4839 diffusenormal[2] += blend * (cos(pitch));
4840 //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)));
4844 VectorNormalize(diffusenormal);
4845 //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]);
4848 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t point, int markframe)
4853 // find which leaf the point is in
4855 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
4856 // point trace the brushes
4857 leaf = (mleaf_t *)node;
4858 for (i = 0;i < leaf->numleafbrushes;i++)
4860 brush = model->brushq3.data_brushes[leaf->firstleafbrush[i]].colbrushf;
4861 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
4863 brush->markframe = markframe;
4864 Collision_TracePointBrushFloat(trace, point, brush);
4867 // can't do point traces on curves (they have no thickness)
4870 static void Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t start, const vec3_t end, vec_t startfrac, vec_t endfrac, const vec3_t linestart, const vec3_t lineend, int markframe, const vec3_t segmentmins, const vec3_t segmentmaxs)
4872 int i, startside, endside;
4873 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
4877 if (startfrac > trace->realfraction)
4879 // note: all line fragments past first impact fraction are ignored
4880 if (VectorCompare(start, end))
4882 // find which leaf the point is in
4884 node = node->children[DotProduct(start, node->plane->normal) < node->plane->dist];
4888 // find which nodes the line is in and recurse for them
4891 // recurse down node sides
4892 dist1 = PlaneDiff(start, node->plane);
4893 dist2 = PlaneDiff(end, node->plane);
4894 startside = dist1 < 0;
4895 endside = dist2 < 0;
4896 if (startside == endside)
4898 // most of the time the line fragment is on one side of the plane
4899 node = node->children[startside];
4903 // line crosses node plane, split the line
4904 midfrac = dist1 / (dist1 - dist2);
4905 VectorLerp(start, midfrac, end, mid);
4906 // take the near side first
4907 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4908 if (midfrac <= trace->realfraction)
4909 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4915 nodesegmentmins[0] = min(start[0], end[0]);
4916 nodesegmentmins[1] = min(start[1], end[1]);
4917 nodesegmentmins[2] = min(start[2], end[2]);
4918 nodesegmentmaxs[0] = max(start[0], end[0]);
4919 nodesegmentmaxs[1] = max(start[1], end[1]);
4920 nodesegmentmaxs[2] = max(start[2], end[2]);
4921 // line trace the brushes
4922 leaf = (mleaf_t *)node;
4923 for (i = 0;i < leaf->numleafbrushes;i++)
4925 brush = model->brushq3.data_brushes[leaf->firstleafbrush[i]].colbrushf;
4926 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
4928 brush->markframe = markframe;
4929 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
4930 if (startfrac > trace->realfraction)
4934 // can't do point traces on curves (they have no thickness)
4935 if (mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
4937 // line trace the curves
4938 for (i = 0;i < leaf->numleaffaces;i++)
4940 face = model->brushq3.data_faces + leaf->firstleafface[i];
4941 if (face->mesh.num_collisiontriangles && face->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, face->mins, face->maxs))
4943 face->collisionmarkframe = markframe;
4944 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, face->mesh.num_collisiontriangles, face->mesh.data_collisionelement3i, face->mesh.data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
4945 if (startfrac > trace->realfraction)
4952 static void Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, int markframe, const vec3_t segmentmins, const vec3_t segmentmaxs)
4956 float nodesegmentmins[3], nodesegmentmaxs[3];
4961 // find which nodes the line is in and recurse for them
4964 // recurse down node sides
4965 int startside, endside;
4966 float dist1near, dist1far, dist2near, dist2far;
4967 BoxPlaneCornerDistances(thisbrush_start->mins, thisbrush_start->maxs, node->plane, &dist1near, &dist1far);
4968 BoxPlaneCornerDistances(thisbrush_end->mins, thisbrush_end->maxs, node->plane, &dist2near, &dist2far);
4969 startside = dist1near < 0;
4970 startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
4971 endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
4972 if (startside == 2 || endside == 2)
4974 // brushes cross plane
4975 // do not clip anything, just take both sides
4976 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
4977 node = node->children[1];
4984 node = node->children[0];
4989 //midf0 = dist1near / (dist1near - dist2near);
4990 //midf1 = dist1far / (dist1far - dist2far);
4991 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
4992 node = node->children[1];
5000 //midf0 = dist1near / (dist1near - dist2near);
5001 //midf1 = dist1far / (dist1far - dist2far);
5002 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5003 node = node->children[1];
5008 node = node->children[1];
5013 if (dist1near < 0 && dist2near < 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
5014 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;}
5015 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;}
5016 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;}
5017 if (dist1near < 0 && dist2near >= 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
5018 if (dist1near < 0 && dist2near >= 0 && dist1far < 0 && dist2far >= 0){}
5019 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;}
5020 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;}
5021 if (dist1near >= 0 && dist2near < 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
5022 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;}
5023 if (dist1near >= 0 && dist2near < 0 && dist1far >= 0 && dist2far < 0){}
5024 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;}
5025 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;}
5026 if (dist1near >= 0 && dist2near >= 0 && dist1far < 0 && dist2far >= 0){node = node->children[0];continue;}
5027 if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far < 0){node = node->children[0];continue;}
5028 if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){node = node->children[0];continue;}
5030 if (dist2near < 0) // d1n<0 && d2n<0
5032 if (dist2near < 0) // d1n<0 && d2n<0
5034 if (dist2near < 0) // d1n<0 && d2n<0
5037 else // d1n<0 && d2n>0
5041 else // d1n<0 && d2n>0
5043 if (dist2near < 0) // d1n<0 && d2n<0
5046 else // d1n<0 && d2n>0
5051 else // d1n<0 && d2n>0
5057 if (dist2near < 0) // d1n>0 && d2n<0
5060 else // d1n>0 && d2n>0
5064 if (dist1near < 0 == dist1far < 0 == dist2near < 0 == dist2far < 0)
5066 node = node->children[startside];
5069 if (dist1near < dist2near)
5074 node = node->children[0];
5079 node = node->children[1];
5082 // dist1near < 0 && dist2far >= 0
5088 startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
5089 endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
5090 if (startside == 2 || endside == 2)
5092 // brushes cross plane
5093 // do not clip anything, just take both sides
5094 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5095 node = node->children[1];
5097 else if (startside == endside)
5098 node = node->children[startside];
5099 else if (startside == 0) // endside = 1 (start infront, end behind)
5102 else // startside == 1 endside = 0 (start behind, end infront)
5108 node = node->children[startside];
5111 // start and end brush cross plane
5117 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5118 node = node->children[1];
5119 else if (dist1near < 0 && dist1far < 0 && dist2near >= 0 && dist2far >= 0)
5120 else if (dist1near >= 0 && dist1far >= 0 && dist2near < 0 && dist2far < 0)
5121 else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5122 node = node->children[0];
5124 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5125 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5126 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5127 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5128 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5131 else if (dist1near >= 0 && dist1far >= 0)
5134 else // mixed (lying on plane)
5138 if (dist2near < 0 && dist2far < 0)
5142 node = node->children[1];
5144 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5145 node = node->children[0];
5146 else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5147 node = node->children[1];
5151 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5152 node = node->children[1];
5154 sides = dist1near || dist1near < 0 | dist1far < 0 | dist2near < 0 | dist
5155 startside = dist1 < 0;
5156 endside = dist2 < 0;
5157 if (startside == endside)
5159 // most of the time the line fragment is on one side of the plane
5160 node = node->children[startside];
5164 // line crosses node plane, split the line
5165 midfrac = dist1 / (dist1 - dist2);
5166 VectorLerp(start, midfrac, end, mid);
5167 // take the near side first
5168 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5169 if (midfrac <= trace->fraction)
5170 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5178 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5179 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5180 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5181 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5182 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5183 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5184 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5188 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5189 node = node->children[1];
5192 // FIXME: could be made faster by copying TraceLine code and making it use
5193 // box plane distances... (variant on the BoxOnPlaneSide code)
5196 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5197 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5198 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5199 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5200 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5201 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5202 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5206 if (mod_q3bsp_debugtracebrush.integer == 2)
5208 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5209 node = node->children[1];
5212 else if (mod_q3bsp_debugtracebrush.integer == 1)
5214 // recurse down node sides
5215 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5218 // segment box crosses plane
5219 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5220 node = node->children[1];
5223 // take whichever side the segment box is on
5224 node = node->children[sides - 1];
5229 // recurse down node sides
5230 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5233 // segment box crosses plane
5234 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5235 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5238 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5239 node = node->children[1];
5243 // take whichever side the segment box is on
5244 node = node->children[sides - 1];
5250 // FIXME: could be made faster by copying TraceLine code and making it use
5251 // box plane distances... (variant on the BoxOnPlaneSide code)
5254 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5255 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5256 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5257 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5258 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5259 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5260 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5264 if (mod_q3bsp_debugtracebrush.integer == 2)
5266 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5267 node = node->children[1];
5269 else if (mod_q3bsp_debugtracebrush.integer == 1)
5271 // recurse down node sides
5272 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5275 // segment box crosses plane
5276 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5277 node = node->children[1];
5281 // take whichever side the segment box is on
5282 node = node->children[sides - 1];
5287 // recurse down node sides
5288 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5291 // segment box crosses plane
5292 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5293 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5296 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5300 // take whichever side the segment box is on
5301 node = node->children[sides - 1];
5306 leaf = (mleaf_t *)node;
5307 for (i = 0;i < leaf->numleafbrushes;i++)
5309 brush = model->brushq3.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5310 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5312 brush->markframe = markframe;
5313 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5316 if (mod_q3bsp_curves_collisions.integer)
5318 for (i = 0;i < leaf->numleaffaces;i++)
5320 face = model->brushq3.data_faces + leaf->firstleafface[i];
5321 if (face->mesh.num_collisiontriangles && face->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, face->mins, face->maxs))
5323 face->collisionmarkframe = markframe;
5324 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, face->mesh.num_collisiontriangles, face->mesh.data_collisionelement3i, face->mesh.data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5330 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)
5333 float segmentmins[3], segmentmaxs[3];
5334 colbrushf_t *thisbrush_start, *thisbrush_end;
5335 matrix4x4_t startmatrix, endmatrix;
5336 static int markframe = 0;
5338 memset(trace, 0, sizeof(*trace));
5339 trace->fraction = 1;
5340 trace->realfraction = 1;
5341 trace->hitsupercontentsmask = hitsupercontentsmask;
5342 Matrix4x4_CreateIdentity(&startmatrix);
5343 Matrix4x4_CreateIdentity(&endmatrix);
5344 segmentmins[0] = min(boxstartmins[0], boxendmins[0]);
5345 segmentmins[1] = min(boxstartmins[1], boxendmins[1]);
5346 segmentmins[2] = min(boxstartmins[2], boxendmins[2]);
5347 segmentmaxs[0] = max(boxstartmaxs[0], boxendmaxs[0]);
5348 segmentmaxs[1] = max(boxstartmaxs[1], boxendmaxs[1]);
5349 segmentmaxs[2] = max(boxstartmaxs[2], boxendmaxs[2]);
5350 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxstartmins, boxstartmaxs) && VectorCompare(boxendmins, boxendmaxs))
5352 if (VectorCompare(boxstartmins, boxendmins))
5355 if (model->brush.submodel)
5357 for (i = 0;i < model->brushq3.data_models[model->brush.submodel].numbrushes;i++)
5358 if (model->brushq3.data_models[model->brush.submodel].firstbrush[i].colbrushf)
5359 Collision_TracePointBrushFloat(trace, boxstartmins, model->brushq3.data_models[model->brush.submodel].firstbrush[i].colbrushf);
5362 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, boxstartmins, ++markframe);
5367 if (model->brush.submodel)
5369 for (i = 0;i < model->brushq3.data_models[model->brush.submodel].numbrushes;i++)
5370 if (model->brushq3.data_models[model->brush.submodel].firstbrush[i].colbrushf)
5371 Collision_TraceLineBrushFloat(trace, boxstartmins, boxendmins, model->brushq3.data_models[model->brush.submodel].firstbrush[i].colbrushf, model->brushq3.data_models[model->brush.submodel].firstbrush[i].colbrushf);
5372 if (mod_q3bsp_curves_collisions.integer)
5374 for (i = 0;i < model->brushq3.data_models[model->brush.submodel].numfaces;i++)
5376 face = model->brushq3.data_models[model->brush.submodel].firstface + i;
5377 if (face->mesh.num_collisiontriangles)
5378 Collision_TraceLineTriangleMeshFloat(trace, boxstartmins, boxendmins, face->mesh.num_collisiontriangles, face->mesh.data_collisionelement3i, face->mesh.data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5383 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, boxstartmins, boxendmins, 0, 1, boxstartmins, boxendmins, ++markframe, segmentmins, segmentmaxs);
5388 // box trace, performed as brush trace
5389 thisbrush_start = Collision_BrushForBox(&startmatrix, boxstartmins, boxstartmaxs);
5390 thisbrush_end = Collision_BrushForBox(&endmatrix, boxendmins, boxendmaxs);
5391 if (model->brush.submodel)
5393 for (i = 0;i < model->brushq3.data_models[model->brush.submodel].numbrushes;i++)
5394 if (model->brushq3.data_models[model->brush.submodel].firstbrush[i].colbrushf)
5395 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, model->brushq3.data_models[model->brush.submodel].firstbrush[i].colbrushf, model->brushq3.data_models[model->brush.submodel].firstbrush[i].colbrushf);
5396 if (mod_q3bsp_curves_collisions.integer)
5398 for (i = 0;i < model->brushq3.data_models[model->brush.submodel].numfaces;i++)
5400 face = model->brushq3.data_models[model->brush.submodel].firstface + i;
5401 if (face->mesh.num_collisiontriangles)
5402 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, face->mesh.num_collisiontriangles, face->mesh.data_collisionelement3i, face->mesh.data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5407 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5411 static int Mod_Q3BSP_BoxTouchingPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
5413 int clusterindex, side, nodestackindex = 0;
5414 mnode_t *node, *nodestack[1024];
5415 node = model->brush.data_nodes;
5416 if (!model->brush.num_pvsclusters)
5422 // node - recurse down the BSP tree
5423 side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
5426 // box is on one side of plane, take that path
5427 node = node->children[side];
5431 // box crosses plane, take one path and remember the other
5432 if (nodestackindex < 1024)
5433 nodestack[nodestackindex++] = node->children[0];
5434 node = node->children[1];
5439 // leaf - check cluster bit
5440 clusterindex = ((mleaf_t *)node)->clusterindex;
5442 if (clusterindex >= model->brush.num_pvsclusters)
5444 Con_Printf("%i >= %i\n", clusterindex, model->brush.num_pvsclusters);
5448 if (CHECKPVSBIT(pvs, clusterindex))
5450 // it is visible, return immediately with the news
5455 // nothing to see here, try another path we didn't take earlier
5456 if (nodestackindex == 0)
5458 node = nodestack[--nodestackindex];
5462 // it is not visible
5466 //Returns PVS data for a given point
5467 //(note: can return NULL)
5468 static qbyte *Mod_Q3BSP_GetPVS(model_t *model, const vec3_t p)
5471 Mod_CheckLoaded(model);
5472 node = model->brush.data_nodes;
5474 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
5475 if (((mleaf_t *)node)->clusterindex >= 0)
5476 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
5481 static void Mod_Q3BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, mnode_t *node)
5485 float d = PlaneDiff(org, node->plane);
5487 node = node->children[0];
5488 else if (d < -radius)
5489 node = node->children[1];
5492 // go down both sides
5493 Mod_Q3BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
5494 node = node->children[1];
5497 // if this leaf is in a cluster, accumulate the pvs bits
5498 if (((mleaf_t *)node)->clusterindex >= 0)
5501 qbyte *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
5502 for (i = 0;i < pvsbytes;i++)
5503 pvsbuffer[i] |= pvs[i];
5507 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
5508 //of the given point.
5509 static int Mod_Q3BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
5511 int bytes = model->brush.num_pvsclusterbytes;
5512 bytes = min(bytes, pvsbufferlength);
5513 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q3BSP_GetPVS(model, org))
5515 memset(pvsbuffer, 0xFF, bytes);
5518 memset(pvsbuffer, 0, bytes);
5519 Mod_Q3BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
5524 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5526 int supercontents = 0;
5527 if (nativecontents & CONTENTSQ3_SOLID)
5528 supercontents |= SUPERCONTENTS_SOLID;
5529 if (nativecontents & CONTENTSQ3_WATER)
5530 supercontents |= SUPERCONTENTS_WATER;
5531 if (nativecontents & CONTENTSQ3_SLIME)
5532 supercontents |= SUPERCONTENTS_SLIME;
5533 if (nativecontents & CONTENTSQ3_LAVA)
5534 supercontents |= SUPERCONTENTS_LAVA;
5535 if (nativecontents & CONTENTSQ3_BODY)
5536 supercontents |= SUPERCONTENTS_BODY;
5537 if (nativecontents & CONTENTSQ3_CORPSE)
5538 supercontents |= SUPERCONTENTS_CORPSE;
5539 if (nativecontents & CONTENTSQ3_NODROP)
5540 supercontents |= SUPERCONTENTS_NODROP;
5541 return supercontents;
5544 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5546 int nativecontents = 0;
5547 if (supercontents & SUPERCONTENTS_SOLID)
5548 nativecontents |= CONTENTSQ3_SOLID;
5549 if (supercontents & SUPERCONTENTS_WATER)
5550 nativecontents |= CONTENTSQ3_WATER;
5551 if (supercontents & SUPERCONTENTS_SLIME)
5552 nativecontents |= CONTENTSQ3_SLIME;
5553 if (supercontents & SUPERCONTENTS_LAVA)
5554 nativecontents |= CONTENTSQ3_LAVA;
5555 if (supercontents & SUPERCONTENTS_BODY)
5556 nativecontents |= CONTENTSQ3_BODY;
5557 if (supercontents & SUPERCONTENTS_CORPSE)
5558 nativecontents |= CONTENTSQ3_CORPSE;
5559 if (supercontents & SUPERCONTENTS_NODROP)
5560 nativecontents |= CONTENTSQ3_NODROP;
5561 return nativecontents;
5564 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5569 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5570 node = node->children[1];
5572 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5573 if (loadmodel->brush.num_leafs < numleafs)
5574 loadmodel->brush.num_leafs = numleafs;
5577 extern void R_Q3BSP_DrawSky(struct entity_render_s *ent);
5578 extern void R_Q3BSP_Draw(struct entity_render_s *ent);
5579 extern void R_Q3BSP_GetLightInfo(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, vec3_t outmins, vec3_t outmaxs, int *outclusterlist, qbyte *outclusterpvs, int *outnumclusterspointer, int *outsurfacelist, qbyte *outsurfacepvs, int *outnumsurfacespointer);
5580 extern void R_Q3BSP_DrawShadowVolume(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, int numsurfaces, const int *surfacelist);
5581 extern void R_Q3BSP_DrawLight(entity_render_t *ent, vec3_t relativelightorigin, vec3_t relativeeyeorigin, float lightradius, float *lightcolor, const matrix4x4_t *matrix_modeltolight, const matrix4x4_t *matrix_modeltoattenuationxyz, const matrix4x4_t *matrix_modeltoattenuationz, rtexture_t *lightcubemap, vec_t ambientscale, vec_t diffusescale, vec_t specularscale, int numsurfaces, const int *surfacelist);
5582 void Mod_Q3BSP_Load(model_t *mod, void *buffer)
5584 int i, j, numshadowmeshtriangles;
5585 q3dheader_t *header;
5586 float corner[3], yawradius, modelradius;
5589 mod->type = mod_brushq3;
5590 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5593 header = (q3dheader_t *)buffer;
5595 i = LittleLong(header->version);
5596 if (i != Q3BSPVERSION)
5597 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5598 if (mod->isworldmodel)
5599 Cvar_SetValue("halflifebsp", false);
5601 mod->soundfromcenter = true;
5602 mod->TraceBox = Mod_Q3BSP_TraceBox;
5603 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5604 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5605 mod->brush.GetPVS = Mod_Q3BSP_GetPVS;
5606 mod->brush.FatPVS = Mod_Q3BSP_FatPVS;
5607 mod->brush.BoxTouchingPVS = Mod_Q3BSP_BoxTouchingPVS;
5608 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5609 mod->brush.FindNonSolidLocation = Mod_Q3BSP_FindNonSolidLocation;
5610 //mod->DrawSky = R_Q3BSP_DrawSky;
5611 mod->Draw = R_Q3BSP_Draw;
5612 mod->GetLightInfo = R_Q3BSP_GetLightInfo;
5613 mod->DrawShadowVolume = R_Q3BSP_DrawShadowVolume;
5614 mod->DrawLight = R_Q3BSP_DrawLight;
5616 mod_base = (qbyte *)header;
5618 // swap all the lumps
5619 header->ident = LittleLong(header->ident);
5620 header->version = LittleLong(header->version);
5621 for (i = 0;i < Q3HEADER_LUMPS;i++)
5623 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5624 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5627 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5628 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5629 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5630 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5631 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5632 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5633 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5634 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5635 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS]);
5636 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5637 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5638 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5639 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5640 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5641 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5642 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5643 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5644 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5646 // make a single combined shadow mesh to allow optimized shadow volume creation
5647 numshadowmeshtriangles = 0;
5648 for (j = 0, face = loadmodel->brushq3.data_faces;j < loadmodel->brushq3.num_faces;j++, face++)
5650 face->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5651 numshadowmeshtriangles += face->mesh.num_triangles;
5653 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5654 for (j = 0, face = loadmodel->brushq3.data_faces;j < loadmodel->brushq3.num_faces;j++, face++)
5655 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, face->mesh.data_vertex3f, NULL, NULL, NULL, NULL, face->mesh.num_triangles, face->mesh.data_element3i);
5656 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
5657 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5659 loadmodel->brush.num_leafs = 0;
5660 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5663 for (i = 0;i < loadmodel->brushq3.num_models;i++)
5668 // LordHavoc: only register submodels if it is the world
5669 // (prevents external bsp models from replacing world submodels with
5671 if (!loadmodel->isworldmodel)
5673 // duplicate the basic information
5674 sprintf(name, "*%i", i);
5675 mod = Mod_FindName(name);
5677 strcpy(mod->name, name);
5678 // textures and memory belong to the main model
5679 mod->texturepool = NULL;
5680 mod->mempool = NULL;
5681 mod->brush.GetPVS = NULL;
5682 mod->brush.FatPVS = NULL;
5683 mod->brush.BoxTouchingPVS = NULL;
5684 mod->brush.LightPoint = NULL;
5685 mod->brush.FindNonSolidLocation = Mod_Q3BSP_FindNonSolidLocation;
5687 mod->brush.submodel = i;
5689 // make the model surface list (used by shadowing/lighting)
5690 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5691 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5692 for (j = 0;j < mod->nummodelsurfaces;j++)
5693 mod->surfacelist[j] = (mod->brushq3.data_models[i].firstface - mod->brushq3.data_faces) + j;
5695 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5696 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5697 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5698 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5699 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5700 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5701 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5702 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5703 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5704 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5705 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5706 mod->yawmins[2] = mod->normalmins[2];
5707 mod->yawmaxs[2] = mod->normalmaxs[2];
5708 mod->radius = modelradius;
5709 mod->radius2 = modelradius * modelradius;
5711 for (j = 0;j < mod->brushq3.data_models[i].numfaces;j++)
5712 if (mod->brushq3.data_models[i].firstface[j].texture->surfaceflags & Q3SURFACEFLAG_SKY)
5714 if (j < mod->brushq3.data_models[i].numfaces)
5715 mod->DrawSky = R_Q3BSP_DrawSky;
5719 void Mod_IBSP_Load(model_t *mod, void *buffer)
5721 int i = LittleLong(((int *)buffer)[1]);
5722 if (i == Q3BSPVERSION)
5723 Mod_Q3BSP_Load(mod,buffer);
5724 else if (i == Q2BSPVERSION)
5725 Mod_Q2BSP_Load(mod,buffer);
5727 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i\n", i);
5730 void Mod_MAP_Load(model_t *mod, void *buffer)
5732 Host_Error("Mod_MAP_Load: not yet implemented\n");