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