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