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.7 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.43 by root, Mon Apr 16 11:09:30 2007 UTC

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

Diff Legend

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