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.9 by elmex, Sun Sep 3 14:33:48 2006 UTC vs.
Revision 1.61 by root, Mon May 28 21:21:40 2007 UTC

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

Diff Legend

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