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.96 by root, Sat Apr 21 16:56:32 2007 UTC vs.
Revision 1.155 by root, Wed Apr 21 06:45:57 2010 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines