1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * 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 | * 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 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * 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 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
25 | #include <object.h> |
26 | #include <object.h> |
26 | #include <tod.h> |
27 | #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 | |
28 | |
36 | #include <sproto.h> |
29 | #include <sproto.h> |
37 | #include <time.h> |
30 | #include <time.h> |
38 | |
31 | |
39 | #include <../random_maps/random_map.h> |
32 | #include <../random_maps/random_map.h> |
… | |
… | |
54 | |
47 | |
55 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
48 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
56 | new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); |
49 | new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); |
57 | new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); |
50 | new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); |
58 | new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); |
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:"); |
59 | new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>"); |
54 | new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>"); |
60 | new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>"); |
55 | new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>"); |
61 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>"); |
56 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>"); |
62 | new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>"); |
57 | new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>"); |
63 | new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>"); |
58 | new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>"); |
… | |
… | |
94 | new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>"); |
89 | new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>"); |
95 | new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>"); |
90 | new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>"); |
96 | new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>"); |
91 | new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>"); |
97 | new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>"); |
92 | new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>"); |
98 | new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n"); |
93 | new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n"); |
99 | |
94 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
100 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
95 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
101 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
96 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
102 | new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>"); |
97 | new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>"); |
103 | new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>"); |
98 | new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>"); |
104 | new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>"); |
99 | new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>"); |
105 | new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); |
100 | new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); |
|
|
101 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
106 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
102 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
107 | } |
103 | } |
108 | |
104 | |
109 | /* This is a basic little function to put the player back to his |
105 | /* This is a basic little function to put the player back to his |
110 | * savebed. We do some error checking - its possible that the |
106 | * savebed. We do some error checking - its possible that the |
… | |
… | |
130 | * the function that calls this should figure them out. |
126 | * the function that calls this should figure them out. |
131 | */ |
127 | */ |
132 | void |
128 | void |
133 | object::enter_map (maptile *newmap, int x, int y) |
129 | object::enter_map (maptile *newmap, int x, int y) |
134 | { |
130 | { |
135 | if (destroyed () || !newmap) |
131 | if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) |
136 | return; |
132 | return; |
137 | |
133 | |
138 | if (out_of_map (newmap, x, y)) |
134 | if (out_of_map (newmap, x, y)) |
139 | { |
135 | { |
140 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
136 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
… | |
… | |
147 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
143 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
148 | return; |
144 | return; |
149 | } |
145 | } |
150 | } |
146 | } |
151 | |
147 | |
152 | if (map && map != newmap) |
148 | if (contr && map != newmap && map) |
153 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
149 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
154 | return; |
150 | return; |
155 | |
151 | |
156 | /* If it is a player login, he has yet to be inserted anyplace. |
152 | // remove, so stupid ob_locked does not trigger a failure |
157 | * otherwise, we need to deal with removing the player here. |
|
|
158 | */ |
|
|
159 | remove (); |
153 | remove (); |
160 | |
154 | |
161 | /* try to find a spot for the player */ |
155 | /* try to find a spot for the player */ |
162 | if (ob_blocked (this, newmap, x, y)) |
156 | if (ob_blocked (this, newmap, x, y)) |
163 | { /* First choice blocked */ |
157 | { /* First choice blocked */ |
… | |
… | |
185 | else |
179 | else |
186 | /* not much we can do in this case. */ |
180 | /* not much we can do in this case. */ |
187 | 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); |
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); |
188 | } |
182 | } |
189 | |
183 | |
190 | if (map != newmap && contr) |
184 | if (contr && map != newmap) |
191 | { |
185 | { |
192 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
186 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
193 | return; |
187 | return; |
194 | |
188 | |
195 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
189 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
… | |
… | |
200 | this->y = y; |
194 | this->y = y; |
201 | map = newmap; |
195 | map = newmap; |
202 | |
196 | |
203 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
197 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
204 | |
198 | |
205 | enemy = NULL; |
199 | enemy = 0; |
206 | |
200 | |
207 | if (contr) |
201 | if (contr) |
208 | { |
202 | { |
209 | contr->maplevel = newmap->path; |
203 | contr->maplevel = newmap->path; |
210 | contr->count = 0; |
204 | contr->count = 0; |
211 | } |
205 | } |
212 | |
206 | |
213 | /* Update any golems */ |
207 | /* Update any golems */ |
214 | if (type == PLAYER && contr->ranges[range_golem]) |
208 | if (type == PLAYER) |
215 | { |
209 | if (object *golem = contr->golem) |
216 | int i = find_free_spot (contr->ranges[range_golem], newmap, |
|
|
217 | x, y, 1, SIZEOFFREE); |
|
|
218 | |
|
|
219 | contr->ranges[range_golem]->remove (); |
|
|
220 | |
|
|
221 | if (i == -1) |
|
|
222 | { |
210 | { |
223 | remove_friendly_object (contr->ranges[range_golem]); |
211 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
224 | contr->ranges[range_golem]->destroy (); |
212 | |
225 | contr->ranges[range_golem] = 0; |
213 | if (i < 0) |
226 | } |
214 | golem->destroy (); |
227 | else |
215 | else |
228 | { |
|
|
229 | for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more) |
|
|
230 | { |
216 | { |
231 | tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.x); |
217 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
232 | tmp->y = y + freearr_y[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.y); |
218 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
233 | tmp->map = newmap; |
|
|
234 | } |
219 | } |
235 | |
|
|
236 | insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0); |
|
|
237 | contr->ranges[range_golem]->direction = |
|
|
238 | find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y); |
|
|
239 | } |
220 | } |
240 | } |
|
|
241 | |
|
|
242 | direction = 0; |
|
|
243 | |
221 | |
244 | /* since the players map is already loaded, we don't need to worry |
222 | /* since the players map is already loaded, we don't need to worry |
245 | * about pending objects. |
223 | * about pending objects. |
246 | */ |
224 | */ |
247 | remove_all_pets (newmap); |
225 | remove_all_pets (newmap); |
… | |
… | |
255 | * is needed after the players have been updated. |
233 | * is needed after the players have been updated. |
256 | */ |
234 | */ |
257 | static void |
235 | static void |
258 | process_players1 () |
236 | process_players1 () |
259 | { |
237 | { |
260 | int flag; |
|
|
261 | |
|
|
262 | /* Basically, we keep looping until all the players have done their actions. */ |
238 | /* Basically, we keep looping until all the players have done their actions. */ |
263 | for (flag = 1; flag != 0;) |
239 | for (int flag = 1; flag != 0;) |
264 | { |
240 | { |
265 | flag = 0; |
241 | flag = 0; |
266 | for_all_players (pl) |
242 | for_all_players (pl) |
267 | { |
243 | { |
268 | pl->refcnt_chk (); |
244 | pl->refcnt_chk (); |
269 | |
245 | |
270 | if (!pl->ob || !pl->ns || !pl->ob->active ()) |
246 | if (!pl->ob || !pl->ns || !pl->ob->active) |
271 | continue; |
247 | continue; |
272 | |
248 | |
273 | if (pl->ob->speed_left > 0) |
249 | if (pl->ob->speed_left > 0 && pl->ns) |
274 | if (handle_newcs_player (pl->ob)) |
250 | if (handle_newcs_player (pl->ob)) |
275 | flag = 1; |
251 | flag = 1; |
276 | |
252 | |
277 | /* If the player is not actively playing, don't make a |
253 | /* If the player is not actively playing, don't make a |
278 | * backup save - nothing to save anyway. Plus, the |
254 | * backup save - nothing to save anyway. Plus, the |
… | |
… | |
280 | * player quits - they exist for purposes of tracking on the map, |
256 | * player quits - they exist for purposes of tracking on the map, |
281 | * but don't actually reside on any actual map. |
257 | * but don't actually reside on any actual map. |
282 | */ |
258 | */ |
283 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
259 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
284 | continue; |
260 | continue; |
285 | |
|
|
286 | #ifdef AUTOSAVE |
|
|
287 | /* check for ST_PLAYING state so that we don't try to save off when |
|
|
288 | * the player is logging in. |
|
|
289 | */ |
|
|
290 | if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->ns->state == ST_PLAYING) |
|
|
291 | { |
|
|
292 | pl->ob->contr->save (); |
|
|
293 | pl->last_save_tick = pticks; |
|
|
294 | } |
|
|
295 | #endif |
|
|
296 | } /* end of for loop for all the players */ |
261 | } /* end of for loop for all the players */ |
297 | } /* for flag */ |
262 | } /* for flag */ |
298 | |
263 | |
299 | for_all_players (pl) |
264 | for_all_players (pl) |
300 | { |
265 | { |
301 | if (!pl->ob || !pl->ns || !pl->ob->active ()) |
266 | if (!pl->ob || !pl->ns || !pl->ob->active) |
302 | continue; |
267 | continue; |
303 | |
268 | |
304 | if (settings.casting_time) |
269 | if (settings.casting_time) |
305 | { |
270 | { |
306 | if (pl->ob->casting_time > 0) |
271 | if (pl->ob->casting_time > 0) |
… | |
… | |
346 | } |
311 | } |
347 | |
312 | |
348 | void |
313 | void |
349 | process_events () |
314 | process_events () |
350 | { |
315 | { |
351 | object *op; |
|
|
352 | |
|
|
353 | static object_ptr marker_; |
|
|
354 | |
|
|
355 | if (!marker_) |
|
|
356 | marker_ = object::create (); |
|
|
357 | |
|
|
358 | object *marker = marker_; |
|
|
359 | |
|
|
360 | process_players1 (); |
316 | process_players1 (); |
361 | |
317 | |
362 | marker->active_next = active_objects; |
318 | for_all_actives (op) |
363 | |
|
|
364 | if (marker->active_next) |
|
|
365 | marker->active_next->active_prev = marker; |
|
|
366 | |
|
|
367 | marker->active_prev = 0; |
|
|
368 | active_objects = marker; |
|
|
369 | |
|
|
370 | while (marker->active_next) |
|
|
371 | { |
319 | { |
372 | op = marker->active_next; |
|
|
373 | |
|
|
374 | /* Move marker forward - swap op and marker */ |
|
|
375 | op->active_prev = marker->active_prev; |
|
|
376 | |
|
|
377 | if (op->active_prev) |
|
|
378 | op->active_prev->active_next = op; |
|
|
379 | else |
|
|
380 | active_objects = op; |
|
|
381 | |
|
|
382 | marker->active_next = op->active_next; |
|
|
383 | |
|
|
384 | if (marker->active_next) |
|
|
385 | marker->active_next->active_prev = marker; |
|
|
386 | |
|
|
387 | marker->active_prev = op; |
|
|
388 | op->active_next = marker; |
|
|
389 | |
|
|
390 | /* Now process op */ |
320 | /* Now process op */ |
391 | if (QUERY_FLAG (op, FLAG_FREED)) |
321 | if (QUERY_FLAG (op, FLAG_FREED)) |
392 | { |
322 | { |
393 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
323 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
394 | op->set_speed (0); |
324 | op->set_speed (0); |
395 | continue; |
|
|
396 | } |
|
|
397 | |
|
|
398 | /* I've seen occasional crashes due to this - the object is removed, |
|
|
399 | * and thus the map it points to (last map it was on) may be bogus |
|
|
400 | * The real bug is to try to find out the cause of this - someone |
|
|
401 | * is probably calling remove_ob without either an insert_ob or |
|
|
402 | * free_object afterwards, leaving an object dangling. But I'd |
|
|
403 | * rather log this and continue on instead of crashing. |
|
|
404 | * Don't remove players - when a player quits, the object is in |
|
|
405 | * sort of a limbo, of removed, but something we want to keep |
|
|
406 | * around. |
|
|
407 | */ |
|
|
408 | if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY) |
|
|
409 | { |
|
|
410 | LOG (llevError, "BUG: process_events(): Removed object on list\n"); |
|
|
411 | char *dump = dump_object (op); |
|
|
412 | LOG (llevError, dump); |
|
|
413 | free (dump); |
|
|
414 | op->destroy (); |
|
|
415 | continue; |
325 | continue; |
416 | } |
326 | } |
417 | |
327 | |
418 | if (!op->has_active_speed ()) |
328 | if (!op->has_active_speed ()) |
419 | { |
329 | { |
… | |
… | |
421 | "but is on active list\n", op->debug_desc (), op->speed); |
331 | "but is on active list\n", op->debug_desc (), op->speed); |
422 | op->set_speed (0); |
332 | op->set_speed (0); |
423 | continue; |
333 | continue; |
424 | } |
334 | } |
425 | |
335 | |
426 | if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) |
336 | if (op->flag [FLAG_REMOVED]) |
427 | { |
337 | { |
428 | LOG (llevError, "BUG: process_events(): Object without map or " |
338 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
429 | "inventory is on active list: %s (%d)\n", &op->name, op->count); |
339 | op->debug_desc ()); |
430 | op->set_speed (0); |
340 | op->set_speed (0); |
431 | continue; |
341 | continue; |
432 | } |
342 | } |
433 | |
343 | |
434 | /* Animate the object. Bug or feature that anim_speed |
344 | /* Animate the object. Bug or feature that anim_speed |
435 | * is based on ticks, and not the creatures speed? |
345 | * is based on ticks, and not the creatures speed? |
436 | */ |
346 | */ |
437 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
347 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
438 | { |
348 | { |
439 | if ((op->type == PLAYER)) |
349 | animate_object (op, op->type == PLAYER ? op->facing : op->direction); |
440 | animate_object (op, op->facing); |
|
|
441 | else |
|
|
442 | animate_object (op, op->direction); |
|
|
443 | |
350 | |
444 | op->last_anim = 1; |
351 | op->last_anim = 1; |
445 | } |
352 | } |
446 | else |
353 | else |
447 | op->last_anim++; |
354 | op->last_anim++; |
… | |
… | |
474 | |
381 | |
475 | if (op->speed_left <= 0) |
382 | if (op->speed_left <= 0) |
476 | op->speed_left += FABS (op->speed); |
383 | op->speed_left += FABS (op->speed); |
477 | } |
384 | } |
478 | |
385 | |
479 | /* Remove marker object from active list */ |
|
|
480 | if (marker->active_prev != NULL) |
|
|
481 | marker->active_prev->active_next = NULL; |
|
|
482 | else |
|
|
483 | active_objects = NULL; |
|
|
484 | |
|
|
485 | process_players2 (); |
386 | process_players2 (); |
486 | } |
387 | } |
487 | |
388 | |
488 | /* clean up everything before exiting */ |
389 | /* clean up everything before exiting */ |
489 | void |
390 | void |
490 | emergency_save () |
391 | emergency_save () |
491 | { |
392 | { |
492 | LOG (llevDebug, "emergency save begin.\n"); |
393 | LOG (llevDebug, "emergency save begin.\n"); |
493 | |
394 | |
494 | LOG (llevDebug, "saving players.\n"); |
|
|
495 | for_all_players (pl) |
|
|
496 | pl->save (1); |
|
|
497 | |
|
|
498 | // for_all_players (pl) |
|
|
499 | // if (pl->ob) |
|
|
500 | // pl->ob->remove (); |
|
|
501 | |
|
|
502 | LOG (llevDebug, "saving maps.\n"); |
|
|
503 | maptile::emergency_save (); |
395 | cfperl_emergency_save (); |
504 | |
396 | |
505 | LOG (llevDebug, "saving book archive.\n"); |
397 | LOG (llevDebug, "saving book archive.\n"); |
506 | write_book_archive (); |
398 | write_book_archive (); |
507 | |
399 | |
508 | LOG (llevDebug, "emergency save done.\n"); |
400 | LOG (llevDebug, "emergency save done.\n"); |
509 | } |
401 | } |
510 | |
402 | |
|
|
403 | // send all clients some informational text |
|
|
404 | static void |
|
|
405 | cleanup_inform (const char *cause, bool make_core) |
|
|
406 | { |
|
|
407 | int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
|
|
408 | |
|
|
409 | new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); |
|
|
410 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s\n", cause); |
|
|
411 | |
|
|
412 | if (make_core) |
|
|
413 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.\n"); |
|
|
414 | else |
|
|
415 | 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"); |
|
|
416 | |
|
|
417 | new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); |
|
|
418 | |
|
|
419 | flush_sockets (); |
|
|
420 | } |
|
|
421 | |
511 | /* clean up everything before exiting */ |
422 | /* clean up everything before exiting */ |
512 | void |
423 | void |
513 | cleanup (bool make_core) |
424 | cleanup (const char *cause, bool make_core) |
514 | { |
425 | { |
|
|
426 | if (make_core) |
|
|
427 | fork_abort (cause); |
|
|
428 | |
|
|
429 | LOG (llevError, "cleanup cause: %s\n", cause); |
|
|
430 | |
|
|
431 | if (!make_core) |
|
|
432 | cleanup_inform (cause, make_core); |
|
|
433 | |
515 | LOG (llevDebug, "cleanup begin.\n"); |
434 | LOG (llevDebug, "cleanup begin.\n"); |
516 | |
435 | |
517 | if (init_done && !in_cleanup) |
436 | if (init_done && !in_cleanup) |
518 | { |
437 | { |
519 | in_cleanup = true; |
438 | in_cleanup = true; |
… | |
… | |
526 | INVOKE_GLOBAL (CLEANUP); |
445 | INVOKE_GLOBAL (CLEANUP); |
527 | |
446 | |
528 | LOG (llevDebug, "cleanup done.\n"); |
447 | LOG (llevDebug, "cleanup done.\n"); |
529 | |
448 | |
530 | if (make_core) |
449 | if (make_core) |
531 | abort (); |
450 | { |
|
|
451 | cleanup_inform (cause, make_core); |
|
|
452 | cfperl_cleanup (make_core); |
|
|
453 | _exit (1); |
|
|
454 | } |
532 | else |
455 | else |
|
|
456 | { |
|
|
457 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.\n"); |
|
|
458 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE "\n"); |
|
|
459 | flush_sockets (); |
|
|
460 | cfperl_cleanup (make_core); |
533 | _exit (0); |
461 | _exit (0); |
534 | } |
|
|
535 | |
|
|
536 | void |
|
|
537 | leave (player *pl, int draw_exit) |
|
|
538 | { |
|
|
539 | if (pl) |
|
|
540 | { |
|
|
541 | if (pl->ob->type != DEAD_OBJECT) |
|
|
542 | { |
|
|
543 | /* If a hidden dm dropped connection do not create |
|
|
544 | * inconsistencies by showing that they have left the game |
|
|
545 | */ |
|
|
546 | if (!(QUERY_FLAG (pl->ob, FLAG_WIZ) && pl->ob->contr->hidden) |
|
|
547 | && draw_exit) |
|
|
548 | { |
|
|
549 | if (pl->ob->map) |
|
|
550 | { |
|
|
551 | INVOKE_PLAYER (LOGOUT, pl); |
|
|
552 | LOG (llevInfo, "LOGOUT: Player named %s from ip %s\n", &pl->ob->name, pl->ns->host); |
|
|
553 | } |
|
|
554 | |
|
|
555 | char buf[MAX_BUF]; |
|
|
556 | |
|
|
557 | sprintf (buf, "%s left the game.", &pl->ob->name); |
|
|
558 | new_draw_info (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, 0, buf); |
|
|
559 | } |
|
|
560 | |
|
|
561 | pl->ob->remove (); |
|
|
562 | pl->ob->type = DEAD_OBJECT; /* To avoid problems with inventory window */ |
|
|
563 | } |
|
|
564 | |
|
|
565 | /* We do this so that the socket handling routine can do the final |
|
|
566 | * cleanup. We also leave that loop to actually handle the freeing |
|
|
567 | * of the data. |
|
|
568 | */ |
|
|
569 | if (pl->ns) |
|
|
570 | pl->ns->destroy (); |
|
|
571 | |
|
|
572 | } |
462 | } |
573 | } |
463 | } |
574 | |
464 | |
575 | int |
465 | int |
576 | forbid_play (void) |
466 | forbid_play (void) |
… | |
… | |
591 | |
481 | |
592 | while (fgets (buf, MAX_BUF, fp)) |
482 | while (fgets (buf, MAX_BUF, fp)) |
593 | { |
483 | { |
594 | if (buf[0] == '#') |
484 | if (buf[0] == '#') |
595 | continue; |
485 | continue; |
|
|
486 | |
596 | if (!strncmp (buf, "msg", 3)) |
487 | if (!strncmp (buf, "msg", 3)) |
597 | { |
488 | { |
598 | if (forbit) |
489 | if (forbit) |
599 | while (fgets (buf, MAX_BUF, fp)) /* print message */ |
490 | while (fgets (buf, MAX_BUF, fp)) /* print message */ |
600 | fputs (buf, logfile); |
491 | fputs (buf, logfile); |
601 | break; |
492 | break; |
602 | |
|
|
603 | } |
493 | } |
604 | else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
494 | else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
605 | { |
495 | { |
606 | LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
496 | LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
607 | continue; |
497 | continue; |
… | |
… | |
621 | return 0; |
511 | return 0; |
622 | #endif |
512 | #endif |
623 | } |
513 | } |
624 | |
514 | |
625 | /* |
515 | /* |
626 | * do_specials() is a collection of functions to call from time to time. |
516 | * do_specials() is a collection of functions to call from time to time. |
627 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
517 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
628 | * often to do things. This will allow us to spred them out more often. |
518 | * often to do things. This will allow us to spred them out more often. |
629 | * I use prime numbers for the factor count - in that way, it is less likely |
519 | * I use prime numbers for the factor count - in that way, it is less likely |
630 | * these actions will fall on the same tick (compared to say using 500/2500/15000 |
520 | * these actions will fall on the same tick (compared to say using 500/2500/15000 |
631 | * which would mean on that 15,000 tick count a whole bunch of stuff gets |
521 | * which would mean on that 15,000 tick count a whole bunch of stuff gets |
… | |
… | |
633 | * done on the same tick, but that will happen very infrequently |
523 | * done on the same tick, but that will happen very infrequently |
634 | * |
524 | * |
635 | * I also think this code makes it easier to see how often we really are |
525 | * I also think this code makes it easier to see how often we really are |
636 | * doing the various things. |
526 | * doing the various things. |
637 | */ |
527 | */ |
638 | |
|
|
639 | extern unsigned long todtick; |
|
|
640 | |
|
|
641 | void |
528 | void |
642 | do_specials (void) |
529 | do_specials (void) |
643 | { |
530 | { |
644 | if (!(pticks % PTICKS_PER_CLOCK)) |
531 | if (!(pticks % TICKS_PER_HOUR)) |
645 | tick_the_clock (); |
532 | adjust_daylight (); |
646 | |
533 | |
647 | if (!(pticks % 7)) |
534 | if (!(pticks % 7)) |
648 | shstr::gc (); |
535 | shstr::gc (); |
649 | |
536 | |
650 | if (!(pticks % 2503)) |
537 | if (!(pticks % 2503)) |
… | |
… | |
677 | attachable::check_mortals (); |
564 | attachable::check_mortals (); |
678 | |
565 | |
679 | ++pticks; |
566 | ++pticks; |
680 | } |
567 | } |
681 | |
568 | |
|
|
569 | #if 0 |
|
|
570 | // used fro benchmarking (x86/amd64-specific) |
|
|
571 | typedef unsigned long tval; |
|
|
572 | typedef unsigned long long stamp64; |
|
|
573 | |
|
|
574 | extern inline tval |
|
|
575 | stamp (void) |
|
|
576 | { |
|
|
577 | tval tsc; |
|
|
578 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
579 | |
|
|
580 | return tsc; |
|
|
581 | } |
|
|
582 | |
|
|
583 | extern inline tval |
|
|
584 | measure (tval t) |
|
|
585 | { |
|
|
586 | tval tsc; |
|
|
587 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
588 | |
|
|
589 | if (tsc > t) |
|
|
590 | return tsc - t; |
|
|
591 | else |
|
|
592 | return t - tsc; |
|
|
593 | } |
|
|
594 | |
682 | int |
595 | int |
683 | main (int argc, char **argv) |
596 | main (int argc, char **argv) |
684 | { |
597 | { |
|
|
598 | rand_gen rg(0); |
|
|
599 | tval fastest = 0x7fffffff; |
|
|
600 | for (int loop = 10000; loop--; ) |
|
|
601 | { |
|
|
602 | tval s = stamp (); |
|
|
603 | volatile int i = rg.get_int(25); |
|
|
604 | fastest = min (fastest, measure (s)); |
|
|
605 | } |
|
|
606 | |
|
|
607 | //printf ("fastest %d\n", fastest); |
|
|
608 | for (int i = 0; i < 1024*1024*3; ++i) |
|
|
609 | { |
|
|
610 | char c = rg.get_int (256); |
|
|
611 | write (2, &c, 1); |
|
|
612 | } |
|
|
613 | } |
|
|
614 | |
|
|
615 | #else |
|
|
616 | |
|
|
617 | // normal main |
|
|
618 | int |
|
|
619 | main (int argc, char **argv) |
|
|
620 | { |
685 | settings.argc = argc; |
621 | settings.argc = argc; |
686 | settings.argv = argv; |
622 | settings.argv = argv; |
687 | |
623 | |
688 | init (argc, argv); |
624 | init (argc, argv); |
689 | |
625 | |
690 | initPlugins (); |
626 | initPlugins (); |
691 | |
627 | |
692 | for (;;) |
628 | for (;;) |
693 | cfperl_main (); |
629 | cfperl_main (); |
694 | |
|
|
695 | cleanup (true); |
|
|
696 | } |
630 | } |
|
|
631 | #endif |
697 | |
632 | |