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 && contr->ranges[range_golem]) |
209 |
{ |
210 |
int i = find_free_spot (contr->ranges[range_golem], newmap, x, y, 1, SIZEOFFREE); |
211 |
|
212 |
if (i < 0) |
213 |
{ |
214 |
contr->ranges[range_golem]->destroy (); |
215 |
contr->ranges[range_golem] = 0; |
216 |
} |
217 |
else |
218 |
{ |
219 |
newmap->insert (contr->ranges[range_golem], x + freearr_x[i], y + freearr_y[i]); |
220 |
|
221 |
contr->ranges[range_golem]->direction = |
222 |
find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y); |
223 |
} |
224 |
} |
225 |
|
226 |
/* since the players map is already loaded, we don't need to worry |
227 |
* about pending objects. |
228 |
*/ |
229 |
remove_all_pets (newmap); |
230 |
} |
231 |
|
232 |
/* process_players1 and process_players2 do all the player related stuff. |
233 |
* I moved it out of process events and process_map. This was to some |
234 |
* extent for debugging as well as to get a better idea of the time used |
235 |
* by the various functions. process_players1() does the processing before |
236 |
* objects have been updated, process_players2() does the processing that |
237 |
* is needed after the players have been updated. |
238 |
*/ |
239 |
static void |
240 |
process_players1 () |
241 |
{ |
242 |
int flag; |
243 |
|
244 |
/* Basically, we keep looping until all the players have done their actions. */ |
245 |
for (flag = 1; flag != 0;) |
246 |
{ |
247 |
flag = 0; |
248 |
for_all_players (pl) |
249 |
{ |
250 |
pl->refcnt_chk (); |
251 |
|
252 |
if (!pl->ob || !pl->ns || !pl->ob->active) |
253 |
continue; |
254 |
|
255 |
if (pl->ob->speed_left > 0 && pl->ns) |
256 |
if (handle_newcs_player (pl->ob)) |
257 |
flag = 1; |
258 |
|
259 |
/* If the player is not actively playing, don't make a |
260 |
* backup save - nothing to save anyway. Plus, the |
261 |
* map may not longer be valid. This can happen when the |
262 |
* player quits - they exist for purposes of tracking on the map, |
263 |
* but don't actually reside on any actual map. |
264 |
*/ |
265 |
if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
266 |
continue; |
267 |
} /* end of for loop for all the players */ |
268 |
} /* for flag */ |
269 |
|
270 |
for_all_players (pl) |
271 |
{ |
272 |
if (!pl->ob || !pl->ns || !pl->ob->active) |
273 |
continue; |
274 |
|
275 |
if (settings.casting_time) |
276 |
{ |
277 |
if (pl->ob->casting_time > 0) |
278 |
{ |
279 |
pl->ob->casting_time--; |
280 |
pl->ob->start_holding = 1; |
281 |
} |
282 |
|
283 |
/* set spell_state so we can update the range in stats field */ |
284 |
if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1)) |
285 |
pl->ob->start_holding = 0; |
286 |
} |
287 |
|
288 |
do_some_living (pl->ob); |
289 |
} |
290 |
} |
291 |
|
292 |
static void |
293 |
process_players2 () |
294 |
{ |
295 |
/* Then check if any players should use weapon-speed instead of speed */ |
296 |
for_all_players (pl) |
297 |
{ |
298 |
/* The code that did weapon_sp handling here was out of place - |
299 |
* this isn't called until after the player has finished there |
300 |
* actions, and is thus out of place. All we do here is bounds |
301 |
* checking. |
302 |
*/ |
303 |
if (pl->has_hit) |
304 |
{ |
305 |
if (pl->ob->speed_left > pl->weapon_sp) |
306 |
pl->ob->speed_left = pl->weapon_sp; |
307 |
|
308 |
/* This needs to be here - if the player is running, we need to |
309 |
* clear this each tick, but new commands are not being received |
310 |
* so execute_newserver_command() is never called |
311 |
*/ |
312 |
pl->has_hit = 0; |
313 |
} |
314 |
else if (pl->ob->speed_left > pl->ob->speed) |
315 |
pl->ob->speed_left = pl->ob->speed; |
316 |
} |
317 |
} |
318 |
|
319 |
void |
320 |
process_events () |
321 |
{ |
322 |
process_players1 (); |
323 |
|
324 |
for_all_actives (op) |
325 |
{ |
326 |
/* Now process op */ |
327 |
if (QUERY_FLAG (op, FLAG_FREED)) |
328 |
{ |
329 |
LOG (llevError, "BUG: process_events(): Free object on list\n"); |
330 |
op->set_speed (0); |
331 |
continue; |
332 |
} |
333 |
|
334 |
/* I've seen occasional crashes due to this - the object is removed, |
335 |
* and thus the map it points to (last map it was on) may be bogus |
336 |
* The real bug is to try to find out the cause of this - someone |
337 |
* is probably calling remove_ob without either an insert_ob or |
338 |
* free_object afterwards, leaving an object dangling. But I'd |
339 |
* rather log this and continue on instead of crashing. |
340 |
* Don't remove players - when a player quits, the object is in |
341 |
* sort of a limbo, of removed, but something we want to keep |
342 |
* around. |
343 |
*/ |
344 |
if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY) |
345 |
{ |
346 |
LOG (llevError, "BUG: process_events(): Removed object on list\n"); |
347 |
char *dump = dump_object (op); |
348 |
LOG (llevError, dump); |
349 |
free (dump); |
350 |
op->destroy (); |
351 |
continue; |
352 |
} |
353 |
|
354 |
if (!op->has_active_speed ()) |
355 |
{ |
356 |
LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
357 |
"but is on active list\n", op->debug_desc (), op->speed); |
358 |
op->set_speed (0); |
359 |
continue; |
360 |
} |
361 |
|
362 |
if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) |
363 |
{ |
364 |
LOG (llevError, "BUG: process_events(): Object without map or " |
365 |
"inventory is on active list: %s (%d)\n", &op->name, op->count); |
366 |
op->set_speed (0); |
367 |
continue; |
368 |
} |
369 |
|
370 |
/* Animate the object. Bug or feature that anim_speed |
371 |
* is based on ticks, and not the creatures speed? |
372 |
*/ |
373 |
if (op->anim_speed && op->last_anim >= op->anim_speed) |
374 |
{ |
375 |
if ((op->type == PLAYER)) |
376 |
animate_object (op, op->facing); |
377 |
else |
378 |
animate_object (op, op->direction); |
379 |
|
380 |
op->last_anim = 1; |
381 |
} |
382 |
else |
383 |
op->last_anim++; |
384 |
|
385 |
if (op->speed_left > 0) |
386 |
{ |
387 |
#if 0 |
388 |
/* I've seen occasional crashes in move_symptom() with it |
389 |
* crashing because op is removed - add some debugging to |
390 |
* track if it is removed at this point. |
391 |
* This unfortunately is a bit too verbose it seems - not sure |
392 |
* why - I think what happens is a map is freed or something and |
393 |
* some objects get 'lost' - removed never to be reclaimed. |
394 |
* removed objects generally shouldn't exist. |
395 |
*/ |
396 |
if (QUERY_FLAG (op, FLAG_REMOVED)) |
397 |
{ |
398 |
LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null"); |
399 |
} |
400 |
#endif |
401 |
--op->speed_left; |
402 |
process_object (op); |
403 |
|
404 |
if (op->destroyed ()) |
405 |
continue; |
406 |
} |
407 |
|
408 |
if (settings.casting_time == TRUE && op->casting_time > 0) |
409 |
op->casting_time--; |
410 |
|
411 |
if (op->speed_left <= 0) |
412 |
op->speed_left += FABS (op->speed); |
413 |
} |
414 |
|
415 |
process_players2 (); |
416 |
} |
417 |
|
418 |
/* clean up everything before exiting */ |
419 |
void |
420 |
emergency_save () |
421 |
{ |
422 |
LOG (llevDebug, "emergency save begin.\n"); |
423 |
|
424 |
cfperl_emergency_save (); |
425 |
|
426 |
LOG (llevDebug, "saving book archive.\n"); |
427 |
write_book_archive (); |
428 |
|
429 |
LOG (llevDebug, "emergency save done.\n"); |
430 |
} |
431 |
|
432 |
// send all clients some informational text |
433 |
static void |
434 |
cleanup_inform (const char *cause, bool make_core) |
435 |
{ |
436 |
int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
437 |
|
438 |
new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); |
439 |
new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s\n", cause); |
440 |
|
441 |
if (make_core) |
442 |
new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.\n"); |
443 |
else |
444 |
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"); |
445 |
|
446 |
new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); |
447 |
|
448 |
flush_sockets (); |
449 |
} |
450 |
|
451 |
/* clean up everything before exiting */ |
452 |
void |
453 |
cleanup (const char *cause, bool make_core) |
454 |
{ |
455 |
if (make_core) |
456 |
fork_abort (cause); |
457 |
|
458 |
LOG (llevError, "cleanup cause: %s\n", cause); |
459 |
|
460 |
if (!make_core) |
461 |
cleanup_inform (cause, make_core); |
462 |
|
463 |
LOG (llevDebug, "cleanup begin.\n"); |
464 |
|
465 |
if (init_done && !in_cleanup) |
466 |
{ |
467 |
in_cleanup = true; |
468 |
emergency_save (); |
469 |
} |
470 |
else |
471 |
in_cleanup = true; |
472 |
|
473 |
LOG (llevDebug, "running cleanup handlers.\n"); |
474 |
INVOKE_GLOBAL (CLEANUP); |
475 |
|
476 |
LOG (llevDebug, "cleanup done.\n"); |
477 |
|
478 |
if (make_core) |
479 |
{ |
480 |
cleanup_inform (cause, make_core); |
481 |
_exit (1); |
482 |
} |
483 |
else |
484 |
{ |
485 |
new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.\n"); |
486 |
new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE "\n"); |
487 |
flush_sockets (); |
488 |
_exit (0); |
489 |
} |
490 |
} |
491 |
|
492 |
int |
493 |
forbid_play (void) |
494 |
{ |
495 |
#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE) |
496 |
char buf[MAX_BUF], day[MAX_BUF]; |
497 |
FILE *fp; |
498 |
time_t clock; |
499 |
struct tm *tm; |
500 |
int i, start, stop, forbit = 0, comp; |
501 |
|
502 |
clock = time (NULL); |
503 |
tm = (struct tm *) localtime (&clock); |
504 |
|
505 |
sprintf (buf, "%s/%s", settings.confdir, PERM_FILE); |
506 |
if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
507 |
return 0; |
508 |
|
509 |
while (fgets (buf, MAX_BUF, fp)) |
510 |
{ |
511 |
if (buf[0] == '#') |
512 |
continue; |
513 |
|
514 |
if (!strncmp (buf, "msg", 3)) |
515 |
{ |
516 |
if (forbit) |
517 |
while (fgets (buf, MAX_BUF, fp)) /* print message */ |
518 |
fputs (buf, logfile); |
519 |
break; |
520 |
} |
521 |
else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
522 |
{ |
523 |
LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
524 |
continue; |
525 |
} |
526 |
|
527 |
for (i = 0; i < 7; i++) |
528 |
{ |
529 |
if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop)) |
530 |
forbit = 1; |
531 |
} |
532 |
} |
533 |
|
534 |
close_and_delete (fp, comp); |
535 |
|
536 |
return forbit; |
537 |
#else |
538 |
return 0; |
539 |
#endif |
540 |
} |
541 |
|
542 |
/* |
543 |
* do_specials() is a collection of functions to call from time to time. |
544 |
* Modified 2000-1-14 MSW to use the global pticks count to determine how |
545 |
* often to do things. This will allow us to spred them out more often. |
546 |
* I use prime numbers for the factor count - in that way, it is less likely |
547 |
* these actions will fall on the same tick (compared to say using 500/2500/15000 |
548 |
* which would mean on that 15,000 tick count a whole bunch of stuff gets |
549 |
* done). Of course, there can still be times where multiple specials are |
550 |
* done on the same tick, but that will happen very infrequently |
551 |
* |
552 |
* I also think this code makes it easier to see how often we really are |
553 |
* doing the various things. |
554 |
*/ |
555 |
|
556 |
extern unsigned long todtick; |
557 |
|
558 |
void |
559 |
do_specials (void) |
560 |
{ |
561 |
if (!(pticks % PTICKS_PER_CLOCK)) |
562 |
tick_the_clock (); |
563 |
|
564 |
if (!(pticks % 7)) |
565 |
shstr::gc (); |
566 |
|
567 |
if (!(pticks % 2503)) |
568 |
fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
569 |
|
570 |
if (!(pticks % 5003)) |
571 |
write_book_archive (); |
572 |
|
573 |
if (!(pticks % 5009)) |
574 |
clean_friendly_list (); |
575 |
|
576 |
if (!(pticks % 5011)) |
577 |
obsolete_parties (); |
578 |
|
579 |
if (!(pticks % 12503)) |
580 |
fix_luck (); |
581 |
} |
582 |
|
583 |
void |
584 |
server_tick () |
585 |
{ |
586 |
// first do the user visible stuff |
587 |
doeric_server (); |
588 |
INVOKE_GLOBAL (CLOCK); |
589 |
process_events (); /* "do" something with objects with speed */ |
590 |
flush_sockets (); |
591 |
|
592 |
// then do some bookkeeping, should not really be here |
593 |
do_specials (); /* Routines called from time to time. */ |
594 |
attachable::check_mortals (); |
595 |
|
596 |
++pticks; |
597 |
} |
598 |
|
599 |
#if 0 |
600 |
// used fro benchmarking (x86/amd64-specific) |
601 |
typedef unsigned long tval; |
602 |
typedef unsigned long long stamp64; |
603 |
|
604 |
extern inline tval |
605 |
stamp (void) |
606 |
{ |
607 |
tval tsc; |
608 |
asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
609 |
|
610 |
return tsc; |
611 |
} |
612 |
|
613 |
extern inline tval |
614 |
measure (tval t) |
615 |
{ |
616 |
tval tsc; |
617 |
asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
618 |
|
619 |
if (tsc > t) |
620 |
return tsc - t; |
621 |
else |
622 |
return t - tsc; |
623 |
} |
624 |
|
625 |
int |
626 |
main (int argc, char **argv) |
627 |
{ |
628 |
rand_gen rg(0); |
629 |
tval fastest = 0x7fffffff; |
630 |
for (int loop = 10000; loop--; ) |
631 |
{ |
632 |
tval s = stamp (); |
633 |
volatile int i = rg.get_int(25); |
634 |
fastest = min (fastest, measure (s)); |
635 |
} |
636 |
|
637 |
//printf ("fastest %d\n", fastest); |
638 |
for (int i = 0; i < 1024*1024*3; ++i) |
639 |
{ |
640 |
char c = rg.get_int (256); |
641 |
write (2, &c, 1); |
642 |
} |
643 |
} |
644 |
|
645 |
#else |
646 |
|
647 |
// normal main |
648 |
int |
649 |
main (int argc, char **argv) |
650 |
{ |
651 |
settings.argc = argc; |
652 |
settings.argv = argv; |
653 |
|
654 |
init (argc, argv); |
655 |
|
656 |
initPlugins (); |
657 |
|
658 |
for (;;) |
659 |
cfperl_main (); |
660 |
} |
661 |
#endif |
662 |
|