1 | |
|
|
2 | /* |
|
|
3 | * static char *rcsid_map_c = |
|
|
4 | * "$Id: map.C,v 1.29 2006/09/10 16:00:23 root Exp $"; |
|
|
5 | */ |
|
|
6 | |
|
|
7 | /* |
1 | /* |
8 | CrossFire, A Multiplayer game for X-windows |
2 | CrossFire, A Multiplayer game for X-windows |
9 | |
3 | |
10 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
4 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
11 | Copyright (C) 1992 Frank Tore Johansen |
5 | Copyright (C) 1992 Frank Tore Johansen |
… | |
… | |
22 | |
16 | |
23 | You should have received a copy of the GNU General Public License |
17 | You should have received a copy of the GNU General Public License |
24 | along with this program; if not, write to the Free Software |
18 | along with this program; if not, write to the Free Software |
25 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
26 | |
20 | |
27 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
28 | */ |
22 | */ |
29 | |
23 | |
30 | |
24 | |
31 | #include <global.h> |
25 | #include <global.h> |
32 | #include <funcpoint.h> |
26 | #include <funcpoint.h> |
… | |
… | |
37 | #endif /* win32 */ |
31 | #endif /* win32 */ |
38 | |
32 | |
39 | #include "path.h" |
33 | #include "path.h" |
40 | |
34 | |
41 | |
35 | |
42 | extern int nrofallocobjects, nroffreeobjects; |
|
|
43 | |
|
|
44 | /* |
36 | /* |
45 | * Returns the mapstruct which has a name matching the given argument. |
37 | * Returns the maptile which has a name matching the given argument. |
46 | * return NULL if no match is found. |
38 | * return NULL if no match is found. |
47 | */ |
39 | */ |
48 | |
40 | |
49 | mapstruct * |
41 | maptile * |
50 | has_been_loaded (const char *name) |
42 | has_been_loaded (const char *name) |
51 | { |
43 | { |
52 | mapstruct *map; |
44 | maptile *map; |
53 | |
45 | |
54 | if (!name || !*name) |
46 | if (!name || !*name) |
55 | return 0; |
47 | return 0; |
56 | for (map = first_map; map; map = map->next) |
48 | for (map = first_map; map; map = map->next) |
57 | if (!strcmp (name, map->path)) |
49 | if (!strcmp (name, map->path)) |
… | |
… | |
210 | * Dumping these at llevError doesn't seem right, but is |
202 | * Dumping these at llevError doesn't seem right, but is |
211 | * necessary to make sure the information is in fact logged. |
203 | * necessary to make sure the information is in fact logged. |
212 | */ |
204 | */ |
213 | |
205 | |
214 | void |
206 | void |
215 | dump_map (const mapstruct *m) |
207 | dump_map (const maptile *m) |
216 | { |
208 | { |
217 | LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory); |
209 | LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory); |
218 | LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m)); |
210 | LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m)); |
219 | |
211 | |
220 | if (m->msg != NULL) |
212 | if (m->msg != NULL) |
… | |
… | |
237 | */ |
229 | */ |
238 | |
230 | |
239 | void |
231 | void |
240 | dump_all_maps (void) |
232 | dump_all_maps (void) |
241 | { |
233 | { |
242 | mapstruct *m; |
234 | maptile *m; |
243 | |
235 | |
244 | for (m = first_map; m != NULL; m = m->next) |
236 | for (m = first_map; m != NULL; m = m->next) |
245 | { |
237 | { |
246 | dump_map (m); |
238 | dump_map (m); |
247 | } |
239 | } |
… | |
… | |
256 | * is needed. The case of not passing values is if we're just |
248 | * is needed. The case of not passing values is if we're just |
257 | * checking for the existence of something on those spaces, but |
249 | * checking for the existence of something on those spaces, but |
258 | * don't expect to insert/remove anything from those spaces. |
250 | * don't expect to insert/remove anything from those spaces. |
259 | */ |
251 | */ |
260 | int |
252 | int |
261 | get_map_flags (mapstruct *oldmap, mapstruct **newmap, sint16 x, sint16 y, sint16 * nx, sint16 * ny) |
253 | get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 * nx, sint16 * ny) |
262 | { |
254 | { |
263 | sint16 newx, newy; |
255 | sint16 newx, newy; |
264 | int retval = 0; |
256 | int retval = 0; |
265 | mapstruct *mp; |
257 | maptile *mp; |
266 | |
258 | |
267 | if (out_of_map (oldmap, x, y)) |
259 | if (out_of_map (oldmap, x, y)) |
268 | return P_OUT_OF_MAP; |
260 | return P_OUT_OF_MAP; |
269 | newx = x; |
261 | newx = x; |
270 | newy = y; |
262 | newy = y; |
… | |
… | |
281 | retval |= mp->spaces[newx + mp->width * newy].flags; |
273 | retval |= mp->spaces[newx + mp->width * newy].flags; |
282 | |
274 | |
283 | return retval; |
275 | return retval; |
284 | } |
276 | } |
285 | |
277 | |
286 | |
|
|
287 | /* |
278 | /* |
288 | * Returns true if the given coordinate is blocked except by the |
279 | * Returns true if the given coordinate is blocked except by the |
289 | * object passed is not blocking. This is used with |
280 | * object passed is not blocking. This is used with |
290 | * multipart monsters - if we want to see if a 2x2 monster |
281 | * multipart monsters - if we want to see if a 2x2 monster |
291 | * can move 1 space to the left, we don't want its own area |
282 | * can move 1 space to the left, we don't want its own area |
… | |
… | |
294 | * monster. |
285 | * monster. |
295 | * m, x, y are the target map/coordinates - needed for map tiling. |
286 | * m, x, y are the target map/coordinates - needed for map tiling. |
296 | * the coordinates & map passed in should have been updated for tiling |
287 | * the coordinates & map passed in should have been updated for tiling |
297 | * by the caller. |
288 | * by the caller. |
298 | */ |
289 | */ |
299 | |
|
|
300 | int |
290 | int |
301 | blocked_link (object *ob, mapstruct *m, int sx, int sy) |
291 | blocked_link (object *ob, maptile *m, int sx, int sy) |
302 | { |
292 | { |
303 | object *tmp; |
293 | object *tmp; |
304 | int mflags, blocked; |
294 | int mflags, blocked; |
305 | |
295 | |
306 | /* Make sure the coordinates are valid - they should be, as caller should |
296 | /* Make sure the coordinates are valid - they should be, as caller should |
… | |
… | |
418 | * code, we need to have actual object to check its move_type |
408 | * code, we need to have actual object to check its move_type |
419 | * against the move_block values. |
409 | * against the move_block values. |
420 | */ |
410 | */ |
421 | |
411 | |
422 | int |
412 | int |
423 | ob_blocked (const object *ob, mapstruct *m, sint16 x, sint16 y) |
413 | ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) |
424 | { |
414 | { |
425 | archetype *tmp; |
415 | archetype *tmp; |
426 | int flag; |
416 | int flag; |
427 | mapstruct *m1; |
417 | maptile *m1; |
428 | sint16 sx, sy; |
418 | sint16 sx, sy; |
429 | |
419 | |
430 | if (ob == NULL) |
420 | if (ob == NULL) |
431 | { |
421 | { |
432 | flag = get_map_flags (m, &m1, x, y, &sx, &sy); |
422 | flag = get_map_flags (m, &m1, x, y, &sx, &sy); |
… | |
… | |
497 | * they are saved). We do have to look for the old maps that did save |
487 | * they are saved). We do have to look for the old maps that did save |
498 | * the more sections and not re-add sections for them. |
488 | * the more sections and not re-add sections for them. |
499 | */ |
489 | */ |
500 | |
490 | |
501 | static void |
491 | static void |
502 | link_multipart_objects (mapstruct *m) |
492 | link_multipart_objects (maptile *m) |
503 | { |
493 | { |
504 | int x, y; |
494 | int x, y; |
505 | object *tmp, *op, *last, *above; |
495 | object *tmp, *op, *last, *above; |
506 | archetype *at; |
496 | archetype *at; |
507 | |
497 | |
… | |
… | |
544 | * Loads (ands parses) the objects into a given map from the specified |
534 | * Loads (ands parses) the objects into a given map from the specified |
545 | * file pointer. |
535 | * file pointer. |
546 | * mapflags is the same as we get with load_original_map |
536 | * mapflags is the same as we get with load_original_map |
547 | */ |
537 | */ |
548 | void |
538 | void |
549 | load_objects (mapstruct *m, object_thawer & fp, int mapflags) |
539 | load_objects (maptile *m, object_thawer & fp, int mapflags) |
550 | { |
540 | { |
551 | int i, j; |
541 | int i, j; |
552 | int unique; |
542 | int unique; |
553 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
543 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
554 | |
544 | |
… | |
… | |
620 | * Modified by MSW 2001-07-01 to do in a single pass - reduces code, |
610 | * Modified by MSW 2001-07-01 to do in a single pass - reduces code, |
621 | * and we only save the head of multi part objects - this is needed |
611 | * and we only save the head of multi part objects - this is needed |
622 | * in order to do map tiling properly. |
612 | * in order to do map tiling properly. |
623 | */ |
613 | */ |
624 | void |
614 | void |
625 | save_objects (mapstruct *m, object_freezer & fp, object_freezer & fp2, int flag) |
615 | save_objects (maptile *m, object_freezer & fp, object_freezer & fp2, int flag) |
626 | { |
616 | { |
627 | int i, j = 0, unique = 0; |
617 | int i, j = 0, unique = 0; |
628 | object *op; |
618 | object *op; |
629 | |
619 | |
630 | /* first pass - save one-part objects */ |
620 | /* first pass - save one-part objects */ |
… | |
… | |
654 | } /* for this space */ |
644 | } /* for this space */ |
655 | } /* for this j */ |
645 | } /* for this j */ |
656 | } |
646 | } |
657 | |
647 | |
658 | /* |
648 | /* |
659 | * Allocates, initialises, and returns a pointer to a mapstruct. |
649 | * Allocates, initialises, and returns a pointer to a maptile. |
660 | * Modified to no longer take a path option which was not being |
650 | * Modified to no longer take a path option which was not being |
661 | * used anyways. MSW 2001-07-01 |
651 | * used anyways. MSW 2001-07-01 |
662 | */ |
652 | */ |
663 | |
653 | |
664 | mapstruct * |
654 | maptile * |
665 | get_linked_map (void) |
655 | get_linked_map (void) |
666 | { |
656 | { |
667 | mapstruct *map = new mapstruct; |
657 | maptile *map = new maptile; |
668 | mapstruct *mp; |
658 | maptile *mp; |
669 | |
659 | |
670 | for (mp = first_map; mp != NULL && mp->next != NULL; mp = mp->next); |
660 | for (mp = first_map; mp != NULL && mp->next != NULL; mp = mp->next); |
671 | if (mp == NULL) |
661 | if (mp == NULL) |
672 | first_map = map; |
662 | first_map = map; |
673 | else |
663 | else |
… | |
… | |
688 | MAP_WORLDPARTY (map) = -1; |
678 | MAP_WORLDPARTY (map) = -1; |
689 | return map; |
679 | return map; |
690 | } |
680 | } |
691 | |
681 | |
692 | /* |
682 | /* |
693 | * Allocates the arrays contained in a mapstruct. |
683 | * Allocates the arrays contained in a maptile. |
694 | * This basically allocates the dynamic array of spaces for the |
684 | * This basically allocates the dynamic array of spaces for the |
695 | * map. |
685 | * map. |
696 | */ |
686 | */ |
697 | |
687 | |
698 | void |
688 | void |
699 | allocate_map (mapstruct *m) |
689 | allocate_map (maptile *m) |
700 | { |
690 | { |
701 | m->in_memory = MAP_IN_MEMORY; |
691 | m->in_memory = MAP_IN_MEMORY; |
702 | /* Log this condition and free the storage. We could I suppose |
692 | /* Log this condition and free the storage. We could I suppose |
703 | * realloc, but if the caller is presuming the data will be intact, |
693 | * realloc, but if the caller is presuming the data will be intact, |
704 | * that is their poor assumption. |
694 | * that is their poor assumption. |
… | |
… | |
716 | } |
706 | } |
717 | |
707 | |
718 | /* Create and returns a map of the specific size. Used |
708 | /* Create and returns a map of the specific size. Used |
719 | * in random map code and the editor. |
709 | * in random map code and the editor. |
720 | */ |
710 | */ |
721 | mapstruct * |
711 | maptile * |
722 | get_empty_map (int sizex, int sizey) |
712 | get_empty_map (int sizex, int sizey) |
723 | { |
713 | { |
724 | mapstruct *m = get_linked_map (); |
714 | maptile *m = get_linked_map (); |
725 | |
715 | |
726 | m->width = sizex; |
716 | m->width = sizex; |
727 | m->height = sizey; |
717 | m->height = sizey; |
728 | m->in_memory = MAP_SWAPPED; |
718 | m->in_memory = MAP_SWAPPED; |
729 | allocate_map (m); |
719 | allocate_map (m); |
… | |
… | |
811 | } |
801 | } |
812 | |
802 | |
813 | /* opposite of parse string, this puts the string that was originally fed in to |
803 | /* opposite of parse string, this puts the string that was originally fed in to |
814 | * the map (or something equivilent) into output_string. */ |
804 | * the map (or something equivilent) into output_string. */ |
815 | static void |
805 | static void |
816 | print_shop_string (mapstruct *m, char *output_string) |
806 | print_shop_string (maptile *m, char *output_string) |
817 | { |
807 | { |
818 | int i; |
808 | int i; |
819 | char tmp[MAX_BUF]; |
809 | char tmp[MAX_BUF]; |
820 | |
810 | |
821 | strcpy (output_string, ""); |
811 | strcpy (output_string, ""); |
… | |
… | |
855 | * MSW 2001-07-01 |
845 | * MSW 2001-07-01 |
856 | * return 0 on success, 1 on failure. |
846 | * return 0 on success, 1 on failure. |
857 | */ |
847 | */ |
858 | |
848 | |
859 | static int |
849 | static int |
860 | load_map_header (object_thawer & fp, mapstruct *m) |
850 | load_map_header (object_thawer & fp, maptile *m) |
861 | { |
851 | { |
862 | char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end; |
852 | char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end; |
863 | int msgpos = 0; |
853 | int msgpos = 0; |
864 | int maplorepos = 0; |
854 | int maplorepos = 0; |
865 | |
855 | |
… | |
… | |
1153 | } |
1143 | } |
1154 | |
1144 | |
1155 | /* |
1145 | /* |
1156 | * Opens the file "filename" and reads information about the map |
1146 | * Opens the file "filename" and reads information about the map |
1157 | * from the given file, and stores it in a newly allocated |
1147 | * from the given file, and stores it in a newly allocated |
1158 | * mapstruct. A pointer to this structure is returned, or NULL on failure. |
1148 | * maptile. A pointer to this structure is returned, or NULL on failure. |
1159 | * flags correspond to those in map.h. Main ones used are |
1149 | * flags correspond to those in map.h. Main ones used are |
1160 | * MAP_PLAYER_UNIQUE, in which case we don't do any name changes, and |
1150 | * MAP_PLAYER_UNIQUE, in which case we don't do any name changes, and |
1161 | * MAP_BLOCK, in which case we block on this load. This happens in all |
1151 | * MAP_BLOCK, in which case we block on this load. This happens in all |
1162 | * cases, no matter if this flag is set or not. |
1152 | * cases, no matter if this flag is set or not. |
1163 | * MAP_STYLE: style map - don't add active objects, don't add to server |
1153 | * MAP_STYLE: style map - don't add active objects, don't add to server |
1164 | * managed map list. |
1154 | * managed map list. |
1165 | */ |
1155 | */ |
1166 | |
1156 | |
1167 | mapstruct * |
1157 | maptile * |
1168 | load_original_map (const char *filename, int flags) |
1158 | load_original_map (const char *filename, int flags) |
1169 | { |
1159 | { |
1170 | mapstruct *m; |
1160 | maptile *m; |
1171 | char pathname[MAX_BUF]; |
1161 | char pathname[MAX_BUF]; |
1172 | |
1162 | |
1173 | if (flags & MAP_PLAYER_UNIQUE) |
1163 | if (flags & MAP_PLAYER_UNIQUE) |
1174 | strcpy (pathname, filename); |
1164 | strcpy (pathname, filename); |
1175 | else if (flags & MAP_OVERLAY) |
1165 | else if (flags & MAP_OVERLAY) |
… | |
… | |
1211 | * Loads a map, which has been loaded earlier, from file. |
1201 | * Loads a map, which has been loaded earlier, from file. |
1212 | * Return the map object we load into (this can change from the passed |
1202 | * Return the map object we load into (this can change from the passed |
1213 | * option if we can't find the original map) |
1203 | * option if we can't find the original map) |
1214 | */ |
1204 | */ |
1215 | |
1205 | |
1216 | static mapstruct * |
1206 | static maptile * |
1217 | load_temporary_map (mapstruct *m) |
1207 | load_temporary_map (maptile *m) |
1218 | { |
1208 | { |
1219 | char buf[MAX_BUF]; |
1209 | char buf[MAX_BUF]; |
1220 | |
1210 | |
1221 | if (!m->tmpname) |
1211 | if (!m->tmpname) |
1222 | { |
1212 | { |
… | |
… | |
1264 | * Loads a map, which has been loaded earlier, from file. |
1254 | * Loads a map, which has been loaded earlier, from file. |
1265 | * Return the map object we load into (this can change from the passed |
1255 | * Return the map object we load into (this can change from the passed |
1266 | * option if we can't find the original map) |
1256 | * option if we can't find the original map) |
1267 | */ |
1257 | */ |
1268 | |
1258 | |
1269 | mapstruct * |
1259 | maptile * |
1270 | load_overlay_map (const char *filename, mapstruct *m) |
1260 | load_overlay_map (const char *filename, maptile *m) |
1271 | { |
1261 | { |
1272 | char pathname[MAX_BUF]; |
1262 | char pathname[MAX_BUF]; |
1273 | |
1263 | |
1274 | strcpy (pathname, create_overlay_pathname (filename)); |
1264 | strcpy (pathname, create_overlay_pathname (filename)); |
1275 | |
1265 | |
… | |
… | |
1298 | * This is the start of unique map handling code |
1288 | * This is the start of unique map handling code |
1299 | *****************************************************************************/ |
1289 | *****************************************************************************/ |
1300 | |
1290 | |
1301 | /* This goes through map 'm' and removed any unique items on the map. */ |
1291 | /* This goes through map 'm' and removed any unique items on the map. */ |
1302 | static void |
1292 | static void |
1303 | delete_unique_items (mapstruct *m) |
1293 | delete_unique_items (maptile *m) |
1304 | { |
1294 | { |
1305 | int i, j, unique; |
1295 | int i, j, unique; |
1306 | object *op, *next; |
1296 | object *op, *next; |
1307 | |
1297 | |
1308 | for (i = 0; i < MAP_WIDTH (m); i++) |
1298 | for (i = 0; i < MAP_WIDTH (m); i++) |
… | |
… | |
1330 | /* |
1320 | /* |
1331 | * Loads unique objects from file(s) into the map which is in memory |
1321 | * Loads unique objects from file(s) into the map which is in memory |
1332 | * m is the map to load unique items into. |
1322 | * m is the map to load unique items into. |
1333 | */ |
1323 | */ |
1334 | static void |
1324 | static void |
1335 | load_unique_objects (mapstruct *m) |
1325 | load_unique_objects (maptile *m) |
1336 | { |
1326 | { |
1337 | int count; |
1327 | int count; |
1338 | char firstname[MAX_BUF]; |
1328 | char firstname[MAX_BUF]; |
1339 | |
1329 | |
1340 | for (count = 0; count < 10; count++) |
1330 | for (count = 0; count < 10; count++) |
… | |
… | |
1363 | |
1353 | |
1364 | /* |
1354 | /* |
1365 | * Saves a map to file. If flag is set, it is saved into the same |
1355 | * Saves a map to file. If flag is set, it is saved into the same |
1366 | * file it was (originally) loaded from. Otherwise a temporary |
1356 | * file it was (originally) loaded from. Otherwise a temporary |
1367 | * filename will be genarated, and the file will be stored there. |
1357 | * filename will be genarated, and the file will be stored there. |
1368 | * The temporary filename will be stored in the mapstructure. |
1358 | * The temporary filename will be stored in the maptileure. |
1369 | * If the map is unique, we also save to the filename in the map |
1359 | * If the map is unique, we also save to the filename in the map |
1370 | * (this should have been updated when first loaded) |
1360 | * (this should have been updated when first loaded) |
1371 | */ |
1361 | */ |
1372 | |
1362 | |
1373 | int |
1363 | int |
1374 | new_save_map (mapstruct *m, int flag) |
1364 | new_save_map (maptile *m, int flag) |
1375 | { |
1365 | { |
1376 | char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF]; |
1366 | char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF]; |
1377 | int i; |
1367 | int i; |
1378 | |
1368 | |
1379 | if (flag && !*m->path) |
1369 | if (flag && !*m->path) |
… | |
… | |
1543 | /* |
1533 | /* |
1544 | * Remove and free all objects in the given map. |
1534 | * Remove and free all objects in the given map. |
1545 | */ |
1535 | */ |
1546 | |
1536 | |
1547 | void |
1537 | void |
1548 | free_all_objects (mapstruct *m) |
1538 | free_all_objects (maptile *m) |
1549 | { |
1539 | { |
1550 | int i, j; |
1540 | int i, j; |
1551 | object *op; |
1541 | object *op; |
1552 | |
1542 | |
1553 | for (i = 0; i < MAP_WIDTH (m); i++) |
1543 | for (i = 0; i < MAP_WIDTH (m); i++) |
… | |
… | |
1576 | } |
1566 | } |
1577 | } |
1567 | } |
1578 | } |
1568 | } |
1579 | |
1569 | |
1580 | /* |
1570 | /* |
1581 | * Frees everything allocated by the given mapstructure. |
1571 | * Frees everything allocated by the given maptileure. |
1582 | * don't free tmpname - our caller is left to do that |
1572 | * don't free tmpname - our caller is left to do that |
1583 | */ |
1573 | */ |
1584 | |
1574 | |
1585 | void |
1575 | void |
1586 | free_map (mapstruct *m, int flag) |
1576 | free_map (maptile *m, int flag) |
1587 | { |
1577 | { |
1588 | int i; |
1578 | int i; |
1589 | |
1579 | |
1590 | if (!m->in_memory) |
1580 | if (!m->in_memory) |
1591 | { |
1581 | { |
… | |
… | |
1618 | } |
1608 | } |
1619 | m->in_memory = MAP_SWAPPED; |
1609 | m->in_memory = MAP_SWAPPED; |
1620 | } |
1610 | } |
1621 | |
1611 | |
1622 | /* |
1612 | /* |
1623 | * function: vanish mapstruct |
1613 | * function: vanish maptile |
1624 | * m : pointer to mapstruct, if NULL no action |
1614 | * m : pointer to maptile, if NULL no action |
1625 | * this deletes all the data on the map (freeing pointers) |
1615 | * this deletes all the data on the map (freeing pointers) |
1626 | * and then removes this map from the global linked list of maps. |
1616 | * and then removes this map from the global linked list of maps. |
1627 | */ |
1617 | */ |
1628 | |
1618 | |
1629 | void |
1619 | void |
1630 | delete_map (mapstruct *m) |
1620 | delete_map (maptile *m) |
1631 | { |
1621 | { |
1632 | mapstruct *tmp, *last; |
1622 | maptile *tmp, *last; |
1633 | int i; |
1623 | int i; |
1634 | |
1624 | |
1635 | if (!m) |
1625 | if (!m) |
1636 | return; |
1626 | return; |
1637 | |
1627 | |
… | |
… | |
1699 | * dont do any more name translation on it. |
1689 | * dont do any more name translation on it. |
1700 | * |
1690 | * |
1701 | * Returns a pointer to the given map. |
1691 | * Returns a pointer to the given map. |
1702 | */ |
1692 | */ |
1703 | |
1693 | |
1704 | mapstruct * |
1694 | maptile * |
1705 | ready_map_name (const char *name, int flags) |
1695 | ready_map_name (const char *name, int flags) |
1706 | { |
1696 | { |
1707 | mapstruct *m; |
1697 | maptile *m; |
1708 | |
1698 | |
1709 | if (!name) |
1699 | if (!name) |
1710 | return (NULL); |
1700 | return (NULL); |
1711 | |
1701 | |
1712 | /* Have we been at this level before? */ |
1702 | /* Have we been at this level before? */ |
… | |
… | |
1814 | * have a difficulty set than using this function - human calculation |
1804 | * have a difficulty set than using this function - human calculation |
1815 | * is much better than this functions guesswork. |
1805 | * is much better than this functions guesswork. |
1816 | */ |
1806 | */ |
1817 | |
1807 | |
1818 | int |
1808 | int |
1819 | calculate_difficulty (mapstruct *m) |
1809 | calculate_difficulty (maptile *m) |
1820 | { |
1810 | { |
1821 | object *op; |
1811 | object *op; |
1822 | archetype *at; |
1812 | archetype *at; |
1823 | int x, y, i; |
1813 | int x, y, i; |
1824 | long monster_cnt = 0; |
1814 | long monster_cnt = 0; |
… | |
… | |
1866 | |
1856 | |
1867 | return 1; |
1857 | return 1; |
1868 | } |
1858 | } |
1869 | |
1859 | |
1870 | void |
1860 | void |
1871 | clean_tmp_map (mapstruct *m) |
1861 | clean_tmp_map (maptile *m) |
1872 | { |
1862 | { |
1873 | if (m->tmpname == NULL) |
1863 | if (m->tmpname == NULL) |
1874 | return; |
1864 | return; |
1875 | INVOKE_MAP (CLEAN, m); |
1865 | INVOKE_MAP (CLEAN, m); |
1876 | (void) unlink (m->tmpname); |
1866 | (void) unlink (m->tmpname); |
… | |
… | |
1901 | * to maps than los. |
1891 | * to maps than los. |
1902 | * postive values make it darker, negative make it brighter |
1892 | * postive values make it darker, negative make it brighter |
1903 | */ |
1893 | */ |
1904 | |
1894 | |
1905 | int |
1895 | int |
1906 | change_map_light (mapstruct *m, int change) |
1896 | change_map_light (maptile *m, int change) |
1907 | { |
1897 | { |
1908 | int new_level = m->darkness + change; |
1898 | int new_level = m->darkness + change; |
1909 | |
1899 | |
1910 | /* Nothing to do */ |
1900 | /* Nothing to do */ |
1911 | if (!change || (new_level <= 0 && m->darkness == 0) || (new_level >= MAX_DARKNESS && m->darkness >= MAX_DARKNESS)) |
1901 | if (!change || (new_level <= 0 && m->darkness == 0) || (new_level >= MAX_DARKNESS && m->darkness >= MAX_DARKNESS)) |
… | |
… | |
1942 | * on the map (what it looks like, whether it blocks magic, |
1932 | * on the map (what it looks like, whether it blocks magic, |
1943 | * has a living creatures, prevents people from passing |
1933 | * has a living creatures, prevents people from passing |
1944 | * through, etc) |
1934 | * through, etc) |
1945 | */ |
1935 | */ |
1946 | void |
1936 | void |
1947 | update_position (mapstruct *m, int x, int y) |
1937 | update_position (maptile *m, int x, int y) |
1948 | { |
1938 | { |
1949 | object *tmp, *last = NULL; |
1939 | object *tmp, *last = NULL; |
1950 | uint8 flags = 0, oldflags, light = 0, anywhere = 0; |
1940 | uint8 flags = 0, oldflags, light = 0, anywhere = 0; |
1951 | New_Face *top, *floor, *middle; |
1941 | New_Face *top, *floor, *middle; |
1952 | object *top_obj, *floor_obj, *middle_obj; |
1942 | object *top_obj, *floor_obj, *middle_obj; |
… | |
… | |
2145 | SET_MAP_LIGHT (m, x, y, light); |
2135 | SET_MAP_LIGHT (m, x, y, light); |
2146 | } |
2136 | } |
2147 | |
2137 | |
2148 | |
2138 | |
2149 | void |
2139 | void |
2150 | set_map_reset_time (mapstruct *map) |
2140 | set_map_reset_time (maptile *map) |
2151 | { |
2141 | { |
2152 | int timeout; |
2142 | int timeout; |
2153 | |
2143 | |
2154 | timeout = MAP_RESET_TIMEOUT (map); |
2144 | timeout = MAP_RESET_TIMEOUT (map); |
2155 | if (timeout <= 0) |
2145 | if (timeout <= 0) |
… | |
… | |
2164 | * maps tile_map values if it tiles back to this one. It returns |
2154 | * maps tile_map values if it tiles back to this one. It returns |
2165 | * the value of orig_map->tile_map[tile_num]. It really only does this |
2155 | * the value of orig_map->tile_map[tile_num]. It really only does this |
2166 | * so that it is easier for calling functions to verify success. |
2156 | * so that it is easier for calling functions to verify success. |
2167 | */ |
2157 | */ |
2168 | |
2158 | |
2169 | static mapstruct * |
2159 | static maptile * |
2170 | load_and_link_tiled_map (mapstruct *orig_map, int tile_num) |
2160 | load_and_link_tiled_map (maptile *orig_map, int tile_num) |
2171 | { |
2161 | { |
2172 | int dest_tile = (tile_num + 2) % 4; |
2162 | int dest_tile = (tile_num + 2) % 4; |
2173 | char *path = path_combine_and_normalize (orig_map->path, orig_map->tile_path[tile_num]); |
2163 | char *path = path_combine_and_normalize (orig_map->path, orig_map->tile_path[tile_num]); |
2174 | |
2164 | |
2175 | orig_map->tile_map[tile_num] = ready_map_name (path, 0); |
2165 | orig_map->tile_map[tile_num] = ready_map_name (path, 0); |
… | |
… | |
2190 | * tiled maps. |
2180 | * tiled maps. |
2191 | * |
2181 | * |
2192 | * |
2182 | * |
2193 | */ |
2183 | */ |
2194 | int |
2184 | int |
2195 | out_of_map (mapstruct *m, int x, int y) |
2185 | out_of_map (maptile *m, int x, int y) |
2196 | { |
2186 | { |
2197 | |
2187 | |
2198 | /* If we get passed a null map, this is obviously the |
2188 | /* If we get passed a null map, this is obviously the |
2199 | * case. This generally shouldn't happen, but if the |
2189 | * case. This generally shouldn't happen, but if the |
2200 | * map loads fail below, it could happen. |
2190 | * map loads fail below, it could happen. |
… | |
… | |
2255 | * the map as that the coordinates are really on, and |
2245 | * the map as that the coordinates are really on, and |
2256 | * updates x and y to be the localized coordinates. |
2246 | * updates x and y to be the localized coordinates. |
2257 | * Using this is more efficient of calling out_of_map |
2247 | * Using this is more efficient of calling out_of_map |
2258 | * and then figuring out what the real map is |
2248 | * and then figuring out what the real map is |
2259 | */ |
2249 | */ |
2260 | mapstruct * |
2250 | maptile * |
2261 | get_map_from_coord (mapstruct *m, sint16 * x, sint16 * y) |
2251 | get_map_from_coord (maptile *m, sint16 * x, sint16 * y) |
2262 | { |
2252 | { |
2263 | |
2253 | |
2264 | if (*x < 0) |
2254 | if (*x < 0) |
2265 | { |
2255 | { |
2266 | if (!m->tile_path[3]) |
2256 | if (!m->tile_path[3]) |
… | |
… | |
2312 | /** |
2302 | /** |
2313 | * Return whether map2 is adjacent to map1. If so, store the distance from |
2303 | * Return whether map2 is adjacent to map1. If so, store the distance from |
2314 | * map1 to map2 in dx/dy. |
2304 | * map1 to map2 in dx/dy. |
2315 | */ |
2305 | */ |
2316 | static int |
2306 | static int |
2317 | adjacent_map (const mapstruct *map1, const mapstruct *map2, int *dx, int *dy) |
2307 | adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) |
2318 | { |
2308 | { |
2319 | if (!map1 || !map2) |
2309 | if (!map1 || !map2) |
2320 | return 0; |
2310 | return 0; |
2321 | |
2311 | |
2322 | if (map1 == map2) |
2312 | if (map1 == map2) |
… | |
… | |
2480 | * for something in the future. Also, since no object is pasted, the best |
2470 | * for something in the future. Also, since no object is pasted, the best |
2481 | * field of the rv_vector is set to NULL. |
2471 | * field of the rv_vector is set to NULL. |
2482 | */ |
2472 | */ |
2483 | |
2473 | |
2484 | void |
2474 | void |
2485 | get_rangevector_from_mapcoord (const mapstruct *m, int x, int y, const object *op2, rv_vector * retval, int flags) |
2475 | get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) |
2486 | { |
2476 | { |
2487 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
2477 | if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) |
2488 | { |
2478 | { |
2489 | /* be conservative and fill in _some_ data */ |
2479 | /* be conservative and fill in _some_ data */ |
2490 | retval->distance = 100000; |
2480 | retval->distance = 100000; |