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.162 by root, Sun May 2 19:16:16 2010 UTC vs.
Revision 1.179 by root, Sat Nov 17 23:33:18 2018 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,2013,2014,2015,2016 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
10 * Free Software Foundation, either version 3 of the License, or (at your 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * 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 Affero GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * and the GNU General Public License along with this program. If not, see 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail to <support@deliantra.net> 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>
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 x += freearr_x[i]; 108 maptile *m = newmap;
109 y += freearr_y[i]; 109 sint16 nx = x + DIRX (i);
110 sint16 ny = y + DIRY (i);
111
112 if (xy_normalise (m, nx, ny))
113 {
114 newmap = m;
115 x = nx;
116 y = ny;
117 }
110 } 118 }
111 else 119 else
112 /* not much we can do in this case. */ 120 /* not much we can do in this case. */
113 LOG (llevInfo, "enter_map: Could not find free spot for player - will dump on top of object (%s: %d, %d)\n", &newmap->path, x, y); 121 LOG (llevInfo, "enter_map: Could not find free spot for player - will dump on top of object (%s: %d, %d)\n", &newmap->path, x, y);
114 } 122 }
122 return false; 130 return false;
123 } 131 }
124 132
125 enemy = 0; 133 enemy = 0;
126 134
135 newmap->activate (); // workaround for activate activating everyhing on the map, includign the palyer on the {link} map
127 //newmap->insert (this, x, y); 136 //newmap->insert (this, x, y);
128 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 ();
129 139
130 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
131 { 141 {
132 if (contr) 142 if (contr)
133 { 143 {
141 151
142 if (i < 0) 152 if (i < 0)
143 golem->drop_and_destroy (); 153 golem->drop_and_destroy ();
144 else 154 else
145 { 155 {
146 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); 156 newmap->insert (golem, x + DIRX (i), y + DIRY (i));
147 golem->direction = find_dir_2 (golem->x - x, golem->y - y); 157 golem->direction = find_dir_2 (golem->x - x, golem->y - y);
148 } 158 }
149 } 159 }
150 } 160 }
151 161
227 // used for the inner loop 237 // used for the inner loop
228 if (_i < actives.size ()) // HACK, rely on _i :/ 238 if (_i < actives.size ()) // HACK, rely on _i :/
229 { 239 {
230 object *next = actives [_i + 1]; 240 object *next = actives [_i + 1];
231 241
232 prefetch (&next->flag , 0, 1); 242 ecb_prefetch (&next->flag , 0, 1);
233 prefetch (&next->speed , 0, 1); 243 ecb_prefetch (&next->speed , 0, 1);
234 prefetch (&next->anim_speed, 0, 1); 244 ecb_prefetch (&next->anim_speed, 0, 1);
235 prefetch (&next->contr , 0, 1); 245 ecb_prefetch (&next->contr , 0, 1);
236 } 246 }
237 247
238 /* Now process op */ 248 /* Now process op */
239 if (expect_false (op->flag [FLAG_FREED])) 249 if (expect_false (op->flag [FLAG_FREED]))
240 { 250 {
360 _exit (make_core); 370 _exit (make_core);
361} 371}
362 372
363/* 373/*
364 * 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.
365 * 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
366 * 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.
367 * 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
368 * 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
369 * 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
370 * 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
377do_specials () 387do_specials ()
378{ 388{
379 shstr::gc (); 389 shstr::gc ();
380 archetype::gc (); 390 archetype::gc ();
381 391
382 if (expect_false (!(pticks % TICKS_PER_HOUR))) 392 if (expect_false (!(server_tick % TICKS_PER_HOUR)))
383 maptile::adjust_daylight (); 393 maptile::adjust_daylight ();
384 394
385 if (expect_false (!(pticks % 2503))) 395 if (expect_false (!(server_tick % 2503)))
386 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 396 fix_weight (); /* Hack to fix weightproblems caused by bugs */
387 397
388 if (expect_false (!(pticks % 5003))) 398 if (expect_false (!(server_tick % 5003)))
389 write_book_archive (); 399 write_book_archive ();
390 400
391 if (expect_false (!(pticks % 5009))) 401 if (expect_false (!(server_tick % 5009)))
392 clean_friendly_list (); 402 clean_friendly_list ();
393 403
394 if (expect_false (!(pticks % 5011))) 404 if (expect_false (!(server_tick % 5011)))
395 obsolete_parties (); 405 obsolete_parties ();
396 406
397 if (expect_false (!(pticks % 12503))) 407 if (expect_false (!(server_tick % 12503)))
398 fix_luck (); 408 fix_luck ();
399} 409}
400 410
401void 411void
402server_tick () 412one_tick ()
403{ 413{
404 // first do the user visible stuff 414 // first do the user visible stuff
405 INVOKE_GLOBAL (CLOCK); 415 INVOKE_GLOBAL (CLOCK);
406 process_events (); // "do" something with objects with speed 416 process_events (); // "do" something with objects with speed
407 client::clock (); // draw client maps etc. 417 client::clock (); // draw client maps etc.
408 418
409 // then do some bookkeeping, should not really be here 419 // then do some bookkeeping, should not really be here
410 do_specials (); /* Routines called from time to time. */ 420 do_specials (); /* Routines called from time to time. */
411 attachable::check_mortals (); 421 attachable::check_mortals ();
412 422
413 ++pticks; 423 // now that we aggressively reuse id's, this is very unlikely to happen...
414
415 if (object::object_count >= RESTART_COUNT) 424 if (object::object_count >= RESTART_COUNT)
416 cleanup ("running out of protocol ID values - need full restart"); 425 cleanup ("running out of protocol ID values - need full restart");
417} 426}
418 427
419// normal main 428// normal main
420int 429int
421main (int argc, char **argv) 430main (int argc, char **argv)
422{ 431{
423 settings.argc = argc; 432 settings.argc = argc;
424 settings.argv = argv; 433 settings.argv = argv;
434
435 rndm.seed (time (0));
436
437 // temporary(?) testing hack
438 if (argc >= 2 && !strcmp (argv [1], "--noise"))
439 {
440 void noise_test ();
441 noise_test ();
442 exit (0);
443 }
444
445#if 0
446 // code sometiems used for timing benchmarks
447 random_number_generator<freeciv_random_generator> rng;
448 rng.seed(0);
449 for (int i = 0; i < 10; ++i)
450 printf ("%08x\n", rng.get_u32());
451 for (int i = 0; i < 1000000; ++i)
452 volatile int r = rng.get_u32 ();
453 cstamp s = stamp ();
454 for (int i = 0; i < 1000000; ++i)
455 volatile int r = rng.next ();
456 printf ("c %d\n", (int)measure (s));
457 exit (0);
458#endif
425 459
426 rndm.seed (time (0));
427 g_thread_init (0); // for the slice allocator only
428
429 init (argc, argv); 460 init (argc, argv);
430 461
431 for (;;) 462 for (;;)
432 cfperl_main (); 463 cfperl_main ();
433} 464}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines