… | |
… | |
24 | |
24 | |
25 | #include <global.h> |
25 | #include <global.h> |
26 | #include <funcpoint.h> |
26 | #include <funcpoint.h> |
27 | |
27 | |
28 | #include <loader.h> |
28 | #include <loader.h> |
29 | #ifndef WIN32 /* ---win32 exclude header */ |
|
|
30 | # include <unistd.h> |
29 | #include <unistd.h> |
31 | #endif /* win32 */ |
|
|
32 | |
30 | |
33 | #include "path.h" |
31 | #include "path.h" |
34 | |
32 | |
35 | |
33 | |
36 | /* |
34 | /* |
… | |
… | |
157 | int |
155 | int |
158 | check_path (const char *name, int prepend_dir) |
156 | check_path (const char *name, int prepend_dir) |
159 | { |
157 | { |
160 | char buf[MAX_BUF]; |
158 | char buf[MAX_BUF]; |
161 | |
159 | |
162 | #ifndef WIN32 |
|
|
163 | char *endbuf; |
160 | char *endbuf; |
164 | struct stat statbuf; |
161 | struct stat statbuf; |
165 | int mode = 0; |
162 | int mode = 0; |
166 | #endif |
|
|
167 | |
163 | |
168 | if (prepend_dir) |
164 | if (prepend_dir) |
169 | strcpy (buf, create_pathname (name)); |
165 | strcpy (buf, create_pathname (name)); |
170 | else |
166 | else |
171 | strcpy (buf, name); |
167 | strcpy (buf, name); |
172 | #ifdef WIN32 /* ***win32: check this sucker in windows style. */ |
|
|
173 | return (_access (buf, 0)); |
|
|
174 | #else |
|
|
175 | |
168 | |
176 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
169 | /* old method (strchr(buf, '\0')) seemd very odd to me - |
177 | * this method should be equivalant and is clearer. |
170 | * this method should be equivalant and is clearer. |
178 | * Can not use strcat because we need to cycle through |
171 | * Can not use strcat because we need to cycle through |
179 | * all the names. |
172 | * all the names. |
… | |
… | |
192 | if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) || |
185 | if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) || |
193 | (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH)) |
186 | (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH)) |
194 | mode |= 2; |
187 | mode |= 2; |
195 | |
188 | |
196 | return (mode); |
189 | return (mode); |
197 | #endif |
|
|
198 | } |
190 | } |
199 | |
191 | |
200 | /* |
192 | /* |
201 | * Prints out debug-information about a map. |
193 | * Prints out debug-information about a map. |
202 | * Dumping these at llevError doesn't seem right, but is |
194 | * Dumping these at llevError doesn't seem right, but is |
… | |
… | |
540 | { |
532 | { |
541 | int i, j; |
533 | int i, j; |
542 | int unique; |
534 | int unique; |
543 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
535 | object *op, *prev = NULL, *last_more = NULL, *otmp; |
544 | |
536 | |
545 | op = get_object (); |
537 | op = object::create (); |
546 | op->map = m; /* To handle buttons correctly */ |
538 | op->map = m; /* To handle buttons correctly */ |
547 | |
539 | |
548 | while ((i = load_object (fp, op, mapflags))) |
540 | while ((i = load_object (fp, op, mapflags))) |
549 | { |
541 | { |
550 | /* if the archetype for the object is null, means that we |
542 | /* if the archetype for the object is null, means that we |
… | |
… | |
558 | } |
550 | } |
559 | |
551 | |
560 | |
552 | |
561 | switch (i) |
553 | switch (i) |
562 | { |
554 | { |
563 | case LL_NORMAL: |
555 | case LL_NORMAL: |
564 | /* if we are loading an overlay, put the floors on the bottom */ |
556 | /* if we are loading an overlay, put the floors on the bottom */ |
565 | if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY) |
557 | if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY) |
566 | insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD); |
558 | insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD); |
567 | else |
559 | else |
568 | insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
560 | insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); |
569 | |
561 | |
570 | if (op->inv) |
562 | if (op->inv) |
571 | sum_weight (op); |
563 | sum_weight (op); |
572 | |
564 | |
573 | prev = op, last_more = op; |
565 | prev = op, last_more = op; |
574 | break; |
566 | break; |
575 | |
567 | |
576 | case LL_MORE: |
568 | case LL_MORE: |
577 | insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); |
569 | insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); |
578 | op->head = prev, last_more->more = op, last_more = op; |
570 | op->head = prev, last_more->more = op, last_more = op; |
579 | break; |
571 | break; |
580 | } |
572 | } |
581 | |
573 | |
582 | if (mapflags & MAP_STYLE) |
574 | if (mapflags & MAP_STYLE) |
583 | remove_from_active_list (op); |
575 | remove_from_active_list (op); |
584 | |
576 | |
585 | op = get_object (); |
577 | op = object::create (); |
586 | op->map = m; |
578 | op->map = m; |
587 | } |
579 | } |
588 | |
580 | |
589 | for (i = 0; i < m->width; i++) |
581 | for (i = 0; i < m->width; i++) |
590 | { |
582 | { |
… | |
… | |
594 | /* check for unique items, or unique squares */ |
586 | /* check for unique items, or unique squares */ |
595 | for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above) |
587 | for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above) |
596 | { |
588 | { |
597 | if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) |
589 | if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL)) |
598 | unique = 1; |
590 | unique = 1; |
|
|
591 | |
599 | if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) |
592 | if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique)) |
600 | SET_FLAG (otmp, FLAG_OBJ_ORIGINAL); |
593 | SET_FLAG (otmp, FLAG_OBJ_ORIGINAL); |
601 | } |
594 | } |
602 | } |
595 | } |
603 | } |
596 | } |
604 | |
597 | |
605 | free_object (op); |
598 | op->destroy (); |
606 | link_multipart_objects (m); |
599 | link_multipart_objects (m); |
607 | } |
600 | } |
608 | |
601 | |
609 | /* This saves all the objects on the map in a non destructive fashion. |
602 | /* This saves all the objects on the map in a non destructive fashion. |
610 | * Modified by MSW 2001-07-01 to do in a single pass - reduces code, |
603 | * Modified by MSW 2001-07-01 to do in a single pass - reduces code, |
… | |
… | |
737 | char *shop_string, *p, *q, *next_semicolon, *next_colon; |
730 | char *shop_string, *p, *q, *next_semicolon, *next_colon; |
738 | shopitems *items = NULL; |
731 | shopitems *items = NULL; |
739 | int i = 0, number_of_entries = 0; |
732 | int i = 0, number_of_entries = 0; |
740 | const typedata *current_type; |
733 | const typedata *current_type; |
741 | |
734 | |
742 | shop_string = strdup_local (input_string); |
735 | shop_string = strdup (input_string); |
743 | p = shop_string; |
736 | p = shop_string; |
744 | /* first we'll count the entries, we'll need that for allocating the array shortly */ |
737 | /* first we'll count the entries, we'll need that for allocating the array shortly */ |
745 | while (p) |
738 | while (p) |
746 | { |
739 | { |
747 | p = strchr (p, ';'); |
740 | p = strchr (p, ';'); |
… | |
… | |
871 | |
864 | |
872 | value = strchr (key, ' '); |
865 | value = strchr (key, ' '); |
873 | |
866 | |
874 | if (!value) |
867 | if (!value) |
875 | { |
868 | { |
876 | if (end = strchr (key, '\n')) |
869 | if ((end = strchr (key, '\n'))) |
877 | *end = 0; |
870 | *end = 0; |
878 | } |
871 | } |
879 | else |
872 | else |
880 | { |
873 | { |
881 | *value = 0; |
874 | *value = 0; |
… | |
… | |
933 | * with nothing between). There is no reason in those cases to |
926 | * with nothing between). There is no reason in those cases to |
934 | * keep the empty message. Also, msgbuf contains garbage data |
927 | * keep the empty message. Also, msgbuf contains garbage data |
935 | * when msgpos is zero, so copying it results in crashes |
928 | * when msgpos is zero, so copying it results in crashes |
936 | */ |
929 | */ |
937 | if (msgpos != 0) |
930 | if (msgpos != 0) |
938 | m->msg = strdup_local (msgbuf); |
931 | m->msg = strdup (msgbuf); |
939 | } |
932 | } |
940 | else if (!strcmp (key, "maplore")) |
933 | else if (!strcmp (key, "maplore")) |
941 | { |
934 | { |
942 | while (fgets (buf, HUGE_BUF, fp) != NULL) |
935 | while (fgets (buf, HUGE_BUF, fp) != NULL) |
943 | { |
936 | { |
… | |
… | |
949 | strcpy (maplorebuf + maplorepos, buf); |
942 | strcpy (maplorebuf + maplorepos, buf); |
950 | maplorepos += strlen (buf); |
943 | maplorepos += strlen (buf); |
951 | } |
944 | } |
952 | } |
945 | } |
953 | if (maplorepos != 0) |
946 | if (maplorepos != 0) |
954 | m->maplore = strdup_local (maplorebuf); |
947 | m->maplore = strdup (maplorebuf); |
955 | } |
948 | } |
956 | else if (!strcmp (key, "end")) |
949 | else if (!strcmp (key, "end")) |
957 | { |
950 | { |
958 | break; |
951 | break; |
959 | } |
952 | } |
… | |
… | |
968 | LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value); |
961 | LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value); |
969 | } |
962 | } |
970 | else if (!strcmp (key, "name")) |
963 | else if (!strcmp (key, "name")) |
971 | { |
964 | { |
972 | *end = 0; |
965 | *end = 0; |
973 | m->name = strdup_local (value); |
966 | m->name = strdup (value); |
974 | } |
967 | } |
975 | /* first strcmp value on these are old names supported |
968 | /* first strcmp value on these are old names supported |
976 | * for compatibility reasons. The new values (second) are |
969 | * for compatibility reasons. The new values (second) are |
977 | * what really should be used. |
970 | * what really should be used. |
978 | */ |
971 | */ |
979 | else if (!strcmp (key, "oid")) |
972 | else if (!strcmp (key, "oid")) |
980 | { |
|
|
981 | fp.get (m, atoi (value)); |
973 | fp.get (m, atoi (value)); |
982 | } |
|
|
983 | else if (!strcmp (key, "attach")) |
974 | else if (!strcmp (key, "attach")) |
984 | { |
|
|
985 | m->attach = value; |
975 | m->attach = value; |
986 | } |
|
|
987 | else if (!strcmp (key, "hp") || !strcmp (key, "enter_x")) |
976 | else if (!strcmp (key, "hp") || !strcmp (key, "enter_x")) |
988 | { |
|
|
989 | m->enter_x = atoi (value); |
977 | m->enter_x = atoi (value); |
990 | } |
|
|
991 | else if (!strcmp (key, "sp") || !strcmp (key, "enter_y")) |
978 | else if (!strcmp (key, "sp") || !strcmp (key, "enter_y")) |
992 | { |
|
|
993 | m->enter_y = atoi (value); |
979 | m->enter_y = atoi (value); |
994 | } |
|
|
995 | else if (!strcmp (key, "x") || !strcmp (key, "width")) |
980 | else if (!strcmp (key, "x") || !strcmp (key, "width")) |
996 | { |
|
|
997 | m->width = atoi (value); |
981 | m->width = atoi (value); |
998 | } |
|
|
999 | else if (!strcmp (key, "y") || !strcmp (key, "height")) |
982 | else if (!strcmp (key, "y") || !strcmp (key, "height")) |
1000 | { |
|
|
1001 | m->height = atoi (value); |
983 | m->height = atoi (value); |
1002 | } |
|
|
1003 | else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout")) |
984 | else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout")) |
1004 | { |
|
|
1005 | m->reset_timeout = atoi (value); |
985 | m->reset_timeout = atoi (value); |
1006 | } |
|
|
1007 | else if (!strcmp (key, "value") || !strcmp (key, "swap_time")) |
986 | else if (!strcmp (key, "value") || !strcmp (key, "swap_time")) |
1008 | { |
|
|
1009 | m->timeout = atoi (value); |
987 | m->timeout = atoi (value); |
1010 | } |
|
|
1011 | else if (!strcmp (key, "level") || !strcmp (key, "difficulty")) |
988 | else if (!strcmp (key, "level") || !strcmp (key, "difficulty")) |
1012 | { |
989 | m->difficulty = clamp (atoi (value), 1, settings.max_level); |
1013 | m->difficulty = atoi (value); |
|
|
1014 | } |
|
|
1015 | else if (!strcmp (key, "invisible") || !strcmp (key, "darkness")) |
990 | else if (!strcmp (key, "invisible") || !strcmp (key, "darkness")) |
1016 | { |
|
|
1017 | m->darkness = atoi (value); |
991 | m->darkness = atoi (value); |
1018 | } |
|
|
1019 | else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime")) |
992 | else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime")) |
1020 | { |
|
|
1021 | m->fixed_resettime = atoi (value); |
993 | m->fixed_resettime = atoi (value); |
1022 | } |
|
|
1023 | else if (!strcmp (key, "unique")) |
994 | else if (!strcmp (key, "unique")) |
1024 | { |
|
|
1025 | m->unique = atoi (value); |
995 | m->unique = atoi (value); |
1026 | } |
|
|
1027 | else if (!strcmp (key, "template")) |
996 | else if (!strcmp (key, "template")) |
1028 | { |
|
|
1029 | m->templatemap = atoi (value); |
997 | m->templatemap = atoi (value); |
1030 | } |
|
|
1031 | else if (!strcmp (key, "region")) |
998 | else if (!strcmp (key, "region")) |
1032 | { |
|
|
1033 | m->region = get_region_by_name (value); |
999 | m->region = get_region_by_name (value); |
1034 | } |
|
|
1035 | else if (!strcmp (key, "shopitems")) |
1000 | else if (!strcmp (key, "shopitems")) |
1036 | { |
1001 | { |
1037 | *end = 0; |
1002 | *end = 0; |
1038 | m->shopitems = parse_shop_string (value); |
1003 | m->shopitems = parse_shop_string (value); |
1039 | } |
1004 | } |
1040 | else if (!strcmp (key, "shopgreed")) |
1005 | else if (!strcmp (key, "shopgreed")) |
1041 | { |
|
|
1042 | m->shopgreed = atof (value); |
1006 | m->shopgreed = atof (value); |
1043 | } |
|
|
1044 | else if (!strcmp (key, "shopmin")) |
1007 | else if (!strcmp (key, "shopmin")) |
1045 | { |
|
|
1046 | m->shopmin = atol (value); |
1008 | m->shopmin = atol (value); |
1047 | } |
|
|
1048 | else if (!strcmp (key, "shopmax")) |
1009 | else if (!strcmp (key, "shopmax")) |
1049 | { |
|
|
1050 | m->shopmax = atol (value); |
1010 | m->shopmax = atol (value); |
1051 | } |
|
|
1052 | else if (!strcmp (key, "shoprace")) |
1011 | else if (!strcmp (key, "shoprace")) |
1053 | { |
1012 | { |
1054 | *end = 0; |
1013 | *end = 0; |
1055 | m->shoprace = strdup_local (value); |
1014 | m->shoprace = strdup (value); |
1056 | } |
1015 | } |
1057 | else if (!strcmp (key, "outdoor")) |
1016 | else if (!strcmp (key, "outdoor")) |
1058 | { |
|
|
1059 | m->outdoor = atoi (value); |
1017 | m->outdoor = atoi (value); |
1060 | } |
|
|
1061 | else if (!strcmp (key, "temp")) |
1018 | else if (!strcmp (key, "temp")) |
1062 | { |
|
|
1063 | m->temp = atoi (value); |
1019 | m->temp = atoi (value); |
1064 | } |
|
|
1065 | else if (!strcmp (key, "pressure")) |
1020 | else if (!strcmp (key, "pressure")) |
1066 | { |
|
|
1067 | m->pressure = atoi (value); |
1021 | m->pressure = atoi (value); |
1068 | } |
|
|
1069 | else if (!strcmp (key, "humid")) |
1022 | else if (!strcmp (key, "humid")) |
1070 | { |
|
|
1071 | m->humid = atoi (value); |
1023 | m->humid = atoi (value); |
1072 | } |
|
|
1073 | else if (!strcmp (key, "windspeed")) |
1024 | else if (!strcmp (key, "windspeed")) |
1074 | { |
|
|
1075 | m->windspeed = atoi (value); |
1025 | m->windspeed = atoi (value); |
1076 | } |
|
|
1077 | else if (!strcmp (key, "winddir")) |
1026 | else if (!strcmp (key, "winddir")) |
1078 | { |
|
|
1079 | m->winddir = atoi (value); |
1027 | m->winddir = atoi (value); |
1080 | } |
|
|
1081 | else if (!strcmp (key, "sky")) |
1028 | else if (!strcmp (key, "sky")) |
1082 | { |
|
|
1083 | m->sky = atoi (value); |
1029 | m->sky = atoi (value); |
1084 | } |
|
|
1085 | else if (!strcmp (key, "nosmooth")) |
1030 | else if (!strcmp (key, "nosmooth")) |
1086 | { |
|
|
1087 | m->nosmooth = atoi (value); |
1031 | m->nosmooth = atoi (value); |
1088 | } |
|
|
1089 | else if (!strncmp (key, "tile_path_", 10)) |
1032 | else if (!strncmp (key, "tile_path_", 10)) |
1090 | { |
1033 | { |
1091 | int tile = atoi (key + 10); |
1034 | int tile = atoi (key + 10); |
1092 | |
1035 | |
1093 | if (tile < 1 || tile > 4) |
1036 | if (tile < 1 || tile > 4) |
… | |
… | |
1126 | } |
1069 | } |
1127 | |
1070 | |
1128 | if (editor) |
1071 | if (editor) |
1129 | { |
1072 | { |
1130 | /* Use the value as in the file. */ |
1073 | /* Use the value as in the file. */ |
1131 | m->tile_path[tile - 1] = strdup_local (value); |
1074 | m->tile_path[tile - 1] = strdup (value); |
1132 | } |
1075 | } |
1133 | else if (path != NULL) |
1076 | else if (path != NULL) |
1134 | { |
1077 | { |
1135 | /* Use the normalized value. */ |
1078 | /* Use the normalized value. */ |
1136 | m->tile_path[tile - 1] = strdup_local (path); |
1079 | m->tile_path[tile - 1] = strdup (path); |
1137 | } |
1080 | } |
1138 | } /* end if tile direction (in)valid */ |
1081 | } /* end if tile direction (in)valid */ |
1139 | } |
1082 | } |
1140 | else |
1083 | else |
1141 | { |
|
|
1142 | LOG (llevError, "Got unknown value in map header: %s %s\n", key, value); |
1084 | LOG (llevError, "Got unknown value in map header: %s %s\n", key, value); |
1143 | } |
|
|
1144 | } |
1085 | } |
|
|
1086 | |
1145 | if (!key || strcmp (key, "end")) |
1087 | if (!key || strcmp (key, "end")) |
1146 | { |
1088 | { |
1147 | LOG (llevError, "Got premature eof on map header!\n"); |
1089 | LOG (llevError, "Got premature eof on map header!\n"); |
1148 | return 1; |
1090 | return 1; |
1149 | } |
1091 | } |
|
|
1092 | |
1150 | return 0; |
1093 | return 0; |
1151 | } |
1094 | } |
1152 | |
1095 | |
1153 | /* |
1096 | /* |
1154 | * Opens the file "filename" and reads information about the map |
1097 | * Opens the file "filename" and reads information about the map |
… | |
… | |
1306 | |
1249 | |
1307 | for (i = 0; i < MAP_WIDTH (m); i++) |
1250 | for (i = 0; i < MAP_WIDTH (m); i++) |
1308 | for (j = 0; j < MAP_HEIGHT (m); j++) |
1251 | for (j = 0; j < MAP_HEIGHT (m); j++) |
1309 | { |
1252 | { |
1310 | unique = 0; |
1253 | unique = 0; |
|
|
1254 | |
1311 | for (op = get_map_ob (m, i, j); op; op = next) |
1255 | for (op = get_map_ob (m, i, j); op; op = next) |
1312 | { |
1256 | { |
1313 | next = op->above; |
1257 | next = op->above; |
|
|
1258 | |
1314 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
1259 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
1315 | unique = 1; |
1260 | unique = 1; |
|
|
1261 | |
1316 | if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
1262 | if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
1317 | { |
1263 | { |
1318 | clean_object (op); |
1264 | clean_object (op); |
|
|
1265 | |
1319 | if (QUERY_FLAG (op, FLAG_IS_LINKED)) |
1266 | if (QUERY_FLAG (op, FLAG_IS_LINKED)) |
1320 | remove_button_link (op); |
1267 | remove_button_link (op); |
1321 | remove_ob (op); |
1268 | |
1322 | free_object (op); |
1269 | op->destroy (); |
1323 | } |
1270 | } |
1324 | } |
1271 | } |
1325 | } |
1272 | } |
1326 | } |
1273 | } |
1327 | |
1274 | |
… | |
… | |
1396 | make_path_to_file (filename); |
1343 | make_path_to_file (filename); |
1397 | } |
1344 | } |
1398 | else |
1345 | else |
1399 | { |
1346 | { |
1400 | if (!m->tmpname) |
1347 | if (!m->tmpname) |
1401 | m->tmpname = tempnam_local (settings.tmpdir, NULL); |
1348 | m->tmpname = tempnam (settings.tmpdir, NULL); |
1402 | |
1349 | |
1403 | strcpy (filename, m->tmpname); |
1350 | strcpy (filename, m->tmpname); |
1404 | } |
1351 | } |
1405 | |
1352 | |
1406 | LOG (llevDebug, "Saving map %s to %s\n", m->path, filename); |
1353 | LOG (llevDebug, "Saving map %s to %s\n", m->path, filename); |
… | |
… | |
1430 | print_shop_string (m, shop); |
1377 | print_shop_string (m, shop); |
1431 | fprintf (freezer, "shopitems %s\n", shop); |
1378 | fprintf (freezer, "shopitems %s\n", shop); |
1432 | } |
1379 | } |
1433 | if (m->shopgreed) |
1380 | if (m->shopgreed) |
1434 | fprintf (freezer, "shopgreed %f\n", m->shopgreed); |
1381 | fprintf (freezer, "shopgreed %f\n", m->shopgreed); |
1435 | #ifndef WIN32 |
|
|
1436 | if (m->shopmin) |
1382 | if (m->shopmin) |
1437 | fprintf (freezer, "shopmin %llu\n", m->shopmin); |
1383 | fprintf (freezer, "shopmin %llu\n", m->shopmin); |
1438 | if (m->shopmax) |
1384 | if (m->shopmax) |
1439 | fprintf (freezer, "shopmax %llu\n", m->shopmax); |
1385 | fprintf (freezer, "shopmax %llu\n", m->shopmax); |
1440 | #else |
|
|
1441 | if (m->shopmin) |
|
|
1442 | fprintf (freezer, "shopmin %I64u\n", m->shopmin); |
|
|
1443 | if (m->shopmax) |
|
|
1444 | fprintf (freezer, "shopmax %I64u\n", m->shopmax); |
|
|
1445 | #endif |
|
|
1446 | if (m->shoprace) |
1386 | if (m->shoprace) |
1447 | fprintf (freezer, "shoprace %s\n", m->shoprace); |
1387 | fprintf (freezer, "shoprace %s\n", m->shoprace); |
1448 | if (m->darkness) |
1388 | if (m->darkness) |
1449 | fprintf (freezer, "darkness %d\n", m->darkness); |
1389 | fprintf (freezer, "darkness %d\n", m->darkness); |
1450 | if (m->width) |
1390 | if (m->width) |
… | |
… | |
1529 | object *tmp, *next; |
1469 | object *tmp, *next; |
1530 | |
1470 | |
1531 | for (tmp = op->inv; tmp; tmp = next) |
1471 | for (tmp = op->inv; tmp; tmp = next) |
1532 | { |
1472 | { |
1533 | next = tmp->below; |
1473 | next = tmp->below; |
|
|
1474 | |
1534 | clean_object (tmp); |
1475 | clean_object (tmp); |
1535 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
1476 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
1536 | remove_button_link (tmp); |
1477 | remove_button_link (tmp); |
1537 | remove_ob (tmp); |
1478 | |
1538 | free_object (tmp); |
1479 | tmp->destroy (); |
1539 | } |
1480 | } |
1540 | } |
1481 | } |
1541 | |
1482 | |
1542 | /* |
1483 | /* |
1543 | * Remove and free all objects in the given map. |
1484 | * Remove and free all objects in the given map. |
… | |
… | |
1559 | if (op == previous_obj) |
1500 | if (op == previous_obj) |
1560 | { |
1501 | { |
1561 | LOG (llevDebug, "free_all_objects: Link error, bailing out.\n"); |
1502 | LOG (llevDebug, "free_all_objects: Link error, bailing out.\n"); |
1562 | break; |
1503 | break; |
1563 | } |
1504 | } |
|
|
1505 | |
1564 | previous_obj = op; |
1506 | previous_obj = op; |
|
|
1507 | |
1565 | if (op->head != NULL) |
1508 | if (op->head != NULL) |
1566 | op = op->head; |
1509 | op = op->head; |
1567 | |
1510 | |
1568 | /* If the map isn't in memory, free_object will remove and |
1511 | /* If the map isn't in memory, free_object will remove and |
1569 | * free objects in op's inventory. So let it do the job. |
1512 | * free objects in op's inventory. So let it do the job. |
1570 | */ |
1513 | */ |
1571 | if (m->in_memory == MAP_IN_MEMORY) |
1514 | if (m->in_memory == MAP_IN_MEMORY) |
1572 | clean_object (op); |
1515 | clean_object (op); |
1573 | remove_ob (op); |
1516 | |
1574 | free_object (op); |
1517 | op->destroy (); |
1575 | } |
1518 | } |
1576 | } |
1519 | } |
1577 | } |
1520 | } |
1578 | |
1521 | |
1579 | /* |
1522 | /* |
… | |
… | |
1589 | if (!m->in_memory) |
1532 | if (!m->in_memory) |
1590 | { |
1533 | { |
1591 | LOG (llevError, "Trying to free freed map.\n"); |
1534 | LOG (llevError, "Trying to free freed map.\n"); |
1592 | return; |
1535 | return; |
1593 | } |
1536 | } |
|
|
1537 | |
|
|
1538 | // TODO: use new/delete |
|
|
1539 | #define FREE_AND_CLEAR(p) { free (p); p = NULL; } |
|
|
1540 | |
1594 | if (flag && m->spaces) |
1541 | if (flag && m->spaces) |
1595 | free_all_objects (m); |
1542 | free_all_objects (m); |
1596 | if (m->name) |
1543 | if (m->name) |
1597 | FREE_AND_CLEAR (m->name); |
1544 | FREE_AND_CLEAR (m->name); |
1598 | if (m->spaces) |
1545 | if (m->spaces) |
1599 | FREE_AND_CLEAR (m->spaces); |
1546 | FREE_AND_CLEAR (m->spaces); |
1600 | if (m->msg) |
1547 | if (m->msg) |
1601 | FREE_AND_CLEAR (m->msg); |
1548 | FREE_AND_CLEAR (m->msg); |
1602 | if (m->maplore) |
1549 | if (m->maplore) |
1603 | FREE_AND_CLEAR (m->maplore); |
1550 | FREE_AND_CLEAR (m->maplore); |
1604 | if (m->shopitems) |
1551 | |
1605 | delete[]m->shopitems; |
1552 | delete [] m->shopitems; |
1606 | m->shopitems = 0; |
1553 | m->shopitems = 0; |
|
|
1554 | |
1607 | if (m->shoprace) |
1555 | if (m->shoprace) |
1608 | FREE_AND_CLEAR (m->shoprace); |
1556 | FREE_AND_CLEAR (m->shoprace); |
|
|
1557 | |
1609 | if (m->buttons) |
1558 | if (m->buttons) |
1610 | free_objectlinkpt (m->buttons); |
1559 | free_objectlinkpt (m->buttons); |
|
|
1560 | |
1611 | m->buttons = NULL; |
1561 | m->buttons = NULL; |
|
|
1562 | |
1612 | for (i = 0; i < 4; i++) |
1563 | for (i = 0; i < 4; i++) |
1613 | { |
1564 | { |
1614 | if (m->tile_path[i]) |
1565 | if (m->tile_path[i]) |
1615 | FREE_AND_CLEAR (m->tile_path[i]); |
1566 | FREE_AND_CLEAR (m->tile_path[i]); |
1616 | m->tile_map[i] = NULL; |
1567 | m->tile_map[i] = NULL; |
1617 | } |
1568 | } |
|
|
1569 | |
1618 | m->in_memory = MAP_SWAPPED; |
1570 | m->in_memory = MAP_SWAPPED; |
|
|
1571 | |
|
|
1572 | #undef FREE_AND_CLEAR |
|
|
1573 | |
1619 | } |
1574 | } |
1620 | |
1575 | |
1621 | /* |
1576 | /* |
1622 | * function: vanish maptile |
1577 | * function: vanish maptile |
1623 | * m : pointer to maptile, if NULL no action |
1578 | * m : pointer to maptile, if NULL no action |
… | |
… | |
2153 | timeout = MAP_RESET_TIMEOUT (map); |
2108 | timeout = MAP_RESET_TIMEOUT (map); |
2154 | if (timeout <= 0) |
2109 | if (timeout <= 0) |
2155 | timeout = MAP_DEFAULTRESET; |
2110 | timeout = MAP_DEFAULTRESET; |
2156 | if (timeout >= MAP_MAXRESET) |
2111 | if (timeout >= MAP_MAXRESET) |
2157 | timeout = MAP_MAXRESET; |
2112 | timeout = MAP_MAXRESET; |
2158 | MAP_WHEN_RESET (map) = seconds () + timeout; |
2113 | MAP_WHEN_RESET (map) = time (0) + timeout; |
2159 | } |
2114 | } |
2160 | |
2115 | |
2161 | /* this updates the orig_map->tile_map[tile_num] value after loading |
2116 | /* this updates the orig_map->tile_map[tile_num] value after loading |
2162 | * the map. It also takes care of linking back the freshly loaded |
2117 | * the map. It also takes care of linking back the freshly loaded |
2163 | * maps tile_map values if it tiles back to this one. It returns |
2118 | * maps tile_map values if it tiles back to this one. It returns |