ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/server/main.C
(Generate patch)

Comparing deliantra/server/server/main.C (file contents):
Revision 1.84 by root, Sat Jan 13 23:45:46 2007 UTC vs.
Revision 1.132 by root, Mon Sep 29 10:20:49 2008 UTC

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
9 * 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
10 * the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your 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 GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25#include <global.h> 24#include <global.h>
26#include <object.h> 25#include <object.h>
27#include <tod.h> 26#include <tod.h>
28 27
29#ifdef HAVE_DES_H
30# include <des.h>
31#else
32# ifdef HAVE_CRYPT_H
33# include <crypt.h>
34# endif
35#endif
36
37#include <sproto.h> 28#include <sproto.h>
38#include <time.h> 29#include <time.h>
30
31#include <glib.h>
39 32
40#include <../random_maps/random_map.h> 33#include <../random_maps/random_map.h>
41#include <../random_maps/rproto.h> 34#include <../random_maps/rproto.h>
42#include "path.h" 35#include "path.h"
43 36
… …
46}; 39};
47 40
48void 41void
49version (object *op) 42version (object *op)
50{ 43{
51 if (op)
52 clear_win_info (op);
53
54 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); 44 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION);
55 45
46#if 0
56 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); 47 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
57 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); 48 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
58 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); 49 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
59 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); 50 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>");
60 new_draw_info (NDI_UNIQUE, 0, op, ""); 51 new_draw_info (NDI_UNIQUE, 0, op, "");
… …
106 new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>"); 97 new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>");
107 new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>"); 98 new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>");
108 new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); 99 new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>");
109 new_draw_info (NDI_UNIQUE, 0, op, ""); 100 new_draw_info (NDI_UNIQUE, 0, op, "");
110 new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); 101 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
102#endif
111} 103}
112 104
113/* 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
114 * savebed. We do some error checking - its possible that the 106 * savebed. We do some error checking - its possible that the
115 * savebed map may no longer exist, so we make sure the player 107 * savebed map may no longer exist, so we make sure the player
116 * goes someplace. 108 * goes someplace.
117 */ 109 */
118void 110void
119enter_player_savebed (object *op) 111enter_player_savebed (object *op)
120{ 112{
121 object *tmp = object::create (); 113 op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y);
122 EXIT_PATH (tmp) = op->contr->savebed_map;
123 EXIT_X (tmp) = op->contr->bed_x;
124 EXIT_Y (tmp) = op->contr->bed_y;
125 op->enter_exit (tmp);
126 tmp->destroy ();
127} 114}
128 115
129/* 116/*
130 * enter_map(): Moves the player and pets from current map (if any) to 117 * enter_map(): Moves the player and pets from current map (if any) to
131 * new map. map, x, y must be set. map is the map we are moving the 118 * new map. map, x, y must be set. map is the map we are moving the
… …
134 * the function that calls this should figure them out. 121 * the function that calls this should figure them out.
135 */ 122 */
136void 123void
137object::enter_map (maptile *newmap, int x, int y) 124object::enter_map (maptile *newmap, int x, int y)
138{ 125{
139 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) 126 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
140 return; 127 return;
141 128
142 if (out_of_map (newmap, x, y)) 129 if (out_of_map (newmap, x, y))
143 { 130 {
144 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); 131 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
… …
159 146
160 // remove, so stupid ob_locked does not trigger a failure 147 // remove, so stupid ob_locked does not trigger a failure
161 remove (); 148 remove ();
162 149
163 /* try to find a spot for the player */ 150 /* try to find a spot for the player */
164 if (ob_blocked (this, newmap, x, y)) 151 if (blocked (newmap, x, y))
165 { /* First choice blocked */ 152 { /* First choice blocked */
166 /* We try to find a spot for the player, starting closest in. 153 /* We try to find a spot for the player, starting closest in.
167 * We could use find_first_free_spot, but that doesn't randomize it at all, 154 * We could use find_first_free_spot, but that doesn't randomize it at all,
168 * So for example, if the north space is free, you would always end up there even 155 * So for example, if the north space is free, you would always end up there even
169 * if other spaces around are available. 156 * if other spaces around are available.
… …
211 contr->maplevel = newmap->path; 198 contr->maplevel = newmap->path;
212 contr->count = 0; 199 contr->count = 0;
213 } 200 }
214 201
215 /* Update any golems */ 202 /* Update any golems */
216 if (type == PLAYER && contr->ranges[range_golem]) 203 if (type == PLAYER)
217 { 204 if (object *golem = contr->golem)
218 int i = find_free_spot (contr->ranges[range_golem], newmap,
219 x, y, 1, SIZEOFFREE);
220
221 if (i == -1)
222 { 205 {
223 contr->ranges[range_golem]->destroy (); 206 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
224 contr->ranges[range_golem] = 0; 207
225 } 208 if (i < 0)
226 else
227 {
228 for (object *tmp = contr->ranges[range_golem]; tmp; tmp = tmp->more)
229 { 209 {
230 tmp->x = x + freearr_x[i] + (tmp->arch ? 0 : tmp->arch->clone.x); 210 golem->destroy_inv (true); // be explicit about dropping
231 tmp->y = y + freearr_y[i] + (tmp->arch ? 0 : tmp->arch->clone.y); 211 golem->destroy (true);
232 tmp->map = newmap;
233 } 212 }
234 213 else
235 insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0); 214 {
236 contr->ranges[range_golem]->direction = 215 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
237 find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y); 216 golem->direction = find_dir_2 (x - golem->x, y - golem->y);
238 } 217 }
239 } 218 }
240 219
241 /* since the players map is already loaded, we don't need to worry 220 /* since the players map is already loaded, we don't need to worry
242 * about pending objects. 221 * about pending objects.
243 */ 222 */
244 remove_all_pets (newmap); 223 remove_all_pets (newmap);
… …
252 * is needed after the players have been updated. 231 * is needed after the players have been updated.
253 */ 232 */
254static void 233static void
255process_players1 () 234process_players1 ()
256{ 235{
257 int flag;
258
259 /* Basically, we keep looping until all the players have done their actions. */ 236 /* Basically, we keep looping until all the players have done their actions. */
260 for (flag = 1; flag != 0;) 237 for (int flag = 1; flag != 0;)
261 { 238 {
262 flag = 0; 239 flag = 0;
263 for_all_players (pl) 240 for_all_players (pl)
264 { 241 {
265 pl->refcnt_chk (); 242 pl->refcnt_chk ();
266 243
267 if (!pl->ob || !pl->ns || !pl->ob->active) 244 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
268 continue; 245 continue;
269 246
270 if (pl->ob->speed_left > 0)
271 if (handle_newcs_player (pl->ob)) 247 if (handle_newcs_player (pl->ob))
272 flag = 1; 248 flag = 1;
273 249 }
274 /* If the player is not actively playing, don't make a 250 }
275 * backup save - nothing to save anyway. Plus, the
276 * map may not longer be valid. This can happen when the
277 * player quits - they exist for purposes of tracking on the map,
278 * but don't actually reside on any actual map.
279 */
280 if (QUERY_FLAG (pl->ob, FLAG_REMOVED))
281 continue;
282 } /* end of for loop for all the players */
283 } /* for flag */
284 251
285 for_all_players (pl) 252 for_all_players (pl)
286 { 253 {
254 object *ob = pl->ob;
255
287 if (!pl->ob || !pl->ns || !pl->ob->active) 256 if (expect_false (!ob || !pl->ns || !ob->active))
288 continue; 257 continue;
289 258
290 if (settings.casting_time)
291 {
292 if (pl->ob->casting_time > 0)
293 {
294 pl->ob->casting_time--;
295 pl->ob->start_holding = 1;
296 }
297
298 /* set spell_state so we can update the range in stats field */
299 if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1))
300 pl->ob->start_holding = 0;
301 }
302
303 do_some_living (pl->ob); 259 do_some_living (ob);
304 } 260 }
305} 261}
306 262
307static void 263static void
308process_players2 () 264process_players2 ()
309{ 265{
310 /* Then check if any players should use weapon-speed instead of speed */ 266 /* Then check if any players should use weapon-speed instead of speed */
311 for_all_players (pl) 267 for_all_players (pl)
312 { 268 {
313 /* The code that did weapon_sp handling here was out of place - 269 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
314 * this isn't called until after the player has finished there 270 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
315 * actions, and is thus out of place. All we do here is bounds
316 * checking.
317 */
318 if (pl->has_hit)
319 {
320 if (pl->ob->speed_left > pl->weapon_sp)
321 pl->ob->speed_left = pl->weapon_sp;
322
323 /* This needs to be here - if the player is running, we need to
324 * clear this each tick, but new commands are not being received
325 * so execute_newserver_command() is never called
326 */
327 pl->has_hit = 0;
328 }
329 else if (pl->ob->speed_left > pl->ob->speed)
330 pl->ob->speed_left = pl->ob->speed;
331 } 271 }
332} 272}
333 273
334void 274void
335process_events () 275process_events ()
… …
337 process_players1 (); 277 process_players1 ();
338 278
339 for_all_actives (op) 279 for_all_actives (op)
340 { 280 {
341 /* Now process op */ 281 /* Now process op */
342 if (QUERY_FLAG (op, FLAG_FREED)) 282 if (expect_false (QUERY_FLAG (op, FLAG_FREED)))
343 { 283 {
344 LOG (llevError, "BUG: process_events(): Free object on list\n"); 284 LOG (llevError, "BUG: process_events(): Free object on list\n");
345 op->set_speed (0); 285 op->set_speed (0);
346 continue; 286 continue;
347 } 287 }
348 288
349 /* I've seen occasional crashes due to this - the object is removed,
350 * and thus the map it points to (last map it was on) may be bogus
351 * The real bug is to try to find out the cause of this - someone
352 * is probably calling remove_ob without either an insert_ob or
353 * free_object afterwards, leaving an object dangling. But I'd
354 * rather log this and continue on instead of crashing.
355 * Don't remove players - when a player quits, the object is in
356 * sort of a limbo, of removed, but something we want to keep
357 * around.
358 */
359 if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY)
360 {
361 LOG (llevError, "BUG: process_events(): Removed object on list\n");
362 char *dump = dump_object (op);
363 LOG (llevError, dump);
364 free (dump);
365 op->destroy ();
366 continue;
367 }
368
369 if (!op->has_active_speed ()) 289 if (expect_false (!op->has_active_speed ()))
370 { 290 {
371 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " 291 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
372 "but is on active list\n", op->debug_desc (), op->speed); 292 "but is on active list\n", op->debug_desc (), op->speed);
373 op->set_speed (0); 293 op->set_speed (0);
374 continue; 294 continue;
375 } 295 }
376 296
377 if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) 297 if (expect_false (op->flag [FLAG_REMOVED]))
378 { 298 {
379 LOG (llevError, "BUG: process_events(): Object without map or " 299 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
380 "inventory is on active list: %s (%d)\n", &op->name, op->count); 300 op->debug_desc ());
381 op->set_speed (0); 301 op->set_speed (0);
382 continue; 302 continue;
383 } 303 }
384 304
385 /* Animate the object. Bug or feature that anim_speed 305 /* Animate the object. Bug or feature that anim_speed
386 * is based on ticks, and not the creatures speed? 306 * is based on ticks, and not the creatures speed?
387 */ 307 */
388 if (op->anim_speed && op->last_anim >= op->anim_speed) 308 if (op->anim_speed && op->last_anim >= op->anim_speed)
389 { 309 {
390 if ((op->type == PLAYER))
391 animate_object (op, op->facing);
392 else
393 animate_object (op, op->direction); 310 animate_object (op, op->contr ? op->facing : op->direction);
394
395 op->last_anim = 1; 311 op->last_anim = 1;
396 } 312 }
397 else 313 else
398 op->last_anim++; 314 ++op->last_anim;
399 315
400 if (op->speed_left > 0) 316 if (expect_false (op->speed_left > 0.f))
401 {
402#if 0
403 /* I've seen occasional crashes in move_symptom() with it
404 * crashing because op is removed - add some debugging to
405 * track if it is removed at this point.
406 * This unfortunately is a bit too verbose it seems - not sure
407 * why - I think what happens is a map is freed or something and
408 * some objects get 'lost' - removed never to be reclaimed.
409 * removed objects generally shouldn't exist.
410 */
411 if (QUERY_FLAG (op, FLAG_REMOVED))
412 { 317 {
413 LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null");
414 }
415#endif
416 --op->speed_left; 318 --op->speed_left;
417 process_object (op); 319 process_object (op);
418
419 if (op->destroyed ())
420 continue;
421 } 320 }
422 321
423 if (settings.casting_time == TRUE && op->casting_time > 0) 322 if (expect_true (!op->contr))
424 op->casting_time--; 323 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
425
426 if (op->speed_left <= 0)
427 op->speed_left += FABS (op->speed);
428 } 324 }
429 325
430 process_players2 (); 326 process_players2 ();
431} 327}
432 328
… …
446 342
447// send all clients some informational text 343// send all clients some informational text
448static void 344static void
449cleanup_inform (const char *cause, bool make_core) 345cleanup_inform (const char *cause, bool make_core)
450{ 346{
451 int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); 347 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
452 348
453 new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); 349 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
454 new_draw_info_format (flags, 0, 0, "Cause for this shtudown: %s\n", cause); 350 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
455 351
456 if (make_core) 352 if (make_core)
457 new_draw_info_format (flags, 0, 0, "This is considered a crash.\n"); 353 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
458 else 354 else
459 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown.\n"); 355 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");
460 356
461 new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); 357 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
462 358
463 flush_sockets (); 359 client::flush_sockets ();
464} 360}
465 361
466/* clean up everything before exiting */ 362/* clean up everything before exiting */
467void 363void
468cleanup (const char *cause, bool make_core) 364cleanup (const char *cause, bool make_core)
469{ 365{
470 if (make_core) 366 if (make_core)
471 if (!fork ()) 367 fork_abort (cause);
472 abort ();
473 368
474 LOG (llevError, "cleanup cause: %s\n", cause); 369 LOG (llevError, "cleanup cause: %s\n", cause);
475 370
476 if (!make_core) 371 if (!make_core)
477 cleanup_inform (cause, make_core); 372 cleanup_inform (cause, make_core);
… …
489 LOG (llevDebug, "running cleanup handlers.\n"); 384 LOG (llevDebug, "running cleanup handlers.\n");
490 INVOKE_GLOBAL (CLEANUP); 385 INVOKE_GLOBAL (CLEANUP);
491 386
492 LOG (llevDebug, "cleanup done.\n"); 387 LOG (llevDebug, "cleanup done.\n");
493 388
389 log_cleanup ();
390
494 if (make_core) 391 if (make_core)
495 {
496 cleanup_inform (cause, make_core); 392 cleanup_inform (cause, make_core);
497 _exit (1);
498 }
499 else 393 else
500 _exit (0);
501}
502
503int
504forbid_play (void)
505{
506#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
507 char buf[MAX_BUF], day[MAX_BUF];
508 FILE *fp;
509 time_t clock;
510 struct tm *tm;
511 int i, start, stop, forbit = 0, comp;
512
513 clock = time (NULL);
514 tm = (struct tm *) localtime (&clock);
515
516 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
517 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
518 return 0;
519
520 while (fgets (buf, MAX_BUF, fp))
521 {
522 if (buf[0] == '#')
523 continue;
524
525 if (!strncmp (buf, "msg", 3))
526 {
527 if (forbit)
528 while (fgets (buf, MAX_BUF, fp)) /* print message */
529 fputs (buf, logfile);
530 break;
531 }
532 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
533 {
534 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
535 continue;
536 }
537
538 for (i = 0; i < 7; i++)
539 {
540 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
541 forbit = 1;
542 }
543 } 394 {
395 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
396 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
397 client::flush_sockets ();
398 }
544 399
545 close_and_delete (fp, comp); 400 cfperl_cleanup (make_core);
546 401 _exit (make_core);
547 return forbit;
548#else
549 return 0;
550#endif
551} 402}
552 403
553/* 404/*
554 * do_specials() is a collection of functions to call from time to time. 405 * do_specials() is a collection of functions to call from time to time.
555 * Modified 2000-1-14 MSW to use the global pticks count to determine how 406 * Modified 2000-1-14 MSW to use the global pticks count to determine how
… …
561 * done on the same tick, but that will happen very infrequently 412 * done on the same tick, but that will happen very infrequently
562 * 413 *
563 * I also think this code makes it easier to see how often we really are 414 * I also think this code makes it easier to see how often we really are
564 * doing the various things. 415 * doing the various things.
565 */ 416 */
566
567extern unsigned long todtick;
568
569void 417void
570do_specials (void) 418do_specials (void)
571{ 419{
572 if (!(pticks % PTICKS_PER_CLOCK))
573 tick_the_clock ();
574
575 if (!(pticks % 7))
576 shstr::gc (); 420 shstr::gc ();
421 archetype::gc ();
577 422
423 if (expect_false (!(pticks % TICKS_PER_HOUR)))
424 adjust_daylight ();
425
578 if (!(pticks % 2503)) 426 if (expect_false (!(pticks % 2503)))
579 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 427 fix_weight (); /* Hack to fix weightproblems caused by bugs */
580 428
581 if (!(pticks % 5003)) 429 if (expect_false (!(pticks % 5003)))
582 write_book_archive (); 430 write_book_archive ();
583 431
584 if (!(pticks % 5009)) 432 if (expect_false (!(pticks % 5009)))
585 clean_friendly_list (); 433 clean_friendly_list ();
586 434
587 if (!(pticks % 5011)) 435 if (expect_false (!(pticks % 5011)))
588 obsolete_parties (); 436 obsolete_parties ();
589 437
590 if (!(pticks % 12503)) 438 if (expect_false (!(pticks % 12503)))
591 fix_luck (); 439 fix_luck ();
592} 440}
593 441
594void 442void
595server_tick () 443server_tick ()
596{ 444{
597 // first do the user visible stuff 445 // first do the user visible stuff
598 doeric_server ();
599 INVOKE_GLOBAL (CLOCK); 446 INVOKE_GLOBAL (CLOCK);
600 process_events (); /* "do" something with objects with speed */ 447 process_events (); // "do" something with objects with speed
601 flush_sockets (); 448 client::clock (); // draw client maps etc.
602 449
603 // then do some bookkeeping, should not really be here 450 // then do some bookkeeping, should not really be here
604 do_specials (); /* Routines called from time to time. */ 451 do_specials (); /* Routines called from time to time. */
605 attachable::check_mortals (); 452 attachable::check_mortals ();
606 453
607 ++pticks; 454 ++pticks;
608} 455}
609 456
457#if 0
458// used fro benchmarking (x86/amd64-specific)
459typedef unsigned long tval;
460typedef unsigned long long stamp64;
461
462extern inline tval
463stamp (void)
464{
465 tval tsc;
466 asm volatile ("rdtsc":"=a" (tsc)::"edx");
467
468 return tsc;
469}
470
471extern inline tval
472measure (tval t)
473{
474 tval tsc;
475 asm volatile ("rdtsc":"=a" (tsc)::"edx");
476
477 if (tsc > t)
478 return tsc - t;
479 else
480 return t - tsc;
481}
482
610int 483int
611main (int argc, char **argv) 484main (int argc, char **argv)
612{ 485{
486 rand_gen rg(0);
487 tval fastest = 0x7fffffff;
488 for (int loop = 10000; loop--; )
489 {
490 tval s = stamp ();
491 volatile int i = rg.get_int(25);
492 fastest = min (fastest, measure (s));
493 }
494
495 //printf ("fastest %d\n", fastest);
496 for (int i = 0; i < 1024*1024*3; ++i)
497 {
498 char c = rg.get_int (256);
499 write (2, &c, 1);
500 }
501}
502
503#else
504
505#if 0 // just goofing around, look elsewhere
506
507#include <malloc.h>
508#include <execinfo.h>
509
510static void tr_on ();
511static void tr_off ();
512
513static SMUTEX(tr_mutex);
514
515#define ltr_off() SMUTEX_LOCK (tr_mutex); tr_off ()
516#define ltr_on() tr_on (); SMUTEX_UNLOCK (tr_mutex);
517
518static void *
519tr_malloc (size_t size, const void *caller)
520{
521 ltr_off ();
522
523 void *bt [8];
524 backtrace (bt, 8);
525
526 void *ptr = malloc (size);
527
528 ltr_on ();
529 return (char *)ptr;
530}
531
532static void
533tr_free (void *ptr, const void *caller)
534{
535 ltr_off ();
536
537 free (ptr);
538
539 ltr_on ();
540}
541
542void static *
543tr_realloc (void *ptr, size_t size, const void *caller)
544{
545 ltr_off ();
546
547 void *nptr = realloc (ptr, size);
548
549 ltr_on ();
550 return nptr;
551}
552
553static void *
554tr_memalign (size_t size, size_t alignment, const void *caller)
555{
556 ltr_off ();
557
558 void *ptr = memalign (size, alignment < 16 ? 16 : alignment);
559
560 ltr_on ();
561 return ptr;
562}
563
564static void
565tr_on ()
566{
567 __malloc_hook = tr_malloc;
568 __realloc_hook = tr_realloc;
569 __free_hook = tr_free;
570 __memalign_hook = tr_memalign;
571}
572
573static void
574tr_off ()
575{
576 __malloc_hook = 0;
577 __realloc_hook = 0;
578 __free_hook = 0;
579 __memalign_hook = 0;
580}
581
582void (*__malloc_initialize_hook)(void) = tr_on;
583
584#endif
585
586// normal main
587int
588main (int argc, char **argv)
589{
613 settings.argc = argc; 590 settings.argc = argc;
614 settings.argv = argv; 591 settings.argv = argv;
615 592
593 g_thread_init (0); // for the slice allocator only
594
616 init (argc, argv); 595 init (argc, argv);
617
618 initPlugins ();
619 596
620 for (;;) 597 for (;;)
621 cfperl_main (); 598 cfperl_main ();
622} 599}
600#endif
623 601
602#if 0
603int xyzzy ()
604{
605 return rndm(8);
606}
607
608void xyzzy (object_ptr &a, object_ptr &o)
609{
610 asm volatile ("int3");
611 a = o;
612 asm volatile ("int3");
613}
614#endif
615

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines