ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/server/main.C
Revision: 1.103
Committed: Sun May 13 15:13:57 2007 UTC (17 years ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.102: +1 -1 lines
Log Message: 
lots of little changes:
- fix MIN/MAX_AC/WC and use them
- abstratc weapon speed into player->weapon_speed, as
  it is just way too confusing and probably needs frequent updates :)
- use ob_speed/weapon_sp * 0.5 as an arbitrary real attack speed
  .5 needs tuning, elsewhere, but ahs been put in as a stopgap measure.
- fix speed issues, properly use weapon_sp (if a bit lagged)
- clear current weapon when readying skills because a skill might already
  be readied implicitly.

File Contents

# Content
1 /*
2 * CrossFire, A Multiplayer game
3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen
7 *
8 * This program is free software; you can redistribute it and/or modify
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
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
17 *
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
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
23 */
24
25 #include <global.h>
26 #include <object.h>
27 #include <tod.h>
28
29 #include <sproto.h>
30 #include <time.h>
31
32 #include <../random_maps/random_map.h>
33 #include <../random_maps/rproto.h>
34 #include "path.h"
35
36 static char days[7][4] = {
37 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
38 };
39
40 void
41 version (object *op)
42 {
43 if (op)
44 clear_win_info (op);
45
46 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION);
47
48 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
49 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
50 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
51 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>");
52 new_draw_info (NDI_UNIQUE, 0, op, "");
53 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:");
54 new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>");
55 new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>");
56 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>");
57 new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>");
58 new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>");
59 new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>");
60 new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>");
61 new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>");
62 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>");
63 new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>");
64 new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>");
65 new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>");
66 new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>");
67 new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>");
68 new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>");
69 new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>");
70 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>");
71 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>");
72 new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>");
73 new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>");
74 new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>");
75 new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>");
76 new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>");
77 new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>");
78 new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>");
79 new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>");
80 new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>");
81 new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>");
82 new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>");
83 new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>");
84 new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>");
85 new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>");
86 new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>");
87 new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>");
88 new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>");
89 new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>");
90 new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>");
91 new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>");
92 new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>");
93 new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n");
94 new_draw_info (NDI_UNIQUE, 0, op, "");
95 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
96 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
97 new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>");
98 new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>");
99 new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>");
100 new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>");
101 new_draw_info (NDI_UNIQUE, 0, op, "");
102 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
103 }
104
105 /* This is a basic little function to put the player back to his
106 * savebed. We do some error checking - its possible that the
107 * savebed map may no longer exist, so we make sure the player
108 * goes someplace.
109 */
110 void
111 enter_player_savebed (object *op)
112 {
113 object *tmp = object::create ();
114 EXIT_PATH (tmp) = op->contr->savebed_map;
115 EXIT_X (tmp) = op->contr->bed_x;
116 EXIT_Y (tmp) = op->contr->bed_y;
117 op->enter_exit (tmp);
118 tmp->destroy ();
119 }
120
121 /*
122 * enter_map(): Moves the player and pets from current map (if any) to
123 * new map. map, x, y must be set. map is the map we are moving the
124 * player to - it could be the map he just came from if the load failed for
125 * whatever reason. If default map coordinates are to be used, then
126 * the function that calls this should figure them out.
127 */
128 void
129 object::enter_map (maptile *newmap, int x, int y)
130 {
131 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY)
132 return;
133
134 if (out_of_map (newmap, x, y))
135 {
136 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
137 x = newmap->enter_x;
138 y = newmap->enter_y;
139 if (out_of_map (newmap, x, y))
140 {
141 LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n",
142 &newmap->path, x, y, newmap->width, newmap->height);
143 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
144 return;
145 }
146 }
147
148 if (contr && map != newmap && map)
149 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
150 return;
151
152 // remove, so stupid ob_locked does not trigger a failure
153 remove ();
154
155 /* try to find a spot for the player */
156 if (ob_blocked (this, newmap, x, y))
157 { /* First choice blocked */
158 /* We try to find a spot for the player, starting closest in.
159 * We could use find_first_free_spot, but that doesn't randomize it at all,
160 * So for example, if the north space is free, you would always end up there even
161 * if other spaces around are available.
162 * Note that for the second and third calls, we could start at a position other
163 * than one, but then we could end up on the other side of walls and so forth.
164 */
165 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1);
166
167 if (i == -1)
168 {
169 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
170 if (i == -1)
171 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
172 }
173
174 if (i != -1)
175 {
176 x += freearr_x[i];
177 y += freearr_y[i];
178 }
179 else
180 /* not much we can do in this case. */
181 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);
182 }
183
184 if (contr && map != newmap)
185 {
186 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
187 return;
188
189 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
190 return;
191 }
192
193 this->x = x;
194 this->y = y;
195 map = newmap;
196
197 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
198
199 enemy = 0;
200
201 if (contr)
202 {
203 contr->maplevel = newmap->path;
204 contr->count = 0;
205 }
206
207 /* Update any golems */
208 if (type == PLAYER)
209 if (object *golem = contr->golem)
210 {
211 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
212
213 if (i < 0)
214 golem->destroy ();
215 else
216 {
217 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
218 golem->direction = find_dir_2 (x - golem->x, y - golem->y);
219 }
220 }
221
222 /* since the players map is already loaded, we don't need to worry
223 * about pending objects.
224 */
225 remove_all_pets (newmap);
226 }
227
228 /* process_players1 and process_players2 do all the player related stuff.
229 * I moved it out of process events and process_map. This was to some
230 * extent for debugging as well as to get a better idea of the time used
231 * by the various functions. process_players1() does the processing before
232 * objects have been updated, process_players2() does the processing that
233 * is needed after the players have been updated.
234 */
235 static void
236 process_players1 ()
237 {
238 /* Basically, we keep looping until all the players have done their actions. */
239 for (int flag = 1; flag != 0;)
240 {
241 flag = 0;
242 for_all_players (pl)
243 {
244 pl->refcnt_chk ();
245
246 if (!pl->ob || !pl->ns || !pl->ob->active)
247 continue;
248
249 if (pl->ob->speed_left > 0.f && pl->ns)
250 if (handle_newcs_player (pl->ob))
251 flag = 1;
252
253 /* If the player is not actively playing, don't make a
254 * backup save - nothing to save anyway. Plus, the
255 * map may not longer be valid. This can happen when the
256 * player quits - they exist for purposes of tracking on the map,
257 * but don't actually reside on any actual map.
258 */
259 if (QUERY_FLAG (pl->ob, FLAG_REMOVED))
260 continue;
261 } /* end of for loop for all the players */
262 } /* for flag */
263
264 for_all_players (pl)
265 {
266 object *ob = pl->ob;
267
268 if (!ob || !pl->ns || !ob->active)
269 continue;
270
271 if (settings.casting_time)
272 {
273 if (ob->casting_time > 0.f)
274 {
275 --ob->casting_time;
276 ob->start_holding = 1;
277 }
278
279 /* set spell_state so we can update the range in stats field */
280 if (pl->ob->casting_time == 0.f && pl->ob->start_holding == 1)
281 pl->ob->start_holding = 0;
282 }
283
284 // process_events might steal us one speed slot, so adjust accordingly
285 if (ob->speed_left > 0.f)
286 ++ob->speed_left;
287
288 do_some_living (ob);
289 }
290 }
291
292 static void
293 process_players2 ()
294 {
295 /* Then check if any players should use weapon-speed instead of speed */
296 for_all_players (pl)
297 {
298 if (pl->has_hit)
299 {
300 pl->ob->speed_left = min (pl->weapon_speed (), pl->ob->speed_left + pl->weapon_speed ());
301
302 if (pl->ob->speed_left > 0.f)
303 pl->has_hit = 0;
304 }
305 else
306 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
307 }
308 }
309
310 void
311 process_events ()
312 {
313 process_players1 ();
314
315 for_all_actives (op)
316 {
317 /* Now process op */
318 if (QUERY_FLAG (op, FLAG_FREED))
319 {
320 LOG (llevError, "BUG: process_events(): Free object on list\n");
321 op->set_speed (0);
322 continue;
323 }
324
325 if (!op->has_active_speed ())
326 {
327 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
328 "but is on active list\n", op->debug_desc (), op->speed);
329 op->set_speed (0);
330 continue;
331 }
332
333 if (op->flag [FLAG_REMOVED])
334 {
335 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
336 op->debug_desc ());
337 op->set_speed (0);
338 continue;
339 }
340
341 /* Animate the object. Bug or feature that anim_speed
342 * is based on ticks, and not the creatures speed?
343 */
344 if (op->anim_speed && op->last_anim >= op->anim_speed)
345 {
346 animate_object (op, op->contr ? op->facing : op->direction);
347 op->last_anim = 1;
348 }
349 else
350 ++op->last_anim;
351
352 if (op->speed_left > 0.f)
353 {
354 --op->speed_left;
355 process_object (op);
356
357 if (op->destroyed ())
358 continue;
359 }
360
361 if (settings.casting_time == TRUE && op->casting_time > 0.f)
362 --op->casting_time;
363
364 if (!op->contr)
365 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
366 }
367
368 process_players2 ();
369 }
370
371 /* clean up everything before exiting */
372 void
373 emergency_save ()
374 {
375 LOG (llevDebug, "emergency save begin.\n");
376
377 cfperl_emergency_save ();
378
379 LOG (llevDebug, "saving book archive.\n");
380 write_book_archive ();
381
382 LOG (llevDebug, "emergency save done.\n");
383 }
384
385 // send all clients some informational text
386 static void
387 cleanup_inform (const char *cause, bool make_core)
388 {
389 int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
390
391 new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n");
392 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s\n", cause);
393
394 if (make_core)
395 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.\n");
396 else
397 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.\n");
398
399 new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE);
400
401 flush_sockets ();
402 }
403
404 /* clean up everything before exiting */
405 void
406 cleanup (const char *cause, bool make_core)
407 {
408 if (make_core)
409 fork_abort (cause);
410
411 LOG (llevError, "cleanup cause: %s\n", cause);
412
413 if (!make_core)
414 cleanup_inform (cause, make_core);
415
416 LOG (llevDebug, "cleanup begin.\n");
417
418 if (init_done && !in_cleanup)
419 {
420 in_cleanup = true;
421 emergency_save ();
422 }
423 else
424 in_cleanup = true;
425
426 LOG (llevDebug, "running cleanup handlers.\n");
427 INVOKE_GLOBAL (CLEANUP);
428
429 LOG (llevDebug, "cleanup done.\n");
430
431 if (make_core)
432 {
433 cleanup_inform (cause, make_core);
434 cfperl_cleanup (make_core);
435 _exit (1);
436 }
437 else
438 {
439 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.\n");
440 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE "\n");
441 flush_sockets ();
442 cfperl_cleanup (make_core);
443 _exit (0);
444 }
445 }
446
447 int
448 forbid_play (void)
449 {
450 #if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
451 char buf[MAX_BUF], day[MAX_BUF];
452 FILE *fp;
453 time_t clock;
454 struct tm *tm;
455 int i, start, stop, forbit = 0, comp;
456
457 clock = time (NULL);
458 tm = (struct tm *) localtime (&clock);
459
460 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
461 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
462 return 0;
463
464 while (fgets (buf, MAX_BUF, fp))
465 {
466 if (buf[0] == '#')
467 continue;
468
469 if (!strncmp (buf, "msg", 3))
470 {
471 if (forbit)
472 while (fgets (buf, MAX_BUF, fp)) /* print message */
473 fputs (buf, logfile);
474 break;
475 }
476 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
477 {
478 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
479 continue;
480 }
481
482 for (i = 0; i < 7; i++)
483 {
484 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
485 forbit = 1;
486 }
487 }
488
489 close_and_delete (fp, comp);
490
491 return forbit;
492 #else
493 return 0;
494 #endif
495 }
496
497 /*
498 * do_specials() is a collection of functions to call from time to time.
499 * Modified 2000-1-14 MSW to use the global pticks count to determine how
500 * often to do things. This will allow us to spred them out more often.
501 * I use prime numbers for the factor count - in that way, it is less likely
502 * these actions will fall on the same tick (compared to say using 500/2500/15000
503 * which would mean on that 15,000 tick count a whole bunch of stuff gets
504 * done). Of course, there can still be times where multiple specials are
505 * done on the same tick, but that will happen very infrequently
506 *
507 * I also think this code makes it easier to see how often we really are
508 * doing the various things.
509 */
510 void
511 do_specials (void)
512 {
513 if (!(pticks % TICKS_PER_HOUR))
514 adjust_daylight ();
515
516 if (!(pticks % 7))
517 shstr::gc ();
518
519 if (!(pticks % 2503))
520 fix_weight (); /* Hack to fix weightproblems caused by bugs */
521
522 if (!(pticks % 5003))
523 write_book_archive ();
524
525 if (!(pticks % 5009))
526 clean_friendly_list ();
527
528 if (!(pticks % 5011))
529 obsolete_parties ();
530
531 if (!(pticks % 12503))
532 fix_luck ();
533 }
534
535 void
536 server_tick ()
537 {
538 // first do the user visible stuff
539 doeric_server ();
540 INVOKE_GLOBAL (CLOCK);
541 process_events (); /* "do" something with objects with speed */
542 flush_sockets ();
543
544 // then do some bookkeeping, should not really be here
545 do_specials (); /* Routines called from time to time. */
546 attachable::check_mortals ();
547
548 ++pticks;
549 }
550
551 #if 0
552 // used fro benchmarking (x86/amd64-specific)
553 typedef unsigned long tval;
554 typedef unsigned long long stamp64;
555
556 extern inline tval
557 stamp (void)
558 {
559 tval tsc;
560 asm volatile ("rdtsc":"=a" (tsc)::"edx");
561
562 return tsc;
563 }
564
565 extern inline tval
566 measure (tval t)
567 {
568 tval tsc;
569 asm volatile ("rdtsc":"=a" (tsc)::"edx");
570
571 if (tsc > t)
572 return tsc - t;
573 else
574 return t - tsc;
575 }
576
577 int
578 main (int argc, char **argv)
579 {
580 rand_gen rg(0);
581 tval fastest = 0x7fffffff;
582 for (int loop = 10000; loop--; )
583 {
584 tval s = stamp ();
585 volatile int i = rg.get_int(25);
586 fastest = min (fastest, measure (s));
587 }
588
589 //printf ("fastest %d\n", fastest);
590 for (int i = 0; i < 1024*1024*3; ++i)
591 {
592 char c = rg.get_int (256);
593 write (2, &c, 1);
594 }
595 }
596
597 #else
598
599 // normal main
600 int
601 main (int argc, char **argv)
602 {
603 settings.argc = argc;
604 settings.argv = argv;
605
606 init (argc, argv);
607
608 initPlugins ();
609
610 for (;;)
611 cfperl_main ();
612 }
613 #endif
614