|
|
1 | /* |
|
|
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
|
|
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * Deliantra is free software: you can redistribute it and/or modify |
|
|
9 | * it under the terms of the GNU General Public License as published by |
|
|
10 | * the Free Software Foundation, either version 3 of the License, or |
|
|
11 | * (at your option) any later version. |
|
|
12 | * |
|
|
13 | * This program is distributed in the hope that it will be useful, |
|
|
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
16 | * GNU General Public License for more details. |
|
|
17 | * |
|
|
18 | * You should have received a copy of the GNU General Public License |
|
|
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
|
|
20 | * |
|
|
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
|
|
22 | */ |
|
|
23 | |
1 | /* Basic stuff for use with the alchemy code. Clearly some of this stuff |
24 | /* Basic stuff for use with the alchemy code. Clearly some of this stuff |
2 | * could go into server/alchemy, but I left it here just in case it proves |
25 | * could go into server/alchemy, but I left it here just in case it proves |
3 | * more generally useful. |
26 | * more generally useful. |
4 | * |
27 | * |
5 | * Nov 1995 - file created by b.t. thomas@astro.psu.edu |
28 | * Nov 1995 - file created by b.t. thomas@astro.psu.edu |
… | |
… | |
10 | * Ingredients are just comma delimited list of archetype (or object) |
33 | * Ingredients are just comma delimited list of archetype (or object) |
11 | * names. |
34 | * names. |
12 | */ |
35 | */ |
13 | |
36 | |
14 | /* Example 'formula' entry in libdir/formulae: |
37 | /* Example 'formula' entry in libdir/formulae: |
15 | * Object transparency |
38 | * object transparency |
16 | * chance 10 |
39 | * chance 10 |
17 | * ingred dust of beholdereye,gem |
40 | * ingred dust of beholdereye,gem |
18 | * arch potion_generic |
41 | * arch potion_generic |
19 | */ |
42 | */ |
20 | |
43 | |
… | |
… | |
32 | { |
55 | { |
33 | recipelist *tl = new recipelist; |
56 | recipelist *tl = new recipelist; |
34 | |
57 | |
35 | tl->total_chance = 0; |
58 | tl->total_chance = 0; |
36 | tl->number = 0; |
59 | tl->number = 0; |
37 | tl->items = NULL; |
60 | tl->items = 0; |
38 | tl->next = NULL; |
61 | tl->next = 0; |
|
|
62 | |
39 | return tl; |
63 | return tl; |
40 | } |
64 | } |
41 | |
65 | |
42 | static recipe * |
66 | static recipe * |
43 | get_empty_formula (void) |
67 | get_empty_formula (void) |
… | |
… | |
60 | t->next = NULL; |
84 | t->next = NULL; |
61 | return t; |
85 | return t; |
62 | } |
86 | } |
63 | |
87 | |
64 | /* get_formulalist() - returns pointer to the formula list */ |
88 | /* get_formulalist() - returns pointer to the formula list */ |
65 | |
|
|
66 | recipelist * |
89 | recipelist * |
67 | get_formulalist (int i) |
90 | get_formulalist (int i) |
68 | { |
91 | { |
69 | recipelist *fl = formulalist; |
92 | recipelist *fl = formulalist; |
70 | int number = i; |
93 | int number = i; |
… | |
… | |
73 | { |
96 | { |
74 | if (!(fl = fl->next)) |
97 | if (!(fl = fl->next)) |
75 | break; |
98 | break; |
76 | number--; |
99 | number--; |
77 | } |
100 | } |
|
|
101 | |
78 | return fl; |
102 | return fl; |
79 | } |
103 | } |
80 | |
104 | |
81 | /* check_recipe() - makes sure we actually have the requested artifact |
105 | /* check_recipe() - makes sure we actually have the requested artifact |
82 | * and archetype. */ |
106 | * and archetype. */ |
83 | |
|
|
84 | static int |
107 | static int |
85 | check_recipe (const recipe *rp) |
108 | check_recipe (const recipe *rp) |
86 | { |
109 | { |
87 | size_t i; |
110 | size_t i; |
88 | int result; |
111 | int result = 1; |
89 | |
112 | |
90 | result = 1; |
|
|
91 | for (i = 0; i < rp->arch_names; i++) |
113 | for (i = 0; i < rp->arch_names; i++) |
92 | { |
114 | { |
93 | if (archetype::find (rp->arch_name[i]) != NULL) |
115 | if (archetype::find (rp->arch_name[i]) != NULL) |
94 | { |
116 | { |
95 | artifact *art = locate_recipe_artifact (rp, i); |
117 | artifact *art = locate_recipe_artifact (rp, i); |
… | |
… | |
108 | } |
130 | } |
109 | |
131 | |
110 | return result; |
132 | return result; |
111 | } |
133 | } |
112 | |
134 | |
113 | |
|
|
114 | /* |
135 | /* |
115 | * init_formulae() - Builds up the lists of formula from the file in |
136 | * init_formulae() - Builds up the lists of formula from the file in |
116 | * the libdir. -b.t. |
137 | * the libdir. -b.t. |
117 | */ |
138 | */ |
118 | |
|
|
119 | void |
139 | void |
120 | init_formulae (void) |
140 | init_formulae (void) |
121 | { |
141 | { |
122 | static int has_been_done = 0; |
142 | static int has_been_done = 0; |
123 | FILE *fp; |
143 | FILE *fp; |
… | |
… | |
151 | *cp = '\0'; |
171 | *cp = '\0'; |
152 | cp = buf; |
172 | cp = buf; |
153 | while (*cp == ' ') /* Skip blanks */ |
173 | while (*cp == ' ') /* Skip blanks */ |
154 | cp++; |
174 | cp++; |
155 | |
175 | |
156 | if (!strncmp (cp, "Object", 6)) |
176 | if (!strncmp (cp, "object", 6)) |
157 | { |
177 | { |
158 | formula = get_empty_formula (); |
178 | formula = get_empty_formula (); |
159 | formula->title = strchr (cp, ' ') + 1; |
179 | formula->title = strchr (cp, ' ') + 1; |
160 | } |
180 | } |
161 | else if (!strncmp (cp, "keycode", 7)) |
181 | else if (!strncmp (cp, "keycode", 7)) |
162 | { |
|
|
163 | formula->keycode = strchr (cp, ' ') + 1; |
182 | formula->keycode = strchr (cp, ' ') + 1; |
164 | } |
|
|
165 | else if (sscanf (cp, "trans %d", &value)) |
183 | else if (sscanf (cp, "trans %d", &value)) |
166 | { |
|
|
167 | formula->transmute = (uint16) value; |
184 | formula->transmute = (uint16) value; |
168 | } |
|
|
169 | else if (sscanf (cp, "yield %d", &value)) |
185 | else if (sscanf (cp, "yield %d", &value)) |
170 | { |
|
|
171 | formula->yield = (uint16) value; |
186 | formula->yield = (uint16) value; |
172 | } |
|
|
173 | else if (sscanf (cp, "chance %d", &value)) |
187 | else if (sscanf (cp, "chance %d", &value)) |
174 | { |
|
|
175 | formula->chance = (uint16) value; |
188 | formula->chance = (uint16) value; |
176 | } |
|
|
177 | else if (sscanf (cp, "exp %d", &value)) |
189 | else if (sscanf (cp, "exp %d", &value)) |
178 | { |
|
|
179 | formula->exp = (uint16) value; |
190 | formula->exp = (uint16) value; |
180 | } |
|
|
181 | else if (sscanf (cp, "diff %d", &value)) |
191 | else if (sscanf (cp, "diff %d", &value)) |
182 | { |
|
|
183 | formula->diff = (uint16) value; |
192 | formula->diff = (uint16) value; |
184 | } |
|
|
185 | else if (!strncmp (cp, "ingred", 6)) |
193 | else if (!strncmp (cp, "ingred", 6)) |
186 | { |
194 | { |
187 | int numb_ingred = 1; |
195 | int numb_ingred = 1; |
188 | |
196 | |
189 | cp = strchr (cp, ' ') + 1; |
197 | cp = strchr (cp, ' ') + 1; |
… | |
… | |
192 | if ((next = strchr (cp, ',')) != NULL) |
200 | if ((next = strchr (cp, ',')) != NULL) |
193 | { |
201 | { |
194 | *(next++) = '\0'; |
202 | *(next++) = '\0'; |
195 | numb_ingred++; |
203 | numb_ingred++; |
196 | } |
204 | } |
|
|
205 | |
197 | tmp = new linked_char; |
206 | tmp = new linked_char; |
198 | |
207 | |
199 | tmp->name = cp; |
208 | tmp->name = cp; |
200 | tmp->next = formula->ingred; |
209 | tmp->next = formula->ingred; |
201 | formula->ingred = tmp; |
210 | formula->ingred = tmp; |
… | |
… | |
204 | * quickly for the right recipe. |
213 | * quickly for the right recipe. |
205 | */ |
214 | */ |
206 | formula->index += strtoint (cp); |
215 | formula->index += strtoint (cp); |
207 | } |
216 | } |
208 | while ((cp = next) != NULL); |
217 | while ((cp = next) != NULL); |
|
|
218 | |
209 | /* now find the correct (# of ingred ordered) formulalist */ |
219 | /* now find the correct (# of ingred ordered) formulalist */ |
210 | fl = formulalist; |
220 | fl = formulalist; |
211 | while (numb_ingred != 1) |
221 | while (numb_ingred != 1) |
212 | { |
222 | { |
213 | if (!fl->next) |
223 | if (!fl->next) |
214 | fl->next = init_recipelist (); |
224 | fl->next = init_recipelist (); |
|
|
225 | |
215 | fl = fl->next; |
226 | fl = fl->next; |
216 | numb_ingred--; |
227 | numb_ingred--; |
217 | } |
228 | } |
|
|
229 | |
218 | fl->total_chance += formula->chance; |
230 | fl->total_chance += formula->chance; |
219 | fl->number++; |
231 | fl->number++; |
220 | formula->next = fl->items; |
232 | formula->next = fl->items; |
221 | fl->items = formula; |
233 | fl->items = formula; |
222 | } |
234 | } |
… | |
… | |
224 | { |
236 | { |
225 | build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names); |
237 | build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names); |
226 | check_recipe (formula); |
238 | check_recipe (formula); |
227 | } |
239 | } |
228 | else if (!strncmp (cp, "skill", 5)) |
240 | else if (!strncmp (cp, "skill", 5)) |
229 | { |
|
|
230 | formula->skill = strchr (cp, ' ') + 1; |
241 | formula->skill = strchr (cp, ' ') + 1; |
231 | } |
|
|
232 | else if (!strncmp (cp, "cauldron", 8)) |
242 | else if (!strncmp (cp, "cauldron", 8)) |
233 | { |
|
|
234 | formula->cauldron = strchr (cp, ' ') + 1; |
243 | formula->cauldron = strchr (cp, ' ') + 1; |
235 | } |
|
|
236 | else |
244 | else |
237 | LOG (llevError, "Unknown input in file %s: %s\n", filename, buf); |
245 | LOG (llevError, "Unknown input in file %s: %s\n", filename, buf); |
238 | } |
246 | } |
|
|
247 | |
239 | LOG (llevDebug, "done.\n"); |
248 | LOG (llevDebug, "done.\n"); |
240 | close_and_delete (fp, comp); |
249 | close_and_delete (fp, comp); |
241 | /* Lastly, lets check for problems in formula we got */ |
250 | /* Lastly, lets check for problems in formula we got */ |
242 | check_formulae (); |
251 | check_formulae (); |
243 | } |
252 | } |
… | |
… | |
256 | recipe *check, *formula; |
265 | recipe *check, *formula; |
257 | int numb = 1; |
266 | int numb = 1; |
258 | |
267 | |
259 | LOG (llevDebug, "Checking formulae lists...\n"); |
268 | LOG (llevDebug, "Checking formulae lists...\n"); |
260 | |
269 | |
261 | for (fl = formulalist; fl != NULL; fl = fl->next) |
270 | for (fl = formulalist; fl; fl = fl->next) |
262 | { |
271 | { |
263 | for (formula = fl->items; formula != NULL; formula = formula->next) |
272 | for (formula = fl->items; formula; formula = formula->next) |
264 | for (check = formula->next; check != NULL; check = check->next) |
273 | for (check = formula->next; check; check = check->next) |
265 | if (check->index == formula->index) |
274 | if (check->index == formula->index) |
266 | { |
275 | { |
267 | LOG (llevError, " ERROR: On %d ingred list: ", numb); |
276 | LOG (llevError, " ERROR: On %d ingred list: ", numb); |
268 | LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n", |
277 | LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n", |
269 | formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index); |
278 | formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index); |
… | |
… | |
273 | |
282 | |
274 | LOG (llevDebug, "done.\n"); |
283 | LOG (llevDebug, "done.\n"); |
275 | |
284 | |
276 | } |
285 | } |
277 | |
286 | |
278 | /* Borrowed (again) from the artifacts code for this */ |
|
|
279 | |
|
|
280 | void |
|
|
281 | dump_alchemy (void) |
|
|
282 | { |
|
|
283 | recipelist *fl = formulalist; |
|
|
284 | recipe *formula = NULL; |
|
|
285 | linked_char *next; |
|
|
286 | int num_ingred = 1; |
|
|
287 | |
|
|
288 | fprintf (logfile, "\n"); |
|
|
289 | while (fl) |
|
|
290 | { |
|
|
291 | fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n", |
|
|
292 | num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance); |
|
|
293 | for (formula = fl->items; formula != NULL; formula = formula->next) |
|
|
294 | { |
|
|
295 | artifact *art = NULL; |
|
|
296 | char buf[MAX_BUF]; |
|
|
297 | size_t i; |
|
|
298 | |
|
|
299 | for (i = 0; i < formula->arch_names; i++) |
|
|
300 | { |
|
|
301 | const char *string = formula->arch_name[i]; |
|
|
302 | |
|
|
303 | if (archetype::find (string) != NULL) |
|
|
304 | { |
|
|
305 | art = locate_recipe_artifact (formula, i); |
|
|
306 | if (!art && strcmp (formula->title, "NONE")) |
|
|
307 | LOG (llevError, "Formula %s has no artifact\n", &formula->title); |
|
|
308 | else |
|
|
309 | { |
|
|
310 | if (strcmp (formula->title, "NONE")) |
|
|
311 | sprintf (buf, "%s of %s", string, &formula->title); |
|
|
312 | else |
|
|
313 | sprintf (buf, "%s", string); |
|
|
314 | fprintf (logfile, "%-30s(%d) bookchance %3d ", buf, formula->index, formula->chance); |
|
|
315 | fprintf (logfile, "skill %s", &formula->skill); |
|
|
316 | fprintf (logfile, "\n"); |
|
|
317 | if (formula->ingred != NULL) |
|
|
318 | { |
|
|
319 | int nval = 0, tval = 0; |
|
|
320 | |
|
|
321 | fprintf (logfile, "\tIngred: "); |
|
|
322 | for (next = formula->ingred; next != NULL; next = next->next) |
|
|
323 | { |
|
|
324 | if (nval != 0) |
|
|
325 | fprintf (logfile, ","); |
|
|
326 | fprintf (logfile, "%s(%d)", &next->name, (nval = strtoint (next->name))); |
|
|
327 | tval += nval; |
|
|
328 | } |
|
|
329 | fprintf (logfile, "\n"); |
|
|
330 | if (tval != formula->index) |
|
|
331 | fprintf (logfile, "WARNING:ingredient list and formula values not equal.\n"); |
|
|
332 | } |
|
|
333 | if (formula->skill != NULL) |
|
|
334 | fprintf (logfile, "\tSkill Required: %s", &formula->skill); |
|
|
335 | if (formula->cauldron != NULL) |
|
|
336 | fprintf (logfile, "\tCauldron: %s\n", &formula->cauldron); |
|
|
337 | fprintf (logfile, "\tDifficulty: %d\t Exp: %d\n", formula->diff, formula->exp); |
|
|
338 | } |
|
|
339 | } |
|
|
340 | else |
|
|
341 | LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title); |
|
|
342 | } |
|
|
343 | } |
|
|
344 | fprintf (logfile, "\n"); |
|
|
345 | fl = fl->next; |
|
|
346 | num_ingred++; |
|
|
347 | } |
|
|
348 | } |
|
|
349 | |
|
|
350 | /* Find a treasure with a matching name. The 'depth' parameter is |
287 | /* Find a treasure with a matching name. The 'depth' parameter is |
351 | * only there to prevent infinite loops in treasure lists (a list |
288 | * only there to prevent infinite loops in treasure lists (a list |
352 | * referencing another list pointing back to the first one). */ |
289 | * referencing another list pointing back to the first one). */ |
353 | archetype * |
290 | archetype * |
354 | find_treasure_by_name (const treasure *t, const char *name, int depth) |
291 | find_treasure_by_name (const treasure *t, const char *name, int depth) |
355 | { |
292 | { |
356 | treasurelist *tl; |
|
|
357 | archetype *at; |
|
|
358 | |
|
|
359 | if (depth > 10) |
293 | if (depth > 10) |
360 | return 0; |
294 | return 0; |
361 | |
295 | |
362 | while (t) |
296 | while (t) |
363 | { |
297 | { |
364 | if (t->name) |
298 | if (t->name) |
365 | { |
299 | { |
366 | tl = find_treasurelist (t->name); |
300 | if (treasurelist *tl = treasurelist::find (t->name)) |
367 | |
|
|
368 | if (tl) |
301 | if (tl->items) |
369 | { |
|
|
370 | at = find_treasure_by_name (tl->items, name, depth + 1); |
302 | if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1)) |
371 | |
|
|
372 | if (at) |
|
|
373 | return at; |
303 | return at; |
374 | } |
|
|
375 | } |
304 | } |
376 | else |
305 | else |
377 | { |
306 | { |
378 | if (t->item && !strcasecmp (t->item->clone.name, name)) |
307 | if (t->item && !strcasecmp (t->item->object::name, name)) |
379 | return t->item; |
308 | return t->item; |
380 | } |
309 | } |
381 | |
310 | |
382 | if (t->next_yes) |
311 | if (t->next_yes) |
383 | { |
|
|
384 | at = find_treasure_by_name (t->next_yes, name, depth); |
312 | if (archetype *at = find_treasure_by_name (t->next_yes, name, depth)) |
385 | if (at) |
|
|
386 | return at; |
313 | return at; |
387 | } |
|
|
388 | |
314 | |
389 | if (t->next_no) |
315 | if (t->next_no) |
390 | { |
|
|
391 | at = find_treasure_by_name (t->next_no, name, depth); |
316 | if (archetype *at = find_treasure_by_name (t->next_no, name, depth)) |
392 | if (at) |
|
|
393 | return at; |
317 | return at; |
394 | } |
318 | |
395 | t = t->next; |
319 | t = t->next; |
396 | } |
320 | } |
|
|
321 | |
397 | return 0; |
322 | return 0; |
398 | } |
323 | } |
399 | |
324 | |
400 | /* If several archetypes have the same name, the value of the first |
325 | /* If several archetypes have the same name, the value of the first |
401 | * one with that name will be returned. This happens for the |
326 | * one with that name will be returned. This happens for the |
… | |
… | |
406 | * body parts that we are looking for (e.g. big_dragon and |
331 | * body parts that we are looking for (e.g. big_dragon and |
407 | * big_dragon_worthless). */ |
332 | * big_dragon_worthless). */ |
408 | long |
333 | long |
409 | find_ingred_cost (const char *name) |
334 | find_ingred_cost (const char *name) |
410 | { |
335 | { |
411 | archetype *at; |
|
|
412 | archetype *at2; |
336 | archetype *at2; |
413 | artifactlist *al; |
337 | artifactlist *al; |
414 | artifact *art; |
338 | artifact *art; |
415 | long mult; |
339 | long mult; |
416 | char *cp; |
340 | char *cp; |
… | |
… | |
429 | name++; |
353 | name++; |
430 | else |
354 | else |
431 | mult = 1; |
355 | mult = 1; |
432 | |
356 | |
433 | /* first, try to match the name of an archetype */ |
357 | /* first, try to match the name of an archetype */ |
434 | for (at = first_archetype; at != NULL; at = at->next) |
358 | for_all_archetypes (at) |
435 | { |
359 | { |
436 | if (at->clone.title != NULL) |
360 | if (at->title != NULL) |
437 | { |
361 | { |
438 | /* inefficient, but who cares? */ |
362 | /* inefficient, but who cares? */ |
439 | sprintf (part1, "%s %s", &at->clone.name, &at->clone.title); |
363 | sprintf (part1, "%s %s", &at->object::name, &at->title); |
440 | if (!strcasecmp (part1, name)) |
364 | if (!strcasecmp (part1, name)) |
441 | return mult * at->clone.value; |
365 | return mult * at->value; |
442 | } |
366 | } |
443 | if (!strcasecmp (at->clone.name, name)) |
367 | if (!strcasecmp (at->object::name, name)) |
444 | return mult * at->clone.value; |
368 | return mult * at->value; |
445 | } |
369 | } |
446 | |
370 | |
447 | /* second, try to match an artifact ("arch of something") */ |
371 | /* second, try to match an artifact ("arch of something") */ |
448 | cp = strstr (name, " of "); |
372 | cp = strstr (name, " of "); |
449 | if (cp != NULL) |
373 | if (cp != NULL) |
450 | { |
374 | { |
451 | strcpy (part1, name); |
375 | strcpy (part1, name); |
452 | part1[cp - name] = '\0'; |
376 | part1[cp - name] = '\0'; |
453 | strcpy (part2, cp + 4); |
377 | strcpy (part2, cp + 4); |
|
|
378 | |
454 | /* find the first archetype matching the first part of the name */ |
379 | /* find the first archetype matching the first part of the name */ |
455 | for (at = first_archetype; at != NULL; at = at->next) |
380 | for_all_archetypes (at) |
456 | if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL) |
381 | if (!strcasecmp (at->object::name, part1) && at->title == NULL) |
457 | break; |
|
|
458 | if (at != NULL) |
|
|
459 | { |
382 | { |
460 | /* find the first artifact derived from that archetype (same type) */ |
383 | /* find the first artifact derived from that archetype (same type) */ |
461 | for (al = first_artifactlist; al != NULL; al = al->next) |
384 | for (al = first_artifactlist; al; al = al->next) |
462 | if (al->type == at->clone.type) |
385 | if (al->type == at->type) |
463 | { |
386 | { |
464 | for (art = al->items; art != NULL; art = art->next) |
387 | for (art = al->items; art; art = art->next) |
465 | if (!strcasecmp (art->item->name, part2)) |
388 | if (!strcasecmp (art->item->name, part2)) |
466 | return mult * at->clone.value * art->item->value; |
389 | return mult * at->value * art->item->value; |
467 | } |
390 | } |
468 | } |
391 | } |
469 | } |
392 | } |
470 | |
393 | |
471 | /* third, try to match a body part ("arch's something") */ |
394 | /* third, try to match a body part ("arch's something") */ |
472 | cp = strstr (name, "'s "); |
395 | cp = strstr (name, "'s "); |
473 | if (cp) |
396 | if (cp) |
474 | { |
397 | { |
475 | strcpy (part1, name); |
398 | strcpy (part1, name); |
476 | part1[cp - name] = '\0'; |
399 | part1[cp - name] = '\0'; |
477 | strcpy (part2, cp + 3); |
400 | strcpy (part2, cp + 3); |
478 | /* examine all archetypes matching the first part of the name */ |
401 | /* examine all archetypes matching the first part of the name */ |
479 | for (at = first_archetype; at != NULL; at = at->next) |
402 | for_all_archetypes (at) |
480 | if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL) |
403 | if (!strcasecmp (at->object::name, part1) && at->title == NULL) |
481 | { |
404 | { |
482 | if (at->clone.randomitems != NULL) |
405 | if (at->randomitems) |
483 | { |
406 | { |
484 | at2 = find_treasure_by_name (at->clone.randomitems->items, part2, 0); |
407 | at2 = find_treasure_by_name (at->randomitems->items, part2, 0); |
485 | if (at2) |
408 | if (at2) |
486 | return mult * at2->clone.value * isqrt (at->clone.level * 2); |
409 | return mult * at2->value * isqrt (at->level * 2); |
487 | } |
410 | } |
488 | } |
411 | } |
489 | } |
412 | } |
490 | |
413 | |
491 | /* failed to find any matching items -- formula should be checked */ |
414 | /* failed to find any matching items -- formula should be checked */ |
492 | return -1; |
415 | return -1; |
493 | } |
416 | } |
494 | |
417 | |
495 | /* code copied from dump_alchemy() and modified by Raphael Quinet */ |
|
|
496 | void |
|
|
497 | dump_alchemy_costs (void) |
|
|
498 | { |
|
|
499 | recipelist *fl = formulalist; |
|
|
500 | recipe *formula = NULL; |
|
|
501 | linked_char *next; |
|
|
502 | int num_ingred = 1; |
|
|
503 | int num_errors = 0; |
|
|
504 | long cost; |
|
|
505 | long tcost; |
|
|
506 | |
|
|
507 | fprintf (logfile, "\n"); |
|
|
508 | while (fl) |
|
|
509 | { |
|
|
510 | fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n", |
|
|
511 | num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance); |
|
|
512 | for (formula = fl->items; formula != NULL; formula = formula->next) |
|
|
513 | { |
|
|
514 | artifact *art = NULL; |
|
|
515 | archetype *at = NULL; |
|
|
516 | char buf[MAX_BUF]; |
|
|
517 | size_t i; |
|
|
518 | |
|
|
519 | for (i = 0; i < formula->arch_names; i++) |
|
|
520 | { |
|
|
521 | const char *string = formula->arch_name[i]; |
|
|
522 | |
|
|
523 | if ((at = archetype::find (string)) != NULL) |
|
|
524 | { |
|
|
525 | art = locate_recipe_artifact (formula, i); |
|
|
526 | if (!art && strcmp (formula->title, "NONE")) |
|
|
527 | LOG (llevError, "Formula %s has no artifact\n", &formula->title); |
|
|
528 | else |
|
|
529 | { |
|
|
530 | if (!strcmp (formula->title, "NONE")) |
|
|
531 | sprintf (buf, "%s", string); |
|
|
532 | else |
|
|
533 | sprintf (buf, "%s of %s", string, &formula->title); |
|
|
534 | fprintf (logfile, "\n%-40s bookchance %3d skill %s\n", buf, formula->chance, &(formula->skill)); |
|
|
535 | if (formula->ingred != NULL) |
|
|
536 | { |
|
|
537 | tcost = 0; |
|
|
538 | for (next = formula->ingred; next != NULL; next = next->next) |
|
|
539 | { |
|
|
540 | cost = find_ingred_cost (next->name); |
|
|
541 | if (cost < 0) |
|
|
542 | num_errors++; |
|
|
543 | fprintf (logfile, "\t%-33s%5ld\n", &next->name, cost); |
|
|
544 | if (cost < 0 || tcost < 0) |
|
|
545 | tcost = -1; |
|
|
546 | else |
|
|
547 | tcost += cost; |
|
|
548 | } |
|
|
549 | if (art != NULL && art->item != NULL) |
|
|
550 | cost = at->clone.value * art->item->value; |
|
|
551 | else |
|
|
552 | cost = at->clone.value; |
|
|
553 | fprintf (logfile, "\t\tBuying result costs: %5ld", cost); |
|
|
554 | if (formula->yield > 1) |
|
|
555 | { |
|
|
556 | fprintf (logfile, " to %ld (max %d items)\n", cost * formula->yield, formula->yield); |
|
|
557 | cost = cost * (formula->yield + 1L) / 2L; |
|
|
558 | } |
|
|
559 | else |
|
|
560 | fprintf (logfile, "\n"); |
|
|
561 | fprintf (logfile, "\t\tIngredients cost: %5ld\n\t\tComment: ", tcost); |
|
|
562 | if (tcost < 0) |
|
|
563 | fprintf (logfile, "Could not find some ingredients. Check the formula!\n"); |
|
|
564 | else if (tcost > cost) |
|
|
565 | fprintf (logfile, "Ingredients are much too expensive. Useless formula.\n"); |
|
|
566 | else if (tcost * 2L > cost) |
|
|
567 | fprintf (logfile, "Ingredients are too expensive.\n"); |
|
|
568 | else if (tcost * 10L < cost) |
|
|
569 | fprintf (logfile, "Ingredients are too cheap.\n"); |
|
|
570 | else |
|
|
571 | fprintf (logfile, "OK.\n"); |
|
|
572 | } |
|
|
573 | } |
|
|
574 | } |
|
|
575 | else |
|
|
576 | LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title); |
|
|
577 | } |
|
|
578 | } |
|
|
579 | fprintf (logfile, "\n"); |
|
|
580 | fl = fl->next; |
|
|
581 | num_ingred++; |
|
|
582 | } |
|
|
583 | if (num_errors > 0) |
|
|
584 | fprintf (logfile, "WARNING: %d objects required by the formulae do not exist in the game.\n", num_errors); |
|
|
585 | } |
|
|
586 | |
|
|
587 | const char * |
418 | const char * |
588 | ingred_name (const char *name) |
419 | ingred_name (const char *name) |
589 | { |
420 | { |
590 | const char *cp = name; |
421 | const char *cp = name; |
591 | |
422 | |
592 | if (atoi (cp)) |
423 | if (atoi (cp)) |
593 | cp = strchr (cp, ' ') + 1; |
424 | cp = strchr (cp, ' ') + 1; |
|
|
425 | |
594 | return cp; |
426 | return cp; |
595 | } |
427 | } |
596 | |
428 | |
597 | /* strtoint() - we use this to convert buf into an integer |
429 | /* strtoint() - we use this to convert buf into an integer |
598 | * equal to the coadded sum of the (lowercase) character |
430 | * equal to the coadded sum of the (lowercase) character |
… | |
… | |
615 | } |
447 | } |
616 | |
448 | |
617 | artifact * |
449 | artifact * |
618 | locate_recipe_artifact (const recipe *rp, size_t idx) |
450 | locate_recipe_artifact (const recipe *rp, size_t idx) |
619 | { |
451 | { |
620 | object *item = get_archetype (rp->arch_name[idx]); |
452 | archetype *at = archetype::find (rp->arch_name [idx]); |
621 | artifactlist *at = NULL; |
|
|
622 | artifact *art = NULL; |
|
|
623 | |
453 | |
624 | if (!item) |
454 | if (at) |
625 | return (artifact *) NULL; |
|
|
626 | |
|
|
627 | if ((at = find_artifactlist (item->type))) |
455 | if (artifactlist *al = find_artifactlist (at->type)) |
628 | for (art = at->items; art; art = art->next) |
456 | for (artifact *art = al->items; art; art = art->next) |
629 | if (!strcmp (art->item->name, rp->title)) |
457 | if (art->item->name == rp->title) |
630 | break; |
458 | return art; |
631 | |
459 | |
632 | item->destroy (); |
|
|
633 | |
|
|
634 | return art; |
460 | return 0; |
635 | } |
461 | } |
636 | |
462 | |
637 | int |
463 | int |
638 | numb_ingred (const char *buf) |
464 | numb_ingred (const char *buf) |
639 | { |
465 | { |