2 Copyright (C) 1996-1997 Id Software, Inc.
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License
6 as published by the Free Software Foundation; either version 2
7 of the License, or (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
13 See the GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128"};
30 cvar_t halflifebsp = {0, "halflifebsp", "0"};
31 cvar_t mcbsp = {0, "mcbsp", "0"};
32 cvar_t r_novis = {0, "r_novis", "0"};
33 cvar_t r_miplightmaps = {CVAR_SAVE, "r_miplightmaps", "0"};
34 cvar_t r_lightmaprgba = {0, "r_lightmaprgba", "1"};
35 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0"};
36 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4"};
37 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "1"};
38 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024"};
39 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536"};
40 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15"};
41 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "1"};
42 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024"};
43 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225"};
44 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1"};
45 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1"};
46 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0"};
48 void Mod_BrushInit(void)
50 // Cvar_RegisterVariable(&r_subdivide_size);
51 Cvar_RegisterVariable(&halflifebsp);
52 Cvar_RegisterVariable(&mcbsp);
53 Cvar_RegisterVariable(&r_novis);
54 Cvar_RegisterVariable(&r_miplightmaps);
55 Cvar_RegisterVariable(&r_lightmaprgba);
56 Cvar_RegisterVariable(&r_nosurftextures);
57 Cvar_RegisterVariable(&r_subdivisions_tolerance);
58 Cvar_RegisterVariable(&r_subdivisions_mintess);
59 Cvar_RegisterVariable(&r_subdivisions_maxtess);
60 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
61 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
62 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
63 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
64 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
65 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
66 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
67 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
70 static mleaf_t *Mod_Q1BSP_PointInLeaf(model_t *model, const vec3_t p)
77 // LordHavoc: modified to start at first clip node,
78 // in other words: first node of the (sub)model
79 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
81 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
83 return (mleaf_t *)node;
86 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(model_t *model, const vec3_t p, unsigned char *out, int outsize)
90 leaf = Mod_Q1BSP_PointInLeaf(model, p);
93 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
96 memcpy(out, leaf->ambient_sound_level, i);
102 memset(out, 0, outsize);
105 static int Mod_Q1BSP_FindBoxClusters(model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
108 int nodestackindex = 0;
109 mnode_t *node, *nodestack[1024];
110 if (!model->brush.num_pvsclusters)
112 node = model->brush.data_nodes;
118 // node - recurse down the BSP tree
119 int side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
122 // box is on one side of plane, take that path
123 node = node->children[side];
127 // box crosses plane, take one path and remember the other
128 if (nodestackindex < 1024)
129 nodestack[nodestackindex++] = node->children[0];
130 node = node->children[1];
136 // leaf - add clusterindex to list
137 if (numclusters < maxclusters)
138 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
142 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
146 if (nodestackindex < 1024)
147 nodestack[nodestackindex++] = node->children[0];
148 node = node->children[1];
153 // leaf - add clusterindex to list
154 if (numclusters < maxclusters)
155 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
160 // try another path we didn't take earlier
161 if (nodestackindex == 0)
163 node = nodestack[--nodestackindex];
165 // return number of clusters found (even if more than the maxclusters)
169 static int Mod_Q1BSP_BoxTouchingPVS(model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
171 int nodestackindex = 0;
172 mnode_t *node, *nodestack[1024];
173 if (!model->brush.num_pvsclusters)
175 node = model->brush.data_nodes;
181 // node - recurse down the BSP tree
182 int side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
185 // box is on one side of plane, take that path
186 node = node->children[side];
190 // box crosses plane, take one path and remember the other
191 if (nodestackindex < 1024)
192 nodestack[nodestackindex++] = node->children[0];
193 node = node->children[1];
199 // leaf - check cluster bit
200 int clusterindex = ((mleaf_t *)node)->clusterindex;
201 if (CHECKPVSBIT(pvs, clusterindex))
203 // it is visible, return immediately with the news
208 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
212 if (nodestackindex < 1024)
213 nodestack[nodestackindex++] = node->children[0];
214 node = node->children[1];
219 // leaf - check cluster bit
220 int clusterindex = ((mleaf_t *)node)->clusterindex;
221 if (CHECKPVSBIT(pvs, clusterindex))
223 // it is visible, return immediately with the news
229 // nothing to see here, try another path we didn't take earlier
230 if (nodestackindex == 0)
232 node = nodestack[--nodestackindex];
238 static int Mod_Q1BSP_BoxTouchingLeafPVS(model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
240 int nodestackindex = 0;
241 mnode_t *node, *nodestack[1024];
242 if (!model->brush.num_leafs)
244 node = model->brush.data_nodes;
250 // node - recurse down the BSP tree
251 int side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
254 // box is on one side of plane, take that path
255 node = node->children[side];
259 // box crosses plane, take one path and remember the other
260 if (nodestackindex < 1024)
261 nodestack[nodestackindex++] = node->children[0];
262 node = node->children[1];
268 // leaf - check cluster bit
269 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
270 if (CHECKPVSBIT(pvs, clusterindex))
272 // it is visible, return immediately with the news
277 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
281 if (nodestackindex < 1024)
282 nodestack[nodestackindex++] = node->children[0];
283 node = node->children[1];
288 // leaf - check cluster bit
289 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
290 if (CHECKPVSBIT(pvs, clusterindex))
292 // it is visible, return immediately with the news
298 // nothing to see here, try another path we didn't take earlier
299 if (nodestackindex == 0)
301 node = nodestack[--nodestackindex];
307 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
309 int nodestackindex = 0;
310 mnode_t *node, *nodestack[1024];
311 if (!model->brush.num_leafs)
313 node = model->brush.data_nodes;
319 // node - recurse down the BSP tree
320 int side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
323 // box is on one side of plane, take that path
324 node = node->children[side];
328 // box crosses plane, take one path and remember the other
329 if (nodestackindex < 1024)
330 nodestack[nodestackindex++] = node->children[0];
331 node = node->children[1];
337 // leaf - check if it is visible
338 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
340 // it is visible, return immediately with the news
345 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
349 if (nodestackindex < 1024)
350 nodestack[nodestackindex++] = node->children[0];
351 node = node->children[1];
356 // leaf - check if it is visible
357 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
359 // it is visible, return immediately with the news
365 // nothing to see here, try another path we didn't take earlier
366 if (nodestackindex == 0)
368 node = nodestack[--nodestackindex];
374 typedef struct findnonsolidlocationinfo_s
382 findnonsolidlocationinfo_t;
384 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
386 int i, surfacenum, k, *tri, *mark;
387 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
389 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
391 surface = info->model->data_surfaces + *mark;
392 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
394 for (k = 0;k < surface->num_triangles;k++)
396 tri = (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle) + k * 3;
397 VectorCopy((surface->groupmesh->data_vertex3f + tri[0] * 3), vert[0]);
398 VectorCopy((surface->groupmesh->data_vertex3f + tri[1] * 3), vert[1]);
399 VectorCopy((surface->groupmesh->data_vertex3f + tri[2] * 3), vert[2]);
400 VectorSubtract(vert[1], vert[0], edge[0]);
401 VectorSubtract(vert[2], vert[1], edge[1]);
402 CrossProduct(edge[1], edge[0], facenormal);
403 if (facenormal[0] || facenormal[1] || facenormal[2])
405 VectorNormalize(facenormal);
406 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
407 if (f <= info->bestdist && f >= -info->bestdist)
409 VectorSubtract(vert[0], vert[2], edge[2]);
410 VectorNormalize(edge[0]);
411 VectorNormalize(edge[1]);
412 VectorNormalize(edge[2]);
413 CrossProduct(facenormal, edge[0], edgenormal[0]);
414 CrossProduct(facenormal, edge[1], edgenormal[1]);
415 CrossProduct(facenormal, edge[2], edgenormal[2]);
417 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
418 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
419 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
421 // we got lucky, the center is within the face
422 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
426 if (info->bestdist > dist)
428 info->bestdist = dist;
429 VectorScale(facenormal, (info->radius - -dist), info->nudge);
434 if (info->bestdist > dist)
436 info->bestdist = dist;
437 VectorScale(facenormal, (info->radius - dist), info->nudge);
443 // check which edge or vertex the center is nearest
444 for (i = 0;i < 3;i++)
446 f = DotProduct(info->center, edge[i]);
447 if (f >= DotProduct(vert[0], edge[i])
448 && f <= DotProduct(vert[1], edge[i]))
451 VectorMA(info->center, -f, edge[i], point);
452 dist = sqrt(DotProduct(point, point));
453 if (info->bestdist > dist)
455 info->bestdist = dist;
456 VectorScale(point, (info->radius / dist), info->nudge);
458 // skip both vertex checks
459 // (both are further away than this edge)
464 // not on edge, check first vertex of edge
465 VectorSubtract(info->center, vert[i], point);
466 dist = sqrt(DotProduct(point, point));
467 if (info->bestdist > dist)
469 info->bestdist = dist;
470 VectorScale(point, (info->radius / dist), info->nudge);
482 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
486 float f = PlaneDiff(info->center, node->plane);
487 if (f >= -info->bestdist)
488 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
489 if (f <= info->bestdist)
490 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
494 if (((mleaf_t *)node)->numleafsurfaces)
495 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
499 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
502 findnonsolidlocationinfo_t info;
508 VectorCopy(in, info.center);
509 info.radius = radius;
514 VectorClear(info.nudge);
515 info.bestdist = radius;
516 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
517 VectorAdd(info.center, info.nudge, info.center);
519 while (info.bestdist < radius && ++i < 10);
520 VectorCopy(info.center, out);
523 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
525 switch(nativecontents)
530 return SUPERCONTENTS_SOLID;
532 return SUPERCONTENTS_WATER;
534 return SUPERCONTENTS_SLIME;
536 return SUPERCONTENTS_LAVA;
538 return SUPERCONTENTS_SKY;
543 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
545 if (supercontents & SUPERCONTENTS_SOLID)
546 return CONTENTS_SOLID;
547 if (supercontents & SUPERCONTENTS_SKY)
549 if (supercontents & SUPERCONTENTS_LAVA)
550 return CONTENTS_LAVA;
551 if (supercontents & SUPERCONTENTS_SLIME)
552 return CONTENTS_SLIME;
553 if (supercontents & SUPERCONTENTS_WATER)
554 return CONTENTS_WATER;
555 return CONTENTS_EMPTY;
558 typedef struct RecursiveHullCheckTraceInfo_s
560 // the hull we're tracing through
563 // the trace structure to fill in
566 // start, end, and end - start (in model space)
571 RecursiveHullCheckTraceInfo_t;
573 // 1/32 epsilon to keep floating point happy
574 #define DIST_EPSILON (0.03125)
576 #define HULLCHECKSTATE_EMPTY 0
577 #define HULLCHECKSTATE_SOLID 1
578 #define HULLCHECKSTATE_DONE 2
580 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
582 // status variables, these don't need to be saved on the stack when
583 // recursing... but are because this should be thread-safe
584 // (note: tracing against a bbox is not thread-safe, yet)
589 // variables that need to be stored on the stack when recursing
594 // LordHavoc: a goto! everyone flee in terror... :)
599 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
600 if (!t->trace->startfound)
602 t->trace->startfound = true;
603 t->trace->startsupercontents |= num;
605 if (num & SUPERCONTENTS_LIQUIDSMASK)
606 t->trace->inwater = true;
608 t->trace->inopen = true;
609 if (num & t->trace->hitsupercontentsmask)
611 // if the first leaf is solid, set startsolid
612 if (t->trace->allsolid)
613 t->trace->startsolid = true;
614 #if COLLISIONPARANOID >= 3
617 return HULLCHECKSTATE_SOLID;
621 t->trace->allsolid = false;
622 #if COLLISIONPARANOID >= 3
625 return HULLCHECKSTATE_EMPTY;
629 // find the point distances
630 node = t->hull->clipnodes + num;
632 plane = t->hull->planes + node->planenum;
635 t1 = p1[plane->type] - plane->dist;
636 t2 = p2[plane->type] - plane->dist;
640 t1 = DotProduct (plane->normal, p1) - plane->dist;
641 t2 = DotProduct (plane->normal, p2) - plane->dist;
648 #if COLLISIONPARANOID >= 3
651 num = node->children[1];
660 #if COLLISIONPARANOID >= 3
663 num = node->children[0];
669 // the line intersects, find intersection point
670 // LordHavoc: this uses the original trace for maximum accuracy
671 #if COLLISIONPARANOID >= 3
676 t1 = t->start[plane->type] - plane->dist;
677 t2 = t->end[plane->type] - plane->dist;
681 t1 = DotProduct (plane->normal, t->start) - plane->dist;
682 t2 = DotProduct (plane->normal, t->end) - plane->dist;
685 midf = t1 / (t1 - t2);
686 midf = bound(p1f, midf, p2f);
687 VectorMA(t->start, midf, t->dist, mid);
689 // recurse both sides, front side first
690 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
691 // if this side is not empty, return what it is (solid or done)
692 if (ret != HULLCHECKSTATE_EMPTY)
695 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
696 // if other side is not solid, return what it is (empty or done)
697 if (ret != HULLCHECKSTATE_SOLID)
700 // front is air and back is solid, this is the impact point...
703 t->trace->plane.dist = -plane->dist;
704 VectorNegate (plane->normal, t->trace->plane.normal);
708 t->trace->plane.dist = plane->dist;
709 VectorCopy (plane->normal, t->trace->plane.normal);
712 // calculate the true fraction
713 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
714 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
715 midf = t1 / (t1 - t2);
716 t->trace->realfraction = bound(0, midf, 1);
718 // calculate the return fraction which is nudged off the surface a bit
719 midf = (t1 - DIST_EPSILON) / (t1 - t2);
720 t->trace->fraction = bound(0, midf, 1);
722 #if COLLISIONPARANOID >= 3
725 return HULLCHECKSTATE_DONE;
728 #if COLLISIONPARANOID < 2
729 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
732 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];
733 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
734 t->trace->startsupercontents |= num;
735 if (num & SUPERCONTENTS_LIQUIDSMASK)
736 t->trace->inwater = true;
738 t->trace->inopen = true;
739 if (num & t->trace->hitsupercontentsmask)
741 t->trace->allsolid = t->trace->startsolid = true;
742 return HULLCHECKSTATE_SOLID;
746 t->trace->allsolid = t->trace->startsolid = false;
747 return HULLCHECKSTATE_EMPTY;
752 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)
754 // this function currently only supports same size start and end
756 RecursiveHullCheckTraceInfo_t rhc;
758 memset(&rhc, 0, sizeof(rhc));
759 memset(trace, 0, sizeof(trace_t));
761 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
762 rhc.trace->fraction = 1;
763 rhc.trace->realfraction = 1;
764 rhc.trace->allsolid = true;
765 VectorSubtract(boxstartmaxs, boxstartmins, boxsize);
767 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
768 else if (model->brush.ismcbsp)
770 if (boxsize[2] < 48) // pick the nearest of 40 or 56
771 rhc.hull = &model->brushq1.hulls[2]; // 16x16x40
773 rhc.hull = &model->brushq1.hulls[1]; // 16x16x56
775 else if (model->brush.ishlbsp)
777 // LordHavoc: this has to have a minor tolerance (the .1) because of
778 // minor float precision errors from the box being transformed around
779 if (boxsize[0] < 32.1)
781 if (boxsize[2] < 54) // pick the nearest of 36 or 72
782 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
784 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
787 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
791 // LordHavoc: this has to have a minor tolerance (the .1) because of
792 // minor float precision errors from the box being transformed around
793 if (boxsize[0] < 32.1)
794 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
796 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
798 VectorSubtract(boxstartmins, rhc.hull->clip_mins, rhc.start);
799 VectorSubtract(boxendmins, rhc.hull->clip_mins, rhc.end);
800 VectorSubtract(rhc.end, rhc.start, rhc.dist);
801 #if COLLISIONPARANOID >= 2
802 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]);
803 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
806 if (DotProduct(rhc.dist, rhc.dist))
807 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
809 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
813 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)
817 colplanef_t cbox_planes[6];
818 cbox.supercontents = boxsupercontents;
821 cbox.numtriangles = 0;
822 cbox.planes = cbox_planes;
824 cbox.elements = NULL;
832 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];
833 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];
834 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];
835 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];
836 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];
837 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];
838 memset(trace, 0, sizeof(trace_t));
839 trace->hitsupercontentsmask = hitsupercontentsmask;
841 trace->realfraction = 1;
842 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
844 RecursiveHullCheckTraceInfo_t rhc;
845 static hull_t box_hull;
846 static dclipnode_t box_clipnodes[6];
847 static mplane_t box_planes[6];
848 // fill in a default trace
849 memset(&rhc, 0, sizeof(rhc));
850 memset(trace, 0, sizeof(trace_t));
851 //To keep everything totally uniform, bounding boxes are turned into small
852 //BSP trees instead of being compared directly.
853 // create a temp hull from bounding box sizes
854 box_planes[0].dist = cmaxs[0] - mins[0];
855 box_planes[1].dist = cmins[0] - maxs[0];
856 box_planes[2].dist = cmaxs[1] - mins[1];
857 box_planes[3].dist = cmins[1] - maxs[1];
858 box_planes[4].dist = cmaxs[2] - mins[2];
859 box_planes[5].dist = cmins[2] - maxs[2];
860 #if COLLISIONPARANOID >= 3
861 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]);
864 if (box_hull.clipnodes == NULL)
868 //Set up the planes and clipnodes so that the six floats of a bounding box
869 //can just be stored out and get a proper hull_t structure.
871 box_hull.clipnodes = box_clipnodes;
872 box_hull.planes = box_planes;
873 box_hull.firstclipnode = 0;
874 box_hull.lastclipnode = 5;
876 for (i = 0;i < 6;i++)
878 box_clipnodes[i].planenum = i;
882 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
884 box_clipnodes[i].children[side^1] = i + 1;
886 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
888 box_planes[i].type = i>>1;
889 box_planes[i].normal[i>>1] = 1;
893 // trace a line through the generated clipping hull
894 //rhc.boxsupercontents = boxsupercontents;
895 rhc.hull = &box_hull;
897 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
898 rhc.trace->fraction = 1;
899 rhc.trace->realfraction = 1;
900 rhc.trace->allsolid = true;
901 VectorCopy(start, rhc.start);
902 VectorCopy(end, rhc.end);
903 VectorSubtract(rhc.end, rhc.start, rhc.dist);
904 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
905 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
906 if (rhc.trace->startsupercontents)
907 rhc.trace->startsupercontents = boxsupercontents;
911 static int Mod_Q1BSP_LightPoint_RecursiveBSPNode(model_t *model, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal, const mnode_t *node, float x, float y, float startz, float endz)
913 int side, distz = endz - startz;
919 return false; // didn't hit anything
921 switch (node->plane->type)
924 node = node->children[x < node->plane->dist];
927 node = node->children[y < node->plane->dist];
930 side = startz < node->plane->dist;
931 if ((endz < node->plane->dist) == side)
933 node = node->children[side];
936 // found an intersection
937 mid = node->plane->dist;
940 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
941 front += startz * node->plane->normal[2];
942 back += endz * node->plane->normal[2];
943 side = front < node->plane->dist;
944 if ((back < node->plane->dist) == side)
946 node = node->children[side];
949 // found an intersection
950 mid = startz + distz * (front - node->plane->dist) / (front - back);
954 // go down front side
955 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
956 return true; // hit something
959 // check for impact on this node
960 if (node->numsurfaces)
965 surface = model->data_surfaces + node->firstsurface;
966 for (i = 0;i < node->numsurfaces;i++, surface++)
968 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
969 continue; // no lightmaps
971 ds = (int) (x * surface->lightmapinfo->texinfo->vecs[0][0] + y * surface->lightmapinfo->texinfo->vecs[0][1] + mid * surface->lightmapinfo->texinfo->vecs[0][2] + surface->lightmapinfo->texinfo->vecs[0][3]) - surface->lightmapinfo->texturemins[0];
972 dt = (int) (x * surface->lightmapinfo->texinfo->vecs[1][0] + y * surface->lightmapinfo->texinfo->vecs[1][1] + mid * surface->lightmapinfo->texinfo->vecs[1][2] + surface->lightmapinfo->texinfo->vecs[1][3]) - surface->lightmapinfo->texturemins[1];
974 if (ds >= 0 && ds < surface->lightmapinfo->extents[0] && dt >= 0 && dt < surface->lightmapinfo->extents[1])
976 unsigned char *lightmap;
977 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;
978 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
979 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
980 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
981 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
983 lightmap = surface->lightmapinfo->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
985 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
987 scale = r_refdef.lightstylevalue[surface->lightmapinfo->styles[maps]];
988 r00 += lightmap[ 0] * scale;g00 += lightmap[ 1] * scale;b00 += lightmap[ 2] * scale;
989 r01 += lightmap[ 3] * scale;g01 += lightmap[ 4] * scale;b01 += lightmap[ 5] * scale;
990 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
991 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
996 LordHavoc: here's the readable version of the interpolation
997 code, not quite as easy for the compiler to optimize...
999 dsfrac is the X position in the lightmap pixel, * 16
1000 dtfrac is the Y position in the lightmap pixel, * 16
1001 r00 is top left corner, r01 is top right corner
1002 r10 is bottom left corner, r11 is bottom right corner
1003 g and b are the same layout.
1004 r0 and r1 are the top and bottom intermediate results
1006 first we interpolate the top two points, to get the top
1009 r0 = (((r01-r00) * dsfrac) >> 4) + r00;
1010 g0 = (((g01-g00) * dsfrac) >> 4) + g00;
1011 b0 = (((b01-b00) * dsfrac) >> 4) + b00;
1013 then we interpolate the bottom two points, to get the
1016 r1 = (((r11-r10) * dsfrac) >> 4) + r10;
1017 g1 = (((g11-g10) * dsfrac) >> 4) + g10;
1018 b1 = (((b11-b10) * dsfrac) >> 4) + b10;
1020 then we interpolate the top and bottom samples to get the
1021 middle sample (the one which was requested)
1023 r = (((r1-r0) * dtfrac) >> 4) + r0;
1024 g = (((g1-g0) * dtfrac) >> 4) + g0;
1025 b = (((b1-b0) * dtfrac) >> 4) + b0;
1028 ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
1029 ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
1030 ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
1031 return true; // success
1036 // go down back side
1037 node = node->children[side ^ 1];
1039 distz = endz - startz;
1044 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1046 Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2], p[2] - 65536);
1049 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1052 unsigned char *outstart = out;
1053 while (out < outend)
1057 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
1067 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);
1070 for (c = *in++;c > 0;c--)
1074 Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
1085 R_Q1BSP_LoadSplitSky
1087 A sky texture is 256*128, with the right side being a masked overlay
1090 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1093 unsigned solidpixels[128*128], alphapixels[128*128];
1095 // if sky isn't the right size, just use it as a solid layer
1096 if (width != 256 || height != 128)
1098 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);
1099 loadmodel->brush.alphaskytexture = NULL;;
1103 if (bytesperpixel == 4)
1105 for (i = 0;i < 128;i++)
1107 for (j = 0;j < 128;j++)
1109 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1110 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1116 // make an average value for the back to avoid
1117 // a fringe on the top level
1126 for (i = 0;i < 128;i++)
1128 for (j = 0;j < 128;j++)
1130 rgba.i = palette_complete[src[i*256 + j + 128]];
1136 rgba.b[0] = r/(128*128);
1137 rgba.b[1] = g/(128*128);
1138 rgba.b[2] = b/(128*128);
1140 for (i = 0;i < 128;i++)
1142 for (j = 0;j < 128;j++)
1144 solidpixels[(i*128) + j] = palette_complete[src[i*256 + j + 128]];
1145 alphapixels[(i*128) + j] = (p = src[i*256 + j]) ? palette_complete[p] : rgba.i;
1150 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_RGBA, TEXF_PRECACHE, NULL);
1151 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_RGBA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1154 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1156 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1158 texture_t *tx, *tx2, *anims[10], *altanims[10];
1160 unsigned char *data, *mtdata;
1163 loadmodel->data_textures = NULL;
1165 // add two slots for notexture walls and notexture liquids
1168 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1169 m->nummiptex = LittleLong (m->nummiptex);
1170 loadmodel->num_textures = m->nummiptex + 2;
1175 loadmodel->num_textures = 2;
1178 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1180 // fill out all slots with notexture
1181 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1183 strcpy(tx->name, "NO TEXTURE FOUND");
1186 tx->skin.base = r_texture_notexture;
1187 tx->basematerialflags = 0;
1188 if (i == loadmodel->num_textures - 1)
1190 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1191 tx->supercontents = SUPERCONTENTS_WATER;
1195 tx->basematerialflags |= MATERIALFLAG_WALL;
1196 tx->supercontents = SUPERCONTENTS_SOLID;
1198 tx->currentframe = tx;
1204 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1206 // LordHavoc: mostly rewritten map texture loader
1207 for (i = 0;i < m->nummiptex;i++)
1209 dofs[i] = LittleLong(dofs[i]);
1210 if (dofs[i] == -1 || r_nosurftextures.integer)
1212 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1214 // make sure name is no more than 15 characters
1215 for (j = 0;dmiptex->name[j] && j < 15;j++)
1216 name[j] = dmiptex->name[j];
1219 mtwidth = LittleLong(dmiptex->width);
1220 mtheight = LittleLong(dmiptex->height);
1222 j = LittleLong(dmiptex->offsets[0]);
1226 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1228 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1231 mtdata = (unsigned char *)dmiptex + j;
1234 if ((mtwidth & 15) || (mtheight & 15))
1235 Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1237 // LordHavoc: force all names to lowercase
1238 for (j = 0;name[j];j++)
1239 if (name[j] >= 'A' && name[j] <= 'Z')
1240 name[j] += 'a' - 'A';
1242 tx = loadmodel->data_textures + i;
1243 strcpy(tx->name, name);
1244 tx->width = mtwidth;
1245 tx->height = mtheight;
1249 sprintf(tx->name, "unnamed%i", i);
1250 Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1253 // LordHavoc: HL sky textures are entirely different than quake
1254 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1256 if (loadmodel->isworldmodel)
1258 data = loadimagepixels(tx->name, false, 0, 0);
1261 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1264 else if (mtdata != NULL)
1265 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1270 if (!Mod_LoadSkinFrame(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true))
1272 // did not find external texture, load it from the bsp or wad3
1273 if (loadmodel->brush.ishlbsp)
1275 // internal texture overrides wad
1276 unsigned char *pixels, *freepixels, *fogpixels;
1277 pixels = freepixels = NULL;
1279 pixels = W_ConvertWAD3Texture(dmiptex);
1281 pixels = freepixels = W_GetTexture(tx->name);
1284 tx->width = image_width;
1285 tx->height = image_height;
1286 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);
1287 if (Image_CheckAlpha(pixels, image_width * image_height, true))
1289 fogpixels = (unsigned char *)Mem_Alloc(tempmempool, image_width * image_height * 4);
1290 for (j = 0;j < image_width * image_height * 4;j += 4)
1292 fogpixels[j + 0] = 255;
1293 fogpixels[j + 1] = 255;
1294 fogpixels[j + 2] = 255;
1295 fogpixels[j + 3] = pixels[j + 3];
1297 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);
1298 Mem_Free(fogpixels);
1302 Mem_Free(freepixels);
1304 else if (mtdata) // texture included
1305 Mod_LoadSkinFrame_Internal(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_PICMIP, false, tx->name[0] != '*' && r_fullbrights.integer, mtdata, tx->width, tx->height);
1308 if (tx->skin.base == NULL)
1313 tx->skin.base = r_texture_notexture;
1316 tx->basematerialflags = 0;
1317 if (tx->name[0] == '*')
1319 // turb does not block movement
1320 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1321 // LordHavoc: some turbulent textures should be fullbright and solid
1322 if (!strncmp(tx->name,"*lava",5)
1323 || !strncmp(tx->name,"*teleport",9)
1324 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1325 tx->basematerialflags |= MATERIALFLAG_FULLBRIGHT;
1327 tx->basematerialflags |= MATERIALFLAG_WATERALPHA;
1328 if (!strncmp(tx->name, "*lava", 5))
1329 tx->supercontents = SUPERCONTENTS_LAVA;
1330 else if (!strncmp(tx->name, "*slime", 6))
1331 tx->supercontents = SUPERCONTENTS_SLIME;
1333 tx->supercontents = SUPERCONTENTS_WATER;
1335 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1337 tx->supercontents = SUPERCONTENTS_SKY;
1338 tx->basematerialflags |= MATERIALFLAG_SKY;
1342 tx->supercontents = SUPERCONTENTS_SOLID;
1343 tx->basematerialflags |= MATERIALFLAG_WALL;
1346 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
1348 // start out with no animation
1349 tx->currentframe = tx;
1352 // sequence the animations
1353 for (i = 0;i < m->nummiptex;i++)
1355 tx = loadmodel->data_textures + i;
1356 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1358 if (tx->anim_total[0] || tx->anim_total[1])
1359 continue; // already sequenced
1361 // find the number of frames in the animation
1362 memset(anims, 0, sizeof(anims));
1363 memset(altanims, 0, sizeof(altanims));
1365 for (j = i;j < m->nummiptex;j++)
1367 tx2 = loadmodel->data_textures + j;
1368 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1372 if (num >= '0' && num <= '9')
1373 anims[num - '0'] = tx2;
1374 else if (num >= 'a' && num <= 'j')
1375 altanims[num - 'a'] = tx2;
1377 Con_Printf("Bad animating texture %s\n", tx->name);
1381 for (j = 0;j < 10;j++)
1388 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1391 for (j = 0;j < max;j++)
1395 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1399 for (j = 0;j < altmax;j++)
1403 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1412 // if there is no alternate animation, duplicate the primary
1413 // animation into the alternate
1415 for (k = 0;k < 10;k++)
1416 altanims[k] = anims[k];
1419 // link together the primary animation
1420 for (j = 0;j < max;j++)
1423 tx2->animated = true;
1424 tx2->anim_total[0] = max;
1425 tx2->anim_total[1] = altmax;
1426 for (k = 0;k < 10;k++)
1428 tx2->anim_frames[0][k] = anims[k];
1429 tx2->anim_frames[1][k] = altanims[k];
1433 // if there really is an alternate anim...
1434 if (anims[0] != altanims[0])
1436 // link together the alternate animation
1437 for (j = 0;j < altmax;j++)
1440 tx2->animated = true;
1441 // the primary/alternate are reversed here
1442 tx2->anim_total[0] = altmax;
1443 tx2->anim_total[1] = max;
1444 for (k = 0;k < 10;k++)
1446 tx2->anim_frames[0][k] = altanims[k];
1447 tx2->anim_frames[1][k] = anims[k];
1454 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1457 unsigned char *in, *out, *data, d;
1458 char litfilename[1024];
1459 fs_offset_t filesize;
1460 loadmodel->brushq1.lightdata = NULL;
1461 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1463 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1464 for (i=0; i<l->filelen; i++)
1465 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1467 else if (loadmodel->brush.ismcbsp)
1469 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1470 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1472 else // LordHavoc: bsp version 29 (normal white lighting)
1474 // LordHavoc: hope is not lost yet, check for a .lit file to load
1475 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1476 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1477 strlcat (litfilename, ".lit", sizeof (litfilename));
1478 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1481 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1483 i = LittleLong(((int *)data)[1]);
1486 Con_DPrintf("loaded %s\n", litfilename);
1487 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1488 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1494 Con_Printf("Unknown .lit file version (%d)\n", i);
1501 Con_Print("Empty .lit file, ignoring\n");
1503 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", filesize, 8 + l->filelen * 3);
1507 // LordHavoc: oh well, expand the white lighting data
1510 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1511 in = loadmodel->brushq1.lightdata + l->filelen*2; // place the file at the end, so it will not be overwritten until the very last write
1512 out = loadmodel->brushq1.lightdata;
1513 memcpy(in, mod_base + l->fileofs, l->filelen);
1514 for (i = 0;i < l->filelen;i++)
1524 static void Mod_Q1BSP_LoadLightList(void)
1526 int a, n, numlights;
1527 char tempchar, *s, *t, *lightsstring, lightsfilename[1024];
1530 strlcpy (lightsfilename, loadmodel->name, sizeof (lightsfilename));
1531 FS_StripExtension (lightsfilename, lightsfilename, sizeof(lightsfilename));
1532 strlcat (lightsfilename, ".lights", sizeof (lightsfilename));
1533 s = lightsstring = (char *) FS_LoadFile(lightsfilename, tempmempool, false, NULL);
1539 while (*s && *s != '\n' && *s != '\r')
1543 Mem_Free(lightsstring);
1544 Con_Printf("lights file must end with a newline\n");
1550 loadmodel->brushq1.lights = (mlight_t *)Mem_Alloc(loadmodel->mempool, numlights * sizeof(mlight_t));
1553 while (*s && n < numlights)
1556 while (*s && *s != '\n' && *s != '\r')
1560 Con_Printf("misparsed lights file!\n");
1563 e = loadmodel->brushq1.lights + n;
1566 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);
1570 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);
1580 Con_Printf("misparsed lights file!\n");
1581 loadmodel->brushq1.numlights = numlights;
1582 Mem_Free(lightsstring);
1586 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1588 loadmodel->brushq1.num_compressedpvs = 0;
1589 loadmodel->brushq1.data_compressedpvs = NULL;
1592 loadmodel->brushq1.num_compressedpvs = l->filelen;
1593 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1594 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1597 // used only for HalfLife maps
1598 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1600 char key[128], value[4096];
1605 if (!COM_ParseToken(&data, false))
1607 if (com_token[0] != '{')
1611 if (!COM_ParseToken(&data, false))
1613 if (com_token[0] == '}')
1614 break; // end of worldspawn
1615 if (com_token[0] == '_')
1616 strcpy(key, com_token + 1);
1618 strcpy(key, com_token);
1619 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1620 key[strlen(key)-1] = 0;
1621 if (!COM_ParseToken(&data, false))
1623 strcpy(value, com_token);
1624 if (!strcmp("wad", key)) // for HalfLife maps
1626 if (loadmodel->brush.ishlbsp)
1629 for (i = 0;i < 4096;i++)
1630 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1636 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1637 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1639 else if (value[i] == ';' || value[i] == 0)
1643 strcpy(wadname, "textures/");
1644 strcat(wadname, &value[j]);
1645 W_LoadTextureWadFile(wadname, false);
1657 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1659 loadmodel->brush.entities = NULL;
1662 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1663 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1664 if (loadmodel->brush.ishlbsp)
1665 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1669 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1675 in = (dvertex_t *)(mod_base + l->fileofs);
1676 if (l->filelen % sizeof(*in))
1677 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1678 count = l->filelen / sizeof(*in);
1679 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1681 loadmodel->brushq1.vertexes = out;
1682 loadmodel->brushq1.numvertexes = count;
1684 for ( i=0 ; i<count ; i++, in++, out++)
1686 out->position[0] = LittleFloat(in->point[0]);
1687 out->position[1] = LittleFloat(in->point[1]);
1688 out->position[2] = LittleFloat(in->point[2]);
1692 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1693 // can be used for this
1695 int SB_ReadInt (unsigned char **buffer)
1698 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1704 float SB_ReadFloat (unsigned char **buffer)
1712 u.i = SB_ReadInt (buffer);
1716 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1718 unsigned char *index;
1722 index = (unsigned char *)(mod_base + l->fileofs);
1723 if (l->filelen % (48+4*hullinfo->filehulls))
1724 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1726 count = l->filelen / (48+4*hullinfo->filehulls);
1727 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1729 loadmodel->brushq1.submodels = out;
1730 loadmodel->brush.numsubmodels = count;
1732 for (i = 0; i < count; i++, out++)
1734 // spread out the mins / maxs by a pixel
1735 out->mins[0] = SB_ReadFloat (&index) - 1;
1736 out->mins[1] = SB_ReadFloat (&index) - 1;
1737 out->mins[2] = SB_ReadFloat (&index) - 1;
1738 out->maxs[0] = SB_ReadFloat (&index) + 1;
1739 out->maxs[1] = SB_ReadFloat (&index) + 1;
1740 out->maxs[2] = SB_ReadFloat (&index) + 1;
1741 out->origin[0] = SB_ReadFloat (&index);
1742 out->origin[1] = SB_ReadFloat (&index);
1743 out->origin[2] = SB_ReadFloat (&index);
1744 for (j = 0; j < hullinfo->filehulls; j++)
1745 out->headnode[j] = SB_ReadInt (&index);
1746 out->visleafs = SB_ReadInt (&index);
1747 out->firstface = SB_ReadInt (&index);
1748 out->numfaces = SB_ReadInt (&index);
1752 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1758 in = (dedge_t *)(mod_base + l->fileofs);
1759 if (l->filelen % sizeof(*in))
1760 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1761 count = l->filelen / sizeof(*in);
1762 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1764 loadmodel->brushq1.edges = out;
1765 loadmodel->brushq1.numedges = count;
1767 for ( i=0 ; i<count ; i++, in++, out++)
1769 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1770 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1774 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1778 int i, j, k, count, miptex;
1780 in = (texinfo_t *)(mod_base + l->fileofs);
1781 if (l->filelen % sizeof(*in))
1782 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1783 count = l->filelen / sizeof(*in);
1784 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1786 loadmodel->brushq1.texinfo = out;
1787 loadmodel->brushq1.numtexinfo = count;
1789 for (i = 0;i < count;i++, in++, out++)
1791 for (k = 0;k < 2;k++)
1792 for (j = 0;j < 4;j++)
1793 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1795 miptex = LittleLong(in->miptex);
1796 out->flags = LittleLong(in->flags);
1798 out->texture = NULL;
1799 if (loadmodel->data_textures)
1801 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1802 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1804 out->texture = loadmodel->data_textures + miptex;
1806 if (out->flags & TEX_SPECIAL)
1808 // if texture chosen is NULL or the shader needs a lightmap,
1809 // force to notexture water shader
1810 if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1811 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1815 // if texture chosen is NULL, force to notexture
1816 if (out->texture == NULL)
1817 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1823 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1828 mins[0] = mins[1] = mins[2] = 9999;
1829 maxs[0] = maxs[1] = maxs[2] = -9999;
1831 for (i = 0;i < numverts;i++)
1833 for (j = 0;j < 3;j++, v++)
1843 #define MAX_SUBDIVPOLYTRIANGLES 4096
1844 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1846 static int subdivpolyverts, subdivpolytriangles;
1847 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1848 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1850 static int subdivpolylookupvert(vec3_t v)
1853 for (i = 0;i < subdivpolyverts;i++)
1854 if (subdivpolyvert[i][0] == v[0]
1855 && subdivpolyvert[i][1] == v[1]
1856 && subdivpolyvert[i][2] == v[2])
1858 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1859 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1860 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1861 return subdivpolyverts++;
1864 static void SubdividePolygon(int numverts, float *verts)
1866 int i, i1, i2, i3, f, b, c, p;
1867 vec3_t mins, maxs, front[256], back[256];
1868 float m, *pv, *cv, dist[256], frac;
1871 Host_Error("SubdividePolygon: ran out of verts in buffer");
1873 BoundPoly(numverts, verts, mins, maxs);
1875 for (i = 0;i < 3;i++)
1877 m = (mins[i] + maxs[i]) * 0.5;
1878 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1879 if (maxs[i] - m < 8)
1881 if (m - mins[i] < 8)
1885 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1886 dist[c] = cv[i] - m;
1889 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1893 VectorCopy(pv, front[f]);
1898 VectorCopy(pv, back[b]);
1901 if (dist[p] == 0 || dist[c] == 0)
1903 if ((dist[p] > 0) != (dist[c] > 0) )
1906 frac = dist[p] / (dist[p] - dist[c]);
1907 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1908 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1909 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1915 SubdividePolygon(f, front[0]);
1916 SubdividePolygon(b, back[0]);
1920 i1 = subdivpolylookupvert(verts);
1921 i2 = subdivpolylookupvert(verts + 3);
1922 for (i = 2;i < numverts;i++)
1924 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1926 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1930 i3 = subdivpolylookupvert(verts + i * 3);
1931 subdivpolyindex[subdivpolytriangles][0] = i1;
1932 subdivpolyindex[subdivpolytriangles][1] = i2;
1933 subdivpolyindex[subdivpolytriangles][2] = i3;
1935 subdivpolytriangles++;
1939 //Breaks a polygon up along axial 64 unit
1940 //boundaries so that turbulent and sky warps
1941 //can be done reasonably.
1942 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
1948 subdivpolytriangles = 0;
1949 subdivpolyverts = 0;
1950 SubdividePolygon(surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
1951 if (subdivpolytriangles < 1)
1952 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
1954 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
1955 mesh->num_vertices = subdivpolyverts;
1956 mesh->num_triangles = subdivpolytriangles;
1957 mesh->vertex = (surfvertex_t *)(mesh + 1);
1958 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
1959 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
1961 for (i = 0;i < mesh->num_triangles;i++)
1962 for (j = 0;j < 3;j++)
1963 mesh->index[i*3+j] = subdivpolyindex[i][j];
1965 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
1967 VectorCopy(subdivpolyvert[i], v->v);
1968 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
1969 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
1974 static void Mod_Q1BSP_LoadFaces(lump_t *l)
1977 msurface_t *surface;
1978 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris;
1979 float texmins[2], texmaxs[2], val;
1981 in = (dface_t *)(mod_base + l->fileofs);
1982 if (l->filelen % sizeof(*in))
1983 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
1984 count = l->filelen / sizeof(*in);
1985 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
1986 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
1988 loadmodel->num_surfaces = count;
1992 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
1994 numedges = LittleShort(in->numedges);
1995 totalverts += numedges;
1996 totaltris += numedges - 2;
1999 // TODO: split up into multiple meshes as needed to avoid exceeding 65536
2001 loadmodel->nummeshes = 1;
2002 loadmodel->meshlist = (surfmesh_t **)Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *));
2003 loadmodel->meshlist[0] = Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2007 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2009 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2011 // FIXME: validate edges, texinfo, etc?
2012 firstedge = LittleLong(in->firstedge);
2013 numedges = LittleShort(in->numedges);
2014 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)
2015 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2016 i = LittleShort(in->texinfo);
2017 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2018 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2019 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2020 surface->texture = surface->lightmapinfo->texinfo->texture;
2022 planenum = LittleShort(in->planenum);
2023 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2024 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2026 //surface->flags = surface->texture->flags;
2027 //if (LittleShort(in->side))
2028 // surface->flags |= SURF_PLANEBACK;
2029 //surface->plane = loadmodel->brush.data_planes + planenum;
2031 surface->groupmesh = loadmodel->meshlist[0];
2032 surface->num_firstvertex = totalverts;
2033 surface->num_vertices = numedges;
2034 surface->num_firsttriangle = totaltris;
2035 surface->num_triangles = numedges - 2;
2036 totalverts += numedges;
2037 totaltris += numedges - 2;
2039 // convert edges back to a normal polygon
2040 for (i = 0;i < surface->num_vertices;i++)
2042 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2045 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2047 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2048 s = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2049 t = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2050 (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2051 (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2052 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2053 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2054 (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2057 for (i = 0;i < surface->num_triangles;i++)
2059 (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2060 (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2061 (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2064 // compile additional data about the surface geometry
2065 Mod_BuildTextureVectorsAndNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, surface->groupmesh->data_vertex3f, surface->groupmesh->data_texcoordtexture2f, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle), surface->groupmesh->data_svector3f, surface->groupmesh->data_tvector3f, surface->groupmesh->data_normal3f, true);
2066 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
2068 // generate surface extents information
2069 texmins[0] = texmaxs[0] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2070 texmins[1] = texmaxs[1] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2071 for (i = 1;i < surface->num_vertices;i++)
2073 for (j = 0;j < 2;j++)
2075 val = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2076 texmins[j] = min(texmins[j], val);
2077 texmaxs[j] = max(texmaxs[j], val);
2080 for (i = 0;i < 2;i++)
2082 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2083 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2086 smax = surface->lightmapinfo->extents[0] >> 4;
2087 tmax = surface->lightmapinfo->extents[1] >> 4;
2088 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2089 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2092 for (i = 0;i < MAXLIGHTMAPS;i++)
2093 surface->lightmapinfo->styles[i] = in->styles[i];
2094 // force lightmap upload on first time seeing the surface
2095 surface->cached_dlight = true;
2096 surface->lightmapinfo->lightmaptexturestride = 0;
2097 surface->lightmaptexture = NULL;
2098 i = LittleLong(in->lightofs);
2101 surface->lightmapinfo->samples = NULL;
2102 // give non-lightmapped water a 1x white lightmap
2103 if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2105 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2106 surface->lightmapinfo->styles[0] = 0;
2107 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2110 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2111 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2112 else // LordHavoc: white lighting (bsp version 29)
2113 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2115 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2118 float u, v, ubase, vbase, uscale, vscale;
2120 if (ssize > 256 || tsize > 256)
2121 Host_Error("Bad surface extents");
2122 // stainmap for permanent marks on walls
2123 surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2125 memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2127 if (r_miplightmaps.integer)
2129 surface->lightmapinfo->lightmaptexturestride = ssize;
2130 surface->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surface->lightmapinfo->lightmaptexturestride, tsize, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_MIPMAP | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2134 surface->lightmapinfo->lightmaptexturestride = R_CompatibleFragmentWidth(ssize, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, 0);
2135 surface->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surface->lightmapinfo->lightmaptexturestride, tsize, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FRAGMENT | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2137 R_FragmentLocation(surface->lightmaptexture, NULL, NULL, &ubase, &vbase, &uscale, &vscale);
2138 uscale = (uscale - ubase) / ssize;
2139 vscale = (vscale - vbase) / tsize;
2141 for (i = 0;i < surface->num_vertices;i++)
2143 u = ((DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3]) + 8 - surface->lightmapinfo->texturemins[0]) * (1.0 / 16.0);
2144 v = ((DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3]) + 8 - surface->lightmapinfo->texturemins[1]) * (1.0 / 16.0);
2145 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2146 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2147 // LordHavoc: calc lightmap data offset for vertex lighting to use
2150 (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2156 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2159 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2160 node->parent = parent;
2163 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2164 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2168 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2174 in = (dnode_t *)(mod_base + l->fileofs);
2175 if (l->filelen % sizeof(*in))
2176 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2177 count = l->filelen / sizeof(*in);
2178 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2180 loadmodel->brush.data_nodes = out;
2181 loadmodel->brush.num_nodes = count;
2183 for ( i=0 ; i<count ; i++, in++, out++)
2185 for (j=0 ; j<3 ; j++)
2187 out->mins[j] = LittleShort(in->mins[j]);
2188 out->maxs[j] = LittleShort(in->maxs[j]);
2191 p = LittleLong(in->planenum);
2192 out->plane = loadmodel->brush.data_planes + p;
2194 out->firstsurface = LittleShort(in->firstface);
2195 out->numsurfaces = LittleShort(in->numfaces);
2197 for (j=0 ; j<2 ; j++)
2199 p = LittleShort(in->children[j]);
2201 out->children[j] = loadmodel->brush.data_nodes + p;
2203 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
2207 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2210 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2216 in = (dleaf_t *)(mod_base + l->fileofs);
2217 if (l->filelen % sizeof(*in))
2218 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2219 count = l->filelen / sizeof(*in);
2220 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2222 loadmodel->brush.data_leafs = out;
2223 loadmodel->brush.num_leafs = count;
2224 // get visleafs from the submodel data
2225 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2226 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2227 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2228 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2230 for ( i=0 ; i<count ; i++, in++, out++)
2232 for (j=0 ; j<3 ; j++)
2234 out->mins[j] = LittleShort(in->mins[j]);
2235 out->maxs[j] = LittleShort(in->maxs[j]);
2238 // FIXME: this function could really benefit from some error checking
2240 out->contents = LittleLong(in->contents);
2242 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + LittleShort(in->firstmarksurface);
2243 out->numleafsurfaces = LittleShort(in->nummarksurfaces);
2244 if (out->firstleafsurface < 0 || LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2246 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", out->firstleafsurface, out->firstleafsurface + out->numleafsurfaces, 0, loadmodel->brush.num_leafsurfaces);
2247 out->firstleafsurface = NULL;
2248 out->numleafsurfaces = 0;
2251 out->clusterindex = i - 1;
2252 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2253 out->clusterindex = -1;
2255 p = LittleLong(in->visofs);
2256 // ignore visofs errors on leaf 0 (solid)
2257 if (p >= 0 && out->clusterindex >= 0)
2259 if (p >= loadmodel->brushq1.num_compressedpvs)
2260 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2262 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);
2265 for (j = 0;j < 4;j++)
2266 out->ambient_sound_level[j] = in->ambient_level[j];
2268 // FIXME: Insert caustics here
2272 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2274 dclipnode_t *in, *out;
2278 in = (dclipnode_t *)(mod_base + l->fileofs);
2279 if (l->filelen % sizeof(*in))
2280 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2281 count = l->filelen / sizeof(*in);
2282 out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2284 loadmodel->brushq1.clipnodes = out;
2285 loadmodel->brushq1.numclipnodes = count;
2287 for (i = 1; i < hullinfo->numhulls; i++)
2289 hull = &loadmodel->brushq1.hulls[i];
2290 hull->clipnodes = out;
2291 hull->firstclipnode = 0;
2292 hull->lastclipnode = count-1;
2293 hull->planes = loadmodel->brush.data_planes;
2294 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2295 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2296 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2297 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2298 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2299 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2300 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2303 for (i=0 ; i<count ; i++, out++, in++)
2305 out->planenum = LittleLong(in->planenum);
2306 out->children[0] = LittleShort(in->children[0]);
2307 out->children[1] = LittleShort(in->children[1]);
2308 if (out->children[0] >= count || out->children[1] >= count)
2309 Host_Error("Corrupt clipping hull(out of range child)");
2313 //Duplicate the drawing hull structure as a clipping hull
2314 static void Mod_Q1BSP_MakeHull0(void)
2321 hull = &loadmodel->brushq1.hulls[0];
2323 in = loadmodel->brush.data_nodes;
2324 out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2326 hull->clipnodes = out;
2327 hull->firstclipnode = 0;
2328 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2329 hull->planes = loadmodel->brush.data_planes;
2331 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2333 out->planenum = in->plane - loadmodel->brush.data_planes;
2334 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2335 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2339 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2344 in = (short *)(mod_base + l->fileofs);
2345 if (l->filelen % sizeof(*in))
2346 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2347 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2348 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2350 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2352 j = (unsigned) LittleShort(in[i]);
2353 if (j >= loadmodel->num_surfaces)
2354 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2355 loadmodel->brush.data_leafsurfaces[i] = j;
2359 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2364 in = (int *)(mod_base + l->fileofs);
2365 if (l->filelen % sizeof(*in))
2366 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2367 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2368 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2370 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2371 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2375 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2381 in = (dplane_t *)(mod_base + l->fileofs);
2382 if (l->filelen % sizeof(*in))
2383 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2385 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2386 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2388 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2390 out->normal[0] = LittleFloat(in->normal[0]);
2391 out->normal[1] = LittleFloat(in->normal[1]);
2392 out->normal[2] = LittleFloat(in->normal[2]);
2393 out->dist = LittleFloat(in->dist);
2399 static void Mod_Q1BSP_LoadMapBrushes(void)
2403 int submodel, numbrushes;
2404 qboolean firstbrush;
2405 char *text, *maptext;
2406 char mapfilename[MAX_QPATH];
2407 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2408 strlcat (mapfilename, ".map", sizeof (mapfilename));
2409 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2413 if (!COM_ParseToken(&data, false))
2418 if (!COM_ParseToken(&data, false))
2420 if (com_token[0] != '{')
2426 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2429 if (!COM_ParseToken(&data, false))
2431 if (com_token[0] == '}')
2432 break; // end of entity
2433 if (com_token[0] == '{')
2440 if (submodel > loadmodel->brush.numsubmodels)
2442 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2446 model = loadmodel->brush.submodels[submodel];
2453 if (!COM_ParseToken(&data, false))
2455 if (com_token[0] == '}')
2456 break; // end of brush
2457 // each brush face should be this format:
2458 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2459 // FIXME: support hl .map format
2460 for (pointnum = 0;pointnum < 3;pointnum++)
2462 COM_ParseToken(&data, false);
2463 for (componentnum = 0;componentnum < 3;componentnum++)
2465 COM_ParseToken(&data, false);
2466 point[pointnum][componentnum] = atof(com_token);
2468 COM_ParseToken(&data, false);
2470 COM_ParseToken(&data, false);
2471 strlcpy(facetexture, com_token, sizeof(facetexture));
2472 COM_ParseToken(&data, false);
2473 //scroll_s = atof(com_token);
2474 COM_ParseToken(&data, false);
2475 //scroll_t = atof(com_token);
2476 COM_ParseToken(&data, false);
2477 //rotate = atof(com_token);
2478 COM_ParseToken(&data, false);
2479 //scale_s = atof(com_token);
2480 COM_ParseToken(&data, false);
2481 //scale_t = atof(com_token);
2482 TriangleNormal(point[0], point[1], point[2], planenormal);
2483 VectorNormalizeDouble(planenormal);
2484 planedist = DotProduct(point[0], planenormal);
2485 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2495 #define MAX_PORTALPOINTS 64
2497 typedef struct portal_s
2500 mnode_t *nodes[2]; // [0] = front side of plane
2501 struct portal_s *next[2];
2503 double points[3*MAX_PORTALPOINTS];
2504 struct portal_s *chain; // all portals are linked into a list
2508 static portal_t *portalchain;
2515 static portal_t *AllocPortal(void)
2518 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2519 p->chain = portalchain;
2524 static void FreePortal(portal_t *p)
2529 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2531 // process only nodes (leafs already had their box calculated)
2535 // calculate children first
2536 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2537 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2539 // make combined bounding box from children
2540 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2541 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2542 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2543 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2544 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2545 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2548 static void Mod_Q1BSP_FinalizePortals(void)
2550 int i, j, numportals, numpoints;
2551 portal_t *p, *pnext;
2554 mleaf_t *leaf, *endleaf;
2556 // tally up portal and point counts and recalculate bounding boxes for all
2557 // leafs (because qbsp is very sloppy)
2558 leaf = loadmodel->brush.data_leafs;
2559 endleaf = leaf + loadmodel->brush.num_leafs;
2560 for (;leaf < endleaf;leaf++)
2562 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2563 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2570 // note: this check must match the one below or it will usually corrupt memory
2571 // 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
2572 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2575 numpoints += p->numpoints * 2;
2579 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2580 loadmodel->brush.num_portals = numportals;
2581 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2582 loadmodel->brush.num_portalpoints = numpoints;
2583 // clear all leaf portal chains
2584 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2585 loadmodel->brush.data_leafs[i].portals = NULL;
2586 // process all portals in the global portal chain, while freeing them
2587 portal = loadmodel->brush.data_portals;
2588 point = loadmodel->brush.data_portalpoints;
2595 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2597 // note: this check must match the one above or it will usually corrupt memory
2598 // 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
2599 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2601 // first make the back to front portal(forward portal)
2602 portal->points = point;
2603 portal->numpoints = p->numpoints;
2604 portal->plane.dist = p->plane.dist;
2605 VectorCopy(p->plane.normal, portal->plane.normal);
2606 portal->here = (mleaf_t *)p->nodes[1];
2607 portal->past = (mleaf_t *)p->nodes[0];
2609 for (j = 0;j < portal->numpoints;j++)
2611 VectorCopy(p->points + j*3, point->position);
2614 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2615 PlaneClassify(&portal->plane);
2617 // link into leaf's portal chain
2618 portal->next = portal->here->portals;
2619 portal->here->portals = portal;
2621 // advance to next portal
2624 // then make the front to back portal(backward portal)
2625 portal->points = point;
2626 portal->numpoints = p->numpoints;
2627 portal->plane.dist = -p->plane.dist;
2628 VectorNegate(p->plane.normal, portal->plane.normal);
2629 portal->here = (mleaf_t *)p->nodes[0];
2630 portal->past = (mleaf_t *)p->nodes[1];
2632 for (j = portal->numpoints - 1;j >= 0;j--)
2634 VectorCopy(p->points + j*3, point->position);
2637 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2638 PlaneClassify(&portal->plane);
2640 // link into leaf's portal chain
2641 portal->next = portal->here->portals;
2642 portal->here->portals = portal;
2644 // advance to next portal
2647 // add the portal's polygon points to the leaf bounding boxes
2648 for (i = 0;i < 2;i++)
2650 leaf = (mleaf_t *)p->nodes[i];
2651 for (j = 0;j < p->numpoints;j++)
2653 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2654 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2655 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2656 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2657 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2658 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2665 // now recalculate the node bounding boxes from the leafs
2666 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2674 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2677 Host_Error("AddPortalToNodes: NULL front node");
2679 Host_Error("AddPortalToNodes: NULL back node");
2680 if (p->nodes[0] || p->nodes[1])
2681 Host_Error("AddPortalToNodes: already included");
2682 // 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
2684 p->nodes[0] = front;
2685 p->next[0] = (portal_t *)front->portals;
2686 front->portals = (mportal_t *)p;
2689 p->next[1] = (portal_t *)back->portals;
2690 back->portals = (mportal_t *)p;
2695 RemovePortalFromNode
2698 static void RemovePortalFromNodes(portal_t *portal)
2702 void **portalpointer;
2704 for (i = 0;i < 2;i++)
2706 node = portal->nodes[i];
2708 portalpointer = (void **) &node->portals;
2711 t = (portal_t *)*portalpointer;
2713 Host_Error("RemovePortalFromNodes: portal not in leaf");
2717 if (portal->nodes[0] == node)
2719 *portalpointer = portal->next[0];
2720 portal->nodes[0] = NULL;
2722 else if (portal->nodes[1] == node)
2724 *portalpointer = portal->next[1];
2725 portal->nodes[1] = NULL;
2728 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2732 if (t->nodes[0] == node)
2733 portalpointer = (void **) &t->next[0];
2734 else if (t->nodes[1] == node)
2735 portalpointer = (void **) &t->next[1];
2737 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2742 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2745 mnode_t *front, *back, *other_node;
2746 mplane_t clipplane, *plane;
2747 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2748 int numfrontpoints, numbackpoints;
2749 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2751 // if a leaf, we're done
2755 plane = node->plane;
2757 front = node->children[0];
2758 back = node->children[1];
2760 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2762 // create the new portal by generating a polygon for the node plane,
2763 // and clipping it by all of the other portals(which came from nodes above this one)
2764 nodeportal = AllocPortal();
2765 nodeportal->plane = *plane;
2767 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);
2768 nodeportal->numpoints = 4;
2769 side = 0; // shut up compiler warning
2770 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2772 clipplane = portal->plane;
2773 if (portal->nodes[0] == portal->nodes[1])
2774 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2775 if (portal->nodes[0] == node)
2777 else if (portal->nodes[1] == node)
2779 clipplane.dist = -clipplane.dist;
2780 VectorNegate(clipplane.normal, clipplane.normal);
2784 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2786 for (i = 0;i < nodeportal->numpoints*3;i++)
2787 frontpoints[i] = nodeportal->points[i];
2788 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);
2789 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
2793 if (nodeportal->numpoints < 3)
2795 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2796 nodeportal->numpoints = 0;
2798 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
2800 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
2801 nodeportal->numpoints = 0;
2804 AddPortalToNodes(nodeportal, front, back);
2806 // split the portals of this node along this node's plane and assign them to the children of this node
2807 // (migrating the portals downward through the tree)
2808 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2810 if (portal->nodes[0] == portal->nodes[1])
2811 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2812 if (portal->nodes[0] == node)
2814 else if (portal->nodes[1] == node)
2817 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2818 nextportal = portal->next[side];
2819 if (!portal->numpoints)
2822 other_node = portal->nodes[!side];
2823 RemovePortalFromNodes(portal);
2825 // cut the portal into two portals, one on each side of the node plane
2826 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);
2828 if (!numfrontpoints)
2831 AddPortalToNodes(portal, back, other_node);
2833 AddPortalToNodes(portal, other_node, back);
2839 AddPortalToNodes(portal, front, other_node);
2841 AddPortalToNodes(portal, other_node, front);
2845 // the portal is split
2846 splitportal = AllocPortal();
2847 temp = splitportal->chain;
2848 *splitportal = *portal;
2849 splitportal->chain = temp;
2850 for (i = 0;i < numbackpoints*3;i++)
2851 splitportal->points[i] = backpoints[i];
2852 splitportal->numpoints = numbackpoints;
2853 for (i = 0;i < numfrontpoints*3;i++)
2854 portal->points[i] = frontpoints[i];
2855 portal->numpoints = numfrontpoints;
2859 AddPortalToNodes(portal, front, other_node);
2860 AddPortalToNodes(splitportal, back, other_node);
2864 AddPortalToNodes(portal, other_node, front);
2865 AddPortalToNodes(splitportal, other_node, back);
2869 Mod_Q1BSP_RecursiveNodePortals(front);
2870 Mod_Q1BSP_RecursiveNodePortals(back);
2873 static void Mod_Q1BSP_MakePortals(void)
2876 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
2877 Mod_Q1BSP_FinalizePortals();
2880 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2882 int i, j, stylecounts[256], totalcount, remapstyles[256];
2883 msurface_t *surface;
2884 memset(stylecounts, 0, sizeof(stylecounts));
2885 for (i = 0;i < model->nummodelsurfaces;i++)
2887 surface = model->data_surfaces + model->firstmodelsurface + i;
2888 for (j = 0;j < MAXLIGHTMAPS;j++)
2889 stylecounts[surface->lightmapinfo->styles[j]]++;
2892 model->brushq1.light_styles = 0;
2893 for (i = 0;i < 255;i++)
2897 remapstyles[i] = model->brushq1.light_styles++;
2898 totalcount += stylecounts[i] + 1;
2903 model->brushq1.light_style = (unsigned char *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(unsigned char));
2904 model->brushq1.light_stylevalue = (int *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
2905 model->brushq1.light_styleupdatechains = (msurface_t ***)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
2906 model->brushq1.light_styleupdatechainsbuffer = (msurface_t **)Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
2907 model->brushq1.light_styles = 0;
2908 for (i = 0;i < 255;i++)
2910 model->brushq1.light_style[model->brushq1.light_styles++] = i;
2912 for (i = 0;i < model->brushq1.light_styles;i++)
2914 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2915 j += stylecounts[model->brushq1.light_style[i]] + 1;
2917 for (i = 0;i < model->nummodelsurfaces;i++)
2919 surface = model->data_surfaces + model->firstmodelsurface + i;
2920 for (j = 0;j < MAXLIGHTMAPS;j++)
2921 if (surface->lightmapinfo->styles[j] != 255)
2922 *model->brushq1.light_styleupdatechains[remapstyles[surface->lightmapinfo->styles[j]]]++ = surface;
2925 for (i = 0;i < model->brushq1.light_styles;i++)
2927 *model->brushq1.light_styleupdatechains[i] = NULL;
2928 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2929 j += stylecounts[model->brushq1.light_style[i]] + 1;
2933 //Returns PVS data for a given point
2934 //(note: can return NULL)
2935 static unsigned char *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
2938 node = model->brush.data_nodes;
2940 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
2941 if (((mleaf_t *)node)->clusterindex >= 0)
2942 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2947 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
2951 float d = PlaneDiff(org, node->plane);
2953 node = node->children[0];
2954 else if (d < -radius)
2955 node = node->children[1];
2958 // go down both sides
2959 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
2960 node = node->children[1];
2963 // if this leaf is in a cluster, accumulate the pvs bits
2964 if (((mleaf_t *)node)->clusterindex >= 0)
2967 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2968 for (i = 0;i < pvsbytes;i++)
2969 pvsbuffer[i] |= pvs[i];
2973 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
2974 //of the given point.
2975 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength)
2977 int bytes = model->brush.num_pvsclusterbytes;
2978 bytes = min(bytes, pvsbufferlength);
2979 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
2981 memset(pvsbuffer, 0xFF, bytes);
2984 memset(pvsbuffer, 0, bytes);
2985 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
2989 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
2994 VectorSubtract(inmaxs, inmins, size);
2995 if (cmodel->brush.ismcbsp)
2998 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2999 else if (size[2] < 48) // pick the nearest of 40 or 56
3000 hull = &cmodel->brushq1.hulls[2]; // 16x16x40
3002 hull = &cmodel->brushq1.hulls[1]; // 16x16x56
3004 else if (cmodel->brush.ishlbsp)
3007 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3008 else if (size[0] <= 32)
3010 if (size[2] < 54) // pick the nearest of 36 or 72
3011 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3013 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3016 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3021 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3022 else if (size[0] <= 32)
3023 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3025 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3027 VectorCopy(inmins, outmins);
3028 VectorAdd(inmins, hull->clip_size, outmaxs);
3031 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
3036 mempool_t *mainmempool;
3037 float dist, modelyawradius, modelradius, *vec;
3038 msurface_t *surface;
3039 int numshadowmeshtriangles;
3041 hullinfo_t hullinfo;
3043 mod->type = mod_brushq1;
3045 if (!memcmp (buffer, "MCBSPpad", 8))
3047 unsigned char *index;
3049 mod->brush.ismcbsp = true;
3050 mod->brush.ishlbsp = false;
3052 mod_base = (unsigned char*)buffer;
3056 i = SB_ReadInt (&index);
3057 if (i != MCBSPVERSION)
3058 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i)", mod->name, i, MCBSPVERSION);
3061 hullinfo.numhulls = LittleLong(*(int*)index); index += 4;
3062 hullinfo.filehulls = hullinfo.numhulls;
3063 VectorClear (hullinfo.hullsizes[0][0]);
3064 VectorClear (hullinfo.hullsizes[0][1]);
3065 for (i = 1; i < hullinfo.numhulls; i++)
3067 hullinfo.hullsizes[i][0][0] = SB_ReadFloat (&index);
3068 hullinfo.hullsizes[i][0][1] = SB_ReadFloat (&index);
3069 hullinfo.hullsizes[i][0][2] = SB_ReadFloat (&index);
3070 hullinfo.hullsizes[i][1][0] = SB_ReadFloat (&index);
3071 hullinfo.hullsizes[i][1][1] = SB_ReadFloat (&index);
3072 hullinfo.hullsizes[i][1][2] = SB_ReadFloat (&index);
3076 _header.version = 0;
3077 for (i = 0; i < HEADER_LUMPS; i++)
3079 _header.lumps[i].fileofs = SB_ReadInt (&index);
3080 _header.lumps[i].filelen = SB_ReadInt (&index);
3087 header = (dheader_t *)buffer;
3089 i = LittleLong(header->version);
3090 if (i != BSPVERSION && i != 30)
3091 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3092 mod->brush.ishlbsp = i == 30;
3093 mod->brush.ismcbsp = false;
3095 // fill in hull info
3096 VectorClear (hullinfo.hullsizes[0][0]);
3097 VectorClear (hullinfo.hullsizes[0][1]);
3098 if (mod->brush.ishlbsp)
3100 hullinfo.numhulls = 4;
3101 hullinfo.filehulls = 4;
3102 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3103 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3104 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3105 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3106 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3107 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3111 hullinfo.numhulls = 3;
3112 hullinfo.filehulls = 4;
3113 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3114 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3115 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3116 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3120 mod_base = (unsigned char*)buffer;
3121 for (i = 0; i < HEADER_LUMPS; i++)
3123 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3124 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3128 mod->soundfromcenter = true;
3129 mod->TraceBox = Mod_Q1BSP_TraceBox;
3130 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3131 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3132 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3133 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3134 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3135 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3136 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3137 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3138 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3139 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3140 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3141 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3142 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3144 if (loadmodel->isworldmodel)
3146 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3147 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3152 // store which lightmap format to use
3153 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3155 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3156 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3157 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3158 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3159 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3160 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3161 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3162 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3163 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3164 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3165 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3166 // load submodels before leafs because they contain the number of vis leafs
3167 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3168 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3169 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3170 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3172 if (!mod->brushq1.lightdata)
3173 mod->brush.LightPoint = NULL;
3175 if (mod->brushq1.data_compressedpvs)
3176 Mem_Free(mod->brushq1.data_compressedpvs);
3177 mod->brushq1.data_compressedpvs = NULL;
3178 mod->brushq1.num_compressedpvs = 0;
3180 Mod_Q1BSP_MakeHull0();
3181 Mod_Q1BSP_MakePortals();
3183 mod->numframes = 2; // regular and alternate animation
3186 mainmempool = mod->mempool;
3188 Mod_Q1BSP_LoadLightList();
3190 // make a single combined shadow mesh to allow optimized shadow volume creation
3191 numshadowmeshtriangles = 0;
3192 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3194 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3195 numshadowmeshtriangles += surface->num_triangles;
3197 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3198 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3199 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, surface->groupmesh->data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle));
3200 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
3201 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3203 if (loadmodel->brush.numsubmodels)
3204 loadmodel->brush.submodels = (model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3206 if (loadmodel->isworldmodel)
3208 // clear out any stale submodels or worldmodels lying around
3209 // if we did this clear before now, an error might abort loading and
3210 // leave things in a bad state
3211 Mod_RemoveStaleWorldModels(loadmodel);
3214 // LordHavoc: to clear the fog around the original quake submodel code, I
3216 // first of all, some background info on the submodels:
3217 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3218 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3219 // now the weird for loop itself:
3220 // the loop functions in an odd way, on each iteration it sets up the
3221 // current 'mod' model (which despite the confusing code IS the model of
3222 // the number i), at the end of the loop it duplicates the model to become
3223 // the next submodel, and loops back to set up the new submodel.
3225 // LordHavoc: now the explanation of my sane way (which works identically):
3226 // set up the world model, then on each submodel copy from the world model
3227 // and set up the submodel with the respective model info.
3228 for (i = 0;i < mod->brush.numsubmodels;i++)
3230 // LordHavoc: this code was originally at the end of this loop, but
3231 // has been transformed to something more readable at the start here.
3236 // LordHavoc: only register submodels if it is the world
3237 // (prevents external bsp models from replacing world submodels with
3239 if (!loadmodel->isworldmodel)
3241 // duplicate the basic information
3242 sprintf(name, "*%i", i);
3243 mod = Mod_FindName(name);
3244 // copy the base model to this one
3246 // rename the clone back to its proper name
3247 strcpy(mod->name, name);
3248 // textures and memory belong to the main model
3249 mod->texturepool = NULL;
3250 mod->mempool = NULL;
3253 mod->brush.submodel = i;
3255 if (loadmodel->brush.submodels)
3256 loadmodel->brush.submodels[i] = mod;
3258 bm = &mod->brushq1.submodels[i];
3260 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3261 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3263 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3264 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3267 mod->firstmodelsurface = bm->firstface;
3268 mod->nummodelsurfaces = bm->numfaces;
3270 // make the model surface list (used by shadowing/lighting)
3271 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
3272 for (j = 0;j < mod->nummodelsurfaces;j++)
3273 mod->surfacelist[j] = mod->firstmodelsurface + j;
3275 // this gets altered below if sky is used
3276 mod->DrawSky = NULL;
3277 mod->Draw = R_Q1BSP_Draw;
3278 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3279 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3280 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3281 mod->DrawLight = R_Q1BSP_DrawLight;
3284 mod->brush.GetPVS = NULL;
3285 mod->brush.FatPVS = NULL;
3286 mod->brush.BoxTouchingPVS = NULL;
3287 mod->brush.BoxTouchingLeafPVS = NULL;
3288 mod->brush.BoxTouchingVisibleLeafs = NULL;
3289 mod->brush.FindBoxClusters = NULL;
3290 mod->brush.LightPoint = NULL;
3291 mod->brush.AmbientSoundLevelsForPoint = NULL;
3293 Mod_Q1BSP_BuildLightmapUpdateChains(loadmodel->mempool, mod);
3294 if (mod->nummodelsurfaces)
3296 // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3297 mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3298 mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3301 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3303 // we only need to have a drawsky function if it is used(usually only on world model)
3304 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3305 mod->DrawSky = R_Q1BSP_DrawSky;
3306 // calculate bounding shapes
3307 for (k = 0, vec = (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3309 if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3310 if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3311 if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3312 if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3313 if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3314 if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3315 dist = vec[0]*vec[0]+vec[1]*vec[1];
3316 if (modelyawradius < dist)
3317 modelyawradius = dist;
3318 dist += vec[2]*vec[2];
3319 if (modelradius < dist)
3323 modelyawradius = sqrt(modelyawradius);
3324 modelradius = sqrt(modelradius);
3325 mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3326 mod->yawmins[2] = mod->normalmins[2];
3327 mod->yawmaxs[2] = mod->normalmaxs[2];
3328 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3329 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3330 mod->radius = modelradius;
3331 mod->radius2 = modelradius * modelradius;
3335 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3336 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3338 //mod->brushq1.num_visleafs = bm->visleafs;
3341 Mod_Q1BSP_LoadMapBrushes();
3343 //Mod_Q1BSP_ProcessLightList();
3345 if (developer.integer)
3346 Con_Printf("Some stats for q1bsp model \"%s\": %i faces, %i nodes, %i leafs, %i visleafs, %i visleafportals\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals);
3349 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3353 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3360 in = (void *)(mod_base + l->fileofs);
3361 if (l->filelen % sizeof(*in))
3362 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3363 count = l->filelen / sizeof(*in);
3364 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3367 loadmodel->num = count;
3369 for (i = 0;i < count;i++, in++, out++)
3375 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3382 in = (void *)(mod_base + l->fileofs);
3383 if (l->filelen % sizeof(*in))
3384 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3385 count = l->filelen / sizeof(*in);
3386 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3389 loadmodel->num = count;
3391 for (i = 0;i < count;i++, in++, out++)
3397 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3404 in = (void *)(mod_base + l->fileofs);
3405 if (l->filelen % sizeof(*in))
3406 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3407 count = l->filelen / sizeof(*in);
3408 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3411 loadmodel->num = count;
3413 for (i = 0;i < count;i++, in++, out++)
3419 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3426 in = (void *)(mod_base + l->fileofs);
3427 if (l->filelen % sizeof(*in))
3428 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3429 count = l->filelen / sizeof(*in);
3430 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3433 loadmodel->num = count;
3435 for (i = 0;i < count;i++, in++, out++)
3441 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3448 in = (void *)(mod_base + l->fileofs);
3449 if (l->filelen % sizeof(*in))
3450 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3451 count = l->filelen / sizeof(*in);
3452 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3455 loadmodel->num = count;
3457 for (i = 0;i < count;i++, in++, out++)
3463 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3470 in = (void *)(mod_base + l->fileofs);
3471 if (l->filelen % sizeof(*in))
3472 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3473 count = l->filelen / sizeof(*in);
3474 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3477 loadmodel->num = count;
3479 for (i = 0;i < count;i++, in++, out++)
3485 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3492 in = (void *)(mod_base + l->fileofs);
3493 if (l->filelen % sizeof(*in))
3494 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3495 count = l->filelen / sizeof(*in);
3496 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3499 loadmodel->num = count;
3501 for (i = 0;i < count;i++, in++, out++)
3507 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3514 in = (void *)(mod_base + l->fileofs);
3515 if (l->filelen % sizeof(*in))
3516 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3517 count = l->filelen / sizeof(*in);
3518 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3521 loadmodel->num = count;
3523 for (i = 0;i < count;i++, in++, out++)
3529 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3536 in = (void *)(mod_base + l->fileofs);
3537 if (l->filelen % sizeof(*in))
3538 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3539 count = l->filelen / sizeof(*in);
3540 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3543 loadmodel->num = count;
3545 for (i = 0;i < count;i++, in++, out++)
3551 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3558 in = (void *)(mod_base + l->fileofs);
3559 if (l->filelen % sizeof(*in))
3560 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3561 count = l->filelen / sizeof(*in);
3562 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3565 loadmodel->num = count;
3567 for (i = 0;i < count;i++, in++, out++)
3573 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3580 in = (void *)(mod_base + l->fileofs);
3581 if (l->filelen % sizeof(*in))
3582 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3583 count = l->filelen / sizeof(*in);
3584 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3587 loadmodel->num = count;
3589 for (i = 0;i < count;i++, in++, out++)
3595 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3602 in = (void *)(mod_base + l->fileofs);
3603 if (l->filelen % sizeof(*in))
3604 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3605 count = l->filelen / sizeof(*in);
3606 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3609 loadmodel->num = count;
3611 for (i = 0;i < count;i++, in++, out++)
3617 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3624 in = (void *)(mod_base + l->fileofs);
3625 if (l->filelen % sizeof(*in))
3626 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3627 count = l->filelen / sizeof(*in);
3628 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3631 loadmodel->num = count;
3633 for (i = 0;i < count;i++, in++, out++)
3639 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3646 in = (void *)(mod_base + l->fileofs);
3647 if (l->filelen % sizeof(*in))
3648 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3649 count = l->filelen / sizeof(*in);
3650 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3653 loadmodel->num = count;
3655 for (i = 0;i < count;i++, in++, out++)
3661 static void Mod_Q2BSP_LoadAreas(lump_t *l)
3668 in = (void *)(mod_base + l->fileofs);
3669 if (l->filelen % sizeof(*in))
3670 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
3671 count = l->filelen / sizeof(*in);
3672 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3675 loadmodel->num = count;
3677 for (i = 0;i < count;i++, in++, out++)
3683 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
3690 in = (void *)(mod_base + l->fileofs);
3691 if (l->filelen % sizeof(*in))
3692 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
3693 count = l->filelen / sizeof(*in);
3694 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3697 loadmodel->num = count;
3699 for (i = 0;i < count;i++, in++, out++)
3705 static void Mod_Q2BSP_LoadModels(lump_t *l)
3712 in = (void *)(mod_base + l->fileofs);
3713 if (l->filelen % sizeof(*in))
3714 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
3715 count = l->filelen / sizeof(*in);
3716 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3719 loadmodel->num = count;
3721 for (i = 0;i < count;i++, in++, out++)
3727 void static Mod_Q2BSP_Load(model_t *mod, void *buffer, void *bufferend)
3730 q2dheader_t *header;
3732 Host_Error("Mod_Q2BSP_Load: not yet implemented");
3734 mod->type = mod_brushq2;
3736 header = (q2dheader_t *)buffer;
3738 i = LittleLong(header->version);
3739 if (i != Q2BSPVERSION)
3740 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
3741 mod->brush.ishlbsp = false;
3742 mod->brush.ismcbsp = false;
3743 if (loadmodel->isworldmodel)
3745 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3746 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3749 mod_base = (unsigned char *)header;
3751 // swap all the lumps
3752 for (i = 0;i < (int) sizeof(*header) / 4;i++)
3753 ((int *)header)[i] = LittleLong(((int *)header)[i]);
3755 // store which lightmap format to use
3756 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3758 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
3759 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
3760 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
3761 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
3762 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
3763 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
3764 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
3765 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
3766 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
3767 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
3768 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
3769 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
3770 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
3771 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
3772 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
3773 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
3774 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
3775 // LordHavoc: must go last because this makes the submodels
3776 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
3779 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
3780 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
3782 static void Mod_Q3BSP_LoadEntities(lump_t *l)
3785 char key[128], value[4096];
3787 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
3788 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
3789 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
3792 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
3793 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
3794 data = loadmodel->brush.entities;
3795 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
3796 if (data && COM_ParseToken(&data, false) && com_token[0] == '{')
3800 if (!COM_ParseToken(&data, false))
3802 if (com_token[0] == '}')
3803 break; // end of worldspawn
3804 if (com_token[0] == '_')
3805 strcpy(key, com_token + 1);
3807 strcpy(key, com_token);
3808 while (key[strlen(key)-1] == ' ') // remove trailing spaces
3809 key[strlen(key)-1] = 0;
3810 if (!COM_ParseToken(&data, false))
3812 strcpy(value, com_token);
3813 if (!strcmp("gridsize", key))
3815 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
3816 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
3822 static void Mod_Q3BSP_LoadTextures(lump_t *l)
3831 int flags, flags2, numparameters, passnumber;
3832 char shadername[Q3PATHLENGTH];
3833 char sky[Q3PATHLENGTH];
3834 char firstpasstexturename[Q3PATHLENGTH];
3835 char parameter[4][Q3PATHLENGTH];
3837 in = (q3dtexture_t *)(mod_base + l->fileofs);
3838 if (l->filelen % sizeof(*in))
3839 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
3840 count = l->filelen / sizeof(*in);
3841 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3843 loadmodel->data_textures = out;
3844 loadmodel->num_textures = count;
3846 for (i = 0;i < count;i++, in++, out++)
3848 strlcpy (out->name, in->name, sizeof (out->name));
3849 out->surfaceflags = LittleLong(in->surfaceflags);
3850 out->supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in->contents));
3851 out->surfaceparms = -1;
3854 // do a quick parse of shader files to get surfaceparms
3855 if ((search = FS_Search("scripts/*.shader", true, false)))
3857 for (i = 0;i < search->numfilenames;i++)
3859 if ((f = (char *)FS_LoadFile(search->filenames[i], tempmempool, false, NULL)))
3862 while (COM_ParseToken(&text, false))
3864 strlcpy (shadername, com_token, sizeof (shadername));
3869 firstpasstexturename[0] = 0;
3870 if (COM_ParseToken(&text, false) && !strcasecmp(com_token, "{"))
3872 while (COM_ParseToken(&text, false))
3874 if (!strcasecmp(com_token, "}"))
3876 else if (!strcasecmp(com_token, "{"))
3878 while (COM_ParseToken(&text, false))
3880 if (!strcasecmp(com_token, "}"))
3882 if (!strcasecmp(com_token, "\n"))
3885 for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3889 strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3890 numparameters = j + 1;
3892 if (!COM_ParseToken(&text, true))
3895 if (developer.integer >= 2)
3897 Con_Printf("%s %i: ", shadername, passnumber);
3898 for (j = 0;j < numparameters;j++)
3899 Con_Printf(" %s", parameter[j]);
3902 if (passnumber == 0 && numparameters >= 1)
3904 if (!strcasecmp(parameter[0], "blendfunc") && (flags & Q3SURFACEPARM_TRANS))
3906 if (numparameters == 2 && !strcasecmp(parameter[1], "add"))
3907 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3908 else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_one") && !strcasecmp(parameter[2], "gl_one"))
3909 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3910 else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_src_alpha") && !strcasecmp(parameter[2], "gl_one"))
3911 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3913 else if (numparameters >= 2 && (!strcasecmp(parameter[0], "map") || !strcasecmp(parameter[0], "clampmap")))
3914 strlcpy(firstpasstexturename, parameter[1], sizeof(firstpasstexturename));
3915 else if (numparameters >= 3 && !strcasecmp(parameter[0], "animmap"))
3916 strlcpy(firstpasstexturename, parameter[2], sizeof(firstpasstexturename));
3917 else if (numparameters >= 2 && !strcasecmp(parameter[0], "alphafunc"))
3918 flags2 |= Q3TEXTUREFLAG_ALPHATEST;
3920 // break out a level if it was }
3921 if (!strcasecmp(com_token, "}"))
3928 for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3932 strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3933 numparameters = j + 1;
3935 if (!COM_ParseToken(&text, true))
3938 if (i == 0 && !strcasecmp(com_token, "}"))
3940 if (developer.integer >= 2)
3942 Con_Printf("%s: ", shadername);
3943 for (j = 0;j < numparameters;j++)
3944 Con_Printf(" %s", parameter[j]);
3947 if (numparameters < 1)
3949 if (!strcasecmp(parameter[0], "surfaceparm") && numparameters >= 2)
3951 if (!strcasecmp(parameter[1], "alphashadow"))
3952 flags |= Q3SURFACEPARM_ALPHASHADOW;
3953 else if (!strcasecmp(parameter[1], "areaportal"))
3954 flags |= Q3SURFACEPARM_AREAPORTAL;
3955 else if (!strcasecmp(parameter[1], "clusterportal"))
3956 flags |= Q3SURFACEPARM_CLUSTERPORTAL;
3957 else if (!strcasecmp(parameter[1], "detail"))
3958 flags |= Q3SURFACEPARM_DETAIL;
3959 else if (!strcasecmp(parameter[1], "donotenter"))
3960 flags |= Q3SURFACEPARM_DONOTENTER;
3961 else if (!strcasecmp(parameter[1], "fog"))
3962 flags |= Q3SURFACEPARM_FOG;
3963 else if (!strcasecmp(parameter[1], "lava"))
3964 flags |= Q3SURFACEPARM_LAVA;
3965 else if (!strcasecmp(parameter[1], "lightfilter"))
3966 flags |= Q3SURFACEPARM_LIGHTFILTER;
3967 else if (!strcasecmp(parameter[1], "metalsteps"))
3968 flags |= Q3SURFACEPARM_METALSTEPS;
3969 else if (!strcasecmp(parameter[1], "nodamage"))
3970 flags |= Q3SURFACEPARM_NODAMAGE;
3971 else if (!strcasecmp(parameter[1], "nodlight"))
3972 flags |= Q3SURFACEPARM_NODLIGHT;
3973 else if (!strcasecmp(parameter[1], "nodraw"))
3974 flags |= Q3SURFACEPARM_NODRAW;
3975 else if (!strcasecmp(parameter[1], "nodrop"))
3976 flags |= Q3SURFACEPARM_NODROP;
3977 else if (!strcasecmp(parameter[1], "noimpact"))
3978 flags |= Q3SURFACEPARM_NOIMPACT;
3979 else if (!strcasecmp(parameter[1], "nolightmap"))
3980 flags |= Q3SURFACEPARM_NOLIGHTMAP;
3981 else if (!strcasecmp(parameter[1], "nomarks"))
3982 flags |= Q3SURFACEPARM_NOMARKS;
3983 else if (!strcasecmp(parameter[1], "nomipmaps"))
3984 flags |= Q3SURFACEPARM_NOMIPMAPS;
3985 else if (!strcasecmp(parameter[1], "nonsolid"))
3986 flags |= Q3SURFACEPARM_NONSOLID;
3987 else if (!strcasecmp(parameter[1], "origin"))
3988 flags |= Q3SURFACEPARM_ORIGIN;
3989 else if (!strcasecmp(parameter[1], "playerclip"))
3990 flags |= Q3SURFACEPARM_PLAYERCLIP;
3991 else if (!strcasecmp(parameter[1], "sky"))
3992 flags |= Q3SURFACEPARM_SKY;
3993 else if (!strcasecmp(parameter[1], "slick"))
3994 flags |= Q3SURFACEPARM_SLICK;
3995 else if (!strcasecmp(parameter[1], "slime"))
3996 flags |= Q3SURFACEPARM_SLIME;
3997 else if (!strcasecmp(parameter[1], "structural"))
3998 flags |= Q3SURFACEPARM_STRUCTURAL;
3999 else if (!strcasecmp(parameter[1], "trans"))
4000 flags |= Q3SURFACEPARM_TRANS;
4001 else if (!strcasecmp(parameter[1], "water"))
4002 flags |= Q3SURFACEPARM_WATER;
4003 else if (!strcasecmp(parameter[1], "pointlight"))
4004 flags |= Q3SURFACEPARM_POINTLIGHT;
4006 Con_Printf("%s parsing warning: unknown surfaceparm \"%s\"\n", search->filenames[i], parameter[1]);
4008 else if (!strcasecmp(parameter[0], "sky") && numparameters >= 2)
4009 strlcpy(sky, parameter[1], sizeof(sky));
4010 else if (!strcasecmp(parameter[0], "skyparms") && numparameters >= 2)
4012 if (!atoi(parameter[1]) && strcasecmp(parameter[1], "-"))
4013 strlcpy(sky, parameter[1], sizeof(sky));
4015 else if (!strcasecmp(parameter[0], "cull") && numparameters >= 2)
4017 if (!strcasecmp(parameter[1], "disable") || !strcasecmp(parameter[1], "none") || !strcasecmp(parameter[1], "twosided"))
4018 flags2 |= Q3TEXTUREFLAG_TWOSIDED;
4020 else if (!strcasecmp(parameter[0], "nomipmaps"))
4021 flags2 |= Q3TEXTUREFLAG_NOMIPMAPS;
4022 else if (!strcasecmp(parameter[0], "nopicmip"))
4023 flags2 |= Q3TEXTUREFLAG_NOPICMIP;
4024 else if (!strcasecmp(parameter[0], "deformvertexes") && numparameters >= 2)
4026 if (!strcasecmp(parameter[1], "autosprite") && numparameters == 2)
4027 flags2 |= Q3TEXTUREFLAG_AUTOSPRITE;
4028 if (!strcasecmp(parameter[1], "autosprite2") && numparameters == 2)
4029 flags2 |= Q3TEXTUREFLAG_AUTOSPRITE2;
4032 // add shader to list (shadername and flags)
4033 // actually here we just poke into the texture settings
4034 for (j = 0, out = loadmodel->data_textures;j < loadmodel->num_textures;j++, out++)
4036 if (!strcasecmp(out->name, shadername))
4038 out->surfaceparms = flags;
4039 out->textureflags = flags2;
4040 out->basematerialflags = 0;
4041 if (out->surfaceparms & Q3SURFACEPARM_NODRAW)
4042 out->basematerialflags |= MATERIALFLAG_NODRAW;
4043 else if (out->surfaceparms & Q3SURFACEPARM_SKY)
4044 out->basematerialflags |= MATERIALFLAG_SKY;
4045 else if (out->surfaceparms & Q3SURFACEPARM_LAVA)
4046 out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_FULLBRIGHT;
4047 else if (out->surfaceparms & Q3SURFACEPARM_SLIME)
4048 out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_WATERALPHA;
4049 else if (out->surfaceparms & Q3SURFACEPARM_WATER)
4050 out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_WATERALPHA;
4052 out->basematerialflags |= MATERIALFLAG_WALL;
4053 if (out->textureflags & Q3TEXTUREFLAG_ALPHATEST)
4055 // FIXME: support alpha test?
4056 out->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
4058 else if (out->surfaceparms & Q3SURFACEPARM_TRANS)
4060 if (out->textureflags & Q3TEXTUREFLAG_ADDITIVE)
4061 out->basematerialflags |= MATERIALFLAG_ADD | MATERIALFLAG_TRANSPARENT;
4063 out->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
4065 strlcpy(out->firstpasstexturename, firstpasstexturename, sizeof(out->firstpasstexturename));
4066 if ((flags & Q3SURFACEPARM_SKY) && sky[0])
4068 // quake3 seems to append a _ to the skybox name, so this must do so as well
4069 dpsnprintf(loadmodel->brush.skybox, sizeof(loadmodel->brush.skybox), "%s_", sky);
4076 Con_Printf("%s parsing error - expected \"{\", found \"%s\"\n", search->filenames[i], com_token);
4087 for (j = 0, out = loadmodel->data_textures;j < loadmodel->num_textures;j++, out++)
4089 if (out->surfaceparms == -1)
4092 Con_DPrintf("%s: No shader found for texture \"%s\"\n", loadmodel->name, out->name);
4093 out->surfaceparms = 0;
4094 if (out->surfaceflags & Q3SURFACEFLAG_NODRAW)
4095 out->basematerialflags |= MATERIALFLAG_NODRAW;
4096 else if (out->surfaceflags & Q3SURFACEFLAG_SKY)
4097 out->basematerialflags |= MATERIALFLAG_SKY;
4099 out->basematerialflags |= MATERIALFLAG_WALL;
4100 // these are defaults
4101 //if (!strncmp(out->name, "textures/skies/", 15))
4102 // out->surfaceparms |= Q3SURFACEPARM_SKY;
4103 //if (!strcmp(out->name, "caulk") || !strcmp(out->name, "common/caulk") || !strcmp(out->name, "textures/common/caulk")
4104 // || !strcmp(out->name, "nodraw") || !strcmp(out->name, "common/nodraw") || !strcmp(out->name, "textures/common/nodraw"))
4105 // out->surfaceparms |= Q3SURFACEPARM_NODRAW;
4106 //if (R_TextureHasAlpha(out->skin.base))
4107 // out->surfaceparms |= Q3SURFACEPARM_TRANS;
4109 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))
4110 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))
4111 if (cls.state != ca_dedicated)
4112 Con_Printf("%s: texture loading for shader \"%s\" failed (first layer \"%s\" not found either)\n", loadmodel->name, out->name, out->firstpasstexturename);
4114 out->currentframe = out;
4117 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
4120 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4126 in = (q3dplane_t *)(mod_base + l->fileofs);
4127 if (l->filelen % sizeof(*in))
4128 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4129 count = l->filelen / sizeof(*in);
4130 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4132 loadmodel->brush.data_planes = out;
4133 loadmodel->brush.num_planes = count;
4135 for (i = 0;i < count;i++, in++, out++)
4137 out->normal[0] = LittleFloat(in->normal[0]);
4138 out->normal[1] = LittleFloat(in->normal[1]);
4139 out->normal[2] = LittleFloat(in->normal[2]);
4140 out->dist = LittleFloat(in->dist);
4145 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4148 q3mbrushside_t *out;
4151 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4152 if (l->filelen % sizeof(*in))
4153 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4154 count = l->filelen / sizeof(*in);
4155 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4157 loadmodel->brush.data_brushsides = out;
4158 loadmodel->brush.num_brushsides = count;
4160 for (i = 0;i < count;i++, in++, out++)
4162 n = LittleLong(in->planeindex);
4163 if (n < 0 || n >= loadmodel->brush.num_planes)
4164 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4165 out->plane = loadmodel->brush.data_planes + n;
4166 n = LittleLong(in->textureindex);
4167 if (n < 0 || n >= loadmodel->num_textures)
4168 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4169 out->texture = loadmodel->data_textures + n;
4173 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4177 int i, j, n, c, count, maxplanes;
4180 in = (q3dbrush_t *)(mod_base + l->fileofs);
4181 if (l->filelen % sizeof(*in))
4182 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4183 count = l->filelen / sizeof(*in);
4184 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4186 loadmodel->brush.data_brushes = out;
4187 loadmodel->brush.num_brushes = count;
4192 for (i = 0;i < count;i++, in++, out++)
4194 n = LittleLong(in->firstbrushside);
4195 c = LittleLong(in->numbrushsides);
4196 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4197 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4198 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4199 out->numbrushsides = c;
4200 n = LittleLong(in->textureindex);
4201 if (n < 0 || n >= loadmodel->num_textures)
4202 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4203 out->texture = loadmodel->data_textures + n;
4205 // make a list of mplane_t structs to construct a colbrush from
4206 if (maxplanes < out->numbrushsides)
4208 maxplanes = out->numbrushsides;
4211 planes = (mplane_t *)Mem_Alloc(tempmempool, sizeof(mplane_t) * maxplanes);
4213 for (j = 0;j < out->numbrushsides;j++)
4215 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4216 planes[j].dist = out->firstbrushside[j].plane->dist;
4218 // make the colbrush from the planes
4219 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4225 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4231 in = (q3deffect_t *)(mod_base + l->fileofs);
4232 if (l->filelen % sizeof(*in))
4233 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4234 count = l->filelen / sizeof(*in);
4235 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4237 loadmodel->brushq3.data_effects = out;
4238 loadmodel->brushq3.num_effects = count;
4240 for (i = 0;i < count;i++, in++, out++)
4242 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4243 n = LittleLong(in->brushindex);
4244 if (n >= loadmodel->brush.num_brushes)
4246 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4249 out->brushindex = n;
4250 out->unknown = LittleLong(in->unknown);
4254 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4259 in = (q3dvertex_t *)(mod_base + l->fileofs);
4260 if (l->filelen % sizeof(*in))
4261 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4262 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4263 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 2 + 2 + 4)));
4264 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + count * 3;
4265 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4266 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4268 for (i = 0;i < count;i++, in++)
4270 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4271 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4272 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4273 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4274 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4275 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4276 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4277 // svector/tvector are calculated later in face loading
4278 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4279 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4280 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4281 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4285 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4291 in = (int *)(mod_base + l->fileofs);
4292 if (l->filelen % sizeof(int[3]))
4293 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4294 count = l->filelen / sizeof(*in);
4295 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4297 loadmodel->brushq3.num_triangles = count / 3;
4298 loadmodel->brushq3.data_element3i = out;
4300 for (i = 0;i < count;i++, in++, out++)
4302 *out = LittleLong(*in);
4303 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4305 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4311 static void Mod_Q3BSP_LoadLightmaps(lump_t *l)
4319 in = (q3dlightmap_t *)(mod_base + l->fileofs);
4320 if (l->filelen % sizeof(*in))
4321 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4322 count = l->filelen / sizeof(*in);
4323 out = (rtexture_t **)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4325 loadmodel->brushq3.data_lightmaps = out;
4326 loadmodel->brushq3.num_lightmaps = count;
4328 for (i = 0;i < count;i++, in++, out++)
4329 *out = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", i), 128, 128, in->rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4332 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4334 q3dface_t *in, *oldin;
4335 msurface_t *out, *oldout;
4336 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;
4337 //int *originalelement3i;
4338 //int *originalneighbor3i;
4339 float *originalvertex3f;
4340 //float *originalsvector3f;
4341 //float *originaltvector3f;
4342 //float *originalnormal3f;
4343 float *originalcolor4f;
4344 float *originaltexcoordtexture2f;
4345 float *originaltexcoordlightmap2f;
4347 surfmesh_t *mesh, *tempmeshlist[1024];
4349 in = (q3dface_t *)(mod_base + l->fileofs);
4350 if (l->filelen % sizeof(*in))
4351 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4352 count = l->filelen / sizeof(*in);
4353 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4355 loadmodel->data_surfaces = out;
4356 loadmodel->num_surfaces = count;
4359 for (meshnum = 0;i < count;meshnum++)
4366 for (;i < count;i++, in++, out++)
4368 // check face type first
4369 type = LittleLong(in->type);
4370 if (type != Q3FACETYPE_POLYGON
4371 && type != Q3FACETYPE_PATCH
4372 && type != Q3FACETYPE_MESH
4373 && type != Q3FACETYPE_FLARE)
4375 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4379 n = LittleLong(in->textureindex);
4380 if (n < 0 || n >= loadmodel->num_textures)
4382 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4385 out->texture = loadmodel->data_textures + n;
4386 n = LittleLong(in->effectindex);
4387 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4389 if (developer.integer >= 2)
4390 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4396 out->effect = loadmodel->brushq3.data_effects + n;
4397 n = LittleLong(in->lightmapindex);
4398 if (n >= loadmodel->brushq3.num_lightmaps)
4400 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_lightmaps);
4406 out->lightmaptexture = NULL;
4408 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n];
4410 firstvertex = LittleLong(in->firstvertex);
4411 numvertices = LittleLong(in->numvertices);
4412 firstelement = LittleLong(in->firstelement);
4413 numtriangles = LittleLong(in->numelements) / 3;
4414 if (numtriangles * 3 != LittleLong(in->numelements))
4416 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));
4419 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4421 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);
4424 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4426 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);
4431 case Q3FACETYPE_POLYGON:
4432 case Q3FACETYPE_MESH:
4433 // no processing necessary
4435 case Q3FACETYPE_PATCH:
4436 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4437 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4438 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))
4440 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4443 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4444 // convert patch to Q3FACETYPE_MESH
4445 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4446 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4447 // bound to user settings
4448 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4449 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4450 // bound to sanity settings
4451 xtess = bound(1, xtess, 1024);
4452 ytess = bound(1, ytess, 1024);
4453 // bound to user limit on vertices
4454 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4461 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4462 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4463 numvertices = finalwidth * finalheight;
4464 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4466 case Q3FACETYPE_FLARE:
4467 if (developer.integer >= 2)
4468 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4472 out->num_vertices = numvertices;
4473 out->num_triangles = numtriangles;
4474 if (meshvertices + out->num_vertices > 65536)
4476 meshvertices += out->num_vertices;
4477 meshtriangles += out->num_triangles;
4483 mesh = tempmeshlist[meshnum] = Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4486 for (;i < count && meshvertices + out->num_vertices <= mesh->num_vertices;i++, in++, out++)
4488 if (out->num_vertices < 3 || out->num_triangles < 1)
4491 type = LittleLong(in->type);
4492 firstvertex = LittleLong(in->firstvertex);
4493 firstelement = LittleLong(in->firstelement);
4494 out->groupmesh = mesh;
4495 out->num_firstvertex = meshvertices;
4496 out->num_firsttriangle = meshtriangles;
4499 case Q3FACETYPE_POLYGON:
4500 case Q3FACETYPE_MESH:
4501 // no processing necessary
4502 for (j = 0;j < out->num_vertices;j++)
4504 (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4505 (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4506 (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4507 (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4508 (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4509 (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4510 (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4511 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4512 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4513 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4514 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4516 for (j = 0;j < out->num_triangles*3;j++)
4517 (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4519 case Q3FACETYPE_PATCH:
4520 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4521 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4522 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4523 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4524 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4525 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4526 // convert patch to Q3FACETYPE_MESH
4527 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4528 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4529 // bound to user settings
4530 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4531 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4532 // bound to sanity settings
4533 xtess = bound(1, xtess, 1024);
4534 ytess = bound(1, ytess, 1024);
4535 // bound to user limit on vertices
4536 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4543 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4544 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4545 finalvertices = finalwidth * finalheight;
4546 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4547 type = Q3FACETYPE_MESH;
4548 // generate geometry
4549 // (note: normals are skipped because they get recalculated)
4550 Q3PatchTesselateFloat(3, sizeof(float[3]), (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4551 Q3PatchTesselateFloat(2, sizeof(float[2]), (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4552 Q3PatchTesselateFloat(2, sizeof(float[2]), (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4553 Q3PatchTesselateFloat(4, sizeof(float[4]), (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4554 Q3PatchTriangleElements((out->groupmesh->data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4555 out->num_triangles = Mod_RemoveDegenerateTriangles(out->num_triangles, (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), out->groupmesh->data_vertex3f);
4556 if (developer.integer >= 2)
4558 if (out->num_triangles < finaltriangles)
4559 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles, %i degenerate triangles removed (leaving %i)\n", patchsize[0], patchsize[1], out->num_vertices, finaltriangles, finaltriangles - out->num_triangles, out->num_triangles);
4561 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->num_vertices, out->num_triangles);
4563 // q3map does not put in collision brushes for curves... ugh
4564 // build the lower quality collision geometry
4565 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4566 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4567 // bound to user settings
4568 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4569 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4570 // bound to sanity settings
4571 xtess = bound(1, xtess, 1024);
4572 ytess = bound(1, ytess, 1024);
4573 // bound to user limit on vertices
4574 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4581 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4582 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4583 finalvertices = finalwidth * finalheight;
4584 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4586 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4587 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4588 out->num_collisionvertices = finalvertices;
4589 out->num_collisiontriangles = finaltriangles;
4590 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4591 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4593 //Mod_SnapVertices(3, out->num_vertices, (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), 0.25);
4594 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4596 oldnumtriangles = out->num_triangles;
4597 oldnumtriangles2 = out->num_collisiontriangles;
4598 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4599 if (developer.integer)
4600 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve became %i:%i vertices / %i:%i triangles (%i:%i degenerate)\n", patchsize[0], patchsize[1], out->num_vertices, out->num_collisionvertices, oldnumtriangles, oldnumtriangles2, oldnumtriangles - out->num_triangles, oldnumtriangles2 - out->num_collisiontriangles);
4605 meshvertices += out->num_vertices;
4606 meshtriangles += out->num_triangles;
4607 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4608 if ((out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4610 if (invalidelements)
4612 Con_Printf("Mod_Q3BSP_LoadFaces: Warning: face #%i has %i invalid elements, type = %i, texture->name = \"%s\", texture->surfaceflags = %i, firstvertex = %i, numvertices = %i, firstelement = %i, numelements = %i, elements list:\n", i, invalidelements, type, out->texture->name, out->texture->surfaceflags, firstvertex, out->num_vertices, firstelement, out->num_triangles * 3);
4613 for (j = 0;j < out->num_triangles * 3;j++)
4615 Con_Printf(" %i", (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
4616 if ((out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4617 (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
4621 // for per pixel lighting
4622 Mod_BuildTextureVectorsAndNormals(out->num_firstvertex, out->num_vertices, out->num_triangles, out->groupmesh->data_vertex3f, out->groupmesh->data_texcoordtexture2f, (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), out->groupmesh->data_svector3f, out->groupmesh->data_tvector3f, out->groupmesh->data_normal3f, true);
4623 // calculate a bounding box
4624 VectorClear(out->mins);
4625 VectorClear(out->maxs);
4626 if (out->num_vertices)
4628 VectorCopy((out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), out->mins);
4629 VectorCopy((out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), out->maxs);
4630 for (j = 1, v = (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
4632 out->mins[0] = min(out->mins[0], v[0]);
4633 out->maxs[0] = max(out->maxs[0], v[0]);
4634 out->mins[1] = min(out->mins[1], v[1]);
4635 out->maxs[1] = max(out->maxs[1], v[1]);
4636 out->mins[2] = min(out->mins[2], v[2]);
4637 out->maxs[2] = max(out->maxs[2], v[2]);
4639 out->mins[0] -= 1.0f;
4640 out->mins[1] -= 1.0f;
4641 out->mins[2] -= 1.0f;
4642 out->maxs[0] += 1.0f;
4643 out->maxs[1] += 1.0f;
4644 out->maxs[2] += 1.0f;
4646 // set lightmap styles for consistency with q1bsp
4647 //out->lightmapinfo->styles[0] = 0;
4648 //out->lightmapinfo->styles[1] = 255;
4649 //out->lightmapinfo->styles[2] = 255;
4650 //out->lightmapinfo->styles[3] = 255;
4654 // now store the completed list of meshes
4655 loadmodel->nummeshes = meshnum;
4656 if (loadmodel->nummeshes)
4658 loadmodel->meshlist = (surfmesh_t **)Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4659 memcpy(loadmodel->meshlist, tempmeshlist, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4662 // free the no longer needed vertex data
4663 loadmodel->brushq3.num_vertices = 0;
4664 Mem_Free(loadmodel->brushq3.data_vertex3f);
4665 loadmodel->brushq3.data_vertex3f = NULL;
4666 loadmodel->brushq3.data_texcoordtexture2f = NULL;
4667 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4668 loadmodel->brushq3.data_color4f = NULL;
4669 // free the no longer needed triangle data
4670 loadmodel->brushq3.num_triangles = 0;
4671 Mem_Free(loadmodel->brushq3.data_element3i);
4672 loadmodel->brushq3.data_element3i = NULL;
4675 static void Mod_Q3BSP_LoadModels(lump_t *l)
4679 int i, j, n, c, count;
4681 in = (q3dmodel_t *)(mod_base + l->fileofs);
4682 if (l->filelen % sizeof(*in))
4683 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4684 count = l->filelen / sizeof(*in);
4685 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4687 loadmodel->brushq3.data_models = out;
4688 loadmodel->brushq3.num_models = count;
4690 for (i = 0;i < count;i++, in++, out++)
4692 for (j = 0;j < 3;j++)
4694 out->mins[j] = LittleFloat(in->mins[j]);
4695 out->maxs[j] = LittleFloat(in->maxs[j]);
4697 n = LittleLong(in->firstface);
4698 c = LittleLong(in->numfaces);
4699 if (n < 0 || n + c > loadmodel->num_surfaces)
4700 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
4703 n = LittleLong(in->firstbrush);
4704 c = LittleLong(in->numbrushes);
4705 if (n < 0 || n + c > loadmodel->brush.num_brushes)
4706 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
4707 out->firstbrush = n;
4708 out->numbrushes = c;
4712 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4718 in = (int *)(mod_base + l->fileofs);
4719 if (l->filelen % sizeof(*in))
4720 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4721 count = l->filelen / sizeof(*in);
4722 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4724 loadmodel->brush.data_leafbrushes = out;
4725 loadmodel->brush.num_leafbrushes = count;
4727 for (i = 0;i < count;i++, in++, out++)
4729 n = LittleLong(*in);
4730 if (n < 0 || n >= loadmodel->brush.num_brushes)
4731 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
4736 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4742 in = (int *)(mod_base + l->fileofs);
4743 if (l->filelen % sizeof(*in))
4744 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4745 count = l->filelen / sizeof(*in);
4746 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4748 loadmodel->brush.data_leafsurfaces = out;
4749 loadmodel->brush.num_leafsurfaces = count;
4751 for (i = 0;i < count;i++, in++, out++)
4753 n = LittleLong(*in);
4754 if (n < 0 || n >= loadmodel->num_surfaces)
4755 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
4760 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4764 int i, j, n, c, count;
4766 in = (q3dleaf_t *)(mod_base + l->fileofs);
4767 if (l->filelen % sizeof(*in))
4768 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4769 count = l->filelen / sizeof(*in);
4770 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4772 loadmodel->brush.data_leafs = out;
4773 loadmodel->brush.num_leafs = count;
4775 for (i = 0;i < count;i++, in++, out++)
4779 out->clusterindex = LittleLong(in->clusterindex);
4780 out->areaindex = LittleLong(in->areaindex);
4781 for (j = 0;j < 3;j++)
4783 // yes the mins/maxs are ints
4784 out->mins[j] = LittleLong(in->mins[j]) - 1;
4785 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4787 n = LittleLong(in->firstleafface);
4788 c = LittleLong(in->numleaffaces);
4789 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
4790 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
4791 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
4792 out->numleafsurfaces = c;
4793 n = LittleLong(in->firstleafbrush);
4794 c = LittleLong(in->numleafbrushes);
4795 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
4796 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
4797 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
4798 out->numleafbrushes = c;
4802 static void Mod_Q3BSP_LoadNodes(lump_t *l)
4808 in = (q3dnode_t *)(mod_base + l->fileofs);
4809 if (l->filelen % sizeof(*in))
4810 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4811 count = l->filelen / sizeof(*in);
4812 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4814 loadmodel->brush.data_nodes = out;
4815 loadmodel->brush.num_nodes = count;
4817 for (i = 0;i < count;i++, in++, out++)
4820 n = LittleLong(in->planeindex);
4821 if (n < 0 || n >= loadmodel->brush.num_planes)
4822 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4823 out->plane = loadmodel->brush.data_planes + n;
4824 for (j = 0;j < 2;j++)
4826 n = LittleLong(in->childrenindex[j]);
4829 if (n >= loadmodel->brush.num_nodes)
4830 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
4831 out->children[j] = loadmodel->brush.data_nodes + n;
4836 if (n >= loadmodel->brush.num_leafs)
4837 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
4838 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
4841 for (j = 0;j < 3;j++)
4843 // yes the mins/maxs are ints
4844 out->mins[j] = LittleLong(in->mins[j]) - 1;
4845 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4849 // set the parent pointers
4850 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
4853 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
4856 q3dlightgrid_t *out;
4859 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
4860 if (l->filelen % sizeof(*in))
4861 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
4862 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
4863 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
4864 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
4865 loadmodel->brushq3.num_lightgrid_imins[0] = ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4866 loadmodel->brushq3.num_lightgrid_imins[1] = ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4867 loadmodel->brushq3.num_lightgrid_imins[2] = ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4868 loadmodel->brushq3.num_lightgrid_imaxs[0] = floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4869 loadmodel->brushq3.num_lightgrid_imaxs[1] = floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4870 loadmodel->brushq3.num_lightgrid_imaxs[2] = floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4871 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
4872 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
4873 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
4874 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
4875 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]);
4876 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]);
4878 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
4881 if (l->filelen < count * (int)sizeof(*in))
4882 Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)", l->filelen, count * sizeof(*in), loadmodel->brushq3.num_lightgrid_dimensions[0], loadmodel->brushq3.num_lightgrid_dimensions[1], loadmodel->brushq3.num_lightgrid_dimensions[2]);
4883 if (l->filelen != count * (int)sizeof(*in))
4884 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i", count * sizeof(*in), l->filelen);
4885 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4886 loadmodel->brushq3.data_lightgrid = out;
4887 loadmodel->brushq3.num_lightgrid = count;
4888 // no swapping or validation necessary
4889 memcpy(out, in, count * (int)sizeof(*out));
4893 static void Mod_Q3BSP_LoadPVS(lump_t *l)
4898 if (l->filelen == 0)
4901 // unvised maps often have cluster indices even without pvs, so check
4902 // leafs to find real number of clusters
4903 loadmodel->brush.num_pvsclusters = 1;
4904 for (i = 0;i < loadmodel->brush.num_leafs;i++)
4905 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
4908 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
4909 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4910 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
4911 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
4915 in = (q3dpvs_t *)(mod_base + l->fileofs);
4917 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
4919 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
4920 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
4921 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
4922 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
4923 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4924 if (l->filelen < totalchains + (int)sizeof(*in))
4925 Host_Error("Mod_Q3BSP_LoadPVS: lump too small ((numclusters = %i) * (chainlength = %i) + sizeof(q3dpvs_t) == %i bytes, lump is %i bytes)", loadmodel->brush.num_pvsclusters, loadmodel->brush.num_pvsclusterbytes, totalchains + sizeof(*in), l->filelen);
4927 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
4928 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
4931 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
4933 int i, j, k, index[3];
4934 float transformed[3], blend1, blend2, blend, yaw, pitch, sinpitch;
4935 q3dlightgrid_t *a, *s;
4936 if (!model->brushq3.num_lightgrid)
4938 ambientcolor[0] = 1;
4939 ambientcolor[1] = 1;
4940 ambientcolor[2] = 1;
4943 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
4944 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
4945 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
4946 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
4947 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
4948 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
4949 index[0] = (int)floor(transformed[0]);
4950 index[1] = (int)floor(transformed[1]);
4951 index[2] = (int)floor(transformed[2]);
4952 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
4953 // now lerp the values
4954 VectorClear(diffusenormal);
4955 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
4956 for (k = 0;k < 2;k++)
4958 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
4959 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
4961 for (j = 0;j < 2;j++)
4963 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
4964 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
4966 for (i = 0;i < 2;i++)
4968 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0])));
4969 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
4971 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
4972 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
4973 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
4974 pitch = s->diffusepitch * M_PI / 128;
4975 yaw = s->diffuseyaw * M_PI / 128;
4976 sinpitch = sin(pitch);
4977 diffusenormal[0] += blend * (cos(yaw) * sinpitch);
4978 diffusenormal[1] += blend * (sin(yaw) * sinpitch);
4979 diffusenormal[2] += blend * (cos(pitch));
4980 //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)));
4984 VectorNormalize(diffusenormal);
4985 //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]);
4988 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t point, int markframe)
4993 // find which leaf the point is in
4995 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
4996 // point trace the brushes
4997 leaf = (mleaf_t *)node;
4998 for (i = 0;i < leaf->numleafbrushes;i++)
5000 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5001 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5003 brush->markframe = markframe;
5004 Collision_TracePointBrushFloat(trace, point, brush);
5007 // can't do point traces on curves (they have no thickness)
5010 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)
5012 int i, startside, endside;
5013 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5015 msurface_t *surface;
5017 if (startfrac > trace->realfraction)
5019 // note: all line fragments past first impact fraction are ignored
5020 if (VectorCompare(start, end))
5022 // find which leaf the point is in
5024 node = node->children[DotProduct(start, node->plane->normal) < node->plane->dist];
5028 // find which nodes the line is in and recurse for them
5031 // recurse down node sides
5032 dist1 = PlaneDiff(start, node->plane);
5033 dist2 = PlaneDiff(end, node->plane);
5034 startside = dist1 < 0;
5035 endside = dist2 < 0;
5036 if (startside == endside)
5038 // most of the time the line fragment is on one side of the plane
5039 node = node->children[startside];
5043 // line crosses node plane, split the line
5044 midfrac = dist1 / (dist1 - dist2);
5045 VectorLerp(start, midfrac, end, mid);
5046 // take the near side first
5047 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5048 if (midfrac <= trace->realfraction)
5049 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5055 nodesegmentmins[0] = min(start[0], end[0]);
5056 nodesegmentmins[1] = min(start[1], end[1]);
5057 nodesegmentmins[2] = min(start[2], end[2]);
5058 nodesegmentmaxs[0] = max(start[0], end[0]);
5059 nodesegmentmaxs[1] = max(start[1], end[1]);
5060 nodesegmentmaxs[2] = max(start[2], end[2]);
5061 // line trace the brushes
5062 leaf = (mleaf_t *)node;
5063 for (i = 0;i < leaf->numleafbrushes;i++)
5065 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5066 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5068 brush->markframe = markframe;
5069 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5070 if (startfrac > trace->realfraction)
5074 // can't do point traces on curves (they have no thickness)
5075 if (mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5077 // line trace the curves
5078 for (i = 0;i < leaf->numleafsurfaces;i++)
5080 surface = model->data_surfaces + leaf->firstleafsurface[i];
5081 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5083 surface->collisionmarkframe = markframe;
5084 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
5085 if (startfrac > trace->realfraction)
5092 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)
5096 float nodesegmentmins[3], nodesegmentmaxs[3];
5099 msurface_t *surface;
5101 // find which nodes the line is in and recurse for them
5104 // recurse down node sides
5105 int startside, endside;
5106 float dist1near, dist1far, dist2near, dist2far;
5107 BoxPlaneCornerDistances(thisbrush_start->mins, thisbrush_start->maxs, node->plane, &dist1near, &dist1far);
5108 BoxPlaneCornerDistances(thisbrush_end->mins, thisbrush_end->maxs, node->plane, &dist2near, &dist2far);
5109 startside = dist1near < 0;
5110 startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
5111 endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
5112 if (startside == 2 || endside == 2)
5114 // brushes cross plane
5115 // do not clip anything, just take both sides
5116 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5117 node = node->children[1];
5124 node = node->children[0];
5129 //midf0 = dist1near / (dist1near - dist2near);
5130 //midf1 = dist1far / (dist1far - dist2far);
5131 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5132 node = node->children[1];
5140 //midf0 = dist1near / (dist1near - dist2near);
5141 //midf1 = dist1far / (dist1far - dist2far);
5142 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5143 node = node->children[1];
5148 node = node->children[1];
5153 if (dist1near < 0 && dist2near < 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
5154 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;}
5155 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;}
5156 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;}
5157 if (dist1near < 0 && dist2near >= 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
5158 if (dist1near < 0 && dist2near >= 0 && dist1far < 0 && dist2far >= 0){}
5159 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;}
5160 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;}
5161 if (dist1near >= 0 && dist2near < 0 && dist1far < 0 && dist2far < 0){node = node->children[1];continue;}
5162 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;}
5163 if (dist1near >= 0 && dist2near < 0 && dist1far >= 0 && dist2far < 0){}
5164 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;}
5165 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;}
5166 if (dist1near >= 0 && dist2near >= 0 && dist1far < 0 && dist2far >= 0){node = node->children[0];continue;}
5167 if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far < 0){node = node->children[0];continue;}
5168 if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){node = node->children[0];continue;}
5170 if (dist2near < 0) // d1n<0 && d2n<0
5172 if (dist2near < 0) // d1n<0 && d2n<0
5174 if (dist2near < 0) // d1n<0 && d2n<0
5177 else // d1n<0 && d2n>0
5181 else // d1n<0 && d2n>0
5183 if (dist2near < 0) // d1n<0 && d2n<0
5186 else // d1n<0 && d2n>0
5191 else // d1n<0 && d2n>0
5197 if (dist2near < 0) // d1n>0 && d2n<0
5200 else // d1n>0 && d2n>0
5204 if (dist1near < 0 == dist1far < 0 == dist2near < 0 == dist2far < 0)
5206 node = node->children[startside];
5209 if (dist1near < dist2near)
5214 node = node->children[0];
5219 node = node->children[1];
5222 // dist1near < 0 && dist2far >= 0
5228 startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
5229 endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
5230 if (startside == 2 || endside == 2)
5232 // brushes cross plane
5233 // do not clip anything, just take both sides
5234 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5235 node = node->children[1];
5237 else if (startside == endside)
5238 node = node->children[startside];
5239 else if (startside == 0) // endside = 1 (start infront, end behind)
5242 else // startside == 1 endside = 0 (start behind, end infront)
5248 node = node->children[startside];
5251 // start and end brush cross plane
5257 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5258 node = node->children[1];
5259 else if (dist1near < 0 && dist1far < 0 && dist2near >= 0 && dist2far >= 0)
5260 else if (dist1near >= 0 && dist1far >= 0 && dist2near < 0 && dist2far < 0)
5261 else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5262 node = node->children[0];
5264 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5265 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5266 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5267 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5268 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5271 else if (dist1near >= 0 && dist1far >= 0)
5274 else // mixed (lying on plane)
5278 if (dist2near < 0 && dist2far < 0)
5282 node = node->children[1];
5284 if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5285 node = node->children[0];
5286 else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5287 node = node->children[1];
5291 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5292 node = node->children[1];
5294 sides = dist1near || dist1near < 0 | dist1far < 0 | dist2near < 0 | dist
5295 startside = dist1 < 0;
5296 endside = dist2 < 0;
5297 if (startside == endside)
5299 // most of the time the line fragment is on one side of the plane
5300 node = node->children[startside];
5304 // line crosses node plane, split the line
5305 midfrac = dist1 / (dist1 - dist2);
5306 VectorLerp(start, midfrac, end, mid);
5307 // take the near side first
5308 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5309 if (midfrac <= trace->fraction)
5310 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5318 mplane_t *plane = node->plane;
5321 // axial planes are much more common than non-axial, so an optimized
5322 // axial case pays off here
5323 if (plane->type < 3)
5325 // this is an axial plane, compare bounding box directly to it and
5326 // recurse sides accordingly
5327 // recurse down node sides
5328 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5329 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5330 sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5333 // segment box crosses plane
5334 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5340 // this is a non-axial plane, entire trace bounding box
5341 // comparisons against it are likely to be very sloppy, so in if
5342 // the whole box is split by the plane we then test the start/end
5343 // boxes against it to be sure
5344 sides = BoxOnPlaneSide(segmentmins, segmentmaxs, plane);
5347 // segment box crosses plane
5348 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5349 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5352 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5357 // take whichever side the segment box is on
5358 node = node->children[sides - 1];
5360 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5361 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5362 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5363 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5364 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5365 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5369 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5370 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5371 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5372 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5373 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5374 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5375 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5379 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5380 node = node->children[1];
5383 // FIXME: could be made faster by copying TraceLine code and making it use
5384 // box plane distances... (variant on the BoxOnPlaneSide code)
5387 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5388 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5389 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5390 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5391 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5392 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5393 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5397 if (mod_q3bsp_debugtracebrush.integer == 2)
5399 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5400 node = node->children[1];
5403 else if (mod_q3bsp_debugtracebrush.integer == 1)
5405 // recurse down node sides
5406 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5409 // segment box crosses plane
5410 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5411 node = node->children[1];
5414 // take whichever side the segment box is on
5415 node = node->children[sides - 1];
5420 // recurse down node sides
5421 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5424 // segment box crosses plane
5425 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5426 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5429 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5430 node = node->children[1];
5434 // take whichever side the segment box is on
5435 node = node->children[sides - 1];
5441 // FIXME: could be made faster by copying TraceLine code and making it use
5442 // box plane distances... (variant on the BoxOnPlaneSide code)
5445 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5446 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5447 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5448 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5449 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5450 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5451 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5455 if (mod_q3bsp_debugtracebrush.integer == 2)
5457 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5458 node = node->children[1];
5460 else if (mod_q3bsp_debugtracebrush.integer == 1)
5462 // recurse down node sides
5463 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5466 // segment box crosses plane
5467 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5468 node = node->children[1];
5472 // take whichever side the segment box is on
5473 node = node->children[sides - 1];
5478 // recurse down node sides
5479 sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5482 // segment box crosses plane
5483 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5484 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5487 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5491 // take whichever side the segment box is on
5492 node = node->children[sides - 1];
5497 leaf = (mleaf_t *)node;
5498 for (i = 0;i < leaf->numleafbrushes;i++)
5500 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5501 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5503 brush->markframe = markframe;
5504 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5507 if (mod_q3bsp_curves_collisions.integer)
5509 for (i = 0;i < leaf->numleafsurfaces;i++)
5511 surface = model->data_surfaces + leaf->firstleafsurface[i];
5512 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5514 surface->collisionmarkframe = markframe;
5515 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
5521 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)
5524 float segmentmins[3], segmentmaxs[3];
5525 colbrushf_t *thisbrush_start, *thisbrush_end;
5526 matrix4x4_t startmatrix, endmatrix;
5527 static int markframe = 0;
5528 msurface_t *surface;
5530 memset(trace, 0, sizeof(*trace));
5531 trace->fraction = 1;
5532 trace->realfraction = 1;
5533 trace->hitsupercontentsmask = hitsupercontentsmask;
5534 Matrix4x4_CreateIdentity(&startmatrix);
5535 Matrix4x4_CreateIdentity(&endmatrix);
5536 segmentmins[0] = min(boxstartmins[0], boxendmins[0]);
5537 segmentmins[1] = min(boxstartmins[1], boxendmins[1]);
5538 segmentmins[2] = min(boxstartmins[2], boxendmins[2]);
5539 segmentmaxs[0] = max(boxstartmaxs[0], boxendmaxs[0]);
5540 segmentmaxs[1] = max(boxstartmaxs[1], boxendmaxs[1]);
5541 segmentmaxs[2] = max(boxstartmaxs[2], boxendmaxs[2]);
5542 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxstartmins, boxstartmaxs) && VectorCompare(boxendmins, boxendmaxs))
5544 if (VectorCompare(boxstartmins, boxendmins))
5547 if (model->brush.submodel)
5549 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5550 if (brush->colbrushf)
5551 Collision_TracePointBrushFloat(trace, boxstartmins, brush->colbrushf);
5554 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, boxstartmins, ++markframe);
5559 if (model->brush.submodel)
5561 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5562 if (brush->colbrushf)
5563 Collision_TraceLineBrushFloat(trace, boxstartmins, boxendmins, brush->colbrushf, brush->colbrushf);
5564 if (mod_q3bsp_curves_collisions.integer)
5565 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5566 if (surface->num_collisiontriangles)
5567 Collision_TraceLineTriangleMeshFloat(trace, boxstartmins, boxendmins, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
5570 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, boxstartmins, boxendmins, 0, 1, boxstartmins, boxendmins, ++markframe, segmentmins, segmentmaxs);
5575 // box trace, performed as brush trace
5576 thisbrush_start = Collision_BrushForBox(&startmatrix, boxstartmins, boxstartmaxs);
5577 thisbrush_end = Collision_BrushForBox(&endmatrix, boxendmins, boxendmaxs);
5578 if (model->brush.submodel)
5580 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5581 if (brush->colbrushf)
5582 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5583 if (mod_q3bsp_curves_collisions.integer)
5584 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5585 if (surface->num_collisiontriangles)
5586 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
5589 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5593 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5595 int supercontents = 0;
5596 if (nativecontents & CONTENTSQ3_SOLID)
5597 supercontents |= SUPERCONTENTS_SOLID;
5598 if (nativecontents & CONTENTSQ3_WATER)
5599 supercontents |= SUPERCONTENTS_WATER;
5600 if (nativecontents & CONTENTSQ3_SLIME)
5601 supercontents |= SUPERCONTENTS_SLIME;
5602 if (nativecontents & CONTENTSQ3_LAVA)
5603 supercontents |= SUPERCONTENTS_LAVA;
5604 if (nativecontents & CONTENTSQ3_BODY)
5605 supercontents |= SUPERCONTENTS_BODY;
5606 if (nativecontents & CONTENTSQ3_CORPSE)
5607 supercontents |= SUPERCONTENTS_CORPSE;
5608 if (nativecontents & CONTENTSQ3_NODROP)
5609 supercontents |= SUPERCONTENTS_NODROP;
5610 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5611 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5612 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5613 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5614 if (nativecontents & CONTENTSQ3_DONOTENTER)
5615 supercontents |= SUPERCONTENTS_DONOTENTER;
5616 return supercontents;
5619 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5621 int nativecontents = 0;
5622 if (supercontents & SUPERCONTENTS_SOLID)
5623 nativecontents |= CONTENTSQ3_SOLID;
5624 if (supercontents & SUPERCONTENTS_WATER)
5625 nativecontents |= CONTENTSQ3_WATER;
5626 if (supercontents & SUPERCONTENTS_SLIME)
5627 nativecontents |= CONTENTSQ3_SLIME;
5628 if (supercontents & SUPERCONTENTS_LAVA)
5629 nativecontents |= CONTENTSQ3_LAVA;
5630 if (supercontents & SUPERCONTENTS_BODY)
5631 nativecontents |= CONTENTSQ3_BODY;
5632 if (supercontents & SUPERCONTENTS_CORPSE)
5633 nativecontents |= CONTENTSQ3_CORPSE;
5634 if (supercontents & SUPERCONTENTS_NODROP)
5635 nativecontents |= CONTENTSQ3_NODROP;
5636 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5637 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5638 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5639 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5640 if (supercontents & SUPERCONTENTS_DONOTENTER)
5641 nativecontents |= CONTENTSQ3_DONOTENTER;
5642 return nativecontents;
5645 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5650 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5651 node = node->children[1];
5653 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5654 if (loadmodel->brush.num_leafs < numleafs)
5655 loadmodel->brush.num_leafs = numleafs;
5658 void Mod_Q3BSP_Load(model_t *mod, void *buffer, void *bufferend)
5660 int i, j, numshadowmeshtriangles;
5661 q3dheader_t *header;
5662 float corner[3], yawradius, modelradius;
5663 msurface_t *surface;
5665 mod->type = mod_brushq3;
5666 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5669 header = (q3dheader_t *)buffer;
5671 i = LittleLong(header->version);
5672 if (i != Q3BSPVERSION)
5673 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5674 mod->brush.ishlbsp = false;
5675 mod->brush.ismcbsp = false;
5676 if (loadmodel->isworldmodel)
5678 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5679 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
5682 mod->soundfromcenter = true;
5683 mod->TraceBox = Mod_Q3BSP_TraceBox;
5684 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5685 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5686 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5687 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5688 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5689 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5690 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5691 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5692 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5693 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5694 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5695 mod->Draw = R_Q1BSP_Draw;
5696 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5697 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5698 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5699 mod->DrawLight = R_Q1BSP_DrawLight;
5701 mod_base = (unsigned char *)header;
5703 // swap all the lumps
5704 header->ident = LittleLong(header->ident);
5705 header->version = LittleLong(header->version);
5706 for (i = 0;i < Q3HEADER_LUMPS;i++)
5708 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5709 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5712 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5713 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5714 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5715 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5716 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5717 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5718 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5719 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5720 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS]);
5721 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5722 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5723 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5724 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5725 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5726 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5727 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5728 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5729 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5731 // the MakePortals code works fine on the q3bsp data as well
5732 Mod_Q1BSP_MakePortals();
5734 // make a single combined shadow mesh to allow optimized shadow volume creation
5735 numshadowmeshtriangles = 0;
5736 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5738 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5739 numshadowmeshtriangles += surface->num_triangles;
5741 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5742 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5743 if (surface->groupmesh)
5744 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, surface->groupmesh->data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle));
5745 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
5746 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5748 loadmodel->brush.num_leafs = 0;
5749 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5751 if (loadmodel->isworldmodel)
5753 // clear out any stale submodels or worldmodels lying around
5754 // if we did this clear before now, an error might abort loading and
5755 // leave things in a bad state
5756 Mod_RemoveStaleWorldModels(loadmodel);
5760 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5765 // LordHavoc: only register submodels if it is the world
5766 // (prevents external bsp models from replacing world submodels with
5768 if (!loadmodel->isworldmodel)
5770 // duplicate the basic information
5771 sprintf(name, "*%i", i);
5772 mod = Mod_FindName(name);
5774 strcpy(mod->name, name);
5775 // textures and memory belong to the main model
5776 mod->texturepool = NULL;
5777 mod->mempool = NULL;
5778 mod->brush.GetPVS = NULL;
5779 mod->brush.FatPVS = NULL;
5780 mod->brush.BoxTouchingPVS = NULL;
5781 mod->brush.BoxTouchingLeafPVS = NULL;
5782 mod->brush.BoxTouchingVisibleLeafs = NULL;
5783 mod->brush.FindBoxClusters = NULL;
5784 mod->brush.LightPoint = NULL;
5785 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5787 mod->brush.submodel = i;
5789 // make the model surface list (used by shadowing/lighting)
5790 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5791 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5792 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5793 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5794 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5795 for (j = 0;j < mod->nummodelsurfaces;j++)
5796 mod->surfacelist[j] = mod->firstmodelsurface + j;
5798 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5799 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5800 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5801 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5802 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5803 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5804 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5805 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5806 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5807 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5808 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5809 mod->yawmins[2] = mod->normalmins[2];
5810 mod->yawmaxs[2] = mod->normalmaxs[2];
5811 mod->radius = modelradius;
5812 mod->radius2 = modelradius * modelradius;
5814 for (j = 0;j < mod->nummodelsurfaces;j++)
5815 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->surfaceflags & Q3SURFACEFLAG_SKY)
5817 if (j < mod->nummodelsurfaces)
5818 mod->DrawSky = R_Q1BSP_DrawSky;
5822 void Mod_IBSP_Load(model_t *mod, void *buffer, void *bufferend)
5824 int i = LittleLong(((int *)buffer)[1]);
5825 if (i == Q3BSPVERSION)
5826 Mod_Q3BSP_Load(mod,buffer, bufferend);
5827 else if (i == Q2BSPVERSION)
5828 Mod_Q2BSP_Load(mod,buffer, bufferend);
5830 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
5833 void Mod_MAP_Load(model_t *mod, void *buffer, void *bufferend)
5835 Host_Error("Mod_MAP_Load: not yet implemented");