1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | 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 |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | (at your option) any later version. |
11 | * option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | 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 |
18 | 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 |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
20 | |
21 | * |
21 | 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> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
25 | #include <object.h> |
26 | #include <object.h> |
26 | #include <tod.h> |
27 | #include <tod.h> |
27 | |
28 | |
28 | #ifdef HAVE_DES_H |
|
|
29 | # include <des.h> |
|
|
30 | #else |
|
|
31 | # ifdef HAVE_CRYPT_H |
|
|
32 | # include <crypt.h> |
|
|
33 | # endif |
|
|
34 | #endif |
|
|
35 | |
|
|
36 | #include <sproto.h> |
29 | #include <sproto.h> |
37 | #include <time.h> |
30 | #include <time.h> |
|
|
31 | |
|
|
32 | #include <glib.h> |
38 | |
33 | |
39 | #include <../random_maps/random_map.h> |
34 | #include <../random_maps/random_map.h> |
40 | #include <../random_maps/rproto.h> |
35 | #include <../random_maps/rproto.h> |
41 | #include "path.h" |
36 | #include "path.h" |
42 | |
37 | |
43 | static char days[7][4] = { |
|
|
44 | "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
|
|
45 | }; |
|
|
46 | |
|
|
47 | void |
38 | void |
48 | version (object *op) |
39 | version (object *op) |
49 | { |
40 | { |
50 | if (op) |
|
|
51 | clear_win_info (op); |
|
|
52 | |
|
|
53 | 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); |
54 | |
|
|
55 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
|
|
56 | new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); |
|
|
57 | new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); |
|
|
58 | new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); |
|
|
59 | new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>"); |
|
|
60 | new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>"); |
|
|
61 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>"); |
|
|
62 | new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>"); |
|
|
63 | new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>"); |
|
|
64 | new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>"); |
|
|
65 | new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>"); |
|
|
66 | new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>"); |
|
|
67 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>"); |
|
|
68 | new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>"); |
|
|
69 | new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>"); |
|
|
70 | new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>"); |
|
|
71 | new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>"); |
|
|
72 | new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>"); |
|
|
73 | new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>"); |
|
|
74 | new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>"); |
|
|
75 | new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>"); |
|
|
76 | new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>"); |
|
|
77 | new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>"); |
|
|
78 | new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>"); |
|
|
79 | new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>"); |
|
|
80 | new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>"); |
|
|
81 | new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>"); |
|
|
82 | new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>"); |
|
|
83 | new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>"); |
|
|
84 | new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>"); |
|
|
85 | new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>"); |
|
|
86 | new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>"); |
|
|
87 | new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>"); |
|
|
88 | new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>"); |
|
|
89 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>"); |
|
|
90 | new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>"); |
|
|
91 | new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>"); |
|
|
92 | new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>"); |
|
|
93 | new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>"); |
|
|
94 | new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>"); |
|
|
95 | new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>"); |
|
|
96 | new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>"); |
|
|
97 | new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>"); |
|
|
98 | new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n"); |
|
|
99 | |
|
|
100 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
|
|
101 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
|
|
102 | new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>"); |
|
|
103 | new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>"); |
|
|
104 | new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>"); |
|
|
105 | new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); |
|
|
106 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
|
|
107 | } |
42 | } |
108 | |
43 | |
109 | /* 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 |
110 | * savebed. We do some error checking - its possible that the |
45 | * savebed. We do some error checking - its possible that the |
111 | * 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 |
112 | * goes someplace. |
47 | * goes someplace. |
113 | */ |
48 | */ |
114 | void |
49 | void |
115 | enter_player_savebed (object *op) |
50 | enter_player_savebed (object *op) |
116 | { |
51 | { |
117 | object *tmp = object::create (); |
52 | op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y); |
118 | EXIT_PATH (tmp) = op->contr->savebed_map; |
|
|
119 | EXIT_X (tmp) = op->contr->bed_x; |
|
|
120 | EXIT_Y (tmp) = op->contr->bed_y; |
|
|
121 | op->enter_exit (tmp); |
|
|
122 | tmp->destroy (); |
|
|
123 | } |
53 | } |
124 | |
54 | |
125 | /* |
55 | /* |
126 | * 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 |
127 | * 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 |
… | |
… | |
130 | * the function that calls this should figure them out. |
60 | * the function that calls this should figure them out. |
131 | */ |
61 | */ |
132 | void |
62 | void |
133 | object::enter_map (maptile *newmap, int x, int y) |
63 | object::enter_map (maptile *newmap, int x, int y) |
134 | { |
64 | { |
135 | if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) |
65 | if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) |
136 | return; |
66 | return; |
137 | |
67 | |
138 | if (out_of_map (newmap, x, y)) |
68 | if (out_of_map (newmap, x, y)) |
139 | { |
69 | { |
140 | 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 | |
81 | |
152 | if (contr && map != newmap && map) |
82 | if (contr && map != newmap && map) |
153 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
83 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
154 | return; |
84 | return; |
155 | |
85 | |
156 | /* If it is a player login, he has yet to be inserted anyplace. |
86 | // remove, so stupid blocked does not trigger a failure |
157 | * otherwise, we need to deal with removing the player here. |
|
|
158 | */ |
|
|
159 | remove (); |
87 | remove (); |
160 | |
88 | |
161 | /* try to find a spot for the player */ |
89 | /* try to find a spot for the player */ |
162 | if (ob_blocked (this, newmap, x, y)) |
90 | if (blocked (newmap, x, y)) |
163 | { /* First choice blocked */ |
91 | { /* First choice blocked */ |
164 | /* 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. |
165 | * 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, |
166 | * 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 |
167 | * if other spaces around are available. |
95 | * if other spaces around are available. |
168 | * 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 |
169 | * 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. |
170 | */ |
98 | */ |
171 | 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); |
172 | |
100 | |
173 | if (i == -1) |
101 | if (i < 0) |
174 | { |
102 | { |
175 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
103 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
176 | if (i == -1) |
104 | if (i < 0) |
177 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
105 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
178 | } |
106 | } |
179 | |
107 | |
180 | if (i != -1) |
108 | if (i >= 0) |
181 | { |
109 | { |
182 | x += freearr_x[i]; |
110 | x += freearr_x[i]; |
183 | y += freearr_y[i]; |
111 | y += freearr_y[i]; |
184 | } |
112 | } |
185 | else |
113 | else |
… | |
… | |
194 | |
122 | |
195 | 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))) |
196 | return; |
124 | return; |
197 | } |
125 | } |
198 | |
126 | |
199 | this->x = x; |
127 | newmap->insert (this, x, y, 0, INS_NO_WALK_ON); |
200 | this->y = y; |
|
|
201 | map = newmap; |
|
|
202 | |
128 | |
203 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
|
|
204 | |
|
|
205 | enemy = NULL; |
129 | enemy = 0; |
206 | |
130 | |
207 | if (contr) |
131 | if (contr) |
208 | { |
132 | { |
209 | contr->maplevel = newmap->path; |
133 | contr->maplevel = newmap->path; |
210 | contr->count = 0; |
134 | contr->count = 0; |
211 | } |
135 | } |
212 | |
136 | |
213 | /* Update any golems */ |
137 | /* Update any golems */ |
214 | if (type == PLAYER && contr->ranges[range_golem]) |
138 | if (type == PLAYER) |
215 | { |
139 | if (object *golem = contr->golem) |
216 | int i = find_free_spot (contr->ranges[range_golem], newmap, |
|
|
217 | x, y, 1, SIZEOFFREE); |
|
|
218 | |
|
|
219 | contr->ranges[range_golem]->remove (); |
|
|
220 | |
|
|
221 | if (i == -1) |
|
|
222 | { |
140 | { |
223 | remove_friendly_object (contr->ranges[range_golem]); |
141 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
224 | contr->ranges[range_golem]->destroy (); |
142 | |
225 | contr->ranges[range_golem] = 0; |
143 | if (i < 0) |
226 | } |
144 | golem->drop_and_destroy (); |
227 | else |
145 | else |
228 | { |
|
|
229 | for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more) |
|
|
230 | { |
146 | { |
231 | tmp->x = x + freearr_x[i] + (tmp->arch ? 0 : tmp->arch->clone.x); |
147 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
232 | tmp->y = y + freearr_y[i] + (tmp->arch ? 0 : tmp->arch->clone.y); |
148 | golem->direction = find_dir_2 (golem->x - x, golem->y - y); |
233 | tmp->map = newmap; |
|
|
234 | } |
149 | } |
235 | |
|
|
236 | insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0); |
|
|
237 | contr->ranges[range_golem]->direction = |
|
|
238 | find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y); |
|
|
239 | } |
150 | } |
240 | } |
|
|
241 | |
151 | |
242 | /* 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 |
243 | * about pending objects. |
153 | * about pending objects. |
244 | */ |
154 | */ |
245 | remove_all_pets (newmap); |
155 | remove_all_pets (newmap); |
… | |
… | |
253 | * is needed after the players have been updated. |
163 | * is needed after the players have been updated. |
254 | */ |
164 | */ |
255 | static void |
165 | static void |
256 | process_players1 () |
166 | process_players1 () |
257 | { |
167 | { |
258 | int flag; |
|
|
259 | |
|
|
260 | /* Basically, we keep looping until all the players have done their actions. */ |
168 | /* Basically, we keep looping until all the players have done their actions. */ |
261 | for (flag = 1; flag != 0;) |
169 | for (int flag = 1; flag != 0;) |
262 | { |
170 | { |
263 | flag = 0; |
171 | flag = 0; |
264 | for_all_players (pl) |
172 | for_all_players (pl) |
265 | { |
173 | { |
266 | pl->refcnt_chk (); |
174 | pl->refcnt_chk (); |
267 | |
175 | |
268 | if (!pl->ob || !pl->ns || !pl->ob->active ()) |
176 | if (expect_false (!pl->ob || !pl->ns || !pl->ob->active)) |
269 | continue; |
177 | continue; |
270 | |
178 | |
271 | if (pl->ob->speed_left > 0) |
|
|
272 | if (handle_newcs_player (pl->ob)) |
179 | if (handle_newcs_player (pl->ob)) |
273 | flag = 1; |
180 | flag = 1; |
274 | |
|
|
275 | /* If the player is not actively playing, don't make a |
|
|
276 | * backup save - nothing to save anyway. Plus, the |
|
|
277 | * map may not longer be valid. This can happen when the |
|
|
278 | * player quits - they exist for purposes of tracking on the map, |
|
|
279 | * but don't actually reside on any actual map. |
|
|
280 | */ |
|
|
281 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
282 | continue; |
|
|
283 | |
|
|
284 | #ifdef AUTOSAVE |
|
|
285 | /* check for ST_PLAYING state so that we don't try to save off when |
|
|
286 | * the player is logging in. |
|
|
287 | */ |
|
|
288 | if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->ns->state == ST_PLAYING) |
|
|
289 | { |
|
|
290 | pl->ob->contr->save (); |
|
|
291 | pl->last_save_tick = pticks; |
|
|
292 | } |
181 | } |
293 | #endif |
182 | } |
294 | } /* end of for loop for all the players */ |
|
|
295 | } /* for flag */ |
|
|
296 | |
183 | |
297 | for_all_players (pl) |
184 | for_all_players (pl) |
298 | { |
185 | { |
|
|
186 | object *ob = pl->ob; |
|
|
187 | |
|
|
188 | // process_objects destroys the speed_left value |
|
|
189 | pl->speed_left_save = ob->speed_left; |
|
|
190 | |
299 | if (!pl->ob || !pl->ns || !pl->ob->active ()) |
191 | if (expect_false (!ob || !pl->ns || !ob->active)) |
300 | continue; |
192 | continue; |
301 | |
193 | |
302 | if (settings.casting_time) |
|
|
303 | { |
|
|
304 | if (pl->ob->casting_time > 0) |
|
|
305 | { |
|
|
306 | pl->ob->casting_time--; |
|
|
307 | pl->ob->start_holding = 1; |
|
|
308 | } |
|
|
309 | |
|
|
310 | /* set spell_state so we can update the range in stats field */ |
|
|
311 | if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1)) |
|
|
312 | pl->ob->start_holding = 0; |
|
|
313 | } |
|
|
314 | |
|
|
315 | do_some_living (pl->ob); |
194 | do_some_living (ob); |
316 | } |
195 | } |
317 | } |
196 | } |
318 | |
197 | |
319 | static void |
198 | static void |
320 | process_players2 () |
199 | process_players2 () |
321 | { |
200 | { |
322 | /* 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 */ |
323 | for_all_players (pl) |
202 | for_all_players (pl) |
324 | { |
203 | { |
325 | /* The code that did weapon_sp handling here was out of place - |
204 | // restore speed_left value saved by process_players1 |
326 | * this isn't called until after the player has finished there |
|
|
327 | * actions, and is thus out of place. All we do here is bounds |
|
|
328 | * checking. |
|
|
329 | */ |
|
|
330 | if (pl->has_hit) |
|
|
331 | { |
|
|
332 | if (pl->ob->speed_left > pl->weapon_sp) |
|
|
333 | pl->ob->speed_left = pl->weapon_sp; |
|
|
334 | |
|
|
335 | /* This needs to be here - if the player is running, we need to |
|
|
336 | * clear this each tick, but new commands are not being received |
|
|
337 | * so execute_newserver_command() is never called |
|
|
338 | */ |
|
|
339 | pl->has_hit = 0; |
|
|
340 | } |
|
|
341 | else if (pl->ob->speed_left > pl->ob->speed) |
|
|
342 | pl->ob->speed_left = pl->ob->speed; |
205 | pl->ob->speed_left = pl->speed_left_save; |
343 | } |
|
|
344 | } |
|
|
345 | |
206 | |
346 | void |
207 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
|
|
208 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
|
|
209 | } |
|
|
210 | } |
|
|
211 | |
|
|
212 | static void |
347 | process_events () |
213 | process_events () |
348 | { |
214 | { |
349 | object *op; |
|
|
350 | |
|
|
351 | static object_ptr marker_; |
|
|
352 | |
|
|
353 | if (!marker_) |
|
|
354 | marker_ = object::create (); |
|
|
355 | |
|
|
356 | object *marker = marker_; |
|
|
357 | |
|
|
358 | process_players1 (); |
215 | process_players1 (); |
359 | |
216 | |
360 | marker->active_next = active_objects; |
217 | for_all_actives (op) |
361 | |
|
|
362 | if (marker->active_next) |
|
|
363 | marker->active_next->active_prev = marker; |
|
|
364 | |
|
|
365 | marker->active_prev = 0; |
|
|
366 | active_objects = marker; |
|
|
367 | |
|
|
368 | while (marker->active_next) |
|
|
369 | { |
218 | { |
370 | op = marker->active_next; |
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]; |
371 | |
226 | |
372 | /* Move marker forward - swap op and marker */ |
227 | prefetch (&next->flag , 0, 1); |
373 | op->active_prev = marker->active_prev; |
228 | prefetch (&next->speed , 0, 1); |
374 | |
229 | prefetch (&next->anim_speed, 0, 1); |
375 | if (op->active_prev) |
230 | prefetch (&next->contr , 0, 1); |
376 | op->active_prev->active_next = op; |
231 | } |
377 | else |
|
|
378 | active_objects = op; |
|
|
379 | |
|
|
380 | marker->active_next = op->active_next; |
|
|
381 | |
|
|
382 | if (marker->active_next) |
|
|
383 | marker->active_next->active_prev = marker; |
|
|
384 | |
|
|
385 | marker->active_prev = op; |
|
|
386 | op->active_next = marker; |
|
|
387 | |
232 | |
388 | /* Now process op */ |
233 | /* Now process op */ |
389 | if (QUERY_FLAG (op, FLAG_FREED)) |
234 | if (expect_false (op->flag [FLAG_FREED])) |
390 | { |
235 | { |
391 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
236 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
392 | op->set_speed (0); |
237 | op->set_speed (0); |
393 | continue; |
238 | continue; |
394 | } |
239 | } |
395 | |
240 | |
396 | /* I've seen occasional crashes due to this - the object is removed, |
|
|
397 | * and thus the map it points to (last map it was on) may be bogus |
|
|
398 | * The real bug is to try to find out the cause of this - someone |
|
|
399 | * is probably calling remove_ob without either an insert_ob or |
|
|
400 | * free_object afterwards, leaving an object dangling. But I'd |
|
|
401 | * rather log this and continue on instead of crashing. |
|
|
402 | * Don't remove players - when a player quits, the object is in |
|
|
403 | * sort of a limbo, of removed, but something we want to keep |
|
|
404 | * around. |
|
|
405 | */ |
|
|
406 | if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY) |
|
|
407 | { |
|
|
408 | LOG (llevError, "BUG: process_events(): Removed object on list\n"); |
|
|
409 | char *dump = dump_object (op); |
|
|
410 | LOG (llevError, dump); |
|
|
411 | free (dump); |
|
|
412 | op->destroy (); |
|
|
413 | continue; |
|
|
414 | } |
|
|
415 | |
|
|
416 | if (!op->has_active_speed ()) |
241 | if (expect_false (!op->has_active_speed ())) |
417 | { |
242 | { |
418 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
243 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
419 | "but is on active list\n", op->debug_desc (), op->speed); |
244 | "but is on active list\n", op->debug_desc (), op->speed); |
420 | op->set_speed (0); |
245 | op->set_speed (0); |
421 | continue; |
246 | continue; |
422 | } |
247 | } |
423 | |
248 | |
424 | if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) |
249 | if (expect_false (op->flag [FLAG_REMOVED])) |
425 | { |
250 | { |
426 | LOG (llevError, "BUG: process_events(): Object without map or " |
251 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
427 | "inventory is on active list: %s (%d)\n", &op->name, op->count); |
252 | op->debug_desc ()); |
428 | op->set_speed (0); |
253 | op->set_speed (0); |
429 | continue; |
254 | continue; |
430 | } |
255 | } |
431 | |
256 | |
432 | /* Animate the object. Bug or feature that anim_speed |
257 | /* Animate the object. Bug or feature that anim_speed |
433 | * is based on ticks, and not the creatures speed? |
258 | * is based on ticks, and not the creatures speed? |
434 | */ |
259 | */ |
435 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
260 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
436 | { |
261 | { |
437 | if ((op->type == PLAYER)) |
|
|
438 | animate_object (op, op->facing); |
|
|
439 | else |
|
|
440 | animate_object (op, op->direction); |
262 | animate_object (op, op->contr ? op->facing : op->direction); |
441 | |
|
|
442 | op->last_anim = 1; |
263 | op->last_anim = 1; |
443 | } |
264 | } |
444 | else |
265 | else |
445 | op->last_anim++; |
266 | ++op->last_anim; |
446 | |
267 | |
447 | if (op->speed_left > 0) |
268 | if (expect_false (op->speed_left > 0.f)) |
448 | { |
|
|
449 | #if 0 |
|
|
450 | /* I've seen occasional crashes in move_symptom() with it |
|
|
451 | * crashing because op is removed - add some debugging to |
|
|
452 | * track if it is removed at this point. |
|
|
453 | * This unfortunately is a bit too verbose it seems - not sure |
|
|
454 | * why - I think what happens is a map is freed or something and |
|
|
455 | * some objects get 'lost' - removed never to be reclaimed. |
|
|
456 | * removed objects generally shouldn't exist. |
|
|
457 | */ |
|
|
458 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
459 | { |
269 | { |
460 | LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null"); |
|
|
461 | } |
|
|
462 | #endif |
|
|
463 | --op->speed_left; |
270 | --op->speed_left; |
464 | process_object (op); |
271 | process_object (op); |
465 | |
|
|
466 | if (op->destroyed ()) |
|
|
467 | continue; |
|
|
468 | } |
272 | } |
469 | |
273 | |
470 | if (settings.casting_time == TRUE && op->casting_time > 0) |
274 | // this will destroy the speed_left value for players, but |
471 | op->casting_time--; |
275 | // process_players1 and ..2 save/restore the real value, |
472 | |
276 | // so we can avoid a costly test here. |
473 | if (op->speed_left <= 0) |
277 | op->speed_left = min (op->speed, op->speed_left + op->speed); |
474 | op->speed_left += FABS (op->speed); |
|
|
475 | } |
278 | } |
476 | |
|
|
477 | /* Remove marker object from active list */ |
|
|
478 | if (marker->active_prev != NULL) |
|
|
479 | marker->active_prev->active_next = NULL; |
|
|
480 | else |
|
|
481 | active_objects = NULL; |
|
|
482 | |
279 | |
483 | process_players2 (); |
280 | process_players2 (); |
484 | } |
281 | } |
485 | |
282 | |
486 | /* clean up everything before exiting */ |
283 | /* clean up everything before exiting */ |
487 | void |
284 | void |
488 | emergency_save () |
285 | emergency_save () |
489 | { |
286 | { |
490 | LOG (llevDebug, "emergency save begin.\n"); |
287 | LOG (llevDebug, "emergency save begin.\n"); |
491 | |
288 | |
492 | LOG (llevDebug, "saving players.\n"); |
|
|
493 | for_all_players (pl) |
|
|
494 | if (pl->enable_save && pl->ob && pl->ns) |
|
|
495 | { |
|
|
496 | pl->save (true); |
|
|
497 | pl->enable_save = true; |
|
|
498 | } |
|
|
499 | |
|
|
500 | // for_all_players (pl) |
|
|
501 | // if (pl->ob) |
|
|
502 | // pl->ob->remove (); |
|
|
503 | |
|
|
504 | LOG (llevDebug, "saving maps.\n"); |
|
|
505 | maptile::emergency_save (); |
289 | cfperl_emergency_save (); |
506 | |
290 | |
507 | LOG (llevDebug, "saving book archive.\n"); |
291 | LOG (llevDebug, "saving book archive.\n"); |
508 | write_book_archive (); |
292 | write_book_archive (); |
509 | |
293 | |
510 | LOG (llevDebug, "emergency save done.\n"); |
294 | LOG (llevDebug, "emergency save done.\n"); |
… | |
… | |
512 | |
296 | |
513 | // send all clients some informational text |
297 | // send all clients some informational text |
514 | static void |
298 | static void |
515 | cleanup_inform (const char *cause, bool make_core) |
299 | cleanup_inform (const char *cause, bool make_core) |
516 | { |
300 | { |
|
|
301 | int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
|
|
302 | |
517 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "The server will now shutdown.\n"); |
303 | new_draw_info_format (flags, 0, 0, "The server will now shutdown."); |
518 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "Cause for this shtudown: %s\n", cause); |
304 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); |
519 | |
305 | |
520 | if (make_core) |
306 | if (make_core) |
521 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "This is considered a crash.\n"); |
307 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved."); |
522 | else |
308 | else |
523 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "This is considered to be a clean shutdown.\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."); |
524 | |
310 | |
525 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_RED, 0, 0, "%s\n", CLEANUP_MESSAGE); |
311 | new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); |
526 | |
312 | |
527 | flush_sockets (); |
313 | client::flush_sockets (); |
528 | } |
314 | } |
529 | |
315 | |
530 | /* clean up everything before exiting */ |
316 | /* clean up everything before exiting */ |
531 | void |
317 | void |
532 | cleanup (const char *cause, bool make_core) |
318 | cleanup (const char *cause, bool make_core) |
533 | { |
319 | { |
|
|
320 | if (make_core) |
|
|
321 | fork_abort (cause); |
|
|
322 | |
534 | LOG (llevError, "cleanup cause: %s\n", cause); |
323 | LOG (llevError, "cleanup cause: %s\n", cause); |
535 | |
324 | |
536 | if (!make_core) |
325 | if (!make_core) |
537 | cleanup_inform (cause, make_core); |
326 | cleanup_inform (cause, make_core); |
538 | |
327 | |
… | |
… | |
549 | LOG (llevDebug, "running cleanup handlers.\n"); |
338 | LOG (llevDebug, "running cleanup handlers.\n"); |
550 | INVOKE_GLOBAL (CLEANUP); |
339 | INVOKE_GLOBAL (CLEANUP); |
551 | |
340 | |
552 | LOG (llevDebug, "cleanup done.\n"); |
341 | LOG (llevDebug, "cleanup done.\n"); |
553 | |
342 | |
|
|
343 | log_cleanup (); |
|
|
344 | |
554 | if (make_core) |
345 | if (make_core) |
555 | { |
|
|
556 | cleanup_inform (cause, make_core); |
346 | cleanup_inform (cause, make_core); |
557 | abort (); |
|
|
558 | } |
|
|
559 | else |
347 | else |
560 | _exit (0); |
|
|
561 | } |
|
|
562 | |
|
|
563 | int |
|
|
564 | forbid_play (void) |
|
|
565 | { |
|
|
566 | #if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE) |
|
|
567 | char buf[MAX_BUF], day[MAX_BUF]; |
|
|
568 | FILE *fp; |
|
|
569 | time_t clock; |
|
|
570 | struct tm *tm; |
|
|
571 | int i, start, stop, forbit = 0, comp; |
|
|
572 | |
|
|
573 | clock = time (NULL); |
|
|
574 | tm = (struct tm *) localtime (&clock); |
|
|
575 | |
|
|
576 | sprintf (buf, "%s/%s", settings.confdir, PERM_FILE); |
|
|
577 | if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
|
|
578 | return 0; |
|
|
579 | |
|
|
580 | while (fgets (buf, MAX_BUF, fp)) |
|
|
581 | { |
|
|
582 | if (buf[0] == '#') |
|
|
583 | continue; |
|
|
584 | |
|
|
585 | if (!strncmp (buf, "msg", 3)) |
|
|
586 | { |
|
|
587 | if (forbit) |
|
|
588 | while (fgets (buf, MAX_BUF, fp)) /* print message */ |
|
|
589 | fputs (buf, logfile); |
|
|
590 | break; |
|
|
591 | } |
|
|
592 | else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
|
|
593 | { |
|
|
594 | LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
|
|
595 | continue; |
|
|
596 | } |
|
|
597 | |
|
|
598 | for (i = 0; i < 7; i++) |
|
|
599 | { |
|
|
600 | if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop)) |
|
|
601 | forbit = 1; |
|
|
602 | } |
|
|
603 | } |
348 | { |
|
|
349 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting."); |
|
|
350 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); |
|
|
351 | client::flush_sockets (); |
|
|
352 | } |
604 | |
353 | |
605 | close_and_delete (fp, comp); |
354 | cfperl_cleanup (make_core); |
606 | |
355 | _exit (make_core); |
607 | return forbit; |
|
|
608 | #else |
|
|
609 | return 0; |
|
|
610 | #endif |
|
|
611 | } |
356 | } |
612 | |
357 | |
613 | /* |
358 | /* |
614 | * 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. |
615 | * 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 |
… | |
… | |
621 | * done on the same tick, but that will happen very infrequently |
366 | * done on the same tick, but that will happen very infrequently |
622 | * |
367 | * |
623 | * 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 |
624 | * doing the various things. |
369 | * doing the various things. |
625 | */ |
370 | */ |
626 | |
371 | static void |
627 | extern unsigned long todtick; |
|
|
628 | |
|
|
629 | void |
|
|
630 | do_specials (void) |
372 | do_specials () |
631 | { |
373 | { |
632 | if (!(pticks % PTICKS_PER_CLOCK)) |
|
|
633 | tick_the_clock (); |
|
|
634 | |
|
|
635 | if (!(pticks % 7)) |
|
|
636 | shstr::gc (); |
374 | shstr::gc (); |
|
|
375 | archetype::gc (); |
637 | |
376 | |
|
|
377 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
|
|
378 | maptile::adjust_daylight (); |
|
|
379 | |
638 | if (!(pticks % 2503)) |
380 | if (expect_false (!(pticks % 2503))) |
639 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
381 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
640 | |
382 | |
641 | if (!(pticks % 5003)) |
383 | if (expect_false (!(pticks % 5003))) |
642 | write_book_archive (); |
384 | write_book_archive (); |
643 | |
385 | |
644 | if (!(pticks % 5009)) |
386 | if (expect_false (!(pticks % 5009))) |
645 | clean_friendly_list (); |
387 | clean_friendly_list (); |
646 | |
388 | |
647 | if (!(pticks % 5011)) |
389 | if (expect_false (!(pticks % 5011))) |
648 | obsolete_parties (); |
390 | obsolete_parties (); |
649 | |
391 | |
650 | if (!(pticks % 12503)) |
392 | if (expect_false (!(pticks % 12503))) |
651 | fix_luck (); |
393 | fix_luck (); |
652 | } |
394 | } |
653 | |
395 | |
654 | void |
396 | void |
655 | server_tick () |
397 | server_tick () |
656 | { |
398 | { |
657 | // first do the user visible stuff |
399 | // first do the user visible stuff |
658 | doeric_server (); |
|
|
659 | INVOKE_GLOBAL (CLOCK); |
400 | INVOKE_GLOBAL (CLOCK); |
660 | process_events (); /* "do" something with objects with speed */ |
401 | process_events (); // "do" something with objects with speed |
661 | flush_sockets (); |
402 | client::clock (); // draw client maps etc. |
662 | |
403 | |
663 | // then do some bookkeeping, should not really be here |
404 | // then do some bookkeeping, should not really be here |
664 | do_specials (); /* Routines called from time to time. */ |
405 | do_specials (); /* Routines called from time to time. */ |
665 | attachable::check_mortals (); |
406 | attachable::check_mortals (); |
666 | |
407 | |
667 | ++pticks; |
408 | ++pticks; |
668 | } |
|
|
669 | |
409 | |
|
|
410 | if (object::object_count >= RESTART_COUNT) |
|
|
411 | cleanup ("running out of protocol ID values - need full restart"); |
|
|
412 | } |
|
|
413 | |
|
|
414 | // normal main |
670 | int |
415 | int |
671 | main (int argc, char **argv) |
416 | main (int argc, char **argv) |
672 | { |
417 | { |
673 | settings.argc = argc; |
418 | settings.argc = argc; |
674 | settings.argv = argv; |
419 | settings.argv = argv; |
|
|
420 | |
|
|
421 | rndm.seed (time (0)); |
|
|
422 | g_thread_init (0); // for the slice allocator only |
675 | |
423 | |
676 | init (argc, argv); |
424 | init (argc, argv); |
677 | |
|
|
678 | initPlugins (); |
|
|
679 | |
425 | |
680 | for (;;) |
426 | for (;;) |
681 | cfperl_main (); |
427 | cfperl_main (); |
682 | } |
428 | } |
683 | |
429 | |