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