|
|
1 | /* |
|
|
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
|
|
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
|
|
9 | * under the terms of the GNU General Public License as published by the Free |
|
|
10 | * Software Foundation; either version 2 of the License, or (at your option) |
|
|
11 | * any later version. |
|
|
12 | * |
|
|
13 | * This program is distributed in the hope that it will be useful, but |
|
|
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
|
|
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 | * for more details. |
|
|
17 | * |
|
|
18 | * You should have received a copy of the GNU General Public License along |
|
|
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
|
|
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
|
|
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
|
|
23 | */ |
|
|
24 | |
| 1 | /* Basic stuff for use with the alchemy code. Clearly some of this stuff |
25 | /* 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 |
26 | * could go into server/alchemy, but I left it here just in case it proves |
| 3 | * more generally useful. |
27 | * more generally useful. |
| 4 | * |
28 | * |
| 5 | * Nov 1995 - file created by b.t. thomas@astro.psu.edu |
29 | * Nov 1995 - file created by b.t. thomas@astro.psu.edu |
| … | |
… | |
| 10 | * Ingredients are just comma delimited list of archetype (or object) |
34 | * Ingredients are just comma delimited list of archetype (or object) |
| 11 | * names. |
35 | * names. |
| 12 | */ |
36 | */ |
| 13 | |
37 | |
| 14 | /* Example 'formula' entry in libdir/formulae: |
38 | /* Example 'formula' entry in libdir/formulae: |
| 15 | * Object transparency |
39 | * object transparency |
| 16 | * chance 10 |
40 | * chance 10 |
| 17 | * ingred dust of beholdereye,gem |
41 | * ingred dust of beholdereye,gem |
| 18 | * arch potion_generic |
42 | * arch potion_generic |
| 19 | */ |
43 | */ |
| 20 | |
44 | |
| … | |
… | |
| 32 | { |
56 | { |
| 33 | recipelist *tl = new recipelist; |
57 | recipelist *tl = new recipelist; |
| 34 | |
58 | |
| 35 | tl->total_chance = 0; |
59 | tl->total_chance = 0; |
| 36 | tl->number = 0; |
60 | tl->number = 0; |
| 37 | tl->items = NULL; |
61 | tl->items = 0; |
| 38 | tl->next = NULL; |
62 | tl->next = 0; |
|
|
63 | |
| 39 | return tl; |
64 | return tl; |
| 40 | } |
65 | } |
| 41 | |
66 | |
| 42 | static recipe * |
67 | static recipe * |
| 43 | get_empty_formula (void) |
68 | get_empty_formula (void) |
| … | |
… | |
| 60 | t->next = NULL; |
85 | t->next = NULL; |
| 61 | return t; |
86 | return t; |
| 62 | } |
87 | } |
| 63 | |
88 | |
| 64 | /* get_formulalist() - returns pointer to the formula list */ |
89 | /* get_formulalist() - returns pointer to the formula list */ |
| 65 | |
|
|
| 66 | recipelist * |
90 | recipelist * |
| 67 | get_formulalist (int i) |
91 | get_formulalist (int i) |
| 68 | { |
92 | { |
| 69 | recipelist *fl = formulalist; |
93 | recipelist *fl = formulalist; |
| 70 | int number = i; |
94 | int number = i; |
| … | |
… | |
| 73 | { |
97 | { |
| 74 | if (!(fl = fl->next)) |
98 | if (!(fl = fl->next)) |
| 75 | break; |
99 | break; |
| 76 | number--; |
100 | number--; |
| 77 | } |
101 | } |
|
|
102 | |
| 78 | return fl; |
103 | return fl; |
| 79 | } |
104 | } |
| 80 | |
105 | |
| 81 | /* check_recipe() - makes sure we actually have the requested artifact |
106 | /* check_recipe() - makes sure we actually have the requested artifact |
| 82 | * and archetype. */ |
107 | * and archetype. */ |
| 83 | |
|
|
| 84 | static int |
108 | static int |
| 85 | check_recipe (const recipe *rp) |
109 | check_recipe (const recipe *rp) |
| 86 | { |
110 | { |
| 87 | size_t i; |
111 | size_t i; |
| 88 | int result; |
112 | int result = 1; |
| 89 | |
113 | |
| 90 | result = 1; |
|
|
| 91 | for (i = 0; i < rp->arch_names; i++) |
114 | for (i = 0; i < rp->arch_names; i++) |
| 92 | { |
115 | { |
| 93 | if (archetype::find (rp->arch_name[i]) != NULL) |
116 | if (archetype::find (rp->arch_name[i]) != NULL) |
| 94 | { |
117 | { |
| 95 | artifact *art = locate_recipe_artifact (rp, i); |
118 | artifact *art = locate_recipe_artifact (rp, i); |
| … | |
… | |
| 108 | } |
131 | } |
| 109 | |
132 | |
| 110 | return result; |
133 | return result; |
| 111 | } |
134 | } |
| 112 | |
135 | |
| 113 | |
|
|
| 114 | /* |
136 | /* |
| 115 | * init_formulae() - Builds up the lists of formula from the file in |
137 | * init_formulae() - Builds up the lists of formula from the file in |
| 116 | * the libdir. -b.t. |
138 | * the libdir. -b.t. |
| 117 | */ |
139 | */ |
| 118 | |
|
|
| 119 | void |
140 | void |
| 120 | init_formulae (void) |
141 | init_formulae (void) |
| 121 | { |
142 | { |
| 122 | static int has_been_done = 0; |
143 | static int has_been_done = 0; |
| 123 | FILE *fp; |
144 | FILE *fp; |
| … | |
… | |
| 151 | *cp = '\0'; |
172 | *cp = '\0'; |
| 152 | cp = buf; |
173 | cp = buf; |
| 153 | while (*cp == ' ') /* Skip blanks */ |
174 | while (*cp == ' ') /* Skip blanks */ |
| 154 | cp++; |
175 | cp++; |
| 155 | |
176 | |
| 156 | if (!strncmp (cp, "Object", 6)) |
177 | if (!strncmp (cp, "object", 6)) |
| 157 | { |
178 | { |
| 158 | formula = get_empty_formula (); |
179 | formula = get_empty_formula (); |
| 159 | formula->title = strchr (cp, ' ') + 1; |
180 | formula->title = strchr (cp, ' ') + 1; |
| 160 | } |
181 | } |
| 161 | else if (!strncmp (cp, "keycode", 7)) |
182 | else if (!strncmp (cp, "keycode", 7)) |
| 162 | { |
|
|
| 163 | formula->keycode = strchr (cp, ' ') + 1; |
183 | formula->keycode = strchr (cp, ' ') + 1; |
| 164 | } |
|
|
| 165 | else if (sscanf (cp, "trans %d", &value)) |
184 | else if (sscanf (cp, "trans %d", &value)) |
| 166 | { |
|
|
| 167 | formula->transmute = (uint16) value; |
185 | formula->transmute = (uint16) value; |
| 168 | } |
|
|
| 169 | else if (sscanf (cp, "yield %d", &value)) |
186 | else if (sscanf (cp, "yield %d", &value)) |
| 170 | { |
|
|
| 171 | formula->yield = (uint16) value; |
187 | formula->yield = (uint16) value; |
| 172 | } |
|
|
| 173 | else if (sscanf (cp, "chance %d", &value)) |
188 | else if (sscanf (cp, "chance %d", &value)) |
| 174 | { |
|
|
| 175 | formula->chance = (uint16) value; |
189 | formula->chance = (uint16) value; |
| 176 | } |
|
|
| 177 | else if (sscanf (cp, "exp %d", &value)) |
190 | else if (sscanf (cp, "exp %d", &value)) |
| 178 | { |
|
|
| 179 | formula->exp = (uint16) value; |
191 | formula->exp = (uint16) value; |
| 180 | } |
|
|
| 181 | else if (sscanf (cp, "diff %d", &value)) |
192 | else if (sscanf (cp, "diff %d", &value)) |
| 182 | { |
|
|
| 183 | formula->diff = (uint16) value; |
193 | formula->diff = (uint16) value; |
| 184 | } |
|
|
| 185 | else if (!strncmp (cp, "ingred", 6)) |
194 | else if (!strncmp (cp, "ingred", 6)) |
| 186 | { |
195 | { |
| 187 | int numb_ingred = 1; |
196 | int numb_ingred = 1; |
| 188 | |
197 | |
| 189 | cp = strchr (cp, ' ') + 1; |
198 | cp = strchr (cp, ' ') + 1; |
| … | |
… | |
| 192 | if ((next = strchr (cp, ',')) != NULL) |
201 | if ((next = strchr (cp, ',')) != NULL) |
| 193 | { |
202 | { |
| 194 | *(next++) = '\0'; |
203 | *(next++) = '\0'; |
| 195 | numb_ingred++; |
204 | numb_ingred++; |
| 196 | } |
205 | } |
|
|
206 | |
| 197 | tmp = new linked_char; |
207 | tmp = new linked_char; |
| 198 | |
208 | |
| 199 | tmp->name = cp; |
209 | tmp->name = cp; |
| 200 | tmp->next = formula->ingred; |
210 | tmp->next = formula->ingred; |
| 201 | formula->ingred = tmp; |
211 | formula->ingred = tmp; |
| … | |
… | |
| 204 | * quickly for the right recipe. |
214 | * quickly for the right recipe. |
| 205 | */ |
215 | */ |
| 206 | formula->index += strtoint (cp); |
216 | formula->index += strtoint (cp); |
| 207 | } |
217 | } |
| 208 | while ((cp = next) != NULL); |
218 | while ((cp = next) != NULL); |
|
|
219 | |
| 209 | /* now find the correct (# of ingred ordered) formulalist */ |
220 | /* now find the correct (# of ingred ordered) formulalist */ |
| 210 | fl = formulalist; |
221 | fl = formulalist; |
| 211 | while (numb_ingred != 1) |
222 | while (numb_ingred != 1) |
| 212 | { |
223 | { |
| 213 | if (!fl->next) |
224 | if (!fl->next) |
| 214 | fl->next = init_recipelist (); |
225 | fl->next = init_recipelist (); |
|
|
226 | |
| 215 | fl = fl->next; |
227 | fl = fl->next; |
| 216 | numb_ingred--; |
228 | numb_ingred--; |
| 217 | } |
229 | } |
|
|
230 | |
| 218 | fl->total_chance += formula->chance; |
231 | fl->total_chance += formula->chance; |
| 219 | fl->number++; |
232 | fl->number++; |
| 220 | formula->next = fl->items; |
233 | formula->next = fl->items; |
| 221 | fl->items = formula; |
234 | fl->items = formula; |
| 222 | } |
235 | } |
| … | |
… | |
| 224 | { |
237 | { |
| 225 | build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names); |
238 | build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names); |
| 226 | check_recipe (formula); |
239 | check_recipe (formula); |
| 227 | } |
240 | } |
| 228 | else if (!strncmp (cp, "skill", 5)) |
241 | else if (!strncmp (cp, "skill", 5)) |
| 229 | { |
|
|
| 230 | formula->skill = strchr (cp, ' ') + 1; |
242 | formula->skill = strchr (cp, ' ') + 1; |
| 231 | } |
|
|
| 232 | else if (!strncmp (cp, "cauldron", 8)) |
243 | else if (!strncmp (cp, "cauldron", 8)) |
| 233 | { |
|
|
| 234 | formula->cauldron = strchr (cp, ' ') + 1; |
244 | formula->cauldron = strchr (cp, ' ') + 1; |
| 235 | } |
|
|
| 236 | else |
245 | else |
| 237 | LOG (llevError, "Unknown input in file %s: %s\n", filename, buf); |
246 | LOG (llevError, "Unknown input in file %s: %s\n", filename, buf); |
| 238 | } |
247 | } |
|
|
248 | |
| 239 | LOG (llevDebug, "done.\n"); |
249 | LOG (llevDebug, "done.\n"); |
| 240 | close_and_delete (fp, comp); |
250 | close_and_delete (fp, comp); |
| 241 | /* Lastly, lets check for problems in formula we got */ |
251 | /* Lastly, lets check for problems in formula we got */ |
| 242 | check_formulae (); |
252 | check_formulae (); |
| 243 | } |
253 | } |
| … | |
… | |
| 256 | recipe *check, *formula; |
266 | recipe *check, *formula; |
| 257 | int numb = 1; |
267 | int numb = 1; |
| 258 | |
268 | |
| 259 | LOG (llevDebug, "Checking formulae lists...\n"); |
269 | LOG (llevDebug, "Checking formulae lists...\n"); |
| 260 | |
270 | |
| 261 | for (fl = formulalist; fl != NULL; fl = fl->next) |
271 | for (fl = formulalist; fl; fl = fl->next) |
| 262 | { |
272 | { |
| 263 | for (formula = fl->items; formula != NULL; formula = formula->next) |
273 | for (formula = fl->items; formula; formula = formula->next) |
| 264 | for (check = formula->next; check != NULL; check = check->next) |
274 | for (check = formula->next; check; check = check->next) |
| 265 | if (check->index == formula->index) |
275 | if (check->index == formula->index) |
| 266 | { |
276 | { |
| 267 | LOG (llevError, " ERROR: On %d ingred list: ", numb); |
277 | 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", |
278 | 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); |
279 | formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index); |
| … | |
… | |
| 288 | fprintf (logfile, "\n"); |
298 | fprintf (logfile, "\n"); |
| 289 | while (fl) |
299 | while (fl) |
| 290 | { |
300 | { |
| 291 | fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n", |
301 | 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); |
302 | num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance); |
| 293 | for (formula = fl->items; formula != NULL; formula = formula->next) |
303 | for (formula = fl->items; formula; formula = formula->next) |
| 294 | { |
304 | { |
| 295 | artifact *art = NULL; |
305 | artifact *art = NULL; |
| 296 | char buf[MAX_BUF]; |
306 | char buf[MAX_BUF]; |
| 297 | size_t i; |
307 | size_t i; |
| 298 | |
308 | |
| … | |
… | |
| 302 | |
312 | |
| 303 | if (archetype::find (string) != NULL) |
313 | if (archetype::find (string) != NULL) |
| 304 | { |
314 | { |
| 305 | art = locate_recipe_artifact (formula, i); |
315 | art = locate_recipe_artifact (formula, i); |
| 306 | if (!art && strcmp (formula->title, "NONE")) |
316 | if (!art && strcmp (formula->title, "NONE")) |
| 307 | LOG (llevError, "Formula %s has no artifact\n", &formula->title); |
317 | LOG (llevError, "Formula %s has no artifact!\n", &formula->title); |
| 308 | else |
318 | else |
| 309 | { |
319 | { |
| 310 | if (strcmp (formula->title, "NONE")) |
320 | if (strcmp (formula->title, "NONE")) |
| 311 | sprintf (buf, "%s of %s", string, &formula->title); |
321 | sprintf (buf, "%s of %s", string, &formula->title); |
| 312 | else |
322 | else |
| … | |
… | |
| 351 | * only there to prevent infinite loops in treasure lists (a list |
361 | * only there to prevent infinite loops in treasure lists (a list |
| 352 | * referencing another list pointing back to the first one). */ |
362 | * referencing another list pointing back to the first one). */ |
| 353 | archetype * |
363 | archetype * |
| 354 | find_treasure_by_name (const treasure *t, const char *name, int depth) |
364 | find_treasure_by_name (const treasure *t, const char *name, int depth) |
| 355 | { |
365 | { |
| 356 | treasurelist *tl; |
|
|
| 357 | archetype *at; |
|
|
| 358 | |
|
|
| 359 | if (depth > 10) |
366 | if (depth > 10) |
| 360 | return 0; |
367 | return 0; |
| 361 | |
368 | |
| 362 | while (t) |
369 | while (t) |
| 363 | { |
370 | { |
| 364 | if (t->name) |
371 | if (t->name) |
| 365 | { |
372 | { |
| 366 | tl = find_treasurelist (t->name); |
373 | if (treasurelist *tl = treasurelist::find (t->name)) |
| 367 | |
|
|
| 368 | if (tl) |
374 | if (tl->items) |
| 369 | { |
|
|
| 370 | at = find_treasure_by_name (tl->items, name, depth + 1); |
375 | if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1)) |
| 371 | |
|
|
| 372 | if (at) |
|
|
| 373 | return at; |
376 | return at; |
| 374 | } |
|
|
| 375 | } |
377 | } |
| 376 | else |
378 | else |
| 377 | { |
379 | { |
| 378 | if (t->item && !strcasecmp (t->item->clone.name, name)) |
380 | if (t->item && !strcasecmp (t->item->object::name, name)) |
| 379 | return t->item; |
381 | return t->item; |
| 380 | } |
382 | } |
| 381 | |
383 | |
| 382 | if (t->next_yes) |
384 | if (t->next_yes) |
| 383 | { |
|
|
| 384 | at = find_treasure_by_name (t->next_yes, name, depth); |
385 | if (archetype *at = find_treasure_by_name (t->next_yes, name, depth)) |
| 385 | if (at) |
|
|
| 386 | return at; |
386 | return at; |
| 387 | } |
|
|
| 388 | |
387 | |
| 389 | if (t->next_no) |
388 | if (t->next_no) |
| 390 | { |
|
|
| 391 | at = find_treasure_by_name (t->next_no, name, depth); |
389 | if (archetype *at = find_treasure_by_name (t->next_no, name, depth)) |
| 392 | if (at) |
|
|
| 393 | return at; |
390 | return at; |
| 394 | } |
391 | |
| 395 | t = t->next; |
392 | t = t->next; |
| 396 | } |
393 | } |
|
|
394 | |
| 397 | return 0; |
395 | return 0; |
| 398 | } |
396 | } |
| 399 | |
397 | |
| 400 | /* If several archetypes have the same name, the value of the first |
398 | /* If several archetypes have the same name, the value of the first |
| 401 | * one with that name will be returned. This happens for the |
399 | * one with that name will be returned. This happens for the |
| … | |
… | |
| 406 | * body parts that we are looking for (e.g. big_dragon and |
404 | * body parts that we are looking for (e.g. big_dragon and |
| 407 | * big_dragon_worthless). */ |
405 | * big_dragon_worthless). */ |
| 408 | long |
406 | long |
| 409 | find_ingred_cost (const char *name) |
407 | find_ingred_cost (const char *name) |
| 410 | { |
408 | { |
| 411 | archetype *at; |
|
|
| 412 | archetype *at2; |
409 | archetype *at2; |
| 413 | artifactlist *al; |
410 | artifactlist *al; |
| 414 | artifact *art; |
411 | artifact *art; |
| 415 | long mult; |
412 | long mult; |
| 416 | char *cp; |
413 | char *cp; |
| … | |
… | |
| 429 | name++; |
426 | name++; |
| 430 | else |
427 | else |
| 431 | mult = 1; |
428 | mult = 1; |
| 432 | |
429 | |
| 433 | /* first, try to match the name of an archetype */ |
430 | /* first, try to match the name of an archetype */ |
| 434 | for (at = first_archetype; at != NULL; at = at->next) |
431 | for_all_archetypes (at) |
| 435 | { |
432 | { |
| 436 | if (at->clone.title != NULL) |
433 | if (at->title != NULL) |
| 437 | { |
434 | { |
| 438 | /* inefficient, but who cares? */ |
435 | /* inefficient, but who cares? */ |
| 439 | sprintf (part1, "%s %s", &at->clone.name, &at->clone.title); |
436 | sprintf (part1, "%s %s", &at->object::name, &at->title); |
| 440 | if (!strcasecmp (part1, name)) |
437 | if (!strcasecmp (part1, name)) |
| 441 | return mult * at->clone.value; |
438 | return mult * at->value; |
| 442 | } |
439 | } |
| 443 | if (!strcasecmp (at->clone.name, name)) |
440 | if (!strcasecmp (at->object::name, name)) |
| 444 | return mult * at->clone.value; |
441 | return mult * at->value; |
| 445 | } |
442 | } |
| 446 | |
443 | |
| 447 | /* second, try to match an artifact ("arch of something") */ |
444 | /* second, try to match an artifact ("arch of something") */ |
| 448 | cp = strstr (name, " of "); |
445 | cp = strstr (name, " of "); |
| 449 | if (cp != NULL) |
446 | if (cp != NULL) |
| 450 | { |
447 | { |
| 451 | strcpy (part1, name); |
448 | strcpy (part1, name); |
| 452 | part1[cp - name] = '\0'; |
449 | part1[cp - name] = '\0'; |
| 453 | strcpy (part2, cp + 4); |
450 | strcpy (part2, cp + 4); |
|
|
451 | |
| 454 | /* find the first archetype matching the first part of the name */ |
452 | /* find the first archetype matching the first part of the name */ |
| 455 | for (at = first_archetype; at != NULL; at = at->next) |
453 | for_all_archetypes (at) |
| 456 | if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL) |
454 | if (!strcasecmp (at->object::name, part1) && at->title == NULL) |
| 457 | break; |
|
|
| 458 | if (at != NULL) |
|
|
| 459 | { |
455 | { |
| 460 | /* find the first artifact derived from that archetype (same type) */ |
456 | /* find the first artifact derived from that archetype (same type) */ |
| 461 | for (al = first_artifactlist; al != NULL; al = al->next) |
457 | for (al = first_artifactlist; al; al = al->next) |
| 462 | if (al->type == at->clone.type) |
458 | if (al->type == at->type) |
| 463 | { |
459 | { |
| 464 | for (art = al->items; art != NULL; art = art->next) |
460 | for (art = al->items; art; art = art->next) |
| 465 | if (!strcasecmp (art->item->name, part2)) |
461 | if (!strcasecmp (art->item->name, part2)) |
| 466 | return mult * at->clone.value * art->item->value; |
462 | return mult * at->value * art->item->value; |
| 467 | } |
463 | } |
| 468 | } |
464 | } |
| 469 | } |
465 | } |
| 470 | |
466 | |
| 471 | /* third, try to match a body part ("arch's something") */ |
467 | /* third, try to match a body part ("arch's something") */ |
| 472 | cp = strstr (name, "'s "); |
468 | cp = strstr (name, "'s "); |
| 473 | if (cp) |
469 | if (cp) |
| 474 | { |
470 | { |
| 475 | strcpy (part1, name); |
471 | strcpy (part1, name); |
| 476 | part1[cp - name] = '\0'; |
472 | part1[cp - name] = '\0'; |
| 477 | strcpy (part2, cp + 3); |
473 | strcpy (part2, cp + 3); |
| 478 | /* examine all archetypes matching the first part of the name */ |
474 | /* examine all archetypes matching the first part of the name */ |
| 479 | for (at = first_archetype; at != NULL; at = at->next) |
475 | for_all_archetypes (at) |
| 480 | if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL) |
476 | if (!strcasecmp (at->object::name, part1) && at->title == NULL) |
| 481 | { |
477 | { |
| 482 | if (at->clone.randomitems != NULL) |
478 | if (at->randomitems) |
| 483 | { |
479 | { |
| 484 | at2 = find_treasure_by_name (at->clone.randomitems->items, part2, 0); |
480 | at2 = find_treasure_by_name (at->randomitems->items, part2, 0); |
| 485 | if (at2) |
481 | if (at2) |
| 486 | return mult * at2->clone.value * isqrt (at->clone.level * 2); |
482 | return mult * at2->value * isqrt (at->level * 2); |
| 487 | } |
483 | } |
| 488 | } |
484 | } |
| 489 | } |
485 | } |
| 490 | |
486 | |
| 491 | /* failed to find any matching items -- formula should be checked */ |
487 | /* failed to find any matching items -- formula should be checked */ |
| … | |
… | |
| 507 | fprintf (logfile, "\n"); |
503 | fprintf (logfile, "\n"); |
| 508 | while (fl) |
504 | while (fl) |
| 509 | { |
505 | { |
| 510 | fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n", |
506 | 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); |
507 | num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance); |
| 512 | for (formula = fl->items; formula != NULL; formula = formula->next) |
508 | for (formula = fl->items; formula; formula = formula->next) |
| 513 | { |
509 | { |
| 514 | artifact *art = NULL; |
510 | artifact *art = NULL; |
| 515 | archetype *at = NULL; |
511 | archetype *at = NULL; |
| 516 | char buf[MAX_BUF]; |
512 | char buf[MAX_BUF]; |
| 517 | size_t i; |
513 | size_t i; |
| … | |
… | |
| 545 | tcost = -1; |
541 | tcost = -1; |
| 546 | else |
542 | else |
| 547 | tcost += cost; |
543 | tcost += cost; |
| 548 | } |
544 | } |
| 549 | if (art != NULL && art->item != NULL) |
545 | if (art != NULL && art->item != NULL) |
| 550 | cost = at->clone.value * art->item->value; |
546 | cost = at->value * art->item->value; |
| 551 | else |
547 | else |
| 552 | cost = at->clone.value; |
548 | cost = at->value; |
| 553 | fprintf (logfile, "\t\tBuying result costs: %5ld", cost); |
549 | fprintf (logfile, "\t\tBuying result costs: %5ld", cost); |
| 554 | if (formula->yield > 1) |
550 | if (formula->yield > 1) |
| 555 | { |
551 | { |
| 556 | fprintf (logfile, " to %ld (max %d items)\n", cost * formula->yield, formula->yield); |
552 | fprintf (logfile, " to %ld (max %d items)\n", cost * formula->yield, formula->yield); |
| 557 | cost = cost * (formula->yield + 1L) / 2L; |
553 | cost = cost * (formula->yield + 1L) / 2L; |
| … | |
… | |
| 615 | } |
611 | } |
| 616 | |
612 | |
| 617 | artifact * |
613 | artifact * |
| 618 | locate_recipe_artifact (const recipe *rp, size_t idx) |
614 | locate_recipe_artifact (const recipe *rp, size_t idx) |
| 619 | { |
615 | { |
| 620 | object *item = get_archetype (rp->arch_name[idx]); |
616 | archetype *at = archetype::find (rp->arch_name [idx]); |
| 621 | artifactlist *at = NULL; |
|
|
| 622 | artifact *art = NULL; |
|
|
| 623 | |
617 | |
| 624 | if (!item) |
618 | if (at) |
| 625 | return (artifact *) NULL; |
|
|
| 626 | |
|
|
| 627 | if ((at = find_artifactlist (item->type))) |
619 | if (artifactlist *al = find_artifactlist (at->type)) |
| 628 | for (art = at->items; art; art = art->next) |
620 | for (artifact *art = al->items; art; art = art->next) |
| 629 | if (!strcmp (art->item->name, rp->title)) |
621 | if (art->item->name == rp->title) |
| 630 | break; |
622 | return art; |
| 631 | |
623 | |
| 632 | item->destroy (); |
|
|
| 633 | |
|
|
| 634 | return art; |
624 | return 0; |
| 635 | } |
625 | } |
| 636 | |
626 | |
| 637 | int |
627 | int |
| 638 | numb_ingred (const char *buf) |
628 | numb_ingred (const char *buf) |
| 639 | { |
629 | { |
