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.29 by root, Tue Dec 26 20:04:09 2006 UTC vs.
Revision 1.50 by root, Thu Apr 19 16:23:46 2007 UTC

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

Diff Legend

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