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.163 by root, Tue May 4 20:25:59 2010 UTC vs.
Revision 1.174 by root, Tue Jan 3 11:25:36 2012 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify it under 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 9 * the terms of the Affero GNU General Public License as published by the
29#include <sproto.h> 29#include <sproto.h>
30#include <time.h> 30#include <time.h>
31 31
32#include <glib.h> 32#include <glib.h>
33 33
34#include <../random_maps/random_map.h> 34#include <rmg.h>
35#include <../random_maps/rproto.h> 35#include <rproto.h>
36#include "path.h" 36#include "path.h"
37 37
38void 38void
39version (object *op) 39version (object *op)
40{ 40{
58 * the function that calls this should figure them out. 58 * the function that calls this should figure them out.
59 */ 59 */
60bool 60bool
61object::enter_map (maptile *newmap, int x, int y) 61object::enter_map (maptile *newmap, int x, int y)
62{ 62{
63 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) 63 if (destroyed () || !newmap || !newmap->linkable ())
64 return false; 64 return false;
65 65
66 if (out_of_map (newmap, x, y)) 66 if (out_of_map (newmap, x, y))
67 { 67 {
68 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); 68 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
103 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); 103 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
104 } 104 }
105 105
106 if (i >= 0) 106 if (i >= 0)
107 { 107 {
108 maptile *m = newmap;
108 sint16 nx = x + freearr_x[i]; 109 sint16 nx = x + freearr_x[i];
109 sint16 ny = y + freearr_y[i]; 110 sint16 ny = y + freearr_y[i];
110 111
111 if (xy_normalise (newmap, nx, ny)) 112 if (xy_normalise (m, nx, ny))
112 { 113 {
114 newmap = m;
113 x = nx; 115 x = nx;
114 y = ny; 116 y = ny;
115 } 117 }
116 } 118 }
117 else 119 else
128 return false; 130 return false;
129 } 131 }
130 132
131 enemy = 0; 133 enemy = 0;
132 134
135 newmap->activate (); // workaround for activate activating everyhing on the map, includign the palyer on the {link} map
133 //newmap->insert (this, x, y); 136 //newmap->insert (this, x, y);
134 newmap->insert (this, x, y, 0, INS_NO_AUTO_EXIT); 137 newmap->insert (this, x, y, 0, INS_NO_AUTO_EXIT);
138 prefetch_surrounding_maps ();
135 139
136 if (map == newmap) // see if we actually arrived there - insert might trigger a teleport 140 if (map == newmap) // see if we actually arrived there - insert might trigger a teleport
137 { 141 {
138 if (contr) 142 if (contr)
139 { 143 {
366 _exit (make_core); 370 _exit (make_core);
367} 371}
368 372
369/* 373/*
370 * do_specials() is a collection of functions to call from time to time. 374 * do_specials() is a collection of functions to call from time to time.
371 * Modified 2000-1-14 MSW to use the global pticks count to determine how 375 * Modified 2000-1-14 MSW to use the global server_tick count to determine how
372 * often to do things. This will allow us to spred them out more often. 376 * often to do things. This will allow us to spred them out more often.
373 * I use prime numbers for the factor count - in that way, it is less likely 377 * I use prime numbers for the factor count - in that way, it is less likely
374 * these actions will fall on the same tick (compared to say using 500/2500/15000 378 * these actions will fall on the same tick (compared to say using 500/2500/15000
375 * which would mean on that 15,000 tick count a whole bunch of stuff gets 379 * which would mean on that 15,000 tick count a whole bunch of stuff gets
376 * done). Of course, there can still be times where multiple specials are 380 * done). Of course, there can still be times where multiple specials are
383do_specials () 387do_specials ()
384{ 388{
385 shstr::gc (); 389 shstr::gc ();
386 archetype::gc (); 390 archetype::gc ();
387 391
388 if (expect_false (!(pticks % TICKS_PER_HOUR))) 392 if (expect_false (!(server_tick % TICKS_PER_HOUR)))
389 maptile::adjust_daylight (); 393 maptile::adjust_daylight ();
390 394
391 if (expect_false (!(pticks % 2503))) 395 if (expect_false (!(server_tick % 2503)))
392 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 396 fix_weight (); /* Hack to fix weightproblems caused by bugs */
393 397
394 if (expect_false (!(pticks % 5003))) 398 if (expect_false (!(server_tick % 5003)))
395 write_book_archive (); 399 write_book_archive ();
396 400
397 if (expect_false (!(pticks % 5009))) 401 if (expect_false (!(server_tick % 5009)))
398 clean_friendly_list (); 402 clean_friendly_list ();
399 403
400 if (expect_false (!(pticks % 5011))) 404 if (expect_false (!(server_tick % 5011)))
401 obsolete_parties (); 405 obsolete_parties ();
402 406
403 if (expect_false (!(pticks % 12503))) 407 if (expect_false (!(server_tick % 12503)))
404 fix_luck (); 408 fix_luck ();
405} 409}
406 410
407void 411void
408server_tick () 412one_tick ()
409{ 413{
410 // first do the user visible stuff 414 // first do the user visible stuff
411 INVOKE_GLOBAL (CLOCK); 415 INVOKE_GLOBAL (CLOCK);
412 process_events (); // "do" something with objects with speed 416 process_events (); // "do" something with objects with speed
413 client::clock (); // draw client maps etc. 417 client::clock (); // draw client maps etc.
414 418
415 // then do some bookkeeping, should not really be here 419 // then do some bookkeeping, should not really be here
416 do_specials (); /* Routines called from time to time. */ 420 do_specials (); /* Routines called from time to time. */
417 attachable::check_mortals (); 421 attachable::check_mortals ();
418 422
419 ++pticks; 423 // now that we aggressively reuse id's, this is very unlikely to happen...
420
421 if (object::object_count >= RESTART_COUNT) 424 if (object::object_count >= RESTART_COUNT)
422 cleanup ("running out of protocol ID values - need full restart"); 425 cleanup ("running out of protocol ID values - need full restart");
423} 426}
424 427
425// normal main 428// normal main
426int 429int
427main (int argc, char **argv) 430main (int argc, char **argv)
428{ 431{
429 settings.argc = argc; 432 settings.argc = argc;
430 settings.argv = argv; 433 settings.argv = argv;
431 434
432 rndm.seed (time (0)); 435 rndm.seed (time (0));
433 g_thread_init (0); // for the slice allocator only 436 g_thread_init (0); // for the slice allocator only
434 437
438 // temporary(?) testing hack
439 if (argc >= 2 && !strcmp (argv [1], "--noise"))
440 {
441 void noise_test ();
442 noise_test ();
443 exit (0);
444 }
445
446#if 0
447 // code sometiems used for timing benchmarks
448 random_number_generator<freeciv_random_generator> rng;
449 rng.seed(0);
450 for (int i = 0; i < 10; ++i)
451 printf ("%08x\n", rng.get_u32());
452 for (int i = 0; i < 1000000; ++i)
453 volatile int r = rng.get_u32 ();
454 cstamp s = stamp ();
455 for (int i = 0; i < 1000000; ++i)
456 volatile int r = rng.next ();
457 printf ("c %d\n", (int)measure (s));
458 exit (0);
459#endif
460
435 init (argc, argv); 461 init (argc, argv);
436 462
437 for (;;) 463 for (;;)
438 cfperl_main (); 464 cfperl_main ();
439} 465}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines