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.
20 // world.c -- world query functions
26 entities never clip against themselves, or their owner
28 line of sight checks trace->crosscontent, but bullets don't
35 vec3_t boxmins, boxmaxs;// enclose the test object along entire move
36 float *mins, *maxs; // size of the moving object
37 vec3_t mins2, maxs2; // size when clipping against mosnters
46 ===============================================================================
50 ===============================================================================
54 static hull_t box_hull;
55 static dclipnode_t box_clipnodes[6];
56 static mplane_t box_planes[6];
62 Set up the planes and clipnodes so that the six floats of a bounding box
63 can just be stored out and get a proper hull_t structure.
66 void SV_InitBoxHull (void)
71 box_hull.clipnodes = box_clipnodes;
72 box_hull.planes = box_planes;
73 box_hull.firstclipnode = 0;
74 box_hull.lastclipnode = 5;
78 box_clipnodes[i].planenum = i;
82 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
84 box_clipnodes[i].children[side^1] = i + 1;
86 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
88 box_planes[i].type = i>>1;
89 box_planes[i].normal[i>>1] = 1;
99 To keep everything totally uniform, bounding boxes are turned into small
100 BSP trees instead of being compared directly.
103 hull_t *SV_HullForBox (vec3_t mins, vec3_t maxs)
105 box_planes[0].dist = maxs[0];
106 box_planes[1].dist = mins[0];
107 box_planes[2].dist = maxs[1];
108 box_planes[3].dist = mins[1];
109 box_planes[4].dist = maxs[2];
110 box_planes[5].dist = mins[2];
121 Returns a hull that can be used for testing or clipping an object of mins/maxs
123 Offset is filled in to contain the adjustment that must be added to the
124 testing object's origin to get a point to use with the returned hull.
127 extern qboolean hlbsp;
128 hull_t *SV_HullForEntity (edict_t *ent, vec3_t mins, vec3_t maxs, vec3_t offset)
132 vec3_t hullmins, hullmaxs;
135 // decide which clipping hull to use, based on the size
136 if (ent->v.solid == SOLID_BSP)
137 { // explicit hulls in the BSP model
138 if (ent->v.movetype != MOVETYPE_PUSH)
139 Host_Error ("SOLID_BSP without MOVETYPE_PUSH");
141 model = sv.models[ (int)ent->v.modelindex ];
143 // LordHavoc: fixed SOLID_BSP error message
144 if (!model || model->type != mod_brush)
146 Con_Printf ("SOLID_BSP with a non bsp model, entity dump:\n");
148 Host_Error ("SOLID_BSP with a non bsp model\n");
151 VectorSubtract (maxs, mins, size);
152 // LordHavoc: FIXME!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
156 hull = &model->hulls[0]; // 0x0x0
157 else if (size[0] <= 32)
159 if (size[2] < 54) // pick the nearest of 36 or 72
160 hull = &model->hulls[3]; // 32x32x36
162 hull = &model->hulls[1]; // 32x32x72
165 hull = &model->hulls[2]; // 64x64x64
170 hull = &model->hulls[0]; // 0x0x0
171 else if (size[0] <= 32)
172 hull = &model->hulls[1]; // 32x32x56
174 hull = &model->hulls[2]; // 64x64x88
177 // calculate an offset value to center the origin
178 VectorSubtract (hull->clip_mins, mins, offset);
179 VectorAdd (offset, ent->v.origin, offset);
182 { // create a temp hull from bounding box sizes
184 VectorSubtract (ent->v.mins, maxs, hullmins);
185 VectorSubtract (ent->v.maxs, mins, hullmaxs);
186 hull = SV_HullForBox (hullmins, hullmaxs);
188 VectorCopy (ent->v.origin, offset);
196 ===============================================================================
200 ===============================================================================
203 typedef struct areanode_s
205 int axis; // -1 = leaf node
207 struct areanode_s *children[2];
208 link_t trigger_edicts;
213 #define AREA_NODES 32
215 static areanode_t sv_areanodes[AREA_NODES];
216 static int sv_numareanodes;
224 areanode_t *SV_CreateAreaNode (int depth, vec3_t mins, vec3_t maxs)
228 vec3_t mins1, maxs1, mins2, maxs2;
230 anode = &sv_areanodes[sv_numareanodes];
233 ClearLink (&anode->trigger_edicts);
234 ClearLink (&anode->solid_edicts);
236 if (depth == AREA_DEPTH)
239 anode->children[0] = anode->children[1] = NULL;
243 VectorSubtract (maxs, mins, size);
244 if (size[0] > size[1])
249 anode->dist = 0.5 * (maxs[anode->axis] + mins[anode->axis]);
250 VectorCopy (mins, mins1);
251 VectorCopy (mins, mins2);
252 VectorCopy (maxs, maxs1);
253 VectorCopy (maxs, maxs2);
255 maxs1[anode->axis] = mins2[anode->axis] = anode->dist;
257 anode->children[0] = SV_CreateAreaNode (depth+1, mins2, maxs2);
258 anode->children[1] = SV_CreateAreaNode (depth+1, mins1, maxs1);
269 void SV_ClearWorld (void)
273 memset (sv_areanodes, 0, sizeof(sv_areanodes));
275 SV_CreateAreaNode (0, sv.worldmodel->mins, sv.worldmodel->maxs);
285 void SV_UnlinkEdict (edict_t *ent)
288 return; // not linked in anywhere
289 RemoveLink (&ent->area);
290 ent->area.prev = ent->area.next = NULL;
299 void SV_TouchLinks ( edict_t *ent, areanode_t *node )
303 int old_self, old_other;
306 // touch linked edicts
307 for (l = node->trigger_edicts.next ; l != &node->trigger_edicts ; l = next)
310 touch = EDICT_FROM_AREA(l);
313 if (!touch->v.touch || touch->v.solid != SOLID_TRIGGER)
315 if (ent->v.absmin[0] > touch->v.absmax[0]
316 || ent->v.absmin[1] > touch->v.absmax[1]
317 || ent->v.absmin[2] > touch->v.absmax[2]
318 || ent->v.absmax[0] < touch->v.absmin[0]
319 || ent->v.absmax[1] < touch->v.absmin[1]
320 || ent->v.absmax[2] < touch->v.absmin[2] )
322 old_self = pr_global_struct->self;
323 old_other = pr_global_struct->other;
325 pr_global_struct->self = EDICT_TO_PROG(touch);
326 pr_global_struct->other = EDICT_TO_PROG(ent);
327 pr_global_struct->time = sv.time;
328 PR_ExecuteProgram (touch->v.touch);
330 pr_global_struct->self = old_self;
331 pr_global_struct->other = old_other;
334 // recurse down both sides
335 if (node->axis == -1)
338 // LordHavoc: optimized recursion
339 // if (ent->v.absmax[node->axis] > node->dist) SV_TouchLinks (ent, node->children[0]);
340 // if (ent->v.absmin[node->axis] < node->dist) SV_TouchLinks (ent, node->children[1]);
341 if (ent->v.absmax[node->axis] > node->dist)
343 if (ent->v.absmin[node->axis] < node->dist)
344 SV_TouchLinks(ent, node->children[1]); // order reversed to reduce code
345 node = node->children[0];
350 if (ent->v.absmin[node->axis] < node->dist)
352 node = node->children[1];
365 void SV_FindTouchedLeafs (edict_t *ent, mnode_t *node)
367 mplane_t *splitplane;
373 if (node->contents == CONTENTS_SOLID)
376 // add an efrag if the node is a leaf
378 if ( node->contents < 0)
380 if (ent->num_leafs == MAX_ENT_LEAFS)
383 leaf = (mleaf_t *)node;
384 leafnum = leaf - sv.worldmodel->leafs - 1;
386 ent->leafnums[ent->num_leafs] = leafnum;
393 splitplane = node->plane;
394 sides = BOX_ON_PLANE_SIDE(ent->v.absmin, ent->v.absmax, splitplane);
396 // recurse down the contacted sides
397 // LordHavoc: optimized recursion
398 // if (sides & 1) SV_FindTouchedLeafs (ent, node->children[0]);
399 // if (sides & 2) SV_FindTouchedLeafs (ent, node->children[1]);
403 node = node->children[0];
406 node = node->children[1];
409 if (node->children[0]->contents != CONTENTS_SOLID)
410 SV_FindTouchedLeafs (ent, node->children[0]);
411 node = node->children[1];
422 void SV_LinkEdict (edict_t *ent, qboolean touch_triggers)
427 SV_UnlinkEdict (ent); // unlink from old position
429 if (ent == sv.edicts)
430 return; // don't add the world
437 // LordHavoc: enabling rotating bmodels
438 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
439 { // expand for rotation
443 max = DotProduct(ent->v.mins, ent->v.mins);
444 v = DotProduct(ent->v.maxs, ent->v.maxs);
450 for (i=0 ; i<3 ; i++)
452 v = fabs(ent->v.mins[i]);
455 v = fabs(ent->v.maxs[i]);
460 for (i=0 ; i<3 ; i++)
462 ent->v.absmin[i] = ent->v.origin[i] - max;
463 ent->v.absmax[i] = ent->v.origin[i] + max;
468 VectorAdd (ent->v.origin, ent->v.mins, ent->v.absmin);
469 VectorAdd (ent->v.origin, ent->v.maxs, ent->v.absmax);
473 // to make items easier to pick up and allow them to be grabbed off
474 // of shelves, the abs sizes are expanded
476 if ((int)ent->v.flags & FL_ITEM)
478 ent->v.absmin[0] -= 15;
479 ent->v.absmin[1] -= 15;
480 ent->v.absmax[0] += 15;
481 ent->v.absmax[1] += 15;
484 { // because movement is clipped an epsilon away from an actual edge,
485 // we must fully check even when bounding boxes don't quite touch
486 ent->v.absmin[0] -= 1;
487 ent->v.absmin[1] -= 1;
488 ent->v.absmin[2] -= 1;
489 ent->v.absmax[0] += 1;
490 ent->v.absmax[1] += 1;
491 ent->v.absmax[2] += 1;
496 if (ent->v.modelindex)
497 SV_FindTouchedLeafs (ent, sv.worldmodel->nodes);
499 if (ent->v.solid == SOLID_NOT)
502 // find the first node that the ent's box crosses
506 if (node->axis == -1)
508 if (ent->v.absmin[node->axis] > node->dist)
509 node = node->children[0];
510 else if (ent->v.absmax[node->axis] < node->dist)
511 node = node->children[1];
513 break; // crosses the node
518 if (ent->v.solid == SOLID_TRIGGER)
519 InsertLinkBefore (&ent->area, &node->trigger_edicts);
521 InsertLinkBefore (&ent->area, &node->solid_edicts);
523 // if touch_triggers, touch all entities at this node and descend for more
525 SV_TouchLinks ( ent, sv_areanodes );
531 ===============================================================================
533 POINT TESTING IN HULLS
535 ===============================================================================
538 // SV_HullPointContents moved to cpu_noasm.c
542 SV_TestEntityPosition
544 This could be a lot more efficient...
547 edict_t *SV_TestEntityPosition (edict_t *ent)
551 trace = SV_Move (ent->v.origin, ent->v.mins, ent->v.maxs, ent->v.origin, 0, ent);
553 if (trace.startsolid)
561 ===============================================================================
563 LINE TESTING IN HULLS
565 ===============================================================================
568 // 1/32 epsilon to keep floating point happy
569 #define DIST_EPSILON (0.03125)
573 SV_RecursiveHullCheck
578 qboolean SV_RecursiveHullCheck (hull_t *hull, int num, float p1f, float p2f, vec3_t p1, vec3_t p2, trace_t *trace)
593 if (num != CONTENTS_SOLID)
595 trace->allsolid = false;
596 if (num == CONTENTS_EMPTY)
597 trace->inopen = true;
599 trace->inwater = true;
602 trace->startsolid = true;
603 return true; // empty
606 if (num < hull->firstclipnode || num > hull->lastclipnode)
607 Sys_Error ("SV_RecursiveHullCheck: bad node number");
610 // find the point distances
612 node = hull->clipnodes + num;
613 plane = hull->planes + node->planenum;
615 t1 = PlaneDiff(p1, plane);
616 t2 = PlaneDiff(p2, plane);
619 if (t1 >= 0 && t2 >= 0)
620 // LordHavoc: optimized recursion
621 // return SV_RecursiveHullCheck (hull, node->children[0], p1f, p2f, p1, p2, trace);
623 num = node->children[0];
626 if (t1 < 0 && t2 < 0)
627 // return SV_RecursiveHullCheck (hull, node->children[1], p1f, p2f, p1, p2, trace);
629 num = node->children[1];
633 if ( (t1 >= DIST_EPSILON && t2 >= DIST_EPSILON) || (t2 > t1 && t1 >= 0) )
634 return SV_RecursiveHullCheck (hull, node->children[0], p1f, p2f, p1, p2, trace);
635 if ( (t1 <= -DIST_EPSILON && t2 <= -DIST_EPSILON) || (t2 < t1 && t1 <= 0) )
636 return SV_RecursiveHullCheck (hull, node->children[1], p1f, p2f, p1, p2, trace);
639 // put the crosspoint DIST_EPSILON pixels on the near side
641 frac = bound(0, (t1 + DIST_EPSILON)/(t1-t2), 1);
643 frac = bound(0, (t1 - DIST_EPSILON)/(t1-t2), 1);
645 midf = p1f + (p2f - p1f)*frac;
646 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
647 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
648 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
652 // move up to the node
653 if (!SV_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) )
657 if (SV_HullPointContents (hull, node->children[side], mid) == CONTENTS_SOLID)
659 Con_Printf ("mid PointInHullSolid\n");
664 if (SV_HullPointContents (hull, node->children[side^1], mid) != CONTENTS_SOLID)
666 return SV_RecursiveHullCheck (hull, node->children[side^1], midf, p2f, mid, p2, trace);
667 // mid would need to be duplicated during recursion...
673 num = node->children[side^1];
680 return false; // never got out of the solid area
683 // the other side of the node is solid, this is the impact point
687 VectorCopy (plane->normal, trace->plane.normal);
688 trace->plane.dist = plane->dist;
692 // LordHavoc: unrolled vector operation because the compiler can't be sure vec3_origin is 0
693 // VectorSubtract (vec3_origin, plane->normal, trace->plane.normal);
694 trace->plane.normal[0] = -plane->normal[0];
695 trace->plane.normal[1] = -plane->normal[1];
696 trace->plane.normal[2] = -plane->normal[2];
697 trace->plane.dist = -plane->dist;
700 while (SV_HullPointContents (hull, hull->firstclipnode, mid) == CONTENTS_SOLID)
701 { // shouldn't really happen, but does occasionally
705 trace->fraction = midf;
706 VectorCopy (mid, trace->endpos);
707 Con_DPrintf ("backup past 0\n");
710 midf = p1f + (p2f - p1f)*frac;
711 for (i=0 ; i<3 ; i++)
712 mid[i] = p1[i] + frac*(p2[i] - p1[i]);
715 trace->fraction = midf;
716 VectorCopy (mid, trace->endpos);
722 // LordHavoc: backported from my optimizations to PM_RecursiveHullCheck in QuakeForge newtree (QW)
723 qboolean SV_RecursiveHullCheck (hull_t *hull, int num, float p1f, float p2f, vec3_t p1, vec3_t p2, trace_t *trace)
734 // LordHavoc: a goto! everyone flee in terror... :)
739 if (num != CONTENTS_SOLID)
741 trace->allsolid = false;
742 if (num == CONTENTS_EMPTY)
743 trace->inopen = true;
745 trace->inwater = true;
748 trace->startsolid = true;
749 return true; // empty
752 // LordHavoc: this can be eliminated by validating in the loader... but Mercury told me not to bother
753 if (num < hull->firstclipnode || num > hull->lastclipnode)
754 Sys_Error ("SV_RecursiveHullCheck: bad node number");
756 // find the point distances
757 node = hull->clipnodes + num;
758 plane = hull->planes + node->planenum;
762 t1 = p1[plane->type] - plane->dist;
763 t2 = p2[plane->type] - plane->dist;
767 t1 = DotProduct (plane->normal, p1) - plane->dist;
768 t2 = DotProduct (plane->normal, p2) - plane->dist;
771 // LordHavoc: recursion optimization
772 if (t1 >= 0 && t2 >= 0)
774 num = node->children[0];
777 if (t1 < 0 && t2 < 0)
779 num = node->children[1];
783 // put the crosspoint DIST_EPSILON pixels on the near side
786 frac = bound(0, (t1 + DIST_EPSILON) / (t1 - t2), 1);
788 frac = bound(0, (t1 - DIST_EPSILON) / (t1 - t2), 1);
790 midf = p1f + (p2f - p1f)*frac;
791 for (i=0 ; i<3 ; i++)
792 mid[i] = p1[i] + frac*(p2[i] - p1[i]);
794 // move up to the node
795 if (!SV_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) )
799 if (SV_HullPointContents (pm_hullmodel, mid, node->children[side]) == CONTENTS_SOLID)
801 Con_Printf ("mid PointInHullSolid\n");
806 // LordHavoc: warning to the clumsy, this recursion can not be optimized because mid would need to be duplicated on a stack
807 if (SV_HullPointContents (hull, node->children[side^1], mid) != CONTENTS_SOLID)
809 return SV_RecursiveHullCheck (hull, node->children[side^1], midf, p2f, mid, p2, trace);
812 return false; // never got out of the solid area
815 // the other side of the node is solid, this is the impact point
819 VectorCopy (plane->normal, trace->plane.normal);
820 trace->plane.dist = plane->dist;
824 // LordHavoc: vec3_origin is evil; the compiler can not rely on it being '0 0 0'
825 // VectorSubtract (vec3_origin, plane->normal, trace->plane.normal);
826 trace->plane.normal[0] = -plane->normal[0];
827 trace->plane.normal[1] = -plane->normal[1];
828 trace->plane.normal[2] = -plane->normal[2];
829 trace->plane.dist = -plane->dist;
832 while (SV_HullPointContents (hull, hull->firstclipnode, mid) == CONTENTS_SOLID)
833 { // shouldn't really happen, but does occasionally
837 trace->fraction = midf;
838 VectorCopy (mid, trace->endpos);
839 Con_DPrintf ("backup past 0\n");
842 midf = p1f + (p2f - p1f)*frac;
843 for (i=0 ; i<3 ; i++)
844 mid[i] = p1[i] + frac*(p2[i] - p1[i]);
847 trace->fraction = midf;
848 VectorCopy (mid, trace->endpos);
853 qboolean SV_TestLine (hull_t *hull, int num, vec3_t p1, vec3_t p2)
864 return num != CONTENTS_SOLID;
866 if (num < hull->firstclipnode || num > hull->lastclipnode)
867 Sys_Error ("SV_RecursiveHullCheck: bad node number");
870 // find the point distances
872 node = hull->clipnodes + num;
873 plane = hull->planes + node->planenum;
875 t1 = PlaneDiff(p1, plane);
876 t2 = PlaneDiff(p2, plane);
878 if (t1 >= 0 && t2 >= 0)
880 num = node->children[0];
883 if (t1 < 0 && t2 < 0)
885 num = node->children[1];
889 // put the crosspoint DIST_EPSILON pixels on the near side
893 frac = bound(0, (t1 + DIST_EPSILON)/(t1-t2), 1);
895 frac = bound(0, (t1 - DIST_EPSILON)/(t1-t2), 1);
897 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
898 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
899 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
901 if (node->children[side] < 0)
903 if (node->children[side] == CONTENTS_SOLID)
905 return SV_TestLine(hull, node->children[!side], mid, p2);
907 else if (SV_TestLine(hull, node->children[side], p1, mid))
908 return SV_TestLine(hull, node->children[!side], mid, p2);
918 Handles selection or creation of a clipping hull, and offseting (and
919 eventually rotation) of the end points
922 trace_t SV_ClipMoveToEntity (edict_t *ent, vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end)
926 vec3_t start_l, end_l;
929 // fill in a default trace
930 memset (&trace, 0, sizeof(trace_t));
932 trace.allsolid = true;
933 VectorCopy (end, trace.endpos);
935 // get the clipping hull
936 hull = SV_HullForEntity (ent, mins, maxs, offset);
938 VectorSubtract (start, offset, start_l);
939 VectorSubtract (end, offset, end_l);
941 // LordHavoc: enabling rotating bmodels
942 // rotate start and end into the models frame of reference
943 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
945 vec3_t forward, right, up;
948 AngleVectors (ent->v.angles, forward, right, up);
950 VectorCopy (start_l, temp);
951 start_l[0] = DotProduct (temp, forward);
952 start_l[1] = -DotProduct (temp, right);
953 start_l[2] = DotProduct (temp, up);
955 VectorCopy (end_l, temp);
956 end_l[0] = DotProduct (temp, forward);
957 end_l[1] = -DotProduct (temp, right);
958 end_l[2] = DotProduct (temp, up);
961 // trace a line through the apropriate clipping hull
962 SV_RecursiveHullCheck (hull, hull->firstclipnode, 0, 1, start_l, end_l, &trace);
964 // LordHavoc: enabling rotating bmodels
965 // rotate endpos back to world frame of reference
966 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
969 vec3_t forward, right, up;
972 if (trace.fraction != 1)
974 VectorSubtract (vec3_origin, ent->v.angles, a);
975 AngleVectors (a, forward, right, up);
977 VectorCopy (trace.endpos, temp);
978 trace.endpos[0] = DotProduct (temp, forward);
979 trace.endpos[1] = -DotProduct (temp, right);
980 trace.endpos[2] = DotProduct (temp, up);
982 VectorCopy (trace.plane.normal, temp);
983 trace.plane.normal[0] = DotProduct (temp, forward);
984 trace.plane.normal[1] = -DotProduct (temp, right);
985 trace.plane.normal[2] = DotProduct (temp, up);
989 // fix trace up by the offset
990 if (trace.fraction != 1)
991 VectorAdd (trace.endpos, offset, trace.endpos);
993 // did we clip the move?
994 if (trace.fraction < 1 || trace.startsolid )
1000 //===========================================================================
1003 ====================
1006 Mins and maxs enclose the entire area swept by the move
1007 ====================
1009 void SV_ClipToLinks ( areanode_t *node, moveclip_t *clip )
1016 // touch linked edicts
1017 for (l = node->solid_edicts.next ; l != &node->solid_edicts ; l = next)
1020 touch = EDICT_FROM_AREA(l);
1021 if (touch->v.solid == SOLID_NOT)
1023 if (touch == clip->passedict)
1025 if (touch->v.solid == SOLID_TRIGGER)
1026 Sys_Error ("Trigger in clipping list");
1028 if (clip->type == MOVE_NOMONSTERS && touch->v.solid != SOLID_BSP)
1031 if (clip->boxmins[0] > touch->v.absmax[0]
1032 || clip->boxmins[1] > touch->v.absmax[1]
1033 || clip->boxmins[2] > touch->v.absmax[2]
1034 || clip->boxmaxs[0] < touch->v.absmin[0]
1035 || clip->boxmaxs[1] < touch->v.absmin[1]
1036 || clip->boxmaxs[2] < touch->v.absmin[2] )
1039 if (clip->passedict!=0 && clip->passedict->v.size[0] && !touch->v.size[0])
1040 continue; // points never interact
1042 // might intersect, so do an exact clip
1043 if (clip->trace.allsolid)
1045 if (clip->passedict)
1047 if (PROG_TO_EDICT(touch->v.owner) == clip->passedict)
1048 continue; // don't clip against own missiles
1049 if (PROG_TO_EDICT(clip->passedict->v.owner) == touch)
1050 continue; // don't clip against owner
1051 // LordHavoc: corpse code
1052 if (clip->passedict->v.solid == SOLID_CORPSE && touch->v.solid == SOLID_SLIDEBOX)
1054 if (clip->passedict->v.solid == SOLID_SLIDEBOX && touch->v.solid == SOLID_CORPSE)
1058 if ((int)touch->v.flags & FL_MONSTER)
1059 trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins2, clip->maxs2, clip->end);
1061 trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins, clip->maxs, clip->end);
1062 if (trace.allsolid || trace.startsolid ||
1063 trace.fraction < clip->trace.fraction)
1066 if (clip->trace.startsolid)
1068 clip->trace = trace;
1069 clip->trace.startsolid = true;
1072 clip->trace = trace;
1074 else if (trace.startsolid)
1075 clip->trace.startsolid = true;
1078 // recurse down both sides
1079 if (node->axis == -1)
1082 // LordHavoc: optimized recursion
1083 // if (clip->boxmaxs[node->axis] > node->dist) SV_ClipToLinks(node->children[0], clip);
1084 // if (clip->boxmins[node->axis] < node->dist) SV_ClipToLinks(node->children[1], clip);
1085 if (clip->boxmaxs[node->axis] > node->dist)
1087 if (clip->boxmins[node->axis] < node->dist)
1088 SV_ClipToLinks(node->children[1], clip);
1089 node = node->children[0];
1092 else if (clip->boxmins[node->axis] < node->dist)
1094 node = node->children[1];
1105 void SV_MoveBounds (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, vec3_t boxmins, vec3_t boxmaxs)
1108 // debug to test against everything
1109 boxmins[0] = boxmins[1] = boxmins[2] = -9999;
1110 boxmaxs[0] = boxmaxs[1] = boxmaxs[2] = 9999;
1114 for (i=0 ; i<3 ; i++)
1116 if (end[i] > start[i])
1118 boxmins[i] = start[i] + mins[i] - 1;
1119 boxmaxs[i] = end[i] + maxs[i] + 1;
1123 boxmins[i] = end[i] + mins[i] - 1;
1124 boxmaxs[i] = start[i] + maxs[i] + 1;
1135 trace_t SV_Move (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, int type, edict_t *passedict)
1140 memset ( &clip, 0, sizeof ( moveclip_t ) );
1143 clip.trace = SV_ClipMoveToEntity ( sv.edicts, start, mins, maxs, end );
1150 clip.passedict = passedict;
1152 if (type == MOVE_MISSILE)
1154 for (i=0 ; i<3 ; i++)
1156 clip.mins2[i] = -15;
1162 VectorCopy (mins, clip.mins2);
1163 VectorCopy (maxs, clip.maxs2);
1166 // create the bounding box of the entire move
1167 SV_MoveBounds ( start, clip.mins2, clip.maxs2, end, clip.boxmins, clip.boxmaxs );
1170 SV_ClipToLinks ( sv_areanodes, &clip );