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