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 it under |
9 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * 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 Affero GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
21 | * <http://www.gnu.org/licenses/>. |
21 | * |
22 | * |
22 | * 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> |
23 | */ |
24 | */ |
24 | |
25 | |
25 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
26 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
26 | * 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 |
… | |
… | |
33 | |
34 | |
34 | //#define TREASURE_VERBOSE |
35 | //#define TREASURE_VERBOSE |
35 | |
36 | |
36 | #include <global.h> |
37 | #include <global.h> |
37 | #include <treasure.h> |
38 | #include <treasure.h> |
38 | #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) |
39 | |
44 | |
40 | extern char *spell_mapping[]; |
45 | extern char *spell_mapping[]; |
41 | |
46 | |
42 | static treasurelist *first_treasurelist; |
47 | static treasurelist *first_treasurelist; |
43 | |
48 | |
44 | static void change_treasure (treasure *t, object *op); /* overrule default values */ |
49 | static void change_treasure (treasure *t, object *op); /* overrule default values */ |
45 | |
50 | |
46 | typedef std::tr1::unordered_map< |
51 | typedef ska::flat_hash_map< |
47 | const char *, |
52 | const char *, |
48 | treasurelist *, |
53 | treasurelist *, |
49 | str_hash, |
54 | str_hash, |
50 | str_equal, |
55 | str_equal, |
51 | slice_allocator< std::pair<const char *const, treasurelist *> > |
56 | slice_allocator< std::pair<const char *const, treasurelist *> > |
52 | > tl_map_t; |
57 | > tl_map_t; |
53 | |
58 | |
54 | static tl_map_t tl_map; |
59 | static tl_map_t tl_map; |
55 | |
60 | |
56 | //TODO: class method |
61 | //TODO: class method |
… | |
… | |
256 | return; |
261 | return; |
257 | } |
262 | } |
258 | |
263 | |
259 | op->expand_tail (); |
264 | op->expand_tail (); |
260 | |
265 | |
|
|
266 | if (!creator->is_on_map () |
261 | if (!creator->is_on_map () || op->blocked (creator->map, creator->x, creator->y)) |
267 | || (op->weight && op->blocked (creator->map, creator->x, creator->y))) |
262 | op->destroy (); |
268 | op->destroy (); |
263 | else |
269 | else |
264 | { |
270 | { |
265 | SET_FLAG (op, FLAG_OBJ_ORIGINAL); |
271 | op->flag [FLAG_OBJ_ORIGINAL] = true; |
266 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
272 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
267 | } |
273 | } |
268 | } |
274 | } |
269 | else |
275 | else |
270 | { |
276 | { |
271 | op = creator->insert (op); |
277 | op = creator->insert (op); |
272 | |
278 | |
273 | if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) |
279 | if ((flags & GT_APPLY) && creator->flag [FLAG_MONSTER]) |
274 | monster_check_apply (creator, op); |
280 | monster_check_apply (creator, op); |
275 | } |
281 | } |
276 | } |
282 | } |
277 | |
283 | |
278 | /* if there are change_xxx commands in the treasure, we include the changes |
284 | /* if there are change_xxx commands in the treasure, we include the changes |
… | |
… | |
310 | } |
316 | } |
311 | else |
317 | else |
312 | { |
318 | { |
313 | if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE))) |
319 | if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE))) |
314 | { |
320 | { |
315 | object *tmp = arch_to_object (t->item); |
321 | object *tmp = t->item->instance (); |
316 | |
322 | |
317 | if (t->nrof && tmp->nrof <= 1) |
323 | if (t->nrof && tmp->nrof <= 1) |
318 | tmp->nrof = rndm (t->nrof) + 1; |
324 | tmp->nrof = rndm (t->nrof) + 1; |
319 | |
325 | |
320 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
326 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
… | |
… | |
367 | else if (t->nrof) |
373 | else if (t->nrof) |
368 | create_one_treasure (tl, op, flag, difficulty, tries); |
374 | create_one_treasure (tl, op, flag, difficulty, tries); |
369 | } |
375 | } |
370 | else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE)) |
376 | else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE)) |
371 | { |
377 | { |
372 | if (object *tmp = arch_to_object (t->item)) |
378 | if (object *tmp = t->item->instance ()) |
373 | { |
379 | { |
374 | if (t->nrof && tmp->nrof <= 1) |
380 | if (t->nrof && tmp->nrof <= 1) |
375 | tmp->nrof = rndm (t->nrof) + 1; |
381 | tmp->nrof = rndm (t->nrof) + 1; |
376 | |
382 | |
377 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
383 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
… | |
… | |
490 | { 0, 0, 0, 3, 97}, // 29 |
496 | { 0, 0, 0, 3, 97}, // 29 |
491 | { 0, 0, 0, 0, 100}, // 30 |
497 | { 0, 0, 0, 0, 100}, // 30 |
492 | { 0, 0, 0, 0, 100}, // 31 |
498 | { 0, 0, 0, 0, 100}, // 31 |
493 | }; |
499 | }; |
494 | |
500 | |
495 | /* calculate the appropriate level for wands staves and scrolls. |
501 | /* calculate the appropriate level for wands staves and scrolls. |
496 | * This code presumes that op has had its spell object created (in op->inv) |
502 | * This code presumes that op has had its spell object created (in op->inv) |
497 | * |
503 | * |
498 | * elmex Wed Aug 9 17:44:59 CEST 2006: |
504 | * elmex Wed Aug 9 17:44:59 CEST 2006: |
499 | * Removed multiplicator, too many high-level items were generated on low-difficulty maps. |
505 | * Removed multiplicator, too many high-level items were generated on low-difficulty maps. |
500 | */ |
506 | */ |
… | |
… | |
510 | int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.)); |
516 | int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.)); |
511 | |
517 | |
512 | if (olevel <= 0) |
518 | if (olevel <= 0) |
513 | olevel = rndm (1, op->inv->level); |
519 | olevel = rndm (1, op->inv->level); |
514 | |
520 | |
515 | return min (olevel, MAXLEVEL); |
521 | return min (olevel, MAXLEVEL_TREASURE); |
516 | } |
522 | } |
517 | |
523 | |
518 | /* |
524 | /* |
519 | * Based upon the specified difficulty and upon the difftomagic_list array, |
525 | * Based upon the specified difficulty and upon the difftomagic_list array, |
520 | * a random magical bonus is returned. This is used when determine |
526 | * a random magical bonus is returned. This is used when determine |
… | |
… | |
526 | * |
532 | * |
527 | */ |
533 | */ |
528 | static int |
534 | static int |
529 | magic_from_difficulty (int difficulty) |
535 | magic_from_difficulty (int difficulty) |
530 | { |
536 | { |
531 | int percent = 0, magic = 0; |
|
|
532 | int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS); |
537 | int scaled_diff = lerp (difficulty, 0, settings.max_level, 0, DIFFLEVELS - 1); |
|
|
538 | scaled_diff = clamp (scaled_diff, 0, DIFFLEVELS - 1); |
533 | |
539 | |
534 | scaled_diff--; |
|
|
535 | |
|
|
536 | if (scaled_diff < 0) |
|
|
537 | scaled_diff = 0; |
|
|
538 | |
|
|
539 | if (scaled_diff >= DIFFLEVELS) |
|
|
540 | scaled_diff = DIFFLEVELS - 1; |
|
|
541 | |
|
|
542 | percent = rndm (100); |
540 | int percent = rndm (100); |
|
|
541 | int magic; |
543 | |
542 | |
544 | for (magic = 0; magic < (MAXMAGIC + 1); magic++) |
543 | for (magic = 0; magic <= MAXMAGIC; magic++) |
545 | { |
544 | { |
546 | percent -= difftomagic_list[scaled_diff][magic]; |
545 | percent -= difftomagic_list[scaled_diff][magic]; |
547 | |
546 | |
548 | if (percent < 0) |
547 | if (percent < 0) |
549 | break; |
548 | break; |
550 | } |
549 | } |
551 | |
550 | |
552 | if (magic == (MAXMAGIC + 1)) |
551 | if (magic > MAXMAGIC) |
553 | { |
552 | { |
554 | LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty); |
553 | LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty); |
555 | magic = 0; |
554 | magic = 0; |
556 | } |
555 | } |
557 | |
556 | |
… | |
… | |
565 | * Sets magical bonus in an object, and recalculates the effect on |
564 | * Sets magical bonus in an object, and recalculates the effect on |
566 | * the armour variable, and the effect on speed of armour. |
565 | * the armour variable, and the effect on speed of armour. |
567 | * This function doesn't work properly, should add use of archetypes |
566 | * This function doesn't work properly, should add use of archetypes |
568 | * to make it truly absolute. |
567 | * to make it truly absolute. |
569 | */ |
568 | */ |
570 | |
|
|
571 | void |
569 | void |
572 | set_abs_magic (object *op, int magic) |
570 | set_abs_magic (object *op, int magic) |
573 | { |
571 | { |
574 | if (!magic) |
572 | if (!magic) |
575 | return; |
573 | return; |
… | |
… | |
603 | */ |
601 | */ |
604 | |
602 | |
605 | static void |
603 | static void |
606 | set_magic (int difficulty, object *op, int max_magic, int flags) |
604 | set_magic (int difficulty, object *op, int max_magic, int flags) |
607 | { |
605 | { |
608 | int i; |
|
|
609 | |
|
|
610 | i = magic_from_difficulty (difficulty); |
606 | int i = magic_from_difficulty (difficulty); |
|
|
607 | |
611 | if ((flags & GT_ONLY_GOOD) && i < 0) |
608 | if ((flags & GT_ONLY_GOOD) && i < 0) |
612 | i = -i; |
609 | i = -i; |
|
|
610 | |
613 | if (i > max_magic) |
611 | i = min (i, max_magic); |
614 | i = max_magic; |
612 | |
615 | set_abs_magic (op, i); |
613 | set_abs_magic (op, i); |
616 | if (i < 0) |
614 | if (i < 0) |
617 | SET_FLAG (op, FLAG_CURSED); |
615 | op->set_flag (FLAG_CURSED); |
618 | } |
616 | } |
619 | |
617 | |
620 | /* |
618 | /* |
621 | * Randomly adds one magical ability to the given object. |
619 | * Randomly adds one magical ability to the given object. |
622 | * Modified for Partial Resistance in many ways: |
620 | * Modified for Partial Resistance in many ways: |
… | |
… | |
629 | set_ring_bonus (object *op, int bonus) |
627 | set_ring_bonus (object *op, int bonus) |
630 | { |
628 | { |
631 | int r = rndm (bonus > 0 ? 25 : 11); |
629 | int r = rndm (bonus > 0 ? 25 : 11); |
632 | |
630 | |
633 | if (op->type == AMULET) |
631 | if (op->type == AMULET) |
634 | { |
|
|
635 | if (!(rndm (21))) |
632 | if (!rndm (21)) |
636 | r = 20 + rndm (2); |
633 | r = 20 + rndm (2); |
|
|
634 | else if (rndm (2)) |
|
|
635 | r = 10; |
637 | else |
636 | else |
638 | { |
|
|
639 | if (rndm (2)) |
|
|
640 | r = 10; |
|
|
641 | else |
|
|
642 | r = 11 + rndm (9); |
637 | r = 11 + rndm (9); |
643 | } |
|
|
644 | } |
|
|
645 | |
638 | |
646 | switch (r) |
639 | switch (r) |
647 | { |
640 | { |
648 | /* Redone by MSW 2000-11-26 to have much less code. Also, |
641 | /* Redone by MSW 2000-11-26 to have much less code. Also, |
649 | * bonuses and penalties will stack and add to existing values. |
642 | * bonuses and penalties will stack and add to existing values. |
650 | * of the item. |
643 | * of the item. |
651 | */ |
644 | */ |
652 | case 0: |
645 | case 0: |
653 | case 1: |
646 | case 1: |
654 | case 2: |
647 | case 2: |
655 | case 3: |
648 | case 3: |
656 | case 4: |
649 | case 4: |
… | |
… | |
696 | * little random element in since that they don't always end up with |
689 | * little random element in since that they don't always end up with |
697 | * even values. |
690 | * even values. |
698 | */ |
691 | */ |
699 | if (bonus < 0) |
692 | if (bonus < 0) |
700 | val = 2 * -val - rndm (b); |
693 | val = 2 * -val - rndm (b); |
701 | if (val > 35) |
694 | |
702 | val = 35; /* Upper limit */ |
695 | val = min (35, val); /* Upper limit */ |
|
|
696 | |
703 | b = 0; |
697 | b = 0; |
704 | |
698 | |
705 | while (op->resist[resist_table[resist]] != 0 && b < 4) |
699 | while (op->resist[resist_table[resist]] != 0 && b < 4) |
706 | resist = rndm (num_resist_table); |
700 | resist = rndm (num_resist_table); |
707 | |
701 | |
… | |
… | |
715 | break; |
709 | break; |
716 | } |
710 | } |
717 | case 20: |
711 | case 20: |
718 | if (op->type == AMULET) |
712 | if (op->type == AMULET) |
719 | { |
713 | { |
720 | SET_FLAG (op, FLAG_REFL_SPELL); |
714 | op->set_flag (FLAG_REFL_SPELL); |
721 | op->value *= 11; |
715 | op->value *= 11; |
722 | } |
716 | } |
723 | else |
717 | else |
724 | { |
718 | { |
725 | op->stats.hp = 1; /* regenerate hit points */ |
719 | op->stats.hp = 1; /* regenerate hit points */ |
… | |
… | |
728 | break; |
722 | break; |
729 | |
723 | |
730 | case 21: |
724 | case 21: |
731 | if (op->type == AMULET) |
725 | if (op->type == AMULET) |
732 | { |
726 | { |
733 | SET_FLAG (op, FLAG_REFL_MISSILE); |
727 | op->set_flag (FLAG_REFL_MISSILE); |
734 | op->value *= 9; |
728 | op->value *= 9; |
735 | } |
729 | } |
736 | else |
730 | else |
737 | { |
731 | { |
738 | op->stats.sp = 1; /* regenerate spell points */ |
732 | op->stats.sp = 1; /* regenerate spell points */ |
… | |
… | |
740 | } |
734 | } |
741 | break; |
735 | break; |
742 | |
736 | |
743 | case 22: |
737 | case 22: |
744 | op->stats.exp += bonus; /* Speed! */ |
738 | op->stats.exp += bonus; /* Speed! */ |
745 | op->value = (op->value * 2) / 3; |
739 | op->value = op->value * 2 / 3; |
746 | break; |
740 | break; |
747 | } |
741 | } |
748 | |
742 | |
749 | if (bonus > 0) |
743 | if (bonus > 0) |
750 | op->value *= 2 * bonus; |
744 | op->value = 2 * op->value * bonus; |
751 | else |
745 | else |
752 | op->value = -(op->value * 2 * bonus) / 3; |
746 | op->value = -2 * op->value * bonus / 3; |
753 | } |
747 | } |
754 | |
748 | |
755 | /* |
749 | /* |
756 | * get_magic(diff) will return a random number between 0 and 4. |
750 | * get_magic(diff) will return a random number between 0 and 4. |
757 | * diff can be any value above 2. The higher the diff-variable, the |
751 | * diff can be any value above 2. The higher the diff-variable, the |
… | |
… | |
761 | * Another scheme is used to calculate the magic of weapons and armours. |
755 | * Another scheme is used to calculate the magic of weapons and armours. |
762 | */ |
756 | */ |
763 | static int |
757 | static int |
764 | get_magic (int diff) |
758 | get_magic (int diff) |
765 | { |
759 | { |
766 | int i; |
760 | diff = min (3, diff); |
767 | |
761 | |
768 | if (diff < 3) |
|
|
769 | diff = 3; |
|
|
770 | |
|
|
771 | for (i = 0; i < 4; i++) |
762 | for (int i = 0; i < 4; i++) |
772 | if (rndm (diff)) |
763 | if (rndm (diff)) |
773 | return i; |
764 | return i; |
774 | |
765 | |
775 | return 4; |
766 | return 4; |
776 | } |
767 | } |
… | |
… | |
790 | return 1; |
781 | return 1; |
791 | |
782 | |
792 | return 0; |
783 | return 0; |
793 | } |
784 | } |
794 | |
785 | |
|
|
786 | static double |
|
|
787 | value_factor_from_spell_item (object *spell, object *item) |
|
|
788 | { |
|
|
789 | double factor = |
|
|
790 | pow ((spell->value > 0 ? spell->value : 1) |
|
|
791 | * spell->level, 1.5); |
|
|
792 | |
|
|
793 | if (item) // this if for: wands/staffs/rods: |
|
|
794 | { |
|
|
795 | /* Old crossfire comment ahead: |
|
|
796 | * Add 50 to both level an divisor to keep prices a little more |
|
|
797 | * reasonable. Otherwise, a high level version of a low level |
|
|
798 | * spell can be worth tons a money (eg, level 20 rod, level 2 spell = |
|
|
799 | * 10 time multiplier). This way, the value are a bit more reasonable. |
|
|
800 | */ |
|
|
801 | |
|
|
802 | factor *= item->level + 50; |
|
|
803 | factor /= item->inv->level + 50; |
|
|
804 | } |
|
|
805 | |
|
|
806 | return factor; |
|
|
807 | } |
|
|
808 | |
795 | #define DICE2 (get_magic(2)==2?2:1) |
809 | #define DICE2 (get_magic(2) == 2 ? 2 : 1) |
796 | #define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3)) |
810 | #define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3)) |
797 | |
811 | |
798 | /* |
812 | /* |
799 | * fix_generated_item(): This is called after an item is generated, in |
813 | * fix_generated_item(): This is called after an item is generated, in |
800 | * order to set it up right. This produced magical bonuses, puts spells |
814 | * order to set it up right. This produced magical bonuses, puts spells |
801 | * into scrolls/books/wands, makes it unidentified, hides the value, etc. |
815 | * into scrolls/books/wands, makes it unidentified, hides the value, etc. |
802 | */ |
816 | */ |
803 | |
817 | |
804 | /* 4/28/96 added creator object from which op may now inherit properties based on |
818 | /* 4/28/96 added creator object from which op may now inherit properties based on |
805 | * op->type. Right now, which stuff the creator passes on is object type |
819 | * op->type. Right now, which stuff the creator passes on is object type |
806 | * dependant. I know this is a spagetti manuever, but is there a cleaner |
820 | * dependant. I know this is a spagetti manuever, but is there a cleaner |
807 | * way to do this? b.t. */ |
821 | * way to do this? b.t. */ |
808 | |
822 | |
809 | /* |
823 | /* |
810 | * ! (flags & GT_ENVIRONMENT): |
824 | * ! (flags & GT_ENVIRONMENT): |
811 | * Automatically calls fix_flesh_item(). |
825 | * Automatically calls fix_flesh_item(). |
… | |
… | |
834 | create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0); |
848 | create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0); |
835 | /* So the treasure doesn't get created again */ |
849 | /* So the treasure doesn't get created again */ |
836 | op->randomitems = 0; |
850 | op->randomitems = 0; |
837 | } |
851 | } |
838 | |
852 | |
839 | if (difficulty < 1) |
853 | max_it (difficulty, 1); |
840 | difficulty = 1; |
|
|
841 | |
854 | |
842 | if (INVOKE_OBJECT (ADD_BONUS, op, |
855 | if (INVOKE_OBJECT (ADD_BONUS, op, |
843 | ARG_OBJECT (creator != op ? creator : 0), |
856 | ARG_OBJECT (creator != op ? creator : 0), |
844 | ARG_INT (difficulty), ARG_INT (max_magic), |
857 | ARG_INT (difficulty), ARG_INT (max_magic), |
845 | ARG_INT (flags))) |
858 | ARG_INT (flags))) |
… | |
… | |
904 | * again below */ |
917 | * again below */ |
905 | } |
918 | } |
906 | } |
919 | } |
907 | |
920 | |
908 | /* materialtype modifications. Note we allow this on artifacts. */ |
921 | /* materialtype modifications. Note we allow this on artifacts. */ |
909 | set_materialname (op, difficulty, NULL); |
922 | select_material (op, difficulty); |
910 | |
923 | |
911 | if (flags & GT_MINIMAL) |
924 | if (flags & GT_MINIMAL) |
912 | { |
925 | { |
913 | if (op->type == POTION) |
926 | if (op->type == POTION) |
914 | /* Handle healing and magic power potions */ |
927 | /* Handle healing and magic power potions */ |
915 | if (op->stats.sp && !op->randomitems) |
928 | if (op->stats.sp && !op->randomitems) |
916 | { |
929 | { |
917 | object *tmp = get_archetype (spell_mapping [op->stats.sp]); |
930 | object *tmp = archetype::get (spell_mapping [op->stats.sp]); |
918 | insert_ob_in_ob (tmp, op); |
931 | insert_ob_in_ob (tmp, op); |
919 | op->stats.sp = 0; |
932 | op->stats.sp = 0; |
920 | } |
933 | } |
921 | } |
934 | } |
922 | else if (!op->title) /* Only modify object if not special */ |
935 | else if (!op->title) /* Only modify object if not special */ |
… | |
… | |
925 | case WEAPON: |
938 | case WEAPON: |
926 | case ARMOUR: |
939 | case ARMOUR: |
927 | case SHIELD: |
940 | case SHIELD: |
928 | case HELMET: |
941 | case HELMET: |
929 | case CLOAK: |
942 | case CLOAK: |
930 | if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4))) |
943 | if (op->flag [FLAG_CURSED] && !(rndm (4))) |
931 | set_ring_bonus (op, -DICE2); |
944 | set_ring_bonus (op, -DICE2); |
932 | break; |
945 | break; |
933 | |
946 | |
934 | case BRACERS: |
947 | case BRACERS: |
935 | if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)) |
948 | if (!rndm (op->flag [FLAG_CURSED] ? 5 : 20)) |
936 | { |
949 | { |
937 | set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2); |
950 | set_ring_bonus (op, op->flag [FLAG_CURSED] ? -DICE2 : DICE2); |
938 | if (!QUERY_FLAG (op, FLAG_CURSED)) |
951 | if (!op->flag [FLAG_CURSED]) |
939 | op->value *= 3; |
952 | op->value *= 3; |
940 | } |
953 | } |
941 | break; |
954 | break; |
942 | |
955 | |
943 | case POTION: |
956 | case POTION: |
944 | { |
957 | { |
945 | int too_many_tries = 0, is_special = 0; |
958 | int too_many_tries = 0; |
946 | |
959 | |
947 | /* Handle healing and magic power potions */ |
960 | /* Handle healing and magic power potions */ |
948 | if (op->stats.sp && !op->randomitems) |
961 | if (op->stats.sp && !op->randomitems) |
949 | { |
962 | { |
950 | object *tmp; |
|
|
951 | |
|
|
952 | tmp = get_archetype (spell_mapping[op->stats.sp]); |
963 | object *tmp = archetype::get (spell_mapping[op->stats.sp]); |
953 | insert_ob_in_ob (tmp, op); |
964 | insert_ob_in_ob (tmp, op); |
954 | op->stats.sp = 0; |
965 | op->stats.sp = 0; |
955 | } |
966 | } |
956 | |
967 | |
957 | while (!(is_special = special_potion (op)) && !op->inv) |
968 | while (!special_potion (op) && !op->inv) |
958 | { |
969 | { |
959 | generate_artifact (op, difficulty); |
970 | generate_artifact (op, difficulty); |
960 | if (too_many_tries++ > 10) |
971 | if (too_many_tries++ > 10) |
961 | break; |
972 | break; |
962 | } |
973 | } |
… | |
… | |
965 | * since the value set on those is already correct. |
976 | * since the value set on those is already correct. |
966 | */ |
977 | */ |
967 | if (op->inv && op->randomitems) |
978 | if (op->inv && op->randomitems) |
968 | { |
979 | { |
969 | /* value multiplier is same as for scrolls */ |
980 | /* value multiplier is same as for scrolls */ |
970 | op->value = (op->value * op->inv->value); |
981 | op->value *= op->inv->value; |
971 | op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty); |
982 | op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty); |
972 | } |
983 | } |
973 | else |
984 | else |
974 | { |
985 | { |
975 | op->name = "potion"; |
986 | op->name = shstr_potion; |
976 | op->name_pl = "potions"; |
987 | op->name_pl = shstr_potions; |
977 | } |
988 | } |
978 | |
989 | |
979 | if (!(flags & GT_ONLY_GOOD) && rndm (2)) |
990 | if (!(flags & GT_ONLY_GOOD) && rndm (2)) |
980 | SET_FLAG (op, FLAG_CURSED); |
991 | op->set_flag (FLAG_CURSED); |
|
|
992 | |
981 | break; |
993 | break; |
982 | } |
994 | } |
983 | |
995 | |
984 | case AMULET: |
996 | case AMULET: |
985 | if (IS_ARCH (op->arch, amulet)) |
997 | if (IS_ARCH (op->arch, amulet)) |
… | |
… | |
988 | case RING: |
1000 | case RING: |
989 | if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */ |
1001 | if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */ |
990 | break; |
1002 | break; |
991 | |
1003 | |
992 | if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) |
1004 | if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) |
993 | SET_FLAG (op, FLAG_CURSED); |
1005 | op->set_flag (FLAG_CURSED); |
994 | |
1006 | |
995 | set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2); |
1007 | set_ring_bonus (op, op->flag [FLAG_CURSED] ? -DICE2 : DICE2); |
996 | |
1008 | |
997 | if (op->type != RING) /* Amulets have only one ability */ |
1009 | if (op->type != RING) /* Amulets have only one ability */ |
998 | break; |
1010 | break; |
999 | |
1011 | |
1000 | if (!(rndm (4))) |
1012 | if (!rndm (4)) |
1001 | { |
1013 | { |
1002 | int d = (rndm (2) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2; |
1014 | int d = (rndm (2) || op->flag [FLAG_CURSED]) ? -DICE2 : DICE2; |
1003 | |
1015 | |
1004 | if (d > 0) |
1016 | if (d > 0) |
1005 | op->value *= 3; |
1017 | op->value *= 3; |
1006 | |
1018 | |
1007 | set_ring_bonus (op, d); |
1019 | set_ring_bonus (op, d); |
1008 | |
1020 | |
1009 | if (!(rndm (4))) |
1021 | if (!rndm (4)) |
1010 | { |
1022 | { |
1011 | int d = (rndm (3) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2; |
1023 | int d = (rndm (3) || op->flag [FLAG_CURSED]) ? -DICE2 : DICE2; |
1012 | |
1024 | |
1013 | if (d > 0) |
1025 | if (d > 0) |
1014 | op->value *= 5; |
1026 | op->value *= 5; |
|
|
1027 | |
1015 | set_ring_bonus (op, d); |
1028 | set_ring_bonus (op, d); |
1016 | } |
1029 | } |
1017 | } |
1030 | } |
1018 | |
1031 | |
1019 | if (op->animation_id) |
1032 | if (op->animation_id) |
… | |
… | |
1027 | * creator and/or map level we found it on. |
1040 | * creator and/or map level we found it on. |
1028 | */ |
1041 | */ |
1029 | if (!op->msg && rndm (10)) |
1042 | if (!op->msg && rndm (10)) |
1030 | { |
1043 | { |
1031 | /* set the book level properly */ |
1044 | /* set the book level properly */ |
1032 | if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE)) |
1045 | if (creator->level == 0 || creator->flag [FLAG_ALIVE]) |
1033 | { |
1046 | { |
1034 | if (op->map && op->map->difficulty) |
1047 | if (op->map && op->map->difficulty) |
1035 | op->level = rndm (op->map->difficulty) + rndm (10) + 1; |
1048 | op->level = rndm (op->map->difficulty) + rndm (10) + 1; |
1036 | else |
1049 | else |
1037 | op->level = rndm (20) + 1; |
1050 | op->level = rndm (20) + 1; |
… | |
… | |
1050 | /* creator related stuff */ |
1063 | /* creator related stuff */ |
1051 | |
1064 | |
1052 | /* for library, chained books. Note that some monsters have no_pick |
1065 | /* for library, chained books. Note that some monsters have no_pick |
1053 | * set - we don't want to set no pick in that case. |
1066 | * set - we don't want to set no pick in that case. |
1054 | */ |
1067 | */ |
1055 | if (QUERY_FLAG (creator, FLAG_NO_PICK) && !QUERY_FLAG (creator, FLAG_MONSTER)) |
1068 | if (creator->flag [FLAG_NO_PICK] && !creator->flag [FLAG_MONSTER]) |
1056 | SET_FLAG (op, FLAG_NO_PICK); |
1069 | op->set_flag (FLAG_NO_PICK); |
1057 | if (creator->slaying && !op->slaying) /* for check_inv floors */ |
1070 | if (creator->slaying && !op->slaying) /* for check_inv floors */ |
1058 | op->slaying = creator->slaying; |
1071 | op->slaying = creator->slaying; |
1059 | break; |
1072 | break; |
1060 | |
1073 | |
1061 | case SPELLBOOK: |
1074 | case SPELLBOOK: |
1062 | op->value = op->value * op->inv->value; |
1075 | op->value *= value_factor_from_spell_item (op->inv, 0); |
|
|
1076 | |
1063 | /* add exp so learning gives xp */ |
1077 | /* add exp so learning gives xp */ |
1064 | op->level = op->inv->level; |
1078 | op->level = op->inv->level; |
1065 | op->stats.exp = op->value; |
1079 | op->stats.exp = op->value; |
1066 | break; |
1080 | break; |
1067 | |
1081 | |
… | |
… | |
1071 | * and reset nrof. |
1085 | * and reset nrof. |
1072 | */ |
1086 | */ |
1073 | op->stats.food = op->inv->nrof; |
1087 | op->stats.food = op->inv->nrof; |
1074 | op->nrof = 1; |
1088 | op->nrof = 1; |
1075 | /* If the spell changes by level, choose a random level |
1089 | /* If the spell changes by level, choose a random level |
1076 | * for it, and adjust price. If the spell doesn't |
1090 | * for it. |
1077 | * change by level, just set the wand to the level of |
|
|
1078 | * the spell, and value calculation is simpler. |
|
|
1079 | */ |
1091 | */ |
1080 | if (op->inv->duration_modifier || op->inv->dam_modifier || op->inv->range_modifier) |
1092 | if (op->inv->duration_modifier |
1081 | { |
1093 | || op->inv->dam_modifier |
|
|
1094 | || op->inv->range_modifier) |
1082 | op->level = level_for_item (op, difficulty); |
1095 | op->level = level_for_item (op, difficulty); |
1083 | op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50); |
|
|
1084 | } |
|
|
1085 | else |
1096 | else |
1086 | { |
|
|
1087 | op->level = op->inv->level; |
1097 | op->level = op->inv->level; |
1088 | op->value = op->value * op->inv->value; |
1098 | |
1089 | } |
1099 | op->value *= value_factor_from_spell_item (op->inv, op); |
1090 | break; |
1100 | break; |
1091 | |
1101 | |
1092 | case ROD: |
1102 | case ROD: |
1093 | op->level = level_for_item (op, difficulty); |
1103 | op->level = level_for_item (op, difficulty); |
1094 | /* Add 50 to both level an divisor to keep prices a little more |
1104 | op->value *= value_factor_from_spell_item (op->inv, op); |
1095 | * reasonable. Otherwise, a high level version of a low level |
1105 | |
1096 | * spell can be worth tons a money (eg, level 20 rod, level 2 spell = |
|
|
1097 | * 10 time multiplier). This way, the value are a bit more reasonable. |
|
|
1098 | */ |
|
|
1099 | op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50); |
|
|
1100 | /* maxhp is used to denote how many 'charges' the rod holds before */ |
1106 | /* maxhp is used to denote how many 'charges' the rod holds before */ |
1101 | if (op->stats.maxhp) |
1107 | if (op->stats.maxhp) |
1102 | op->stats.maxhp *= MAX (op->inv->stats.sp, op->inv->stats.grace); |
1108 | op->stats.maxhp *= max (op->inv->stats.sp, op->inv->stats.grace); |
1103 | else |
1109 | else |
1104 | op->stats.maxhp = 2 * MAX (op->inv->stats.sp, op->inv->stats.grace); |
1110 | op->stats.maxhp = 2 * max (op->inv->stats.sp, op->inv->stats.grace); |
1105 | |
1111 | |
1106 | op->stats.hp = op->stats.maxhp; |
1112 | op->stats.hp = op->stats.maxhp; |
1107 | break; |
1113 | break; |
1108 | |
1114 | |
1109 | case SCROLL: |
1115 | case SCROLL: |
1110 | op->level = level_for_item (op, difficulty); |
1116 | op->level = level_for_item (op, difficulty); |
1111 | op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50); |
1117 | op->value *= value_factor_from_spell_item (op->inv, op); |
1112 | |
1118 | |
1113 | /* add exp so reading them properly gives xp */ |
1119 | /* add exp so reading them properly gives xp */ |
1114 | op->stats.exp = op->value / 5; |
1120 | op->stats.exp = op->value / 5; |
1115 | op->nrof = op->inv->nrof; |
1121 | op->nrof = op->inv->nrof; |
1116 | break; |
1122 | break; |
… | |
… | |
1124 | break; |
1130 | break; |
1125 | } /* switch type */ |
1131 | } /* switch type */ |
1126 | |
1132 | |
1127 | if (flags & GT_STARTEQUIP) |
1133 | if (flags & GT_STARTEQUIP) |
1128 | { |
1134 | { |
1129 | if (op->nrof < 2 && op->type != CONTAINER && op->type != MONEY && !QUERY_FLAG (op, FLAG_IS_THROWN)) |
1135 | if (op->nrof < 2 && op->type != CONTAINER && op->type != MONEY && !op->flag [FLAG_IS_THROWN]) |
1130 | SET_FLAG (op, FLAG_STARTEQUIP); |
1136 | op->set_flag (FLAG_STARTEQUIP); |
1131 | else if (op->type != MONEY) |
1137 | else if (op->type != MONEY) |
1132 | op->value = 0; |
1138 | op->value = 0; |
1133 | } |
1139 | } |
1134 | |
1140 | |
1135 | if (!(flags & GT_ENVIRONMENT)) |
1141 | if (!(flags & GT_ENVIRONMENT)) |
… | |
… | |
1146 | |
1152 | |
1147 | /* |
1153 | /* |
1148 | * Allocate and return the pointer to an empty artifactlist structure. |
1154 | * Allocate and return the pointer to an empty artifactlist structure. |
1149 | */ |
1155 | */ |
1150 | static artifactlist * |
1156 | static artifactlist * |
1151 | get_empty_artifactlist (void) |
1157 | get_empty_artifactlist () |
1152 | { |
1158 | { |
1153 | return salloc0<artifactlist> (); |
1159 | return salloc0<artifactlist> (); |
1154 | } |
1160 | } |
1155 | |
1161 | |
1156 | /* |
1162 | /* |
1157 | * Allocate and return the pointer to an empty artifact structure. |
1163 | * Allocate and return the pointer to an empty artifact structure. |
1158 | */ |
1164 | */ |
1159 | static artifact * |
1165 | static artifact * |
1160 | get_empty_artifact (void) |
1166 | get_empty_artifact () |
1161 | { |
1167 | { |
1162 | return salloc0<artifact> (); |
1168 | return salloc0<artifact> (); |
1163 | } |
1169 | } |
1164 | |
1170 | |
1165 | /* |
1171 | /* |
… | |
… | |
1178 | |
1184 | |
1179 | /* |
1185 | /* |
1180 | * Builds up the lists of artifacts from the file in the libdir. |
1186 | * Builds up the lists of artifacts from the file in the libdir. |
1181 | */ |
1187 | */ |
1182 | void |
1188 | void |
1183 | init_artifacts (void) |
1189 | init_artifacts () |
1184 | { |
1190 | { |
1185 | static int has_been_inited = 0; |
1191 | static int has_been_inited = 0; |
1186 | char filename[MAX_BUF]; |
|
|
1187 | artifact *art = NULL; |
1192 | artifact *art = NULL; |
1188 | artifactlist *al; |
1193 | artifactlist *al; |
1189 | |
1194 | |
1190 | if (has_been_inited) |
1195 | if (has_been_inited) |
1191 | return; |
1196 | return; |
1192 | else |
1197 | else |
1193 | has_been_inited = 1; |
1198 | has_been_inited = 1; |
1194 | |
1199 | |
1195 | sprintf (filename, "%s/artifacts", settings.datadir); |
1200 | object_thawer f (settings.datadir, "artifacts"); |
1196 | object_thawer f (filename); |
|
|
1197 | |
1201 | |
1198 | if (!f) |
1202 | if (!f) |
1199 | return; |
1203 | return; |
1200 | |
1204 | |
1201 | for (;;) |
1205 | for (;;) |
… | |
… | |
1208 | |
1212 | |
1209 | { |
1213 | { |
1210 | if (!strcmp (f.get_str (), "all")) |
1214 | if (!strcmp (f.get_str (), "all")) |
1211 | break; |
1215 | break; |
1212 | |
1216 | |
1213 | char *next, *cp = f.get_str (); |
1217 | const char *cp = f.get_str (); |
1214 | |
1218 | char *next; |
1215 | do |
1219 | do |
1216 | { |
1220 | { |
1217 | if ((next = strchr (cp, ','))) |
1221 | if ((next = (char *)strchr (cp, ','))) |
1218 | *next++ = '\0'; |
1222 | *next++ = '\0'; |
1219 | |
1223 | |
1220 | linked_char *tmp = new linked_char; |
1224 | linked_char *tmp = new linked_char; |
1221 | |
1225 | |
1222 | tmp->name = cp; |
1226 | tmp->name = cp; |
… | |
… | |
1286 | } |
1290 | } |
1287 | #if 0 |
1291 | #if 0 |
1288 | LOG (llevDebug, "Artifact list type %d has %d total chance\n", al->type, al->total_chance); |
1292 | LOG (llevDebug, "Artifact list type %d has %d total chance\n", al->type, al->total_chance); |
1289 | #endif |
1293 | #endif |
1290 | } |
1294 | } |
1291 | |
|
|
1292 | LOG (llevDebug, "done.\n"); |
|
|
1293 | } |
1295 | } |
1294 | |
1296 | |
1295 | /* |
1297 | /* |
1296 | * Used in artifact generation. The bonuses of the first object |
1298 | * Used in artifact generation. The bonuses of the first object |
1297 | * is modified by the bonuses of the second object. |
1299 | * is modified by the bonuses of the second object. |
1298 | */ |
1300 | */ |
1299 | void |
1301 | void |
1300 | add_abilities (object *op, object *change) |
1302 | add_abilities (object *op, object *change) |
1301 | { |
1303 | { |
1302 | int i, tmp; |
|
|
1303 | |
|
|
1304 | if (change->face != blank_face) |
1304 | if (change->face != blank_face) |
1305 | { |
|
|
1306 | #ifdef TREASURE_VERBOSE |
|
|
1307 | LOG (llevDebug, "add_abilities change face: %d\n", change->face); |
|
|
1308 | #endif |
|
|
1309 | op->face = change->face; |
1305 | op->face = change->face; |
1310 | } |
|
|
1311 | |
1306 | |
1312 | for (i = 0; i < NUM_STATS; i++) |
1307 | for (int i = 0; i < NUM_STATS; i++) |
1313 | change_attr_value (&(op->stats), i, change->stats.stat (i)); |
1308 | change_attr_value (&(op->stats), i, change->stats.stat (i)); |
1314 | |
1309 | |
1315 | op->attacktype |= change->attacktype; |
1310 | op->attacktype |= change->attacktype; |
1316 | op->path_attuned |= change->path_attuned; |
1311 | op->path_attuned |= change->path_attuned; |
1317 | op->path_repelled |= change->path_repelled; |
1312 | op->path_repelled |= change->path_repelled; |
1318 | op->path_denied |= change->path_denied; |
1313 | op->path_denied |= change->path_denied; |
1319 | op->move_type |= change->move_type; |
1314 | op->move_type |= change->move_type; |
1320 | op->stats.luck += change->stats.luck; |
1315 | op->stats.luck += change->stats.luck; |
1321 | |
1316 | |
1322 | if (QUERY_FLAG (change, FLAG_CURSED)) |
1317 | static const struct copyflags : object::flags_t |
1323 | SET_FLAG (op, FLAG_CURSED); |
1318 | { |
1324 | if (QUERY_FLAG (change, FLAG_DAMNED)) |
1319 | copyflags () |
1325 | SET_FLAG (op, FLAG_DAMNED); |
1320 | { |
1326 | if ((QUERY_FLAG (change, FLAG_CURSED) || QUERY_FLAG (change, FLAG_DAMNED)) && op->magic > 0) |
1321 | set (FLAG_CURSED); |
|
|
1322 | set (FLAG_DAMNED); |
|
|
1323 | set (FLAG_LIFESAVE); |
|
|
1324 | set (FLAG_REFL_SPELL); |
|
|
1325 | set (FLAG_STEALTH); |
|
|
1326 | set (FLAG_XRAYS); |
|
|
1327 | set (FLAG_BLIND); |
|
|
1328 | set (FLAG_SEE_IN_DARK); |
|
|
1329 | set (FLAG_REFL_MISSILE); |
|
|
1330 | set (FLAG_MAKE_INVIS); |
|
|
1331 | } |
|
|
1332 | } copyflags; |
|
|
1333 | |
|
|
1334 | // we might want to just copy, but or'ing is what the original code did |
|
|
1335 | op->flag |= change->flag & copyflags; |
|
|
1336 | |
|
|
1337 | if ((change->flag [FLAG_CURSED] || change->flag [FLAG_DAMNED]) && op->magic > 0) |
1327 | set_abs_magic (op, -op->magic); |
1338 | set_abs_magic (op, -op->magic); |
1328 | |
1339 | |
1329 | if (QUERY_FLAG (change, FLAG_LIFESAVE)) |
1340 | if (change->flag [FLAG_STAND_STILL]) |
1330 | SET_FLAG (op, FLAG_LIFESAVE); |
|
|
1331 | if (QUERY_FLAG (change, FLAG_REFL_SPELL)) |
|
|
1332 | SET_FLAG (op, FLAG_REFL_SPELL); |
|
|
1333 | if (QUERY_FLAG (change, FLAG_STEALTH)) |
|
|
1334 | SET_FLAG (op, FLAG_STEALTH); |
|
|
1335 | if (QUERY_FLAG (change, FLAG_XRAYS)) |
|
|
1336 | SET_FLAG (op, FLAG_XRAYS); |
|
|
1337 | if (QUERY_FLAG (change, FLAG_BLIND)) |
|
|
1338 | SET_FLAG (op, FLAG_BLIND); |
|
|
1339 | if (QUERY_FLAG (change, FLAG_SEE_IN_DARK)) |
|
|
1340 | SET_FLAG (op, FLAG_SEE_IN_DARK); |
|
|
1341 | if (QUERY_FLAG (change, FLAG_REFL_MISSILE)) |
|
|
1342 | SET_FLAG (op, FLAG_REFL_MISSILE); |
|
|
1343 | if (QUERY_FLAG (change, FLAG_MAKE_INVIS)) |
|
|
1344 | SET_FLAG (op, FLAG_MAKE_INVIS); |
|
|
1345 | |
|
|
1346 | if (QUERY_FLAG (change, FLAG_STAND_STILL)) |
|
|
1347 | { |
1341 | { |
1348 | CLEAR_FLAG (op, FLAG_ANIMATE); |
1342 | op->clr_flag (FLAG_ANIMATE); |
|
|
1343 | |
1349 | /* so artifacts will join */ |
1344 | /* so artifacts will join */ |
1350 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1345 | if (!op->flag [FLAG_ALIVE]) |
1351 | op->speed = 0.0; |
1346 | op->speed = 0.; |
1352 | |
1347 | |
1353 | op->set_speed (op->speed); |
1348 | op->set_speed (op->speed); |
1354 | } |
1349 | } |
1355 | |
1350 | |
1356 | if (change->nrof) |
1351 | if (change->nrof) |
1357 | op->nrof = rndm (change->nrof) + 1; |
1352 | op->nrof = rndm (change->nrof) + 1; |
1358 | |
1353 | |
1359 | op->stats.exp += change->stats.exp; /* Speed modifier */ |
1354 | op->stats.exp += change->stats.exp; /* Speed modifier */ |
1360 | op->stats.wc += change->stats.wc; |
1355 | op->stats.wc += change->stats.wc; |
1361 | op->stats.ac += change->stats.ac; |
1356 | op->stats.ac += change->stats.ac; |
1362 | |
1357 | |
1363 | if (change->other_arch) |
1358 | if (change->other_arch) |
1364 | { |
1359 | { |
1365 | /* Basically, for horns & potions, the other_arch field is the spell |
1360 | /* Basically, for horns & potions, the other_arch field is the spell |
1366 | * to cast. So convert that to into a spell and put it into |
1361 | * to cast. So convert that to into a spell and put it into |
… | |
… | |
1369 | if (op->type == HORN || op->type == POTION) |
1364 | if (op->type == HORN || op->type == POTION) |
1370 | { |
1365 | { |
1371 | /* Remove any spells this object currently has in it */ |
1366 | /* Remove any spells this object currently has in it */ |
1372 | op->destroy_inv (false); |
1367 | op->destroy_inv (false); |
1373 | |
1368 | |
1374 | object *tmp = arch_to_object (change->other_arch); |
1369 | object *tmp = change->other_arch->instance (); |
1375 | insert_ob_in_ob (tmp, op); |
1370 | insert_ob_in_ob (tmp, op); |
1376 | } |
1371 | } |
|
|
1372 | |
1377 | /* No harm setting this for potions/horns */ |
1373 | /* No harm setting this for potions/horns */ |
1378 | op->other_arch = change->other_arch; |
1374 | op->other_arch = change->other_arch; |
1379 | } |
1375 | } |
1380 | |
1376 | |
1381 | if (change->stats.hp < 0) |
1377 | if (change->stats.hp < 0) |
… | |
… | |
1397 | op->stats.maxsp = -change->stats.maxsp; |
1393 | op->stats.maxsp = -change->stats.maxsp; |
1398 | else |
1394 | else |
1399 | op->stats.maxsp += change->stats.maxsp; |
1395 | op->stats.maxsp += change->stats.maxsp; |
1400 | |
1396 | |
1401 | if (change->stats.food < 0) |
1397 | if (change->stats.food < 0) |
1402 | op->stats.food = -(change->stats.food); |
1398 | op->stats.food = -change->stats.food; |
1403 | else |
1399 | else |
1404 | op->stats.food += change->stats.food; |
1400 | op->stats.food += change->stats.food; |
1405 | |
1401 | |
1406 | if (change->level < 0) |
1402 | if (change->level < 0) |
1407 | op->level = -(change->level); |
1403 | op->level = -change->level; |
1408 | else |
1404 | else |
1409 | op->level += change->level; |
1405 | op->level += change->level; |
1410 | |
1406 | |
1411 | if (change->gen_sp_armour < 0) |
1407 | if (change->gen_sp_armour < 0) |
1412 | op->gen_sp_armour = -(change->gen_sp_armour); |
1408 | op->gen_sp_armour = -change->gen_sp_armour; |
1413 | else |
1409 | else |
1414 | op->gen_sp_armour = (op->gen_sp_armour * (change->gen_sp_armour)) / 100; |
1410 | op->gen_sp_armour = op->gen_sp_armour * (int)change->gen_sp_armour / 100; |
1415 | |
1411 | |
1416 | op->item_power = change->item_power; |
1412 | op->item_power = change->item_power; |
1417 | |
1413 | |
1418 | for (i = 0; i < NROFATTACKS; i++) |
1414 | for (int i = 0; i < NROFATTACKS; i++) |
1419 | if (change->resist[i]) |
|
|
1420 | op->resist[i] += change->resist[i]; |
1415 | op->resist[i] += change->resist[i]; |
1421 | |
1416 | |
1422 | if (change->stats.dam) |
1417 | if (change->stats.dam) |
1423 | { |
1418 | { |
1424 | if (change->stats.dam < 0) |
1419 | if (change->stats.dam < 0) |
1425 | op->stats.dam = (-change->stats.dam); |
1420 | op->stats.dam = -change->stats.dam; |
1426 | else if (op->stats.dam) |
1421 | else if (op->stats.dam) |
1427 | { |
1422 | { |
1428 | tmp = (signed char) (((int) op->stats.dam * (int) change->stats.dam) / 10); |
1423 | int tmp = op->stats.dam * change->stats.dam / 10; |
|
|
1424 | |
1429 | if (tmp == op->stats.dam) |
1425 | if (tmp == op->stats.dam) |
1430 | { |
1426 | { |
1431 | if (change->stats.dam < 10) |
1427 | if (change->stats.dam < 10) |
1432 | op->stats.dam--; |
1428 | op->stats.dam--; |
1433 | else |
1429 | else |
… | |
… | |
1439 | } |
1435 | } |
1440 | |
1436 | |
1441 | if (change->weight) |
1437 | if (change->weight) |
1442 | { |
1438 | { |
1443 | if (change->weight < 0) |
1439 | if (change->weight < 0) |
1444 | op->weight = (-change->weight); |
1440 | op->weight = -change->weight; |
1445 | else |
1441 | else |
1446 | op->weight = (op->weight * (change->weight)) / 100; |
1442 | op->weight = op->weight * change->weight / 100; |
1447 | } |
1443 | } |
1448 | |
1444 | |
1449 | if (change->last_sp) |
1445 | if (change->last_sp) |
1450 | { |
1446 | { |
1451 | if (change->last_sp < 0) |
1447 | if (change->last_sp < 0) |
1452 | op->last_sp = (-change->last_sp); |
1448 | op->last_sp = -change->last_sp; |
1453 | else |
1449 | else |
1454 | op->last_sp = (signed char) (((int) op->last_sp * (int) change->last_sp) / (int) 100); |
1450 | op->last_sp = op->last_sp * (int)change->last_sp / 100; |
1455 | } |
1451 | } |
1456 | |
1452 | |
1457 | if (change->gen_sp_armour) |
1453 | if (change->gen_sp_armour) |
1458 | { |
1454 | { |
1459 | if (change->gen_sp_armour < 0) |
1455 | if (change->gen_sp_armour < 0) |
1460 | op->gen_sp_armour = (-change->gen_sp_armour); |
1456 | op->gen_sp_armour = -change->gen_sp_armour; |
1461 | else |
1457 | else |
1462 | op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100); |
1458 | op->gen_sp_armour = op->gen_sp_armour * (int)change->gen_sp_armour / 100; |
1463 | } |
1459 | } |
1464 | |
1460 | |
1465 | op->value *= change->value; |
1461 | op->value *= change->value; |
1466 | |
1462 | |
1467 | if (change->materials) |
1463 | if (change->materials) |
1468 | op->materials = change->materials; |
1464 | op->materials = change->materials; |
1469 | |
1465 | |
1470 | if (change->materialname) |
1466 | if (change->material != MATERIAL_NULL) |
1471 | op->materialname = change->materialname; |
1467 | op->material = change->material; |
1472 | |
1468 | |
1473 | if (change->slaying) |
1469 | if (change->slaying) |
1474 | op->slaying = change->slaying; |
1470 | op->slaying = change->slaying; |
1475 | |
1471 | |
1476 | if (change->race) |
1472 | if (change->race) |
… | |
… | |
1499 | name = tmp->name + 1, neg = 1; |
1495 | name = tmp->name + 1, neg = 1; |
1500 | else |
1496 | else |
1501 | name = tmp->name, neg = 0; |
1497 | name = tmp->name, neg = 0; |
1502 | |
1498 | |
1503 | /* If we match name, then return the opposite of 'neg' */ |
1499 | /* If we match name, then return the opposite of 'neg' */ |
1504 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname))) |
1500 | if (!strcmp (name, op->arch->archname)) |
1505 | return !neg; |
1501 | return !neg; |
1506 | |
1502 | |
1507 | /* Set success as true, since if the match was an inverse, it means |
1503 | /* Set success as true, since if the match was an inverse, it means |
1508 | * everything is allowed except what we match |
1504 | * everything is allowed except what we match |
1509 | */ |
1505 | */ |
… | |
… | |
1520 | */ |
1516 | */ |
1521 | |
1517 | |
1522 | void |
1518 | void |
1523 | give_artifact_abilities (object *op, object *artifct) |
1519 | give_artifact_abilities (object *op, object *artifct) |
1524 | { |
1520 | { |
1525 | char new_name[MAX_BUF]; |
1521 | op->title = format ("of %s", &artifct->name); |
1526 | |
1522 | |
1527 | sprintf (new_name, "of %s", &artifct->name); |
|
|
1528 | op->title = new_name; |
|
|
1529 | add_abilities (op, artifct); /* Give out the bonuses */ |
1523 | add_abilities (op, artifct); /* Give out the bonuses */ |
1530 | |
1524 | |
1531 | #if 0 /* Bit verbose, but keep it here until next time I need it... */ |
1525 | #if 0 /* Bit verbose, but keep it here until next time I need it... */ |
1532 | { |
1526 | { |
1533 | char identified = QUERY_FLAG (op, FLAG_IDENTIFIED); |
1527 | char identified = op->flag [FLAG_IDENTIFIED]; |
1534 | |
1528 | |
1535 | SET_FLAG (op, FLAG_IDENTIFIED); |
1529 | op->set_flag (FLAG_IDENTIFIED); |
1536 | LOG (llevDebug, "Generated artifact %s %s [%s]\n", op->name, op->title, describe_item (op, NULL)); |
1530 | LOG (llevDebug, "Generated artifact %s %s [%s]\n", op->name, op->title, describe_item (op, NULL)); |
1537 | if (!identified) |
1531 | if (!identified) |
1538 | CLEAR_FLAG (op, FLAG_IDENTIFIED); |
1532 | op->clr_flag (FLAG_IDENTIFIED); |
1539 | } |
1533 | } |
1540 | #endif |
1534 | #endif |
1541 | return; |
1535 | return; |
1542 | } |
1536 | } |
1543 | |
1537 | |
… | |
… | |
1553 | #define ARTIFACT_TRIES 2 |
1547 | #define ARTIFACT_TRIES 2 |
1554 | |
1548 | |
1555 | void |
1549 | void |
1556 | generate_artifact (object *op, int difficulty) |
1550 | generate_artifact (object *op, int difficulty) |
1557 | { |
1551 | { |
1558 | artifactlist *al; |
|
|
1559 | artifact *art; |
1552 | artifact *art; |
1560 | int i; |
|
|
1561 | |
1553 | |
1562 | al = find_artifactlist (op->type); |
1554 | artifactlist *al = find_artifactlist (op->type); |
1563 | |
1555 | |
1564 | if (al == NULL) |
1556 | if (al == NULL) |
1565 | { |
1557 | { |
1566 | #if 0 /* This is too verbose, usually */ |
1558 | #if 0 /* This is too verbose, usually */ |
1567 | LOG (llevDebug, "Couldn't change %s into artifact - no table.\n", op->name); |
1559 | LOG (llevDebug, "Couldn't change %s into artifact - no table.\n", op->name); |
1568 | #endif |
1560 | #endif |
1569 | return; |
1561 | return; |
1570 | } |
1562 | } |
1571 | |
1563 | |
1572 | for (i = 0; i < ARTIFACT_TRIES; i++) |
1564 | for (int i = 0; i < ARTIFACT_TRIES; i++) |
1573 | { |
1565 | { |
1574 | int roll = rndm (al->total_chance); |
1566 | int roll = rndm (al->total_chance); |
1575 | |
1567 | |
1576 | for (art = al->items; art; art = art->next) |
1568 | for (art = al->items; art; art = art->next) |
1577 | { |
1569 | { |
… | |
… | |
1617 | */ |
1609 | */ |
1618 | |
1610 | |
1619 | void |
1611 | void |
1620 | fix_flesh_item (object *item, object *donor) |
1612 | fix_flesh_item (object *item, object *donor) |
1621 | { |
1613 | { |
1622 | char tmpbuf[MAX_BUF]; |
|
|
1623 | int i; |
|
|
1624 | |
|
|
1625 | if (item->type == FLESH && donor) |
1614 | if (item->type == FLESH && donor) |
1626 | { |
1615 | { |
1627 | /* change the name */ |
1616 | /* change the name */ |
1628 | sprintf (tmpbuf, "%s's %s", &donor->name, &item->name); |
1617 | item->name = format ("%s's %s", &donor->name, &item->name); |
1629 | item->name = tmpbuf; |
|
|
1630 | sprintf (tmpbuf, "%s's %s", &donor->name, &item->name_pl); |
1618 | item->name_pl = format ("%s's %s", &donor->name, &item->name_pl); |
1631 | item->name_pl = tmpbuf; |
|
|
1632 | |
1619 | |
1633 | /* weight is FLESH weight/100 * donor */ |
1620 | /* weight is FLESH weight/100 * donor */ |
1634 | if ((item->weight = (signed long) (((double) item->weight / (double) 100.0) * (double) donor->weight)) == 0) |
1621 | item->weight = max (1, item->weight * donor->weight / 100); |
1635 | item->weight = 1; |
|
|
1636 | |
1622 | |
1637 | /* value is multiplied by level of donor */ |
1623 | /* value is multiplied by level of donor */ |
1638 | item->value *= isqrt (donor->level * 2); |
1624 | item->value *= isqrt (donor->level * 2); |
1639 | |
1625 | |
1640 | /* food value */ |
1626 | /* food value */ |
1641 | item->stats.food += (donor->stats.hp / 100) + donor->stats.Con; |
1627 | item->stats.food += donor->stats.hp / 100 + donor->stats.Con; |
1642 | |
1628 | |
1643 | /* flesh items inherit some abilities of donor, but not |
1629 | /* flesh items inherit some abilities of donor, but not |
1644 | * full effect. |
1630 | * full effect. |
1645 | */ |
1631 | */ |
1646 | for (i = 0; i < NROFATTACKS; i++) |
1632 | for (int i = 0; i < NROFATTACKS; i++) |
1647 | item->resist[i] = donor->resist[i] / 2; |
1633 | item->resist[i] = donor->resist[i] / 2; |
1648 | |
1634 | |
1649 | /* item inherits donor's level (important for quezals) */ |
1635 | /* item inherits donor's level (important for quezals) */ |
1650 | item->level = donor->level; |
1636 | item->level = donor->level; |
1651 | |
1637 | |
1652 | /* if donor has some attacktypes, the flesh is poisonous */ |
1638 | /* if donor has some attacktypes, the flesh is poisonous */ |
1653 | if (donor->attacktype & AT_POISON) |
1639 | if (donor->attacktype & AT_POISON) |
1654 | item->type = POISON; |
1640 | item->type = POISON; |
1655 | |
1641 | |
1656 | if (donor->attacktype & AT_ACID) |
1642 | if (donor->attacktype & AT_ACID) |
1657 | item->stats.hp = -1 * item->stats.food; |
1643 | item->stats.hp = -item->stats.food; |
1658 | |
1644 | |
1659 | SET_FLAG (item, FLAG_NO_STEAL); |
1645 | item->set_flag (FLAG_NO_STEAL); |
1660 | } |
1646 | } |
1661 | } |
1647 | } |
1662 | |
1648 | |
1663 | static void |
1649 | static void |
1664 | free_treasurestruct (treasure *t) |
1650 | free_treasurestruct (treasure *t) |