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