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.104 by root, Thu May 17 14:14:55 2007 UTC vs.
Revision 1.139 by root, Mon Oct 12 14:00:59 2009 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 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
36static char days[7][4] = { 38static char days[7][4] = {
… …
38}; 40};
39 41
40void 42void
41version (object *op) 43version (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 */
110void 111void
111enter_player_savebed (object *op) 112enter_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 */
128void 124void
129object::enter_map (maptile *newmap, int x, int y) 125object::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.f && 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 {
266 object *ob = pl->ob; 252 object *ob = pl->ob;
267 253
268 if (!ob || !pl->ns || !ob->active) 254 if (expect_false (!ob || !pl->ns || !ob->active))
269 continue; 255 continue;
270
271 // process_events might steal us one speed slot, so adjust accordingly
272 if (ob->speed_left > 0.f)
273 ++ob->speed_left;
274 256
275 do_some_living (ob); 257 do_some_living (ob);
276 } 258 }
277} 259}
278 260
… …
280process_players2 () 262process_players2 ()
281{ 263{
282 /* 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 */
283 for_all_players (pl) 265 for_all_players (pl)
284 { 266 {
285 if (pl->has_hit) 267 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
286 {
287 pl->ob->speed_left = min (pl->weapon_speed (), pl->ob->speed_left + pl->weapon_speed ());
288
289 if (pl->ob->speed_left > 0.f)
290 pl->has_hit = 0;
291 }
292 else
293 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); 268 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
294 } 269 }
295} 270}
296 271
297void 272void
298process_events () 273process_events ()
… …
300 process_players1 (); 275 process_players1 ();
301 276
302 for_all_actives (op) 277 for_all_actives (op)
303 { 278 {
304 /* Now process op */ 279 /* Now process op */
305 if (QUERY_FLAG (op, FLAG_FREED)) 280 if (expect_false (QUERY_FLAG (op, FLAG_FREED)))
306 { 281 {
307 LOG (llevError, "BUG: process_events(): Free object on list\n"); 282 LOG (llevError, "BUG: process_events(): Free object on list\n");
308 op->set_speed (0); 283 op->set_speed (0);
309 continue; 284 continue;
310 } 285 }
311 286
312 if (!op->has_active_speed ()) 287 if (expect_false (!op->has_active_speed ()))
313 { 288 {
314 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " 289 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
315 "but is on active list\n", op->debug_desc (), op->speed); 290 "but is on active list\n", op->debug_desc (), op->speed);
316 op->set_speed (0); 291 op->set_speed (0);
317 continue; 292 continue;
318 } 293 }
319 294
320 if (op->flag [FLAG_REMOVED]) 295 if (expect_false (op->flag [FLAG_REMOVED]))
321 { 296 {
322 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",
323 op->debug_desc ()); 298 op->debug_desc ());
324 op->set_speed (0); 299 op->set_speed (0);
325 continue; 300 continue;
… …
334 op->last_anim = 1; 309 op->last_anim = 1;
335 } 310 }
336 else 311 else
337 ++op->last_anim; 312 ++op->last_anim;
338 313
339 if (op->speed_left > 0.f) 314 if (expect_false (op->speed_left > 0.f))
340 { 315 {
341 --op->speed_left; 316 --op->speed_left;
342 process_object (op); 317 process_object (op);
343
344 if (op->destroyed ())
345 continue;
346 } 318 }
347 319
348 if (!op->contr) 320 if (expect_true (!op->contr))
349 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); 321 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
350 } 322 }
351 323
352 process_players2 (); 324 process_players2 ();
353} 325}
… …
368 340
369// send all clients some informational text 341// send all clients some informational text
370static void 342static void
371cleanup_inform (const char *cause, bool make_core) 343cleanup_inform (const char *cause, bool make_core)
372{ 344{
373 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);
374 346
375 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.");
376 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);
377 349
378 if (make_core) 350 if (make_core)
379 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.");
380 else 352 else
381 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.");
382 354
383 new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); 355 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
384 356
385 flush_sockets (); 357 client::flush_sockets ();
386} 358}
387 359
388/* clean up everything before exiting */ 360/* clean up everything before exiting */
389void 361void
390cleanup (const char *cause, bool make_core) 362cleanup (const char *cause, bool make_core)
… …
410 LOG (llevDebug, "running cleanup handlers.\n"); 382 LOG (llevDebug, "running cleanup handlers.\n");
411 INVOKE_GLOBAL (CLEANUP); 383 INVOKE_GLOBAL (CLEANUP);
412 384
413 LOG (llevDebug, "cleanup done.\n"); 385 LOG (llevDebug, "cleanup done.\n");
414 386
387 log_cleanup ();
388
415 if (make_core) 389 if (make_core)
416 {
417 cleanup_inform (cause, make_core); 390 cleanup_inform (cause, make_core);
418 cfperl_cleanup (make_core);
419 _exit (1);
420 }
421 else 391 else
422 { 392 {
423 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.");
424 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);
425 flush_sockets (); 395 client::flush_sockets ();
396 }
397
426 cfperl_cleanup (make_core); 398 cfperl_cleanup (make_core);
427 _exit (0); 399 _exit (make_core);
428 }
429}
430
431int
432forbid_play (void)
433{
434#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
435 char buf[MAX_BUF], day[MAX_BUF];
436 FILE *fp;
437 time_t clock;
438 struct tm *tm;
439 int i, start, stop, forbit = 0, comp;
440
441 clock = time (NULL);
442 tm = (struct tm *) localtime (&clock);
443
444 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
445 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
446 return 0;
447
448 while (fgets (buf, MAX_BUF, fp))
449 {
450 if (buf[0] == '#')
451 continue;
452
453 if (!strncmp (buf, "msg", 3))
454 {
455 if (forbit)
456 while (fgets (buf, MAX_BUF, fp)) /* print message */
457 fputs (buf, logfile);
458 break;
459 }
460 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
461 {
462 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
463 continue;
464 }
465
466 for (i = 0; i < 7; i++)
467 {
468 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
469 forbit = 1;
470 }
471 }
472
473 close_and_delete (fp, comp);
474
475 return forbit;
476#else
477 return 0;
478#endif
479} 400}
480 401
481/* 402/*
482 * 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.
483 * 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
… …
492 * doing the various things. 413 * doing the various things.
493 */ 414 */
494void 415void
495do_specials (void) 416do_specials (void)
496{ 417{
497 if (!(pticks % TICKS_PER_HOUR))
498 adjust_daylight ();
499
500 if (!(pticks % 7))
501 shstr::gc (); 418 shstr::gc ();
419 archetype::gc ();
502 420
421 if (expect_false (!(pticks % TICKS_PER_HOUR)))
422 maptile::adjust_daylight ();
423
503 if (!(pticks % 2503)) 424 if (expect_false (!(pticks % 2503)))
504 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 425 fix_weight (); /* Hack to fix weightproblems caused by bugs */
505 426
506 if (!(pticks % 5003)) 427 if (expect_false (!(pticks % 5003)))
507 write_book_archive (); 428 write_book_archive ();
508 429
509 if (!(pticks % 5009)) 430 if (expect_false (!(pticks % 5009)))
510 clean_friendly_list (); 431 clean_friendly_list ();
511 432
512 if (!(pticks % 5011)) 433 if (expect_false (!(pticks % 5011)))
513 obsolete_parties (); 434 obsolete_parties ();
514 435
515 if (!(pticks % 12503)) 436 if (expect_false (!(pticks % 12503)))
516 fix_luck (); 437 fix_luck ();
517} 438}
518 439
519void 440void
520server_tick () 441server_tick ()
521{ 442{
522 // first do the user visible stuff 443 // first do the user visible stuff
523 doeric_server ();
524 INVOKE_GLOBAL (CLOCK); 444 INVOKE_GLOBAL (CLOCK);
525 process_events (); /* "do" something with objects with speed */ 445 process_events (); // "do" something with objects with speed
526 flush_sockets (); 446 client::clock (); // draw client maps etc.
527 447
528 // then do some bookkeeping, should not really be here 448 // then do some bookkeeping, should not really be here
529 do_specials (); /* Routines called from time to time. */ 449 do_specials (); /* Routines called from time to time. */
530 attachable::check_mortals (); 450 attachable::check_mortals ();
531 451
532 ++pticks; 452 ++pticks;
533} 453}
534 454
535#if 0
536// used fro benchmarking (x86/amd64-specific)
537typedef unsigned long tval;
538typedef unsigned long long stamp64;
539
540extern inline tval
541stamp (void)
542{
543 tval tsc;
544 asm volatile ("rdtsc":"=a" (tsc)::"edx");
545
546 return tsc;
547}
548
549extern inline tval
550measure (tval t)
551{
552 tval tsc;
553 asm volatile ("rdtsc":"=a" (tsc)::"edx");
554
555 if (tsc > t)
556 return tsc - t;
557 else
558 return t - tsc;
559}
560
561int
562main (int argc, char **argv)
563{
564 rand_gen rg(0);
565 tval fastest = 0x7fffffff;
566 for (int loop = 10000; loop--; )
567 {
568 tval s = stamp ();
569 volatile int i = rg.get_int(25);
570 fastest = min (fastest, measure (s));
571 }
572
573 //printf ("fastest %d\n", fastest);
574 for (int i = 0; i < 1024*1024*3; ++i)
575 {
576 char c = rg.get_int (256);
577 write (2, &c, 1);
578 }
579}
580
581#else
582
583// normal main 455// normal main
584int 456int
585main (int argc, char **argv) 457main (int argc, char **argv)
586{ 458{
587 settings.argc = argc; 459 settings.argc = argc;
588 settings.argv = argv; 460 settings.argv = argv;
461
462 rndm.seed (time (0));
463 g_thread_init (0); // for the slice allocator only
589 464
590 init (argc, argv); 465 init (argc, argv);
591
592 initPlugins ();
593 466
594 for (;;) 467 for (;;)
595 cfperl_main (); 468 cfperl_main ();
596} 469}
597#endif
598 470

Diff Legend

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