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; |
… | |
… | |
47 | typedef std::tr1::unordered_map< |
45 | typedef std::tr1::unordered_map< |
48 | const char *, |
46 | const char *, |
49 | treasurelist *, |
47 | treasurelist *, |
50 | str_hash, |
48 | str_hash, |
51 | str_equal, |
49 | str_equal, |
52 | slice_allocator< std::pair<const char *const, treasurelist *> >, |
50 | slice_allocator< std::pair<const char *const, treasurelist *> > |
53 | true |
|
|
54 | > tl_map_t; |
51 | > tl_map_t; |
55 | |
52 | |
56 | static tl_map_t tl_map; |
53 | static tl_map_t tl_map; |
57 | |
54 | |
58 | /* |
55 | /* |
… | |
… | |
140 | |
137 | |
141 | f.next (); |
138 | f.next (); |
142 | |
139 | |
143 | for (;;) |
140 | for (;;) |
144 | { |
141 | { |
145 | coroapi::cede_to_tick_every (10); |
142 | coroapi::cede_to_tick (); |
146 | |
143 | |
147 | switch (f.kw) |
144 | switch (f.kw) |
148 | { |
145 | { |
149 | case KW_arch: |
146 | case KW_arch: |
150 | t->item = archetype::get (f.get_str ()); |
147 | t->item = archetype::find (f.get_str ()); |
|
|
148 | |
|
|
149 | if (!t->item) |
|
|
150 | { |
|
|
151 | f.parse_warn ("treasure references unknown archetype"); |
|
|
152 | t->item = archetype::empty; |
|
|
153 | } |
|
|
154 | |
151 | break; |
155 | break; |
152 | |
156 | |
153 | case KW_list: f.get (t->name); break; |
157 | case KW_list: f.get (t->name); break; |
154 | case KW_change_name: f.get (t->change_arch.name); break; |
158 | case KW_change_name: f.get (t->change_arch.name); break; |
155 | case KW_change_title: f.get (t->change_arch.title); break; |
159 | case KW_change_title: f.get (t->change_arch.title); break; |
… | |
… | |
169 | t->next = read_treasure (f); |
173 | t->next = read_treasure (f); |
170 | return t; |
174 | return t; |
171 | |
175 | |
172 | default: |
176 | default: |
173 | if (!f.parse_error ("treasurelist", t->name)) |
177 | if (!f.parse_error ("treasurelist", t->name)) |
174 | return 0; |
178 | goto error; |
175 | |
179 | |
176 | return t; |
180 | return t; |
177 | } |
181 | } |
178 | |
182 | |
179 | f.next (); |
183 | f.next (); |
180 | } |
184 | } |
|
|
185 | |
|
|
186 | // not reached |
|
|
187 | |
|
|
188 | error: |
|
|
189 | delete t; |
|
|
190 | return 0; |
181 | } |
191 | } |
182 | |
192 | |
183 | /* |
193 | /* |
184 | * Each treasure is parsed with the help of load_treasure(). |
194 | * Each treasure is parsed with the help of load_treasure(). |
185 | */ |
195 | */ |
… | |
… | |
203 | { |
213 | { |
204 | for (treasure *t = tl->items; t; t = t->next) |
214 | for (treasure *t = tl->items; t; t = t->next) |
205 | { |
215 | { |
206 | if (t->next_yes || t->next_no) |
216 | if (t->next_yes || t->next_no) |
207 | { |
217 | { |
208 | LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); |
218 | 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"); |
219 | LOG (llevError, " the next_yes or next_no field is set\n"); |
210 | } |
220 | } |
211 | |
221 | |
212 | tl->total_chance += t->chance; |
222 | tl->total_chance += t->chance; |
213 | } |
223 | } |
… | |
… | |
238 | * by another object. |
248 | * by another object. |
239 | */ |
249 | */ |
240 | //TODO: flag such as objects... as such (no drop, anybody?) |
250 | //TODO: flag such as objects... as such (no drop, anybody?) |
241 | if (op->type == SPELL) |
251 | if (op->type == SPELL) |
242 | { |
252 | { |
243 | op->destroy (); |
253 | op->destroy (true); |
244 | return; |
254 | return; |
245 | } |
255 | } |
246 | |
256 | |
247 | op->expand_tail (); |
257 | op->expand_tail (); |
248 | |
258 | |
249 | if (ob_blocked (op, creator->map, creator->x, creator->y)) |
259 | if (!creator->is_on_map () || op->blocked (creator->map, creator->x, creator->y)) |
250 | op->destroy (); |
260 | op->destroy (true); |
251 | else |
261 | else |
252 | { |
262 | { |
253 | SET_FLAG (op, FLAG_OBJ_ORIGINAL); |
263 | SET_FLAG (op, FLAG_OBJ_ORIGINAL); |
254 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
264 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
255 | } |
265 | } |
… | |
… | |
258 | { |
268 | { |
259 | op = creator->insert (op); |
269 | op = creator->insert (op); |
260 | |
270 | |
261 | if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) |
271 | if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) |
262 | monster_check_apply (creator, op); |
272 | 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 | } |
273 | } |
268 | } |
274 | } |
269 | |
275 | |
270 | /* if there are change_xxx commands in the treasure, we include the changes |
276 | /* if there are change_xxx commands in the treasure, we include the changes |
271 | * in the generated object |
277 | * in the generated object |
… | |
… | |
300 | else |
306 | else |
301 | LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name); |
307 | LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name); |
302 | } |
308 | } |
303 | else |
309 | else |
304 | { |
310 | { |
305 | if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) |
311 | if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE))) |
306 | { |
312 | { |
307 | object *tmp = arch_to_object (t->item); |
313 | object *tmp = arch_to_object (t->item); |
308 | |
314 | |
309 | if (t->nrof && tmp->nrof <= 1) |
315 | if (t->nrof && tmp->nrof <= 1) |
310 | tmp->nrof = rndm (t->nrof) + 1; |
316 | tmp->nrof = rndm (t->nrof) + 1; |
… | |
… | |
357 | create_treasure (tl, op, flag, difficulty, tries); |
363 | create_treasure (tl, op, flag, difficulty, tries); |
358 | } |
364 | } |
359 | else if (t->nrof) |
365 | else if (t->nrof) |
360 | create_one_treasure (tl, op, flag, difficulty, tries); |
366 | create_one_treasure (tl, op, flag, difficulty, tries); |
361 | } |
367 | } |
362 | else if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE)) |
368 | else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE)) |
363 | { |
369 | { |
364 | if (object *tmp = arch_to_object (t->item)) |
370 | if (object *tmp = arch_to_object (t->item)) |
365 | { |
371 | { |
366 | if (t->nrof && tmp->nrof <= 1) |
372 | if (t->nrof && tmp->nrof <= 1) |
367 | tmp->nrof = rndm (t->nrof) + 1; |
373 | tmp->nrof = rndm (t->nrof) + 1; |
… | |
… | |
398 | LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); |
404 | LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); |
399 | return; |
405 | return; |
400 | } |
406 | } |
401 | |
407 | |
402 | if (op->flag [FLAG_TREASURE_ENV]) |
408 | if (op->flag [FLAG_TREASURE_ENV]) |
|
|
409 | { |
|
|
410 | // do not generate items when there already is something above the object |
|
|
411 | if (op->flag [FLAG_IS_FLOOR] && op->above) |
|
|
412 | return; |
|
|
413 | |
403 | flag |= GT_ENVIRONMENT; |
414 | flag |= GT_ENVIRONMENT; |
|
|
415 | } |
404 | |
416 | |
405 | if (tl->total_chance) |
417 | if (tl->total_chance) |
406 | create_one_treasure (tl, op, flag, difficulty, tries); |
418 | create_one_treasure (tl, op, flag, difficulty, tries); |
407 | else |
419 | else |
408 | create_all_treasures (tl->items, op, flag, difficulty, tries); |
420 | create_all_treasures (tl->items, op, flag, difficulty, tries); |
… | |
… | |
428 | tmp->remove (); |
440 | tmp->remove (); |
429 | |
441 | |
430 | if (ob->inv) |
442 | if (ob->inv) |
431 | LOG (llevError, "In generate treasure, created multiple objects.\n"); |
443 | LOG (llevError, "In generate treasure, created multiple objects.\n"); |
432 | |
444 | |
433 | ob->destroy (); |
445 | ob->destroy (true); |
|
|
446 | |
434 | return tmp; |
447 | return tmp; |
435 | } |
448 | } |
436 | |
449 | |
437 | /* |
450 | /* |
438 | * This is a new way of calculating the chance for an item to have |
451 | * This is a new way of calculating the chance for an item to have |
… | |
… | |
484 | * 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. |
485 | */ |
498 | */ |
486 | int |
499 | int |
487 | level_for_item (const object *op, int difficulty) |
500 | level_for_item (const object *op, int difficulty) |
488 | { |
501 | { |
489 | int olevel = 0; |
|
|
490 | |
|
|
491 | if (!op->inv) |
502 | if (!op->inv) |
492 | { |
503 | { |
493 | 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); |
494 | return 0; |
505 | return 0; |
495 | } |
506 | } |
496 | |
507 | |
497 | olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2)); |
508 | int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.)); |
498 | |
509 | |
499 | if (olevel <= 0) |
510 | if (olevel <= 0) |
500 | olevel = rndm (1, MIN (op->inv->level, 1)); |
511 | olevel = rndm (1, op->inv->level); |
501 | |
512 | |
502 | if (olevel > MAXLEVEL) |
513 | return min (olevel, MAXLEVEL); |
503 | olevel = MAXLEVEL; |
|
|
504 | |
|
|
505 | return olevel; |
|
|
506 | } |
514 | } |
507 | |
515 | |
508 | /* |
516 | /* |
509 | * Based upon the specified difficulty and upon the difftomagic_list array, |
517 | * Based upon the specified difficulty and upon the difftomagic_list array, |
510 | * a random magical bonus is returned. This is used when determine |
518 | * a random magical bonus is returned. This is used when determine |
… | |
… | |
566 | |
574 | |
567 | op->magic = magic; |
575 | op->magic = magic; |
568 | if (op->arch) |
576 | if (op->arch) |
569 | { |
577 | { |
570 | if (op->type == ARMOUR) |
578 | if (op->type == ARMOUR) |
571 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100; |
579 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100; |
572 | |
580 | |
573 | 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 */ |
574 | magic = (-magic); |
582 | magic = (-magic); |
|
|
583 | |
575 | op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100; |
584 | op->weight = (op->arch->weight * (100 - magic * 10)) / 100; |
576 | } |
585 | } |
577 | else |
586 | else |
578 | { |
587 | { |
579 | if (op->type == ARMOUR) |
588 | if (op->type == ARMOUR) |
580 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; |
589 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; |
|
|
590 | |
581 | if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ |
591 | if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ |
582 | magic = (-magic); |
592 | magic = (-magic); |
|
|
593 | |
583 | op->weight = (op->weight * (100 - magic * 10)) / 100; |
594 | op->weight = (op->weight * (100 - magic * 10)) / 100; |
584 | } |
595 | } |
585 | } |
596 | } |
586 | |
597 | |
587 | /* |
598 | /* |
… | |
… | |
642 | case 2: |
653 | case 2: |
643 | case 3: |
654 | case 3: |
644 | case 4: |
655 | case 4: |
645 | case 5: |
656 | case 5: |
646 | case 6: |
657 | case 6: |
647 | set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r))); |
658 | op->stats.stat (r) += bonus; |
648 | break; |
659 | break; |
649 | |
660 | |
650 | case 7: |
661 | case 7: |
651 | op->stats.dam += bonus; |
662 | op->stats.dam += bonus; |
652 | break; |
663 | break; |
… | |
… | |
816 | ARG_INT (flags))) |
827 | ARG_INT (flags))) |
817 | return; |
828 | return; |
818 | |
829 | |
819 | if (!(flags & GT_MINIMAL)) |
830 | if (!(flags & GT_MINIMAL)) |
820 | { |
831 | { |
821 | if (op->arch == crown_arch) |
832 | if (IS_ARCH (op->arch, crown)) |
822 | { |
833 | { |
823 | set_magic (difficulty, op, max_magic, flags); |
834 | set_magic (difficulty, op, max_magic, flags); |
824 | num_enchantments = calc_item_power (op, 1); |
835 | num_enchantments = calc_item_power (op, 1); |
825 | generate_artifact (op, difficulty); |
836 | generate_artifact (op, difficulty); |
826 | } |
837 | } |
… | |
… | |
831 | |
842 | |
832 | num_enchantments = calc_item_power (op, 1); |
843 | num_enchantments = calc_item_power (op, 1); |
833 | |
844 | |
834 | if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT)) |
845 | if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT)) |
835 | || op->type == HORN |
846 | || op->type == HORN |
836 | || difficulty >= settings.max_level) /* high difficulties always generate an artifact, |
847 | || difficulty >= settings.max_level) /* high difficulties always generate an artifact, used for shop_floors or treasures */ |
837 | * used for shop_floors or treasures */ |
|
|
838 | generate_artifact (op, difficulty); |
848 | generate_artifact (op, difficulty); |
839 | } |
849 | } |
840 | |
850 | |
841 | /* Object was made an artifact. Calculate its item_power rating. |
851 | /* Object was made an artifact. Calculate its item_power rating. |
842 | * the item_power in the object is what the artfiact adds. |
852 | * the item_power in the object is what the artfiact adds. |
… | |
… | |
884 | { |
894 | { |
885 | if (op->type == POTION) |
895 | if (op->type == POTION) |
886 | /* Handle healing and magic power potions */ |
896 | /* Handle healing and magic power potions */ |
887 | if (op->stats.sp && !op->randomitems) |
897 | if (op->stats.sp && !op->randomitems) |
888 | { |
898 | { |
889 | object *tmp; |
|
|
890 | |
|
|
891 | tmp = get_archetype (spell_mapping[op->stats.sp]); |
899 | object *tmp = get_archetype (spell_mapping [op->stats.sp]); |
892 | insert_ob_in_ob (tmp, op); |
900 | insert_ob_in_ob (tmp, op); |
893 | op->stats.sp = 0; |
901 | op->stats.sp = 0; |
894 | } |
902 | } |
895 | } |
903 | } |
896 | else if (!op->title) /* Only modify object if not special */ |
904 | else if (!op->title) /* Only modify object if not special */ |
… | |
… | |
954 | SET_FLAG (op, FLAG_CURSED); |
962 | SET_FLAG (op, FLAG_CURSED); |
955 | break; |
963 | break; |
956 | } |
964 | } |
957 | |
965 | |
958 | case AMULET: |
966 | case AMULET: |
959 | if (op->arch == amulet_arch) |
967 | if (IS_ARCH (op->arch, amulet)) |
960 | op->value *= 5; /* Since it's not just decoration */ |
968 | op->value *= 5; /* Since it's not just decoration */ |
961 | |
969 | |
962 | case RING: |
970 | case RING: |
963 | if (op->arch == NULL) |
|
|
964 | { |
|
|
965 | op->destroy (); |
|
|
966 | op = 0; |
|
|
967 | break; |
|
|
968 | } |
|
|
969 | |
|
|
970 | if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */ |
971 | if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */ |
971 | break; |
972 | break; |
972 | |
973 | |
973 | if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) |
974 | if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) |
974 | SET_FLAG (op, FLAG_CURSED); |
975 | SET_FLAG (op, FLAG_CURSED); |
975 | |
976 | |
… | |
… | |
1128 | * Allocate and return the pointer to an empty artifactlist structure. |
1129 | * Allocate and return the pointer to an empty artifactlist structure. |
1129 | */ |
1130 | */ |
1130 | static artifactlist * |
1131 | static artifactlist * |
1131 | get_empty_artifactlist (void) |
1132 | get_empty_artifactlist (void) |
1132 | { |
1133 | { |
1133 | return salloc0 <artifactlist> (); |
1134 | return salloc0<artifactlist> (); |
1134 | } |
1135 | } |
1135 | |
1136 | |
1136 | /* |
1137 | /* |
1137 | * Allocate and return the pointer to an empty artifact structure. |
1138 | * Allocate and return the pointer to an empty artifact structure. |
1138 | */ |
1139 | */ |
1139 | static artifact * |
1140 | static artifact * |
1140 | get_empty_artifact (void) |
1141 | get_empty_artifact (void) |
1141 | { |
1142 | { |
1142 | return salloc0 <artifact> (); |
1143 | return salloc0<artifact> (); |
1143 | } |
1144 | } |
1144 | |
1145 | |
1145 | /* |
1146 | /* |
1146 | * Searches the artifact lists and returns one that has the same type |
1147 | * Searches the artifact lists and returns one that has the same type |
1147 | * of objects on it. |
1148 | * of objects on it. |
… | |
… | |
1152 | for (artifactlist *al = first_artifactlist; al; al = al->next) |
1153 | for (artifactlist *al = first_artifactlist; al; al = al->next) |
1153 | if (al->type == type) |
1154 | if (al->type == type) |
1154 | return al; |
1155 | return al; |
1155 | |
1156 | |
1156 | return 0; |
1157 | return 0; |
1157 | } |
|
|
1158 | |
|
|
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->clone.type == FLESH) |
|
|
1224 | fprintf (logfile, "%s's %s\n", name, &t->item->clone.name); |
|
|
1225 | else |
|
|
1226 | fprintf (logfile, "%s\n", &t->item->clone.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 (at = first_archetype; at != NULL; at = at->next) |
|
|
1265 | if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) |
|
|
1266 | { |
|
|
1267 | fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name); |
|
|
1268 | if (at->clone.randomitems != NULL) |
|
|
1269 | dump_monster_treasure_rec (at->clone.name, at->clone.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 | } |
1158 | } |
1280 | |
1159 | |
1281 | /* |
1160 | /* |
1282 | * Builds up the lists of artifacts from the file in the libdir. |
1161 | * Builds up the lists of artifacts from the file in the libdir. |
1283 | */ |
1162 | */ |
… | |
… | |
1297 | sprintf (filename, "%s/artifacts", settings.datadir); |
1176 | sprintf (filename, "%s/artifacts", settings.datadir); |
1298 | object_thawer f (filename); |
1177 | object_thawer f (filename); |
1299 | |
1178 | |
1300 | if (!f) |
1179 | if (!f) |
1301 | return; |
1180 | return; |
1302 | |
|
|
1303 | f.next (); |
|
|
1304 | |
1181 | |
1305 | for (;;) |
1182 | for (;;) |
1306 | { |
1183 | { |
1307 | switch (f.kw) |
1184 | switch (f.kw) |
1308 | { |
1185 | { |
… | |
… | |
1412 | #endif |
1289 | #endif |
1413 | op->face = change->face; |
1290 | op->face = change->face; |
1414 | } |
1291 | } |
1415 | |
1292 | |
1416 | for (i = 0; i < NUM_STATS; i++) |
1293 | for (i = 0; i < NUM_STATS; i++) |
1417 | change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i)); |
1294 | change_attr_value (&(op->stats), i, change->stats.stat (i)); |
1418 | |
1295 | |
1419 | op->attacktype |= change->attacktype; |
1296 | op->attacktype |= change->attacktype; |
1420 | op->path_attuned |= change->path_attuned; |
1297 | op->path_attuned |= change->path_attuned; |
1421 | op->path_repelled |= change->path_repelled; |
1298 | op->path_repelled |= change->path_repelled; |
1422 | op->path_denied |= change->path_denied; |
1299 | op->path_denied |= change->path_denied; |
… | |
… | |
1470 | * to cast. So convert that to into a spell and put it into |
1347 | * to cast. So convert that to into a spell and put it into |
1471 | * this object. |
1348 | * this object. |
1472 | */ |
1349 | */ |
1473 | if (op->type == HORN || op->type == POTION) |
1350 | if (op->type == HORN || op->type == POTION) |
1474 | { |
1351 | { |
1475 | object *tmp_obj; |
|
|
1476 | |
|
|
1477 | /* Remove any spells this object currently has in it */ |
1352 | /* Remove any spells this object currently has in it */ |
1478 | while (op->inv) |
|
|
1479 | op->inv->destroy (); |
1353 | op->destroy_inv (false); |
1480 | |
1354 | |
1481 | tmp_obj = arch_to_object (change->other_arch); |
1355 | object *tmp = arch_to_object (change->other_arch); |
1482 | insert_ob_in_ob (tmp_obj, op); |
1356 | insert_ob_in_ob (tmp, op); |
1483 | } |
1357 | } |
1484 | /* No harm setting this for potions/horns */ |
1358 | /* No harm setting this for potions/horns */ |
1485 | op->other_arch = change->other_arch; |
1359 | op->other_arch = change->other_arch; |
1486 | } |
1360 | } |
1487 | |
1361 | |
… | |
… | |
1606 | name = tmp->name + 1, neg = 1; |
1480 | name = tmp->name + 1, neg = 1; |
1607 | else |
1481 | else |
1608 | name = tmp->name, neg = 0; |
1482 | name = tmp->name, neg = 0; |
1609 | |
1483 | |
1610 | /* If we match name, then return the opposite of 'neg' */ |
1484 | /* If we match name, then return the opposite of 'neg' */ |
1611 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->name))) |
1485 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname))) |
1612 | return !neg; |
1486 | return !neg; |
1613 | |
1487 | |
1614 | /* Set success as true, since if the match was an inverse, it means |
1488 | /* Set success as true, since if the match was an inverse, it means |
1615 | * everything is allowed except what we match |
1489 | * everything is allowed except what we match |
1616 | */ |
1490 | */ |
… | |
… | |
1803 | free_artifact (artifact *at) |
1677 | free_artifact (artifact *at) |
1804 | { |
1678 | { |
1805 | if (at->next) free_artifact (at->next); |
1679 | if (at->next) free_artifact (at->next); |
1806 | if (at->allowed) free_charlinks (at->allowed); |
1680 | if (at->allowed) free_charlinks (at->allowed); |
1807 | |
1681 | |
1808 | at->item->destroy (1); |
1682 | at->item->destroy (true); |
1809 | |
1683 | |
1810 | sfree (at); |
1684 | sfree (at); |
1811 | } |
1685 | } |
1812 | |
1686 | |
1813 | void |
1687 | void |