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 |
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 3 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, see <http://www.gnu.org/licenses/>. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
20 | |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
|
|
22 | */ |
22 | */ |
23 | |
23 | |
24 | #include <global.h> |
24 | #include <global.h> |
25 | #include <object.h> |
25 | #include <object.h> |
26 | #include <tod.h> |
26 | #include <tod.h> |
27 | |
27 | |
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> |
28 | #include <sproto.h> |
37 | #include <time.h> |
29 | #include <time.h> |
|
|
30 | |
|
|
31 | #include <glib.h> |
38 | |
32 | |
39 | #include <../random_maps/random_map.h> |
33 | #include <../random_maps/random_map.h> |
40 | #include <../random_maps/rproto.h> |
34 | #include <../random_maps/rproto.h> |
41 | #include "path.h" |
35 | #include "path.h" |
42 | |
36 | |
… | |
… | |
45 | }; |
39 | }; |
46 | |
40 | |
47 | void |
41 | void |
48 | version (object *op) |
42 | version (object *op) |
49 | { |
43 | { |
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); |
44 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION); |
54 | |
45 | |
55 | /* If in a socket, don't print out the list of authors. It confuses the |
46 | #if 0 |
56 | * crossclient program. |
|
|
57 | */ |
|
|
58 | if (op == NULL) |
|
|
59 | return; |
|
|
60 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
47 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
|
|
48 | new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); |
|
|
49 | new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); |
|
|
50 | new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); |
|
|
51 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
52 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:"); |
61 | new_draw_info (NDI_UNIQUE, 0, op, "mwedel@sonic.net (Mark Wedel)"); |
53 | new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>"); |
62 | new_draw_info (NDI_UNIQUE, 0, op, "frankj@ifi.uio.no (Frank Tore Johansen)"); |
54 | new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>"); |
63 | new_draw_info (NDI_UNIQUE, 0, op, "kjetilho@ifi.uio.no (Kjetil Torgrim Homme)"); |
55 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>"); |
64 | new_draw_info (NDI_UNIQUE, 0, op, "tvangod@ecst.csuchico.edu (Tyler Van Gorder)"); |
56 | new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>"); |
65 | new_draw_info (NDI_UNIQUE, 0, op, "elmroth@cd.chalmers.se (Tony Elmroth)"); |
57 | new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>"); |
66 | new_draw_info (NDI_UNIQUE, 0, op, "dougal.scott@fcit.monasu.edu.au (Dougal Scott)"); |
58 | new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>"); |
67 | new_draw_info (NDI_UNIQUE, 0, op, "wchuang@athena.mit.edu (William)"); |
59 | new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>"); |
68 | new_draw_info (NDI_UNIQUE, 0, op, "ftww@cs.su.oz.au (Geoff Bailey)"); |
60 | new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>"); |
69 | new_draw_info (NDI_UNIQUE, 0, op, "jorgens@flipper.pvv.unit.no (Kjetil Wiekhorst Jxrgensen)"); |
61 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>"); |
70 | new_draw_info (NDI_UNIQUE, 0, op, "c.blackwood@rdt.monash.edu.au (Cameron Blackwood)"); |
62 | new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>"); |
71 | new_draw_info (NDI_UNIQUE, 0, op, "jtraub+@cmu.edu (Joseph L. Traub)"); |
63 | new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>"); |
72 | new_draw_info (NDI_UNIQUE, 0, op, "rgg@aaii.oz.au (Rupert G. Goldie)"); |
64 | new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>"); |
73 | new_draw_info (NDI_UNIQUE, 0, op, "eanders+@cmu.edu (Eric A. Anderson)"); |
65 | new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>"); |
74 | new_draw_info (NDI_UNIQUE, 0, op, "eneq@Prag.DoCS.UU.SE (Rickard Eneqvist)"); |
66 | new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>"); |
75 | new_draw_info (NDI_UNIQUE, 0, op, "Jarkko.Sonninen@lut.fi (Jarkko Sonninen)"); |
67 | new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>"); |
76 | new_draw_info (NDI_UNIQUE, 0, op, "kholland@sunlab.cit.cornell.du (Karl Holland)"); |
68 | new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>"); |
77 | new_draw_info (NDI_UNIQUE, 0, op, "vick@bern.docs.uu.se (Mikael Lundgren)"); |
69 | new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>"); |
78 | new_draw_info (NDI_UNIQUE, 0, op, "mol@meryl.csd.uu.se (Mikael Olsson)"); |
70 | new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>"); |
79 | new_draw_info (NDI_UNIQUE, 0, op, "Tero.Haatanen@lut.fi (Tero Haatanen)"); |
71 | new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>"); |
80 | new_draw_info (NDI_UNIQUE, 0, op, "ylitalo@student.docs.uu.se (Lasse Ylitalo)"); |
72 | new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>"); |
81 | new_draw_info (NDI_UNIQUE, 0, op, "anipa@guru.magic.fi (Niilo Neuvo)"); |
73 | new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>"); |
82 | new_draw_info (NDI_UNIQUE, 0, op, "mta@modeemi.cs.tut.fi (Markku J{rvinen)"); |
74 | new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>"); |
83 | new_draw_info (NDI_UNIQUE, 0, op, "meunier@inf.enst.fr (Sylvain Meunier)"); |
75 | new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>"); |
84 | new_draw_info (NDI_UNIQUE, 0, op, "jfosback@darmok.uoregon.edu (Jason Fosback)"); |
76 | new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>"); |
85 | new_draw_info (NDI_UNIQUE, 0, op, "cedman@capitalist.princeton.edu (Carl Edman)"); |
77 | new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>"); |
86 | new_draw_info (NDI_UNIQUE, 0, op, "henrich@crh.cl.msu.edu (Charles Henrich)"); |
78 | new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>"); |
87 | new_draw_info (NDI_UNIQUE, 0, op, "schmid@fb3-s7.math.tu-berlin.de (Gregor Schmid)"); |
79 | new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>"); |
88 | new_draw_info (NDI_UNIQUE, 0, op, "quinet@montefiore.ulg.ac.be (Raphael Quinet)"); |
80 | new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>"); |
89 | new_draw_info (NDI_UNIQUE, 0, op, "jam@modeemi.cs.tut.fi (Jari Vanhala)"); |
81 | new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>"); |
90 | new_draw_info (NDI_UNIQUE, 0, op, "kivinen@joker.cs.hut.fi (Tero Kivinen)"); |
82 | new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>"); |
91 | new_draw_info (NDI_UNIQUE, 0, op, "peterm@soda.berkeley.edu (Peter Mardahl)"); |
83 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>"); |
92 | new_draw_info (NDI_UNIQUE, 0, op, "matt@cs.odu.edu (Matthew Zeher)"); |
84 | new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>"); |
93 | new_draw_info (NDI_UNIQUE, 0, op, "srt@sun-dimas.aero.org (Scott R. Turner)"); |
85 | new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>"); |
94 | new_draw_info (NDI_UNIQUE, 0, op, "huma@netcom.com (Ben Fennema)"); |
86 | new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>"); |
95 | new_draw_info (NDI_UNIQUE, 0, op, "njw@cs.city.ac.uk (Nick Williams)"); |
87 | new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>"); |
96 | new_draw_info (NDI_UNIQUE, 0, op, "Wacren@Gin.ObsPM.Fr (Laurent Wacrenier)"); |
88 | new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>"); |
97 | new_draw_info (NDI_UNIQUE, 0, op, "thomas@astro.psu.edu (Brian Thomas)"); |
89 | new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>"); |
98 | new_draw_info (NDI_UNIQUE, 0, op, "jsm@axon.ksc.nasa.gov (John Steven Moerk)"); |
90 | new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>"); |
99 | new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David [david.delbecq@mailandnews.com]"); |
91 | new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>"); |
100 | new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann [yann.chachkoff@mailandnews.com]\n"); |
92 | new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n"); |
|
|
93 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
101 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
94 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
102 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
95 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
103 | new_draw_info (NDI_UNIQUE, 0, op, "David Gervais [david_eg@mail.com]"); |
96 | new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>"); |
104 | new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura [ita@gold.koma.jaeri.go.jp]"); |
97 | new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>"); |
105 | new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner [hansjoerg.malthaner@danet.de]"); |
98 | new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>"); |
106 | new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg [maxmc@telia.com]"); |
99 | new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); |
|
|
100 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
107 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
101 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
108 | } |
|
|
109 | |
|
|
110 | void |
|
|
111 | info_keys (object *op) |
|
|
112 | { |
|
|
113 | clear_win_info (op); |
|
|
114 | new_draw_info (NDI_UNIQUE, 0, op, "Push `hjklynub' to walk in a direction."); |
|
|
115 | new_draw_info (NDI_UNIQUE, 0, op, "Shift + dir = fire, Ctrl + dir = run"); |
|
|
116 | new_draw_info (NDI_UNIQUE, 0, op, "(To fire at yourself, hit `.'"); |
|
|
117 | new_draw_info (NDI_UNIQUE, 0, op, "To attack, walk into the monsters."); |
|
|
118 | new_draw_info (NDI_UNIQUE, 0, op, "\" = speak ' = extended command"); |
|
|
119 | new_draw_info (NDI_UNIQUE, 0, op, "i = inventory , = get : = look"); |
|
|
120 | new_draw_info (NDI_UNIQUE, 0, op, "<> = rotate d = drop ? = help"); |
|
|
121 | new_draw_info (NDI_UNIQUE, 0, op, "a = apply A = apply below t = throw"); |
|
|
122 | new_draw_info (NDI_UNIQUE, 0, op, "e = examine E = exa below @ = autopick"); |
|
|
123 | new_draw_info (NDI_UNIQUE, 0, op, "C = configure s = brace v = version"); |
|
|
124 | new_draw_info (NDI_UNIQUE, 0, op, "+- = change range <tab> = browse spells"); |
|
|
125 | new_draw_info (NDI_UNIQUE, 0, op, "x = change inventory type"); |
|
|
126 | new_draw_info (NDI_UNIQUE, 0, op, "Mouse: L = examine, M = apply, R = drop/get"); |
|
|
127 | new_draw_info (NDI_UNIQUE, 0, op, "'help = info about extended commands."); |
|
|
128 | new_draw_info (NDI_UNIQUE, 0, op, "Ctrl-R = refresh Ctrl-C = clear"); |
|
|
129 | new_draw_info (NDI_UNIQUE, 0, op, "You can type a number before most commands."); |
|
|
130 | new_draw_info (NDI_UNIQUE, 0, op, "(For instance 3d drops 3 items.)"); |
|
|
131 | } |
|
|
132 | |
|
|
133 | void |
|
|
134 | start_info (object *op) |
|
|
135 | { |
|
|
136 | char buf[MAX_BUF]; |
|
|
137 | |
|
|
138 | sprintf (buf, "Welcome to Crossfire, v%s!", VERSION); |
|
|
139 | new_draw_info (NDI_UNIQUE, 0, op, buf); |
|
|
140 | new_draw_info (NDI_UNIQUE, 0, op, "Press `?' for help"); |
|
|
141 | new_draw_info (NDI_UNIQUE, 0, op, " "); |
|
|
142 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, op, "%s entered the game.", &op->name); |
|
|
143 | if (!op->contr->name_changed) |
|
|
144 | { |
|
|
145 | new_draw_info (NDI_UNIQUE, 0, op, "Note that you must set your name with the name"); |
|
|
146 | new_draw_info (NDI_UNIQUE, 0, op, "command to enter the highscore list."); |
|
|
147 | new_draw_info (NDI_UNIQUE, 0, op, "(You can also use the crossfire.name X-resource.)"); |
|
|
148 | } |
|
|
149 | } |
|
|
150 | |
|
|
151 | /* Really, there is no reason to crypt the passwords any system. But easier |
|
|
152 | * to just leave this enabled for backward compatibility. Put the |
|
|
153 | * simple case at top - no encryption - makes it easier to read. |
|
|
154 | */ |
|
|
155 | char * |
|
|
156 | crypt_string (char *str, char *salt) |
|
|
157 | { |
|
|
158 | #if (defined(__FreeBSD__) && !defined(HAVE_LIBDES)) |
|
|
159 | return (str); |
|
|
160 | #else |
|
|
161 | static char *c = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789./"; |
|
|
162 | char s[2]; |
|
|
163 | |
|
|
164 | if (salt == NULL) |
|
|
165 | s[0] = c[RANDOM () % (int) strlen (c)], s[1] = c[RANDOM () % (int) strlen (c)]; |
|
|
166 | else |
|
|
167 | s[0] = salt[0], s[1] = salt[1]; |
|
|
168 | |
|
|
169 | # ifdef HAVE_LIBDES |
|
|
170 | return (char *) des_crypt (str, s); |
|
|
171 | # endif |
|
|
172 | /* Default case - just use crypt */ |
|
|
173 | return (char *) crypt (str, s); |
|
|
174 | #endif |
102 | #endif |
175 | } |
|
|
176 | |
|
|
177 | int |
|
|
178 | check_password (char *typed, char *crypted) |
|
|
179 | { |
|
|
180 | return !strcmp (crypt_string (typed, crypted), crypted); |
|
|
181 | } |
103 | } |
182 | |
104 | |
183 | /* 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 |
184 | * savebed. We do some error checking - its possible that the |
106 | * savebed. We do some error checking - its possible that the |
185 | * savebed map may no longer exist, so we make sure the player |
107 | * savebed map may no longer exist, so we make sure the player |
186 | * goes someplace. |
108 | * goes someplace. |
187 | */ |
109 | */ |
188 | void |
110 | void |
189 | enter_player_savebed (object *op) |
111 | enter_player_savebed (object *op) |
190 | { |
112 | { |
191 | maptile *oldmap = op->map; |
113 | op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y); |
192 | object *tmp; |
|
|
193 | |
|
|
194 | tmp = object::create (); |
|
|
195 | |
|
|
196 | EXIT_PATH (tmp) = op->contr->savebed_map; |
|
|
197 | EXIT_X (tmp) = op->contr->bed_x; |
|
|
198 | EXIT_Y (tmp) = op->contr->bed_y; |
|
|
199 | enter_exit (op, tmp); |
|
|
200 | /* If the player has not changed maps and the name does not match |
|
|
201 | * that of the savebed, his savebed map is gone. Lets go back |
|
|
202 | * to the emergency path. Update what the players savebed is |
|
|
203 | * while we're at it. |
|
|
204 | */ |
|
|
205 | if (oldmap == op->map && strcmp (op->contr->savebed_map, oldmap->path)) |
|
|
206 | { |
|
|
207 | LOG (llevDebug, "Player %s savebed location %s is invalid - going to emergency location (%s)\n", |
|
|
208 | settings.emergency_mapname, &op->name, op->contr->savebed_map); |
|
|
209 | strcpy (op->contr->savebed_map, settings.emergency_mapname); |
|
|
210 | op->contr->bed_x = settings.emergency_x; |
|
|
211 | op->contr->bed_y = settings.emergency_y; |
|
|
212 | EXIT_PATH (tmp) = op->contr->savebed_map; |
|
|
213 | EXIT_X (tmp) = op->contr->bed_x; |
|
|
214 | EXIT_Y (tmp) = op->contr->bed_y; |
|
|
215 | enter_exit (op, tmp); |
|
|
216 | } |
|
|
217 | |
|
|
218 | tmp->destroy (); |
|
|
219 | } |
|
|
220 | |
|
|
221 | /* All this really is is a glorified remove_object that also updates |
|
|
222 | * the counts on the map if needed. |
|
|
223 | */ |
|
|
224 | void |
|
|
225 | leave_map (object *op) |
|
|
226 | { |
|
|
227 | maptile *oldmap = op->map; |
|
|
228 | |
|
|
229 | op->remove (); |
|
|
230 | |
|
|
231 | if (oldmap) |
|
|
232 | { |
|
|
233 | if (!op->contr->hidden) |
|
|
234 | oldmap->players--; |
|
|
235 | |
|
|
236 | if (oldmap->players <= 0) |
|
|
237 | /* can be less than zero due to errors in tracking this */ |
|
|
238 | set_map_timeout (oldmap); |
|
|
239 | } |
|
|
240 | } |
114 | } |
241 | |
115 | |
242 | /* |
116 | /* |
243 | * enter_map(): Moves the player and pets from current map (if any) to |
117 | * enter_map(): Moves the player and pets from current map (if any) to |
244 | * new map. map, x, y must be set. map is the map we are moving the |
118 | * new map. map, x, y must be set. map is the map we are moving the |
245 | * player to - it could be the map he just came from if the load failed for |
119 | * player to - it could be the map he just came from if the load failed for |
246 | * whatever reason. If default map coordinates are to be used, then |
120 | * whatever reason. If default map coordinates are to be used, then |
247 | * the function that calls this should figure them out. |
121 | * the function that calls this should figure them out. |
248 | */ |
122 | */ |
249 | static void |
123 | void |
250 | enter_map (object *op, maptile *newmap, int x, int y) |
124 | object::enter_map (maptile *newmap, int x, int y) |
251 | { |
125 | { |
252 | maptile *oldmap = op->map; |
126 | if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) |
|
|
127 | return; |
253 | |
128 | |
254 | if (out_of_map (newmap, x, y)) |
129 | if (out_of_map (newmap, x, y)) |
255 | { |
130 | { |
256 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", newmap->path, x, y); |
131 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
257 | x = MAP_ENTER_X (newmap); |
132 | x = newmap->enter_x; |
258 | y = MAP_ENTER_Y (newmap); |
133 | y = newmap->enter_y; |
259 | if (out_of_map (newmap, x, y)) |
134 | if (out_of_map (newmap, x, y)) |
260 | { |
135 | { |
261 | LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", |
136 | LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", |
262 | newmap->path, x, y, MAP_WIDTH (newmap), MAP_HEIGHT (newmap)); |
137 | &newmap->path, x, y, newmap->width, newmap->height); |
263 | new_draw_info (NDI_UNIQUE, 0, op, "The exit is closed"); |
138 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
264 | return; |
139 | return; |
265 | } |
140 | } |
266 | } |
141 | } |
267 | |
142 | |
|
|
143 | if (contr && map != newmap && map) |
|
|
144 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
|
|
145 | return; |
|
|
146 | |
|
|
147 | // remove, so stupid ob_locked does not trigger a failure |
|
|
148 | remove (); |
|
|
149 | |
268 | /* try to find a spot for the player */ |
150 | /* try to find a spot for the player */ |
269 | if (ob_blocked (op, newmap, x, y)) |
151 | if (blocked (newmap, x, y)) |
270 | { /* First choice blocked */ |
152 | { /* First choice blocked */ |
271 | /* We try to find a spot for the player, starting closest in. |
153 | /* We try to find a spot for the player, starting closest in. |
272 | * We could use find_first_free_spot, but that doesn't randomize it at all, |
154 | * We could use find_first_free_spot, but that doesn't randomize it at all, |
273 | * So for example, if the north space is free, you would always end up there even |
155 | * So for example, if the north space is free, you would always end up there even |
274 | * if other spaces around are available. |
156 | * if other spaces around are available. |
275 | * Note that for the second and third calls, we could start at a position other |
157 | * Note that for the second and third calls, we could start at a position other |
276 | * than one, but then we could end up on the other side of walls and so forth. |
158 | * than one, but then we could end up on the other side of walls and so forth. |
277 | */ |
159 | */ |
278 | int i = find_free_spot (op, newmap, x, y, 1, SIZEOFFREE1 + 1); |
160 | int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); |
279 | |
161 | |
280 | if (i == -1) |
162 | if (i == -1) |
281 | { |
163 | { |
282 | i = find_free_spot (op, newmap, x, y, 1, SIZEOFFREE2 + 1); |
164 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
283 | if (i == -1) |
165 | if (i == -1) |
284 | i = find_free_spot (op, newmap, x, y, 1, SIZEOFFREE); |
166 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
285 | } |
167 | } |
286 | |
168 | |
287 | if (i != -1) |
169 | if (i != -1) |
288 | { |
170 | { |
289 | x += freearr_x[i]; |
171 | x += freearr_x[i]; |
290 | y += freearr_y[i]; |
172 | y += freearr_y[i]; |
291 | } |
173 | } |
292 | else |
174 | else |
293 | { |
|
|
294 | /* not much we can do in this case. */ |
175 | /* not much we can do in this case. */ |
295 | 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); |
176 | 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); |
296 | } |
177 | } |
297 | } /* end if looking for free spot */ |
|
|
298 | |
178 | |
299 | if (op->map) |
179 | if (contr && map != newmap) |
300 | if (INVOKE_MAP (LEAVE, op->map, ARG_PLAYER (op->contr))) |
180 | { |
301 | return; |
|
|
302 | |
|
|
303 | if (INVOKE_PLAYER (MAP_CHANGE, op->contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
181 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
304 | return; |
182 | return; |
305 | |
183 | |
306 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (op->contr), ARG_INT (x), ARG_INT (y))) |
184 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
307 | return; |
185 | return; |
|
|
186 | } |
308 | |
187 | |
309 | /* If it is a player login, he has yet to be inserted anyplace. |
|
|
310 | * otherwise, we need to deal with removing the player here. |
|
|
311 | */ |
|
|
312 | op->remove (); |
|
|
313 | |
|
|
314 | /* remove_ob clears these so they must be reset after the remove_ob call */ |
|
|
315 | op->x = x; |
188 | this->x = x; |
316 | op->y = y; |
189 | this->y = y; |
317 | op->map = newmap; |
190 | map = newmap; |
318 | |
191 | |
319 | insert_ob_in_map (op, op->map, NULL, INS_NO_WALK_ON); |
192 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
320 | |
193 | |
321 | if (!op->contr->hidden) |
194 | enemy = 0; |
322 | newmap->players++; |
|
|
323 | |
195 | |
324 | newmap->timeout = 0; |
|
|
325 | op->enemy = NULL; |
|
|
326 | |
|
|
327 | if (op->contr) |
196 | if (contr) |
328 | { |
197 | { |
329 | strcpy (op->contr->maplevel, newmap->path); |
198 | contr->maplevel = newmap->path; |
330 | op->contr->count = 0; |
199 | contr->count = 0; |
331 | } |
200 | } |
332 | |
201 | |
333 | /* Update any golems */ |
202 | /* Update any golems */ |
334 | if (op->type == PLAYER && op->contr->ranges[range_golem] != NULL) |
203 | if (type == PLAYER) |
335 | { |
204 | if (object *golem = contr->golem) |
336 | int i = find_free_spot (op->contr->ranges[range_golem], newmap, |
|
|
337 | x, y, 1, SIZEOFFREE); |
|
|
338 | |
|
|
339 | op->contr->ranges[range_golem]->remove (); |
|
|
340 | |
|
|
341 | if (i == -1) |
|
|
342 | { |
205 | { |
343 | remove_friendly_object (op->contr->ranges[range_golem]); |
206 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
344 | op->contr->ranges[range_golem]->destroy (); |
207 | |
345 | op->contr->ranges[range_golem] = 0; |
208 | if (i < 0) |
346 | } |
|
|
347 | else |
|
|
348 | { |
|
|
349 | for (object *tmp = op->contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more) |
|
|
350 | { |
209 | { |
351 | tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.x); |
210 | golem->destroy_inv (true); // be explicit about dropping |
352 | tmp->y = y + freearr_y[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.y); |
211 | golem->destroy (true); |
353 | tmp->map = newmap; |
|
|
354 | } |
212 | } |
355 | |
213 | else |
356 | insert_ob_in_map (op->contr->ranges[range_golem], newmap, NULL, 0); |
214 | { |
357 | op->contr->ranges[range_golem]->direction = |
215 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
358 | find_dir_2 (op->x - op->contr->ranges[range_golem]->x, op->y - op->contr->ranges[range_golem]->y); |
216 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
359 | } |
217 | } |
360 | } |
218 | } |
361 | |
|
|
362 | op->direction = 0; |
|
|
363 | |
219 | |
364 | /* since the players map is already loaded, we don't need to worry |
220 | /* since the players map is already loaded, we don't need to worry |
365 | * about pending objects. |
221 | * about pending objects. |
366 | */ |
222 | */ |
367 | remove_all_pets (newmap); |
223 | remove_all_pets (newmap); |
368 | |
|
|
369 | /* If the player is changing maps, we need to do some special things |
|
|
370 | * Do this after the player is on the new map - otherwise the force swap of the |
|
|
371 | * old map does not work. |
|
|
372 | */ |
|
|
373 | if (oldmap != newmap) |
|
|
374 | { |
|
|
375 | if (oldmap) /* adjust old map */ |
|
|
376 | { |
|
|
377 | oldmap->players--; |
|
|
378 | |
|
|
379 | if (oldmap->players <= 0) /* can be less than zero due to errors in tracking this */ |
|
|
380 | set_map_timeout (oldmap); |
|
|
381 | } |
|
|
382 | } |
|
|
383 | } |
|
|
384 | |
|
|
385 | void |
|
|
386 | set_map_timeout (maptile *oldmap) |
|
|
387 | { |
|
|
388 | #if MAP_MAXTIMEOUT |
|
|
389 | oldmap->timeout = MAP_TIMEOUT (oldmap); |
|
|
390 | /* Do MINTIMEOUT first, so that MAXTIMEOUT is used if that is |
|
|
391 | * lower than the min value. |
|
|
392 | */ |
|
|
393 | # if MAP_MINTIMEOUT |
|
|
394 | if (oldmap->timeout < MAP_MINTIMEOUT) |
|
|
395 | oldmap->timeout = MAP_MINTIMEOUT; |
|
|
396 | # endif |
|
|
397 | |
|
|
398 | if (oldmap->timeout > MAP_MAXTIMEOUT) |
|
|
399 | oldmap->timeout = MAP_MAXTIMEOUT; |
|
|
400 | |
|
|
401 | #else |
|
|
402 | /* save out the map */ |
|
|
403 | swap_map (oldmap); |
|
|
404 | #endif /* MAP_MAXTIMEOUT */ |
|
|
405 | } |
|
|
406 | |
|
|
407 | |
|
|
408 | /* clean_path takes a path and replaces all / with _ |
|
|
409 | * We do a strcpy so that we do not change the original string. |
|
|
410 | */ |
|
|
411 | char * |
|
|
412 | clean_path (const char *file) |
|
|
413 | { |
|
|
414 | static char newpath[MAX_BUF], *cp; |
|
|
415 | assign (newpath, file); |
|
|
416 | |
|
|
417 | for (cp = newpath; *cp != '\0'; cp++) |
|
|
418 | if (*cp == '/') |
|
|
419 | *cp = '_'; |
|
|
420 | |
|
|
421 | return newpath; |
|
|
422 | } |
|
|
423 | |
|
|
424 | |
|
|
425 | /* unclean_path takes a path and replaces all _ with / |
|
|
426 | * This basically undoes clean path. |
|
|
427 | * We do a strcpy so that we do not change the original string. |
|
|
428 | * We are smart enough to start after the last / in case we |
|
|
429 | * are getting passed a string that points to a unique map |
|
|
430 | * path. |
|
|
431 | */ |
|
|
432 | char * |
|
|
433 | unclean_path (const char *src) |
|
|
434 | { |
|
|
435 | static char newpath[MAX_BUF], *cp; |
|
|
436 | |
|
|
437 | cp = strrchr (src, '/'); |
|
|
438 | assign (newpath, cp ? cp + 1 : src); |
|
|
439 | |
|
|
440 | for (cp = newpath; *cp != '\0'; cp++) |
|
|
441 | if (*cp == '_') |
|
|
442 | *cp = '/'; |
|
|
443 | |
|
|
444 | return newpath; |
|
|
445 | } |
|
|
446 | |
|
|
447 | |
|
|
448 | /* The player is trying to enter a randomly generated map. In this case, generate the |
|
|
449 | * random map as needed. |
|
|
450 | */ |
|
|
451 | |
|
|
452 | static void |
|
|
453 | enter_random_map (object *pl, object *exit_ob) |
|
|
454 | { |
|
|
455 | maptile *new_map; |
|
|
456 | char newmap_name[HUGE_BUF], *cp; |
|
|
457 | static int reference_number = 0; |
|
|
458 | RMParms rp; |
|
|
459 | |
|
|
460 | memset (&rp, 0, sizeof (RMParms)); |
|
|
461 | rp.Xsize = -1; |
|
|
462 | rp.Ysize = -1; |
|
|
463 | rp.region = get_region_by_map (exit_ob->map); |
|
|
464 | if (exit_ob->msg) |
|
|
465 | set_random_map_variable (&rp, exit_ob->msg); |
|
|
466 | rp.origin_x = exit_ob->x; |
|
|
467 | rp.origin_y = exit_ob->y; |
|
|
468 | strcpy (rp.origin_map, pl->map->path); |
|
|
469 | |
|
|
470 | /* If we have a final_map, use it as a base name to give some clue |
|
|
471 | * as where the player is. Otherwise, use the origin map. |
|
|
472 | */ |
|
|
473 | sprintf (newmap_name, "/random%s+%04d", |
|
|
474 | *rp.final_map ? rp.final_map : rp.origin_map, |
|
|
475 | reference_number++); |
|
|
476 | |
|
|
477 | /* now to generate the actual map. */ |
|
|
478 | new_map = generate_random_map (newmap_name, &rp); |
|
|
479 | |
|
|
480 | /* Update the exit_ob so it now points directly at the newly created |
|
|
481 | * random maps. Not that it is likely to happen, but it does mean that a |
|
|
482 | * exit in a unique map leading to a random map will not work properly. |
|
|
483 | * It also means that if the created random map gets reset before |
|
|
484 | * the exit leading to it, that the exit will no longer work. |
|
|
485 | */ |
|
|
486 | if (new_map) |
|
|
487 | { |
|
|
488 | int x, y; |
|
|
489 | |
|
|
490 | x = EXIT_X (exit_ob) = MAP_ENTER_X (new_map); |
|
|
491 | y = EXIT_Y (exit_ob) = MAP_ENTER_Y (new_map); |
|
|
492 | EXIT_PATH (exit_ob) = newmap_name; |
|
|
493 | strcpy (new_map->path, newmap_name); |
|
|
494 | enter_map (pl, new_map, x, y); |
|
|
495 | } |
|
|
496 | } |
|
|
497 | |
|
|
498 | /* The player is trying to enter a non-randomly generated template map. In this |
|
|
499 | * case, use a map file for a template |
|
|
500 | */ |
|
|
501 | |
|
|
502 | static void |
|
|
503 | enter_fixed_template_map (object *pl, object *exit_ob) |
|
|
504 | { |
|
|
505 | maptile *new_map; |
|
|
506 | char tmpnum[32], exitpath[HUGE_BUF], resultname[HUGE_BUF], tmpstring[HUGE_BUF], *sourcemap; |
|
|
507 | const char *new_map_name; |
|
|
508 | |
|
|
509 | /* Split the exit path string into two parts, one |
|
|
510 | * for where to store the map, and one for were |
|
|
511 | * to generate the map from. |
|
|
512 | */ |
|
|
513 | snprintf (exitpath, sizeof (exitpath), "%s", EXIT_PATH (exit_ob) + 2); |
|
|
514 | sourcemap = strchr (exitpath, '!'); |
|
|
515 | if (!sourcemap) |
|
|
516 | { |
|
|
517 | new_draw_info_format (NDI_UNIQUE, 0, pl, "The %s is closed.", &exit_ob->name); |
|
|
518 | /* Should only occur when no source map is set. |
|
|
519 | */ |
|
|
520 | LOG (llevError, "enter_fixed_template_map: Exit %s (%d,%d) on map %s has no source template.\n", |
|
|
521 | &exit_ob->name, exit_ob->x, exit_ob->y, exit_ob->map->path); |
|
|
522 | return; |
|
|
523 | } |
|
|
524 | |
|
|
525 | *sourcemap++ = '\0'; |
|
|
526 | |
|
|
527 | /* If we are not coming from a template map, we can use relative directories |
|
|
528 | * for the map to generate from. |
|
|
529 | */ |
|
|
530 | if (!exit_ob->map->templatemap) |
|
|
531 | sourcemap = path_combine_and_normalize (exit_ob->map->path, sourcemap); |
|
|
532 | |
|
|
533 | /* Do replacement of %x, %y, and %n to the x coord of the exit, the y coord |
|
|
534 | * of the exit, and the name of the map the exit is on, respectively. |
|
|
535 | */ |
|
|
536 | sprintf (tmpnum, "%d", exit_ob->x); |
|
|
537 | replace (exitpath, "%x", tmpnum, resultname, sizeof (resultname)); |
|
|
538 | |
|
|
539 | sprintf (tmpnum, "%d", exit_ob->y); |
|
|
540 | sprintf (tmpstring, "%s", resultname); |
|
|
541 | replace (tmpstring, "%y", tmpnum, resultname, sizeof (resultname)); |
|
|
542 | |
|
|
543 | sprintf (tmpstring, "%s", resultname); |
|
|
544 | replace (tmpstring, "%n", exit_ob->map->name, resultname, sizeof (resultname)); |
|
|
545 | |
|
|
546 | /* If we are coming from another template map, use reletive paths unless |
|
|
547 | * indicated otherwise. |
|
|
548 | */ |
|
|
549 | if (exit_ob->map->templatemap && (resultname[0] != '/')) |
|
|
550 | new_map_name = path_combine_and_normalize (exit_ob->map->path, resultname); |
|
|
551 | else |
|
|
552 | new_map_name = create_template_pathname (resultname); |
|
|
553 | |
|
|
554 | /* Attempt to load the map, if unable to, then |
|
|
555 | * create the map from the template. |
|
|
556 | */ |
|
|
557 | new_map = ready_map_name (new_map_name, MAP_PLAYER_UNIQUE); |
|
|
558 | if (!new_map) |
|
|
559 | { |
|
|
560 | new_map = load_original_map (create_pathname (sourcemap), MAP_PLAYER_UNIQUE); |
|
|
561 | if (new_map) |
|
|
562 | fix_auto_apply (new_map); |
|
|
563 | } |
|
|
564 | |
|
|
565 | if (new_map) |
|
|
566 | { |
|
|
567 | /* set the path of the map to where it should be |
|
|
568 | * so we don't just save over the source map. |
|
|
569 | */ |
|
|
570 | strcpy (new_map->path, new_map_name); |
|
|
571 | new_map->templatemap = 1; |
|
|
572 | enter_map (pl, new_map, EXIT_X (exit_ob), EXIT_Y (exit_ob)); |
|
|
573 | } |
|
|
574 | else |
|
|
575 | { |
|
|
576 | new_draw_info_format (NDI_UNIQUE, 0, pl, "The %s is closed.", &exit_ob->name); |
|
|
577 | /* Should only occur when an invalid source map is set. |
|
|
578 | */ |
|
|
579 | LOG (llevDebug, "enter_fixed_template_map: Exit %s (%d,%d) on map %s leads no where.\n", |
|
|
580 | &exit_ob->name, exit_ob->x, exit_ob->y, exit_ob->map->path); |
|
|
581 | } |
|
|
582 | } |
|
|
583 | |
|
|
584 | /* The player is trying to enter a randomly generated template map. In this |
|
|
585 | * case, generate the map as needed. |
|
|
586 | */ |
|
|
587 | |
|
|
588 | static void |
|
|
589 | enter_random_template_map (object *pl, object *exit_ob) |
|
|
590 | { |
|
|
591 | maptile *new_map; |
|
|
592 | char tmpnum[32], resultname[HUGE_BUF], tmpstring[HUGE_BUF]; |
|
|
593 | const char *new_map_name; |
|
|
594 | RMParms rp; |
|
|
595 | |
|
|
596 | /* Do replacement of %x, %y, and %n to the x coord of the exit, the y coord |
|
|
597 | * of the exit, and the name of the map the exit is on, respectively. |
|
|
598 | */ |
|
|
599 | sprintf (tmpnum, "%d", exit_ob->x); |
|
|
600 | replace (EXIT_PATH (exit_ob) + 3, "%x", tmpnum, resultname, sizeof (resultname)); |
|
|
601 | |
|
|
602 | sprintf (tmpnum, "%d", exit_ob->y); |
|
|
603 | sprintf (tmpstring, "%s", resultname); |
|
|
604 | replace (tmpstring, "%y", tmpnum, resultname, sizeof (resultname)); |
|
|
605 | |
|
|
606 | sprintf (tmpstring, "%s", resultname); |
|
|
607 | replace (tmpstring, "%n", exit_ob->map->name, resultname, sizeof (resultname)); |
|
|
608 | |
|
|
609 | /* If we are coming from another template map, use reletive paths unless |
|
|
610 | * indicated otherwise. |
|
|
611 | */ |
|
|
612 | if (exit_ob->map->templatemap && (resultname[0] != '/')) |
|
|
613 | new_map_name = path_combine_and_normalize (exit_ob->map->path, resultname); |
|
|
614 | else |
|
|
615 | new_map_name = create_template_pathname (resultname); |
|
|
616 | |
|
|
617 | new_map = ready_map_name (new_map_name, MAP_PLAYER_UNIQUE); |
|
|
618 | if (!new_map) |
|
|
619 | { |
|
|
620 | memset (&rp, 0, sizeof (RMParms)); |
|
|
621 | rp.Xsize = -1; |
|
|
622 | rp.Ysize = -1; |
|
|
623 | rp.region = get_region_by_map (exit_ob->map); |
|
|
624 | if (exit_ob->msg) |
|
|
625 | set_random_map_variable (&rp, exit_ob->msg); |
|
|
626 | rp.origin_x = exit_ob->x; |
|
|
627 | rp.origin_y = exit_ob->y; |
|
|
628 | strcpy (rp.origin_map, pl->map->path); |
|
|
629 | |
|
|
630 | /* now to generate the actual map. */ |
|
|
631 | new_map = generate_random_map (new_map_name, &rp); |
|
|
632 | } |
|
|
633 | |
|
|
634 | |
|
|
635 | /* Update the exit_ob so it now points directly at the newly created |
|
|
636 | * random maps. Not that it is likely to happen, but it does mean that a |
|
|
637 | * exit in a unique map leading to a random map will not work properly. |
|
|
638 | * It also means that if the created random map gets reset before |
|
|
639 | * the exit leading to it, that the exit will no longer work. |
|
|
640 | */ |
|
|
641 | if (new_map) |
|
|
642 | { |
|
|
643 | int x, y; |
|
|
644 | |
|
|
645 | x = EXIT_X (exit_ob) = MAP_ENTER_X (new_map); |
|
|
646 | y = EXIT_Y (exit_ob) = MAP_ENTER_Y (new_map); |
|
|
647 | new_map->templatemap = 1; |
|
|
648 | enter_map (pl, new_map, x, y); |
|
|
649 | } |
|
|
650 | } |
|
|
651 | |
|
|
652 | |
|
|
653 | /* Code to enter/detect a character entering a unique map. |
|
|
654 | */ |
|
|
655 | static void |
|
|
656 | enter_unique_map (object *op, object *exit_ob) |
|
|
657 | { |
|
|
658 | char apartment[HUGE_BUF]; |
|
|
659 | maptile *newmap; |
|
|
660 | |
|
|
661 | if (EXIT_PATH (exit_ob)[0] == '/') |
|
|
662 | { |
|
|
663 | sprintf (apartment, "%s/%s/%s/%s", settings.localdir, settings.playerdir, &op->name, clean_path (EXIT_PATH (exit_ob))); |
|
|
664 | newmap = ready_map_name (apartment, MAP_PLAYER_UNIQUE); |
|
|
665 | if (!newmap) |
|
|
666 | { |
|
|
667 | newmap = load_original_map (create_pathname (EXIT_PATH (exit_ob)), MAP_PLAYER_UNIQUE); |
|
|
668 | if (newmap) |
|
|
669 | fix_auto_apply (newmap); |
|
|
670 | } |
|
|
671 | } |
|
|
672 | else |
|
|
673 | { /* relative directory */ |
|
|
674 | char reldir[HUGE_BUF], tmpc[HUGE_BUF], *cp; |
|
|
675 | |
|
|
676 | if (exit_ob->map->unique) |
|
|
677 | { |
|
|
678 | |
|
|
679 | strcpy (reldir, unclean_path (exit_ob->map->path)); |
|
|
680 | |
|
|
681 | /* Need to copy this over, as clean_path only has one static return buffer */ |
|
|
682 | strcpy (tmpc, clean_path (reldir)); |
|
|
683 | /* Remove final component, if any */ |
|
|
684 | if ((cp = strrchr (tmpc, '_')) != NULL) |
|
|
685 | *cp = 0; |
|
|
686 | |
|
|
687 | sprintf (apartment, "%s/%s/%s/%s_%s", settings.localdir, settings.playerdir, &op->name, tmpc, clean_path (EXIT_PATH (exit_ob))); |
|
|
688 | |
|
|
689 | newmap = ready_map_name (apartment, MAP_PLAYER_UNIQUE); |
|
|
690 | if (!newmap) |
|
|
691 | { |
|
|
692 | newmap = load_original_map (create_pathname (path_combine_and_normalize (reldir, EXIT_PATH (exit_ob))), MAP_PLAYER_UNIQUE); |
|
|
693 | if (newmap) |
|
|
694 | fix_auto_apply (newmap); |
|
|
695 | } |
|
|
696 | } |
|
|
697 | else |
|
|
698 | { |
|
|
699 | /* The exit is unique, but the map we are coming from is not unique. So |
|
|
700 | * use the basic logic - don't need to demangle the path name |
|
|
701 | */ |
|
|
702 | sprintf (apartment, "%s/%s/%s/%s", settings.localdir, |
|
|
703 | settings.playerdir, &op->name, clean_path (path_combine_and_normalize (exit_ob->map->path, EXIT_PATH (exit_ob)))); |
|
|
704 | newmap = ready_map_name (apartment, MAP_PLAYER_UNIQUE); |
|
|
705 | if (!newmap) |
|
|
706 | { |
|
|
707 | newmap = ready_map_name (path_combine_and_normalize (exit_ob->map->path, EXIT_PATH (exit_ob)), 0); |
|
|
708 | if (newmap) |
|
|
709 | fix_auto_apply (newmap); |
|
|
710 | } |
|
|
711 | } |
|
|
712 | } |
|
|
713 | |
|
|
714 | if (newmap) |
|
|
715 | { |
|
|
716 | strcpy (newmap->path, apartment); |
|
|
717 | newmap->unique = 1; |
|
|
718 | enter_map (op, newmap, EXIT_X (exit_ob), EXIT_Y (exit_ob)); |
|
|
719 | } |
|
|
720 | else |
|
|
721 | { |
|
|
722 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s is closed.", &exit_ob->name); |
|
|
723 | /* Perhaps not critical, but I would think that the unique maps |
|
|
724 | * should be new enough this does not happen. This also creates |
|
|
725 | * a strange situation where some players could perhaps have visited |
|
|
726 | * such a map before it was removed, so they have the private |
|
|
727 | * map, but other players can't get it anymore. |
|
|
728 | */ |
|
|
729 | LOG (llevDebug, "enter_unique_map: Exit %s (%d,%d) on map %s is leads no where.\n", |
|
|
730 | &exit_ob->name, exit_ob->x, exit_ob->y, exit_ob->map->path); |
|
|
731 | } |
|
|
732 | |
|
|
733 | } |
|
|
734 | |
|
|
735 | |
|
|
736 | /* Tries to move 'op' to exit_ob. op is the character or monster that is |
|
|
737 | * using the exit, where exit_ob is the exit object (boat, door, teleporter, |
|
|
738 | * etc.) if exit_ob is null, then op->contr->maplevel contains that map to |
|
|
739 | * move the object to. This is used when loading the player. |
|
|
740 | * |
|
|
741 | * Largely redone by MSW 2001-01-21 - this function was overly complex |
|
|
742 | * and had some obscure bugs. |
|
|
743 | */ |
|
|
744 | |
|
|
745 | void |
|
|
746 | enter_exit (object *op, object *exit_ob) |
|
|
747 | { |
|
|
748 | #define PORTAL_DESTINATION_NAME "Town portal destination" /* this one should really be in a header file */ |
|
|
749 | object *tmp; |
|
|
750 | |
|
|
751 | /* It may be nice to support other creatures moving across |
|
|
752 | * exits, but right now a lot of the code looks at op->contr, |
|
|
753 | * so that is an RFE. |
|
|
754 | */ |
|
|
755 | if (op->type != PLAYER) |
|
|
756 | return; |
|
|
757 | |
|
|
758 | /* First, lets figure out what map the player is going to go to */ |
|
|
759 | if (exit_ob) |
|
|
760 | { |
|
|
761 | /* check to see if we make a template map */ |
|
|
762 | if (EXIT_PATH (exit_ob) && EXIT_PATH (exit_ob)[1] == '@') |
|
|
763 | { |
|
|
764 | if (EXIT_PATH (exit_ob)[2] == '!') |
|
|
765 | { |
|
|
766 | /* generate a template map randomly */ |
|
|
767 | enter_random_template_map (op, exit_ob); |
|
|
768 | } |
|
|
769 | else |
|
|
770 | { |
|
|
771 | /* generate a template map from a fixed template */ |
|
|
772 | enter_fixed_template_map (op, exit_ob); |
|
|
773 | } |
|
|
774 | } |
|
|
775 | /* check to see if we make a randomly generated map */ |
|
|
776 | else if (EXIT_PATH (exit_ob) && EXIT_PATH (exit_ob)[1] == '!') |
|
|
777 | { |
|
|
778 | enter_random_map (op, exit_ob); |
|
|
779 | } |
|
|
780 | else if (QUERY_FLAG (exit_ob, FLAG_UNIQUE)) |
|
|
781 | { |
|
|
782 | enter_unique_map (op, exit_ob); |
|
|
783 | } |
|
|
784 | else |
|
|
785 | { |
|
|
786 | int x = EXIT_X (exit_ob), y = EXIT_Y (exit_ob); |
|
|
787 | |
|
|
788 | /* 'Normal' exits that do not do anything special |
|
|
789 | * Simple enough we don't need another routine for it. |
|
|
790 | */ |
|
|
791 | maptile *newmap; |
|
|
792 | |
|
|
793 | if (exit_ob->map) |
|
|
794 | { |
|
|
795 | newmap = ready_map_name (path_combine_and_normalize (exit_ob->map->path, EXIT_PATH (exit_ob)), 0); |
|
|
796 | /* Random map was previously generated, but is no longer about. Lets generate a new |
|
|
797 | * map. |
|
|
798 | */ |
|
|
799 | if (!newmap && !strncmp (EXIT_PATH (exit_ob), "/random/", 8)) |
|
|
800 | { |
|
|
801 | /* Maps that go down have a message set. However, maps that go |
|
|
802 | * up, don't. If the going home has reset, there isn't much |
|
|
803 | * point generating a random map, because it won't match the maps. |
|
|
804 | */ |
|
|
805 | if (exit_ob->msg) |
|
|
806 | { |
|
|
807 | enter_random_map (op, exit_ob); |
|
|
808 | } |
|
|
809 | else |
|
|
810 | { |
|
|
811 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s is closed.", &exit_ob->name); |
|
|
812 | return; |
|
|
813 | } |
|
|
814 | |
|
|
815 | /* For exits that cause damages (like pits). Don't know if any |
|
|
816 | * random maps use this or not. |
|
|
817 | */ |
|
|
818 | if (exit_ob->stats.dam && op->type == PLAYER) |
|
|
819 | hit_player (op, exit_ob->stats.dam, exit_ob, exit_ob->attacktype, 1); |
|
|
820 | return; |
|
|
821 | } |
|
|
822 | } |
|
|
823 | else |
|
|
824 | { |
|
|
825 | /* For word of recall and other force objects |
|
|
826 | * They contain the full pathname of the map to go back to, |
|
|
827 | * so we don't need to normalize it. |
|
|
828 | * But we do need to see if it is unique or not |
|
|
829 | */ |
|
|
830 | if (!strncmp (EXIT_PATH (exit_ob), settings.localdir, strlen (settings.localdir))) |
|
|
831 | newmap = ready_map_name (EXIT_PATH (exit_ob), MAP_PLAYER_UNIQUE); |
|
|
832 | else |
|
|
833 | newmap = ready_map_name (EXIT_PATH (exit_ob), 0); |
|
|
834 | } |
|
|
835 | if (!newmap) |
|
|
836 | { |
|
|
837 | if (exit_ob->name) |
|
|
838 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s is closed.", &exit_ob->name); |
|
|
839 | /* don't cry to momma if name is not set - as in tmp objects |
|
|
840 | * used by the savebed code and character creation */ |
|
|
841 | return; |
|
|
842 | } |
|
|
843 | |
|
|
844 | /* This supports the old behaviour, but it really should not be used. |
|
|
845 | * I will note for example that with this method, it is impossible to |
|
|
846 | * set 0,0 destination coordinates. Really, if we want to support |
|
|
847 | * using the new maps default coordinates, the exit ob should use |
|
|
848 | * something like -1, -1 so it is clear to do that. |
|
|
849 | */ |
|
|
850 | if (x == 0 && y == 0) |
|
|
851 | { |
|
|
852 | x = MAP_ENTER_X (newmap); |
|
|
853 | y = MAP_ENTER_Y (newmap); |
|
|
854 | LOG (llevDebug, "enter_exit: Exit %s (%d,%d) on map %s is 0 destination coordinates\n", |
|
|
855 | &exit_ob->name, exit_ob->x, exit_ob->y, exit_ob->map ? exit_ob->map->path : "<nil>"); |
|
|
856 | } |
|
|
857 | |
|
|
858 | /* mids 02/13/2002 if exit is damned, update players death & WoR home-position and delete town portal */ |
|
|
859 | if (QUERY_FLAG (exit_ob, FLAG_DAMNED)) |
|
|
860 | { |
|
|
861 | /* remove an old force with a slaying field == PORTAL_DESTINATION_NAME */ |
|
|
862 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
|
|
863 | { |
|
|
864 | if (tmp->type == FORCE && tmp->slaying && !strcmp (tmp->slaying, PORTAL_DESTINATION_NAME)) |
|
|
865 | break; |
|
|
866 | } |
|
|
867 | if (tmp) |
|
|
868 | { |
|
|
869 | tmp->remove (); |
|
|
870 | tmp->destroy (); |
|
|
871 | } |
|
|
872 | |
|
|
873 | strcpy (op->contr->savebed_map, path_combine_and_normalize (exit_ob->map->path, EXIT_PATH (exit_ob))); |
|
|
874 | op->contr->bed_x = EXIT_X (exit_ob), op->contr->bed_y = EXIT_Y (exit_ob); |
|
|
875 | op->contr->save (); |
|
|
876 | /* LOG(llevDebug,"enter_exit: Taking damned exit %s to (%d,%d) on map %s\n", |
|
|
877 | * exit_ob->name?exit_ob->name:"(none)", exit_ob->x, exit_ob->y, |
|
|
878 | * path_combine_and_normalize(exit_ob->map->path, EXIT_PATH(exit_ob))); */ |
|
|
879 | } |
|
|
880 | |
|
|
881 | enter_map (op, newmap, x, y); |
|
|
882 | } |
|
|
883 | /* For exits that cause damages (like pits) */ |
|
|
884 | if (exit_ob->stats.dam && op->type == PLAYER) |
|
|
885 | hit_player (op, exit_ob->stats.dam, exit_ob, exit_ob->attacktype, 1); |
|
|
886 | } |
|
|
887 | else |
|
|
888 | { |
|
|
889 | int flags = 0; |
|
|
890 | maptile *newmap; |
|
|
891 | |
|
|
892 | /* Hypothetically, I guess its possible that a standard map matches |
|
|
893 | * the localdir, but that seems pretty unlikely - unlikely enough that |
|
|
894 | * I'm not going to attempt to try to deal with that possibility. |
|
|
895 | * We use the fact that when a player saves on a unique map, it prepends |
|
|
896 | * the localdir to that name. So its an easy way to see of the map is |
|
|
897 | * unique or not. |
|
|
898 | */ |
|
|
899 | if (!strncmp (op->contr->maplevel, settings.localdir, strlen (settings.localdir))) |
|
|
900 | flags = MAP_PLAYER_UNIQUE; |
|
|
901 | |
|
|
902 | /* newmap returns the map (if already loaded), or loads it for |
|
|
903 | * us. |
|
|
904 | */ |
|
|
905 | newmap = ready_map_name (op->contr->maplevel, flags); |
|
|
906 | if (!newmap) |
|
|
907 | { |
|
|
908 | LOG (llevError, "enter_exit: Pathname to map does not exist! (%s)\n", op->contr->maplevel); |
|
|
909 | newmap = ready_map_name (settings.emergency_mapname, 0); |
|
|
910 | op->x = settings.emergency_x; |
|
|
911 | op->y = settings.emergency_y; |
|
|
912 | /* If we can't load the emergency map, something is probably really |
|
|
913 | * screwed up, so bail out now. |
|
|
914 | */ |
|
|
915 | if (!newmap) |
|
|
916 | { |
|
|
917 | LOG (llevError, "enter_exit: could not load emergency map? Fatal error\n"); |
|
|
918 | abort (); |
|
|
919 | } |
|
|
920 | } |
|
|
921 | |
|
|
922 | enter_map (op, newmap, op->x, op->y); |
|
|
923 | } |
|
|
924 | } |
224 | } |
925 | |
225 | |
926 | /* process_players1 and process_players2 do all the player related stuff. |
226 | /* process_players1 and process_players2 do all the player related stuff. |
927 | * I moved it out of process events and process_map. This was to some |
227 | * I moved it out of process events and process_map. This was to some |
928 | * extent for debugging as well as to get a better idea of the time used |
228 | * extent for debugging as well as to get a better idea of the time used |
… | |
… | |
931 | * is needed after the players have been updated. |
231 | * is needed after the players have been updated. |
932 | */ |
232 | */ |
933 | static void |
233 | static void |
934 | process_players1 () |
234 | process_players1 () |
935 | { |
235 | { |
936 | int flag; |
|
|
937 | /* Basically, we keep looping until all the players have done their actions. */ |
236 | /* Basically, we keep looping until all the players have done their actions. */ |
938 | for (flag = 1; flag != 0;) |
237 | for (int flag = 1; flag != 0;) |
939 | { |
238 | { |
940 | flag = 0; |
239 | flag = 0; |
941 | for (player *plnext, *pl = first_player; pl; pl = plnext) |
240 | for_all_players (pl) |
942 | { |
241 | { |
943 | plnext = pl->next; /* In case a player exits the game in handle_player() */ |
242 | pl->refcnt_chk (); |
944 | |
243 | |
945 | if (!pl->ob) |
244 | if (expect_false (!pl->ob || !pl->ns || !pl->ob->active)) |
946 | continue; |
245 | continue; |
947 | |
246 | |
948 | if (pl->ob->speed_left > 0) |
|
|
949 | { |
|
|
950 | if (handle_newcs_player (pl->ob)) |
247 | if (handle_newcs_player (pl->ob)) |
951 | flag = 1; |
248 | flag = 1; |
952 | } /* end if player has speed left */ |
249 | } |
|
|
250 | } |
953 | |
251 | |
954 | /* If the player is not actively playing, don't make a |
252 | for_all_players (pl) |
955 | * backup save - nothing to save anyway. Plus, the |
253 | { |
956 | * map may not longer be valid. This can happen when the |
254 | object *ob = pl->ob; |
957 | * player quits - they exist for purposes of tracking on the map, |
255 | |
958 | * but don't actually reside on any actual map. |
256 | if (expect_false (!ob || !pl->ns || !ob->active)) |
959 | */ |
|
|
960 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
961 | continue; |
257 | continue; |
962 | |
258 | |
963 | #ifdef AUTOSAVE |
|
|
964 | /* check for ST_PLAYING state so that we don't try to save off when |
|
|
965 | * the player is logging in. |
|
|
966 | */ |
|
|
967 | if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->ns->state == ST_PLAYING) |
|
|
968 | { |
|
|
969 | pl->ob->contr->save (); |
|
|
970 | pl->last_save_tick = pticks; |
|
|
971 | } |
|
|
972 | #endif |
|
|
973 | } /* end of for loop for all the players */ |
|
|
974 | } /* for flag */ |
|
|
975 | |
|
|
976 | for (player *pl = first_player; pl; pl = pl->next) |
|
|
977 | { |
|
|
978 | if (settings.casting_time) |
|
|
979 | { |
|
|
980 | if (pl->ob->casting_time > 0) |
|
|
981 | { |
|
|
982 | pl->ob->casting_time--; |
|
|
983 | pl->ob->start_holding = 1; |
|
|
984 | } |
|
|
985 | |
|
|
986 | /* set spell_state so we can update the range in stats field */ |
|
|
987 | if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1)) |
|
|
988 | pl->ob->start_holding = 0; |
|
|
989 | } |
|
|
990 | |
|
|
991 | do_some_living (pl->ob); |
259 | do_some_living (ob); |
992 | } |
260 | } |
993 | } |
261 | } |
994 | |
262 | |
995 | static void |
263 | static void |
996 | process_players2 () |
264 | process_players2 () |
997 | { |
265 | { |
998 | /* Then check if any players should use weapon-speed instead of speed */ |
266 | /* Then check if any players should use weapon-speed instead of speed */ |
999 | for (player *pl = first_player; pl; pl = pl->next) |
267 | for_all_players (pl) |
1000 | { |
268 | { |
1001 | /* The code that did weapon_sp handling here was out of place - |
269 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
1002 | * this isn't called until after the player has finished there |
270 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
1003 | * actions, and is thus out of place. All we do here is bounds |
|
|
1004 | * checking. |
|
|
1005 | */ |
|
|
1006 | if (pl->has_hit) |
|
|
1007 | { |
|
|
1008 | if (pl->ob->speed_left > pl->weapon_sp) |
|
|
1009 | pl->ob->speed_left = pl->weapon_sp; |
|
|
1010 | |
|
|
1011 | /* This needs to be here - if the player is running, we need to |
|
|
1012 | * clear this each tick, but new commands are not being received |
|
|
1013 | * so execute_newserver_command() is never called |
|
|
1014 | */ |
|
|
1015 | pl->has_hit = 0; |
|
|
1016 | } |
|
|
1017 | else if (pl->ob->speed_left > pl->ob->speed) |
|
|
1018 | pl->ob->speed_left = pl->ob->speed; |
|
|
1019 | } |
271 | } |
1020 | } |
272 | } |
1021 | |
273 | |
1022 | void |
274 | void |
1023 | process_events () |
275 | process_events () |
1024 | { |
276 | { |
1025 | object *op; |
|
|
1026 | |
|
|
1027 | static object *marker; |
|
|
1028 | |
|
|
1029 | if (!marker) |
|
|
1030 | marker = object::create (); |
|
|
1031 | |
|
|
1032 | process_players1 (); |
277 | process_players1 (); |
1033 | |
278 | |
1034 | marker->active_next = active_objects; |
279 | for_all_actives (op) |
1035 | |
|
|
1036 | if (marker->active_next) |
|
|
1037 | marker->active_next->active_prev = marker; |
|
|
1038 | |
|
|
1039 | marker->active_prev = NULL; |
|
|
1040 | active_objects = marker; |
|
|
1041 | |
|
|
1042 | while (marker->active_next) |
|
|
1043 | { |
280 | { |
1044 | op = marker->active_next; |
|
|
1045 | |
|
|
1046 | /* Move marker forward - swap op and marker */ |
|
|
1047 | op->active_prev = marker->active_prev; |
|
|
1048 | |
|
|
1049 | if (op->active_prev) |
|
|
1050 | op->active_prev->active_next = op; |
|
|
1051 | else |
|
|
1052 | active_objects = op; |
|
|
1053 | |
|
|
1054 | marker->active_next = op->active_next; |
|
|
1055 | |
|
|
1056 | if (marker->active_next) |
|
|
1057 | marker->active_next->active_prev = marker; |
|
|
1058 | |
|
|
1059 | marker->active_prev = op; |
|
|
1060 | op->active_next = marker; |
|
|
1061 | |
|
|
1062 | /* Now process op */ |
281 | /* Now process op */ |
1063 | if (QUERY_FLAG (op, FLAG_FREED)) |
282 | if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
1064 | { |
283 | { |
1065 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
284 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
1066 | op->speed = 0; |
285 | op->set_speed (0); |
1067 | update_ob_speed (op); |
|
|
1068 | continue; |
286 | continue; |
1069 | } |
287 | } |
1070 | |
288 | |
1071 | /* I've seen occasional crashes due to this - the object is removed, |
289 | if (expect_false (!op->has_active_speed ())) |
1072 | * and thus the map it points to (last map it was on) may be bogus |
|
|
1073 | * The real bug is to try to find out the cause of this - someone |
|
|
1074 | * is probably calling remove_ob without either an insert_ob or |
|
|
1075 | * free_object afterwards, leaving an object dangling. But I'd |
|
|
1076 | * rather log this and continue on instead of crashing. |
|
|
1077 | * Don't remove players - when a player quits, the object is in |
|
|
1078 | * sort of a limbo, of removed, but something we want to keep |
|
|
1079 | * around. |
|
|
1080 | */ |
290 | { |
1081 | if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY) |
|
|
1082 | { |
|
|
1083 | LOG (llevError, "BUG: process_events(): Removed object on list\n"); |
291 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
1084 | char *dump = dump_object (op); |
292 | "but is on active list\n", op->debug_desc (), op->speed); |
1085 | LOG (llevError, dump); |
293 | op->set_speed (0); |
1086 | free (dump); |
|
|
1087 | op->destroy (); |
|
|
1088 | continue; |
294 | continue; |
1089 | } |
295 | } |
1090 | |
296 | |
1091 | if (!op->speed) |
297 | if (expect_false (op->flag [FLAG_REMOVED])) |
1092 | { |
|
|
1093 | LOG (llevError, "BUG: process_events(): Object %s has no speed, " |
|
|
1094 | "but is on active list\n", &op->arch->name); |
|
|
1095 | update_ob_speed (op); |
|
|
1096 | continue; |
|
|
1097 | } |
298 | { |
1098 | |
299 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
1099 | if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) |
300 | op->debug_desc ()); |
1100 | { |
|
|
1101 | LOG (llevError, "BUG: process_events(): Object without map or " |
|
|
1102 | "inventory is on active list: %s (%d)\n", &op->name, op->count); |
|
|
1103 | op->speed = 0; |
301 | op->set_speed (0); |
1104 | update_ob_speed (op); |
|
|
1105 | continue; |
302 | continue; |
1106 | } |
303 | } |
1107 | |
304 | |
1108 | /* Animate the object. Bug or feature that anim_speed |
305 | /* Animate the object. Bug or feature that anim_speed |
1109 | * is based on ticks, and not the creatures speed? |
306 | * is based on ticks, and not the creatures speed? |
1110 | */ |
307 | */ |
1111 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
308 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
1112 | { |
309 | { |
1113 | if ((op->type == PLAYER)) |
|
|
1114 | animate_object (op, op->facing); |
|
|
1115 | else |
|
|
1116 | animate_object (op, op->direction); |
310 | animate_object (op, op->contr ? op->facing : op->direction); |
1117 | |
|
|
1118 | op->last_anim = 1; |
311 | op->last_anim = 1; |
1119 | } |
312 | } |
1120 | else |
313 | else |
1121 | op->last_anim++; |
314 | ++op->last_anim; |
1122 | |
315 | |
1123 | if (op->speed_left > 0) |
316 | if (expect_false (op->speed_left > 0.f)) |
1124 | { |
|
|
1125 | #if 0 |
|
|
1126 | /* I've seen occasional crashes in move_symptom() with it |
|
|
1127 | * crashing because op is removed - add some debugging to |
|
|
1128 | * track if it is removed at this point. |
|
|
1129 | * This unfortunately is a bit too verbose it seems - not sure |
|
|
1130 | * why - I think what happens is a map is freed or something and |
|
|
1131 | * some objects get 'lost' - removed never to be reclaimed. |
|
|
1132 | * removed objects generally shouldn't exist. |
|
|
1133 | */ |
|
|
1134 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1135 | { |
317 | { |
1136 | LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null"); |
|
|
1137 | } |
|
|
1138 | #endif |
|
|
1139 | --op->speed_left; |
318 | --op->speed_left; |
1140 | process_object (op); |
319 | process_object (op); |
1141 | |
|
|
1142 | if (op->destroyed ()) |
|
|
1143 | continue; |
|
|
1144 | } |
320 | } |
1145 | |
321 | |
1146 | if (settings.casting_time == TRUE && op->casting_time > 0) |
322 | if (expect_true (!op->contr)) |
1147 | op->casting_time--; |
323 | op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
1148 | |
|
|
1149 | if (op->speed_left <= 0) |
|
|
1150 | op->speed_left += FABS (op->speed); |
|
|
1151 | } |
324 | } |
1152 | |
325 | |
1153 | /* Remove marker object from active list */ |
326 | process_players2 (); |
1154 | if (marker->active_prev != NULL) |
327 | } |
1155 | marker->active_prev->active_next = NULL; |
328 | |
|
|
329 | /* clean up everything before exiting */ |
|
|
330 | void |
|
|
331 | emergency_save () |
|
|
332 | { |
|
|
333 | LOG (llevDebug, "emergency save begin.\n"); |
|
|
334 | |
|
|
335 | cfperl_emergency_save (); |
|
|
336 | |
|
|
337 | LOG (llevDebug, "saving book archive.\n"); |
|
|
338 | write_book_archive (); |
|
|
339 | |
|
|
340 | LOG (llevDebug, "emergency save done.\n"); |
|
|
341 | } |
|
|
342 | |
|
|
343 | // send all clients some informational text |
|
|
344 | static void |
|
|
345 | cleanup_inform (const char *cause, bool make_core) |
|
|
346 | { |
|
|
347 | int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
|
|
348 | |
|
|
349 | new_draw_info_format (flags, 0, 0, "The server will now shutdown."); |
|
|
350 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); |
|
|
351 | |
|
|
352 | if (make_core) |
|
|
353 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved."); |
1156 | else |
354 | else |
1157 | active_objects = NULL; |
355 | new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now."); |
1158 | |
356 | |
1159 | process_players2 (); |
357 | new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); |
1160 | } |
|
|
1161 | |
358 | |
1162 | void |
359 | client::flush_sockets (); |
1163 | clean_tmp_files (void) |
|
|
1164 | { |
|
|
1165 | maptile *m, *next; |
|
|
1166 | |
|
|
1167 | LOG (llevInfo, "Cleaning up...\n"); |
|
|
1168 | |
|
|
1169 | /* We save the maps - it may not be intuitive why, but if there are unique |
|
|
1170 | * items, we need to save the map so they get saved off. Perhaps we should |
|
|
1171 | * just make a special function that only saves the unique items. |
|
|
1172 | */ |
|
|
1173 | for (m = first_map; m; m = next) |
|
|
1174 | { |
|
|
1175 | next = m->next; |
|
|
1176 | |
|
|
1177 | if (m->in_memory == MAP_IN_MEMORY) |
|
|
1178 | { |
|
|
1179 | /* If we want to reuse the temp maps, swap it out (note that will also |
|
|
1180 | * update the log file. |
|
|
1181 | */ |
|
|
1182 | |
|
|
1183 | swap_map (m); |
|
|
1184 | } |
|
|
1185 | } |
|
|
1186 | |
|
|
1187 | write_todclock (); /* lets just write the clock here */ |
|
|
1188 | } |
360 | } |
1189 | |
361 | |
1190 | /* clean up everything before exiting */ |
362 | /* clean up everything before exiting */ |
1191 | void |
363 | void |
1192 | cleanup (bool make_core) |
364 | cleanup (const char *cause, bool make_core) |
1193 | { |
365 | { |
1194 | LOG (llevDebug, "Cleanup called.\n"); |
|
|
1195 | |
|
|
1196 | if (init_done) |
|
|
1197 | { |
|
|
1198 | for (player *pl = first_player; pl; pl = pl->next) |
|
|
1199 | pl->save (1); |
|
|
1200 | |
|
|
1201 | for (player *pl = first_player; pl; pl = pl->next) |
|
|
1202 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
1203 | leave_map (pl->ob); |
|
|
1204 | |
|
|
1205 | clean_tmp_files (); |
|
|
1206 | write_book_archive (); |
|
|
1207 | |
|
|
1208 | INVOKE_GLOBAL (CLEANUP); |
|
|
1209 | } |
|
|
1210 | |
|
|
1211 | if (make_core) |
366 | if (make_core) |
1212 | abort (); |
367 | fork_abort (cause); |
|
|
368 | |
|
|
369 | LOG (llevError, "cleanup cause: %s\n", cause); |
|
|
370 | |
|
|
371 | if (!make_core) |
|
|
372 | cleanup_inform (cause, make_core); |
|
|
373 | |
|
|
374 | LOG (llevDebug, "cleanup begin.\n"); |
|
|
375 | |
|
|
376 | if (init_done && !in_cleanup) |
|
|
377 | { |
|
|
378 | in_cleanup = true; |
|
|
379 | emergency_save (); |
|
|
380 | } |
1213 | else |
381 | else |
1214 | _exit (0); |
382 | in_cleanup = true; |
1215 | } |
|
|
1216 | |
383 | |
1217 | void |
384 | LOG (llevDebug, "running cleanup handlers.\n"); |
1218 | leave (player *pl, int draw_exit) |
385 | INVOKE_GLOBAL (CLEANUP); |
1219 | { |
|
|
1220 | if (pl) |
|
|
1221 | { |
|
|
1222 | if (pl->ob->type != DEAD_OBJECT) |
|
|
1223 | { |
|
|
1224 | /* If a hidden dm dropped connection do not create |
|
|
1225 | * inconsistencies by showing that they have left the game |
|
|
1226 | */ |
|
|
1227 | if (!(QUERY_FLAG (pl->ob, FLAG_WIZ) && pl->ob->contr->hidden) |
|
|
1228 | && draw_exit) |
|
|
1229 | { |
|
|
1230 | if (pl->ob->map) |
|
|
1231 | { |
|
|
1232 | INVOKE_PLAYER (LOGOUT, pl); |
|
|
1233 | LOG (llevInfo, "LOGOUT: Player named %s from ip %s\n", &pl->ob->name, pl->ns->host); |
|
|
1234 | } |
|
|
1235 | |
386 | |
1236 | char buf[MAX_BUF]; |
387 | LOG (llevDebug, "cleanup done.\n"); |
1237 | |
388 | |
1238 | sprintf (buf, "%s left the game.", &pl->ob->name); |
389 | log_cleanup (); |
1239 | new_draw_info (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, 0, buf); |
|
|
1240 | } |
|
|
1241 | |
390 | |
1242 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
391 | if (make_core) |
1243 | leave_map (pl->ob); |
392 | cleanup_inform (cause, make_core); |
1244 | |
393 | else |
1245 | pl->ob->type = DEAD_OBJECT; /* To avoid problems with inventory window */ |
|
|
1246 | } |
|
|
1247 | |
|
|
1248 | /* We do this so that the socket handling routine can do the final |
|
|
1249 | * cleanup. We also leave that loop to actually handle the freeing |
|
|
1250 | * of the data. |
|
|
1251 | */ |
|
|
1252 | if (pl->ns) |
|
|
1253 | pl->ns->destroy (); |
|
|
1254 | |
|
|
1255 | } |
394 | { |
1256 | } |
395 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting."); |
1257 | |
396 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); |
1258 | int |
397 | client::flush_sockets (); |
1259 | forbid_play (void) |
|
|
1260 | { |
|
|
1261 | #if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE) |
|
|
1262 | char buf[MAX_BUF], day[MAX_BUF]; |
|
|
1263 | FILE *fp; |
|
|
1264 | time_t clock; |
|
|
1265 | struct tm *tm; |
|
|
1266 | int i, start, stop, forbit = 0, comp; |
|
|
1267 | |
|
|
1268 | clock = time (NULL); |
|
|
1269 | tm = (struct tm *) localtime (&clock); |
|
|
1270 | |
|
|
1271 | sprintf (buf, "%s/%s", settings.confdir, PERM_FILE); |
|
|
1272 | if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
|
|
1273 | return 0; |
|
|
1274 | |
|
|
1275 | while (fgets (buf, MAX_BUF, fp)) |
|
|
1276 | { |
398 | } |
1277 | if (buf[0] == '#') |
|
|
1278 | continue; |
|
|
1279 | if (!strncmp (buf, "msg", 3)) |
|
|
1280 | { |
|
|
1281 | if (forbit) |
|
|
1282 | while (fgets (buf, MAX_BUF, fp)) /* print message */ |
|
|
1283 | fputs (buf, logfile); |
|
|
1284 | break; |
|
|
1285 | |
399 | |
1286 | } |
400 | cfperl_cleanup (make_core); |
1287 | else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
401 | _exit (make_core); |
1288 | { |
|
|
1289 | LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
|
|
1290 | continue; |
|
|
1291 | } |
|
|
1292 | |
|
|
1293 | for (i = 0; i < 7; i++) |
|
|
1294 | { |
|
|
1295 | if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop)) |
|
|
1296 | forbit = 1; |
|
|
1297 | } |
|
|
1298 | } |
|
|
1299 | |
|
|
1300 | close_and_delete (fp, comp); |
|
|
1301 | |
|
|
1302 | return forbit; |
|
|
1303 | #else |
|
|
1304 | return 0; |
|
|
1305 | #endif |
|
|
1306 | } |
402 | } |
1307 | |
403 | |
1308 | /* |
404 | /* |
1309 | * do_specials() is a collection of functions to call from time to time. |
405 | * do_specials() is a collection of functions to call from time to time. |
1310 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
406 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
1311 | * often to do things. This will allow us to spred them out more often. |
407 | * often to do things. This will allow us to spred them out more often. |
1312 | * I use prime numbers for the factor count - in that way, it is less likely |
408 | * I use prime numbers for the factor count - in that way, it is less likely |
1313 | * these actions will fall on the same tick (compared to say using 500/2500/15000 |
409 | * these actions will fall on the same tick (compared to say using 500/2500/15000 |
1314 | * which would mean on that 15,000 tick count a whole bunch of stuff gets |
410 | * which would mean on that 15,000 tick count a whole bunch of stuff gets |
… | |
… | |
1316 | * done on the same tick, but that will happen very infrequently |
412 | * done on the same tick, but that will happen very infrequently |
1317 | * |
413 | * |
1318 | * I also think this code makes it easier to see how often we really are |
414 | * I also think this code makes it easier to see how often we really are |
1319 | * doing the various things. |
415 | * doing the various things. |
1320 | */ |
416 | */ |
1321 | |
|
|
1322 | extern unsigned long todtick; |
|
|
1323 | |
|
|
1324 | void |
417 | void |
1325 | do_specials (void) |
418 | do_specials (void) |
1326 | { |
419 | { |
1327 | if (!(pticks % PTICKS_PER_CLOCK)) |
|
|
1328 | tick_the_clock (); |
|
|
1329 | |
|
|
1330 | if (!(pticks % 7)) |
|
|
1331 | shstr::gc (); |
420 | shstr::gc (); |
|
|
421 | archetype::gc (); |
1332 | |
422 | |
1333 | if (!(pticks % 79)) |
423 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
1334 | flush_old_maps (); /* Clears the tmp-files of maps which have reset */ |
424 | adjust_daylight (); |
1335 | |
425 | |
1336 | if (!(pticks % 2503)) |
426 | if (expect_false (!(pticks % 2503))) |
1337 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
427 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
1338 | |
428 | |
1339 | if (!(pticks % 5003)) |
429 | if (expect_false (!(pticks % 5003))) |
1340 | write_book_archive (); |
430 | write_book_archive (); |
1341 | |
431 | |
1342 | if (!(pticks % 5009)) |
432 | if (expect_false (!(pticks % 5009))) |
1343 | clean_friendly_list (); |
433 | clean_friendly_list (); |
1344 | |
434 | |
1345 | if (!(pticks % 5011)) |
435 | if (expect_false (!(pticks % 5011))) |
1346 | obsolete_parties (); |
436 | obsolete_parties (); |
1347 | |
437 | |
1348 | if (!(pticks % 12503)) |
438 | if (expect_false (!(pticks % 12503))) |
1349 | fix_luck (); |
439 | fix_luck (); |
1350 | } |
440 | } |
1351 | |
441 | |
1352 | void |
442 | void |
1353 | server_tick () |
443 | server_tick () |
1354 | { |
444 | { |
1355 | nroferrors = 0; |
|
|
1356 | |
|
|
1357 | // first do the user visible stuff |
445 | // first do the user visible stuff |
1358 | doeric_server (); |
|
|
1359 | INVOKE_GLOBAL (CLOCK); |
446 | INVOKE_GLOBAL (CLOCK); |
1360 | process_events (); /* "do" something with objects with speed */ |
447 | process_events (); // "do" something with objects with speed |
1361 | flush_sockets (); |
448 | client::clock (); // draw client maps etc. |
1362 | |
449 | |
1363 | // then do some bookkeeping, should not really be here |
450 | // then do some bookkeeping, should not really be here |
1364 | check_active_maps (); /* Removes unused maps after a certain timeout */ |
|
|
1365 | do_specials (); /* Routines called from time to time. */ |
451 | do_specials (); /* Routines called from time to time. */ |
1366 | object::free_mortals (); |
452 | attachable::check_mortals (); |
1367 | |
453 | |
1368 | ++pticks; |
454 | ++pticks; |
|
|
455 | } |
|
|
456 | |
|
|
457 | #if 0 |
|
|
458 | // used fro benchmarking (x86/amd64-specific) |
|
|
459 | typedef unsigned long tval; |
|
|
460 | typedef unsigned long long stamp64; |
|
|
461 | |
|
|
462 | extern inline tval |
|
|
463 | stamp (void) |
|
|
464 | { |
|
|
465 | tval tsc; |
|
|
466 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
467 | |
|
|
468 | return tsc; |
|
|
469 | } |
|
|
470 | |
|
|
471 | extern inline tval |
|
|
472 | measure (tval t) |
|
|
473 | { |
|
|
474 | tval tsc; |
|
|
475 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
476 | |
|
|
477 | if (tsc > t) |
|
|
478 | return tsc - t; |
|
|
479 | else |
|
|
480 | return t - tsc; |
1369 | } |
481 | } |
1370 | |
482 | |
1371 | int |
483 | int |
1372 | main (int argc, char **argv) |
484 | main (int argc, char **argv) |
1373 | { |
485 | { |
|
|
486 | rand_gen rg(0); |
|
|
487 | tval fastest = 0x7fffffff; |
|
|
488 | for (int loop = 10000; loop--; ) |
|
|
489 | { |
|
|
490 | tval s = stamp (); |
|
|
491 | volatile int i = rg.get_int(25); |
|
|
492 | fastest = min (fastest, measure (s)); |
|
|
493 | } |
|
|
494 | |
|
|
495 | //printf ("fastest %d\n", fastest); |
|
|
496 | for (int i = 0; i < 1024*1024*3; ++i) |
|
|
497 | { |
|
|
498 | char c = rg.get_int (256); |
|
|
499 | write (2, &c, 1); |
|
|
500 | } |
|
|
501 | } |
|
|
502 | |
|
|
503 | #else |
|
|
504 | |
|
|
505 | #if 0 // just goofing around, look elsewhere |
|
|
506 | |
|
|
507 | #include <malloc.h> |
|
|
508 | #include <execinfo.h> |
|
|
509 | |
|
|
510 | static void tr_on (); |
|
|
511 | static void tr_off (); |
|
|
512 | |
|
|
513 | static SMUTEX(tr_mutex); |
|
|
514 | |
|
|
515 | #define ltr_off() SMUTEX_LOCK (tr_mutex); tr_off () |
|
|
516 | #define ltr_on() tr_on (); SMUTEX_UNLOCK (tr_mutex); |
|
|
517 | |
|
|
518 | static void * |
|
|
519 | tr_malloc (size_t size, const void *caller) |
|
|
520 | { |
|
|
521 | ltr_off (); |
|
|
522 | |
|
|
523 | void *bt [8]; |
|
|
524 | backtrace (bt, 8); |
|
|
525 | |
|
|
526 | void *ptr = malloc (size); |
|
|
527 | |
|
|
528 | ltr_on (); |
|
|
529 | return (char *)ptr; |
|
|
530 | } |
|
|
531 | |
|
|
532 | static void |
|
|
533 | tr_free (void *ptr, const void *caller) |
|
|
534 | { |
|
|
535 | ltr_off (); |
|
|
536 | |
|
|
537 | free (ptr); |
|
|
538 | |
|
|
539 | ltr_on (); |
|
|
540 | } |
|
|
541 | |
|
|
542 | void static * |
|
|
543 | tr_realloc (void *ptr, size_t size, const void *caller) |
|
|
544 | { |
|
|
545 | ltr_off (); |
|
|
546 | |
|
|
547 | void *nptr = realloc (ptr, size); |
|
|
548 | |
|
|
549 | ltr_on (); |
|
|
550 | return nptr; |
|
|
551 | } |
|
|
552 | |
|
|
553 | static void * |
|
|
554 | tr_memalign (size_t size, size_t alignment, const void *caller) |
|
|
555 | { |
|
|
556 | ltr_off (); |
|
|
557 | |
|
|
558 | void *ptr = memalign (size, alignment < 16 ? 16 : alignment); |
|
|
559 | |
|
|
560 | ltr_on (); |
|
|
561 | return ptr; |
|
|
562 | } |
|
|
563 | |
|
|
564 | static void |
|
|
565 | tr_on () |
|
|
566 | { |
|
|
567 | __malloc_hook = tr_malloc; |
|
|
568 | __realloc_hook = tr_realloc; |
|
|
569 | __free_hook = tr_free; |
|
|
570 | __memalign_hook = tr_memalign; |
|
|
571 | } |
|
|
572 | |
|
|
573 | static void |
|
|
574 | tr_off () |
|
|
575 | { |
|
|
576 | __malloc_hook = 0; |
|
|
577 | __realloc_hook = 0; |
|
|
578 | __free_hook = 0; |
|
|
579 | __memalign_hook = 0; |
|
|
580 | } |
|
|
581 | |
|
|
582 | void (*__malloc_initialize_hook)(void) = tr_on; |
|
|
583 | |
|
|
584 | #endif |
|
|
585 | |
|
|
586 | // normal main |
|
|
587 | int |
|
|
588 | main (int argc, char **argv) |
|
|
589 | { |
1374 | settings.argc = argc; |
590 | settings.argc = argc; |
1375 | settings.argv = argv; |
591 | settings.argv = argv; |
1376 | |
592 | |
|
|
593 | g_thread_init (0); // for the slice allocator only |
|
|
594 | |
1377 | init (argc, argv); |
595 | init (argc, argv); |
1378 | |
|
|
1379 | initPlugins (); |
|
|
1380 | |
596 | |
1381 | for (;;) |
597 | for (;;) |
1382 | cfperl_main (); |
598 | cfperl_main (); |
1383 | |
|
|
1384 | // unreached |
|
|
1385 | emergency_save (0); |
|
|
1386 | cleanup (); |
|
|
1387 | |
|
|
1388 | return 0; |
|
|
1389 | } |
599 | } |
|
|
600 | #endif |
|
|
601 | |
|
|
602 | #if 0 |
|
|
603 | int xyzzy () |
|
|
604 | { |
|
|
605 | return rndm(8); |
|
|
606 | } |
|
|
607 | |
|
|
608 | void xyzzy (object_ptr &a, object_ptr &o) |
|
|
609 | { |
|
|
610 | asm volatile ("int3"); |
|
|
611 | a = o; |
|
|
612 | asm volatile ("int3"); |
|
|
613 | } |
|
|
614 | #endif |
|
|
615 | |