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.111 by root, Sun Jun 24 04:09:29 2007 UTC vs.
Revision 1.174 by root, Tue Jan 3 11:25:36 2012 UTC

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

Diff Legend

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