1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your 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 GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
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> |
38 | |
31 | |
39 | #include <../random_maps/random_map.h> |
32 | #include <../random_maps/random_map.h> |
40 | #include <../random_maps/rproto.h> |
33 | #include <../random_maps/rproto.h> |
… | |
… | |
45 | }; |
38 | }; |
46 | |
39 | |
47 | void |
40 | void |
48 | version (object *op) |
41 | version (object *op) |
49 | { |
42 | { |
50 | if (op != NULL) |
43 | if (op) |
51 | clear_win_info (op); |
44 | clear_win_info (op); |
52 | |
45 | |
53 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire v%s", VERSION); |
46 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ 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 | |
47 | |
61 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
48 | 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>"); |
49 | 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>"); |
50 | 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>"); |
51 | new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); |
|
|
52 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
53 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:"); |
65 | new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>"); |
54 | 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>"); |
55 | 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>"); |
56 | 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>"); |
57 | 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>"); |
58 | 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>"); |
59 | 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>"); |
60 | 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>"); |
61 | 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>"); |
62 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>"); |
74 | new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>"); |
63 | 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>"); |
64 | 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>"); |
65 | 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>"); |
66 | 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>"); |
67 | new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>"); |
… | |
… | |
100 | new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>"); |
89 | 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>"); |
90 | 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>"); |
91 | 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>"); |
92 | 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"); |
93 | new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n"); |
105 | |
94 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
106 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
95 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
107 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
96 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
108 | new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>"); |
97 | 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>"); |
98 | 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>"); |
99 | 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>"); |
100 | new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); |
|
|
101 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
112 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
102 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
113 | } |
103 | } |
114 | |
104 | |
115 | /* This is a basic little function to put the player back to his |
105 | /* This is a basic little function to put the player back to his |
116 | * savebed. We do some error checking - its possible that the |
106 | * savebed. We do some error checking - its possible that the |
… | |
… | |
136 | * the function that calls this should figure them out. |
126 | * the function that calls this should figure them out. |
137 | */ |
127 | */ |
138 | void |
128 | void |
139 | object::enter_map (maptile *newmap, int x, int y) |
129 | object::enter_map (maptile *newmap, int x, int y) |
140 | { |
130 | { |
141 | if (!newmap->load ()) |
131 | if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) |
142 | return; |
132 | return; |
143 | |
133 | |
144 | if (out_of_map (newmap, x, y)) |
134 | if (out_of_map (newmap, x, y)) |
145 | { |
135 | { |
146 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
136 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
… | |
… | |
152 | &newmap->path, x, y, newmap->width, newmap->height); |
142 | &newmap->path, x, y, newmap->width, newmap->height); |
153 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
143 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
154 | return; |
144 | return; |
155 | } |
145 | } |
156 | } |
146 | } |
|
|
147 | |
|
|
148 | if (contr && map != newmap && map) |
|
|
149 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
|
|
150 | return; |
|
|
151 | |
|
|
152 | // remove, so stupid ob_locked does not trigger a failure |
|
|
153 | remove (); |
157 | |
154 | |
158 | /* try to find a spot for the player */ |
155 | /* try to find a spot for the player */ |
159 | if (ob_blocked (this, newmap, x, y)) |
156 | if (ob_blocked (this, newmap, x, y)) |
160 | { /* First choice blocked */ |
157 | { /* First choice blocked */ |
161 | /* We try to find a spot for the player, starting closest in. |
158 | /* We try to find a spot for the player, starting closest in. |
… | |
… | |
182 | else |
179 | else |
183 | /* not much we can do in this case. */ |
180 | /* 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); |
181 | 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 | } |
182 | } |
186 | |
183 | |
187 | if (map) |
184 | if (contr && map != newmap) |
188 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
185 | { |
189 | return; |
|
|
190 | |
|
|
191 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
186 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
192 | return; |
187 | return; |
193 | |
188 | |
194 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
189 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
195 | return; |
190 | return; |
196 | |
191 | } |
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 | |
192 | |
202 | this->x = x; |
193 | this->x = x; |
203 | this->y = y; |
194 | this->y = y; |
204 | map = newmap; |
195 | map = newmap; |
205 | |
196 | |
206 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
197 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
207 | |
198 | |
208 | newmap->timeout = 0; |
|
|
209 | enemy = NULL; |
199 | enemy = 0; |
210 | |
200 | |
211 | if (contr) |
201 | if (contr) |
212 | { |
202 | { |
213 | strcpy (contr->maplevel, newmap->path); |
203 | contr->maplevel = newmap->path; |
214 | contr->count = 0; |
204 | contr->count = 0; |
215 | } |
205 | } |
216 | |
206 | |
217 | /* Update any golems */ |
207 | /* Update any golems */ |
218 | if (type == PLAYER && contr->ranges[range_golem]) |
208 | if (type == PLAYER) |
219 | { |
209 | 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 | { |
210 | { |
227 | remove_friendly_object (contr->ranges[range_golem]); |
211 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
228 | contr->ranges[range_golem]->destroy (); |
212 | |
229 | contr->ranges[range_golem] = 0; |
213 | if (i < 0) |
230 | } |
214 | golem->destroy (); |
231 | else |
215 | else |
232 | { |
|
|
233 | for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more) |
|
|
234 | { |
216 | { |
235 | tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.x); |
217 | 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); |
218 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
237 | tmp->map = newmap; |
|
|
238 | } |
219 | } |
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 | } |
220 | } |
244 | } |
|
|
245 | |
|
|
246 | direction = 0; |
|
|
247 | |
221 | |
248 | /* since the players map is already loaded, we don't need to worry |
222 | /* since the players map is already loaded, we don't need to worry |
249 | * about pending objects. |
223 | * about pending objects. |
250 | */ |
224 | */ |
251 | remove_all_pets (newmap); |
225 | 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 | } |
226 | } |
291 | |
227 | |
292 | /* process_players1 and process_players2 do all the player related stuff. |
228 | /* 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 |
229 | * 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 |
230 | * extent for debugging as well as to get a better idea of the time used |
… | |
… | |
297 | * is needed after the players have been updated. |
233 | * is needed after the players have been updated. |
298 | */ |
234 | */ |
299 | static void |
235 | static void |
300 | process_players1 () |
236 | process_players1 () |
301 | { |
237 | { |
302 | int flag; |
|
|
303 | |
|
|
304 | /* Basically, we keep looping until all the players have done their actions. */ |
238 | /* Basically, we keep looping until all the players have done their actions. */ |
305 | for (flag = 1; flag != 0;) |
239 | for (int flag = 1; flag != 0;) |
306 | { |
240 | { |
307 | flag = 0; |
241 | flag = 0; |
308 | for_all_players (pl) |
242 | for_all_players (pl) |
309 | { |
243 | { |
310 | pl->refcnt_chk (); |
244 | pl->refcnt_chk (); |
311 | |
245 | |
312 | if (!pl->ob || !pl->ns) |
246 | if (!pl->ob || !pl->ns || !pl->ob->active) |
313 | continue; |
247 | continue; |
314 | |
248 | |
315 | if (pl->ob->speed_left > 0) |
249 | if (pl->ob->speed_left > 0 && pl->ns) |
316 | if (handle_newcs_player (pl->ob)) |
250 | if (handle_newcs_player (pl->ob)) |
317 | flag = 1; |
251 | flag = 1; |
318 | |
252 | |
319 | /* If the player is not actively playing, don't make a |
253 | /* If the player is not actively playing, don't make a |
320 | * backup save - nothing to save anyway. Plus, the |
254 | * backup save - nothing to save anyway. Plus, the |
… | |
… | |
322 | * player quits - they exist for purposes of tracking on the map, |
256 | * player quits - they exist for purposes of tracking on the map, |
323 | * but don't actually reside on any actual map. |
257 | * but don't actually reside on any actual map. |
324 | */ |
258 | */ |
325 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
259 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
326 | continue; |
260 | 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 | } |
|
|
337 | #endif |
|
|
338 | } /* end of for loop for all the players */ |
261 | } /* end of for loop for all the players */ |
339 | } /* for flag */ |
262 | } /* for flag */ |
340 | |
263 | |
341 | for_all_players (pl) |
264 | for_all_players (pl) |
342 | { |
265 | { |
343 | if (!pl->ob || !pl->ns) |
266 | if (!pl->ob || !pl->ns || !pl->ob->active) |
344 | continue; |
267 | continue; |
345 | |
268 | |
346 | if (settings.casting_time) |
269 | if (settings.casting_time) |
347 | { |
270 | { |
348 | if (pl->ob->casting_time > 0) |
271 | if (pl->ob->casting_time > 0) |
… | |
… | |
388 | } |
311 | } |
389 | |
312 | |
390 | void |
313 | void |
391 | process_events () |
314 | process_events () |
392 | { |
315 | { |
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 (); |
316 | process_players1 (); |
403 | |
317 | |
404 | marker->active_next = active_objects; |
318 | 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 | { |
319 | { |
414 | op = marker->active_next; |
|
|
415 | |
|
|
416 | /* Move marker forward - swap op and marker */ |
|
|
417 | op->active_prev = marker->active_prev; |
|
|
418 | |
|
|
419 | if (op->active_prev) |
|
|
420 | op->active_prev->active_next = op; |
|
|
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 | |
|
|
432 | /* Now process op */ |
320 | /* Now process op */ |
433 | if (QUERY_FLAG (op, FLAG_FREED)) |
321 | if (QUERY_FLAG (op, FLAG_FREED)) |
434 | { |
322 | { |
435 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
323 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
436 | op->set_speed (0); |
324 | op->set_speed (0); |
437 | continue; |
325 | continue; |
438 | } |
326 | } |
439 | |
327 | |
440 | /* I've seen occasional crashes due to this - the object is removed, |
328 | if (!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 | } |
329 | { |
459 | |
|
|
460 | if (!op->speed) |
|
|
461 | { |
|
|
462 | LOG (llevError, "BUG: process_events(): Object %s has no speed, " |
330 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
463 | "but is on active list\n", &op->arch->name); |
331 | "but is on active list\n", op->debug_desc (), op->speed); |
464 | op->set_speed (0); |
332 | op->set_speed (0); |
465 | continue; |
333 | continue; |
466 | } |
334 | } |
467 | |
335 | |
468 | if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) |
336 | if (op->flag [FLAG_REMOVED]) |
469 | { |
337 | { |
470 | LOG (llevError, "BUG: process_events(): Object without map or " |
338 | 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); |
339 | op->debug_desc ()); |
472 | op->set_speed (0); |
340 | op->set_speed (0); |
473 | continue; |
341 | continue; |
474 | } |
342 | } |
475 | |
343 | |
476 | /* Animate the object. Bug or feature that anim_speed |
344 | /* Animate the object. Bug or feature that anim_speed |
477 | * is based on ticks, and not the creatures speed? |
345 | * is based on ticks, and not the creatures speed? |
478 | */ |
346 | */ |
479 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
347 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
480 | { |
348 | { |
481 | if ((op->type == PLAYER)) |
349 | animate_object (op, op->type == PLAYER ? op->facing : op->direction); |
482 | animate_object (op, op->facing); |
|
|
483 | else |
|
|
484 | animate_object (op, op->direction); |
|
|
485 | |
350 | |
486 | op->last_anim = 1; |
351 | op->last_anim = 1; |
487 | } |
352 | } |
488 | else |
353 | else |
489 | op->last_anim++; |
354 | op->last_anim++; |
… | |
… | |
516 | |
381 | |
517 | if (op->speed_left <= 0) |
382 | if (op->speed_left <= 0) |
518 | op->speed_left += FABS (op->speed); |
383 | op->speed_left += FABS (op->speed); |
519 | } |
384 | } |
520 | |
385 | |
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 | |
|
|
527 | process_players2 (); |
386 | process_players2 (); |
528 | } |
387 | } |
529 | |
388 | |
530 | /* clean up everything before exiting */ |
389 | /* clean up everything before exiting */ |
531 | void |
390 | void |
532 | emergency_save () |
391 | emergency_save () |
533 | { |
392 | { |
534 | LOG (llevDebug, "emergency save begin.\n"); |
393 | LOG (llevDebug, "emergency save begin.\n"); |
535 | |
394 | |
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 (); |
395 | cfperl_emergency_save (); |
546 | |
396 | |
547 | LOG (llevDebug, "saving book archive.\n"); |
397 | LOG (llevDebug, "saving book archive.\n"); |
548 | write_book_archive (); |
398 | write_book_archive (); |
549 | |
399 | |
550 | LOG (llevDebug, "emergency save done.\n"); |
400 | LOG (llevDebug, "emergency save done.\n"); |
551 | } |
401 | } |
552 | |
402 | |
|
|
403 | // send all clients some informational text |
|
|
404 | static void |
|
|
405 | cleanup_inform (const char *cause, bool make_core) |
|
|
406 | { |
|
|
407 | int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
|
|
408 | |
|
|
409 | new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); |
|
|
410 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s\n", cause); |
|
|
411 | |
|
|
412 | if (make_core) |
|
|
413 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.\n"); |
|
|
414 | else |
|
|
415 | new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.\n"); |
|
|
416 | |
|
|
417 | new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); |
|
|
418 | |
|
|
419 | flush_sockets (); |
|
|
420 | } |
|
|
421 | |
553 | /* clean up everything before exiting */ |
422 | /* clean up everything before exiting */ |
554 | void |
423 | void |
555 | cleanup (bool make_core) |
424 | cleanup (const char *cause, bool make_core) |
556 | { |
425 | { |
|
|
426 | if (make_core) |
|
|
427 | fork_abort (cause); |
|
|
428 | |
|
|
429 | LOG (llevError, "cleanup cause: %s\n", cause); |
|
|
430 | |
|
|
431 | if (!make_core) |
|
|
432 | cleanup_inform (cause, make_core); |
|
|
433 | |
557 | LOG (llevDebug, "cleanup begin.\n"); |
434 | LOG (llevDebug, "cleanup begin.\n"); |
558 | |
435 | |
|
|
436 | if (init_done && !in_cleanup) |
|
|
437 | { |
559 | in_cleanup = true; |
438 | in_cleanup = true; |
560 | |
|
|
561 | if (init_done) |
|
|
562 | emergency_save (); |
439 | emergency_save (); |
|
|
440 | } |
|
|
441 | else |
|
|
442 | in_cleanup = true; |
563 | |
443 | |
564 | LOG (llevDebug, "running cleanup handlers.\n"); |
444 | LOG (llevDebug, "running cleanup handlers.\n"); |
565 | INVOKE_GLOBAL (CLEANUP); |
445 | INVOKE_GLOBAL (CLEANUP); |
566 | |
446 | |
567 | LOG (llevDebug, "cleanup done.\n"); |
447 | LOG (llevDebug, "cleanup done.\n"); |
568 | |
448 | |
569 | if (make_core) |
449 | if (make_core) |
570 | abort (); |
450 | { |
|
|
451 | cleanup_inform (cause, make_core); |
|
|
452 | cfperl_cleanup (make_core); |
|
|
453 | _exit (1); |
|
|
454 | } |
571 | else |
455 | else |
|
|
456 | { |
|
|
457 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.\n"); |
|
|
458 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE "\n"); |
|
|
459 | flush_sockets (); |
|
|
460 | cfperl_cleanup (make_core); |
572 | _exit (0); |
461 | _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 | } |
462 | } |
612 | } |
463 | } |
613 | |
464 | |
614 | int |
465 | int |
615 | forbid_play (void) |
466 | forbid_play (void) |
… | |
… | |
630 | |
481 | |
631 | while (fgets (buf, MAX_BUF, fp)) |
482 | while (fgets (buf, MAX_BUF, fp)) |
632 | { |
483 | { |
633 | if (buf[0] == '#') |
484 | if (buf[0] == '#') |
634 | continue; |
485 | continue; |
|
|
486 | |
635 | if (!strncmp (buf, "msg", 3)) |
487 | if (!strncmp (buf, "msg", 3)) |
636 | { |
488 | { |
637 | if (forbit) |
489 | if (forbit) |
638 | while (fgets (buf, MAX_BUF, fp)) /* print message */ |
490 | while (fgets (buf, MAX_BUF, fp)) /* print message */ |
639 | fputs (buf, logfile); |
491 | fputs (buf, logfile); |
640 | break; |
492 | break; |
641 | |
|
|
642 | } |
493 | } |
643 | else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
494 | else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
644 | { |
495 | { |
645 | LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
496 | LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
646 | continue; |
497 | continue; |
… | |
… | |
660 | return 0; |
511 | return 0; |
661 | #endif |
512 | #endif |
662 | } |
513 | } |
663 | |
514 | |
664 | /* |
515 | /* |
665 | * do_specials() is a collection of functions to call from time to time. |
516 | * 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 |
517 | * 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. |
518 | * 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 |
519 | * 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 |
520 | * 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 |
521 | * 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 |
523 | * done on the same tick, but that will happen very infrequently |
673 | * |
524 | * |
674 | * I also think this code makes it easier to see how often we really are |
525 | * I also think this code makes it easier to see how often we really are |
675 | * doing the various things. |
526 | * doing the various things. |
676 | */ |
527 | */ |
677 | |
|
|
678 | extern unsigned long todtick; |
|
|
679 | |
|
|
680 | void |
528 | void |
681 | do_specials (void) |
529 | do_specials (void) |
682 | { |
530 | { |
683 | if (!(pticks % PTICKS_PER_CLOCK)) |
531 | if (!(pticks % TICKS_PER_HOUR)) |
684 | tick_the_clock (); |
532 | adjust_daylight (); |
685 | |
533 | |
686 | if (!(pticks % 7)) |
534 | if (!(pticks % 7)) |
687 | shstr::gc (); |
535 | shstr::gc (); |
688 | |
536 | |
689 | if (!(pticks % 2503)) |
537 | if (!(pticks % 2503)) |
… | |
… | |
716 | attachable::check_mortals (); |
564 | attachable::check_mortals (); |
717 | |
565 | |
718 | ++pticks; |
566 | ++pticks; |
719 | } |
567 | } |
720 | |
568 | |
|
|
569 | #if 0 |
|
|
570 | // used fro benchmarking (x86/amd64-specific) |
|
|
571 | typedef unsigned long tval; |
|
|
572 | typedef unsigned long long stamp64; |
|
|
573 | |
|
|
574 | extern inline tval |
|
|
575 | stamp (void) |
|
|
576 | { |
|
|
577 | tval tsc; |
|
|
578 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
579 | |
|
|
580 | return tsc; |
|
|
581 | } |
|
|
582 | |
|
|
583 | extern inline tval |
|
|
584 | measure (tval t) |
|
|
585 | { |
|
|
586 | tval tsc; |
|
|
587 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
588 | |
|
|
589 | if (tsc > t) |
|
|
590 | return tsc - t; |
|
|
591 | else |
|
|
592 | return t - tsc; |
|
|
593 | } |
|
|
594 | |
721 | int |
595 | int |
722 | main (int argc, char **argv) |
596 | main (int argc, char **argv) |
723 | { |
597 | { |
|
|
598 | rand_gen rg(0); |
|
|
599 | tval fastest = 0x7fffffff; |
|
|
600 | for (int loop = 10000; loop--; ) |
|
|
601 | { |
|
|
602 | tval s = stamp (); |
|
|
603 | volatile int i = rg.get_int(25); |
|
|
604 | fastest = min (fastest, measure (s)); |
|
|
605 | } |
|
|
606 | |
|
|
607 | //printf ("fastest %d\n", fastest); |
|
|
608 | for (int i = 0; i < 1024*1024*3; ++i) |
|
|
609 | { |
|
|
610 | char c = rg.get_int (256); |
|
|
611 | write (2, &c, 1); |
|
|
612 | } |
|
|
613 | } |
|
|
614 | |
|
|
615 | #else |
|
|
616 | |
|
|
617 | // normal main |
|
|
618 | int |
|
|
619 | main (int argc, char **argv) |
|
|
620 | { |
724 | settings.argc = argc; |
621 | settings.argc = argc; |
725 | settings.argv = argv; |
622 | settings.argv = argv; |
726 | |
623 | |
727 | init (argc, argv); |
624 | init (argc, argv); |
728 | |
625 | |
729 | initPlugins (); |
626 | initPlugins (); |
730 | |
627 | |
731 | for (;;) |
628 | for (;;) |
732 | cfperl_main (); |
629 | cfperl_main (); |
733 | |
|
|
734 | // unreached |
|
|
735 | cleanup (); |
|
|
736 | |
|
|
737 | return 0; |
|
|
738 | } |
630 | } |
|
|
631 | #endif |
|
|
632 | |