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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 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 | |
|
|
82 | if (contr && map != newmap && map) |
|
|
83 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
|
|
84 | return; |
|
|
85 | |
|
|
86 | // remove, so stupid ob_locked does not trigger a failure |
|
|
87 | remove (); |
|
|
88 | |
158 | /* try to find a spot for the player */ |
89 | /* try to find a spot for the player */ |
159 | if (ob_blocked (this, newmap, x, y)) |
90 | if (blocked (newmap, x, y)) |
160 | { /* First choice blocked */ |
91 | { /* First choice blocked */ |
161 | /* 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. |
162 | * 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, |
163 | * 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 |
164 | * if other spaces around are available. |
95 | * if other spaces around are available. |
… | |
… | |
182 | else |
113 | else |
183 | /* not much we can do in this case. */ |
114 | /* not much we can do in this case. */ |
184 | 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); |
185 | } |
116 | } |
186 | |
117 | |
187 | if (map) |
118 | if (contr && map != newmap) |
188 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
119 | { |
189 | return; |
|
|
190 | |
|
|
191 | 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))) |
192 | return; |
121 | return; |
193 | |
122 | |
194 | 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))) |
195 | return; |
124 | return; |
196 | |
125 | } |
197 | /* If it is a player login, he has yet to be inserted anyplace. |
|
|
198 | * otherwise, we need to deal with removing the player here. |
|
|
199 | */ |
|
|
200 | remove (); |
|
|
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 (x - golem->x, y - golem->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); |
252 | } |
|
|
253 | |
|
|
254 | /* clean_path takes a path and replaces all / with _ |
|
|
255 | * We do a strcpy so that we do not change the original string. |
|
|
256 | */ |
|
|
257 | char * |
|
|
258 | clean_path (const char *file) |
|
|
259 | { |
|
|
260 | static char newpath[MAX_BUF], *cp; |
|
|
261 | assign (newpath, file); |
|
|
262 | |
|
|
263 | for (cp = newpath; *cp != '\0'; cp++) |
|
|
264 | if (*cp == '/') |
|
|
265 | *cp = '_'; |
|
|
266 | |
|
|
267 | return newpath; |
|
|
268 | } |
|
|
269 | |
|
|
270 | /* unclean_path takes a path and replaces all _ with / |
|
|
271 | * This basically undoes clean path. |
|
|
272 | * We do a strcpy so that we do not change the original string. |
|
|
273 | * We are smart enough to start after the last / in case we |
|
|
274 | * are getting passed a string that points to a unique map |
|
|
275 | * path. |
|
|
276 | */ |
|
|
277 | char * |
|
|
278 | unclean_path (const char *src) |
|
|
279 | { |
|
|
280 | static char newpath[MAX_BUF], *cp; |
|
|
281 | |
|
|
282 | cp = strrchr (src, '/'); |
|
|
283 | assign (newpath, cp ? cp + 1 : src); |
|
|
284 | |
|
|
285 | for (cp = newpath; *cp != '\0'; cp++) |
|
|
286 | if (*cp == '_') |
|
|
287 | *cp = '/'; |
|
|
288 | |
|
|
289 | return newpath; |
|
|
290 | } |
160 | } |
291 | |
161 | |
292 | /* process_players1 and process_players2 do all the player related stuff. |
162 | /* process_players1 and process_players2 do all the player related stuff. |
293 | * I moved it out of process events and process_map. This was to some |
163 | * I moved it out of process events and process_map. This was to some |
294 | * extent for debugging as well as to get a better idea of the time used |
164 | * extent for debugging as well as to get a better idea of the time used |
… | |
… | |
297 | * is needed after the players have been updated. |
167 | * is needed after the players have been updated. |
298 | */ |
168 | */ |
299 | static void |
169 | static void |
300 | process_players1 () |
170 | process_players1 () |
301 | { |
171 | { |
302 | int flag; |
|
|
303 | |
|
|
304 | /* 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. */ |
305 | for (flag = 1; flag != 0;) |
173 | for (int flag = 1; flag != 0;) |
306 | { |
174 | { |
307 | flag = 0; |
175 | flag = 0; |
308 | for_all_players (pl) |
176 | for_all_players (pl) |
309 | { |
177 | { |
310 | pl->refcnt_chk (); |
178 | pl->refcnt_chk (); |
311 | |
179 | |
312 | if (!pl->ob || !pl->ns) |
180 | if (expect_false (!pl->ob || !pl->ns || !pl->ob->active)) |
313 | continue; |
181 | continue; |
314 | |
182 | |
315 | if (pl->ob->speed_left > 0) |
|
|
316 | if (handle_newcs_player (pl->ob)) |
183 | if (handle_newcs_player (pl->ob)) |
317 | flag = 1; |
184 | flag = 1; |
318 | |
|
|
319 | /* If the player is not actively playing, don't make a |
|
|
320 | * backup save - nothing to save anyway. Plus, the |
|
|
321 | * map may not longer be valid. This can happen when the |
|
|
322 | * player quits - they exist for purposes of tracking on the map, |
|
|
323 | * but don't actually reside on any actual map. |
|
|
324 | */ |
|
|
325 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
326 | continue; |
|
|
327 | |
|
|
328 | #ifdef AUTOSAVE |
|
|
329 | /* check for ST_PLAYING state so that we don't try to save off when |
|
|
330 | * the player is logging in. |
|
|
331 | */ |
|
|
332 | if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->ns->state == ST_PLAYING) |
|
|
333 | { |
|
|
334 | pl->ob->contr->save (); |
|
|
335 | pl->last_save_tick = pticks; |
|
|
336 | } |
185 | } |
337 | #endif |
186 | } |
338 | } /* end of for loop for all the players */ |
|
|
339 | } /* for flag */ |
|
|
340 | |
187 | |
341 | for_all_players (pl) |
188 | for_all_players (pl) |
342 | { |
189 | { |
343 | 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)) |
344 | continue; |
196 | continue; |
345 | |
197 | |
346 | if (settings.casting_time) |
|
|
347 | { |
|
|
348 | if (pl->ob->casting_time > 0) |
|
|
349 | { |
|
|
350 | pl->ob->casting_time--; |
|
|
351 | pl->ob->start_holding = 1; |
|
|
352 | } |
|
|
353 | |
|
|
354 | /* set spell_state so we can update the range in stats field */ |
|
|
355 | if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1)) |
|
|
356 | pl->ob->start_holding = 0; |
|
|
357 | } |
|
|
358 | |
|
|
359 | do_some_living (pl->ob); |
198 | do_some_living (ob); |
360 | } |
199 | } |
361 | } |
200 | } |
362 | |
201 | |
363 | static void |
202 | static void |
364 | process_players2 () |
203 | process_players2 () |
365 | { |
204 | { |
366 | /* 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 */ |
367 | for_all_players (pl) |
206 | for_all_players (pl) |
368 | { |
207 | { |
369 | /* The code that did weapon_sp handling here was out of place - |
208 | // restore speed_left value saved by process_players1 |
370 | * this isn't called until after the player has finished there |
|
|
371 | * actions, and is thus out of place. All we do here is bounds |
|
|
372 | * checking. |
|
|
373 | */ |
|
|
374 | if (pl->has_hit) |
|
|
375 | { |
|
|
376 | if (pl->ob->speed_left > pl->weapon_sp) |
|
|
377 | pl->ob->speed_left = pl->weapon_sp; |
|
|
378 | |
|
|
379 | /* This needs to be here - if the player is running, we need to |
|
|
380 | * clear this each tick, but new commands are not being received |
|
|
381 | * so execute_newserver_command() is never called |
|
|
382 | */ |
|
|
383 | pl->has_hit = 0; |
|
|
384 | } |
|
|
385 | else if (pl->ob->speed_left > pl->ob->speed) |
|
|
386 | pl->ob->speed_left = pl->ob->speed; |
209 | pl->ob->speed_left = pl->speed_left_save; |
387 | } |
|
|
388 | } |
|
|
389 | |
210 | |
390 | 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 |
391 | process_events () |
217 | process_events () |
392 | { |
218 | { |
393 | object *op; |
|
|
394 | |
|
|
395 | static object_ptr marker_; |
|
|
396 | |
|
|
397 | if (!marker_) |
|
|
398 | marker_ = object::create (); |
|
|
399 | |
|
|
400 | object *marker = marker_; |
|
|
401 | |
|
|
402 | process_players1 (); |
219 | process_players1 (); |
403 | |
220 | |
404 | marker->active_next = active_objects; |
221 | for_all_actives (op) |
405 | |
|
|
406 | if (marker->active_next) |
|
|
407 | marker->active_next->active_prev = marker; |
|
|
408 | |
|
|
409 | marker->active_prev = 0; |
|
|
410 | active_objects = marker; |
|
|
411 | |
|
|
412 | while (marker->active_next) |
|
|
413 | { |
222 | { |
414 | 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]; |
415 | |
230 | |
416 | /* Move marker forward - swap op and marker */ |
231 | prefetch (&next->flag , 0, 1); |
417 | op->active_prev = marker->active_prev; |
232 | prefetch (&next->speed , 0, 1); |
418 | |
233 | prefetch (&next->anim_speed, 0, 1); |
419 | if (op->active_prev) |
234 | prefetch (&next->contr , 0, 1); |
420 | op->active_prev->active_next = op; |
235 | } |
421 | else |
|
|
422 | active_objects = op; |
|
|
423 | |
|
|
424 | marker->active_next = op->active_next; |
|
|
425 | |
|
|
426 | if (marker->active_next) |
|
|
427 | marker->active_next->active_prev = marker; |
|
|
428 | |
|
|
429 | marker->active_prev = op; |
|
|
430 | op->active_next = marker; |
|
|
431 | |
236 | |
432 | /* Now process op */ |
237 | /* Now process op */ |
433 | if (QUERY_FLAG (op, FLAG_FREED)) |
238 | if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
434 | { |
239 | { |
435 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
240 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
436 | op->set_speed (0); |
241 | op->set_speed (0); |
437 | continue; |
242 | continue; |
438 | } |
243 | } |
439 | |
244 | |
440 | /* I've seen occasional crashes due to this - the object is removed, |
245 | if (expect_false (!op->has_active_speed ())) |
441 | * and thus the map it points to (last map it was on) may be bogus |
|
|
442 | * The real bug is to try to find out the cause of this - someone |
|
|
443 | * is probably calling remove_ob without either an insert_ob or |
|
|
444 | * free_object afterwards, leaving an object dangling. But I'd |
|
|
445 | * rather log this and continue on instead of crashing. |
|
|
446 | * Don't remove players - when a player quits, the object is in |
|
|
447 | * sort of a limbo, of removed, but something we want to keep |
|
|
448 | * around. |
|
|
449 | */ |
|
|
450 | if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY) |
|
|
451 | { |
|
|
452 | LOG (llevError, "BUG: process_events(): Removed object on list\n"); |
|
|
453 | char *dump = dump_object (op); |
|
|
454 | LOG (llevError, dump); |
|
|
455 | free (dump); |
|
|
456 | op->destroy (); |
|
|
457 | continue; |
|
|
458 | } |
246 | { |
459 | |
|
|
460 | if (!op->speed) |
|
|
461 | { |
|
|
462 | LOG (llevError, "BUG: process_events(): Object %s has no speed, " |
247 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
463 | "but is on active list\n", &op->arch->name); |
248 | "but is on active list\n", op->debug_desc (), op->speed); |
464 | op->set_speed (0); |
249 | op->set_speed (0); |
465 | continue; |
250 | continue; |
466 | } |
251 | } |
467 | |
252 | |
468 | if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) |
253 | if (expect_false (op->flag [FLAG_REMOVED])) |
469 | { |
254 | { |
470 | LOG (llevError, "BUG: process_events(): Object without map or " |
255 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
471 | "inventory is on active list: %s (%d)\n", &op->name, op->count); |
256 | op->debug_desc ()); |
472 | op->set_speed (0); |
257 | op->set_speed (0); |
473 | continue; |
258 | continue; |
474 | } |
259 | } |
475 | |
260 | |
476 | /* Animate the object. Bug or feature that anim_speed |
261 | /* Animate the object. Bug or feature that anim_speed |
477 | * is based on ticks, and not the creatures speed? |
262 | * is based on ticks, and not the creatures speed? |
478 | */ |
263 | */ |
479 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
264 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
480 | { |
265 | { |
481 | if ((op->type == PLAYER)) |
|
|
482 | animate_object (op, op->facing); |
|
|
483 | else |
|
|
484 | animate_object (op, op->direction); |
266 | animate_object (op, op->contr ? op->facing : op->direction); |
485 | |
|
|
486 | op->last_anim = 1; |
267 | op->last_anim = 1; |
487 | } |
268 | } |
488 | else |
269 | else |
489 | op->last_anim++; |
270 | ++op->last_anim; |
490 | |
271 | |
491 | if (op->speed_left > 0) |
272 | if (expect_false (op->speed_left > 0.f)) |
492 | { |
|
|
493 | #if 0 |
|
|
494 | /* I've seen occasional crashes in move_symptom() with it |
|
|
495 | * crashing because op is removed - add some debugging to |
|
|
496 | * track if it is removed at this point. |
|
|
497 | * This unfortunately is a bit too verbose it seems - not sure |
|
|
498 | * why - I think what happens is a map is freed or something and |
|
|
499 | * some objects get 'lost' - removed never to be reclaimed. |
|
|
500 | * removed objects generally shouldn't exist. |
|
|
501 | */ |
|
|
502 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
503 | { |
273 | { |
504 | LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null"); |
|
|
505 | } |
|
|
506 | #endif |
|
|
507 | --op->speed_left; |
274 | --op->speed_left; |
508 | process_object (op); |
275 | process_object (op); |
509 | |
|
|
510 | if (op->destroyed ()) |
|
|
511 | continue; |
|
|
512 | } |
276 | } |
513 | |
277 | |
514 | if (settings.casting_time == TRUE && op->casting_time > 0) |
278 | // this will destroy the speed_left value for players, but |
515 | op->casting_time--; |
279 | // process_players1 and ..2 save/restore the real value, |
516 | |
280 | // so we can avoid a costly test here. |
517 | if (op->speed_left <= 0) |
281 | op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
518 | op->speed_left += FABS (op->speed); |
|
|
519 | } |
282 | } |
520 | |
|
|
521 | /* Remove marker object from active list */ |
|
|
522 | if (marker->active_prev != NULL) |
|
|
523 | marker->active_prev->active_next = NULL; |
|
|
524 | else |
|
|
525 | active_objects = NULL; |
|
|
526 | |
283 | |
527 | process_players2 (); |
284 | process_players2 (); |
528 | } |
285 | } |
529 | |
286 | |
530 | /* clean up everything before exiting */ |
287 | /* clean up everything before exiting */ |
531 | void |
288 | void |
532 | emergency_save () |
289 | emergency_save () |
533 | { |
290 | { |
534 | LOG (llevDebug, "emergency save begin.\n"); |
291 | LOG (llevDebug, "emergency save begin.\n"); |
535 | |
292 | |
536 | LOG (llevDebug, "saving players.\n"); |
|
|
537 | for_all_players (pl) |
|
|
538 | pl->save (1); |
|
|
539 | |
|
|
540 | // for_all_players (pl) |
|
|
541 | // if (pl->ob) |
|
|
542 | // pl->ob->remove (); |
|
|
543 | |
|
|
544 | LOG (llevDebug, "saving maps.\n"); |
|
|
545 | maptile::emergency_save (); |
293 | cfperl_emergency_save (); |
546 | |
294 | |
547 | LOG (llevDebug, "saving book archive.\n"); |
295 | LOG (llevDebug, "saving book archive.\n"); |
548 | write_book_archive (); |
296 | write_book_archive (); |
549 | |
297 | |
550 | LOG (llevDebug, "emergency save done.\n"); |
298 | LOG (llevDebug, "emergency save done.\n"); |
551 | } |
299 | } |
552 | |
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 | |
553 | /* clean up everything before exiting */ |
320 | /* clean up everything before exiting */ |
554 | void |
321 | void |
555 | cleanup (bool make_core) |
322 | cleanup (const char *cause, bool make_core) |
556 | { |
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 | |
557 | LOG (llevDebug, "cleanup begin.\n"); |
332 | LOG (llevDebug, "cleanup begin.\n"); |
558 | |
333 | |
|
|
334 | if (init_done && !in_cleanup) |
|
|
335 | { |
559 | in_cleanup = true; |
336 | in_cleanup = true; |
560 | |
|
|
561 | if (init_done) |
|
|
562 | emergency_save (); |
337 | emergency_save (); |
|
|
338 | } |
|
|
339 | else |
|
|
340 | in_cleanup = true; |
563 | |
341 | |
564 | LOG (llevDebug, "running cleanup handlers.\n"); |
342 | LOG (llevDebug, "running cleanup handlers.\n"); |
565 | INVOKE_GLOBAL (CLEANUP); |
343 | INVOKE_GLOBAL (CLEANUP); |
566 | |
344 | |
567 | LOG (llevDebug, "cleanup done.\n"); |
345 | LOG (llevDebug, "cleanup done.\n"); |
568 | |
346 | |
|
|
347 | log_cleanup (); |
|
|
348 | |
569 | if (make_core) |
349 | if (make_core) |
570 | abort (); |
350 | cleanup_inform (cause, make_core); |
571 | else |
351 | else |
572 | _exit (0); |
|
|
573 | } |
|
|
574 | |
|
|
575 | void |
|
|
576 | leave (player *pl, int draw_exit) |
|
|
577 | { |
|
|
578 | if (pl) |
|
|
579 | { |
|
|
580 | if (pl->ob->type != DEAD_OBJECT) |
|
|
581 | { |
|
|
582 | /* If a hidden dm dropped connection do not create |
|
|
583 | * inconsistencies by showing that they have left the game |
|
|
584 | */ |
|
|
585 | if (!(QUERY_FLAG (pl->ob, FLAG_WIZ) && pl->ob->contr->hidden) |
|
|
586 | && draw_exit) |
|
|
587 | { |
|
|
588 | if (pl->ob->map) |
|
|
589 | { |
|
|
590 | INVOKE_PLAYER (LOGOUT, pl); |
|
|
591 | LOG (llevInfo, "LOGOUT: Player named %s from ip %s\n", &pl->ob->name, pl->ns->host); |
|
|
592 | } |
|
|
593 | |
|
|
594 | char buf[MAX_BUF]; |
|
|
595 | |
|
|
596 | sprintf (buf, "%s left the game.", &pl->ob->name); |
|
|
597 | new_draw_info (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, 0, buf); |
|
|
598 | } |
|
|
599 | |
|
|
600 | pl->ob->remove (); |
|
|
601 | pl->ob->type = DEAD_OBJECT; /* To avoid problems with inventory window */ |
|
|
602 | } |
|
|
603 | |
|
|
604 | /* We do this so that the socket handling routine can do the final |
|
|
605 | * cleanup. We also leave that loop to actually handle the freeing |
|
|
606 | * of the data. |
|
|
607 | */ |
|
|
608 | if (pl->ns) |
|
|
609 | pl->ns->destroy (); |
|
|
610 | |
|
|
611 | } |
352 | { |
612 | } |
353 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting."); |
613 | |
354 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); |
614 | int |
355 | client::flush_sockets (); |
615 | forbid_play (void) |
|
|
616 | { |
|
|
617 | #if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE) |
|
|
618 | char buf[MAX_BUF], day[MAX_BUF]; |
|
|
619 | FILE *fp; |
|
|
620 | time_t clock; |
|
|
621 | struct tm *tm; |
|
|
622 | int i, start, stop, forbit = 0, comp; |
|
|
623 | |
|
|
624 | clock = time (NULL); |
|
|
625 | tm = (struct tm *) localtime (&clock); |
|
|
626 | |
|
|
627 | sprintf (buf, "%s/%s", settings.confdir, PERM_FILE); |
|
|
628 | if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
|
|
629 | return 0; |
|
|
630 | |
|
|
631 | while (fgets (buf, MAX_BUF, fp)) |
|
|
632 | { |
356 | } |
633 | if (buf[0] == '#') |
|
|
634 | continue; |
|
|
635 | if (!strncmp (buf, "msg", 3)) |
|
|
636 | { |
|
|
637 | if (forbit) |
|
|
638 | while (fgets (buf, MAX_BUF, fp)) /* print message */ |
|
|
639 | fputs (buf, logfile); |
|
|
640 | break; |
|
|
641 | |
357 | |
642 | } |
358 | cfperl_cleanup (make_core); |
643 | else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
359 | _exit (make_core); |
644 | { |
|
|
645 | LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
|
|
646 | continue; |
|
|
647 | } |
|
|
648 | |
|
|
649 | for (i = 0; i < 7; i++) |
|
|
650 | { |
|
|
651 | if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop)) |
|
|
652 | forbit = 1; |
|
|
653 | } |
|
|
654 | } |
|
|
655 | |
|
|
656 | close_and_delete (fp, comp); |
|
|
657 | |
|
|
658 | return forbit; |
|
|
659 | #else |
|
|
660 | return 0; |
|
|
661 | #endif |
|
|
662 | } |
360 | } |
663 | |
361 | |
664 | /* |
362 | /* |
665 | * 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. |
666 | * 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 |
667 | * 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. |
668 | * 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 |
669 | * 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 |
670 | * 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 |
… | |
… | |
672 | * done on the same tick, but that will happen very infrequently |
370 | * done on the same tick, but that will happen very infrequently |
673 | * |
371 | * |
674 | * 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 |
675 | * doing the various things. |
373 | * doing the various things. |
676 | */ |
374 | */ |
677 | |
375 | static void |
678 | extern unsigned long todtick; |
|
|
679 | |
|
|
680 | void |
|
|
681 | do_specials (void) |
376 | do_specials (void) |
682 | { |
377 | { |
683 | if (!(pticks % PTICKS_PER_CLOCK)) |
|
|
684 | tick_the_clock (); |
|
|
685 | |
|
|
686 | if (!(pticks % 7)) |
|
|
687 | shstr::gc (); |
378 | shstr::gc (); |
|
|
379 | archetype::gc (); |
688 | |
380 | |
|
|
381 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
|
|
382 | maptile::adjust_daylight (); |
|
|
383 | |
689 | if (!(pticks % 2503)) |
384 | if (expect_false (!(pticks % 2503))) |
690 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
385 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
691 | |
386 | |
692 | if (!(pticks % 5003)) |
387 | if (expect_false (!(pticks % 5003))) |
693 | write_book_archive (); |
388 | write_book_archive (); |
694 | |
389 | |
695 | if (!(pticks % 5009)) |
390 | if (expect_false (!(pticks % 5009))) |
696 | clean_friendly_list (); |
391 | clean_friendly_list (); |
697 | |
392 | |
698 | if (!(pticks % 5011)) |
393 | if (expect_false (!(pticks % 5011))) |
699 | obsolete_parties (); |
394 | obsolete_parties (); |
700 | |
395 | |
701 | if (!(pticks % 12503)) |
396 | if (expect_false (!(pticks % 12503))) |
702 | fix_luck (); |
397 | fix_luck (); |
703 | } |
398 | } |
704 | |
399 | |
705 | void |
400 | void |
706 | server_tick () |
401 | server_tick () |
707 | { |
402 | { |
708 | // first do the user visible stuff |
403 | // first do the user visible stuff |
709 | doeric_server (); |
|
|
710 | INVOKE_GLOBAL (CLOCK); |
404 | INVOKE_GLOBAL (CLOCK); |
711 | process_events (); /* "do" something with objects with speed */ |
405 | process_events (); // "do" something with objects with speed |
712 | flush_sockets (); |
406 | client::clock (); // draw client maps etc. |
713 | |
407 | |
714 | // then do some bookkeeping, should not really be here |
408 | // then do some bookkeeping, should not really be here |
715 | do_specials (); /* Routines called from time to time. */ |
409 | do_specials (); /* Routines called from time to time. */ |
716 | attachable::check_mortals (); |
410 | attachable::check_mortals (); |
717 | |
411 | |
718 | ++pticks; |
412 | ++pticks; |
719 | } |
413 | } |
720 | |
414 | |
|
|
415 | // normal main |
721 | int |
416 | int |
722 | main (int argc, char **argv) |
417 | main (int argc, char **argv) |
723 | { |
418 | { |
724 | settings.argc = argc; |
419 | settings.argc = argc; |
725 | settings.argv = argv; |
420 | settings.argv = argv; |
|
|
421 | |
|
|
422 | rndm.seed (time (0)); |
|
|
423 | g_thread_init (0); // for the slice allocator only |
726 | |
424 | |
727 | init (argc, argv); |
425 | init (argc, argv); |
728 | |
|
|
729 | initPlugins (); |
|
|
730 | |
426 | |
731 | for (;;) |
427 | for (;;) |
732 | cfperl_main (); |
428 | cfperl_main (); |
733 | |
|
|
734 | // unreached |
|
|
735 | cleanup (); |
|
|
736 | |
|
|
737 | return 0; |
|
|
738 | } |
429 | } |
|
|
430 | |