ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/server/main.C
(Generate patch)

Comparing deliantra/server/server/main.C (file contents):
Revision 1.4 by root, Thu Aug 24 13:13:49 2006 UTC vs.
Revision 1.22 by root, Sat Sep 9 21:48:29 2006 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines