1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
|
|
4 | * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
18 | * |
18 | * You should have received a copy of the GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * and the GNU General Public License along with this program. If not, see |
|
|
21 | * <http://www.gnu.org/licenses/>. |
20 | * |
22 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
24 | */ |
23 | |
25 | |
24 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
26 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
25 | * It is useful for finding bugs in the treasures file. Since it only |
27 | * It is useful for finding bugs in the treasures file. Since it only |
… | |
… | |
32 | |
34 | |
33 | //#define TREASURE_VERBOSE |
35 | //#define TREASURE_VERBOSE |
34 | |
36 | |
35 | #include <global.h> |
37 | #include <global.h> |
36 | #include <treasure.h> |
38 | #include <treasure.h> |
37 | #include <loader.h> |
39 | |
|
|
40 | #include <flat_hash_map.hpp> |
|
|
41 | |
|
|
42 | // used only by treasure.C, does not handle null arch ptrs |
|
|
43 | #define IS_ARCH(arch,name) ((arch)->archname == shstr_ ## name) |
38 | |
44 | |
39 | extern char *spell_mapping[]; |
45 | extern char *spell_mapping[]; |
40 | |
46 | |
41 | static treasurelist *first_treasurelist; |
47 | static treasurelist *first_treasurelist; |
42 | |
48 | |
43 | static void change_treasure (treasure *t, object *op); /* overrule default values */ |
49 | static void change_treasure (treasure *t, object *op); /* overrule default values */ |
44 | |
50 | |
45 | typedef std::tr1::unordered_map< |
51 | typedef ska::flat_hash_map |
|
|
52 | < |
46 | const char *, |
53 | const char *, |
47 | treasurelist *, |
54 | treasurelist *, |
48 | str_hash, |
55 | str_hash, |
49 | str_equal, |
56 | str_equal, |
50 | slice_allocator< std::pair<const char *const, treasurelist *> >, |
57 | slice_allocator< std::pair<const char *const, treasurelist *> > |
51 | true |
|
|
52 | > tl_map_t; |
58 | > tl_map_t; |
53 | |
59 | |
54 | static tl_map_t tl_map; |
60 | static tl_map_t tl_map; |
|
|
61 | |
|
|
62 | //TODO: class method |
|
|
63 | static void free_treasurestruct (treasure *t); // bleh desu |
|
|
64 | static void |
|
|
65 | clear (treasurelist *tl) |
|
|
66 | { |
|
|
67 | if (tl->items) |
|
|
68 | { |
|
|
69 | free_treasurestruct (tl->items); |
|
|
70 | tl->items = 0; |
|
|
71 | } |
|
|
72 | |
|
|
73 | tl->total_chance = 0; |
|
|
74 | } |
55 | |
75 | |
56 | /* |
76 | /* |
57 | * Searches for the given treasurelist |
77 | * Searches for the given treasurelist |
58 | */ |
78 | */ |
59 | treasurelist * |
79 | treasurelist * |
… | |
… | |
89 | |
109 | |
90 | tl_map.insert (std::make_pair (tl->name, tl)); |
110 | tl_map.insert (std::make_pair (tl->name, tl)); |
91 | } |
111 | } |
92 | |
112 | |
93 | return tl; |
113 | return tl; |
94 | } |
|
|
95 | |
|
|
96 | //TODO: class method |
|
|
97 | void |
|
|
98 | clear (treasurelist *tl) |
|
|
99 | { |
|
|
100 | if (tl->items) |
|
|
101 | { |
|
|
102 | free_treasurestruct (tl->items); |
|
|
103 | tl->items = 0; |
|
|
104 | } |
|
|
105 | |
|
|
106 | tl->total_chance = 0; |
|
|
107 | } |
114 | } |
108 | |
115 | |
109 | #ifdef TREASURE_DEBUG |
116 | #ifdef TREASURE_DEBUG |
110 | /* recursived checks the linked list. Treasurelist is passed only |
117 | /* recursived checks the linked list. Treasurelist is passed only |
111 | * so that the treasure name can be printed out |
118 | * so that the treasure name can be printed out |
… | |
… | |
255 | return; |
262 | return; |
256 | } |
263 | } |
257 | |
264 | |
258 | op->expand_tail (); |
265 | op->expand_tail (); |
259 | |
266 | |
|
|
267 | if (!creator->is_on_map () |
260 | if (!creator->is_on_map () || op->blocked (creator->map, creator->x, creator->y)) |
268 | || (op->weight && op->blocked (creator->map, creator->x, creator->y))) |
261 | op->destroy (); |
269 | op->destroy (); |
262 | else |
270 | else |
263 | { |
271 | { |
264 | SET_FLAG (op, FLAG_OBJ_ORIGINAL); |
272 | op->flag [FLAG_OBJ_ORIGINAL] = true; |
265 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
273 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
266 | } |
274 | } |
267 | } |
275 | } |
268 | else |
276 | else |
269 | { |
277 | { |
270 | op = creator->insert (op); |
278 | op = creator->insert (op); |
271 | |
279 | |
272 | if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) |
280 | if ((flags & GT_APPLY) && creator->flag [FLAG_MONSTER]) |
273 | monster_check_apply (creator, op); |
281 | monster_check_apply (creator, op); |
274 | } |
282 | } |
275 | } |
283 | } |
276 | |
284 | |
277 | /* if there are change_xxx commands in the treasure, we include the changes |
285 | /* if there are change_xxx commands in the treasure, we include the changes |
… | |
… | |
309 | } |
317 | } |
310 | else |
318 | else |
311 | { |
319 | { |
312 | if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE))) |
320 | if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE))) |
313 | { |
321 | { |
314 | object *tmp = arch_to_object (t->item); |
322 | object *tmp = t->item->instance (); |
315 | |
323 | |
316 | if (t->nrof && tmp->nrof <= 1) |
324 | if (t->nrof && tmp->nrof <= 1) |
317 | tmp->nrof = rndm (t->nrof) + 1; |
325 | tmp->nrof = rndm (t->nrof) + 1; |
318 | |
326 | |
319 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
327 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
… | |
… | |
366 | else if (t->nrof) |
374 | else if (t->nrof) |
367 | create_one_treasure (tl, op, flag, difficulty, tries); |
375 | create_one_treasure (tl, op, flag, difficulty, tries); |
368 | } |
376 | } |
369 | else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE)) |
377 | else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE)) |
370 | { |
378 | { |
371 | if (object *tmp = arch_to_object (t->item)) |
379 | if (object *tmp = t->item->instance ()) |
372 | { |
380 | { |
373 | if (t->nrof && tmp->nrof <= 1) |
381 | if (t->nrof && tmp->nrof <= 1) |
374 | tmp->nrof = rndm (t->nrof) + 1; |
382 | tmp->nrof = rndm (t->nrof) + 1; |
375 | |
383 | |
376 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
384 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
… | |
… | |
442 | |
450 | |
443 | if (ob->inv) |
451 | if (ob->inv) |
444 | LOG (llevError, "In generate treasure, created multiple objects.\n"); |
452 | LOG (llevError, "In generate treasure, created multiple objects.\n"); |
445 | |
453 | |
446 | ob->destroy (); |
454 | ob->destroy (); |
|
|
455 | |
447 | return tmp; |
456 | return tmp; |
448 | } |
457 | } |
449 | |
458 | |
450 | /* |
459 | /* |
451 | * This is a new way of calculating the chance for an item to have |
460 | * This is a new way of calculating the chance for an item to have |
… | |
… | |
488 | { 0, 0, 0, 3, 97}, // 29 |
497 | { 0, 0, 0, 3, 97}, // 29 |
489 | { 0, 0, 0, 0, 100}, // 30 |
498 | { 0, 0, 0, 0, 100}, // 30 |
490 | { 0, 0, 0, 0, 100}, // 31 |
499 | { 0, 0, 0, 0, 100}, // 31 |
491 | }; |
500 | }; |
492 | |
501 | |
493 | /* calculate the appropriate level for wands staves and scrolls. |
502 | /* calculate the appropriate level for wands staves and scrolls. |
494 | * This code presumes that op has had its spell object created (in op->inv) |
503 | * This code presumes that op has had its spell object created (in op->inv) |
495 | * |
504 | * |
496 | * elmex Wed Aug 9 17:44:59 CEST 2006: |
505 | * elmex Wed Aug 9 17:44:59 CEST 2006: |
497 | * Removed multiplicator, too many high-level items were generated on low-difficulty maps. |
506 | * Removed multiplicator, too many high-level items were generated on low-difficulty maps. |
498 | */ |
507 | */ |
499 | int |
508 | static int |
500 | level_for_item (const object *op, int difficulty) |
509 | level_for_item (const object *op, int difficulty) |
501 | { |
510 | { |
502 | if (!op->inv) |
511 | if (!op->inv) |
503 | { |
512 | { |
504 | LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name); |
513 | LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name); |
… | |
… | |
508 | int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.)); |
517 | int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.)); |
509 | |
518 | |
510 | if (olevel <= 0) |
519 | if (olevel <= 0) |
511 | olevel = rndm (1, op->inv->level); |
520 | olevel = rndm (1, op->inv->level); |
512 | |
521 | |
513 | return min (olevel, MAXLEVEL); |
522 | return min (olevel, MAXLEVEL_TREASURE); |
514 | } |
523 | } |
515 | |
524 | |
516 | /* |
525 | /* |
517 | * Based upon the specified difficulty and upon the difftomagic_list array, |
526 | * Based upon the specified difficulty and upon the difftomagic_list array, |
518 | * a random magical bonus is returned. This is used when determine |
527 | * a random magical bonus is returned. This is used when determine |
… | |
… | |
521 | * elmex Thu Aug 10 18:45:44 CEST 2006: |
530 | * elmex Thu Aug 10 18:45:44 CEST 2006: |
522 | * Scaling difficulty by max_level, as difficulty is a level and not some |
531 | * Scaling difficulty by max_level, as difficulty is a level and not some |
523 | * weird integer between 1-31. |
532 | * weird integer between 1-31. |
524 | * |
533 | * |
525 | */ |
534 | */ |
526 | int |
535 | static int |
527 | magic_from_difficulty (int difficulty) |
536 | magic_from_difficulty (int difficulty) |
528 | { |
537 | { |
529 | int percent = 0, magic = 0; |
|
|
530 | int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS); |
538 | int scaled_diff = lerp (difficulty, 0, settings.max_level, 0, DIFFLEVELS - 1); |
|
|
539 | scaled_diff = clamp (scaled_diff, 0, DIFFLEVELS - 1); |
531 | |
540 | |
532 | scaled_diff--; |
|
|
533 | |
|
|
534 | if (scaled_diff < 0) |
|
|
535 | scaled_diff = 0; |
|
|
536 | |
|
|
537 | if (scaled_diff >= DIFFLEVELS) |
|
|
538 | scaled_diff = DIFFLEVELS - 1; |
|
|
539 | |
|
|
540 | percent = rndm (100); |
541 | int percent = rndm (100); |
|
|
542 | int magic; |
541 | |
543 | |
542 | for (magic = 0; magic < (MAXMAGIC + 1); magic++) |
544 | for (magic = 0; magic <= MAXMAGIC; magic++) |
543 | { |
545 | { |
544 | percent -= difftomagic_list[scaled_diff][magic]; |
546 | percent -= difftomagic_list[scaled_diff][magic]; |
545 | |
547 | |
546 | if (percent < 0) |
548 | if (percent < 0) |
547 | break; |
549 | break; |
548 | } |
550 | } |
549 | |
551 | |
550 | if (magic == (MAXMAGIC + 1)) |
552 | if (magic > MAXMAGIC) |
551 | { |
553 | { |
552 | LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty); |
554 | LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty); |
553 | magic = 0; |
555 | magic = 0; |
554 | } |
556 | } |
555 | |
557 | |
… | |
… | |
563 | * Sets magical bonus in an object, and recalculates the effect on |
565 | * Sets magical bonus in an object, and recalculates the effect on |
564 | * the armour variable, and the effect on speed of armour. |
566 | * the armour variable, and the effect on speed of armour. |
565 | * This function doesn't work properly, should add use of archetypes |
567 | * This function doesn't work properly, should add use of archetypes |
566 | * to make it truly absolute. |
568 | * to make it truly absolute. |
567 | */ |
569 | */ |
568 | |
|
|
569 | void |
570 | void |
570 | set_abs_magic (object *op, int magic) |
571 | set_abs_magic (object *op, int magic) |
571 | { |
572 | { |
572 | if (!magic) |
573 | if (!magic) |
573 | return; |
574 | return; |
… | |
… | |
601 | */ |
602 | */ |
602 | |
603 | |
603 | static void |
604 | static void |
604 | set_magic (int difficulty, object *op, int max_magic, int flags) |
605 | set_magic (int difficulty, object *op, int max_magic, int flags) |
605 | { |
606 | { |
606 | int i; |
|
|
607 | |
|
|
608 | i = magic_from_difficulty (difficulty); |
607 | int i = magic_from_difficulty (difficulty); |
|
|
608 | |
609 | if ((flags & GT_ONLY_GOOD) && i < 0) |
609 | if ((flags & GT_ONLY_GOOD) && i < 0) |
610 | i = -i; |
610 | i = -i; |
|
|
611 | |
611 | if (i > max_magic) |
612 | i = min (i, max_magic); |
612 | i = max_magic; |
613 | |
613 | set_abs_magic (op, i); |
614 | set_abs_magic (op, i); |
614 | if (i < 0) |
615 | if (i < 0) |
615 | SET_FLAG (op, FLAG_CURSED); |
616 | op->set_flag (FLAG_CURSED); |
616 | } |
617 | } |
617 | |
618 | |
618 | /* |
619 | /* |
619 | * Randomly adds one magical ability to the given object. |
620 | * Randomly adds one magical ability to the given object. |
620 | * Modified for Partial Resistance in many ways: |
621 | * Modified for Partial Resistance in many ways: |
621 | * 1) Since rings can have multiple bonuses, if the same bonus |
622 | * 1) Since rings can have multiple bonuses, if the same bonus |
622 | * is rolled again, increase it - the bonuses now stack with |
623 | * is rolled again, increase it - the bonuses now stack with |
623 | * other bonuses previously rolled and ones the item might natively have. |
624 | * other bonuses previously rolled and ones the item might natively have. |
624 | * 2) Add code to deal with new PR method. |
625 | * 2) Add code to deal with new PR method. |
625 | */ |
626 | */ |
626 | void |
627 | static void |
627 | set_ring_bonus (object *op, int bonus) |
628 | set_ring_bonus (object *op, int bonus) |
628 | { |
629 | { |
629 | |
|
|
630 | int r = rndm (bonus > 0 ? 25 : 11); |
630 | int r = rndm (bonus > 0 ? 25 : 11); |
631 | |
631 | |
632 | if (op->type == AMULET) |
632 | if (op->type == AMULET) |
633 | { |
|
|
634 | if (!(rndm (21))) |
633 | if (!rndm (21)) |
635 | r = 20 + rndm (2); |
634 | r = 20 + rndm (2); |
|
|
635 | else if (rndm (2)) |
|
|
636 | r = 10; |
636 | else |
637 | else |
637 | { |
|
|
638 | if (rndm (2)) |
|
|
639 | r = 10; |
|
|
640 | else |
|
|
641 | r = 11 + rndm (9); |
638 | r = 11 + rndm (9); |
642 | } |
|
|
643 | } |
|
|
644 | |
639 | |
645 | switch (r) |
640 | switch (r) |
646 | { |
641 | { |
647 | /* Redone by MSW 2000-11-26 to have much less code. Also, |
642 | /* Redone by MSW 2000-11-26 to have much less code. Also, |
648 | * bonuses and penalties will stack and add to existing values. |
643 | * bonuses and penalties will stack and add to existing values. |
649 | * of the item. |
644 | * of the item. |
650 | */ |
645 | */ |
651 | case 0: |
646 | case 0: |
652 | case 1: |
647 | case 1: |
653 | case 2: |
648 | case 2: |
654 | case 3: |
649 | case 3: |
655 | case 4: |
650 | case 4: |
… | |
… | |
695 | * little random element in since that they don't always end up with |
690 | * little random element in since that they don't always end up with |
696 | * even values. |
691 | * even values. |
697 | */ |
692 | */ |
698 | if (bonus < 0) |
693 | if (bonus < 0) |
699 | val = 2 * -val - rndm (b); |
694 | val = 2 * -val - rndm (b); |
700 | if (val > 35) |
695 | |
701 | val = 35; /* Upper limit */ |
696 | val = min (35, val); /* Upper limit */ |
|
|
697 | |
702 | b = 0; |
698 | b = 0; |
703 | |
699 | |
704 | while (op->resist[resist_table[resist]] != 0 && b < 4) |
700 | while (op->resist[resist_table[resist]] != 0 && b < 4) |
705 | resist = rndm (num_resist_table); |
701 | resist = rndm (num_resist_table); |
706 | |
702 | |
… | |
… | |
714 | break; |
710 | break; |
715 | } |
711 | } |
716 | case 20: |
712 | case 20: |
717 | if (op->type == AMULET) |
713 | if (op->type == AMULET) |
718 | { |
714 | { |
719 | SET_FLAG (op, FLAG_REFL_SPELL); |
715 | op->set_flag (FLAG_REFL_SPELL); |
720 | op->value *= 11; |
716 | op->value *= 11; |
721 | } |
717 | } |
722 | else |
718 | else |
723 | { |
719 | { |
724 | op->stats.hp = 1; /* regenerate hit points */ |
720 | op->stats.hp = 1; /* regenerate hit points */ |
… | |
… | |
727 | break; |
723 | break; |
728 | |
724 | |
729 | case 21: |
725 | case 21: |
730 | if (op->type == AMULET) |
726 | if (op->type == AMULET) |
731 | { |
727 | { |
732 | SET_FLAG (op, FLAG_REFL_MISSILE); |
728 | op->set_flag (FLAG_REFL_MISSILE); |
733 | op->value *= 9; |
729 | op->value *= 9; |
734 | } |
730 | } |
735 | else |
731 | else |
736 | { |
732 | { |
737 | op->stats.sp = 1; /* regenerate spell points */ |
733 | op->stats.sp = 1; /* regenerate spell points */ |
… | |
… | |
739 | } |
735 | } |
740 | break; |
736 | break; |
741 | |
737 | |
742 | case 22: |
738 | case 22: |
743 | op->stats.exp += bonus; /* Speed! */ |
739 | op->stats.exp += bonus; /* Speed! */ |
744 | op->value = (op->value * 2) / 3; |
740 | op->value = op->value * 2 / 3; |
745 | break; |
741 | break; |
746 | } |
742 | } |
747 | |
743 | |
748 | if (bonus > 0) |
744 | if (bonus > 0) |
749 | op->value *= 2 * bonus; |
745 | op->value = 2 * op->value * bonus; |
750 | else |
746 | else |
751 | op->value = -(op->value * 2 * bonus) / 3; |
747 | op->value = -2 * op->value * bonus / 3; |
752 | } |
748 | } |
753 | |
749 | |
754 | /* |
750 | /* |
755 | * get_magic(diff) will return a random number between 0 and 4. |
751 | * get_magic(diff) will return a random number between 0 and 4. |
756 | * diff can be any value above 2. The higher the diff-variable, the |
752 | * diff can be any value above 2. The higher the diff-variable, the |
757 | * higher is the chance of returning a low number. |
753 | * higher is the chance of returning a low number. |
758 | * It is only used in fix_generated_treasure() to set bonuses on |
754 | * It is only used in fix_generated_treasure() to set bonuses on |
759 | * rings and amulets. |
755 | * rings and amulets. |
760 | * Another scheme is used to calculate the magic of weapons and armours. |
756 | * Another scheme is used to calculate the magic of weapons and armours. |
761 | */ |
757 | */ |
762 | int |
758 | static int |
763 | get_magic (int diff) |
759 | get_magic (int diff) |
764 | { |
760 | { |
765 | int i; |
761 | diff = min (3, diff); |
766 | |
762 | |
767 | if (diff < 3) |
|
|
768 | diff = 3; |
|
|
769 | |
|
|
770 | for (i = 0; i < 4; i++) |
763 | for (int i = 0; i < 4; i++) |
771 | if (rndm (diff)) |
764 | if (rndm (diff)) |
772 | return i; |
765 | return i; |
773 | |
766 | |
774 | return 4; |
767 | return 4; |
775 | } |
768 | } |
776 | |
769 | |
|
|
770 | /* special_potion() - so that old potion code is still done right. */ |
|
|
771 | static int |
|
|
772 | special_potion (object *op) |
|
|
773 | { |
|
|
774 | if (op->attacktype) |
|
|
775 | return 1; |
|
|
776 | |
|
|
777 | if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha) |
|
|
778 | return 1; |
|
|
779 | |
|
|
780 | for (int i = 0; i < NROFATTACKS; i++) |
|
|
781 | if (op->resist[i]) |
|
|
782 | return 1; |
|
|
783 | |
|
|
784 | return 0; |
|
|
785 | } |
|
|
786 | |
|
|
787 | static double |
|
|
788 | value_factor_from_spell_item (object *spell, object *item) |
|
|
789 | { |
|
|
790 | double factor = |
|
|
791 | pow ((spell->value > 0 ? spell->value : 1) |
|
|
792 | * spell->level, 1.5); |
|
|
793 | |
|
|
794 | if (item) // this if for: wands/staffs/rods: |
|
|
795 | { |
|
|
796 | /* Old crossfire comment ahead: |
|
|
797 | * Add 50 to both level an divisor to keep prices a little more |
|
|
798 | * reasonable. Otherwise, a high level version of a low level |
|
|
799 | * spell can be worth tons a money (eg, level 20 rod, level 2 spell = |
|
|
800 | * 10 time multiplier). This way, the value are a bit more reasonable. |
|
|
801 | */ |
|
|
802 | |
|
|
803 | factor *= item->level + 50; |
|
|
804 | factor /= item->inv->level + 50; |
|
|
805 | } |
|
|
806 | |
|
|
807 | return factor; |
|
|
808 | } |
|
|
809 | |
777 | #define DICE2 (get_magic(2)==2?2:1) |
810 | #define DICE2 (get_magic(2) == 2 ? 2 : 1) |
778 | #define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3)) |
811 | #define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3)) |
779 | |
812 | |
780 | /* |
813 | /* |
781 | * fix_generated_item(): This is called after an item is generated, in |
814 | * fix_generated_item(): This is called after an item is generated, in |
782 | * order to set it up right. This produced magical bonuses, puts spells |
815 | * order to set it up right. This produced magical bonuses, puts spells |
783 | * into scrolls/books/wands, makes it unidentified, hides the value, etc. |
816 | * into scrolls/books/wands, makes it unidentified, hides the value, etc. |
784 | */ |
817 | */ |
785 | |
818 | |
786 | /* 4/28/96 added creator object from which op may now inherit properties based on |
819 | /* 4/28/96 added creator object from which op may now inherit properties based on |
787 | * op->type. Right now, which stuff the creator passes on is object type |
820 | * op->type. Right now, which stuff the creator passes on is object type |
788 | * dependant. I know this is a spagetti manuever, but is there a cleaner |
821 | * dependant. I know this is a spagetti manuever, but is there a cleaner |
789 | * way to do this? b.t. */ |
822 | * way to do this? b.t. */ |
790 | |
823 | |
791 | /* |
824 | /* |
792 | * ! (flags & GT_ENVIRONMENT): |
825 | * ! (flags & GT_ENVIRONMENT): |
793 | * Automatically calls fix_flesh_item(). |
826 | * Automatically calls fix_flesh_item(). |
… | |
… | |
816 | create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0); |
849 | create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0); |
817 | /* So the treasure doesn't get created again */ |
850 | /* So the treasure doesn't get created again */ |
818 | op->randomitems = 0; |
851 | op->randomitems = 0; |
819 | } |
852 | } |
820 | |
853 | |
821 | if (difficulty < 1) |
854 | max_it (difficulty, 1); |
822 | difficulty = 1; |
|
|
823 | |
855 | |
824 | if (INVOKE_OBJECT (ADD_BONUS, op, |
856 | if (INVOKE_OBJECT (ADD_BONUS, op, |
825 | ARG_OBJECT (creator != op ? creator : 0), |
857 | ARG_OBJECT (creator != op ? creator : 0), |
826 | ARG_INT (difficulty), ARG_INT (max_magic), |
858 | ARG_INT (difficulty), ARG_INT (max_magic), |
827 | ARG_INT (flags))) |
859 | ARG_INT (flags))) |
… | |
… | |
886 | * again below */ |
918 | * again below */ |
887 | } |
919 | } |
888 | } |
920 | } |
889 | |
921 | |
890 | /* materialtype modifications. Note we allow this on artifacts. */ |
922 | /* materialtype modifications. Note we allow this on artifacts. */ |
891 | set_materialname (op, difficulty, NULL); |
923 | select_material (op, difficulty); |
892 | |
924 | |
893 | if (flags & GT_MINIMAL) |
925 | if (flags & GT_MINIMAL) |
894 | { |
926 | { |
895 | if (op->type == POTION) |
927 | if (op->type == POTION) |
896 | /* Handle healing and magic power potions */ |
928 | /* Handle healing and magic power potions */ |
897 | if (op->stats.sp && !op->randomitems) |
929 | if (op->stats.sp && !op->randomitems) |
898 | { |
930 | { |
899 | object *tmp = get_archetype (spell_mapping [op->stats.sp]); |
931 | object *tmp = archetype::get (spell_mapping [op->stats.sp]); |
900 | insert_ob_in_ob (tmp, op); |
932 | insert_ob_in_ob (tmp, op); |
901 | op->stats.sp = 0; |
933 | op->stats.sp = 0; |
902 | } |
934 | } |
903 | } |
935 | } |
904 | else if (!op->title) /* Only modify object if not special */ |
936 | else if (!op->title) /* Only modify object if not special */ |
… | |
… | |
907 | case WEAPON: |
939 | case WEAPON: |
908 | case ARMOUR: |
940 | case ARMOUR: |
909 | case SHIELD: |
941 | case SHIELD: |
910 | case HELMET: |
942 | case HELMET: |
911 | case CLOAK: |
943 | case CLOAK: |
912 | if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4))) |
944 | if (op->flag [FLAG_CURSED] && !(rndm (4))) |
913 | set_ring_bonus (op, -DICE2); |
945 | set_ring_bonus (op, -DICE2); |
914 | break; |
946 | break; |
915 | |
947 | |
916 | case BRACERS: |
948 | case BRACERS: |
917 | if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)) |
949 | if (!rndm (op->flag [FLAG_CURSED] ? 5 : 20)) |
918 | { |
950 | { |
919 | set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2); |
951 | set_ring_bonus (op, op->flag [FLAG_CURSED] ? -DICE2 : DICE2); |
920 | if (!QUERY_FLAG (op, FLAG_CURSED)) |
952 | if (!op->flag [FLAG_CURSED]) |
921 | op->value *= 3; |
953 | op->value *= 3; |
922 | } |
954 | } |
923 | break; |
955 | break; |
924 | |
956 | |
925 | case POTION: |
957 | case POTION: |
926 | { |
958 | { |
927 | int too_many_tries = 0, is_special = 0; |
959 | int too_many_tries = 0; |
928 | |
960 | |
929 | /* Handle healing and magic power potions */ |
961 | /* Handle healing and magic power potions */ |
930 | if (op->stats.sp && !op->randomitems) |
962 | if (op->stats.sp && !op->randomitems) |
931 | { |
963 | { |
932 | object *tmp; |
|
|
933 | |
|
|
934 | tmp = get_archetype (spell_mapping[op->stats.sp]); |
964 | object *tmp = archetype::get (spell_mapping[op->stats.sp]); |
935 | insert_ob_in_ob (tmp, op); |
965 | insert_ob_in_ob (tmp, op); |
936 | op->stats.sp = 0; |
966 | op->stats.sp = 0; |
937 | } |
967 | } |
938 | |
968 | |
939 | while (!(is_special = special_potion (op)) && !op->inv) |
969 | while (!special_potion (op) && !op->inv) |
940 | { |
970 | { |
941 | generate_artifact (op, difficulty); |
971 | generate_artifact (op, difficulty); |
942 | if (too_many_tries++ > 10) |
972 | if (too_many_tries++ > 10) |
943 | break; |
973 | break; |
944 | } |
974 | } |
… | |
… | |
947 | * since the value set on those is already correct. |
977 | * since the value set on those is already correct. |
948 | */ |
978 | */ |
949 | if (op->inv && op->randomitems) |
979 | if (op->inv && op->randomitems) |
950 | { |
980 | { |
951 | /* value multiplier is same as for scrolls */ |
981 | /* value multiplier is same as for scrolls */ |
952 | op->value = (op->value * op->inv->value); |
982 | op->value *= op->inv->value; |
953 | op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty); |
983 | op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty); |
954 | } |
984 | } |
955 | else |
985 | else |
956 | { |
986 | { |
957 | op->name = "potion"; |
987 | op->name = shstr_potion; |
958 | op->name_pl = "potions"; |
988 | op->name_pl = shstr_potions; |
959 | } |
989 | } |
960 | |
990 | |
961 | if (!(flags & GT_ONLY_GOOD) && rndm (2)) |
991 | if (!(flags & GT_ONLY_GOOD) && rndm (2)) |
962 | SET_FLAG (op, FLAG_CURSED); |
992 | op->set_flag (FLAG_CURSED); |
|
|
993 | |
963 | break; |
994 | break; |
964 | } |
995 | } |
965 | |
996 | |
966 | case AMULET: |
997 | case AMULET: |
967 | if (IS_ARCH (op->arch, amulet)) |
998 | if (IS_ARCH (op->arch, amulet)) |
968 | op->value *= 5; /* Since it's not just decoration */ |
999 | op->value *= 5; /* Since it's not just decoration */ |
969 | |
1000 | |
970 | case RING: |
1001 | case RING: |
971 | if (!op->arch) // wtf? schmorp |
|
|
972 | { |
|
|
973 | op->destroy (); |
|
|
974 | op = 0; |
|
|
975 | break; |
|
|
976 | } |
|
|
977 | |
|
|
978 | if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */ |
1002 | if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */ |
979 | break; |
1003 | break; |
980 | |
1004 | |
981 | if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) |
1005 | if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) |
982 | SET_FLAG (op, FLAG_CURSED); |
1006 | op->set_flag (FLAG_CURSED); |
983 | |
1007 | |
984 | set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2); |
1008 | set_ring_bonus (op, op->flag [FLAG_CURSED] ? -DICE2 : DICE2); |
985 | |
1009 | |
986 | if (op->type != RING) /* Amulets have only one ability */ |
1010 | if (op->type != RING) /* Amulets have only one ability */ |
987 | break; |
1011 | break; |
988 | |
1012 | |
989 | if (!(rndm (4))) |
1013 | if (!rndm (4)) |
990 | { |
1014 | { |
991 | int d = (rndm (2) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2; |
1015 | int d = (rndm (2) || op->flag [FLAG_CURSED]) ? -DICE2 : DICE2; |
992 | |
1016 | |
993 | if (d > 0) |
1017 | if (d > 0) |
994 | op->value *= 3; |
1018 | op->value *= 3; |
995 | |
1019 | |
996 | set_ring_bonus (op, d); |
1020 | set_ring_bonus (op, d); |
997 | |
1021 | |
998 | if (!(rndm (4))) |
1022 | if (!rndm (4)) |
999 | { |
1023 | { |
1000 | int d = (rndm (3) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2; |
1024 | int d = (rndm (3) || op->flag [FLAG_CURSED]) ? -DICE2 : DICE2; |
1001 | |
1025 | |
1002 | if (d > 0) |
1026 | if (d > 0) |
1003 | op->value *= 5; |
1027 | op->value *= 5; |
|
|
1028 | |
1004 | set_ring_bonus (op, d); |
1029 | set_ring_bonus (op, d); |
1005 | } |
1030 | } |
1006 | } |
1031 | } |
1007 | |
1032 | |
1008 | if (GET_ANIM_ID (op)) |
1033 | if (op->animation_id) |
1009 | SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op))); |
1034 | op->set_anim_frame (rndm (op->anim_frames ())); |
1010 | |
1035 | |
1011 | break; |
1036 | break; |
1012 | |
1037 | |
1013 | case BOOK: |
1038 | case BOOK: |
1014 | /* Is it an empty book?, if yes lets make a special· |
1039 | /* Is it an empty book?, if yes lets make a special· |
… | |
… | |
1016 | * creator and/or map level we found it on. |
1041 | * creator and/or map level we found it on. |
1017 | */ |
1042 | */ |
1018 | if (!op->msg && rndm (10)) |
1043 | if (!op->msg && rndm (10)) |
1019 | { |
1044 | { |
1020 | /* set the book level properly */ |
1045 | /* set the book level properly */ |
1021 | if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE)) |
1046 | if (creator->level == 0 || creator->flag [FLAG_ALIVE]) |
1022 | { |
1047 | { |
1023 | if (op->map && op->map->difficulty) |
1048 | if (op->map && op->map->difficulty) |
1024 | op->level = rndm (op->map->difficulty) + rndm (10) + 1; |
1049 | op->level = rndm (op->map->difficulty) + rndm (10) + 1; |
1025 | else |
1050 | else |
1026 | op->level = rndm (20) + 1; |
1051 | op->level = rndm (20) + 1; |
… | |
… | |
1029 | op->level = rndm (creator->level); |
1054 | op->level = rndm (creator->level); |
1030 | |
1055 | |
1031 | tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1); |
1056 | tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1); |
1032 | /* books w/ info are worth more! */ |
1057 | /* books w/ info are worth more! */ |
1033 | op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1)); |
1058 | op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1)); |
1034 | /* creator related stuff */ |
|
|
1035 | |
|
|
1036 | /* for library, chained books. Note that some monsters have no_pick |
|
|
1037 | * set - we don't want to set no pick in that case. |
|
|
1038 | */ |
|
|
1039 | if (QUERY_FLAG (creator, FLAG_NO_PICK) && !QUERY_FLAG (creator, FLAG_MONSTER)) |
|
|
1040 | SET_FLAG (op, FLAG_NO_PICK); |
|
|
1041 | if (creator->slaying && !op->slaying) /* for check_inv floors */ |
|
|
1042 | op->slaying = creator->slaying; |
|
|
1043 | |
1059 | |
1044 | /* add exp so reading it gives xp (once) */ |
1060 | /* add exp so reading it gives xp (once) */ |
1045 | op->stats.exp = op->value > 10000 ? op->value / 5 : op->value / 10; |
1061 | op->stats.exp = op->value > 10000 ? op->value / 5 : op->value / 10; |
1046 | } |
1062 | } |
|
|
1063 | |
|
|
1064 | /* creator related stuff */ |
|
|
1065 | |
|
|
1066 | /* for library, chained books. Note that some monsters have no_pick |
|
|
1067 | * set - we don't want to set no pick in that case. |
|
|
1068 | */ |
|
|
1069 | if (creator->flag [FLAG_NO_PICK] && !creator->flag [FLAG_MONSTER]) |
|
|
1070 | op->set_flag (FLAG_NO_PICK); |
|
|
1071 | if (creator->slaying && !op->slaying) /* for check_inv floors */ |
|
|
1072 | op->slaying = creator->slaying; |
1047 | break; |
1073 | break; |
1048 | |
1074 | |
1049 | case SPELLBOOK: |
1075 | case SPELLBOOK: |
1050 | op->value = op->value * op->inv->value; |
1076 | op->value *= value_factor_from_spell_item (op->inv, 0); |
|
|
1077 | |
1051 | /* add exp so learning gives xp */ |
1078 | /* add exp so learning gives xp */ |
1052 | op->level = op->inv->level; |
1079 | op->level = op->inv->level; |
1053 | op->stats.exp = op->value; |
1080 | op->stats.exp = op->value; |
1054 | break; |
1081 | break; |
1055 | |
1082 | |
… | |
… | |
1059 | * and reset nrof. |
1086 | * and reset nrof. |
1060 | */ |
1087 | */ |
1061 | op->stats.food = op->inv->nrof; |
1088 | op->stats.food = op->inv->nrof; |
1062 | op->nrof = 1; |
1089 | op->nrof = 1; |
1063 | /* If the spell changes by level, choose a random level |
1090 | /* If the spell changes by level, choose a random level |
1064 | * for it, and adjust price. If the spell doesn't |
1091 | * for it. |
1065 | * change by level, just set the wand to the level of |
|
|
1066 | * the spell, and value calculation is simpler. |
|
|
1067 | */ |
1092 | */ |
1068 | if (op->inv->duration_modifier || op->inv->dam_modifier || op->inv->range_modifier) |
1093 | if (op->inv->duration_modifier |
1069 | { |
1094 | || op->inv->dam_modifier |
|
|
1095 | || op->inv->range_modifier) |
1070 | op->level = level_for_item (op, difficulty); |
1096 | op->level = level_for_item (op, difficulty); |
1071 | op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50); |
|
|
1072 | } |
|
|
1073 | else |
1097 | else |
1074 | { |
|
|
1075 | op->level = op->inv->level; |
1098 | op->level = op->inv->level; |
1076 | op->value = op->value * op->inv->value; |
1099 | |
1077 | } |
1100 | op->value *= value_factor_from_spell_item (op->inv, op); |
1078 | break; |
1101 | break; |
1079 | |
1102 | |
1080 | case ROD: |
1103 | case ROD: |
1081 | op->level = level_for_item (op, difficulty); |
1104 | op->level = level_for_item (op, difficulty); |
1082 | /* Add 50 to both level an divisor to keep prices a little more |
1105 | op->value *= value_factor_from_spell_item (op->inv, op); |
1083 | * reasonable. Otherwise, a high level version of a low level |
1106 | |
1084 | * spell can be worth tons a money (eg, level 20 rod, level 2 spell = |
|
|
1085 | * 10 time multiplier). This way, the value are a bit more reasonable. |
|
|
1086 | */ |
|
|
1087 | op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50); |
|
|
1088 | /* maxhp is used to denote how many 'charges' the rod holds before */ |
1107 | /* maxhp is used to denote how many 'charges' the rod holds before */ |
1089 | if (op->stats.maxhp) |
1108 | if (op->stats.maxhp) |
1090 | op->stats.maxhp *= MAX (op->inv->stats.sp, op->inv->stats.grace); |
1109 | op->stats.maxhp *= max (op->inv->stats.sp, op->inv->stats.grace); |
1091 | else |
1110 | else |
1092 | op->stats.maxhp = 2 * MAX (op->inv->stats.sp, op->inv->stats.grace); |
1111 | op->stats.maxhp = 2 * max (op->inv->stats.sp, op->inv->stats.grace); |
1093 | |
1112 | |
1094 | op->stats.hp = op->stats.maxhp; |
1113 | op->stats.hp = op->stats.maxhp; |
1095 | break; |
1114 | break; |
1096 | |
1115 | |
1097 | case SCROLL: |
1116 | case SCROLL: |
1098 | op->level = level_for_item (op, difficulty); |
1117 | op->level = level_for_item (op, difficulty); |
1099 | op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50); |
1118 | op->value *= value_factor_from_spell_item (op->inv, op); |
1100 | |
1119 | |
1101 | /* add exp so reading them properly gives xp */ |
1120 | /* add exp so reading them properly gives xp */ |
1102 | op->stats.exp = op->value / 5; |
1121 | op->stats.exp = op->value / 5; |
1103 | op->nrof = op->inv->nrof; |
1122 | op->nrof = op->inv->nrof; |
1104 | break; |
1123 | break; |
… | |
… | |
1112 | break; |
1131 | break; |
1113 | } /* switch type */ |
1132 | } /* switch type */ |
1114 | |
1133 | |
1115 | if (flags & GT_STARTEQUIP) |
1134 | if (flags & GT_STARTEQUIP) |
1116 | { |
1135 | { |
1117 | if (op->nrof < 2 && op->type != CONTAINER && op->type != MONEY && !QUERY_FLAG (op, FLAG_IS_THROWN)) |
1136 | if (op->nrof < 2 && op->type != CONTAINER && op->type != MONEY && !op->flag [FLAG_IS_THROWN]) |
1118 | SET_FLAG (op, FLAG_STARTEQUIP); |
1137 | op->set_flag (FLAG_STARTEQUIP); |
1119 | else if (op->type != MONEY) |
1138 | else if (op->type != MONEY) |
1120 | op->value = 0; |
1139 | op->value = 0; |
1121 | } |
1140 | } |
1122 | |
1141 | |
1123 | if (!(flags & GT_ENVIRONMENT)) |
1142 | if (!(flags & GT_ENVIRONMENT)) |
… | |
… | |
1134 | |
1153 | |
1135 | /* |
1154 | /* |
1136 | * Allocate and return the pointer to an empty artifactlist structure. |
1155 | * Allocate and return the pointer to an empty artifactlist structure. |
1137 | */ |
1156 | */ |
1138 | static artifactlist * |
1157 | static artifactlist * |
1139 | get_empty_artifactlist (void) |
1158 | get_empty_artifactlist () |
1140 | { |
1159 | { |
1141 | return salloc0<artifactlist> (); |
1160 | return salloc0<artifactlist> (); |
1142 | } |
1161 | } |
1143 | |
1162 | |
1144 | /* |
1163 | /* |
1145 | * Allocate and return the pointer to an empty artifact structure. |
1164 | * Allocate and return the pointer to an empty artifact structure. |
1146 | */ |
1165 | */ |
1147 | static artifact * |
1166 | static artifact * |
1148 | get_empty_artifact (void) |
1167 | get_empty_artifact () |
1149 | { |
1168 | { |
1150 | return salloc0<artifact> (); |
1169 | return salloc0<artifact> (); |
1151 | } |
1170 | } |
1152 | |
1171 | |
1153 | /* |
1172 | /* |
… | |
… | |
1166 | |
1185 | |
1167 | /* |
1186 | /* |
1168 | * Builds up the lists of artifacts from the file in the libdir. |
1187 | * Builds up the lists of artifacts from the file in the libdir. |
1169 | */ |
1188 | */ |
1170 | void |
1189 | void |
1171 | init_artifacts (void) |
1190 | init_artifacts () |
1172 | { |
1191 | { |
1173 | static int has_been_inited = 0; |
1192 | static int has_been_inited = 0; |
1174 | char filename[MAX_BUF]; |
|
|
1175 | artifact *art = NULL; |
1193 | artifact *art = NULL; |
1176 | artifactlist *al; |
1194 | artifactlist *al; |
1177 | |
1195 | |
1178 | if (has_been_inited) |
1196 | if (has_been_inited) |
1179 | return; |
1197 | return; |
1180 | else |
1198 | else |
1181 | has_been_inited = 1; |
1199 | has_been_inited = 1; |
1182 | |
1200 | |
1183 | sprintf (filename, "%s/artifacts", settings.datadir); |
1201 | object_thawer f (settings.datadir, "artifacts"); |
1184 | object_thawer f (filename); |
|
|
1185 | |
1202 | |
1186 | if (!f) |
1203 | if (!f) |
1187 | return; |
1204 | return; |
1188 | |
1205 | |
1189 | for (;;) |
1206 | for (;;) |
… | |
… | |
1196 | |
1213 | |
1197 | { |
1214 | { |
1198 | if (!strcmp (f.get_str (), "all")) |
1215 | if (!strcmp (f.get_str (), "all")) |
1199 | break; |
1216 | break; |
1200 | |
1217 | |
1201 | char *next, *cp = f.get_str (); |
1218 | const char *cp = f.get_str (); |
1202 | |
1219 | char *next; |
1203 | do |
1220 | do |
1204 | { |
1221 | { |
1205 | if ((next = strchr (cp, ','))) |
1222 | if ((next = (char *)strchr (cp, ','))) |
1206 | *next++ = '\0'; |
1223 | *next++ = '\0'; |
1207 | |
1224 | |
1208 | linked_char *tmp = new linked_char; |
1225 | linked_char *tmp = new linked_char; |
1209 | |
1226 | |
1210 | tmp->name = cp; |
1227 | tmp->name = cp; |
… | |
… | |
1274 | } |
1291 | } |
1275 | #if 0 |
1292 | #if 0 |
1276 | LOG (llevDebug, "Artifact list type %d has %d total chance\n", al->type, al->total_chance); |
1293 | LOG (llevDebug, "Artifact list type %d has %d total chance\n", al->type, al->total_chance); |
1277 | #endif |
1294 | #endif |
1278 | } |
1295 | } |
1279 | |
|
|
1280 | LOG (llevDebug, "done.\n"); |
|
|
1281 | } |
1296 | } |
1282 | |
1297 | |
1283 | /* |
1298 | /* |
1284 | * Used in artifact generation. The bonuses of the first object |
1299 | * Used in artifact generation. The bonuses of the first object |
1285 | * is modified by the bonuses of the second object. |
1300 | * is modified by the bonuses of the second object. |
1286 | */ |
1301 | */ |
1287 | void |
1302 | void |
1288 | add_abilities (object *op, object *change) |
1303 | add_abilities (object *op, object *change) |
1289 | { |
1304 | { |
1290 | int i, tmp; |
|
|
1291 | |
|
|
1292 | if (change->face != blank_face) |
1305 | if (change->face != blank_face) |
1293 | { |
|
|
1294 | #ifdef TREASURE_VERBOSE |
|
|
1295 | LOG (llevDebug, "add_abilities change face: %d\n", change->face); |
|
|
1296 | #endif |
|
|
1297 | op->face = change->face; |
1306 | op->face = change->face; |
1298 | } |
|
|
1299 | |
1307 | |
1300 | for (i = 0; i < NUM_STATS; i++) |
1308 | for (int i = 0; i < NUM_STATS; i++) |
1301 | change_attr_value (&(op->stats), i, change->stats.stat (i)); |
1309 | change_attr_value (&(op->stats), i, change->stats.stat (i)); |
1302 | |
1310 | |
1303 | op->attacktype |= change->attacktype; |
1311 | op->attacktype |= change->attacktype; |
1304 | op->path_attuned |= change->path_attuned; |
1312 | op->path_attuned |= change->path_attuned; |
1305 | op->path_repelled |= change->path_repelled; |
1313 | op->path_repelled |= change->path_repelled; |
1306 | op->path_denied |= change->path_denied; |
1314 | op->path_denied |= change->path_denied; |
1307 | op->move_type |= change->move_type; |
1315 | op->move_type |= change->move_type; |
1308 | op->stats.luck += change->stats.luck; |
1316 | op->stats.luck += change->stats.luck; |
1309 | |
1317 | |
1310 | if (QUERY_FLAG (change, FLAG_CURSED)) |
1318 | static const struct copyflags : object::flags_t |
1311 | SET_FLAG (op, FLAG_CURSED); |
1319 | { |
1312 | if (QUERY_FLAG (change, FLAG_DAMNED)) |
1320 | copyflags () |
1313 | SET_FLAG (op, FLAG_DAMNED); |
1321 | { |
1314 | if ((QUERY_FLAG (change, FLAG_CURSED) || QUERY_FLAG (change, FLAG_DAMNED)) && op->magic > 0) |
1322 | set (FLAG_CURSED); |
|
|
1323 | set (FLAG_DAMNED); |
|
|
1324 | set (FLAG_LIFESAVE); |
|
|
1325 | set (FLAG_REFL_SPELL); |
|
|
1326 | set (FLAG_STEALTH); |
|
|
1327 | set (FLAG_XRAYS); |
|
|
1328 | set (FLAG_BLIND); |
|
|
1329 | set (FLAG_SEE_IN_DARK); |
|
|
1330 | set (FLAG_REFL_MISSILE); |
|
|
1331 | set (FLAG_MAKE_INVIS); |
|
|
1332 | } |
|
|
1333 | } copyflags; |
|
|
1334 | |
|
|
1335 | // we might want to just copy, but or'ing is what the original code did |
|
|
1336 | op->flag |= change->flag & copyflags; |
|
|
1337 | |
|
|
1338 | if ((change->flag [FLAG_CURSED] || change->flag [FLAG_DAMNED]) && op->magic > 0) |
1315 | set_abs_magic (op, -op->magic); |
1339 | set_abs_magic (op, -op->magic); |
1316 | |
1340 | |
1317 | if (QUERY_FLAG (change, FLAG_LIFESAVE)) |
1341 | if (change->flag [FLAG_STAND_STILL]) |
1318 | SET_FLAG (op, FLAG_LIFESAVE); |
|
|
1319 | if (QUERY_FLAG (change, FLAG_REFL_SPELL)) |
|
|
1320 | SET_FLAG (op, FLAG_REFL_SPELL); |
|
|
1321 | if (QUERY_FLAG (change, FLAG_STEALTH)) |
|
|
1322 | SET_FLAG (op, FLAG_STEALTH); |
|
|
1323 | if (QUERY_FLAG (change, FLAG_XRAYS)) |
|
|
1324 | SET_FLAG (op, FLAG_XRAYS); |
|
|
1325 | if (QUERY_FLAG (change, FLAG_BLIND)) |
|
|
1326 | SET_FLAG (op, FLAG_BLIND); |
|
|
1327 | if (QUERY_FLAG (change, FLAG_SEE_IN_DARK)) |
|
|
1328 | SET_FLAG (op, FLAG_SEE_IN_DARK); |
|
|
1329 | if (QUERY_FLAG (change, FLAG_REFL_MISSILE)) |
|
|
1330 | SET_FLAG (op, FLAG_REFL_MISSILE); |
|
|
1331 | if (QUERY_FLAG (change, FLAG_MAKE_INVIS)) |
|
|
1332 | SET_FLAG (op, FLAG_MAKE_INVIS); |
|
|
1333 | |
|
|
1334 | if (QUERY_FLAG (change, FLAG_STAND_STILL)) |
|
|
1335 | { |
1342 | { |
1336 | CLEAR_FLAG (op, FLAG_ANIMATE); |
1343 | op->clr_flag (FLAG_ANIMATE); |
|
|
1344 | |
1337 | /* so artifacts will join */ |
1345 | /* so artifacts will join */ |
1338 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1346 | if (!op->flag [FLAG_ALIVE]) |
1339 | op->speed = 0.0; |
1347 | op->speed = 0.; |
1340 | |
1348 | |
1341 | op->set_speed (op->speed); |
1349 | op->set_speed (op->speed); |
1342 | } |
1350 | } |
1343 | |
1351 | |
1344 | if (change->nrof) |
1352 | if (change->nrof) |
1345 | op->nrof = rndm (change->nrof) + 1; |
1353 | op->nrof = rndm (change->nrof) + 1; |
1346 | |
1354 | |
1347 | op->stats.exp += change->stats.exp; /* Speed modifier */ |
1355 | op->stats.exp += change->stats.exp; /* Speed modifier */ |
1348 | op->stats.wc += change->stats.wc; |
1356 | op->stats.wc += change->stats.wc; |
1349 | op->stats.ac += change->stats.ac; |
1357 | op->stats.ac += change->stats.ac; |
1350 | |
1358 | |
1351 | if (change->other_arch) |
1359 | if (change->other_arch) |
1352 | { |
1360 | { |
1353 | /* Basically, for horns & potions, the other_arch field is the spell |
1361 | /* Basically, for horns & potions, the other_arch field is the spell |
1354 | * to cast. So convert that to into a spell and put it into |
1362 | * to cast. So convert that to into a spell and put it into |
1355 | * this object. |
1363 | * this object. |
1356 | */ |
1364 | */ |
1357 | if (op->type == HORN || op->type == POTION) |
1365 | if (op->type == HORN || op->type == POTION) |
1358 | { |
1366 | { |
1359 | object *tmp_obj; |
|
|
1360 | |
|
|
1361 | /* Remove any spells this object currently has in it */ |
1367 | /* Remove any spells this object currently has in it */ |
1362 | while (op->inv) |
|
|
1363 | op->inv->destroy (); |
1368 | op->destroy_inv (false); |
1364 | |
1369 | |
1365 | tmp_obj = arch_to_object (change->other_arch); |
1370 | object *tmp = change->other_arch->instance (); |
1366 | insert_ob_in_ob (tmp_obj, op); |
1371 | insert_ob_in_ob (tmp, op); |
1367 | } |
1372 | } |
|
|
1373 | |
1368 | /* No harm setting this for potions/horns */ |
1374 | /* No harm setting this for potions/horns */ |
1369 | op->other_arch = change->other_arch; |
1375 | op->other_arch = change->other_arch; |
1370 | } |
1376 | } |
1371 | |
1377 | |
1372 | if (change->stats.hp < 0) |
1378 | if (change->stats.hp < 0) |
… | |
… | |
1388 | op->stats.maxsp = -change->stats.maxsp; |
1394 | op->stats.maxsp = -change->stats.maxsp; |
1389 | else |
1395 | else |
1390 | op->stats.maxsp += change->stats.maxsp; |
1396 | op->stats.maxsp += change->stats.maxsp; |
1391 | |
1397 | |
1392 | if (change->stats.food < 0) |
1398 | if (change->stats.food < 0) |
1393 | op->stats.food = -(change->stats.food); |
1399 | op->stats.food = -change->stats.food; |
1394 | else |
1400 | else |
1395 | op->stats.food += change->stats.food; |
1401 | op->stats.food += change->stats.food; |
1396 | |
1402 | |
1397 | if (change->level < 0) |
1403 | if (change->level < 0) |
1398 | op->level = -(change->level); |
1404 | op->level = -change->level; |
1399 | else |
1405 | else |
1400 | op->level += change->level; |
1406 | op->level += change->level; |
1401 | |
1407 | |
1402 | if (change->gen_sp_armour < 0) |
1408 | if (change->gen_sp_armour < 0) |
1403 | op->gen_sp_armour = -(change->gen_sp_armour); |
1409 | op->gen_sp_armour = -change->gen_sp_armour; |
1404 | else |
1410 | else |
1405 | op->gen_sp_armour = (op->gen_sp_armour * (change->gen_sp_armour)) / 100; |
1411 | op->gen_sp_armour = op->gen_sp_armour * (int)change->gen_sp_armour / 100; |
1406 | |
1412 | |
1407 | op->item_power = change->item_power; |
1413 | op->item_power = change->item_power; |
1408 | |
1414 | |
1409 | for (i = 0; i < NROFATTACKS; i++) |
1415 | for (int i = 0; i < NROFATTACKS; i++) |
1410 | if (change->resist[i]) |
|
|
1411 | op->resist[i] += change->resist[i]; |
1416 | op->resist[i] += change->resist[i]; |
1412 | |
1417 | |
1413 | if (change->stats.dam) |
1418 | if (change->stats.dam) |
1414 | { |
1419 | { |
1415 | if (change->stats.dam < 0) |
1420 | if (change->stats.dam < 0) |
1416 | op->stats.dam = (-change->stats.dam); |
1421 | op->stats.dam = -change->stats.dam; |
1417 | else if (op->stats.dam) |
1422 | else if (op->stats.dam) |
1418 | { |
1423 | { |
1419 | tmp = (signed char) (((int) op->stats.dam * (int) change->stats.dam) / 10); |
1424 | int tmp = op->stats.dam * change->stats.dam / 10; |
|
|
1425 | |
1420 | if (tmp == op->stats.dam) |
1426 | if (tmp == op->stats.dam) |
1421 | { |
1427 | { |
1422 | if (change->stats.dam < 10) |
1428 | if (change->stats.dam < 10) |
1423 | op->stats.dam--; |
1429 | op->stats.dam--; |
1424 | else |
1430 | else |
… | |
… | |
1430 | } |
1436 | } |
1431 | |
1437 | |
1432 | if (change->weight) |
1438 | if (change->weight) |
1433 | { |
1439 | { |
1434 | if (change->weight < 0) |
1440 | if (change->weight < 0) |
1435 | op->weight = (-change->weight); |
1441 | op->weight = -change->weight; |
1436 | else |
1442 | else |
1437 | op->weight = (op->weight * (change->weight)) / 100; |
1443 | op->weight = op->weight * change->weight / 100; |
1438 | } |
1444 | } |
1439 | |
1445 | |
1440 | if (change->last_sp) |
1446 | if (change->last_sp) |
1441 | { |
1447 | { |
1442 | if (change->last_sp < 0) |
1448 | if (change->last_sp < 0) |
1443 | op->last_sp = (-change->last_sp); |
1449 | op->last_sp = -change->last_sp; |
1444 | else |
1450 | else |
1445 | op->last_sp = (signed char) (((int) op->last_sp * (int) change->last_sp) / (int) 100); |
1451 | op->last_sp = op->last_sp * (int)change->last_sp / 100; |
1446 | } |
1452 | } |
1447 | |
1453 | |
1448 | if (change->gen_sp_armour) |
1454 | if (change->gen_sp_armour) |
1449 | { |
1455 | { |
1450 | if (change->gen_sp_armour < 0) |
1456 | if (change->gen_sp_armour < 0) |
1451 | op->gen_sp_armour = (-change->gen_sp_armour); |
1457 | op->gen_sp_armour = -change->gen_sp_armour; |
1452 | else |
1458 | else |
1453 | op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100); |
1459 | op->gen_sp_armour = op->gen_sp_armour * (int)change->gen_sp_armour / 100; |
1454 | } |
1460 | } |
1455 | |
1461 | |
1456 | op->value *= change->value; |
1462 | op->value *= change->value; |
1457 | |
1463 | |
1458 | if (change->materials) |
1464 | if (change->materials) |
1459 | op->materials = change->materials; |
1465 | op->materials = change->materials; |
1460 | |
1466 | |
1461 | if (change->materialname) |
1467 | if (change->material != MATERIAL_NULL) |
1462 | op->materialname = change->materialname; |
1468 | op->material = change->material; |
1463 | |
1469 | |
1464 | if (change->slaying) |
1470 | if (change->slaying) |
1465 | op->slaying = change->slaying; |
1471 | op->slaying = change->slaying; |
1466 | |
1472 | |
1467 | if (change->race) |
1473 | if (change->race) |
… | |
… | |
1490 | name = tmp->name + 1, neg = 1; |
1496 | name = tmp->name + 1, neg = 1; |
1491 | else |
1497 | else |
1492 | name = tmp->name, neg = 0; |
1498 | name = tmp->name, neg = 0; |
1493 | |
1499 | |
1494 | /* If we match name, then return the opposite of 'neg' */ |
1500 | /* If we match name, then return the opposite of 'neg' */ |
1495 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname))) |
1501 | if (!strcmp (name, op->arch->archname)) |
1496 | return !neg; |
1502 | return !neg; |
1497 | |
1503 | |
1498 | /* Set success as true, since if the match was an inverse, it means |
1504 | /* Set success as true, since if the match was an inverse, it means |
1499 | * everything is allowed except what we match |
1505 | * everything is allowed except what we match |
1500 | */ |
1506 | */ |
… | |
… | |
1511 | */ |
1517 | */ |
1512 | |
1518 | |
1513 | void |
1519 | void |
1514 | give_artifact_abilities (object *op, object *artifct) |
1520 | give_artifact_abilities (object *op, object *artifct) |
1515 | { |
1521 | { |
1516 | char new_name[MAX_BUF]; |
1522 | op->title = format ("of %s", &artifct->name); |
1517 | |
1523 | |
1518 | sprintf (new_name, "of %s", &artifct->name); |
|
|
1519 | op->title = new_name; |
|
|
1520 | add_abilities (op, artifct); /* Give out the bonuses */ |
1524 | add_abilities (op, artifct); /* Give out the bonuses */ |
1521 | |
1525 | |
1522 | #if 0 /* Bit verbose, but keep it here until next time I need it... */ |
1526 | #if 0 /* Bit verbose, but keep it here until next time I need it... */ |
1523 | { |
1527 | { |
1524 | char identified = QUERY_FLAG (op, FLAG_IDENTIFIED); |
1528 | char identified = op->flag [FLAG_IDENTIFIED]; |
1525 | |
1529 | |
1526 | SET_FLAG (op, FLAG_IDENTIFIED); |
1530 | op->set_flag (FLAG_IDENTIFIED); |
1527 | LOG (llevDebug, "Generated artifact %s %s [%s]\n", op->name, op->title, describe_item (op, NULL)); |
1531 | LOG (llevDebug, "Generated artifact %s %s [%s]\n", op->name, op->title, describe_item (op, NULL)); |
1528 | if (!identified) |
1532 | if (!identified) |
1529 | CLEAR_FLAG (op, FLAG_IDENTIFIED); |
1533 | op->clr_flag (FLAG_IDENTIFIED); |
1530 | } |
1534 | } |
1531 | #endif |
1535 | #endif |
1532 | return; |
1536 | return; |
1533 | } |
1537 | } |
1534 | |
1538 | |
… | |
… | |
1544 | #define ARTIFACT_TRIES 2 |
1548 | #define ARTIFACT_TRIES 2 |
1545 | |
1549 | |
1546 | void |
1550 | void |
1547 | generate_artifact (object *op, int difficulty) |
1551 | generate_artifact (object *op, int difficulty) |
1548 | { |
1552 | { |
1549 | artifactlist *al; |
|
|
1550 | artifact *art; |
1553 | artifact *art; |
1551 | int i; |
|
|
1552 | |
1554 | |
1553 | al = find_artifactlist (op->type); |
1555 | artifactlist *al = find_artifactlist (op->type); |
1554 | |
1556 | |
1555 | if (al == NULL) |
1557 | if (al == NULL) |
1556 | { |
1558 | { |
1557 | #if 0 /* This is too verbose, usually */ |
1559 | #if 0 /* This is too verbose, usually */ |
1558 | LOG (llevDebug, "Couldn't change %s into artifact - no table.\n", op->name); |
1560 | LOG (llevDebug, "Couldn't change %s into artifact - no table.\n", op->name); |
1559 | #endif |
1561 | #endif |
1560 | return; |
1562 | return; |
1561 | } |
1563 | } |
1562 | |
1564 | |
1563 | for (i = 0; i < ARTIFACT_TRIES; i++) |
1565 | for (int i = 0; i < ARTIFACT_TRIES; i++) |
1564 | { |
1566 | { |
1565 | int roll = rndm (al->total_chance); |
1567 | int roll = rndm (al->total_chance); |
1566 | |
1568 | |
1567 | for (art = al->items; art; art = art->next) |
1569 | for (art = al->items; art; art = art->next) |
1568 | { |
1570 | { |
… | |
… | |
1576 | #if 1 |
1578 | #if 1 |
1577 | LOG (llevError, "Got null entry and non zero roll in generate_artifact, type %d\n", op->type); |
1579 | LOG (llevError, "Got null entry and non zero roll in generate_artifact, type %d\n", op->type); |
1578 | #endif |
1580 | #endif |
1579 | return; |
1581 | return; |
1580 | } |
1582 | } |
1581 | if (!strcmp (art->item->name, "NONE")) |
1583 | |
|
|
1584 | if (art->item->name == shstr_NONE) |
1582 | return; |
1585 | return; |
|
|
1586 | |
1583 | if (FABS (op->magic) < art->item->magic) |
1587 | if (fabs (op->magic) < art->item->magic) |
1584 | continue; /* Not magic enough to be this item */ |
1588 | continue; /* Not magic enough to be this item */ |
1585 | |
1589 | |
1586 | /* Map difficulty not high enough */ |
1590 | /* Map difficulty not high enough */ |
1587 | if (difficulty < art->difficulty) |
1591 | if (difficulty < art->difficulty) |
1588 | continue; |
1592 | continue; |
… | |
… | |
1606 | */ |
1610 | */ |
1607 | |
1611 | |
1608 | void |
1612 | void |
1609 | fix_flesh_item (object *item, object *donor) |
1613 | fix_flesh_item (object *item, object *donor) |
1610 | { |
1614 | { |
1611 | char tmpbuf[MAX_BUF]; |
|
|
1612 | int i; |
|
|
1613 | |
|
|
1614 | if (item->type == FLESH && donor) |
1615 | if (item->type == FLESH && donor) |
1615 | { |
1616 | { |
1616 | /* change the name */ |
1617 | /* change the name */ |
1617 | sprintf (tmpbuf, "%s's %s", &donor->name, &item->name); |
1618 | item->name = format ("%s's %s", &donor->name, &item->name); |
1618 | item->name = tmpbuf; |
|
|
1619 | sprintf (tmpbuf, "%s's %s", &donor->name, &item->name_pl); |
1619 | item->name_pl = format ("%s's %s", &donor->name, &item->name_pl); |
1620 | item->name_pl = tmpbuf; |
|
|
1621 | |
1620 | |
1622 | /* weight is FLESH weight/100 * donor */ |
1621 | /* weight is FLESH weight/100 * donor */ |
1623 | if ((item->weight = (signed long) (((double) item->weight / (double) 100.0) * (double) donor->weight)) == 0) |
1622 | item->weight = max (1, item->weight * donor->weight / 100); |
1624 | item->weight = 1; |
|
|
1625 | |
1623 | |
1626 | /* value is multiplied by level of donor */ |
1624 | /* value is multiplied by level of donor */ |
1627 | item->value *= isqrt (donor->level * 2); |
1625 | item->value *= isqrt (donor->level * 2); |
1628 | |
1626 | |
1629 | /* food value */ |
1627 | /* food value */ |
1630 | item->stats.food += (donor->stats.hp / 100) + donor->stats.Con; |
1628 | item->stats.food += donor->stats.hp / 100 + donor->stats.Con; |
1631 | |
1629 | |
1632 | /* flesh items inherit some abilities of donor, but not |
1630 | /* flesh items inherit some abilities of donor, but not |
1633 | * full effect. |
1631 | * full effect. |
1634 | */ |
1632 | */ |
1635 | for (i = 0; i < NROFATTACKS; i++) |
1633 | for (int i = 0; i < NROFATTACKS; i++) |
1636 | item->resist[i] = donor->resist[i] / 2; |
1634 | item->resist[i] = donor->resist[i] / 2; |
1637 | |
1635 | |
1638 | /* item inherits donor's level (important for quezals) */ |
1636 | /* item inherits donor's level (important for quezals) */ |
1639 | item->level = donor->level; |
1637 | item->level = donor->level; |
1640 | |
1638 | |
1641 | /* if donor has some attacktypes, the flesh is poisonous */ |
1639 | /* if donor has some attacktypes, the flesh is poisonous */ |
1642 | if (donor->attacktype & AT_POISON) |
1640 | if (donor->attacktype & AT_POISON) |
1643 | item->type = POISON; |
1641 | item->type = POISON; |
|
|
1642 | |
1644 | if (donor->attacktype & AT_ACID) |
1643 | if (donor->attacktype & AT_ACID) |
1645 | item->stats.hp = -1 * item->stats.food; |
1644 | item->stats.hp = -item->stats.food; |
1646 | SET_FLAG (item, FLAG_NO_STEAL); |
|
|
1647 | } |
|
|
1648 | } |
|
|
1649 | |
1645 | |
1650 | /* special_potion() - so that old potion code is still done right. */ |
1646 | item->set_flag (FLAG_NO_STEAL); |
1651 | int |
1647 | } |
1652 | special_potion (object *op) |
|
|
1653 | { |
|
|
1654 | if (op->attacktype) |
|
|
1655 | return 1; |
|
|
1656 | |
|
|
1657 | if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha) |
|
|
1658 | return 1; |
|
|
1659 | |
|
|
1660 | for (int i = 0; i < NROFATTACKS; i++) |
|
|
1661 | if (op->resist[i]) |
|
|
1662 | return 1; |
|
|
1663 | |
|
|
1664 | return 0; |
|
|
1665 | } |
1648 | } |
1666 | |
1649 | |
1667 | void |
1650 | static void |
1668 | free_treasurestruct (treasure *t) |
1651 | free_treasurestruct (treasure *t) |
1669 | { |
1652 | { |
1670 | if (t->next) free_treasurestruct (t->next); |
1653 | if (t->next) free_treasurestruct (t->next); |
1671 | if (t->next_yes) free_treasurestruct (t->next_yes); |
1654 | if (t->next_yes) free_treasurestruct (t->next_yes); |
1672 | if (t->next_no) free_treasurestruct (t->next_no); |
1655 | if (t->next_no) free_treasurestruct (t->next_no); |
1673 | |
1656 | |
1674 | delete t; |
1657 | delete t; |
1675 | } |
1658 | } |
1676 | |
1659 | |
1677 | void |
1660 | static void |
1678 | free_charlinks (linked_char *lc) |
1661 | free_charlinks (linked_char *lc) |
1679 | { |
1662 | { |
1680 | if (lc->next) |
1663 | if (lc->next) |
1681 | free_charlinks (lc->next); |
1664 | free_charlinks (lc->next); |
1682 | |
1665 | |
1683 | delete lc; |
1666 | delete lc; |
1684 | } |
1667 | } |
1685 | |
1668 | |
1686 | void |
1669 | static void |
1687 | free_artifact (artifact *at) |
1670 | free_artifact (artifact *at) |
1688 | { |
1671 | { |
1689 | if (at->next) free_artifact (at->next); |
1672 | if (at->next) free_artifact (at->next); |
1690 | if (at->allowed) free_charlinks (at->allowed); |
1673 | if (at->allowed) free_charlinks (at->allowed); |
1691 | |
1674 | |
1692 | at->item->destroy (1); |
1675 | at->item->destroy (); |
1693 | |
1676 | |
1694 | sfree (at); |
1677 | sfree (at); |
1695 | } |
1678 | } |
1696 | |
1679 | |
1697 | void |
|
|
1698 | free_artifactlist (artifactlist *al) |
|
|
1699 | { |
|
|
1700 | artifactlist *nextal; |
|
|
1701 | |
|
|
1702 | for (al = first_artifactlist; al; al = nextal) |
|
|
1703 | { |
|
|
1704 | nextal = al->next; |
|
|
1705 | |
|
|
1706 | if (al->items) |
|
|
1707 | free_artifact (al->items); |
|
|
1708 | |
|
|
1709 | sfree (al); |
|
|
1710 | } |
|
|
1711 | } |
|
|
1712 | |
|
|
1713 | void |
|
|
1714 | free_all_treasures (void) |
|
|
1715 | { |
|
|
1716 | treasurelist *tl, *next; |
|
|
1717 | |
|
|
1718 | for (tl = first_treasurelist; tl; tl = next) |
|
|
1719 | { |
|
|
1720 | clear (tl); |
|
|
1721 | |
|
|
1722 | next = tl->next; |
|
|
1723 | delete tl; |
|
|
1724 | } |
|
|
1725 | |
|
|
1726 | free_artifactlist (first_artifactlist); |
|
|
1727 | } |
|
|