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.103 by root, Sun May 13 15:13:57 2007 UTC vs.
Revision 1.179 by root, Sat Nov 17 23:33:18 2018 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25#include <global.h> 25#include <global.h>
26#include <object.h> 26#include <object.h>
27#include <tod.h> 27#include <tod.h>
28 28
29#include <sproto.h> 29#include <sproto.h>
30#include <time.h> 30#include <time.h>
31 31
32#include <../random_maps/random_map.h> 32#include <glib.h>
33#include <../random_maps/rproto.h> 33
34#include <rmg.h>
35#include <rproto.h>
34#include "path.h" 36#include "path.h"
35
36static char days[7][4] = {
37 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
38};
39 37
40void 38void
41version (object *op) 39version (object *op)
42{ 40{
43 if (op)
44 clear_win_info (op);
45
46 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); 41 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION);
47
48 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
49 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
50 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
51 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>");
52 new_draw_info (NDI_UNIQUE, 0, op, "");
53 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:");
54 new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>");
55 new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>");
56 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>");
57 new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>");
58 new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>");
59 new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>");
60 new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>");
61 new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>");
62 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>");
63 new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>");
64 new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>");
65 new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>");
66 new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>");
67 new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>");
68 new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>");
69 new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>");
70 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>");
71 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>");
72 new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>");
73 new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>");
74 new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>");
75 new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>");
76 new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>");
77 new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>");
78 new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>");
79 new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>");
80 new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>");
81 new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>");
82 new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>");
83 new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>");
84 new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>");
85 new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>");
86 new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>");
87 new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>");
88 new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>");
89 new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>");
90 new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>");
91 new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>");
92 new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>");
93 new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n");
94 new_draw_info (NDI_UNIQUE, 0, op, "");
95 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
96 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
97 new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>");
98 new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>");
99 new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>");
100 new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>");
101 new_draw_info (NDI_UNIQUE, 0, op, "");
102 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
103} 42}
104 43
105/* This is a basic little function to put the player back to his 44/* This is a basic little function to put the player back to his
106 * savebed. We do some error checking - its possible that the 45 * savebed.
107 * savebed map may no longer exist, so we make sure the player
108 * goes someplace.
109 */ 46 */
110void 47void
111enter_player_savebed (object *op) 48enter_player_savebed (object *op)
112{ 49{
113 object *tmp = object::create (); 50 op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y);
114 EXIT_PATH (tmp) = op->contr->savebed_map;
115 EXIT_X (tmp) = op->contr->bed_x;
116 EXIT_Y (tmp) = op->contr->bed_y;
117 op->enter_exit (tmp);
118 tmp->destroy ();
119} 51}
120 52
121/* 53/*
122 * enter_map(): Moves the player and pets from current map (if any) to 54 * enter_map(): Moves the player and pets from current map (if any) to
123 * new map. map, x, y must be set. map is the map we are moving the 55 * new map. map, x, y must be set. map is the map we are moving the
124 * player to - it could be the map he just came from if the load failed for 56 * player to - it could be the map he just came from if the load failed for
125 * whatever reason. If default map coordinates are to be used, then 57 * whatever reason. If default map coordinates are to be used, then
126 * the function that calls this should figure them out. 58 * the function that calls this should figure them out.
127 */ 59 */
128void 60bool
129object::enter_map (maptile *newmap, int x, int y) 61object::enter_map (maptile *newmap, int x, int y)
130{ 62{
131 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) 63 if (destroyed () || !newmap || !newmap->linkable ())
132 return; 64 return false;
133 65
134 if (out_of_map (newmap, x, y)) 66 if (out_of_map (newmap, x, y))
135 { 67 {
136 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); 68 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
137 x = newmap->enter_x; 69 x = newmap->enter_x;
… …
139 if (out_of_map (newmap, x, y)) 71 if (out_of_map (newmap, x, y))
140 { 72 {
141 LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", 73 LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n",
142 &newmap->path, x, y, newmap->width, newmap->height); 74 &newmap->path, x, y, newmap->width, newmap->height);
143 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); 75 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
144 return; 76 return false;
145 } 77 }
146 } 78 }
147 79
148 if (contr && map != newmap && map) 80 if (contr && map != newmap && map)
149 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 81 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
150 return; 82 return false;
151 83
152 // remove, so stupid ob_locked does not trigger a failure 84 // remove, so stupid blocked does not trigger a failure
153 remove (); 85 remove ();
154 86
155 /* try to find a spot for the player */ 87 /* try to find a spot for the player */
156 if (ob_blocked (this, newmap, x, y)) 88 if (blocked (newmap, x, y))
157 { /* First choice blocked */ 89 { /* First choice blocked */
158 /* We try to find a spot for the player, starting closest in. 90 /* We try to find a spot for the player, starting closest in.
159 * We could use find_first_free_spot, but that doesn't randomize it at all, 91 * We could use find_first_free_spot, but that doesn't randomize it at all,
160 * So for example, if the north space is free, you would always end up there even 92 * So for example, if the north space is free, you would always end up there even
161 * if other spaces around are available. 93 * if other spaces around are available.
162 * Note that for the second and third calls, we could start at a position other 94 * Note that for the second and third calls, we could start at a position other
163 * than one, but then we could end up on the other side of walls and so forth. 95 * than one, but then we could end up on the other side of walls and so forth.
164 */ 96 */
165 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); 97 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1);
166 98
167 if (i == -1) 99 if (i < 0)
168 { 100 {
169 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); 101 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
170 if (i == -1) 102 if (i < 0)
171 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); 103 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
172 } 104 }
173 105
174 if (i != -1) 106 if (i >= 0)
107 {
108 maptile *m = newmap;
109 sint16 nx = x + DIRX (i);
110 sint16 ny = y + DIRY (i);
111
112 if (xy_normalise (m, nx, ny))
175 { 113 {
176 x += freearr_x[i]; 114 newmap = m;
177 y += freearr_y[i]; 115 x = nx;
116 y = ny;
117 }
178 } 118 }
179 else 119 else
180 /* not much we can do in this case. */ 120 /* not much we can do in this case. */
181 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);
182 } 122 }
183 123
184 if (contr && map != newmap) 124 if (contr && map != newmap)
185 { 125 {
186 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)))
187 return; 127 return false;
188 128
189 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)))
190 return; 130 return false;
191 } 131 }
192
193 this->x = x;
194 this->y = y;
195 map = newmap;
196
197 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
198 132
199 enemy = 0; 133 enemy = 0;
200 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 {
201 if (contr) 142 if (contr)
202 { 143 {
203 contr->maplevel = newmap->path; 144 contr->maplevel = newmap->path;
204 contr->count = 0; 145 contr->count = 0;
205 }
206 146
207 /* Update any golems */ 147 /* Update any golems */
208 if (type == PLAYER)
209 if (object *golem = contr->golem) 148 if (object *golem = contr->golem)
210 { 149 {
211 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); 150 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
212 151
213 if (i < 0) 152 if (i < 0)
214 golem->destroy (); 153 golem->drop_and_destroy ();
215 else 154 else
216 { 155 {
217 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); 156 newmap->insert (golem, x + DIRX (i), y + DIRY (i));
218 golem->direction = find_dir_2 (x - golem->x, y - golem->y); 157 golem->direction = find_dir_2 (golem->x - x, golem->y - y);
158 }
219 } 159 }
220 } 160 }
221 161
222 /* 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
223 * about pending objects. 163 * about pending objects.
224 */ 164 */
225 remove_all_pets (newmap); 165 move_all_pets ();
166
167 return true;
168 }
169
170 return false;
226} 171}
227 172
228/* process_players1 and process_players2 do all the player related stuff. 173/* process_players1 and process_players2 do all the player related stuff.
229 * I moved it out of process events and process_map. This was to some 174 * I moved it out of process events and process_map. This was to some
230 * extent for debugging as well as to get a better idea of the time used 175 * extent for debugging as well as to get a better idea of the time used
… …
241 flag = 0; 186 flag = 0;
242 for_all_players (pl) 187 for_all_players (pl)
243 { 188 {
244 pl->refcnt_chk (); 189 pl->refcnt_chk ();
245 190
246 if (!pl->ob || !pl->ns || !pl->ob->active) 191 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
247 continue; 192 continue;
248 193
249 if (pl->ob->speed_left > 0.f && pl->ns)
250 if (handle_newcs_player (pl->ob)) 194 if (handle_newcs_player (pl->ob))
251 flag = 1; 195 flag = 1;
252 196 }
253 /* If the player is not actively playing, don't make a 197 }
254 * backup save - nothing to save anyway. Plus, the
255 * map may not longer be valid. This can happen when the
256 * player quits - they exist for purposes of tracking on the map,
257 * but don't actually reside on any actual map.
258 */
259 if (QUERY_FLAG (pl->ob, FLAG_REMOVED))
260 continue;
261 } /* end of for loop for all the players */
262 } /* for flag */
263 198
264 for_all_players (pl) 199 for_all_players (pl)
265 { 200 {
266 object *ob = pl->ob; 201 object *ob = pl->ob;
267 202
203 // process_objects destroys the speed_left value
204 pl->speed_left_save = ob->speed_left;
205
268 if (!ob || !pl->ns || !ob->active) 206 if (expect_false (!ob || !pl->ns || !ob->active))
269 continue; 207 continue;
270
271 if (settings.casting_time)
272 {
273 if (ob->casting_time > 0.f)
274 {
275 --ob->casting_time;
276 ob->start_holding = 1;
277 }
278
279 /* set spell_state so we can update the range in stats field */
280 if (pl->ob->casting_time == 0.f && pl->ob->start_holding == 1)
281 pl->ob->start_holding = 0;
282 }
283
284 // process_events might steal us one speed slot, so adjust accordingly
285 if (ob->speed_left > 0.f)
286 ++ob->speed_left;
287 208
288 do_some_living (ob); 209 do_some_living (ob);
289 } 210 }
290} 211}
291 212
… …
293process_players2 () 214process_players2 ()
294{ 215{
295 /* 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 */
296 for_all_players (pl) 217 for_all_players (pl)
297 { 218 {
298 if (pl->has_hit) 219 // restore speed_left value saved by process_players1
299 { 220 pl->ob->speed_left = pl->speed_left_save;
300 pl->ob->speed_left = min (pl->weapon_speed (), pl->ob->speed_left + pl->weapon_speed ());
301 221
302 if (pl->ob->speed_left > 0.f) 222 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
303 pl->has_hit = 0;
304 }
305 else
306 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); 223 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
307 } 224 }
308} 225}
309 226
310void 227static void
311process_events () 228process_events ()
312{ 229{
313 process_players1 (); 230 process_players1 ();
314 231
315 for_all_actives (op) 232 for_all_actives (op)
316 { 233 {
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];
241
242 ecb_prefetch (&next->flag , 0, 1);
243 ecb_prefetch (&next->speed , 0, 1);
244 ecb_prefetch (&next->anim_speed, 0, 1);
245 ecb_prefetch (&next->contr , 0, 1);
246 }
247
317 /* Now process op */ 248 /* Now process op */
318 if (QUERY_FLAG (op, FLAG_FREED)) 249 if (expect_false (op->flag [FLAG_FREED]))
319 { 250 {
320 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 ());
321 op->set_speed (0); 252 op->set_speed (0);
322 continue; 253 continue;
323 } 254 }
324 255
325 if (!op->has_active_speed ()) 256 if (expect_false (!op->has_active_speed ()))
326 { 257 {
327 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " 258 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
328 "but is on active list\n", op->debug_desc (), op->speed); 259 "but is on active list\n", op->debug_desc (), op->speed);
329 op->set_speed (0); 260 op->set_speed (0);
330 continue; 261 continue;
331 } 262 }
332 263
333 if (op->flag [FLAG_REMOVED]) 264 if (expect_false (op->flag [FLAG_REMOVED]))
334 { 265 {
335 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", 266 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
336 op->debug_desc ()); 267 op->debug_desc ());
337 op->set_speed (0); 268 op->set_speed (0);
338 continue; 269 continue;
… …
347 op->last_anim = 1; 278 op->last_anim = 1;
348 } 279 }
349 else 280 else
350 ++op->last_anim; 281 ++op->last_anim;
351 282
352 if (op->speed_left > 0.f) 283 if (expect_false (op->speed_left > 0.f))
353 { 284 {
354 --op->speed_left; 285 --op->speed_left;
355 process_object (op); 286 process_object (op);
356
357 if (op->destroyed ())
358 continue;
359 } 287 }
360 288
361 if (settings.casting_time == TRUE && op->casting_time > 0.f) 289 // this will destroy the speed_left value for players, but
362 --op->casting_time; 290 // process_players1 and ..2 save/restore the real value,
363 291 // so we can avoid a costly test here.
364 if (!op->contr)
365 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); 292 op->speed_left = min (op->speed, op->speed_left + op->speed);
366 } 293 }
367 294
368 process_players2 (); 295 process_players2 ();
369} 296}
370 297
371/* clean up everything before exiting */ 298/* clean up everything before exiting */
372void 299void
373emergency_save () 300emergency_save ()
374{ 301{
375 LOG (llevDebug, "emergency save begin.\n"); 302 LOG (llevInfo, "emergency_save: enter\n");
303
304 LOG (llevInfo, "emergency_save: saving book archive\n");
305 write_book_archive ();
376 306
377 cfperl_emergency_save (); 307 cfperl_emergency_save ();
378 308
379 LOG (llevDebug, "saving book archive.\n");
380 write_book_archive ();
381
382 LOG (llevDebug, "emergency save done.\n"); 309 LOG (llevInfo, "emergency_save: leave\n");
383} 310}
384 311
385// send all clients some informational text 312// send all clients some informational text
386static void 313static void
387cleanup_inform (const char *cause, bool make_core) 314cleanup_inform (const char *cause, bool make_core)
388{ 315{
389 int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); 316 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
390 317
391 new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); 318 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
392 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s\n", cause); 319 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
393 320
394 if (make_core) 321 if (make_core)
395 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.\n"); 322 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
396 else 323 else
397 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.\n"); 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.");
398 325
399 new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); 326 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
400 327
401 flush_sockets (); 328 client::flush_sockets ();
402} 329}
403 330
404/* clean up everything before exiting */ 331/* clean up everything before exiting */
405void 332void
406cleanup (const char *cause, bool make_core) 333cleanup (const char *cause, bool make_core)
407{ 334{
408 if (make_core) 335 if (make_core)
409 fork_abort (cause); 336 fork_abort (cause);
410 337
411 LOG (llevError, "cleanup cause: %s\n", cause); 338 LOG (make_core ? llevError : llevInfo, "cleanup cause: %s\n", cause);
412 339
413 if (!make_core) 340 if (!make_core)
414 cleanup_inform (cause, make_core); 341 cleanup_inform (cause, make_core);
415 342
416 LOG (llevDebug, "cleanup begin.\n"); 343 LOG (llevDebug, "cleanup begin.\n");
… …
426 LOG (llevDebug, "running cleanup handlers.\n"); 353 LOG (llevDebug, "running cleanup handlers.\n");
427 INVOKE_GLOBAL (CLEANUP); 354 INVOKE_GLOBAL (CLEANUP);
428 355
429 LOG (llevDebug, "cleanup done.\n"); 356 LOG (llevDebug, "cleanup done.\n");
430 357
358 log_cleanup ();
359
431 if (make_core) 360 if (make_core)
432 {
433 cleanup_inform (cause, make_core); 361 cleanup_inform (cause, make_core);
434 cfperl_cleanup (make_core);
435 _exit (1);
436 }
437 else 362 else
438 { 363 {
439 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.\n"); 364 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
440 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE "\n"); 365 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
441 flush_sockets (); 366 client::flush_sockets ();
367 }
368
442 cfperl_cleanup (make_core); 369 cfperl_cleanup (make_core);
443 _exit (0); 370 _exit (make_core);
444 }
445}
446
447int
448forbid_play (void)
449{
450#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
451 char buf[MAX_BUF], day[MAX_BUF];
452 FILE *fp;
453 time_t clock;
454 struct tm *tm;
455 int i, start, stop, forbit = 0, comp;
456
457 clock = time (NULL);
458 tm = (struct tm *) localtime (&clock);
459
460 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
461 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
462 return 0;
463
464 while (fgets (buf, MAX_BUF, fp))
465 {
466 if (buf[0] == '#')
467 continue;
468
469 if (!strncmp (buf, "msg", 3))
470 {
471 if (forbit)
472 while (fgets (buf, MAX_BUF, fp)) /* print message */
473 fputs (buf, logfile);
474 break;
475 }
476 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
477 {
478 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
479 continue;
480 }
481
482 for (i = 0; i < 7; i++)
483 {
484 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
485 forbit = 1;
486 }
487 }
488
489 close_and_delete (fp, comp);
490
491 return forbit;
492#else
493 return 0;
494#endif
495} 371}
496 372
497/* 373/*
498 * 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.
499 * 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
500 * 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.
501 * 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
502 * 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
503 * 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
504 * 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
505 * done on the same tick, but that will happen very infrequently 381 * done on the same tick, but that will happen very infrequently
506 * 382 *
507 * 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
508 * doing the various things. 384 * doing the various things.
509 */ 385 */
386static void
387do_specials ()
388{
389 shstr::gc ();
390 archetype::gc ();
391
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}
410
510void 411void
511do_specials (void) 412one_tick ()
512{
513 if (!(pticks % TICKS_PER_HOUR))
514 adjust_daylight ();
515
516 if (!(pticks % 7))
517 shstr::gc ();
518
519 if (!(pticks % 2503))
520 fix_weight (); /* Hack to fix weightproblems caused by bugs */
521
522 if (!(pticks % 5003))
523 write_book_archive ();
524
525 if (!(pticks % 5009))
526 clean_friendly_list ();
527
528 if (!(pticks % 5011))
529 obsolete_parties ();
530
531 if (!(pticks % 12503))
532 fix_luck ();
533}
534
535void
536server_tick ()
537{ 413{
538 // first do the user visible stuff 414 // first do the user visible stuff
539 doeric_server ();
540 INVOKE_GLOBAL (CLOCK); 415 INVOKE_GLOBAL (CLOCK);
541 process_events (); /* "do" something with objects with speed */ 416 process_events (); // "do" something with objects with speed
542 flush_sockets (); 417 client::clock (); // draw client maps etc.
543 418
544 // then do some bookkeeping, should not really be here 419 // then do some bookkeeping, should not really be here
545 do_specials (); /* Routines called from time to time. */ 420 do_specials (); /* Routines called from time to time. */
546 attachable::check_mortals (); 421 attachable::check_mortals ();
547 422
548 ++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");
549} 426}
550
551#if 0
552// used fro benchmarking (x86/amd64-specific)
553typedef unsigned long tval;
554typedef unsigned long long stamp64;
555
556extern inline tval
557stamp (void)
558{
559 tval tsc;
560 asm volatile ("rdtsc":"=a" (tsc)::"edx");
561
562 return tsc;
563}
564
565extern inline tval
566measure (tval t)
567{
568 tval tsc;
569 asm volatile ("rdtsc":"=a" (tsc)::"edx");
570
571 if (tsc > t)
572 return tsc - t;
573 else
574 return t - tsc;
575}
576
577int
578main (int argc, char **argv)
579{
580 rand_gen rg(0);
581 tval fastest = 0x7fffffff;
582 for (int loop = 10000; loop--; )
583 {
584 tval s = stamp ();
585 volatile int i = rg.get_int(25);
586 fastest = min (fastest, measure (s));
587 }
588
589 //printf ("fastest %d\n", fastest);
590 for (int i = 0; i < 1024*1024*3; ++i)
591 {
592 char c = rg.get_int (256);
593 write (2, &c, 1);
594 }
595}
596
597#else
598 427
599// normal main 428// normal main
600int 429int
601main (int argc, char **argv) 430main (int argc, char **argv)
602{ 431{
603 settings.argc = argc; 432 settings.argc = argc;
604 settings.argv = argv; 433 settings.argv = argv;
605 434
435 rndm.seed (time (0));
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
606 init (argc, argv); 460 init (argc, argv);
607
608 initPlugins ();
609 461
610 for (;;) 462 for (;;)
611 cfperl_main (); 463 cfperl_main ();
612} 464}
613#endif
614 465

Diff Legend

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