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.64 by root, Sat Dec 30 18:45:29 2006 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 != NULL)
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
55/* If in a socket, don't print out the list of authors. It confuses the 46#if 0
56 * crossclient program.
57 */
58 if (op == NULL)
59 return;
60
61 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:");
62 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>");
63 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>");
64 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:");
65 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>");
66 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>");
67 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>");
68 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>");
69 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>");
70 new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>"); 58 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>"); 59 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>"); 60 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>"); 61 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>"); 62 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>"); 63 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>"); 64 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>"); 65 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>"); 66 new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>");
… …
100 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>");
101 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>");
102 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>");
103 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>");
104 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");
105 93 new_draw_info (NDI_UNIQUE, 0, op, "");
106 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); 94 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
107 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); 95 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
108 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>");
109 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>");
110 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>");
111 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, "");
112 new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); 101 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
102#endif
113} 103}
114 104
115/* 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
116 * savebed. We do some error checking - its possible that the 106 * savebed. We do some error checking - its possible that the
117 * 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
118 * goes someplace. 108 * goes someplace.
119 */ 109 */
120void 110void
121enter_player_savebed (object *op) 111enter_player_savebed (object *op)
122{ 112{
123 object *tmp = object::create (); 113 op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y);
124 EXIT_PATH (tmp) = op->contr->savebed_map;
125 EXIT_X (tmp) = op->contr->bed_x;
126 EXIT_Y (tmp) = op->contr->bed_y;
127 op->enter_exit (tmp);
128 tmp->destroy ();
129} 114}
130 115
131/* 116/*
132 * 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
133 * 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
… …
136 * the function that calls this should figure them out. 121 * the function that calls this should figure them out.
137 */ 122 */
138void 123void
139object::enter_map (maptile *newmap, int x, int y) 124object::enter_map (maptile *newmap, int x, int y)
140{ 125{
141 if (!newmap->load ()) 126 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
142 return; 127 return;
143 128
144 if (out_of_map (newmap, x, y)) 129 if (out_of_map (newmap, x, y))
145 { 130 {
146 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);
… …
153 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); 138 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
154 return; 139 return;
155 } 140 }
156 } 141 }
157 142
143 if (contr && map != newmap && map)
144 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
145 return;
146
147 // remove, so stupid ob_locked does not trigger a failure
148 remove ();
149
158 /* try to find a spot for the player */ 150 /* try to find a spot for the player */
159 if (ob_blocked (this, newmap, x, y)) 151 if (blocked (newmap, x, y))
160 { /* First choice blocked */ 152 { /* First choice blocked */
161 /* 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.
162 * 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,
163 * 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
164 * if other spaces around are available. 156 * if other spaces around are available.
… …
182 else 174 else
183 /* not much we can do in this case. */ 175 /* 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); 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);
185 } 177 }
186 178
187 if (map) 179 if (contr && map != newmap)
188 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 180 {
189 return;
190
191 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)))
192 return; 182 return;
193 183
194 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)))
195 return; 185 return;
196 186 }
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 187
202 this->x = x; 188 this->x = x;
203 this->y = y; 189 this->y = y;
204 map = newmap; 190 map = newmap;
205 191
206 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); 192 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
207 193
208 newmap->timeout = 0;
209 enemy = NULL; 194 enemy = 0;
210 195
211 if (contr) 196 if (contr)
212 { 197 {
213 strcpy (contr->maplevel, newmap->path); 198 contr->maplevel = newmap->path;
214 contr->count = 0; 199 contr->count = 0;
215 } 200 }
216 201
217 /* Update any golems */ 202 /* Update any golems */
218 if (type == PLAYER && contr->ranges[range_golem]) 203 if (type == PLAYER)
219 { 204 if (object *golem = contr->golem)
220 int i = find_free_spot (contr->ranges[range_golem], newmap,
221 x, y, 1, SIZEOFFREE);
222
223 contr->ranges[range_golem]->remove ();
224
225 if (i == -1)
226 { 205 {
227 remove_friendly_object (contr->ranges[range_golem]); 206 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
228 contr->ranges[range_golem]->destroy (); 207
229 contr->ranges[range_golem] = 0; 208 if (i < 0)
230 }
231 else
232 {
233 for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more)
234 { 209 {
235 tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.x); 210 golem->destroy_inv (true); // be explicit about dropping
236 tmp->y = y + freearr_y[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.y); 211 golem->destroy (true);
237 tmp->map = newmap;
238 } 212 }
239 213 else
240 insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0); 214 {
241 contr->ranges[range_golem]->direction = 215 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
242 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);
243 } 217 }
244 } 218 }
245
246 direction = 0;
247 219
248 /* 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
249 * about pending objects. 221 * about pending objects.
250 */ 222 */
251 remove_all_pets (newmap); 223 remove_all_pets (newmap);
… …
259 * is needed after the players have been updated. 231 * is needed after the players have been updated.
260 */ 232 */
261static void 233static void
262process_players1 () 234process_players1 ()
263{ 235{
264 int flag;
265
266 /* 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. */
267 for (flag = 1; flag != 0;) 237 for (int flag = 1; flag != 0;)
268 { 238 {
269 flag = 0; 239 flag = 0;
270 for_all_players (pl) 240 for_all_players (pl)
271 { 241 {
272 pl->refcnt_chk (); 242 pl->refcnt_chk ();
273 243
274 if (!pl->ob || !pl->ns) 244 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
275 continue; 245 continue;
276 246
277 if (pl->ob->speed_left > 0)
278 if (handle_newcs_player (pl->ob)) 247 if (handle_newcs_player (pl->ob))
279 flag = 1; 248 flag = 1;
280
281 /* If the player is not actively playing, don't make a
282 * backup save - nothing to save anyway. Plus, the
283 * map may not longer be valid. This can happen when the
284 * player quits - they exist for purposes of tracking on the map,
285 * but don't actually reside on any actual map.
286 */
287 if (QUERY_FLAG (pl->ob, FLAG_REMOVED))
288 continue;
289
290#ifdef AUTOSAVE
291 /* check for ST_PLAYING state so that we don't try to save off when
292 * the player is logging in.
293 */
294 if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->ns->state == ST_PLAYING)
295 {
296 pl->ob->contr->save ();
297 pl->last_save_tick = pticks;
298 } 249 }
299#endif 250 }
300 } /* end of for loop for all the players */
301 } /* for flag */
302 251
303 for_all_players (pl) 252 for_all_players (pl)
304 { 253 {
305 if (!pl->ob || !pl->ns) 254 object *ob = pl->ob;
255
256 if (expect_false (!ob || !pl->ns || !ob->active))
306 continue; 257 continue;
307 258
308 if (settings.casting_time)
309 {
310 if (pl->ob->casting_time > 0)
311 {
312 pl->ob->casting_time--;
313 pl->ob->start_holding = 1;
314 }
315
316 /* set spell_state so we can update the range in stats field */
317 if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1))
318 pl->ob->start_holding = 0;
319 }
320
321 do_some_living (pl->ob); 259 do_some_living (ob);
322 } 260 }
323} 261}
324 262
325static void 263static void
326process_players2 () 264process_players2 ()
327{ 265{
328 /* 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 */
329 for_all_players (pl) 267 for_all_players (pl)
330 { 268 {
331 /* 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);
332 * 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);
333 * actions, and is thus out of place. All we do here is bounds
334 * checking.
335 */
336 if (pl->has_hit)
337 {
338 if (pl->ob->speed_left > pl->weapon_sp)
339 pl->ob->speed_left = pl->weapon_sp;
340
341 /* This needs to be here - if the player is running, we need to
342 * clear this each tick, but new commands are not being received
343 * so execute_newserver_command() is never called
344 */
345 pl->has_hit = 0;
346 }
347 else if (pl->ob->speed_left > pl->ob->speed)
348 pl->ob->speed_left = pl->ob->speed;
349 } 271 }
350} 272}
351 273
352void 274void
353process_events () 275process_events ()
354{ 276{
355 object *op;
356
357 static object_ptr marker_;
358
359 if (!marker_)
360 marker_ = object::create ();
361
362 object *marker = marker_;
363
364 process_players1 (); 277 process_players1 ();
365 278
366 marker->active_next = active_objects; 279 for_all_actives (op)
367
368 if (marker->active_next)
369 marker->active_next->active_prev = marker;
370
371 marker->active_prev = 0;
372 active_objects = marker;
373
374 while (marker->active_next)
375 { 280 {
376 op = marker->active_next;
377
378 /* Move marker forward - swap op and marker */
379 op->active_prev = marker->active_prev;
380
381 if (op->active_prev)
382 op->active_prev->active_next = op;
383 else
384 active_objects = op;
385
386 marker->active_next = op->active_next;
387
388 if (marker->active_next)
389 marker->active_next->active_prev = marker;
390
391 marker->active_prev = op;
392 op->active_next = marker;
393
394 /* Now process op */ 281 /* Now process op */
395 if (QUERY_FLAG (op, FLAG_FREED)) 282 if (expect_false (QUERY_FLAG (op, FLAG_FREED)))
396 { 283 {
397 LOG (llevError, "BUG: process_events(): Free object on list\n"); 284 LOG (llevError, "BUG: process_events(): Free object on list\n");
398 op->set_speed (0); 285 op->set_speed (0);
399 continue; 286 continue;
400 } 287 }
401 288
402 /* I've seen occasional crashes due to this - the object is removed, 289 if (expect_false (!op->has_active_speed ()))
403 * and thus the map it points to (last map it was on) may be bogus
404 * The real bug is to try to find out the cause of this - someone
405 * is probably calling remove_ob without either an insert_ob or
406 * free_object afterwards, leaving an object dangling. But I'd
407 * rather log this and continue on instead of crashing.
408 * Don't remove players - when a player quits, the object is in
409 * sort of a limbo, of removed, but something we want to keep
410 * around.
411 */
412 if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY)
413 {
414 LOG (llevError, "BUG: process_events(): Removed object on list\n");
415 char *dump = dump_object (op);
416 LOG (llevError, dump);
417 free (dump);
418 op->destroy ();
419 continue;
420 } 290 {
421
422 if (!op->speed)
423 {
424 LOG (llevError, "BUG: process_events(): Object %s has no speed, " 291 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
425 "but is on active list\n", &op->arch->name); 292 "but is on active list\n", op->debug_desc (), op->speed);
426 op->set_speed (0); 293 op->set_speed (0);
427 continue; 294 continue;
428 } 295 }
429 296
430 if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) 297 if (expect_false (op->flag [FLAG_REMOVED]))
431 { 298 {
432 LOG (llevError, "BUG: process_events(): Object without map or " 299 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
433 "inventory is on active list: %s (%d)\n", &op->name, op->count); 300 op->debug_desc ());
434 op->set_speed (0); 301 op->set_speed (0);
435 continue; 302 continue;
436 } 303 }
437 304
438 /* Animate the object. Bug or feature that anim_speed 305 /* Animate the object. Bug or feature that anim_speed
439 * is based on ticks, and not the creatures speed? 306 * is based on ticks, and not the creatures speed?
440 */ 307 */
441 if (op->anim_speed && op->last_anim >= op->anim_speed) 308 if (op->anim_speed && op->last_anim >= op->anim_speed)
442 { 309 {
443 if ((op->type == PLAYER))
444 animate_object (op, op->facing);
445 else
446 animate_object (op, op->direction); 310 animate_object (op, op->contr ? op->facing : op->direction);
447
448 op->last_anim = 1; 311 op->last_anim = 1;
449 } 312 }
450 else 313 else
451 op->last_anim++; 314 ++op->last_anim;
452 315
453 if (op->speed_left > 0) 316 if (expect_false (op->speed_left > 0.f))
454 {
455#if 0
456 /* I've seen occasional crashes in move_symptom() with it
457 * crashing because op is removed - add some debugging to
458 * track if it is removed at this point.
459 * This unfortunately is a bit too verbose it seems - not sure
460 * why - I think what happens is a map is freed or something and
461 * some objects get 'lost' - removed never to be reclaimed.
462 * removed objects generally shouldn't exist.
463 */
464 if (QUERY_FLAG (op, FLAG_REMOVED))
465 { 317 {
466 LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null");
467 }
468#endif
469 --op->speed_left; 318 --op->speed_left;
470 process_object (op); 319 process_object (op);
471
472 if (op->destroyed ())
473 continue;
474 } 320 }
475 321
476 if (settings.casting_time == TRUE && op->casting_time > 0) 322 if (expect_true (!op->contr))
477 op->casting_time--; 323 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
478
479 if (op->speed_left <= 0)
480 op->speed_left += FABS (op->speed);
481 } 324 }
482
483 /* Remove marker object from active list */
484 if (marker->active_prev != NULL)
485 marker->active_prev->active_next = NULL;
486 else
487 active_objects = NULL;
488 325
489 process_players2 (); 326 process_players2 ();
490} 327}
491 328
492/* clean up everything before exiting */ 329/* clean up everything before exiting */
493void 330void
494emergency_save () 331emergency_save ()
495{ 332{
496 LOG (llevDebug, "emergency save begin.\n"); 333 LOG (llevDebug, "emergency save begin.\n");
497 334
498 LOG (llevDebug, "saving players.\n");
499 for_all_players (pl)
500 pl->save (1);
501
502// for_all_players (pl)
503// if (pl->ob)
504// pl->ob->remove ();
505
506 LOG (llevDebug, "saving maps.\n");
507 maptile::emergency_save (); 335 cfperl_emergency_save ();
508 336
509 LOG (llevDebug, "saving book archive.\n"); 337 LOG (llevDebug, "saving book archive.\n");
510 write_book_archive (); 338 write_book_archive ();
511 339
512 LOG (llevDebug, "emergency save done.\n"); 340 LOG (llevDebug, "emergency save done.\n");
513} 341}
514 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
515/* clean up everything before exiting */ 362/* clean up everything before exiting */
516void 363void
517cleanup (bool make_core) 364cleanup (const char *cause, bool make_core)
518{ 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
519 LOG (llevDebug, "cleanup begin.\n"); 374 LOG (llevDebug, "cleanup begin.\n");
520 375
376 if (init_done && !in_cleanup)
377 {
521 in_cleanup = true; 378 in_cleanup = true;
522
523 if (init_done)
524 emergency_save (); 379 emergency_save ();
380 }
381 else
382 in_cleanup = true;
525 383
526 LOG (llevDebug, "running cleanup handlers.\n"); 384 LOG (llevDebug, "running cleanup handlers.\n");
527 INVOKE_GLOBAL (CLEANUP); 385 INVOKE_GLOBAL (CLEANUP);
528 386
529 LOG (llevDebug, "cleanup done.\n"); 387 LOG (llevDebug, "cleanup done.\n");
530 388
389 log_cleanup ();
390
531 if (make_core) 391 if (make_core)
532 abort (); 392 cleanup_inform (cause, make_core);
533 else 393 else
534 _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 } 394 {
574} 395 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
575 396 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
576int 397 client::flush_sockets ();
577forbid_play (void)
578{
579#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
580 char buf[MAX_BUF], day[MAX_BUF];
581 FILE *fp;
582 time_t clock;
583 struct tm *tm;
584 int i, start, stop, forbit = 0, comp;
585
586 clock = time (NULL);
587 tm = (struct tm *) localtime (&clock);
588
589 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
590 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
591 return 0;
592
593 while (fgets (buf, MAX_BUF, fp))
594 { 398 }
595 if (buf[0] == '#')
596 continue;
597 if (!strncmp (buf, "msg", 3))
598 {
599 if (forbit)
600 while (fgets (buf, MAX_BUF, fp)) /* print message */
601 fputs (buf, logfile);
602 break;
603 399
604 } 400 cfperl_cleanup (make_core);
605 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) 401 _exit (make_core);
606 {
607 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
608 continue;
609 }
610
611 for (i = 0; i < 7; i++)
612 {
613 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
614 forbit = 1;
615 }
616 }
617
618 close_and_delete (fp, comp);
619
620 return forbit;
621#else
622 return 0;
623#endif
624} 402}
625 403
626/* 404/*
627 * 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.
628 * 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
629 * 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.
630 * 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
631 * 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
632 * 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
… …
634 * done on the same tick, but that will happen very infrequently 412 * done on the same tick, but that will happen very infrequently
635 * 413 *
636 * 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
637 * doing the various things. 415 * doing the various things.
638 */ 416 */
639
640extern unsigned long todtick;
641
642void 417void
643do_specials (void) 418do_specials (void)
644{ 419{
645 if (!(pticks % PTICKS_PER_CLOCK))
646 tick_the_clock ();
647
648 if (!(pticks % 7))
649 shstr::gc (); 420 shstr::gc ();
421 archetype::gc ();
650 422
423 if (expect_false (!(pticks % TICKS_PER_HOUR)))
424 adjust_daylight ();
425
651 if (!(pticks % 2503)) 426 if (expect_false (!(pticks % 2503)))
652 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 427 fix_weight (); /* Hack to fix weightproblems caused by bugs */
653 428
654 if (!(pticks % 5003)) 429 if (expect_false (!(pticks % 5003)))
655 write_book_archive (); 430 write_book_archive ();
656 431
657 if (!(pticks % 5009)) 432 if (expect_false (!(pticks % 5009)))
658 clean_friendly_list (); 433 clean_friendly_list ();
659 434
660 if (!(pticks % 5011)) 435 if (expect_false (!(pticks % 5011)))
661 obsolete_parties (); 436 obsolete_parties ();
662 437
663 if (!(pticks % 12503)) 438 if (expect_false (!(pticks % 12503)))
664 fix_luck (); 439 fix_luck ();
665} 440}
666 441
667void 442void
668server_tick () 443server_tick ()
669{ 444{
670 // first do the user visible stuff 445 // first do the user visible stuff
671 doeric_server ();
672 INVOKE_GLOBAL (CLOCK); 446 INVOKE_GLOBAL (CLOCK);
673 process_events (); /* "do" something with objects with speed */ 447 process_events (); // "do" something with objects with speed
674 flush_sockets (); 448 client::clock (); // draw client maps etc.
675 449
676 // then do some bookkeeping, should not really be here 450 // then do some bookkeeping, should not really be here
677 do_specials (); /* Routines called from time to time. */ 451 do_specials (); /* Routines called from time to time. */
678 attachable::check_mortals (); 452 attachable::check_mortals ();
679 453
680 ++pticks; 454 ++pticks;
681} 455}
682 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
683int 483int
684main (int argc, char **argv) 484main (int argc, char **argv)
685{ 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{
686 settings.argc = argc; 590 settings.argc = argc;
687 settings.argv = argv; 591 settings.argv = argv;
688 592
593 g_thread_init (0); // for the slice allocator only
594
689 init (argc, argv); 595 init (argc, argv);
690
691 initPlugins ();
692 596
693 for (;;) 597 for (;;)
694 cfperl_main (); 598 cfperl_main ();
695
696 cleanup (true);
697} 599}
600#endif
698 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