1 |
/* 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 |
3 |
* more generally useful. |
4 |
* |
5 |
* Nov 1995 - file created by b.t. thomas@astro.psu.edu |
6 |
*/ |
7 |
|
8 |
|
9 |
/* Our definition of 'formula' is any product of an alchemical process. |
10 |
* Ingredients are just comma delimited list of archetype (or object) |
11 |
* names. |
12 |
*/ |
13 |
|
14 |
/* Example 'formula' entry in libdir/formulae: |
15 |
* Object transparency |
16 |
* chance 10 |
17 |
* ingred dust of beholdereye,gem |
18 |
* arch potion_generic |
19 |
*/ |
20 |
|
21 |
#include <cctype> |
22 |
|
23 |
#include <global.h> |
24 |
#include <object.h> |
25 |
|
26 |
static void build_stringlist (const char *str, char ***result_list, size_t * result_size); |
27 |
|
28 |
static recipelist *formulalist; |
29 |
|
30 |
static recipelist * |
31 |
init_recipelist (void) |
32 |
{ |
33 |
recipelist *tl = new recipelist; |
34 |
|
35 |
tl->total_chance = 0; |
36 |
tl->number = 0; |
37 |
tl->items = NULL; |
38 |
tl->next = NULL; |
39 |
return tl; |
40 |
} |
41 |
|
42 |
static recipe * |
43 |
get_empty_formula (void) |
44 |
{ |
45 |
recipe *t = new recipe; |
46 |
|
47 |
t->chance = 0; |
48 |
t->index = 0; |
49 |
t->transmute = 0; |
50 |
t->yield = 0; |
51 |
t->diff = 0; |
52 |
t->exp = 0; |
53 |
t->keycode = 0; |
54 |
t->title = NULL; |
55 |
t->arch_names = 0; |
56 |
t->arch_name = NULL; |
57 |
t->skill = NULL; |
58 |
t->cauldron = NULL; |
59 |
t->ingred = NULL; |
60 |
t->next = NULL; |
61 |
return t; |
62 |
} |
63 |
|
64 |
/* get_formulalist() - returns pointer to the formula list */ |
65 |
|
66 |
recipelist * |
67 |
get_formulalist (int i) |
68 |
{ |
69 |
recipelist *fl = formulalist; |
70 |
int number = i; |
71 |
|
72 |
while (fl && number > 1) |
73 |
{ |
74 |
if (!(fl = fl->next)) |
75 |
break; |
76 |
number--; |
77 |
} |
78 |
return fl; |
79 |
} |
80 |
|
81 |
/* check_recipe() - makes sure we actually have the requested artifact |
82 |
* and archetype. */ |
83 |
|
84 |
static int |
85 |
check_recipe (const recipe *rp) |
86 |
{ |
87 |
size_t i; |
88 |
int result; |
89 |
|
90 |
result = 1; |
91 |
for (i = 0; i < rp->arch_names; i++) |
92 |
{ |
93 |
if (archetype::find (rp->arch_name[i]) != NULL) |
94 |
{ |
95 |
artifact *art = locate_recipe_artifact (rp, i); |
96 |
|
97 |
if (!art && strcmp (rp->title, "NONE") != 0) |
98 |
{ |
99 |
LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title); |
100 |
result = 0; |
101 |
} |
102 |
} |
103 |
else |
104 |
{ |
105 |
LOG (llevError, "WARNING: Can't find archetype %s for formula %s\n", rp->arch_name[i], &rp->title); |
106 |
result = 0; |
107 |
} |
108 |
} |
109 |
|
110 |
return result; |
111 |
} |
112 |
|
113 |
|
114 |
/* |
115 |
* init_formulae() - Builds up the lists of formula from the file in |
116 |
* the libdir. -b.t. |
117 |
*/ |
118 |
|
119 |
void |
120 |
init_formulae (void) |
121 |
{ |
122 |
static int has_been_done = 0; |
123 |
FILE *fp; |
124 |
char filename[MAX_BUF], buf[MAX_BUF], *cp, *next; |
125 |
recipe *formula = NULL; |
126 |
recipelist *fl = init_recipelist (); |
127 |
linked_char *tmp; |
128 |
int value, comp; |
129 |
|
130 |
if (!formulalist) |
131 |
formulalist = fl; |
132 |
|
133 |
if (has_been_done) |
134 |
return; |
135 |
else |
136 |
has_been_done = 1; |
137 |
|
138 |
sprintf (filename, "%s/formulae", settings.datadir); |
139 |
LOG (llevDebug, "Reading alchemical formulae from %s...\n", filename); |
140 |
if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL) |
141 |
{ |
142 |
LOG (llevError, "Can't open %s.\n", filename); |
143 |
return; |
144 |
} |
145 |
|
146 |
while (fgets (buf, MAX_BUF, fp) != NULL) |
147 |
{ |
148 |
if (*buf == '#') |
149 |
continue; |
150 |
if ((cp = strchr (buf, '\n')) != NULL) |
151 |
*cp = '\0'; |
152 |
cp = buf; |
153 |
while (*cp == ' ') /* Skip blanks */ |
154 |
cp++; |
155 |
|
156 |
if (!strncmp (cp, "Object", 6) || !strncmp (cp, "object", 6)) |
157 |
{ |
158 |
formula = get_empty_formula (); |
159 |
formula->title = strchr (cp, ' ') + 1; |
160 |
} |
161 |
else if (!strncmp (cp, "keycode", 7)) |
162 |
{ |
163 |
formula->keycode = strchr (cp, ' ') + 1; |
164 |
} |
165 |
else if (sscanf (cp, "trans %d", &value)) |
166 |
{ |
167 |
formula->transmute = (uint16) value; |
168 |
} |
169 |
else if (sscanf (cp, "yield %d", &value)) |
170 |
{ |
171 |
formula->yield = (uint16) value; |
172 |
} |
173 |
else if (sscanf (cp, "chance %d", &value)) |
174 |
{ |
175 |
formula->chance = (uint16) value; |
176 |
} |
177 |
else if (sscanf (cp, "exp %d", &value)) |
178 |
{ |
179 |
formula->exp = (uint16) value; |
180 |
} |
181 |
else if (sscanf (cp, "diff %d", &value)) |
182 |
{ |
183 |
formula->diff = (uint16) value; |
184 |
} |
185 |
else if (!strncmp (cp, "ingred", 6)) |
186 |
{ |
187 |
int numb_ingred = 1; |
188 |
|
189 |
cp = strchr (cp, ' ') + 1; |
190 |
do |
191 |
{ |
192 |
if ((next = strchr (cp, ',')) != NULL) |
193 |
{ |
194 |
*(next++) = '\0'; |
195 |
numb_ingred++; |
196 |
} |
197 |
tmp = new linked_char; |
198 |
|
199 |
tmp->name = cp; |
200 |
tmp->next = formula->ingred; |
201 |
formula->ingred = tmp; |
202 |
/* each ingredient's ASCII value is coadded. Later on this |
203 |
* value will be used allow us to search the formula lists |
204 |
* quickly for the right recipe. |
205 |
*/ |
206 |
formula->index += strtoint (cp); |
207 |
} |
208 |
while ((cp = next) != NULL); |
209 |
/* now find the correct (# of ingred ordered) formulalist */ |
210 |
fl = formulalist; |
211 |
while (numb_ingred != 1) |
212 |
{ |
213 |
if (!fl->next) |
214 |
fl->next = init_recipelist (); |
215 |
fl = fl->next; |
216 |
numb_ingred--; |
217 |
} |
218 |
fl->total_chance += formula->chance; |
219 |
fl->number++; |
220 |
formula->next = fl->items; |
221 |
fl->items = formula; |
222 |
} |
223 |
else if (!strncmp (cp, "arch", 4)) |
224 |
{ |
225 |
build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names); |
226 |
check_recipe (formula); |
227 |
} |
228 |
else if (!strncmp (cp, "skill", 5)) |
229 |
{ |
230 |
formula->skill = strchr (cp, ' ') + 1; |
231 |
} |
232 |
else if (!strncmp (cp, "cauldron", 8)) |
233 |
{ |
234 |
formula->cauldron = strchr (cp, ' ') + 1; |
235 |
} |
236 |
else |
237 |
LOG (llevError, "Unknown input in file %s: %s\n", filename, buf); |
238 |
} |
239 |
LOG (llevDebug, "done.\n"); |
240 |
close_and_delete (fp, comp); |
241 |
/* Lastly, lets check for problems in formula we got */ |
242 |
check_formulae (); |
243 |
} |
244 |
|
245 |
/* check_formulae()- since we are doing a squential search on the |
246 |
* formulae lists now, we have to be carefull that we dont have 2 |
247 |
* formula with the exact same index value. Under the new nbatches |
248 |
* code, it is possible to have multiples of ingredients in a cauldron |
249 |
* which could result in an index formula mismatch. We *don't* check for |
250 |
* that possibility here. -b.t. |
251 |
*/ |
252 |
void |
253 |
check_formulae (void) |
254 |
{ |
255 |
recipelist *fl; |
256 |
recipe *check, *formula; |
257 |
int numb = 1; |
258 |
|
259 |
LOG (llevDebug, "Checking formulae lists...\n"); |
260 |
|
261 |
for (fl = formulalist; fl != NULL; fl = fl->next) |
262 |
{ |
263 |
for (formula = fl->items; formula != NULL; formula = formula->next) |
264 |
for (check = formula->next; check != NULL; check = check->next) |
265 |
if (check->index == formula->index) |
266 |
{ |
267 |
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", |
269 |
formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index); |
270 |
} |
271 |
numb++; |
272 |
} |
273 |
|
274 |
LOG (llevDebug, "done.\n"); |
275 |
|
276 |
} |
277 |
|
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 |
351 |
* only there to prevent infinite loops in treasure lists (a list |
352 |
* referencing another list pointing back to the first one). */ |
353 |
archetype * |
354 |
find_treasure_by_name (const treasure *t, const char *name, int depth) |
355 |
{ |
356 |
treasurelist *tl; |
357 |
archetype *at; |
358 |
|
359 |
if (depth > 10) |
360 |
return 0; |
361 |
|
362 |
while (t) |
363 |
{ |
364 |
if (t->name) |
365 |
{ |
366 |
tl = find_treasurelist (t->name); |
367 |
|
368 |
if (tl) |
369 |
{ |
370 |
at = find_treasure_by_name (tl->items, name, depth + 1); |
371 |
|
372 |
if (at) |
373 |
return at; |
374 |
} |
375 |
} |
376 |
else |
377 |
{ |
378 |
if (t->item && !strcasecmp (t->item->clone.name, name)) |
379 |
return t->item; |
380 |
} |
381 |
|
382 |
if (t->next_yes) |
383 |
{ |
384 |
at = find_treasure_by_name (t->next_yes, name, depth); |
385 |
if (at) |
386 |
return at; |
387 |
} |
388 |
|
389 |
if (t->next_no) |
390 |
{ |
391 |
at = find_treasure_by_name (t->next_no, name, depth); |
392 |
if (at) |
393 |
return at; |
394 |
} |
395 |
t = t->next; |
396 |
} |
397 |
return 0; |
398 |
} |
399 |
|
400 |
/* If several archetypes have the same name, the value of the first |
401 |
* one with that name will be returned. This happens for the |
402 |
* mushrooms (mushroom_1, mushroom_2 and mushroom_3). For the |
403 |
* monsters' body parts, there may be several monsters with the same |
404 |
* name. This is not a problem if these monsters have the same level |
405 |
* (e.g. sage & c_sage) or if only one of the monsters generates the |
406 |
* body parts that we are looking for (e.g. big_dragon and |
407 |
* big_dragon_worthless). */ |
408 |
long |
409 |
find_ingred_cost (const char *name) |
410 |
{ |
411 |
archetype *at; |
412 |
archetype *at2; |
413 |
artifactlist *al; |
414 |
artifact *art; |
415 |
long mult; |
416 |
char *cp; |
417 |
char part1[100]; |
418 |
char part2[100]; |
419 |
|
420 |
/* same as atoi(), but skip number */ |
421 |
mult = 0; |
422 |
while (isdigit (*name)) |
423 |
{ |
424 |
mult = 10 * mult + (*name - '0'); |
425 |
name++; |
426 |
} |
427 |
|
428 |
if (mult > 0) |
429 |
name++; |
430 |
else |
431 |
mult = 1; |
432 |
|
433 |
/* first, try to match the name of an archetype */ |
434 |
for (at = first_archetype; at != NULL; at = at->next) |
435 |
{ |
436 |
if (at->clone.title != NULL) |
437 |
{ |
438 |
/* inefficient, but who cares? */ |
439 |
sprintf (part1, "%s %s", &at->clone.name, &at->clone.title); |
440 |
if (!strcasecmp (part1, name)) |
441 |
return mult * at->clone.value; |
442 |
} |
443 |
if (!strcasecmp (at->clone.name, name)) |
444 |
return mult * at->clone.value; |
445 |
} |
446 |
|
447 |
/* second, try to match an artifact ("arch of something") */ |
448 |
cp = strstr (name, " of "); |
449 |
if (cp != NULL) |
450 |
{ |
451 |
strcpy (part1, name); |
452 |
part1[cp - name] = '\0'; |
453 |
strcpy (part2, cp + 4); |
454 |
/* find the first archetype matching the first part of the name */ |
455 |
for (at = first_archetype; at != NULL; at = at->next) |
456 |
if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL) |
457 |
break; |
458 |
if (at != NULL) |
459 |
{ |
460 |
/* find the first artifact derived from that archetype (same type) */ |
461 |
for (al = first_artifactlist; al != NULL; al = al->next) |
462 |
if (al->type == at->clone.type) |
463 |
{ |
464 |
for (art = al->items; art != NULL; art = art->next) |
465 |
if (!strcasecmp (art->item->name, part2)) |
466 |
return mult * at->clone.value * art->item->value; |
467 |
} |
468 |
} |
469 |
} |
470 |
|
471 |
/* third, try to match a body part ("arch's something") */ |
472 |
cp = strstr (name, "'s "); |
473 |
if (cp) |
474 |
{ |
475 |
strcpy (part1, name); |
476 |
part1[cp - name] = '\0'; |
477 |
strcpy (part2, cp + 3); |
478 |
/* examine all archetypes matching the first part of the name */ |
479 |
for (at = first_archetype; at != NULL; at = at->next) |
480 |
if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL) |
481 |
{ |
482 |
if (at->clone.randomitems != NULL) |
483 |
{ |
484 |
at2 = find_treasure_by_name (at->clone.randomitems->items, part2, 0); |
485 |
if (at2) |
486 |
return mult * at2->clone.value * isqrt (at->clone.level * 2); |
487 |
} |
488 |
} |
489 |
} |
490 |
|
491 |
/* failed to find any matching items -- formula should be checked */ |
492 |
return -1; |
493 |
} |
494 |
|
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 * |
588 |
ingred_name (const char *name) |
589 |
{ |
590 |
const char *cp = name; |
591 |
|
592 |
if (atoi (cp)) |
593 |
cp = strchr (cp, ' ') + 1; |
594 |
return cp; |
595 |
} |
596 |
|
597 |
/* strtoint() - we use this to convert buf into an integer |
598 |
* equal to the coadded sum of the (lowercase) character |
599 |
* ASCII values in buf (times prepended integers). |
600 |
*/ |
601 |
|
602 |
int |
603 |
strtoint (const char *buf) |
604 |
{ |
605 |
const char *cp = ingred_name (buf); |
606 |
int val = 0, len = strlen (cp), mult = numb_ingred (buf); |
607 |
|
608 |
while (len) |
609 |
{ |
610 |
val += tolower (*cp); |
611 |
cp++; |
612 |
len--; |
613 |
} |
614 |
return val * mult; |
615 |
} |
616 |
|
617 |
artifact * |
618 |
locate_recipe_artifact (const recipe *rp, size_t idx) |
619 |
{ |
620 |
object *item = get_archetype (rp->arch_name[idx]); |
621 |
artifactlist *at = NULL; |
622 |
artifact *art = NULL; |
623 |
|
624 |
if (!item) |
625 |
return (artifact *) NULL; |
626 |
|
627 |
if ((at = find_artifactlist (item->type))) |
628 |
for (art = at->items; art; art = art->next) |
629 |
if (!strcmp (art->item->name, rp->title)) |
630 |
break; |
631 |
|
632 |
item->destroy (); |
633 |
|
634 |
return art; |
635 |
} |
636 |
|
637 |
int |
638 |
numb_ingred (const char *buf) |
639 |
{ |
640 |
int numb; |
641 |
|
642 |
if ((numb = atoi (buf))) |
643 |
return numb; |
644 |
else |
645 |
return 1; |
646 |
} |
647 |
|
648 |
recipelist * |
649 |
get_random_recipelist (void) |
650 |
{ |
651 |
recipelist *fl = NULL; |
652 |
int number = 0, roll = 0; |
653 |
|
654 |
/* first, determine # of recipelist we have */ |
655 |
for (fl = get_formulalist (1); fl; fl = fl->next) |
656 |
number++; |
657 |
|
658 |
/* now, randomly choose one */ |
659 |
if (number > 0) |
660 |
roll = rndm (number); |
661 |
|
662 |
fl = get_formulalist (1); |
663 |
while (roll && fl) |
664 |
{ |
665 |
if (fl->next) |
666 |
fl = fl->next; |
667 |
else |
668 |
break; |
669 |
roll--; |
670 |
} |
671 |
if (!fl) /* failed! */ |
672 |
LOG (llevError, "get_random_recipelist(): no recipelists found!\n"); |
673 |
else if (fl->total_chance == 0) |
674 |
fl = get_random_recipelist (); |
675 |
|
676 |
return fl; |
677 |
} |
678 |
|
679 |
recipe * |
680 |
get_random_recipe (recipelist * rpl) |
681 |
{ |
682 |
recipelist *fl = rpl; |
683 |
recipe *rp = NULL; |
684 |
int r = 0; |
685 |
|
686 |
/* looks like we have to choose a random one */ |
687 |
if (fl == NULL) |
688 |
if ((fl = get_random_recipelist ()) == NULL) |
689 |
return rp; |
690 |
|
691 |
if (fl->total_chance > 0) |
692 |
{ |
693 |
r = rndm (fl->total_chance); |
694 |
for (rp = fl->items; rp; rp = rp->next) |
695 |
{ |
696 |
r -= rp->chance; |
697 |
if (r < 0) |
698 |
break; |
699 |
} |
700 |
} |
701 |
return rp; |
702 |
} |
703 |
|
704 |
void |
705 |
free_all_recipes (void) |
706 |
{ |
707 |
recipelist *fl = formulalist, *flnext; |
708 |
recipe *formula = NULL, *next; |
709 |
linked_char *lchar, *charnext; |
710 |
|
711 |
LOG (llevDebug, "Freeing all the recipes\n"); |
712 |
for (fl = formulalist; fl != NULL; fl = flnext) |
713 |
{ |
714 |
flnext = fl->next; |
715 |
|
716 |
for (formula = fl->items; formula != NULL; formula = next) |
717 |
{ |
718 |
next = formula->next; |
719 |
|
720 |
free (formula->arch_name[0]); |
721 |
free (formula->arch_name); |
722 |
|
723 |
for (lchar = formula->ingred; lchar; lchar = charnext) |
724 |
{ |
725 |
charnext = lchar->next; |
726 |
delete lchar; |
727 |
} |
728 |
delete formula; |
729 |
} |
730 |
|
731 |
delete fl; |
732 |
} |
733 |
} |
734 |
|
735 |
/** |
736 |
* Split a comma separated string list into words. |
737 |
* |
738 |
* @param str the string to split |
739 |
* |
740 |
* @param result_list pointer to return value for the newly created list; the |
741 |
* caller is responsible for freeing both *result_list and **result_list. |
742 |
* |
743 |
* @param result_size pointer to return value for the size of the newly |
744 |
* created list |
745 |
*/ |
746 |
static void |
747 |
build_stringlist (const char *str, char ***result_list, size_t * result_size) |
748 |
{ |
749 |
char *dup; |
750 |
char *p; |
751 |
size_t size; |
752 |
size_t i; |
753 |
|
754 |
dup = strdup (str); |
755 |
if (dup == NULL) |
756 |
fatal (OUT_OF_MEMORY); |
757 |
|
758 |
size = 0; |
759 |
for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ",")) |
760 |
size++; |
761 |
|
762 |
*result_list = (char **) malloc (size * sizeof (*result_list)); |
763 |
|
764 |
*result_size = size; |
765 |
|
766 |
for (i = 0; i < size; i++) |
767 |
{ |
768 |
(*result_list)[i] = dup; |
769 |
dup = dup + strlen (dup) + 1; |
770 |
} |
771 |
} |