ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/treasure.C
Revision: 1.69
Committed: Tue Jan 22 15:53:01 2008 UTC (16 years, 4 months ago) by root
Content type: text/plain
Branch: MAIN
CVS Tags: rel-2_42, rel-2_41
Changes since 1.68: +2 -2 lines
Log Message:
add some primitive memory debugging

File Contents

# Content
1 /*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 *
8 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 *
21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */
23
24 /* TREASURE_DEBUG does some checking on the treasurelists after loading.
25 * It is useful for finding bugs in the treasures file. Since it only
26 * slows the startup some (and not actual game play), it is by default
27 * left on
28 */
29 #define TREASURE_DEBUG
30
31 /* TREASURE_VERBOSE enables copious output concerning artifact generation */
32
33 //#define TREASURE_VERBOSE
34
35 #include <global.h>
36 #include <treasure.h>
37 #include <funcpoint.h>
38 #include <loader.h>
39
40 extern char *spell_mapping[];
41
42 static treasurelist *first_treasurelist;
43
44 static void change_treasure (treasure *t, object *op); /* overrule default values */
45
46 typedef std::tr1::unordered_map<
47 const char *,
48 treasurelist *,
49 str_hash,
50 str_equal,
51 slice_allocator< std::pair<const char *const, treasurelist *> >,
52 true
53 > tl_map_t;
54
55 static tl_map_t tl_map;
56
57 /*
58 * Searches for the given treasurelist
59 */
60 treasurelist *
61 treasurelist::find (const char *name)
62 {
63 if (!name)
64 return 0;
65
66 auto (i, tl_map.find (name));
67
68 if (i == tl_map.end ())
69 return 0;
70
71 return i->second;
72 }
73
74 /*
75 * Searches for the given treasurelist in the globally linked list
76 * of treasurelists which has been built by load_treasures().
77 */
78 treasurelist *
79 treasurelist::get (const char *name)
80 {
81 treasurelist *tl = find (name);
82
83 if (!tl)
84 {
85 tl = new treasurelist;
86
87 tl->name = name;
88 tl->next = first_treasurelist;
89 first_treasurelist = tl;
90
91 tl_map.insert (std::make_pair (tl->name, tl));
92 }
93
94 return tl;
95 }
96
97 //TODO: class method
98 void
99 clear (treasurelist *tl)
100 {
101 if (tl->items)
102 {
103 free_treasurestruct (tl->items);
104 tl->items = 0;
105 }
106
107 tl->total_chance = 0;
108 }
109
110 #ifdef TREASURE_DEBUG
111 /* recursived checks the linked list. Treasurelist is passed only
112 * so that the treasure name can be printed out
113 */
114 static void
115 check_treasurelist (const treasure *t, const treasurelist * tl)
116 {
117 if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
118 LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
119
120 if (t->next)
121 check_treasurelist (t->next, tl);
122
123 if (t->next_yes)
124 check_treasurelist (t->next_yes, tl);
125
126 if (t->next_no)
127 check_treasurelist (t->next_no, tl);
128 }
129 #endif
130
131 /*
132 * Reads the lib/treasure file from disk, and parses the contents
133 * into an internal treasure structure (very linked lists)
134 */
135 static treasure *
136 read_treasure (object_thawer &f)
137 {
138 treasure *t = new treasure;
139
140 f.next ();
141
142 for (;;)
143 {
144 coroapi::cede_to_tick_every (10);
145
146 switch (f.kw)
147 {
148 case KW_arch:
149 t->item = archetype::get (f.get_str ());
150 break;
151
152 case KW_list: f.get (t->name); break;
153 case KW_change_name: f.get (t->change_arch.name); break;
154 case KW_change_title: f.get (t->change_arch.title); break;
155 case KW_change_slaying: f.get (t->change_arch.slaying); break;
156 case KW_chance: f.get (t->chance); break;
157 case KW_nrof: f.get (t->nrof); break;
158 case KW_magic: f.get (t->magic); break;
159
160 case KW_yes: t->next_yes = read_treasure (f); continue;
161 case KW_no: t->next_no = read_treasure (f); continue;
162
163 case KW_end:
164 f.next ();
165 return t;
166
167 case KW_more:
168 t->next = read_treasure (f);
169 return t;
170
171 default:
172 if (!f.parse_error ("treasurelist", t->name))
173 return 0;
174
175 return t;
176 }
177
178 f.next ();
179 }
180 }
181
182 /*
183 * Each treasure is parsed with the help of load_treasure().
184 */
185 treasurelist *
186 treasurelist::read (object_thawer &f)
187 {
188 assert (f.kw == KW_treasure || f.kw == KW_treasureone);
189
190 bool one = f.kw == KW_treasureone;
191 treasurelist *tl = treasurelist::get (f.get_str ());
192 clear (tl);
193 tl->items = read_treasure (f);
194 if (!tl->items)
195 return 0;
196
197 /* This is a one of the many items on the list should be generated.
198 * Add up the chance total, and check to make sure the yes & no
199 * fields of the treasures are not being used.
200 */
201 if (one)
202 {
203 for (treasure *t = tl->items; t; t = t->next)
204 {
205 if (t->next_yes || t->next_no)
206 {
207 LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->archname : &t->name);
208 LOG (llevError, " the next_yes or next_no field is set\n");
209 }
210
211 tl->total_chance += t->chance;
212 }
213 }
214
215 return tl;
216 }
217
218 /*
219 * Generates the objects specified by the given treasure.
220 * It goes recursively through the rest of the linked list.
221 * If there is a certain percental chance for a treasure to be generated,
222 * this is taken into consideration.
223 * The second argument specifies for which object the treasure is
224 * being generated.
225 * If flag is GT_INVISIBLE, only invisible objects are generated (ie, only
226 * abilities. This is used by summon spells, thus no summoned monsters
227 * start with equipment, but only their abilities).
228 */
229 static void
230 put_treasure (object *op, object *creator, int flags)
231 {
232 if (flags & GT_ENVIRONMENT)
233 {
234 /* Bit of a hack - spells should never be put onto the map. The entire
235 * treasure stuff is a problem - there is no clear idea of knowing
236 * this is the original object, or if this is an object that should be created
237 * by another object.
238 */
239 //TODO: flag such as objects... as such (no drop, anybody?)
240 if (op->type == SPELL)
241 {
242 op->destroy ();
243 return;
244 }
245
246 op->expand_tail ();
247
248 if (op->blocked (creator->map, creator->x, creator->y))
249 op->destroy ();
250 else
251 {
252 SET_FLAG (op, FLAG_OBJ_ORIGINAL);
253 op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);
254 }
255 }
256 else
257 {
258 op = creator->insert (op);
259
260 if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
261 monster_check_apply (creator, op);
262
263 if (flags & GT_UPDATE_INV)
264 if (object *tmp = creator->in_player ())
265 esrv_send_item (tmp, op);
266 }
267 }
268
269 /* if there are change_xxx commands in the treasure, we include the changes
270 * in the generated object
271 */
272 static void
273 change_treasure (treasure *t, object *op)
274 {
275 /* CMD: change_name xxxx */
276 if (t->change_arch.name)
277 {
278 op->name = t->change_arch.name;
279 op->name_pl = t->change_arch.name;
280 }
281
282 if (t->change_arch.title)
283 op->title = t->change_arch.title;
284
285 if (t->change_arch.slaying)
286 op->slaying = t->change_arch.slaying;
287 }
288
289 static void
290 create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries)
291 {
292 if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance)
293 {
294 if (t->name)
295 {
296 if (difficulty >= t->magic)
297 if (treasurelist *tl = treasurelist::find (t->name))
298 create_treasure (tl, op, flag, difficulty, tries);
299 else
300 LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
301 }
302 else
303 {
304 if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE)))
305 {
306 object *tmp = arch_to_object (t->item);
307
308 if (t->nrof && tmp->nrof <= 1)
309 tmp->nrof = rndm (t->nrof) + 1;
310
311 fix_generated_item (tmp, op, difficulty, t->magic, flag);
312 change_treasure (t, tmp);
313 put_treasure (tmp, op, flag);
314 }
315 }
316
317 if (t->next_yes)
318 create_all_treasures (t->next_yes, op, flag, difficulty, tries);
319 }
320 else if (t->next_no)
321 create_all_treasures (t->next_no, op, flag, difficulty, tries);
322
323 if (t->next)
324 create_all_treasures (t->next, op, flag, difficulty, tries);
325 }
326
327 static void
328 create_one_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
329 {
330 int value = rndm (tl->total_chance);
331 treasure *t;
332
333 if (tries++ > 100)
334 {
335 LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");
336 return;
337 }
338
339 for (t = tl->items; t; t = t->next)
340 {
341 value -= t->chance;
342
343 if (value < 0)
344 break;
345 }
346
347 if (!t || value >= 0)
348 cleanup ("create_one_treasure: got null object or not able to find treasure\n", 1);
349
350 if (t->name)
351 {
352 if (difficulty >= t->magic)
353 {
354 treasurelist *tl = treasurelist::find (t->name);
355 if (tl)
356 create_treasure (tl, op, flag, difficulty, tries);
357 }
358 else if (t->nrof)
359 create_one_treasure (tl, op, flag, difficulty, tries);
360 }
361 else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE))
362 {
363 if (object *tmp = arch_to_object (t->item))
364 {
365 if (t->nrof && tmp->nrof <= 1)
366 tmp->nrof = rndm (t->nrof) + 1;
367
368 fix_generated_item (tmp, op, difficulty, t->magic, flag);
369 change_treasure (t, tmp);
370 put_treasure (tmp, op, flag);
371 }
372 }
373 }
374
375 void
376 object::create_treasure (treasurelist *tl, int flags)
377 {
378 ::create_treasure (tl, this, flags, map ? map->difficulty : 0);
379 }
380
381 /* This calls the appropriate treasure creation function. tries is passed
382 * to determine how many list transitions or attempts to create treasure
383 * have been made. It is really in place to prevent infinite loops with
384 * list transitions, or so that excessively good treasure will not be
385 * created on weak maps, because it will exceed the number of allowed tries
386 * to do that.
387 */
388 void
389 create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
390 {
391 // empty treasurelists are legal
392 if (!tl->items)
393 return;
394
395 if (tries++ > 100)
396 {
397 LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
398 return;
399 }
400
401 if (op->flag [FLAG_TREASURE_ENV])
402 {
403 // do not generate items when there already is something above the object
404 if (op->flag [FLAG_IS_FLOOR] && op->above)
405 return;
406
407 flag |= GT_ENVIRONMENT;
408 }
409
410 if (tl->total_chance)
411 create_one_treasure (tl, op, flag, difficulty, tries);
412 else
413 create_all_treasures (tl->items, op, flag, difficulty, tries);
414 }
415
416 /* This is similar to the old generate treasure function. However,
417 * it instead takes a treasurelist. It is really just a wrapper around
418 * create_treasure. We create a dummy object that the treasure gets
419 * inserted into, and then return that treausre
420 */
421 object *
422 generate_treasure (treasurelist *tl, int difficulty)
423 {
424 difficulty = clamp (difficulty, 1, settings.max_level);
425
426 object *ob = object::create ();
427
428 create_treasure (tl, ob, 0, difficulty, 0);
429
430 /* Don't want to free the object we are about to return */
431 object *tmp = ob->inv;
432 if (tmp)
433 tmp->remove ();
434
435 if (ob->inv)
436 LOG (llevError, "In generate treasure, created multiple objects.\n");
437
438 ob->destroy ();
439 return tmp;
440 }
441
442 /*
443 * This is a new way of calculating the chance for an item to have
444 * a specific magical bonus.
445 * The array has two arguments, the difficulty of the level, and the
446 * magical bonus "wanted".
447 */
448
449 static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
450 // chance of magic difficulty
451 // +0 +1 +2 +3 +4
452 {95, 2, 2, 1, 0}, // 1
453 {92, 5, 2, 1, 0}, // 2
454 {85, 10, 4, 1, 0}, // 3
455 {80, 14, 4, 2, 0}, // 4
456 {75, 17, 5, 2, 1}, // 5
457 {70, 18, 8, 3, 1}, // 6
458 {65, 21, 10, 3, 1}, // 7
459 {60, 22, 12, 4, 2}, // 8
460 {55, 25, 14, 4, 2}, // 9
461 {50, 27, 16, 5, 2}, // 10
462 {45, 28, 18, 6, 3}, // 11
463 {42, 28, 20, 7, 3}, // 12
464 {40, 27, 21, 8, 4}, // 13
465 {38, 25, 22, 10, 5}, // 14
466 {36, 23, 23, 12, 6}, // 15
467 {33, 21, 24, 14, 8}, // 16
468 {31, 19, 25, 16, 9}, // 17
469 {27, 15, 30, 18, 10}, // 18
470 {20, 12, 30, 25, 13}, // 19
471 {15, 10, 28, 30, 17}, // 20
472 {13, 9, 27, 28, 23}, // 21
473 {10, 8, 25, 28, 29}, // 22
474 { 8, 7, 23, 26, 36}, // 23
475 { 6, 6, 20, 22, 46}, // 24
476 { 4, 5, 17, 18, 56}, // 25
477 { 2, 4, 12, 14, 68}, // 26
478 { 0, 3, 7, 10, 80}, // 27
479 { 0, 0, 3, 7, 90}, // 28
480 { 0, 0, 0, 3, 97}, // 29
481 { 0, 0, 0, 0, 100}, // 30
482 { 0, 0, 0, 0, 100}, // 31
483 };
484
485 /* calculate the appropriate level for wands staves and scrolls.
486 * This code presumes that op has had its spell object created (in op->inv)
487 *
488 * elmex Wed Aug 9 17:44:59 CEST 2006:
489 * Removed multiplicator, too many high-level items were generated on low-difficulty maps.
490 */
491 int
492 level_for_item (const object *op, int difficulty)
493 {
494 if (!op->inv)
495 {
496 LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);
497 return 0;
498 }
499
500 int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.));
501
502 if (olevel <= 0)
503 olevel = rndm (1, op->inv->level);
504
505 return min (olevel, MAXLEVEL);
506 }
507
508 /*
509 * Based upon the specified difficulty and upon the difftomagic_list array,
510 * a random magical bonus is returned. This is used when determine
511 * the magical bonus created on specific maps.
512 *
513 * elmex Thu Aug 10 18:45:44 CEST 2006:
514 * Scaling difficulty by max_level, as difficulty is a level and not some
515 * weird integer between 1-31.
516 *
517 */
518 int
519 magic_from_difficulty (int difficulty)
520 {
521 int percent = 0, magic = 0;
522 int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
523
524 scaled_diff--;
525
526 if (scaled_diff < 0)
527 scaled_diff = 0;
528
529 if (scaled_diff >= DIFFLEVELS)
530 scaled_diff = DIFFLEVELS - 1;
531
532 percent = rndm (100);
533
534 for (magic = 0; magic < (MAXMAGIC + 1); magic++)
535 {
536 percent -= difftomagic_list[scaled_diff][magic];
537
538 if (percent < 0)
539 break;
540 }
541
542 if (magic == (MAXMAGIC + 1))
543 {
544 LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);
545 magic = 0;
546 }
547
548 magic = (rndm (3)) ? magic : -magic;
549 /* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */
550
551 return magic;
552 }
553
554 /*
555 * Sets magical bonus in an object, and recalculates the effect on
556 * the armour variable, and the effect on speed of armour.
557 * This function doesn't work properly, should add use of archetypes
558 * to make it truly absolute.
559 */
560
561 void
562 set_abs_magic (object *op, int magic)
563 {
564 if (!magic)
565 return;
566
567 op->magic = magic;
568 if (op->arch)
569 {
570 if (op->type == ARMOUR)
571 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
572
573 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
574 magic = (-magic);
575 op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
576 }
577 else
578 {
579 if (op->type == ARMOUR)
580 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
581 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
582 magic = (-magic);
583 op->weight = (op->weight * (100 - magic * 10)) / 100;
584 }
585 }
586
587 /*
588 * Sets a random magical bonus in the given object based upon
589 * the given difficulty, and the given max possible bonus.
590 */
591
592 static void
593 set_magic (int difficulty, object *op, int max_magic, int flags)
594 {
595 int i;
596
597 i = magic_from_difficulty (difficulty);
598 if ((flags & GT_ONLY_GOOD) && i < 0)
599 i = -i;
600 if (i > max_magic)
601 i = max_magic;
602 set_abs_magic (op, i);
603 if (i < 0)
604 SET_FLAG (op, FLAG_CURSED);
605 }
606
607 /*
608 * Randomly adds one magical ability to the given object.
609 * Modified for Partial Resistance in many ways:
610 * 1) Since rings can have multiple bonuses, if the same bonus
611 * is rolled again, increase it - the bonuses now stack with
612 * other bonuses previously rolled and ones the item might natively have.
613 * 2) Add code to deal with new PR method.
614 */
615 void
616 set_ring_bonus (object *op, int bonus)
617 {
618
619 int r = rndm (bonus > 0 ? 25 : 11);
620
621 if (op->type == AMULET)
622 {
623 if (!(rndm (21)))
624 r = 20 + rndm (2);
625 else
626 {
627 if (rndm (2))
628 r = 10;
629 else
630 r = 11 + rndm (9);
631 }
632 }
633
634 switch (r)
635 {
636 /* Redone by MSW 2000-11-26 to have much less code. Also,
637 * bonuses and penalties will stack and add to existing values.
638 * of the item.
639 */
640 case 0:
641 case 1:
642 case 2:
643 case 3:
644 case 4:
645 case 5:
646 case 6:
647 op->stats.stat (r) += bonus;
648 break;
649
650 case 7:
651 op->stats.dam += bonus;
652 break;
653
654 case 8:
655 op->stats.wc += bonus;
656 break;
657
658 case 9:
659 op->stats.food += bonus; /* hunger/sustenance */
660 break;
661
662 case 10:
663 op->stats.ac += bonus;
664 break;
665
666 /* Item that gives protections/vulnerabilities */
667 case 11:
668 case 12:
669 case 13:
670 case 14:
671 case 15:
672 case 16:
673 case 17:
674 case 18:
675 case 19:
676 {
677 int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
678
679 /* Roughly generate a bonus between 100 and 35 (depending on the bonus) */
680 val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
681
682 /* Cursed items need to have higher negative values to equal out with
683 * positive values for how protections work out. Put another
684 * little random element in since that they don't always end up with
685 * even values.
686 */
687 if (bonus < 0)
688 val = 2 * -val - rndm (b);
689 if (val > 35)
690 val = 35; /* Upper limit */
691 b = 0;
692
693 while (op->resist[resist_table[resist]] != 0 && b < 4)
694 resist = rndm (num_resist_table);
695
696 if (b == 4)
697 return; /* Not able to find a free resistance */
698
699 op->resist[resist_table[resist]] = val;
700 /* We should probably do something more clever here to adjust value
701 * based on how good a resistance we gave.
702 */
703 break;
704 }
705 case 20:
706 if (op->type == AMULET)
707 {
708 SET_FLAG (op, FLAG_REFL_SPELL);
709 op->value *= 11;
710 }
711 else
712 {
713 op->stats.hp = 1; /* regenerate hit points */
714 op->value *= 4;
715 }
716 break;
717
718 case 21:
719 if (op->type == AMULET)
720 {
721 SET_FLAG (op, FLAG_REFL_MISSILE);
722 op->value *= 9;
723 }
724 else
725 {
726 op->stats.sp = 1; /* regenerate spell points */
727 op->value *= 3;
728 }
729 break;
730
731 case 22:
732 op->stats.exp += bonus; /* Speed! */
733 op->value = (op->value * 2) / 3;
734 break;
735 }
736
737 if (bonus > 0)
738 op->value *= 2 * bonus;
739 else
740 op->value = -(op->value * 2 * bonus) / 3;
741 }
742
743 /*
744 * get_magic(diff) will return a random number between 0 and 4.
745 * diff can be any value above 2. The higher the diff-variable, the
746 * higher is the chance of returning a low number.
747 * It is only used in fix_generated_treasure() to set bonuses on
748 * rings and amulets.
749 * Another scheme is used to calculate the magic of weapons and armours.
750 */
751 int
752 get_magic (int diff)
753 {
754 int i;
755
756 if (diff < 3)
757 diff = 3;
758
759 for (i = 0; i < 4; i++)
760 if (rndm (diff))
761 return i;
762
763 return 4;
764 }
765
766 #define DICE2 (get_magic(2)==2?2:1)
767 #define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))
768
769 /*
770 * fix_generated_item(): This is called after an item is generated, in
771 * order to set it up right. This produced magical bonuses, puts spells
772 * into scrolls/books/wands, makes it unidentified, hides the value, etc.
773 */
774
775 /* 4/28/96 added creator object from which op may now inherit properties based on
776 * op->type. Right now, which stuff the creator passes on is object type
777 * dependant. I know this is a spagetti manuever, but is there a cleaner
778 * way to do this? b.t. */
779
780 /*
781 * ! (flags & GT_ENVIRONMENT):
782 * Automatically calls fix_flesh_item().
783 *
784 * flags:
785 * GT_STARTEQUIP: Sets FLAG_STARTEQIUP on item if appropriate, or clears the item's
786 * value.
787 * GT_MINIMAL: Does minimal processing on the object - just enough to make it
788 * a working object - don't change magic, value, etc, but set it material
789 * type as appropriate, for objects that need spell objects, set those, etc
790 */
791 void
792 fix_generated_item (object *op, object *creator, int difficulty, int max_magic, int flags)
793 {
794 int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;
795
796 if (!creator || creator->type == op->type)
797 creator = op; /*safety & to prevent polymorphed objects giving attributes */
798
799 /* If we make an artifact, this information will be destroyed */
800 save_item_power = op->item_power;
801 op->item_power = 0;
802
803 if (op->randomitems && op->type != SPELL)
804 {
805 create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0);
806 /* So the treasure doesn't get created again */
807 op->randomitems = 0;
808 }
809
810 if (difficulty < 1)
811 difficulty = 1;
812
813 if (INVOKE_OBJECT (ADD_BONUS, op,
814 ARG_OBJECT (creator != op ? creator : 0),
815 ARG_INT (difficulty), ARG_INT (max_magic),
816 ARG_INT (flags)))
817 return;
818
819 if (!(flags & GT_MINIMAL))
820 {
821 if (op->arch == crown_arch)
822 {
823 set_magic (difficulty, op, max_magic, flags);
824 num_enchantments = calc_item_power (op, 1);
825 generate_artifact (op, difficulty);
826 }
827 else
828 {
829 if (!op->magic && max_magic)
830 set_magic (difficulty, op, max_magic, flags);
831
832 num_enchantments = calc_item_power (op, 1);
833
834 if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
835 || op->type == HORN
836 || difficulty >= settings.max_level) /* high difficulties always generate an artifact,
837 * used for shop_floors or treasures */
838 generate_artifact (op, difficulty);
839 }
840
841 /* Object was made an artifact. Calculate its item_power rating.
842 * the item_power in the object is what the artfiact adds.
843 */
844 if (op->title)
845 {
846 /* if save_item_power is set, then most likely we started with an
847 * artifact and have added new abilities to it - this is rare, but
848 * but I have seen things like 'strange rings of fire'. So just figure
849 * out the power from the base power plus what this one adds. Note
850 * that since item_power is not quite linear, this actually ends up
851 * being somewhat of a bonus
852 */
853 if (save_item_power)
854 op->item_power = save_item_power + get_power_from_ench (op->item_power);
855 else
856 op->item_power = get_power_from_ench (op->item_power + num_enchantments);
857 }
858 else if (save_item_power)
859 {
860 /* restore the item_power field to the object if we haven't changed it.
861 * we don't care about num_enchantments - that will basically just
862 * have calculated some value from the base attributes of the archetype.
863 */
864 op->item_power = save_item_power;
865 }
866 else
867 {
868 /* item_power was zero. This is suspicious, as it may be because it
869 * was never previously calculated. Let's compute a value and see if
870 * it is non-zero. If it indeed is, then assign it as the new
871 * item_power value.
872 * - gros, 21th of July 2006.
873 */
874 op->item_power = calc_item_power (op, 0);
875 save_item_power = op->item_power; /* Just in case it would get used
876 * again below */
877 }
878 }
879
880 /* materialtype modifications. Note we allow this on artifacts. */
881 set_materialname (op, difficulty, NULL);
882
883 if (flags & GT_MINIMAL)
884 {
885 if (op->type == POTION)
886 /* Handle healing and magic power potions */
887 if (op->stats.sp && !op->randomitems)
888 {
889 object *tmp;
890
891 tmp = get_archetype (spell_mapping[op->stats.sp]);
892 insert_ob_in_ob (tmp, op);
893 op->stats.sp = 0;
894 }
895 }
896 else if (!op->title) /* Only modify object if not special */
897 switch (op->type)
898 {
899 case WEAPON:
900 case ARMOUR:
901 case SHIELD:
902 case HELMET:
903 case CLOAK:
904 if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
905 set_ring_bonus (op, -DICE2);
906 break;
907
908 case BRACERS:
909 if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
910 {
911 set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
912 if (!QUERY_FLAG (op, FLAG_CURSED))
913 op->value *= 3;
914 }
915 break;
916
917 case POTION:
918 {
919 int too_many_tries = 0, is_special = 0;
920
921 /* Handle healing and magic power potions */
922 if (op->stats.sp && !op->randomitems)
923 {
924 object *tmp;
925
926 tmp = get_archetype (spell_mapping[op->stats.sp]);
927 insert_ob_in_ob (tmp, op);
928 op->stats.sp = 0;
929 }
930
931 while (!(is_special = special_potion (op)) && !op->inv)
932 {
933 generate_artifact (op, difficulty);
934 if (too_many_tries++ > 10)
935 break;
936 }
937
938 /* don't want to change value for healing/magic power potions,
939 * since the value set on those is already correct.
940 */
941 if (op->inv && op->randomitems)
942 {
943 /* value multiplier is same as for scrolls */
944 op->value = (op->value * op->inv->value);
945 op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
946 }
947 else
948 {
949 op->name = "potion";
950 op->name_pl = "potions";
951 }
952
953 if (!(flags & GT_ONLY_GOOD) && rndm (2))
954 SET_FLAG (op, FLAG_CURSED);
955 break;
956 }
957
958 case AMULET:
959 if (op->arch == amulet_arch)
960 op->value *= 5; /* Since it's not just decoration */
961
962 case RING:
963 if (op->arch == NULL)
964 {
965 op->destroy ();
966 op = 0;
967 break;
968 }
969
970 if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */
971 break;
972
973 if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
974 SET_FLAG (op, FLAG_CURSED);
975
976 set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
977
978 if (op->type != RING) /* Amulets have only one ability */
979 break;
980
981 if (!(rndm (4)))
982 {
983 int d = (rndm (2) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
984
985 if (d > 0)
986 op->value *= 3;
987
988 set_ring_bonus (op, d);
989
990 if (!(rndm (4)))
991 {
992 int d = (rndm (3) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
993
994 if (d > 0)
995 op->value *= 5;
996 set_ring_bonus (op, d);
997 }
998 }
999
1000 if (GET_ANIM_ID (op))
1001 SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1002
1003 break;
1004
1005 case BOOK:
1006 /* Is it an empty book?, if yes lets make a special·
1007 * msg for it, and tailor its properties based on the·
1008 * creator and/or map level we found it on.
1009 */
1010 if (!op->msg && rndm (10))
1011 {
1012 /* set the book level properly */
1013 if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE))
1014 {
1015 if (op->map && op->map->difficulty)
1016 op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1017 else
1018 op->level = rndm (20) + 1;
1019 }
1020 else
1021 op->level = rndm (creator->level);
1022
1023 tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);
1024 /* books w/ info are worth more! */
1025 op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1));
1026 /* creator related stuff */
1027
1028 /* for library, chained books. Note that some monsters have no_pick
1029 * set - we don't want to set no pick in that case.
1030 */
1031 if (QUERY_FLAG (creator, FLAG_NO_PICK) && !QUERY_FLAG (creator, FLAG_MONSTER))
1032 SET_FLAG (op, FLAG_NO_PICK);
1033 if (creator->slaying && !op->slaying) /* for check_inv floors */
1034 op->slaying = creator->slaying;
1035
1036 /* add exp so reading it gives xp (once) */
1037 op->stats.exp = op->value > 10000 ? op->value / 5 : op->value / 10;
1038 }
1039 break;
1040
1041 case SPELLBOOK:
1042 op->value = op->value * op->inv->value;
1043 /* add exp so learning gives xp */
1044 op->level = op->inv->level;
1045 op->stats.exp = op->value;
1046 break;
1047
1048 case WAND:
1049 /* nrof in the treasure list is number of charges,
1050 * not number of wands. So copy that into food (charges),
1051 * and reset nrof.
1052 */
1053 op->stats.food = op->inv->nrof;
1054 op->nrof = 1;
1055 /* If the spell changes by level, choose a random level
1056 * for it, and adjust price. If the spell doesn't
1057 * change by level, just set the wand to the level of
1058 * the spell, and value calculation is simpler.
1059 */
1060 if (op->inv->duration_modifier || op->inv->dam_modifier || op->inv->range_modifier)
1061 {
1062 op->level = level_for_item (op, difficulty);
1063 op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50);
1064 }
1065 else
1066 {
1067 op->level = op->inv->level;
1068 op->value = op->value * op->inv->value;
1069 }
1070 break;
1071
1072 case ROD:
1073 op->level = level_for_item (op, difficulty);
1074 /* Add 50 to both level an divisor to keep prices a little more
1075 * reasonable. Otherwise, a high level version of a low level
1076 * spell can be worth tons a money (eg, level 20 rod, level 2 spell =
1077 * 10 time multiplier). This way, the value are a bit more reasonable.
1078 */
1079 op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50);
1080 /* maxhp is used to denote how many 'charges' the rod holds before */
1081 if (op->stats.maxhp)
1082 op->stats.maxhp *= MAX (op->inv->stats.sp, op->inv->stats.grace);
1083 else
1084 op->stats.maxhp = 2 * MAX (op->inv->stats.sp, op->inv->stats.grace);
1085
1086 op->stats.hp = op->stats.maxhp;
1087 break;
1088
1089 case SCROLL:
1090 op->level = level_for_item (op, difficulty);
1091 op->value = op->value * op->inv->value * (op->level + 50) / (op->inv->level + 50);
1092
1093 /* add exp so reading them properly gives xp */
1094 op->stats.exp = op->value / 5;
1095 op->nrof = op->inv->nrof;
1096 break;
1097
1098 case RUNE:
1099 trap_adjust (op, difficulty);
1100 break;
1101
1102 case TRAP:
1103 trap_adjust (op, difficulty);
1104 break;
1105 } /* switch type */
1106
1107 if (flags & GT_STARTEQUIP)
1108 {
1109 if (op->nrof < 2 && op->type != CONTAINER && op->type != MONEY && !QUERY_FLAG (op, FLAG_IS_THROWN))
1110 SET_FLAG (op, FLAG_STARTEQUIP);
1111 else if (op->type != MONEY)
1112 op->value = 0;
1113 }
1114
1115 if (!(flags & GT_ENVIRONMENT))
1116 fix_flesh_item (op, creator);
1117 }
1118
1119 /*
1120 *
1121 *
1122 * CODE DEALING WITH ARTIFACTS STARTS HERE
1123 *
1124 *
1125 */
1126
1127 /*
1128 * Allocate and return the pointer to an empty artifactlist structure.
1129 */
1130 static artifactlist *
1131 get_empty_artifactlist (void)
1132 {
1133 return salloc0<artifactlist> ();
1134 }
1135
1136 /*
1137 * Allocate and return the pointer to an empty artifact structure.
1138 */
1139 static artifact *
1140 get_empty_artifact (void)
1141 {
1142 return salloc0<artifact> ();
1143 }
1144
1145 /*
1146 * Searches the artifact lists and returns one that has the same type
1147 * of objects on it.
1148 */
1149 artifactlist *
1150 find_artifactlist (int type)
1151 {
1152 for (artifactlist *al = first_artifactlist; al; al = al->next)
1153 if (al->type == type)
1154 return al;
1155
1156 return 0;
1157 }
1158
1159 /*
1160 * For debugging purposes. Dumps all tables.
1161 */
1162 void
1163 dump_artifacts (void)
1164 {
1165 artifactlist *al;
1166 artifact *art;
1167 linked_char *next;
1168
1169 fprintf (logfile, "\n");
1170 for (al = first_artifactlist; al != NULL; al = al->next)
1171 {
1172 fprintf (logfile, "Artifact has type %d, total_chance=%d\n", al->type, al->total_chance);
1173 for (art = al->items; art != NULL; art = art->next)
1174 {
1175 fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1176 if (art->allowed != NULL)
1177 {
1178 fprintf (logfile, "\tallowed combinations:");
1179 for (next = art->allowed; next != NULL; next = next->next)
1180 fprintf (logfile, "%s,", &next->name);
1181 fprintf (logfile, "\n");
1182 }
1183 }
1184 }
1185 fprintf (logfile, "\n");
1186 }
1187
1188 /*
1189 * For debugging purposes. Dumps all treasures recursively (see below).
1190 */
1191 void
1192 dump_monster_treasure_rec (const char *name, treasure *t, int depth)
1193 {
1194 treasurelist *tl;
1195 int i;
1196
1197 if (depth > 100)
1198 return;
1199
1200 while (t)
1201 {
1202 if (t->name)
1203 {
1204 for (i = 0; i < depth; i++)
1205 fprintf (logfile, " ");
1206
1207 fprintf (logfile, "{ (list: %s)\n", &t->name);
1208
1209 tl = treasurelist::find (t->name);
1210 if (tl)
1211 dump_monster_treasure_rec (name, tl->items, depth + 2);
1212
1213 for (i = 0; i < depth; i++)
1214 fprintf (logfile, " ");
1215
1216 fprintf (logfile, "} (end of list: %s)\n", &t->name);
1217 }
1218 else
1219 {
1220 for (i = 0; i < depth; i++)
1221 fprintf (logfile, " ");
1222
1223 if (t->item && t->item->type == FLESH)
1224 fprintf (logfile, "%s's %s\n", name, &t->item->object::name);
1225 else
1226 fprintf (logfile, "%s\n", &t->item->object::name);
1227 }
1228
1229 if (t->next_yes)
1230 {
1231 for (i = 0; i < depth; i++)
1232 fprintf (logfile, " ");
1233
1234 fprintf (logfile, " (if yes)\n");
1235 dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1236 }
1237
1238 if (t->next_no)
1239 {
1240 for (i = 0; i < depth; i++)
1241 fprintf (logfile, " ");
1242
1243 fprintf (logfile, " (if no)\n");
1244 dump_monster_treasure_rec (name, t->next_no, depth + 1);
1245 }
1246
1247 t = t->next;
1248 }
1249 }
1250
1251 /*
1252 * For debugging purposes. Dumps all treasures for a given monster.
1253 * Created originally by Raphael Quinet for debugging the alchemy code.
1254 */
1255 void
1256 dump_monster_treasure (const char *name)
1257 {
1258 archetype *at;
1259 int found;
1260
1261 found = 0;
1262 fprintf (logfile, "\n");
1263
1264 for_all_archetypes (at)
1265 if (!strcasecmp (at->object::name, name) && at->title == NULL)
1266 {
1267 fprintf (logfile, "treasures for %s (arch: %s)\n", &at->object::name, &at->archname);
1268 if (at->randomitems != NULL)
1269 dump_monster_treasure_rec (at->object::name, at->randomitems->items, 1);
1270 else
1271 fprintf (logfile, "(nothing)\n");
1272
1273 fprintf (logfile, "\n");
1274 found++;
1275 }
1276
1277 if (found == 0)
1278 fprintf (logfile, "No objects have the name %s!\n\n", name);
1279 }
1280
1281 /*
1282 * Builds up the lists of artifacts from the file in the libdir.
1283 */
1284 void
1285 init_artifacts (void)
1286 {
1287 static int has_been_inited = 0;
1288 char filename[MAX_BUF];
1289 artifact *art = NULL;
1290 artifactlist *al;
1291
1292 if (has_been_inited)
1293 return;
1294 else
1295 has_been_inited = 1;
1296
1297 sprintf (filename, "%s/artifacts", settings.datadir);
1298 object_thawer f (filename);
1299
1300 if (!f)
1301 return;
1302
1303 for (;;)
1304 {
1305 switch (f.kw)
1306 {
1307 case KW_allowed:
1308 if (!art)
1309 art = get_empty_artifact ();
1310
1311 {
1312 if (!strcmp (f.get_str (), "all"))
1313 break;
1314
1315 char *next, *cp = f.get_str ();
1316
1317 do
1318 {
1319 if ((next = strchr (cp, ',')))
1320 *next++ = '\0';
1321
1322 linked_char *tmp = new linked_char;
1323
1324 tmp->name = cp;
1325 tmp->next = art->allowed;
1326 art->allowed = tmp;
1327 }
1328 while ((cp = next));
1329 }
1330 break;
1331
1332 case KW_chance:
1333 f.get (art->chance);
1334 break;
1335
1336 case KW_difficulty:
1337 f.get (art->difficulty);
1338 break;
1339
1340 case KW_object:
1341 {
1342 art->item = object::create ();
1343 f.get (art->item->name);
1344 f.next ();
1345
1346 if (!art->item->parse_kv (f))
1347 LOG (llevError, "Init_Artifacts: Could not load object.\n");
1348
1349 al = find_artifactlist (art->item->type);
1350
1351 if (!al)
1352 {
1353 al = get_empty_artifactlist ();
1354 al->type = art->item->type;
1355 al->next = first_artifactlist;
1356 first_artifactlist = al;
1357 }
1358
1359 art->next = al->items;
1360 al->items = art;
1361 art = 0;
1362 }
1363 continue;
1364
1365 case KW_EOF:
1366 goto done;
1367
1368 default:
1369 if (!f.parse_error ("artifacts file"))
1370 cleanup ("artifacts file required");
1371 break;
1372 }
1373
1374 f.next ();
1375 }
1376
1377 done:
1378 for (al = first_artifactlist; al; al = al->next)
1379 {
1380 al->total_chance = 0;
1381
1382 for (art = al->items; art; art = art->next)
1383 {
1384 if (!art->chance)
1385 LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1386 else
1387 al->total_chance += art->chance;
1388 }
1389 #if 0
1390 LOG (llevDebug, "Artifact list type %d has %d total chance\n", al->type, al->total_chance);
1391 #endif
1392 }
1393
1394 LOG (llevDebug, "done.\n");
1395 }
1396
1397 /*
1398 * Used in artifact generation. The bonuses of the first object
1399 * is modified by the bonuses of the second object.
1400 */
1401 void
1402 add_abilities (object *op, object *change)
1403 {
1404 int i, tmp;
1405
1406 if (change->face != blank_face)
1407 {
1408 #ifdef TREASURE_VERBOSE
1409 LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1410 #endif
1411 op->face = change->face;
1412 }
1413
1414 for (i = 0; i < NUM_STATS; i++)
1415 change_attr_value (&(op->stats), i, change->stats.stat (i));
1416
1417 op->attacktype |= change->attacktype;
1418 op->path_attuned |= change->path_attuned;
1419 op->path_repelled |= change->path_repelled;
1420 op->path_denied |= change->path_denied;
1421 op->move_type |= change->move_type;
1422 op->stats.luck += change->stats.luck;
1423
1424 if (QUERY_FLAG (change, FLAG_CURSED))
1425 SET_FLAG (op, FLAG_CURSED);
1426 if (QUERY_FLAG (change, FLAG_DAMNED))
1427 SET_FLAG (op, FLAG_DAMNED);
1428 if ((QUERY_FLAG (change, FLAG_CURSED) || QUERY_FLAG (change, FLAG_DAMNED)) && op->magic > 0)
1429 set_abs_magic (op, -op->magic);
1430
1431 if (QUERY_FLAG (change, FLAG_LIFESAVE))
1432 SET_FLAG (op, FLAG_LIFESAVE);
1433 if (QUERY_FLAG (change, FLAG_REFL_SPELL))
1434 SET_FLAG (op, FLAG_REFL_SPELL);
1435 if (QUERY_FLAG (change, FLAG_STEALTH))
1436 SET_FLAG (op, FLAG_STEALTH);
1437 if (QUERY_FLAG (change, FLAG_XRAYS))
1438 SET_FLAG (op, FLAG_XRAYS);
1439 if (QUERY_FLAG (change, FLAG_BLIND))
1440 SET_FLAG (op, FLAG_BLIND);
1441 if (QUERY_FLAG (change, FLAG_SEE_IN_DARK))
1442 SET_FLAG (op, FLAG_SEE_IN_DARK);
1443 if (QUERY_FLAG (change, FLAG_REFL_MISSILE))
1444 SET_FLAG (op, FLAG_REFL_MISSILE);
1445 if (QUERY_FLAG (change, FLAG_MAKE_INVIS))
1446 SET_FLAG (op, FLAG_MAKE_INVIS);
1447
1448 if (QUERY_FLAG (change, FLAG_STAND_STILL))
1449 {
1450 CLEAR_FLAG (op, FLAG_ANIMATE);
1451 /* so artifacts will join */
1452 if (!QUERY_FLAG (op, FLAG_ALIVE))
1453 op->speed = 0.0;
1454
1455 op->set_speed (op->speed);
1456 }
1457
1458 if (change->nrof)
1459 op->nrof = rndm (change->nrof) + 1;
1460
1461 op->stats.exp += change->stats.exp; /* Speed modifier */
1462 op->stats.wc += change->stats.wc;
1463 op->stats.ac += change->stats.ac;
1464
1465 if (change->other_arch)
1466 {
1467 /* Basically, for horns & potions, the other_arch field is the spell
1468 * to cast. So convert that to into a spell and put it into
1469 * this object.
1470 */
1471 if (op->type == HORN || op->type == POTION)
1472 {
1473 object *tmp_obj;
1474
1475 /* Remove any spells this object currently has in it */
1476 while (op->inv)
1477 op->inv->destroy ();
1478
1479 tmp_obj = arch_to_object (change->other_arch);
1480 insert_ob_in_ob (tmp_obj, op);
1481 }
1482 /* No harm setting this for potions/horns */
1483 op->other_arch = change->other_arch;
1484 }
1485
1486 if (change->stats.hp < 0)
1487 op->stats.hp = -change->stats.hp;
1488 else
1489 op->stats.hp += change->stats.hp;
1490
1491 if (change->stats.maxhp < 0)
1492 op->stats.maxhp = -change->stats.maxhp;
1493 else
1494 op->stats.maxhp += change->stats.maxhp;
1495
1496 if (change->stats.sp < 0)
1497 op->stats.sp = -change->stats.sp;
1498 else
1499 op->stats.sp += change->stats.sp;
1500
1501 if (change->stats.maxsp < 0)
1502 op->stats.maxsp = -change->stats.maxsp;
1503 else
1504 op->stats.maxsp += change->stats.maxsp;
1505
1506 if (change->stats.food < 0)
1507 op->stats.food = -(change->stats.food);
1508 else
1509 op->stats.food += change->stats.food;
1510
1511 if (change->level < 0)
1512 op->level = -(change->level);
1513 else
1514 op->level += change->level;
1515
1516 if (change->gen_sp_armour < 0)
1517 op->gen_sp_armour = -(change->gen_sp_armour);
1518 else
1519 op->gen_sp_armour = (op->gen_sp_armour * (change->gen_sp_armour)) / 100;
1520
1521 op->item_power = change->item_power;
1522
1523 for (i = 0; i < NROFATTACKS; i++)
1524 if (change->resist[i])
1525 op->resist[i] += change->resist[i];
1526
1527 if (change->stats.dam)
1528 {
1529 if (change->stats.dam < 0)
1530 op->stats.dam = (-change->stats.dam);
1531 else if (op->stats.dam)
1532 {
1533 tmp = (signed char) (((int) op->stats.dam * (int) change->stats.dam) / 10);
1534 if (tmp == op->stats.dam)
1535 {
1536 if (change->stats.dam < 10)
1537 op->stats.dam--;
1538 else
1539 op->stats.dam++;
1540 }
1541 else
1542 op->stats.dam = tmp;
1543 }
1544 }
1545
1546 if (change->weight)
1547 {
1548 if (change->weight < 0)
1549 op->weight = (-change->weight);
1550 else
1551 op->weight = (op->weight * (change->weight)) / 100;
1552 }
1553
1554 if (change->last_sp)
1555 {
1556 if (change->last_sp < 0)
1557 op->last_sp = (-change->last_sp);
1558 else
1559 op->last_sp = (signed char) (((int) op->last_sp * (int) change->last_sp) / (int) 100);
1560 }
1561
1562 if (change->gen_sp_armour)
1563 {
1564 if (change->gen_sp_armour < 0)
1565 op->gen_sp_armour = (-change->gen_sp_armour);
1566 else
1567 op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);
1568 }
1569
1570 op->value *= change->value;
1571
1572 if (change->materials)
1573 op->materials = change->materials;
1574
1575 if (change->materialname)
1576 op->materialname = change->materialname;
1577
1578 if (change->slaying)
1579 op->slaying = change->slaying;
1580
1581 if (change->race)
1582 op->race = change->race;
1583
1584 if (change->msg)
1585 op->msg = change->msg;
1586 }
1587
1588 static int
1589 legal_artifact_combination (object *op, artifact *art)
1590 {
1591 int neg, success = 0;
1592 linked_char *tmp;
1593 const char *name;
1594
1595 if (!art->allowed)
1596 return 1; /* Ie, "all" */
1597
1598 for (tmp = art->allowed; tmp; tmp = tmp->next)
1599 {
1600 #ifdef TREASURE_VERBOSE
1601 LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1602 #endif
1603 if (*tmp->name == '!')
1604 name = tmp->name + 1, neg = 1;
1605 else
1606 name = tmp->name, neg = 0;
1607
1608 /* If we match name, then return the opposite of 'neg' */
1609 if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname)))
1610 return !neg;
1611
1612 /* Set success as true, since if the match was an inverse, it means
1613 * everything is allowed except what we match
1614 */
1615 else if (neg)
1616 success = 1;
1617 }
1618
1619 return success;
1620 }
1621
1622 /*
1623 * Fixes the given object, giving it the abilities and titles
1624 * it should have due to the second artifact-template.
1625 */
1626
1627 void
1628 give_artifact_abilities (object *op, object *artifct)
1629 {
1630 char new_name[MAX_BUF];
1631
1632 sprintf (new_name, "of %s", &artifct->name);
1633 op->title = new_name;
1634 add_abilities (op, artifct); /* Give out the bonuses */
1635
1636 #if 0 /* Bit verbose, but keep it here until next time I need it... */
1637 {
1638 char identified = QUERY_FLAG (op, FLAG_IDENTIFIED);
1639
1640 SET_FLAG (op, FLAG_IDENTIFIED);
1641 LOG (llevDebug, "Generated artifact %s %s [%s]\n", op->name, op->title, describe_item (op, NULL));
1642 if (!identified)
1643 CLEAR_FLAG (op, FLAG_IDENTIFIED);
1644 }
1645 #endif
1646 return;
1647 }
1648
1649 /*
1650 * Decides randomly which artifact the object should be
1651 * turned into. Makes sure that the item can become that
1652 * artifact (means magic, difficulty, and Allowed fields properly).
1653 * Then calls give_artifact_abilities in order to actually create
1654 * the artifact.
1655 */
1656
1657 /* Give 1 re-roll attempt per artifact */
1658 #define ARTIFACT_TRIES 2
1659
1660 void
1661 generate_artifact (object *op, int difficulty)
1662 {
1663 artifactlist *al;
1664 artifact *art;
1665 int i;
1666
1667 al = find_artifactlist (op->type);
1668
1669 if (al == NULL)
1670 {
1671 #if 0 /* This is too verbose, usually */
1672 LOG (llevDebug, "Couldn't change %s into artifact - no table.\n", op->name);
1673 #endif
1674 return;
1675 }
1676
1677 for (i = 0; i < ARTIFACT_TRIES; i++)
1678 {
1679 int roll = rndm (al->total_chance);
1680
1681 for (art = al->items; art; art = art->next)
1682 {
1683 roll -= art->chance;
1684 if (roll < 0)
1685 break;
1686 }
1687
1688 if (art == NULL || roll >= 0)
1689 {
1690 #if 1
1691 LOG (llevError, "Got null entry and non zero roll in generate_artifact, type %d\n", op->type);
1692 #endif
1693 return;
1694 }
1695 if (!strcmp (art->item->name, "NONE"))
1696 return;
1697 if (FABS (op->magic) < art->item->magic)
1698 continue; /* Not magic enough to be this item */
1699
1700 /* Map difficulty not high enough */
1701 if (difficulty < art->difficulty)
1702 continue;
1703
1704 if (!legal_artifact_combination (op, art))
1705 {
1706 #ifdef TREASURE_VERBOSE
1707 LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1708 #endif
1709 continue;
1710 }
1711
1712 give_artifact_abilities (op, art->item);
1713 return;
1714 }
1715 }
1716
1717 /* fix_flesh_item() - objects of type FLESH are similar to type
1718 * FOOD, except they inherit properties (name, food value, etc).
1719 * based on the original owner (or 'donor' if you like). -b.t.
1720 */
1721
1722 void
1723 fix_flesh_item (object *item, object *donor)
1724 {
1725 char tmpbuf[MAX_BUF];
1726 int i;
1727
1728 if (item->type == FLESH && donor)
1729 {
1730 /* change the name */
1731 sprintf (tmpbuf, "%s's %s", &donor->name, &item->name);
1732 item->name = tmpbuf;
1733 sprintf (tmpbuf, "%s's %s", &donor->name, &item->name_pl);
1734 item->name_pl = tmpbuf;
1735
1736 /* weight is FLESH weight/100 * donor */
1737 if ((item->weight = (signed long) (((double) item->weight / (double) 100.0) * (double) donor->weight)) == 0)
1738 item->weight = 1;
1739
1740 /* value is multiplied by level of donor */
1741 item->value *= isqrt (donor->level * 2);
1742
1743 /* food value */
1744 item->stats.food += (donor->stats.hp / 100) + donor->stats.Con;
1745
1746 /* flesh items inherit some abilities of donor, but not
1747 * full effect.
1748 */
1749 for (i = 0; i < NROFATTACKS; i++)
1750 item->resist[i] = donor->resist[i] / 2;
1751
1752 /* item inherits donor's level (important for quezals) */
1753 item->level = donor->level;
1754
1755 /* if donor has some attacktypes, the flesh is poisonous */
1756 if (donor->attacktype & AT_POISON)
1757 item->type = POISON;
1758 if (donor->attacktype & AT_ACID)
1759 item->stats.hp = -1 * item->stats.food;
1760 SET_FLAG (item, FLAG_NO_STEAL);
1761 }
1762 }
1763
1764 /* special_potion() - so that old potion code is still done right. */
1765 int
1766 special_potion (object *op)
1767 {
1768 if (op->attacktype)
1769 return 1;
1770
1771 if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha)
1772 return 1;
1773
1774 for (int i = 0; i < NROFATTACKS; i++)
1775 if (op->resist[i])
1776 return 1;
1777
1778 return 0;
1779 }
1780
1781 void
1782 free_treasurestruct (treasure *t)
1783 {
1784 if (t->next) free_treasurestruct (t->next);
1785 if (t->next_yes) free_treasurestruct (t->next_yes);
1786 if (t->next_no) free_treasurestruct (t->next_no);
1787
1788 delete t;
1789 }
1790
1791 void
1792 free_charlinks (linked_char *lc)
1793 {
1794 if (lc->next)
1795 free_charlinks (lc->next);
1796
1797 delete lc;
1798 }
1799
1800 void
1801 free_artifact (artifact *at)
1802 {
1803 if (at->next) free_artifact (at->next);
1804 if (at->allowed) free_charlinks (at->allowed);
1805
1806 at->item->destroy (1);
1807
1808 sfree (at);
1809 }
1810
1811 void
1812 free_artifactlist (artifactlist *al)
1813 {
1814 artifactlist *nextal;
1815
1816 for (al = first_artifactlist; al; al = nextal)
1817 {
1818 nextal = al->next;
1819
1820 if (al->items)
1821 free_artifact (al->items);
1822
1823 sfree (al);
1824 }
1825 }
1826
1827 void
1828 free_all_treasures (void)
1829 {
1830 treasurelist *tl, *next;
1831
1832 for (tl = first_treasurelist; tl; tl = next)
1833 {
1834 clear (tl);
1835
1836 next = tl->next;
1837 delete tl;
1838 }
1839
1840 free_artifactlist (first_artifactlist);
1841 }