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.104 by root, Thu May 17 14:14:55 2007 UTC vs.
Revision 1.157 by root, Fri Apr 23 04:32:47 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.
107 * savebed map may no longer exist, so we make sure the player
108 * goes someplace.
109 */ 46 */
110void 47void
111enter_player_savebed (object *op) 48enter_player_savebed (object *op)
112{ 49{
113 object *tmp = object::create (); 50 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} 51}
120 52
121/* 53/*
122 * enter_map(): Moves the player and pets from current map (if any) to 54 * 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 55 * new map. map, x, y must be set. map is the map we are moving the
124 * player to - it could be the map he just came from if the load failed for 56 * player to - it could be the map he just came from if the load failed for
125 * whatever reason. If default map coordinates are to be used, then 57 * whatever reason. If default map coordinates are to be used, then
126 * the function that calls this should figure them out. 58 * the function that calls this should figure them out.
127 */ 59 */
128void 60bool
129object::enter_map (maptile *newmap, int x, int y) 61object::enter_map (maptile *newmap, int x, int y)
130{ 62{
131 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) 63 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
132 return; 64 return false;
133 65
134 if (out_of_map (newmap, x, y)) 66 if (out_of_map (newmap, x, y))
135 { 67 {
136 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); 68 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
137 x = newmap->enter_x; 69 x = newmap->enter_x;
… …
139 if (out_of_map (newmap, x, y)) 71 if (out_of_map (newmap, x, y))
140 { 72 {
141 LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", 73 LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n",
142 &newmap->path, x, y, newmap->width, newmap->height); 74 &newmap->path, x, y, newmap->width, newmap->height);
143 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); 75 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
144 return; 76 return false;
145 } 77 }
146 } 78 }
147 79
148 if (contr && map != newmap && map) 80 if (contr && map != newmap && map)
149 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 81 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
150 return; 82 return false;
151 83
152 // remove, so stupid ob_locked does not trigger a failure 84 // remove, so stupid blocked does not trigger a failure
153 remove (); 85 remove ();
154 86
155 /* try to find a spot for the player */ 87 /* try to find a spot for the player */
156 if (ob_blocked (this, newmap, x, y)) 88 if (blocked (newmap, x, y))
157 { /* First choice blocked */ 89 { /* First choice blocked */
158 /* We try to find a spot for the player, starting closest in. 90 /* 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, 91 * 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 92 * So for example, if the north space is free, you would always end up there even
161 * if other spaces around are available. 93 * if other spaces around are available.
162 * Note that for the second and third calls, we could start at a position other 94 * 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. 95 * than one, but then we could end up on the other side of walls and so forth.
164 */ 96 */
165 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); 97 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1);
166 98
167 if (i == -1) 99 if (i < 0)
168 { 100 {
169 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); 101 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
170 if (i == -1) 102 if (i < 0)
171 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); 103 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
172 } 104 }
173 105
174 if (i != -1) 106 if (i >= 0)
175 { 107 {
176 x += freearr_x[i]; 108 x += freearr_x[i];
177 y += freearr_y[i]; 109 y += freearr_y[i];
178 } 110 }
179 else 111 else
… …
182 } 114 }
183 115
184 if (contr && map != newmap) 116 if (contr && map != newmap)
185 { 117 {
186 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) 118 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
187 return; 119 return false;
188 120
189 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) 121 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
190 return; 122 return false;
191 } 123 }
192
193 this->x = x;
194 this->y = y;
195 map = newmap;
196
197 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
198 124
199 enemy = 0; 125 enemy = 0;
200 126
127 newmap->insert (this, x, y);
128
129 if (map == newmap) // see if we actually arrived there - insert might trigger a teleport
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 }
206 135
207 /* Update any golems */ 136 /* Update any golems */
208 if (type == PLAYER)
209 if (object *golem = contr->golem) 137 if (object *golem = contr->golem)
210 { 138 {
211 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); 139 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
212 140
213 if (i < 0) 141 if (i < 0)
214 golem->destroy (); 142 golem->drop_and_destroy ();
215 else 143 else
216 { 144 {
217 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); 145 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
218 golem->direction = find_dir_2 (x - golem->x, y - golem->y); 146 golem->direction = find_dir_2 (golem->x - x, golem->y - y);
147 }
219 } 148 }
220 } 149 }
221 150
222 /* since the players map is already loaded, we don't need to worry 151 /* since the players map is already loaded, we don't need to worry
223 * about pending objects. 152 * about pending objects.
224 */ 153 */
225 remove_all_pets (newmap); 154 move_all_pets ();
155
156 return true;
157 }
158
159 return false;
226} 160}
227 161
228/* process_players1 and process_players2 do all the player related stuff. 162/* process_players1 and process_players2 do all the player related stuff.
229 * I moved it out of process events and process_map. This was to some 163 * I moved it out of process events and process_map. This was to some
230 * extent for debugging as well as to get a better idea of the time used 164 * extent for debugging as well as to get a better idea of the time used
… …
241 flag = 0; 175 flag = 0;
242 for_all_players (pl) 176 for_all_players (pl)
243 { 177 {
244 pl->refcnt_chk (); 178 pl->refcnt_chk ();
245 179
246 if (!pl->ob || !pl->ns || !pl->ob->active) 180 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
247 continue; 181 continue;
248 182
249 if (pl->ob->speed_left > 0.f && pl->ns)
250 if (handle_newcs_player (pl->ob)) 183 if (handle_newcs_player (pl->ob))
251 flag = 1; 184 flag = 1;
252 185 }
253 /* If the player is not actively playing, don't make a 186 }
254 * backup save - nothing to save anyway. Plus, the
255 * map may not longer be valid. This can happen when the
256 * player quits - they exist for purposes of tracking on the map,
257 * but don't actually reside on any actual map.
258 */
259 if (QUERY_FLAG (pl->ob, FLAG_REMOVED))
260 continue;
261 } /* end of for loop for all the players */
262 } /* for flag */
263 187
264 for_all_players (pl) 188 for_all_players (pl)
265 { 189 {
266 object *ob = pl->ob; 190 object *ob = pl->ob;
267 191
192 // process_objects destroys the speed_left value
193 pl->speed_left_save = ob->speed_left;
194
268 if (!ob || !pl->ns || !ob->active) 195 if (expect_false (!ob || !pl->ns || !ob->active))
269 continue; 196 continue;
270
271 // process_events might steal us one speed slot, so adjust accordingly
272 if (ob->speed_left > 0.f)
273 ++ob->speed_left;
274 197
275 do_some_living (ob); 198 do_some_living (ob);
276 } 199 }
277} 200}
278 201
… …
280process_players2 () 203process_players2 ()
281{ 204{
282 /* 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 */
283 for_all_players (pl) 206 for_all_players (pl)
284 { 207 {
285 if (pl->has_hit) 208 // restore speed_left value saved by process_players1
286 { 209 pl->ob->speed_left = pl->speed_left_save;
287 pl->ob->speed_left = min (pl->weapon_speed (), pl->ob->speed_left + pl->weapon_speed ());
288 210
289 if (pl->ob->speed_left > 0.f) 211 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
290 pl->has_hit = 0;
291 }
292 else
293 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); 212 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
294 } 213 }
295} 214}
296 215
297void 216static void
298process_events () 217process_events ()
299{ 218{
300 process_players1 (); 219 process_players1 ();
301 220
302 for_all_actives (op) 221 for_all_actives (op)
303 { 222 {
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];
230
231 prefetch (&next->flag , 0, 1);
232 prefetch (&next->speed , 0, 1);
233 prefetch (&next->anim_speed, 0, 1);
234 prefetch (&next->contr , 0, 1);
235 }
236
304 /* Now process op */ 237 /* Now process op */
305 if (QUERY_FLAG (op, FLAG_FREED)) 238 if (expect_false (op->flag [FLAG_FREED]))
306 { 239 {
307 LOG (llevError, "BUG: process_events(): Free object on list\n"); 240 LOG (llevError, "BUG: process_events(): Free object on list\n");
308 op->set_speed (0); 241 op->set_speed (0);
309 continue; 242 continue;
310 } 243 }
311 244
312 if (!op->has_active_speed ()) 245 if (expect_false (!op->has_active_speed ()))
313 { 246 {
314 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " 247 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
315 "but is on active list\n", op->debug_desc (), op->speed); 248 "but is on active list\n", op->debug_desc (), op->speed);
316 op->set_speed (0); 249 op->set_speed (0);
317 continue; 250 continue;
318 } 251 }
319 252
320 if (op->flag [FLAG_REMOVED]) 253 if (expect_false (op->flag [FLAG_REMOVED]))
321 { 254 {
322 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", 255 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
323 op->debug_desc ()); 256 op->debug_desc ());
324 op->set_speed (0); 257 op->set_speed (0);
325 continue; 258 continue;
… …
334 op->last_anim = 1; 267 op->last_anim = 1;
335 } 268 }
336 else 269 else
337 ++op->last_anim; 270 ++op->last_anim;
338 271
339 if (op->speed_left > 0.f) 272 if (expect_false (op->speed_left > 0.f))
340 { 273 {
341 --op->speed_left; 274 --op->speed_left;
342 process_object (op); 275 process_object (op);
343
344 if (op->destroyed ())
345 continue;
346 } 276 }
347 277
348 if (!op->contr) 278 // this will destroy the speed_left value for players, but
279 // process_players1 and ..2 save/restore the real value,
280 // so we can avoid a costly test here.
349 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); 281 op->speed_left = min (op->speed, op->speed_left + op->speed);
350 } 282 }
351 283
352 process_players2 (); 284 process_players2 ();
353} 285}
354 286
… …
368 300
369// send all clients some informational text 301// send all clients some informational text
370static void 302static void
371cleanup_inform (const char *cause, bool make_core) 303cleanup_inform (const char *cause, bool make_core)
372{ 304{
373 int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); 305 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
374 306
375 new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); 307 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
376 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s\n", cause); 308 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
377 309
378 if (make_core) 310 if (make_core)
379 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.\n"); 311 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
380 else 312 else
381 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"); 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.");
382 314
383 new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); 315 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
384 316
385 flush_sockets (); 317 client::flush_sockets ();
386} 318}
387 319
388/* clean up everything before exiting */ 320/* clean up everything before exiting */
389void 321void
390cleanup (const char *cause, bool make_core) 322cleanup (const char *cause, bool make_core)
… …
410 LOG (llevDebug, "running cleanup handlers.\n"); 342 LOG (llevDebug, "running cleanup handlers.\n");
411 INVOKE_GLOBAL (CLEANUP); 343 INVOKE_GLOBAL (CLEANUP);
412 344
413 LOG (llevDebug, "cleanup done.\n"); 345 LOG (llevDebug, "cleanup done.\n");
414 346
347 log_cleanup ();
348
415 if (make_core) 349 if (make_core)
416 {
417 cleanup_inform (cause, make_core); 350 cleanup_inform (cause, make_core);
418 cfperl_cleanup (make_core);
419 _exit (1);
420 }
421 else 351 else
422 { 352 {
423 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.\n"); 353 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
424 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE "\n"); 354 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
425 flush_sockets (); 355 client::flush_sockets ();
356 }
357
426 cfperl_cleanup (make_core); 358 cfperl_cleanup (make_core);
427 _exit (0); 359 _exit (make_core);
428 }
429}
430
431int
432forbid_play (void)
433{
434#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
435 char buf[MAX_BUF], day[MAX_BUF];
436 FILE *fp;
437 time_t clock;
438 struct tm *tm;
439 int i, start, stop, forbit = 0, comp;
440
441 clock = time (NULL);
442 tm = (struct tm *) localtime (&clock);
443
444 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
445 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
446 return 0;
447
448 while (fgets (buf, MAX_BUF, fp))
449 {
450 if (buf[0] == '#')
451 continue;
452
453 if (!strncmp (buf, "msg", 3))
454 {
455 if (forbit)
456 while (fgets (buf, MAX_BUF, fp)) /* print message */
457 fputs (buf, logfile);
458 break;
459 }
460 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
461 {
462 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
463 continue;
464 }
465
466 for (i = 0; i < 7; i++)
467 {
468 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
469 forbit = 1;
470 }
471 }
472
473 close_and_delete (fp, comp);
474
475 return forbit;
476#else
477 return 0;
478#endif
479} 360}
480 361
481/* 362/*
482 * 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.
483 * 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
… …
489 * done on the same tick, but that will happen very infrequently 370 * done on the same tick, but that will happen very infrequently
490 * 371 *
491 * 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
492 * doing the various things. 373 * doing the various things.
493 */ 374 */
494void 375static void
495do_specials (void) 376do_specials ()
496{ 377{
497 if (!(pticks % TICKS_PER_HOUR))
498 adjust_daylight ();
499
500 if (!(pticks % 7))
501 shstr::gc (); 378 shstr::gc ();
379 archetype::gc ();
502 380
381 if (expect_false (!(pticks % TICKS_PER_HOUR)))
382 maptile::adjust_daylight ();
383
503 if (!(pticks % 2503)) 384 if (expect_false (!(pticks % 2503)))
504 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 385 fix_weight (); /* Hack to fix weightproblems caused by bugs */
505 386
506 if (!(pticks % 5003)) 387 if (expect_false (!(pticks % 5003)))
507 write_book_archive (); 388 write_book_archive ();
508 389
509 if (!(pticks % 5009)) 390 if (expect_false (!(pticks % 5009)))
510 clean_friendly_list (); 391 clean_friendly_list ();
511 392
512 if (!(pticks % 5011)) 393 if (expect_false (!(pticks % 5011)))
513 obsolete_parties (); 394 obsolete_parties ();
514 395
515 if (!(pticks % 12503)) 396 if (expect_false (!(pticks % 12503)))
516 fix_luck (); 397 fix_luck ();
517} 398}
518 399
519void 400void
520server_tick () 401server_tick ()
521{ 402{
522 // first do the user visible stuff 403 // first do the user visible stuff
523 doeric_server ();
524 INVOKE_GLOBAL (CLOCK); 404 INVOKE_GLOBAL (CLOCK);
525 process_events (); /* "do" something with objects with speed */ 405 process_events (); // "do" something with objects with speed
526 flush_sockets (); 406 client::clock (); // draw client maps etc.
527 407
528 // then do some bookkeeping, should not really be here 408 // then do some bookkeeping, should not really be here
529 do_specials (); /* Routines called from time to time. */ 409 do_specials (); /* Routines called from time to time. */
530 attachable::check_mortals (); 410 attachable::check_mortals ();
531 411
532 ++pticks; 412 ++pticks;
533}
534 413
535#if 0 414 if (object::object_count >= RESTART_COUNT)
536// used fro benchmarking (x86/amd64-specific) 415 cleanup ("running out of protocol ID values - need full restart");
537typedef unsigned long tval;
538typedef unsigned long long stamp64;
539
540extern inline tval
541stamp (void)
542{
543 tval tsc;
544 asm volatile ("rdtsc":"=a" (tsc)::"edx");
545
546 return tsc;
547} 416}
548
549extern inline tval
550measure (tval t)
551{
552 tval tsc;
553 asm volatile ("rdtsc":"=a" (tsc)::"edx");
554
555 if (tsc > t)
556 return tsc - t;
557 else
558 return t - tsc;
559}
560
561int
562main (int argc, char **argv)
563{
564 rand_gen rg(0);
565 tval fastest = 0x7fffffff;
566 for (int loop = 10000; loop--; )
567 {
568 tval s = stamp ();
569 volatile int i = rg.get_int(25);
570 fastest = min (fastest, measure (s));
571 }
572
573 //printf ("fastest %d\n", fastest);
574 for (int i = 0; i < 1024*1024*3; ++i)
575 {
576 char c = rg.get_int (256);
577 write (2, &c, 1);
578 }
579}
580
581#else
582 417
583// normal main 418// normal main
584int 419int
585main (int argc, char **argv) 420main (int argc, char **argv)
586{ 421{
587 settings.argc = argc; 422 settings.argc = argc;
588 settings.argv = argv; 423 settings.argv = argv;
424
425 rndm.seed (time (0));
426 g_thread_init (0); // for the slice allocator only
589 427
590 init (argc, argv); 428 init (argc, argv);
591
592 initPlugins ();
593 429
594 for (;;) 430 for (;;)
595 cfperl_main (); 431 cfperl_main ();
596} 432}
597#endif
598 433

Diff Legend

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