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