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.84 by root, Sat Jan 13 23:45:46 2007 UTC vs.
Revision 1.117 by root, Wed Sep 12 11:10:11 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 * Crossfire TRT 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 2 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,
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 GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 22 */
24 23
25#include <global.h> 24#include <global.h>
26#include <object.h> 25#include <object.h>
27#include <tod.h> 26#include <tod.h>
28 27
29#ifdef HAVE_DES_H
30# include <des.h>
31#else
32# ifdef HAVE_CRYPT_H
33# include <crypt.h>
34# endif
35#endif
36
37#include <sproto.h> 28#include <sproto.h>
38#include <time.h> 29#include <time.h>
39 30
40#include <../random_maps/random_map.h> 31#include <../random_maps/random_map.h>
41#include <../random_maps/rproto.h> 32#include <../random_maps/rproto.h>
46}; 37};
47 38
48void 39void
49version (object *op) 40version (object *op)
50{ 41{
51 if (op)
52 clear_win_info (op);
53
54 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); 42 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION);
55 43
56 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); 44 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
57 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); 45 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
58 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); 46 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
159 147
160 // remove, so stupid ob_locked does not trigger a failure 148 // remove, so stupid ob_locked does not trigger a failure
161 remove (); 149 remove ();
162 150
163 /* try to find a spot for the player */ 151 /* try to find a spot for the player */
164 if (ob_blocked (this, newmap, x, y)) 152 if (blocked (newmap, x, y))
165 { /* First choice blocked */ 153 { /* First choice blocked */
166 /* 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.
167 * 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,
168 * 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
169 * if other spaces around are available. 157 * if other spaces around are available.
211 contr->maplevel = newmap->path; 199 contr->maplevel = newmap->path;
212 contr->count = 0; 200 contr->count = 0;
213 } 201 }
214 202
215 /* Update any golems */ 203 /* Update any golems */
216 if (type == PLAYER && contr->ranges[range_golem]) 204 if (type == PLAYER)
217 { 205 if (object *golem = contr->golem)
218 int i = find_free_spot (contr->ranges[range_golem], newmap,
219 x, y, 1, SIZEOFFREE);
220
221 if (i == -1)
222 { 206 {
223 contr->ranges[range_golem]->destroy (); 207 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
224 contr->ranges[range_golem] = 0; 208
225 } 209 if (i < 0)
210 golem->destroy ();
226 else 211 else
227 {
228 for (object *tmp = contr->ranges[range_golem]; tmp; tmp = tmp->more)
229 { 212 {
230 tmp->x = x + freearr_x[i] + (tmp->arch ? 0 : tmp->arch->clone.x); 213 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
231 tmp->y = y + freearr_y[i] + (tmp->arch ? 0 : tmp->arch->clone.y); 214 golem->direction = find_dir_2 (x - golem->x, y - golem->y);
232 tmp->map = newmap;
233 } 215 }
234
235 insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0);
236 contr->ranges[range_golem]->direction =
237 find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y);
238 } 216 }
239 }
240 217
241 /* since the players map is already loaded, we don't need to worry 218 /* since the players map is already loaded, we don't need to worry
242 * about pending objects. 219 * about pending objects.
243 */ 220 */
244 remove_all_pets (newmap); 221 remove_all_pets (newmap);
252 * is needed after the players have been updated. 229 * is needed after the players have been updated.
253 */ 230 */
254static void 231static void
255process_players1 () 232process_players1 ()
256{ 233{
257 int flag;
258
259 /* Basically, we keep looping until all the players have done their actions. */ 234 /* Basically, we keep looping until all the players have done their actions. */
260 for (flag = 1; flag != 0;) 235 for (int flag = 1; flag != 0;)
261 { 236 {
262 flag = 0; 237 flag = 0;
263 for_all_players (pl) 238 for_all_players (pl)
264 { 239 {
265 pl->refcnt_chk (); 240 pl->refcnt_chk ();
266 241
267 if (!pl->ob || !pl->ns || !pl->ob->active) 242 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
268 continue; 243 continue;
269 244
270 if (pl->ob->speed_left > 0)
271 if (handle_newcs_player (pl->ob)) 245 if (handle_newcs_player (pl->ob))
272 flag = 1; 246 flag = 1;
273 247 }
274 /* If the player is not actively playing, don't make a 248 }
275 * backup save - nothing to save anyway. Plus, the
276 * map may not longer be valid. This can happen when the
277 * player quits - they exist for purposes of tracking on the map,
278 * but don't actually reside on any actual map.
279 */
280 if (QUERY_FLAG (pl->ob, FLAG_REMOVED))
281 continue;
282 } /* end of for loop for all the players */
283 } /* for flag */
284 249
285 for_all_players (pl) 250 for_all_players (pl)
286 { 251 {
252 object *ob = pl->ob;
253
287 if (!pl->ob || !pl->ns || !pl->ob->active) 254 if (expect_false (!ob || !pl->ns || !ob->active))
288 continue; 255 continue;
289 256
290 if (settings.casting_time)
291 {
292 if (pl->ob->casting_time > 0)
293 {
294 pl->ob->casting_time--;
295 pl->ob->start_holding = 1;
296 }
297
298 /* set spell_state so we can update the range in stats field */
299 if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1))
300 pl->ob->start_holding = 0;
301 }
302
303 do_some_living (pl->ob); 257 do_some_living (ob);
304 } 258 }
305} 259}
306 260
307static void 261static void
308process_players2 () 262process_players2 ()
309{ 263{
310 /* 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 */
311 for_all_players (pl) 265 for_all_players (pl)
312 { 266 {
313 /* The code that did weapon_sp handling here was out of place - 267 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
314 * this isn't called until after the player has finished there 268 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
315 * actions, and is thus out of place. All we do here is bounds
316 * checking.
317 */
318 if (pl->has_hit)
319 {
320 if (pl->ob->speed_left > pl->weapon_sp)
321 pl->ob->speed_left = pl->weapon_sp;
322
323 /* This needs to be here - if the player is running, we need to
324 * clear this each tick, but new commands are not being received
325 * so execute_newserver_command() is never called
326 */
327 pl->has_hit = 0;
328 }
329 else if (pl->ob->speed_left > pl->ob->speed)
330 pl->ob->speed_left = pl->ob->speed;
331 } 269 }
332} 270}
333 271
334void 272void
335process_events () 273process_events ()
337 process_players1 (); 275 process_players1 ();
338 276
339 for_all_actives (op) 277 for_all_actives (op)
340 { 278 {
341 /* Now process op */ 279 /* Now process op */
342 if (QUERY_FLAG (op, FLAG_FREED)) 280 if (expect_false (QUERY_FLAG (op, FLAG_FREED)))
343 { 281 {
344 LOG (llevError, "BUG: process_events(): Free object on list\n"); 282 LOG (llevError, "BUG: process_events(): Free object on list\n");
345 op->set_speed (0); 283 op->set_speed (0);
346 continue; 284 continue;
347 } 285 }
348 286
349 /* I've seen occasional crashes due to this - the object is removed,
350 * and thus the map it points to (last map it was on) may be bogus
351 * The real bug is to try to find out the cause of this - someone
352 * is probably calling remove_ob without either an insert_ob or
353 * free_object afterwards, leaving an object dangling. But I'd
354 * rather log this and continue on instead of crashing.
355 * Don't remove players - when a player quits, the object is in
356 * sort of a limbo, of removed, but something we want to keep
357 * around.
358 */
359 if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY)
360 {
361 LOG (llevError, "BUG: process_events(): Removed object on list\n");
362 char *dump = dump_object (op);
363 LOG (llevError, dump);
364 free (dump);
365 op->destroy ();
366 continue;
367 }
368
369 if (!op->has_active_speed ()) 287 if (expect_false (!op->has_active_speed ()))
370 { 288 {
371 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " 289 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
372 "but is on active list\n", op->debug_desc (), op->speed); 290 "but is on active list\n", op->debug_desc (), op->speed);
373 op->set_speed (0); 291 op->set_speed (0);
374 continue; 292 continue;
375 } 293 }
376 294
377 if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) 295 if (expect_false (op->flag [FLAG_REMOVED]))
378 { 296 {
379 LOG (llevError, "BUG: process_events(): Object without map or " 297 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
380 "inventory is on active list: %s (%d)\n", &op->name, op->count); 298 op->debug_desc ());
381 op->set_speed (0); 299 op->set_speed (0);
382 continue; 300 continue;
383 } 301 }
384 302
385 /* Animate the object. Bug or feature that anim_speed 303 /* Animate the object. Bug or feature that anim_speed
386 * is based on ticks, and not the creatures speed? 304 * is based on ticks, and not the creatures speed?
387 */ 305 */
388 if (op->anim_speed && op->last_anim >= op->anim_speed) 306 if (op->anim_speed && op->last_anim >= op->anim_speed)
389 { 307 {
390 if ((op->type == PLAYER))
391 animate_object (op, op->facing);
392 else
393 animate_object (op, op->direction); 308 animate_object (op, op->contr ? op->facing : op->direction);
394
395 op->last_anim = 1; 309 op->last_anim = 1;
396 } 310 }
397 else 311 else
398 op->last_anim++; 312 ++op->last_anim;
399 313
400 if (op->speed_left > 0) 314 if (op->speed_left > 0.f)
401 {
402#if 0
403 /* I've seen occasional crashes in move_symptom() with it
404 * crashing because op is removed - add some debugging to
405 * track if it is removed at this point.
406 * This unfortunately is a bit too verbose it seems - not sure
407 * why - I think what happens is a map is freed or something and
408 * some objects get 'lost' - removed never to be reclaimed.
409 * removed objects generally shouldn't exist.
410 */
411 if (QUERY_FLAG (op, FLAG_REMOVED))
412 { 315 {
413 LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null");
414 }
415#endif
416 --op->speed_left; 316 --op->speed_left;
417 process_object (op); 317 process_object (op);
418 318
419 if (op->destroyed ()) 319 if (op->destroyed ())
420 continue; 320 continue;
421 } 321 }
422 322
423 if (settings.casting_time == TRUE && op->casting_time > 0) 323 if (!op->contr)
424 op->casting_time--; 324 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
425
426 if (op->speed_left <= 0)
427 op->speed_left += FABS (op->speed);
428 } 325 }
429 326
430 process_players2 (); 327 process_players2 ();
431} 328}
432 329
446 343
447// send all clients some informational text 344// send all clients some informational text
448static void 345static void
449cleanup_inform (const char *cause, bool make_core) 346cleanup_inform (const char *cause, bool make_core)
450{ 347{
451 int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); 348 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
452 349
453 new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); 350 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
454 new_draw_info_format (flags, 0, 0, "Cause for this shtudown: %s\n", cause); 351 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
455 352
456 if (make_core) 353 if (make_core)
457 new_draw_info_format (flags, 0, 0, "This is considered a crash.\n"); 354 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
458 else 355 else
459 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown.\n"); 356 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");
460 357
461 new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); 358 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
462 359
463 flush_sockets (); 360 client::flush_sockets ();
464} 361}
465 362
466/* clean up everything before exiting */ 363/* clean up everything before exiting */
467void 364void
468cleanup (const char *cause, bool make_core) 365cleanup (const char *cause, bool make_core)
469{ 366{
470 if (make_core) 367 if (make_core)
471 if (!fork ()) 368 fork_abort (cause);
472 abort ();
473 369
474 LOG (llevError, "cleanup cause: %s\n", cause); 370 LOG (llevError, "cleanup cause: %s\n", cause);
475 371
476 if (!make_core) 372 if (!make_core)
477 cleanup_inform (cause, make_core); 373 cleanup_inform (cause, make_core);
492 LOG (llevDebug, "cleanup done.\n"); 388 LOG (llevDebug, "cleanup done.\n");
493 389
494 if (make_core) 390 if (make_core)
495 { 391 {
496 cleanup_inform (cause, make_core); 392 cleanup_inform (cause, make_core);
393 cfperl_cleanup (make_core);
497 _exit (1); 394 _exit (1);
498 } 395 }
499 else 396 else
397 {
398 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_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
400 client::flush_sockets ();
401 cfperl_cleanup (make_core);
500 _exit (0); 402 _exit (0);
501}
502
503int
504forbid_play (void)
505{
506#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
507 char buf[MAX_BUF], day[MAX_BUF];
508 FILE *fp;
509 time_t clock;
510 struct tm *tm;
511 int i, start, stop, forbit = 0, comp;
512
513 clock = time (NULL);
514 tm = (struct tm *) localtime (&clock);
515
516 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
517 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
518 return 0;
519
520 while (fgets (buf, MAX_BUF, fp))
521 { 403 }
522 if (buf[0] == '#')
523 continue;
524
525 if (!strncmp (buf, "msg", 3))
526 {
527 if (forbit)
528 while (fgets (buf, MAX_BUF, fp)) /* print message */
529 fputs (buf, logfile);
530 break;
531 }
532 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
533 {
534 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
535 continue;
536 }
537
538 for (i = 0; i < 7; i++)
539 {
540 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
541 forbit = 1;
542 }
543 }
544
545 close_and_delete (fp, comp);
546
547 return forbit;
548#else
549 return 0;
550#endif
551} 404}
552 405
553/* 406/*
554 * do_specials() is a collection of functions to call from time to time. 407 * do_specials() is a collection of functions to call from time to time.
555 * Modified 2000-1-14 MSW to use the global pticks count to determine how 408 * Modified 2000-1-14 MSW to use the global pticks count to determine how
561 * done on the same tick, but that will happen very infrequently 414 * done on the same tick, but that will happen very infrequently
562 * 415 *
563 * I also think this code makes it easier to see how often we really are 416 * I also think this code makes it easier to see how often we really are
564 * doing the various things. 417 * doing the various things.
565 */ 418 */
566
567extern unsigned long todtick;
568
569void 419void
570do_specials (void) 420do_specials (void)
571{ 421{
572 if (!(pticks % PTICKS_PER_CLOCK)) 422 if (expect_false (!(pticks % TICKS_PER_HOUR)))
573 tick_the_clock (); 423 adjust_daylight ();
574 424
575 if (!(pticks % 7)) 425 if (expect_false (!(pticks % 7)))
576 shstr::gc (); 426 shstr::gc ();
577 427
578 if (!(pticks % 2503)) 428 if (expect_false (!(pticks % 2503)))
579 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 429 fix_weight (); /* Hack to fix weightproblems caused by bugs */
580 430
581 if (!(pticks % 5003)) 431 if (expect_false (!(pticks % 5003)))
582 write_book_archive (); 432 write_book_archive ();
583 433
584 if (!(pticks % 5009)) 434 if (expect_false (!(pticks % 5009)))
585 clean_friendly_list (); 435 clean_friendly_list ();
586 436
587 if (!(pticks % 5011)) 437 if (expect_false (!(pticks % 5011)))
588 obsolete_parties (); 438 obsolete_parties ();
589 439
590 if (!(pticks % 12503)) 440 if (expect_false (!(pticks % 12503)))
591 fix_luck (); 441 fix_luck ();
592} 442}
593 443
594void 444void
595server_tick () 445server_tick ()
596{ 446{
597 // first do the user visible stuff 447 // first do the user visible stuff
598 doeric_server ();
599 INVOKE_GLOBAL (CLOCK); 448 INVOKE_GLOBAL (CLOCK);
600 process_events (); /* "do" something with objects with speed */ 449 process_events (); // "do" something with objects with speed
601 flush_sockets (); 450 client::clock (); // draw client maps etc.
602 451
603 // then do some bookkeeping, should not really be here 452 // then do some bookkeeping, should not really be here
604 do_specials (); /* Routines called from time to time. */ 453 do_specials (); /* Routines called from time to time. */
605 attachable::check_mortals (); 454 attachable::check_mortals ();
606 455
607 ++pticks; 456 ++pticks;
608} 457}
609 458
459#if 0
460// used fro benchmarking (x86/amd64-specific)
461typedef unsigned long tval;
462typedef unsigned long long stamp64;
463
464extern inline tval
465stamp (void)
466{
467 tval tsc;
468 asm volatile ("rdtsc":"=a" (tsc)::"edx");
469
470 return tsc;
471}
472
473extern inline tval
474measure (tval t)
475{
476 tval tsc;
477 asm volatile ("rdtsc":"=a" (tsc)::"edx");
478
479 if (tsc > t)
480 return tsc - t;
481 else
482 return t - tsc;
483}
484
610int 485int
611main (int argc, char **argv) 486main (int argc, char **argv)
612{ 487{
488 rand_gen rg(0);
489 tval fastest = 0x7fffffff;
490 for (int loop = 10000; loop--; )
491 {
492 tval s = stamp ();
493 volatile int i = rg.get_int(25);
494 fastest = min (fastest, measure (s));
495 }
496
497 //printf ("fastest %d\n", fastest);
498 for (int i = 0; i < 1024*1024*3; ++i)
499 {
500 char c = rg.get_int (256);
501 write (2, &c, 1);
502 }
503}
504
505#else
506
507// normal main
508int
509main (int argc, char **argv)
510{
613 settings.argc = argc; 511 settings.argc = argc;
614 settings.argv = argv; 512 settings.argv = argv;
615 513
616 init (argc, argv); 514 init (argc, argv);
617 515
618 initPlugins (); 516 initPlugins ();
619 517
620 for (;;) 518 for (;;)
621 cfperl_main (); 519 cfperl_main ();
622} 520}
521#endif
623 522
523#if 0
524int xyzzy ()
525{
526 return rndm(8);
527}
528
529void xyzzy (object_ptr &a, object_ptr &o)
530{
531 asm volatile ("int3");
532 a = o;
533 asm volatile ("int3");
534}
535#endif
536

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines