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.17 by root, Tue Sep 12 18:15:34 2006 UTC vs.
Revision 1.54 by root, Sat Apr 21 17:34:23 2007 UTC

1
2/* 1/*
3 * static char *rcs_treasure_c =
4 * "$Id: treasure.C,v 1.17 2006/09/12 18:15:34 root Exp $";
5 */
6
7/*
8 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
9 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
10 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team
11 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
12 7 *
13 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
14 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
15 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
16 (at your option) any later version. 11 * (at your option) any later version.
17 12 *
18 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,
19 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 GNU General Public License for more details. 16 * GNU General Public License for more details.
22 17 *
23 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
24 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
25 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
26 21 *
27 The authors can be reached via e-mail at crossfire-devel@real-time.com 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
28*/ 23 */
29
30#define ALLOWED_COMBINATION
31 24
32/* TREASURE_DEBUG does some checking on the treasurelists after loading. 25/* TREASURE_DEBUG does some checking on the treasurelists after loading.
33 * It is useful for finding bugs in the treasures file. Since it only 26 * It is useful for finding bugs in the treasures file. Since it only
34 * slows the startup some (and not actual game play), it is by default 27 * slows the startup some (and not actual game play), it is by default
35 * left on 28 * left on
36 */ 29 */
37#define TREASURE_DEBUG 30#define TREASURE_DEBUG
38 31
39/* TREASURE_VERBOSE enables copious output concerning artifact generation */ 32/* TREASURE_VERBOSE enables copious output concerning artifact generation */
40 33
41/* #define TREASURE_VERBOSE */ 34//#define TREASURE_VERBOSE
42 35
43#include <global.h> 36#include <global.h>
44#include <treasure.h> 37#include <treasure.h>
45#include <funcpoint.h> 38#include <funcpoint.h>
46#include <loader.h> 39#include <loader.h>
47 40
41extern char *spell_mapping[];
42
43static treasurelist *first_treasurelist;
48 44
49static void change_treasure (treasure *t, object *op); /* overrule default values */ 45static void change_treasure (treasure *t, object *op); /* overrule default values */
50extern char *spell_mapping[];
51 46
52/* 47typedef std::tr1::unordered_map<
53 * Initialize global archtype pointers: 48 const char *,
54 */ 49 treasurelist *,
50 str_hash,
51 str_equal,
52 slice_allocator< std::pair<const char *const, treasurelist *> >,
53 true
54> tl_map_t;
55 55
56static tl_map_t tl_map;
57
58/*
59 * Searches for the given treasurelist
60 */
61treasurelist *
62treasurelist::find (const char *name)
63{
64 if (!name)
65 return 0;
66
67 auto (i, tl_map.find (name));
68
69 if (i == tl_map.end ())
70 return 0;
71
72 return i->second;
73}
74
75/*
76 * Searches for the given treasurelist in the globally linked list
77 * of treasurelists which has been built by load_treasures().
78 */
79treasurelist *
80treasurelist::get (const char *name)
81{
82 treasurelist *tl = find (name);
83
84 if (!tl)
85 {
86 tl = new treasurelist;
87
88 tl->name = name;
89 tl->next = first_treasurelist;
90 first_treasurelist = tl;
91
92 tl_map.insert (std::make_pair (tl->name, tl));
93 }
94
95 return tl;
96}
97
98//TODO: class method
56void 99void
57init_archetype_pointers () 100clear (treasurelist *tl)
58{ 101{
59 int prev_warn = warn_archetypes; 102 if (tl->items)
103 {
104 free_treasurestruct (tl->items);
105 tl->items = 0;
106 }
60 107
61 warn_archetypes = 1;
62 if (ring_arch == NULL)
63 ring_arch = find_archetype ("ring");
64 if (amulet_arch == NULL)
65 amulet_arch = find_archetype ("amulet");
66 if (staff_arch == NULL)
67 staff_arch = find_archetype ("staff");
68 if (crown_arch == NULL)
69 crown_arch = find_archetype ("crown");
70 warn_archetypes = prev_warn;
71}
72
73/*
74 * Allocate and return the pointer to an empty treasurelist structure.
75 */
76
77static treasurelist *
78get_empty_treasurelist (void)
79{
80 return new treasurelist;
81}
82
83/*
84 * Allocate and return the pointer to an empty treasure structure.
85 */
86//TODO: make this a constructor
87static treasure *
88get_empty_treasure (void)
89{
90 treasure *t = new treasure;
91
92 t->chance = 100; 108 tl->total_chance = 0;
93
94 return t;
95} 109}
110
111#ifdef TREASURE_DEBUG
112/* recursived checks the linked list. Treasurelist is passed only
113 * so that the treasure name can be printed out
114 */
115static void
116check_treasurelist (const treasure *t, const treasurelist * tl)
117{
118 if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
119 LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
120
121 if (t->next)
122 check_treasurelist (t->next, tl);
123
124 if (t->next_yes)
125 check_treasurelist (t->next_yes, tl);
126
127 if (t->next_no)
128 check_treasurelist (t->next_no, tl);
129}
130#endif
96 131
97/* 132/*
98 * Reads the lib/treasure file from disk, and parses the contents 133 * Reads the lib/treasure file from disk, and parses the contents
99 * into an internal treasure structure (very linked lists) 134 * into an internal treasure structure (very linked lists)
100 */ 135 */
101
102static treasure * 136static treasure *
103load_treasure (FILE * fp, int *line) 137read_treasure (object_thawer &f)
104{ 138{
105 char buf[MAX_BUF], *cp, variable[MAX_BUF];
106 treasure *t = get_empty_treasure (); 139 treasure *t = new treasure;
107 int value;
108 140
109 nroftreasures++; 141 f.next ();
110 while (fgets (buf, MAX_BUF, fp) != NULL)
111 {
112 (*line)++;
113 142
114 if (*buf == '#') 143 for (;;)
115 continue; 144 {
116 if ((cp = strchr (buf, '\n')) != NULL) 145 coroapi::cede_to_tick_every (10);
117 *cp = '\0';
118 cp = buf;
119 while (isspace (*cp)) /* Skip blanks */
120 cp++;
121 146
122 if (sscanf (cp, "arch %s", variable)) 147 switch (f.kw)
123 {
124 if ((t->item = find_archetype (variable)) == NULL)
125 LOG (llevError, "Treasure lacks archetype: %s\n", variable);
126 } 148 {
127 else if (sscanf (cp, "list %s", variable)) 149 case KW_arch:
128 t->name = variable; 150 t->item = archetype::get (f.get_str ());
129 else if (sscanf (cp, "change_name %s", variable)) 151 break;
130 t->change_arch.name = variable; 152
131 else if (sscanf (cp, "change_title %s", variable)) 153 case KW_list: f.get (t->name); break;
132 t->change_arch.title = variable; 154 case KW_change_name: f.get (t->change_arch.name); break;
133 else if (sscanf (cp, "change_slaying %s", variable)) 155 case KW_change_title: f.get (t->change_arch.title); break;
134 t->change_arch.slaying = variable; 156 case KW_change_slaying: f.get (t->change_arch.slaying); break;
135 else if (sscanf (cp, "chance %d", &value)) 157 case KW_chance: f.get (t->chance); break;
136 t->chance = (uint8) value; 158 case KW_nrof: f.get (t->nrof); break;
137 else if (sscanf (cp, "nrof %d", &value)) 159 case KW_magic: f.get (t->magic); break;
138 t->nrof = (uint16) value; 160
139 else if (sscanf (cp, "magic %d", &value)) 161 case KW_yes: t->next_yes = read_treasure (f); continue;
140 t->magic = (uint8) value; 162 case KW_no: t->next_no = read_treasure (f); continue;
141 else if (!strcmp (cp, "yes")) 163
142 t->next_yes = load_treasure (fp, line); 164 case KW_end:
143 else if (!strcmp (cp, "no")) 165 f.next ();
144 t->next_no = load_treasure (fp, line);
145 else if (!strcmp (cp, "end"))
146 return t;
147 else if (!strcmp (cp, "more"))
148 {
149 t->next = load_treasure (fp, line);
150 return t; 166 return t;
151 }
152 else
153 LOG (llevError, "Unknown treasure-command: '%s', last entry %s, line %d\n", cp, &t->name, *line);
154 }
155 LOG (llevError, "treasure lacks 'end'.\n");
156 return t;
157}
158 167
159#ifdef TREASURE_DEBUG 168 case KW_more:
169 t->next = read_treasure (f);
170 return t;
160 171
161/* recursived checks the linked list. Treasurelist is passed only 172 default:
162 * so that the treasure name can be printed out 173 if (!f.parse_error ("treasurelist", t->name))
163 */ 174 return 0;
164static void
165check_treasurelist (const treasure *t, const treasurelist * tl)
166{
167 if (t->item == NULL && t->name == NULL)
168 LOG (llevError, "Treasurelist %s has element with no name or archetype\n", &tl->name);
169 if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
170 LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
171 /* find_treasurelist will print out its own error message */
172 if (t->name && *t->name)
173 (void) find_treasurelist (t->name);
174 if (t->next)
175 check_treasurelist (t->next, tl);
176 if (t->next_yes)
177 check_treasurelist (t->next_yes, tl);
178 if (t->next_no)
179 check_treasurelist (t->next_no, tl);
180}
181#endif
182 175
176 return t;
177 }
178
179 f.next ();
180 }
181}
182
183/* 183/*
184 * Opens LIBDIR/treasure and reads all treasure-declarations from it.
185 * Each treasure is parsed with the help of load_treasure(). 184 * Each treasure is parsed with the help of load_treasure().
186 */ 185 */
187 186treasurelist *
188void 187treasurelist::read (object_thawer &f)
189load_treasures (void)
190{ 188{
191 FILE *fp; 189 assert (f.kw == KW_treasure || f.kw == KW_treasureone);
192 char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF];
193 treasurelist *previous = NULL;
194 treasure *t;
195 int comp, line = 0;
196 190
197 sprintf (filename, "%s/%s", settings.datadir, settings.treasures); 191 bool one = f.kw == KW_treasureone;
198 if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL) 192 treasurelist *tl = treasurelist::get (f.get_str ());
199 { 193 clear (tl);
200 LOG (llevError, "Can't open treasure file.\n"); 194 tl->items = read_treasure (f);
195 if (!tl->items)
201 return; 196 return 0;
202 }
203 while (fgets (buf, MAX_BUF, fp) != NULL)
204 {
205 line++;
206 if (*buf == '#')
207 continue;
208 197
209 if (sscanf (buf, "treasureone %s\n", name) || sscanf (buf, "treasure %s\n", name))
210 {
211 treasurelist *tl = get_empty_treasurelist ();
212
213 tl->name = name;
214 if (previous == NULL)
215 first_treasurelist = tl;
216 else
217 previous->next = tl;
218 previous = tl;
219 tl->items = load_treasure (fp, &line);
220
221 /* This is a one of the many items on the list should be generated. 198 /* This is a one of the many items on the list should be generated.
222 * Add up the chance total, and check to make sure the yes & no 199 * Add up the chance total, and check to make sure the yes & no
223 * fields of the treasures are not being used. 200 * fields of the treasures are not being used.
224 */ 201 */
225 if (!strncmp (buf, "treasureone", 11)) 202 tl->total_chance = 0;
203
204 if (one)
205 {
206 for (treasure *t = tl->items; t; t = t->next)
207 {
208 if (t->next_yes || t->next_no)
226 { 209 {
227 for (t = tl->items; t != NULL; t = t->next)
228 {
229#ifdef TREASURE_DEBUG
230 if (t->next_yes || t->next_no)
231 {
232 LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); 210 LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);
233 LOG (llevError, " the next_yes or next_no field is set\n"); 211 LOG (llevError, " the next_yes or next_no field is set\n");
234 }
235#endif
236 tl->total_chance += t->chance;
237 }
238 } 212 }
239 }
240 else
241 LOG (llevError, "Treasure-list %s didn't understand: %s, line %d\n", filename, buf, line);
242 }
243 close_and_delete (fp, comp);
244 213
245#ifdef TREASURE_DEBUG 214 tl->total_chance += t->chance;
246 /* Perform some checks on how valid the treasure data actually is. 215 }
247 * verify that list transitions work (ie, the list that it is supposed 216 }
248 * to transition to exists). Also, verify that at least the name
249 * or archetype is set for each treasure element.
250 */
251 for (previous = first_treasurelist; previous != NULL; previous = previous->next)
252 check_treasurelist (previous->items, previous);
253#endif
254}
255 217
256/*
257 * Searches for the given treasurelist in the globally linked list
258 * of treasurelists which has been built by load_treasures().
259 */
260
261treasurelist *
262find_treasurelist (const char *name)
263{
264 shstr_cmp name_ (name);
265
266 if (!name_)
267 return 0;
268
269 for (treasurelist * tl = first_treasurelist; tl != 0; tl = tl->next)
270 if (name_ == tl->name)
271 return tl;
272
273 if (first_treasurelist)
274 LOG (llevError, "Couldn't find treasurelist %s\n", name);
275
276 return 0; 218 return tl;
277} 219}
278
279 220
280/* 221/*
281 * Generates the objects specified by the given treasure. 222 * Generates the objects specified by the given treasure.
282 * It goes recursively through the rest of the linked list. 223 * It goes recursively through the rest of the linked list.
283 * If there is a certain percental chance for a treasure to be generated, 224 * If there is a certain percental chance for a treasure to be generated,
… …
286 * being generated. 227 * being generated.
287 * If flag is GT_INVISIBLE, only invisible objects are generated (ie, only 228 * If flag is GT_INVISIBLE, only invisible objects are generated (ie, only
288 * abilities. This is used by summon spells, thus no summoned monsters 229 * abilities. This is used by summon spells, thus no summoned monsters
289 * start with equipment, but only their abilities). 230 * start with equipment, but only their abilities).
290 */ 231 */
291
292
293static void 232static void
294put_treasure (object *op, object *creator, int flags) 233put_treasure (object *op, object *creator, int flags)
295{ 234{
296 object *tmp;
297
298 /* Bit of a hack - spells should never be put onto the map. The entire 235 /* Bit of a hack - spells should never be put onto the map. The entire
299 * treasure stuff is a problem - there is no clear idea of knowing 236 * treasure stuff is a problem - there is no clear idea of knowing
300 * this is the original object, or if this is an object that should be created 237 * this is the original object, or if this is an object that should be created
301 * by another object. 238 * by another object.
302 */ 239 */
303 if (flags & GT_ENVIRONMENT && op->type != SPELL) 240 if (flags & GT_ENVIRONMENT && op->type != SPELL)
304 { 241 {
305 op->x = creator->x; 242 op->expand_tail ();
306 op->y = creator->y; 243
244 if (ob_blocked (op, creator->map, creator->x, creator->y))
245 op->destroy ();
246 else
247 {
307 SET_FLAG (op, FLAG_OBJ_ORIGINAL); 248 SET_FLAG (op, FLAG_OBJ_ORIGINAL);
308 insert_ob_in_map (op, creator->map, op, INS_NO_MERGE | INS_NO_WALK_ON); 249 op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);
250 }
309 } 251 }
310 else 252 else
311 { 253 {
312 op = insert_ob_in_ob (op, creator); 254 op = creator->insert (op);
255
313 if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) 256 if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
314 monster_check_apply (creator, op); 257 monster_check_apply (creator, op);
315 if ((flags & GT_UPDATE_INV) && (tmp = is_player_inv (creator)) != NULL) 258
259 if (flags & GT_UPDATE_INV)
260 if (object *tmp = creator->in_player ())
316 esrv_send_item (tmp, op); 261 esrv_send_item (tmp, op);
317 } 262 }
318} 263}
319 264
320/* if there are change_xxx commands in the treasure, we include the changes 265/* if there are change_xxx commands in the treasure, we include the changes
321 * in the generated object 266 * in the generated object
… …
335 280
336 if (t->change_arch.slaying) 281 if (t->change_arch.slaying)
337 op->slaying = t->change_arch.slaying; 282 op->slaying = t->change_arch.slaying;
338} 283}
339 284
340void 285static void
341create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries) 286create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries)
342{ 287{
343 object *tmp;
344
345 if ((int) t->chance >= 100 || (RANDOM () % 100 + 1) < (int) t->chance) 288 if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance)
346 { 289 {
347 if (t->name) 290 if (t->name)
348 { 291 {
349 if (strcmp (t->name, "NONE") && difficulty >= t->magic) 292 if (difficulty >= t->magic)
293 if (treasurelist *tl = treasurelist::find (t->name))
350 create_treasure (find_treasurelist (t->name), op, flag, difficulty, tries); 294 create_treasure (tl, op, flag, difficulty, tries);
295 else
296 LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
351 } 297 }
352 else 298 else
353 { 299 {
354 if (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE)) 300 if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE)))
355 { 301 {
356 tmp = arch_to_object (t->item); 302 object *tmp = arch_to_object (t->item);
303
357 if (t->nrof && tmp->nrof <= 1) 304 if (t->nrof && tmp->nrof <= 1)
358 tmp->nrof = RANDOM () % ((int) t->nrof) + 1; 305 tmp->nrof = rndm (t->nrof) + 1;
306
359 fix_generated_item (tmp, op, difficulty, t->magic, flag); 307 fix_generated_item (tmp, op, difficulty, t->magic, flag);
360 change_treasure (t, tmp); 308 change_treasure (t, tmp);
361 put_treasure (tmp, op, flag); 309 put_treasure (tmp, op, flag);
362 } 310 }
363 } 311 }
364 312
365 if (t->next_yes != NULL) 313 if (t->next_yes)
366 create_all_treasures (t->next_yes, op, flag, difficulty, tries); 314 create_all_treasures (t->next_yes, op, flag, difficulty, tries);
367 } 315 }
368 else if (t->next_no != NULL) 316 else if (t->next_no)
369 create_all_treasures (t->next_no, op, flag, difficulty, tries); 317 create_all_treasures (t->next_no, op, flag, difficulty, tries);
370 318
371 if (t->next != NULL) 319 if (t->next)
372 create_all_treasures (t->next, op, flag, difficulty, tries); 320 create_all_treasures (t->next, op, flag, difficulty, tries);
373} 321}
374 322
375void 323static void
376create_one_treasure (treasurelist * tl, object *op, int flag, int difficulty, int tries) 324create_one_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
377{ 325{
378 int value = RANDOM () % tl->total_chance; 326 int value = rndm (tl->total_chance);
379 treasure *t; 327 treasure *t;
380 328
381 if (tries++ > 100) 329 if (tries++ > 100)
382 { 330 {
383 LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n"); 331 LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n");
384 return; 332 return;
385 } 333 }
386 334
387 for (t = tl->items; t != NULL; t = t->next) 335 for (t = tl->items; t; t = t->next)
388 { 336 {
389 value -= t->chance; 337 value -= t->chance;
390 338
391 if (value < 0) 339 if (value < 0)
392 break; 340 break;
393 } 341 }
394 342
395 if (!t || value >= 0) 343 if (!t || value >= 0)
396 {
397 LOG (llevError, "create_one_treasure: got null object or not able to find treasure\n"); 344 cleanup ("create_one_treasure: got null object or not able to find treasure\n", 1);
398 abort ();
399 return;
400 }
401 345
402 if (t->name) 346 if (t->name)
403 { 347 {
404 if (!strcmp (t->name, "NONE"))
405 return;
406
407 if (difficulty >= t->magic) 348 if (difficulty >= t->magic)
349 {
350 treasurelist *tl = treasurelist::find (t->name);
351 if (tl)
408 create_treasure (find_treasurelist (t->name), op, flag, difficulty, tries); 352 create_treasure (tl, op, flag, difficulty, tries);
353 }
409 else if (t->nrof) 354 else if (t->nrof)
410 create_one_treasure (tl, op, flag, difficulty, tries); 355 create_one_treasure (tl, op, flag, difficulty, tries);
411
412 return;
413 } 356 }
414
415 if ((t->item && t->item->clone.invisible != 0) || flag != GT_INVISIBLE) 357 else if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE))
416 { 358 {
417 object *tmp = arch_to_object (t->item); 359 if (object *tmp = arch_to_object (t->item))
418 360 {
419 if (!tmp)
420 return;
421
422 if (t->nrof && tmp->nrof <= 1) 361 if (t->nrof && tmp->nrof <= 1)
423 tmp->nrof = RANDOM () % ((int) t->nrof) + 1; 362 tmp->nrof = rndm (t->nrof) + 1;
424 363
425 fix_generated_item (tmp, op, difficulty, t->magic, flag); 364 fix_generated_item (tmp, op, difficulty, t->magic, flag);
426 change_treasure (t, tmp); 365 change_treasure (t, tmp);
427 put_treasure (tmp, op, flag); 366 put_treasure (tmp, op, flag);
367 }
428 } 368 }
429} 369}
430 370
431/* This calls the appropriate treasure creation function. tries is passed 371/* This calls the appropriate treasure creation function. tries is passed
432 * to determine how many list transitions or attempts to create treasure 372 * to determine how many list transitions or attempts to create treasure
… …
434 * list transitions, or so that excessively good treasure will not be 374 * list transitions, or so that excessively good treasure will not be
435 * created on weak maps, because it will exceed the number of allowed tries 375 * created on weak maps, because it will exceed the number of allowed tries
436 * to do that. 376 * to do that.
437 */ 377 */
438void 378void
439create_treasure (treasurelist * t, object *op, int flag, int difficulty, int tries) 379create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries)
440{ 380{
381 // empty treasurelists are legal
382 if (!tl->items)
383 return;
441 384
442 if (tries++ > 100) 385 if (tries++ > 100)
443 { 386 {
444 LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); 387 LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
445 return; 388 return;
446 } 389 }
390
447 if (t->total_chance) 391 if (tl->total_chance)
448 create_one_treasure (t, op, flag, difficulty, tries); 392 create_one_treasure (tl, op, flag, difficulty, tries);
449 else 393 else
450 create_all_treasures (t->items, op, flag, difficulty, tries); 394 create_all_treasures (tl->items, op, flag, difficulty, tries);
451} 395}
452 396
453/* This is similar to the old generate treasure function. However, 397/* This is similar to the old generate treasure function. However,
454 * it instead takes a treasurelist. It is really just a wrapper around 398 * it instead takes a treasurelist. It is really just a wrapper around
455 * create_treasure. We create a dummy object that the treasure gets 399 * create_treasure. We create a dummy object that the treasure gets
456 * inserted into, and then return that treausre 400 * inserted into, and then return that treausre
457 */ 401 */
458object * 402object *
459generate_treasure (treasurelist * t, int difficulty) 403generate_treasure (treasurelist *tl, int difficulty)
460{ 404{
461 object *ob = get_object (), *tmp; 405 difficulty = clamp (difficulty, 1, settings.max_level);
462 406
407 object *ob = object::create ();
408
463 create_treasure (t, ob, 0, difficulty, 0); 409 create_treasure (tl, ob, 0, difficulty, 0);
464 410
465 /* Don't want to free the object we are about to return */ 411 /* Don't want to free the object we are about to return */
466 tmp = ob->inv; 412 object *tmp = ob->inv;
467 if (tmp != NULL) 413 if (tmp)
468 remove_ob (tmp); 414 tmp->remove ();
415
469 if (ob->inv) 416 if (ob->inv)
470 {
471 LOG (llevError, "In generate treasure, created multiple objects.\n"); 417 LOG (llevError, "In generate treasure, created multiple objects.\n");
472 } 418
473 free_object (ob); 419 ob->destroy ();
474 return tmp; 420 return tmp;
475} 421}
476 422
477/* 423/*
478 * This is a new way of calculating the chance for an item to have 424 * This is a new way of calculating the chance for an item to have
… …
480 * The array has two arguments, the difficulty of the level, and the 426 * The array has two arguments, the difficulty of the level, and the
481 * magical bonus "wanted". 427 * magical bonus "wanted".
482 */ 428 */
483 429
484static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = { 430static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
485
486/*chance of magic difficulty*/ 431// chance of magic difficulty
487
488/* +0 +1 +2 +3 +4 */ 432// +0 +1 +2 +3 +4
489 {95, 2, 2, 1, 0}, /*1 */ 433 {95, 2, 2, 1, 0}, // 1
490 {92, 5, 2, 1, 0}, /*2 */ 434 {92, 5, 2, 1, 0}, // 2
491 {85, 10, 4, 1, 0}, /*3 */ 435 {85, 10, 4, 1, 0}, // 3
492 {80, 14, 4, 2, 0}, /*4 */ 436 {80, 14, 4, 2, 0}, // 4
493 {75, 17, 5, 2, 1}, /*5 */ 437 {75, 17, 5, 2, 1}, // 5
494 {70, 18, 8, 3, 1}, /*6 */ 438 {70, 18, 8, 3, 1}, // 6
495 {65, 21, 10, 3, 1}, /*7 */ 439 {65, 21, 10, 3, 1}, // 7
496 {60, 22, 12, 4, 2}, /*8 */ 440 {60, 22, 12, 4, 2}, // 8
497 {55, 25, 14, 4, 2}, /*9 */ 441 {55, 25, 14, 4, 2}, // 9
498 {50, 27, 16, 5, 2}, /*10 */ 442 {50, 27, 16, 5, 2}, // 10
499 {45, 28, 18, 6, 3}, /*11 */ 443 {45, 28, 18, 6, 3}, // 11
500 {42, 28, 20, 7, 3}, /*12 */ 444 {42, 28, 20, 7, 3}, // 12
501 {40, 27, 21, 8, 4}, /*13 */ 445 {40, 27, 21, 8, 4}, // 13
502 {38, 25, 22, 10, 5}, /*14 */ 446 {38, 25, 22, 10, 5}, // 14
503 {36, 23, 23, 12, 6}, /*15 */ 447 {36, 23, 23, 12, 6}, // 15
504 {33, 21, 24, 14, 8}, /*16 */ 448 {33, 21, 24, 14, 8}, // 16
505 {31, 19, 25, 16, 9}, /*17 */ 449 {31, 19, 25, 16, 9}, // 17
506 {27, 15, 30, 18, 10}, /*18 */ 450 {27, 15, 30, 18, 10}, // 18
507 {20, 12, 30, 25, 13}, /*19 */ 451 {20, 12, 30, 25, 13}, // 19
508 {15, 10, 28, 30, 17}, /*20 */ 452 {15, 10, 28, 30, 17}, // 20
509 {13, 9, 27, 28, 23}, /*21 */ 453 {13, 9, 27, 28, 23}, // 21
510 {10, 8, 25, 28, 29}, /*22 */ 454 {10, 8, 25, 28, 29}, // 22
511 {8, 7, 23, 26, 36}, /*23 */ 455 { 8, 7, 23, 26, 36}, // 23
512 {6, 6, 20, 22, 46}, /*24 */ 456 { 6, 6, 20, 22, 46}, // 24
513 {4, 5, 17, 18, 56}, /*25 */ 457 { 4, 5, 17, 18, 56}, // 25
514 {2, 4, 12, 14, 68}, /*26 */ 458 { 2, 4, 12, 14, 68}, // 26
515 {0, 3, 7, 10, 80}, /*27 */ 459 { 0, 3, 7, 10, 80}, // 27
516 {0, 0, 3, 7, 90}, /*28 */ 460 { 0, 0, 3, 7, 90}, // 28
517 {0, 0, 0, 3, 97}, /*29 */ 461 { 0, 0, 0, 3, 97}, // 29
518 {0, 0, 0, 0, 100}, /*30 */ 462 { 0, 0, 0, 0, 100}, // 30
519 {0, 0, 0, 0, 100}, /*31 */ 463 { 0, 0, 0, 0, 100}, // 31
520}; 464};
521
522 465
523/* calculate the appropriate level for wands staves and scrolls. 466/* calculate the appropriate level for wands staves and scrolls.
524 * This code presumes that op has had its spell object created (in op->inv) 467 * This code presumes that op has had its spell object created (in op->inv)
525 * 468 *
526 * elmex Wed Aug 9 17:44:59 CEST 2006: 469 * elmex Wed Aug 9 17:44:59 CEST 2006:
527 * Removed multiplicator, too many high-level items were generated on low-difficulty maps. 470 * Removed multiplicator, too many high-level items were generated on low-difficulty maps.
528 */ 471 */
529
530int 472int
531level_for_item (const object *op, int difficulty) 473level_for_item (const object *op, int difficulty)
532{ 474{
533 int olevel = 0; 475 int olevel = 0;
534 476
… …
557 * elmex Thu Aug 10 18:45:44 CEST 2006: 499 * elmex Thu Aug 10 18:45:44 CEST 2006:
558 * Scaling difficulty by max_level, as difficulty is a level and not some 500 * Scaling difficulty by max_level, as difficulty is a level and not some
559 * weird integer between 1-31. 501 * weird integer between 1-31.
560 * 502 *
561 */ 503 */
562
563int 504int
564magic_from_difficulty (int difficulty) 505magic_from_difficulty (int difficulty)
565{ 506{
566 int percent = 0, magic = 0; 507 int percent = 0, magic = 0;
567 int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS); 508 int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS);
… …
572 scaled_diff = 0; 513 scaled_diff = 0;
573 514
574 if (scaled_diff >= DIFFLEVELS) 515 if (scaled_diff >= DIFFLEVELS)
575 scaled_diff = DIFFLEVELS - 1; 516 scaled_diff = DIFFLEVELS - 1;
576 517
577 percent = RANDOM () % 100; 518 percent = rndm (100);
578 519
579 for (magic = 0; magic < (MAXMAGIC + 1); magic++) 520 for (magic = 0; magic < (MAXMAGIC + 1); magic++)
580 { 521 {
581 percent -= difftomagic_list[scaled_diff][magic]; 522 percent -= difftomagic_list[scaled_diff][magic];
582 523
… …
588 { 529 {
589 LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty); 530 LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty);
590 magic = 0; 531 magic = 0;
591 } 532 }
592 533
593 magic = (RANDOM () % 3) ? magic : -magic; 534 magic = (rndm (3)) ? magic : -magic;
594 /* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */ 535 /* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */
595 536
596 return magic; 537 return magic;
597} 538}
598 539
… …
613 if (op->arch) 554 if (op->arch)
614 { 555 {
615 if (op->type == ARMOUR) 556 if (op->type == ARMOUR)
616 ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100; 557 ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100;
617 558
618 if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */ 559 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
619 magic = (-magic); 560 magic = (-magic);
620 op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100; 561 op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100;
621 } 562 }
622 else 563 else
623 { 564 {
624 if (op->type == ARMOUR) 565 if (op->type == ARMOUR)
625 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; 566 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
626 if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */ 567 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
627 magic = (-magic); 568 magic = (-magic);
628 op->weight = (op->weight * (100 - magic * 10)) / 100; 569 op->weight = (op->weight * (100 - magic * 10)) / 100;
629 } 570 }
630} 571}
631 572
… …
655 * 1) Since rings can have multiple bonuses, if the same bonus 596 * 1) Since rings can have multiple bonuses, if the same bonus
656 * is rolled again, increase it - the bonuses now stack with 597 * is rolled again, increase it - the bonuses now stack with
657 * other bonuses previously rolled and ones the item might natively have. 598 * other bonuses previously rolled and ones the item might natively have.
658 * 2) Add code to deal with new PR method. 599 * 2) Add code to deal with new PR method.
659 */ 600 */
660
661void 601void
662set_ring_bonus (object *op, int bonus) 602set_ring_bonus (object *op, int bonus)
663{ 603{
664 604
665 int r = RANDOM () % (bonus > 0 ? 25 : 11); 605 int r = rndm (bonus > 0 ? 25 : 11);
666 606
667 if (op->type == AMULET) 607 if (op->type == AMULET)
668 { 608 {
669 if (!(RANDOM () % 21)) 609 if (!(rndm (21)))
670 r = 20 + RANDOM () % 2; 610 r = 20 + rndm (2);
671 else 611 else
672 { 612 {
673 if (RANDOM () & 2) 613 if (rndm (2))
674 r = 10; 614 r = 10;
675 else 615 else
676 r = 11 + RANDOM () % 9; 616 r = 11 + rndm (9);
677 } 617 }
678 } 618 }
679 619
680 switch (r) 620 switch (r)
681 { 621 {
… …
718 case 16: 658 case 16:
719 case 17: 659 case 17:
720 case 18: 660 case 18:
721 case 19: 661 case 19:
722 { 662 {
723 int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table; 663 int b = 5 + abs (bonus), val, resist = rndm (num_resist_table);
724 664
725 /* Roughly generate a bonus between 100 and 35 (depending on the bonus) */ 665 /* Roughly generate a bonus between 100 and 35 (depending on the bonus) */
726 val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b; 666 val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b);
727 667
728 /* Cursed items need to have higher negative values to equal out with 668 /* Cursed items need to have higher negative values to equal out with
729 * positive values for how protections work out. Put another 669 * positive values for how protections work out. Put another
730 * little random element in since that they don't always end up with 670 * little random element in since that they don't always end up with
731 * even values. 671 * even values.
732 */ 672 */
733 if (bonus < 0) 673 if (bonus < 0)
734 val = 2 * -val - RANDOM () % b; 674 val = 2 * -val - rndm (b);
735 if (val > 35) 675 if (val > 35)
736 val = 35; /* Upper limit */ 676 val = 35; /* Upper limit */
737 b = 0; 677 b = 0;
678
738 while (op->resist[resist_table[resist]] != 0 && b < 4) 679 while (op->resist[resist_table[resist]] != 0 && b < 4)
739 {
740 resist = RANDOM () % num_resist_table; 680 resist = rndm (num_resist_table);
741 } 681
742 if (b == 4) 682 if (b == 4)
743 return; /* Not able to find a free resistance */ 683 return; /* Not able to find a free resistance */
684
744 op->resist[resist_table[resist]] = val; 685 op->resist[resist_table[resist]] = val;
745 /* We should probably do something more clever here to adjust value 686 /* We should probably do something more clever here to adjust value
746 * based on how good a resistance we gave. 687 * based on how good a resistance we gave.
747 */ 688 */
748 break; 689 break;
… …
776 case 22: 717 case 22:
777 op->stats.exp += bonus; /* Speed! */ 718 op->stats.exp += bonus; /* Speed! */
778 op->value = (op->value * 2) / 3; 719 op->value = (op->value * 2) / 3;
779 break; 720 break;
780 } 721 }
722
781 if (bonus > 0) 723 if (bonus > 0)
782 op->value *= 2 * bonus; 724 op->value *= 2 * bonus;
783 else 725 else
784 op->value = -(op->value * 2 * bonus) / 3; 726 op->value = -(op->value * 2 * bonus) / 3;
785} 727}
… …
790 * higher is the chance of returning a low number. 732 * higher is the chance of returning a low number.
791 * It is only used in fix_generated_treasure() to set bonuses on 733 * It is only used in fix_generated_treasure() to set bonuses on
792 * rings and amulets. 734 * rings and amulets.
793 * Another scheme is used to calculate the magic of weapons and armours. 735 * Another scheme is used to calculate the magic of weapons and armours.
794 */ 736 */
795
796int 737int
797get_magic (int diff) 738get_magic (int diff)
798{ 739{
799 int i; 740 int i;
800 741
801 if (diff < 3) 742 if (diff < 3)
802 diff = 3; 743 diff = 3;
744
803 for (i = 0; i < 4; i++) 745 for (i = 0; i < 4; i++)
804 if (RANDOM () % diff) 746 if (rndm (diff))
805 return i; 747 return i;
748
806 return 4; 749 return 4;
807} 750}
808 751
809#define DICE2 (get_magic(2)==2?2:1) 752#define DICE2 (get_magic(2)==2?2:1)
810#define DICESPELL (RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3) 753#define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3))
811 754
812/* 755/*
813 * fix_generated_item(): This is called after an item is generated, in 756 * fix_generated_item(): This is called after an item is generated, in
814 * order to set it up right. This produced magical bonuses, puts spells 757 * order to set it up right. This produced magical bonuses, puts spells
815 * into scrolls/books/wands, makes it unidentified, hides the value, etc. 758 * into scrolls/books/wands, makes it unidentified, hides the value, etc.
… …
829 * value. 772 * value.
830 * GT_MINIMAL: Does minimal processing on the object - just enough to make it 773 * GT_MINIMAL: Does minimal processing on the object - just enough to make it
831 * a working object - don't change magic, value, etc, but set it material 774 * a working object - don't change magic, value, etc, but set it material
832 * type as appropriate, for objects that need spell objects, set those, etc 775 * type as appropriate, for objects that need spell objects, set those, etc
833 */ 776 */
834
835void 777void
836fix_generated_item (object *op, object *creator, int difficulty, int max_magic, int flags) 778fix_generated_item (object *op, object *creator, int difficulty, int max_magic, int flags)
837{ 779{
838 int was_magic = op->magic, num_enchantments = 0, save_item_power = 0; 780 int was_magic = op->magic, num_enchantments = 0, save_item_power = 0;
839 781
… …
844 save_item_power = op->item_power; 786 save_item_power = op->item_power;
845 op->item_power = 0; 787 op->item_power = 0;
846 788
847 if (op->randomitems && op->type != SPELL) 789 if (op->randomitems && op->type != SPELL)
848 { 790 {
849 create_treasure (op->randomitems, op, flags, difficulty, 0); 791 create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0);
850 if (!op->inv)
851 LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", &op->name);
852
853 /* So the treasure doesn't get created again */ 792 /* So the treasure doesn't get created again */
854 op->randomitems = NULL; 793 op->randomitems = 0;
855 } 794 }
856 795
857 if (difficulty < 1) 796 if (difficulty < 1)
858 difficulty = 1; 797 difficulty = 1;
798
799 if (INVOKE_OBJECT (ADD_BONUS, op,
800 ARG_OBJECT (creator != op ? creator : 0),
801 ARG_INT (difficulty), ARG_INT (max_magic),
802 ARG_INT (flags)))
803 return;
859 804
860 if (!(flags & GT_MINIMAL)) 805 if (!(flags & GT_MINIMAL))
861 { 806 {
862 if (op->arch == crown_arch) 807 if (op->arch == crown_arch)
863 { 808 {
… …
870 if (!op->magic && max_magic) 815 if (!op->magic && max_magic)
871 set_magic (difficulty, op, max_magic, flags); 816 set_magic (difficulty, op, max_magic, flags);
872 817
873 num_enchantments = calc_item_power (op, 1); 818 num_enchantments = calc_item_power (op, 1);
874 819
875 if ((!was_magic && !(RANDOM () % CHANCE_FOR_ARTIFACT)) || op->type == HORN || difficulty >= settings.max_level) /* high difficulties always generate an artifact, 820 if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
821 || op->type == HORN
822 || difficulty >= settings.max_level) /* high difficulties always generate an artifact,
876 * used for shop_floors or treasures */ 823 * used for shop_floors or treasures */
877 generate_artifact (op, difficulty); 824 generate_artifact (op, difficulty);
878 } 825 }
879 826
880 /* Object was made an artifact. Calculate its item_power rating. 827 /* Object was made an artifact. Calculate its item_power rating.
… …
938 case WEAPON: 885 case WEAPON:
939 case ARMOUR: 886 case ARMOUR:
940 case SHIELD: 887 case SHIELD:
941 case HELMET: 888 case HELMET:
942 case CLOAK: 889 case CLOAK:
943 if (QUERY_FLAG (op, FLAG_CURSED) && !(RANDOM () % 4)) 890 if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4)))
944 set_ring_bonus (op, -DICE2); 891 set_ring_bonus (op, -DICE2);
945 break; 892 break;
946 893
947 case BRACERS: 894 case BRACERS:
948 if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))) 895 if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))
949 { 896 {
950 set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2); 897 set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
951 if (!QUERY_FLAG (op, FLAG_CURSED)) 898 if (!QUERY_FLAG (op, FLAG_CURSED))
952 op->value *= 3; 899 op->value *= 3;
953 } 900 }
… …
979 */ 926 */
980 if (op->inv && op->randomitems) 927 if (op->inv && op->randomitems)
981 { 928 {
982 /* value multiplier is same as for scrolls */ 929 /* value multiplier is same as for scrolls */
983 op->value = (op->value * op->inv->value); 930 op->value = (op->value * op->inv->value);
984 op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty; 931 op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty);
985 } 932 }
986 else 933 else
987 { 934 {
988 op->name = "potion"; 935 op->name = "potion";
989 op->name_pl = "potions"; 936 op->name_pl = "potions";
990 } 937 }
991 938
992 if (!(flags & GT_ONLY_GOOD) && RANDOM () % 2) 939 if (!(flags & GT_ONLY_GOOD) && rndm (2))
993 SET_FLAG (op, FLAG_CURSED); 940 SET_FLAG (op, FLAG_CURSED);
994 break; 941 break;
995 } 942 }
996 943
997 case AMULET: 944 case AMULET:
… …
999 op->value *= 5; /* Since it's not just decoration */ 946 op->value *= 5; /* Since it's not just decoration */
1000 947
1001 case RING: 948 case RING:
1002 if (op->arch == NULL) 949 if (op->arch == NULL)
1003 { 950 {
1004 remove_ob (op); 951 op->destroy ();
1005 free_object (op);
1006 op = NULL; 952 op = 0;
1007 break; 953 break;
1008 } 954 }
1009 955
1010 if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */ 956 if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */
1011 break; 957 break;
1012 958
1013 if (!(flags & GT_ONLY_GOOD) && !(RANDOM () % 3)) 959 if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
1014 SET_FLAG (op, FLAG_CURSED); 960 SET_FLAG (op, FLAG_CURSED);
1015 961
1016 set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2); 962 set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2);
1017 963
1018 if (op->type != RING) /* Amulets have only one ability */ 964 if (op->type != RING) /* Amulets have only one ability */
1019 break; 965 break;
1020 966
1021 if (!(RANDOM () % 4)) 967 if (!(rndm (4)))
1022 { 968 {
1023 int d = (RANDOM () % 2 || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2; 969 int d = (rndm (2) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1024 970
1025 if (d > 0) 971 if (d > 0)
1026 op->value *= 3; 972 op->value *= 3;
1027 973
1028 set_ring_bonus (op, d); 974 set_ring_bonus (op, d);
1029 975
1030 if (!(RANDOM () % 4)) 976 if (!(rndm (4)))
1031 { 977 {
1032 int d = (RANDOM () % 3 || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2; 978 int d = (rndm (3) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2;
1033 979
1034 if (d > 0) 980 if (d > 0)
1035 op->value *= 5; 981 op->value *= 5;
1036 set_ring_bonus (op, d); 982 set_ring_bonus (op, d);
1037 } 983 }
1038 } 984 }
1039 985
1040 if (GET_ANIM_ID (op)) 986 if (GET_ANIM_ID (op))
1041 SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op))); 987 SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op)));
1042 988
1043 break; 989 break;
1044 990
1045 case BOOK: 991 case BOOK:
1046 /* Is it an empty book?, if yes lets make a special· 992 /* Is it an empty book?, if yes lets make a special·
1047 * msg for it, and tailor its properties based on the· 993 * msg for it, and tailor its properties based on the·
1048 * creator and/or map level we found it on. 994 * creator and/or map level we found it on.
1049 */ 995 */
1050 if (!op->msg && RANDOM () % 10) 996 if (!op->msg && rndm (10))
1051 { 997 {
1052 /* set the book level properly */ 998 /* set the book level properly */
1053 if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE)) 999 if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE))
1054 { 1000 {
1055 if (op->map && op->map->difficulty) 1001 if (op->map && op->map->difficulty)
1056 op->level = RANDOM () % (op->map->difficulty) + RANDOM () % 10 + 1; 1002 op->level = rndm (op->map->difficulty) + rndm (10) + 1;
1057 else 1003 else
1058 op->level = RANDOM () % 20 + 1; 1004 op->level = rndm (20) + 1;
1059 } 1005 }
1060 else 1006 else
1061 op->level = RANDOM () % creator->level; 1007 op->level = rndm (creator->level);
1062 1008
1063 tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1); 1009 tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1);
1064 /* books w/ info are worth more! */ 1010 /* books w/ info are worth more! */
1065 op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1)); 1011 op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1));
1066 /* creator related stuff */ 1012 /* creator related stuff */
… …
1165 */ 1111 */
1166 1112
1167/* 1113/*
1168 * Allocate and return the pointer to an empty artifactlist structure. 1114 * Allocate and return the pointer to an empty artifactlist structure.
1169 */ 1115 */
1170
1171static artifactlist * 1116static artifactlist *
1172get_empty_artifactlist (void) 1117get_empty_artifactlist (void)
1173{ 1118{
1174 artifactlist *tl = (artifactlist *) malloc (sizeof (artifactlist)); 1119 return salloc0 <artifactlist> ();
1175
1176 if (tl == NULL)
1177 fatal (OUT_OF_MEMORY);
1178 tl->next = NULL;
1179 tl->items = NULL;
1180 tl->total_chance = 0;
1181 return tl;
1182} 1120}
1183 1121
1184/* 1122/*
1185 * Allocate and return the pointer to an empty artifact structure. 1123 * Allocate and return the pointer to an empty artifact structure.
1186 */ 1124 */
1187
1188static artifact * 1125static artifact *
1189get_empty_artifact (void) 1126get_empty_artifact (void)
1190{ 1127{
1191 artifact *t = (artifact *) malloc (sizeof (artifact)); 1128 return salloc0 <artifact> ();
1192
1193 if (t == NULL)
1194 fatal (OUT_OF_MEMORY);
1195 t->item = NULL;
1196 t->next = NULL;
1197 t->chance = 0;
1198 t->difficulty = 0;
1199 t->allowed = NULL;
1200 return t;
1201} 1129}
1202 1130
1203/* 1131/*
1204 * Searches the artifact lists and returns one that has the same type 1132 * Searches the artifact lists and returns one that has the same type
1205 * of objects on it. 1133 * of objects on it.
1206 */ 1134 */
1207
1208artifactlist * 1135artifactlist *
1209find_artifactlist (int type) 1136find_artifactlist (int type)
1210{ 1137{
1211 artifactlist *al;
1212
1213 for (al = first_artifactlist; al != NULL; al = al->next) 1138 for (artifactlist *al = first_artifactlist; al; al = al->next)
1214 if (al->type == type) 1139 if (al->type == type)
1215 return al; 1140 return al;
1141
1216 return NULL; 1142 return 0;
1217} 1143}
1218 1144
1219/* 1145/*
1220 * For debugging purposes. Dumps all tables. 1146 * For debugging purposes. Dumps all tables.
1221 */ 1147 */
1222
1223void 1148void
1224dump_artifacts (void) 1149dump_artifacts (void)
1225{ 1150{
1226 artifactlist *al; 1151 artifactlist *al;
1227 artifact *art; 1152 artifact *art;
… …
1234 for (art = al->items; art != NULL; art = art->next) 1159 for (art = al->items; art != NULL; art = art->next)
1235 { 1160 {
1236 fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance); 1161 fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1237 if (art->allowed != NULL) 1162 if (art->allowed != NULL)
1238 { 1163 {
1239 fprintf (logfile, "\tAllowed combinations:"); 1164 fprintf (logfile, "\tallowed combinations:");
1240 for (next = art->allowed; next != NULL; next = next->next) 1165 for (next = art->allowed; next != NULL; next = next->next)
1241 fprintf (logfile, "%s,", &next->name); 1166 fprintf (logfile, "%s,", &next->name);
1242 fprintf (logfile, "\n"); 1167 fprintf (logfile, "\n");
1243 } 1168 }
1244 } 1169 }
… …
1255 treasurelist *tl; 1180 treasurelist *tl;
1256 int i; 1181 int i;
1257 1182
1258 if (depth > 100) 1183 if (depth > 100)
1259 return; 1184 return;
1260 while (t != NULL) 1185
1186 while (t)
1261 { 1187 {
1262 if (t->name != NULL) 1188 if (t->name)
1263 { 1189 {
1264 for (i = 0; i < depth; i++) 1190 for (i = 0; i < depth; i++)
1265 fprintf (logfile, " "); 1191 fprintf (logfile, " ");
1192
1266 fprintf (logfile, "{ (list: %s)\n", &t->name); 1193 fprintf (logfile, "{ (list: %s)\n", &t->name);
1194
1267 tl = find_treasurelist (t->name); 1195 tl = treasurelist::find (t->name);
1196 if (tl)
1268 dump_monster_treasure_rec (name, tl->items, depth + 2); 1197 dump_monster_treasure_rec (name, tl->items, depth + 2);
1198
1269 for (i = 0; i < depth; i++) 1199 for (i = 0; i < depth; i++)
1270 fprintf (logfile, " "); 1200 fprintf (logfile, " ");
1201
1271 fprintf (logfile, "} (end of list: %s)\n", &t->name); 1202 fprintf (logfile, "} (end of list: %s)\n", &t->name);
1272 } 1203 }
1273 else 1204 else
1274 { 1205 {
1275 for (i = 0; i < depth; i++) 1206 for (i = 0; i < depth; i++)
1276 fprintf (logfile, " "); 1207 fprintf (logfile, " ");
1208
1277 if (t->item->clone.type == FLESH) 1209 if (t->item && t->item->clone.type == FLESH)
1278 fprintf (logfile, "%s's %s\n", name, &t->item->clone.name); 1210 fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1279 else 1211 else
1280 fprintf (logfile, "%s\n", &t->item->clone.name); 1212 fprintf (logfile, "%s\n", &t->item->clone.name);
1281 } 1213 }
1214
1282 if (t->next_yes != NULL) 1215 if (t->next_yes)
1283 { 1216 {
1284 for (i = 0; i < depth; i++) 1217 for (i = 0; i < depth; i++)
1285 fprintf (logfile, " "); 1218 fprintf (logfile, " ");
1219
1286 fprintf (logfile, " (if yes)\n"); 1220 fprintf (logfile, " (if yes)\n");
1287 dump_monster_treasure_rec (name, t->next_yes, depth + 1); 1221 dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1288 } 1222 }
1223
1289 if (t->next_no != NULL) 1224 if (t->next_no)
1290 { 1225 {
1291 for (i = 0; i < depth; i++) 1226 for (i = 0; i < depth; i++)
1292 fprintf (logfile, " "); 1227 fprintf (logfile, " ");
1228
1293 fprintf (logfile, " (if no)\n"); 1229 fprintf (logfile, " (if no)\n");
1294 dump_monster_treasure_rec (name, t->next_no, depth + 1); 1230 dump_monster_treasure_rec (name, t->next_no, depth + 1);
1295 } 1231 }
1232
1296 t = t->next; 1233 t = t->next;
1297 } 1234 }
1298} 1235}
1299 1236
1300/* 1237/*
1301 * For debugging purposes. Dumps all treasures for a given monster. 1238 * For debugging purposes. Dumps all treasures for a given monster.
1302 * Created originally by Raphael Quinet for debugging the alchemy code. 1239 * Created originally by Raphael Quinet for debugging the alchemy code.
1303 */ 1240 */
1304
1305void 1241void
1306dump_monster_treasure (const char *name) 1242dump_monster_treasure (const char *name)
1307{ 1243{
1308 archetype *at; 1244 archetype *at;
1309 int found; 1245 int found;
1310 1246
1311 found = 0; 1247 found = 0;
1312 fprintf (logfile, "\n"); 1248 fprintf (logfile, "\n");
1249
1313 for (at = first_archetype; at != NULL; at = at->next) 1250 for (at = first_archetype; at != NULL; at = at->next)
1314 if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) 1251 if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1315 { 1252 {
1316 fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name); 1253 fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1317 if (at->clone.randomitems != NULL) 1254 if (at->clone.randomitems != NULL)
1318 dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1); 1255 dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1319 else 1256 else
1320 fprintf (logfile, "(nothing)\n"); 1257 fprintf (logfile, "(nothing)\n");
1258
1321 fprintf (logfile, "\n"); 1259 fprintf (logfile, "\n");
1322 found++; 1260 found++;
1323 } 1261 }
1262
1324 if (found == 0) 1263 if (found == 0)
1325 fprintf (logfile, "No objects have the name %s!\n\n", name); 1264 fprintf (logfile, "No objects have the name %s!\n\n", name);
1326} 1265}
1327 1266
1328/* 1267/*
1329 * Builds up the lists of artifacts from the file in the libdir. 1268 * Builds up the lists of artifacts from the file in the libdir.
1330 */ 1269 */
1331
1332void 1270void
1333init_artifacts (void) 1271init_artifacts (void)
1334{ 1272{
1335 static int has_been_inited = 0; 1273 static int has_been_inited = 0;
1336 char filename[MAX_BUF], buf[HUGE_BUF], *cp, *next; 1274 char filename[MAX_BUF];
1337 artifact *art = NULL; 1275 artifact *art = NULL;
1338 linked_char *tmp;
1339 int value;
1340 artifactlist *al; 1276 artifactlist *al;
1341 1277
1342 if (has_been_inited) 1278 if (has_been_inited)
1343 return; 1279 return;
1344 else 1280 else
1345 has_been_inited = 1; 1281 has_been_inited = 1;
1346 1282
1347 sprintf (filename, "%s/artifacts", settings.datadir); 1283 sprintf (filename, "%s/artifacts", settings.datadir);
1348 object_thawer thawer (filename); 1284 object_thawer f (filename);
1349 1285
1350 if (!thawer) 1286 if (!f)
1351 return; 1287 return;
1352 1288
1353 while (fgets (buf, HUGE_BUF, thawer) != NULL) 1289 f.next ();
1354 {
1355 if (*buf == '#')
1356 continue;
1357 if ((cp = strchr (buf, '\n')) != NULL)
1358 *cp = '\0';
1359 cp = buf;
1360 while (*cp == ' ') /* Skip blanks */
1361 cp++;
1362 if (*cp == '\0')
1363 continue;
1364 1290
1365 if (!strncmp (cp, "Allowed", 7)) 1291 for (;;)
1292 {
1293 switch (f.kw)
1366 { 1294 {
1295 case KW_allowed:
1367 if (art == NULL) 1296 if (!art)
1297 art = get_empty_artifact ();
1298
1368 { 1299 {
1369 art = get_empty_artifact (); 1300 if (!strcmp (f.get_str (), "all"))
1370 nrofartifacts++; 1301 break;
1302
1303 char *next, *cp = f.get_str ();
1304
1305 do
1306 {
1307 if ((next = strchr (cp, ',')))
1308 *next++ = '\0';
1309
1310 linked_char *tmp = new linked_char;
1311
1312 tmp->name = cp;
1313 tmp->next = art->allowed;
1314 art->allowed = tmp;
1315 }
1316 while ((cp = next));
1371 } 1317 }
1372 cp = strchr (cp, ' ') + 1; 1318 break;
1373 if (!strcmp (cp, "all")) 1319
1320 case KW_chance:
1321 f.get (art->chance);
1322 break;
1323
1324 case KW_difficulty:
1325 f.get (art->difficulty);
1326 break;
1327
1328 case KW_object:
1329 {
1330 art->item = object::create ();
1331 f.get (art->item->name);
1332 f.next ();
1333
1334 if (!art->item->parse_kv (f))
1335 LOG (llevError, "Init_Artifacts: Could not load object.\n");
1336
1337 al = find_artifactlist (art->item->type);
1338
1339 if (!al)
1340 {
1341 al = get_empty_artifactlist ();
1342 al->type = art->item->type;
1343 al->next = first_artifactlist;
1344 first_artifactlist = al;
1345 }
1346
1347 art->next = al->items;
1348 al->items = art;
1349 art = 0;
1350 }
1374 continue; 1351 continue;
1375 1352
1376 do 1353 case KW_EOF:
1354 goto done;
1355
1356 default:
1357 if (!f.parse_error ("artifacts file"))
1358 cleanup ("artifacts file required");
1377 { 1359 break;
1378 nrofallowedstr++;
1379 if ((next = strchr (cp, ',')) != NULL)
1380 *(next++) = '\0';
1381 tmp = new linked_char;
1382
1383 tmp->name = cp;
1384 tmp->next = art->allowed;
1385 art->allowed = tmp;
1386 }
1387 while ((cp = next) != NULL);
1388 }
1389 else if (sscanf (cp, "chance %d", &value))
1390 art->chance = (uint16) value;
1391 else if (sscanf (cp, "difficulty %d", &value))
1392 art->difficulty = (uint8) value;
1393 else if (!strncmp (cp, "Object", 6))
1394 { 1360 }
1395 art->item = get_object ();
1396 1361
1397 if (!load_object (thawer, art->item, 0)) 1362 f.next ();
1398 LOG (llevError, "Init_Artifacts: Could not load object.\n");
1399
1400 art->item->name = strchr (cp, ' ') + 1;
1401 al = find_artifactlist (art->item->type);
1402 if (al == NULL)
1403 {
1404 al = get_empty_artifactlist ();
1405 al->type = art->item->type;
1406 al->next = first_artifactlist;
1407 first_artifactlist = al;
1408 }
1409 art->next = al->items;
1410 al->items = art;
1411 art = NULL;
1412 }
1413 else
1414 LOG (llevError, "Unknown input in artifact file: %s\n", buf);
1415 } 1363 }
1416 1364
1365done:
1417 for (al = first_artifactlist; al != NULL; al = al->next) 1366 for (al = first_artifactlist; al; al = al->next)
1418 { 1367 {
1368 al->total_chance = 0;
1369
1419 for (art = al->items; art != NULL; art = art->next) 1370 for (art = al->items; art; art = art->next)
1420 { 1371 {
1421 if (!art->chance) 1372 if (!art->chance)
1422 LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name); 1373 LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1423 else 1374 else
1424 al->total_chance += art->chance; 1375 al->total_chance += art->chance;
… …
1429 } 1380 }
1430 1381
1431 LOG (llevDebug, "done.\n"); 1382 LOG (llevDebug, "done.\n");
1432} 1383}
1433 1384
1434
1435/* 1385/*
1436 * Used in artifact generation. The bonuses of the first object 1386 * Used in artifact generation. The bonuses of the first object
1437 * is modified by the bonuses of the second object. 1387 * is modified by the bonuses of the second object.
1438 */ 1388 */
1439
1440void 1389void
1441add_abilities (object *op, object *change) 1390add_abilities (object *op, object *change)
1442{ 1391{
1443 int i, tmp; 1392 int i, tmp;
1444 1393
1445 if (change->face != blank_face) 1394 if (change->face != blank_face)
1446 { 1395 {
1447#ifdef TREASURE_VERBOSE 1396#ifdef TREASURE_VERBOSE
1448 LOG (llevDebug, "FACE: %d\n", change->face->number); 1397 LOG (llevDebug, "add_abilities change face: %d\n", change->face);
1449#endif 1398#endif
1450 op->face = change->face; 1399 op->face = change->face;
1451 } 1400 }
1452 1401
1453 for (i = 0; i < NUM_STATS; i++) 1402 for (i = 0; i < NUM_STATS; i++)
… …
1489 CLEAR_FLAG (op, FLAG_ANIMATE); 1438 CLEAR_FLAG (op, FLAG_ANIMATE);
1490 /* so artifacts will join */ 1439 /* so artifacts will join */
1491 if (!QUERY_FLAG (op, FLAG_ALIVE)) 1440 if (!QUERY_FLAG (op, FLAG_ALIVE))
1492 op->speed = 0.0; 1441 op->speed = 0.0;
1493 1442
1494 update_ob_speed (op); 1443 op->set_speed (op->speed);
1495 } 1444 }
1496 1445
1497 if (change->nrof) 1446 if (change->nrof)
1498 op->nrof = RANDOM () % ((int) change->nrof) + 1; 1447 op->nrof = rndm (change->nrof) + 1;
1499 1448
1500 op->stats.exp += change->stats.exp; /* Speed modifier */ 1449 op->stats.exp += change->stats.exp; /* Speed modifier */
1501 op->stats.wc += change->stats.wc; 1450 op->stats.wc += change->stats.wc;
1502 op->stats.ac += change->stats.ac; 1451 op->stats.ac += change->stats.ac;
1503 1452
… …
1511 { 1460 {
1512 object *tmp_obj; 1461 object *tmp_obj;
1513 1462
1514 /* Remove any spells this object currently has in it */ 1463 /* Remove any spells this object currently has in it */
1515 while (op->inv) 1464 while (op->inv)
1516 { 1465 op->inv->destroy ();
1517 tmp_obj = op->inv;
1518 remove_ob (tmp_obj);
1519 free_object (tmp_obj);
1520 }
1521 1466
1522 tmp_obj = arch_to_object (change->other_arch); 1467 tmp_obj = arch_to_object (change->other_arch);
1523 insert_ob_in_ob (tmp_obj, op); 1468 insert_ob_in_ob (tmp_obj, op);
1524 } 1469 }
1525 /* No harm setting this for potions/horns */ 1470 /* No harm setting this for potions/horns */
… …
1562 op->gen_sp_armour = (op->gen_sp_armour * (change->gen_sp_armour)) / 100; 1507 op->gen_sp_armour = (op->gen_sp_armour * (change->gen_sp_armour)) / 100;
1563 1508
1564 op->item_power = change->item_power; 1509 op->item_power = change->item_power;
1565 1510
1566 for (i = 0; i < NROFATTACKS; i++) 1511 for (i = 0; i < NROFATTACKS; i++)
1567 {
1568 if (change->resist[i]) 1512 if (change->resist[i])
1569 {
1570 op->resist[i] += change->resist[i]; 1513 op->resist[i] += change->resist[i];
1571 }
1572 }
1573 1514
1574 if (change->stats.dam) 1515 if (change->stats.dam)
1575 { 1516 {
1576 if (change->stats.dam < 0) 1517 if (change->stats.dam < 0)
1577 op->stats.dam = (-change->stats.dam); 1518 op->stats.dam = (-change->stats.dam);
… …
1614 op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100); 1555 op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100);
1615 } 1556 }
1616 1557
1617 op->value *= change->value; 1558 op->value *= change->value;
1618 1559
1619 if (change->material) 1560 if (change->materials)
1620 op->material = change->material; 1561 op->materials = change->materials;
1621 1562
1622 if (change->materialname) 1563 if (change->materialname)
1623 op->materialname = change->materialname; 1564 op->materialname = change->materialname;
1624 1565
1625 if (change->slaying) 1566 if (change->slaying)
… …
1631 if (change->msg) 1572 if (change->msg)
1632 op->msg = change->msg; 1573 op->msg = change->msg;
1633} 1574}
1634 1575
1635static int 1576static int
1636legal_artifact_combination (object *op, artifact * art) 1577legal_artifact_combination (object *op, artifact *art)
1637{ 1578{
1638 int neg, success = 0; 1579 int neg, success = 0;
1639 linked_char *tmp; 1580 linked_char *tmp;
1640 const char *name; 1581 const char *name;
1641 1582
1642 if (art->allowed == (linked_char *) NULL) 1583 if (!art->allowed)
1643 return 1; /* Ie, "all" */ 1584 return 1; /* Ie, "all" */
1585
1644 for (tmp = art->allowed; tmp; tmp = tmp->next) 1586 for (tmp = art->allowed; tmp; tmp = tmp->next)
1645 { 1587 {
1646#ifdef TREASURE_VERBOSE 1588#ifdef TREASURE_VERBOSE
1647 LOG (llevDebug, "legal_art: %s\n", tmp->name); 1589 LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1648#endif 1590#endif
1649 if (*tmp->name == '!') 1591 if (*tmp->name == '!')
1650 name = tmp->name + 1, neg = 1; 1592 name = tmp->name + 1, neg = 1;
1651 else 1593 else
1652 name = tmp->name, neg = 0; 1594 name = tmp->name, neg = 0;
… …
1659 * everything is allowed except what we match 1601 * everything is allowed except what we match
1660 */ 1602 */
1661 else if (neg) 1603 else if (neg)
1662 success = 1; 1604 success = 1;
1663 } 1605 }
1606
1664 return success; 1607 return success;
1665} 1608}
1666 1609
1667/* 1610/*
1668 * Fixes the given object, giving it the abilities and titles 1611 * Fixes the given object, giving it the abilities and titles
… …
1719 return; 1662 return;
1720 } 1663 }
1721 1664
1722 for (i = 0; i < ARTIFACT_TRIES; i++) 1665 for (i = 0; i < ARTIFACT_TRIES; i++)
1723 { 1666 {
1724 int roll = RANDOM () % al->total_chance; 1667 int roll = rndm (al->total_chance);
1725 1668
1726 for (art = al->items; art != NULL; art = art->next) 1669 for (art = al->items; art; art = art->next)
1727 { 1670 {
1728 roll -= art->chance; 1671 roll -= art->chance;
1729 if (roll < 0) 1672 if (roll < 0)
1730 break; 1673 break;
1731 } 1674 }
… …
1747 continue; 1690 continue;
1748 1691
1749 if (!legal_artifact_combination (op, art)) 1692 if (!legal_artifact_combination (op, art))
1750 { 1693 {
1751#ifdef TREASURE_VERBOSE 1694#ifdef TREASURE_VERBOSE
1752 LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name); 1695 LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name);
1753#endif 1696#endif
1754 continue; 1697 continue;
1755 } 1698 }
1699
1756 give_artifact_abilities (op, art->item); 1700 give_artifact_abilities (op, art->item);
1757 return; 1701 return;
1758 } 1702 }
1759} 1703}
1760 1704
… …
1804 SET_FLAG (item, FLAG_NO_STEAL); 1748 SET_FLAG (item, FLAG_NO_STEAL);
1805 } 1749 }
1806} 1750}
1807 1751
1808/* special_potion() - so that old potion code is still done right. */ 1752/* special_potion() - so that old potion code is still done right. */
1809
1810int 1753int
1811special_potion (object *op) 1754special_potion (object *op)
1812{ 1755{
1813
1814 int i;
1815
1816 if (op->attacktype) 1756 if (op->attacktype)
1817 return 1; 1757 return 1;
1818 1758
1819 if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha) 1759 if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha)
1820 return 1; 1760 return 1;
1821 1761
1822 for (i = 0; i < NROFATTACKS; i++) 1762 for (int i = 0; i < NROFATTACKS; i++)
1823 if (op->resist[i]) 1763 if (op->resist[i])
1824 return 1; 1764 return 1;
1825 1765
1826 return 0; 1766 return 0;
1827} 1767}
1828 1768
1829void 1769void
1830free_treasurestruct (treasure *t) 1770free_treasurestruct (treasure *t)
1831{ 1771{
1832 if (t->next)
1833 free_treasurestruct (t->next); 1772 if (t->next) free_treasurestruct (t->next);
1834 if (t->next_yes)
1835 free_treasurestruct (t->next_yes); 1773 if (t->next_yes) free_treasurestruct (t->next_yes);
1836 if (t->next_no)
1837 free_treasurestruct (t->next_no); 1774 if (t->next_no) free_treasurestruct (t->next_no);
1838 1775
1839 delete t; 1776 delete t;
1840} 1777}
1841 1778
1842void 1779void
… …
1847 1784
1848 delete lc; 1785 delete lc;
1849} 1786}
1850 1787
1851void 1788void
1852free_artifact (artifact * at) 1789free_artifact (artifact *at)
1853{ 1790{
1854 if (at->next)
1855 free_artifact (at->next); 1791 if (at->next) free_artifact (at->next);
1856
1857 if (at->allowed)
1858 free_charlinks (at->allowed); 1792 if (at->allowed) free_charlinks (at->allowed);
1859 1793
1860 at->item->free (1); 1794 at->item->destroy (1);
1861 1795
1862 delete at; 1796 sfree (at);
1863} 1797}
1864 1798
1865void 1799void
1866free_artifactlist (artifactlist * al) 1800free_artifactlist (artifactlist *al)
1867{ 1801{
1868 artifactlist *nextal; 1802 artifactlist *nextal;
1869 1803
1870 for (al = first_artifactlist; al != NULL; al = nextal) 1804 for (al = first_artifactlist; al; al = nextal)
1871 { 1805 {
1872 nextal = al->next; 1806 nextal = al->next;
1873 1807
1874 if (al->items) 1808 if (al->items)
1875 free_artifact (al->items); 1809 free_artifact (al->items);
1876 1810
1877 free (al); 1811 sfree (al);
1878 } 1812 }
1879} 1813}
1880 1814
1881void 1815void
1882free_all_treasures (void) 1816free_all_treasures (void)
1883{ 1817{
1884 treasurelist *tl, *next; 1818 treasurelist *tl, *next;
1885 1819
1886
1887 for (tl = first_treasurelist; tl != NULL; tl = next) 1820 for (tl = first_treasurelist; tl; tl = next)
1888 { 1821 {
1822 clear (tl);
1823
1889 next = tl->next; 1824 next = tl->next;
1890 if (tl->items)
1891 free_treasurestruct (tl->items);
1892 delete tl; 1825 delete tl;
1893 } 1826 }
1827
1894 free_artifactlist (first_artifactlist); 1828 free_artifactlist (first_artifactlist);
1895} 1829}

Diff Legend

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