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->normalmins, sv.worldmodel->normalmaxs);
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_LinkEdict (edict_t *ent, qboolean touch_triggers)
418 SV_UnlinkEdict (ent); // unlink from old position
420 if (ent == sv.edicts)
421 return; // don't add the world
428 // LordHavoc: enabling rotating bmodels
429 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
431 // expand for rotation
435 max = DotProduct(ent->v.mins, ent->v.mins);
436 v = DotProduct(ent->v.maxs, ent->v.maxs);
442 for (i=0 ; i<3 ; i++)
444 v = fabs(ent->v.mins[i]);
447 v = fabs(ent->v.maxs[i]);
452 for (i=0 ; i<3 ; i++)
454 ent->v.absmin[i] = ent->v.origin[i] - max;
455 ent->v.absmax[i] = ent->v.origin[i] + max;
460 VectorAdd (ent->v.origin, ent->v.mins, ent->v.absmin);
461 VectorAdd (ent->v.origin, ent->v.maxs, ent->v.absmax);
465 // to make items easier to pick up and allow them to be grabbed off
466 // of shelves, the abs sizes are expanded
468 if ((int)ent->v.flags & FL_ITEM)
470 ent->v.absmin[0] -= 15;
471 ent->v.absmin[1] -= 15;
472 ent->v.absmax[0] += 15;
473 ent->v.absmax[1] += 15;
477 // because movement is clipped an epsilon away from an actual edge,
478 // we must fully check even when bounding boxes don't quite touch
479 ent->v.absmin[0] -= 1;
480 ent->v.absmin[1] -= 1;
481 ent->v.absmin[2] -= 1;
482 ent->v.absmax[0] += 1;
483 ent->v.absmax[1] += 1;
484 ent->v.absmax[2] += 1;
487 if (ent->v.solid == SOLID_NOT)
490 // find the first node that the ent's box crosses
494 if (node->axis == -1)
496 if (ent->v.absmin[node->axis] > node->dist)
497 node = node->children[0];
498 else if (ent->v.absmax[node->axis] < node->dist)
499 node = node->children[1];
501 break; // crosses the node
506 if (ent->v.solid == SOLID_TRIGGER)
507 InsertLinkBefore (&ent->area, &node->trigger_edicts);
509 InsertLinkBefore (&ent->area, &node->solid_edicts);
511 // if touch_triggers, touch all entities at this node and descend for more
513 SV_TouchLinks ( ent, sv_areanodes );
519 ===============================================================================
521 POINT TESTING IN HULLS
523 ===============================================================================
532 int SV_HullPointContents (hull_t *hull, int num, vec3_t p)
535 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];
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, MOVE_NORMAL, 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)
570 #define DIST_EPSILON (0.125)
572 #define HULLCHECKSTATE_EMPTY 0
573 #define HULLCHECKSTATE_SOLID 1
574 #define HULLCHECKSTATE_DONE 2
576 // LordHavoc: FIXME: this is not thread safe, if threading matters here, pass
577 // this as a struct to RecursiveHullCheck, RecursiveHullCheck_Impact, etc...
578 RecursiveHullCheckTraceInfo_t RecursiveHullCheckInfo;
579 #define RHC RecursiveHullCheckInfo
581 void SV_RecursiveHullCheck_Impact (mplane_t *plane, int side)
583 // LordHavoc: using doubles for extra accuracy
586 // LordHavoc: now that we have found the impact, recalculate the impact
587 // point from scratch for maximum accuracy, with an epsilon bias on the
592 frac -= DIST_EPSILON;
593 VectorNegate (plane->normal, RHC.trace->plane.normal);
594 RHC.trace->plane.dist = -plane->dist;
598 frac += DIST_EPSILON;
599 VectorCopy (plane->normal, RHC.trace->plane.normal);
600 RHC.trace->plane.dist = plane->dist;
605 t1 = RHC.start[plane->type] - frac;
606 t2 = RHC.start[plane->type] + RHC.dist[plane->type] - frac;
610 t1 = plane->normal[0] * RHC.start[0] + plane->normal[1] * RHC.start[1] + plane->normal[2] * RHC.start[2] - frac;
611 t2 = plane->normal[0] * (RHC.start[0] + RHC.dist[0]) + plane->normal[1] * (RHC.start[1] + RHC.dist[1]) + plane->normal[2] * (RHC.start[2] + RHC.dist[2]) - frac;
614 frac = t1 / (t1 - t2);
615 frac = bound(0.0f, frac, 1.0f);
617 RHC.trace->fraction = frac;
618 RHC.trace->endpos[0] = RHC.start[0] + frac * RHC.dist[0];
619 RHC.trace->endpos[1] = RHC.start[1] + frac * RHC.dist[1];
620 RHC.trace->endpos[2] = RHC.start[2] + frac * RHC.dist[2];
623 int SV_RecursiveHullCheck (int num, float p1f, float p2f, vec3_t p1, vec3_t p2)
629 // LordHavoc: FIXME: this is not thread safe... if threading matters here,
630 // remove the static prefixes
632 static mplane_t *plane;
633 static float t1, t2, frac;
635 // LordHavoc: a goto! everyone flee in terror... :)
640 RHC.trace->endcontents = num;
641 if (RHC.trace->startcontents)
643 if (num == RHC.trace->startcontents)
644 RHC.trace->allsolid = false;
647 // if the first leaf is solid, set startsolid
648 if (RHC.trace->allsolid)
649 RHC.trace->startsolid = true;
650 return HULLCHECKSTATE_SOLID;
652 return HULLCHECKSTATE_EMPTY;
656 if (num != CONTENTS_SOLID)
658 RHC.trace->allsolid = false;
659 if (num == CONTENTS_EMPTY)
660 RHC.trace->inopen = true;
662 RHC.trace->inwater = true;
666 // if the first leaf is solid, set startsolid
667 if (RHC.trace->allsolid)
668 RHC.trace->startsolid = true;
669 return HULLCHECKSTATE_SOLID;
671 return HULLCHECKSTATE_EMPTY;
675 // find the point distances
676 node = RHC.hull->clipnodes + num;
678 plane = RHC.hull->planes + node->planenum;
681 t1 = p1[plane->type] - plane->dist;
682 t2 = p2[plane->type] - plane->dist;
686 t1 = DotProduct (plane->normal, p1) - plane->dist;
687 t2 = DotProduct (plane->normal, p2) - plane->dist;
690 // LordHavoc: rearranged the side/frac code
695 num = node->children[0];
698 // put the crosspoint DIST_EPSILON pixels on the near side
705 num = node->children[1];
708 // put the crosspoint DIST_EPSILON pixels on the near side
712 frac = t1 / (t1 - t2);
713 frac = bound(0.0f, frac, 1.0f);
715 midf = p1f + ((p2f - p1f) * frac);
716 mid[0] = RHC.start[0] + midf * RHC.dist[0];
717 mid[1] = RHC.start[1] + midf * RHC.dist[1];
718 mid[2] = RHC.start[2] + midf * RHC.dist[2];
721 ret = SV_RecursiveHullCheck (node->children[side], p1f, midf, p1, mid);
722 if (ret != HULLCHECKSTATE_EMPTY)
723 return ret; // solid or done
724 ret = SV_RecursiveHullCheck (node->children[!side], midf, p2f, mid, p2);
725 if (ret != HULLCHECKSTATE_SOLID)
726 return ret; // empty or done
728 // front is air and back is solid, this is the impact point...
729 SV_RecursiveHullCheck_Impact(RHC.hull->planes + node->planenum, side);
731 return HULLCHECKSTATE_DONE;
735 qboolean SV_RecursiveHullCheckContentBoundary (hull_t *hull, int num, float p1f, float p2f, vec3_t p1, vec3_t p2, trace_t *trace)
746 // LordHavoc: a goto! everyone flee in terror... :)
751 if (num != trace->startcontents)
752 trace->startsolid = true;
754 trace->allsolid = false;
755 return true; // empty
758 // find the point distances
759 node = hull->clipnodes + num;
760 plane = hull->planes + node->planenum;
764 t1 = p1[plane->type] - plane->dist;
765 t2 = p2[plane->type] - plane->dist;
769 t1 = DotProduct (plane->normal, p1) - plane->dist;
770 t2 = DotProduct (plane->normal, p2) - plane->dist;
773 // LordHavoc: rearranged the side/frac code
774 // LordHavoc: recursion optimization
779 num = node->children[0];
782 // put the crosspoint DIST_EPSILON pixels on the near side
789 num = node->children[1];
792 // put the crosspoint DIST_EPSILON pixels on the near side
796 frac = t1 / (t1 - t2);
797 frac = bound(0.0f, frac, 1.0f);
799 midf = p1f + ((p2f - p1f) * frac);
800 mid[0] = p1[0] + ((p2[0] - p1[0]) * frac);
801 mid[1] = p1[1] + ((p2[1] - p1[1]) * frac);
802 mid[2] = p1[2] + ((p2[2] - p1[2]) * frac);
804 // move up to the node
805 if (!SV_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) )
811 if (SV_HullPointContents (pm_hullmodel, mid, node->children[side]) != trace->startcontents)
813 Con_Printf ("mid PointInHullSolid\n");
820 // LordHavoc: warning to the clumsy, this recursion can not be optimized because mid would need to be duplicated on a stack
821 if (SV_HullPointContents (hull, node->children[side^1], mid) == trace->startcontents)
823 return SV_RecursiveHullCheck (hull, node->children[side^1], midf, p2f, mid, p2, trace);
826 return false; // never got out of the solid area
829 // the other side of the node is solid, this is the impact point
833 VectorCopy (plane->normal, trace->plane.normal);
834 trace->plane.dist = plane->dist;
838 VectorNegate (plane->normal, trace->plane.normal);
839 trace->plane.dist = -plane->dist;
844 while (SV_HullPointContents (hull, hull->firstclipnode, mid) != trace->startcontents)
846 // shouldn't really happen, but does occasionally
850 trace->fraction = midf;
851 VectorCopy (mid, trace->endpos);
852 Con_DPrintf ("backup past 0\n");
855 midf = p1f + (p2f - p1f)*frac;
856 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
857 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
858 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
865 frac += DIST_EPSILON;
867 frac -= DIST_EPSILON;
870 frac = bound(0.0f, frac, 1.0f);
872 trace->fraction = p1f + (p2f - p1f)*frac;
873 trace->endpos[0] = p1[0] + frac*(p2[0] - p1[0]);
874 trace->endpos[1] = p1[1] + frac*(p2[1] - p1[1]);
875 trace->endpos[2] = p1[2] + frac*(p2[2] - p1[2]);
881 qboolean SV_TestLine (hull_t *hull, int num, vec3_t p1, vec3_t p2)
892 return num != CONTENTS_SOLID;
894 if (num < hull->firstclipnode || num > hull->lastclipnode)
895 Sys_Error ("SV_RecursiveHullCheck: bad node number");
898 // find the point distances
900 node = hull->clipnodes + num;
901 if (node->children[0] < 0)
903 if (node->children[0] == CONTENTS_SOLID)
905 if (node->children[1] < 0)
906 return node->children[1] != CONTENTS_SOLID;
908 else if (node->children[1] == CONTENTS_SOLID)
911 plane = hull->planes + node->planenum;
915 t1 = p1[plane->type] - plane->dist;
916 t2 = p2[plane->type] - plane->dist;
920 t1 = DotProduct (plane->normal, p1) - plane->dist;
921 t2 = DotProduct (plane->normal, p2) - plane->dist;
928 num = node->children[0];
937 num = node->children[1];
943 if (node->children[side] < 0)
945 if (node->children[side] == CONTENTS_SOLID)
948 if (node->children[!side] < 0)
949 return node->children[!side] != CONTENTS_SOLID;
952 frac = t1 / (t1 - t2);
953 frac = bound(0, frac, 1);
955 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
956 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
957 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
959 return SV_TestLine(hull, node->children[!side], mid, p2);
964 if (node->children[!side] < 0)
966 if (node->children[!side] == CONTENTS_SOLID)
969 frac = t1 / (t1 - t2);
970 frac = bound(0, frac, 1);
972 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
973 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
974 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
976 return SV_TestLine(hull, node->children[side], p1, mid);
980 frac = t1 / (t1 - t2);
981 frac = bound(0, frac, 1);
983 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
984 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
985 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
987 if (SV_TestLine(hull, node->children[side], p1, mid))
988 return SV_TestLine(hull, node->children[!side], mid, p2);
1000 Handles selection or creation of a clipping hull, and offseting (and
1001 eventually rotation) of the end points
1004 trace_t SV_ClipMoveToEntity (edict_t *ent, vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end)
1008 vec3_t start_l, end_l;
1011 // fill in a default trace
1012 memset (&trace, 0, sizeof(trace_t));
1014 trace.allsolid = true;
1015 VectorCopy (end, trace.endpos);
1017 // get the clipping hull
1018 hull = SV_HullForEntity (ent, mins, maxs, offset);
1020 VectorSubtract (start, offset, start_l);
1021 VectorSubtract (end, offset, end_l);
1023 // LordHavoc: enabling rotating bmodels
1024 // rotate start and end into the models frame of reference
1025 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
1027 vec3_t forward, right, up;
1030 AngleVectors (ent->v.angles, forward, right, up);
1032 VectorCopy (start_l, temp);
1033 start_l[0] = DotProduct (temp, forward);
1034 start_l[1] = -DotProduct (temp, right);
1035 start_l[2] = DotProduct (temp, up);
1037 VectorCopy (end_l, temp);
1038 end_l[0] = DotProduct (temp, forward);
1039 end_l[1] = -DotProduct (temp, right);
1040 end_l[2] = DotProduct (temp, up);
1043 // trace a line through the apropriate clipping hull
1044 VectorCopy(start_l, RecursiveHullCheckInfo.start);
1045 VectorSubtract(end_l, start_l, RecursiveHullCheckInfo.dist);
1046 RecursiveHullCheckInfo.hull = hull;
1047 RecursiveHullCheckInfo.trace = &trace;
1048 SV_RecursiveHullCheck (hull->firstclipnode, 0, 1, start_l, end_l);
1050 // LordHavoc: enabling rotating bmodels
1051 // rotate endpos back to world frame of reference
1052 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
1055 vec3_t forward, right, up;
1058 if (trace.fraction != 1)
1060 VectorNegate (ent->v.angles, a);
1061 AngleVectors (a, forward, right, up);
1063 VectorCopy (trace.endpos, temp);
1064 trace.endpos[0] = DotProduct (temp, forward);
1065 trace.endpos[1] = -DotProduct (temp, right);
1066 trace.endpos[2] = DotProduct (temp, up);
1068 VectorCopy (trace.plane.normal, temp);
1069 trace.plane.normal[0] = DotProduct (temp, forward);
1070 trace.plane.normal[1] = -DotProduct (temp, right);
1071 trace.plane.normal[2] = DotProduct (temp, up);
1075 // fix trace up by the offset
1076 if (trace.fraction != 1)
1077 VectorAdd (trace.endpos, offset, trace.endpos);
1079 // did we clip the move?
1080 if (trace.fraction < 1 || trace.startsolid )
1086 //===========================================================================
1089 ====================
1092 Mins and maxs enclose the entire area swept by the move
1093 ====================
1095 void SV_ClipToLinks ( areanode_t *node, moveclip_t *clip )
1102 // touch linked edicts
1103 for (l = node->solid_edicts.next ; l != &node->solid_edicts ; l = next)
1106 touch = EDICT_FROM_AREA(l);
1107 if (touch->v.solid == SOLID_NOT)
1109 if (touch == clip->passedict)
1111 if (touch->v.solid == SOLID_TRIGGER)
1112 Sys_Error ("Trigger in clipping list");
1114 if (clip->type == MOVE_NOMONSTERS && touch->v.solid != SOLID_BSP)
1117 if (clip->boxmins[0] > touch->v.absmax[0]
1118 || clip->boxmins[1] > touch->v.absmax[1]
1119 || clip->boxmins[2] > touch->v.absmax[2]
1120 || clip->boxmaxs[0] < touch->v.absmin[0]
1121 || clip->boxmaxs[1] < touch->v.absmin[1]
1122 || clip->boxmaxs[2] < touch->v.absmin[2])
1125 if (clip->passedict != NULL && clip->passedict->v.size[0] && !touch->v.size[0])
1126 continue; // points never interact
1128 // might intersect, so do an exact clip
1129 if (clip->trace.allsolid)
1131 if (clip->passedict)
1133 if (PROG_TO_EDICT(touch->v.owner) == clip->passedict)
1134 continue; // don't clip against own missiles
1135 if (PROG_TO_EDICT(clip->passedict->v.owner) == touch)
1136 continue; // don't clip against owner
1137 // LordHavoc: corpse code
1138 if (clip->passedict->v.solid == SOLID_CORPSE && touch->v.solid == SOLID_SLIDEBOX)
1140 if (clip->passedict->v.solid == SOLID_SLIDEBOX && touch->v.solid == SOLID_CORPSE)
1144 if ((int)touch->v.flags & FL_MONSTER)
1145 trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins2, clip->maxs2, clip->end);
1147 trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins, clip->maxs, clip->end);
1148 if (trace.allsolid || trace.startsolid || trace.fraction < clip->trace.fraction)
1151 if (clip->trace.startsolid)
1153 clip->trace = trace;
1154 clip->trace.startsolid = true;
1157 clip->trace = trace;
1159 else if (trace.startsolid)
1160 clip->trace.startsolid = true;
1163 // recurse down both sides
1164 if (node->axis == -1)
1167 // LordHavoc: optimized recursion
1168 // if (clip->boxmaxs[node->axis] > node->dist) SV_ClipToLinks(node->children[0], clip);
1169 // if (clip->boxmins[node->axis] < node->dist) SV_ClipToLinks(node->children[1], clip);
1170 if (clip->boxmaxs[node->axis] > node->dist)
1172 if (clip->boxmins[node->axis] < node->dist)
1173 SV_ClipToLinks(node->children[1], clip);
1174 node = node->children[0];
1177 else if (clip->boxmins[node->axis] < node->dist)
1179 node = node->children[1];
1190 void SV_MoveBounds (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, vec3_t boxmins, vec3_t boxmaxs)
1193 // debug to test against everything
1194 boxmins[0] = boxmins[1] = boxmins[2] = -9999;
1195 boxmaxs[0] = boxmaxs[1] = boxmaxs[2] = 9999;
1199 for (i=0 ; i<3 ; i++)
1201 if (end[i] > start[i])
1203 boxmins[i] = start[i] + mins[i] - 1;
1204 boxmaxs[i] = end[i] + maxs[i] + 1;
1208 boxmins[i] = end[i] + mins[i] - 1;
1209 boxmaxs[i] = start[i] + maxs[i] + 1;
1220 trace_t SV_Move (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, int type, edict_t *passedict)
1225 memset ( &clip, 0, sizeof ( moveclip_t ) );
1228 clip.trace = SV_ClipMoveToEntity ( sv.edicts, start, mins, maxs, end );
1235 clip.passedict = passedict;
1237 if (type == MOVE_MISSILE)
1239 for (i=0 ; i<3 ; i++)
1241 clip.mins2[i] = -15;
1247 VectorCopy (mins, clip.mins2);
1248 VectorCopy (maxs, clip.maxs2);
1251 // create the bounding box of the entire move
1252 SV_MoveBounds ( start, clip.mins2, clip.maxs2, end, clip.boxmins, clip.boxmaxs );
1255 SV_ClipToLinks ( sv_areanodes, &clip );