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 ];
190 Mod_CheckLoaded(model);
192 // LordHavoc: fixed SOLID_BSP error message
193 if (!model || model->type != mod_brush)
195 Con_Printf ("SOLID_BSP with a non bsp model, entity dump:\n");
197 Host_Error ("SOLID_BSP with a non bsp model\n");
200 VectorSubtract (maxs, mins, size);
201 // LordHavoc: FIXME!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
202 if (sv.worldmodel->ishlbsp)
205 hull = &model->hulls[0]; // 0x0x0
206 else if (size[0] <= 32)
208 if (size[2] < 54) // pick the nearest of 36 or 72
209 hull = &model->hulls[3]; // 32x32x36
211 hull = &model->hulls[1]; // 32x32x72
214 hull = &model->hulls[2]; // 64x64x64
219 hull = &model->hulls[0]; // 0x0x0
220 else if (size[0] <= 32)
221 hull = &model->hulls[1]; // 32x32x56
223 hull = &model->hulls[2]; // 64x64x88
226 // calculate an offset value to center the origin
227 VectorSubtract (hull->clip_mins, mins, offset);
228 VectorAdd (offset, ent->v.origin, offset);
231 { // create a temp hull from bounding box sizes
233 VectorSubtract (ent->v.mins, maxs, hullmins);
234 VectorSubtract (ent->v.maxs, mins, hullmaxs);
235 hull = SV_HullForBox (hullmins, hullmaxs);
237 VectorCopy (ent->v.origin, offset);
245 ===============================================================================
249 ===============================================================================
252 typedef struct areanode_s
254 int axis; // -1 = leaf node
256 struct areanode_s *children[2];
257 link_t trigger_edicts;
262 #define AREA_NODES 32
264 static areanode_t sv_areanodes[AREA_NODES];
265 static int sv_numareanodes;
273 areanode_t *SV_CreateAreaNode (int depth, vec3_t mins, vec3_t maxs)
277 vec3_t mins1, maxs1, mins2, maxs2;
279 anode = &sv_areanodes[sv_numareanodes];
282 ClearLink (&anode->trigger_edicts);
283 ClearLink (&anode->solid_edicts);
285 if (depth == AREA_DEPTH)
288 anode->children[0] = anode->children[1] = NULL;
292 VectorSubtract (maxs, mins, size);
293 if (size[0] > size[1])
298 anode->dist = 0.5 * (maxs[anode->axis] + mins[anode->axis]);
299 VectorCopy (mins, mins1);
300 VectorCopy (mins, mins2);
301 VectorCopy (maxs, maxs1);
302 VectorCopy (maxs, maxs2);
304 maxs1[anode->axis] = mins2[anode->axis] = anode->dist;
306 anode->children[0] = SV_CreateAreaNode (depth+1, mins2, maxs2);
307 anode->children[1] = SV_CreateAreaNode (depth+1, mins1, maxs1);
318 void SV_ClearWorld (void)
322 memset (sv_areanodes, 0, sizeof(sv_areanodes));
324 Mod_CheckLoaded(sv.worldmodel);
325 SV_CreateAreaNode (0, sv.worldmodel->normalmins, sv.worldmodel->normalmaxs);
335 void SV_UnlinkEdict (edict_t *ent)
338 return; // not linked in anywhere
339 RemoveLink (&ent->area);
340 ent->area.prev = ent->area.next = NULL;
349 void SV_TouchLinks ( edict_t *ent, areanode_t *node )
353 int old_self, old_other;
356 // touch linked edicts
357 for (l = node->trigger_edicts.next ; l != &node->trigger_edicts ; l = next)
360 touch = EDICT_FROM_AREA(l);
363 if (!touch->v.touch || touch->v.solid != SOLID_TRIGGER)
365 if (ent->v.absmin[0] > touch->v.absmax[0]
366 || ent->v.absmin[1] > touch->v.absmax[1]
367 || ent->v.absmin[2] > touch->v.absmax[2]
368 || ent->v.absmax[0] < touch->v.absmin[0]
369 || ent->v.absmax[1] < touch->v.absmin[1]
370 || ent->v.absmax[2] < touch->v.absmin[2])
372 old_self = pr_global_struct->self;
373 old_other = pr_global_struct->other;
375 pr_global_struct->self = EDICT_TO_PROG(touch);
376 pr_global_struct->other = EDICT_TO_PROG(ent);
377 pr_global_struct->time = sv.time;
378 PR_ExecuteProgram (touch->v.touch, "");
380 pr_global_struct->self = old_self;
381 pr_global_struct->other = old_other;
384 // recurse down both sides
385 if (node->axis == -1)
388 // LordHavoc: optimized recursion
389 // if (ent->v.absmax[node->axis] > node->dist) SV_TouchLinks (ent, node->children[0]);
390 // if (ent->v.absmin[node->axis] < node->dist) SV_TouchLinks (ent, node->children[1]);
391 if (ent->v.absmax[node->axis] > node->dist)
393 if (ent->v.absmin[node->axis] < node->dist)
394 SV_TouchLinks(ent, node->children[1]); // order reversed to reduce code
395 node = node->children[0];
400 if (ent->v.absmin[node->axis] < node->dist)
402 node = node->children[1];
415 void SV_LinkEdict (edict_t *ent, qboolean touch_triggers)
420 SV_UnlinkEdict (ent); // unlink from old position
422 if (ent == sv.edicts)
423 return; // don't add the world
430 // LordHavoc: enabling rotating bmodels
431 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
433 // expand for rotation
437 max = DotProduct(ent->v.mins, ent->v.mins);
438 v = DotProduct(ent->v.maxs, ent->v.maxs);
444 for (i=0 ; i<3 ; i++)
446 v = fabs(ent->v.mins[i]);
449 v = fabs(ent->v.maxs[i]);
454 for (i=0 ; i<3 ; i++)
456 ent->v.absmin[i] = ent->v.origin[i] - max;
457 ent->v.absmax[i] = ent->v.origin[i] + max;
462 VectorAdd (ent->v.origin, ent->v.mins, ent->v.absmin);
463 VectorAdd (ent->v.origin, ent->v.maxs, ent->v.absmax);
467 // to make items easier to pick up and allow them to be grabbed off
468 // of shelves, the abs sizes are expanded
470 if ((int)ent->v.flags & FL_ITEM)
472 ent->v.absmin[0] -= 15;
473 ent->v.absmin[1] -= 15;
474 ent->v.absmax[0] += 15;
475 ent->v.absmax[1] += 15;
479 // because movement is clipped an epsilon away from an actual edge,
480 // we must fully check even when bounding boxes don't quite touch
481 ent->v.absmin[0] -= 1;
482 ent->v.absmin[1] -= 1;
483 ent->v.absmin[2] -= 1;
484 ent->v.absmax[0] += 1;
485 ent->v.absmax[1] += 1;
486 ent->v.absmax[2] += 1;
489 if (ent->v.solid == SOLID_NOT)
492 // find the first node that the ent's box crosses
496 if (node->axis == -1)
498 if (ent->v.absmin[node->axis] > node->dist)
499 node = node->children[0];
500 else if (ent->v.absmax[node->axis] < node->dist)
501 node = node->children[1];
503 break; // crosses the node
508 if (ent->v.solid == SOLID_TRIGGER)
509 InsertLinkBefore (&ent->area, &node->trigger_edicts);
511 InsertLinkBefore (&ent->area, &node->solid_edicts);
513 // if touch_triggers, touch all entities at this node and descend for more
515 SV_TouchLinks ( ent, sv_areanodes );
521 ===============================================================================
523 POINT TESTING IN HULLS
525 ===============================================================================
534 int SV_HullPointContents (hull_t *hull, int num, vec3_t p)
537 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];
544 SV_TestEntityPosition
546 This could be a lot more efficient...
549 edict_t *SV_TestEntityPosition (edict_t *ent)
553 trace = SV_Move (ent->v.origin, ent->v.mins, ent->v.maxs, ent->v.origin, MOVE_NORMAL, ent);
555 if (trace.startsolid)
563 ===============================================================================
565 LINE TESTING IN HULLS
567 ===============================================================================
570 // 1/32 epsilon to keep floating point happy
571 //#define DIST_EPSILON (0.03125)
572 #define DIST_EPSILON (0.125)
574 #define HULLCHECKSTATE_EMPTY 0
575 #define HULLCHECKSTATE_SOLID 1
576 #define HULLCHECKSTATE_DONE 2
578 // LordHavoc: FIXME: this is not thread safe, if threading matters here, pass
579 // this as a struct to RecursiveHullCheck, RecursiveHullCheck_Impact, etc...
580 RecursiveHullCheckTraceInfo_t RecursiveHullCheckInfo;
581 #define RHC RecursiveHullCheckInfo
583 void SV_RecursiveHullCheck_Impact (mplane_t *plane, int side)
585 // LordHavoc: using doubles for extra accuracy
588 // LordHavoc: now that we have found the impact, recalculate the impact
589 // point from scratch for maximum accuracy, with an epsilon bias on the
594 frac -= DIST_EPSILON;
595 VectorNegate (plane->normal, RHC.trace->plane.normal);
596 RHC.trace->plane.dist = -plane->dist;
600 frac += DIST_EPSILON;
601 VectorCopy (plane->normal, RHC.trace->plane.normal);
602 RHC.trace->plane.dist = plane->dist;
607 t1 = RHC.start[plane->type] - frac;
608 t2 = RHC.start[plane->type] + RHC.dist[plane->type] - frac;
612 t1 = plane->normal[0] * RHC.start[0] + plane->normal[1] * RHC.start[1] + plane->normal[2] * RHC.start[2] - frac;
613 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;
616 frac = t1 / (t1 - t2);
617 frac = bound(0.0f, frac, 1.0f);
619 RHC.trace->fraction = frac;
620 RHC.trace->endpos[0] = RHC.start[0] + frac * RHC.dist[0];
621 RHC.trace->endpos[1] = RHC.start[1] + frac * RHC.dist[1];
622 RHC.trace->endpos[2] = RHC.start[2] + frac * RHC.dist[2];
625 int SV_RecursiveHullCheck (int num, float p1f, float p2f, vec3_t p1, vec3_t p2)
631 // LordHavoc: FIXME: this is not thread safe... if threading matters here,
632 // remove the static prefixes
634 static mplane_t *plane;
635 static float t1, t2, frac;
637 // LordHavoc: a goto! everyone flee in terror... :)
642 RHC.trace->endcontents = num;
643 if (RHC.trace->startcontents)
645 if (num == RHC.trace->startcontents)
646 RHC.trace->allsolid = false;
649 // if the first leaf is solid, set startsolid
650 if (RHC.trace->allsolid)
651 RHC.trace->startsolid = true;
652 return HULLCHECKSTATE_SOLID;
654 return HULLCHECKSTATE_EMPTY;
658 if (num != CONTENTS_SOLID)
660 RHC.trace->allsolid = false;
661 if (num == CONTENTS_EMPTY)
662 RHC.trace->inopen = true;
664 RHC.trace->inwater = true;
668 // if the first leaf is solid, set startsolid
669 if (RHC.trace->allsolid)
670 RHC.trace->startsolid = true;
671 return HULLCHECKSTATE_SOLID;
673 return HULLCHECKSTATE_EMPTY;
677 // find the point distances
678 node = RHC.hull->clipnodes + num;
680 plane = RHC.hull->planes + node->planenum;
683 t1 = p1[plane->type] - plane->dist;
684 t2 = p2[plane->type] - plane->dist;
688 t1 = DotProduct (plane->normal, p1) - plane->dist;
689 t2 = DotProduct (plane->normal, p2) - plane->dist;
692 // LordHavoc: rearranged the side/frac code
697 num = node->children[0];
700 // put the crosspoint DIST_EPSILON pixels on the near side
707 num = node->children[1];
710 // put the crosspoint DIST_EPSILON pixels on the near side
714 frac = t1 / (t1 - t2);
715 frac = bound(0.0f, frac, 1.0f);
717 midf = p1f + ((p2f - p1f) * frac);
718 mid[0] = RHC.start[0] + midf * RHC.dist[0];
719 mid[1] = RHC.start[1] + midf * RHC.dist[1];
720 mid[2] = RHC.start[2] + midf * RHC.dist[2];
723 ret = SV_RecursiveHullCheck (node->children[side], p1f, midf, p1, mid);
724 if (ret != HULLCHECKSTATE_EMPTY)
725 return ret; // solid or done
726 ret = SV_RecursiveHullCheck (node->children[!side], midf, p2f, mid, p2);
727 if (ret != HULLCHECKSTATE_SOLID)
728 return ret; // empty or done
730 // front is air and back is solid, this is the impact point...
731 SV_RecursiveHullCheck_Impact(RHC.hull->planes + node->planenum, side);
733 return HULLCHECKSTATE_DONE;
737 qboolean SV_RecursiveHullCheckContentBoundary (hull_t *hull, int num, float p1f, float p2f, vec3_t p1, vec3_t p2, trace_t *trace)
748 // LordHavoc: a goto! everyone flee in terror... :)
753 if (num != trace->startcontents)
754 trace->startsolid = true;
756 trace->allsolid = false;
757 return true; // empty
760 // find the point distances
761 node = hull->clipnodes + num;
762 plane = hull->planes + node->planenum;
766 t1 = p1[plane->type] - plane->dist;
767 t2 = p2[plane->type] - plane->dist;
771 t1 = DotProduct (plane->normal, p1) - plane->dist;
772 t2 = DotProduct (plane->normal, p2) - plane->dist;
775 // LordHavoc: rearranged the side/frac code
776 // LordHavoc: recursion optimization
781 num = node->children[0];
784 // put the crosspoint DIST_EPSILON pixels on the near side
791 num = node->children[1];
794 // put the crosspoint DIST_EPSILON pixels on the near side
798 frac = t1 / (t1 - t2);
799 frac = bound(0.0f, frac, 1.0f);
801 midf = p1f + ((p2f - p1f) * frac);
802 mid[0] = p1[0] + ((p2[0] - p1[0]) * frac);
803 mid[1] = p1[1] + ((p2[1] - p1[1]) * frac);
804 mid[2] = p1[2] + ((p2[2] - p1[2]) * frac);
806 // move up to the node
807 if (!SV_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) )
813 if (SV_HullPointContents (pm_hullmodel, mid, node->children[side]) != trace->startcontents)
815 Con_Printf ("mid PointInHullSolid\n");
822 // LordHavoc: warning to the clumsy, this recursion can not be optimized because mid would need to be duplicated on a stack
823 if (SV_HullPointContents (hull, node->children[side^1], mid) == trace->startcontents)
825 return SV_RecursiveHullCheck (hull, node->children[side^1], midf, p2f, mid, p2, trace);
828 return false; // never got out of the solid area
831 // the other side of the node is solid, this is the impact point
835 VectorCopy (plane->normal, trace->plane.normal);
836 trace->plane.dist = plane->dist;
840 VectorNegate (plane->normal, trace->plane.normal);
841 trace->plane.dist = -plane->dist;
846 while (SV_HullPointContents (hull, hull->firstclipnode, mid) != trace->startcontents)
848 // shouldn't really happen, but does occasionally
852 trace->fraction = midf;
853 VectorCopy (mid, trace->endpos);
854 Con_DPrintf ("backup past 0\n");
857 midf = p1f + (p2f - p1f)*frac;
858 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
859 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
860 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
867 frac += DIST_EPSILON;
869 frac -= DIST_EPSILON;
872 frac = bound(0.0f, frac, 1.0f);
874 trace->fraction = p1f + (p2f - p1f)*frac;
875 trace->endpos[0] = p1[0] + frac*(p2[0] - p1[0]);
876 trace->endpos[1] = p1[1] + frac*(p2[1] - p1[1]);
877 trace->endpos[2] = p1[2] + frac*(p2[2] - p1[2]);
884 // FIXME: this is broken and I'm not interested in figuring out what is broken about it right now
885 qboolean SV_TestLine (hull_t *hull, int num, vec3_t p1, vec3_t p2)
896 return num != CONTENTS_SOLID;
898 if (num < hull->firstclipnode || num > hull->lastclipnode)
899 Sys_Error ("SV_RecursiveHullCheck: bad node number");
902 // find the point distances
904 node = hull->clipnodes + num;
905 if (node->children[0] < 0)
907 if (node->children[0] == CONTENTS_SOLID)
909 if (node->children[1] < 0)
910 return node->children[1] != CONTENTS_SOLID;
912 else if (node->children[1] == CONTENTS_SOLID)
915 plane = hull->planes + node->planenum;
919 t1 = p1[plane->type] - plane->dist;
920 t2 = p2[plane->type] - plane->dist;
924 t1 = DotProduct (plane->normal, p1) - plane->dist;
925 t2 = DotProduct (plane->normal, p2) - plane->dist;
932 num = node->children[0];
941 num = node->children[1];
947 if (node->children[side] < 0)
949 if (node->children[side] == CONTENTS_SOLID)
952 if (node->children[!side] < 0)
953 return node->children[!side] != CONTENTS_SOLID;
956 frac = t1 / (t1 - t2);
957 frac = bound(0, frac, 1);
959 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
960 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
961 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
963 return SV_TestLine(hull, node->children[!side], mid, p2);
968 if (node->children[!side] < 0)
970 if (node->children[!side] == CONTENTS_SOLID)
973 frac = t1 / (t1 - t2);
974 frac = bound(0, frac, 1);
976 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
977 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
978 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
980 return SV_TestLine(hull, node->children[side], p1, mid);
984 frac = t1 / (t1 - t2);
985 frac = bound(0, frac, 1);
987 mid[0] = p1[0] + frac*(p2[0] - p1[0]);
988 mid[1] = p1[1] + frac*(p2[1] - p1[1]);
989 mid[2] = p1[2] + frac*(p2[2] - p1[2]);
991 if (SV_TestLine(hull, node->children[side], p1, mid))
992 return SV_TestLine(hull, node->children[!side], mid, p2);
1005 Handles selection or creation of a clipping hull, and offseting (and
1006 eventually rotation) of the end points
1009 trace_t SV_ClipMoveToEntity (edict_t *ent, vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end)
1013 vec3_t start_l, end_l;
1016 // fill in a default trace
1017 memset (&trace, 0, sizeof(trace_t));
1019 trace.allsolid = true;
1020 VectorCopy (end, trace.endpos);
1022 // get the clipping hull
1023 hull = SV_HullForEntity (ent, mins, maxs, offset);
1025 VectorSubtract (start, offset, start_l);
1026 VectorSubtract (end, offset, end_l);
1028 // LordHavoc: enabling rotating bmodels
1029 // rotate start and end into the models frame of reference
1030 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
1032 vec3_t forward, right, up;
1035 AngleVectors (ent->v.angles, forward, right, up);
1037 VectorCopy (start_l, temp);
1038 start_l[0] = DotProduct (temp, forward);
1039 start_l[1] = -DotProduct (temp, right);
1040 start_l[2] = DotProduct (temp, up);
1042 VectorCopy (end_l, temp);
1043 end_l[0] = DotProduct (temp, forward);
1044 end_l[1] = -DotProduct (temp, right);
1045 end_l[2] = DotProduct (temp, up);
1048 // trace a line through the appropriate clipping hull
1049 VectorCopy(start_l, RecursiveHullCheckInfo.start);
1050 VectorSubtract(end_l, start_l, RecursiveHullCheckInfo.dist);
1051 RecursiveHullCheckInfo.hull = hull;
1052 RecursiveHullCheckInfo.trace = &trace;
1053 SV_RecursiveHullCheck (hull->firstclipnode, 0, 1, start_l, end_l);
1055 // LordHavoc: enabling rotating bmodels
1056 // rotate endpos back to world frame of reference
1057 if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2]))
1060 vec3_t forward, right, up;
1063 if (trace.fraction != 1)
1065 VectorNegate (ent->v.angles, a);
1066 AngleVectors (a, forward, right, up);
1068 VectorCopy (trace.endpos, temp);
1069 trace.endpos[0] = DotProduct (temp, forward);
1070 trace.endpos[1] = -DotProduct (temp, right);
1071 trace.endpos[2] = DotProduct (temp, up);
1073 VectorCopy (trace.plane.normal, temp);
1074 trace.plane.normal[0] = DotProduct (temp, forward);
1075 trace.plane.normal[1] = -DotProduct (temp, right);
1076 trace.plane.normal[2] = DotProduct (temp, up);
1080 // fix trace up by the offset
1081 if (trace.fraction != 1)
1082 VectorAdd (trace.endpos, offset, trace.endpos);
1084 // did we clip the move?
1085 if (trace.fraction < 1 || trace.startsolid )
1091 //===========================================================================
1094 ====================
1097 Mins and maxs enclose the entire area swept by the move
1098 ====================
1100 void SV_ClipToLinks ( areanode_t *node, moveclip_t *clip )
1107 // touch linked edicts
1108 for (l = node->solid_edicts.next ; l != &node->solid_edicts ; l = next)
1111 touch = EDICT_FROM_AREA(l);
1112 if (touch->v.solid == SOLID_NOT)
1114 if (touch == clip->passedict)
1116 if (touch->v.solid == SOLID_TRIGGER)
1117 Sys_Error ("Trigger in clipping list");
1119 if (clip->type == MOVE_NOMONSTERS && touch->v.solid != SOLID_BSP)
1122 if (clip->boxmins[0] > touch->v.absmax[0]
1123 || clip->boxmins[1] > touch->v.absmax[1]
1124 || clip->boxmins[2] > touch->v.absmax[2]
1125 || clip->boxmaxs[0] < touch->v.absmin[0]
1126 || clip->boxmaxs[1] < touch->v.absmin[1]
1127 || clip->boxmaxs[2] < touch->v.absmin[2])
1130 if (clip->passedict != NULL && clip->passedict->v.size[0] && !touch->v.size[0])
1131 continue; // points never interact
1133 // might intersect, so do an exact clip
1134 if (clip->trace.allsolid)
1136 if (clip->passedict)
1138 if (PROG_TO_EDICT(touch->v.owner) == clip->passedict)
1139 continue; // don't clip against own missiles
1140 if (PROG_TO_EDICT(clip->passedict->v.owner) == touch)
1141 continue; // don't clip against owner
1142 // LordHavoc: corpse code
1143 if (clip->passedict->v.solid == SOLID_CORPSE && touch->v.solid == SOLID_SLIDEBOX)
1145 if (clip->passedict->v.solid == SOLID_SLIDEBOX && touch->v.solid == SOLID_CORPSE)
1149 if ((int)touch->v.flags & FL_MONSTER)
1150 trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins2, clip->maxs2, clip->end);
1152 trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins, clip->maxs, clip->end);
1153 if (trace.allsolid || trace.startsolid || trace.fraction < clip->trace.fraction)
1156 if (clip->trace.startsolid)
1158 clip->trace = trace;
1159 clip->trace.startsolid = true;
1162 clip->trace = trace;
1164 else if (trace.startsolid)
1165 clip->trace.startsolid = true;
1168 // recurse down both sides
1169 if (node->axis == -1)
1172 // LordHavoc: optimized recursion
1173 // if (clip->boxmaxs[node->axis] > node->dist) SV_ClipToLinks(node->children[0], clip);
1174 // if (clip->boxmins[node->axis] < node->dist) SV_ClipToLinks(node->children[1], clip);
1175 if (clip->boxmaxs[node->axis] > node->dist)
1177 if (clip->boxmins[node->axis] < node->dist)
1178 SV_ClipToLinks(node->children[1], clip);
1179 node = node->children[0];
1182 else if (clip->boxmins[node->axis] < node->dist)
1184 node = node->children[1];
1195 void SV_MoveBounds (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, vec3_t boxmins, vec3_t boxmaxs)
1198 // debug to test against everything
1199 boxmins[0] = boxmins[1] = boxmins[2] = -9999;
1200 boxmaxs[0] = boxmaxs[1] = boxmaxs[2] = 9999;
1204 for (i=0 ; i<3 ; i++)
1206 if (end[i] > start[i])
1208 boxmins[i] = start[i] + mins[i] - 1;
1209 boxmaxs[i] = end[i] + maxs[i] + 1;
1213 boxmins[i] = end[i] + mins[i] - 1;
1214 boxmaxs[i] = start[i] + maxs[i] + 1;
1225 trace_t SV_Move (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, int type, edict_t *passedict)
1230 memset ( &clip, 0, sizeof ( moveclip_t ) );
1233 clip.trace = SV_ClipMoveToEntity ( sv.edicts, start, mins, maxs, end );
1240 clip.passedict = passedict;
1242 if (type == MOVE_MISSILE)
1244 for (i=0 ; i<3 ; i++)
1246 clip.mins2[i] = -15;
1252 VectorCopy (mins, clip.mins2);
1253 VectorCopy (maxs, clip.maxs2);
1256 // create the bounding box of the entire move
1257 SV_MoveBounds ( start, clip.mins2, clip.maxs2, end, clip.boxmins, clip.boxmaxs );
1260 SV_ClipToLinks ( sv_areanodes, &clip );