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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines