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.144 by root, Thu Nov 19 04:30:46 2009 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 it under
8 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
9 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 11 * 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 Affero GNU General Public License
18 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22*/ 23 */
23 24
24#include <global.h> 25#include <global.h>
25#include <object.h> 26#include <object.h>
26#include <tod.h> 27#include <tod.h>
27 28
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> 29#include <sproto.h>
37#include <time.h> 30#include <time.h>
31
32#include <glib.h>
38 33
39#include <../random_maps/random_map.h> 34#include <../random_maps/random_map.h>
40#include <../random_maps/rproto.h> 35#include <../random_maps/rproto.h>
41#include "path.h" 36#include "path.h"
42 37
43static char days[7][4] = {
44 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
45};
46
47void 38void
48version (object *op) 39version (object *op)
49{ 40{
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); 41 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra 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
61 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>");
63 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>");
65 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>");
67 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>");
69 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>");
71 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>");
73 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jxrgensen <jorgens@flipper.pvv.unit.no>");
74 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>");
76 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>");
78 new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>");
79 new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>");
80 new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>");
81 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>");
82 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>");
83 new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>");
84 new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>");
85 new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>");
86 new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>");
87 new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>");
88 new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>");
89 new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>");
90 new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>");
91 new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>");
92 new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>");
93 new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>");
94 new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>");
95 new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>");
96 new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>");
97 new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>");
98 new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>");
99 new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>");
100 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>");
102 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>");
104 new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n");
105
106 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
107 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
108 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>");
110 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>");
112 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
113} 42}
114 43
115/* This is a basic little function to put the player back to his 44/* This is a basic little function to put the player back to his
116 * savebed. We do some error checking - its possible that the 45 * savebed. We do some error checking - its possible that the
117 * savebed map may no longer exist, so we make sure the player 46 * savebed map may no longer exist, so we make sure the player
118 * goes someplace. 47 * goes someplace.
119 */ 48 */
120void 49void
121enter_player_savebed (object *op) 50enter_player_savebed (object *op)
122{ 51{
123 object *tmp = object::create (); 52 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} 53}
130 54
131/* 55/*
132 * enter_map(): Moves the player and pets from current map (if any) to 56 * 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 57 * 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. 60 * the function that calls this should figure them out.
137 */ 61 */
138void 62void
139object::enter_map (maptile *newmap, int x, int y) 63object::enter_map (maptile *newmap, int x, int y)
140{ 64{
141 if (destroyed () || !newmap) 65 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
142 return; 66 return;
143 67
144 if (out_of_map (newmap, x, y)) 68 if (out_of_map (newmap, x, y))
145 { 69 {
146 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); 70 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"); 77 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
154 return; 78 return;
155 } 79 }
156 } 80 }
157 81
158 if (map && map != newmap) 82 if (contr && map != newmap && map)
159 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 83 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
160 return; 84 return;
161 85
162 /* If it is a player login, he has yet to be inserted anyplace. 86 // remove, so stupid ob_locked does not trigger a failure
163 * otherwise, we need to deal with removing the player here.
164 */
165 remove (); 87 remove ();
166 88
167 /* try to find a spot for the player */ 89 /* try to find a spot for the player */
168 if (ob_blocked (this, newmap, x, y)) 90 if (blocked (newmap, x, y))
169 { /* First choice blocked */ 91 { /* First choice blocked */
170 /* We try to find a spot for the player, starting closest in. 92 /* 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, 93 * 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 94 * So for example, if the north space is free, you would always end up there even
173 * if other spaces around are available. 95 * if other spaces around are available.
191 else 113 else
192 /* not much we can do in this case. */ 114 /* 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); 115 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 } 116 }
195 117
196 if (map != newmap && contr) 118 if (contr && map != newmap)
197 { 119 {
198 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) 120 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
199 return; 121 return;
200 122
201 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) 123 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
206 this->y = y; 128 this->y = y;
207 map = newmap; 129 map = newmap;
208 130
209 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); 131 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
210 132
211 enemy = NULL; 133 enemy = 0;
212 134
213 if (contr) 135 if (contr)
214 { 136 {
215 contr->maplevel = newmap->path; 137 contr->maplevel = newmap->path;
216 contr->count = 0; 138 contr->count = 0;
217 } 139 }
218 140
219 /* Update any golems */ 141 /* Update any golems */
220 if (type == PLAYER && contr->ranges[range_golem]) 142 if (type == PLAYER)
221 { 143 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 { 144 {
229 remove_friendly_object (contr->ranges[range_golem]); 145 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
230 contr->ranges[range_golem]->destroy (); 146
231 contr->ranges[range_golem] = 0; 147 if (i < 0)
232 } 148 golem->drop_and_destroy ();
233 else 149 else
234 {
235 for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more)
236 { 150 {
237 tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.x); 151 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); 152 golem->direction = find_dir_2 (x - golem->x, y - golem->y);
239 tmp->map = newmap;
240 } 153 }
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 } 154 }
246 }
247
248 direction = 0;
249 155
250 /* since the players map is already loaded, we don't need to worry 156 /* since the players map is already loaded, we don't need to worry
251 * about pending objects. 157 * about pending objects.
252 */ 158 */
253 remove_all_pets (newmap); 159 remove_all_pets (newmap);
261 * is needed after the players have been updated. 167 * is needed after the players have been updated.
262 */ 168 */
263static void 169static void
264process_players1 () 170process_players1 ()
265{ 171{
266 int flag;
267
268 /* Basically, we keep looping until all the players have done their actions. */ 172 /* Basically, we keep looping until all the players have done their actions. */
269 for (flag = 1; flag != 0;) 173 for (int flag = 1; flag != 0;)
270 { 174 {
271 flag = 0; 175 flag = 0;
272 for_all_players (pl) 176 for_all_players (pl)
273 { 177 {
274 pl->refcnt_chk (); 178 pl->refcnt_chk ();
275 179
276 if (!pl->ob || !pl->ns || !pl->ob->active ()) 180 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
277 continue; 181 continue;
278 182
279 if (pl->ob->speed_left > 0)
280 if (handle_newcs_player (pl->ob)) 183 if (handle_newcs_player (pl->ob))
281 flag = 1; 184 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 } 185 }
301#endif 186 }
302 } /* end of for loop for all the players */
303 } /* for flag */
304 187
305 for_all_players (pl) 188 for_all_players (pl)
306 { 189 {
190 object *ob = pl->ob;
191
192 // process_objects destroys the speed_left value
193 pl->speed_left_save = ob->speed_left;
194
307 if (!pl->ob || !pl->ns || !pl->ob->active ()) 195 if (expect_false (!ob || !pl->ns || !ob->active))
308 continue; 196 continue;
309 197
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); 198 do_some_living (ob);
324 } 199 }
325} 200}
326 201
327static void 202static void
328process_players2 () 203process_players2 ()
329{ 204{
330 /* Then check if any players should use weapon-speed instead of speed */ 205 /* Then check if any players should use weapon-speed instead of speed */
331 for_all_players (pl) 206 for_all_players (pl)
332 { 207 {
333 /* The code that did weapon_sp handling here was out of place - 208 // restore speed_left value saved by process_players1
334 * this isn't called until after the player has finished there
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; 209 pl->ob->speed_left = pl->speed_left_save;
351 }
352}
353 210
354void 211 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
212 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
213 }
214}
215
216static void
355process_events () 217process_events ()
356{ 218{
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 (); 219 process_players1 ();
367 220
368 marker->active_next = active_objects; 221 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 { 222 {
378 op = marker->active_next; 223 // try to prefetch some stuff we expect to need
224 // obviously, it should be grouped into the same cacheline.
225 // preliminary results indicate that this gives halves the speed
226 // used for the inner loop
227 if (_i < actives.size ()) // HACK, rely on _i :/
228 {
229 object *next = actives [_i + 1];
379 230
380 /* Move marker forward - swap op and marker */ 231 prefetch (&next->flag , 0, 1);
381 op->active_prev = marker->active_prev; 232 prefetch (&next->speed , 0, 1);
382 233 prefetch (&next->anim_speed, 0, 1);
383 if (op->active_prev) 234 prefetch (&next->contr , 0, 1);
384 op->active_prev->active_next = op; 235 }
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 236
396 /* Now process op */ 237 /* Now process op */
397 if (QUERY_FLAG (op, FLAG_FREED)) 238 if (expect_false (QUERY_FLAG (op, FLAG_FREED)))
398 { 239 {
399 LOG (llevError, "BUG: process_events(): Free object on list\n"); 240 LOG (llevError, "BUG: process_events(): Free object on list\n");
400 op->set_speed (0); 241 op->set_speed (0);
401 continue; 242 continue;
402 } 243 }
403 244
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 ()) 245 if (expect_false (!op->has_active_speed ()))
425 { 246 {
426 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " 247 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
427 "but is on active list\n", op->debug_desc (), op->speed); 248 "but is on active list\n", op->debug_desc (), op->speed);
428 op->set_speed (0); 249 op->set_speed (0);
429 continue; 250 continue;
430 } 251 }
431 252
432 if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) 253 if (expect_false (op->flag [FLAG_REMOVED]))
433 { 254 {
434 LOG (llevError, "BUG: process_events(): Object without map or " 255 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); 256 op->debug_desc ());
436 op->set_speed (0); 257 op->set_speed (0);
437 continue; 258 continue;
438 } 259 }
439 260
440 /* Animate the object. Bug or feature that anim_speed 261 /* Animate the object. Bug or feature that anim_speed
441 * is based on ticks, and not the creatures speed? 262 * is based on ticks, and not the creatures speed?
442 */ 263 */
443 if (op->anim_speed && op->last_anim >= op->anim_speed) 264 if (op->anim_speed && op->last_anim >= op->anim_speed)
444 { 265 {
445 if ((op->type == PLAYER))
446 animate_object (op, op->facing);
447 else
448 animate_object (op, op->direction); 266 animate_object (op, op->contr ? op->facing : op->direction);
449
450 op->last_anim = 1; 267 op->last_anim = 1;
451 } 268 }
452 else 269 else
453 op->last_anim++; 270 ++op->last_anim;
454 271
455 if (op->speed_left > 0) 272 if (expect_false (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 { 273 {
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; 274 --op->speed_left;
472 process_object (op); 275 process_object (op);
473
474 if (op->destroyed ())
475 continue;
476 } 276 }
477 277
478 if (settings.casting_time == TRUE && op->casting_time > 0) 278 // this will destroy the speed_left value for players, but
479 op->casting_time--; 279 // process_players1 and ..2 save/restore the real value,
480 280 // so we can avoid a costly test here.
481 if (op->speed_left <= 0) 281 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
482 op->speed_left += FABS (op->speed);
483 } 282 }
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 283
491 process_players2 (); 284 process_players2 ();
492} 285}
493 286
494/* clean up everything before exiting */ 287/* clean up everything before exiting */
495void 288void
496emergency_save () 289emergency_save ()
497{ 290{
498 LOG (llevDebug, "emergency save begin.\n"); 291 LOG (llevDebug, "emergency save begin.\n");
499 292
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 (); 293 cfperl_emergency_save ();
510 294
511 LOG (llevDebug, "saving book archive.\n"); 295 LOG (llevDebug, "saving book archive.\n");
512 write_book_archive (); 296 write_book_archive ();
513 297
514 LOG (llevDebug, "emergency save done.\n"); 298 LOG (llevDebug, "emergency save done.\n");
515} 299}
516 300
301// send all clients some informational text
302static void
303cleanup_inform (const char *cause, bool make_core)
304{
305 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
306
307 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
308 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
309
310 if (make_core)
311 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
312 else
313 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");
314
315 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
316
317 client::flush_sockets ();
318}
319
517/* clean up everything before exiting */ 320/* clean up everything before exiting */
518void 321void
519cleanup (bool make_core) 322cleanup (const char *cause, bool make_core)
520{ 323{
324 if (make_core)
325 fork_abort (cause);
326
327 LOG (llevError, "cleanup cause: %s\n", cause);
328
329 if (!make_core)
330 cleanup_inform (cause, make_core);
331
521 LOG (llevDebug, "cleanup begin.\n"); 332 LOG (llevDebug, "cleanup begin.\n");
522 333
523 if (init_done && !in_cleanup) 334 if (init_done && !in_cleanup)
524 { 335 {
525 in_cleanup = true; 336 in_cleanup = true;
531 LOG (llevDebug, "running cleanup handlers.\n"); 342 LOG (llevDebug, "running cleanup handlers.\n");
532 INVOKE_GLOBAL (CLEANUP); 343 INVOKE_GLOBAL (CLEANUP);
533 344
534 LOG (llevDebug, "cleanup done.\n"); 345 LOG (llevDebug, "cleanup done.\n");
535 346
347 log_cleanup ();
348
536 if (make_core) 349 if (make_core)
537 abort (); 350 cleanup_inform (cause, make_core);
538 else 351 else
539 _exit (0);
540}
541
542void
543leave (player *pl, int draw_exit)
544{
545 if (pl)
546 {
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 } 352 {
579} 353 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
580 354 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
581int 355 client::flush_sockets ();
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 { 356 }
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 357
609 } 358 cfperl_cleanup (make_core);
610 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) 359 _exit (make_core);
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} 360}
630 361
631/* 362/*
632 * do_specials() is a collection of functions to call from time to time. 363 * 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 364 * 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. 365 * 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 366 * 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 367 * 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 368 * 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 370 * done on the same tick, but that will happen very infrequently
640 * 371 *
641 * I also think this code makes it easier to see how often we really are 372 * I also think this code makes it easier to see how often we really are
642 * doing the various things. 373 * doing the various things.
643 */ 374 */
644 375static void
645extern unsigned long todtick;
646
647void
648do_specials (void) 376do_specials (void)
649{ 377{
650 if (!(pticks % PTICKS_PER_CLOCK))
651 tick_the_clock ();
652
653 if (!(pticks % 7))
654 shstr::gc (); 378 shstr::gc ();
379 archetype::gc ();
655 380
381 if (expect_false (!(pticks % TICKS_PER_HOUR)))
382 maptile::adjust_daylight ();
383
656 if (!(pticks % 2503)) 384 if (expect_false (!(pticks % 2503)))
657 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 385 fix_weight (); /* Hack to fix weightproblems caused by bugs */
658 386
659 if (!(pticks % 5003)) 387 if (expect_false (!(pticks % 5003)))
660 write_book_archive (); 388 write_book_archive ();
661 389
662 if (!(pticks % 5009)) 390 if (expect_false (!(pticks % 5009)))
663 clean_friendly_list (); 391 clean_friendly_list ();
664 392
665 if (!(pticks % 5011)) 393 if (expect_false (!(pticks % 5011)))
666 obsolete_parties (); 394 obsolete_parties ();
667 395
668 if (!(pticks % 12503)) 396 if (expect_false (!(pticks % 12503)))
669 fix_luck (); 397 fix_luck ();
670} 398}
671 399
672void 400void
673server_tick () 401server_tick ()
674{ 402{
675 // first do the user visible stuff 403 // first do the user visible stuff
676 doeric_server ();
677 INVOKE_GLOBAL (CLOCK); 404 INVOKE_GLOBAL (CLOCK);
678 process_events (); /* "do" something with objects with speed */ 405 process_events (); // "do" something with objects with speed
679 flush_sockets (); 406 client::clock (); // draw client maps etc.
680 407
681 // then do some bookkeeping, should not really be here 408 // then do some bookkeeping, should not really be here
682 do_specials (); /* Routines called from time to time. */ 409 do_specials (); /* Routines called from time to time. */
683 attachable::check_mortals (); 410 attachable::check_mortals ();
684 411
685 ++pticks; 412 ++pticks;
686} 413}
687 414
415// normal main
688int 416int
689main (int argc, char **argv) 417main (int argc, char **argv)
690{ 418{
691 settings.argc = argc; 419 settings.argc = argc;
692 settings.argv = argv; 420 settings.argv = argv;
421
422 rndm.seed (time (0));
423 g_thread_init (0); // for the slice allocator only
693 424
694 init (argc, argv); 425 init (argc, argv);
695
696 initPlugins ();
697 426
698 for (;;) 427 for (;;)
699 cfperl_main (); 428 cfperl_main ();
700
701 cleanup (true);
702} 429}
703 430

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines