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