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 struct link_s *prev, *next;
40 void ClearLink (link_t *l);
41 void RemoveLink (link_t *l);
42 void InsertLinkBefore (link_t *l, link_t *before);
43 void InsertLinkAfter (link_t *l, link_t *after);
45 // (type *)STRUCT_FROM_LINK(link_t *link, type, member)
46 // ent = STRUCT_FROM_LINK(link,entity_t,order)
47 // FIXME: remove this mess!
48 //#define STRUCT_FROM_LINK(l,t,m) ((t *)((byte *)l - (int)&(((t *)0)->m)))
50 #define EDICT_FROM_AREA(l) ((edict_t *)((byte *)l - (int)&(((edict_t *)0)->area)))
52 //============================================================================
54 // ClearLink is used for new headnodes
55 void ClearLink (link_t *l)
57 l->prev = l->next = l;
60 void RemoveLink (link_t *l)
62 l->next->prev = l->prev;
63 l->prev->next = l->next;
66 void InsertLinkBefore (link_t *l, link_t *before)
69 l->prev = before->prev;
73 void InsertLinkAfter (link_t *l, link_t *after)
75 l->next = after->next;
84 vec3_t boxmins, boxmaxs;// enclose the test object along entire move
85 float *mins, *maxs; // size of the moving object
86 vec3_t mins2, maxs2; // size when clipping against mosnters
95 ===============================================================================
99 ===============================================================================
103 static hull_t box_hull;
104 static dclipnode_t box_clipnodes[6];
105 static mplane_t box_planes[6];
111 Set up the planes and clipnodes so that the six floats of a bounding box
112 can just be stored out and get a proper hull_t structure.
115 void SV_InitBoxHull (void)
120 box_hull.clipnodes = box_clipnodes;
121 box_hull.planes = box_planes;
122 box_hull.firstclipnode = 0;
123 box_hull.lastclipnode = 5;
125 for (i=0 ; i<6 ; i++)
127 box_clipnodes[i].planenum = i;
131 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
133 box_clipnodes[i].children[side^1] = i + 1;
135 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
137 box_planes[i].type = i>>1;
138 box_planes[i].normal[i>>1] = 1;
148 To keep everything totally uniform, bounding boxes are turned into small
149 BSP trees instead of being compared directly.
152 hull_t *SV_HullForBox (vec3_t mins, vec3_t maxs)
154 box_planes[0].dist = maxs[0];
155 box_planes[1].dist = mins[0];
156 box_planes[2].dist = maxs[1];
157 box_planes[3].dist = mins[1];
158 box_planes[4].dist = maxs[2];
159 box_planes[5].dist = mins[2];
170 Returns a hull that can be used for testing or clipping an object of mins/maxs
172 Offset is filled in to contain the adjustment that must be added to the
173 testing object's origin to get a point to use with the returned hull.
176 hull_t *SV_HullForEntity (edict_t *ent, vec3_t mins, vec3_t maxs, vec3_t offset)
180 vec3_t hullmins, hullmaxs;
183 // decide which clipping hull to use, based on the size
184 if (ent->v.solid == SOLID_BSP)
185 { // explicit hulls in the BSP model
186 if (ent->v.movetype != MOVETYPE_PUSH)
187 Host_Error ("SOLID_BSP without MOVETYPE_PUSH");
189 model = sv.models[ (int)ent->v.modelindex ];
191 // LordHavoc: fixed SOLID_BSP error message
192 if (!model || model->type != mod_brush)
194 Con_Printf ("SOLID_BSP with a non bsp model, entity dump:\n");
196 Host_Error ("SOLID_BSP with a non bsp model\n");
199 VectorSubtract (maxs, mins, size);
200 // LordHavoc: FIXME!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
204 hull = &model->hulls[0]; // 0x0x0
205 else if (size[0] <= 32)
207 if (size[2] < 54) // pick the nearest of 36 or 72
208 hull = &model->hulls[3]; // 32x32x36
210 hull = &model->hulls[1]; // 32x32x72
213 hull = &model->hulls[2]; // 64x64x64
218 hull = &model->hulls[0]; // 0x0x0
219 else if (size[0] <= 32)
220 hull = &model->hulls[1]; // 32x32x56
222 hull = &model->hulls[2]; // 64x64x88
225 // calculate an offset value to center the origin
226 VectorSubtract (hull->clip_mins, mins, offset);
227 VectorAdd (offset, ent->v.origin, offset);
230 { // create a temp hull from bounding box sizes
232 VectorSubtract (ent->v.mins, maxs, hullmins);
233 VectorSubtract (ent->v.maxs, mins, hullmaxs);
234 hull = SV_HullForBox (hullmins, hullmaxs);
236 VectorCopy (ent->v.origin, offset);
244 ===============================================================================
248 ===============================================================================
251 typedef struct areanode_s
253 int axis; // -1 = leaf node
255 struct areanode_s *children[2];
256 link_t trigger_edicts;
261 #define AREA_NODES 32
263 static areanode_t sv_areanodes[AREA_NODES];
264 static int sv_numareanodes;
272 areanode_t *SV_CreateAreaNode (int depth, vec3_t mins, vec3_t maxs)
276 vec3_t mins1, maxs1, mins2, maxs2;
278 anode = &sv_areanodes[sv_numareanodes];
281 ClearLink (&anode->trigger_edicts);
282 ClearLink (&anode->solid_edicts);
284 if (depth == AREA_DEPTH)
287 anode->children[0] = anode->children[1] = NULL;
291 VectorSubtract (maxs, mins, size);
292 if (size[0] > size[1])
297 anode->dist = 0.5 * (maxs[anode->axis] + mins[anode->axis]);
298 VectorCopy (mins, mins1);
299 VectorCopy (mins, mins2);
300 VectorCopy (maxs, maxs1);
301 VectorCopy (maxs, maxs2);
303 maxs1[anode->axis] = mins2[anode->axis] = anode->dist;
305 anode->children[0] = SV_CreateAreaNode (depth+1, mins2, maxs2);
306 anode->children[1] = SV_CreateAreaNode (depth+1, mins1, maxs1);
317 void SV_ClearWorld (void)
321 memset (sv_areanodes, 0, sizeof(sv_areanodes));
323 SV_CreateAreaNode (0, sv.worldmodel->mins, sv.worldmodel->maxs);
333 void SV_UnlinkEdict (edict_t *ent)
336 return; // not linked in anywhere
337 RemoveLink (&ent->area);
338 ent->area.prev = ent->area.next = NULL;
347 void SV_TouchLinks ( edict_t *ent, areanode_t *node )
351 int old_self, old_other;
354 // touch linked edicts
355 for (l = node->trigger_edicts.next ; l != &node->trigger_edicts ; l = next)
358 touch = EDICT_FROM_AREA(l);
361 if (!touch->v.touch || touch->v.solid != SOLID_TRIGGER)
363 if (ent->v.absmin[0] > touch->v.absmax[0]
364 || ent->v.absmin[1] > touch->v.absmax[1]
365 || ent->v.absmin[2] > touch->v.absmax[2]
366 || ent->v.absmax[0] < touch->v.absmin[0]
367 || ent->v.absmax[1] < touch->v.absmin[1]
368 || ent->v.absmax[2] < touch->v.absmin[2])
370 old_self = pr_global_struct->self;
371 old_other = pr_global_struct->other;
373 pr_global_struct->self = EDICT_TO_PROG(touch);
374 pr_global_struct->other = EDICT_TO_PROG(ent);
375 pr_global_struct->time = sv.time;
376 PR_ExecuteProgram (touch->v.touch, "");
378 pr_global_struct->self = old_self;
379 pr_global_struct->other = old_other;
382 // recurse down both sides
383 if (node->axis == -1)
386 // LordHavoc: optimized recursion
387 // if (ent->v.absmax[node->axis] > node->dist) SV_TouchLinks (ent, node->children[0]);
388 // if (ent->v.absmin[node->axis] < node->dist) SV_TouchLinks (ent, node->children[1]);
389 if (ent->v.absmax[node->axis] > node->dist)
391 if (ent->v.absmin[node->axis] < node->dist)
392 SV_TouchLinks(ent, node->children[1]); // order reversed to reduce code
393 node = node->children[0];
398 if (ent->v.absmin[node->axis] < node->dist)
400 node = node->children[1];
413 void SV_FindTouchedLeafs (edict_t *ent, mnode_t *node)
416 if (node->contents == CONTENTS_SOLID)
419 // add an efrag if the node is a leaf
421 if ( node->contents < 0)
423 if (ent->num_leafs == MAX_ENT_LEAFS)
425 Con_DPrintf("FindTouchedLeafs overflow\n");
429 ent->leafnums[ent->num_leafs++] = (mleaf_t *)node - sv.worldmodel->leafs - 1;
433 // recurse down the contacted sides
435 // sides = BOX_ON_PLANE_SIDE(ent->v.absmin, ent->v.absmax, node->plane);
436 // if (sides & 1) SV_FindTouchedLeafs (ent, node->children[0]);
437 // if (sides & 2) SV_FindTouchedLeafs (ent, node->children[1]);
439 // LordHavoc: optimized recursion
440 switch (BOX_ON_PLANE_SIDE(ent->v.absmin, ent->v.absmax, node->plane))
443 node = node->children[0];
446 node = node->children[1];
449 if (node->children[0]->contents != CONTENTS_SOLID)
450 SV_FindTouchedLeafs (ent, node->children[0]);
451 node = node->children[1];
462 void SV_LinkEdict (edict_t *ent, qboolean touch_triggers)
467 SV_UnlinkEdict (ent); // unlink from old position
469 if (ent == sv.edicts)
470 return; // don't add the world
477 // LordHavoc: enabling rotating bmodels
478 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
480 // expand for rotation
484 max = DotProduct(ent->v.mins, ent->v.mins);
485 v = DotProduct(ent->v.maxs, ent->v.maxs);
491 for (i=0 ; i<3 ; i++)
493 v = fabs(ent->v.mins[i]);
496 v = fabs(ent->v.maxs[i]);
501 for (i=0 ; i<3 ; i++)
503 ent->v.absmin[i] = ent->v.origin[i] - max;
504 ent->v.absmax[i] = ent->v.origin[i] + max;
509 VectorAdd (ent->v.origin, ent->v.mins, ent->v.absmin);
510 VectorAdd (ent->v.origin, ent->v.maxs, ent->v.absmax);
514 // to make items easier to pick up and allow them to be grabbed off
515 // of shelves, the abs sizes are expanded
517 if ((int)ent->v.flags & FL_ITEM)
519 ent->v.absmin[0] -= 15;
520 ent->v.absmin[1] -= 15;
521 ent->v.absmax[0] += 15;
522 ent->v.absmax[1] += 15;
526 // because movement is clipped an epsilon away from an actual edge,
527 // we must fully check even when bounding boxes don't quite touch
528 ent->v.absmin[0] -= 1;
529 ent->v.absmin[1] -= 1;
530 ent->v.absmin[2] -= 1;
531 ent->v.absmax[0] += 1;
532 ent->v.absmax[1] += 1;
533 ent->v.absmax[2] += 1;
538 if (ent->v.modelindex)
539 SV_FindTouchedLeafs (ent, sv.worldmodel->nodes);
541 if (ent->v.solid == SOLID_NOT)
544 // find the first node that the ent's box crosses
548 if (node->axis == -1)
550 if (ent->v.absmin[node->axis] > node->dist)
551 node = node->children[0];
552 else if (ent->v.absmax[node->axis] < node->dist)
553 node = node->children[1];
555 break; // crosses the node
560 if (ent->v.solid == SOLID_TRIGGER)
561 InsertLinkBefore (&ent->area, &node->trigger_edicts);
563 InsertLinkBefore (&ent->area, &node->solid_edicts);
565 // if touch_triggers, touch all entities at this node and descend for more
567 SV_TouchLinks ( ent, sv_areanodes );
573 ===============================================================================
575 POINT TESTING IN HULLS
577 ===============================================================================
586 int SV_HullPointContents (hull_t *hull, int num, vec3_t p)
589 num = hull->clipnodes[num].children[(hull->planes[hull->clipnodes[num].planenum].type < 3 ? p[hull->planes[hull->clipnodes[num].planenum].type] : DotProduct (hull->planes[hull->clipnodes[num].planenum].normal, p)) < hull->planes[hull->clipnodes[num].planenum].dist];
596 SV_TestEntityPosition
598 This could be a lot more efficient...
601 edict_t *SV_TestEntityPosition (edict_t *ent)
605 trace = SV_Move (ent->v.origin, ent->v.mins, ent->v.maxs, ent->v.origin, 0, ent);
607 if (trace.startsolid)
615 ===============================================================================
617 LINE TESTING IN HULLS
619 ===============================================================================
622 // 1/32 epsilon to keep floating point happy
623 #define DIST_EPSILON (0.03125)
627 SV_RecursiveHullCheck
632 qboolean SV_RecursiveHullCheck (hull_t *hull, int num, float p1f, float p2f, vec3_t p1, vec3_t p2, trace_t *trace)
647 if (num != CONTENTS_SOLID)
649 trace->allsolid = false;
650 if (num == CONTENTS_EMPTY)
651 trace->inopen = true;
653 trace->inwater = true;
656 trace->startsolid = true;
657 return true; // empty
660 if (num < hull->firstclipnode || num > hull->lastclipnode)
661 Sys_Error ("SV_RecursiveHullCheck: bad node number");
664 // find the point distances
666 node = hull->clipnodes + num;
667 plane = hull->planes + node->planenum;
669 t1 = PlaneDiff(p1, plane);
670 t2 = PlaneDiff(p2, plane);
673 if (t1 >= 0 && t2 >= 0)
674 // LordHavoc: optimized recursion
675 // return SV_RecursiveHullCheck (hull, node->children[0], p1f, p2f, p1, p2, trace);
677 num = node->children[0];
680 if (t1 < 0 && t2 < 0)
681 // return SV_RecursiveHullCheck (hull, node->children[1], p1f, p2f, p1, p2, trace);
683 num = node->children[1];
687 if ( (t1 >= DIST_EPSILON && t2 >= DIST_EPSILON) || (t2 > t1 && t1 >= 0) )
688 return SV_RecursiveHullCheck (hull, node->children[0], p1f, p2f, p1, p2, trace);
689 if ( (t1 <= -DIST_EPSILON && t2 <= -DIST_EPSILON) || (t2 < t1 && t1 <= 0) )
690 return SV_RecursiveHullCheck (hull, node->children[1], p1f, p2f, p1, p2, trace);
693 // put the crosspoint DIST_EPSILON pixels on the near side
695 frac = bound(0, (t1 + DIST_EPSILON)/(t1-t2), 1);
697 frac = bound(0, (t1 - DIST_EPSILON)/(t1-t2), 1);
699 midf = p1f + (p2f - p1f)*frac;
700 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
701 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
702 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
706 // move up to the node
707 if (!SV_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) )
711 if (SV_HullPointContents (hull, node->children[side], mid) == CONTENTS_SOLID)
713 Con_Printf ("mid PointInHullSolid\n");
718 if (SV_HullPointContents (hull, node->children[side^1], mid) != CONTENTS_SOLID)
720 return SV_RecursiveHullCheck (hull, node->children[side^1], midf, p2f, mid, p2, trace);
721 // mid would need to be duplicated during recursion...
727 num = node->children[side^1];
734 return false; // never got out of the solid area
737 // the other side of the node is solid, this is the impact point
741 VectorCopy (plane->normal, trace->plane.normal);
742 trace->plane.dist = plane->dist;
746 VectorNegate (plane->normal, trace->plane.normal);
747 trace->plane.dist = -plane->dist;
750 while (SV_HullPointContents (hull, hull->firstclipnode, mid) == CONTENTS_SOLID)
751 { // shouldn't really happen, but does occasionally
755 trace->fraction = midf;
756 VectorCopy (mid, trace->endpos);
757 Con_DPrintf ("backup past 0\n");
760 midf = p1f + (p2f - p1f)*frac;
761 for (i=0 ; i<3 ; i++)
762 mid[i] = p1[i] + frac*(p2[i] - p1[i]);
765 trace->fraction = midf;
766 VectorCopy (mid, trace->endpos);
772 // LordHavoc: backported from my optimizations to PM_RecursiveHullCheck in QuakeForge newtree (QW)
773 qboolean SV_RecursiveHullCheck (hull_t *hull, int num, float p1f, float p2f, vec3_t p1, vec3_t p2, trace_t *trace)
784 // LordHavoc: a goto! everyone flee in terror... :)
789 if (num != CONTENTS_SOLID)
791 trace->allsolid = false;
792 if (num == CONTENTS_EMPTY)
793 trace->inopen = true;
795 trace->inwater = true;
798 trace->startsolid = true;
799 return true; // empty
802 // find the point distances
803 node = hull->clipnodes + num;
804 plane = hull->planes + node->planenum;
808 t1 = p1[plane->type] - plane->dist;
809 t2 = p2[plane->type] - plane->dist;
813 t1 = DotProduct (plane->normal, p1) - plane->dist;
814 t2 = DotProduct (plane->normal, p2) - plane->dist;
817 // LordHavoc: recursion optimization
818 if (t1 >= 0 && t2 >= 0)
820 num = node->children[0];
823 if (t1 < 0 && t2 < 0)
825 num = node->children[1];
829 // put the crosspoint DIST_EPSILON pixels on the near side
832 frac = bound(0, (t1 + DIST_EPSILON) / (t1 - t2), 1);
834 frac = bound(0, (t1 - DIST_EPSILON) / (t1 - t2), 1);
836 midf = p1f + (p2f - p1f)*frac;
837 for (i=0 ; i<3 ; i++)
838 mid[i] = p1[i] + frac*(p2[i] - p1[i]);
840 // move up to the node
841 if (!SV_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) )
845 if (SV_HullPointContents (pm_hullmodel, mid, node->children[side]) == CONTENTS_SOLID)
847 Con_Printf ("mid PointInHullSolid\n");
852 // LordHavoc: warning to the clumsy, this recursion can not be optimized because mid would need to be duplicated on a stack
853 if (SV_HullPointContents (hull, node->children[side^1], mid) != CONTENTS_SOLID)
855 return SV_RecursiveHullCheck (hull, node->children[side^1], midf, p2f, mid, p2, trace);
858 return false; // never got out of the solid area
861 // the other side of the node is solid, this is the impact point
865 VectorCopy (plane->normal, trace->plane.normal);
866 trace->plane.dist = plane->dist;
870 VectorNegate (plane->normal, trace->plane.normal);
871 trace->plane.dist = -plane->dist;
874 while (SV_HullPointContents (hull, hull->firstclipnode, mid) == CONTENTS_SOLID)
875 { // shouldn't really happen, but does occasionally
879 trace->fraction = midf;
880 VectorCopy (mid, trace->endpos);
881 Con_DPrintf ("backup past 0\n");
884 midf = p1f + (p2f - p1f)*frac;
885 for (i=0 ; i<3 ; i++)
886 mid[i] = p1[i] + frac*(p2[i] - p1[i]);
889 trace->fraction = midf;
890 VectorCopy (mid, trace->endpos);
895 qboolean SV_TestLine (hull_t *hull, int num, vec3_t p1, vec3_t p2)
906 return num != CONTENTS_SOLID;
908 if (num < hull->firstclipnode || num > hull->lastclipnode)
909 Sys_Error ("SV_RecursiveHullCheck: bad node number");
912 // find the point distances
914 node = hull->clipnodes + num;
915 plane = hull->planes + node->planenum;
917 t1 = PlaneDiff(p1, plane);
918 t2 = PlaneDiff(p2, plane);
920 if (t1 >= 0 && t2 >= 0)
922 num = node->children[0];
925 if (t1 < 0 && t2 < 0)
927 num = node->children[1];
931 // put the crosspoint DIST_EPSILON pixels on the near side
935 frac = bound(0, (t1 + DIST_EPSILON)/(t1-t2), 1);
937 frac = bound(0, (t1 - DIST_EPSILON)/(t1-t2), 1);
939 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
940 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
941 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
943 if (node->children[side] < 0)
945 if (node->children[side] == CONTENTS_SOLID)
947 return SV_TestLine(hull, node->children[!side], mid, p2);
949 else if (SV_TestLine(hull, node->children[side], p1, mid))
950 return SV_TestLine(hull, node->children[!side], mid, p2);
960 Handles selection or creation of a clipping hull, and offseting (and
961 eventually rotation) of the end points
964 trace_t SV_ClipMoveToEntity (edict_t *ent, vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end)
968 vec3_t start_l, end_l;
971 // fill in a default trace
972 memset (&trace, 0, sizeof(trace_t));
974 trace.allsolid = true;
975 VectorCopy (end, trace.endpos);
977 // get the clipping hull
978 hull = SV_HullForEntity (ent, mins, maxs, offset);
980 VectorSubtract (start, offset, start_l);
981 VectorSubtract (end, offset, end_l);
983 // LordHavoc: enabling rotating bmodels
984 // rotate start and end into the models frame of reference
985 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
987 vec3_t forward, right, up;
990 AngleVectors (ent->v.angles, forward, right, up);
992 VectorCopy (start_l, temp);
993 start_l[0] = DotProduct (temp, forward);
994 start_l[1] = -DotProduct (temp, right);
995 start_l[2] = DotProduct (temp, up);
997 VectorCopy (end_l, temp);
998 end_l[0] = DotProduct (temp, forward);
999 end_l[1] = -DotProduct (temp, right);
1000 end_l[2] = DotProduct (temp, up);
1003 // trace a line through the apropriate clipping hull
1004 SV_RecursiveHullCheck (hull, hull->firstclipnode, 0, 1, start_l, end_l, &trace);
1006 // LordHavoc: enabling rotating bmodels
1007 // rotate endpos back to world frame of reference
1008 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
1011 vec3_t forward, right, up;
1014 if (trace.fraction != 1)
1016 VectorNegate (ent->v.angles, a);
1017 AngleVectors (a, forward, right, up);
1019 VectorCopy (trace.endpos, temp);
1020 trace.endpos[0] = DotProduct (temp, forward);
1021 trace.endpos[1] = -DotProduct (temp, right);
1022 trace.endpos[2] = DotProduct (temp, up);
1024 VectorCopy (trace.plane.normal, temp);
1025 trace.plane.normal[0] = DotProduct (temp, forward);
1026 trace.plane.normal[1] = -DotProduct (temp, right);
1027 trace.plane.normal[2] = DotProduct (temp, up);
1031 // fix trace up by the offset
1032 if (trace.fraction != 1)
1033 VectorAdd (trace.endpos, offset, trace.endpos);
1035 // did we clip the move?
1036 if (trace.fraction < 1 || trace.startsolid )
1042 //===========================================================================
1045 ====================
1048 Mins and maxs enclose the entire area swept by the move
1049 ====================
1051 void SV_ClipToLinks ( areanode_t *node, moveclip_t *clip )
1058 // touch linked edicts
1059 for (l = node->solid_edicts.next ; l != &node->solid_edicts ; l = next)
1062 touch = EDICT_FROM_AREA(l);
1063 if (touch->v.solid == SOLID_NOT)
1065 if (touch == clip->passedict)
1067 if (touch->v.solid == SOLID_TRIGGER)
1068 Sys_Error ("Trigger in clipping list");
1070 if (clip->type == MOVE_NOMONSTERS && touch->v.solid != SOLID_BSP)
1073 if (clip->boxmins[0] > touch->v.absmax[0]
1074 || clip->boxmins[1] > touch->v.absmax[1]
1075 || clip->boxmins[2] > touch->v.absmax[2]
1076 || clip->boxmaxs[0] < touch->v.absmin[0]
1077 || clip->boxmaxs[1] < touch->v.absmin[1]
1078 || clip->boxmaxs[2] < touch->v.absmin[2])
1081 if (clip->passedict != NULL && clip->passedict->v.size[0] && !touch->v.size[0])
1082 continue; // points never interact
1084 // might intersect, so do an exact clip
1085 if (clip->trace.allsolid)
1087 if (clip->passedict)
1089 if (PROG_TO_EDICT(touch->v.owner) == clip->passedict)
1090 continue; // don't clip against own missiles
1091 if (PROG_TO_EDICT(clip->passedict->v.owner) == touch)
1092 continue; // don't clip against owner
1093 // LordHavoc: corpse code
1094 if (clip->passedict->v.solid == SOLID_CORPSE && touch->v.solid == SOLID_SLIDEBOX)
1096 if (clip->passedict->v.solid == SOLID_SLIDEBOX && touch->v.solid == SOLID_CORPSE)
1100 if ((int)touch->v.flags & FL_MONSTER)
1101 trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins2, clip->maxs2, clip->end);
1103 trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins, clip->maxs, clip->end);
1104 if (trace.allsolid || trace.startsolid || trace.fraction < clip->trace.fraction)
1107 if (clip->trace.startsolid)
1109 clip->trace = trace;
1110 clip->trace.startsolid = true;
1113 clip->trace = trace;
1115 else if (trace.startsolid)
1116 clip->trace.startsolid = true;
1119 // recurse down both sides
1120 if (node->axis == -1)
1123 // LordHavoc: optimized recursion
1124 // if (clip->boxmaxs[node->axis] > node->dist) SV_ClipToLinks(node->children[0], clip);
1125 // if (clip->boxmins[node->axis] < node->dist) SV_ClipToLinks(node->children[1], clip);
1126 if (clip->boxmaxs[node->axis] > node->dist)
1128 if (clip->boxmins[node->axis] < node->dist)
1129 SV_ClipToLinks(node->children[1], clip);
1130 node = node->children[0];
1133 else if (clip->boxmins[node->axis] < node->dist)
1135 node = node->children[1];
1146 void SV_MoveBounds (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, vec3_t boxmins, vec3_t boxmaxs)
1149 // debug to test against everything
1150 boxmins[0] = boxmins[1] = boxmins[2] = -9999;
1151 boxmaxs[0] = boxmaxs[1] = boxmaxs[2] = 9999;
1155 for (i=0 ; i<3 ; i++)
1157 if (end[i] > start[i])
1159 boxmins[i] = start[i] + mins[i] - 1;
1160 boxmaxs[i] = end[i] + maxs[i] + 1;
1164 boxmins[i] = end[i] + mins[i] - 1;
1165 boxmaxs[i] = start[i] + maxs[i] + 1;
1176 trace_t SV_Move (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, int type, edict_t *passedict)
1181 memset ( &clip, 0, sizeof ( moveclip_t ) );
1184 clip.trace = SV_ClipMoveToEntity ( sv.edicts, start, mins, maxs, end );
1191 clip.passedict = passedict;
1193 if (type == MOVE_MISSILE)
1195 for (i=0 ; i<3 ; i++)
1197 clip.mins2[i] = -15;
1203 VectorCopy (mins, clip.mins2);
1204 VectorCopy (maxs, clip.maxs2);
1207 // create the bounding box of the entire move
1208 SV_MoveBounds ( start, clip.mins2, clip.maxs2, end, clip.boxmins, clip.boxmaxs );
1211 SV_ClipToLinks ( sv_areanodes, &clip );