1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * 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 |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * 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 |
19 | * along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
24 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
26 | * It is useful for finding bugs in the treasures file. Since it only |
25 | * It is useful for finding bugs in the treasures file. Since it only |
27 | * slows the startup some (and not actual game play), it is by default |
26 | * slows the startup some (and not actual game play), it is by default |
… | |
… | |
33 | |
32 | |
34 | //#define TREASURE_VERBOSE |
33 | //#define TREASURE_VERBOSE |
35 | |
34 | |
36 | #include <global.h> |
35 | #include <global.h> |
37 | #include <treasure.h> |
36 | #include <treasure.h> |
38 | #include <funcpoint.h> |
|
|
39 | #include <loader.h> |
37 | #include <loader.h> |
40 | |
38 | |
41 | extern char *spell_mapping[]; |
39 | extern char *spell_mapping[]; |
42 | |
40 | |
43 | static treasurelist *first_treasurelist; |
41 | static treasurelist *first_treasurelist; |
… | |
… | |
140 | |
138 | |
141 | f.next (); |
139 | f.next (); |
142 | |
140 | |
143 | for (;;) |
141 | for (;;) |
144 | { |
142 | { |
145 | coroapi::cede_to_tick_every (10); |
143 | coroapi::cede_to_tick (); |
146 | |
144 | |
147 | switch (f.kw) |
145 | switch (f.kw) |
148 | { |
146 | { |
149 | case KW_arch: |
147 | case KW_arch: |
150 | t->item = archetype::get (f.get_str ()); |
148 | t->item = archetype::find (f.get_str ()); |
|
|
149 | |
|
|
150 | if (!t->item) |
|
|
151 | { |
|
|
152 | f.parse_warn ("treasure references unknown archetype"); |
|
|
153 | t->item = archetype::empty; |
|
|
154 | } |
|
|
155 | |
151 | break; |
156 | break; |
152 | |
157 | |
153 | case KW_list: f.get (t->name); break; |
158 | case KW_list: f.get (t->name); break; |
154 | case KW_change_name: f.get (t->change_arch.name); break; |
159 | case KW_change_name: f.get (t->change_arch.name); break; |
155 | case KW_change_title: f.get (t->change_arch.title); break; |
160 | case KW_change_title: f.get (t->change_arch.title); break; |
… | |
… | |
169 | t->next = read_treasure (f); |
174 | t->next = read_treasure (f); |
170 | return t; |
175 | return t; |
171 | |
176 | |
172 | default: |
177 | default: |
173 | if (!f.parse_error ("treasurelist", t->name)) |
178 | if (!f.parse_error ("treasurelist", t->name)) |
174 | return 0; |
179 | goto error; |
175 | |
180 | |
176 | return t; |
181 | return t; |
177 | } |
182 | } |
178 | |
183 | |
179 | f.next (); |
184 | f.next (); |
180 | } |
185 | } |
|
|
186 | |
|
|
187 | // not reached |
|
|
188 | |
|
|
189 | error: |
|
|
190 | delete t; |
|
|
191 | return 0; |
181 | } |
192 | } |
182 | |
193 | |
183 | /* |
194 | /* |
184 | * Each treasure is parsed with the help of load_treasure(). |
195 | * Each treasure is parsed with the help of load_treasure(). |
185 | */ |
196 | */ |
… | |
… | |
203 | { |
214 | { |
204 | for (treasure *t = tl->items; t; t = t->next) |
215 | for (treasure *t = tl->items; t; t = t->next) |
205 | { |
216 | { |
206 | if (t->next_yes || t->next_no) |
217 | if (t->next_yes || t->next_no) |
207 | { |
218 | { |
208 | LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); |
219 | LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->archname : &t->name); |
209 | LOG (llevError, " the next_yes or next_no field is set\n"); |
220 | LOG (llevError, " the next_yes or next_no field is set\n"); |
210 | } |
221 | } |
211 | |
222 | |
212 | tl->total_chance += t->chance; |
223 | tl->total_chance += t->chance; |
213 | } |
224 | } |
… | |
… | |
244 | return; |
255 | return; |
245 | } |
256 | } |
246 | |
257 | |
247 | op->expand_tail (); |
258 | op->expand_tail (); |
248 | |
259 | |
249 | if (ob_blocked (op, creator->map, creator->x, creator->y)) |
260 | if (op->blocked (creator->map, creator->x, creator->y)) |
250 | op->destroy (); |
261 | op->destroy (); |
251 | else |
262 | else |
252 | { |
263 | { |
253 | SET_FLAG (op, FLAG_OBJ_ORIGINAL); |
264 | SET_FLAG (op, FLAG_OBJ_ORIGINAL); |
254 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
265 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
… | |
… | |
258 | { |
269 | { |
259 | op = creator->insert (op); |
270 | op = creator->insert (op); |
260 | |
271 | |
261 | if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) |
272 | if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) |
262 | monster_check_apply (creator, op); |
273 | monster_check_apply (creator, op); |
263 | |
|
|
264 | if (flags & GT_UPDATE_INV) |
|
|
265 | if (object *tmp = creator->in_player ()) |
|
|
266 | esrv_send_item (tmp, op); |
|
|
267 | } |
274 | } |
268 | } |
275 | } |
269 | |
276 | |
270 | /* if there are change_xxx commands in the treasure, we include the changes |
277 | /* if there are change_xxx commands in the treasure, we include the changes |
271 | * in the generated object |
278 | * in the generated object |
… | |
… | |
300 | else |
307 | else |
301 | LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name); |
308 | LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name); |
302 | } |
309 | } |
303 | else |
310 | else |
304 | { |
311 | { |
305 | if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) |
312 | if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE))) |
306 | { |
313 | { |
307 | object *tmp = arch_to_object (t->item); |
314 | object *tmp = arch_to_object (t->item); |
308 | |
315 | |
309 | if (t->nrof && tmp->nrof <= 1) |
316 | if (t->nrof && tmp->nrof <= 1) |
310 | tmp->nrof = rndm (t->nrof) + 1; |
317 | tmp->nrof = rndm (t->nrof) + 1; |
… | |
… | |
357 | create_treasure (tl, op, flag, difficulty, tries); |
364 | create_treasure (tl, op, flag, difficulty, tries); |
358 | } |
365 | } |
359 | else if (t->nrof) |
366 | else if (t->nrof) |
360 | create_one_treasure (tl, op, flag, difficulty, tries); |
367 | create_one_treasure (tl, op, flag, difficulty, tries); |
361 | } |
368 | } |
362 | else if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE)) |
369 | else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE)) |
363 | { |
370 | { |
364 | if (object *tmp = arch_to_object (t->item)) |
371 | if (object *tmp = arch_to_object (t->item)) |
365 | { |
372 | { |
366 | if (t->nrof && tmp->nrof <= 1) |
373 | if (t->nrof && tmp->nrof <= 1) |
367 | tmp->nrof = rndm (t->nrof) + 1; |
374 | tmp->nrof = rndm (t->nrof) + 1; |
… | |
… | |
490 | * Removed multiplicator, too many high-level items were generated on low-difficulty maps. |
497 | * Removed multiplicator, too many high-level items were generated on low-difficulty maps. |
491 | */ |
498 | */ |
492 | int |
499 | int |
493 | level_for_item (const object *op, int difficulty) |
500 | level_for_item (const object *op, int difficulty) |
494 | { |
501 | { |
495 | int olevel = 0; |
|
|
496 | |
|
|
497 | if (!op->inv) |
502 | if (!op->inv) |
498 | { |
503 | { |
499 | LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name); |
504 | LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name); |
500 | return 0; |
505 | return 0; |
501 | } |
506 | } |
502 | |
507 | |
503 | olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2)); |
508 | int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.)); |
504 | |
509 | |
505 | if (olevel <= 0) |
510 | if (olevel <= 0) |
506 | olevel = rndm (1, MIN (op->inv->level, 1)); |
511 | olevel = rndm (1, op->inv->level); |
507 | |
512 | |
508 | if (olevel > MAXLEVEL) |
513 | return min (olevel, MAXLEVEL); |
509 | olevel = MAXLEVEL; |
|
|
510 | |
|
|
511 | return olevel; |
|
|
512 | } |
514 | } |
513 | |
515 | |
514 | /* |
516 | /* |
515 | * Based upon the specified difficulty and upon the difftomagic_list array, |
517 | * Based upon the specified difficulty and upon the difftomagic_list array, |
516 | * a random magical bonus is returned. This is used when determine |
518 | * a random magical bonus is returned. This is used when determine |
… | |
… | |
572 | |
574 | |
573 | op->magic = magic; |
575 | op->magic = magic; |
574 | if (op->arch) |
576 | if (op->arch) |
575 | { |
577 | { |
576 | if (op->type == ARMOUR) |
578 | if (op->type == ARMOUR) |
577 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100; |
579 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100; |
578 | |
580 | |
579 | if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ |
581 | if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ |
580 | magic = (-magic); |
582 | magic = (-magic); |
581 | op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100; |
583 | op->weight = (op->arch->weight * (100 - magic * 10)) / 100; |
582 | } |
584 | } |
583 | else |
585 | else |
584 | { |
586 | { |
585 | if (op->type == ARMOUR) |
587 | if (op->type == ARMOUR) |
586 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; |
588 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; |
… | |
… | |
648 | case 2: |
650 | case 2: |
649 | case 3: |
651 | case 3: |
650 | case 4: |
652 | case 4: |
651 | case 5: |
653 | case 5: |
652 | case 6: |
654 | case 6: |
653 | set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r))); |
655 | op->stats.stat (r) += bonus; |
654 | break; |
656 | break; |
655 | |
657 | |
656 | case 7: |
658 | case 7: |
657 | op->stats.dam += bonus; |
659 | op->stats.dam += bonus; |
658 | break; |
660 | break; |
… | |
… | |
822 | ARG_INT (flags))) |
824 | ARG_INT (flags))) |
823 | return; |
825 | return; |
824 | |
826 | |
825 | if (!(flags & GT_MINIMAL)) |
827 | if (!(flags & GT_MINIMAL)) |
826 | { |
828 | { |
827 | if (op->arch == crown_arch) |
829 | if (IS_ARCH (op->arch, crown)) |
828 | { |
830 | { |
829 | set_magic (difficulty, op, max_magic, flags); |
831 | set_magic (difficulty, op, max_magic, flags); |
830 | num_enchantments = calc_item_power (op, 1); |
832 | num_enchantments = calc_item_power (op, 1); |
831 | generate_artifact (op, difficulty); |
833 | generate_artifact (op, difficulty); |
832 | } |
834 | } |
… | |
… | |
837 | |
839 | |
838 | num_enchantments = calc_item_power (op, 1); |
840 | num_enchantments = calc_item_power (op, 1); |
839 | |
841 | |
840 | if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT)) |
842 | if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT)) |
841 | || op->type == HORN |
843 | || op->type == HORN |
842 | || difficulty >= settings.max_level) /* high difficulties always generate an artifact, |
844 | || difficulty >= settings.max_level) /* high difficulties always generate an artifact, used for shop_floors or treasures */ |
843 | * used for shop_floors or treasures */ |
|
|
844 | generate_artifact (op, difficulty); |
845 | generate_artifact (op, difficulty); |
845 | } |
846 | } |
846 | |
847 | |
847 | /* Object was made an artifact. Calculate its item_power rating. |
848 | /* Object was made an artifact. Calculate its item_power rating. |
848 | * the item_power in the object is what the artfiact adds. |
849 | * the item_power in the object is what the artfiact adds. |
… | |
… | |
890 | { |
891 | { |
891 | if (op->type == POTION) |
892 | if (op->type == POTION) |
892 | /* Handle healing and magic power potions */ |
893 | /* Handle healing and magic power potions */ |
893 | if (op->stats.sp && !op->randomitems) |
894 | if (op->stats.sp && !op->randomitems) |
894 | { |
895 | { |
895 | object *tmp; |
|
|
896 | |
|
|
897 | tmp = get_archetype (spell_mapping[op->stats.sp]); |
896 | object *tmp = get_archetype (spell_mapping [op->stats.sp]); |
898 | insert_ob_in_ob (tmp, op); |
897 | insert_ob_in_ob (tmp, op); |
899 | op->stats.sp = 0; |
898 | op->stats.sp = 0; |
900 | } |
899 | } |
901 | } |
900 | } |
902 | else if (!op->title) /* Only modify object if not special */ |
901 | else if (!op->title) /* Only modify object if not special */ |
… | |
… | |
960 | SET_FLAG (op, FLAG_CURSED); |
959 | SET_FLAG (op, FLAG_CURSED); |
961 | break; |
960 | break; |
962 | } |
961 | } |
963 | |
962 | |
964 | case AMULET: |
963 | case AMULET: |
965 | if (op->arch == amulet_arch) |
964 | if (IS_ARCH (op->arch, amulet)) |
966 | op->value *= 5; /* Since it's not just decoration */ |
965 | op->value *= 5; /* Since it's not just decoration */ |
967 | |
966 | |
968 | case RING: |
967 | case RING: |
969 | if (op->arch == NULL) |
968 | if (!op->arch) // wtf? schmorp |
970 | { |
969 | { |
971 | op->destroy (); |
970 | op->destroy (); |
972 | op = 0; |
971 | op = 0; |
973 | break; |
972 | break; |
974 | } |
973 | } |
975 | |
974 | |
976 | if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */ |
975 | if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */ |
977 | break; |
976 | break; |
978 | |
977 | |
979 | if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) |
978 | if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) |
980 | SET_FLAG (op, FLAG_CURSED); |
979 | SET_FLAG (op, FLAG_CURSED); |
981 | |
980 | |
… | |
… | |
1134 | * Allocate and return the pointer to an empty artifactlist structure. |
1133 | * Allocate and return the pointer to an empty artifactlist structure. |
1135 | */ |
1134 | */ |
1136 | static artifactlist * |
1135 | static artifactlist * |
1137 | get_empty_artifactlist (void) |
1136 | get_empty_artifactlist (void) |
1138 | { |
1137 | { |
1139 | return salloc0 <artifactlist> (); |
1138 | return salloc0<artifactlist> (); |
1140 | } |
1139 | } |
1141 | |
1140 | |
1142 | /* |
1141 | /* |
1143 | * Allocate and return the pointer to an empty artifact structure. |
1142 | * Allocate and return the pointer to an empty artifact structure. |
1144 | */ |
1143 | */ |
1145 | static artifact * |
1144 | static artifact * |
1146 | get_empty_artifact (void) |
1145 | get_empty_artifact (void) |
1147 | { |
1146 | { |
1148 | return salloc0 <artifact> (); |
1147 | return salloc0<artifact> (); |
1149 | } |
1148 | } |
1150 | |
1149 | |
1151 | /* |
1150 | /* |
1152 | * Searches the artifact lists and returns one that has the same type |
1151 | * Searches the artifact lists and returns one that has the same type |
1153 | * of objects on it. |
1152 | * of objects on it. |
… | |
… | |
1158 | for (artifactlist *al = first_artifactlist; al; al = al->next) |
1157 | for (artifactlist *al = first_artifactlist; al; al = al->next) |
1159 | if (al->type == type) |
1158 | if (al->type == type) |
1160 | return al; |
1159 | return al; |
1161 | |
1160 | |
1162 | return 0; |
1161 | return 0; |
1163 | } |
|
|
1164 | |
|
|
1165 | /* |
|
|
1166 | * For debugging purposes. Dumps all tables. |
|
|
1167 | */ |
|
|
1168 | void |
|
|
1169 | dump_artifacts (void) |
|
|
1170 | { |
|
|
1171 | artifactlist *al; |
|
|
1172 | artifact *art; |
|
|
1173 | linked_char *next; |
|
|
1174 | |
|
|
1175 | fprintf (logfile, "\n"); |
|
|
1176 | for (al = first_artifactlist; al != NULL; al = al->next) |
|
|
1177 | { |
|
|
1178 | fprintf (logfile, "Artifact has type %d, total_chance=%d\n", al->type, al->total_chance); |
|
|
1179 | for (art = al->items; art != NULL; art = art->next) |
|
|
1180 | { |
|
|
1181 | fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance); |
|
|
1182 | if (art->allowed != NULL) |
|
|
1183 | { |
|
|
1184 | fprintf (logfile, "\tallowed combinations:"); |
|
|
1185 | for (next = art->allowed; next != NULL; next = next->next) |
|
|
1186 | fprintf (logfile, "%s,", &next->name); |
|
|
1187 | fprintf (logfile, "\n"); |
|
|
1188 | } |
|
|
1189 | } |
|
|
1190 | } |
|
|
1191 | fprintf (logfile, "\n"); |
|
|
1192 | } |
|
|
1193 | |
|
|
1194 | /* |
|
|
1195 | * For debugging purposes. Dumps all treasures recursively (see below). |
|
|
1196 | */ |
|
|
1197 | void |
|
|
1198 | dump_monster_treasure_rec (const char *name, treasure *t, int depth) |
|
|
1199 | { |
|
|
1200 | treasurelist *tl; |
|
|
1201 | int i; |
|
|
1202 | |
|
|
1203 | if (depth > 100) |
|
|
1204 | return; |
|
|
1205 | |
|
|
1206 | while (t) |
|
|
1207 | { |
|
|
1208 | if (t->name) |
|
|
1209 | { |
|
|
1210 | for (i = 0; i < depth; i++) |
|
|
1211 | fprintf (logfile, " "); |
|
|
1212 | |
|
|
1213 | fprintf (logfile, "{ (list: %s)\n", &t->name); |
|
|
1214 | |
|
|
1215 | tl = treasurelist::find (t->name); |
|
|
1216 | if (tl) |
|
|
1217 | dump_monster_treasure_rec (name, tl->items, depth + 2); |
|
|
1218 | |
|
|
1219 | for (i = 0; i < depth; i++) |
|
|
1220 | fprintf (logfile, " "); |
|
|
1221 | |
|
|
1222 | fprintf (logfile, "} (end of list: %s)\n", &t->name); |
|
|
1223 | } |
|
|
1224 | else |
|
|
1225 | { |
|
|
1226 | for (i = 0; i < depth; i++) |
|
|
1227 | fprintf (logfile, " "); |
|
|
1228 | |
|
|
1229 | if (t->item && t->item->clone.type == FLESH) |
|
|
1230 | fprintf (logfile, "%s's %s\n", name, &t->item->clone.name); |
|
|
1231 | else |
|
|
1232 | fprintf (logfile, "%s\n", &t->item->clone.name); |
|
|
1233 | } |
|
|
1234 | |
|
|
1235 | if (t->next_yes) |
|
|
1236 | { |
|
|
1237 | for (i = 0; i < depth; i++) |
|
|
1238 | fprintf (logfile, " "); |
|
|
1239 | |
|
|
1240 | fprintf (logfile, " (if yes)\n"); |
|
|
1241 | dump_monster_treasure_rec (name, t->next_yes, depth + 1); |
|
|
1242 | } |
|
|
1243 | |
|
|
1244 | if (t->next_no) |
|
|
1245 | { |
|
|
1246 | for (i = 0; i < depth; i++) |
|
|
1247 | fprintf (logfile, " "); |
|
|
1248 | |
|
|
1249 | fprintf (logfile, " (if no)\n"); |
|
|
1250 | dump_monster_treasure_rec (name, t->next_no, depth + 1); |
|
|
1251 | } |
|
|
1252 | |
|
|
1253 | t = t->next; |
|
|
1254 | } |
|
|
1255 | } |
|
|
1256 | |
|
|
1257 | /* |
|
|
1258 | * For debugging purposes. Dumps all treasures for a given monster. |
|
|
1259 | * Created originally by Raphael Quinet for debugging the alchemy code. |
|
|
1260 | */ |
|
|
1261 | void |
|
|
1262 | dump_monster_treasure (const char *name) |
|
|
1263 | { |
|
|
1264 | archetype *at; |
|
|
1265 | int found; |
|
|
1266 | |
|
|
1267 | found = 0; |
|
|
1268 | fprintf (logfile, "\n"); |
|
|
1269 | |
|
|
1270 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
1271 | if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) |
|
|
1272 | { |
|
|
1273 | fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name); |
|
|
1274 | if (at->clone.randomitems != NULL) |
|
|
1275 | dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1); |
|
|
1276 | else |
|
|
1277 | fprintf (logfile, "(nothing)\n"); |
|
|
1278 | |
|
|
1279 | fprintf (logfile, "\n"); |
|
|
1280 | found++; |
|
|
1281 | } |
|
|
1282 | |
|
|
1283 | if (found == 0) |
|
|
1284 | fprintf (logfile, "No objects have the name %s!\n\n", name); |
|
|
1285 | } |
1162 | } |
1286 | |
1163 | |
1287 | /* |
1164 | /* |
1288 | * Builds up the lists of artifacts from the file in the libdir. |
1165 | * Builds up the lists of artifacts from the file in the libdir. |
1289 | */ |
1166 | */ |
… | |
… | |
1303 | sprintf (filename, "%s/artifacts", settings.datadir); |
1180 | sprintf (filename, "%s/artifacts", settings.datadir); |
1304 | object_thawer f (filename); |
1181 | object_thawer f (filename); |
1305 | |
1182 | |
1306 | if (!f) |
1183 | if (!f) |
1307 | return; |
1184 | return; |
1308 | |
|
|
1309 | f.next (); |
|
|
1310 | |
1185 | |
1311 | for (;;) |
1186 | for (;;) |
1312 | { |
1187 | { |
1313 | switch (f.kw) |
1188 | switch (f.kw) |
1314 | { |
1189 | { |
… | |
… | |
1418 | #endif |
1293 | #endif |
1419 | op->face = change->face; |
1294 | op->face = change->face; |
1420 | } |
1295 | } |
1421 | |
1296 | |
1422 | for (i = 0; i < NUM_STATS; i++) |
1297 | for (i = 0; i < NUM_STATS; i++) |
1423 | change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i)); |
1298 | change_attr_value (&(op->stats), i, change->stats.stat (i)); |
1424 | |
1299 | |
1425 | op->attacktype |= change->attacktype; |
1300 | op->attacktype |= change->attacktype; |
1426 | op->path_attuned |= change->path_attuned; |
1301 | op->path_attuned |= change->path_attuned; |
1427 | op->path_repelled |= change->path_repelled; |
1302 | op->path_repelled |= change->path_repelled; |
1428 | op->path_denied |= change->path_denied; |
1303 | op->path_denied |= change->path_denied; |
… | |
… | |
1612 | name = tmp->name + 1, neg = 1; |
1487 | name = tmp->name + 1, neg = 1; |
1613 | else |
1488 | else |
1614 | name = tmp->name, neg = 0; |
1489 | name = tmp->name, neg = 0; |
1615 | |
1490 | |
1616 | /* If we match name, then return the opposite of 'neg' */ |
1491 | /* If we match name, then return the opposite of 'neg' */ |
1617 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->name))) |
1492 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname))) |
1618 | return !neg; |
1493 | return !neg; |
1619 | |
1494 | |
1620 | /* Set success as true, since if the match was an inverse, it means |
1495 | /* Set success as true, since if the match was an inverse, it means |
1621 | * everything is allowed except what we match |
1496 | * everything is allowed except what we match |
1622 | */ |
1497 | */ |