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 | |
|
|
41 | extern char *spell_mapping[]; |
|
|
42 | |
|
|
43 | static treasurelist *first_treasurelist; |
42 | |
44 | |
43 | static void change_treasure (treasure *t, object *op); /* overrule default values */ |
45 | static void change_treasure (treasure *t, object *op); /* overrule default values */ |
44 | extern char *spell_mapping[]; |
46 | |
|
|
47 | typedef std::tr1::unordered_map< |
|
|
48 | const char *, |
|
|
49 | treasurelist *, |
|
|
50 | str_hash, |
|
|
51 | str_equal, |
|
|
52 | slice_allocator< std::pair<const char *const, treasurelist *> >, |
|
|
53 | true |
|
|
54 | > tl_map_t; |
|
|
55 | |
|
|
56 | static tl_map_t tl_map; |
45 | |
57 | |
46 | /* |
58 | /* |
47 | * Initialize global archtype pointers: |
59 | * Initialize global archtype pointers: |
48 | */ |
60 | */ |
49 | |
|
|
50 | void |
61 | void |
51 | init_archetype_pointers () |
62 | init_archetype_pointers () |
52 | { |
63 | { |
53 | int prev_warn = warn_archetypes; |
64 | int prev_warn = warn_archetypes; |
54 | |
65 | |
55 | warn_archetypes = 1; |
66 | warn_archetypes = 1; |
|
|
67 | |
56 | if (ring_arch == NULL) |
68 | if (ring_arch == NULL) |
57 | ring_arch = archetype::find ("ring"); |
69 | ring_arch = archetype::find ("ring"); |
58 | if (amulet_arch == NULL) |
70 | if (amulet_arch == NULL) |
59 | amulet_arch = archetype::find ("amulet"); |
71 | amulet_arch = archetype::find ("amulet"); |
60 | if (staff_arch == NULL) |
72 | if (staff_arch == NULL) |
61 | staff_arch = archetype::find ("staff"); |
73 | staff_arch = archetype::find ("staff"); |
62 | if (crown_arch == NULL) |
74 | if (crown_arch == NULL) |
63 | crown_arch = archetype::find ("crown"); |
75 | crown_arch = archetype::find ("crown"); |
|
|
76 | |
64 | warn_archetypes = prev_warn; |
77 | warn_archetypes = prev_warn; |
65 | } |
78 | } |
66 | |
79 | |
67 | /* |
80 | /* |
68 | * Allocate and return the pointer to an empty treasurelist structure. |
81 | * Searches for the given treasurelist |
69 | */ |
82 | */ |
70 | |
|
|
71 | static treasurelist * |
83 | treasurelist * |
72 | get_empty_treasurelist (void) |
84 | treasurelist::find (const char *name) |
73 | { |
85 | { |
|
|
86 | if (!name) |
|
|
87 | return 0; |
|
|
88 | |
|
|
89 | AUTODECL (i, tl_map.find (name)); |
|
|
90 | |
|
|
91 | if (i == tl_map.end ()) |
|
|
92 | return 0; |
|
|
93 | |
|
|
94 | return i->second; |
|
|
95 | } |
|
|
96 | |
|
|
97 | /* |
|
|
98 | * Searches for the given treasurelist in the globally linked list |
|
|
99 | * of treasurelists which has been built by load_treasures(). |
|
|
100 | */ |
|
|
101 | treasurelist * |
|
|
102 | treasurelist::get (const char *name) |
|
|
103 | { |
|
|
104 | treasurelist *tl = find (name); |
|
|
105 | |
|
|
106 | if (!tl) |
|
|
107 | { |
74 | return new treasurelist; |
108 | tl = new treasurelist; |
75 | } |
|
|
76 | |
109 | |
77 | /* |
110 | tl->name = name; |
78 | * Allocate and return the pointer to an empty treasure structure. |
111 | tl->next = first_treasurelist; |
79 | */ |
112 | first_treasurelist = tl; |
80 | //TODO: make this a constructor |
|
|
81 | static treasure * |
|
|
82 | get_empty_treasure (void) |
|
|
83 | { |
|
|
84 | treasure *t = new treasure; |
|
|
85 | |
113 | |
86 | t->chance = 100; |
114 | tl_map.insert (std::make_pair (tl->name, tl)); |
|
|
115 | } |
87 | |
116 | |
88 | return t; |
117 | return tl; |
|
|
118 | } |
|
|
119 | |
|
|
120 | //TODO: class method |
|
|
121 | void |
|
|
122 | clear (treasurelist *tl) |
|
|
123 | { |
|
|
124 | if (tl->items) |
|
|
125 | { |
|
|
126 | free_treasurestruct (tl->items); |
|
|
127 | tl->items = 0; |
|
|
128 | } |
|
|
129 | |
|
|
130 | tl->total_chance = 0; |
89 | } |
131 | } |
90 | |
132 | |
91 | /* |
133 | /* |
92 | * Reads the lib/treasure file from disk, and parses the contents |
134 | * Reads the lib/treasure file from disk, and parses the contents |
93 | * into an internal treasure structure (very linked lists) |
135 | * into an internal treasure structure (very linked lists) |
94 | */ |
136 | */ |
95 | |
|
|
96 | static treasure * |
137 | static treasure * |
97 | load_treasure (FILE * fp, int *line) |
138 | load_treasure (object_thawer &f) |
98 | { |
139 | { |
99 | char buf[MAX_BUF], *cp, variable[MAX_BUF]; |
|
|
100 | treasure *t = get_empty_treasure (); |
140 | treasure *t = new treasure; |
101 | int value; |
141 | int value; |
102 | |
142 | |
103 | nroftreasures++; |
143 | nroftreasures++; |
104 | while (fgets (buf, MAX_BUF, fp) != NULL) |
|
|
105 | { |
|
|
106 | (*line)++; |
|
|
107 | |
144 | |
108 | if (*buf == '#') |
145 | for (;;) |
109 | continue; |
146 | { |
110 | if ((cp = strchr (buf, '\n')) != NULL) |
147 | coroapi::cede_every (10); |
111 | *cp = '\0'; |
|
|
112 | cp = buf; |
|
|
113 | while (isspace (*cp)) /* Skip blanks */ |
|
|
114 | cp++; |
|
|
115 | |
148 | |
116 | if (sscanf (cp, "arch %s", variable)) |
149 | f.next (); |
117 | { |
150 | |
118 | if ((t->item = archetype::find (variable)) == NULL) |
151 | switch (f.kw) |
119 | LOG (llevError, "Treasure lacks archetype: %s\n", variable); |
|
|
120 | } |
152 | { |
121 | else if (sscanf (cp, "list %s", variable)) |
153 | case KW_arch: |
122 | t->name = variable; |
154 | if (!(t->item = archetype::find (f.get_str ()))) |
123 | else if (sscanf (cp, "change_name %s", variable)) |
155 | LOG (llevError, "%s:%d treasure references unknown archetype '%s', skipping.\n", f.name, f.linenum, f.get_str ()); |
124 | t->change_arch.name = variable; |
156 | break; |
125 | else if (sscanf (cp, "change_title %s", variable)) |
157 | |
126 | t->change_arch.title = variable; |
158 | case KW_list: f.get (t->name); break; |
127 | else if (sscanf (cp, "change_slaying %s", variable)) |
159 | case KW_change_name: f.get (t->change_arch.name); break; |
128 | t->change_arch.slaying = variable; |
160 | case KW_change_title: f.get (t->change_arch.title); break; |
129 | else if (sscanf (cp, "chance %d", &value)) |
161 | case KW_change_slaying: f.get (t->change_arch.slaying); break; |
130 | t->chance = (uint8) value; |
162 | case KW_chance: f.get (t->chance); break; |
131 | else if (sscanf (cp, "nrof %d", &value)) |
163 | case KW_nrof: f.get (t->nrof); break; |
132 | t->nrof = (uint16) value; |
164 | case KW_magic: f.get (t->magic); break; |
133 | else if (sscanf (cp, "magic %d", &value)) |
165 | |
134 | t->magic = (uint8) value; |
166 | case KW_yes: t->next_yes = load_treasure (f); break; |
135 | else if (!strcmp (cp, "yes")) |
167 | case KW_no: t->next_no = load_treasure (f); break; |
136 | t->next_yes = load_treasure (fp, line); |
168 | |
137 | else if (!strcmp (cp, "no")) |
169 | case KW_end: |
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; |
170 | return t; |
|
|
171 | |
|
|
172 | case KW_more: |
|
|
173 | t->next = load_treasure (f); |
|
|
174 | return t; |
|
|
175 | |
|
|
176 | default: |
|
|
177 | if (!f.parse_error ("treasure list")) |
|
|
178 | return t; // error |
|
|
179 | |
|
|
180 | return t; |
145 | } |
181 | } |
146 | else |
|
|
147 | LOG (llevError, "Unknown treasure-command: '%s', last entry %s, line %d\n", cp, &t->name, *line); |
|
|
148 | } |
182 | } |
149 | LOG (llevError, "treasure lacks 'end'.\n"); |
|
|
150 | return t; |
|
|
151 | } |
183 | } |
152 | |
184 | |
153 | #ifdef TREASURE_DEBUG |
185 | #ifdef TREASURE_DEBUG |
154 | |
|
|
155 | /* recursived checks the linked list. Treasurelist is passed only |
186 | /* recursived checks the linked list. Treasurelist is passed only |
156 | * so that the treasure name can be printed out |
187 | * so that the treasure name can be printed out |
157 | */ |
188 | */ |
158 | static void |
189 | static void |
159 | check_treasurelist (const treasure *t, const treasurelist * tl) |
190 | check_treasurelist (const treasure *t, const treasurelist * tl) |
160 | { |
191 | { |
161 | if (t->chance >= 100 && t->next_yes && (t->next || t->next_no)) |
192 | if (t->chance >= 100 && t->next_yes && (t->next || t->next_no)) |
162 | LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name); |
193 | LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name); |
163 | /* find_treasurelist will print out its own error message */ |
194 | |
164 | if (t->name && *t->name) |
|
|
165 | find_treasurelist (t->name); |
|
|
166 | if (t->next) |
195 | if (t->next) |
167 | check_treasurelist (t->next, tl); |
196 | check_treasurelist (t->next, tl); |
|
|
197 | |
168 | if (t->next_yes) |
198 | if (t->next_yes) |
169 | check_treasurelist (t->next_yes, tl); |
199 | check_treasurelist (t->next_yes, tl); |
|
|
200 | |
170 | if (t->next_no) |
201 | if (t->next_no) |
171 | check_treasurelist (t->next_no, tl); |
202 | check_treasurelist (t->next_no, tl); |
172 | } |
203 | } |
173 | #endif |
204 | #endif |
174 | |
205 | |
175 | /* |
206 | /* |
176 | * Opens LIBDIR/treasure and reads all treasure-declarations from it. |
207 | * Opens LIBDIR/treasure and reads all treasure-declarations from it. |
177 | * Each treasure is parsed with the help of load_treasure(). |
208 | * Each treasure is parsed with the help of load_treasure(). |
178 | */ |
209 | */ |
179 | |
210 | bool |
180 | void |
211 | load_treasure_file (const char *filename) |
181 | load_treasures (void) |
|
|
182 | { |
212 | { |
183 | FILE *fp; |
|
|
184 | char filename[MAX_BUF], buf[MAX_BUF], name[MAX_BUF]; |
|
|
185 | treasurelist *previous = NULL; |
|
|
186 | treasure *t; |
213 | treasure *t; |
187 | int comp, line = 0; |
214 | int comp, line = 0; |
188 | |
215 | |
189 | sprintf (filename, "%s/%s", settings.datadir, settings.treasures); |
216 | object_thawer f (filename); |
190 | if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL) |
217 | |
|
|
218 | if (!f) |
191 | { |
219 | { |
192 | LOG (llevError, "Can't open treasure file.\n"); |
220 | LOG (llevError, "Can't open treasure file.\n"); |
193 | return; |
221 | return false; |
194 | } |
|
|
195 | while (fgets (buf, MAX_BUF, fp) != NULL) |
|
|
196 | { |
222 | } |
197 | line++; |
|
|
198 | if (*buf == '#') |
|
|
199 | continue; |
|
|
200 | |
223 | |
201 | if (sscanf (buf, "treasureone %s\n", name) || sscanf (buf, "treasure %s\n", name)) |
224 | f.next (); |
202 | { |
|
|
203 | treasurelist *tl = get_empty_treasurelist (); |
|
|
204 | |
225 | |
205 | tl->name = name; |
226 | for (;;) |
206 | if (previous == NULL) |
227 | { |
207 | first_treasurelist = tl; |
228 | switch (f.kw) |
208 | else |
229 | { |
209 | previous->next = tl; |
230 | case KW_treasure: |
210 | previous = tl; |
231 | case KW_treasureone: |
211 | tl->items = load_treasure (fp, &line); |
|
|
212 | |
|
|
213 | /* This is a one of the many items on the list should be generated. |
|
|
214 | * Add up the chance total, and check to make sure the yes & no |
|
|
215 | * fields of the treasures are not being used. |
|
|
216 | */ |
|
|
217 | if (!strncmp (buf, "treasureone", 11)) |
|
|
218 | { |
232 | { |
219 | for (t = tl->items; t != NULL; t = t->next) |
233 | bool one = f.kw == KW_treasureone; |
|
|
234 | treasurelist *tl = treasurelist::get (f.get_str ()); |
|
|
235 | |
|
|
236 | clear (tl); |
|
|
237 | tl->items = load_treasure (f); |
|
|
238 | |
|
|
239 | if (!tl->items) |
|
|
240 | return false; |
|
|
241 | |
|
|
242 | /* This is a one of the many items on the list should be generated. |
|
|
243 | * Add up the chance total, and check to make sure the yes & no |
|
|
244 | * fields of the treasures are not being used. |
|
|
245 | */ |
|
|
246 | if (one) |
220 | { |
247 | { |
|
|
248 | for (t = tl->items; t; t = t->next) |
|
|
249 | { |
221 | #ifdef TREASURE_DEBUG |
250 | #ifdef TREASURE_DEBUG |
222 | if (t->next_yes || t->next_no) |
251 | if (t->next_yes || t->next_no) |
223 | { |
252 | { |
224 | LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); |
253 | LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); |
225 | LOG (llevError, " the next_yes or next_no field is set\n"); |
254 | LOG (llevError, " the next_yes or next_no field is set\n"); |
|
|
255 | } |
|
|
256 | #endif |
|
|
257 | tl->total_chance += t->chance; |
226 | } |
258 | } |
227 | #endif |
|
|
228 | tl->total_chance += t->chance; |
|
|
229 | } |
259 | } |
230 | } |
260 | } |
231 | } |
261 | break; |
232 | else |
|
|
233 | LOG (llevError, "Treasure-list %s didn't understand: %s, line %d\n", filename, buf, line); |
|
|
234 | } |
|
|
235 | close_and_delete (fp, comp); |
|
|
236 | |
262 | |
|
|
263 | case KW_EOF: |
237 | #ifdef TREASURE_DEBUG |
264 | #ifdef TREASURE_DEBUG |
238 | /* Perform some checks on how valid the treasure data actually is. |
265 | /* Perform some checks on how valid the treasure data actually is. |
239 | * verify that list transitions work (ie, the list that it is supposed |
266 | * verify that list transitions work (ie, the list that it is supposed |
240 | * to transition to exists). Also, verify that at least the name |
267 | * to transition to exists). Also, verify that at least the name |
241 | * or archetype is set for each treasure element. |
268 | * or archetype is set for each treasure element. |
242 | */ |
269 | */ |
243 | for (previous = first_treasurelist; previous != NULL; previous = previous->next) |
270 | for (treasurelist *tl = first_treasurelist; tl; tl = tl->next) |
244 | check_treasurelist (previous->items, previous); |
271 | check_treasurelist (tl->items, tl); |
245 | #endif |
272 | #endif |
246 | } |
|
|
247 | |
|
|
248 | /* |
|
|
249 | * Searches for the given treasurelist in the globally linked list |
|
|
250 | * of treasurelists which has been built by load_treasures(). |
|
|
251 | */ |
|
|
252 | |
|
|
253 | treasurelist * |
|
|
254 | find_treasurelist (const char *name) |
|
|
255 | { |
|
|
256 | shstr_cmp name_ (name); |
|
|
257 | |
|
|
258 | if (!name_) |
|
|
259 | return 0; |
|
|
260 | |
|
|
261 | for (treasurelist *tl = first_treasurelist; tl != 0; tl = tl->next) |
|
|
262 | if (name_ == tl->name) |
|
|
263 | return tl; |
273 | return true; |
264 | |
274 | |
265 | if (first_treasurelist) |
275 | default: |
266 | LOG (llevError, "Couldn't find treasurelist %s\n", name); |
276 | if (!f.parse_error ("treasure lists")) |
|
|
277 | return false; |
267 | |
278 | |
268 | return 0; |
279 | break; |
269 | } |
280 | } |
270 | |
281 | |
|
|
282 | f.next (); |
|
|
283 | } |
|
|
284 | } |
271 | |
285 | |
272 | /* |
286 | /* |
273 | * Generates the objects specified by the given treasure. |
287 | * Generates the objects specified by the given treasure. |
274 | * It goes recursively through the rest of the linked list. |
288 | * It goes recursively through the rest of the linked list. |
275 | * If there is a certain percental chance for a treasure to be generated, |
289 | * If there is a certain percental chance for a treasure to be generated, |
… | |
… | |
325 | |
339 | |
326 | if (t->change_arch.slaying) |
340 | if (t->change_arch.slaying) |
327 | op->slaying = t->change_arch.slaying; |
341 | op->slaying = t->change_arch.slaying; |
328 | } |
342 | } |
329 | |
343 | |
330 | void |
344 | static void |
331 | create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries) |
345 | create_all_treasures (treasure *t, object *op, int flag, int difficulty, int tries) |
332 | { |
346 | { |
333 | object *tmp; |
|
|
334 | |
|
|
335 | if ((int) t->chance >= 100 || (RANDOM () % 100 + 1) < (int) t->chance) |
347 | if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance) |
336 | { |
348 | { |
337 | if (t->name) |
349 | if (t->name) |
338 | { |
350 | { |
339 | if (difficulty >= t->magic) |
351 | if (difficulty >= t->magic) |
340 | { |
|
|
341 | treasurelist *tl = find_treasurelist (t->name); |
|
|
342 | if (tl) |
|
|
343 | create_treasure (tl, op, flag, difficulty, tries); |
352 | create_treasure (treasurelist::find (t->name), op, flag, difficulty, tries); |
344 | } |
|
|
345 | } |
353 | } |
346 | else |
354 | else |
347 | { |
355 | { |
348 | if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) |
356 | if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) |
349 | { |
357 | { |
350 | tmp = arch_to_object (t->item); |
358 | object *tmp = arch_to_object (t->item); |
|
|
359 | |
351 | if (t->nrof && tmp->nrof <= 1) |
360 | if (t->nrof && tmp->nrof <= 1) |
352 | tmp->nrof = RANDOM () % ((int) t->nrof) + 1; |
361 | tmp->nrof = rndm (t->nrof) + 1; |
|
|
362 | |
353 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
363 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
354 | change_treasure (t, tmp); |
364 | change_treasure (t, tmp); |
355 | put_treasure (tmp, op, flag); |
365 | put_treasure (tmp, op, flag); |
356 | } |
366 | } |
357 | } |
367 | } |
358 | |
368 | |
359 | if (t->next_yes != NULL) |
369 | if (t->next_yes) |
360 | create_all_treasures (t->next_yes, op, flag, difficulty, tries); |
370 | create_all_treasures (t->next_yes, op, flag, difficulty, tries); |
361 | } |
371 | } |
362 | else if (t->next_no != NULL) |
372 | else if (t->next_no) |
363 | create_all_treasures (t->next_no, op, flag, difficulty, tries); |
373 | create_all_treasures (t->next_no, op, flag, difficulty, tries); |
364 | |
374 | |
365 | if (t->next != NULL) |
375 | if (t->next) |
366 | create_all_treasures (t->next, op, flag, difficulty, tries); |
376 | create_all_treasures (t->next, op, flag, difficulty, tries); |
367 | } |
377 | } |
368 | |
378 | |
369 | void |
379 | static void |
370 | create_one_treasure (treasurelist * tl, object *op, int flag, int difficulty, int tries) |
380 | create_one_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries) |
371 | { |
381 | { |
372 | int value = RANDOM () % tl->total_chance; |
382 | int value = rndm (tl->total_chance); |
373 | treasure *t; |
383 | treasure *t; |
374 | |
384 | |
375 | if (tries++ > 100) |
385 | if (tries++ > 100) |
376 | { |
386 | { |
377 | LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n"); |
387 | LOG (llevDebug, "create_one_treasure: tries exceeded 100, returning without making treasure\n"); |
378 | return; |
388 | return; |
379 | } |
389 | } |
380 | |
390 | |
381 | for (t = tl->items; t != NULL; t = t->next) |
391 | for (t = tl->items; t; t = t->next) |
382 | { |
392 | { |
383 | value -= t->chance; |
393 | value -= t->chance; |
384 | |
394 | |
385 | if (value < 0) |
395 | if (value < 0) |
386 | break; |
396 | break; |
387 | } |
397 | } |
388 | |
398 | |
389 | if (!t || value >= 0) |
399 | if (!t || value >= 0) |
390 | { |
|
|
391 | LOG (llevError, "create_one_treasure: got null object or not able to find treasure\n"); |
400 | cleanup ("create_one_treasure: got null object or not able to find treasure\n", 1); |
392 | abort (); |
|
|
393 | return; |
|
|
394 | } |
|
|
395 | |
401 | |
396 | if (t->name) |
402 | if (t->name) |
397 | { |
403 | { |
398 | if (difficulty >= t->magic) |
404 | if (difficulty >= t->magic) |
399 | { |
405 | { |
400 | treasurelist *tl = find_treasurelist (t->name); |
406 | treasurelist *tl = treasurelist::find (t->name); |
401 | if (tl) |
407 | if (tl) |
402 | create_treasure (tl, op, flag, difficulty, tries); |
408 | create_treasure (tl, op, flag, difficulty, tries); |
403 | } |
409 | } |
404 | else if (t->nrof) |
410 | else if (t->nrof) |
405 | create_one_treasure (tl, op, flag, difficulty, tries); |
411 | create_one_treasure (tl, op, flag, difficulty, tries); |
406 | |
|
|
407 | return; |
|
|
408 | } |
412 | } |
409 | |
|
|
410 | if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE)) |
413 | else if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE)) |
411 | { |
414 | { |
412 | object *tmp = arch_to_object (t->item); |
415 | if (object *tmp = arch_to_object (t->item)) |
413 | |
416 | { |
414 | if (!tmp) |
|
|
415 | return; |
|
|
416 | |
|
|
417 | if (t->nrof && tmp->nrof <= 1) |
417 | if (t->nrof && tmp->nrof <= 1) |
418 | tmp->nrof = RANDOM () % ((int) t->nrof) + 1; |
418 | tmp->nrof = rndm (t->nrof) + 1; |
419 | |
419 | |
420 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
420 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
421 | change_treasure (t, tmp); |
421 | change_treasure (t, tmp); |
422 | put_treasure (tmp, op, flag); |
422 | put_treasure (tmp, op, flag); |
|
|
423 | } |
423 | } |
424 | } |
424 | } |
425 | } |
425 | |
426 | |
426 | /* This calls the appropriate treasure creation function. tries is passed |
427 | /* This calls the appropriate treasure creation function. tries is passed |
427 | * to determine how many list transitions or attempts to create treasure |
428 | * to determine how many list transitions or attempts to create treasure |
… | |
… | |
431 | * to do that. |
432 | * to do that. |
432 | */ |
433 | */ |
433 | void |
434 | void |
434 | create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries) |
435 | create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries) |
435 | { |
436 | { |
|
|
437 | // empty treasurelists are legal |
|
|
438 | if (!tl->items) |
|
|
439 | return; |
436 | |
440 | |
437 | if (tries++ > 100) |
441 | if (tries++ > 100) |
438 | { |
442 | { |
439 | LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); |
443 | LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); |
440 | return; |
444 | return; |
441 | } |
445 | } |
|
|
446 | |
442 | if (tl->total_chance) |
447 | if (tl->total_chance) |
443 | create_one_treasure (tl, op, flag, difficulty, tries); |
448 | create_one_treasure (tl, op, flag, difficulty, tries); |
444 | else |
449 | else |
445 | create_all_treasures (tl->items, op, flag, difficulty, tries); |
450 | create_all_treasures (tl->items, op, flag, difficulty, tries); |
446 | } |
451 | } |
… | |
… | |
478 | * magical bonus "wanted". |
483 | * magical bonus "wanted". |
479 | */ |
484 | */ |
480 | |
485 | |
481 | static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = { |
486 | static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = { |
482 | |
487 | |
483 | /*chance of magic difficulty*/ |
488 | // chance of magic difficulty |
484 | |
|
|
485 | /* +0 +1 +2 +3 +4 */ |
489 | // +0 +1 +2 +3 +4 |
486 | {95, 2, 2, 1, 0}, /*1 */ |
490 | {95, 2, 2, 1, 0}, // 1 |
487 | {92, 5, 2, 1, 0}, /*2 */ |
491 | {92, 5, 2, 1, 0}, // 2 |
488 | {85, 10, 4, 1, 0}, /*3 */ |
492 | {85, 10, 4, 1, 0}, // 3 |
489 | {80, 14, 4, 2, 0}, /*4 */ |
493 | {80, 14, 4, 2, 0}, // 4 |
490 | {75, 17, 5, 2, 1}, /*5 */ |
494 | {75, 17, 5, 2, 1}, // 5 |
491 | {70, 18, 8, 3, 1}, /*6 */ |
495 | {70, 18, 8, 3, 1}, // 6 |
492 | {65, 21, 10, 3, 1}, /*7 */ |
496 | {65, 21, 10, 3, 1}, // 7 |
493 | {60, 22, 12, 4, 2}, /*8 */ |
497 | {60, 22, 12, 4, 2}, // 8 |
494 | {55, 25, 14, 4, 2}, /*9 */ |
498 | {55, 25, 14, 4, 2}, // 9 |
495 | {50, 27, 16, 5, 2}, /*10 */ |
499 | {50, 27, 16, 5, 2}, // 10 |
496 | {45, 28, 18, 6, 3}, /*11 */ |
500 | {45, 28, 18, 6, 3}, // 11 |
497 | {42, 28, 20, 7, 3}, /*12 */ |
501 | {42, 28, 20, 7, 3}, // 12 |
498 | {40, 27, 21, 8, 4}, /*13 */ |
502 | {40, 27, 21, 8, 4}, // 13 |
499 | {38, 25, 22, 10, 5}, /*14 */ |
503 | {38, 25, 22, 10, 5}, // 14 |
500 | {36, 23, 23, 12, 6}, /*15 */ |
504 | {36, 23, 23, 12, 6}, // 15 |
501 | {33, 21, 24, 14, 8}, /*16 */ |
505 | {33, 21, 24, 14, 8}, // 16 |
502 | {31, 19, 25, 16, 9}, /*17 */ |
506 | {31, 19, 25, 16, 9}, // 17 |
503 | {27, 15, 30, 18, 10}, /*18 */ |
507 | {27, 15, 30, 18, 10}, // 18 |
504 | {20, 12, 30, 25, 13}, /*19 */ |
508 | {20, 12, 30, 25, 13}, // 19 |
505 | {15, 10, 28, 30, 17}, /*20 */ |
509 | {15, 10, 28, 30, 17}, // 20 |
506 | {13, 9, 27, 28, 23}, /*21 */ |
510 | {13, 9, 27, 28, 23}, // 21 |
507 | {10, 8, 25, 28, 29}, /*22 */ |
511 | {10, 8, 25, 28, 29}, // 22 |
508 | {8, 7, 23, 26, 36}, /*23 */ |
512 | { 8, 7, 23, 26, 36}, // 23 |
509 | {6, 6, 20, 22, 46}, /*24 */ |
513 | { 6, 6, 20, 22, 46}, // 24 |
510 | {4, 5, 17, 18, 56}, /*25 */ |
514 | { 4, 5, 17, 18, 56}, // 25 |
511 | {2, 4, 12, 14, 68}, /*26 */ |
515 | { 2, 4, 12, 14, 68}, // 26 |
512 | {0, 3, 7, 10, 80}, /*27 */ |
516 | { 0, 3, 7, 10, 80}, // 27 |
513 | {0, 0, 3, 7, 90}, /*28 */ |
517 | { 0, 0, 3, 7, 90}, // 28 |
514 | {0, 0, 0, 3, 97}, /*29 */ |
518 | { 0, 0, 0, 3, 97}, // 29 |
515 | {0, 0, 0, 0, 100}, /*30 */ |
519 | { 0, 0, 0, 0, 100}, // 30 |
516 | {0, 0, 0, 0, 100}, /*31 */ |
520 | { 0, 0, 0, 0, 100}, // 31 |
517 | }; |
521 | }; |
518 | |
522 | |
519 | |
523 | |
520 | /* calculate the appropriate level for wands staves and scrolls. |
524 | /* calculate the appropriate level for wands staves and scrolls. |
521 | * This code presumes that op has had its spell object created (in op->inv) |
525 | * This code presumes that op has had its spell object created (in op->inv) |
… | |
… | |
554 | * elmex Thu Aug 10 18:45:44 CEST 2006: |
558 | * elmex Thu Aug 10 18:45:44 CEST 2006: |
555 | * Scaling difficulty by max_level, as difficulty is a level and not some |
559 | * Scaling difficulty by max_level, as difficulty is a level and not some |
556 | * weird integer between 1-31. |
560 | * weird integer between 1-31. |
557 | * |
561 | * |
558 | */ |
562 | */ |
559 | |
|
|
560 | int |
563 | int |
561 | magic_from_difficulty (int difficulty) |
564 | magic_from_difficulty (int difficulty) |
562 | { |
565 | { |
563 | int percent = 0, magic = 0; |
566 | int percent = 0, magic = 0; |
564 | int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS); |
567 | int scaled_diff = (int) (((double) difficulty / settings.max_level) * DIFFLEVELS); |
… | |
… | |
569 | scaled_diff = 0; |
572 | scaled_diff = 0; |
570 | |
573 | |
571 | if (scaled_diff >= DIFFLEVELS) |
574 | if (scaled_diff >= DIFFLEVELS) |
572 | scaled_diff = DIFFLEVELS - 1; |
575 | scaled_diff = DIFFLEVELS - 1; |
573 | |
576 | |
574 | percent = RANDOM () % 100; |
577 | percent = rndm (100); |
575 | |
578 | |
576 | for (magic = 0; magic < (MAXMAGIC + 1); magic++) |
579 | for (magic = 0; magic < (MAXMAGIC + 1); magic++) |
577 | { |
580 | { |
578 | percent -= difftomagic_list[scaled_diff][magic]; |
581 | percent -= difftomagic_list[scaled_diff][magic]; |
579 | |
582 | |
… | |
… | |
585 | { |
588 | { |
586 | LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty); |
589 | LOG (llevError, "Warning, table for difficulty (scaled %d) %d bad.\n", scaled_diff, difficulty); |
587 | magic = 0; |
590 | magic = 0; |
588 | } |
591 | } |
589 | |
592 | |
590 | magic = (RANDOM () % 3) ? magic : -magic; |
593 | magic = (rndm (3)) ? magic : -magic; |
591 | /* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */ |
594 | /* LOG(llevDebug, "Chose magic %d for difficulty (scaled %d) %d\n", magic, scaled_diff, difficulty); */ |
592 | |
595 | |
593 | return magic; |
596 | return magic; |
594 | } |
597 | } |
595 | |
598 | |
… | |
… | |
610 | if (op->arch) |
613 | if (op->arch) |
611 | { |
614 | { |
612 | if (op->type == ARMOUR) |
615 | if (op->type == ARMOUR) |
613 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100; |
616 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100; |
614 | |
617 | |
615 | if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */ |
618 | if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ |
616 | magic = (-magic); |
619 | magic = (-magic); |
617 | op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100; |
620 | op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100; |
618 | } |
621 | } |
619 | else |
622 | else |
620 | { |
623 | { |
621 | if (op->type == ARMOUR) |
624 | if (op->type == ARMOUR) |
622 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; |
625 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; |
623 | if (magic < 0 && !(RANDOM () % 3)) /* You can't just check the weight always */ |
626 | if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ |
624 | magic = (-magic); |
627 | magic = (-magic); |
625 | op->weight = (op->weight * (100 - magic * 10)) / 100; |
628 | op->weight = (op->weight * (100 - magic * 10)) / 100; |
626 | } |
629 | } |
627 | } |
630 | } |
628 | |
631 | |
… | |
… | |
652 | * 1) Since rings can have multiple bonuses, if the same bonus |
655 | * 1) Since rings can have multiple bonuses, if the same bonus |
653 | * is rolled again, increase it - the bonuses now stack with |
656 | * is rolled again, increase it - the bonuses now stack with |
654 | * other bonuses previously rolled and ones the item might natively have. |
657 | * other bonuses previously rolled and ones the item might natively have. |
655 | * 2) Add code to deal with new PR method. |
658 | * 2) Add code to deal with new PR method. |
656 | */ |
659 | */ |
657 | |
|
|
658 | void |
660 | void |
659 | set_ring_bonus (object *op, int bonus) |
661 | set_ring_bonus (object *op, int bonus) |
660 | { |
662 | { |
661 | |
663 | |
662 | int r = RANDOM () % (bonus > 0 ? 25 : 11); |
664 | int r = rndm (bonus > 0 ? 25 : 11); |
663 | |
665 | |
664 | if (op->type == AMULET) |
666 | if (op->type == AMULET) |
665 | { |
667 | { |
666 | if (!(RANDOM () % 21)) |
668 | if (!(rndm (21))) |
667 | r = 20 + RANDOM () % 2; |
669 | r = 20 + rndm (2); |
668 | else |
670 | else |
669 | { |
671 | { |
670 | if (RANDOM () & 2) |
672 | if (rndm (2)) |
671 | r = 10; |
673 | r = 10; |
672 | else |
674 | else |
673 | r = 11 + RANDOM () % 9; |
675 | r = 11 + rndm (9); |
674 | } |
676 | } |
675 | } |
677 | } |
676 | |
678 | |
677 | switch (r) |
679 | switch (r) |
678 | { |
680 | { |
… | |
… | |
715 | case 16: |
717 | case 16: |
716 | case 17: |
718 | case 17: |
717 | case 18: |
719 | case 18: |
718 | case 19: |
720 | case 19: |
719 | { |
721 | { |
720 | int b = 5 + FABS (bonus), val, resist = RANDOM () % num_resist_table; |
722 | int b = 5 + abs (bonus), val, resist = rndm (num_resist_table); |
721 | |
723 | |
722 | /* Roughly generate a bonus between 100 and 35 (depending on the bonus) */ |
724 | /* Roughly generate a bonus between 100 and 35 (depending on the bonus) */ |
723 | val = 10 + RANDOM () % b + RANDOM () % b + RANDOM () % b + RANDOM () % b; |
725 | val = 10 + rndm (b) + rndm (b) + rndm (b) + rndm (b); |
724 | |
726 | |
725 | /* Cursed items need to have higher negative values to equal out with |
727 | /* Cursed items need to have higher negative values to equal out with |
726 | * positive values for how protections work out. Put another |
728 | * positive values for how protections work out. Put another |
727 | * little random element in since that they don't always end up with |
729 | * little random element in since that they don't always end up with |
728 | * even values. |
730 | * even values. |
729 | */ |
731 | */ |
730 | if (bonus < 0) |
732 | if (bonus < 0) |
731 | val = 2 * -val - RANDOM () % b; |
733 | val = 2 * -val - rndm (b); |
732 | if (val > 35) |
734 | if (val > 35) |
733 | val = 35; /* Upper limit */ |
735 | val = 35; /* Upper limit */ |
734 | b = 0; |
736 | b = 0; |
|
|
737 | |
735 | while (op->resist[resist_table[resist]] != 0 && b < 4) |
738 | while (op->resist[resist_table[resist]] != 0 && b < 4) |
736 | { |
|
|
737 | resist = RANDOM () % num_resist_table; |
739 | resist = rndm (num_resist_table); |
738 | } |
740 | |
739 | if (b == 4) |
741 | if (b == 4) |
740 | return; /* Not able to find a free resistance */ |
742 | return; /* Not able to find a free resistance */ |
|
|
743 | |
741 | op->resist[resist_table[resist]] = val; |
744 | op->resist[resist_table[resist]] = val; |
742 | /* We should probably do something more clever here to adjust value |
745 | /* We should probably do something more clever here to adjust value |
743 | * based on how good a resistance we gave. |
746 | * based on how good a resistance we gave. |
744 | */ |
747 | */ |
745 | break; |
748 | break; |
… | |
… | |
773 | case 22: |
776 | case 22: |
774 | op->stats.exp += bonus; /* Speed! */ |
777 | op->stats.exp += bonus; /* Speed! */ |
775 | op->value = (op->value * 2) / 3; |
778 | op->value = (op->value * 2) / 3; |
776 | break; |
779 | break; |
777 | } |
780 | } |
|
|
781 | |
778 | if (bonus > 0) |
782 | if (bonus > 0) |
779 | op->value *= 2 * bonus; |
783 | op->value *= 2 * bonus; |
780 | else |
784 | else |
781 | op->value = -(op->value * 2 * bonus) / 3; |
785 | op->value = -(op->value * 2 * bonus) / 3; |
782 | } |
786 | } |
… | |
… | |
787 | * higher is the chance of returning a low number. |
791 | * higher is the chance of returning a low number. |
788 | * It is only used in fix_generated_treasure() to set bonuses on |
792 | * It is only used in fix_generated_treasure() to set bonuses on |
789 | * rings and amulets. |
793 | * rings and amulets. |
790 | * Another scheme is used to calculate the magic of weapons and armours. |
794 | * Another scheme is used to calculate the magic of weapons and armours. |
791 | */ |
795 | */ |
792 | |
|
|
793 | int |
796 | int |
794 | get_magic (int diff) |
797 | get_magic (int diff) |
795 | { |
798 | { |
796 | int i; |
799 | int i; |
797 | |
800 | |
798 | if (diff < 3) |
801 | if (diff < 3) |
799 | diff = 3; |
802 | diff = 3; |
|
|
803 | |
800 | for (i = 0; i < 4; i++) |
804 | for (i = 0; i < 4; i++) |
801 | if (RANDOM () % diff) |
805 | if (rndm (diff)) |
802 | return i; |
806 | return i; |
|
|
807 | |
803 | return 4; |
808 | return 4; |
804 | } |
809 | } |
805 | |
810 | |
806 | #define DICE2 (get_magic(2)==2?2:1) |
811 | #define DICE2 (get_magic(2)==2?2:1) |
807 | #define DICESPELL (RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3+RANDOM()%3) |
812 | #define DICESPELL (rndm (3) + rndm (3) + rndm (3) + rndm (3) + rndm (3)) |
808 | |
813 | |
809 | /* |
814 | /* |
810 | * fix_generated_item(): This is called after an item is generated, in |
815 | * fix_generated_item(): This is called after an item is generated, in |
811 | * order to set it up right. This produced magical bonuses, puts spells |
816 | * order to set it up right. This produced magical bonuses, puts spells |
812 | * into scrolls/books/wands, makes it unidentified, hides the value, etc. |
817 | * into scrolls/books/wands, makes it unidentified, hides the value, etc. |
… | |
… | |
826 | * value. |
831 | * value. |
827 | * GT_MINIMAL: Does minimal processing on the object - just enough to make it |
832 | * GT_MINIMAL: Does minimal processing on the object - just enough to make it |
828 | * a working object - don't change magic, value, etc, but set it material |
833 | * a working object - don't change magic, value, etc, but set it material |
829 | * type as appropriate, for objects that need spell objects, set those, etc |
834 | * type as appropriate, for objects that need spell objects, set those, etc |
830 | */ |
835 | */ |
831 | |
|
|
832 | void |
836 | void |
833 | fix_generated_item (object *op, object *creator, int difficulty, int max_magic, int flags) |
837 | fix_generated_item (object *op, object *creator, int difficulty, int max_magic, int flags) |
834 | { |
838 | { |
835 | int was_magic = op->magic, num_enchantments = 0, save_item_power = 0; |
839 | int was_magic = op->magic, num_enchantments = 0, save_item_power = 0; |
836 | |
840 | |
… | |
… | |
843 | |
847 | |
844 | if (op->randomitems && op->type != SPELL) |
848 | if (op->randomitems && op->type != SPELL) |
845 | { |
849 | { |
846 | create_treasure (op->randomitems, op, flags, difficulty, 0); |
850 | create_treasure (op->randomitems, op, flags, difficulty, 0); |
847 | if (!op->inv) |
851 | if (!op->inv) |
848 | LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", &op->name); |
852 | LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", op->debug_desc ()); |
849 | |
853 | |
850 | /* So the treasure doesn't get created again */ |
854 | /* So the treasure doesn't get created again */ |
851 | op->randomitems = NULL; |
855 | op->randomitems = 0; |
852 | } |
856 | } |
853 | |
857 | |
854 | if (difficulty < 1) |
858 | if (difficulty < 1) |
855 | difficulty = 1; |
859 | difficulty = 1; |
856 | |
860 | |
… | |
… | |
873 | if (!op->magic && max_magic) |
877 | if (!op->magic && max_magic) |
874 | set_magic (difficulty, op, max_magic, flags); |
878 | set_magic (difficulty, op, max_magic, flags); |
875 | |
879 | |
876 | num_enchantments = calc_item_power (op, 1); |
880 | num_enchantments = calc_item_power (op, 1); |
877 | |
881 | |
878 | if ((!was_magic && !(RANDOM () % CHANCE_FOR_ARTIFACT)) || op->type == HORN || difficulty >= settings.max_level) /* high difficulties always generate an artifact, |
882 | if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT)) |
|
|
883 | || op->type == HORN |
|
|
884 | || difficulty >= settings.max_level) /* high difficulties always generate an artifact, |
879 | * used for shop_floors or treasures */ |
885 | * used for shop_floors or treasures */ |
880 | generate_artifact (op, difficulty); |
886 | generate_artifact (op, difficulty); |
881 | } |
887 | } |
882 | |
888 | |
883 | /* Object was made an artifact. Calculate its item_power rating. |
889 | /* Object was made an artifact. Calculate its item_power rating. |
… | |
… | |
941 | case WEAPON: |
947 | case WEAPON: |
942 | case ARMOUR: |
948 | case ARMOUR: |
943 | case SHIELD: |
949 | case SHIELD: |
944 | case HELMET: |
950 | case HELMET: |
945 | case CLOAK: |
951 | case CLOAK: |
946 | if (QUERY_FLAG (op, FLAG_CURSED) && !(RANDOM () % 4)) |
952 | if (QUERY_FLAG (op, FLAG_CURSED) && !(rndm (4))) |
947 | set_ring_bonus (op, -DICE2); |
953 | set_ring_bonus (op, -DICE2); |
948 | break; |
954 | break; |
949 | |
955 | |
950 | case BRACERS: |
956 | case BRACERS: |
951 | if (!(RANDOM () % (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20))) |
957 | if (!rndm (QUERY_FLAG (op, FLAG_CURSED) ? 5 : 20)) |
952 | { |
958 | { |
953 | set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2); |
959 | set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2); |
954 | if (!QUERY_FLAG (op, FLAG_CURSED)) |
960 | if (!QUERY_FLAG (op, FLAG_CURSED)) |
955 | op->value *= 3; |
961 | op->value *= 3; |
956 | } |
962 | } |
… | |
… | |
982 | */ |
988 | */ |
983 | if (op->inv && op->randomitems) |
989 | if (op->inv && op->randomitems) |
984 | { |
990 | { |
985 | /* value multiplier is same as for scrolls */ |
991 | /* value multiplier is same as for scrolls */ |
986 | op->value = (op->value * op->inv->value); |
992 | op->value = (op->value * op->inv->value); |
987 | op->level = op->inv->level / 2 + RANDOM () % difficulty + RANDOM () % difficulty; |
993 | op->level = op->inv->level / 2 + rndm (difficulty) + rndm (difficulty); |
988 | } |
994 | } |
989 | else |
995 | else |
990 | { |
996 | { |
991 | op->name = "potion"; |
997 | op->name = "potion"; |
992 | op->name_pl = "potions"; |
998 | op->name_pl = "potions"; |
993 | } |
999 | } |
994 | |
1000 | |
995 | if (!(flags & GT_ONLY_GOOD) && RANDOM () % 2) |
1001 | if (!(flags & GT_ONLY_GOOD) && rndm (2)) |
996 | SET_FLAG (op, FLAG_CURSED); |
1002 | SET_FLAG (op, FLAG_CURSED); |
997 | break; |
1003 | break; |
998 | } |
1004 | } |
999 | |
1005 | |
1000 | case AMULET: |
1006 | case AMULET: |
… | |
… | |
1010 | } |
1016 | } |
1011 | |
1017 | |
1012 | if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */ |
1018 | if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */ |
1013 | break; |
1019 | break; |
1014 | |
1020 | |
1015 | if (!(flags & GT_ONLY_GOOD) && !(RANDOM () % 3)) |
1021 | if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) |
1016 | SET_FLAG (op, FLAG_CURSED); |
1022 | SET_FLAG (op, FLAG_CURSED); |
1017 | |
1023 | |
1018 | set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2); |
1024 | set_ring_bonus (op, QUERY_FLAG (op, FLAG_CURSED) ? -DICE2 : DICE2); |
1019 | |
1025 | |
1020 | if (op->type != RING) /* Amulets have only one ability */ |
1026 | if (op->type != RING) /* Amulets have only one ability */ |
1021 | break; |
1027 | break; |
1022 | |
1028 | |
1023 | if (!(RANDOM () % 4)) |
1029 | if (!(rndm (4))) |
1024 | { |
1030 | { |
1025 | int d = (RANDOM () % 2 || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2; |
1031 | int d = (rndm (2) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2; |
1026 | |
1032 | |
1027 | if (d > 0) |
1033 | if (d > 0) |
1028 | op->value *= 3; |
1034 | op->value *= 3; |
1029 | |
1035 | |
1030 | set_ring_bonus (op, d); |
1036 | set_ring_bonus (op, d); |
1031 | |
1037 | |
1032 | if (!(RANDOM () % 4)) |
1038 | if (!(rndm (4))) |
1033 | { |
1039 | { |
1034 | int d = (RANDOM () % 3 || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2; |
1040 | int d = (rndm (3) || QUERY_FLAG (op, FLAG_CURSED)) ? -DICE2 : DICE2; |
1035 | |
1041 | |
1036 | if (d > 0) |
1042 | if (d > 0) |
1037 | op->value *= 5; |
1043 | op->value *= 5; |
1038 | set_ring_bonus (op, d); |
1044 | set_ring_bonus (op, d); |
1039 | } |
1045 | } |
1040 | } |
1046 | } |
1041 | |
1047 | |
1042 | if (GET_ANIM_ID (op)) |
1048 | if (GET_ANIM_ID (op)) |
1043 | SET_ANIMATION (op, RANDOM () % ((int) NUM_ANIMATIONS (op))); |
1049 | SET_ANIMATION (op, rndm (NUM_ANIMATIONS (op))); |
1044 | |
1050 | |
1045 | break; |
1051 | break; |
1046 | |
1052 | |
1047 | case BOOK: |
1053 | case BOOK: |
1048 | /* Is it an empty book?, if yes lets make a specialĀ· |
1054 | /* Is it an empty book?, if yes lets make a specialĀ· |
1049 | * msg for it, and tailor its properties based on theĀ· |
1055 | * msg for it, and tailor its properties based on theĀ· |
1050 | * creator and/or map level we found it on. |
1056 | * creator and/or map level we found it on. |
1051 | */ |
1057 | */ |
1052 | if (!op->msg && RANDOM () % 10) |
1058 | if (!op->msg && rndm (10)) |
1053 | { |
1059 | { |
1054 | /* set the book level properly */ |
1060 | /* set the book level properly */ |
1055 | if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE)) |
1061 | if (creator->level == 0 || QUERY_FLAG (creator, FLAG_ALIVE)) |
1056 | { |
1062 | { |
1057 | if (op->map && op->map->difficulty) |
1063 | if (op->map && op->map->difficulty) |
1058 | op->level = RANDOM () % (op->map->difficulty) + RANDOM () % 10 + 1; |
1064 | op->level = rndm (op->map->difficulty) + rndm (10) + 1; |
1059 | else |
1065 | else |
1060 | op->level = RANDOM () % 20 + 1; |
1066 | op->level = rndm (20) + 1; |
1061 | } |
1067 | } |
1062 | else |
1068 | else |
1063 | op->level = RANDOM () % creator->level; |
1069 | op->level = rndm (creator->level); |
1064 | |
1070 | |
1065 | tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1); |
1071 | tailor_readable_ob (op, (creator && creator->stats.sp) ? creator->stats.sp : -1); |
1066 | /* books w/ info are worth more! */ |
1072 | /* books w/ info are worth more! */ |
1067 | op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1)); |
1073 | op->value *= ((op->level > 10 ? op->level : (op->level + 1) / 2) * ((strlen (op->msg) / 250) + 1)); |
1068 | /* creator related stuff */ |
1074 | /* creator related stuff */ |
… | |
… | |
1167 | */ |
1173 | */ |
1168 | |
1174 | |
1169 | /* |
1175 | /* |
1170 | * Allocate and return the pointer to an empty artifactlist structure. |
1176 | * Allocate and return the pointer to an empty artifactlist structure. |
1171 | */ |
1177 | */ |
1172 | |
|
|
1173 | static artifactlist * |
1178 | static artifactlist * |
1174 | get_empty_artifactlist (void) |
1179 | get_empty_artifactlist (void) |
1175 | { |
1180 | { |
1176 | artifactlist *al = (artifactlist *) malloc (sizeof (artifactlist)); |
1181 | return salloc0 <artifactlist> (); |
1177 | |
|
|
1178 | if (al == NULL) |
|
|
1179 | fatal (OUT_OF_MEMORY); |
|
|
1180 | al->next = NULL; |
|
|
1181 | al->items = NULL; |
|
|
1182 | al->total_chance = 0; |
|
|
1183 | return al; |
|
|
1184 | } |
1182 | } |
1185 | |
1183 | |
1186 | /* |
1184 | /* |
1187 | * Allocate and return the pointer to an empty artifact structure. |
1185 | * Allocate and return the pointer to an empty artifact structure. |
1188 | */ |
1186 | */ |
1189 | |
|
|
1190 | static artifact * |
1187 | static artifact * |
1191 | get_empty_artifact (void) |
1188 | get_empty_artifact (void) |
1192 | { |
1189 | { |
1193 | artifact *a = (artifact *) malloc (sizeof (artifact)); |
1190 | return salloc0 <artifact> (); |
1194 | |
|
|
1195 | if (a == NULL) |
|
|
1196 | fatal (OUT_OF_MEMORY); |
|
|
1197 | a->item = NULL; |
|
|
1198 | a->next = NULL; |
|
|
1199 | a->chance = 0; |
|
|
1200 | a->difficulty = 0; |
|
|
1201 | a->allowed = NULL; |
|
|
1202 | return a; |
|
|
1203 | } |
1191 | } |
1204 | |
1192 | |
1205 | /* |
1193 | /* |
1206 | * Searches the artifact lists and returns one that has the same type |
1194 | * Searches the artifact lists and returns one that has the same type |
1207 | * of objects on it. |
1195 | * of objects on it. |
1208 | */ |
1196 | */ |
1209 | |
|
|
1210 | artifactlist * |
1197 | artifactlist * |
1211 | find_artifactlist (int type) |
1198 | find_artifactlist (int type) |
1212 | { |
1199 | { |
1213 | artifactlist *al; |
|
|
1214 | |
|
|
1215 | for (al = first_artifactlist; al != NULL; al = al->next) |
1200 | for (artifactlist *al = first_artifactlist; al; al = al->next) |
1216 | if (al->type == type) |
1201 | if (al->type == type) |
1217 | return al; |
1202 | return al; |
|
|
1203 | |
1218 | return NULL; |
1204 | return 0; |
1219 | } |
1205 | } |
1220 | |
1206 | |
1221 | /* |
1207 | /* |
1222 | * For debugging purposes. Dumps all tables. |
1208 | * For debugging purposes. Dumps all tables. |
1223 | */ |
1209 | */ |
1224 | |
|
|
1225 | void |
1210 | void |
1226 | dump_artifacts (void) |
1211 | dump_artifacts (void) |
1227 | { |
1212 | { |
1228 | artifactlist *al; |
1213 | artifactlist *al; |
1229 | artifact *art; |
1214 | artifact *art; |
… | |
… | |
1236 | for (art = al->items; art != NULL; art = art->next) |
1221 | for (art = al->items; art != NULL; art = art->next) |
1237 | { |
1222 | { |
1238 | fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance); |
1223 | fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance); |
1239 | if (art->allowed != NULL) |
1224 | if (art->allowed != NULL) |
1240 | { |
1225 | { |
1241 | fprintf (logfile, "\tAllowed combinations:"); |
1226 | fprintf (logfile, "\tallowed combinations:"); |
1242 | for (next = art->allowed; next != NULL; next = next->next) |
1227 | for (next = art->allowed; next != NULL; next = next->next) |
1243 | fprintf (logfile, "%s,", &next->name); |
1228 | fprintf (logfile, "%s,", &next->name); |
1244 | fprintf (logfile, "\n"); |
1229 | fprintf (logfile, "\n"); |
1245 | } |
1230 | } |
1246 | } |
1231 | } |
… | |
… | |
1257 | treasurelist *tl; |
1242 | treasurelist *tl; |
1258 | int i; |
1243 | int i; |
1259 | |
1244 | |
1260 | if (depth > 100) |
1245 | if (depth > 100) |
1261 | return; |
1246 | return; |
|
|
1247 | |
1262 | while (t) |
1248 | while (t) |
1263 | { |
1249 | { |
1264 | if (t->name) |
1250 | if (t->name) |
1265 | { |
1251 | { |
1266 | for (i = 0; i < depth; i++) |
1252 | for (i = 0; i < depth; i++) |
1267 | fprintf (logfile, " "); |
1253 | fprintf (logfile, " "); |
|
|
1254 | |
1268 | fprintf (logfile, "{ (list: %s)\n", &t->name); |
1255 | fprintf (logfile, "{ (list: %s)\n", &t->name); |
|
|
1256 | |
1269 | tl = find_treasurelist (t->name); |
1257 | tl = treasurelist::find (t->name); |
1270 | if (tl) |
1258 | if (tl) |
1271 | dump_monster_treasure_rec (name, tl->items, depth + 2); |
1259 | dump_monster_treasure_rec (name, tl->items, depth + 2); |
|
|
1260 | |
1272 | for (i = 0; i < depth; i++) |
1261 | for (i = 0; i < depth; i++) |
1273 | fprintf (logfile, " "); |
1262 | fprintf (logfile, " "); |
|
|
1263 | |
1274 | fprintf (logfile, "} (end of list: %s)\n", &t->name); |
1264 | fprintf (logfile, "} (end of list: %s)\n", &t->name); |
1275 | } |
1265 | } |
1276 | else |
1266 | else |
1277 | { |
1267 | { |
1278 | for (i = 0; i < depth; i++) |
1268 | for (i = 0; i < depth; i++) |
1279 | fprintf (logfile, " "); |
1269 | fprintf (logfile, " "); |
|
|
1270 | |
1280 | if (t->item && t->item->clone.type == FLESH) |
1271 | if (t->item && t->item->clone.type == FLESH) |
1281 | fprintf (logfile, "%s's %s\n", name, &t->item->clone.name); |
1272 | fprintf (logfile, "%s's %s\n", name, &t->item->clone.name); |
1282 | else |
1273 | else |
1283 | fprintf (logfile, "%s\n", &t->item->clone.name); |
1274 | fprintf (logfile, "%s\n", &t->item->clone.name); |
1284 | } |
1275 | } |
1285 | |
1276 | |
1286 | if (t->next_yes) |
1277 | if (t->next_yes) |
1287 | { |
1278 | { |
1288 | for (i = 0; i < depth; i++) |
1279 | for (i = 0; i < depth; i++) |
1289 | fprintf (logfile, " "); |
1280 | fprintf (logfile, " "); |
|
|
1281 | |
1290 | fprintf (logfile, " (if yes)\n"); |
1282 | fprintf (logfile, " (if yes)\n"); |
1291 | dump_monster_treasure_rec (name, t->next_yes, depth + 1); |
1283 | dump_monster_treasure_rec (name, t->next_yes, depth + 1); |
1292 | } |
1284 | } |
1293 | |
1285 | |
1294 | if (t->next_no) |
1286 | if (t->next_no) |
1295 | { |
1287 | { |
1296 | for (i = 0; i < depth; i++) |
1288 | for (i = 0; i < depth; i++) |
1297 | fprintf (logfile, " "); |
1289 | fprintf (logfile, " "); |
|
|
1290 | |
1298 | fprintf (logfile, " (if no)\n"); |
1291 | fprintf (logfile, " (if no)\n"); |
1299 | dump_monster_treasure_rec (name, t->next_no, depth + 1); |
1292 | dump_monster_treasure_rec (name, t->next_no, depth + 1); |
1300 | } |
1293 | } |
1301 | |
1294 | |
1302 | t = t->next; |
1295 | t = t->next; |
… | |
… | |
1305 | |
1298 | |
1306 | /* |
1299 | /* |
1307 | * For debugging purposes. Dumps all treasures for a given monster. |
1300 | * For debugging purposes. Dumps all treasures for a given monster. |
1308 | * Created originally by Raphael Quinet for debugging the alchemy code. |
1301 | * Created originally by Raphael Quinet for debugging the alchemy code. |
1309 | */ |
1302 | */ |
1310 | |
|
|
1311 | void |
1303 | void |
1312 | dump_monster_treasure (const char *name) |
1304 | dump_monster_treasure (const char *name) |
1313 | { |
1305 | { |
1314 | archetype *at; |
1306 | archetype *at; |
1315 | int found; |
1307 | int found; |
1316 | |
1308 | |
1317 | found = 0; |
1309 | found = 0; |
1318 | fprintf (logfile, "\n"); |
1310 | fprintf (logfile, "\n"); |
|
|
1311 | |
1319 | for (at = first_archetype; at != NULL; at = at->next) |
1312 | for (at = first_archetype; at != NULL; at = at->next) |
1320 | if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) |
1313 | if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) |
1321 | { |
1314 | { |
1322 | fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name); |
1315 | fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name); |
1323 | if (at->clone.randomitems != NULL) |
1316 | if (at->clone.randomitems != NULL) |
1324 | dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1); |
1317 | dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1); |
1325 | else |
1318 | else |
1326 | fprintf (logfile, "(nothing)\n"); |
1319 | fprintf (logfile, "(nothing)\n"); |
|
|
1320 | |
1327 | fprintf (logfile, "\n"); |
1321 | fprintf (logfile, "\n"); |
1328 | found++; |
1322 | found++; |
1329 | } |
1323 | } |
|
|
1324 | |
1330 | if (found == 0) |
1325 | if (found == 0) |
1331 | fprintf (logfile, "No objects have the name %s!\n\n", name); |
1326 | fprintf (logfile, "No objects have the name %s!\n\n", name); |
1332 | } |
1327 | } |
1333 | |
1328 | |
1334 | /* |
1329 | /* |
1335 | * Builds up the lists of artifacts from the file in the libdir. |
1330 | * Builds up the lists of artifacts from the file in the libdir. |
1336 | */ |
1331 | */ |
1337 | |
|
|
1338 | void |
1332 | void |
1339 | init_artifacts (void) |
1333 | init_artifacts (void) |
1340 | { |
1334 | { |
1341 | static int has_been_inited = 0; |
1335 | static int has_been_inited = 0; |
1342 | char filename[MAX_BUF], buf[HUGE_BUF], *cp, *next; |
1336 | char filename[MAX_BUF]; |
1343 | artifact *art = NULL; |
1337 | artifact *art = NULL; |
1344 | linked_char *tmp; |
|
|
1345 | int value; |
|
|
1346 | artifactlist *al; |
1338 | artifactlist *al; |
1347 | |
1339 | |
1348 | if (has_been_inited) |
1340 | if (has_been_inited) |
1349 | return; |
1341 | return; |
1350 | else |
1342 | else |
1351 | has_been_inited = 1; |
1343 | has_been_inited = 1; |
1352 | |
1344 | |
1353 | sprintf (filename, "%s/artifacts", settings.datadir); |
1345 | sprintf (filename, "%s/artifacts", settings.datadir); |
1354 | object_thawer thawer (filename); |
1346 | object_thawer f (filename); |
1355 | |
1347 | |
1356 | if (!thawer) |
1348 | if (!f) |
1357 | return; |
1349 | return; |
1358 | |
1350 | |
1359 | while (fgets (buf, HUGE_BUF, thawer) != NULL) |
1351 | f.next (); |
1360 | { |
|
|
1361 | if (*buf == '#') |
|
|
1362 | continue; |
|
|
1363 | if ((cp = strchr (buf, '\n')) != NULL) |
|
|
1364 | *cp = '\0'; |
|
|
1365 | cp = buf; |
|
|
1366 | while (*cp == ' ') /* Skip blanks */ |
|
|
1367 | cp++; |
|
|
1368 | if (*cp == '\0') |
|
|
1369 | continue; |
|
|
1370 | |
1352 | |
1371 | if (!strncmp (cp, "Allowed", 7)) |
1353 | for (;;) |
|
|
1354 | { |
|
|
1355 | switch (f.kw) |
1372 | { |
1356 | { |
|
|
1357 | case KW_allowed: |
1373 | if (art == NULL) |
1358 | if (!art) |
|
|
1359 | { |
|
|
1360 | art = get_empty_artifact (); |
|
|
1361 | nrofartifacts++; |
|
|
1362 | } |
|
|
1363 | |
1374 | { |
1364 | { |
1375 | art = get_empty_artifact (); |
1365 | if (!strcmp (f.get_str (), "all")) |
1376 | nrofartifacts++; |
1366 | break; |
|
|
1367 | |
|
|
1368 | char *next, *cp = f.get_str (); |
|
|
1369 | |
|
|
1370 | do |
|
|
1371 | { |
|
|
1372 | nrofallowedstr++; |
|
|
1373 | |
|
|
1374 | if ((next = strchr (cp, ','))) |
|
|
1375 | *next++ = '\0'; |
|
|
1376 | |
|
|
1377 | linked_char *tmp = new linked_char; |
|
|
1378 | |
|
|
1379 | tmp->name = cp; |
|
|
1380 | tmp->next = art->allowed; |
|
|
1381 | art->allowed = tmp; |
|
|
1382 | } |
|
|
1383 | while ((cp = next)); |
1377 | } |
1384 | } |
1378 | cp = strchr (cp, ' ') + 1; |
1385 | break; |
1379 | if (!strcmp (cp, "all")) |
1386 | |
|
|
1387 | case KW_chance: |
|
|
1388 | f.get (art->chance); |
|
|
1389 | break; |
|
|
1390 | |
|
|
1391 | case KW_difficulty: |
|
|
1392 | f.get (art->difficulty); |
|
|
1393 | break; |
|
|
1394 | |
|
|
1395 | case KW_object: |
|
|
1396 | { |
|
|
1397 | art->item = object::create (); |
|
|
1398 | |
|
|
1399 | if (!art->item->parse_kv (f)) |
|
|
1400 | LOG (llevError, "Init_Artifacts: Could not load object.\n"); |
|
|
1401 | |
|
|
1402 | al = find_artifactlist (art->item->type); |
|
|
1403 | |
|
|
1404 | if (!al) |
|
|
1405 | { |
|
|
1406 | al = get_empty_artifactlist (); |
|
|
1407 | al->type = art->item->type; |
|
|
1408 | al->next = first_artifactlist; |
|
|
1409 | first_artifactlist = al; |
|
|
1410 | } |
|
|
1411 | |
|
|
1412 | art->next = al->items; |
|
|
1413 | al->items = art; |
|
|
1414 | art = 0; |
|
|
1415 | } |
1380 | continue; |
1416 | continue; |
1381 | |
1417 | |
1382 | do |
1418 | case KW_EOF: |
|
|
1419 | goto done; |
|
|
1420 | |
|
|
1421 | default: |
|
|
1422 | if (!f.parse_error ("artifacts file")) |
|
|
1423 | cleanup ("artifacts file required"); |
1383 | { |
1424 | break; |
1384 | nrofallowedstr++; |
|
|
1385 | if ((next = strchr (cp, ',')) != NULL) |
|
|
1386 | *(next++) = '\0'; |
|
|
1387 | tmp = new linked_char; |
|
|
1388 | |
|
|
1389 | tmp->name = cp; |
|
|
1390 | tmp->next = art->allowed; |
|
|
1391 | art->allowed = tmp; |
|
|
1392 | } |
|
|
1393 | while ((cp = next) != NULL); |
|
|
1394 | } |
|
|
1395 | else if (sscanf (cp, "chance %d", &value)) |
|
|
1396 | art->chance = (uint16) value; |
|
|
1397 | else if (sscanf (cp, "difficulty %d", &value)) |
|
|
1398 | art->difficulty = (uint8) value; |
|
|
1399 | else if (!strncmp (cp, "Object", 6)) |
|
|
1400 | { |
1425 | } |
1401 | art->item = object::create (); |
|
|
1402 | |
1426 | |
1403 | if (!load_object (thawer, art->item, 0)) |
1427 | f.next (); |
1404 | LOG (llevError, "Init_Artifacts: Could not load object.\n"); |
|
|
1405 | |
|
|
1406 | art->item->name = strchr (cp, ' ') + 1; |
|
|
1407 | al = find_artifactlist (art->item->type); |
|
|
1408 | if (al == NULL) |
|
|
1409 | { |
|
|
1410 | al = get_empty_artifactlist (); |
|
|
1411 | al->type = art->item->type; |
|
|
1412 | al->next = first_artifactlist; |
|
|
1413 | first_artifactlist = al; |
|
|
1414 | } |
|
|
1415 | art->next = al->items; |
|
|
1416 | al->items = art; |
|
|
1417 | art = NULL; |
|
|
1418 | } |
|
|
1419 | else |
|
|
1420 | LOG (llevError, "Unknown input in artifact file: %s\n", buf); |
|
|
1421 | } |
1428 | } |
1422 | |
1429 | |
|
|
1430 | done: |
1423 | for (al = first_artifactlist; al != NULL; al = al->next) |
1431 | for (al = first_artifactlist; al; al = al->next) |
1424 | { |
1432 | { |
1425 | for (art = al->items; art != NULL; art = art->next) |
1433 | for (art = al->items; art; art = art->next) |
1426 | { |
1434 | { |
1427 | if (!art->chance) |
1435 | if (!art->chance) |
1428 | LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name); |
1436 | LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name); |
1429 | else |
1437 | else |
1430 | al->total_chance += art->chance; |
1438 | al->total_chance += art->chance; |
… | |
… | |
1449 | int i, tmp; |
1457 | int i, tmp; |
1450 | |
1458 | |
1451 | if (change->face != blank_face) |
1459 | if (change->face != blank_face) |
1452 | { |
1460 | { |
1453 | #ifdef TREASURE_VERBOSE |
1461 | #ifdef TREASURE_VERBOSE |
1454 | LOG (llevDebug, "FACE: %d\n", change->face->number); |
1462 | LOG (llevDebug, "add_abilities change face: %d\n", change->face); |
1455 | #endif |
1463 | #endif |
1456 | op->face = change->face; |
1464 | op->face = change->face; |
1457 | } |
1465 | } |
1458 | |
1466 | |
1459 | for (i = 0; i < NUM_STATS; i++) |
1467 | for (i = 0; i < NUM_STATS; i++) |
… | |
… | |
1499 | |
1507 | |
1500 | op->set_speed (op->speed); |
1508 | op->set_speed (op->speed); |
1501 | } |
1509 | } |
1502 | |
1510 | |
1503 | if (change->nrof) |
1511 | if (change->nrof) |
1504 | op->nrof = RANDOM () % ((int) change->nrof) + 1; |
1512 | op->nrof = rndm (change->nrof) + 1; |
1505 | |
1513 | |
1506 | op->stats.exp += change->stats.exp; /* Speed modifier */ |
1514 | op->stats.exp += change->stats.exp; /* Speed modifier */ |
1507 | op->stats.wc += change->stats.wc; |
1515 | op->stats.wc += change->stats.wc; |
1508 | op->stats.ac += change->stats.ac; |
1516 | op->stats.ac += change->stats.ac; |
1509 | |
1517 | |
… | |
… | |
1612 | op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100); |
1620 | op->gen_sp_armour = (signed char) (((int) op->gen_sp_armour * ((int) change->gen_sp_armour)) / (int) 100); |
1613 | } |
1621 | } |
1614 | |
1622 | |
1615 | op->value *= change->value; |
1623 | op->value *= change->value; |
1616 | |
1624 | |
1617 | if (change->material) |
1625 | if (change->materials) |
1618 | op->material = change->material; |
1626 | op->materials = change->materials; |
1619 | |
1627 | |
1620 | if (change->materialname) |
1628 | if (change->materialname) |
1621 | op->materialname = change->materialname; |
1629 | op->materialname = change->materialname; |
1622 | |
1630 | |
1623 | if (change->slaying) |
1631 | if (change->slaying) |
… | |
… | |
1640 | if (art->allowed == (linked_char *) NULL) |
1648 | if (art->allowed == (linked_char *) NULL) |
1641 | return 1; /* Ie, "all" */ |
1649 | return 1; /* Ie, "all" */ |
1642 | for (tmp = art->allowed; tmp; tmp = tmp->next) |
1650 | for (tmp = art->allowed; tmp; tmp = tmp->next) |
1643 | { |
1651 | { |
1644 | #ifdef TREASURE_VERBOSE |
1652 | #ifdef TREASURE_VERBOSE |
1645 | LOG (llevDebug, "legal_art: %s\n", tmp->name); |
1653 | LOG (llevDebug, "legal_art: %s\n", &tmp->name); |
1646 | #endif |
1654 | #endif |
1647 | if (*tmp->name == '!') |
1655 | if (*tmp->name == '!') |
1648 | name = tmp->name + 1, neg = 1; |
1656 | name = tmp->name + 1, neg = 1; |
1649 | else |
1657 | else |
1650 | name = tmp->name, neg = 0; |
1658 | name = tmp->name, neg = 0; |
… | |
… | |
1717 | return; |
1725 | return; |
1718 | } |
1726 | } |
1719 | |
1727 | |
1720 | for (i = 0; i < ARTIFACT_TRIES; i++) |
1728 | for (i = 0; i < ARTIFACT_TRIES; i++) |
1721 | { |
1729 | { |
1722 | int roll = RANDOM () % al->total_chance; |
1730 | int roll = rndm (al->total_chance); |
1723 | |
1731 | |
1724 | for (art = al->items; art != NULL; art = art->next) |
1732 | for (art = al->items; art; art = art->next) |
1725 | { |
1733 | { |
1726 | roll -= art->chance; |
1734 | roll -= art->chance; |
1727 | if (roll < 0) |
1735 | if (roll < 0) |
1728 | break; |
1736 | break; |
1729 | } |
1737 | } |
… | |
… | |
1745 | continue; |
1753 | continue; |
1746 | |
1754 | |
1747 | if (!legal_artifact_combination (op, art)) |
1755 | if (!legal_artifact_combination (op, art)) |
1748 | { |
1756 | { |
1749 | #ifdef TREASURE_VERBOSE |
1757 | #ifdef TREASURE_VERBOSE |
1750 | LOG (llevDebug, "%s of %s was not a legal combination.\n", op->name, art->item->name); |
1758 | LOG (llevDebug, "%s of %s was not a legal combination.\n", &op->name, &art->item->name); |
1751 | #endif |
1759 | #endif |
1752 | continue; |
1760 | continue; |
1753 | } |
1761 | } |
|
|
1762 | |
1754 | give_artifact_abilities (op, art->item); |
1763 | give_artifact_abilities (op, art->item); |
1755 | return; |
1764 | return; |
1756 | } |
1765 | } |
1757 | } |
1766 | } |
1758 | |
1767 | |
… | |
… | |
1822 | } |
1831 | } |
1823 | |
1832 | |
1824 | void |
1833 | void |
1825 | free_treasurestruct (treasure *t) |
1834 | free_treasurestruct (treasure *t) |
1826 | { |
1835 | { |
1827 | if (t->next) |
|
|
1828 | free_treasurestruct (t->next); |
1836 | if (t->next) free_treasurestruct (t->next); |
1829 | if (t->next_yes) |
|
|
1830 | free_treasurestruct (t->next_yes); |
1837 | if (t->next_yes) free_treasurestruct (t->next_yes); |
1831 | if (t->next_no) |
|
|
1832 | free_treasurestruct (t->next_no); |
1838 | if (t->next_no) free_treasurestruct (t->next_no); |
1833 | |
1839 | |
1834 | delete t; |
1840 | delete t; |
1835 | } |
1841 | } |
1836 | |
1842 | |
1837 | void |
1843 | void |
… | |
… | |
1842 | |
1848 | |
1843 | delete lc; |
1849 | delete lc; |
1844 | } |
1850 | } |
1845 | |
1851 | |
1846 | void |
1852 | void |
1847 | free_artifact (artifact * at) |
1853 | free_artifact (artifact *at) |
1848 | { |
1854 | { |
1849 | if (at->next) |
|
|
1850 | free_artifact (at->next); |
1855 | if (at->next) free_artifact (at->next); |
1851 | |
|
|
1852 | if (at->allowed) |
|
|
1853 | free_charlinks (at->allowed); |
1856 | if (at->allowed) free_charlinks (at->allowed); |
1854 | |
1857 | |
1855 | at->item->destroy (1); |
1858 | at->item->destroy (1); |
1856 | |
1859 | |
1857 | delete at; |
1860 | sfree (at); |
1858 | } |
1861 | } |
1859 | |
1862 | |
1860 | void |
1863 | void |
1861 | free_artifactlist (artifactlist * al) |
1864 | free_artifactlist (artifactlist *al) |
1862 | { |
1865 | { |
1863 | artifactlist *nextal; |
1866 | artifactlist *nextal; |
1864 | |
1867 | |
1865 | for (al = first_artifactlist; al; al = nextal) |
1868 | for (al = first_artifactlist; al; al = nextal) |
1866 | { |
1869 | { |
1867 | nextal = al->next; |
1870 | nextal = al->next; |
1868 | |
1871 | |
1869 | if (al->items) |
1872 | if (al->items) |
1870 | free_artifact (al->items); |
1873 | free_artifact (al->items); |
1871 | |
1874 | |
1872 | free (al); |
1875 | sfree (al); |
1873 | } |
1876 | } |
1874 | } |
1877 | } |
1875 | |
1878 | |
1876 | void |
1879 | void |
1877 | free_all_treasures (void) |
1880 | free_all_treasures (void) |
1878 | { |
1881 | { |
1879 | treasurelist *tl, *next; |
1882 | treasurelist *tl, *next; |
1880 | |
1883 | |
1881 | |
|
|
1882 | for (tl = first_treasurelist; tl != NULL; tl = next) |
1884 | for (tl = first_treasurelist; tl; tl = next) |
1883 | { |
1885 | { |
|
|
1886 | clear (tl); |
|
|
1887 | |
1884 | next = tl->next; |
1888 | next = tl->next; |
1885 | if (tl->items) |
|
|
1886 | free_treasurestruct (tl->items); |
|
|
1887 | delete tl; |
1889 | delete tl; |
1888 | } |
1890 | } |
|
|
1891 | |
1889 | free_artifactlist (first_artifactlist); |
1892 | free_artifactlist (first_artifactlist); |
1890 | } |
1893 | } |