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