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