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 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 <glib.h> |
|
|
33 | |
32 | #include <../random_maps/random_map.h> |
34 | #include <../random_maps/random_map.h> |
33 | #include <../random_maps/rproto.h> |
35 | #include <../random_maps/rproto.h> |
34 | #include "path.h" |
36 | #include "path.h" |
35 | |
37 | |
36 | static char days[7][4] = { |
|
|
37 | "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
|
|
38 | }; |
|
|
39 | |
|
|
40 | void |
38 | void |
41 | version (object *op) |
39 | version (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. We do some error checking - its possible that the |
104 | * savebed map may no longer exist, so we make sure the player |
46 | * savebed map may no longer exist, so we make sure the player |
105 | * goes someplace. |
47 | * goes someplace. |
106 | */ |
48 | */ |
107 | void |
49 | void |
108 | enter_player_savebed (object *op) |
50 | enter_player_savebed (object *op) |
109 | { |
51 | { |
110 | object *tmp = object::create (); |
52 | 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 | } |
53 | } |
117 | |
54 | |
118 | /* |
55 | /* |
119 | * enter_map(): Moves the player and pets from current map (if any) to |
56 | * 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 |
57 | * new map. map, x, y must be set. map is the map we are moving the |
… | |
… | |
123 | * the function that calls this should figure them out. |
60 | * the function that calls this should figure them out. |
124 | */ |
61 | */ |
125 | void |
62 | void |
126 | object::enter_map (maptile *newmap, int x, int y) |
63 | object::enter_map (maptile *newmap, int x, int y) |
127 | { |
64 | { |
128 | if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) |
65 | if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) |
129 | return; |
66 | return; |
130 | |
67 | |
131 | if (out_of_map (newmap, x, y)) |
68 | if (out_of_map (newmap, x, y)) |
132 | { |
69 | { |
133 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
70 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
… | |
… | |
144 | |
81 | |
145 | if (contr && map != newmap && map) |
82 | if (contr && map != newmap && map) |
146 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
83 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
147 | return; |
84 | return; |
148 | |
85 | |
149 | // remove, so stupid ob_locked does not trigger a failure |
86 | // remove, so stupid blocked does not trigger a failure |
150 | remove (); |
87 | remove (); |
151 | |
88 | |
152 | /* try to find a spot for the player */ |
89 | /* try to find a spot for the player */ |
153 | if (ob_blocked (this, newmap, x, y)) |
90 | if (blocked (newmap, x, y)) |
154 | { /* First choice blocked */ |
91 | { /* First choice blocked */ |
155 | /* We try to find a spot for the player, starting closest in. |
92 | /* 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, |
93 | * 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 |
94 | * So for example, if the north space is free, you would always end up there even |
158 | * if other spaces around are available. |
95 | * if other spaces around are available. |
159 | * Note that for the second and third calls, we could start at a position other |
96 | * 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. |
97 | * than one, but then we could end up on the other side of walls and so forth. |
161 | */ |
98 | */ |
162 | int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); |
99 | int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); |
163 | |
100 | |
164 | if (i == -1) |
101 | if (i < 0) |
165 | { |
102 | { |
166 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
103 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
167 | if (i == -1) |
104 | if (i < 0) |
168 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
105 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
169 | } |
106 | } |
170 | |
107 | |
171 | if (i != -1) |
108 | if (i >= 0) |
172 | { |
109 | { |
173 | x += freearr_x[i]; |
110 | x += freearr_x[i]; |
174 | y += freearr_y[i]; |
111 | y += freearr_y[i]; |
175 | } |
112 | } |
176 | else |
113 | else |
… | |
… | |
185 | |
122 | |
186 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
123 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
187 | return; |
124 | return; |
188 | } |
125 | } |
189 | |
126 | |
190 | this->x = x; |
127 | newmap->insert (this, x, y, 0, INS_NO_WALK_ON); |
191 | this->y = y; |
|
|
192 | map = newmap; |
|
|
193 | |
|
|
194 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
|
|
195 | |
128 | |
196 | enemy = 0; |
129 | enemy = 0; |
197 | |
130 | |
198 | if (contr) |
131 | if (contr) |
199 | { |
132 | { |
… | |
… | |
206 | if (object *golem = contr->golem) |
139 | if (object *golem = contr->golem) |
207 | { |
140 | { |
208 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
141 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
209 | |
142 | |
210 | if (i < 0) |
143 | if (i < 0) |
211 | golem->destroy (); |
144 | golem->drop_and_destroy (); |
212 | else |
145 | else |
213 | { |
146 | { |
214 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
147 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
215 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
148 | golem->direction = find_dir_2 (golem->x - x, golem->y - y); |
216 | } |
149 | } |
217 | } |
150 | } |
218 | |
151 | |
219 | /* since the players map is already loaded, we don't need to worry |
152 | /* since the players map is already loaded, we don't need to worry |
220 | * about pending objects. |
153 | * about pending objects. |
… | |
… | |
250 | |
183 | |
251 | for_all_players (pl) |
184 | for_all_players (pl) |
252 | { |
185 | { |
253 | object *ob = pl->ob; |
186 | object *ob = pl->ob; |
254 | |
187 | |
|
|
188 | // process_objects destroys the speed_left value |
|
|
189 | pl->speed_left_save = ob->speed_left; |
|
|
190 | |
255 | if (expect_false (!ob || !pl->ns || !ob->active)) |
191 | if (expect_false (!ob || !pl->ns || !ob->active)) |
256 | continue; |
192 | continue; |
257 | |
193 | |
258 | do_some_living (ob); |
194 | do_some_living (ob); |
259 | } |
195 | } |
… | |
… | |
263 | process_players2 () |
199 | process_players2 () |
264 | { |
200 | { |
265 | /* Then check if any players should use weapon-speed instead of speed */ |
201 | /* Then check if any players should use weapon-speed instead of speed */ |
266 | for_all_players (pl) |
202 | for_all_players (pl) |
267 | { |
203 | { |
|
|
204 | // restore speed_left value saved by process_players1 |
|
|
205 | pl->ob->speed_left = pl->speed_left_save; |
|
|
206 | |
268 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
207 | 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); |
208 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
270 | } |
209 | } |
271 | } |
210 | } |
272 | |
211 | |
273 | void |
212 | static void |
274 | process_events () |
213 | process_events () |
275 | { |
214 | { |
276 | process_players1 (); |
215 | process_players1 (); |
277 | |
216 | |
278 | for_all_actives (op) |
217 | for_all_actives (op) |
279 | { |
218 | { |
|
|
219 | // try to prefetch some stuff we expect to need |
|
|
220 | // obviously, it should be grouped into the same cacheline. |
|
|
221 | // preliminary results indicate that this gives halves the speed |
|
|
222 | // used for the inner loop |
|
|
223 | if (_i < actives.size ()) // HACK, rely on _i :/ |
|
|
224 | { |
|
|
225 | object *next = actives [_i + 1]; |
|
|
226 | |
|
|
227 | prefetch (&next->flag , 0, 1); |
|
|
228 | prefetch (&next->speed , 0, 1); |
|
|
229 | prefetch (&next->anim_speed, 0, 1); |
|
|
230 | prefetch (&next->contr , 0, 1); |
|
|
231 | } |
|
|
232 | |
280 | /* Now process op */ |
233 | /* Now process op */ |
281 | if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
234 | if (expect_false (op->flag [FLAG_FREED])) |
282 | { |
235 | { |
283 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
236 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
284 | op->set_speed (0); |
237 | op->set_speed (0); |
285 | continue; |
238 | continue; |
286 | } |
239 | } |
… | |
… | |
310 | op->last_anim = 1; |
263 | op->last_anim = 1; |
311 | } |
264 | } |
312 | else |
265 | else |
313 | ++op->last_anim; |
266 | ++op->last_anim; |
314 | |
267 | |
315 | if (op->speed_left > 0.f) |
268 | if (expect_false (op->speed_left > 0.f)) |
316 | { |
269 | { |
317 | --op->speed_left; |
270 | --op->speed_left; |
318 | process_object (op); |
271 | process_object (op); |
319 | |
|
|
320 | if (op->destroyed ()) |
|
|
321 | continue; |
|
|
322 | } |
272 | } |
323 | |
273 | |
324 | if (!op->contr) |
274 | // this will destroy the speed_left value for players, but |
|
|
275 | // process_players1 and ..2 save/restore the real value, |
|
|
276 | // so we can avoid a costly test here. |
325 | op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
277 | op->speed_left = min (op->speed, op->speed_left + op->speed); |
326 | } |
278 | } |
327 | |
279 | |
328 | process_players2 (); |
280 | process_players2 (); |
329 | } |
281 | } |
330 | |
282 | |
… | |
… | |
344 | |
296 | |
345 | // send all clients some informational text |
297 | // send all clients some informational text |
346 | static void |
298 | static void |
347 | cleanup_inform (const char *cause, bool make_core) |
299 | cleanup_inform (const char *cause, bool make_core) |
348 | { |
300 | { |
349 | int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
301 | int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
350 | |
302 | |
351 | new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); |
303 | 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\n", cause); |
304 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); |
353 | |
305 | |
354 | if (make_core) |
306 | if (make_core) |
355 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.\n"); |
307 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved."); |
356 | else |
308 | 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.\n"); |
309 | 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 | |
310 | |
359 | new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); |
311 | new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); |
360 | |
312 | |
361 | flush_sockets (); |
313 | client::flush_sockets (); |
362 | } |
314 | } |
363 | |
315 | |
364 | /* clean up everything before exiting */ |
316 | /* clean up everything before exiting */ |
365 | void |
317 | void |
366 | cleanup (const char *cause, bool make_core) |
318 | cleanup (const char *cause, bool make_core) |
… | |
… | |
386 | LOG (llevDebug, "running cleanup handlers.\n"); |
338 | LOG (llevDebug, "running cleanup handlers.\n"); |
387 | INVOKE_GLOBAL (CLEANUP); |
339 | INVOKE_GLOBAL (CLEANUP); |
388 | |
340 | |
389 | LOG (llevDebug, "cleanup done.\n"); |
341 | LOG (llevDebug, "cleanup done.\n"); |
390 | |
342 | |
|
|
343 | log_cleanup (); |
|
|
344 | |
391 | if (make_core) |
345 | if (make_core) |
392 | { |
|
|
393 | cleanup_inform (cause, make_core); |
346 | cleanup_inform (cause, make_core); |
394 | cfperl_cleanup (make_core); |
|
|
395 | _exit (1); |
|
|
396 | } |
|
|
397 | else |
347 | else |
398 | { |
348 | { |
399 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.\n"); |
349 | 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 "\n"); |
350 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); |
401 | flush_sockets (); |
351 | client::flush_sockets (); |
|
|
352 | } |
|
|
353 | |
402 | cfperl_cleanup (make_core); |
354 | cfperl_cleanup (make_core); |
403 | _exit (0); |
355 | _exit (make_core); |
404 | } |
|
|
405 | } |
|
|
406 | |
|
|
407 | int |
|
|
408 | forbid_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 | } |
356 | } |
456 | |
357 | |
457 | /* |
358 | /* |
458 | * do_specials() is a collection of functions to call from time to time. |
359 | * 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 |
360 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
… | |
… | |
465 | * done on the same tick, but that will happen very infrequently |
366 | * done on the same tick, but that will happen very infrequently |
466 | * |
367 | * |
467 | * I also think this code makes it easier to see how often we really are |
368 | * I also think this code makes it easier to see how often we really are |
468 | * doing the various things. |
369 | * doing the various things. |
469 | */ |
370 | */ |
470 | void |
371 | static void |
471 | do_specials (void) |
372 | do_specials () |
472 | { |
373 | { |
|
|
374 | shstr::gc (); |
|
|
375 | archetype::gc (); |
|
|
376 | |
473 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
377 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
474 | adjust_daylight (); |
378 | maptile::adjust_daylight (); |
475 | |
|
|
476 | if (expect_false (!(pticks % 7))) |
|
|
477 | shstr::gc (); |
|
|
478 | |
379 | |
479 | if (expect_false (!(pticks % 2503))) |
380 | if (expect_false (!(pticks % 2503))) |
480 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
381 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
481 | |
382 | |
482 | if (expect_false (!(pticks % 5003))) |
383 | if (expect_false (!(pticks % 5003))) |
… | |
… | |
494 | |
395 | |
495 | void |
396 | void |
496 | server_tick () |
397 | server_tick () |
497 | { |
398 | { |
498 | // first do the user visible stuff |
399 | // first do the user visible stuff |
499 | doeric_server (); |
|
|
500 | INVOKE_GLOBAL (CLOCK); |
400 | INVOKE_GLOBAL (CLOCK); |
501 | process_events (); /* "do" something with objects with speed */ |
401 | process_events (); // "do" something with objects with speed |
502 | flush_sockets (); |
402 | client::clock (); // draw client maps etc. |
503 | |
403 | |
504 | // then do some bookkeeping, should not really be here |
404 | // then do some bookkeeping, should not really be here |
505 | do_specials (); /* Routines called from time to time. */ |
405 | do_specials (); /* Routines called from time to time. */ |
506 | attachable::check_mortals (); |
406 | attachable::check_mortals (); |
507 | |
407 | |
508 | ++pticks; |
408 | ++pticks; |
509 | } |
|
|
510 | |
409 | |
511 | #if 0 |
410 | if (object::object_count >= RESTART_COUNT) |
512 | // used fro benchmarking (x86/amd64-specific) |
411 | cleanup ("running out of protocol ID values - need full restart"); |
513 | typedef unsigned long tval; |
|
|
514 | typedef unsigned long long stamp64; |
|
|
515 | |
|
|
516 | extern inline tval |
|
|
517 | stamp (void) |
|
|
518 | { |
|
|
519 | tval tsc; |
|
|
520 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
521 | |
|
|
522 | return tsc; |
|
|
523 | } |
412 | } |
524 | |
|
|
525 | extern inline tval |
|
|
526 | measure (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 | |
|
|
537 | int |
|
|
538 | main (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 | |
413 | |
559 | // normal main |
414 | // normal main |
560 | int |
415 | int |
561 | main (int argc, char **argv) |
416 | main (int argc, char **argv) |
562 | { |
417 | { |
563 | settings.argc = argc; |
418 | settings.argc = argc; |
564 | settings.argv = argv; |
419 | settings.argv = argv; |
|
|
420 | |
|
|
421 | rndm.seed (time (0)); |
|
|
422 | g_thread_init (0); // for the slice allocator only |
565 | |
423 | |
566 | init (argc, argv); |
424 | init (argc, argv); |
567 | |
|
|
568 | initPlugins (); |
|
|
569 | |
425 | |
570 | for (;;) |
426 | for (;;) |
571 | cfperl_main (); |
427 | cfperl_main (); |
572 | } |
428 | } |
573 | #endif |
|
|
574 | |
429 | |