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.180 by root, Sat Nov 17 23:40:04 2018 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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
5 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 6 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 7 * Copyright (©) 1992 Frank Tore Johansen
7 8 *
8 This program is free software; you can redistribute it and/or modify 9 * 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 10 * 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 11 * Free Software Foundation, either version 3 of the License, or (at your
11 (at your option) any later version. 12 * option) any later version.
12 13 *
13 This program is distributed in the hope that it will be useful, 14 * This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 17 * GNU General Public License for more details.
17 18 *
18 You should have received a copy of the GNU General Public License 19 * 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 20 * and the GNU General Public License along with this program. If not, see
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 21 * <http://www.gnu.org/licenses/>.
21 22 *
22 The authors can be reached via e-mail at <crossfire@schmorp.de> 23 * The authors can be reached via e-mail to <support@deliantra.net>
23*/ 24 */
24 25
25#include <global.h> 26#include <global.h>
26#include <object.h> 27#include <object.h>
27#include <tod.h> 28#include <tod.h>
28 29
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> 30#include <sproto.h>
38#include <time.h> 31#include <time.h>
39 32
40#include <../random_maps/random_map.h> 33#include <glib.h>
41#include <../random_maps/rproto.h> 34
35#include <rmg.h>
36#include <rproto.h>
42#include "path.h" 37#include "path.h"
43
44static char days[7][4] = {
45 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
46};
47 38
48void 39void
49version (object *op) 40version (object *op)
50{ 41{
51 if (op)
52 clear_win_info (op);
53
54 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); 42 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} 43}
109 44
110/* This is a basic little function to put the player back to his 45/* This is a basic little function to put the player back to his
111 * savebed. We do some error checking - its possible that the 46 * savebed.
112 * savebed map may no longer exist, so we make sure the player
113 * goes someplace.
114 */ 47 */
115void 48void
116enter_player_savebed (object *op) 49enter_player_savebed (object *op)
117{ 50{
118 object *tmp = object::create (); 51 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} 52}
125 53
126/* 54/*
127 * enter_map(): Moves the player and pets from current map (if any) to 55 * 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 56 * 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 57 * 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 58 * whatever reason. If default map coordinates are to be used, then
131 * the function that calls this should figure them out. 59 * the function that calls this should figure them out.
132 */ 60 */
133void 61bool
134object::enter_map (maptile *newmap, int x, int y) 62object::enter_map (maptile *newmap, int x, int y)
135{ 63{
136 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) 64 if (destroyed () || !newmap || !newmap->linkable ())
137 return; 65 return false;
138 66
139 if (out_of_map (newmap, x, y)) 67 if (out_of_map (newmap, x, y))
140 { 68 {
141 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); 69 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
142 x = newmap->enter_x; 70 x = newmap->enter_x;
144 if (out_of_map (newmap, x, y)) 72 if (out_of_map (newmap, x, y))
145 { 73 {
146 LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", 74 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); 75 &newmap->path, x, y, newmap->width, newmap->height);
148 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); 76 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
149 return; 77 return false;
150 } 78 }
151 } 79 }
152 80
153 if (contr && map != newmap && map) 81 if (contr && map != newmap && map)
154 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 82 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
155 return; 83 return false;
156 84
157 /* If it is a player login, he has yet to be inserted anyplace. 85 // remove, so stupid blocked does not trigger a failure
158 * otherwise, we need to deal with removing the player here.
159 */
160 remove (); 86 remove ();
161 87
162 /* try to find a spot for the player */ 88 /* try to find a spot for the player */
163 if (ob_blocked (this, newmap, x, y)) 89 if (blocked (newmap, x, y))
164 { /* First choice blocked */ 90 { /* First choice blocked */
165 /* We try to find a spot for the player, starting closest in. 91 /* 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, 92 * 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 93 * So for example, if the north space is free, you would always end up there even
168 * if other spaces around are available. 94 * if other spaces around are available.
169 * Note that for the second and third calls, we could start at a position other 95 * 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. 96 * than one, but then we could end up on the other side of walls and so forth.
171 */ 97 */
172 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); 98 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1);
173 99
174 if (i == -1) 100 if (i < 0)
175 { 101 {
176 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); 102 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
177 if (i == -1) 103 if (i < 0)
178 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); 104 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
179 } 105 }
180 106
181 if (i != -1) 107 if (i >= 0)
108 {
109 maptile *m = newmap;
110 sint16 nx = x + DIRX (i);
111 sint16 ny = y + DIRY (i);
112
113 if (xy_normalise (m, nx, ny))
182 { 114 {
183 x += freearr_x[i]; 115 newmap = m;
184 y += freearr_y[i]; 116 x = nx;
117 y = ny;
118 }
185 } 119 }
186 else 120 else
187 /* not much we can do in this case. */ 121 /* 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); 122 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 } 123 }
190 124
191 if (contr && map != newmap) 125 if (contr && map != newmap)
192 { 126 {
193 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) 127 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
194 return; 128 return false;
195 129
196 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) 130 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
197 return; 131 return false;
198 } 132 }
199 133
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; 134 enemy = 0;
207 135
136 newmap->activate (); // workaround for activate activating everyhing on the map, includign the palyer on the {link} map
137 //newmap->insert (this, x, y);
138 newmap->insert (this, x, y, 0, INS_NO_AUTO_EXIT);
139 prefetch_surrounding_maps ();
140
141 if (map == newmap) // see if we actually arrived there - insert might trigger a teleport
142 {
208 if (contr) 143 if (contr)
209 { 144 {
210 contr->maplevel = newmap->path; 145 contr->maplevel = newmap->path;
211 contr->count = 0; 146 contr->count = 0;
212 }
213 147
214 /* Update any golems */ 148 /* Update any golems */
215 if (type == PLAYER && contr->ranges[range_golem]) 149 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 { 150 {
232 tmp->x = x + freearr_x[i] + (tmp->arch ? 0 : tmp->arch->clone.x); 151 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); 152
234 tmp->map = newmap; 153 if (i < 0)
154 golem->drop_and_destroy ();
155 else
156 {
157 newmap->insert (golem, x + DIRX (i), y + DIRY (i));
158 golem->direction = find_dir_2 (golem->x - x, golem->y - y);
159 }
235 } 160 }
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 } 161 }
241 }
242 162
243 /* since the players map is already loaded, we don't need to worry 163 /* since the players map is already loaded, we don't need to worry
244 * about pending objects. 164 * about pending objects.
245 */ 165 */
246 remove_all_pets (newmap); 166 move_all_pets ();
167
168 return true;
169 }
170
171 return false;
247} 172}
248 173
249/* process_players1 and process_players2 do all the player related stuff. 174/* 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 175 * 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 176 * extent for debugging as well as to get a better idea of the time used
254 * is needed after the players have been updated. 179 * is needed after the players have been updated.
255 */ 180 */
256static void 181static void
257process_players1 () 182process_players1 ()
258{ 183{
259 int flag;
260
261 /* Basically, we keep looping until all the players have done their actions. */ 184 /* Basically, we keep looping until all the players have done their actions. */
262 for (flag = 1; flag != 0;) 185 for (int flag = 1; flag != 0;)
263 { 186 {
264 flag = 0; 187 flag = 0;
265 for_all_players (pl) 188 for_all_players (pl)
266 { 189 {
267 pl->refcnt_chk (); 190 pl->refcnt_chk ();
268 191
269 if (!pl->ob || !pl->ns || !pl->ob->active ()) 192 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
270 continue; 193 continue;
271 194
272 if (pl->ob->speed_left > 0)
273 if (handle_newcs_player (pl->ob)) 195 if (handle_newcs_player (pl->ob))
274 flag = 1; 196 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 } 197 }
294#endif 198 }
295 } /* end of for loop for all the players */
296 } /* for flag */
297 199
298 for_all_players (pl) 200 for_all_players (pl)
299 { 201 {
202 object *ob = pl->ob;
203
204 // process_objects destroys the speed_left value
205 pl->speed_left_save = ob->speed_left;
206
300 if (!pl->ob || !pl->ns || !pl->ob->active ()) 207 if (expect_false (!ob || !pl->ns || !ob->active))
301 continue; 208 continue;
302 209
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); 210 do_some_living (ob);
317 } 211 }
318} 212}
319 213
320static void 214static void
321process_players2 () 215process_players2 ()
322{ 216{
323 /* Then check if any players should use weapon-speed instead of speed */ 217 /* Then check if any players should use weapon-speed instead of speed */
324 for_all_players (pl) 218 for_all_players (pl)
325 { 219 {
326 /* The code that did weapon_sp handling here was out of place - 220 // 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; 221 pl->ob->speed_left = pl->speed_left_save;
344 }
345}
346 222
347void 223 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
224 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
225 }
226}
227
228static void
348process_events () 229process_events ()
349{ 230{
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 (); 231 process_players1 ();
360 232
361 marker->active_next = active_objects; 233 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 { 234 {
371 op = marker->active_next; 235 // try to prefetch some stuff we expect to need
236 // obviously, it should be grouped into the same cacheline.
237 // preliminary results indicate that this gives halves the speed
238 // used for the inner loop
239 if (_i < actives.size ()) // HACK, rely on _i :/
240 {
241 object *next = actives [_i + 1];
372 242
373 /* Move marker forward - swap op and marker */ 243 ecb_prefetch (&next->flag , 0, 1);
374 op->active_prev = marker->active_prev; 244 ecb_prefetch (&next->speed , 0, 1);
375 245 ecb_prefetch (&next->anim_speed, 0, 1);
376 if (op->active_prev) 246 ecb_prefetch (&next->contr , 0, 1);
377 op->active_prev->active_next = op; 247 }
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 248
389 /* Now process op */ 249 /* Now process op */
390 if (QUERY_FLAG (op, FLAG_FREED)) 250 if (expect_false (op->flag [FLAG_FREED]))
391 { 251 {
392 LOG (llevError, "BUG: process_events(): Free object on list\n"); 252 LOG (llevError, "BUG: process_events(): Free object on list (%s)\n", op->debug_desc ());
393 op->set_speed (0); 253 op->set_speed (0);
394 continue; 254 continue;
395 } 255 }
396 256
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 ()) 257 if (expect_false (!op->has_active_speed ()))
418 { 258 {
419 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " 259 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
420 "but is on active list\n", op->debug_desc (), op->speed); 260 "but is on active list\n", op->debug_desc (), op->speed);
421 op->set_speed (0); 261 op->set_speed (0);
422 continue; 262 continue;
423 } 263 }
424 264
425 if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) 265 if (expect_false (op->flag [FLAG_REMOVED]))
426 { 266 {
427 LOG (llevError, "BUG: process_events(): Object without map or " 267 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); 268 op->debug_desc ());
429 op->set_speed (0); 269 op->set_speed (0);
430 continue; 270 continue;
431 } 271 }
432 272
433 /* Animate the object. Bug or feature that anim_speed 273 /* Animate the object. Bug or feature that anim_speed
434 * is based on ticks, and not the creatures speed? 274 * is based on ticks, and not the creatures speed?
435 */ 275 */
436 if (op->anim_speed && op->last_anim >= op->anim_speed) 276 if (op->anim_speed && op->last_anim >= op->anim_speed)
437 { 277 {
438 if ((op->type == PLAYER))
439 animate_object (op, op->facing);
440 else
441 animate_object (op, op->direction); 278 animate_object (op, op->contr ? op->facing : op->direction);
442
443 op->last_anim = 1; 279 op->last_anim = 1;
444 } 280 }
445 else 281 else
446 op->last_anim++; 282 ++op->last_anim;
447 283
448 if (op->speed_left > 0) 284 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 { 285 {
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; 286 --op->speed_left;
465 process_object (op); 287 process_object (op);
466
467 if (op->destroyed ())
468 continue;
469 } 288 }
470 289
471 if (settings.casting_time == TRUE && op->casting_time > 0) 290 // this will destroy the speed_left value for players, but
472 op->casting_time--; 291 // process_players1 and ..2 save/restore the real value,
473 292 // so we can avoid a costly test here.
474 if (op->speed_left <= 0) 293 op->speed_left = min (op->speed, op->speed_left + op->speed);
475 op->speed_left += FABS (op->speed);
476 } 294 }
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 295
484 process_players2 (); 296 process_players2 ();
485} 297}
486 298
487/* clean up everything before exiting */ 299/* clean up everything before exiting */
488void 300void
489emergency_save () 301emergency_save ()
490{ 302{
491 LOG (llevDebug, "emergency save begin.\n"); 303 LOG (llevInfo, "emergency_save: enter\n");
492 304
493 LOG (llevDebug, "saving players.\n"); 305 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 (); 306 write_book_archive ();
510 307
308 cfperl_emergency_save ();
309
511 LOG (llevDebug, "emergency save done.\n"); 310 LOG (llevInfo, "emergency_save: leave\n");
512} 311}
513 312
514// send all clients some informational text 313// send all clients some informational text
515static void 314static void
516cleanup_inform (const char *cause, bool make_core) 315cleanup_inform (const char *cause, bool make_core)
517{ 316{
317 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
318
518 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "The server will now shutdown.\n"); 319 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); 320 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
520 321
521 if (make_core) 322 if (make_core)
522 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "This is considered a crash.\n"); 323 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
523 else 324 else
524 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "This is considered to be a clean shutdown.\n"); 325 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 326
526 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "%s\n", CLEANUP_MESSAGE); 327 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
527 328
528 flush_sockets (); 329 client::flush_sockets ();
529} 330}
530 331
531/* clean up everything before exiting */ 332/* clean up everything before exiting */
532void 333void
533cleanup (const char *cause, bool make_core) 334cleanup (const char *cause, bool make_core)
534{ 335{
336 if (make_core)
337 fork_abort (cause);
338
535 LOG (llevError, "cleanup cause: %s\n", cause); 339 LOG (make_core ? llevError : llevInfo, "cleanup cause: %s\n", cause);
536 340
537 if (!make_core) 341 if (!make_core)
538 cleanup_inform (cause, make_core); 342 cleanup_inform (cause, make_core);
539 343
540 LOG (llevDebug, "cleanup begin.\n"); 344 LOG (llevDebug, "cleanup begin.\n");
550 LOG (llevDebug, "running cleanup handlers.\n"); 354 LOG (llevDebug, "running cleanup handlers.\n");
551 INVOKE_GLOBAL (CLEANUP); 355 INVOKE_GLOBAL (CLEANUP);
552 356
553 LOG (llevDebug, "cleanup done.\n"); 357 LOG (llevDebug, "cleanup done.\n");
554 358
359 log_cleanup ();
360
555 if (make_core) 361 if (make_core)
556 {
557 cleanup_inform (cause, make_core); 362 cleanup_inform (cause, make_core);
558 abort ();
559 }
560 else 363 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 } 364 {
365 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
366 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
367 client::flush_sockets ();
368 }
605 369
606 close_and_delete (fp, comp); 370 cfperl_cleanup (make_core);
607 371 _exit (make_core);
608 return forbit;
609#else
610 return 0;
611#endif
612} 372}
613 373
614/* 374/*
615 * do_specials() is a collection of functions to call from time to time. 375 * 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 376 * 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. 377 * 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 378 * 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 379 * 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 380 * 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 381 * done). Of course, there can still be times where multiple specials are
622 * done on the same tick, but that will happen very infrequently 382 * done on the same tick, but that will happen very infrequently
623 * 383 *
624 * I also think this code makes it easier to see how often we really are 384 * I also think this code makes it easier to see how often we really are
625 * doing the various things. 385 * doing the various things.
626 */ 386 */
387static void
388do_specials ()
389{
390 shstr::gc ();
391 archetype::gc ();
627 392
628extern unsigned long todtick; 393 if (expect_false (!(server_tick % TICKS_PER_HOUR)))
394 maptile::adjust_daylight ();
395
396 if (expect_false (!(server_tick % 2503)))
397 fix_weight (); /* Hack to fix weightproblems caused by bugs */
398
399 if (expect_false (!(server_tick % 5003)))
400 write_book_archive ();
401
402 if (expect_false (!(server_tick % 5009)))
403 clean_friendly_list ();
404
405 if (expect_false (!(server_tick % 5011)))
406 obsolete_parties ();
407
408 if (expect_false (!(server_tick % 12503)))
409 fix_luck ();
410}
629 411
630void 412void
631do_specials (void) 413one_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{ 414{
658 // first do the user visible stuff 415 // first do the user visible stuff
659 doeric_server ();
660 INVOKE_GLOBAL (CLOCK); 416 INVOKE_GLOBAL (CLOCK);
661 process_events (); /* "do" something with objects with speed */ 417 process_events (); // "do" something with objects with speed
662 flush_sockets (); 418 client::clock (); // draw client maps etc.
663 419
664 // then do some bookkeeping, should not really be here 420 // then do some bookkeeping, should not really be here
665 do_specials (); /* Routines called from time to time. */ 421 do_specials (); /* Routines called from time to time. */
666 attachable::check_mortals (); 422 attachable::check_mortals ();
667 423
668 ++pticks; 424 // now that we aggressively reuse id's, this is very unlikely to happen...
425 if (object::object_count >= RESTART_COUNT)
426 cleanup ("running out of protocol ID values - need full restart");
669} 427}
670 428
429// normal main
671int 430int
672main (int argc, char **argv) 431main (int argc, char **argv)
673{ 432{
674 settings.argc = argc; 433 settings.argc = argc;
675 settings.argv = argv; 434 settings.argv = argv;
676 435
436 rndm.seed (time (0));
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