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.72 by root, Mon Jan 1 21:19:52 2007 UTC vs.
Revision 1.132 by root, Mon Sep 29 10:20:49 2008 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra 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
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 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,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 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
18 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
20 21 * The authors can be reached via e-mail to <support@deliantra.net>
21 The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 22 */
23 23
24#include <global.h> 24#include <global.h>
25#include <object.h> 25#include <object.h>
26#include <tod.h> 26#include <tod.h>
27 27
28#ifdef HAVE_DES_H
29# include <des.h>
30#else
31# ifdef HAVE_CRYPT_H
32# include <crypt.h>
33# endif
34#endif
35
36#include <sproto.h> 28#include <sproto.h>
37#include <time.h> 29#include <time.h>
30
31#include <glib.h>
38 32
39#include <../random_maps/random_map.h> 33#include <../random_maps/random_map.h>
40#include <../random_maps/rproto.h> 34#include <../random_maps/rproto.h>
41#include "path.h" 35#include "path.h"
42 36
45}; 39};
46 40
47void 41void
48version (object *op) 42version (object *op)
49{ 43{
50 if (op)
51 clear_win_info (op);
52
53 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); 44 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION);
54 45
46#if 0
55 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); 47 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
56 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); 48 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
57 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); 49 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
58 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); 50 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>");
51 new_draw_info (NDI_UNIQUE, 0, op, "");
52 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:");
59 new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>"); 53 new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>");
60 new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>"); 54 new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>");
61 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>"); 55 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>");
62 new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>"); 56 new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>");
63 new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>"); 57 new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>");
94 new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>"); 88 new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>");
95 new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>"); 89 new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>");
96 new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>"); 90 new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>");
97 new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>"); 91 new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>");
98 new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n"); 92 new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n");
99 93 new_draw_info (NDI_UNIQUE, 0, op, "");
100 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); 94 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
101 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); 95 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
102 new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>"); 96 new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>");
103 new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>"); 97 new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>");
104 new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>"); 98 new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>");
105 new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); 99 new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>");
100 new_draw_info (NDI_UNIQUE, 0, op, "");
106 new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); 101 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
102#endif
107} 103}
108 104
109/* This is a basic little function to put the player back to his 105/* This is a basic little function to put the player back to his
110 * savebed. We do some error checking - its possible that the 106 * savebed. We do some error checking - its possible that the
111 * savebed map may no longer exist, so we make sure the player 107 * savebed map may no longer exist, so we make sure the player
112 * goes someplace. 108 * goes someplace.
113 */ 109 */
114void 110void
115enter_player_savebed (object *op) 111enter_player_savebed (object *op)
116{ 112{
117 object *tmp = object::create (); 113 op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y);
118 EXIT_PATH (tmp) = op->contr->savebed_map;
119 EXIT_X (tmp) = op->contr->bed_x;
120 EXIT_Y (tmp) = op->contr->bed_y;
121 op->enter_exit (tmp);
122 tmp->destroy ();
123} 114}
124 115
125/* 116/*
126 * enter_map(): Moves the player and pets from current map (if any) to 117 * enter_map(): Moves the player and pets from current map (if any) to
127 * new map. map, x, y must be set. map is the map we are moving the 118 * new map. map, x, y must be set. map is the map we are moving the
130 * the function that calls this should figure them out. 121 * the function that calls this should figure them out.
131 */ 122 */
132void 123void
133object::enter_map (maptile *newmap, int x, int y) 124object::enter_map (maptile *newmap, int x, int y)
134{ 125{
135 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) 126 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
136 return; 127 return;
137 128
138 if (out_of_map (newmap, x, y)) 129 if (out_of_map (newmap, x, y))
139 { 130 {
140 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); 131 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
147 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); 138 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
148 return; 139 return;
149 } 140 }
150 } 141 }
151 142
152 if (map && map != newmap) 143 if (contr && map != newmap && map)
153 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 144 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
154 return; 145 return;
155 146
156 /* If it is a player login, he has yet to be inserted anyplace. 147 // remove, so stupid ob_locked does not trigger a failure
157 * otherwise, we need to deal with removing the player here.
158 */
159 remove (); 148 remove ();
160 149
161 /* try to find a spot for the player */ 150 /* try to find a spot for the player */
162 if (ob_blocked (this, newmap, x, y)) 151 if (blocked (newmap, x, y))
163 { /* First choice blocked */ 152 { /* First choice blocked */
164 /* We try to find a spot for the player, starting closest in. 153 /* We try to find a spot for the player, starting closest in.
165 * We could use find_first_free_spot, but that doesn't randomize it at all, 154 * We could use find_first_free_spot, but that doesn't randomize it at all,
166 * So for example, if the north space is free, you would always end up there even 155 * So for example, if the north space is free, you would always end up there even
167 * if other spaces around are available. 156 * if other spaces around are available.
185 else 174 else
186 /* not much we can do in this case. */ 175 /* not much we can do in this case. */
187 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); 176 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 } 177 }
189 178
190 if (map != newmap && contr) 179 if (contr && map != newmap)
191 { 180 {
192 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) 181 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
193 return; 182 return;
194 183
195 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) 184 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
200 this->y = y; 189 this->y = y;
201 map = newmap; 190 map = newmap;
202 191
203 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); 192 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
204 193
205 enemy = NULL; 194 enemy = 0;
206 195
207 if (contr) 196 if (contr)
208 { 197 {
209 contr->maplevel = newmap->path; 198 contr->maplevel = newmap->path;
210 contr->count = 0; 199 contr->count = 0;
211 } 200 }
212 201
213 /* Update any golems */ 202 /* Update any golems */
214 if (type == PLAYER && contr->ranges[range_golem]) 203 if (type == PLAYER)
215 { 204 if (object *golem = contr->golem)
216 int i = find_free_spot (contr->ranges[range_golem], newmap,
217 x, y, 1, SIZEOFFREE);
218
219 contr->ranges[range_golem]->remove ();
220
221 if (i == -1)
222 { 205 {
223 remove_friendly_object (contr->ranges[range_golem]); 206 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
224 contr->ranges[range_golem]->destroy (); 207
225 contr->ranges[range_golem] = 0; 208 if (i < 0)
226 }
227 else
228 {
229 for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more)
230 { 209 {
231 tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.x); 210 golem->destroy_inv (true); // be explicit about dropping
232 tmp->y = y + freearr_y[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.y); 211 golem->destroy (true);
233 tmp->map = newmap;
234 } 212 }
235 213 else
236 insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0); 214 {
237 contr->ranges[range_golem]->direction = 215 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
238 find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y); 216 golem->direction = find_dir_2 (x - golem->x, y - golem->y);
239 } 217 }
240 } 218 }
241
242 direction = 0;
243 219
244 /* since the players map is already loaded, we don't need to worry 220 /* since the players map is already loaded, we don't need to worry
245 * about pending objects. 221 * about pending objects.
246 */ 222 */
247 remove_all_pets (newmap); 223 remove_all_pets (newmap);
255 * is needed after the players have been updated. 231 * is needed after the players have been updated.
256 */ 232 */
257static void 233static void
258process_players1 () 234process_players1 ()
259{ 235{
260 int flag;
261
262 /* Basically, we keep looping until all the players have done their actions. */ 236 /* Basically, we keep looping until all the players have done their actions. */
263 for (flag = 1; flag != 0;) 237 for (int flag = 1; flag != 0;)
264 { 238 {
265 flag = 0; 239 flag = 0;
266 for_all_players (pl) 240 for_all_players (pl)
267 { 241 {
268 pl->refcnt_chk (); 242 pl->refcnt_chk ();
269 243
270 if (!pl->ob || !pl->ns || !pl->ob->active ()) 244 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
271 continue; 245 continue;
272 246
273 if (pl->ob->speed_left > 0)
274 if (handle_newcs_player (pl->ob)) 247 if (handle_newcs_player (pl->ob))
275 flag = 1; 248 flag = 1;
276
277 /* If the player is not actively playing, don't make a
278 * backup save - nothing to save anyway. Plus, the
279 * map may not longer be valid. This can happen when the
280 * player quits - they exist for purposes of tracking on the map,
281 * but don't actually reside on any actual map.
282 */
283 if (QUERY_FLAG (pl->ob, FLAG_REMOVED))
284 continue;
285
286#ifdef AUTOSAVE
287 /* check for ST_PLAYING state so that we don't try to save off when
288 * the player is logging in.
289 */
290 if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->ns->state == ST_PLAYING)
291 {
292 pl->ob->contr->save ();
293 pl->last_save_tick = pticks;
294 } 249 }
295#endif 250 }
296 } /* end of for loop for all the players */
297 } /* for flag */
298 251
299 for_all_players (pl) 252 for_all_players (pl)
300 { 253 {
254 object *ob = pl->ob;
255
301 if (!pl->ob || !pl->ns || !pl->ob->active ()) 256 if (expect_false (!ob || !pl->ns || !ob->active))
302 continue; 257 continue;
303 258
304 if (settings.casting_time)
305 {
306 if (pl->ob->casting_time > 0)
307 {
308 pl->ob->casting_time--;
309 pl->ob->start_holding = 1;
310 }
311
312 /* set spell_state so we can update the range in stats field */
313 if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1))
314 pl->ob->start_holding = 0;
315 }
316
317 do_some_living (pl->ob); 259 do_some_living (ob);
318 } 260 }
319} 261}
320 262
321static void 263static void
322process_players2 () 264process_players2 ()
323{ 265{
324 /* Then check if any players should use weapon-speed instead of speed */ 266 /* Then check if any players should use weapon-speed instead of speed */
325 for_all_players (pl) 267 for_all_players (pl)
326 { 268 {
327 /* The code that did weapon_sp handling here was out of place - 269 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
328 * this isn't called until after the player has finished there 270 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
329 * actions, and is thus out of place. All we do here is bounds
330 * checking.
331 */
332 if (pl->has_hit)
333 {
334 if (pl->ob->speed_left > pl->weapon_sp)
335 pl->ob->speed_left = pl->weapon_sp;
336
337 /* This needs to be here - if the player is running, we need to
338 * clear this each tick, but new commands are not being received
339 * so execute_newserver_command() is never called
340 */
341 pl->has_hit = 0;
342 }
343 else if (pl->ob->speed_left > pl->ob->speed)
344 pl->ob->speed_left = pl->ob->speed;
345 } 271 }
346} 272}
347 273
348void 274void
349process_events () 275process_events ()
350{ 276{
351 object *op;
352
353 static object_ptr marker_;
354
355 if (!marker_)
356 marker_ = object::create ();
357
358 object *marker = marker_;
359
360 process_players1 (); 277 process_players1 ();
361 278
362 marker->active_next = active_objects; 279 for_all_actives (op)
363
364 if (marker->active_next)
365 marker->active_next->active_prev = marker;
366
367 marker->active_prev = 0;
368 active_objects = marker;
369
370 while (marker->active_next)
371 { 280 {
372 op = marker->active_next;
373
374 /* Move marker forward - swap op and marker */
375 op->active_prev = marker->active_prev;
376
377 if (op->active_prev)
378 op->active_prev->active_next = op;
379 else
380 active_objects = op;
381
382 marker->active_next = op->active_next;
383
384 if (marker->active_next)
385 marker->active_next->active_prev = marker;
386
387 marker->active_prev = op;
388 op->active_next = marker;
389
390 /* Now process op */ 281 /* Now process op */
391 if (QUERY_FLAG (op, FLAG_FREED)) 282 if (expect_false (QUERY_FLAG (op, FLAG_FREED)))
392 { 283 {
393 LOG (llevError, "BUG: process_events(): Free object on list\n"); 284 LOG (llevError, "BUG: process_events(): Free object on list\n");
394 op->set_speed (0); 285 op->set_speed (0);
395 continue; 286 continue;
396 } 287 }
397 288
398 /* I've seen occasional crashes due to this - the object is removed,
399 * and thus the map it points to (last map it was on) may be bogus
400 * The real bug is to try to find out the cause of this - someone
401 * is probably calling remove_ob without either an insert_ob or
402 * free_object afterwards, leaving an object dangling. But I'd
403 * rather log this and continue on instead of crashing.
404 * Don't remove players - when a player quits, the object is in
405 * sort of a limbo, of removed, but something we want to keep
406 * around.
407 */
408 if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY)
409 {
410 LOG (llevError, "BUG: process_events(): Removed object on list\n");
411 char *dump = dump_object (op);
412 LOG (llevError, dump);
413 free (dump);
414 op->destroy ();
415 continue;
416 }
417
418 if (!op->has_active_speed ()) 289 if (expect_false (!op->has_active_speed ()))
419 { 290 {
420 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " 291 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
421 "but is on active list\n", op->debug_desc (), op->speed); 292 "but is on active list\n", op->debug_desc (), op->speed);
422 op->set_speed (0); 293 op->set_speed (0);
423 continue; 294 continue;
424 } 295 }
425 296
426 if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) 297 if (expect_false (op->flag [FLAG_REMOVED]))
427 { 298 {
428 LOG (llevError, "BUG: process_events(): Object without map or " 299 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
429 "inventory is on active list: %s (%d)\n", &op->name, op->count); 300 op->debug_desc ());
430 op->set_speed (0); 301 op->set_speed (0);
431 continue; 302 continue;
432 } 303 }
433 304
434 /* Animate the object. Bug or feature that anim_speed 305 /* Animate the object. Bug or feature that anim_speed
435 * is based on ticks, and not the creatures speed? 306 * is based on ticks, and not the creatures speed?
436 */ 307 */
437 if (op->anim_speed && op->last_anim >= op->anim_speed) 308 if (op->anim_speed && op->last_anim >= op->anim_speed)
438 { 309 {
439 if ((op->type == PLAYER))
440 animate_object (op, op->facing);
441 else
442 animate_object (op, op->direction); 310 animate_object (op, op->contr ? op->facing : op->direction);
443
444 op->last_anim = 1; 311 op->last_anim = 1;
445 } 312 }
446 else 313 else
447 op->last_anim++; 314 ++op->last_anim;
448 315
449 if (op->speed_left > 0) 316 if (expect_false (op->speed_left > 0.f))
450 {
451#if 0
452 /* I've seen occasional crashes in move_symptom() with it
453 * crashing because op is removed - add some debugging to
454 * track if it is removed at this point.
455 * This unfortunately is a bit too verbose it seems - not sure
456 * why - I think what happens is a map is freed or something and
457 * some objects get 'lost' - removed never to be reclaimed.
458 * removed objects generally shouldn't exist.
459 */
460 if (QUERY_FLAG (op, FLAG_REMOVED))
461 { 317 {
462 LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null");
463 }
464#endif
465 --op->speed_left; 318 --op->speed_left;
466 process_object (op); 319 process_object (op);
467
468 if (op->destroyed ())
469 continue;
470 } 320 }
471 321
472 if (settings.casting_time == TRUE && op->casting_time > 0) 322 if (expect_true (!op->contr))
473 op->casting_time--; 323 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
474
475 if (op->speed_left <= 0)
476 op->speed_left += FABS (op->speed);
477 } 324 }
478
479 /* Remove marker object from active list */
480 if (marker->active_prev != NULL)
481 marker->active_prev->active_next = NULL;
482 else
483 active_objects = NULL;
484 325
485 process_players2 (); 326 process_players2 ();
486} 327}
487 328
488/* clean up everything before exiting */ 329/* clean up everything before exiting */
489void 330void
490emergency_save () 331emergency_save ()
491{ 332{
492 LOG (llevDebug, "emergency save begin.\n"); 333 LOG (llevDebug, "emergency save begin.\n");
493 334
494 LOG (llevDebug, "saving players.\n");
495 for_all_players (pl)
496 pl->save (1);
497
498// for_all_players (pl)
499// if (pl->ob)
500// pl->ob->remove ();
501
502 LOG (llevDebug, "saving maps.\n");
503 maptile::emergency_save (); 335 cfperl_emergency_save ();
504 336
505 LOG (llevDebug, "saving book archive.\n"); 337 LOG (llevDebug, "saving book archive.\n");
506 write_book_archive (); 338 write_book_archive ();
507 339
508 LOG (llevDebug, "emergency save done.\n"); 340 LOG (llevDebug, "emergency save done.\n");
509} 341}
510 342
343// send all clients some informational text
344static void
345cleanup_inform (const char *cause, bool make_core)
346{
347 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
348
349 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
350 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
351
352 if (make_core)
353 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
354 else
355 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");
356
357 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
358
359 client::flush_sockets ();
360}
361
511/* clean up everything before exiting */ 362/* clean up everything before exiting */
512void 363void
513cleanup (bool make_core) 364cleanup (const char *cause, bool make_core)
514{ 365{
366 if (make_core)
367 fork_abort (cause);
368
369 LOG (llevError, "cleanup cause: %s\n", cause);
370
371 if (!make_core)
372 cleanup_inform (cause, make_core);
373
515 LOG (llevDebug, "cleanup begin.\n"); 374 LOG (llevDebug, "cleanup begin.\n");
516 375
517 if (init_done && !in_cleanup) 376 if (init_done && !in_cleanup)
518 { 377 {
519 in_cleanup = true; 378 in_cleanup = true;
525 LOG (llevDebug, "running cleanup handlers.\n"); 384 LOG (llevDebug, "running cleanup handlers.\n");
526 INVOKE_GLOBAL (CLEANUP); 385 INVOKE_GLOBAL (CLEANUP);
527 386
528 LOG (llevDebug, "cleanup done.\n"); 387 LOG (llevDebug, "cleanup done.\n");
529 388
389 log_cleanup ();
390
530 if (make_core) 391 if (make_core)
531 abort (); 392 cleanup_inform (cause, make_core);
532 else 393 else
533 _exit (0);
534}
535
536void
537leave (player *pl, int draw_exit)
538{
539 if (pl)
540 {
541 if (pl->ob->type != DEAD_OBJECT)
542 {
543 /* If a hidden dm dropped connection do not create
544 * inconsistencies by showing that they have left the game
545 */
546 if (!(QUERY_FLAG (pl->ob, FLAG_WIZ) && pl->ob->contr->hidden)
547 && draw_exit)
548 {
549 if (pl->ob->map)
550 {
551 INVOKE_PLAYER (LOGOUT, pl);
552 LOG (llevInfo, "LOGOUT: Player named %s from ip %s\n", &pl->ob->name, pl->ns->host);
553 }
554
555 char buf[MAX_BUF];
556
557 sprintf (buf, "%s left the game.", &pl->ob->name);
558 new_draw_info (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, 0, buf);
559 }
560
561 pl->ob->remove ();
562 pl->ob->type = DEAD_OBJECT; /* To avoid problems with inventory window */
563 }
564
565 /* We do this so that the socket handling routine can do the final
566 * cleanup. We also leave that loop to actually handle the freeing
567 * of the data.
568 */
569 if (pl->ns)
570 pl->ns->destroy ();
571
572 } 394 {
573} 395 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
574 396 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
575int 397 client::flush_sockets ();
576forbid_play (void)
577{
578#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
579 char buf[MAX_BUF], day[MAX_BUF];
580 FILE *fp;
581 time_t clock;
582 struct tm *tm;
583 int i, start, stop, forbit = 0, comp;
584
585 clock = time (NULL);
586 tm = (struct tm *) localtime (&clock);
587
588 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
589 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
590 return 0;
591
592 while (fgets (buf, MAX_BUF, fp))
593 { 398 }
594 if (buf[0] == '#')
595 continue;
596 if (!strncmp (buf, "msg", 3))
597 {
598 if (forbit)
599 while (fgets (buf, MAX_BUF, fp)) /* print message */
600 fputs (buf, logfile);
601 break;
602 399
603 } 400 cfperl_cleanup (make_core);
604 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) 401 _exit (make_core);
605 {
606 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
607 continue;
608 }
609
610 for (i = 0; i < 7; i++)
611 {
612 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
613 forbit = 1;
614 }
615 }
616
617 close_and_delete (fp, comp);
618
619 return forbit;
620#else
621 return 0;
622#endif
623} 402}
624 403
625/* 404/*
626 * do_specials() is a collection of functions to call from time to time. 405 * do_specials() is a collection of functions to call from time to time.
627 * Modified 2000-1-14 MSW to use the global pticks count to determine how 406 * Modified 2000-1-14 MSW to use the global pticks count to determine how
628 * often to do things. This will allow us to spred them out more often. 407 * often to do things. This will allow us to spred them out more often.
629 * I use prime numbers for the factor count - in that way, it is less likely 408 * I use prime numbers for the factor count - in that way, it is less likely
630 * these actions will fall on the same tick (compared to say using 500/2500/15000 409 * these actions will fall on the same tick (compared to say using 500/2500/15000
631 * which would mean on that 15,000 tick count a whole bunch of stuff gets 410 * which would mean on that 15,000 tick count a whole bunch of stuff gets
633 * done on the same tick, but that will happen very infrequently 412 * done on the same tick, but that will happen very infrequently
634 * 413 *
635 * I also think this code makes it easier to see how often we really are 414 * I also think this code makes it easier to see how often we really are
636 * doing the various things. 415 * doing the various things.
637 */ 416 */
638
639extern unsigned long todtick;
640
641void 417void
642do_specials (void) 418do_specials (void)
643{ 419{
644 if (!(pticks % PTICKS_PER_CLOCK))
645 tick_the_clock ();
646
647 if (!(pticks % 7))
648 shstr::gc (); 420 shstr::gc ();
421 archetype::gc ();
649 422
423 if (expect_false (!(pticks % TICKS_PER_HOUR)))
424 adjust_daylight ();
425
650 if (!(pticks % 2503)) 426 if (expect_false (!(pticks % 2503)))
651 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 427 fix_weight (); /* Hack to fix weightproblems caused by bugs */
652 428
653 if (!(pticks % 5003)) 429 if (expect_false (!(pticks % 5003)))
654 write_book_archive (); 430 write_book_archive ();
655 431
656 if (!(pticks % 5009)) 432 if (expect_false (!(pticks % 5009)))
657 clean_friendly_list (); 433 clean_friendly_list ();
658 434
659 if (!(pticks % 5011)) 435 if (expect_false (!(pticks % 5011)))
660 obsolete_parties (); 436 obsolete_parties ();
661 437
662 if (!(pticks % 12503)) 438 if (expect_false (!(pticks % 12503)))
663 fix_luck (); 439 fix_luck ();
664} 440}
665 441
666void 442void
667server_tick () 443server_tick ()
668{ 444{
669 // first do the user visible stuff 445 // first do the user visible stuff
670 doeric_server ();
671 INVOKE_GLOBAL (CLOCK); 446 INVOKE_GLOBAL (CLOCK);
672 process_events (); /* "do" something with objects with speed */ 447 process_events (); // "do" something with objects with speed
673 flush_sockets (); 448 client::clock (); // draw client maps etc.
674 449
675 // then do some bookkeeping, should not really be here 450 // then do some bookkeeping, should not really be here
676 do_specials (); /* Routines called from time to time. */ 451 do_specials (); /* Routines called from time to time. */
677 attachable::check_mortals (); 452 attachable::check_mortals ();
678 453
679 ++pticks; 454 ++pticks;
680} 455}
681 456
457#if 0
458// used fro benchmarking (x86/amd64-specific)
459typedef unsigned long tval;
460typedef unsigned long long stamp64;
461
462extern inline tval
463stamp (void)
464{
465 tval tsc;
466 asm volatile ("rdtsc":"=a" (tsc)::"edx");
467
468 return tsc;
469}
470
471extern inline tval
472measure (tval t)
473{
474 tval tsc;
475 asm volatile ("rdtsc":"=a" (tsc)::"edx");
476
477 if (tsc > t)
478 return tsc - t;
479 else
480 return t - tsc;
481}
482
682int 483int
683main (int argc, char **argv) 484main (int argc, char **argv)
684{ 485{
486 rand_gen rg(0);
487 tval fastest = 0x7fffffff;
488 for (int loop = 10000; loop--; )
489 {
490 tval s = stamp ();
491 volatile int i = rg.get_int(25);
492 fastest = min (fastest, measure (s));
493 }
494
495 //printf ("fastest %d\n", fastest);
496 for (int i = 0; i < 1024*1024*3; ++i)
497 {
498 char c = rg.get_int (256);
499 write (2, &c, 1);
500 }
501}
502
503#else
504
505#if 0 // just goofing around, look elsewhere
506
507#include <malloc.h>
508#include <execinfo.h>
509
510static void tr_on ();
511static void tr_off ();
512
513static SMUTEX(tr_mutex);
514
515#define ltr_off() SMUTEX_LOCK (tr_mutex); tr_off ()
516#define ltr_on() tr_on (); SMUTEX_UNLOCK (tr_mutex);
517
518static void *
519tr_malloc (size_t size, const void *caller)
520{
521 ltr_off ();
522
523 void *bt [8];
524 backtrace (bt, 8);
525
526 void *ptr = malloc (size);
527
528 ltr_on ();
529 return (char *)ptr;
530}
531
532static void
533tr_free (void *ptr, const void *caller)
534{
535 ltr_off ();
536
537 free (ptr);
538
539 ltr_on ();
540}
541
542void static *
543tr_realloc (void *ptr, size_t size, const void *caller)
544{
545 ltr_off ();
546
547 void *nptr = realloc (ptr, size);
548
549 ltr_on ();
550 return nptr;
551}
552
553static void *
554tr_memalign (size_t size, size_t alignment, const void *caller)
555{
556 ltr_off ();
557
558 void *ptr = memalign (size, alignment < 16 ? 16 : alignment);
559
560 ltr_on ();
561 return ptr;
562}
563
564static void
565tr_on ()
566{
567 __malloc_hook = tr_malloc;
568 __realloc_hook = tr_realloc;
569 __free_hook = tr_free;
570 __memalign_hook = tr_memalign;
571}
572
573static void
574tr_off ()
575{
576 __malloc_hook = 0;
577 __realloc_hook = 0;
578 __free_hook = 0;
579 __memalign_hook = 0;
580}
581
582void (*__malloc_initialize_hook)(void) = tr_on;
583
584#endif
585
586// normal main
587int
588main (int argc, char **argv)
589{
685 settings.argc = argc; 590 settings.argc = argc;
686 settings.argv = argv; 591 settings.argv = argv;
687 592
593 g_thread_init (0); // for the slice allocator only
594
688 init (argc, argv); 595 init (argc, argv);
689
690 initPlugins ();
691 596
692 for (;;) 597 for (;;)
693 cfperl_main (); 598 cfperl_main ();
694
695 cleanup (true);
696} 599}
600#endif
697 601
602#if 0
603int xyzzy ()
604{
605 return rndm(8);
606}
607
608void xyzzy (object_ptr &a, object_ptr &o)
609{
610 asm volatile ("int3");
611 a = o;
612 asm volatile ("int3");
613}
614#endif
615

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines