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.27 by root, Wed Dec 20 09:14:21 2006 UTC vs.
Revision 1.61 by root, Mon May 28 21:21:40 2007 UTC

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

Diff Legend

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