ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/treasure.C
(Generate patch)

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.42 by root, Mon Apr 16 10:14:25 2007 UTC vs.
Revision 1.78 by root, Sun Jul 20 16:56:34 2008 UTC

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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25/* TREASURE_DEBUG does some checking on the treasurelists after loading. 24/* TREASURE_DEBUG does some checking on the treasurelists after loading.
26 * It is useful for finding bugs in the treasures file. Since it only 25 * It is useful for finding bugs in the treasures file. Since it only
27 * slows the startup some (and not actual game play), it is by default 26 * slows the startup some (and not actual game play), it is by default
… …
33 32
34//#define TREASURE_VERBOSE 33//#define TREASURE_VERBOSE
35 34
36#include <global.h> 35#include <global.h>
37#include <treasure.h> 36#include <treasure.h>
38#include <funcpoint.h>
39#include <loader.h> 37#include <loader.h>
40 38
41extern char *spell_mapping[]; 39extern char *spell_mapping[];
42 40
43static treasurelist *first_treasurelist; 41static treasurelist *first_treasurelist;
… …
54> tl_map_t; 52> tl_map_t;
55 53
56static tl_map_t tl_map; 54static tl_map_t tl_map;
57 55
58/* 56/*
59 * Initialize global archtype pointers: 57 * Searches for the given treasurelist
60 */
61void
62init_archetype_pointers ()
63{
64 int prev_warn = warn_archetypes;
65
66 warn_archetypes = 1;
67
68 if (ring_arch == NULL)
69 ring_arch = archetype::find ("ring");
70 if (amulet_arch == NULL)
71 amulet_arch = archetype::find ("amulet");
72 if (staff_arch == NULL)
73 staff_arch = archetype::find ("staff");
74 if (crown_arch == NULL)
75 crown_arch = archetype::find ("crown");
76
77 warn_archetypes = prev_warn;
78}
79
80/*
81 * Searches for the given treasurelist in the globally linked list
82 * of treasurelists which has been built by load_treasures().
83 */ 58 */
84treasurelist * 59treasurelist *
85treasurelist::find (const char *name) 60treasurelist::find (const char *name)
86{ 61{
87 if (!name) 62 if (!name)
88 return 0; 63 return 0;
89 64
90 AUTODECL (i, tl_map.find (name)); 65 auto (i, tl_map.find (name));
91 66
92 if (i == tl_map.end ()) 67 if (i == tl_map.end ())
93 return 0; 68 return 0;
94 69
95 return i->second; 70 return i->second;
… …
125 if (tl->items) 100 if (tl->items)
126 { 101 {
127 free_treasurestruct (tl->items); 102 free_treasurestruct (tl->items);
128 tl->items = 0; 103 tl->items = 0;
129 } 104 }
105
106 tl->total_chance = 0;
130} 107}
108
109#ifdef TREASURE_DEBUG
110/* recursived checks the linked list. Treasurelist is passed only
111 * so that the treasure name can be printed out
112 */
113static void
114check_treasurelist (const treasure *t, const treasurelist * tl)
115{
116 if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
117 LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
118
119 if (t->next)
120 check_treasurelist (t->next, tl);
121
122 if (t->next_yes)
123 check_treasurelist (t->next_yes, tl);
124
125 if (t->next_no)
126 check_treasurelist (t->next_no, tl);
127}
128#endif
131 129
132/* 130/*
133 * Reads the lib/treasure file from disk, and parses the contents 131 * Reads the lib/treasure file from disk, and parses the contents
134 * into an internal treasure structure (very linked lists) 132 * into an internal treasure structure (very linked lists)
135 */ 133 */
136static treasure * 134static treasure *
137load_treasure (object_thawer &f) 135read_treasure (object_thawer &f)
138{ 136{
139 treasure *t = new treasure; 137 treasure *t = new treasure;
140 int value;
141 138
142 nroftreasures++; 139 f.next ();
143 140
144 for (;;) 141 for (;;)
145 { 142 {
146 coroapi::cede_every (10); 143 coroapi::cede_to_tick ();
147
148 f.next ();
149 144
150 switch (f.kw) 145 switch (f.kw)
151 { 146 {
152 case KW_arch: 147 case KW_arch:
153 if (!(t->item = archetype::find (f.get_str ()))) 148 t->item = archetype::find (f.get_str ());
154 LOG (llevError, "%s:%d treasure references unknown archetype '%s', skipping.\n", f.name, f.linenum, f.get_str ()); 149
150 if (!t->item)
151 {
152 f.parse_warn ("treasure references unknown archetype");
153 t->item = archetype::empty;
154 }
155
155 break; 156 break;
156 157
157 case KW_list: f.get (t->name); break; 158 case KW_list: f.get (t->name); break;
158 case KW_change_name: f.get (t->change_arch.name); break; 159 case KW_change_name: f.get (t->change_arch.name); break;
159 case KW_change_title: f.get (t->change_arch.title); break; 160 case KW_change_title: f.get (t->change_arch.title); break;
160 case KW_change_slaying: f.get (t->change_arch.slaying); break; 161 case KW_change_slaying: f.get (t->change_arch.slaying); break;
161 case KW_chance: f.get (t->chance); break; 162 case KW_chance: f.get (t->chance); break;
162 case KW_nrof: f.get (t->nrof); break; 163 case KW_nrof: f.get (t->nrof); break;
163 case KW_magic: f.get (t->magic); break; 164 case KW_magic: f.get (t->magic); break;
164 165
165 case KW_yes: t->next_yes = load_treasure (f); break; 166 case KW_yes: t->next_yes = read_treasure (f); continue;
166 case KW_no: t->next_no = load_treasure (f); break; 167 case KW_no: t->next_no = read_treasure (f); continue;
167 168
168 case KW_end: 169 case KW_end:
170 f.next ();
169 return t; 171 return t;
170 172
171 case KW_more: 173 case KW_more:
172 t->next = load_treasure (f); 174 t->next = read_treasure (f);
173 return t; 175 return t;
174 176
175 default: 177 default:
176 if (!f.parse_error ("treasure list")) 178 if (!f.parse_error ("treasurelist", t->name))
177 return t; // error 179 goto error;
178 180
179 return t; 181 return t;
180 } 182 }
181 }
182}
183 183
184#ifdef TREASURE_DEBUG 184 f.next ();
185/* recursived checks the linked list. Treasurelist is passed only 185 }
186 * so that the treasure name can be printed out
187 */
188static void
189check_treasurelist (const treasure *t, const treasurelist * tl)
190{
191 if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
192 LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
193 186
194 if (t->next) 187 // not reached
195 check_treasurelist (t->next, tl);
196 188
197 if (t->next_yes) 189error:
198 check_treasurelist (t->next_yes, tl); 190 delete t;
199 191 return 0;
200 if (t->next_no)
201 check_treasurelist (t->next_no, tl);
202} 192}
203#endif
204 193
205/* 194/*
206 * Opens LIBDIR/treasure and reads all treasure-declarations from it.
207 * Each treasure is parsed with the help of load_treasure(). 195 * Each treasure is parsed with the help of load_treasure().
208 */ 196 */
209bool 197treasurelist *
210load_treasures () 198treasurelist::read (object_thawer &f)
211{ 199{
212 treasure *t; 200 assert (f.kw == KW_treasure || f.kw == KW_treasureone);
213 int comp, line = 0;
214 201
215 char filename[MAX_BUF]; 202 bool one = f.kw == KW_treasureone;
216 sprintf (filename, "%s/%s", settings.datadir, settings.treasures); 203 treasurelist *tl = treasurelist::get (f.get_str ());
217 204 clear (tl);
218 object_thawer f (filename); 205 tl->items = read_treasure (f);
219 206 if (!tl->items)
220 if (!f)
221 {
222 LOG (llevError, "Can't open treasure file.\n");
223 return false; 207 return 0;
208
209 /* This is a one of the many items on the list should be generated.
210 * Add up the chance total, and check to make sure the yes & no
211 * fields of the treasures are not being used.
212 */
213 if (one)
224 } 214 {
225 215 for (treasure *t = tl->items; t; t = t->next)
226 f.next ();
227
228 for (;;)
229 {
230 switch (f.kw)
231 { 216 {
232 case KW_treasure: 217 if (t->next_yes || t->next_no)
233 case KW_treasureone:
234 { 218 {
235 bool one = f.kw == KW_treasureone;
236 treasurelist *tl = treasurelist::get (f.get_str ());
237
238 clear (tl);
239 tl->items = load_treasure (f);
240
241 if (!tl->items)
242 return false;
243
244 /* This is a one of the many items on the list should be generated.
245 * Add up the chance total, and check to make sure the yes & no
246 * fields of the treasures are not being used.
247 */
248 if (one)
249 {
250 for (t = tl->items; t; t = t->next)
251 {
252#ifdef TREASURE_DEBUG
253 if (t->next_yes || t->next_no)
254 {
255 LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); 219 LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->archname : &t->name);
256 LOG (llevError, " the next_yes or next_no field is set\n"); 220 LOG (llevError, " the next_yes or next_no field is set\n");
257 }
258#endif
259 tl->total_chance += t->chance;
260 }
261 }
262 } 221 }
263 break;
264 222
265 case KW_EOF: 223 tl->total_chance += t->chance;
266#ifdef TREASURE_DEBUG
267 /* Perform some checks on how valid the treasure data actually is.
268 * verify that list transitions work (ie, the list that it is supposed
269 * to transition to exists). Also, verify that at least the name
270 * or archetype is set for each treasure element.
271 */
272 for (treasurelist *tl = first_treasurelist; tl; tl = tl->next)
273 check_treasurelist (tl->items, tl);
274#endif
275 return true;
276
277 default:
278 if (!f.parse_error ("treasure lists"))
279 return false;
280
281 break;
282 } 224 }
283
284 f.next ();
285 } 225 }
226
227 return tl;
286} 228}
287 229
288/* 230/*
289 * Generates the objects specified by the given treasure. 231 * Generates the objects specified by the given treasure.
290 * It goes recursively through the rest of the linked list. 232 * It goes recursively through the rest of the linked list.
… …
297 * start with equipment, but only their abilities). 239 * start with equipment, but only their abilities).
298 */ 240 */
299static void 241static void
300put_treasure (object *op, object *creator, int flags) 242put_treasure (object *op, object *creator, int flags)
301{ 243{
302 object *tmp; 244 if (flags & GT_ENVIRONMENT)
303 245 {
304 /* Bit of a hack - spells should never be put onto the map. The entire 246 /* Bit of a hack - spells should never be put onto the map. The entire
305 * treasure stuff is a problem - there is no clear idea of knowing 247 * treasure stuff is a problem - there is no clear idea of knowing
306 * this is the original object, or if this is an object that should be created 248 * this is the original object, or if this is an object that should be created
307 * by another object. 249 * by another object.
308 */ 250 */
309 if (flags & GT_ENVIRONMENT && op->type != SPELL) 251 //TODO: flag such as objects... as such (no drop, anybody?)
310 { 252 if (op->type == SPELL)
253 {
254 op->destroy ();
255 return;
256 }
257
258 op->expand_tail ();
259
260 if (!creator->is_on_map () || op->blocked (creator->map, creator->x, creator->y))
261 op->destroy ();
262 else
263 {
311 SET_FLAG (op, FLAG_OBJ_ORIGINAL); 264 SET_FLAG (op, FLAG_OBJ_ORIGINAL);
312 op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); 265 op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);
266 }
313 } 267 }
314 else 268 else
315 { 269 {
316 op = creator->insert (op); 270 op = creator->insert (op);
317 271
318 if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) 272 if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
319 monster_check_apply (creator, op); 273 monster_check_apply (creator, op);
320
321 if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ()))
322 esrv_send_item (tmp, op);
323 } 274 }
324} 275}
325 276
326/* if there are change_xxx commands in the treasure, we include the changes 277/* if there are change_xxx commands in the treasure, we include the changes
327 * in the generated object 278 * in the generated object
… …
349 if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance) 300 if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance)
350 { 301 {
351 if (t->name) 302 if (t->name)
352 { 303 {
353 if (difficulty >= t->magic) 304 if (difficulty >= t->magic)
305 if (treasurelist *tl = treasurelist::find (t->name))
354 create_treasure (treasurelist::find (t->name), op, flag, difficulty, tries); 306 create_treasure (tl, op, flag, difficulty, tries);
307 else
308 LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
355 } 309 }
356 else 310 else
357 { 311 {
358 if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) 312 if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE)))
359 { 313 {
360 object *tmp = arch_to_object (t->item); 314 object *tmp = arch_to_object (t->item);
361 315
362 if (t->nrof && tmp->nrof <= 1) 316 if (t->nrof && tmp->nrof <= 1)
363 tmp->nrof = rndm (t->nrof) + 1; 317 tmp->nrof = rndm (t->nrof) + 1;
… …
410 create_treasure (tl, op, flag, difficulty, tries); 364 create_treasure (tl, op, flag, difficulty, tries);
411 } 365 }
412 else if (t->nrof) 366 else if (t->nrof)
413 create_one_treasure (tl, op, flag, difficulty, tries); 367 create_one_treasure (tl, op, flag, difficulty, tries);
414 } 368 }
415 else if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE)) 369 else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE))
416 { 370 {
417 if (object *tmp = arch_to_object (t->item)) 371 if (object *tmp = arch_to_object (t->item))
418 { 372 {
419 if (t->nrof && tmp->nrof <= 1) 373 if (t->nrof && tmp->nrof <= 1)
420 tmp->nrof = rndm (t->nrof) + 1; 374 tmp->nrof = rndm (t->nrof) + 1;
… …
422 fix_generated_item (tmp, op, difficulty, t->magic, flag); 376 fix_generated_item (tmp, op, difficulty, t->magic, flag);
423 change_treasure (t, tmp); 377 change_treasure (t, tmp);
424 put_treasure (tmp, op, flag); 378 put_treasure (tmp, op, flag);
425 } 379 }
426 } 380 }
381}
382
383void
384object::create_treasure (treasurelist *tl, int flags)
385{
386 ::create_treasure (tl, this, flags, map ? map->difficulty : 0);
427} 387}
428 388
429/* This calls the appropriate treasure creation function. tries is passed 389/* This calls the appropriate treasure creation function. tries is passed
430 * to determine how many list transitions or attempts to create treasure 390 * to determine how many list transitions or attempts to create treasure
431 * have been made. It is really in place to prevent infinite loops with 391 * have been made. It is really in place to prevent infinite loops with
… …
444 { 404 {
445 LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); 405 LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
446 return; 406 return;
447 } 407 }
448 408
409 if (op->flag [FLAG_TREASURE_ENV])
410 {
411 // do not generate items when there already is something above the object
412 if (op->flag [FLAG_IS_FLOOR] && op->above)
413 return;
414
415 flag |= GT_ENVIRONMENT;
416 }
417
449 if (tl->total_chance) 418 if (tl->total_chance)
450 create_one_treasure (tl, op, flag, difficulty, tries); 419 create_one_treasure (tl, op, flag, difficulty, tries);
451 else 420 else
452 create_all_treasures (tl->items, op, flag, difficulty, tries); 421 create_all_treasures (tl->items, op, flag, difficulty, tries);
453} 422}
… …
460object * 429object *
461generate_treasure (treasurelist *tl, int difficulty) 430generate_treasure (treasurelist *tl, int difficulty)
462{ 431{
463 difficulty = clamp (difficulty, 1, settings.max_level); 432 difficulty = clamp (difficulty, 1, settings.max_level);
464 433
465 object *ob = object::create (), *tmp; 434 object *ob = object::create ();
466 435
467 create_treasure (tl, ob, 0, difficulty, 0); 436 create_treasure (tl, ob, 0, difficulty, 0);
468 437
469 /* Don't want to free the object we are about to return */ 438 /* Don't want to free the object we are about to return */
470 tmp = ob->inv; 439 object *tmp = ob->inv;
471 if (tmp != NULL) 440 if (tmp)
472 tmp->remove (); 441 tmp->remove ();
473 442
474 if (ob->inv) 443 if (ob->inv)
475 LOG (llevError, "In generate treasure, created multiple objects.\n"); 444 LOG (llevError, "In generate treasure, created multiple objects.\n");
476 445
… …
484 * The array has two arguments, the difficulty of the level, and the 453 * The array has two arguments, the difficulty of the level, and the
485 * magical bonus "wanted". 454 * magical bonus "wanted".
486 */ 455 */
487 456
488static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = { 457static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
489
490// chance of magic difficulty 458// chance of magic difficulty
491// +0 +1 +2 +3 +4 459// +0 +1 +2 +3 +4
492 {95, 2, 2, 1, 0}, // 1 460 {95, 2, 2, 1, 0}, // 1
493 {92, 5, 2, 1, 0}, // 2 461 {92, 5, 2, 1, 0}, // 2
494 {85, 10, 4, 1, 0}, // 3 462 {85, 10, 4, 1, 0}, // 3
… …
520 { 0, 0, 0, 3, 97}, // 29 488 { 0, 0, 0, 3, 97}, // 29
521 { 0, 0, 0, 0, 100}, // 30 489 { 0, 0, 0, 0, 100}, // 30
522 { 0, 0, 0, 0, 100}, // 31 490 { 0, 0, 0, 0, 100}, // 31
523}; 491};
524 492
525
526/* calculate the appropriate level for wands staves and scrolls. 493/* calculate the appropriate level for wands staves and scrolls.
527 * This code presumes that op has had its spell object created (in op->inv) 494 * This code presumes that op has had its spell object created (in op->inv)
528 * 495 *
529 * elmex Wed Aug 9 17:44:59 CEST 2006: 496 * elmex Wed Aug 9 17:44:59 CEST 2006:
530 * Removed multiplicator, too many high-level items were generated on low-difficulty maps. 497 * Removed multiplicator, too many high-level items were generated on low-difficulty maps.
531 */ 498 */
532
533int 499int
534level_for_item (const object *op, int difficulty) 500level_for_item (const object *op, int difficulty)
535{ 501{
536 int olevel = 0;
537
538 if (!op->inv) 502 if (!op->inv)
539 { 503 {
540 LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name); 504 LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);
541 return 0; 505 return 0;
542 } 506 }
543 507
544 olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2)); 508 int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.));
545 509
546 if (olevel <= 0) 510 if (olevel <= 0)
547 olevel = rndm (1, MIN (op->inv->level, 1)); 511 olevel = rndm (1, op->inv->level);
548 512
549 if (olevel > MAXLEVEL) 513 return min (olevel, MAXLEVEL);
550 olevel = MAXLEVEL;
551
552 return olevel;
553} 514}
554 515
555/* 516/*
556 * Based upon the specified difficulty and upon the difftomagic_list array, 517 * Based upon the specified difficulty and upon the difftomagic_list array,
557 * a random magical bonus is returned. This is used when determine 518 * a random magical bonus is returned. This is used when determine
… …
613 574
614 op->magic = magic; 575 op->magic = magic;
615 if (op->arch) 576 if (op->arch)
616 { 577 {
617 if (op->type == ARMOUR) 578 if (op->type == ARMOUR)
618 ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100; 579 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
619 580
620 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ 581 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
621 magic = (-magic); 582 magic = (-magic);
583
622 op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100; 584 op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
623 } 585 }
624 else 586 else
625 { 587 {
626 if (op->type == ARMOUR) 588 if (op->type == ARMOUR)
627 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; 589 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
590
628 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ 591 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
629 magic = (-magic); 592 magic = (-magic);
593
630 op->weight = (op->weight * (100 - magic * 10)) / 100; 594 op->weight = (op->weight * (100 - magic * 10)) / 100;
631 } 595 }
632} 596}
633 597
634/* 598/*
… …
689 case 2: 653 case 2:
690 case 3: 654 case 3:
691 case 4: 655 case 4:
692 case 5: 656 case 5:
693 case 6: 657 case 6:
694 set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r))); 658 op->stats.stat (r) += bonus;
695 break; 659 break;
696 660
697 case 7: 661 case 7:
698 op->stats.dam += bonus; 662 op->stats.dam += bonus;
699 break; 663 break;
… …
847 save_item_power = op->item_power; 811 save_item_power = op->item_power;
848 op->item_power = 0; 812 op->item_power = 0;
849 813
850 if (op->randomitems && op->type != SPELL) 814 if (op->randomitems && op->type != SPELL)
851 { 815 {
852 create_treasure (op->randomitems, op, flags, difficulty, 0); 816 create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0);
853 if (!op->inv)
854 LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", op->debug_desc ());
855
856 /* So the treasure doesn't get created again */ 817 /* So the treasure doesn't get created again */
857 op->randomitems = 0; 818 op->randomitems = 0;
858 } 819 }
859 820
860 if (difficulty < 1) 821 if (difficulty < 1)
… …
866 ARG_INT (flags))) 827 ARG_INT (flags)))
867 return; 828 return;
868 829
869 if (!(flags & GT_MINIMAL)) 830 if (!(flags & GT_MINIMAL))
870 { 831 {
871 if (op->arch == crown_arch) 832 if (IS_ARCH (op->arch, crown))
872 { 833 {
873 set_magic (difficulty, op, max_magic, flags); 834 set_magic (difficulty, op, max_magic, flags);
874 num_enchantments = calc_item_power (op, 1); 835 num_enchantments = calc_item_power (op, 1);
875 generate_artifact (op, difficulty); 836 generate_artifact (op, difficulty);
876 } 837 }
… …
881 842
882 num_enchantments = calc_item_power (op, 1); 843 num_enchantments = calc_item_power (op, 1);
883 844
884 if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT)) 845 if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
885 || op->type == HORN 846 || op->type == HORN
886 || difficulty >= settings.max_level) /* high difficulties always generate an artifact, 847 || difficulty >= settings.max_level) /* high difficulties always generate an artifact, used for shop_floors or treasures */
887 * used for shop_floors or treasures */
888 generate_artifact (op, difficulty); 848 generate_artifact (op, difficulty);
889 } 849 }
890 850
891 /* Object was made an artifact. Calculate its item_power rating. 851 /* Object was made an artifact. Calculate its item_power rating.
892 * the item_power in the object is what the artfiact adds. 852 * the item_power in the object is what the artfiact adds.
… …
934 { 894 {
935 if (op->type == POTION) 895 if (op->type == POTION)
936 /* Handle healing and magic power potions */ 896 /* Handle healing and magic power potions */
937 if (op->stats.sp && !op->randomitems) 897 if (op->stats.sp && !op->randomitems)
938 { 898 {
939 object *tmp;
940
941 tmp = get_archetype (spell_mapping[op->stats.sp]); 899 object *tmp = get_archetype (spell_mapping [op->stats.sp]);
942 insert_ob_in_ob (tmp, op); 900 insert_ob_in_ob (tmp, op);
943 op->stats.sp = 0; 901 op->stats.sp = 0;
944 } 902 }
945 } 903 }
946 else if (!op->title) /* Only modify object if not special */ 904 else if (!op->title) /* Only modify object if not special */
… …
1004 SET_FLAG (op, FLAG_CURSED); 962 SET_FLAG (op, FLAG_CURSED);
1005 break; 963 break;
1006 } 964 }
1007 965
1008 case AMULET: 966 case AMULET:
1009 if (op->arch == amulet_arch) 967 if (IS_ARCH (op->arch, amulet))
1010 op->value *= 5; /* Since it's not just decoration */ 968 op->value *= 5; /* Since it's not just decoration */
1011 969
1012 case RING: 970 case RING:
1013 if (op->arch == NULL) 971 if (!op->arch) // wtf? schmorp
1014 { 972 {
1015 op->destroy (); 973 op->destroy ();
1016 op = 0; 974 op = 0;
1017 break; 975 break;
1018 } 976 }
1019 977
1020 if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */ 978 if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */
1021 break; 979 break;
1022 980
1023 if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) 981 if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1024 SET_FLAG (op, FLAG_CURSED); 982 SET_FLAG (op, FLAG_CURSED);
1025 983
… …
1178 * Allocate and return the pointer to an empty artifactlist structure. 1136 * Allocate and return the pointer to an empty artifactlist structure.
1179 */ 1137 */
1180static artifactlist * 1138static artifactlist *
1181get_empty_artifactlist (void) 1139get_empty_artifactlist (void)
1182{ 1140{
1183 return salloc0 <artifactlist> (); 1141 return salloc0<artifactlist> ();
1184} 1142}
1185 1143
1186/* 1144/*
1187 * Allocate and return the pointer to an empty artifact structure. 1145 * Allocate and return the pointer to an empty artifact structure.
1188 */ 1146 */
1189static artifact * 1147static artifact *
1190get_empty_artifact (void) 1148get_empty_artifact (void)
1191{ 1149{
1192 return salloc0 <artifact> (); 1150 return salloc0<artifact> ();
1193} 1151}
1194 1152
1195/* 1153/*
1196 * Searches the artifact lists and returns one that has the same type 1154 * Searches the artifact lists and returns one that has the same type
1197 * of objects on it. 1155 * of objects on it.
… …
1202 for (artifactlist *al = first_artifactlist; al; al = al->next) 1160 for (artifactlist *al = first_artifactlist; al; al = al->next)
1203 if (al->type == type) 1161 if (al->type == type)
1204 return al; 1162 return al;
1205 1163
1206 return 0; 1164 return 0;
1207}
1208
1209/*
1210 * For debugging purposes. Dumps all tables.
1211 */
1212void
1213dump_artifacts (void)
1214{
1215 artifactlist *al;
1216 artifact *art;
1217 linked_char *next;
1218
1219 fprintf (logfile, "\n");
1220 for (al = first_artifactlist; al != NULL; al = al->next)
1221 {
1222 fprintf (logfile, "Artifact has type %d, total_chance=%d\n", al->type, al->total_chance);
1223 for (art = al->items; art != NULL; art = art->next)
1224 {
1225 fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1226 if (art->allowed != NULL)
1227 {
1228 fprintf (logfile, "\tallowed combinations:");
1229 for (next = art->allowed; next != NULL; next = next->next)
1230 fprintf (logfile, "%s,", &next->name);
1231 fprintf (logfile, "\n");
1232 }
1233 }
1234 }
1235 fprintf (logfile, "\n");
1236}
1237
1238/*
1239 * For debugging purposes. Dumps all treasures recursively (see below).
1240 */
1241void
1242dump_monster_treasure_rec (const char *name, treasure *t, int depth)
1243{
1244 treasurelist *tl;
1245 int i;
1246
1247 if (depth > 100)
1248 return;
1249
1250 while (t)
1251 {
1252 if (t->name)
1253 {
1254 for (i = 0; i < depth; i++)
1255 fprintf (logfile, " ");
1256
1257 fprintf (logfile, "{ (list: %s)\n", &t->name);
1258
1259 tl = treasurelist::find (t->name);
1260 if (tl)
1261 dump_monster_treasure_rec (name, tl->items, depth + 2);
1262
1263 for (i = 0; i < depth; i++)
1264 fprintf (logfile, " ");
1265
1266 fprintf (logfile, "} (end of list: %s)\n", &t->name);
1267 }
1268 else
1269 {
1270 for (i = 0; i < depth; i++)
1271 fprintf (logfile, " ");
1272
1273 if (t->item && t->item->clone.type == FLESH)
1274 fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1275 else
1276 fprintf (logfile, "%s\n", &t->item->clone.name);
1277 }
1278
1279 if (t->next_yes)
1280 {
1281 for (i = 0; i < depth; i++)
1282 fprintf (logfile, " ");
1283
1284 fprintf (logfile, " (if yes)\n");
1285 dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1286 }
1287
1288 if (t->next_no)
1289 {
1290 for (i = 0; i < depth; i++)
1291 fprintf (logfile, " ");
1292
1293 fprintf (logfile, " (if no)\n");
1294 dump_monster_treasure_rec (name, t->next_no, depth + 1);
1295 }
1296
1297 t = t->next;
1298 }
1299}
1300
1301/*
1302 * For debugging purposes. Dumps all treasures for a given monster.
1303 * Created originally by Raphael Quinet for debugging the alchemy code.
1304 */
1305void
1306dump_monster_treasure (const char *name)
1307{
1308 archetype *at;
1309 int found;
1310
1311 found = 0;
1312 fprintf (logfile, "\n");
1313
1314 for (at = first_archetype; at != NULL; at = at->next)
1315 if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1316 {
1317 fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1318 if (at->clone.randomitems != NULL)
1319 dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1320 else
1321 fprintf (logfile, "(nothing)\n");
1322
1323 fprintf (logfile, "\n");
1324 found++;
1325 }
1326
1327 if (found == 0)
1328 fprintf (logfile, "No objects have the name %s!\n\n", name);
1329} 1165}
1330 1166
1331/* 1167/*
1332 * Builds up the lists of artifacts from the file in the libdir. 1168 * Builds up the lists of artifacts from the file in the libdir.
1333 */ 1169 */
… …
1348 object_thawer f (filename); 1184 object_thawer f (filename);
1349 1185
1350 if (!f) 1186 if (!f)
1351 return; 1187 return;
1352 1188
1353 f.next ();
1354
1355 for (;;) 1189 for (;;)
1356 { 1190 {
1357 switch (f.kw) 1191 switch (f.kw)
1358 { 1192 {
1359 case KW_allowed: 1193 case KW_allowed:
1360 if (!art) 1194 if (!art)
1361 {
1362 art = get_empty_artifact (); 1195 art = get_empty_artifact ();
1363 nrofartifacts++;
1364 }
1365 1196
1366 { 1197 {
1367 if (!strcmp (f.get_str (), "all")) 1198 if (!strcmp (f.get_str (), "all"))
1368 break; 1199 break;
1369 1200
1370 char *next, *cp = f.get_str (); 1201 char *next, *cp = f.get_str ();
1371 1202
1372 do 1203 do
1373 { 1204 {
1374 nrofallowedstr++;
1375
1376 if ((next = strchr (cp, ','))) 1205 if ((next = strchr (cp, ',')))
1377 *next++ = '\0'; 1206 *next++ = '\0';
1378 1207
1379 linked_char *tmp = new linked_char; 1208 linked_char *tmp = new linked_char;
1380 1209
… …
1395 break; 1224 break;
1396 1225
1397 case KW_object: 1226 case KW_object:
1398 { 1227 {
1399 art->item = object::create (); 1228 art->item = object::create ();
1229 f.get (art->item->name);
1230 f.next ();
1400 1231
1401 if (!art->item->parse_kv (f)) 1232 if (!art->item->parse_kv (f))
1402 LOG (llevError, "Init_Artifacts: Could not load object.\n"); 1233 LOG (llevError, "Init_Artifacts: Could not load object.\n");
1403 1234
1404 al = find_artifactlist (art->item->type); 1235 al = find_artifactlist (art->item->type);
… …
1430 } 1261 }
1431 1262
1432done: 1263done:
1433 for (al = first_artifactlist; al; al = al->next) 1264 for (al = first_artifactlist; al; al = al->next)
1434 { 1265 {
1266 al->total_chance = 0;
1267
1435 for (art = al->items; art; art = art->next) 1268 for (art = al->items; art; art = art->next)
1436 { 1269 {
1437 if (!art->chance) 1270 if (!art->chance)
1438 LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name); 1271 LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1439 else 1272 else
… …
1445 } 1278 }
1446 1279
1447 LOG (llevDebug, "done.\n"); 1280 LOG (llevDebug, "done.\n");
1448} 1281}
1449 1282
1450
1451/* 1283/*
1452 * Used in artifact generation. The bonuses of the first object 1284 * Used in artifact generation. The bonuses of the first object
1453 * is modified by the bonuses of the second object. 1285 * is modified by the bonuses of the second object.
1454 */ 1286 */
1455
1456void 1287void
1457add_abilities (object *op, object *change) 1288add_abilities (object *op, object *change)
1458{ 1289{
1459 int i, tmp; 1290 int i, tmp;
1460 1291
… …
1465#endif 1296#endif
1466 op->face = change->face; 1297 op->face = change->face;
1467 } 1298 }
1468 1299
1469 for (i = 0; i < NUM_STATS; i++) 1300 for (i = 0; i < NUM_STATS; i++)
1470 change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i)); 1301 change_attr_value (&(op->stats), i, change->stats.stat (i));
1471 1302
1472 op->attacktype |= change->attacktype; 1303 op->attacktype |= change->attacktype;
1473 op->path_attuned |= change->path_attuned; 1304 op->path_attuned |= change->path_attuned;
1474 op->path_repelled |= change->path_repelled; 1305 op->path_repelled |= change->path_repelled;
1475 op->path_denied |= change->path_denied; 1306 op->path_denied |= change->path_denied;
… …
1639 if (change->msg) 1470 if (change->msg)
1640 op->msg = change->msg; 1471 op->msg = change->msg;
1641} 1472}
1642 1473
1643static int 1474static int
1644legal_artifact_combination (object *op, artifact * art) 1475legal_artifact_combination (object *op, artifact *art)
1645{ 1476{
1646 int neg, success = 0; 1477 int neg, success = 0;
1647 linked_char *tmp; 1478 linked_char *tmp;
1648 const char *name; 1479 const char *name;
1649 1480
1650 if (art->allowed == (linked_char *) NULL) 1481 if (!art->allowed)
1651 return 1; /* Ie, "all" */ 1482 return 1; /* Ie, "all" */
1483
1652 for (tmp = art->allowed; tmp; tmp = tmp->next) 1484 for (tmp = art->allowed; tmp; tmp = tmp->next)
1653 { 1485 {
1654#ifdef TREASURE_VERBOSE 1486#ifdef TREASURE_VERBOSE
1655 LOG (llevDebug, "legal_art: %s\n", &tmp->name); 1487 LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1656#endif 1488#endif
… …
1658 name = tmp->name + 1, neg = 1; 1490 name = tmp->name + 1, neg = 1;
1659 else 1491 else
1660 name = tmp->name, neg = 0; 1492 name = tmp->name, neg = 0;
1661 1493
1662 /* If we match name, then return the opposite of 'neg' */ 1494 /* If we match name, then return the opposite of 'neg' */
1663 if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->name))) 1495 if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname)))
1664 return !neg; 1496 return !neg;
1665 1497
1666 /* Set success as true, since if the match was an inverse, it means 1498 /* Set success as true, since if the match was an inverse, it means
1667 * everything is allowed except what we match 1499 * everything is allowed except what we match
1668 */ 1500 */
1669 else if (neg) 1501 else if (neg)
1670 success = 1; 1502 success = 1;
1671 } 1503 }
1504
1672 return success; 1505 return success;
1673} 1506}
1674 1507
1675/* 1508/*
1676 * Fixes the given object, giving it the abilities and titles 1509 * Fixes the given object, giving it the abilities and titles
… …
1813 SET_FLAG (item, FLAG_NO_STEAL); 1646 SET_FLAG (item, FLAG_NO_STEAL);
1814 } 1647 }
1815} 1648}
1816 1649
1817/* special_potion() - so that old potion code is still done right. */ 1650/* special_potion() - so that old potion code is still done right. */
1818
1819int 1651int
1820special_potion (object *op) 1652special_potion (object *op)
1821{ 1653{
1822 if (op->attacktype) 1654 if (op->attacktype)
1823 return 1; 1655 return 1;

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines