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.63 by root, Sat Dec 30 16:56:16 2006 UTC vs.
Revision 1.170 by root, Sat Apr 23 06:35:55 2011 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,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 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>
38 31
39#include <../random_maps/random_map.h> 32#include <glib.h>
40#include <../random_maps/rproto.h> 33
34#include <rmg.h>
35#include <rproto.h>
41#include "path.h" 36#include "path.h"
42
43static char days[7][4] = {
44 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
45};
46 37
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.
117 * savebed map may no longer exist, so we make sure the player
118 * goes someplace.
119 */ 46 */
120void 47void
121enter_player_savebed (object *op) 48enter_player_savebed (object *op)
122{ 49{
123 object *tmp = object::create (); 50 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} 51}
130 52
131/* 53/*
132 * 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
133 * 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
134 * 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
135 * whatever reason. If default map coordinates are to be used, then 57 * whatever reason. If default map coordinates are to be used, then
136 * the function that calls this should figure them out. 58 * the function that calls this should figure them out.
137 */ 59 */
138void 60bool
139object::enter_map (maptile *newmap, int x, int y) 61object::enter_map (maptile *newmap, int x, int y)
140{ 62{
141 if (!newmap->load ()) 63 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
142 return; 64 return false;
143 65
144 if (out_of_map (newmap, x, y)) 66 if (out_of_map (newmap, x, y))
145 { 67 {
146 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);
147 x = newmap->enter_x; 69 x = newmap->enter_x;
… …
149 if (out_of_map (newmap, x, y)) 71 if (out_of_map (newmap, x, y))
150 { 72 {
151 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",
152 &newmap->path, x, y, newmap->width, newmap->height); 74 &newmap->path, x, y, newmap->width, newmap->height);
153 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); 75 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
154 return; 76 return false;
155 } 77 }
156 } 78 }
79
80 if (contr && map != newmap && map)
81 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
82 return false;
83
84 // remove, so stupid blocked does not trigger a failure
85 remove ();
157 86
158 /* try to find a spot for the player */ 87 /* try to find a spot for the player */
159 if (ob_blocked (this, newmap, x, y)) 88 if (blocked (newmap, x, y))
160 { /* First choice blocked */ 89 { /* First choice blocked */
161 /* 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.
162 * 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,
163 * 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
164 * if other spaces around are available. 93 * if other spaces around are available.
165 * 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
166 * 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.
167 */ 96 */
168 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);
169 98
170 if (i == -1) 99 if (i < 0)
171 { 100 {
172 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); 101 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
173 if (i == -1) 102 if (i < 0)
174 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); 103 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
175 } 104 }
176 105
177 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))
178 { 113 {
179 x += freearr_x[i]; 114 newmap = m;
180 y += freearr_y[i]; 115 x = nx;
116 y = ny;
117 }
181 } 118 }
182 else 119 else
183 /* not much we can do in this case. */ 120 /* not much we can do in this case. */
184 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);
185 } 122 }
186 123
187 if (map) 124 if (contr && map != newmap)
188 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 125 {
189 return;
190
191 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)))
192 return; 127 return false;
193 128
194 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)))
195 return; 130 return false;
131 }
196 132
197 /* If it is a player login, he has yet to be inserted anyplace.
198 * otherwise, we need to deal with removing the player here.
199 */
200 remove ();
201
202 this->x = x;
203 this->y = y;
204 map = newmap;
205
206 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
207
208 newmap->timeout = 0;
209 enemy = NULL; 133 enemy = 0;
210 134
135 //newmap->insert (this, x, y);
136 newmap->insert (this, x, y, 0, INS_NO_AUTO_EXIT);
137
138 if (map == newmap) // see if we actually arrived there - insert might trigger a teleport
139 {
211 if (contr) 140 if (contr)
212 { 141 {
213 strcpy (contr->maplevel, newmap->path); 142 contr->maplevel = newmap->path;
214 contr->count = 0; 143 contr->count = 0;
215 }
216 144
217 /* Update any golems */ 145 /* Update any golems */
218 if (type == PLAYER && contr->ranges[range_golem]) 146 if (object *golem = contr->golem)
219 {
220 int i = find_free_spot (contr->ranges[range_golem], newmap,
221 x, y, 1, SIZEOFFREE);
222
223 contr->ranges[range_golem]->remove ();
224
225 if (i == -1)
226 {
227 remove_friendly_object (contr->ranges[range_golem]);
228 contr->ranges[range_golem]->destroy ();
229 contr->ranges[range_golem] = 0;
230 }
231 else
232 {
233 for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more)
234 { 147 {
235 tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.x); 148 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
236 tmp->y = y + freearr_y[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.y); 149
237 tmp->map = newmap; 150 if (i < 0)
151 golem->drop_and_destroy ();
152 else
153 {
154 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
155 golem->direction = find_dir_2 (golem->x - x, golem->y - y);
156 }
238 } 157 }
239
240 insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0);
241 contr->ranges[range_golem]->direction =
242 find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y);
243 } 158 }
244 }
245 159
246 direction = 0;
247
248 /* since the players map is already loaded, we don't need to worry 160 /* since the players map is already loaded, we don't need to worry
249 * about pending objects. 161 * about pending objects.
250 */ 162 */
251 remove_all_pets (newmap); 163 move_all_pets ();
252}
253 164
254/* clean_path takes a path and replaces all / with _ 165 return true;
255 * We do a strcpy so that we do not change the original string. 166 }
256 */
257char *
258clean_path (const char *file)
259{
260 static char newpath[MAX_BUF], *cp;
261 assign (newpath, file);
262 167
263 for (cp = newpath; *cp != '\0'; cp++) 168 return false;
264 if (*cp == '/')
265 *cp = '_';
266
267 return newpath;
268}
269
270/* unclean_path takes a path and replaces all _ with /
271 * This basically undoes clean path.
272 * We do a strcpy so that we do not change the original string.
273 * We are smart enough to start after the last / in case we
274 * are getting passed a string that points to a unique map
275 * path.
276 */
277char *
278unclean_path (const char *src)
279{
280 static char newpath[MAX_BUF], *cp;
281
282 cp = strrchr (src, '/');
283 assign (newpath, cp ? cp + 1 : src);
284
285 for (cp = newpath; *cp != '\0'; cp++)
286 if (*cp == '_')
287 *cp = '/';
288
289 return newpath;
290} 169}
291 170
292/* process_players1 and process_players2 do all the player related stuff. 171/* process_players1 and process_players2 do all the player related stuff.
293 * I moved it out of process events and process_map. This was to some 172 * I moved it out of process events and process_map. This was to some
294 * extent for debugging as well as to get a better idea of the time used 173 * extent for debugging as well as to get a better idea of the time used
… …
297 * is needed after the players have been updated. 176 * is needed after the players have been updated.
298 */ 177 */
299static void 178static void
300process_players1 () 179process_players1 ()
301{ 180{
302 int flag;
303
304 /* Basically, we keep looping until all the players have done their actions. */ 181 /* Basically, we keep looping until all the players have done their actions. */
305 for (flag = 1; flag != 0;) 182 for (int flag = 1; flag != 0;)
306 { 183 {
307 flag = 0; 184 flag = 0;
308 for_all_players (pl) 185 for_all_players (pl)
309 { 186 {
310 pl->refcnt_chk (); 187 pl->refcnt_chk ();
311 188
312 if (!pl->ob || !pl->ns) 189 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
313 continue; 190 continue;
314 191
315 if (pl->ob->speed_left > 0)
316 if (handle_newcs_player (pl->ob)) 192 if (handle_newcs_player (pl->ob))
317 flag = 1; 193 flag = 1;
318
319 /* If the player is not actively playing, don't make a
320 * backup save - nothing to save anyway. Plus, the
321 * map may not longer be valid. This can happen when the
322 * player quits - they exist for purposes of tracking on the map,
323 * but don't actually reside on any actual map.
324 */
325 if (QUERY_FLAG (pl->ob, FLAG_REMOVED))
326 continue;
327
328#ifdef AUTOSAVE
329 /* check for ST_PLAYING state so that we don't try to save off when
330 * the player is logging in.
331 */
332 if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->ns->state == ST_PLAYING)
333 {
334 pl->ob->contr->save ();
335 pl->last_save_tick = pticks;
336 } 194 }
337#endif 195 }
338 } /* end of for loop for all the players */
339 } /* for flag */
340 196
341 for_all_players (pl) 197 for_all_players (pl)
342 { 198 {
343 if (!pl->ob || !pl->ns) 199 object *ob = pl->ob;
200
201 // process_objects destroys the speed_left value
202 pl->speed_left_save = ob->speed_left;
203
204 if (expect_false (!ob || !pl->ns || !ob->active))
344 continue; 205 continue;
345 206
346 if (settings.casting_time)
347 {
348 if (pl->ob->casting_time > 0)
349 {
350 pl->ob->casting_time--;
351 pl->ob->start_holding = 1;
352 }
353
354 /* set spell_state so we can update the range in stats field */
355 if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1))
356 pl->ob->start_holding = 0;
357 }
358
359 do_some_living (pl->ob); 207 do_some_living (ob);
360 } 208 }
361} 209}
362 210
363static void 211static void
364process_players2 () 212process_players2 ()
365{ 213{
366 /* Then check if any players should use weapon-speed instead of speed */ 214 /* Then check if any players should use weapon-speed instead of speed */
367 for_all_players (pl) 215 for_all_players (pl)
368 { 216 {
369 /* The code that did weapon_sp handling here was out of place - 217 // restore speed_left value saved by process_players1
370 * this isn't called until after the player has finished there
371 * actions, and is thus out of place. All we do here is bounds
372 * checking.
373 */
374 if (pl->has_hit)
375 {
376 if (pl->ob->speed_left > pl->weapon_sp)
377 pl->ob->speed_left = pl->weapon_sp;
378
379 /* This needs to be here - if the player is running, we need to
380 * clear this each tick, but new commands are not being received
381 * so execute_newserver_command() is never called
382 */
383 pl->has_hit = 0;
384 }
385 else if (pl->ob->speed_left > pl->ob->speed)
386 pl->ob->speed_left = pl->ob->speed; 218 pl->ob->speed_left = pl->speed_left_save;
387 }
388}
389 219
390void 220 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
221 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
222 }
223}
224
225static void
391process_events () 226process_events ()
392{ 227{
393 object *op;
394
395 static object_ptr marker_;
396
397 if (!marker_)
398 marker_ = object::create ();
399
400 object *marker = marker_;
401
402 process_players1 (); 228 process_players1 ();
403 229
404 marker->active_next = active_objects; 230 for_all_actives (op)
405
406 if (marker->active_next)
407 marker->active_next->active_prev = marker;
408
409 marker->active_prev = 0;
410 active_objects = marker;
411
412 while (marker->active_next)
413 { 231 {
414 op = marker->active_next; 232 // try to prefetch some stuff we expect to need
233 // obviously, it should be grouped into the same cacheline.
234 // preliminary results indicate that this gives halves the speed
235 // used for the inner loop
236 if (_i < actives.size ()) // HACK, rely on _i :/
237 {
238 object *next = actives [_i + 1];
415 239
416 /* Move marker forward - swap op and marker */ 240 prefetch (&next->flag , 0, 1);
417 op->active_prev = marker->active_prev; 241 prefetch (&next->speed , 0, 1);
418 242 prefetch (&next->anim_speed, 0, 1);
419 if (op->active_prev) 243 prefetch (&next->contr , 0, 1);
420 op->active_prev->active_next = op; 244 }
421 else
422 active_objects = op;
423
424 marker->active_next = op->active_next;
425
426 if (marker->active_next)
427 marker->active_next->active_prev = marker;
428
429 marker->active_prev = op;
430 op->active_next = marker;
431 245
432 /* Now process op */ 246 /* Now process op */
433 if (QUERY_FLAG (op, FLAG_FREED)) 247 if (expect_false (op->flag [FLAG_FREED]))
434 { 248 {
435 LOG (llevError, "BUG: process_events(): Free object on list\n"); 249 LOG (llevError, "BUG: process_events(): Free object on list (%s)\n", op->debug_desc ());
436 op->set_speed (0); 250 op->set_speed (0);
437 continue; 251 continue;
438 } 252 }
439 253
440 /* I've seen occasional crashes due to this - the object is removed, 254 if (expect_false (!op->has_active_speed ()))
441 * and thus the map it points to (last map it was on) may be bogus
442 * The real bug is to try to find out the cause of this - someone
443 * is probably calling remove_ob without either an insert_ob or
444 * free_object afterwards, leaving an object dangling. But I'd
445 * rather log this and continue on instead of crashing.
446 * Don't remove players - when a player quits, the object is in
447 * sort of a limbo, of removed, but something we want to keep
448 * around.
449 */
450 if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY)
451 {
452 LOG (llevError, "BUG: process_events(): Removed object on list\n");
453 char *dump = dump_object (op);
454 LOG (llevError, dump);
455 free (dump);
456 op->destroy ();
457 continue;
458 } 255 {
459
460 if (!op->speed)
461 {
462 LOG (llevError, "BUG: process_events(): Object %s has no speed, " 256 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
463 "but is on active list\n", &op->arch->name); 257 "but is on active list\n", op->debug_desc (), op->speed);
464 op->set_speed (0); 258 op->set_speed (0);
465 continue; 259 continue;
466 } 260 }
467 261
468 if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) 262 if (expect_false (op->flag [FLAG_REMOVED]))
469 { 263 {
470 LOG (llevError, "BUG: process_events(): Object without map or " 264 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
471 "inventory is on active list: %s (%d)\n", &op->name, op->count); 265 op->debug_desc ());
472 op->set_speed (0); 266 op->set_speed (0);
473 continue; 267 continue;
474 } 268 }
475 269
476 /* Animate the object. Bug or feature that anim_speed 270 /* Animate the object. Bug or feature that anim_speed
477 * is based on ticks, and not the creatures speed? 271 * is based on ticks, and not the creatures speed?
478 */ 272 */
479 if (op->anim_speed && op->last_anim >= op->anim_speed) 273 if (op->anim_speed && op->last_anim >= op->anim_speed)
480 { 274 {
481 if ((op->type == PLAYER))
482 animate_object (op, op->facing);
483 else
484 animate_object (op, op->direction); 275 animate_object (op, op->contr ? op->facing : op->direction);
485
486 op->last_anim = 1; 276 op->last_anim = 1;
487 } 277 }
488 else 278 else
489 op->last_anim++; 279 ++op->last_anim;
490 280
491 if (op->speed_left > 0) 281 if (expect_false (op->speed_left > 0.f))
492 {
493#if 0
494 /* I've seen occasional crashes in move_symptom() with it
495 * crashing because op is removed - add some debugging to
496 * track if it is removed at this point.
497 * This unfortunately is a bit too verbose it seems - not sure
498 * why - I think what happens is a map is freed or something and
499 * some objects get 'lost' - removed never to be reclaimed.
500 * removed objects generally shouldn't exist.
501 */
502 if (QUERY_FLAG (op, FLAG_REMOVED))
503 { 282 {
504 LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null");
505 }
506#endif
507 --op->speed_left; 283 --op->speed_left;
508 process_object (op); 284 process_object (op);
509
510 if (op->destroyed ())
511 continue;
512 } 285 }
513 286
514 if (settings.casting_time == TRUE && op->casting_time > 0) 287 // this will destroy the speed_left value for players, but
515 op->casting_time--; 288 // process_players1 and ..2 save/restore the real value,
516 289 // so we can avoid a costly test here.
517 if (op->speed_left <= 0) 290 op->speed_left = min (op->speed, op->speed_left + op->speed);
518 op->speed_left += FABS (op->speed);
519 } 291 }
520
521 /* Remove marker object from active list */
522 if (marker->active_prev != NULL)
523 marker->active_prev->active_next = NULL;
524 else
525 active_objects = NULL;
526 292
527 process_players2 (); 293 process_players2 ();
528} 294}
529 295
530/* clean up everything before exiting */ 296/* clean up everything before exiting */
531void 297void
532emergency_save () 298emergency_save ()
533{ 299{
534 LOG (llevDebug, "emergency save begin.\n"); 300 LOG (llevInfo, "emergency_save: enter\n");
535 301
536 LOG (llevDebug, "saving players.\n"); 302 LOG (llevInfo, "emergency_save: saving book archive\n");
537 for_all_players (pl)
538 pl->save (1);
539
540// for_all_players (pl)
541// if (pl->ob)
542// pl->ob->remove ();
543
544 LOG (llevDebug, "saving maps.\n");
545 maptile::emergency_save ();
546
547 LOG (llevDebug, "saving book archive.\n");
548 write_book_archive (); 303 write_book_archive ();
549 304
305 cfperl_emergency_save ();
306
550 LOG (llevDebug, "emergency save done.\n"); 307 LOG (llevInfo, "emergency_save: leave\n");
308}
309
310// send all clients some informational text
311static void
312cleanup_inform (const char *cause, bool make_core)
313{
314 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
315
316 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
317 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
318
319 if (make_core)
320 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
321 else
322 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");
323
324 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
325
326 client::flush_sockets ();
551} 327}
552 328
553/* clean up everything before exiting */ 329/* clean up everything before exiting */
554void 330void
555cleanup (bool make_core) 331cleanup (const char *cause, bool make_core)
556{ 332{
333 if (make_core)
334 fork_abort (cause);
335
336 LOG (make_core ? llevError : llevInfo, "cleanup cause: %s\n", cause);
337
338 if (!make_core)
339 cleanup_inform (cause, make_core);
340
557 LOG (llevDebug, "cleanup begin.\n"); 341 LOG (llevDebug, "cleanup begin.\n");
558 342
343 if (init_done && !in_cleanup)
344 {
559 in_cleanup = true; 345 in_cleanup = true;
560
561 if (init_done)
562 emergency_save (); 346 emergency_save ();
347 }
348 else
349 in_cleanup = true;
563 350
564 LOG (llevDebug, "running cleanup handlers.\n"); 351 LOG (llevDebug, "running cleanup handlers.\n");
565 INVOKE_GLOBAL (CLEANUP); 352 INVOKE_GLOBAL (CLEANUP);
566 353
567 LOG (llevDebug, "cleanup done.\n"); 354 LOG (llevDebug, "cleanup done.\n");
568 355
356 log_cleanup ();
357
569 if (make_core) 358 if (make_core)
570 abort (); 359 cleanup_inform (cause, make_core);
571 else 360 else
572 _exit (0);
573}
574
575void
576leave (player *pl, int draw_exit)
577{
578 if (pl)
579 {
580 if (pl->ob->type != DEAD_OBJECT)
581 {
582 /* If a hidden dm dropped connection do not create
583 * inconsistencies by showing that they have left the game
584 */
585 if (!(QUERY_FLAG (pl->ob, FLAG_WIZ) && pl->ob->contr->hidden)
586 && draw_exit)
587 {
588 if (pl->ob->map)
589 {
590 INVOKE_PLAYER (LOGOUT, pl);
591 LOG (llevInfo, "LOGOUT: Player named %s from ip %s\n", &pl->ob->name, pl->ns->host);
592 }
593
594 char buf[MAX_BUF];
595
596 sprintf (buf, "%s left the game.", &pl->ob->name);
597 new_draw_info (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, 0, buf);
598 }
599
600 pl->ob->remove ();
601 pl->ob->type = DEAD_OBJECT; /* To avoid problems with inventory window */
602 }
603
604 /* We do this so that the socket handling routine can do the final
605 * cleanup. We also leave that loop to actually handle the freeing
606 * of the data.
607 */
608 if (pl->ns)
609 pl->ns->destroy ();
610
611 } 361 {
612} 362 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
613 363 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
614int 364 client::flush_sockets ();
615forbid_play (void)
616{
617#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
618 char buf[MAX_BUF], day[MAX_BUF];
619 FILE *fp;
620 time_t clock;
621 struct tm *tm;
622 int i, start, stop, forbit = 0, comp;
623
624 clock = time (NULL);
625 tm = (struct tm *) localtime (&clock);
626
627 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
628 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
629 return 0;
630
631 while (fgets (buf, MAX_BUF, fp))
632 { 365 }
633 if (buf[0] == '#')
634 continue;
635 if (!strncmp (buf, "msg", 3))
636 {
637 if (forbit)
638 while (fgets (buf, MAX_BUF, fp)) /* print message */
639 fputs (buf, logfile);
640 break;
641 366
642 } 367 cfperl_cleanup (make_core);
643 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) 368 _exit (make_core);
644 {
645 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
646 continue;
647 }
648
649 for (i = 0; i < 7; i++)
650 {
651 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
652 forbit = 1;
653 }
654 }
655
656 close_and_delete (fp, comp);
657
658 return forbit;
659#else
660 return 0;
661#endif
662} 369}
663 370
664/* 371/*
665 * do_specials() is a collection of functions to call from time to time. 372 * do_specials() is a collection of functions to call from time to time.
666 * Modified 2000-1-14 MSW to use the global pticks count to determine how 373 * Modified 2000-1-14 MSW to use the global pticks count to determine how
667 * often to do things. This will allow us to spred them out more often. 374 * often to do things. This will allow us to spred them out more often.
668 * I use prime numbers for the factor count - in that way, it is less likely 375 * I use prime numbers for the factor count - in that way, it is less likely
669 * these actions will fall on the same tick (compared to say using 500/2500/15000 376 * these actions will fall on the same tick (compared to say using 500/2500/15000
670 * which would mean on that 15,000 tick count a whole bunch of stuff gets 377 * which would mean on that 15,000 tick count a whole bunch of stuff gets
… …
672 * done on the same tick, but that will happen very infrequently 379 * done on the same tick, but that will happen very infrequently
673 * 380 *
674 * I also think this code makes it easier to see how often we really are 381 * I also think this code makes it easier to see how often we really are
675 * doing the various things. 382 * doing the various things.
676 */ 383 */
677 384static void
678extern unsigned long todtick;
679
680void
681do_specials (void) 385do_specials ()
682{ 386{
683 if (!(pticks % PTICKS_PER_CLOCK))
684 tick_the_clock ();
685
686 if (!(pticks % 7))
687 shstr::gc (); 387 shstr::gc ();
388 archetype::gc ();
688 389
390 if (expect_false (!(pticks % TICKS_PER_HOUR)))
391 maptile::adjust_daylight ();
392
689 if (!(pticks % 2503)) 393 if (expect_false (!(pticks % 2503)))
690 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 394 fix_weight (); /* Hack to fix weightproblems caused by bugs */
691 395
692 if (!(pticks % 5003)) 396 if (expect_false (!(pticks % 5003)))
693 write_book_archive (); 397 write_book_archive ();
694 398
695 if (!(pticks % 5009)) 399 if (expect_false (!(pticks % 5009)))
696 clean_friendly_list (); 400 clean_friendly_list ();
697 401
698 if (!(pticks % 5011)) 402 if (expect_false (!(pticks % 5011)))
699 obsolete_parties (); 403 obsolete_parties ();
700 404
701 if (!(pticks % 12503)) 405 if (expect_false (!(pticks % 12503)))
702 fix_luck (); 406 fix_luck ();
703} 407}
704 408
705void 409void
706server_tick () 410server_tick ()
707{ 411{
708 // first do the user visible stuff 412 // first do the user visible stuff
709 doeric_server ();
710 INVOKE_GLOBAL (CLOCK); 413 INVOKE_GLOBAL (CLOCK);
711 process_events (); /* "do" something with objects with speed */ 414 process_events (); // "do" something with objects with speed
712 flush_sockets (); 415 client::clock (); // draw client maps etc.
713 416
714 // then do some bookkeeping, should not really be here 417 // then do some bookkeeping, should not really be here
715 do_specials (); /* Routines called from time to time. */ 418 do_specials (); /* Routines called from time to time. */
716 attachable::check_mortals (); 419 attachable::check_mortals ();
717 420
718 ++pticks; 421 ++pticks;
719}
720 422
423 if (object::object_count >= RESTART_COUNT)
424 cleanup ("running out of protocol ID values - need full restart");
425}
426
427// normal main
721int 428int
722main (int argc, char **argv) 429main (int argc, char **argv)
723{ 430{
724 settings.argc = argc; 431 settings.argc = argc;
725 settings.argv = argv; 432 settings.argv = argv;
726 433
434 rndm.seed (time (0));
435 g_thread_init (0); // for the slice allocator only
436
437 // temporary(?) testing hack
438 if (argc >= 2 && !strcmp (argv [1], "--noise"))
439 {
440 void noise_test ();
441 noise_test ();
442 exit (0);
443 }
444
445#if 0
446 // code sometiems used for timing benchmarks
447 random_number_generator<freeciv_random_generator> rng;
448 rng.seed(0);
449 for (int i = 0; i < 10; ++i)
450 printf ("%08x\n", rng.get_u32());
451 for (int i = 0; i < 1000000; ++i)
452 volatile int r = rng.get_u32 ();
453 cstamp s = stamp ();
454 for (int i = 0; i < 1000000; ++i)
455 volatile int r = rng.next ();
456 printf ("c %d\n", (int)measure (s));
457 exit (0);
458#endif
459
727 init (argc, argv); 460 init (argc, argv);
728
729 initPlugins ();
730 461
731 for (;;) 462 for (;;)
732 cfperl_main (); 463 cfperl_main ();
733
734 // unreached
735 cleanup ();
736
737 return 0;
738} 464}
465

Diff Legend

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