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.111 by root, Sun Jun 24 04:09:29 2007 UTC vs.
Revision 1.143 by root, Fri Nov 6 13:31:47 2009 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 it 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * under the terms of the GNU General Public License as published by the Free 9 * the terms of the Affero GNU General Public License as published by the
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * 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 along 18 * You should have received a copy of the Affero GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * and the GNU General Public License along with this program. If not, see
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail to <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
36static char days[7][4] = {
37 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
38};
39
40void 38void
41version (object *op) 39version (object *op)
42{ 40{
43 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); 41 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION);
44
45 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
46 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
47 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
48 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>");
49 new_draw_info (NDI_UNIQUE, 0, op, "");
50 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:");
51 new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>");
52 new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>");
53 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>");
54 new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>");
55 new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>");
56 new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>");
57 new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>");
58 new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>");
59 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>");
60 new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>");
61 new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>");
62 new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>");
63 new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>");
64 new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>");
65 new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>");
66 new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>");
67 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>");
68 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>");
69 new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>");
70 new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>");
71 new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>");
72 new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>");
73 new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>");
74 new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>");
75 new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>");
76 new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>");
77 new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>");
78 new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>");
79 new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>");
80 new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>");
81 new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>");
82 new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>");
83 new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>");
84 new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>");
85 new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>");
86 new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>");
87 new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>");
88 new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>");
89 new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>");
90 new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n");
91 new_draw_info (NDI_UNIQUE, 0, op, "");
92 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
93 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
94 new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>");
95 new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>");
96 new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>");
97 new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>");
98 new_draw_info (NDI_UNIQUE, 0, op, "");
99 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
100} 42}
101 43
102/* This is a basic little function to put the player back to his 44/* This is a basic little function to put the player back to his
103 * savebed. We do some error checking - its possible that the 45 * savebed. We do some error checking - its possible that the
104 * savebed map may no longer exist, so we make sure the player 46 * savebed map may no longer exist, so we make sure the player
105 * goes someplace. 47 * goes someplace.
106 */ 48 */
107void 49void
108enter_player_savebed (object *op) 50enter_player_savebed (object *op)
109{ 51{
110 object *tmp = object::create (); 52 op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y);
111 EXIT_PATH (tmp) = op->contr->savebed_map;
112 EXIT_X (tmp) = op->contr->bed_x;
113 EXIT_Y (tmp) = op->contr->bed_y;
114 op->enter_exit (tmp);
115 tmp->destroy ();
116} 53}
117 54
118/* 55/*
119 * enter_map(): Moves the player and pets from current map (if any) to 56 * enter_map(): Moves the player and pets from current map (if any) to
120 * new map. map, x, y must be set. map is the map we are moving the 57 * new map. map, x, y must be set. map is the map we are moving the
123 * the function that calls this should figure them out. 60 * the function that calls this should figure them out.
124 */ 61 */
125void 62void
126object::enter_map (maptile *newmap, int x, int y) 63object::enter_map (maptile *newmap, int x, int y)
127{ 64{
128 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) 65 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
129 return; 66 return;
130 67
131 if (out_of_map (newmap, x, y)) 68 if (out_of_map (newmap, x, y))
132 { 69 {
133 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); 70 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
148 85
149 // remove, so stupid ob_locked does not trigger a failure 86 // remove, so stupid ob_locked does not trigger a failure
150 remove (); 87 remove ();
151 88
152 /* try to find a spot for the player */ 89 /* try to find a spot for the player */
153 if (ob_blocked (this, newmap, x, y)) 90 if (blocked (newmap, x, y))
154 { /* First choice blocked */ 91 { /* First choice blocked */
155 /* We try to find a spot for the player, starting closest in. 92 /* We try to find a spot for the player, starting closest in.
156 * We could use find_first_free_spot, but that doesn't randomize it at all, 93 * We could use find_first_free_spot, but that doesn't randomize it at all,
157 * So for example, if the north space is free, you would always end up there even 94 * So for example, if the north space is free, you would always end up there even
158 * if other spaces around are available. 95 * if other spaces around are available.
206 if (object *golem = contr->golem) 143 if (object *golem = contr->golem)
207 { 144 {
208 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); 145 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
209 146
210 if (i < 0) 147 if (i < 0)
211 golem->destroy (); 148 golem->drop_and_destroy ();
212 else 149 else
213 { 150 {
214 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); 151 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
215 golem->direction = find_dir_2 (x - golem->x, y - golem->y); 152 golem->direction = find_dir_2 (x - golem->x, y - golem->y);
216 } 153 }
268 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); 205 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
269 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); 206 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
270 } 207 }
271} 208}
272 209
273void 210static void
274process_events () 211process_events ()
275{ 212{
276 process_players1 (); 213 process_players1 ();
277 214
278 for_all_actives (op) 215 for_all_actives (op)
310 op->last_anim = 1; 247 op->last_anim = 1;
311 } 248 }
312 else 249 else
313 ++op->last_anim; 250 ++op->last_anim;
314 251
315 if (op->speed_left > 0.f) 252 if (expect_false (op->speed_left > 0.f))
316 { 253 {
317 --op->speed_left; 254 --op->speed_left;
318 process_object (op); 255 process_object (op);
319
320 if (op->destroyed ())
321 continue;
322 } 256 }
323 257
324 if (!op->contr) 258 if (expect_true (!op->contr))
325 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); 259 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
326 } 260 }
327 261
328 process_players2 (); 262 process_players2 ();
329} 263}
344 278
345// send all clients some informational text 279// send all clients some informational text
346static void 280static void
347cleanup_inform (const char *cause, bool make_core) 281cleanup_inform (const char *cause, bool make_core)
348{ 282{
349 int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); 283 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
350 284
351 new_draw_info_format (flags, 0, 0, "The server will now shutdown."); 285 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
352 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); 286 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
353 287
354 if (make_core) 288 if (make_core)
356 else 290 else
357 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now."); 291 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");
358 292
359 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); 293 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
360 294
361 flush_sockets (); 295 client::flush_sockets ();
362} 296}
363 297
364/* clean up everything before exiting */ 298/* clean up everything before exiting */
365void 299void
366cleanup (const char *cause, bool make_core) 300cleanup (const char *cause, bool make_core)
386 LOG (llevDebug, "running cleanup handlers.\n"); 320 LOG (llevDebug, "running cleanup handlers.\n");
387 INVOKE_GLOBAL (CLEANUP); 321 INVOKE_GLOBAL (CLEANUP);
388 322
389 LOG (llevDebug, "cleanup done.\n"); 323 LOG (llevDebug, "cleanup done.\n");
390 324
325 log_cleanup ();
326
391 if (make_core) 327 if (make_core)
392 {
393 cleanup_inform (cause, make_core); 328 cleanup_inform (cause, make_core);
394 cfperl_cleanup (make_core);
395 _exit (1);
396 }
397 else 329 else
398 { 330 {
399 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting."); 331 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
400 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); 332 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
401 flush_sockets (); 333 client::flush_sockets ();
334 }
335
402 cfperl_cleanup (make_core); 336 cfperl_cleanup (make_core);
403 _exit (0); 337 _exit (make_core);
404 }
405}
406
407int
408forbid_play (void)
409{
410#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
411 char buf[MAX_BUF], day[MAX_BUF];
412 FILE *fp;
413 time_t clock;
414 struct tm *tm;
415 int i, start, stop, forbit = 0, comp;
416
417 clock = time (NULL);
418 tm = (struct tm *) localtime (&clock);
419
420 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
421 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
422 return 0;
423
424 while (fgets (buf, MAX_BUF, fp))
425 {
426 if (buf[0] == '#')
427 continue;
428
429 if (!strncmp (buf, "msg", 3))
430 {
431 if (forbit)
432 while (fgets (buf, MAX_BUF, fp)) /* print message */
433 fputs (buf, logfile);
434 break;
435 }
436 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
437 {
438 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
439 continue;
440 }
441
442 for (i = 0; i < 7; i++)
443 {
444 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
445 forbit = 1;
446 }
447 }
448
449 close_and_delete (fp, comp);
450
451 return forbit;
452#else
453 return 0;
454#endif
455} 338}
456 339
457/* 340/*
458 * do_specials() is a collection of functions to call from time to time. 341 * do_specials() is a collection of functions to call from time to time.
459 * Modified 2000-1-14 MSW to use the global pticks count to determine how 342 * Modified 2000-1-14 MSW to use the global pticks count to determine how
465 * done on the same tick, but that will happen very infrequently 348 * done on the same tick, but that will happen very infrequently
466 * 349 *
467 * I also think this code makes it easier to see how often we really are 350 * I also think this code makes it easier to see how often we really are
468 * doing the various things. 351 * doing the various things.
469 */ 352 */
470void 353static void
471do_specials (void) 354do_specials (void)
472{ 355{
356 shstr::gc ();
357 archetype::gc ();
358
473 if (expect_false (!(pticks % TICKS_PER_HOUR))) 359 if (expect_false (!(pticks % TICKS_PER_HOUR)))
474 adjust_daylight (); 360 maptile::adjust_daylight ();
475
476 if (expect_false (!(pticks % 7)))
477 shstr::gc ();
478 361
479 if (expect_false (!(pticks % 2503))) 362 if (expect_false (!(pticks % 2503)))
480 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 363 fix_weight (); /* Hack to fix weightproblems caused by bugs */
481 364
482 if (expect_false (!(pticks % 5003))) 365 if (expect_false (!(pticks % 5003)))
494 377
495void 378void
496server_tick () 379server_tick ()
497{ 380{
498 // first do the user visible stuff 381 // first do the user visible stuff
499 doeric_server ();
500 INVOKE_GLOBAL (CLOCK); 382 INVOKE_GLOBAL (CLOCK);
501 process_events (); /* "do" something with objects with speed */ 383 process_events (); // "do" something with objects with speed
502 flush_sockets (); 384 client::clock (); // draw client maps etc.
503 385
504 // then do some bookkeeping, should not really be here 386 // then do some bookkeeping, should not really be here
505 do_specials (); /* Routines called from time to time. */ 387 do_specials (); /* Routines called from time to time. */
506 attachable::check_mortals (); 388 attachable::check_mortals ();
507 389
508 ++pticks; 390 ++pticks;
509} 391}
510 392
511#if 0
512// used fro benchmarking (x86/amd64-specific)
513typedef unsigned long tval;
514typedef unsigned long long stamp64;
515
516extern inline tval
517stamp (void)
518{
519 tval tsc;
520 asm volatile ("rdtsc":"=a" (tsc)::"edx");
521
522 return tsc;
523}
524
525extern inline tval
526measure (tval t)
527{
528 tval tsc;
529 asm volatile ("rdtsc":"=a" (tsc)::"edx");
530
531 if (tsc > t)
532 return tsc - t;
533 else
534 return t - tsc;
535}
536
537int
538main (int argc, char **argv)
539{
540 rand_gen rg(0);
541 tval fastest = 0x7fffffff;
542 for (int loop = 10000; loop--; )
543 {
544 tval s = stamp ();
545 volatile int i = rg.get_int(25);
546 fastest = min (fastest, measure (s));
547 }
548
549 //printf ("fastest %d\n", fastest);
550 for (int i = 0; i < 1024*1024*3; ++i)
551 {
552 char c = rg.get_int (256);
553 write (2, &c, 1);
554 }
555}
556
557#else
558
559// normal main 393// normal main
560int 394int
561main (int argc, char **argv) 395main (int argc, char **argv)
562{ 396{
563 settings.argc = argc; 397 settings.argc = argc;
564 settings.argv = argv; 398 settings.argv = argv;
399
400 rndm.seed (time (0));
401 g_thread_init (0); // for the slice allocator only
565 402
566 init (argc, argv); 403 init (argc, argv);
567
568 initPlugins ();
569 404
570 for (;;) 405 for (;;)
571 cfperl_main (); 406 cfperl_main ();
572} 407}
573#endif
574 408

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines