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