1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program; if not, write to the Free Software |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <global.h> |
25 | #include <global.h> |
26 | #include <object.h> |
26 | #include <object.h> |
27 | #include <tod.h> |
27 | #include <tod.h> |
28 | |
28 | |
29 | #include <sproto.h> |
29 | #include <sproto.h> |
30 | #include <time.h> |
30 | #include <time.h> |
31 | |
31 | |
|
|
32 | #include <glib.h> |
|
|
33 | |
32 | #include <../random_maps/random_map.h> |
34 | #include <../random_maps/random_map.h> |
33 | #include <../random_maps/rproto.h> |
35 | #include <../random_maps/rproto.h> |
34 | #include "path.h" |
36 | #include "path.h" |
35 | |
37 | |
36 | static char days[7][4] = { |
38 | static char days[7][4] = { |
… | |
… | |
38 | }; |
40 | }; |
39 | |
41 | |
40 | void |
42 | void |
41 | version (object *op) |
43 | version (object *op) |
42 | { |
44 | { |
43 | if (op) |
|
|
44 | clear_win_info (op); |
|
|
45 | |
|
|
46 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); |
45 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION); |
47 | |
46 | |
|
|
47 | #if 0 |
48 | 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:"); |
49 | 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>"); |
50 | 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>"); |
51 | 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, ""); |
52 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
… | |
… | |
98 | 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>"); |
99 | 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>"); |
100 | 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, ""); |
101 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
102 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
102 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
|
|
103 | #endif |
103 | } |
104 | } |
104 | |
105 | |
105 | /* This is a basic little function to put the player back to his |
106 | /* 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. We do some error checking - its possible that the |
107 | * savebed map may no longer exist, so we make sure the player |
108 | * savebed map may no longer exist, so we make sure the player |
108 | * goes someplace. |
109 | * goes someplace. |
109 | */ |
110 | */ |
110 | void |
111 | void |
111 | enter_player_savebed (object *op) |
112 | enter_player_savebed (object *op) |
112 | { |
113 | { |
113 | object *tmp = object::create (); |
114 | op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y); |
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 | } |
115 | } |
120 | |
116 | |
121 | /* |
117 | /* |
122 | * enter_map(): Moves the player and pets from current map (if any) to |
118 | * 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 |
119 | * new map. map, x, y must be set. map is the map we are moving the |
… | |
… | |
126 | * the function that calls this should figure them out. |
122 | * the function that calls this should figure them out. |
127 | */ |
123 | */ |
128 | void |
124 | void |
129 | object::enter_map (maptile *newmap, int x, int y) |
125 | object::enter_map (maptile *newmap, int x, int y) |
130 | { |
126 | { |
131 | if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) |
127 | if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) |
132 | return; |
128 | return; |
133 | |
129 | |
134 | if (out_of_map (newmap, x, y)) |
130 | if (out_of_map (newmap, x, y)) |
135 | { |
131 | { |
136 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
132 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
… | |
… | |
151 | |
147 | |
152 | // remove, so stupid ob_locked does not trigger a failure |
148 | // remove, so stupid ob_locked does not trigger a failure |
153 | remove (); |
149 | remove (); |
154 | |
150 | |
155 | /* try to find a spot for the player */ |
151 | /* try to find a spot for the player */ |
156 | if (ob_blocked (this, newmap, x, y)) |
152 | if (blocked (newmap, x, y)) |
157 | { /* First choice blocked */ |
153 | { /* First choice blocked */ |
158 | /* We try to find a spot for the player, starting closest in. |
154 | /* 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, |
155 | * 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 |
156 | * So for example, if the north space is free, you would always end up there even |
161 | * if other spaces around are available. |
157 | * if other spaces around are available. |
… | |
… | |
209 | if (object *golem = contr->golem) |
205 | if (object *golem = contr->golem) |
210 | { |
206 | { |
211 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
207 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
212 | |
208 | |
213 | if (i < 0) |
209 | if (i < 0) |
214 | golem->destroy (); |
210 | golem->drop_and_destroy (); |
215 | else |
211 | else |
216 | { |
212 | { |
217 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
213 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
218 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
214 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
219 | } |
215 | } |
… | |
… | |
241 | flag = 0; |
237 | flag = 0; |
242 | for_all_players (pl) |
238 | for_all_players (pl) |
243 | { |
239 | { |
244 | pl->refcnt_chk (); |
240 | pl->refcnt_chk (); |
245 | |
241 | |
246 | if (!pl->ob || !pl->ns || !pl->ob->active) |
242 | if (expect_false (!pl->ob || !pl->ns || !pl->ob->active)) |
247 | continue; |
243 | continue; |
248 | |
244 | |
249 | if (pl->ob->speed_left > 0 && pl->ns) |
|
|
250 | if (handle_newcs_player (pl->ob)) |
245 | if (handle_newcs_player (pl->ob)) |
251 | flag = 1; |
246 | flag = 1; |
252 | |
247 | } |
253 | /* If the player is not actively playing, don't make a |
248 | } |
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 | |
249 | |
264 | for_all_players (pl) |
250 | for_all_players (pl) |
265 | { |
251 | { |
|
|
252 | object *ob = pl->ob; |
|
|
253 | |
266 | if (!pl->ob || !pl->ns || !pl->ob->active) |
254 | if (expect_false (!ob || !pl->ns || !ob->active)) |
267 | continue; |
255 | continue; |
268 | |
256 | |
269 | if (settings.casting_time) |
|
|
270 | { |
|
|
271 | if (pl->ob->casting_time > 0) |
|
|
272 | { |
|
|
273 | pl->ob->casting_time--; |
|
|
274 | pl->ob->start_holding = 1; |
|
|
275 | } |
|
|
276 | |
|
|
277 | /* set spell_state so we can update the range in stats field */ |
|
|
278 | if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1)) |
|
|
279 | pl->ob->start_holding = 0; |
|
|
280 | } |
|
|
281 | |
|
|
282 | do_some_living (pl->ob); |
257 | do_some_living (ob); |
283 | } |
258 | } |
284 | } |
259 | } |
285 | |
260 | |
286 | static void |
261 | static void |
287 | process_players2 () |
262 | process_players2 () |
288 | { |
263 | { |
289 | /* Then check if any players should use weapon-speed instead of speed */ |
264 | /* Then check if any players should use weapon-speed instead of speed */ |
290 | for_all_players (pl) |
265 | for_all_players (pl) |
291 | { |
266 | { |
292 | /* The code that did weapon_sp handling here was out of place - |
267 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
293 | * this isn't called until after the player has finished there |
268 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
294 | * actions, and is thus out of place. All we do here is bounds |
|
|
295 | * checking. |
|
|
296 | */ |
|
|
297 | if (pl->has_hit) |
|
|
298 | { |
|
|
299 | if (pl->ob->speed_left > pl->weapon_sp) |
|
|
300 | pl->ob->speed_left = pl->weapon_sp; |
|
|
301 | |
|
|
302 | /* This needs to be here - if the player is running, we need to |
|
|
303 | * clear this each tick, but new commands are not being received |
|
|
304 | * so execute_newserver_command() is never called |
|
|
305 | */ |
|
|
306 | pl->has_hit = 0; |
|
|
307 | } |
|
|
308 | else if (pl->ob->speed_left > pl->ob->speed) |
|
|
309 | pl->ob->speed_left = pl->ob->speed; |
|
|
310 | } |
269 | } |
311 | } |
270 | } |
312 | |
271 | |
313 | void |
272 | void |
314 | process_events () |
273 | process_events () |
… | |
… | |
316 | process_players1 (); |
275 | process_players1 (); |
317 | |
276 | |
318 | for_all_actives (op) |
277 | for_all_actives (op) |
319 | { |
278 | { |
320 | /* Now process op */ |
279 | /* Now process op */ |
321 | if (QUERY_FLAG (op, FLAG_FREED)) |
280 | if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
322 | { |
281 | { |
323 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
282 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
324 | op->set_speed (0); |
283 | op->set_speed (0); |
325 | continue; |
284 | continue; |
326 | } |
285 | } |
327 | |
286 | |
328 | if (!op->has_active_speed ()) |
287 | if (expect_false (!op->has_active_speed ())) |
329 | { |
288 | { |
330 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
289 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
331 | "but is on active list\n", op->debug_desc (), op->speed); |
290 | "but is on active list\n", op->debug_desc (), op->speed); |
332 | op->set_speed (0); |
291 | op->set_speed (0); |
333 | continue; |
292 | continue; |
334 | } |
293 | } |
335 | |
294 | |
336 | if (op->flag [FLAG_REMOVED]) |
295 | if (expect_false (op->flag [FLAG_REMOVED])) |
337 | { |
296 | { |
338 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
297 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
339 | op->debug_desc ()); |
298 | op->debug_desc ()); |
340 | op->set_speed (0); |
299 | op->set_speed (0); |
341 | continue; |
300 | continue; |
… | |
… | |
344 | /* Animate the object. Bug or feature that anim_speed |
303 | /* Animate the object. Bug or feature that anim_speed |
345 | * is based on ticks, and not the creatures speed? |
304 | * is based on ticks, and not the creatures speed? |
346 | */ |
305 | */ |
347 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
306 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
348 | { |
307 | { |
349 | animate_object (op, op->type == PLAYER ? op->facing : op->direction); |
308 | animate_object (op, op->contr ? op->facing : op->direction); |
350 | |
|
|
351 | op->last_anim = 1; |
309 | op->last_anim = 1; |
352 | } |
310 | } |
353 | else |
311 | else |
354 | op->last_anim++; |
312 | ++op->last_anim; |
355 | |
313 | |
356 | if (op->speed_left > 0) |
314 | if (expect_false (op->speed_left > 0.f)) |
357 | { |
|
|
358 | #if 0 |
|
|
359 | /* I've seen occasional crashes in move_symptom() with it |
|
|
360 | * crashing because op is removed - add some debugging to |
|
|
361 | * track if it is removed at this point. |
|
|
362 | * This unfortunately is a bit too verbose it seems - not sure |
|
|
363 | * why - I think what happens is a map is freed or something and |
|
|
364 | * some objects get 'lost' - removed never to be reclaimed. |
|
|
365 | * removed objects generally shouldn't exist. |
|
|
366 | */ |
|
|
367 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
368 | { |
315 | { |
369 | LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null"); |
|
|
370 | } |
|
|
371 | #endif |
|
|
372 | --op->speed_left; |
316 | --op->speed_left; |
373 | process_object (op); |
317 | process_object (op); |
374 | |
|
|
375 | if (op->destroyed ()) |
|
|
376 | continue; |
|
|
377 | } |
318 | } |
378 | |
319 | |
379 | if (settings.casting_time == TRUE && op->casting_time > 0) |
320 | if (expect_true (!op->contr)) |
380 | op->casting_time--; |
321 | op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
381 | |
|
|
382 | if (op->speed_left <= 0) |
|
|
383 | op->speed_left += FABS (op->speed); |
|
|
384 | } |
322 | } |
385 | |
323 | |
386 | process_players2 (); |
324 | process_players2 (); |
387 | } |
325 | } |
388 | |
326 | |
… | |
… | |
402 | |
340 | |
403 | // send all clients some informational text |
341 | // send all clients some informational text |
404 | static void |
342 | static void |
405 | cleanup_inform (const char *cause, bool make_core) |
343 | cleanup_inform (const char *cause, bool make_core) |
406 | { |
344 | { |
407 | int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
345 | int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
408 | |
346 | |
409 | new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); |
347 | new_draw_info_format (flags, 0, 0, "The server will now shutdown."); |
410 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s\n", cause); |
348 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); |
411 | |
349 | |
412 | if (make_core) |
350 | 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"); |
351 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved."); |
414 | else |
352 | 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"); |
353 | new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now."); |
416 | |
354 | |
417 | new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); |
355 | new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); |
418 | |
356 | |
419 | flush_sockets (); |
357 | client::flush_sockets (); |
420 | } |
358 | } |
421 | |
359 | |
422 | /* clean up everything before exiting */ |
360 | /* clean up everything before exiting */ |
423 | void |
361 | void |
424 | cleanup (const char *cause, bool make_core) |
362 | cleanup (const char *cause, bool make_core) |
… | |
… | |
444 | LOG (llevDebug, "running cleanup handlers.\n"); |
382 | LOG (llevDebug, "running cleanup handlers.\n"); |
445 | INVOKE_GLOBAL (CLEANUP); |
383 | INVOKE_GLOBAL (CLEANUP); |
446 | |
384 | |
447 | LOG (llevDebug, "cleanup done.\n"); |
385 | LOG (llevDebug, "cleanup done.\n"); |
448 | |
386 | |
|
|
387 | log_cleanup (); |
|
|
388 | |
449 | if (make_core) |
389 | if (make_core) |
450 | { |
|
|
451 | cleanup_inform (cause, make_core); |
390 | cleanup_inform (cause, make_core); |
452 | cfperl_cleanup (make_core); |
|
|
453 | _exit (1); |
|
|
454 | } |
|
|
455 | else |
391 | else |
456 | { |
392 | { |
457 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.\n"); |
393 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting."); |
458 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE "\n"); |
394 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); |
459 | flush_sockets (); |
395 | client::flush_sockets (); |
|
|
396 | } |
|
|
397 | |
460 | cfperl_cleanup (make_core); |
398 | cfperl_cleanup (make_core); |
461 | _exit (0); |
399 | _exit (make_core); |
462 | } |
|
|
463 | } |
|
|
464 | |
|
|
465 | int |
|
|
466 | forbid_play (void) |
|
|
467 | { |
|
|
468 | #if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE) |
|
|
469 | char buf[MAX_BUF], day[MAX_BUF]; |
|
|
470 | FILE *fp; |
|
|
471 | time_t clock; |
|
|
472 | struct tm *tm; |
|
|
473 | int i, start, stop, forbit = 0, comp; |
|
|
474 | |
|
|
475 | clock = time (NULL); |
|
|
476 | tm = (struct tm *) localtime (&clock); |
|
|
477 | |
|
|
478 | sprintf (buf, "%s/%s", settings.confdir, PERM_FILE); |
|
|
479 | if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
|
|
480 | return 0; |
|
|
481 | |
|
|
482 | while (fgets (buf, MAX_BUF, fp)) |
|
|
483 | { |
|
|
484 | if (buf[0] == '#') |
|
|
485 | continue; |
|
|
486 | |
|
|
487 | if (!strncmp (buf, "msg", 3)) |
|
|
488 | { |
|
|
489 | if (forbit) |
|
|
490 | while (fgets (buf, MAX_BUF, fp)) /* print message */ |
|
|
491 | fputs (buf, logfile); |
|
|
492 | break; |
|
|
493 | } |
|
|
494 | else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
|
|
495 | { |
|
|
496 | LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
|
|
497 | continue; |
|
|
498 | } |
|
|
499 | |
|
|
500 | for (i = 0; i < 7; i++) |
|
|
501 | { |
|
|
502 | if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop)) |
|
|
503 | forbit = 1; |
|
|
504 | } |
|
|
505 | } |
|
|
506 | |
|
|
507 | close_and_delete (fp, comp); |
|
|
508 | |
|
|
509 | return forbit; |
|
|
510 | #else |
|
|
511 | return 0; |
|
|
512 | #endif |
|
|
513 | } |
400 | } |
514 | |
401 | |
515 | /* |
402 | /* |
516 | * do_specials() is a collection of functions to call from time to time. |
403 | * do_specials() is a collection of functions to call from time to time. |
517 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
404 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
… | |
… | |
526 | * doing the various things. |
413 | * doing the various things. |
527 | */ |
414 | */ |
528 | void |
415 | void |
529 | do_specials (void) |
416 | do_specials (void) |
530 | { |
417 | { |
531 | if (!(pticks % TICKS_PER_HOUR)) |
|
|
532 | adjust_daylight (); |
|
|
533 | |
|
|
534 | if (!(pticks % 7)) |
|
|
535 | shstr::gc (); |
418 | shstr::gc (); |
|
|
419 | archetype::gc (); |
536 | |
420 | |
|
|
421 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
|
|
422 | maptile::adjust_daylight (); |
|
|
423 | |
537 | if (!(pticks % 2503)) |
424 | if (expect_false (!(pticks % 2503))) |
538 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
425 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
539 | |
426 | |
540 | if (!(pticks % 5003)) |
427 | if (expect_false (!(pticks % 5003))) |
541 | write_book_archive (); |
428 | write_book_archive (); |
542 | |
429 | |
543 | if (!(pticks % 5009)) |
430 | if (expect_false (!(pticks % 5009))) |
544 | clean_friendly_list (); |
431 | clean_friendly_list (); |
545 | |
432 | |
546 | if (!(pticks % 5011)) |
433 | if (expect_false (!(pticks % 5011))) |
547 | obsolete_parties (); |
434 | obsolete_parties (); |
548 | |
435 | |
549 | if (!(pticks % 12503)) |
436 | if (expect_false (!(pticks % 12503))) |
550 | fix_luck (); |
437 | fix_luck (); |
551 | } |
438 | } |
552 | |
439 | |
553 | void |
440 | void |
554 | server_tick () |
441 | server_tick () |
555 | { |
442 | { |
556 | // first do the user visible stuff |
443 | // first do the user visible stuff |
557 | doeric_server (); |
|
|
558 | INVOKE_GLOBAL (CLOCK); |
444 | INVOKE_GLOBAL (CLOCK); |
559 | process_events (); /* "do" something with objects with speed */ |
445 | process_events (); // "do" something with objects with speed |
560 | flush_sockets (); |
446 | client::clock (); // draw client maps etc. |
561 | |
447 | |
562 | // then do some bookkeeping, should not really be here |
448 | // then do some bookkeeping, should not really be here |
563 | do_specials (); /* Routines called from time to time. */ |
449 | do_specials (); /* Routines called from time to time. */ |
564 | attachable::check_mortals (); |
450 | attachable::check_mortals (); |
565 | |
451 | |
566 | ++pticks; |
452 | ++pticks; |
567 | } |
453 | } |
568 | |
454 | |
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 | |
|
|
595 | int |
|
|
596 | main (int argc, char **argv) |
|
|
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 |
455 | // normal main |
618 | int |
456 | int |
619 | main (int argc, char **argv) |
457 | main (int argc, char **argv) |
620 | { |
458 | { |
621 | settings.argc = argc; |
459 | settings.argc = argc; |
622 | settings.argv = argv; |
460 | settings.argv = argv; |
|
|
461 | |
|
|
462 | rndm.seed (time (0)); |
|
|
463 | g_thread_init (0); // for the slice allocator only |
623 | |
464 | |
624 | init (argc, argv); |
465 | init (argc, argv); |
625 | |
|
|
626 | initPlugins (); |
|
|
627 | |
466 | |
628 | for (;;) |
467 | for (;;) |
629 | cfperl_main (); |
468 | cfperl_main (); |
630 | } |
469 | } |
631 | #endif |
|
|
632 | |
470 | |