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