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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 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 <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 | 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. We do some error checking - its possible that the |
107 | * 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 |
108 | * goes someplace. |
47 | * goes someplace. |
109 | */ |
48 | */ |
110 | void |
49 | void |
111 | enter_player_savebed (object *op) |
50 | enter_player_savebed (object *op) |
112 | { |
51 | { |
113 | object *tmp = object::create (); |
52 | 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 | } |
53 | } |
120 | |
54 | |
121 | /* |
55 | /* |
122 | * 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 |
123 | * 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 |
… | |
… | |
126 | * the function that calls this should figure them out. |
60 | * the function that calls this should figure them out. |
127 | */ |
61 | */ |
128 | void |
62 | void |
129 | object::enter_map (maptile *newmap, int x, int y) |
63 | object::enter_map (maptile *newmap, int x, int y) |
130 | { |
64 | { |
131 | if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) |
65 | if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) |
132 | return; |
66 | return; |
133 | |
67 | |
134 | if (out_of_map (newmap, x, y)) |
68 | if (out_of_map (newmap, x, y)) |
135 | { |
69 | { |
136 | 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); |
… | |
… | |
151 | |
85 | |
152 | // remove, so stupid ob_locked does not trigger a failure |
86 | // remove, so stupid ob_locked does not trigger a failure |
153 | remove (); |
87 | remove (); |
154 | |
88 | |
155 | /* try to find a spot for the player */ |
89 | /* try to find a spot for the player */ |
156 | if (ob_blocked (this, newmap, x, y)) |
90 | if (blocked (newmap, x, y)) |
157 | { /* First choice blocked */ |
91 | { /* First choice blocked */ |
158 | /* 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. |
159 | * 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, |
160 | * 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 |
161 | * if other spaces around are available. |
95 | * if other spaces around are available. |
… | |
… | |
209 | if (object *golem = contr->golem) |
143 | if (object *golem = contr->golem) |
210 | { |
144 | { |
211 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
145 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
212 | |
146 | |
213 | if (i < 0) |
147 | if (i < 0) |
214 | golem->destroy (); |
148 | golem->drop_and_destroy (); |
215 | else |
149 | else |
216 | { |
150 | { |
217 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
151 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
218 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
152 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
219 | } |
153 | } |
… | |
… | |
241 | flag = 0; |
175 | flag = 0; |
242 | for_all_players (pl) |
176 | for_all_players (pl) |
243 | { |
177 | { |
244 | pl->refcnt_chk (); |
178 | pl->refcnt_chk (); |
245 | |
179 | |
246 | if (!pl->ob || !pl->ns || !pl->ob->active) |
180 | if (expect_false (!pl->ob || !pl->ns || !pl->ob->active)) |
247 | continue; |
181 | continue; |
248 | |
182 | |
249 | if (pl->ob->speed_left > 0.f && pl->ns) |
|
|
250 | if (handle_newcs_player (pl->ob)) |
183 | if (handle_newcs_player (pl->ob)) |
251 | flag = 1; |
184 | flag = 1; |
252 | |
185 | } |
253 | /* If the player is not actively playing, don't make a |
186 | } |
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 | |
187 | |
264 | for_all_players (pl) |
188 | for_all_players (pl) |
265 | { |
189 | { |
266 | object *ob = pl->ob; |
190 | object *ob = pl->ob; |
267 | |
191 | |
|
|
192 | // process_objects destroys the speed_left value |
|
|
193 | pl->speed_left_save = ob->speed_left; |
|
|
194 | |
268 | if (!ob || !pl->ns || !ob->active) |
195 | if (expect_false (!ob || !pl->ns || !ob->active)) |
269 | continue; |
196 | 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 | |
197 | |
288 | do_some_living (ob); |
198 | do_some_living (ob); |
289 | } |
199 | } |
290 | } |
200 | } |
291 | |
201 | |
… | |
… | |
293 | process_players2 () |
203 | process_players2 () |
294 | { |
204 | { |
295 | /* Then check if any players should use weapon-speed instead of speed */ |
205 | /* Then check if any players should use weapon-speed instead of speed */ |
296 | for_all_players (pl) |
206 | for_all_players (pl) |
297 | { |
207 | { |
298 | if (pl->has_hit) |
208 | // restore speed_left value saved by process_players1 |
299 | { |
209 | 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 | |
210 | |
302 | if (pl->ob->speed_left > 0.f) |
211 | 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); |
212 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
307 | } |
213 | } |
308 | } |
214 | } |
309 | |
215 | |
310 | void |
216 | static void |
311 | process_events () |
217 | process_events () |
312 | { |
218 | { |
313 | process_players1 (); |
219 | process_players1 (); |
314 | |
220 | |
315 | for_all_actives (op) |
221 | for_all_actives (op) |
316 | { |
222 | { |
|
|
223 | // try to prefetch some stuff we expect to need |
|
|
224 | // obviously, it should be grouped into the same cacheline. |
|
|
225 | // preliminary results indicate that this gives halves the speed |
|
|
226 | // used for the inner loop |
|
|
227 | if (_i < actives.size ()) // HACK, rely on _i :/ |
|
|
228 | { |
|
|
229 | object *next = actives [_i + 1]; |
|
|
230 | |
|
|
231 | prefetch (&next->flag , 0, 1); |
|
|
232 | prefetch (&next->speed , 0, 1); |
|
|
233 | prefetch (&next->anim_speed, 0, 1); |
|
|
234 | prefetch (&next->contr , 0, 1); |
|
|
235 | } |
|
|
236 | |
317 | /* Now process op */ |
237 | /* Now process op */ |
318 | if (QUERY_FLAG (op, FLAG_FREED)) |
238 | if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
319 | { |
239 | { |
320 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
240 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
321 | op->set_speed (0); |
241 | op->set_speed (0); |
322 | continue; |
242 | continue; |
323 | } |
243 | } |
324 | |
244 | |
325 | if (!op->has_active_speed ()) |
245 | if (expect_false (!op->has_active_speed ())) |
326 | { |
246 | { |
327 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
247 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
328 | "but is on active list\n", op->debug_desc (), op->speed); |
248 | "but is on active list\n", op->debug_desc (), op->speed); |
329 | op->set_speed (0); |
249 | op->set_speed (0); |
330 | continue; |
250 | continue; |
331 | } |
251 | } |
332 | |
252 | |
333 | if (op->flag [FLAG_REMOVED]) |
253 | if (expect_false (op->flag [FLAG_REMOVED])) |
334 | { |
254 | { |
335 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
255 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
336 | op->debug_desc ()); |
256 | op->debug_desc ()); |
337 | op->set_speed (0); |
257 | op->set_speed (0); |
338 | continue; |
258 | continue; |
… | |
… | |
347 | op->last_anim = 1; |
267 | op->last_anim = 1; |
348 | } |
268 | } |
349 | else |
269 | else |
350 | ++op->last_anim; |
270 | ++op->last_anim; |
351 | |
271 | |
352 | if (op->speed_left > 0.f) |
272 | if (expect_false (op->speed_left > 0.f)) |
353 | { |
273 | { |
354 | --op->speed_left; |
274 | --op->speed_left; |
355 | process_object (op); |
275 | process_object (op); |
356 | |
|
|
357 | if (op->destroyed ()) |
|
|
358 | continue; |
|
|
359 | } |
276 | } |
360 | |
277 | |
361 | if (settings.casting_time == TRUE && op->casting_time > 0.f) |
278 | // this will destroy the speed_left value for players, but |
362 | --op->casting_time; |
279 | // process_players1 and ..2 save/restore the real value, |
363 | |
280 | // 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)); |
281 | op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
366 | } |
282 | } |
367 | |
283 | |
368 | process_players2 (); |
284 | process_players2 (); |
369 | } |
285 | } |
370 | |
286 | |
… | |
… | |
384 | |
300 | |
385 | // send all clients some informational text |
301 | // send all clients some informational text |
386 | static void |
302 | static void |
387 | cleanup_inform (const char *cause, bool make_core) |
303 | cleanup_inform (const char *cause, bool make_core) |
388 | { |
304 | { |
389 | int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
305 | int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
390 | |
306 | |
391 | new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); |
307 | 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); |
308 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); |
393 | |
309 | |
394 | if (make_core) |
310 | 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"); |
311 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved."); |
396 | else |
312 | 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"); |
313 | 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 | |
314 | |
399 | new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); |
315 | new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); |
400 | |
316 | |
401 | flush_sockets (); |
317 | client::flush_sockets (); |
402 | } |
318 | } |
403 | |
319 | |
404 | /* clean up everything before exiting */ |
320 | /* clean up everything before exiting */ |
405 | void |
321 | void |
406 | cleanup (const char *cause, bool make_core) |
322 | cleanup (const char *cause, bool make_core) |
… | |
… | |
426 | LOG (llevDebug, "running cleanup handlers.\n"); |
342 | LOG (llevDebug, "running cleanup handlers.\n"); |
427 | INVOKE_GLOBAL (CLEANUP); |
343 | INVOKE_GLOBAL (CLEANUP); |
428 | |
344 | |
429 | LOG (llevDebug, "cleanup done.\n"); |
345 | LOG (llevDebug, "cleanup done.\n"); |
430 | |
346 | |
|
|
347 | log_cleanup (); |
|
|
348 | |
431 | if (make_core) |
349 | if (make_core) |
432 | { |
|
|
433 | cleanup_inform (cause, make_core); |
350 | cleanup_inform (cause, make_core); |
434 | cfperl_cleanup (make_core); |
|
|
435 | _exit (1); |
|
|
436 | } |
|
|
437 | else |
351 | else |
438 | { |
352 | { |
439 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.\n"); |
353 | 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"); |
354 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); |
441 | flush_sockets (); |
355 | client::flush_sockets (); |
|
|
356 | } |
|
|
357 | |
442 | cfperl_cleanup (make_core); |
358 | cfperl_cleanup (make_core); |
443 | _exit (0); |
359 | _exit (make_core); |
444 | } |
|
|
445 | } |
|
|
446 | |
|
|
447 | int |
|
|
448 | forbid_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 | } |
360 | } |
496 | |
361 | |
497 | /* |
362 | /* |
498 | * do_specials() is a collection of functions to call from time to time. |
363 | * 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 |
364 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
… | |
… | |
505 | * done on the same tick, but that will happen very infrequently |
370 | * done on the same tick, but that will happen very infrequently |
506 | * |
371 | * |
507 | * I also think this code makes it easier to see how often we really are |
372 | * I also think this code makes it easier to see how often we really are |
508 | * doing the various things. |
373 | * doing the various things. |
509 | */ |
374 | */ |
510 | void |
375 | static void |
511 | do_specials (void) |
376 | do_specials (void) |
512 | { |
377 | { |
513 | if (!(pticks % TICKS_PER_HOUR)) |
|
|
514 | adjust_daylight (); |
|
|
515 | |
|
|
516 | if (!(pticks % 7)) |
|
|
517 | shstr::gc (); |
378 | shstr::gc (); |
|
|
379 | archetype::gc (); |
518 | |
380 | |
|
|
381 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
|
|
382 | maptile::adjust_daylight (); |
|
|
383 | |
519 | if (!(pticks % 2503)) |
384 | if (expect_false (!(pticks % 2503))) |
520 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
385 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
521 | |
386 | |
522 | if (!(pticks % 5003)) |
387 | if (expect_false (!(pticks % 5003))) |
523 | write_book_archive (); |
388 | write_book_archive (); |
524 | |
389 | |
525 | if (!(pticks % 5009)) |
390 | if (expect_false (!(pticks % 5009))) |
526 | clean_friendly_list (); |
391 | clean_friendly_list (); |
527 | |
392 | |
528 | if (!(pticks % 5011)) |
393 | if (expect_false (!(pticks % 5011))) |
529 | obsolete_parties (); |
394 | obsolete_parties (); |
530 | |
395 | |
531 | if (!(pticks % 12503)) |
396 | if (expect_false (!(pticks % 12503))) |
532 | fix_luck (); |
397 | fix_luck (); |
533 | } |
398 | } |
534 | |
399 | |
535 | void |
400 | void |
536 | server_tick () |
401 | server_tick () |
537 | { |
402 | { |
538 | // first do the user visible stuff |
403 | // first do the user visible stuff |
539 | doeric_server (); |
|
|
540 | INVOKE_GLOBAL (CLOCK); |
404 | INVOKE_GLOBAL (CLOCK); |
541 | process_events (); /* "do" something with objects with speed */ |
405 | process_events (); // "do" something with objects with speed |
542 | flush_sockets (); |
406 | client::clock (); // draw client maps etc. |
543 | |
407 | |
544 | // then do some bookkeeping, should not really be here |
408 | // then do some bookkeeping, should not really be here |
545 | do_specials (); /* Routines called from time to time. */ |
409 | do_specials (); /* Routines called from time to time. */ |
546 | attachable::check_mortals (); |
410 | attachable::check_mortals (); |
547 | |
411 | |
548 | ++pticks; |
412 | ++pticks; |
549 | } |
413 | } |
550 | |
414 | |
551 | #if 0 |
|
|
552 | // used fro benchmarking (x86/amd64-specific) |
|
|
553 | typedef unsigned long tval; |
|
|
554 | typedef unsigned long long stamp64; |
|
|
555 | |
|
|
556 | extern inline tval |
|
|
557 | stamp (void) |
|
|
558 | { |
|
|
559 | tval tsc; |
|
|
560 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
561 | |
|
|
562 | return tsc; |
|
|
563 | } |
|
|
564 | |
|
|
565 | extern inline tval |
|
|
566 | measure (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 | |
|
|
577 | int |
|
|
578 | main (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 | |
|
|
599 | // normal main |
415 | // normal main |
600 | int |
416 | int |
601 | main (int argc, char **argv) |
417 | main (int argc, char **argv) |
602 | { |
418 | { |
603 | settings.argc = argc; |
419 | settings.argc = argc; |
604 | settings.argv = argv; |
420 | settings.argv = argv; |
|
|
421 | |
|
|
422 | rndm.seed (time (0)); |
|
|
423 | g_thread_init (0); // for the slice allocator only |
605 | |
424 | |
606 | init (argc, argv); |
425 | init (argc, argv); |
607 | |
|
|
608 | initPlugins (); |
|
|
609 | |
426 | |
610 | for (;;) |
427 | for (;;) |
611 | cfperl_main (); |
428 | cfperl_main (); |
612 | } |
429 | } |
613 | #endif |
|
|
614 | |
430 | |