1 |
/* |
2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
* |
4 |
* Copyright (©) 2005,2006,2007 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 |
|
24 |
/* Basic stuff for use with the alchemy code. Clearly some of this stuff |
25 |
* could go into server/alchemy, but I left it here just in case it proves |
26 |
* more generally useful. |
27 |
* |
28 |
* Nov 1995 - file created by b.t. thomas@astro.psu.edu |
29 |
*/ |
30 |
|
31 |
|
32 |
/* Our definition of 'formula' is any product of an alchemical process. |
33 |
* Ingredients are just comma delimited list of archetype (or object) |
34 |
* names. |
35 |
*/ |
36 |
|
37 |
/* Example 'formula' entry in libdir/formulae: |
38 |
* object transparency |
39 |
* chance 10 |
40 |
* ingred dust of beholdereye,gem |
41 |
* arch potion_generic |
42 |
*/ |
43 |
|
44 |
#include <cctype> |
45 |
|
46 |
#include <global.h> |
47 |
#include <object.h> |
48 |
|
49 |
static void build_stringlist (const char *str, char ***result_list, size_t * result_size); |
50 |
|
51 |
static recipelist *formulalist; |
52 |
|
53 |
static recipelist * |
54 |
init_recipelist (void) |
55 |
{ |
56 |
recipelist *tl = new recipelist; |
57 |
|
58 |
tl->total_chance = 0; |
59 |
tl->number = 0; |
60 |
tl->items = 0; |
61 |
tl->next = 0; |
62 |
|
63 |
return tl; |
64 |
} |
65 |
|
66 |
static recipe * |
67 |
get_empty_formula (void) |
68 |
{ |
69 |
recipe *t = new recipe; |
70 |
|
71 |
t->chance = 0; |
72 |
t->index = 0; |
73 |
t->transmute = 0; |
74 |
t->yield = 0; |
75 |
t->diff = 0; |
76 |
t->exp = 0; |
77 |
t->keycode = 0; |
78 |
t->title = NULL; |
79 |
t->arch_names = 0; |
80 |
t->arch_name = NULL; |
81 |
t->skill = NULL; |
82 |
t->cauldron = NULL; |
83 |
t->ingred = NULL; |
84 |
t->next = NULL; |
85 |
return t; |
86 |
} |
87 |
|
88 |
/* get_formulalist() - returns pointer to the formula list */ |
89 |
recipelist * |
90 |
get_formulalist (int i) |
91 |
{ |
92 |
recipelist *fl = formulalist; |
93 |
int number = i; |
94 |
|
95 |
while (fl && number > 1) |
96 |
{ |
97 |
if (!(fl = fl->next)) |
98 |
break; |
99 |
number--; |
100 |
} |
101 |
|
102 |
return fl; |
103 |
} |
104 |
|
105 |
/* check_recipe() - makes sure we actually have the requested artifact |
106 |
* and archetype. */ |
107 |
static int |
108 |
check_recipe (const recipe *rp) |
109 |
{ |
110 |
size_t i; |
111 |
int result = 1; |
112 |
|
113 |
for (i = 0; i < rp->arch_names; i++) |
114 |
{ |
115 |
if (archetype::find (rp->arch_name[i]) != NULL) |
116 |
{ |
117 |
artifact *art = locate_recipe_artifact (rp, i); |
118 |
|
119 |
if (!art && strcmp (rp->title, "NONE") != 0) |
120 |
{ |
121 |
LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title); |
122 |
result = 0; |
123 |
} |
124 |
} |
125 |
else |
126 |
{ |
127 |
LOG (llevError, "WARNING: Can't find archetype %s for formula %s\n", rp->arch_name[i], &rp->title); |
128 |
result = 0; |
129 |
} |
130 |
} |
131 |
|
132 |
return result; |
133 |
} |
134 |
|
135 |
/* |
136 |
* init_formulae() - Builds up the lists of formula from the file in |
137 |
* the libdir. -b.t. |
138 |
*/ |
139 |
void |
140 |
init_formulae (void) |
141 |
{ |
142 |
static int has_been_done = 0; |
143 |
FILE *fp; |
144 |
char filename[MAX_BUF], buf[MAX_BUF], *cp, *next; |
145 |
recipe *formula = NULL; |
146 |
recipelist *fl = init_recipelist (); |
147 |
linked_char *tmp; |
148 |
int value, comp; |
149 |
|
150 |
if (!formulalist) |
151 |
formulalist = fl; |
152 |
|
153 |
if (has_been_done) |
154 |
return; |
155 |
else |
156 |
has_been_done = 1; |
157 |
|
158 |
sprintf (filename, "%s/formulae", settings.datadir); |
159 |
LOG (llevDebug, "Reading alchemical formulae from %s...\n", filename); |
160 |
if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL) |
161 |
{ |
162 |
LOG (llevError, "Can't open %s.\n", filename); |
163 |
return; |
164 |
} |
165 |
|
166 |
while (fgets (buf, MAX_BUF, fp) != NULL) |
167 |
{ |
168 |
if (*buf == '#') |
169 |
continue; |
170 |
if ((cp = strchr (buf, '\n')) != NULL) |
171 |
*cp = '\0'; |
172 |
cp = buf; |
173 |
while (*cp == ' ') /* Skip blanks */ |
174 |
cp++; |
175 |
|
176 |
if (!strncmp (cp, "object", 6)) |
177 |
{ |
178 |
formula = get_empty_formula (); |
179 |
formula->title = strchr (cp, ' ') + 1; |
180 |
} |
181 |
else if (!strncmp (cp, "keycode", 7)) |
182 |
formula->keycode = strchr (cp, ' ') + 1; |
183 |
else if (sscanf (cp, "trans %d", &value)) |
184 |
formula->transmute = (uint16) value; |
185 |
else if (sscanf (cp, "yield %d", &value)) |
186 |
formula->yield = (uint16) value; |
187 |
else if (sscanf (cp, "chance %d", &value)) |
188 |
formula->chance = (uint16) value; |
189 |
else if (sscanf (cp, "exp %d", &value)) |
190 |
formula->exp = (uint16) value; |
191 |
else if (sscanf (cp, "diff %d", &value)) |
192 |
formula->diff = (uint16) value; |
193 |
else if (!strncmp (cp, "ingred", 6)) |
194 |
{ |
195 |
int numb_ingred = 1; |
196 |
|
197 |
cp = strchr (cp, ' ') + 1; |
198 |
do |
199 |
{ |
200 |
if ((next = strchr (cp, ',')) != NULL) |
201 |
{ |
202 |
*(next++) = '\0'; |
203 |
numb_ingred++; |
204 |
} |
205 |
|
206 |
tmp = new linked_char; |
207 |
|
208 |
tmp->name = cp; |
209 |
tmp->next = formula->ingred; |
210 |
formula->ingred = tmp; |
211 |
/* each ingredient's ASCII value is coadded. Later on this |
212 |
* value will be used allow us to search the formula lists |
213 |
* quickly for the right recipe. |
214 |
*/ |
215 |
formula->index += strtoint (cp); |
216 |
} |
217 |
while ((cp = next) != NULL); |
218 |
|
219 |
/* now find the correct (# of ingred ordered) formulalist */ |
220 |
fl = formulalist; |
221 |
while (numb_ingred != 1) |
222 |
{ |
223 |
if (!fl->next) |
224 |
fl->next = init_recipelist (); |
225 |
|
226 |
fl = fl->next; |
227 |
numb_ingred--; |
228 |
} |
229 |
|
230 |
fl->total_chance += formula->chance; |
231 |
fl->number++; |
232 |
formula->next = fl->items; |
233 |
fl->items = formula; |
234 |
} |
235 |
else if (!strncmp (cp, "arch", 4)) |
236 |
{ |
237 |
build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names); |
238 |
check_recipe (formula); |
239 |
} |
240 |
else if (!strncmp (cp, "skill", 5)) |
241 |
formula->skill = strchr (cp, ' ') + 1; |
242 |
else if (!strncmp (cp, "cauldron", 8)) |
243 |
formula->cauldron = strchr (cp, ' ') + 1; |
244 |
else |
245 |
LOG (llevError, "Unknown input in file %s: %s\n", filename, buf); |
246 |
} |
247 |
|
248 |
LOG (llevDebug, "done.\n"); |
249 |
close_and_delete (fp, comp); |
250 |
/* Lastly, lets check for problems in formula we got */ |
251 |
check_formulae (); |
252 |
} |
253 |
|
254 |
/* check_formulae()- since we are doing a squential search on the |
255 |
* formulae lists now, we have to be carefull that we dont have 2 |
256 |
* formula with the exact same index value. Under the new nbatches |
257 |
* code, it is possible to have multiples of ingredients in a cauldron |
258 |
* which could result in an index formula mismatch. We *don't* check for |
259 |
* that possibility here. -b.t. |
260 |
*/ |
261 |
void |
262 |
check_formulae (void) |
263 |
{ |
264 |
recipelist *fl; |
265 |
recipe *check, *formula; |
266 |
int numb = 1; |
267 |
|
268 |
LOG (llevDebug, "Checking formulae lists...\n"); |
269 |
|
270 |
for (fl = formulalist; fl; fl = fl->next) |
271 |
{ |
272 |
for (formula = fl->items; formula; formula = formula->next) |
273 |
for (check = formula->next; check; check = check->next) |
274 |
if (check->index == formula->index) |
275 |
{ |
276 |
LOG (llevError, " ERROR: On %d ingred list: ", numb); |
277 |
LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n", |
278 |
formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index); |
279 |
} |
280 |
numb++; |
281 |
} |
282 |
|
283 |
LOG (llevDebug, "done.\n"); |
284 |
|
285 |
} |
286 |
|
287 |
/* Find a treasure with a matching name. The 'depth' parameter is |
288 |
* only there to prevent infinite loops in treasure lists (a list |
289 |
* referencing another list pointing back to the first one). */ |
290 |
archetype * |
291 |
find_treasure_by_name (const treasure *t, const char *name, int depth) |
292 |
{ |
293 |
if (depth > 10) |
294 |
return 0; |
295 |
|
296 |
while (t) |
297 |
{ |
298 |
if (t->name) |
299 |
{ |
300 |
if (treasurelist *tl = treasurelist::find (t->name)) |
301 |
if (tl->items) |
302 |
if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1)) |
303 |
return at; |
304 |
} |
305 |
else |
306 |
{ |
307 |
if (t->item && !strcasecmp (t->item->object::name, name)) |
308 |
return t->item; |
309 |
} |
310 |
|
311 |
if (t->next_yes) |
312 |
if (archetype *at = find_treasure_by_name (t->next_yes, name, depth)) |
313 |
return at; |
314 |
|
315 |
if (t->next_no) |
316 |
if (archetype *at = find_treasure_by_name (t->next_no, name, depth)) |
317 |
return at; |
318 |
|
319 |
t = t->next; |
320 |
} |
321 |
|
322 |
return 0; |
323 |
} |
324 |
|
325 |
/* If several archetypes have the same name, the value of the first |
326 |
* one with that name will be returned. This happens for the |
327 |
* mushrooms (mushroom_1, mushroom_2 and mushroom_3). For the |
328 |
* monsters' body parts, there may be several monsters with the same |
329 |
* name. This is not a problem if these monsters have the same level |
330 |
* (e.g. sage & c_sage) or if only one of the monsters generates the |
331 |
* body parts that we are looking for (e.g. big_dragon and |
332 |
* big_dragon_worthless). */ |
333 |
long |
334 |
find_ingred_cost (const char *name) |
335 |
{ |
336 |
archetype *at2; |
337 |
artifactlist *al; |
338 |
artifact *art; |
339 |
long mult; |
340 |
char *cp; |
341 |
char part1[100]; |
342 |
char part2[100]; |
343 |
|
344 |
/* same as atoi(), but skip number */ |
345 |
mult = 0; |
346 |
while (isdigit (*name)) |
347 |
{ |
348 |
mult = 10 * mult + (*name - '0'); |
349 |
name++; |
350 |
} |
351 |
|
352 |
if (mult > 0) |
353 |
name++; |
354 |
else |
355 |
mult = 1; |
356 |
|
357 |
/* first, try to match the name of an archetype */ |
358 |
for_all_archetypes (at) |
359 |
{ |
360 |
if (at->title != NULL) |
361 |
{ |
362 |
/* inefficient, but who cares? */ |
363 |
sprintf (part1, "%s %s", &at->object::name, &at->title); |
364 |
if (!strcasecmp (part1, name)) |
365 |
return mult * at->value; |
366 |
} |
367 |
if (!strcasecmp (at->object::name, name)) |
368 |
return mult * at->value; |
369 |
} |
370 |
|
371 |
/* second, try to match an artifact ("arch of something") */ |
372 |
cp = strstr (name, " of "); |
373 |
if (cp != NULL) |
374 |
{ |
375 |
strcpy (part1, name); |
376 |
part1[cp - name] = '\0'; |
377 |
strcpy (part2, cp + 4); |
378 |
|
379 |
/* find the first archetype matching the first part of the name */ |
380 |
for_all_archetypes (at) |
381 |
if (!strcasecmp (at->object::name, part1) && at->title == NULL) |
382 |
{ |
383 |
/* find the first artifact derived from that archetype (same type) */ |
384 |
for (al = first_artifactlist; al; al = al->next) |
385 |
if (al->type == at->type) |
386 |
{ |
387 |
for (art = al->items; art; art = art->next) |
388 |
if (!strcasecmp (art->item->name, part2)) |
389 |
return mult * at->value * art->item->value; |
390 |
} |
391 |
} |
392 |
} |
393 |
|
394 |
/* third, try to match a body part ("arch's something") */ |
395 |
cp = strstr (name, "'s "); |
396 |
if (cp) |
397 |
{ |
398 |
strcpy (part1, name); |
399 |
part1[cp - name] = '\0'; |
400 |
strcpy (part2, cp + 3); |
401 |
/* examine all archetypes matching the first part of the name */ |
402 |
for_all_archetypes (at) |
403 |
if (!strcasecmp (at->object::name, part1) && at->title == NULL) |
404 |
{ |
405 |
if (at->randomitems) |
406 |
{ |
407 |
at2 = find_treasure_by_name (at->randomitems->items, part2, 0); |
408 |
if (at2) |
409 |
return mult * at2->value * isqrt (at->level * 2); |
410 |
} |
411 |
} |
412 |
} |
413 |
|
414 |
/* failed to find any matching items -- formula should be checked */ |
415 |
return -1; |
416 |
} |
417 |
|
418 |
const char * |
419 |
ingred_name (const char *name) |
420 |
{ |
421 |
const char *cp = name; |
422 |
|
423 |
if (atoi (cp)) |
424 |
cp = strchr (cp, ' ') + 1; |
425 |
|
426 |
return cp; |
427 |
} |
428 |
|
429 |
/* strtoint() - we use this to convert buf into an integer |
430 |
* equal to the coadded sum of the (lowercase) character |
431 |
* ASCII values in buf (times prepended integers). |
432 |
*/ |
433 |
|
434 |
int |
435 |
strtoint (const char *buf) |
436 |
{ |
437 |
const char *cp = ingred_name (buf); |
438 |
int val = 0, len = strlen (cp), mult = numb_ingred (buf); |
439 |
|
440 |
while (len) |
441 |
{ |
442 |
val += tolower (*cp); |
443 |
cp++; |
444 |
len--; |
445 |
} |
446 |
return val * mult; |
447 |
} |
448 |
|
449 |
artifact * |
450 |
locate_recipe_artifact (const recipe *rp, size_t idx) |
451 |
{ |
452 |
archetype *at = archetype::find (rp->arch_name [idx]); |
453 |
|
454 |
if (at) |
455 |
if (artifactlist *al = find_artifactlist (at->type)) |
456 |
for (artifact *art = al->items; art; art = art->next) |
457 |
if (art->item->name == rp->title) |
458 |
return art; |
459 |
|
460 |
return 0; |
461 |
} |
462 |
|
463 |
int |
464 |
numb_ingred (const char *buf) |
465 |
{ |
466 |
int numb; |
467 |
|
468 |
if ((numb = atoi (buf))) |
469 |
return numb; |
470 |
else |
471 |
return 1; |
472 |
} |
473 |
|
474 |
recipelist * |
475 |
get_random_recipelist (void) |
476 |
{ |
477 |
recipelist *fl = NULL; |
478 |
int number = 0, roll = 0; |
479 |
|
480 |
/* first, determine # of recipelist we have */ |
481 |
for (fl = get_formulalist (1); fl; fl = fl->next) |
482 |
number++; |
483 |
|
484 |
/* now, randomly choose one */ |
485 |
if (number > 0) |
486 |
roll = rndm (number); |
487 |
|
488 |
fl = get_formulalist (1); |
489 |
while (roll && fl) |
490 |
{ |
491 |
if (fl->next) |
492 |
fl = fl->next; |
493 |
else |
494 |
break; |
495 |
roll--; |
496 |
} |
497 |
if (!fl) /* failed! */ |
498 |
LOG (llevError, "get_random_recipelist(): no recipelists found!\n"); |
499 |
else if (fl->total_chance == 0) |
500 |
fl = get_random_recipelist (); |
501 |
|
502 |
return fl; |
503 |
} |
504 |
|
505 |
recipe * |
506 |
get_random_recipe (recipelist * rpl) |
507 |
{ |
508 |
recipelist *fl = rpl; |
509 |
recipe *rp = NULL; |
510 |
int r = 0; |
511 |
|
512 |
/* looks like we have to choose a random one */ |
513 |
if (fl == NULL) |
514 |
if ((fl = get_random_recipelist ()) == NULL) |
515 |
return rp; |
516 |
|
517 |
if (fl->total_chance > 0) |
518 |
{ |
519 |
r = rndm (fl->total_chance); |
520 |
for (rp = fl->items; rp; rp = rp->next) |
521 |
{ |
522 |
r -= rp->chance; |
523 |
if (r < 0) |
524 |
break; |
525 |
} |
526 |
} |
527 |
return rp; |
528 |
} |
529 |
|
530 |
void |
531 |
free_all_recipes (void) |
532 |
{ |
533 |
recipelist *fl = formulalist, *flnext; |
534 |
recipe *formula = NULL, *next; |
535 |
linked_char *lchar, *charnext; |
536 |
|
537 |
LOG (llevDebug, "Freeing all the recipes\n"); |
538 |
for (fl = formulalist; fl != NULL; fl = flnext) |
539 |
{ |
540 |
flnext = fl->next; |
541 |
|
542 |
for (formula = fl->items; formula != NULL; formula = next) |
543 |
{ |
544 |
next = formula->next; |
545 |
|
546 |
free (formula->arch_name[0]); |
547 |
free (formula->arch_name); |
548 |
|
549 |
for (lchar = formula->ingred; lchar; lchar = charnext) |
550 |
{ |
551 |
charnext = lchar->next; |
552 |
delete lchar; |
553 |
} |
554 |
delete formula; |
555 |
} |
556 |
|
557 |
delete fl; |
558 |
} |
559 |
} |
560 |
|
561 |
/** |
562 |
* Split a comma separated string list into words. |
563 |
* |
564 |
* @param str the string to split |
565 |
* |
566 |
* @param result_list pointer to return value for the newly created list; the |
567 |
* caller is responsible for freeing both *result_list and **result_list. |
568 |
* |
569 |
* @param result_size pointer to return value for the size of the newly |
570 |
* created list |
571 |
*/ |
572 |
static void |
573 |
build_stringlist (const char *str, char ***result_list, size_t * result_size) |
574 |
{ |
575 |
char *dup; |
576 |
char *p; |
577 |
size_t size; |
578 |
size_t i; |
579 |
|
580 |
dup = strdup (str); |
581 |
if (dup == NULL) |
582 |
fatal (OUT_OF_MEMORY); |
583 |
|
584 |
size = 0; |
585 |
for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ",")) |
586 |
size++; |
587 |
|
588 |
*result_list = (char **) malloc (size * sizeof (*result_list)); |
589 |
|
590 |
*result_size = size; |
591 |
|
592 |
for (i = 0; i < size; i++) |
593 |
{ |
594 |
(*result_list)[i] = dup; |
595 |
dup = dup + strlen (dup) + 1; |
596 |
} |
597 |
} |