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.68 by root, Sun Dec 31 10:28:36 2006 UTC vs.
Revision 1.80 by pippijn, Sat Jan 6 14:42:30 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 CrossFire, A Multiplayer game for X-windows
3 3
4 Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 Copyright (C) 1992 Frank Tore Johansen
6 7
7 This program is free software; you can redistribute it and/or modify 8 This program is free software; you can redistribute it and/or modify
8 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
45}; 46};
46 47
47void 48void
48version (object *op) 49version (object *op)
49{ 50{
50 if (op != NULL) 51 if (op)
51 clear_win_info (op); 52 clear_win_info (op);
52 53
53 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire v%s", VERSION); 54 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION);
54
55/* If in a socket, don't print out the list of authors. It confuses the
56 * crossclient program.
57 */
58 if (op == NULL)
59 return;
60 55
61 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); 56 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
62 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); 57 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
63 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); 58 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
64 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); 59 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>");
68 new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>"); 63 new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>");
69 new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>"); 64 new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>");
70 new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>"); 65 new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>");
71 new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>"); 66 new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>");
72 new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>"); 67 new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>");
73 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jxrgensen <jorgens@flipper.pvv.unit.no>"); 68 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst JΓΈrgensen <jorgens@flipper.pvv.unit.no>");
74 new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>"); 69 new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>");
75 new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>"); 70 new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>");
76 new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>"); 71 new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>");
77 new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>"); 72 new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>");
78 new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>"); 73 new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>");
136 * the function that calls this should figure them out. 131 * the function that calls this should figure them out.
137 */ 132 */
138void 133void
139object::enter_map (maptile *newmap, int x, int y) 134object::enter_map (maptile *newmap, int x, int y)
140{ 135{
136 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY)
137 return;
138
141 if (out_of_map (newmap, x, y)) 139 if (out_of_map (newmap, x, y))
142 { 140 {
143 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); 141 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
144 x = newmap->enter_x; 142 x = newmap->enter_x;
145 y = newmap->enter_y; 143 y = newmap->enter_y;
150 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); 148 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
151 return; 149 return;
152 } 150 }
153 } 151 }
154 152
155 if (map) 153 if (contr && map != newmap && map)
156 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 154 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
157 return; 155 return;
158 156
159 /* If it is a player login, he has yet to be inserted anyplace. 157 /* If it is a player login, he has yet to be inserted anyplace.
160 * otherwise, we need to deal with removing the player here. 158 * otherwise, we need to deal with removing the player here.
188 else 186 else
189 /* not much we can do in this case. */ 187 /* not much we can do in this case. */
190 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); 188 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);
191 } 189 }
192 190
191 if (contr && map != newmap)
192 {
193 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) 193 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
194 return; 194 return;
195 195
196 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) 196 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
197 return; 197 return;
198 }
198 199
199 this->x = x; 200 this->x = x;
200 this->y = y; 201 this->y = y;
201 map = newmap; 202 map = newmap;
202 203
203 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); 204 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
204 205
205 newmap->timeout = 0;
206 enemy = NULL; 206 enemy = NULL;
207 207
208 if (contr) 208 if (contr)
209 { 209 {
210 strcpy (contr->maplevel, newmap->path); 210 contr->maplevel = newmap->path;
211 contr->count = 0; 211 contr->count = 0;
212 } 212 }
213 213
214 /* Update any golems */ 214 /* Update any golems */
215 if (type == PLAYER && contr->ranges[range_golem]) 215 if (type == PLAYER && contr->ranges[range_golem])
227 } 227 }
228 else 228 else
229 { 229 {
230 for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more) 230 for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more)
231 { 231 {
232 tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.x); 232 tmp->x = x + freearr_x[i] + (tmp->arch ? 0 : tmp->arch->clone.x);
233 tmp->y = y + freearr_y[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.y); 233 tmp->y = y + freearr_y[i] + (tmp->arch ? 0 : tmp->arch->clone.y);
234 tmp->map = newmap; 234 tmp->map = newmap;
235 } 235 }
236 236
237 insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0); 237 insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0);
238 contr->ranges[range_golem]->direction = 238 contr->ranges[range_golem]->direction =
239 find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y); 239 find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y);
240 } 240 }
241 } 241 }
242
243 direction = 0;
244 242
245 /* since the players map is already loaded, we don't need to worry 243 /* since the players map is already loaded, we don't need to worry
246 * about pending objects. 244 * about pending objects.
247 */ 245 */
248 remove_all_pets (newmap); 246 remove_all_pets (newmap);
266 flag = 0; 264 flag = 0;
267 for_all_players (pl) 265 for_all_players (pl)
268 { 266 {
269 pl->refcnt_chk (); 267 pl->refcnt_chk ();
270 268
271 if (!pl->ob || !pl->ns) 269 if (!pl->ob || !pl->ns || !pl->ob->active ())
272 continue; 270 continue;
273 271
274 if (pl->ob->speed_left > 0) 272 if (pl->ob->speed_left > 0)
275 if (handle_newcs_player (pl->ob)) 273 if (handle_newcs_player (pl->ob))
276 flag = 1; 274 flag = 1;
297 } /* end of for loop for all the players */ 295 } /* end of for loop for all the players */
298 } /* for flag */ 296 } /* for flag */
299 297
300 for_all_players (pl) 298 for_all_players (pl)
301 { 299 {
302 if (!pl->ob || !pl->ns) 300 if (!pl->ob || !pl->ns || !pl->ob->active ())
303 continue; 301 continue;
304 302
305 if (settings.casting_time) 303 if (settings.casting_time)
306 { 304 {
307 if (pl->ob->casting_time > 0) 305 if (pl->ob->casting_time > 0)
492{ 490{
493 LOG (llevDebug, "emergency save begin.\n"); 491 LOG (llevDebug, "emergency save begin.\n");
494 492
495 LOG (llevDebug, "saving players.\n"); 493 LOG (llevDebug, "saving players.\n");
496 for_all_players (pl) 494 for_all_players (pl)
495 if (pl->enable_save && pl->ob && pl->ns)
496 {
497 pl->save (1); 497 pl->save (true);
498 pl->enable_save = true;
499 }
498 500
499// for_all_players (pl) 501// for_all_players (pl)
500// if (pl->ob) 502// if (pl->ob)
501// pl->ob->remove (); 503// pl->ob->remove ();
502 504
507 write_book_archive (); 509 write_book_archive ();
508 510
509 LOG (llevDebug, "emergency save done.\n"); 511 LOG (llevDebug, "emergency save done.\n");
510} 512}
511 513
514// send all clients some informational text
515static void
516cleanup_inform (const char *cause, bool make_core)
517{
518 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "The server will now shutdown.\n");
519 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "Cause for this shtudown: %s\n", cause);
520
521 if (make_core)
522 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "This is considered a crash.\n");
523 else
524 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "This is considered to be a clean shutdown.\n");
525
526 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "%s\n", CLEANUP_MESSAGE);
527
528 flush_sockets ();
529}
530
512/* clean up everything before exiting */ 531/* clean up everything before exiting */
513void 532void
514cleanup (bool make_core) 533cleanup (const char *cause, bool make_core)
515{ 534{
535 LOG (llevError, "cleanup cause: %s\n", cause);
536
537 if (!make_core)
538 cleanup_inform (cause, make_core);
539
516 LOG (llevDebug, "cleanup begin.\n"); 540 LOG (llevDebug, "cleanup begin.\n");
517 541
518 if (init_done && !in_cleanup) 542 if (init_done && !in_cleanup)
519 { 543 {
520 in_cleanup = true; 544 in_cleanup = true;
527 INVOKE_GLOBAL (CLEANUP); 551 INVOKE_GLOBAL (CLEANUP);
528 552
529 LOG (llevDebug, "cleanup done.\n"); 553 LOG (llevDebug, "cleanup done.\n");
530 554
531 if (make_core) 555 if (make_core)
556 {
557 cleanup_inform (cause, make_core);
532 abort (); 558 abort ();
559 }
533 else 560 else
534 _exit (0); 561 _exit (0);
535}
536
537void
538leave (player *pl, int draw_exit)
539{
540 if (pl)
541 {
542 if (pl->ob->type != DEAD_OBJECT)
543 {
544 /* If a hidden dm dropped connection do not create
545 * inconsistencies by showing that they have left the game
546 */
547 if (!(QUERY_FLAG (pl->ob, FLAG_WIZ) && pl->ob->contr->hidden)
548 && draw_exit)
549 {
550 if (pl->ob->map)
551 {
552 INVOKE_PLAYER (LOGOUT, pl);
553 LOG (llevInfo, "LOGOUT: Player named %s from ip %s\n", &pl->ob->name, pl->ns->host);
554 }
555
556 char buf[MAX_BUF];
557
558 sprintf (buf, "%s left the game.", &pl->ob->name);
559 new_draw_info (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, 0, buf);
560 }
561
562 pl->ob->remove ();
563 pl->ob->type = DEAD_OBJECT; /* To avoid problems with inventory window */
564 }
565
566 /* We do this so that the socket handling routine can do the final
567 * cleanup. We also leave that loop to actually handle the freeing
568 * of the data.
569 */
570 if (pl->ns)
571 pl->ns->destroy ();
572
573 }
574} 562}
575 563
576int 564int
577forbid_play (void) 565forbid_play (void)
578{ 566{
592 580
593 while (fgets (buf, MAX_BUF, fp)) 581 while (fgets (buf, MAX_BUF, fp))
594 { 582 {
595 if (buf[0] == '#') 583 if (buf[0] == '#')
596 continue; 584 continue;
585
597 if (!strncmp (buf, "msg", 3)) 586 if (!strncmp (buf, "msg", 3))
598 { 587 {
599 if (forbit) 588 if (forbit)
600 while (fgets (buf, MAX_BUF, fp)) /* print message */ 589 while (fgets (buf, MAX_BUF, fp)) /* print message */
601 fputs (buf, logfile); 590 fputs (buf, logfile);
602 break; 591 break;
603
604 } 592 }
605 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) 593 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
606 { 594 {
607 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); 595 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
608 continue; 596 continue;
622 return 0; 610 return 0;
623#endif 611#endif
624} 612}
625 613
626/* 614/*
627 * do_specials() is a collection of functions to call from time to time. 615 * do_specials() is a collection of functions to call from time to time.
628 * Modified 2000-1-14 MSW to use the global pticks count to determine how 616 * Modified 2000-1-14 MSW to use the global pticks count to determine how
629 * often to do things. This will allow us to spred them out more often. 617 * often to do things. This will allow us to spred them out more often.
630 * I use prime numbers for the factor count - in that way, it is less likely 618 * I use prime numbers for the factor count - in that way, it is less likely
631 * these actions will fall on the same tick (compared to say using 500/2500/15000 619 * these actions will fall on the same tick (compared to say using 500/2500/15000
632 * which would mean on that 15,000 tick count a whole bunch of stuff gets 620 * which would mean on that 15,000 tick count a whole bunch of stuff gets
690 678
691 initPlugins (); 679 initPlugins ();
692 680
693 for (;;) 681 for (;;)
694 cfperl_main (); 682 cfperl_main ();
695
696 cleanup (true);
697} 683}
698 684

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines