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.63 by root, Sat Dec 30 16:56:16 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{
141 if (!newmap->load ()) 136 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY)
142 return; 137 return;
143 138
144 if (out_of_map (newmap, x, y)) 139 if (out_of_map (newmap, x, y))
145 { 140 {
146 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);
… …
152 &newmap->path, x, y, newmap->width, newmap->height); 147 &newmap->path, x, y, newmap->width, newmap->height);
153 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); 148 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
154 return; 149 return;
155 } 150 }
156 } 151 }
152
153 if (contr && map != newmap && map)
154 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
155 return;
156
157 /* If it is a player login, he has yet to be inserted anyplace.
158 * otherwise, we need to deal with removing the player here.
159 */
160 remove ();
157 161
158 /* try to find a spot for the player */ 162 /* try to find a spot for the player */
159 if (ob_blocked (this, newmap, x, y)) 163 if (ob_blocked (this, newmap, x, y))
160 { /* First choice blocked */ 164 { /* First choice blocked */
161 /* We try to find a spot for the player, starting closest in. 165 /* We try to find a spot for the player, starting closest in.
… …
182 else 186 else
183 /* not much we can do in this case. */ 187 /* not much we can do in this case. */
184 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);
185 } 189 }
186 190
187 if (map) 191 if (contr && map != newmap)
188 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 192 {
189 return;
190
191 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)))
192 return; 194 return;
193 195
194 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)))
195 return; 197 return;
196 198 }
197 /* If it is a player login, he has yet to be inserted anyplace.
198 * otherwise, we need to deal with removing the player here.
199 */
200 remove ();
201 199
202 this->x = x; 200 this->x = x;
203 this->y = y; 201 this->y = y;
204 map = newmap; 202 map = newmap;
205 203
206 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); 204 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
207 205
208 newmap->timeout = 0;
209 enemy = NULL; 206 enemy = NULL;
210 207
211 if (contr) 208 if (contr)
212 { 209 {
213 strcpy (contr->maplevel, newmap->path); 210 contr->maplevel = newmap->path;
214 contr->count = 0; 211 contr->count = 0;
215 } 212 }
216 213
217 /* Update any golems */ 214 /* Update any golems */
218 if (type == PLAYER && contr->ranges[range_golem]) 215 if (type == PLAYER && contr->ranges[range_golem])
… …
230 } 227 }
231 else 228 else
232 { 229 {
233 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)
234 { 231 {
235 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);
236 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);
237 tmp->map = newmap; 234 tmp->map = newmap;
238 } 235 }
239 236
240 insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0); 237 insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0);
241 contr->ranges[range_golem]->direction = 238 contr->ranges[range_golem]->direction =
242 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);
243 } 240 }
244 } 241 }
245
246 direction = 0;
247 242
248 /* 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
249 * about pending objects. 244 * about pending objects.
250 */ 245 */
251 remove_all_pets (newmap); 246 remove_all_pets (newmap);
252}
253
254/* clean_path takes a path and replaces all / with _
255 * We do a strcpy so that we do not change the original string.
256 */
257char *
258clean_path (const char *file)
259{
260 static char newpath[MAX_BUF], *cp;
261 assign (newpath, file);
262
263 for (cp = newpath; *cp != '\0'; cp++)
264 if (*cp == '/')
265 *cp = '_';
266
267 return newpath;
268}
269
270/* unclean_path takes a path and replaces all _ with /
271 * This basically undoes clean path.
272 * We do a strcpy so that we do not change the original string.
273 * We are smart enough to start after the last / in case we
274 * are getting passed a string that points to a unique map
275 * path.
276 */
277char *
278unclean_path (const char *src)
279{
280 static char newpath[MAX_BUF], *cp;
281
282 cp = strrchr (src, '/');
283 assign (newpath, cp ? cp + 1 : src);
284
285 for (cp = newpath; *cp != '\0'; cp++)
286 if (*cp == '_')
287 *cp = '/';
288
289 return newpath;
290} 247}
291 248
292/* process_players1 and process_players2 do all the player related stuff. 249/* process_players1 and process_players2 do all the player related stuff.
293 * I moved it out of process events and process_map. This was to some 250 * I moved it out of process events and process_map. This was to some
294 * extent for debugging as well as to get a better idea of the time used 251 * extent for debugging as well as to get a better idea of the time used
… …
307 flag = 0; 264 flag = 0;
308 for_all_players (pl) 265 for_all_players (pl)
309 { 266 {
310 pl->refcnt_chk (); 267 pl->refcnt_chk ();
311 268
312 if (!pl->ob || !pl->ns) 269 if (!pl->ob || !pl->ns || !pl->ob->active ())
313 continue; 270 continue;
314 271
315 if (pl->ob->speed_left > 0) 272 if (pl->ob->speed_left > 0)
316 if (handle_newcs_player (pl->ob)) 273 if (handle_newcs_player (pl->ob))
317 flag = 1; 274 flag = 1;
… …
338 } /* end of for loop for all the players */ 295 } /* end of for loop for all the players */
339 } /* for flag */ 296 } /* for flag */
340 297
341 for_all_players (pl) 298 for_all_players (pl)
342 { 299 {
343 if (!pl->ob || !pl->ns) 300 if (!pl->ob || !pl->ns || !pl->ob->active ())
344 continue; 301 continue;
345 302
346 if (settings.casting_time) 303 if (settings.casting_time)
347 { 304 {
348 if (pl->ob->casting_time > 0) 305 if (pl->ob->casting_time > 0)
… …
455 free (dump); 412 free (dump);
456 op->destroy (); 413 op->destroy ();
457 continue; 414 continue;
458 } 415 }
459 416
460 if (!op->speed) 417 if (!op->has_active_speed ())
461 { 418 {
462 LOG (llevError, "BUG: process_events(): Object %s has no speed, " 419 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
463 "but is on active list\n", &op->arch->name); 420 "but is on active list\n", op->debug_desc (), op->speed);
464 op->set_speed (0); 421 op->set_speed (0);
465 continue; 422 continue;
466 } 423 }
467 424
468 if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) 425 if (op->map == NULL && op->env == NULL && op->name && op->type != MAP)
… …
533{ 490{
534 LOG (llevDebug, "emergency save begin.\n"); 491 LOG (llevDebug, "emergency save begin.\n");
535 492
536 LOG (llevDebug, "saving players.\n"); 493 LOG (llevDebug, "saving players.\n");
537 for_all_players (pl) 494 for_all_players (pl)
495 if (pl->enable_save && pl->ob && pl->ns)
496 {
538 pl->save (1); 497 pl->save (true);
498 pl->enable_save = true;
499 }
539 500
540// for_all_players (pl) 501// for_all_players (pl)
541// if (pl->ob) 502// if (pl->ob)
542// pl->ob->remove (); 503// pl->ob->remove ();
543 504
… …
548 write_book_archive (); 509 write_book_archive ();
549 510
550 LOG (llevDebug, "emergency save done.\n"); 511 LOG (llevDebug, "emergency save done.\n");
551} 512}
552 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
553/* clean up everything before exiting */ 531/* clean up everything before exiting */
554void 532void
555cleanup (bool make_core) 533cleanup (const char *cause, bool make_core)
556{ 534{
535 LOG (llevError, "cleanup cause: %s\n", cause);
536
537 if (!make_core)
538 cleanup_inform (cause, make_core);
539
557 LOG (llevDebug, "cleanup begin.\n"); 540 LOG (llevDebug, "cleanup begin.\n");
558 541
542 if (init_done && !in_cleanup)
543 {
559 in_cleanup = true; 544 in_cleanup = true;
560
561 if (init_done)
562 emergency_save (); 545 emergency_save ();
546 }
547 else
548 in_cleanup = true;
563 549
564 LOG (llevDebug, "running cleanup handlers.\n"); 550 LOG (llevDebug, "running cleanup handlers.\n");
565 INVOKE_GLOBAL (CLEANUP); 551 INVOKE_GLOBAL (CLEANUP);
566 552
567 LOG (llevDebug, "cleanup done.\n"); 553 LOG (llevDebug, "cleanup done.\n");
568 554
569 if (make_core) 555 if (make_core)
556 {
557 cleanup_inform (cause, make_core);
570 abort (); 558 abort ();
559 }
571 else 560 else
572 _exit (0); 561 _exit (0);
573}
574
575void
576leave (player *pl, int draw_exit)
577{
578 if (pl)
579 {
580 if (pl->ob->type != DEAD_OBJECT)
581 {
582 /* If a hidden dm dropped connection do not create
583 * inconsistencies by showing that they have left the game
584 */
585 if (!(QUERY_FLAG (pl->ob, FLAG_WIZ) && pl->ob->contr->hidden)
586 && draw_exit)
587 {
588 if (pl->ob->map)
589 {
590 INVOKE_PLAYER (LOGOUT, pl);
591 LOG (llevInfo, "LOGOUT: Player named %s from ip %s\n", &pl->ob->name, pl->ns->host);
592 }
593
594 char buf[MAX_BUF];
595
596 sprintf (buf, "%s left the game.", &pl->ob->name);
597 new_draw_info (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, 0, buf);
598 }
599
600 pl->ob->remove ();
601 pl->ob->type = DEAD_OBJECT; /* To avoid problems with inventory window */
602 }
603
604 /* We do this so that the socket handling routine can do the final
605 * cleanup. We also leave that loop to actually handle the freeing
606 * of the data.
607 */
608 if (pl->ns)
609 pl->ns->destroy ();
610
611 }
612} 562}
613 563
614int 564int
615forbid_play (void) 565forbid_play (void)
616{ 566{
… …
630 580
631 while (fgets (buf, MAX_BUF, fp)) 581 while (fgets (buf, MAX_BUF, fp))
632 { 582 {
633 if (buf[0] == '#') 583 if (buf[0] == '#')
634 continue; 584 continue;
585
635 if (!strncmp (buf, "msg", 3)) 586 if (!strncmp (buf, "msg", 3))
636 { 587 {
637 if (forbit) 588 if (forbit)
638 while (fgets (buf, MAX_BUF, fp)) /* print message */ 589 while (fgets (buf, MAX_BUF, fp)) /* print message */
639 fputs (buf, logfile); 590 fputs (buf, logfile);
640 break; 591 break;
641
642 } 592 }
643 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)
644 { 594 {
645 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); 595 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
646 continue; 596 continue;
… …
660 return 0; 610 return 0;
661#endif 611#endif
662} 612}
663 613
664/* 614/*
665 * 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.
666 * 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
667 * 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.
668 * 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
669 * 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
670 * 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
… …
728 678
729 initPlugins (); 679 initPlugins ();
730 680
731 for (;;) 681 for (;;)
732 cfperl_main (); 682 cfperl_main ();
733
734 // unreached
735 cleanup ();
736
737 return 0;
738} 683}
684

Diff Legend

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