]> icculus.org git repositories - divverent/darkplaces.git/blob - world.c
sv.edicts (and related things) are now dynamically reallocated as more edicts are...
[divverent/darkplaces.git] / world.c
1 /*
2 Copyright (C) 1996-1997 Id Software, Inc.
3
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.
8
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.
12
13 See the GNU General Public License for more details.
14
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.
18
19 */
20 // world.c -- world query functions
21
22 #include "quakedef.h"
23
24 /*
25
26 entities never clip against themselves, or their owner
27
28 line of sight checks trace->inopen and trace->inwater, but bullets don't
29
30 */
31
32 cvar_t sv_debugmove = {CVAR_NOTIFY, "sv_debugmove", "0"};
33 cvar_t sv_polygoncollisions = {CVAR_NOTIFY, "sv_polygoncollisions", "0"};
34 cvar_t sv_areagrid_mingridsize = {CVAR_NOTIFY, "sv_areagrid_mingridsize", "64"};
35
36 void SV_AreaStats_f(void);
37
38 void SV_World_Init(void)
39 {
40         Cvar_RegisterVariable(&sv_debugmove);
41         Cvar_RegisterVariable(&sv_polygoncollisions);
42         Cvar_RegisterVariable(&sv_areagrid_mingridsize);
43         Cmd_AddCommand("sv_areastats", SV_AreaStats_f);
44         Collision_Init();
45 }
46
47 typedef struct
48 {
49         // bounding box of entire move area
50         vec3_t boxmins, boxmaxs;
51
52         // size of the moving object
53         vec3_t mins, maxs;
54
55         // size when clipping against monsters
56         vec3_t mins2, maxs2;
57
58         // size when clipping against brush models
59         vec3_t hullmins, hullmaxs;
60
61         // start and end origin of move
62         vec3_t start, end;
63
64         // trace results
65         trace_t trace;
66
67         // type of move (like ignoring monsters, or similar)
68         int type;
69
70         // the edict that is moving (if any)
71         edict_t *passedict;
72 }
73 moveclip_t;
74
75 //============================================================================
76
77 // ClearLink is used for new headnodes
78 static void ClearLink (link_t *l)
79 {
80         l->entitynumber = 0;
81         l->prev = l->next = l;
82 }
83
84 static void RemoveLink (link_t *l)
85 {
86         l->next->prev = l->prev;
87         l->prev->next = l->next;
88 }
89
90 static void InsertLinkBefore (link_t *l, link_t *before, int entitynumber)
91 {
92         l->entitynumber = entitynumber;
93         l->next = before;
94         l->prev = before->prev;
95         l->prev->next = l;
96         l->next->prev = l;
97 }
98
99
100 /*
101 ===============================================================================
102
103 ENTITY AREA CHECKING
104
105 ===============================================================================
106 */
107
108 int sv_areagrid_stats_calls = 0;
109 int sv_areagrid_stats_nodechecks = 0;
110 int sv_areagrid_stats_entitychecks = 0;
111
112 void SV_AreaStats_f(void)
113 {
114         Con_Printf("areagrid check stats: %d calls %d nodes (%f per call) %d entities (%f per call)\n", sv_areagrid_stats_calls, sv_areagrid_stats_nodechecks, (double) sv_areagrid_stats_nodechecks / (double) sv_areagrid_stats_calls, sv_areagrid_stats_entitychecks, (double) sv_areagrid_stats_entitychecks / (double) sv_areagrid_stats_calls);
115         sv_areagrid_stats_calls = 0;
116         sv_areagrid_stats_nodechecks = 0;
117         sv_areagrid_stats_entitychecks = 0;
118 }
119
120 typedef struct areagrid_s
121 {
122         link_t trigger_edicts;
123         link_t solid_edicts;
124 }
125 areagrid_t;
126
127 #define AREA_GRID 512
128 #define AREA_GRIDNODES (AREA_GRID * AREA_GRID)
129
130 static areagrid_t sv_areagrid[AREA_GRIDNODES], sv_areagrid_outside;
131 static vec3_t sv_areagrid_bias, sv_areagrid_scale, sv_areagrid_mins, sv_areagrid_maxs, sv_areagrid_size;
132 static int sv_areagrid_marknumber = 1;
133
134 void SV_CreateAreaGrid (vec3_t mins, vec3_t maxs)
135 {
136         int i;
137         ClearLink (&sv_areagrid_outside.trigger_edicts);
138         ClearLink (&sv_areagrid_outside.solid_edicts);
139         // choose either the world box size, or a larger box to ensure the grid isn't too fine
140         sv_areagrid_size[0] = max(maxs[0] - mins[0], AREA_GRID * sv_areagrid_mingridsize.value);
141         sv_areagrid_size[1] = max(maxs[1] - mins[1], AREA_GRID * sv_areagrid_mingridsize.value);
142         sv_areagrid_size[2] = max(maxs[2] - mins[2], AREA_GRID * sv_areagrid_mingridsize.value);
143         // figure out the corners of such a box, centered at the center of the world box
144         sv_areagrid_mins[0] = (mins[0] + maxs[0] - sv_areagrid_size[0]) * 0.5f;
145         sv_areagrid_mins[1] = (mins[1] + maxs[1] - sv_areagrid_size[1]) * 0.5f;
146         sv_areagrid_mins[2] = (mins[2] + maxs[2] - sv_areagrid_size[2]) * 0.5f;
147         sv_areagrid_maxs[0] = (mins[0] + maxs[0] + sv_areagrid_size[0]) * 0.5f;
148         sv_areagrid_maxs[1] = (mins[1] + maxs[1] + sv_areagrid_size[1]) * 0.5f;
149         sv_areagrid_maxs[2] = (mins[2] + maxs[2] + sv_areagrid_size[2]) * 0.5f;
150         // now calculate the actual useful info from that
151         VectorNegate(sv_areagrid_mins, sv_areagrid_bias);
152         sv_areagrid_scale[0] = AREA_GRID / sv_areagrid_size[0];
153         sv_areagrid_scale[1] = AREA_GRID / sv_areagrid_size[1];
154         sv_areagrid_scale[2] = AREA_GRID / sv_areagrid_size[2];
155         for (i = 0;i < AREA_GRIDNODES;i++)
156         {
157                 ClearLink (&sv_areagrid[i].trigger_edicts);
158                 ClearLink (&sv_areagrid[i].solid_edicts);
159         }
160         Con_DPrintf("sv_areagrid settings: divisions %ix%ix1 : box %f %f %f : %f %f %f size %f %f %f grid %f %f %f (mingrid %f)\n", AREA_GRID, AREA_GRID, sv_areagrid_mins[0], sv_areagrid_mins[1], sv_areagrid_mins[2], sv_areagrid_maxs[0], sv_areagrid_maxs[1], sv_areagrid_maxs[2], sv_areagrid_size[0], sv_areagrid_size[1], sv_areagrid_size[2], 1.0f / sv_areagrid_scale[0], 1.0f / sv_areagrid_scale[1], 1.0f / sv_areagrid_scale[2], sv_areagrid_mingridsize.value);
161 }
162
163 /*
164 ===============
165 SV_ClearWorld
166
167 ===============
168 */
169 void SV_ClearWorld (void)
170 {
171         Mod_CheckLoaded(sv.worldmodel);
172         SV_CreateAreaGrid(sv.worldmodel->normalmins, sv.worldmodel->normalmaxs);
173 }
174
175
176 /*
177 ===============
178 SV_UnlinkEdict
179
180 ===============
181 */
182 void SV_UnlinkEdict (edict_t *ent)
183 {
184         int i;
185         for (i = 0;i < ENTITYGRIDAREAS;i++)
186         {
187                 if (ent->areagrid[i].prev)
188                 {
189                         RemoveLink (&ent->areagrid[i]);
190                         ent->areagrid[i].prev = ent->areagrid[i].next = NULL;
191                 }
192         }
193 }
194
195
196 void SV_TouchAreaGrid(edict_t *ent)
197 {
198         link_t *l, *next;
199         edict_t *touch;
200         areagrid_t *grid;
201         int old_self, old_other, igrid[3], igridmins[3], igridmaxs[3];
202
203         sv_areagrid_marknumber++;
204         igridmins[0] = (int) ((ent->v->absmin[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]);
205         igridmins[1] = (int) ((ent->v->absmin[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]);
206         //igridmins[2] = (int) ((ent->v->absmin[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]);
207         igridmaxs[0] = (int) ((ent->v->absmax[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]) + 1;
208         igridmaxs[1] = (int) ((ent->v->absmax[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]) + 1;
209         //igridmaxs[2] = (int) ((ent->v->absmax[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]) + 1;
210         igridmins[0] = max(0, igridmins[0]);
211         igridmins[1] = max(0, igridmins[1]);
212         //igridmins[2] = max(0, igridmins[2]);
213         igridmaxs[0] = min(AREA_GRID, igridmaxs[0]);
214         igridmaxs[1] = min(AREA_GRID, igridmaxs[1]);
215         //igridmaxs[2] = min(AREA_GRID, igridmaxs[2]);
216
217         for (l = sv_areagrid_outside.trigger_edicts.next;l != &sv_areagrid_outside.trigger_edicts;l = next)
218         {
219                 next = l->next;
220                 touch = EDICT_NUM(l->entitynumber);
221                 if (ent->v->absmin[0] > touch->v->absmax[0]
222                  || ent->v->absmax[0] < touch->v->absmin[0]
223                  || ent->v->absmin[1] > touch->v->absmax[1]
224                  || ent->v->absmax[1] < touch->v->absmin[1]
225                  || ent->v->absmin[2] > touch->v->absmax[2]
226                  || ent->v->absmax[2] < touch->v->absmin[2])
227                         continue;
228                 if (touch == ent)
229                         continue;
230                 if (!touch->v->touch || touch->v->solid != SOLID_TRIGGER)
231                         continue;
232                 old_self = pr_global_struct->self;
233                 old_other = pr_global_struct->other;
234
235                 pr_global_struct->self = EDICT_TO_PROG(touch);
236                 pr_global_struct->other = EDICT_TO_PROG(ent);
237                 pr_global_struct->time = sv.time;
238                 PR_ExecuteProgram (touch->v->touch, "");
239
240                 pr_global_struct->self = old_self;
241                 pr_global_struct->other = old_other;
242         }
243
244         for (igrid[1] = igridmins[1];igrid[1] < igridmaxs[1];igrid[1]++)
245         {
246                 grid = sv_areagrid + igrid[1] * AREA_GRID + igridmins[0];
247                 for (igrid[0] = igridmins[0];igrid[0] < igridmaxs[0];igrid[0]++, grid++)
248                 {
249                         for (l = grid->trigger_edicts.next;l != &grid->trigger_edicts;l = next)
250                         {
251                                 next = l->next;
252                                 touch = EDICT_NUM(l->entitynumber);
253                                 if (touch->areagridmarknumber == sv_areagrid_marknumber)
254                                         continue;
255                                 touch->areagridmarknumber = sv_areagrid_marknumber;
256                                 if (ent->v->absmin[0] > touch->v->absmax[0]
257                                  || ent->v->absmax[0] < touch->v->absmin[0]
258                                  || ent->v->absmin[1] > touch->v->absmax[1]
259                                  || ent->v->absmax[1] < touch->v->absmin[1]
260                                  || ent->v->absmin[2] > touch->v->absmax[2]
261                                  || ent->v->absmax[2] < touch->v->absmin[2])
262                                         continue;
263                                 if (touch == ent)
264                                         continue;
265                                 if (!touch->v->touch || touch->v->solid != SOLID_TRIGGER)
266                                         continue;
267                                 old_self = pr_global_struct->self;
268                                 old_other = pr_global_struct->other;
269
270                                 pr_global_struct->self = EDICT_TO_PROG(touch);
271                                 pr_global_struct->other = EDICT_TO_PROG(ent);
272                                 pr_global_struct->time = sv.time;
273                                 PR_ExecuteProgram (touch->v->touch, "");
274
275                                 pr_global_struct->self = old_self;
276                                 pr_global_struct->other = old_other;
277                         }
278                 }
279         }
280 }
281
282 void SV_LinkEdict_AreaGrid(edict_t *ent)
283 {
284         areagrid_t *grid;
285         int igrid[3], igridmins[3], igridmaxs[3], gridnum;
286
287         igridmins[0] = (int) ((ent->v->absmin[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]);
288         igridmins[1] = (int) ((ent->v->absmin[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]);
289         //igridmins[2] = (int) ((ent->v->absmin[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]);
290         igridmaxs[0] = (int) ((ent->v->absmax[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]) + 1;
291         igridmaxs[1] = (int) ((ent->v->absmax[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]) + 1;
292         //igridmaxs[2] = (int) ((ent->v->absmax[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]) + 1;
293         if (igridmins[0] < 0 || igridmaxs[0] > AREA_GRID || igridmins[1] < 0 || igridmaxs[1] > AREA_GRID || ((igridmaxs[0] - igridmins[0]) * (igridmaxs[1] - igridmins[1])) > ENTITYGRIDAREAS)
294         {
295                 // wow, something outside the grid, store it as such
296                 if (ent->v->solid == SOLID_TRIGGER)
297                         InsertLinkBefore (&ent->areagrid[0], &sv_areagrid_outside.trigger_edicts, NUM_FOR_EDICT(ent));
298                 else
299                         InsertLinkBefore (&ent->areagrid[0], &sv_areagrid_outside.solid_edicts, NUM_FOR_EDICT(ent));
300                 return;
301         }
302
303         gridnum = 0;
304         for (igrid[1] = igridmins[1];igrid[1] < igridmaxs[1];igrid[1]++)
305         {
306                 grid = sv_areagrid + igrid[1] * AREA_GRID + igridmins[0];
307                 for (igrid[0] = igridmins[0];igrid[0] < igridmaxs[0];igrid[0]++, grid++, gridnum++)
308                 {
309                         if (ent->v->solid == SOLID_TRIGGER)
310                                 InsertLinkBefore (&ent->areagrid[gridnum], &grid->trigger_edicts, NUM_FOR_EDICT(ent));
311                         else
312                                 InsertLinkBefore (&ent->areagrid[gridnum], &grid->solid_edicts, NUM_FOR_EDICT(ent));
313                 }
314         }
315 }
316
317 /*
318 ===============
319 SV_LinkEdict
320
321 ===============
322 */
323 void SV_LinkEdict (edict_t *ent, qboolean touch_triggers)
324 {
325         model_t *model;
326
327         if (ent->areagrid[0].prev)
328                 SV_UnlinkEdict (ent);   // unlink from old position
329
330         if (ent == sv.edicts)
331                 return;         // don't add the world
332
333         if (ent->free)
334                 return;
335
336 // set the abs box
337
338         if (ent->v->solid == SOLID_BSP)
339         {
340                 if (ent->v->modelindex < 0 || ent->v->modelindex > MAX_MODELS)
341                         Host_Error("SOLID_BSP with invalid modelindex!\n");
342                 model = sv.models[(int) ent->v->modelindex];
343                 if (model != NULL)
344                 {
345                         if (model->type != mod_brush)
346                                 Host_Error("SOLID_BSP with non-BSP model\n");
347
348                         if (ent->v->angles[0] || ent->v->angles[2] || ent->v->avelocity[0] || ent->v->avelocity[2])
349                         {
350                                 VectorAdd(ent->v->origin, model->rotatedmins, ent->v->absmin);
351                                 VectorAdd(ent->v->origin, model->rotatedmaxs, ent->v->absmax);
352                         }
353                         else if (ent->v->angles[1] || ent->v->avelocity[1])
354                         {
355                                 VectorAdd(ent->v->origin, model->yawmins, ent->v->absmin);
356                                 VectorAdd(ent->v->origin, model->yawmaxs, ent->v->absmax);
357                         }
358                         else
359                         {
360                                 VectorAdd(ent->v->origin, model->normalmins, ent->v->absmin);
361                                 VectorAdd(ent->v->origin, model->normalmaxs, ent->v->absmax);
362                         }
363                 }
364                 else
365                 {
366                         // SOLID_BSP with no model is valid, mainly because some QC setup code does so temporarily
367                         VectorAdd(ent->v->origin, ent->v->mins, ent->v->absmin);
368                         VectorAdd(ent->v->origin, ent->v->maxs, ent->v->absmax);
369                 }
370         }
371         else
372         {
373                 VectorAdd(ent->v->origin, ent->v->mins, ent->v->absmin);
374                 VectorAdd(ent->v->origin, ent->v->maxs, ent->v->absmax);
375         }
376
377 //
378 // to make items easier to pick up and allow them to be grabbed off
379 // of shelves, the abs sizes are expanded
380 //
381         if ((int)ent->v->flags & FL_ITEM)
382         {
383                 ent->v->absmin[0] -= 15;
384                 ent->v->absmin[1] -= 15;
385                 ent->v->absmin[2] -= 1;
386                 ent->v->absmax[0] += 15;
387                 ent->v->absmax[1] += 15;
388                 ent->v->absmax[2] += 1;
389         }
390         else
391         {
392                 // because movement is clipped an epsilon away from an actual edge,
393                 // we must fully check even when bounding boxes don't quite touch
394                 ent->v->absmin[0] -= 1;
395                 ent->v->absmin[1] -= 1;
396                 ent->v->absmin[2] -= 1;
397                 ent->v->absmax[0] += 1;
398                 ent->v->absmax[1] += 1;
399                 ent->v->absmax[2] += 1;
400         }
401
402         if (ent->v->solid == SOLID_NOT)
403                 return;
404
405         SV_LinkEdict_AreaGrid(ent);
406
407 // if touch_triggers, touch all entities at this node and descend for more
408         if (touch_triggers)
409                 SV_TouchAreaGrid(ent);
410 }
411
412
413
414 /*
415 ===============================================================================
416
417 POINT TESTING IN HULLS
418
419 ===============================================================================
420 */
421
422 /*
423 ============
424 SV_TestEntityPosition
425
426 This could be a lot more efficient...
427 ============
428 */
429 int SV_TestEntityPosition (edict_t *ent)
430 {
431         return SV_Move (ent->v->origin, ent->v->mins, ent->v->maxs, ent->v->origin, MOVE_NORMAL, ent).startsolid;
432 }
433
434
435 /*
436 ===============================================================================
437
438 LINE TESTING IN HULLS
439
440 ===============================================================================
441 */
442
443 /*
444 ==================
445 SV_ClipMoveToEntity
446
447 Handles selection or creation of a clipping hull, and offseting (and
448 eventually rotation) of the end points
449 ==================
450 */
451 trace_t SV_ClipMoveToEntity (edict_t *ent, vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end)
452 {
453         int i;
454         trace_t trace;
455         model_t *model;
456
457         i = ent->v->modelindex;
458         if ((unsigned int) i >= MAX_MODELS)
459                 Host_Error("SV_ClipMoveToEntity: invalid modelindex\n");
460         model = sv.models[i];
461         if (i != 0 && model == NULL)
462                 Host_Error("SV_ClipMoveToEntity: invalid modelindex\n");
463
464         if ((int) ent->v->solid == SOLID_BSP)
465         {
466                 Mod_CheckLoaded(model);
467                 if (model->type != mod_brush)
468                 {
469                         Con_Printf ("SV_ClipMoveToEntity: SOLID_BSP with a non bsp model, entity dump:\n");
470                         ED_Print (ent);
471                         Host_Error ("SV_ClipMoveToEntity: SOLID_BSP with a non bsp model\n");
472                 }
473                 if (ent->v->movetype != MOVETYPE_PUSH)
474                         Host_Error ("SV_ClipMoveToEntity: SOLID_BSP without MOVETYPE_PUSH");
475         }
476
477         if (sv_polygoncollisions.integer && (mins[0] != maxs[0] || mins[1] != maxs[1] || mins[2] != maxs[2]))
478                 Collision_PolygonClipTrace(&trace, ent, model, ent->v->origin, ent->v->angles, ent->v->mins, ent->v->maxs, start, mins, maxs, end);
479         else
480                 Collision_ClipTrace(&trace, ent, model, ent->v->origin, ent->v->angles, ent->v->mins, ent->v->maxs, start, mins, maxs, end);
481
482         return trace;
483 }
484
485 //===========================================================================
486
487 void SV_ClipToNode(moveclip_t *clip, link_t *list)
488 {
489         link_t *l, *next;
490         edict_t *touch;
491         trace_t trace;
492
493         sv_areagrid_stats_nodechecks++;
494         for (l = list->next;l != list;l = next)
495         {
496                 next = l->next;
497                 touch = EDICT_NUM(l->entitynumber);
498                 if (touch->areagridmarknumber == sv_areagrid_marknumber)
499                         continue;
500                 touch->areagridmarknumber = sv_areagrid_marknumber;
501                 sv_areagrid_stats_entitychecks++;
502
503                 if (clip->boxmins[0] > touch->v->absmax[0]
504                  || clip->boxmaxs[0] < touch->v->absmin[0]
505                  || clip->boxmins[1] > touch->v->absmax[1]
506                  || clip->boxmaxs[1] < touch->v->absmin[1]
507                  || clip->boxmins[2] > touch->v->absmax[2]
508                  || clip->boxmaxs[2] < touch->v->absmin[2])
509                         continue;
510
511                 if (clip->type == MOVE_NOMONSTERS && touch->v->solid != SOLID_BSP)
512                         continue;
513
514                 if (touch->v->solid == SOLID_NOT)
515                         continue;
516
517                 if (clip->passedict)
518                 {
519                         if (clip->passedict->v->size[0] && !touch->v->size[0])
520                                 continue;       // points never interact
521                         if (PROG_TO_EDICT(touch->v->owner) == clip->passedict)
522                                 continue;       // don't clip against own missiles
523                         if (PROG_TO_EDICT(clip->passedict->v->owner) == touch)
524                                 continue;       // don't clip against owner
525                         // LordHavoc: corpse code
526                         if (clip->passedict->v->solid == SOLID_CORPSE && (touch->v->solid == SOLID_SLIDEBOX || touch->v->solid == SOLID_CORPSE))
527                                 continue;
528                         if (clip->passedict->v->solid == SOLID_SLIDEBOX && touch->v->solid == SOLID_CORPSE)
529                                 continue;
530                 }
531
532                 if (touch == clip->passedict)
533                         continue;
534                 if (touch->v->solid == SOLID_TRIGGER)
535                 {
536                         ED_Print(touch);
537                         Host_Error ("Trigger in clipping list");
538                 }
539
540                 // might interact, so do an exact clip
541                 if (touch->v->solid == SOLID_BSP)
542                         trace = SV_ClipMoveToEntity (touch, clip->start, clip->hullmins, clip->hullmaxs, clip->end);
543                 else if ((int)touch->v->flags & FL_MONSTER)
544                         trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins2, clip->maxs2, clip->end);
545                 else
546                         trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins, clip->maxs, clip->end);
547                 // LordHavoc: take the 'best' answers from the new trace and combine with existing data
548                 if (trace.allsolid)
549                         clip->trace.allsolid = true;
550                 if (trace.startsolid)
551                 {
552                         clip->trace.startsolid = true;
553                         if (!clip->trace.ent)
554                                 clip->trace.ent = trace.ent;
555                 }
556                 if (trace.inopen)
557                         clip->trace.inopen = true;
558                 if (trace.inwater)
559                         clip->trace.inwater = true;
560                 if (trace.fraction < clip->trace.fraction)
561                 {
562                         clip->trace.fraction = trace.fraction;
563                         VectorCopy(trace.endpos, clip->trace.endpos);
564                         clip->trace.plane = trace.plane;
565                         clip->trace.endcontents = trace.endcontents;
566                         clip->trace.ent = trace.ent;
567                 }
568                 if (clip->trace.allsolid)
569                         return;
570         }
571 }
572
573 /*
574 ====================
575 SV_ClipToAreaGrid
576
577 Mins and maxs enclose the entire area swept by the move
578 ====================
579 */
580 void SV_ClipToAreaGrid(moveclip_t *clip)
581 {
582         areagrid_t *grid;
583         int igrid[3], igridmins[3], igridmaxs[3];
584
585         if (clip->trace.allsolid)
586                 return;
587
588         sv_areagrid_stats_calls++;
589         sv_areagrid_marknumber++;
590         igridmins[0] = (int) ((clip->boxmins[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]);
591         igridmins[1] = (int) ((clip->boxmins[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]);
592         //igridmins[2] = (int) ((clip->boxmins[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]);
593         igridmaxs[0] = (int) ((clip->boxmaxs[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]) + 1;
594         igridmaxs[1] = (int) ((clip->boxmaxs[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]) + 1;
595         //igridmaxs[2] = (int) ((clip->boxmaxs[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]) + 1;
596         igridmins[0] = max(0, igridmins[0]);
597         igridmins[1] = max(0, igridmins[1]);
598         //igridmins[2] = max(0, igridmins[2]);
599         igridmaxs[0] = min(AREA_GRID, igridmaxs[0]);
600         igridmaxs[1] = min(AREA_GRID, igridmaxs[1]);
601         //igridmaxs[2] = min(AREA_GRID, igridmaxs[2]);
602
603         if (sv_areagrid_outside.solid_edicts.next != &sv_areagrid_outside.solid_edicts)
604                 SV_ClipToNode(clip, &sv_areagrid_outside.solid_edicts);
605
606         for (igrid[1] = igridmins[1];igrid[1] < igridmaxs[1];igrid[1]++)
607                 for (grid = sv_areagrid + igrid[1] * AREA_GRID + igridmins[0], igrid[0] = igridmins[0];igrid[0] < igridmaxs[0];igrid[0]++, grid++)
608                         if (grid->solid_edicts.next != &grid->solid_edicts)
609                                 SV_ClipToNode(clip, &grid->solid_edicts);
610 }
611
612
613 /*
614 ==================
615 SV_MoveBounds
616 ==================
617 */
618 void SV_MoveBounds (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, vec3_t boxmins, vec3_t boxmaxs)
619 {
620         if (!sv_debugmove.integer)
621         {
622                 int i;
623
624                 for (i=0 ; i<3 ; i++)
625                 {
626                         if (end[i] > start[i])
627                         {
628                                 boxmins[i] = start[i] + mins[i] - 1;
629                                 boxmaxs[i] = end[i] + maxs[i] + 1;
630                         }
631                         else
632                         {
633                                 boxmins[i] = end[i] + mins[i] - 1;
634                                 boxmaxs[i] = start[i] + maxs[i] + 1;
635                         }
636                 }
637         }
638         else
639         {
640                 // debug to test against everything
641                 boxmins[0] = boxmins[1] = boxmins[2] = -999999999;
642                 boxmaxs[0] = boxmaxs[1] = boxmaxs[2] =  999999999;
643         }
644 }
645
646 /*
647 ==================
648 SV_Move
649 ==================
650 */
651 trace_t SV_Move (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, int type, edict_t *passedict)
652 {
653         moveclip_t      clip;
654         vec3_t          bigmins, bigmaxs;
655         int                     i;
656
657         memset ( &clip, 0, sizeof ( moveclip_t ) );
658
659         VectorCopy(start, clip.start);
660         VectorCopy(end, clip.end);
661         VectorCopy(mins, clip.mins);
662         VectorCopy(maxs, clip.maxs);
663         clip.type = type;
664         clip.passedict = passedict;
665
666         Collision_RoundUpToHullSize(sv.worldmodel, clip.mins, clip.maxs, clip.hullmins, clip.hullmaxs);
667
668         if (type == MOVE_MISSILE)
669         {
670                 // LordHavoc: modified this, was = -15, now = clip.mins[i] - 15
671                 for (i=0 ; i<3 ; i++)
672                 {
673                         clip.mins2[i] = clip.mins[i] - 15;
674                         clip.maxs2[i] = clip.maxs[i] + 15;
675                 }
676         }
677         else
678         {
679                 VectorCopy (clip.mins, clip.mins2);
680                 VectorCopy (clip.maxs, clip.maxs2);
681         }
682
683         bigmins[0] = min(clip.mins2[0], clip.hullmins[0]);
684         bigmaxs[0] = max(clip.maxs2[0], clip.hullmaxs[0]);
685         bigmins[1] = min(clip.mins2[1], clip.hullmins[1]);
686         bigmaxs[1] = max(clip.maxs2[1], clip.hullmaxs[1]);
687         bigmins[2] = min(clip.mins2[2], clip.hullmins[2]);
688         bigmaxs[2] = max(clip.maxs2[2], clip.hullmaxs[2]);
689
690         // clip to world
691         clip.trace = SV_ClipMoveToEntity (sv.edicts, start, mins, maxs, end);
692
693         // clip to entities
694         // create the bounding box of the entire move
695         SV_MoveBounds ( start, bigmins, bigmaxs, end, clip.boxmins, clip.boxmaxs );
696
697         SV_ClipToAreaGrid(&clip);
698
699         return clip.trace;
700 }
701