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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.25 by root, Mon Sep 4 17:36:12 2006 UTC vs.
Revision 1.46 by root, Wed Dec 20 11:36:38 2006 UTC

1/*
2 * static char *rcsid_map_c =
3 * "$Id: map.C,v 1.25 2006/09/04 17:36:12 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 24
30#include <global.h> 25#include <global.h>
31#include <funcpoint.h> 26#include <funcpoint.h>
32 27
33#include <loader.h> 28#include <loader.h>
34#ifndef WIN32 /* ---win32 exclude header */
35#include <unistd.h> 29#include <unistd.h>
36#endif /* win32 */
37 30
38#include "path.h" 31#include "path.h"
39 32
40
41extern int nrofallocobjects,nroffreeobjects;
42
43/* 33/*
44 * Returns the mapstruct which has a name matching the given argument. 34 * Returns the maptile which has a name matching the given argument.
45 * return NULL if no match is found. 35 * return NULL if no match is found.
46 */ 36 */
47 37
38maptile *
48mapstruct *has_been_loaded (const char *name) { 39has_been_loaded (const char *name)
49 mapstruct *map; 40{
41 maptile *map;
50 42
51 if (!name || !*name) 43 if (!name || !*name)
52 return 0; 44 return 0;
53 for (map = first_map; map; map = map->next) 45 for (map = first_map; map; map = map->next)
54 if (!strcmp (name, map->path)) 46 if (!strcmp (name, map->path))
55 break; 47 break;
56 return (map); 48 return (map);
57} 49}
58 50
59/* 51/*
60 * This makes a path absolute outside the world of Crossfire. 52 * This makes a path absolute outside the world of Crossfire.
61 * In other words, it prepends LIBDIR/MAPDIR/ to the given path 53 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
62 * and returns the pointer to a static array containing the result. 54 * and returns the pointer to a static array containing the result.
63 * it really should be called create_mapname 55 * it really should be called create_mapname
64 */ 56 */
65 57
58const char *
66const char *create_pathname (const char *name) { 59create_pathname (const char *name)
60{
67 static char buf[MAX_BUF]; 61 static char buf[MAX_BUF];
68 62
69 /* Why? having extra / doesn't confuse unix anyplace? Dependancies 63 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
70 * someplace else in the code? msw 2-17-97 64 * someplace else in the code? msw 2-17-97
71 */ 65 */
72 if (*name == '/') 66 if (*name == '/')
73 sprintf (buf, "%s/%s%s", settings.datadir, settings.mapdir, name); 67 sprintf (buf, "%s/%s%s", settings.datadir, settings.mapdir, name);
74 else 68 else
75 sprintf (buf, "%s/%s/%s", settings.datadir, settings.mapdir, name); 69 sprintf (buf, "%s/%s/%s", settings.datadir, settings.mapdir, name);
76 return (buf); 70 return (buf);
77} 71}
78 72
79/* 73/*
80 * same as create_pathname, but for the overlay maps. 74 * same as create_pathname, but for the overlay maps.
81 */ 75 */
82 76
77const char *
83const char *create_overlay_pathname (const char *name) { 78create_overlay_pathname (const char *name)
79{
84 static char buf[MAX_BUF]; 80 static char buf[MAX_BUF];
85 81
86 /* Why? having extra / doesn't confuse unix anyplace? Dependancies 82 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
87 * someplace else in the code? msw 2-17-97 83 * someplace else in the code? msw 2-17-97
88 */ 84 */
89 if (*name == '/') 85 if (*name == '/')
90 sprintf (buf, "%s/%s%s", settings.localdir, settings.mapdir, name); 86 sprintf (buf, "%s/%s%s", settings.localdir, settings.mapdir, name);
91 else 87 else
92 sprintf (buf, "%s/%s/%s", settings.localdir, settings.mapdir, name); 88 sprintf (buf, "%s/%s/%s", settings.localdir, settings.mapdir, name);
93 return (buf); 89 return (buf);
94} 90}
95 91
96/* 92/*
97 * same as create_pathname, but for the template maps. 93 * same as create_pathname, but for the template maps.
98 */ 94 */
99 95
96const char *
100const char *create_template_pathname (const char *name) { 97create_template_pathname (const char *name)
98{
101 static char buf[MAX_BUF]; 99 static char buf[MAX_BUF];
102 100
103 /* Why? having extra / doesn't confuse unix anyplace? Dependancies 101 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
104 * someplace else in the code? msw 2-17-97 102 * someplace else in the code? msw 2-17-97
105 */ 103 */
106 if (*name == '/') 104 if (*name == '/')
107 sprintf (buf, "%s/%s%s", settings.localdir, settings.templatedir, name); 105 sprintf (buf, "%s/%s%s", settings.localdir, settings.templatedir, name);
108 else 106 else
109 sprintf (buf, "%s/%s/%s", settings.localdir, settings.templatedir, name); 107 sprintf (buf, "%s/%s/%s", settings.localdir, settings.templatedir, name);
110 return (buf); 108 return (buf);
111} 109}
112 110
113/* 111/*
114 * This makes absolute path to the itemfile where unique objects 112 * This makes absolute path to the itemfile where unique objects
115 * will be saved. Converts '/' to '@'. I think it's essier maintain 113 * will be saved. Converts '/' to '@'. I think it's essier maintain
116 * files than full directory structure, but if this is problem it can 114 * files than full directory structure, but if this is problem it can
117 * be changed. 115 * be changed.
118 */ 116 */
117static const char *
119static const char *create_items_path (const char *s) { 118create_items_path (const char *s)
119{
120 static char buf[MAX_BUF]; 120 static char buf[MAX_BUF];
121 char *t; 121 char *t;
122 122
123 if (*s == '/')
124 s++;
125
126 sprintf (buf, "%s/%s/", settings.localdir, settings.uniquedir);
127
128 for (t = buf + strlen (buf); *s; s++, t++)
123 if (*s == '/') 129 if (*s == '/')
124 s++;
125
126 sprintf (buf, "%s/%s/", settings.localdir, settings.uniquedir);
127
128 for (t=buf+strlen(buf); *s; s++,t++)
129 if (*s == '/')
130 *t = '@'; 130 *t = '@';
131 else 131 else
132 *t = *s; 132 *t = *s;
133 *t = 0; 133 *t = 0;
134 return (buf); 134 return (buf);
135} 135}
136 136
137 137
138/* 138/*
139 * This function checks if a file with the given path exists. 139 * This function checks if a file with the given path exists.
… …
149 * when the editor goes away, the call to stat should probably be 149 * when the editor goes away, the call to stat should probably be
150 * replaced by an access instead (similar to the windows one, but 150 * replaced by an access instead (similar to the windows one, but
151 * that seems to be missing the prepend_dir processing 151 * that seems to be missing the prepend_dir processing
152 */ 152 */
153 153
154int
154int check_path (const char *name, int prepend_dir) 155check_path (const char *name, int prepend_dir)
155{ 156{
156 char buf[MAX_BUF]; 157 char buf[MAX_BUF];
157#ifndef WIN32 158
158 char *endbuf; 159 char *endbuf;
159 struct stat statbuf; 160 struct stat statbuf;
160 int mode = 0, i; 161 int mode = 0;
161#endif
162 162
163 if (prepend_dir) 163 if (prepend_dir)
164 strcpy (buf, create_pathname(name)); 164 strcpy (buf, create_pathname (name));
165 else 165 else
166 strcpy(buf, name); 166 strcpy (buf, name);
167#ifdef WIN32 /* ***win32: check this sucker in windows style. */
168 return(_access(buf,0));
169#else
170 167
171 /* old method (strchr(buf, '\0')) seemd very odd to me - 168 /* old method (strchr(buf, '\0')) seemd very odd to me -
172 * this method should be equivalant and is clearer. 169 * this method should be equivalant and is clearer.
173 * Can not use strcat because we need to cycle through 170 * Can not use strcat because we need to cycle through
174 * all the names. 171 * all the names.
175 */ 172 */
176 endbuf = buf + strlen(buf); 173 endbuf = buf + strlen (buf);
177 174
178 if (stat (buf, &statbuf)) 175 if (stat (buf, &statbuf))
179 return -1; 176 return -1;
180 if (!S_ISREG (statbuf.st_mode)) 177 if (!S_ISREG (statbuf.st_mode))
181 return (-1); 178 return (-1);
182 179
183 if (((statbuf.st_mode & S_IRGRP) && getegid() == statbuf.st_gid) || 180 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
184 ((statbuf.st_mode & S_IRUSR) && geteuid() == statbuf.st_uid) || 181 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
185 (statbuf.st_mode & S_IROTH))
186 mode |= 4; 182 mode |= 4;
187 183
188 if ((statbuf.st_mode & S_IWGRP && getegid() == statbuf.st_gid) || 184 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
189 (statbuf.st_mode & S_IWUSR && geteuid() == statbuf.st_uid) || 185 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
190 (statbuf.st_mode & S_IWOTH))
191 mode |= 2; 186 mode |= 2;
192 187
193 return (mode); 188 return (mode);
194#endif
195} 189}
196 190
197/* 191/*
198 * Prints out debug-information about a map. 192 * Prints out debug-information about a map.
199 * Dumping these at llevError doesn't seem right, but is 193 * Dumping these at llevError doesn't seem right, but is
200 * necessary to make sure the information is in fact logged. 194 * necessary to make sure the information is in fact logged.
201 */ 195 */
202 196
203void dump_map(const mapstruct *m) { 197void
198dump_map (const maptile *m)
199{
204 LOG(llevError,"Map %s status: %d.\n",m->path,m->in_memory); 200 LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory);
205 LOG(llevError,"Size: %dx%d Start: %d,%d\n", 201 LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m));
206 MAP_WIDTH(m), MAP_HEIGHT(m),
207 MAP_ENTER_X(m), MAP_ENTER_Y(m));
208 202
209 if(m->msg!=NULL) 203 if (m->msg != NULL)
210 LOG(llevError,"Message:\n%s",m->msg); 204 LOG (llevError, "Message:\n%s", m->msg);
211 205
212 if(m->maplore!=NULL) 206 if (m->maplore != NULL)
213 LOG(llevError,"Lore:\n%s",m->maplore); 207 LOG (llevError, "Lore:\n%s", m->maplore);
214 208
215 if(m->tmpname!=NULL) 209 if (m->tmpname != NULL)
216 LOG(llevError,"Tmpname: %s\n",m->tmpname); 210 LOG (llevError, "Tmpname: %s\n", m->tmpname);
217 211
218 LOG(llevError,"Difficulty: %d\n",m->difficulty); 212 LOG (llevError, "Difficulty: %d\n", m->difficulty);
219 LOG(llevError,"Darkness: %d\n",m->darkness); 213 LOG (llevError, "Darkness: %d\n", m->darkness);
220} 214}
221 215
222/* 216/*
223 * Prints out debug-information about all maps. 217 * Prints out debug-information about all maps.
224 * This basically just goes through all the maps and calls 218 * This basically just goes through all the maps and calls
225 * dump_map on each one. 219 * dump_map on each one.
226 */ 220 */
227 221
222void
228void dump_all_maps(void) { 223dump_all_maps (void)
229 mapstruct *m; 224{
230 for(m=first_map;m!=NULL;m=m->next) { 225 maptile *m;
226
227 for (m = first_map; m; m = m->next)
231 dump_map(m); 228 dump_map (m);
232 }
233} 229}
234 230
235/* This rolls up wall, blocks_magic, blocks_view, etc, all into 231/* This rolls up wall, blocks_magic, blocks_view, etc, all into
236 * one function that just returns a P_.. value (see map.h) 232 * one function that just returns a P_.. value (see map.h)
237 * it will also do map translation for tiled maps, returning 233 * it will also do map translation for tiled maps, returning
… …
240 * by a P_NEW_MAP value, another call to get_map_from_coord 236 * by a P_NEW_MAP value, another call to get_map_from_coord
241 * is needed. The case of not passing values is if we're just 237 * is needed. The case of not passing values is if we're just
242 * checking for the existence of something on those spaces, but 238 * checking for the existence of something on those spaces, but
243 * don't expect to insert/remove anything from those spaces. 239 * don't expect to insert/remove anything from those spaces.
244 */ 240 */
241int
245int get_map_flags(mapstruct *oldmap, mapstruct **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny) 242get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny)
246{ 243{
247 sint16 newx, newy; 244 sint16 newx, newy;
248 int retval=0; 245 int retval = 0;
249 mapstruct *mp; 246 maptile *mp;
250 247
251 if (out_of_map(oldmap, x, y)) return P_OUT_OF_MAP;
252 newx = x; 248 newx = x;
253 newy = y; 249 newy = y;
250
254 mp = get_map_from_coord(oldmap, &newx, &newy); 251 mp = get_map_from_coord (oldmap, &newx, &newy);
252
253 if (!mp)
254 return P_OUT_OF_MAP;
255
255 if (mp != oldmap) 256 if (mp != oldmap)
256 retval |= P_NEW_MAP; 257 retval |= P_NEW_MAP;
258
257 if (newmap) *newmap = mp; 259 if (newmap) *newmap = mp;
258 if (nx) *nx = newx; 260 if (nx) *nx = newx;
259 if (ny) *ny = newy; 261 if (ny) *ny = newy;
260 retval |= mp->spaces[newx + mp->width * newy].flags;
261 262
262 if (retval & P_SAFE) 263 return retval | mp->at (newx, newy).flags ();
263 retval |= P_NO_MAGIC | P_NO_CLERIC; // P_SAFE does imply these
264
265 return retval;
266} 264}
267
268 265
269/* 266/*
270 * Returns true if the given coordinate is blocked except by the 267 * Returns true if the given coordinate is blocked except by the
271 * object passed is not blocking. This is used with 268 * object passed is not blocking. This is used with
272 * multipart monsters - if we want to see if a 2x2 monster 269 * multipart monsters - if we want to see if a 2x2 monster
… …
276 * monster. 273 * monster.
277 * m, x, y are the target map/coordinates - needed for map tiling. 274 * m, x, y are the target map/coordinates - needed for map tiling.
278 * the coordinates & map passed in should have been updated for tiling 275 * the coordinates & map passed in should have been updated for tiling
279 * by the caller. 276 * by the caller.
280 */ 277 */
281 278int
282int blocked_link(object *ob, mapstruct *m, int sx, int sy) { 279blocked_link (object *ob, maptile *m, int sx, int sy)
280{
283 object *tmp; 281 object *tmp;
284 int mflags, blocked; 282 int mflags, blocked;
285 283
286 /* Make sure the coordinates are valid - they should be, as caller should 284 /* Make sure the coordinates are valid - they should be, as caller should
287 * have already checked this. 285 * have already checked this.
288 */ 286 */
289 if (OUT_OF_REAL_MAP(m, sx, sy)) { 287 if (OUT_OF_REAL_MAP (m, sx, sy))
288 {
290 LOG(llevError,"blocked_link: Passed map, x, y coordinates outside of map\n"); 289 LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");
291 return 1; 290 return 1;
292 } 291 }
293 292
294 /* Save some cycles - instead of calling get_map_flags(), just get the value 293 /* Save some cycles - instead of calling get_map_flags(), just get the value
295 * directly. 294 * directly.
296 */ 295 */
297 mflags = m->spaces[sx + m->width * sy].flags; 296 mflags = m->at (sx, sy).flags ();
298 297
299 blocked = GET_MAP_MOVE_BLOCK(m, sx, sy); 298 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);
300 299
301 /* If space is currently not blocked by anything, no need to 300 /* If space is currently not blocked by anything, no need to
302 * go further. Not true for players - all sorts of special 301 * go further. Not true for players - all sorts of special
303 * things we need to do for players. 302 * things we need to do for players.
304 */ 303 */
305 if (ob->type != PLAYER && ! (mflags & P_IS_ALIVE) && (blocked==0)) return 0; 304 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
305 return 0;
306 306
307 /* if there isn't anytyhing alive on this space, and this space isn't 307 /* if there isn't anytyhing alive on this space, and this space isn't
308 * otherwise blocked, we can return now. Only if there is a living 308 * otherwise blocked, we can return now. Only if there is a living
309 * creature do we need to investigate if it is part of this creature 309 * creature do we need to investigate if it is part of this creature
310 * or another. Likewise, only if something is blocking us do we 310 * or another. Likewise, only if something is blocking us do we
311 * need to investigate if there is a special circumstance that would 311 * need to investigate if there is a special circumstance that would
312 * let the player through (inventory checkers for example) 312 * let the player through (inventory checkers for example)
313 */ 313 */
314 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK(ob, blocked)) return 0; 314 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
315 return 0;
315 316
316 if(ob->head != NULL) 317 if (ob->head != NULL)
317 ob=ob->head; 318 ob = ob->head;
318 319
319 /* We basically go through the stack of objects, and if there is 320 /* We basically go through the stack of objects, and if there is
320 * some other object that has NO_PASS or FLAG_ALIVE set, return 321 * some other object that has NO_PASS or FLAG_ALIVE set, return
321 * true. If we get through the entire stack, that must mean 322 * true. If we get through the entire stack, that must mean
322 * ob is blocking it, so return 0. 323 * ob is blocking it, so return 0.
323 */ 324 */
324 for(tmp = GET_MAP_OB(m,sx,sy); tmp!= NULL; tmp = tmp->above) { 325 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above)
326 {
325 327
326 /* This must be before the checks below. Code for inventory checkers. */ 328 /* This must be before the checks below. Code for inventory checkers. */
327 if (tmp->type==CHECK_INV && OB_MOVE_BLOCK(ob, tmp)) { 329 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
330 {
328 /* If last_sp is set, the player/monster needs an object, 331 /* If last_sp is set, the player/monster needs an object,
329 * so we check for it. If they don't have it, they can't 332 * so we check for it. If they don't have it, they can't
330 * pass through this space. 333 * pass through this space.
331 */ 334 */
332 if (tmp->last_sp) { 335 if (tmp->last_sp)
336 {
333 if (check_inv_recursive(ob,tmp)==NULL) 337 if (check_inv_recursive (ob, tmp) == NULL)
334 return 1; 338 return 1;
335 else 339 else
336 continue; 340 continue;
337 } else {
338 /* In this case, the player must not have the object -
339 * if they do, they can't pass through.
340 */
341 if (check_inv_recursive(ob,tmp)!=NULL) /* player has object */
342 return 1;
343 else
344 continue;
345 } 341 }
346 } /* if check_inv */
347 else { 342 else
343 {
344 /* In this case, the player must not have the object -
345 * if they do, they can't pass through.
346 */
347 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
348 return 1;
349 else
350 continue;
351 }
352 } /* if check_inv */
353 else
354 {
348 /* Broke apart a big nasty if into several here to make 355 /* Broke apart a big nasty if into several here to make
349 * this more readable. first check - if the space blocks 356 * this more readable. first check - if the space blocks
350 * movement, can't move here. 357 * movement, can't move here.
351 * second - if a monster, can't move there, unles it is a 358 * second - if a monster, can't move there, unles it is a
352 * hidden dm 359 * hidden dm
353 */ 360 */
354 if (OB_MOVE_BLOCK(ob, tmp)) return 1; 361 if (OB_MOVE_BLOCK (ob, tmp))
362 return 1;
355 if (QUERY_FLAG(tmp,FLAG_ALIVE) && tmp->head != ob && tmp != ob && 363 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&
356 tmp->type != DOOR && !(QUERY_FLAG(tmp,FLAG_WIZ) && tmp->contr->hidden)) 364 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))
357 return 1; 365 return 1;
358 } 366 }
359 367
360 } 368 }
361 return 0; 369 return 0;
362} 370}
363 371
364 372
365/* 373/*
366 * Returns true if the given object can't fit in the given spot. 374 * Returns true if the given object can't fit in the given spot.
… …
386 * 394 *
387 * Note this used to be arch_blocked, but with new movement 395 * Note this used to be arch_blocked, but with new movement
388 * code, we need to have actual object to check its move_type 396 * code, we need to have actual object to check its move_type
389 * against the move_block values. 397 * against the move_block values.
390 */ 398 */
391 399int
392int ob_blocked(const object *ob,mapstruct *m,sint16 x,sint16 y) { 400ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y)
401{
393 archetype *tmp; 402 archetype *tmp;
394 int flag; 403 int flag;
395 mapstruct *m1; 404 maptile *m1;
396 sint16 sx, sy; 405 sint16 sx, sy;
397 406
398 if(ob==NULL) { 407 if (ob == NULL)
408 {
399 flag= get_map_flags(m,&m1, x,y, &sx, &sy); 409 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
400 if (flag & P_OUT_OF_MAP) return P_OUT_OF_MAP; 410 if (flag & P_OUT_OF_MAP)
411 return P_OUT_OF_MAP;
401 412
402 /* don't have object, so don't know what types would block */ 413 /* don't have object, so don't know what types would block */
403 return(GET_MAP_MOVE_BLOCK(m1, sx, sy)); 414 return (GET_MAP_MOVE_BLOCK (m1, sx, sy));
404 } 415 }
405 416
406 for(tmp=ob->arch; tmp!=NULL;tmp=tmp->more) { 417 for (tmp = ob->arch; tmp != NULL; tmp = tmp->more)
418 {
407 flag = get_map_flags(m, &m1, x+tmp->clone.x,y+tmp->clone.y, &sx, &sy); 419 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
408 420
409 if (flag & P_OUT_OF_MAP) return P_OUT_OF_MAP; 421 if (flag & P_OUT_OF_MAP)
410 if (flag & P_IS_ALIVE) return P_IS_ALIVE; 422 return P_OUT_OF_MAP;
423 if (flag & P_IS_ALIVE)
424 return P_IS_ALIVE;
411 425
412 /* find_first_free_spot() calls this function. However, often 426 /* find_first_free_spot() calls this function. However, often
413 * ob doesn't have any move type (when used to place exits) 427 * ob doesn't have any move type (when used to place exits)
414 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 428 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
415 */ 429 */
416 430
417 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK(m1, sx, sy) != MOVE_ALL) continue; 431 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK (m1, sx, sy) != MOVE_ALL)
432 continue;
418 433
419 /* Note it is intentional that we check ob - the movement type of the 434 /* Note it is intentional that we check ob - the movement type of the
420 * head of the object should correspond for the entire object. 435 * head of the object should correspond for the entire object.
421 */ 436 */
422 if (OB_TYPE_MOVE_BLOCK(ob, GET_MAP_MOVE_BLOCK(m1, sx, sy))) 437 if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy)))
423 return AB_NO_PASS; 438 return P_NO_PASS;
424
425 } 439 }
440
426 return 0; 441 return 0;
427} 442}
428 443
429/* When the map is loaded, load_object does not actually insert objects 444/* When the map is loaded, load_object does not actually insert objects
430 * into inventory, but just links them. What this does is go through 445 * into inventory, but just links them. What this does is go through
431 * and insert them properly. 446 * and insert them properly.
432 * The object 'container' is the object that contains the inventory. 447 * The object 'container' is the object that contains the inventory.
433 * This is needed so that we can update the containers weight. 448 * This is needed so that we can update the containers weight.
434 */ 449 */
435 450
451void
436void fix_container(object *container) 452fix_container (object *container)
437{ 453{
438 object *tmp=container->inv, *next; 454 object *tmp = container->inv, *next;
439 455
440 container->inv=NULL; 456 container->inv = NULL;
441 while (tmp!=NULL) { 457 while (tmp != NULL)
458 {
442 next = tmp->below; 459 next = tmp->below;
443 if (tmp->inv) 460 if (tmp->inv)
444 fix_container(tmp); 461 fix_container (tmp);
445 (void) insert_ob_in_ob(tmp,container); 462 (void) insert_ob_in_ob (tmp, container);
446 tmp = next; 463 tmp = next;
447 } 464 }
448 /* sum_weight will go through and calculate what all the containers are 465 /* sum_weight will go through and calculate what all the containers are
449 * carrying. 466 * carrying.
450 */ 467 */
451 sum_weight(container); 468 sum_weight (container);
452} 469}
453 470
454/* link_multipart_objects go through all the objects on the map looking 471/* link_multipart_objects go through all the objects on the map looking
455 * for objects whose arch says they are multipart yet according to the 472 * for objects whose arch says they are multipart yet according to the
456 * info we have, they only have the head (as would be expected when 473 * info we have, they only have the head (as would be expected when
457 * they are saved). We do have to look for the old maps that did save 474 * they are saved). We do have to look for the old maps that did save
458 * the more sections and not re-add sections for them. 475 * the more sections and not re-add sections for them.
459 */ 476 */
460 477
461static void link_multipart_objects(mapstruct *m) 478static void
479link_multipart_objects (maptile *m)
462{ 480{
463 int x,y; 481 int x, y;
464 object *tmp, *op, *last, *above; 482 object *tmp, *op, *last, *above;
465 archetype *at; 483 archetype *at;
466 484
467 for(x=0;x<MAP_WIDTH(m);x++) 485 for (x = 0; x < MAP_WIDTH (m); x++)
468 for(y=0;y<MAP_HEIGHT(m);y++) 486 for (y = 0; y < MAP_HEIGHT (m); y++)
469 for(tmp=get_map_ob(m,x,y);tmp!=NULL;tmp=above) { 487 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = above)
488 {
470 above=tmp->above; 489 above = tmp->above;
471 490
472 /* already multipart - don't do anything more */ 491 /* already multipart - don't do anything more */
473 if (tmp->head || tmp->more) continue; 492 if (tmp->head || tmp->more)
493 continue;
474 494
475 /* If there is nothing more to this object, this for loop 495 /* If there is nothing more to this object, this for loop
476 * won't do anything. 496 * won't do anything.
477 */ 497 */
478 for (at = tmp->arch->more, last=tmp; at != NULL; at=at->more, last=op) { 498 for (at = tmp->arch->more, last = tmp; at != NULL; at = at->more, last = op)
499 {
479 op = arch_to_object(at); 500 op = arch_to_object (at);
480 501
481 /* update x,y coordinates */ 502 /* update x,y coordinates */
482 op->x += tmp->x; 503 op->x += tmp->x;
483 op->y += tmp->y; 504 op->y += tmp->y;
484 op->head = tmp; 505 op->head = tmp;
485 op->map = m; 506 op->map = m;
486 last->more = op; 507 last->more = op;
487 op->name = tmp->name; 508 op->name = tmp->name;
488 op->title = tmp->title; 509 op->title = tmp->title;
489 /* we could link all the parts onto tmp, and then just 510 /* we could link all the parts onto tmp, and then just
490 * call insert_ob_in_map once, but the effect is the same, 511 * call insert_ob_in_map once, but the effect is the same,
491 * as insert_ob_in_map will call itself with each part, and 512 * as insert_ob_in_map will call itself with each part, and
492 * the coding is simpler to just to it here with each part. 513 * the coding is simpler to just to it here with each part.
493 */ 514 */
494 insert_ob_in_map(op, op->map, tmp,INS_NO_MERGE|INS_ABOVE_FLOOR_ONLY|INS_NO_WALK_ON); 515 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON);
495 } /* for at = tmp->arch->more */ 516 } /* for at = tmp->arch->more */
496 } /* for objects on this space */ 517 } /* for objects on this space */
497} 518}
498 519
499/* 520/*
500 * Loads (ands parses) the objects into a given map from the specified 521 * Loads (ands parses) the objects into a given map from the specified
501 * file pointer. 522 * file pointer.
502 * mapflags is the same as we get with load_original_map 523 * mapflags is the same as we get with load_original_map
503 */ 524 */
504void 525void
505load_objects (mapstruct *m, object_thawer &fp, int mapflags) 526load_objects (maptile *m, object_thawer & fp, int mapflags)
506{ 527{
507 int i, j; 528 int i, j;
508 int unique; 529 int unique;
509 object *op, *prev = NULL, *last_more = NULL, *otmp; 530 object *op, *prev = NULL, *last_more = NULL, *otmp;
510 531
511 op = get_object (); 532 op = object::create ();
512 op->map = m; /* To handle buttons correctly */ 533 op->map = m; /* To handle buttons correctly */
513 534
514 while ((i = load_object (fp, op, mapflags))) 535 while ((i = load_object (fp, op, mapflags)))
515 { 536 {
516 /* if the archetype for the object is null, means that we 537 /* if the archetype for the object is null, means that we
517 * got an invalid object. Don't do anything with it - the game 538 * got an invalid object. Don't do anything with it - the game
518 * or editor will not be able to do anything with it either. 539 * or editor will not be able to do anything with it either.
519 */ 540 */
520 if (op->arch == NULL) 541 if (op->arch == NULL)
521 { 542 {
522 LOG (llevDebug, "Discarding object without arch: %s\n", 543 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");
523 op->name ? (const char *) op->name : "(null)");
524 continue; 544 continue;
525 } 545 }
526 546
527 547
528 switch (i) 548 switch (i)
529 { 549 {
530 case LL_NORMAL: 550 case LL_NORMAL:
531 /* if we are loading an overlay, put the floors on the bottom */ 551 /* if we are loading an overlay, put the floors on the bottom */
532 if ((QUERY_FLAG (op, FLAG_IS_FLOOR) ||
533 QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY) 552 if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY)
534 insert_ob_in_map (op, m, op, 553 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD);
535 INS_NO_MERGE | INS_NO_WALK_ON |
536 INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD);
537 else 554 else
538 insert_ob_in_map (op, m, op, 555 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
539 INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP |
540 INS_MAP_LOAD);
541 556
542 if (op->inv) 557 if (op->inv)
543 sum_weight (op); 558 sum_weight (op);
544 559
545 prev = op, last_more = op; 560 prev = op, last_more = op;
546 break; 561 break;
547 562
548 case LL_MORE: 563 case LL_MORE:
549 insert_ob_in_map (op, m, op, 564 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY);
550 INS_NO_MERGE | INS_NO_WALK_ON |
551 INS_ABOVE_FLOOR_ONLY);
552 op->head = prev, last_more->more = op, last_more = op; 565 op->head = prev, last_more->more = op, last_more = op;
553 break; 566 break;
554 } 567 }
555 568
556 if (mapflags & MAP_STYLE) 569 if (mapflags & MAP_STYLE)
557 remove_from_active_list (op); 570 remove_from_active_list (op);
558 571
559 op = get_object (); 572 op = object::create ();
560 op->map = m; 573 op->map = m;
561 } 574 }
562 575
563 for (i = 0; i < m->width; i++) 576 for (i = 0; i < m->width; i++)
564 { 577 {
565 for (j = 0; j < m->height; j++) 578 for (j = 0; j < m->height; j++)
566 { 579 {
567 unique = 0; 580 unique = 0;
568 /* check for unique items, or unique squares */ 581 /* check for unique items, or unique squares */
569 for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above) 582 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
570 { 583 {
571 if (QUERY_FLAG (otmp, FLAG_UNIQUE) 584 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
572 || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
573 unique = 1; 585 unique = 1;
586
574 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) 587 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
575 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL); 588 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
576 } 589 }
577 } 590 }
578 } 591 }
579 592
580 free_object (op); 593 op->destroy ();
581 link_multipart_objects (m); 594 link_multipart_objects (m);
582} 595}
583 596
584/* This saves all the objects on the map in a non destructive fashion. 597/* This saves all the objects on the map in a non destructive fashion.
585 * Modified by MSW 2001-07-01 to do in a single pass - reduces code, 598 * Modified by MSW 2001-07-01 to do in a single pass - reduces code,
586 * and we only save the head of multi part objects - this is needed 599 * and we only save the head of multi part objects - this is needed
587 * in order to do map tiling properly. 600 * in order to do map tiling properly.
588 */ 601 */
602void
589void save_objects (mapstruct *m, object_freezer &fp, object_freezer &fp2, int flag) { 603save_objects (maptile *m, object_freezer & fp, object_freezer & fp2, int flag)
604{
590 int i, j = 0,unique=0; 605 int i, j = 0, unique = 0;
591 object *op; 606 object *op;
607
592 /* first pass - save one-part objects */ 608 /* first pass - save one-part objects */
593 for(i = 0; i < MAP_WIDTH(m); i++) 609 for (i = 0; i < MAP_WIDTH (m); i++)
594 for (j = 0; j < MAP_HEIGHT(m); j++) { 610 for (j = 0; j < MAP_HEIGHT (m); j++)
611 {
595 unique=0; 612 unique = 0;
596 for(op = get_map_ob (m, i, j); op; op = op->above) { 613 for (op = GET_MAP_OB (m, i, j); op; op = op->above)
614 {
597 if (QUERY_FLAG(op,FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE)) 615 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
598 unique=1; 616 unique = 1;
599 617
600 if(op->type == PLAYER) { 618 if (op->type == PLAYER)
601 LOG(llevDebug, "Player on map that is being saved\n");
602 continue; 619 continue;
603 }
604 620
605 if (op->head || op->owner) 621 if (op->head || op->owner)
606 continue; 622 continue;
607 623
608 if (unique || QUERY_FLAG(op, FLAG_UNIQUE)) 624 if (unique || QUERY_FLAG (op, FLAG_UNIQUE))
609 save_object (fp2, op, 3); 625 save_object (fp2, op, 3);
610 else 626 else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID))))
611 if (flag == 0 ||
612 (flag == 2 && (!QUERY_FLAG(op, FLAG_OBJ_ORIGINAL) &&
613 !QUERY_FLAG(op, FLAG_UNPAID))))
614 save_object(fp, op, 3); 627 save_object (fp, op, 3);
628 }
629 }
630}
615 631
616 } /* for this space */ 632maptile::maptile ()
617 } /* for this j */ 633{
634 in_memory = MAP_SWAPPED;
635 /* The maps used to pick up default x and y values from the
636 * map archetype. Mimic that behaviour.
637 */
638 MAP_WIDTH (this) = 16;
639 MAP_HEIGHT (this) = 16;
640 MAP_RESET_TIMEOUT (this) = 0;
641 MAP_TIMEOUT (this) = 300;
642 MAP_ENTER_X (this) = 0;
643 MAP_ENTER_Y (this) = 0;
644 /*set part to -1 indicating conversion to weather map not yet done */
645 MAP_WORLDPARTX (this) = -1;
646 MAP_WORLDPARTY (this) = -1;
618} 647}
619 648
620/* 649/*
621 * Allocates, initialises, and returns a pointer to a mapstruct. 650 * Allocates, initialises, and returns a pointer to a maptile.
622 * Modified to no longer take a path option which was not being 651 * Modified to no longer take a path option which was not being
623 * used anyways. MSW 2001-07-01 652 * used anyways. MSW 2001-07-01
624 */ 653 */
654maptile *
655get_linked_map (void)
656{
657 maptile *mp, *map = new maptile;
625 658
626mapstruct *get_linked_map(void) {
627 mapstruct *map = new mapstruct;
628 mapstruct *mp;
629
630 for(mp=first_map;mp!=NULL&&mp->next!=NULL;mp=mp->next); 659 for (mp = first_map; mp && mp->next; mp = mp->next);
660
631 if(mp==NULL) 661 if (mp == NULL)
632 first_map=map; 662 first_map = map;
633 else 663 else
634 mp->next=map; 664 mp->next = map;
635 665
636 map->in_memory=MAP_SWAPPED;
637 /* The maps used to pick up default x and y values from the
638 * map archetype. Mimic that behaviour.
639 */
640 MAP_WIDTH(map)=16;
641 MAP_HEIGHT(map)=16;
642 MAP_RESET_TIMEOUT(map)=0;
643 MAP_TIMEOUT(map)=300;
644 MAP_ENTER_X(map)=0;
645 MAP_ENTER_Y(map)=0;
646 /*set part to -1 indicating conversion to weather map not yet done*/
647 MAP_WORLDPARTX(map)=-1;
648 MAP_WORLDPARTY(map)=-1;
649 return map; 666 return map;
650} 667}
651 668
652/* 669/*
653 * Allocates the arrays contained in a mapstruct. 670 * Allocates the arrays contained in a maptile.
654 * This basically allocates the dynamic array of spaces for the 671 * This basically allocates the dynamic array of spaces for the
655 * map. 672 * map.
656 */ 673 */
657 674void
658void allocate_map(mapstruct *m) { 675maptile::allocate ()
676{
659 m->in_memory = MAP_IN_MEMORY; 677 in_memory = MAP_IN_MEMORY;
678
660 /* Log this condition and free the storage. We could I suppose 679 /* Log this condition and free the storage. We could I suppose
661 * realloc, but if the caller is presuming the data will be intact, 680 * realloc, but if the caller is presuming the data will be intact,
662 * that is their poor assumption. 681 * that is their poor assumption.
663 */ 682 */
664 if (m->spaces) { 683 if (spaces)
684 {
665 LOG(llevError,"allocate_map called with already allocated map (%s)\n", m->path); 685 LOG (llevError, "allocate_map called with already allocated map (%s)\n", path);
666 free(m->spaces); 686 free (spaces);
667 } 687 }
668 688
669 m->spaces = (MapSpace *) calloc(1, MAP_WIDTH(m) * MAP_HEIGHT(m) * sizeof(MapSpace)); 689 spaces = (mapspace *)
690 calloc (1, width * height * sizeof (mapspace));
670 691
671 if(m->spaces==NULL) 692 if (!spaces)
672 fatal(OUT_OF_MEMORY); 693 fatal (OUT_OF_MEMORY);
673} 694}
674 695
675/* Create and returns a map of the specific size. Used 696/* Create and returns a map of the specific size. Used
676 * in random map code and the editor. 697 * in random map code and the editor.
677 */ 698 */
699maptile *
678mapstruct *get_empty_map(int sizex, int sizey) { 700get_empty_map (int sizex, int sizey)
701{
679 mapstruct *m = get_linked_map(); 702 maptile *m = get_linked_map ();
703
680 m->width = sizex; 704 m->width = sizex;
681 m->height = sizey; 705 m->height = sizey;
682 m->in_memory = MAP_SWAPPED; 706 m->in_memory = MAP_SWAPPED;
683 allocate_map(m); 707 m->allocate ();
708
684 return m; 709 return m;
685} 710}
686 711
687/* Takes a string from a map definition and outputs a pointer to the array of shopitems 712/* Takes a string from a map definition and outputs a pointer to the array of shopitems
688 * corresponding to that string. Memory is allocated for this, it must be freed 713 * corresponding to that string. Memory is allocated for this, it must be freed
689 * at a later date. 714 * at a later date.
690 * Called by parse_map_headers below. 715 * Called by parse_map_headers below.
691 */ 716 */
692 717
718static shopitems *
693static shopitems *parse_shop_string (const char *input_string) { 719parse_shop_string (const char *input_string)
720{
694 char *shop_string, *p, *q, *next_semicolon, *next_colon; 721 char *shop_string, *p, *q, *next_semicolon, *next_colon;
695 shopitems *items=NULL; 722 shopitems *items = NULL;
696 int i=0, number_of_entries=0; 723 int i = 0, number_of_entries = 0;
697 const typedata *current_type; 724 const typedata *current_type;
698 725
699 shop_string=strdup_local(input_string); 726 shop_string = strdup (input_string);
700 p=shop_string; 727 p = shop_string;
701 /* first we'll count the entries, we'll need that for allocating the array shortly */ 728 /* first we'll count the entries, we'll need that for allocating the array shortly */
702 while (p) { 729 while (p)
730 {
703 p=strchr(p, ';'); 731 p = strchr (p, ';');
704 number_of_entries++; 732 number_of_entries++;
705 if (p) p++; 733 if (p)
734 p++;
706 } 735 }
707 p=shop_string; 736 p = shop_string;
708 strip_endline(p); 737 strip_endline (p);
709 items=(shopitems *) CALLOC(number_of_entries+1, sizeof(shopitems)); 738 items = new shopitems[number_of_entries + 1];
710 memset(items, 0, (sizeof(shopitems) * number_of_entries+1));
711 for (i=0; i<number_of_entries; i++) { 739 for (i = 0; i < number_of_entries; i++)
740 {
712 if (!p) { 741 if (!p)
742 {
713 LOG(llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n"); 743 LOG (llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n");
714 break; 744 break;
715 } 745 }
716 next_semicolon=strchr(p, ';'); 746 next_semicolon = strchr (p, ';');
717 next_colon=strchr(p, ':'); 747 next_colon = strchr (p, ':');
718 /* if there is a stregth specified, figure out what it is, we'll need it soon. */ 748 /* if there is a stregth specified, figure out what it is, we'll need it soon. */
719 if (next_colon &&( !next_semicolon || next_colon<next_semicolon)) 749 if (next_colon && (!next_semicolon || next_colon < next_semicolon))
720 items[i].strength=atoi(strchr(p,':')+1); 750 items[i].strength = atoi (strchr (p, ':') + 1);
751
752 if (isdigit (*p) || *p == '*')
721 753 {
722 if (isdigit(*p) || *p=='*') {
723 items[i].typenum = atoi(p); /* atoi returns 0 when we have an asterisk */ 754 items[i].typenum = atoi (p); /* atoi returns 0 when we have an asterisk */
724 current_type=get_typedata(items[i].typenum); 755 current_type = get_typedata (items[i].typenum);
725 if (current_type) { 756 if (current_type)
757 {
726 items[i].name=current_type->name; 758 items[i].name = current_type->name;
727 items[i].name_pl=current_type->name_pl; 759 items[i].name_pl = current_type->name_pl;
728 }
729 }
730 else { /*we have a named type, let's figure out what it is */
731 q=strpbrk(p,";:");
732 if (q) *q='\0';
733
734 current_type=get_typedata_by_name(p);
735 if (current_type) {
736 items[i].name=current_type->name;
737 items[i].typenum=current_type->number;
738 items[i].name_pl=current_type->name_pl;
739 } 760 }
740 else { /* oh uh, something's wrong, let's free up this one, and try 761 }
741 * the next entry while we're at it, better print a warning 762 else
742 */ 763 { /*we have a named type, let's figure out what it is */
743 LOG(llevError, "invalid type %s defined in shopitems in string %s\n", 764 q = strpbrk (p, ";:");
744 p, input_string); 765 if (q)
766 *q = '\0';
767
768 current_type = get_typedata_by_name (p);
769 if (current_type)
770 {
771 items[i].name = current_type->name;
772 items[i].typenum = current_type->number;
773 items[i].name_pl = current_type->name_pl;
745 } 774 }
775 else
776 { /* oh uh, something's wrong, let's free up this one, and try
777 * the next entry while we're at it, better print a warning
778 */
779 LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string);
746 } 780 }
781 }
747 items[i].index=number_of_entries; 782 items[i].index = number_of_entries;
748 if (next_semicolon) p=++next_semicolon; 783 if (next_semicolon)
784 p = ++next_semicolon;
785 else
749 else p=NULL; 786 p = NULL;
750 } 787 }
751 free(shop_string); 788 free (shop_string);
752 return items; 789 return items;
753} 790}
754 791
755/* opposite of parse string, this puts the string that was originally fed in to 792/* opposite of parse string, this puts the string that was originally fed in to
756 * the map (or something equivilent) into output_string. */ 793 * the map (or something equivilent) into output_string. */
794static void
757static void print_shop_string(mapstruct *m, char *output_string) { 795print_shop_string (maptile *m, char *output_string)
796{
758 int i; 797 int i;
759 char tmp[MAX_BUF]; 798 char tmp[MAX_BUF];
799
760 strcpy(output_string, ""); 800 strcpy (output_string, "");
761 for (i=0; i< m->shopitems[0].index; i++) { 801 for (i = 0; i < m->shopitems[0].index; i++)
802 {
762 if (m->shopitems[i].typenum) { 803 if (m->shopitems[i].typenum)
804 {
763 if (m->shopitems[i].strength) { 805 if (m->shopitems[i].strength)
806 {
764 sprintf(tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 807 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
765 } 808 }
809 else
766 else sprintf(tmp, "%s;", m->shopitems[i].name); 810 sprintf (tmp, "%s;", m->shopitems[i].name);
811 }
812 else
767 } 813 {
768 else {
769 if (m->shopitems[i].strength) { 814 if (m->shopitems[i].strength)
815 {
770 sprintf(tmp, "*:%d;", m->shopitems[i].strength); 816 sprintf (tmp, "*:%d;", m->shopitems[i].strength);
771 } 817 }
818 else
772 else sprintf(tmp, "*"); 819 sprintf (tmp, "*");
773 } 820 }
774 strcat(output_string, tmp); 821 strcat (output_string, tmp);
775 } 822 }
776} 823}
777 824
778/* This loads the header information of the map. The header 825/* This loads the header information of the map. The header
779 * contains things like difficulty, size, timeout, etc. 826 * contains things like difficulty, size, timeout, etc.
… …
786 * currently, there are few enough fields this is not a big deal. 833 * currently, there are few enough fields this is not a big deal.
787 * MSW 2001-07-01 834 * MSW 2001-07-01
788 * return 0 on success, 1 on failure. 835 * return 0 on success, 1 on failure.
789 */ 836 */
790 837
838static int
791static int load_map_header(object_thawer &fp, mapstruct *m) 839load_map_header (object_thawer & fp, maptile *m)
792{ 840{
793 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key=NULL, *value, *end; 841 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
794 int msgpos=0; 842 int msgpos = 0;
795 int maplorepos=0; 843 int maplorepos = 0;
796 844
797 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) { 845 while (fgets (buf, HUGE_BUF, fp) != NULL)
846 {
798 buf[HUGE_BUF-1] = 0; 847 buf[HUGE_BUF - 1] = 0;
799 key = buf; 848 key = buf;
849
800 while (isspace(*key)) key++; 850 while (isspace (*key))
801 if (*key == 0) continue; /* empty line */ 851 key++;
852
853 if (*key == 0)
854 continue; /* empty line */
855
802 value = strchr(key, ' '); 856 value = strchr (key, ' ');
857
803 if (!value) { 858 if (!value)
859 {
804 end = strchr(key, '\n'); 860 if ((end = strchr (key, '\n')))
805 if (end != NULL) {
806 *end = 0; 861 *end = 0;
807 } 862 }
808 } else { 863 else
864 {
809 *value = 0; 865 *value = 0;
810 value++; 866 value++;
811 end = strchr(value, '\n'); 867 end = strchr (value, '\n');
868
812 while (isspace(*value)) { 869 while (isspace (*value))
870 {
813 value++; 871 value++;
872
814 if (*value == '\0' || value == end) { 873 if (*value == '\0' || value == end)
874 {
815 /* Nothing but spaces. */ 875 /* Nothing but spaces. */
816 value = NULL; 876 value = NULL;
817 break; 877 break;
818 } 878 }
819 } 879 }
820 } 880 }
821 881
822 if (!end) { 882 if (!end)
883 {
823 LOG(llevError, "Error loading map header - did not find a newline - perhaps file is truncated? Buf=%s\n", 884 LOG (llevError, "Error loading map header - did not find a newline - perhaps file is truncated? Buf=%s\n", buf);
824 buf);
825 return 1; 885 return 1;
826 } 886 }
827 887
828 /* key is the field name, value is what it should be set 888 /* key is the field name, value is what it should be set
829 * to. We've already done the work to null terminate key, 889 * to. We've already done the work to null terminate key,
830 * and strip off any leading spaces for both of these. 890 * and strip off any leading spaces for both of these.
831 * We have not touched the newline at the end of the line - 891 * We have not touched the newline at the end of the line -
832 * these are needed for some values. the end pointer 892 * these are needed for some values. the end pointer
833 * points to the first of the newlines. 893 * points to the first of the newlines.
834 * value could be NULL! It would be easy enough to just point 894 * value could be NULL! It would be easy enough to just point
835 * this to "" to prevent cores, but that would let more errors slide 895 * this to "" to prevent cores, but that would let more errors slide
836 * through. 896 * through.
837 * 897 *
838 * First check for entries that do not use the value parameter, then 898 * First check for entries that do not use the value parameter, then
839 * validate that value is given and check for the remaining entries 899 * validate that value is given and check for the remaining entries
840 * that use the parameter. 900 * that use the parameter.
841 */ 901 */
842 902
843 if (!strcmp(key,"msg")) { 903 if (!strcmp (key, "msg"))
904 {
844 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) { 905 while (fgets (buf, HUGE_BUF, fp) != NULL)
906 {
845 if (!strcmp(buf,"endmsg\n")) break; 907 if (!strcmp (buf, "endmsg\n"))
908 break;
846 else { 909 else
910 {
847 /* slightly more efficient than strcat */ 911 /* slightly more efficient than strcat */
848 strcpy(msgbuf+msgpos, buf); 912 strcpy (msgbuf + msgpos, buf);
849 msgpos += strlen(buf); 913 msgpos += strlen (buf);
850 } 914 }
851 } 915 }
852 /* There are lots of maps that have empty messages (eg, msg/endmsg 916 /* There are lots of maps that have empty messages (eg, msg/endmsg
853 * with nothing between). There is no reason in those cases to 917 * with nothing between). There is no reason in those cases to
854 * keep the empty message. Also, msgbuf contains garbage data 918 * keep the empty message. Also, msgbuf contains garbage data
855 * when msgpos is zero, so copying it results in crashes 919 * when msgpos is zero, so copying it results in crashes
856 */ 920 */
857 if (msgpos != 0) 921 if (msgpos != 0)
858 m->msg = strdup_local(msgbuf); 922 m->msg = strdup (msgbuf);
859 } 923 }
860 else if (!strcmp(key,"maplore")) { 924 else if (!strcmp (key, "maplore"))
925 {
861 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) { 926 while (fgets (buf, HUGE_BUF, fp) != NULL)
927 {
862 if (!strcmp(buf,"endmaplore\n")) break; 928 if (!strcmp (buf, "endmaplore\n"))
929 break;
863 else { 930 else
931 {
864 /* slightly more efficient than strcat */ 932 /* slightly more efficient than strcat */
865 strcpy(maplorebuf+maplorepos, buf); 933 strcpy (maplorebuf + maplorepos, buf);
866 maplorepos += strlen(buf); 934 maplorepos += strlen (buf);
867 } 935 }
868 } 936 }
869 if (maplorepos != 0) 937 if (maplorepos != 0)
870 m->maplore = strdup_local(maplorebuf); 938 m->maplore = strdup (maplorebuf);
871 } 939 }
872 else if (!strcmp(key,"end")) { 940 else if (!strcmp (key, "end"))
941 {
873 break; 942 break;
874 } 943 }
875 else if (value == NULL) { 944 else if (value == NULL)
945 {
876 LOG(llevError, "Got '%s' line without parameter in map header\n", key); 946 LOG (llevError, "Got '%s' line without parameter in map header\n", key);
877 } 947 }
878 else if (!strcmp(key, "arch")) { 948 else if (!strcmp (key, "arch"))
949 {
879 /* This is an oddity, but not something we care about much. */ 950 /* This is an oddity, but not something we care about much. */
880 if (strcmp(value,"map\n")) 951 if (strcmp (value, "map\n"))
881 LOG(llevError,"loading map and got a non 'arch map' line(%s %s)?\n",key,value); 952 LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value);
882 } 953 }
883 else if (!strcmp(key,"name")) { 954 else if (!strcmp (key, "name"))
955 {
884 *end=0; 956 *end = 0;
885 m->name = strdup_local(value); 957 m->name = strdup (value);
886 } 958 }
887 /* first strcmp value on these are old names supported 959 /* first strcmp value on these are old names supported
888 * for compatibility reasons. The new values (second) are 960 * for compatibility reasons. The new values (second) are
889 * what really should be used. 961 * what really should be used.
890 */ 962 */
891 else if (!strcmp(key,"oid")) { 963 else if (!strcmp (key, "oid"))
892 fp.get (m, atoi(value)); 964 fp.get (m, atoi (value));
893 } else if (!strcmp(key, "attach")) { 965 else if (!strcmp (key, "attach"))
894 m->attach = value; 966 m->attach = value;
895 } else if (!strcmp(key,"hp") || !strcmp(key, "enter_x")) { 967 else if (!strcmp (key, "hp") || !strcmp (key, "enter_x"))
896 m->enter_x = atoi(value); 968 m->enter_x = atoi (value);
897 } else if (!strcmp(key,"sp") || !strcmp(key, "enter_y")) { 969 else if (!strcmp (key, "sp") || !strcmp (key, "enter_y"))
898 m->enter_y = atoi(value); 970 m->enter_y = atoi (value);
899 } else if (!strcmp(key,"x") || !strcmp(key, "width")) { 971 else if (!strcmp (key, "x") || !strcmp (key, "width"))
900 m->width = atoi(value); 972 m->width = atoi (value);
901 } else if (!strcmp(key,"y") || !strcmp(key, "height")) { 973 else if (!strcmp (key, "y") || !strcmp (key, "height"))
902 m->height = atoi(value); 974 m->height = atoi (value);
903 } else if (!strcmp(key,"weight") || !strcmp(key, "reset_timeout")) { 975 else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout"))
904 m->reset_timeout = atoi(value); 976 m->reset_timeout = atoi (value);
905 } else if (!strcmp(key,"value") || !strcmp(key, "swap_time")) { 977 else if (!strcmp (key, "value") || !strcmp (key, "swap_time"))
906 m->timeout = atoi(value); 978 m->timeout = atoi (value);
907 } else if (!strcmp(key,"level") || !strcmp(key, "difficulty")) { 979 else if (!strcmp (key, "level") || !strcmp (key, "difficulty"))
908 m->difficulty = atoi(value); 980 m->difficulty = clamp (atoi (value), 1, settings.max_level);
909 } else if (!strcmp(key,"invisible") || !strcmp(key, "darkness")) { 981 else if (!strcmp (key, "invisible") || !strcmp (key, "darkness"))
910 m->darkness = atoi(value); 982 m->darkness = atoi (value);
911 } else if (!strcmp(key,"stand_still") || !strcmp(key, "fixed_resettime")) { 983 else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime"))
912 m->fixed_resettime = atoi(value); 984 m->fixed_resettime = atoi (value);
913 } else if (!strcmp(key,"unique")) { 985 else if (!strcmp (key, "unique"))
914 m->unique = atoi(value); 986 m->unique = atoi (value);
915 } else if (!strcmp(key,"template")) { 987 else if (!strcmp (key, "template"))
916 m->templatemap = atoi(value); 988 m->templatemap = atoi (value);
917 } else if (!strcmp(key,"region")) { 989 else if (!strcmp (key, "region"))
918 m->region = get_region_by_name(value); 990 m->region = get_region_by_name (value);
919 } else if (!strcmp(key,"shopitems")) { 991 else if (!strcmp (key, "shopitems"))
992 {
920 *end=0; 993 *end = 0;
921 m->shopitems = parse_shop_string(value); 994 m->shopitems = parse_shop_string (value);
995 }
922 } else if (!strcmp(key,"shopgreed")) { 996 else if (!strcmp (key, "shopgreed"))
923 m->shopgreed = atof(value); 997 m->shopgreed = atof (value);
924 } else if (!strcmp(key,"shopmin")) { 998 else if (!strcmp (key, "shopmin"))
925 m->shopmin = atol(value); 999 m->shopmin = atol (value);
926 } else if (!strcmp(key,"shopmax")) { 1000 else if (!strcmp (key, "shopmax"))
927 m->shopmax = atol(value); 1001 m->shopmax = atol (value);
928 } else if (!strcmp(key,"shoprace")) { 1002 else if (!strcmp (key, "shoprace"))
1003 {
929 *end=0; 1004 *end = 0;
930 m->shoprace = strdup_local(value); 1005 m->shoprace = strdup (value);
1006 }
931 } else if (!strcmp(key,"outdoor")) { 1007 else if (!strcmp (key, "outdoor"))
932 m->outdoor = atoi(value); 1008 m->outdoor = atoi (value);
933 } else if (!strcmp(key, "temp")) { 1009 else if (!strcmp (key, "temp"))
934 m->temp = atoi(value); 1010 m->temp = atoi (value);
935 } else if (!strcmp(key, "pressure")) { 1011 else if (!strcmp (key, "pressure"))
936 m->pressure = atoi(value); 1012 m->pressure = atoi (value);
937 } else if (!strcmp(key, "humid")) { 1013 else if (!strcmp (key, "humid"))
938 m->humid = atoi(value); 1014 m->humid = atoi (value);
939 } else if (!strcmp(key, "windspeed")) { 1015 else if (!strcmp (key, "windspeed"))
940 m->windspeed = atoi(value); 1016 m->windspeed = atoi (value);
941 } else if (!strcmp(key, "winddir")) { 1017 else if (!strcmp (key, "winddir"))
942 m->winddir = atoi(value); 1018 m->winddir = atoi (value);
943 } else if (!strcmp(key, "sky")) { 1019 else if (!strcmp (key, "sky"))
944 m->sky = atoi(value); 1020 m->sky = atoi (value);
945 } else if (!strcmp(key, "nosmooth")) { 1021 else if (!strcmp (key, "nosmooth"))
946 m->nosmooth = atoi(value); 1022 m->nosmooth = atoi (value);
947 }
948 else if (!strncmp(key,"tile_path_", 10)) { 1023 else if (!strncmp (key, "tile_path_", 10))
1024 {
949 int tile=atoi(key+10); 1025 int tile = atoi (key + 10);
950 1026
951 if (tile<1 || tile>4) { 1027 if (tile < 1 || tile > 4)
1028 {
952 LOG(llevError,"load_map_header: tile location %d out of bounds (%s)\n", 1029 LOG (llevError, "load_map_header: tile location %d out of bounds (%s)\n", tile, m->path);
953 tile, m->path); 1030 }
954 } else { 1031 else
1032 {
955 char *path; 1033 char *path;
956 1034
957 *end = 0; 1035 *end = 0;
958 1036
959 if (m->tile_path[tile-1]) { 1037 if (m->tile_path[tile - 1])
1038 {
960 LOG(llevError,"load_map_header: tile location %d duplicated (%s)\n", 1039 LOG (llevError, "load_map_header: tile location %d duplicated (%s)\n", tile, m->path);
961 tile, m->path);
962 free(m->tile_path[tile-1]); 1040 free (m->tile_path[tile - 1]);
963 m->tile_path[tile-1] = NULL; 1041 m->tile_path[tile - 1] = NULL;
964 } 1042 }
965 1043
966 if (check_path(value, 1) != -1) { 1044 if (check_path (value, 1) != -1)
1045 {
967 /* The unadorned path works. */ 1046 /* The unadorned path works. */
968 path = value; 1047 path = value;
1048 }
969 } else { 1049 else
1050 {
970 /* Try again; it could be a relative exit. */ 1051 /* Try again; it could be a relative exit. */
971 1052
972 path = path_combine_and_normalize(m->path, value); 1053 path = path_combine_and_normalize (m->path, value);
973 1054
974 if (check_path(path, 1) == -1) { 1055 if (check_path (path, 1) == -1)
1056 {
975 LOG(llevError, "get_map_header: Bad tile path %s %s\n", m->path, value); 1057 LOG (llevError, "get_map_header: Bad tile path %s %s\n", m->path, value);
976 path = NULL; 1058 path = NULL;
977 } 1059 }
978 } 1060 }
979 1061
980 if (editor) { 1062 if (editor)
1063 {
981 /* Use the value as in the file. */ 1064 /* Use the value as in the file. */
982 m->tile_path[tile-1] = strdup_local(value); 1065 m->tile_path[tile - 1] = strdup (value);
983 } else if (path != NULL) {
984 /* Use the normalized value. */
985 m->tile_path[tile-1] = strdup_local(path);
986 } 1066 }
1067 else if (path != NULL)
1068 {
1069 /* Use the normalized value. */
1070 m->tile_path[tile - 1] = strdup (path);
1071 }
987 } /* end if tile direction (in)valid */ 1072 } /* end if tile direction (in)valid */
988 } 1073 }
989 else { 1074 else
990 LOG(llevError,"Got unknown value in map header: %s %s\n", key, value); 1075 LOG (llevError, "Got unknown value in map header: %s %s\n", key, value);
991 }
992 } 1076 }
1077
993 if (!key || strcmp(key,"end")) { 1078 if (!key || strcmp (key, "end"))
1079 {
994 LOG(llevError,"Got premature eof on map header!\n"); 1080 LOG (llevError, "Got premature eof on map header!\n");
995 return 1; 1081 return 1;
996 } 1082 }
1083
997 return 0; 1084 return 0;
998} 1085}
999 1086
1000/* 1087/*
1001 * Opens the file "filename" and reads information about the map 1088 * Opens the file "filename" and reads information about the map
1002 * from the given file, and stores it in a newly allocated 1089 * from the given file, and stores it in a newly allocated
1003 * mapstruct. A pointer to this structure is returned, or NULL on failure. 1090 * maptile. A pointer to this structure is returned, or NULL on failure.
1004 * flags correspond to those in map.h. Main ones used are 1091 * flags correspond to those in map.h. Main ones used are
1005 * MAP_PLAYER_UNIQUE, in which case we don't do any name changes, and 1092 * MAP_PLAYER_UNIQUE, in which case we don't do any name changes, and
1006 * MAP_BLOCK, in which case we block on this load. This happens in all 1093 * MAP_BLOCK, in which case we block on this load. This happens in all
1007 * cases, no matter if this flag is set or not. 1094 * cases, no matter if this flag is set or not.
1008 * MAP_STYLE: style map - don't add active objects, don't add to server 1095 * MAP_STYLE: style map - don't add active objects, don't add to server
1009 * managed map list. 1096 * managed map list.
1010 */ 1097 */
1011 1098
1099maptile *
1012mapstruct *load_original_map(const char *filename, int flags) { 1100load_original_map (const char *filename, int flags)
1013 mapstruct *m; 1101{
1102 maptile *m;
1014 char pathname[MAX_BUF]; 1103 char pathname[MAX_BUF];
1015 1104
1016 if (flags & MAP_PLAYER_UNIQUE) 1105 if (flags & MAP_PLAYER_UNIQUE)
1017 strcpy(pathname, filename); 1106 strcpy (pathname, filename);
1018 else if (flags & MAP_OVERLAY) 1107 else if (flags & MAP_OVERLAY)
1019 strcpy(pathname, create_overlay_pathname(filename)); 1108 strcpy (pathname, create_overlay_pathname (filename));
1020 else 1109 else
1021 strcpy(pathname, create_pathname(filename)); 1110 strcpy (pathname, create_pathname (filename));
1022 1111
1023 LOG(llevDebug, "load_original_map(%x): %s (%s)\n", flags, filename, pathname); 1112 LOG (llevDebug, "load_original_map(%x): %s (%s)\n", flags, filename, pathname);
1024 1113
1025 object_thawer thawer (pathname); 1114 object_thawer thawer (pathname);
1026 1115
1027 if (!thawer) 1116 if (!thawer)
1028 return 0; 1117 return 0;
1029 1118
1030 m = get_linked_map(); 1119 m = get_linked_map ();
1031 1120
1032 strcpy (m->path, filename); 1121 strcpy (m->path, filename);
1033 if (load_map_header(thawer, m)) { 1122 if (load_map_header (thawer, m))
1123 {
1034 LOG(llevError,"Error loading map header for %s, flags=%d\n", 1124 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags);
1035 filename, flags);
1036 delete_map(m); 1125 delete_map (m);
1037 return NULL; 1126 return NULL;
1038 } 1127 }
1039 1128
1040 allocate_map(m); 1129 m->allocate ();
1041 1130
1042 m->in_memory=MAP_LOADING; 1131 m->in_memory = MAP_LOADING;
1043 load_objects (m, thawer, flags & (MAP_BLOCK|MAP_STYLE)); 1132 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE));
1044 1133
1045 m->in_memory=MAP_IN_MEMORY; 1134 m->in_memory = MAP_IN_MEMORY;
1046 if (!MAP_DIFFICULTY(m)) 1135 if (!MAP_DIFFICULTY (m))
1047 MAP_DIFFICULTY(m)=calculate_difficulty(m); 1136 MAP_DIFFICULTY (m) = calculate_difficulty (m);
1048 set_map_reset_time(m); 1137 set_map_reset_time (m);
1049 m->instantiate (); 1138 m->instantiate ();
1050 return (m); 1139 return (m);
1051} 1140}
1052 1141
1053/* 1142/*
1054 * Loads a map, which has been loaded earlier, from file. 1143 * Loads a map, which has been loaded earlier, from file.
1055 * Return the map object we load into (this can change from the passed 1144 * Return the map object we load into (this can change from the passed
1056 * option if we can't find the original map) 1145 * option if we can't find the original map)
1057 */ 1146 */
1058 1147
1059static mapstruct *load_temporary_map(mapstruct *m) { 1148static maptile *
1060 int comp; 1149load_temporary_map (maptile *m)
1150{
1061 char buf[MAX_BUF]; 1151 char buf[MAX_BUF];
1062 1152
1063 if (!m->tmpname) { 1153 if (!m->tmpname)
1154 {
1064 LOG(llevError, "No temporary filename for map %s\n", m->path); 1155 LOG (llevError, "No temporary filename for map %s\n", m->path);
1065 strcpy(buf, m->path);
1066 delete_map(m);
1067 m = load_original_map(buf, 0);
1068 if(m==NULL) return NULL;
1069 fix_auto_apply(m); /* Chests which open as default */
1070 return m;
1071 }
1072
1073 object_thawer thawer (m->tmpname);
1074
1075 if (!thawer)
1076 {
1077 strcpy (buf, m->path); 1156 strcpy (buf, m->path);
1078 delete_map (m); 1157 delete_map (m);
1079 m = load_original_map (buf, 0); 1158 m = load_original_map (buf, 0);
1080 if (!m) return NULL; 1159 if (m == NULL)
1081 fix_auto_apply (m); /* Chests which open as default */
1082 return m;
1083 }
1084
1085 if (load_map_header(thawer, m)) {
1086 LOG(llevError,"Error loading map header for %s (%s)\n",
1087 m->path, m->tmpname);
1088 delete_map(m);
1089 m = load_original_map(m->path, 0);
1090 return NULL; 1160 return NULL;
1161 fix_auto_apply (m); /* Chests which open as default */
1162 return m;
1163 }
1164
1165 object_thawer thawer (m->tmpname);
1166
1167 if (!thawer)
1091 } 1168 {
1092 allocate_map(m); 1169 strcpy (buf, m->path);
1170 delete_map (m);
1171 m = load_original_map (buf, 0);
1172 if (!m)
1173 return NULL;
1174 fix_auto_apply (m); /* Chests which open as default */
1175 return m;
1176 }
1093 1177
1178 if (load_map_header (thawer, m))
1179 {
1180 LOG (llevError, "Error loading map header for %s (%s)\n", m->path, m->tmpname);
1181 delete_map (m);
1182 m = load_original_map (m->path, 0);
1183 return NULL;
1184 }
1185
1186 m->allocate ();
1187
1094 m->in_memory=MAP_LOADING; 1188 m->in_memory = MAP_LOADING;
1095 load_objects (m, thawer, 0); 1189 load_objects (m, thawer, 0);
1096 1190
1097 m->in_memory=MAP_IN_MEMORY; 1191 m->in_memory = MAP_IN_MEMORY;
1098 INVOKE_MAP (SWAPIN, m); 1192 INVOKE_MAP (SWAPIN, m);
1099 return m; 1193 return m;
1100} 1194}
1101 1195
1102/* 1196/*
1103 * Loads a map, which has been loaded earlier, from file. 1197 * Loads a map, which has been loaded earlier, from file.
1104 * Return the map object we load into (this can change from the passed 1198 * Return the map object we load into (this can change from the passed
1105 * option if we can't find the original map) 1199 * option if we can't find the original map)
1106 */ 1200 */
1107 1201
1202maptile *
1108mapstruct *load_overlay_map(const char *filename, mapstruct *m) { 1203load_overlay_map (const char *filename, maptile *m)
1204{
1109 char pathname[MAX_BUF]; 1205 char pathname[MAX_BUF];
1110 1206
1111 strcpy(pathname, create_overlay_pathname(filename)); 1207 strcpy (pathname, create_overlay_pathname (filename));
1112 1208
1113 object_thawer thawer (pathname); 1209 object_thawer thawer (pathname);
1114 1210
1115 if (!thawer) 1211 if (!thawer)
1116 return m;
1117
1118 if (load_map_header(thawer, m)) {
1119 LOG(llevError,"Error loading map header for overlay %s (%s)\n",
1120 m->path, pathname);
1121 delete_map(m);
1122 m = load_original_map(m->path, 0);
1123 return NULL;
1124 }
1125 /*allocate_map(m);*/
1126
1127 m->in_memory=MAP_LOADING;
1128 load_objects (m, thawer, MAP_OVERLAY);
1129
1130 m->in_memory=MAP_IN_MEMORY;
1131 return m; 1212 return m;
1213
1214 if (load_map_header (thawer, m))
1215 {
1216 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname);
1217 delete_map (m);
1218 m = load_original_map (m->path, 0);
1219 return NULL;
1220 }
1221 /*m->allocate ();*/
1222
1223 m->in_memory = MAP_LOADING;
1224 load_objects (m, thawer, MAP_OVERLAY);
1225
1226 m->in_memory = MAP_IN_MEMORY;
1227 return m;
1132} 1228}
1133 1229
1134/****************************************************************************** 1230/******************************************************************************
1135 * This is the start of unique map handling code 1231 * This is the start of unique map handling code
1136 *****************************************************************************/ 1232 *****************************************************************************/
1137 1233
1138/* This goes through map 'm' and removed any unique items on the map. */ 1234/* This goes through map 'm' and removed any unique items on the map. */
1139static void delete_unique_items(mapstruct *m) 1235static void
1236delete_unique_items (maptile *m)
1140{ 1237{
1141 int i,j,unique; 1238 int i, j, unique;
1142 object *op, *next; 1239 object *op, *next;
1143 1240
1144 for(i=0; i<MAP_WIDTH(m); i++) 1241 for (i = 0; i < MAP_WIDTH (m); i++)
1145 for(j=0; j<MAP_HEIGHT(m); j++) { 1242 for (j = 0; j < MAP_HEIGHT (m); j++)
1243 {
1146 unique=0; 1244 unique = 0;
1245
1147 for (op=get_map_ob(m, i, j); op; op=next) { 1246 for (op = GET_MAP_OB (m, i, j); op; op = next)
1247 {
1148 next = op->above; 1248 next = op->above;
1249
1149 if (QUERY_FLAG(op, FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE)) 1250 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
1150 unique=1; 1251 unique = 1;
1252
1151 if(op->head == NULL && (QUERY_FLAG(op, FLAG_UNIQUE) || unique)) { 1253 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
1254 {
1152 clean_object(op); 1255 clean_object (op);
1256
1153 if (QUERY_FLAG(op, FLAG_IS_LINKED)) 1257 if (QUERY_FLAG (op, FLAG_IS_LINKED))
1154 remove_button_link(op); 1258 remove_button_link (op);
1155 remove_ob(op); 1259
1156 free_object(op); 1260 op->destroy ();
1157 } 1261 }
1158 } 1262 }
1159 } 1263 }
1160} 1264}
1161 1265
1162 1266
1163/* 1267/*
1164 * Loads unique objects from file(s) into the map which is in memory 1268 * Loads unique objects from file(s) into the map which is in memory
1165 * m is the map to load unique items into. 1269 * m is the map to load unique items into.
1166 */ 1270 */
1167static void load_unique_objects(mapstruct *m) { 1271static void
1272load_unique_objects (maptile *m)
1273{
1168 int count; 1274 int count;
1169 char firstname[MAX_BUF]; 1275 char firstname[MAX_BUF];
1170 1276
1171 for (count=0; count<10; count++) { 1277 for (count = 0; count < 10; count++)
1278 {
1172 sprintf(firstname, "%s.v%02d", create_items_path(m->path), count); 1279 sprintf (firstname, "%s.v%02d", create_items_path (m->path), count);
1173 if (!access(firstname, R_OK)) break; 1280 if (!access (firstname, R_OK))
1281 break;
1174 } 1282 }
1175 /* If we get here, we did not find any map */ 1283 /* If we get here, we did not find any map */
1176 if (count==10) return; 1284 if (count == 10)
1285 return;
1177 1286
1178 object_thawer thawer (firstname); 1287 object_thawer thawer (firstname);
1179 1288
1180 if (!thawer) 1289 if (!thawer)
1181 return; 1290 return;
1182 1291
1183 m->in_memory=MAP_LOADING; 1292 m->in_memory = MAP_LOADING;
1184 if (m->tmpname == NULL) /* if we have loaded unique items from */ 1293 if (m->tmpname == NULL) /* if we have loaded unique items from */
1185 delete_unique_items(m); /* original map before, don't duplicate them */ 1294 delete_unique_items (m); /* original map before, don't duplicate them */
1186 load_objects (m, thawer, 0); 1295 load_objects (m, thawer, 0);
1187 1296
1188 m->in_memory=MAP_IN_MEMORY; 1297 m->in_memory = MAP_IN_MEMORY;
1189} 1298}
1190 1299
1191 1300
1192/* 1301/*
1193 * Saves a map to file. If flag is set, it is saved into the same 1302 * Saves a map to file. If flag is set, it is saved into the same
1194 * file it was (originally) loaded from. Otherwise a temporary 1303 * file it was (originally) loaded from. Otherwise a temporary
1195 * filename will be genarated, and the file will be stored there. 1304 * filename will be genarated, and the file will be stored there.
1196 * The temporary filename will be stored in the mapstructure. 1305 * The temporary filename will be stored in the maptileure.
1197 * If the map is unique, we also save to the filename in the map 1306 * If the map is unique, we also save to the filename in the map
1198 * (this should have been updated when first loaded) 1307 * (this should have been updated when first loaded)
1199 */ 1308 */
1200 1309
1201int 1310int
1202new_save_map (mapstruct * m, int flag) 1311new_save_map (maptile *m, int flag)
1203{ 1312{
1204 char filename[MAX_BUF], buf[MAX_BUF], buf_s[MAX_BUF], shop[MAX_BUF]; 1313 char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF];
1205 int i; 1314 int i;
1206 1315
1207 if (flag && !*m->path) 1316 if (flag && !*m->path)
1208 { 1317 {
1209 LOG (llevError, "Tried to save map without path.\n"); 1318 LOG (llevError, "Tried to save map without path.\n");
… …
1211 } 1320 }
1212 1321
1213 if (flag || (m->unique) || (m->templatemap)) 1322 if (flag || (m->unique) || (m->templatemap))
1214 { 1323 {
1215 if (!m->unique && !m->templatemap) 1324 if (!m->unique && !m->templatemap)
1216 { /* flag is set */ 1325 { /* flag is set */
1217 if (flag == 2) 1326 if (flag == 2)
1218 strcpy (filename, create_overlay_pathname (m->path)); 1327 strcpy (filename, create_overlay_pathname (m->path));
1219 else 1328 else
1220 strcpy (filename, create_pathname (m->path)); 1329 strcpy (filename, create_pathname (m->path));
1221 } 1330 }
… …
1225 make_path_to_file (filename); 1334 make_path_to_file (filename);
1226 } 1335 }
1227 else 1336 else
1228 { 1337 {
1229 if (!m->tmpname) 1338 if (!m->tmpname)
1230 m->tmpname = tempnam_local (settings.tmpdir, NULL); 1339 m->tmpname = tempnam (settings.tmpdir, NULL);
1231 1340
1232 strcpy (filename, m->tmpname); 1341 strcpy (filename, m->tmpname);
1233 } 1342 }
1234 1343
1235 LOG (llevDebug, "Saving map %s to %s\n", m->path, filename); 1344 LOG (llevDebug, "Saving map %s to %s\n", m->path, filename);
… …
1259 print_shop_string (m, shop); 1368 print_shop_string (m, shop);
1260 fprintf (freezer, "shopitems %s\n", shop); 1369 fprintf (freezer, "shopitems %s\n", shop);
1261 } 1370 }
1262 if (m->shopgreed) 1371 if (m->shopgreed)
1263 fprintf (freezer, "shopgreed %f\n", m->shopgreed); 1372 fprintf (freezer, "shopgreed %f\n", m->shopgreed);
1264#ifndef WIN32
1265 if (m->shopmin) 1373 if (m->shopmin)
1266 fprintf (freezer, "shopmin %llu\n", m->shopmin); 1374 fprintf (freezer, "shopmin %llu\n", m->shopmin);
1267 if (m->shopmax) 1375 if (m->shopmax)
1268 fprintf (freezer, "shopmax %llu\n", m->shopmax); 1376 fprintf (freezer, "shopmax %llu\n", m->shopmax);
1269#else
1270 if (m->shopmin)
1271 fprintf (freezer, "shopmin %I64u\n", m->shopmin);
1272 if (m->shopmax)
1273 fprintf (freezer, "shopmax %I64u\n", m->shopmax);
1274#endif
1275 if (m->shoprace) 1377 if (m->shoprace)
1276 fprintf (freezer, "shoprace %s\n", m->shoprace); 1378 fprintf (freezer, "shoprace %s\n", m->shoprace);
1277 if (m->darkness) 1379 if (m->darkness)
1278 fprintf (freezer, "darkness %d\n", m->darkness); 1380 fprintf (freezer, "darkness %d\n", m->darkness);
1279 if (m->width) 1381 if (m->width)
… …
1335 sprintf (buf, "%s.v00", create_items_path (m->path)); 1437 sprintf (buf, "%s.v00", create_items_path (m->path));
1336 1438
1337 unique.save (buf); 1439 unique.save (buf);
1338 } 1440 }
1339 else 1441 else
1340 { /* save same file when not playing, like in editor */ 1442 { /* save same file when not playing, like in editor */
1341 save_objects (m, freezer, freezer, 0); 1443 save_objects (m, freezer, freezer, 0);
1342 } 1444 }
1343 1445
1344 freezer.save (filename); 1446 freezer.save (filename);
1345 1447
… …
1350/* 1452/*
1351 * Remove and free all objects in the inventory of the given object. 1453 * Remove and free all objects in the inventory of the given object.
1352 * object.c ? 1454 * object.c ?
1353 */ 1455 */
1354 1456
1457void
1355void clean_object(object *op) 1458clean_object (object *op)
1356{ 1459{
1357 object *tmp, *next; 1460 object *tmp, *next;
1358 1461
1359 for(tmp = op->inv; tmp; tmp = next) 1462 for (tmp = op->inv; tmp; tmp = next)
1360 { 1463 {
1361 next = tmp->below; 1464 next = tmp->below;
1465
1362 clean_object(tmp); 1466 clean_object (tmp);
1363 if (QUERY_FLAG(tmp, FLAG_IS_LINKED)) 1467 if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
1364 remove_button_link(tmp); 1468 remove_button_link (tmp);
1365 remove_ob(tmp); 1469
1366 free_object(tmp); 1470 tmp->destroy ();
1367 } 1471 }
1368} 1472}
1369 1473
1370/* 1474/*
1371 * Remove and free all objects in the given map. 1475 * Remove and free all objects in the given map.
1372 */ 1476 */
1373 1477
1478void
1374void free_all_objects(mapstruct *m) { 1479free_all_objects (maptile *m)
1480{
1375 int i,j; 1481 int i, j;
1376 object *op; 1482 object *op;
1377 1483
1378 for(i=0;i<MAP_WIDTH(m);i++) 1484 for (i = 0; i < MAP_WIDTH (m); i++)
1379 for(j=0;j<MAP_HEIGHT(m);j++) { 1485 for (j = 0; j < MAP_HEIGHT (m); j++)
1486 {
1380 object *previous_obj=NULL; 1487 object *previous_obj = NULL;
1488
1381 while((op=GET_MAP_OB(m,i,j))!=NULL) { 1489 while ((op = GET_MAP_OB (m, i, j)) != NULL)
1490 {
1382 if (op==previous_obj) { 1491 if (op == previous_obj)
1492 {
1383 LOG(llevDebug, "free_all_objects: Link error, bailing out.\n"); 1493 LOG (llevDebug, "free_all_objects: Link error, bailing out.\n");
1384 break; 1494 break;
1385 } 1495 }
1496
1386 previous_obj=op; 1497 previous_obj = op;
1498
1387 if(op->head!=NULL) 1499 if (op->head != NULL)
1388 op = op->head; 1500 op = op->head;
1389 1501
1390 /* If the map isn't in memory, free_object will remove and 1502 /* If the map isn't in memory, free_object will remove and
1391 * free objects in op's inventory. So let it do the job. 1503 * free objects in op's inventory. So let it do the job.
1392 */ 1504 */
1393 if (m->in_memory==MAP_IN_MEMORY) 1505 if (m->in_memory == MAP_IN_MEMORY)
1394 clean_object(op); 1506 clean_object (op);
1395 remove_ob(op); 1507
1396 free_object(op); 1508 op->destroy ();
1397 } 1509 }
1398 } 1510 }
1399} 1511}
1400 1512
1401/* 1513/*
1402 * Frees everything allocated by the given mapstructure. 1514 * Frees everything allocated by the given maptileure.
1403 * don't free tmpname - our caller is left to do that 1515 * don't free tmpname - our caller is left to do that
1404 */ 1516 */
1405 1517
1518void
1406void free_map(mapstruct *m,int flag) { 1519free_map (maptile *m, int flag)
1520{
1407 int i; 1521 int i;
1408 1522
1409 if (!m->in_memory) { 1523 if (!m->in_memory)
1524 {
1410 LOG(llevError,"Trying to free freed map.\n"); 1525 LOG (llevError, "Trying to free freed map.\n");
1411 return; 1526 return;
1412 } 1527 }
1413 if (flag && m->spaces) free_all_objects(m); 1528
1529 // TODO: use new/delete
1530#define FREE_AND_CLEAR(p) { free (p); p = NULL; }
1531
1532 if (flag && m->spaces)
1533 free_all_objects (m);
1534 if (m->name)
1414 if (m->name) FREE_AND_CLEAR(m->name); 1535 FREE_AND_CLEAR (m->name);
1536 if (m->spaces)
1415 if (m->spaces) FREE_AND_CLEAR(m->spaces); 1537 FREE_AND_CLEAR (m->spaces);
1538 if (m->msg)
1416 if (m->msg) FREE_AND_CLEAR(m->msg); 1539 FREE_AND_CLEAR (m->msg);
1540 if (m->maplore)
1417 if (m->maplore) FREE_AND_CLEAR(m->maplore); 1541 FREE_AND_CLEAR (m->maplore);
1418 if (m->shopitems) FREE_AND_CLEAR(m->shopitems); 1542
1543 delete [] m->shopitems;
1544 m->shopitems = 0;
1545
1546 if (m->shoprace)
1419 if (m->shoprace) FREE_AND_CLEAR(m->shoprace); 1547 FREE_AND_CLEAR (m->shoprace);
1548
1420 if (m->buttons) 1549 if (m->buttons)
1421 free_objectlinkpt(m->buttons); 1550 free_objectlinkpt (m->buttons);
1551
1422 m->buttons = NULL; 1552 m->buttons = NULL;
1553
1423 for (i=0; i<4; i++) { 1554 for (i = 0; i < 4; i++)
1555 {
1556 if (m->tile_path[i])
1424 if (m->tile_path[i]) FREE_AND_CLEAR(m->tile_path[i]); 1557 FREE_AND_CLEAR (m->tile_path[i]);
1425 m->tile_map[i] = NULL; 1558 m->tile_map[i] = NULL;
1426 } 1559 }
1560
1427 m->in_memory = MAP_SWAPPED; 1561 m->in_memory = MAP_SWAPPED;
1562
1563#undef FREE_AND_CLEAR
1564
1428} 1565}
1429 1566
1430/* 1567/*
1431 * function: vanish mapstruct 1568 * function: vanish maptile
1432 * m : pointer to mapstruct, if NULL no action 1569 * m : pointer to maptile, if NULL no action
1433 * this deletes all the data on the map (freeing pointers) 1570 * this deletes all the data on the map (freeing pointers)
1434 * and then removes this map from the global linked list of maps. 1571 * and then removes this map from the global linked list of maps.
1435 */ 1572 */
1436 1573
1437void delete_map(mapstruct *m) { 1574void
1575delete_map (maptile *m)
1576{
1438 mapstruct *tmp, *last; 1577 maptile *tmp, *last;
1439 int i; 1578 int i;
1440 1579
1441 if (!m) 1580 if (!m)
1442 return; 1581 return;
1443 1582
1444 m->clear (); 1583 m->clear ();
1445 1584
1446 if (m->in_memory == MAP_IN_MEMORY) { 1585 if (m->in_memory == MAP_IN_MEMORY)
1586 {
1447 /* change to MAP_SAVING, even though we are not, 1587 /* change to MAP_SAVING, even though we are not,
1448 * so that remove_ob doesn't do as much work. 1588 * so that remove_ob doesn't do as much work.
1589 */
1590 m->in_memory = MAP_SAVING;
1591 free_map (m, 1);
1592 }
1593 /* move this out of free_map, since tmpname can still be needed if
1594 * the map is swapped out.
1595 */
1596 if (m->tmpname)
1597 {
1598 free (m->tmpname);
1599 m->tmpname = NULL;
1600 }
1601 last = NULL;
1602 /* We need to look through all the maps and see if any maps
1603 * are pointing at this one for tiling information. Since
1604 * tiling can be assymetric, we just can not look to see which
1605 * maps this map tiles with and clears those.
1606 */
1607 for (tmp = first_map; tmp != NULL; tmp = tmp->next)
1608 {
1609 if (tmp->next == m)
1610 last = tmp;
1611
1612 /* This should hopefully get unrolled on a decent compiler */
1613 for (i = 0; i < 4; i++)
1614 if (tmp->tile_map[i] == m)
1615 tmp->tile_map[i] = NULL;
1616 }
1617
1618 /* If last is null, then this should be the first map in the list */
1619 if (!last)
1620 {
1621 if (m == first_map)
1622 first_map = m->next;
1623 else
1624 /* m->path is a static char, so should hopefully still have
1625 * some useful data in it.
1449 */ 1626 */
1450 m->in_memory = MAP_SAVING;
1451 free_map (m, 1);
1452 }
1453 /* move this out of free_map, since tmpname can still be needed if
1454 * the map is swapped out.
1455 */
1456 if (m->tmpname) {
1457 free(m->tmpname);
1458 m->tmpname=NULL;
1459 }
1460 last = NULL;
1461 /* We need to look through all the maps and see if any maps
1462 * are pointing at this one for tiling information. Since
1463 * tiling can be assymetric, we just can not look to see which
1464 * maps this map tiles with and clears those.
1465 */
1466 for (tmp = first_map; tmp != NULL; tmp = tmp->next) {
1467 if (tmp->next == m) last = tmp;
1468
1469 /* This should hopefully get unrolled on a decent compiler */
1470 for (i=0; i<4; i++)
1471 if (tmp->tile_map[i] == m) tmp->tile_map[i]=NULL;
1472 }
1473
1474 /* If last is null, then this should be the first map in the list */
1475 if (!last) {
1476 if (m == first_map)
1477 first_map = m->next;
1478 else
1479 /* m->path is a static char, so should hopefully still have
1480 * some useful data in it.
1481 */
1482 LOG(llevError,"delete_map: Unable to find map %s in list\n", 1627 LOG (llevError, "delete_map: Unable to find map %s in list\n", m->path);
1483 m->path);
1484 } 1628 }
1485 else 1629 else
1486 last->next = m->next; 1630 last->next = m->next;
1487 1631
1488 delete m; 1632 delete m;
1489} 1633}
1490
1491
1492 1634
1493/* 1635/*
1494 * Makes sure the given map is loaded and swapped in. 1636 * Makes sure the given map is loaded and swapped in.
1495 * name is path name of the map. 1637 * name is path name of the map.
1496 * flags meaning: 1638 * flags meaning:
… …
1499 * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player. 1641 * 0x2 (MAP_PLAYER_UNIQUE) - this is a unique map for each player.
1500 * dont do any more name translation on it. 1642 * dont do any more name translation on it.
1501 * 1643 *
1502 * Returns a pointer to the given map. 1644 * Returns a pointer to the given map.
1503 */ 1645 */
1504 1646maptile *
1505mapstruct *ready_map_name(const char *name, int flags) { 1647ready_map_name (const char *name, int flags)
1506 mapstruct *m; 1648{
1649 maptile *m;
1507 1650
1508 if (!name) 1651 if (!name)
1509 return (NULL); 1652 return (NULL);
1510 1653
1511 /* Have we been at this level before? */ 1654 /* Have we been at this level before? */
1512 m = has_been_loaded (name); 1655 m = has_been_loaded (name);
1513 1656
1514 /* Map is good to go, so just return it */ 1657 /* Map is good to go, so just return it */
1515 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY)) { 1658 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY))
1659 {
1516 return m; 1660 return m;
1517 } 1661 }
1518 1662
1519 /* unique maps always get loaded from their original location, and never 1663 /* unique maps always get loaded from their original location, and never
1520 * a temp location. Likewise, if map_flush is set, or we have never loaded 1664 * a temp location. Likewise, if map_flush is set, or we have never loaded
1521 * this map, load it now. I removed the reset checking from here - 1665 * this map, load it now. I removed the reset checking from here -
1522 * it seems the probability of a player trying to enter a map that should 1666 * it seems the probability of a player trying to enter a map that should
1523 * reset but hasn't yet is quite low, and removing that makes this function 1667 * reset but hasn't yet is quite low, and removing that makes this function
1524 * a bit cleaner (and players probably shouldn't rely on exact timing for 1668 * a bit cleaner (and players probably shouldn't rely on exact timing for
1525 * resets in any case - if they really care, they should use the 'maps command. 1669 * resets in any case - if they really care, they should use the 'maps command.
1526 */ 1670 */
1527 if ((flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE)) || !m) { 1671 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m)
1672 {
1528 1673
1529 /* first visit or time to reset */ 1674 /* first visit or time to reset */
1530 if (m) { 1675 if (m)
1676 {
1531 clean_tmp_map(m); /* Doesn't make much difference */ 1677 clean_tmp_map (m); /* Doesn't make much difference */
1532 delete_map(m); 1678 delete_map (m);
1533 } 1679 }
1534 1680
1535 /* create and load a map */ 1681 /* create and load a map */
1536 if (flags & MAP_PLAYER_UNIQUE) 1682 if (flags & MAP_PLAYER_UNIQUE)
1537 LOG(llevDebug, "Trying to load map %s.\n", name); 1683 LOG (llevDebug, "Trying to load map %s.\n", name);
1538 else 1684 else
1539 LOG(llevDebug, "Trying to load map %s.\n", create_pathname(name)); 1685 LOG (llevDebug, "Trying to load map %s.\n", create_pathname (name));
1540 1686
1541 //eval_pv ("$x = Event::time", 1);//D 1687 //eval_pv ("$x = Event::time", 1);//D
1542 if (!(m = load_original_map(name, (flags & MAP_PLAYER_UNIQUE)))) 1688 if (!(m = load_original_map (name, (flags & MAP_PLAYER_UNIQUE))))
1543 return (NULL); 1689 return (NULL);
1544 //eval_pv ("warn \"LOAD \", Event::time - $x", 1);//D 1690 //eval_pv ("warn \"LOAD \", Event::time - $x", 1);//D
1545 1691
1546 fix_auto_apply(m); /* Chests which open as default */ 1692 fix_auto_apply (m); /* Chests which open as default */
1547 1693
1548 /* If a player unique map, no extra unique object file to load. 1694 /* If a player unique map, no extra unique object file to load.
1549 * if from the editor, likewise. 1695 * if from the editor, likewise.
1550 */ 1696 */
1551 if (!(flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE))) 1697 if (!(flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)))
1552 load_unique_objects(m); 1698 load_unique_objects (m);
1553 1699
1554 if (! (flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE|MAP_OVERLAY))) { 1700 if (!(flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE | MAP_OVERLAY)))
1701 {
1555 m=load_overlay_map(name, m); 1702 m = load_overlay_map (name, m);
1556 if (m==NULL) 1703 if (m == NULL)
1557 return NULL; 1704 return NULL;
1558 } 1705 }
1559 1706
1560 if (flags & MAP_PLAYER_UNIQUE) 1707 if (flags & MAP_PLAYER_UNIQUE)
1561 INVOKE_MAP (SWAPIN, m); 1708 INVOKE_MAP (SWAPIN, m);
1562 1709
1563 } else { 1710 }
1711 else
1712 {
1564 /* If in this loop, we found a temporary map, so load it up. */ 1713 /* If in this loop, we found a temporary map, so load it up. */
1565 1714
1566 m=load_temporary_map (m); 1715 m = load_temporary_map (m);
1716 if (m == NULL)
1567 if(m==NULL) return NULL; 1717 return NULL;
1568 load_unique_objects(m); 1718 load_unique_objects (m);
1569 1719
1570 clean_tmp_map(m); 1720 clean_tmp_map (m);
1571 m->in_memory = MAP_IN_MEMORY; 1721 m->in_memory = MAP_IN_MEMORY;
1572 /* tempnam() on sun systems (probably others) uses malloc 1722 /* tempnam() on sun systems (probably others) uses malloc
1573 * to allocated space for the string. Free it here. 1723 * to allocated space for the string. Free it here.
1574 * In some cases, load_temporary_map above won't find the 1724 * In some cases, load_temporary_map above won't find the
1575 * temporary map, and so has reloaded a new map. If that 1725 * temporary map, and so has reloaded a new map. If that
1576 * is the case, tmpname is now null 1726 * is the case, tmpname is now null
1577 */ 1727 */
1578 if (m->tmpname) free(m->tmpname); 1728 if (m->tmpname)
1729 free (m->tmpname);
1579 m->tmpname = NULL; 1730 m->tmpname = NULL;
1580 /* It's going to be saved anew anyway */ 1731 /* It's going to be saved anew anyway */
1581 } 1732 }
1582 1733
1583 /* Below here is stuff common to both first time loaded maps and 1734 /* Below here is stuff common to both first time loaded maps and
1584 * temp maps. 1735 * temp maps.
1585 */ 1736 */
1586 1737
1587 decay_objects(m); /* start the decay */ 1738 decay_objects (m); /* start the decay */
1588 /* In case other objects press some buttons down */ 1739 /* In case other objects press some buttons down */
1589 update_buttons(m); 1740 update_buttons (m);
1590 if (m->outdoor) 1741 if (m->outdoor)
1591 set_darkness_map(m); 1742 set_darkness_map (m);
1592 /* run the weather over this map */ 1743 /* run the weather over this map */
1593 weather_effect(name); 1744 weather_effect (name);
1594 return m; 1745 return m;
1595} 1746}
1596 1747
1597 1748
1598/* 1749/*
1599 * This routine is supposed to find out the difficulty of the map. 1750 * This routine is supposed to find out the difficulty of the map.
… …
1604 * in the map is zero, then use this routine. Maps should really 1755 * in the map is zero, then use this routine. Maps should really
1605 * have a difficulty set than using this function - human calculation 1756 * have a difficulty set than using this function - human calculation
1606 * is much better than this functions guesswork. 1757 * is much better than this functions guesswork.
1607 */ 1758 */
1608 1759
1760int
1609int calculate_difficulty(mapstruct *m) { 1761calculate_difficulty (maptile *m)
1762{
1610 object *op; 1763 object *op;
1611 archetype *at; 1764 archetype *at;
1612 int x, y, i, diff; 1765 int x, y, i;
1613 long monster_cnt = 0; 1766 long monster_cnt = 0;
1614 double avgexp = 0; 1767 double avgexp = 0;
1615 sint64 total_exp = 0; 1768 sint64 total_exp = 0;
1616 1769
1617 if (MAP_DIFFICULTY (m)) 1770 if (MAP_DIFFICULTY (m))
1618 { 1771 {
1619 LOG(llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m)); 1772 LOG (llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m));
1620 return MAP_DIFFICULTY (m); 1773 return MAP_DIFFICULTY (m);
1621 } 1774 }
1622 1775
1623 for(x = 0; x < MAP_WIDTH(m); x++) 1776 for (x = 0; x < MAP_WIDTH (m); x++)
1624 for(y = 0; y < MAP_HEIGHT(m); y++) 1777 for (y = 0; y < MAP_HEIGHT (m); y++)
1625 for(op = get_map_ob(m, x, y); op != NULL; op = op->above) 1778 for (op = GET_MAP_OB (m, x, y); op != NULL; op = op->above)
1626 { 1779 {
1627 if(QUERY_FLAG (op, FLAG_MONSTER)) 1780 if (QUERY_FLAG (op, FLAG_MONSTER))
1628 { 1781 {
1629 total_exp += op->stats.exp; 1782 total_exp += op->stats.exp;
1630 monster_cnt++; 1783 monster_cnt++;
1631 } 1784 }
1632 1785
1633 if(QUERY_FLAG (op, FLAG_GENERATOR)) 1786 if (QUERY_FLAG (op, FLAG_GENERATOR))
1634 { 1787 {
1635 total_exp += op->stats.exp; 1788 total_exp += op->stats.exp;
1636 at = type_to_archetype(GENERATE_TYPE (op)); 1789 at = type_to_archetype (GENERATE_TYPE (op));
1637 1790
1638 if(at != NULL) 1791 if (at != NULL)
1639 total_exp += at->clone.stats.exp * 8; 1792 total_exp += at->clone.stats.exp * 8;
1640 1793
1641 monster_cnt++; 1794 monster_cnt++;
1642 } 1795 }
1643 } 1796 }
… …
1654 } 1807 }
1655 1808
1656 return 1; 1809 return 1;
1657} 1810}
1658 1811
1659void clean_tmp_map(mapstruct *m) { 1812void
1813clean_tmp_map (maptile *m)
1814{
1660 if(m->tmpname == NULL) 1815 if (m->tmpname == NULL)
1661 return; 1816 return;
1662 INVOKE_MAP (CLEAN, m); 1817 INVOKE_MAP (CLEAN, m);
1663 (void) unlink(m->tmpname); 1818 (void) unlink (m->tmpname);
1664} 1819}
1665 1820
1821void
1666void free_all_maps(void) 1822free_all_maps (void)
1667{ 1823{
1668 int real_maps=0; 1824 int real_maps = 0;
1669 1825
1670 while (first_map) { 1826 while (first_map)
1827 {
1671 /* I think some of the callers above before it gets here set this to be 1828 /* I think some of the callers above before it gets here set this to be
1672 * saving, but we still want to free this data 1829 * saving, but we still want to free this data
1673 */ 1830 */
1674 if (first_map->in_memory == MAP_SAVING) first_map->in_memory = MAP_IN_MEMORY; 1831 if (first_map->in_memory == MAP_SAVING)
1832 first_map->in_memory = MAP_IN_MEMORY;
1675 delete_map(first_map); 1833 delete_map (first_map);
1676 real_maps++; 1834 real_maps++;
1677 } 1835 }
1678 LOG(llevDebug,"free_all_maps: Freed %d maps\n", real_maps); 1836 LOG (llevDebug, "free_all_maps: Freed %d maps\n", real_maps);
1679} 1837}
1680 1838
1681/* change_map_light() - used to change map light level (darkness) 1839/* change_map_light() - used to change map light level (darkness)
1682 * up or down. Returns true if successful. It should now be 1840 * up or down. Returns true if successful. It should now be
1683 * possible to change a value by more than 1. 1841 * possible to change a value by more than 1.
1684 * Move this from los.c to map.c since this is more related 1842 * Move this from los.c to map.c since this is more related
1685 * to maps than los. 1843 * to maps than los.
1686 * postive values make it darker, negative make it brighter 1844 * postive values make it darker, negative make it brighter
1687 */ 1845 */
1688 1846
1847int
1689int change_map_light(mapstruct *m, int change) { 1848change_map_light (maptile *m, int change)
1849{
1690 int new_level = m->darkness + change; 1850 int new_level = m->darkness + change;
1691 1851
1692 /* Nothing to do */ 1852 /* Nothing to do */
1693 if(!change || (new_level <= 0 && m->darkness == 0) || 1853 if (!change || (new_level <= 0 && m->darkness == 0) || (new_level >= MAX_DARKNESS && m->darkness >= MAX_DARKNESS))
1694 (new_level >= MAX_DARKNESS && m->darkness >=MAX_DARKNESS)) { 1854 {
1695 return 0; 1855 return 0;
1696 } 1856 }
1697 1857
1698 /* inform all players on the map */ 1858 /* inform all players on the map */
1699 if (change>0) 1859 if (change > 0)
1700 new_info_map(NDI_BLACK|NDI_UNIQUE, m,"It becomes darker."); 1860 new_info_map (NDI_BLACK | NDI_UNIQUE, m, "It becomes darker.");
1701 else 1861 else
1702 new_info_map(NDI_BLACK|NDI_UNIQUE, m,"It becomes brighter."); 1862 new_info_map (NDI_BLACK | NDI_UNIQUE, m, "It becomes brighter.");
1703 1863
1704 /* Do extra checking. since m->darkness is a unsigned value, 1864 /* Do extra checking. since m->darkness is a unsigned value,
1705 * we need to be extra careful about negative values. 1865 * we need to be extra careful about negative values.
1706 * In general, the checks below are only needed if change 1866 * In general, the checks below are only needed if change
1707 * is not +/-1 1867 * is not +/-1
1708 */ 1868 */
1709 if (new_level < 0) m->darkness = 0; 1869 if (new_level < 0)
1710 else if (new_level >=MAX_DARKNESS) m->darkness = MAX_DARKNESS; 1870 m->darkness = 0;
1871 else if (new_level >= MAX_DARKNESS)
1872 m->darkness = MAX_DARKNESS;
1873 else
1711 else m->darkness=new_level; 1874 m->darkness = new_level;
1712 1875
1713 /* All clients need to get re-updated for the change */ 1876 /* All clients need to get re-updated for the change */
1714 update_all_map_los(m); 1877 update_all_map_los (m);
1715 return 1; 1878 return 1;
1716} 1879}
1717
1718 1880
1719/* 1881/*
1720 * This function updates various attributes about a specific space 1882 * This function updates various attributes about a specific space
1721 * on the map (what it looks like, whether it blocks magic, 1883 * on the map (what it looks like, whether it blocks magic,
1722 * has a living creatures, prevents people from passing 1884 * has a living creatures, prevents people from passing
1723 * through, etc) 1885 * through, etc)
1724 */ 1886 */
1725void update_position (mapstruct *m, int x, int y) { 1887void
1888mapspace::update_ ()
1889{
1726 object *tmp, *last = NULL; 1890 object *tmp, *last = 0;
1727 uint8 flags = 0, oldflags, light=0, anywhere=0; 1891 uint8 flags = 0, light = 0, anywhere = 0;
1728 New_Face *top,*floor, *middle; 1892 New_Face *top, *floor, *middle;
1729 object *top_obj, *floor_obj, *middle_obj; 1893 object *top_obj, *floor_obj, *middle_obj;
1730 MoveType move_block=0, move_slow=0, move_on=0, move_off=0, move_allow=0; 1894 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1731 1895
1732 oldflags = GET_MAP_FLAGS(m,x,y);
1733 if (!(oldflags & P_NEED_UPDATE)) {
1734 LOG(llevDebug,"update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n",
1735 m->path, x, y);
1736 return;
1737 }
1738
1739 middle=blank_face; 1896 middle = blank_face;
1740 top=blank_face; 1897 top = blank_face;
1741 floor=blank_face; 1898 floor = blank_face;
1742 1899
1743 middle_obj = NULL; 1900 middle_obj = 0;
1744 top_obj = NULL; 1901 top_obj = 0;
1745 floor_obj = NULL; 1902 floor_obj = 0;
1746 1903
1747 for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above) { 1904 for (tmp = bottom; tmp; last = tmp, tmp = tmp->above)
1748 1905 {
1749 /* This could be made additive I guess (two lights better than 1906 /* This could be made additive I guess (two lights better than
1750 * one). But if so, it shouldn't be a simple additive - 2 1907 * one). But if so, it shouldn't be a simple additive - 2
1751 * light bulbs do not illuminate twice as far as once since 1908 * light bulbs do not illuminate twice as far as once since
1752 * it is a disapation factor that is squared (or is it cubed?) 1909 * it is a dissapation factor that is cubed.
1753 */ 1910 */
1754 if (tmp->glow_radius > light) light = tmp->glow_radius; 1911 if (tmp->glow_radius > light)
1912 light = tmp->glow_radius;
1755 1913
1756 /* This call is needed in order to update objects the player 1914 /* This call is needed in order to update objects the player
1757 * is standing in that have animations (ie, grass, fire, etc). 1915 * is standing in that have animations (ie, grass, fire, etc).
1758 * However, it also causes the look window to be re-drawn 1916 * However, it also causes the look window to be re-drawn
1759 * 3 times each time the player moves, because many of the 1917 * 3 times each time the player moves, because many of the
1760 * functions the move_player calls eventualy call this. 1918 * functions the move_player calls eventualy call this.
1761 * 1919 *
1762 * Always put the player down for drawing. 1920 * Always put the player down for drawing.
1763 */ 1921 */
1764 if (!tmp->invisible) { 1922 if (!tmp->invisible)
1923 {
1765 if ((tmp->type==PLAYER || QUERY_FLAG(tmp, FLAG_MONSTER))) { 1924 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1925 {
1766 top = tmp->face; 1926 top = tmp->face;
1767 top_obj = tmp; 1927 top_obj = tmp;
1768 } 1928 }
1769 else if (QUERY_FLAG(tmp,FLAG_IS_FLOOR)) { 1929 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1930 {
1770 /* If we got a floor, that means middle and top were below it, 1931 /* If we got a floor, that means middle and top were below it,
1771 * so should not be visible, so we clear them. 1932 * so should not be visible, so we clear them.
1772 */ 1933 */
1773 middle=blank_face; 1934 middle = blank_face;
1774 top=blank_face; 1935 top = blank_face;
1775 floor = tmp->face; 1936 floor = tmp->face;
1776 floor_obj = tmp; 1937 floor_obj = tmp;
1777 } 1938 }
1778 /* Flag anywhere have high priority */ 1939 /* Flag anywhere have high priority */
1779 else if (QUERY_FLAG(tmp, FLAG_SEE_ANYWHERE)) { 1940 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1941 {
1780 middle = tmp->face; 1942 middle = tmp->face;
1781 1943
1782 middle_obj = tmp; 1944 middle_obj = tmp;
1783 anywhere =1; 1945 anywhere = 1;
1784 } 1946 }
1785 /* Find the highest visible face around. If equal 1947 /* Find the highest visible face around. If equal
1786 * visibilities, we still want the one nearer to the 1948 * visibilities, we still want the one nearer to the
1787 * top 1949 * top
1788 */ 1950 */
1789 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) { 1951 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere))
1952 {
1790 middle = tmp->face; 1953 middle = tmp->face;
1791 middle_obj = tmp; 1954 middle_obj = tmp;
1792 } 1955 }
1793 } 1956 }
1957
1794 if (tmp==tmp->above) { 1958 if (tmp == tmp->above)
1959 {
1795 LOG(llevError, "Error in structure of map\n"); 1960 LOG (llevError, "Error in structure of map\n");
1796 exit (-1); 1961 exit (-1);
1797 }
1798 1962 }
1963
1799 move_slow |= tmp->move_slow; 1964 move_slow |= tmp->move_slow;
1800 move_block |= tmp->move_block; 1965 move_block |= tmp->move_block;
1801 move_on |= tmp->move_on; 1966 move_on |= tmp->move_on;
1802 move_off |= tmp->move_off; 1967 move_off |= tmp->move_off;
1803 move_allow |= tmp->move_allow; 1968 move_allow |= tmp->move_allow;
1804 1969
1805 if (QUERY_FLAG(tmp,FLAG_ALIVE))
1806 flags |= P_IS_ALIVE;
1807 if (QUERY_FLAG(tmp,FLAG_NO_MAGIC))
1808 flags |= P_NO_MAGIC;
1809 if (QUERY_FLAG(tmp,FLAG_DAMNED))
1810 flags |= P_NO_CLERIC;
1811 if (tmp->type == SAFE_GROUND)
1812 flags |= P_SAFE | P_NO_CLERIC | P_NO_MAGIC;
1813
1814 if (QUERY_FLAG(tmp,FLAG_BLOCKSVIEW)) 1970 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW;
1815 flags |= P_BLOCKSVIEW; 1971 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC;
1816 } /* for stack of objects */ 1972 if (tmp->type == PLAYER) flags |= P_PLAYER;
1817 1973 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1818 /* we don't want to rely on this function to have accurate flags, but 1974 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1819 * since we're already doing the work, we calculate them here. 1975 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1820 * if they don't match, logic is broken someplace.
1821 */
1822 if (((oldflags & ~(P_NEED_UPDATE|P_NO_ERROR)) != flags) &&
1823 (!(oldflags & P_NO_ERROR))) {
1824 LOG(llevDebug,"update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n",
1825 m->path, x, y,
1826 (oldflags & ~P_NEED_UPDATE), flags);
1827 } 1976 }
1828 SET_MAP_FLAGS(m, x, y, flags);
1829 SET_MAP_MOVE_BLOCK(m, x, y, move_block & ~move_allow);
1830 SET_MAP_MOVE_ON(m, x, y, move_on);
1831 SET_MAP_MOVE_OFF(m, x, y, move_off);
1832 SET_MAP_MOVE_SLOW(m, x, y, move_slow);
1833 1977
1978 this->light = light;
1979 this->flags_ = flags;
1980 this->move_block = move_block & ~move_allow;
1981 this->move_on = move_on;
1982 this->move_off = move_off;
1983 this->move_slow = move_slow;
1984
1834 /* At this point, we have a floor face (if there is a floor), 1985 /* At this point, we have a floor face (if there is a floor),
1835 * and the floor is set - we are not going to touch it at 1986 * and the floor is set - we are not going to touch it at
1836 * this point. 1987 * this point.
1837 * middle contains the highest visibility face. 1988 * middle contains the highest visibility face.
1838 * top contains a player/monster face, if there is one. 1989 * top contains a player/monster face, if there is one.
1839 * 1990 *
1840 * We now need to fill in top.face and/or middle.face. 1991 * We now need to fill in top.face and/or middle.face.
1841 */ 1992 */
1842 1993
1843 /* If the top face also happens to be high visibility, re-do our 1994 /* If the top face also happens to be high visibility, re-do our
1844 * middle face. This should not happen, as we already have the 1995 * middle face. This should not happen, as we already have the
1845 * else statement above so middle should not get set. OTOH, it 1996 * else statement above so middle should not get set. OTOH, it
1846 * may be possible for the faces to match but be different objects. 1997 * may be possible for the faces to match but be different objects.
1847 */ 1998 */
1848 if (top == middle) middle=blank_face; 1999 if (top == middle)
2000 middle = blank_face;
1849 2001
1850 /* There are three posibilities at this point: 2002 /* There are three posibilities at this point:
1851 * 1) top face is set, need middle to be set. 2003 * 1) top face is set, need middle to be set.
1852 * 2) middle is set, need to set top. 2004 * 2) middle is set, need to set top.
1853 * 3) neither middle or top is set - need to set both. 2005 * 3) neither middle or top is set - need to set both.
1854 */ 2006 */
1855 2007
1856 for (tmp=last; tmp; tmp=tmp->below) { 2008 for (tmp = last; tmp; tmp = tmp->below)
2009 {
1857 /* Once we get to a floor, stop, since we already have a floor object */ 2010 /* Once we get to a floor, stop, since we already have a floor object */
1858 if (QUERY_FLAG(tmp,FLAG_IS_FLOOR)) break; 2011 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
2012 break;
1859 2013
1860 /* If two top faces are already set, quit processing */ 2014 /* If two top faces are already set, quit processing */
1861 if ((top != blank_face) && (middle != blank_face)) break; 2015 if ((top != blank_face) && (middle != blank_face))
2016 break;
1862 2017
1863 /* Only show visible faces, unless its the editor - show all */ 2018 /* Only show visible faces, unless its the editor - show all */
1864 if (!tmp->invisible || editor) { 2019 if (!tmp->invisible || editor)
2020 {
1865 /* Fill in top if needed */ 2021 /* Fill in top if needed */
1866 if (top == blank_face) { 2022 if (top == blank_face)
2023 {
1867 top = tmp->face; 2024 top = tmp->face;
1868 top_obj = tmp; 2025 top_obj = tmp;
2026 if (top == middle)
1869 if (top == middle) middle=blank_face; 2027 middle = blank_face;
2028 }
1870 } else { 2029 else
2030 {
1871 /* top is already set - we should only get here if 2031 /* top is already set - we should only get here if
1872 * middle is not set 2032 * middle is not set
1873 * 2033 *
1874 * Set the middle face and break out, since there is nothing 2034 * Set the middle face and break out, since there is nothing
1875 * more to fill in. We don't check visiblity here, since 2035 * more to fill in. We don't check visiblity here, since
1876 * 2036 *
1877 */ 2037 */
1878 if (tmp->face != top ) { 2038 if (tmp->face != top)
2039 {
1879 middle = tmp->face; 2040 middle = tmp->face;
1880 middle_obj = tmp; 2041 middle_obj = tmp;
1881 break; 2042 break;
1882 } 2043 }
1883 } 2044 }
1884 } 2045 }
1885 } 2046 }
1886 if (middle == floor) middle = blank_face; 2047
1887 if (top == middle) middle = blank_face; 2048 if (middle == floor)
1888 SET_MAP_FACE(m,x,y,top,0);
1889 if(top != blank_face)
1890 SET_MAP_FACE_OBJ(m,x,y,top_obj,0);
1891 else
1892 SET_MAP_FACE_OBJ(m,x,y,NULL,0);
1893 SET_MAP_FACE(m,x,y,middle,1);
1894 if(middle != blank_face) 2049 middle = blank_face;
1895 SET_MAP_FACE_OBJ(m,x,y,middle_obj,1);
1896 else
1897 SET_MAP_FACE_OBJ(m,x,y,NULL,1);
1898 SET_MAP_FACE(m,x,y,floor,2);
1899 if(floor != blank_face)
1900 SET_MAP_FACE_OBJ(m,x,y,floor_obj,2);
1901 else
1902 SET_MAP_FACE_OBJ(m,x,y,NULL,2);
1903 SET_MAP_LIGHT(m,x,y,light);
1904}
1905 2050
2051 if (top == middle)
2052 middle = blank_face;
1906 2053
2054 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;
2055 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;
2056 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
2057}
2058
2059void
1907void set_map_reset_time(mapstruct *map) { 2060set_map_reset_time (maptile *map)
2061{
1908 int timeout; 2062 int timeout;
1909 2063
1910 timeout = MAP_RESET_TIMEOUT(map); 2064 timeout = MAP_RESET_TIMEOUT (map);
1911 if (timeout <= 0) 2065 if (timeout <= 0)
1912 timeout = MAP_DEFAULTRESET; 2066 timeout = MAP_DEFAULTRESET;
1913 if (timeout >= MAP_MAXRESET) 2067 if (timeout >= MAP_MAXRESET)
1914 timeout = MAP_MAXRESET; 2068 timeout = MAP_MAXRESET;
1915 MAP_WHEN_RESET(map) = seconds()+timeout; 2069 MAP_WHEN_RESET (map) = time (0) + timeout;
1916} 2070}
1917 2071
1918/* this updates the orig_map->tile_map[tile_num] value after loading 2072/* this updates the orig_map->tile_map[tile_num] value after loading
1919 * the map. It also takes care of linking back the freshly loaded 2073 * the map. It also takes care of linking back the freshly loaded
1920 * maps tile_map values if it tiles back to this one. It returns 2074 * maps tile_map values if it tiles back to this one. It returns
1921 * the value of orig_map->tile_map[tile_num]. It really only does this 2075 * the value of orig_map->tile_map[tile_num]. It really only does this
1922 * so that it is easier for calling functions to verify success. 2076 * so that it is easier for calling functions to verify success.
1923 */ 2077 */
1924 2078
2079static maptile *
1925static mapstruct *load_and_link_tiled_map(mapstruct *orig_map, int tile_num) 2080load_and_link_tiled_map (maptile *orig_map, int tile_num)
1926{ 2081{
1927 int dest_tile = (tile_num +2) % 4; 2082 int dest_tile = (tile_num + 2) % 4;
1928 char *path = path_combine_and_normalize(orig_map->path, orig_map->tile_path[tile_num]); 2083 char *path = path_combine_and_normalize (orig_map->path, orig_map->tile_path[tile_num]);
1929 2084
1930 orig_map->tile_map[tile_num] = ready_map_name(path, 0); 2085 orig_map->tile_map[tile_num] = ready_map_name (path, 0);
1931 2086
1932 /* need to do a strcmp here as the orig_map->path is not a shared string */ 2087 /* need to do a strcmp here as the orig_map->path is not a shared string */
1933 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] && 2088 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] && !strcmp (orig_map->tile_map[tile_num]->tile_path[dest_tile], orig_map->path))
1934 !strcmp(orig_map->tile_map[tile_num]->tile_path[dest_tile], orig_map->path))
1935 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; 2089 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1936 2090
1937 return orig_map->tile_map[tile_num]; 2091 return orig_map->tile_map[tile_num];
1938} 2092}
1939 2093
1940/* this returns TRUE if the coordinates (x,y) are out of 2094/* this returns TRUE if the coordinates (x,y) are out of
1941 * map m. This function also takes into account any 2095 * map m. This function also takes into account any
1942 * tiling considerations, loading adjacant maps as needed. 2096 * tiling considerations, loading adjacant maps as needed.
… …
1945 * This function will recursively call itself for the 2099 * This function will recursively call itself for the
1946 * tiled maps. 2100 * tiled maps.
1947 * 2101 *
1948 * 2102 *
1949 */ 2103 */
2104int
1950int out_of_map(mapstruct *m, int x, int y) 2105out_of_map (maptile *m, int x, int y)
1951{ 2106{
1952
1953 /* If we get passed a null map, this is obviously the 2107 /* If we get passed a null map, this is obviously the
1954 * case. This generally shouldn't happen, but if the 2108 * case. This generally shouldn't happen, but if the
1955 * map loads fail below, it could happen. 2109 * map loads fail below, it could happen.
1956 */ 2110 */
1957 if (!m) return 0; 2111 if (!m)
1958
1959 if (x<0) {
1960 if (!m->tile_path[3]) return 1;
1961 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) {
1962 load_and_link_tiled_map(m, 3);
1963 }
1964 return (out_of_map(m->tile_map[3], x + MAP_WIDTH(m->tile_map[3]), y));
1965 }
1966 if (x>=MAP_WIDTH(m)) {
1967 if (!m->tile_path[1]) return 1;
1968 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) {
1969 load_and_link_tiled_map(m, 1);
1970 }
1971 return (out_of_map(m->tile_map[1], x - MAP_WIDTH(m), y));
1972 }
1973 if (y<0) {
1974 if (!m->tile_path[0]) return 1;
1975 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) {
1976 load_and_link_tiled_map(m, 0);
1977 }
1978 return (out_of_map(m->tile_map[0], x, y + MAP_HEIGHT(m->tile_map[0])));
1979 }
1980 if (y>=MAP_HEIGHT(m)) {
1981 if (!m->tile_path[2]) return 1;
1982 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) {
1983 load_and_link_tiled_map(m, 2);
1984 }
1985 return (out_of_map(m->tile_map[2], x, y - MAP_HEIGHT(m)));
1986 }
1987
1988 /* Simple case - coordinates are within this local
1989 * map.
1990 */
1991 return 0; 2112 return 0;
2113
2114 if (x < 0)
2115 {
2116 if (!m->tile_path[3])
2117 return 1;
2118
2119 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2120 load_and_link_tiled_map (m, 3);
2121
2122 return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y));
2123 }
2124
2125 if (x >= MAP_WIDTH (m))
2126 {
2127 if (!m->tile_path[1])
2128 return 1;
2129
2130 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2131 load_and_link_tiled_map (m, 1);
2132
2133 return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y));
2134 }
2135
2136 if (y < 0)
2137 {
2138 if (!m->tile_path[0])
2139 return 1;
2140
2141 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2142 load_and_link_tiled_map (m, 0);
2143
2144 return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0])));
2145 }
2146
2147 if (y >= MAP_HEIGHT (m))
2148 {
2149 if (!m->tile_path[2])
2150 return 1;
2151
2152 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2153 load_and_link_tiled_map (m, 2);
2154
2155 return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m)));
2156 }
2157
2158 /* Simple case - coordinates are within this local
2159 * map.
2160 */
2161 return 0;
1992} 2162}
1993 2163
1994/* This is basically the same as out_of_map above, but 2164/* This is basically the same as out_of_map above, but
1995 * instead we return NULL if no map is valid (coordinates 2165 * instead we return NULL if no map is valid (coordinates
1996 * out of bounds and no tiled map), otherwise it returns 2166 * out of bounds and no tiled map), otherwise it returns
1997 * the map as that the coordinates are really on, and 2167 * the map as that the coordinates are really on, and
1998 * updates x and y to be the localized coordinates. 2168 * updates x and y to be the localized coordinates.
1999 * Using this is more efficient of calling out_of_map 2169 * Using this is more efficient of calling out_of_map
2000 * and then figuring out what the real map is 2170 * and then figuring out what the real map is
2001 */ 2171 */
2172maptile *
2002mapstruct *get_map_from_coord(mapstruct *m, sint16 *x, sint16 *y) 2173get_map_from_coord (maptile *m, sint16 * x, sint16 * y)
2003{ 2174{
2004 2175
2005 if (*x<0) { 2176 if (*x < 0)
2177 {
2006 if (!m->tile_path[3]) return NULL; 2178 if (!m->tile_path[3])
2179 return 0;
2007 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2180 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2008 load_and_link_tiled_map(m, 3); 2181 load_and_link_tiled_map (m, 3);
2009 2182
2010 *x += MAP_WIDTH(m->tile_map[3]); 2183 *x += MAP_WIDTH (m->tile_map[3]);
2011 return (get_map_from_coord(m->tile_map[3], x, y)); 2184 return (get_map_from_coord (m->tile_map[3], x, y));
2012 } 2185 }
2186
2013 if (*x>=MAP_WIDTH(m)) { 2187 if (*x >= MAP_WIDTH (m))
2188 {
2014 if (!m->tile_path[1]) return NULL; 2189 if (!m->tile_path[1])
2190 return 0;
2191
2015 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2192 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2016 load_and_link_tiled_map(m, 1); 2193 load_and_link_tiled_map (m, 1);
2017 2194
2018 *x -= MAP_WIDTH(m); 2195 *x -= MAP_WIDTH (m);
2019 return (get_map_from_coord(m->tile_map[1], x, y)); 2196 return (get_map_from_coord (m->tile_map[1], x, y));
2197 }
2198
2199 if (*y < 0)
2020 } 2200 {
2021 if (*y<0) {
2022 if (!m->tile_path[0]) return NULL; 2201 if (!m->tile_path[0])
2202 return 0;
2203
2023 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2204 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2024 load_and_link_tiled_map(m, 0); 2205 load_and_link_tiled_map (m, 0);
2025 2206
2026 *y += MAP_HEIGHT(m->tile_map[0]); 2207 *y += MAP_HEIGHT (m->tile_map[0]);
2027 return (get_map_from_coord(m->tile_map[0], x, y)); 2208 return (get_map_from_coord (m->tile_map[0], x, y));
2028 } 2209 }
2210
2029 if (*y>=MAP_HEIGHT(m)) { 2211 if (*y >= MAP_HEIGHT (m))
2212 {
2030 if (!m->tile_path[2]) return NULL; 2213 if (!m->tile_path[2])
2214 return 0;
2215
2031 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2216 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2032 load_and_link_tiled_map(m, 2); 2217 load_and_link_tiled_map (m, 2);
2033 2218
2034 *y -= MAP_HEIGHT(m); 2219 *y -= MAP_HEIGHT (m);
2035 return (get_map_from_coord(m->tile_map[2], x, y)); 2220 return (get_map_from_coord (m->tile_map[2], x, y));
2036 } 2221 }
2037 2222
2038 /* Simple case - coordinates are within this local 2223 /* Simple case - coordinates are within this local
2039 * map. 2224 * map.
2040 */ 2225 */
2041 2226
2042 return m; 2227 return m;
2043} 2228}
2044 2229
2045/** 2230/**
2046 * Return whether map2 is adjacent to map1. If so, store the distance from 2231 * Return whether map2 is adjacent to map1. If so, store the distance from
2047 * map1 to map2 in dx/dy. 2232 * map1 to map2 in dx/dy.
2048 */ 2233 */
2234static int
2049static int adjacent_map(const mapstruct *map1, const mapstruct *map2, int *dx, int *dy) { 2235adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
2236{
2050 if (!map1 || !map2) 2237 if (!map1 || !map2)
2051 return 0; 2238 return 0;
2052 2239
2053 if (map1 == map2) { 2240 if (map1 == map2)
2241 {
2054 *dx = 0; 2242 *dx = 0;
2055 *dy = 0; 2243 *dy = 0;
2056 2244
2245 }
2057 } else if (map1->tile_map[0] == map2) { /* up */ 2246 else if (map1->tile_map[0] == map2)
2247 { /* up */
2058 *dx = 0; 2248 *dx = 0;
2059 *dy = -MAP_HEIGHT(map2); 2249 *dy = -MAP_HEIGHT (map2);
2250 }
2060 } else if (map1->tile_map[1] == map2) { /* right */ 2251 else if (map1->tile_map[1] == map2)
2252 { /* right */
2061 *dx = MAP_WIDTH(map1); 2253 *dx = MAP_WIDTH (map1);
2062 *dy = 0; 2254 *dy = 0;
2255 }
2063 } else if (map1->tile_map[2] == map2) { /* down */ 2256 else if (map1->tile_map[2] == map2)
2257 { /* down */
2064 *dx = 0; 2258 *dx = 0;
2065 *dy = MAP_HEIGHT(map1); 2259 *dy = MAP_HEIGHT (map1);
2260 }
2066 } else if (map1->tile_map[3] == map2) { /* left */ 2261 else if (map1->tile_map[3] == map2)
2262 { /* left */
2067 *dx = -MAP_WIDTH(map2); 2263 *dx = -MAP_WIDTH (map2);
2068 *dy = 0; 2264 *dy = 0;
2069 2265
2266 }
2070 } else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) { /* up right */ 2267 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)
2268 { /* up right */
2071 *dx = MAP_WIDTH(map1->tile_map[0]); 2269 *dx = MAP_WIDTH (map1->tile_map[0]);
2072 *dy = -MAP_HEIGHT(map1->tile_map[0]); 2270 *dy = -MAP_HEIGHT (map1->tile_map[0]);
2271 }
2073 } else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) { /* up left */ 2272 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)
2273 { /* up left */
2074 *dx = -MAP_WIDTH(map2); 2274 *dx = -MAP_WIDTH (map2);
2075 *dy = -MAP_HEIGHT(map1->tile_map[0]); 2275 *dy = -MAP_HEIGHT (map1->tile_map[0]);
2276 }
2076 } else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) { /* right up */ 2277 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)
2278 { /* right up */
2077 *dx = MAP_WIDTH(map1); 2279 *dx = MAP_WIDTH (map1);
2078 *dy = -MAP_HEIGHT(map2); 2280 *dy = -MAP_HEIGHT (map2);
2281 }
2079 } else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) { /* right down */ 2282 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)
2283 { /* right down */
2080 *dx = MAP_WIDTH(map1); 2284 *dx = MAP_WIDTH (map1);
2081 *dy = MAP_HEIGHT(map1->tile_map[1]); 2285 *dy = MAP_HEIGHT (map1->tile_map[1]);
2286 }
2082 } else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) { /* down right */ 2287 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)
2288 { /* down right */
2083 *dx = MAP_WIDTH(map1->tile_map[2]); 2289 *dx = MAP_WIDTH (map1->tile_map[2]);
2084 *dy = MAP_HEIGHT(map1); 2290 *dy = MAP_HEIGHT (map1);
2291 }
2085 } else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) { /* down left */ 2292 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)
2293 { /* down left */
2086 *dx = -MAP_WIDTH(map2); 2294 *dx = -MAP_WIDTH (map2);
2087 *dy = MAP_HEIGHT(map1); 2295 *dy = MAP_HEIGHT (map1);
2296 }
2088 } else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) { /* left up */ 2297 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)
2298 { /* left up */
2089 *dx = -MAP_WIDTH(map1->tile_map[3]); 2299 *dx = -MAP_WIDTH (map1->tile_map[3]);
2090 *dy = -MAP_HEIGHT(map2); 2300 *dy = -MAP_HEIGHT (map2);
2301 }
2091 } else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) { /* left down */ 2302 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)
2303 { /* left down */
2092 *dx = -MAP_WIDTH(map1->tile_map[3]); 2304 *dx = -MAP_WIDTH (map1->tile_map[3]);
2093 *dy = MAP_HEIGHT(map1->tile_map[3]); 2305 *dy = MAP_HEIGHT (map1->tile_map[3]);
2094 2306
2095 } else { /* not "adjacent" enough */ 2307 }
2308 else
2309 { /* not "adjacent" enough */
2096 return 0; 2310 return 0;
2097 } 2311 }
2098 2312
2099 return 1; 2313 return 1;
2100} 2314}
2101 2315
2102/* From map.c 2316/* From map.c
2103 * This is used by get_player to determine where the other 2317 * This is used by get_player to determine where the other
2104 * creature is. get_rangevector takes into account map tiling, 2318 * creature is. get_rangevector takes into account map tiling,
… …
2118 * 2332 *
2119 * currently, the only flag supported (0x1) is don't translate for 2333 * currently, the only flag supported (0x1) is don't translate for
2120 * closest body part of 'op1' 2334 * closest body part of 'op1'
2121 */ 2335 */
2122 2336
2337void
2123void get_rangevector(object *op1, object *op2, rv_vector *retval, int flags) { 2338get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
2339{
2124 if (!adjacent_map(op1->map, op2->map, &retval->distance_x, &retval->distance_y)) { 2340 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
2341 {
2125 /* be conservative and fill in _some_ data */ 2342 /* be conservative and fill in _some_ data */
2126 retval->distance = 100000; 2343 retval->distance = 100000;
2127 retval->distance_x = 32767; 2344 retval->distance_x = 32767;
2128 retval->distance_y = 32767; 2345 retval->distance_y = 32767;
2129 retval->direction = 0; 2346 retval->direction = 0;
2130 retval->part = 0; 2347 retval->part = 0;
2131 } else { 2348 }
2349 else
2350 {
2132 object *best; 2351 object *best;
2133 2352
2134 retval->distance_x += op2->x-op1->x; 2353 retval->distance_x += op2->x - op1->x;
2135 retval->distance_y += op2->y-op1->y; 2354 retval->distance_y += op2->y - op1->y;
2136 2355
2137 best = op1; 2356 best = op1;
2138 /* If this is multipart, find the closest part now */ 2357 /* If this is multipart, find the closest part now */
2139 if (!(flags&0x1) && op1->more) { 2358 if (!(flags & 0x1) && op1->more)
2359 {
2140 object *tmp; 2360 object *tmp;
2141 int best_distance = retval->distance_x*retval->distance_x+ 2361 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
2142 retval->distance_y*retval->distance_y, tmpi;
2143 2362
2144 /* we just take the offset of the piece to head to figure 2363 /* we just take the offset of the piece to head to figure
2145 * distance instead of doing all that work above again 2364 * distance instead of doing all that work above again
2146 * since the distance fields we set above are positive in the 2365 * since the distance fields we set above are positive in the
2147 * same axis as is used for multipart objects, the simply arithmetic 2366 * same axis as is used for multipart objects, the simply arithmetic
2148 * below works. 2367 * below works.
2149 */ 2368 */
2150 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) { 2369 for (tmp = op1->more; tmp != NULL; tmp = tmp->more)
2370 {
2151 tmpi = (op1->x-tmp->x+retval->distance_x)*(op1->x-tmp->x+retval->distance_x)+ 2371 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
2152 (op1->y-tmp->y+retval->distance_y)*(op1->y-tmp->y+retval->distance_y); 2372 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
2153 if (tmpi < best_distance) { 2373 if (tmpi < best_distance)
2374 {
2154 best_distance = tmpi; 2375 best_distance = tmpi;
2155 best = tmp; 2376 best = tmp;
2156 } 2377 }
2157 } 2378 }
2158 if (best != op1) { 2379 if (best != op1)
2380 {
2159 retval->distance_x += op1->x-best->x; 2381 retval->distance_x += op1->x - best->x;
2160 retval->distance_y += op1->y-best->y; 2382 retval->distance_y += op1->y - best->y;
2161 } 2383 }
2162 } 2384 }
2163 retval->part = best; 2385 retval->part = best;
2164 retval->distance = isqrt(retval->distance_x*retval->distance_x+retval->distance_y*retval->distance_y); 2386 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);
2165 retval->direction = find_dir_2(-retval->distance_x, -retval->distance_y); 2387 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
2166 } 2388 }
2167} 2389}
2168 2390
2169/* this is basically the same as get_rangevector above, but instead of 2391/* this is basically the same as get_rangevector above, but instead of
2170 * the first parameter being an object, it instead is the map 2392 * the first parameter being an object, it instead is the map
… …
2175 * be more consistant with the above function and also in case they are needed 2397 * be more consistant with the above function and also in case they are needed
2176 * for something in the future. Also, since no object is pasted, the best 2398 * for something in the future. Also, since no object is pasted, the best
2177 * field of the rv_vector is set to NULL. 2399 * field of the rv_vector is set to NULL.
2178 */ 2400 */
2179 2401
2402void
2180void get_rangevector_from_mapcoord(const mapstruct *m, int x, int y, const object *op2, rv_vector *retval, int flags) { 2403get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags)
2404{
2181 if (!adjacent_map(m, op2->map, &retval->distance_x, &retval->distance_y)) { 2405 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
2406 {
2182 /* be conservative and fill in _some_ data */ 2407 /* be conservative and fill in _some_ data */
2183 retval->distance = 100000; 2408 retval->distance = 100000;
2184 retval->distance_x = 32767; 2409 retval->distance_x = 32767;
2185 retval->distance_y = 32767; 2410 retval->distance_y = 32767;
2186 retval->direction = 0; 2411 retval->direction = 0;
2187 retval->part = 0; 2412 retval->part = 0;
2188 } else { 2413 }
2414 else
2415 {
2189 retval->distance_x += op2->x-x; 2416 retval->distance_x += op2->x - x;
2190 retval->distance_y += op2->y-y; 2417 retval->distance_y += op2->y - y;
2191 2418
2192 retval->part = NULL; 2419 retval->part = NULL;
2193 retval->distance = isqrt(retval->distance_x*retval->distance_x+retval->distance_y*retval->distance_y); 2420 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);
2194 retval->direction = find_dir_2(-retval->distance_x, -retval->distance_y); 2421 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
2195 } 2422 }
2196} 2423}
2197 2424
2198/* Returns true of op1 and op2 are effectively on the same map 2425/* Returns true of op1 and op2 are effectively on the same map
2199 * (as related to map tiling). Note that this looks for a path from 2426 * (as related to map tiling). Note that this looks for a path from
… …
2201 * to op1, this will still return false. 2428 * to op1, this will still return false.
2202 * Note we only look one map out to keep the processing simple 2429 * Note we only look one map out to keep the processing simple
2203 * and efficient. This could probably be a macro. 2430 * and efficient. This could probably be a macro.
2204 * MSW 2001-08-05 2431 * MSW 2001-08-05
2205 */ 2432 */
2433int
2206int on_same_map(const object *op1, const object *op2) { 2434on_same_map (const object *op1, const object *op2)
2435{
2207 int dx, dy; 2436 int dx, dy;
2208 2437
2209 return adjacent_map(op1->map, op2->map, &dx, &dy); 2438 return adjacent_map (op1->map, op2->map, &dx, &dy);
2210} 2439}

Diff Legend

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