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.70 by root, Sun Dec 31 21:02:05 2006 UTC vs.
Revision 1.117 by root, Wed Sep 12 11:10:11 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines