renamed cl_minfps_expbase to cl_minfps_logbase
[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 void World_Init(void)
33 {
34         Collision_Init();
35 }
36
37 //============================================================================
38
39 // World_ClearLink is used for new headnodes
40 void World_ClearLink (link_t *l)
41 {
42         l->entitynumber = 0;
43         l->prev = l->next = l;
44 }
45
46 void World_RemoveLink (link_t *l)
47 {
48         l->next->prev = l->prev;
49         l->prev->next = l->next;
50 }
51
52 void World_InsertLinkBefore (link_t *l, link_t *before, int entitynumber)
53 {
54         l->entitynumber = entitynumber;
55         l->next = before;
56         l->prev = before->prev;
57         l->prev->next = l;
58         l->next->prev = l;
59 }
60
61 /*
62 ===============================================================================
63
64 ENTITY AREA CHECKING
65
66 ===============================================================================
67 */
68
69 void World_PrintAreaStats(world_t *world, const char *worldname)
70 {
71         Con_Printf("%s areagrid check stats: %d calls %d nodes (%f per call) %d entities (%f per call)\n", worldname, world->areagrid_stats_calls, world->areagrid_stats_nodechecks, (double) world->areagrid_stats_nodechecks / (double) world->areagrid_stats_calls, world->areagrid_stats_entitychecks, (double) world->areagrid_stats_entitychecks / (double) world->areagrid_stats_calls);
72         world->areagrid_stats_calls = 0;
73         world->areagrid_stats_nodechecks = 0;
74         world->areagrid_stats_entitychecks = 0;
75 }
76
77 /*
78 ===============
79 World_Clear
80
81 ===============
82 */
83 void World_Clear(world_t *world)
84 {
85         int i;
86         // the areagrid_marknumber is not allowed to be 0
87         if (world->areagrid_marknumber < 1)
88                 world->areagrid_marknumber = 1;
89         // choose either the world box size, or a larger box to ensure the grid isn't too fine
90         world->areagrid_size[0] = max(world->areagrid_maxs[0] - world->areagrid_mins[0], AREA_GRID * sv_areagrid_mingridsize.value);
91         world->areagrid_size[1] = max(world->areagrid_maxs[1] - world->areagrid_mins[1], AREA_GRID * sv_areagrid_mingridsize.value);
92         world->areagrid_size[2] = max(world->areagrid_maxs[2] - world->areagrid_mins[2], AREA_GRID * sv_areagrid_mingridsize.value);
93         // figure out the corners of such a box, centered at the center of the world box
94         world->areagrid_mins[0] = (world->areagrid_mins[0] + world->areagrid_maxs[0] - world->areagrid_size[0]) * 0.5f;
95         world->areagrid_mins[1] = (world->areagrid_mins[1] + world->areagrid_maxs[1] - world->areagrid_size[1]) * 0.5f;
96         world->areagrid_mins[2] = (world->areagrid_mins[2] + world->areagrid_maxs[2] - world->areagrid_size[2]) * 0.5f;
97         world->areagrid_maxs[0] = (world->areagrid_mins[0] + world->areagrid_maxs[0] + world->areagrid_size[0]) * 0.5f;
98         world->areagrid_maxs[1] = (world->areagrid_mins[1] + world->areagrid_maxs[1] + world->areagrid_size[1]) * 0.5f;
99         world->areagrid_maxs[2] = (world->areagrid_mins[2] + world->areagrid_maxs[2] + world->areagrid_size[2]) * 0.5f;
100         // now calculate the actual useful info from that
101         VectorNegate(world->areagrid_mins, world->areagrid_bias);
102         world->areagrid_scale[0] = AREA_GRID / world->areagrid_size[0];
103         world->areagrid_scale[1] = AREA_GRID / world->areagrid_size[1];
104         world->areagrid_scale[2] = AREA_GRID / world->areagrid_size[2];
105         World_ClearLink(&world->areagrid_outside);
106         for (i = 0;i < AREA_GRIDNODES;i++)
107                 World_ClearLink(&world->areagrid[i]);
108         Con_DPrintf("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, world->areagrid_mins[0], world->areagrid_mins[1], world->areagrid_mins[2], world->areagrid_maxs[0], world->areagrid_maxs[1], world->areagrid_maxs[2], world->areagrid_size[0], world->areagrid_size[1], world->areagrid_size[2], 1.0f / world->areagrid_scale[0], 1.0f / world->areagrid_scale[1], 1.0f / world->areagrid_scale[2], sv_areagrid_mingridsize.value);
109 }
110
111
112 /*
113 ===============
114
115 ===============
116 */
117 void World_UnlinkEdict(prvm_edict_t *ent)
118 {
119         int i;
120         for (i = 0;i < ENTITYGRIDAREAS;i++)
121         {
122                 if (ent->priv.server->areagrid[i].prev)
123                 {
124                         World_RemoveLink (&ent->priv.server->areagrid[i]);
125                         ent->priv.server->areagrid[i].prev = ent->priv.server->areagrid[i].next = NULL;
126                 }
127         }
128 }
129
130 int World_EntitiesInBox(world_t *world, const vec3_t mins, const vec3_t maxs, int maxlist, prvm_edict_t **list)
131 {
132         int numlist;
133         link_t *grid;
134         link_t *l;
135         prvm_edict_t *ent;
136         int igrid[3], igridmins[3], igridmaxs[3];
137
138         // FIXME: if areagrid_marknumber wraps, all entities need their
139         // ent->priv.server->areagridmarknumber reset
140         world->areagrid_stats_calls++;
141         world->areagrid_marknumber++;
142         igridmins[0] = (int) floor((mins[0] + world->areagrid_bias[0]) * world->areagrid_scale[0]);
143         igridmins[1] = (int) floor((mins[1] + world->areagrid_bias[1]) * world->areagrid_scale[1]);
144         //igridmins[2] = (int) ((mins[2] + world->areagrid_bias[2]) * world->areagrid_scale[2]);
145         igridmaxs[0] = (int) floor((maxs[0] + world->areagrid_bias[0]) * world->areagrid_scale[0]) + 1;
146         igridmaxs[1] = (int) floor((maxs[1] + world->areagrid_bias[1]) * world->areagrid_scale[1]) + 1;
147         //igridmaxs[2] = (int) ((maxs[2] + world->areagrid_bias[2]) * world->areagrid_scale[2]) + 1;
148         igridmins[0] = max(0, igridmins[0]);
149         igridmins[1] = max(0, igridmins[1]);
150         //igridmins[2] = max(0, igridmins[2]);
151         igridmaxs[0] = min(AREA_GRID, igridmaxs[0]);
152         igridmaxs[1] = min(AREA_GRID, igridmaxs[1]);
153         //igridmaxs[2] = min(AREA_GRID, igridmaxs[2]);
154
155         numlist = 0;
156         // add entities not linked into areagrid because they are too big or
157         // outside the grid bounds
158         if (world->areagrid_outside.next != &world->areagrid_outside)
159         {
160                 grid = &world->areagrid_outside;
161                 for (l = grid->next;l != grid;l = l->next)
162                 {
163                         ent = PRVM_EDICT_NUM(l->entitynumber);
164                         if (ent->priv.server->areagridmarknumber != world->areagrid_marknumber)
165                         {
166                                 ent->priv.server->areagridmarknumber = world->areagrid_marknumber;
167                                 if (!ent->priv.server->free && BoxesOverlap(mins, maxs, ent->priv.server->areamins, ent->priv.server->areamaxs))
168                                 {
169                                         if (numlist < maxlist)
170                                                 list[numlist] = ent;
171                                         numlist++;
172                                 }
173                                 world->areagrid_stats_entitychecks++;
174                         }
175                 }
176         }
177         // add grid linked entities
178         for (igrid[1] = igridmins[1];igrid[1] < igridmaxs[1];igrid[1]++)
179         {
180                 grid = world->areagrid + igrid[1] * AREA_GRID + igridmins[0];
181                 for (igrid[0] = igridmins[0];igrid[0] < igridmaxs[0];igrid[0]++, grid++)
182                 {
183                         if (grid->next != grid)
184                         {
185                                 for (l = grid->next;l != grid;l = l->next)
186                                 {
187                                         ent = PRVM_EDICT_NUM(l->entitynumber);
188                                         if (ent->priv.server->areagridmarknumber != world->areagrid_marknumber)
189                                         {
190                                                 ent->priv.server->areagridmarknumber = world->areagrid_marknumber;
191                                                 if (!ent->priv.server->free && BoxesOverlap(mins, maxs, ent->priv.server->areamins, ent->priv.server->areamaxs))
192                                                 {
193                                                         if (numlist < maxlist)
194                                                                 list[numlist] = ent;
195                                                         numlist++;
196                                                 }
197                                                 //Con_Printf("%d %f %f %f %f %f %f : %d : %f %f %f %f %f %f\n", BoxesOverlap(mins, maxs, ent->priv.server->areamins, ent->priv.server->areamaxs), ent->priv.server->areamins[0], ent->priv.server->areamins[1], ent->priv.server->areamins[2], ent->priv.server->areamaxs[0], ent->priv.server->areamaxs[1], ent->priv.server->areamaxs[2], PRVM_NUM_FOR_EDICT(ent), mins[0], mins[1], mins[2], maxs[0], maxs[1], maxs[2]);
198                                         }
199                                         world->areagrid_stats_entitychecks++;
200                                 }
201                         }
202                 }
203         }
204         return numlist;
205 }
206
207 void World_LinkEdict_AreaGrid(world_t *world, prvm_edict_t *ent)
208 {
209         link_t *grid;
210         int igrid[3], igridmins[3], igridmaxs[3], gridnum, entitynumber = PRVM_NUM_FOR_EDICT(ent);
211
212         if (entitynumber <= 0 || entitynumber >= prog->max_edicts || PRVM_EDICT_NUM(entitynumber) != ent)
213         {
214                 Con_Printf ("SV_LinkEdict_AreaGrid: invalid edict %p (edicts is %p, edict compared to prog->edicts is %i)\n", ent, prog->edicts, entitynumber);
215                 return;
216         }
217
218         igridmins[0] = (int) floor((ent->priv.server->areamins[0] + world->areagrid_bias[0]) * world->areagrid_scale[0]);
219         igridmins[1] = (int) floor((ent->priv.server->areamins[1] + world->areagrid_bias[1]) * world->areagrid_scale[1]);
220         //igridmins[2] = (int) floor((ent->priv.server->areamins[2] + world->areagrid_bias[2]) * world->areagrid_scale[2]);
221         igridmaxs[0] = (int) floor((ent->priv.server->areamaxs[0] + world->areagrid_bias[0]) * world->areagrid_scale[0]) + 1;
222         igridmaxs[1] = (int) floor((ent->priv.server->areamaxs[1] + world->areagrid_bias[1]) * world->areagrid_scale[1]) + 1;
223         //igridmaxs[2] = (int) floor((ent->priv.server->areamaxs[2] + world->areagrid_bias[2]) * world->areagrid_scale[2]) + 1;
224         if (igridmins[0] < 0 || igridmaxs[0] > AREA_GRID || igridmins[1] < 0 || igridmaxs[1] > AREA_GRID || ((igridmaxs[0] - igridmins[0]) * (igridmaxs[1] - igridmins[1])) > ENTITYGRIDAREAS)
225         {
226                 // wow, something outside the grid, store it as such
227                 World_InsertLinkBefore (&ent->priv.server->areagrid[0], &world->areagrid_outside, entitynumber);
228                 return;
229         }
230
231         gridnum = 0;
232         for (igrid[1] = igridmins[1];igrid[1] < igridmaxs[1];igrid[1]++)
233         {
234                 grid = world->areagrid + igrid[1] * AREA_GRID + igridmins[0];
235                 for (igrid[0] = igridmins[0];igrid[0] < igridmaxs[0];igrid[0]++, grid++, gridnum++)
236                         World_InsertLinkBefore (&ent->priv.server->areagrid[gridnum], grid, entitynumber);
237         }
238 }
239
240 /*
241 ===============
242 World_LinkEdict
243
244 ===============
245 */
246 void World_LinkEdict(world_t *world, prvm_edict_t *ent, const vec3_t mins, const vec3_t maxs)
247 {
248         // unlink from old position first
249         if (ent->priv.server->areagrid[0].prev)
250                 World_UnlinkEdict(ent);
251
252         // don't add the world
253         if (ent == prog->edicts)
254                 return;
255
256         // don't add free entities
257         if (ent->priv.server->free)
258                 return;
259
260         VectorCopy(mins, ent->priv.server->areamins);
261         VectorCopy(maxs, ent->priv.server->areamaxs);
262         World_LinkEdict_AreaGrid(world, ent);
263 }