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.80 by pippijn, Sat Jan 6 14:42:30 2007 UTC vs.
Revision 1.174 by root, Tue Jan 3 11:25:36 2012 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 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#ifdef HAVE_DES_H
30# include <des.h>
31#else
32# ifdef HAVE_CRYPT_H
33# include <crypt.h>
34# endif
35#endif
36
37#include <sproto.h> 29#include <sproto.h>
38#include <time.h> 30#include <time.h>
39 31
40#include <../random_maps/random_map.h> 32#include <glib.h>
41#include <../random_maps/rproto.h> 33
34#include <rmg.h>
35#include <rproto.h>
42#include "path.h" 36#include "path.h"
43
44static char days[7][4] = {
45 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
46};
47 37
48void 38void
49version (object *op) 39version (object *op)
50{ 40{
51 if (op)
52 clear_win_info (op);
53
54 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);
55
56 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
57 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
58 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
59 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>");
60 new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>");
61 new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>");
62 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>");
63 new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>");
64 new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>");
65 new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>");
66 new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>");
67 new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>");
68 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>");
69 new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>");
70 new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>");
71 new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>");
72 new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>");
73 new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>");
74 new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>");
75 new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>");
76 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>");
77 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>");
78 new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>");
79 new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>");
80 new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>");
81 new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>");
82 new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>");
83 new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>");
84 new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>");
85 new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>");
86 new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>");
87 new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>");
88 new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>");
89 new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>");
90 new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>");
91 new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>");
92 new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>");
93 new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>");
94 new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>");
95 new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>");
96 new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>");
97 new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>");
98 new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>");
99 new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n");
100
101 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
102 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
103 new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>");
104 new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>");
105 new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>");
106 new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>");
107 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
108} 42}
109 43
110/* 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
111 * savebed. We do some error checking - its possible that the 45 * savebed.
112 * savebed map may no longer exist, so we make sure the player
113 * goes someplace.
114 */ 46 */
115void 47void
116enter_player_savebed (object *op) 48enter_player_savebed (object *op)
117{ 49{
118 object *tmp = object::create (); 50 op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y);
119 EXIT_PATH (tmp) = op->contr->savebed_map;
120 EXIT_X (tmp) = op->contr->bed_x;
121 EXIT_Y (tmp) = op->contr->bed_y;
122 op->enter_exit (tmp);
123 tmp->destroy ();
124} 51}
125 52
126/* 53/*
127 * 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
128 * 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
129 * 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
130 * whatever reason. If default map coordinates are to be used, then 57 * whatever reason. If default map coordinates are to be used, then
131 * the function that calls this should figure them out. 58 * the function that calls this should figure them out.
132 */ 59 */
133void 60bool
134object::enter_map (maptile *newmap, int x, int y) 61object::enter_map (maptile *newmap, int x, int y)
135{ 62{
136 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) 63 if (destroyed () || !newmap || !newmap->linkable ())
137 return; 64 return false;
138 65
139 if (out_of_map (newmap, x, y)) 66 if (out_of_map (newmap, x, y))
140 { 67 {
141 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);
142 x = newmap->enter_x; 69 x = newmap->enter_x;
… …
144 if (out_of_map (newmap, x, y)) 71 if (out_of_map (newmap, x, y))
145 { 72 {
146 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",
147 &newmap->path, x, y, newmap->width, newmap->height); 74 &newmap->path, x, y, newmap->width, newmap->height);
148 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); 75 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
149 return; 76 return false;
150 } 77 }
151 } 78 }
152 79
153 if (contr && map != newmap && map) 80 if (contr && map != newmap && map)
154 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 81 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
155 return; 82 return false;
156 83
157 /* If it is a player login, he has yet to be inserted anyplace. 84 // remove, so stupid blocked does not trigger a failure
158 * otherwise, we need to deal with removing the player here.
159 */
160 remove (); 85 remove ();
161 86
162 /* try to find a spot for the player */ 87 /* try to find a spot for the player */
163 if (ob_blocked (this, newmap, x, y)) 88 if (blocked (newmap, x, y))
164 { /* First choice blocked */ 89 { /* First choice blocked */
165 /* 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.
166 * 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,
167 * 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
168 * if other spaces around are available. 93 * if other spaces around are available.
169 * 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
170 * 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.
171 */ 96 */
172 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);
173 98
174 if (i == -1) 99 if (i < 0)
175 { 100 {
176 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); 101 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
177 if (i == -1) 102 if (i < 0)
178 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); 103 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
179 } 104 }
180 105
181 if (i != -1) 106 if (i >= 0)
107 {
108 maptile *m = newmap;
109 sint16 nx = x + freearr_x[i];
110 sint16 ny = y + freearr_y[i];
111
112 if (xy_normalise (m, nx, ny))
182 { 113 {
183 x += freearr_x[i]; 114 newmap = m;
184 y += freearr_y[i]; 115 x = nx;
116 y = ny;
117 }
185 } 118 }
186 else 119 else
187 /* not much we can do in this case. */ 120 /* not much we can do in this case. */
188 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); 121 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);
189 } 122 }
190 123
191 if (contr && map != newmap) 124 if (contr && map != newmap)
192 { 125 {
193 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) 126 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
194 return; 127 return false;
195 128
196 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) 129 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
197 return; 130 return false;
198 } 131 }
199 132
200 this->x = x;
201 this->y = y;
202 map = newmap;
203
204 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
205
206 enemy = NULL; 133 enemy = 0;
207 134
135 newmap->activate (); // workaround for activate activating everyhing on the map, includign the palyer on the {link} map
136 //newmap->insert (this, x, y);
137 newmap->insert (this, x, y, 0, INS_NO_AUTO_EXIT);
138 prefetch_surrounding_maps ();
139
140 if (map == newmap) // see if we actually arrived there - insert might trigger a teleport
141 {
208 if (contr) 142 if (contr)
209 { 143 {
210 contr->maplevel = newmap->path; 144 contr->maplevel = newmap->path;
211 contr->count = 0; 145 contr->count = 0;
212 }
213 146
214 /* Update any golems */ 147 /* Update any golems */
215 if (type == PLAYER && contr->ranges[range_golem]) 148 if (object *golem = contr->golem)
216 {
217 int i = find_free_spot (contr->ranges[range_golem], newmap,
218 x, y, 1, SIZEOFFREE);
219
220 contr->ranges[range_golem]->remove ();
221
222 if (i == -1)
223 {
224 remove_friendly_object (contr->ranges[range_golem]);
225 contr->ranges[range_golem]->destroy ();
226 contr->ranges[range_golem] = 0;
227 }
228 else
229 {
230 for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more)
231 { 149 {
232 tmp->x = x + freearr_x[i] + (tmp->arch ? 0 : tmp->arch->clone.x); 150 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
233 tmp->y = y + freearr_y[i] + (tmp->arch ? 0 : tmp->arch->clone.y); 151
234 tmp->map = newmap; 152 if (i < 0)
153 golem->drop_and_destroy ();
154 else
155 {
156 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
157 golem->direction = find_dir_2 (golem->x - x, golem->y - y);
158 }
235 } 159 }
236
237 insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0);
238 contr->ranges[range_golem]->direction =
239 find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y);
240 } 160 }
241 }
242 161
243 /* since the players map is already loaded, we don't need to worry 162 /* since the players map is already loaded, we don't need to worry
244 * about pending objects. 163 * about pending objects.
245 */ 164 */
246 remove_all_pets (newmap); 165 move_all_pets ();
166
167 return true;
168 }
169
170 return false;
247} 171}
248 172
249/* process_players1 and process_players2 do all the player related stuff. 173/* process_players1 and process_players2 do all the player related stuff.
250 * I moved it out of process events and process_map. This was to some 174 * I moved it out of process events and process_map. This was to some
251 * extent for debugging as well as to get a better idea of the time used 175 * extent for debugging as well as to get a better idea of the time used
… …
254 * is needed after the players have been updated. 178 * is needed after the players have been updated.
255 */ 179 */
256static void 180static void
257process_players1 () 181process_players1 ()
258{ 182{
259 int flag;
260
261 /* Basically, we keep looping until all the players have done their actions. */ 183 /* Basically, we keep looping until all the players have done their actions. */
262 for (flag = 1; flag != 0;) 184 for (int flag = 1; flag != 0;)
263 { 185 {
264 flag = 0; 186 flag = 0;
265 for_all_players (pl) 187 for_all_players (pl)
266 { 188 {
267 pl->refcnt_chk (); 189 pl->refcnt_chk ();
268 190
269 if (!pl->ob || !pl->ns || !pl->ob->active ()) 191 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
270 continue; 192 continue;
271 193
272 if (pl->ob->speed_left > 0)
273 if (handle_newcs_player (pl->ob)) 194 if (handle_newcs_player (pl->ob))
274 flag = 1; 195 flag = 1;
275
276 /* If the player is not actively playing, don't make a
277 * backup save - nothing to save anyway. Plus, the
278 * map may not longer be valid. This can happen when the
279 * player quits - they exist for purposes of tracking on the map,
280 * but don't actually reside on any actual map.
281 */
282 if (QUERY_FLAG (pl->ob, FLAG_REMOVED))
283 continue;
284
285#ifdef AUTOSAVE
286 /* check for ST_PLAYING state so that we don't try to save off when
287 * the player is logging in.
288 */
289 if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->ns->state == ST_PLAYING)
290 {
291 pl->ob->contr->save ();
292 pl->last_save_tick = pticks;
293 } 196 }
294#endif 197 }
295 } /* end of for loop for all the players */
296 } /* for flag */
297 198
298 for_all_players (pl) 199 for_all_players (pl)
299 { 200 {
201 object *ob = pl->ob;
202
203 // process_objects destroys the speed_left value
204 pl->speed_left_save = ob->speed_left;
205
300 if (!pl->ob || !pl->ns || !pl->ob->active ()) 206 if (expect_false (!ob || !pl->ns || !ob->active))
301 continue; 207 continue;
302 208
303 if (settings.casting_time)
304 {
305 if (pl->ob->casting_time > 0)
306 {
307 pl->ob->casting_time--;
308 pl->ob->start_holding = 1;
309 }
310
311 /* set spell_state so we can update the range in stats field */
312 if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1))
313 pl->ob->start_holding = 0;
314 }
315
316 do_some_living (pl->ob); 209 do_some_living (ob);
317 } 210 }
318} 211}
319 212
320static void 213static void
321process_players2 () 214process_players2 ()
322{ 215{
323 /* Then check if any players should use weapon-speed instead of speed */ 216 /* Then check if any players should use weapon-speed instead of speed */
324 for_all_players (pl) 217 for_all_players (pl)
325 { 218 {
326 /* The code that did weapon_sp handling here was out of place - 219 // restore speed_left value saved by process_players1
327 * this isn't called until after the player has finished there
328 * actions, and is thus out of place. All we do here is bounds
329 * checking.
330 */
331 if (pl->has_hit)
332 {
333 if (pl->ob->speed_left > pl->weapon_sp)
334 pl->ob->speed_left = pl->weapon_sp;
335
336 /* This needs to be here - if the player is running, we need to
337 * clear this each tick, but new commands are not being received
338 * so execute_newserver_command() is never called
339 */
340 pl->has_hit = 0;
341 }
342 else if (pl->ob->speed_left > pl->ob->speed)
343 pl->ob->speed_left = pl->ob->speed; 220 pl->ob->speed_left = pl->speed_left_save;
344 }
345}
346 221
347void 222 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
223 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
224 }
225}
226
227static void
348process_events () 228process_events ()
349{ 229{
350 object *op;
351
352 static object_ptr marker_;
353
354 if (!marker_)
355 marker_ = object::create ();
356
357 object *marker = marker_;
358
359 process_players1 (); 230 process_players1 ();
360 231
361 marker->active_next = active_objects; 232 for_all_actives (op)
362
363 if (marker->active_next)
364 marker->active_next->active_prev = marker;
365
366 marker->active_prev = 0;
367 active_objects = marker;
368
369 while (marker->active_next)
370 { 233 {
371 op = marker->active_next; 234 // try to prefetch some stuff we expect to need
235 // obviously, it should be grouped into the same cacheline.
236 // preliminary results indicate that this gives halves the speed
237 // used for the inner loop
238 if (_i < actives.size ()) // HACK, rely on _i :/
239 {
240 object *next = actives [_i + 1];
372 241
373 /* Move marker forward - swap op and marker */ 242 prefetch (&next->flag , 0, 1);
374 op->active_prev = marker->active_prev; 243 prefetch (&next->speed , 0, 1);
375 244 prefetch (&next->anim_speed, 0, 1);
376 if (op->active_prev) 245 prefetch (&next->contr , 0, 1);
377 op->active_prev->active_next = op; 246 }
378 else
379 active_objects = op;
380
381 marker->active_next = op->active_next;
382
383 if (marker->active_next)
384 marker->active_next->active_prev = marker;
385
386 marker->active_prev = op;
387 op->active_next = marker;
388 247
389 /* Now process op */ 248 /* Now process op */
390 if (QUERY_FLAG (op, FLAG_FREED)) 249 if (expect_false (op->flag [FLAG_FREED]))
391 { 250 {
392 LOG (llevError, "BUG: process_events(): Free object on list\n"); 251 LOG (llevError, "BUG: process_events(): Free object on list (%s)\n", op->debug_desc ());
393 op->set_speed (0); 252 op->set_speed (0);
394 continue; 253 continue;
395 } 254 }
396 255
397 /* I've seen occasional crashes due to this - the object is removed,
398 * and thus the map it points to (last map it was on) may be bogus
399 * The real bug is to try to find out the cause of this - someone
400 * is probably calling remove_ob without either an insert_ob or
401 * free_object afterwards, leaving an object dangling. But I'd
402 * rather log this and continue on instead of crashing.
403 * Don't remove players - when a player quits, the object is in
404 * sort of a limbo, of removed, but something we want to keep
405 * around.
406 */
407 if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY)
408 {
409 LOG (llevError, "BUG: process_events(): Removed object on list\n");
410 char *dump = dump_object (op);
411 LOG (llevError, dump);
412 free (dump);
413 op->destroy ();
414 continue;
415 }
416
417 if (!op->has_active_speed ()) 256 if (expect_false (!op->has_active_speed ()))
418 { 257 {
419 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " 258 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
420 "but is on active list\n", op->debug_desc (), op->speed); 259 "but is on active list\n", op->debug_desc (), op->speed);
421 op->set_speed (0); 260 op->set_speed (0);
422 continue; 261 continue;
423 } 262 }
424 263
425 if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) 264 if (expect_false (op->flag [FLAG_REMOVED]))
426 { 265 {
427 LOG (llevError, "BUG: process_events(): Object without map or " 266 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
428 "inventory is on active list: %s (%d)\n", &op->name, op->count); 267 op->debug_desc ());
429 op->set_speed (0); 268 op->set_speed (0);
430 continue; 269 continue;
431 } 270 }
432 271
433 /* Animate the object. Bug or feature that anim_speed 272 /* Animate the object. Bug or feature that anim_speed
434 * is based on ticks, and not the creatures speed? 273 * is based on ticks, and not the creatures speed?
435 */ 274 */
436 if (op->anim_speed && op->last_anim >= op->anim_speed) 275 if (op->anim_speed && op->last_anim >= op->anim_speed)
437 { 276 {
438 if ((op->type == PLAYER))
439 animate_object (op, op->facing);
440 else
441 animate_object (op, op->direction); 277 animate_object (op, op->contr ? op->facing : op->direction);
442
443 op->last_anim = 1; 278 op->last_anim = 1;
444 } 279 }
445 else 280 else
446 op->last_anim++; 281 ++op->last_anim;
447 282
448 if (op->speed_left > 0) 283 if (expect_false (op->speed_left > 0.f))
449 {
450#if 0
451 /* I've seen occasional crashes in move_symptom() with it
452 * crashing because op is removed - add some debugging to
453 * track if it is removed at this point.
454 * This unfortunately is a bit too verbose it seems - not sure
455 * why - I think what happens is a map is freed or something and
456 * some objects get 'lost' - removed never to be reclaimed.
457 * removed objects generally shouldn't exist.
458 */
459 if (QUERY_FLAG (op, FLAG_REMOVED))
460 { 284 {
461 LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null");
462 }
463#endif
464 --op->speed_left; 285 --op->speed_left;
465 process_object (op); 286 process_object (op);
466
467 if (op->destroyed ())
468 continue;
469 } 287 }
470 288
471 if (settings.casting_time == TRUE && op->casting_time > 0) 289 // this will destroy the speed_left value for players, but
472 op->casting_time--; 290 // process_players1 and ..2 save/restore the real value,
473 291 // so we can avoid a costly test here.
474 if (op->speed_left <= 0) 292 op->speed_left = min (op->speed, op->speed_left + op->speed);
475 op->speed_left += FABS (op->speed);
476 } 293 }
477
478 /* Remove marker object from active list */
479 if (marker->active_prev != NULL)
480 marker->active_prev->active_next = NULL;
481 else
482 active_objects = NULL;
483 294
484 process_players2 (); 295 process_players2 ();
485} 296}
486 297
487/* clean up everything before exiting */ 298/* clean up everything before exiting */
488void 299void
489emergency_save () 300emergency_save ()
490{ 301{
491 LOG (llevDebug, "emergency save begin.\n"); 302 LOG (llevInfo, "emergency_save: enter\n");
492 303
493 LOG (llevDebug, "saving players.\n"); 304 LOG (llevInfo, "emergency_save: saving book archive\n");
494 for_all_players (pl)
495 if (pl->enable_save && pl->ob && pl->ns)
496 {
497 pl->save (true);
498 pl->enable_save = true;
499 }
500
501// for_all_players (pl)
502// if (pl->ob)
503// pl->ob->remove ();
504
505 LOG (llevDebug, "saving maps.\n");
506 maptile::emergency_save ();
507
508 LOG (llevDebug, "saving book archive.\n");
509 write_book_archive (); 305 write_book_archive ();
510 306
307 cfperl_emergency_save ();
308
511 LOG (llevDebug, "emergency save done.\n"); 309 LOG (llevInfo, "emergency_save: leave\n");
512} 310}
513 311
514// send all clients some informational text 312// send all clients some informational text
515static void 313static void
516cleanup_inform (const char *cause, bool make_core) 314cleanup_inform (const char *cause, bool make_core)
517{ 315{
316 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
317
518 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "The server will now shutdown.\n"); 318 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
519 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "Cause for this shtudown: %s\n", cause); 319 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
520 320
521 if (make_core) 321 if (make_core)
522 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "This is considered a crash.\n"); 322 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
523 else 323 else
524 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "This is considered to be a clean shutdown.\n"); 324 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");
525 325
526 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "%s\n", CLEANUP_MESSAGE); 326 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
527 327
528 flush_sockets (); 328 client::flush_sockets ();
529} 329}
530 330
531/* clean up everything before exiting */ 331/* clean up everything before exiting */
532void 332void
533cleanup (const char *cause, bool make_core) 333cleanup (const char *cause, bool make_core)
534{ 334{
335 if (make_core)
336 fork_abort (cause);
337
535 LOG (llevError, "cleanup cause: %s\n", cause); 338 LOG (make_core ? llevError : llevInfo, "cleanup cause: %s\n", cause);
536 339
537 if (!make_core) 340 if (!make_core)
538 cleanup_inform (cause, make_core); 341 cleanup_inform (cause, make_core);
539 342
540 LOG (llevDebug, "cleanup begin.\n"); 343 LOG (llevDebug, "cleanup begin.\n");
… …
550 LOG (llevDebug, "running cleanup handlers.\n"); 353 LOG (llevDebug, "running cleanup handlers.\n");
551 INVOKE_GLOBAL (CLEANUP); 354 INVOKE_GLOBAL (CLEANUP);
552 355
553 LOG (llevDebug, "cleanup done.\n"); 356 LOG (llevDebug, "cleanup done.\n");
554 357
358 log_cleanup ();
359
555 if (make_core) 360 if (make_core)
556 {
557 cleanup_inform (cause, make_core); 361 cleanup_inform (cause, make_core);
558 abort ();
559 }
560 else 362 else
561 _exit (0);
562}
563
564int
565forbid_play (void)
566{
567#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
568 char buf[MAX_BUF], day[MAX_BUF];
569 FILE *fp;
570 time_t clock;
571 struct tm *tm;
572 int i, start, stop, forbit = 0, comp;
573
574 clock = time (NULL);
575 tm = (struct tm *) localtime (&clock);
576
577 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
578 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
579 return 0;
580
581 while (fgets (buf, MAX_BUF, fp))
582 {
583 if (buf[0] == '#')
584 continue;
585
586 if (!strncmp (buf, "msg", 3))
587 {
588 if (forbit)
589 while (fgets (buf, MAX_BUF, fp)) /* print message */
590 fputs (buf, logfile);
591 break;
592 }
593 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
594 {
595 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
596 continue;
597 }
598
599 for (i = 0; i < 7; i++)
600 {
601 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
602 forbit = 1;
603 }
604 } 363 {
364 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
365 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
366 client::flush_sockets ();
367 }
605 368
606 close_and_delete (fp, comp); 369 cfperl_cleanup (make_core);
607 370 _exit (make_core);
608 return forbit;
609#else
610 return 0;
611#endif
612} 371}
613 372
614/* 373/*
615 * do_specials() is a collection of functions to call from time to time. 374 * do_specials() is a collection of functions to call from time to time.
616 * Modified 2000-1-14 MSW to use the global pticks count to determine how 375 * Modified 2000-1-14 MSW to use the global server_tick count to determine how
617 * often to do things. This will allow us to spred them out more often. 376 * often to do things. This will allow us to spred them out more often.
618 * I use prime numbers for the factor count - in that way, it is less likely 377 * I use prime numbers for the factor count - in that way, it is less likely
619 * these actions will fall on the same tick (compared to say using 500/2500/15000 378 * these actions will fall on the same tick (compared to say using 500/2500/15000
620 * which would mean on that 15,000 tick count a whole bunch of stuff gets 379 * which would mean on that 15,000 tick count a whole bunch of stuff gets
621 * done). Of course, there can still be times where multiple specials are 380 * done). Of course, there can still be times where multiple specials are
622 * done on the same tick, but that will happen very infrequently 381 * done on the same tick, but that will happen very infrequently
623 * 382 *
624 * I also think this code makes it easier to see how often we really are 383 * I also think this code makes it easier to see how often we really are
625 * doing the various things. 384 * doing the various things.
626 */ 385 */
386static void
387do_specials ()
388{
389 shstr::gc ();
390 archetype::gc ();
627 391
628extern unsigned long todtick; 392 if (expect_false (!(server_tick % TICKS_PER_HOUR)))
393 maptile::adjust_daylight ();
394
395 if (expect_false (!(server_tick % 2503)))
396 fix_weight (); /* Hack to fix weightproblems caused by bugs */
397
398 if (expect_false (!(server_tick % 5003)))
399 write_book_archive ();
400
401 if (expect_false (!(server_tick % 5009)))
402 clean_friendly_list ();
403
404 if (expect_false (!(server_tick % 5011)))
405 obsolete_parties ();
406
407 if (expect_false (!(server_tick % 12503)))
408 fix_luck ();
409}
629 410
630void 411void
631do_specials (void) 412one_tick ()
632{
633 if (!(pticks % PTICKS_PER_CLOCK))
634 tick_the_clock ();
635
636 if (!(pticks % 7))
637 shstr::gc ();
638
639 if (!(pticks % 2503))
640 fix_weight (); /* Hack to fix weightproblems caused by bugs */
641
642 if (!(pticks % 5003))
643 write_book_archive ();
644
645 if (!(pticks % 5009))
646 clean_friendly_list ();
647
648 if (!(pticks % 5011))
649 obsolete_parties ();
650
651 if (!(pticks % 12503))
652 fix_luck ();
653}
654
655void
656server_tick ()
657{ 413{
658 // first do the user visible stuff 414 // first do the user visible stuff
659 doeric_server ();
660 INVOKE_GLOBAL (CLOCK); 415 INVOKE_GLOBAL (CLOCK);
661 process_events (); /* "do" something with objects with speed */ 416 process_events (); // "do" something with objects with speed
662 flush_sockets (); 417 client::clock (); // draw client maps etc.
663 418
664 // then do some bookkeeping, should not really be here 419 // then do some bookkeeping, should not really be here
665 do_specials (); /* Routines called from time to time. */ 420 do_specials (); /* Routines called from time to time. */
666 attachable::check_mortals (); 421 attachable::check_mortals ();
667 422
668 ++pticks; 423 // now that we aggressively reuse id's, this is very unlikely to happen...
424 if (object::object_count >= RESTART_COUNT)
425 cleanup ("running out of protocol ID values - need full restart");
669} 426}
670 427
428// normal main
671int 429int
672main (int argc, char **argv) 430main (int argc, char **argv)
673{ 431{
674 settings.argc = argc; 432 settings.argc = argc;
675 settings.argv = argv; 433 settings.argv = argv;
676 434
435 rndm.seed (time (0));
436 g_thread_init (0); // for the slice allocator only
437
438 // temporary(?) testing hack
439 if (argc >= 2 && !strcmp (argv [1], "--noise"))
440 {
441 void noise_test ();
442 noise_test ();
443 exit (0);
444 }
445
446#if 0
447 // code sometiems used for timing benchmarks
448 random_number_generator<freeciv_random_generator> rng;
449 rng.seed(0);
450 for (int i = 0; i < 10; ++i)
451 printf ("%08x\n", rng.get_u32());
452 for (int i = 0; i < 1000000; ++i)
453 volatile int r = rng.get_u32 ();
454 cstamp s = stamp ();
455 for (int i = 0; i < 1000000; ++i)
456 volatile int r = rng.next ();
457 printf ("c %d\n", (int)measure (s));
458 exit (0);
459#endif
460
677 init (argc, argv); 461 init (argc, argv);
678
679 initPlugins ();
680 462
681 for (;;) 463 for (;;)
682 cfperl_main (); 464 cfperl_main ();
683} 465}
684 466

Diff Legend

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