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.114 by root, Wed Sep 5 05:48:36 2007 UTC vs.
Revision 1.133 by root, Mon Sep 29 10:31:32 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT 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 3 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,
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, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24#include <global.h> 24#include <global.h>
25#include <object.h> 25#include <object.h>
26#include <tod.h> 26#include <tod.h>
27 27
28#include <sproto.h> 28#include <sproto.h>
29#include <time.h> 29#include <time.h>
30 30
31#include <glib.h>
32
31#include <../random_maps/random_map.h> 33#include <../random_maps/random_map.h>
32#include <../random_maps/rproto.h> 34#include <../random_maps/rproto.h>
33#include "path.h" 35#include "path.h"
34 36
35static char days[7][4] = { 37static char days[7][4] = {
37}; 39};
38 40
39void 41void
40version (object *op) 42version (object *op)
41{ 43{
42 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);
43 45
46#if 0
44 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:");
45 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>");
46 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>");
47 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>");
48 new_draw_info (NDI_UNIQUE, 0, op, ""); 51 new_draw_info (NDI_UNIQUE, 0, op, "");
94 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>");
95 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>");
96 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>");
97 new_draw_info (NDI_UNIQUE, 0, op, ""); 100 new_draw_info (NDI_UNIQUE, 0, op, "");
98 new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); 101 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
102#endif
99} 103}
100 104
101/* 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
102 * savebed. We do some error checking - its possible that the 106 * savebed. We do some error checking - its possible that the
103 * 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
104 * goes someplace. 108 * goes someplace.
105 */ 109 */
106void 110void
107enter_player_savebed (object *op) 111enter_player_savebed (object *op)
108{ 112{
109 object *tmp = object::create (); 113 op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y);
110 EXIT_PATH (tmp) = op->contr->savebed_map;
111 EXIT_X (tmp) = op->contr->bed_x;
112 EXIT_Y (tmp) = op->contr->bed_y;
113 op->enter_exit (tmp);
114 tmp->destroy ();
115} 114}
116 115
117/* 116/*
118 * 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
119 * 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
122 * the function that calls this should figure them out. 121 * the function that calls this should figure them out.
123 */ 122 */
124void 123void
125object::enter_map (maptile *newmap, int x, int y) 124object::enter_map (maptile *newmap, int x, int y)
126{ 125{
127 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) 126 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
128 return; 127 return;
129 128
130 if (out_of_map (newmap, x, y)) 129 if (out_of_map (newmap, x, y))
131 { 130 {
132 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);
147 146
148 // remove, so stupid ob_locked does not trigger a failure 147 // remove, so stupid ob_locked does not trigger a failure
149 remove (); 148 remove ();
150 149
151 /* try to find a spot for the player */ 150 /* try to find a spot for the player */
152 if (ob_blocked (this, newmap, x, y)) 151 if (blocked (newmap, x, y))
153 { /* First choice blocked */ 152 { /* First choice blocked */
154 /* 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.
155 * 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,
156 * 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
157 * if other spaces around are available. 156 * if other spaces around are available.
205 if (object *golem = contr->golem) 204 if (object *golem = contr->golem)
206 { 205 {
207 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); 206 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
208 207
209 if (i < 0) 208 if (i < 0)
210 golem->destroy (); 209 golem->drop_and_destroy ();
211 else 210 else
212 { 211 {
213 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); 212 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
214 golem->direction = find_dir_2 (x - golem->x, y - golem->y); 213 golem->direction = find_dir_2 (x - golem->x, y - golem->y);
215 } 214 }
309 op->last_anim = 1; 308 op->last_anim = 1;
310 } 309 }
311 else 310 else
312 ++op->last_anim; 311 ++op->last_anim;
313 312
314 if (op->speed_left > 0.f) 313 if (expect_false (op->speed_left > 0.f))
315 { 314 {
316 --op->speed_left; 315 --op->speed_left;
317 process_object (op); 316 process_object (op);
318
319 if (op->destroyed ())
320 continue;
321 } 317 }
322 318
323 if (!op->contr) 319 if (expect_true (!op->contr))
324 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); 320 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
325 } 321 }
326 322
327 process_players2 (); 323 process_players2 ();
328} 324}
385 LOG (llevDebug, "running cleanup handlers.\n"); 381 LOG (llevDebug, "running cleanup handlers.\n");
386 INVOKE_GLOBAL (CLEANUP); 382 INVOKE_GLOBAL (CLEANUP);
387 383
388 LOG (llevDebug, "cleanup done.\n"); 384 LOG (llevDebug, "cleanup done.\n");
389 385
386 log_cleanup ();
387
390 if (make_core) 388 if (make_core)
391 {
392 cleanup_inform (cause, make_core); 389 cleanup_inform (cause, make_core);
393 cfperl_cleanup (make_core);
394 _exit (1);
395 }
396 else 390 else
397 { 391 {
398 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting."); 392 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
399 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); 393 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
400 client::flush_sockets (); 394 client::flush_sockets ();
395 }
396
401 cfperl_cleanup (make_core); 397 cfperl_cleanup (make_core);
402 _exit (0); 398 _exit (make_core);
403 }
404}
405
406int
407forbid_play (void)
408{
409#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
410 char buf[MAX_BUF], day[MAX_BUF];
411 FILE *fp;
412 time_t clock;
413 struct tm *tm;
414 int i, start, stop, forbit = 0, comp;
415
416 clock = time (NULL);
417 tm = (struct tm *) localtime (&clock);
418
419 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
420 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
421 return 0;
422
423 while (fgets (buf, MAX_BUF, fp))
424 {
425 if (buf[0] == '#')
426 continue;
427
428 if (!strncmp (buf, "msg", 3))
429 {
430 if (forbit)
431 while (fgets (buf, MAX_BUF, fp)) /* print message */
432 fputs (buf, logfile);
433 break;
434 }
435 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
436 {
437 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
438 continue;
439 }
440
441 for (i = 0; i < 7; i++)
442 {
443 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
444 forbit = 1;
445 }
446 }
447
448 close_and_delete (fp, comp);
449
450 return forbit;
451#else
452 return 0;
453#endif
454} 399}
455 400
456/* 401/*
457 * do_specials() is a collection of functions to call from time to time. 402 * do_specials() is a collection of functions to call from time to time.
458 * Modified 2000-1-14 MSW to use the global pticks count to determine how 403 * Modified 2000-1-14 MSW to use the global pticks count to determine how
467 * doing the various things. 412 * doing the various things.
468 */ 413 */
469void 414void
470do_specials (void) 415do_specials (void)
471{ 416{
417 shstr::gc ();
418 archetype::gc ();
419
472 if (expect_false (!(pticks % TICKS_PER_HOUR))) 420 if (expect_false (!(pticks % TICKS_PER_HOUR)))
473 adjust_daylight (); 421 adjust_daylight ();
474
475 if (expect_false (!(pticks % 7)))
476 shstr::gc ();
477 422
478 if (expect_false (!(pticks % 2503))) 423 if (expect_false (!(pticks % 2503)))
479 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 424 fix_weight (); /* Hack to fix weightproblems caused by bugs */
480 425
481 if (expect_false (!(pticks % 5003))) 426 if (expect_false (!(pticks % 5003)))
552 } 497 }
553} 498}
554 499
555#else 500#else
556 501
502#if 0 // just goofing around, look elsewhere
503
504#include <malloc.h>
505#include <execinfo.h>
506
507static void tr_on ();
508static void tr_off ();
509
510static SMUTEX(tr_mutex);
511
512#define ltr_off() SMUTEX_LOCK (tr_mutex); tr_off ()
513#define ltr_on() tr_on (); SMUTEX_UNLOCK (tr_mutex);
514
515static void *
516tr_malloc (size_t size, const void *caller)
517{
518 ltr_off ();
519
520 void *bt [8];
521 backtrace (bt, 8);
522
523 void *ptr = malloc (size);
524
525 ltr_on ();
526 return (char *)ptr;
527}
528
529static void
530tr_free (void *ptr, const void *caller)
531{
532 ltr_off ();
533
534 free (ptr);
535
536 ltr_on ();
537}
538
539void static *
540tr_realloc (void *ptr, size_t size, const void *caller)
541{
542 ltr_off ();
543
544 void *nptr = realloc (ptr, size);
545
546 ltr_on ();
547 return nptr;
548}
549
550static void *
551tr_memalign (size_t size, size_t alignment, const void *caller)
552{
553 ltr_off ();
554
555 void *ptr = memalign (size, alignment < 16 ? 16 : alignment);
556
557 ltr_on ();
558 return ptr;
559}
560
561static void
562tr_on ()
563{
564 __malloc_hook = tr_malloc;
565 __realloc_hook = tr_realloc;
566 __free_hook = tr_free;
567 __memalign_hook = tr_memalign;
568}
569
570static void
571tr_off ()
572{
573 __malloc_hook = 0;
574 __realloc_hook = 0;
575 __free_hook = 0;
576 __memalign_hook = 0;
577}
578
579void (*__malloc_initialize_hook)(void) = tr_on;
580
581#endif
582
557// normal main 583// normal main
558int 584int
559main (int argc, char **argv) 585main (int argc, char **argv)
560{ 586{
561 settings.argc = argc; 587 settings.argc = argc;
562 settings.argv = argv; 588 settings.argv = argv;
563 589
590 g_thread_init (0); // for the slice allocator only
591
564 init (argc, argv); 592 init (argc, argv);
565
566 initPlugins ();
567 593
568 for (;;) 594 for (;;)
569 cfperl_main (); 595 cfperl_main ();
570} 596}
571#endif 597#endif
572 598
599#if 0
600int xyzzy ()
601{
602 return rndm(8);
603}
604
605void xyzzy (object_ptr &a, object_ptr &o)
606{
607 asm volatile ("int3");
608 a = o;
609 asm volatile ("int3");
610}
611#endif
612

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines