1 |
/* |
2 |
* CrossFire, A Multiplayer game |
3 |
* |
4 |
* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
5 |
* Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
6 |
* Copyright (C) 1992 Frank Tore Johansen |
7 |
* |
8 |
* This program is free software; you can redistribute it and/or modify |
9 |
* it under the terms of the GNU General Public License as published by |
10 |
* the Free Software Foundation; either version 2 of the License, or |
11 |
* (at your option) any later version. |
12 |
* |
13 |
* This program is distributed in the hope that it will be useful, |
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
* GNU General Public License for more details. |
17 |
* |
18 |
* You should have received a copy of the GNU General Public License |
19 |
* along with this program; if not, write to the Free Software |
20 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
21 |
* |
22 |
* The authors can be reached via e-mail at <crossfire@schmorp.de> |
23 |
*/ |
24 |
|
25 |
#include <global.h> |
26 |
#include <object.h> |
27 |
#include <tod.h> |
28 |
|
29 |
#include <sproto.h> |
30 |
#include <time.h> |
31 |
|
32 |
#include <../random_maps/random_map.h> |
33 |
#include <../random_maps/rproto.h> |
34 |
#include "path.h" |
35 |
|
36 |
static char days[7][4] = { |
37 |
"Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
38 |
}; |
39 |
|
40 |
void |
41 |
version (object *op) |
42 |
{ |
43 |
if (op) |
44 |
clear_win_info (op); |
45 |
|
46 |
new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); |
47 |
|
48 |
new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
49 |
new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); |
50 |
new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); |
51 |
new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); |
52 |
new_draw_info (NDI_UNIQUE, 0, op, ""); |
53 |
new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:"); |
54 |
new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>"); |
55 |
new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>"); |
56 |
new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>"); |
57 |
new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>"); |
58 |
new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>"); |
59 |
new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>"); |
60 |
new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>"); |
61 |
new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>"); |
62 |
new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>"); |
63 |
new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>"); |
64 |
new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>"); |
65 |
new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>"); |
66 |
new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>"); |
67 |
new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>"); |
68 |
new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>"); |
69 |
new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>"); |
70 |
new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>"); |
71 |
new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>"); |
72 |
new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>"); |
73 |
new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>"); |
74 |
new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>"); |
75 |
new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>"); |
76 |
new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>"); |
77 |
new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>"); |
78 |
new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>"); |
79 |
new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>"); |
80 |
new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>"); |
81 |
new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>"); |
82 |
new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>"); |
83 |
new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>"); |
84 |
new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>"); |
85 |
new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>"); |
86 |
new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>"); |
87 |
new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>"); |
88 |
new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>"); |
89 |
new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>"); |
90 |
new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>"); |
91 |
new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>"); |
92 |
new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>"); |
93 |
new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n"); |
94 |
new_draw_info (NDI_UNIQUE, 0, op, ""); |
95 |
new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
96 |
new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
97 |
new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>"); |
98 |
new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>"); |
99 |
new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>"); |
100 |
new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); |
101 |
new_draw_info (NDI_UNIQUE, 0, op, ""); |
102 |
new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
103 |
} |
104 |
|
105 |
/* This is a basic little function to put the player back to his |
106 |
* savebed. We do some error checking - its possible that the |
107 |
* savebed map may no longer exist, so we make sure the player |
108 |
* goes someplace. |
109 |
*/ |
110 |
void |
111 |
enter_player_savebed (object *op) |
112 |
{ |
113 |
object *tmp = object::create (); |
114 |
EXIT_PATH (tmp) = op->contr->savebed_map; |
115 |
EXIT_X (tmp) = op->contr->bed_x; |
116 |
EXIT_Y (tmp) = op->contr->bed_y; |
117 |
op->enter_exit (tmp); |
118 |
tmp->destroy (); |
119 |
} |
120 |
|
121 |
/* |
122 |
* enter_map(): Moves the player and pets from current map (if any) to |
123 |
* new map. map, x, y must be set. map is the map we are moving the |
124 |
* player to - it could be the map he just came from if the load failed for |
125 |
* whatever reason. If default map coordinates are to be used, then |
126 |
* the function that calls this should figure them out. |
127 |
*/ |
128 |
void |
129 |
object::enter_map (maptile *newmap, int x, int y) |
130 |
{ |
131 |
if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) |
132 |
return; |
133 |
|
134 |
if (out_of_map (newmap, x, y)) |
135 |
{ |
136 |
LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
137 |
x = newmap->enter_x; |
138 |
y = newmap->enter_y; |
139 |
if (out_of_map (newmap, x, y)) |
140 |
{ |
141 |
LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", |
142 |
&newmap->path, x, y, newmap->width, newmap->height); |
143 |
new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
144 |
return; |
145 |
} |
146 |
} |
147 |
|
148 |
if (contr && map != newmap && map) |
149 |
if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
150 |
return; |
151 |
|
152 |
// remove, so stupid ob_locked does not trigger a failure |
153 |
remove (); |
154 |
|
155 |
/* try to find a spot for the player */ |
156 |
if (ob_blocked (this, newmap, x, y)) |
157 |
{ /* First choice blocked */ |
158 |
/* We try to find a spot for the player, starting closest in. |
159 |
* We could use find_first_free_spot, but that doesn't randomize it at all, |
160 |
* So for example, if the north space is free, you would always end up there even |
161 |
* if other spaces around are available. |
162 |
* Note that for the second and third calls, we could start at a position other |
163 |
* than one, but then we could end up on the other side of walls and so forth. |
164 |
*/ |
165 |
int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); |
166 |
|
167 |
if (i == -1) |
168 |
{ |
169 |
i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
170 |
if (i == -1) |
171 |
i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
172 |
} |
173 |
|
174 |
if (i != -1) |
175 |
{ |
176 |
x += freearr_x[i]; |
177 |
y += freearr_y[i]; |
178 |
} |
179 |
else |
180 |
/* not much we can do in this case. */ |
181 |
LOG (llevInfo, "enter_map: Could not find free spot for player - will dump on top of object (%s: %d, %d)\n", &newmap->path, x, y); |
182 |
} |
183 |
|
184 |
if (contr && map != newmap) |
185 |
{ |
186 |
if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
187 |
return; |
188 |
|
189 |
if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
190 |
return; |
191 |
} |
192 |
|
193 |
this->x = x; |
194 |
this->y = y; |
195 |
map = newmap; |
196 |
|
197 |
insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
198 |
|
199 |
enemy = 0; |
200 |
|
201 |
if (contr) |
202 |
{ |
203 |
contr->maplevel = newmap->path; |
204 |
contr->count = 0; |
205 |
} |
206 |
|
207 |
/* Update any golems */ |
208 |
if (type == PLAYER) |
209 |
if (object *golem = contr->golem) |
210 |
{ |
211 |
int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
212 |
|
213 |
if (i < 0) |
214 |
golem->destroy (); |
215 |
else |
216 |
{ |
217 |
newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
218 |
golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
219 |
} |
220 |
} |
221 |
|
222 |
/* since the players map is already loaded, we don't need to worry |
223 |
* about pending objects. |
224 |
*/ |
225 |
remove_all_pets (newmap); |
226 |
} |
227 |
|
228 |
/* process_players1 and process_players2 do all the player related stuff. |
229 |
* I moved it out of process events and process_map. This was to some |
230 |
* extent for debugging as well as to get a better idea of the time used |
231 |
* by the various functions. process_players1() does the processing before |
232 |
* objects have been updated, process_players2() does the processing that |
233 |
* is needed after the players have been updated. |
234 |
*/ |
235 |
static void |
236 |
process_players1 () |
237 |
{ |
238 |
/* Basically, we keep looping until all the players have done their actions. */ |
239 |
for (int flag = 1; flag != 0;) |
240 |
{ |
241 |
flag = 0; |
242 |
for_all_players (pl) |
243 |
{ |
244 |
pl->refcnt_chk (); |
245 |
|
246 |
if (!pl->ob || !pl->ns || !pl->ob->active) |
247 |
continue; |
248 |
|
249 |
if (pl->ob->speed_left > 0.f && pl->ns) |
250 |
if (handle_newcs_player (pl->ob)) |
251 |
flag = 1; |
252 |
|
253 |
/* If the player is not actively playing, don't make a |
254 |
* backup save - nothing to save anyway. Plus, the |
255 |
* map may not longer be valid. This can happen when the |
256 |
* player quits - they exist for purposes of tracking on the map, |
257 |
* but don't actually reside on any actual map. |
258 |
*/ |
259 |
if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
260 |
continue; |
261 |
} /* end of for loop for all the players */ |
262 |
} /* for flag */ |
263 |
|
264 |
for_all_players (pl) |
265 |
{ |
266 |
object *ob = pl->ob; |
267 |
|
268 |
if (!ob || !pl->ns || !ob->active) |
269 |
continue; |
270 |
|
271 |
// process_events might steal us one speed slot, so adjust accordingly |
272 |
if (ob->speed_left > 0.f) |
273 |
++ob->speed_left; |
274 |
|
275 |
do_some_living (ob); |
276 |
} |
277 |
} |
278 |
|
279 |
static void |
280 |
process_players2 () |
281 |
{ |
282 |
/* Then check if any players should use weapon-speed instead of speed */ |
283 |
for_all_players (pl) |
284 |
{ |
285 |
if (pl->has_hit) |
286 |
{ |
287 |
pl->ob->speed_left = min (pl->weapon_sp, pl->ob->speed_left + pl->weapon_sp); |
288 |
|
289 |
if (pl->ob->speed_left > 0.f) |
290 |
pl->has_hit = 0; |
291 |
} |
292 |
else |
293 |
pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
294 |
} |
295 |
} |
296 |
|
297 |
void |
298 |
process_events () |
299 |
{ |
300 |
process_players1 (); |
301 |
|
302 |
for_all_actives (op) |
303 |
{ |
304 |
/* Now process op */ |
305 |
if (QUERY_FLAG (op, FLAG_FREED)) |
306 |
{ |
307 |
LOG (llevError, "BUG: process_events(): Free object on list\n"); |
308 |
op->set_speed (0); |
309 |
continue; |
310 |
} |
311 |
|
312 |
if (!op->has_active_speed ()) |
313 |
{ |
314 |
LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
315 |
"but is on active list\n", op->debug_desc (), op->speed); |
316 |
op->set_speed (0); |
317 |
continue; |
318 |
} |
319 |
|
320 |
if (op->flag [FLAG_REMOVED]) |
321 |
{ |
322 |
LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
323 |
op->debug_desc ()); |
324 |
op->set_speed (0); |
325 |
continue; |
326 |
} |
327 |
|
328 |
/* Animate the object. Bug or feature that anim_speed |
329 |
* is based on ticks, and not the creatures speed? |
330 |
*/ |
331 |
if (op->anim_speed && op->last_anim >= op->anim_speed) |
332 |
{ |
333 |
animate_object (op, op->contr ? op->facing : op->direction); |
334 |
op->last_anim = 1; |
335 |
} |
336 |
else |
337 |
++op->last_anim; |
338 |
|
339 |
if (op->speed_left > 0.f) |
340 |
{ |
341 |
--op->speed_left; |
342 |
process_object (op); |
343 |
|
344 |
if (op->destroyed ()) |
345 |
continue; |
346 |
} |
347 |
|
348 |
if (!op->contr) |
349 |
op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
350 |
} |
351 |
|
352 |
process_players2 (); |
353 |
} |
354 |
|
355 |
/* clean up everything before exiting */ |
356 |
void |
357 |
emergency_save () |
358 |
{ |
359 |
LOG (llevDebug, "emergency save begin.\n"); |
360 |
|
361 |
cfperl_emergency_save (); |
362 |
|
363 |
LOG (llevDebug, "saving book archive.\n"); |
364 |
write_book_archive (); |
365 |
|
366 |
LOG (llevDebug, "emergency save done.\n"); |
367 |
} |
368 |
|
369 |
// send all clients some informational text |
370 |
static void |
371 |
cleanup_inform (const char *cause, bool make_core) |
372 |
{ |
373 |
int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
374 |
|
375 |
new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); |
376 |
new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s\n", cause); |
377 |
|
378 |
if (make_core) |
379 |
new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.\n"); |
380 |
else |
381 |
new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.\n"); |
382 |
|
383 |
new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); |
384 |
|
385 |
flush_sockets (); |
386 |
} |
387 |
|
388 |
/* clean up everything before exiting */ |
389 |
void |
390 |
cleanup (const char *cause, bool make_core) |
391 |
{ |
392 |
if (make_core) |
393 |
fork_abort (cause); |
394 |
|
395 |
LOG (llevError, "cleanup cause: %s\n", cause); |
396 |
|
397 |
if (!make_core) |
398 |
cleanup_inform (cause, make_core); |
399 |
|
400 |
LOG (llevDebug, "cleanup begin.\n"); |
401 |
|
402 |
if (init_done && !in_cleanup) |
403 |
{ |
404 |
in_cleanup = true; |
405 |
emergency_save (); |
406 |
} |
407 |
else |
408 |
in_cleanup = true; |
409 |
|
410 |
LOG (llevDebug, "running cleanup handlers.\n"); |
411 |
INVOKE_GLOBAL (CLEANUP); |
412 |
|
413 |
LOG (llevDebug, "cleanup done.\n"); |
414 |
|
415 |
if (make_core) |
416 |
{ |
417 |
cleanup_inform (cause, make_core); |
418 |
cfperl_cleanup (make_core); |
419 |
_exit (1); |
420 |
} |
421 |
else |
422 |
{ |
423 |
new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.\n"); |
424 |
new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE "\n"); |
425 |
flush_sockets (); |
426 |
cfperl_cleanup (make_core); |
427 |
_exit (0); |
428 |
} |
429 |
} |
430 |
|
431 |
int |
432 |
forbid_play (void) |
433 |
{ |
434 |
#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE) |
435 |
char buf[MAX_BUF], day[MAX_BUF]; |
436 |
FILE *fp; |
437 |
time_t clock; |
438 |
struct tm *tm; |
439 |
int i, start, stop, forbit = 0, comp; |
440 |
|
441 |
clock = time (NULL); |
442 |
tm = (struct tm *) localtime (&clock); |
443 |
|
444 |
sprintf (buf, "%s/%s", settings.confdir, PERM_FILE); |
445 |
if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
446 |
return 0; |
447 |
|
448 |
while (fgets (buf, MAX_BUF, fp)) |
449 |
{ |
450 |
if (buf[0] == '#') |
451 |
continue; |
452 |
|
453 |
if (!strncmp (buf, "msg", 3)) |
454 |
{ |
455 |
if (forbit) |
456 |
while (fgets (buf, MAX_BUF, fp)) /* print message */ |
457 |
fputs (buf, logfile); |
458 |
break; |
459 |
} |
460 |
else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
461 |
{ |
462 |
LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
463 |
continue; |
464 |
} |
465 |
|
466 |
for (i = 0; i < 7; i++) |
467 |
{ |
468 |
if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop)) |
469 |
forbit = 1; |
470 |
} |
471 |
} |
472 |
|
473 |
close_and_delete (fp, comp); |
474 |
|
475 |
return forbit; |
476 |
#else |
477 |
return 0; |
478 |
#endif |
479 |
} |
480 |
|
481 |
/* |
482 |
* do_specials() is a collection of functions to call from time to time. |
483 |
* Modified 2000-1-14 MSW to use the global pticks count to determine how |
484 |
* often to do things. This will allow us to spred them out more often. |
485 |
* I use prime numbers for the factor count - in that way, it is less likely |
486 |
* these actions will fall on the same tick (compared to say using 500/2500/15000 |
487 |
* which would mean on that 15,000 tick count a whole bunch of stuff gets |
488 |
* done). Of course, there can still be times where multiple specials are |
489 |
* done on the same tick, but that will happen very infrequently |
490 |
* |
491 |
* I also think this code makes it easier to see how often we really are |
492 |
* doing the various things. |
493 |
*/ |
494 |
void |
495 |
do_specials (void) |
496 |
{ |
497 |
if (!(pticks % TICKS_PER_HOUR)) |
498 |
adjust_daylight (); |
499 |
|
500 |
if (!(pticks % 7)) |
501 |
shstr::gc (); |
502 |
|
503 |
if (!(pticks % 2503)) |
504 |
fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
505 |
|
506 |
if (!(pticks % 5003)) |
507 |
write_book_archive (); |
508 |
|
509 |
if (!(pticks % 5009)) |
510 |
clean_friendly_list (); |
511 |
|
512 |
if (!(pticks % 5011)) |
513 |
obsolete_parties (); |
514 |
|
515 |
if (!(pticks % 12503)) |
516 |
fix_luck (); |
517 |
} |
518 |
|
519 |
void |
520 |
server_tick () |
521 |
{ |
522 |
// first do the user visible stuff |
523 |
doeric_server (); |
524 |
INVOKE_GLOBAL (CLOCK); |
525 |
process_events (); /* "do" something with objects with speed */ |
526 |
flush_sockets (); |
527 |
|
528 |
// then do some bookkeeping, should not really be here |
529 |
do_specials (); /* Routines called from time to time. */ |
530 |
attachable::check_mortals (); |
531 |
|
532 |
++pticks; |
533 |
} |
534 |
|
535 |
#if 0 |
536 |
// used fro benchmarking (x86/amd64-specific) |
537 |
typedef unsigned long tval; |
538 |
typedef unsigned long long stamp64; |
539 |
|
540 |
extern inline tval |
541 |
stamp (void) |
542 |
{ |
543 |
tval tsc; |
544 |
asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
545 |
|
546 |
return tsc; |
547 |
} |
548 |
|
549 |
extern inline tval |
550 |
measure (tval t) |
551 |
{ |
552 |
tval tsc; |
553 |
asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
554 |
|
555 |
if (tsc > t) |
556 |
return tsc - t; |
557 |
else |
558 |
return t - tsc; |
559 |
} |
560 |
|
561 |
int |
562 |
main (int argc, char **argv) |
563 |
{ |
564 |
rand_gen rg(0); |
565 |
tval fastest = 0x7fffffff; |
566 |
for (int loop = 10000; loop--; ) |
567 |
{ |
568 |
tval s = stamp (); |
569 |
volatile int i = rg.get_int(25); |
570 |
fastest = min (fastest, measure (s)); |
571 |
} |
572 |
|
573 |
//printf ("fastest %d\n", fastest); |
574 |
for (int i = 0; i < 1024*1024*3; ++i) |
575 |
{ |
576 |
char c = rg.get_int (256); |
577 |
write (2, &c, 1); |
578 |
} |
579 |
} |
580 |
|
581 |
#else |
582 |
|
583 |
// normal main |
584 |
int |
585 |
main (int argc, char **argv) |
586 |
{ |
587 |
settings.argc = argc; |
588 |
settings.argv = argv; |
589 |
|
590 |
init (argc, argv); |
591 |
|
592 |
initPlugins (); |
593 |
|
594 |
for (;;) |
595 |
cfperl_main (); |
596 |
} |
597 |
#endif |
598 |
|