| … | |
… | |
| 1155 | |
1155 | |
| 1156 | return 0; |
1156 | return 0; |
| 1157 | } |
1157 | } |
| 1158 | |
1158 | |
| 1159 | /* |
1159 | /* |
| 1160 | * For debugging purposes. Dumps all tables. |
|
|
| 1161 | */ |
|
|
| 1162 | void |
|
|
| 1163 | dump_artifacts (void) |
|
|
| 1164 | { |
|
|
| 1165 | artifactlist *al; |
|
|
| 1166 | artifact *art; |
|
|
| 1167 | linked_char *next; |
|
|
| 1168 | |
|
|
| 1169 | fprintf (logfile, "\n"); |
|
|
| 1170 | for (al = first_artifactlist; al != NULL; al = al->next) |
|
|
| 1171 | { |
|
|
| 1172 | fprintf (logfile, "Artifact has type %d, total_chance=%d\n", al->type, al->total_chance); |
|
|
| 1173 | for (art = al->items; art != NULL; art = art->next) |
|
|
| 1174 | { |
|
|
| 1175 | fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance); |
|
|
| 1176 | if (art->allowed != NULL) |
|
|
| 1177 | { |
|
|
| 1178 | fprintf (logfile, "\tallowed combinations:"); |
|
|
| 1179 | for (next = art->allowed; next != NULL; next = next->next) |
|
|
| 1180 | fprintf (logfile, "%s,", &next->name); |
|
|
| 1181 | fprintf (logfile, "\n"); |
|
|
| 1182 | } |
|
|
| 1183 | } |
|
|
| 1184 | } |
|
|
| 1185 | fprintf (logfile, "\n"); |
|
|
| 1186 | } |
|
|
| 1187 | |
|
|
| 1188 | /* |
|
|
| 1189 | * For debugging purposes. Dumps all treasures recursively (see below). |
|
|
| 1190 | */ |
|
|
| 1191 | void |
|
|
| 1192 | dump_monster_treasure_rec (const char *name, treasure *t, int depth) |
|
|
| 1193 | { |
|
|
| 1194 | treasurelist *tl; |
|
|
| 1195 | int i; |
|
|
| 1196 | |
|
|
| 1197 | if (depth > 100) |
|
|
| 1198 | return; |
|
|
| 1199 | |
|
|
| 1200 | while (t) |
|
|
| 1201 | { |
|
|
| 1202 | if (t->name) |
|
|
| 1203 | { |
|
|
| 1204 | for (i = 0; i < depth; i++) |
|
|
| 1205 | fprintf (logfile, " "); |
|
|
| 1206 | |
|
|
| 1207 | fprintf (logfile, "{ (list: %s)\n", &t->name); |
|
|
| 1208 | |
|
|
| 1209 | tl = treasurelist::find (t->name); |
|
|
| 1210 | if (tl) |
|
|
| 1211 | dump_monster_treasure_rec (name, tl->items, depth + 2); |
|
|
| 1212 | |
|
|
| 1213 | for (i = 0; i < depth; i++) |
|
|
| 1214 | fprintf (logfile, " "); |
|
|
| 1215 | |
|
|
| 1216 | fprintf (logfile, "} (end of list: %s)\n", &t->name); |
|
|
| 1217 | } |
|
|
| 1218 | else |
|
|
| 1219 | { |
|
|
| 1220 | for (i = 0; i < depth; i++) |
|
|
| 1221 | fprintf (logfile, " "); |
|
|
| 1222 | |
|
|
| 1223 | if (t->item && t->item->type == FLESH) |
|
|
| 1224 | fprintf (logfile, "%s's %s\n", name, &t->item->object::name); |
|
|
| 1225 | else |
|
|
| 1226 | fprintf (logfile, "%s\n", &t->item->object::name); |
|
|
| 1227 | } |
|
|
| 1228 | |
|
|
| 1229 | if (t->next_yes) |
|
|
| 1230 | { |
|
|
| 1231 | for (i = 0; i < depth; i++) |
|
|
| 1232 | fprintf (logfile, " "); |
|
|
| 1233 | |
|
|
| 1234 | fprintf (logfile, " (if yes)\n"); |
|
|
| 1235 | dump_monster_treasure_rec (name, t->next_yes, depth + 1); |
|
|
| 1236 | } |
|
|
| 1237 | |
|
|
| 1238 | if (t->next_no) |
|
|
| 1239 | { |
|
|
| 1240 | for (i = 0; i < depth; i++) |
|
|
| 1241 | fprintf (logfile, " "); |
|
|
| 1242 | |
|
|
| 1243 | fprintf (logfile, " (if no)\n"); |
|
|
| 1244 | dump_monster_treasure_rec (name, t->next_no, depth + 1); |
|
|
| 1245 | } |
|
|
| 1246 | |
|
|
| 1247 | t = t->next; |
|
|
| 1248 | } |
|
|
| 1249 | } |
|
|
| 1250 | |
|
|
| 1251 | /* |
|
|
| 1252 | * For debugging purposes. Dumps all treasures for a given monster. |
|
|
| 1253 | * Created originally by Raphael Quinet for debugging the alchemy code. |
|
|
| 1254 | */ |
|
|
| 1255 | void |
|
|
| 1256 | dump_monster_treasure (const char *name) |
|
|
| 1257 | { |
|
|
| 1258 | archetype *at; |
|
|
| 1259 | int found; |
|
|
| 1260 | |
|
|
| 1261 | found = 0; |
|
|
| 1262 | fprintf (logfile, "\n"); |
|
|
| 1263 | |
|
|
| 1264 | for_all_archetypes (at) |
|
|
| 1265 | if (!strcasecmp (at->object::name, name) && at->title == NULL) |
|
|
| 1266 | { |
|
|
| 1267 | fprintf (logfile, "treasures for %s (arch: %s)\n", &at->object::name, &at->archname); |
|
|
| 1268 | if (at->randomitems != NULL) |
|
|
| 1269 | dump_monster_treasure_rec (at->object::name, at->randomitems->items, 1); |
|
|
| 1270 | else |
|
|
| 1271 | fprintf (logfile, "(nothing)\n"); |
|
|
| 1272 | |
|
|
| 1273 | fprintf (logfile, "\n"); |
|
|
| 1274 | found++; |
|
|
| 1275 | } |
|
|
| 1276 | |
|
|
| 1277 | if (found == 0) |
|
|
| 1278 | fprintf (logfile, "No objects have the name %s!\n\n", name); |
|
|
| 1279 | } |
|
|
| 1280 | |
|
|
| 1281 | /* |
|
|
| 1282 | * Builds up the lists of artifacts from the file in the libdir. |
1160 | * Builds up the lists of artifacts from the file in the libdir. |
| 1283 | */ |
1161 | */ |
| 1284 | void |
1162 | void |
| 1285 | init_artifacts (void) |
1163 | init_artifacts (void) |
| 1286 | { |
1164 | { |
