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