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