1 |
/* |
2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
* |
4 |
* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
* Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 |
* Copyright (©) 1992 Frank Tore Johansen |
7 |
* |
8 |
* Deliantra is free software: you can redistribute it and/or modify it under |
9 |
* the terms of the Affero GNU General Public License as published by the |
10 |
* Free Software Foundation, either version 3 of the License, or (at your |
11 |
* 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 Affero GNU General Public License |
19 |
* and the GNU General Public License along with this program. If not, see |
20 |
* <http://www.gnu.org/licenses/>. |
21 |
* |
22 |
* The authors can be reached via e-mail to <support@deliantra.net> |
23 |
*/ |
24 |
|
25 |
/* Basic stuff for use with the alchemy code. Clearly some of this stuff |
26 |
* could go into server/alchemy, but I left it here just in case it proves |
27 |
* more generally useful. |
28 |
* |
29 |
* Nov 1995 - file created by b.t. thomas@astro.psu.edu |
30 |
*/ |
31 |
|
32 |
|
33 |
/* Our definition of 'formula' is any product of an alchemical process. |
34 |
* Ingredients are just comma delimited list of archetype (or object) |
35 |
* names. |
36 |
*/ |
37 |
|
38 |
/* Example 'formula' entry in libdir/formulae: |
39 |
* object transparency |
40 |
* chance 10 |
41 |
* ingred dust of beholdereye,gem |
42 |
* arch potion_generic |
43 |
*/ |
44 |
|
45 |
#include <cctype> |
46 |
|
47 |
#include <global.h> |
48 |
#include <object.h> |
49 |
|
50 |
static void build_stringlist (const char *str, char ***result_list, size_t * result_size); |
51 |
|
52 |
static recipelist *formulalist; |
53 |
|
54 |
static recipelist * |
55 |
init_recipelist () |
56 |
{ |
57 |
recipelist *tl = new recipelist; |
58 |
|
59 |
tl->total_chance = 0; |
60 |
tl->number = 0; |
61 |
tl->items = 0; |
62 |
tl->next = 0; |
63 |
|
64 |
return tl; |
65 |
} |
66 |
|
67 |
static recipe * |
68 |
get_empty_formula () |
69 |
{ |
70 |
recipe *t = new recipe; |
71 |
|
72 |
t->chance = 0; |
73 |
t->index = 0; |
74 |
t->transmute = 0; |
75 |
t->yield = 0; |
76 |
t->diff = 0; |
77 |
t->exp = 0; |
78 |
t->keycode = 0; |
79 |
t->title = 0; |
80 |
t->arch_names = 0; |
81 |
t->arch_name = 0; |
82 |
t->skill = 0; |
83 |
t->cauldron = 0; |
84 |
t->ingred = 0; |
85 |
t->next = 0; |
86 |
|
87 |
return t; |
88 |
} |
89 |
|
90 |
/* get_formulalist() - returns pointer to the formula list */ |
91 |
recipelist * |
92 |
get_formulalist (int i) |
93 |
{ |
94 |
recipelist *fl = formulalist; |
95 |
int number = i; |
96 |
|
97 |
while (fl && number > 1) |
98 |
{ |
99 |
if (!(fl = fl->next)) |
100 |
break; |
101 |
number--; |
102 |
} |
103 |
|
104 |
return fl; |
105 |
} |
106 |
|
107 |
/* check_recipe() - makes sure we actually have the requested artifact |
108 |
* and archetype. */ |
109 |
static int |
110 |
check_recipe (const recipe *rp) |
111 |
{ |
112 |
size_t i; |
113 |
int result = 1; |
114 |
|
115 |
for (i = 0; i < rp->arch_names; i++) |
116 |
{ |
117 |
if (archetype::find (rp->arch_name[i])) |
118 |
{ |
119 |
artifact *art = locate_recipe_artifact (rp, i); |
120 |
|
121 |
if (!art && rp->title != shstr_NONE) |
122 |
{ |
123 |
LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title); |
124 |
result = 0; |
125 |
} |
126 |
} |
127 |
else |
128 |
{ |
129 |
LOG (llevError, "WARNING: Can't find archetype %s for formula %s\n", rp->arch_name[i], &rp->title); |
130 |
result = 0; |
131 |
} |
132 |
} |
133 |
|
134 |
return result; |
135 |
} |
136 |
|
137 |
/* check_formulae()- since we are doing a squential search on the |
138 |
* formulae lists now, we have to be carefull that we dont have 2 |
139 |
* formula with the exact same index value. Under the new nbatches |
140 |
* code, it is possible to have multiples of ingredients in a cauldron |
141 |
* which could result in an index formula mismatch. We *don't* check for |
142 |
* that possibility here. -b.t. |
143 |
*/ |
144 |
static void |
145 |
check_formulae () |
146 |
{ |
147 |
recipelist *fl; |
148 |
recipe *check, *formula; |
149 |
int numb = 1; |
150 |
|
151 |
LOG (llevDebug, "Checking formulae lists...\n"); |
152 |
|
153 |
for (fl = formulalist; fl; fl = fl->next) |
154 |
{ |
155 |
for (formula = fl->items; formula; formula = formula->next) |
156 |
for (check = formula->next; check; check = check->next) |
157 |
if (check->index == formula->index) |
158 |
{ |
159 |
LOG (llevError, " ERROR: On %d ingred list: ", numb); |
160 |
LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n", |
161 |
formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index); |
162 |
} |
163 |
numb++; |
164 |
} |
165 |
|
166 |
LOG (llevDebug, "done.\n"); |
167 |
|
168 |
} |
169 |
|
170 |
/* |
171 |
* init_formulae() - Builds up the lists of formula from the file in |
172 |
* the libdir. -b.t. |
173 |
*/ |
174 |
void |
175 |
init_formulae () |
176 |
{ |
177 |
static int has_been_done = 0; |
178 |
FILE *fp; |
179 |
char filename[MAX_BUF], buf[MAX_BUF], *cp, *next; |
180 |
recipelist *fl = init_recipelist (); |
181 |
linked_char *tmp; |
182 |
int value, comp; |
183 |
|
184 |
if (!formulalist) |
185 |
formulalist = fl; |
186 |
|
187 |
if (has_been_done) |
188 |
return; |
189 |
else |
190 |
has_been_done = 1; |
191 |
|
192 |
sprintf (filename, "%s/formulae", settings.datadir); |
193 |
LOG (llevDebug, "Reading alchemical formulae from %s...\n", filename); |
194 |
|
195 |
object_thawer thawer (filename); |
196 |
|
197 |
if (!thawer) |
198 |
{ |
199 |
LOG (llevError, "Can't open %s.\n", filename); |
200 |
return; |
201 |
} |
202 |
|
203 |
while (thawer.kw) |
204 |
{ |
205 |
if (thawer.kw != KW_object) |
206 |
if (!thawer.parse_error ("formulae file")) |
207 |
break; |
208 |
|
209 |
recipe *formula = get_empty_formula (); |
210 |
thawer.get (formula->title); |
211 |
|
212 |
for (;;) |
213 |
{ |
214 |
thawer.next (); |
215 |
|
216 |
switch (thawer.kw) |
217 |
{ |
218 |
case KW_keycode: thawer.get (formula->keycode ); break; |
219 |
case KW_trans: thawer.get (formula->transmute); break; |
220 |
case KW_yield: thawer.get (formula->yield ); break; |
221 |
case KW_chance: thawer.get (formula->chance ); break; |
222 |
case KW_exp: thawer.get (formula->exp ); break; |
223 |
case KW_diff: thawer.get (formula->diff ); break; |
224 |
case KW_skill: thawer.get (formula->skill ); break; |
225 |
case KW_cauldron: thawer.get (formula->cauldron ); break; |
226 |
|
227 |
case KW_arch: |
228 |
{ |
229 |
build_stringlist (thawer.value_nn, &formula->arch_name, &formula->arch_names); |
230 |
check_recipe (formula); |
231 |
} |
232 |
break; |
233 |
|
234 |
case KW_ingred: |
235 |
if (thawer.value) |
236 |
{ |
237 |
int numb_ingred = 1; |
238 |
char *cp = thawer.value; |
239 |
|
240 |
do |
241 |
{ |
242 |
if ((next = strchr (cp, ','))) |
243 |
{ |
244 |
*next++ = '\0'; |
245 |
++numb_ingred; |
246 |
} |
247 |
|
248 |
tmp = new linked_char; |
249 |
|
250 |
tmp->name = cp; |
251 |
tmp->next = formula->ingred; |
252 |
formula->ingred = tmp; |
253 |
/* each ingredient's ASCII value is coadded. Later on this |
254 |
* value will be used allow us to search the formula lists |
255 |
* quickly for the right recipe. |
256 |
*/ |
257 |
formula->index += strtoint (cp); |
258 |
} |
259 |
while ((cp = next)); |
260 |
|
261 |
/* now find the correct (# of ingred ordered) formulalist */ |
262 |
fl = formulalist; |
263 |
while (numb_ingred != 1) |
264 |
{ |
265 |
if (!fl->next) |
266 |
fl->next = init_recipelist (); |
267 |
|
268 |
fl = fl->next; |
269 |
numb_ingred--; |
270 |
} |
271 |
|
272 |
fl->total_chance += formula->chance; |
273 |
fl->number++; |
274 |
formula->next = fl->items; |
275 |
fl->items = formula; |
276 |
} |
277 |
break; |
278 |
|
279 |
default: |
280 |
delete formula; |
281 |
case KW_EOF: |
282 |
case KW_object: |
283 |
goto next_object; |
284 |
} |
285 |
} |
286 |
|
287 |
next_object: ; |
288 |
} |
289 |
|
290 |
LOG (llevDebug, "done.\n"); |
291 |
/* Lastly, lets check for problems in formula we got */ |
292 |
check_formulae (); |
293 |
} |
294 |
|
295 |
/* Find a treasure with a matching name. The 'depth' parameter is |
296 |
* only there to prevent infinite loops in treasure lists (a list |
297 |
* referencing another list pointing back to the first one). */ |
298 |
static archetype * |
299 |
find_treasure_by_name (const treasure *t, const char *name, int depth) |
300 |
{ |
301 |
if (depth > 10) |
302 |
return 0; |
303 |
|
304 |
while (t) |
305 |
{ |
306 |
if (t->name) |
307 |
{ |
308 |
if (treasurelist *tl = treasurelist::find (t->name)) |
309 |
if (tl->items) |
310 |
if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1)) |
311 |
return at; |
312 |
} |
313 |
else |
314 |
{ |
315 |
if (t->item && !strcasecmp (t->item->object::name, name)) |
316 |
return t->item; |
317 |
} |
318 |
|
319 |
if (t->next_yes) |
320 |
if (archetype *at = find_treasure_by_name (t->next_yes, name, depth)) |
321 |
return at; |
322 |
|
323 |
if (t->next_no) |
324 |
if (archetype *at = find_treasure_by_name (t->next_no, name, depth)) |
325 |
return at; |
326 |
|
327 |
t = t->next; |
328 |
} |
329 |
|
330 |
return 0; |
331 |
} |
332 |
|
333 |
static const char * |
334 |
ingred_name (const char *name) |
335 |
{ |
336 |
const char *cp = name; |
337 |
|
338 |
if (atoi (cp)) |
339 |
cp = strchr (cp, ' ') + 1; |
340 |
|
341 |
return cp; |
342 |
} |
343 |
|
344 |
static int |
345 |
numb_ingred (const char *buf) |
346 |
{ |
347 |
int numb; |
348 |
|
349 |
if ((numb = atoi (buf))) |
350 |
return numb; |
351 |
else |
352 |
return 1; |
353 |
} |
354 |
|
355 |
/* strtoint() - we use this to convert buf into an integer |
356 |
* equal to the coadded sum of the (lowercase) character |
357 |
* ASCII values in buf (times prepended integers). |
358 |
* Some kind of hashing. |
359 |
*/ |
360 |
int |
361 |
strtoint (const char *buf) |
362 |
{ |
363 |
const char *cp = ingred_name (buf); |
364 |
int val = 0, len = strlen (cp), mult = numb_ingred (buf); |
365 |
|
366 |
while (len) |
367 |
{ |
368 |
val += tolower (*cp); |
369 |
cp++; |
370 |
len--; |
371 |
} |
372 |
|
373 |
return val * mult; |
374 |
} |
375 |
|
376 |
artifact * |
377 |
locate_recipe_artifact (const recipe *rp, size_t idx) |
378 |
{ |
379 |
archetype *at = archetype::find (rp->arch_name [idx]); |
380 |
|
381 |
if (at) |
382 |
if (artifactlist *al = find_artifactlist (at->type)) |
383 |
for (artifact *art = al->items; art; art = art->next) |
384 |
if (art->item->name == rp->title) |
385 |
return art; |
386 |
|
387 |
return 0; |
388 |
} |
389 |
|
390 |
static recipelist * |
391 |
get_random_recipelist () |
392 |
{ |
393 |
recipelist *fl = NULL; |
394 |
int number = 0, roll = 0; |
395 |
|
396 |
/* first, determine # of recipelist we have */ |
397 |
for (fl = get_formulalist (1); fl; fl = fl->next) |
398 |
number++; |
399 |
|
400 |
/* now, randomly choose one */ |
401 |
if (number > 0) |
402 |
roll = rndm (number); |
403 |
|
404 |
fl = get_formulalist (1); |
405 |
while (roll && fl) |
406 |
{ |
407 |
if (fl->next) |
408 |
fl = fl->next; |
409 |
else |
410 |
break; |
411 |
roll--; |
412 |
} |
413 |
if (!fl) /* failed! */ |
414 |
LOG (llevError, "get_random_recipelist(): no recipelists found!\n"); |
415 |
else if (fl->total_chance == 0) |
416 |
fl = get_random_recipelist (); |
417 |
|
418 |
return fl; |
419 |
} |
420 |
|
421 |
recipe * |
422 |
get_random_recipe (recipelist * rpl) |
423 |
{ |
424 |
recipelist *fl = rpl; |
425 |
recipe *rp = NULL; |
426 |
int r = 0; |
427 |
|
428 |
/* looks like we have to choose a random one */ |
429 |
if (fl == NULL) |
430 |
if ((fl = get_random_recipelist ()) == NULL) |
431 |
return rp; |
432 |
|
433 |
if (fl->total_chance > 0) |
434 |
{ |
435 |
r = rndm (fl->total_chance); |
436 |
for (rp = fl->items; rp; rp = rp->next) |
437 |
{ |
438 |
r -= rp->chance; |
439 |
if (r < 0) |
440 |
break; |
441 |
} |
442 |
} |
443 |
return rp; |
444 |
} |
445 |
|
446 |
/** |
447 |
* Split a comma separated string list into words. |
448 |
* |
449 |
* @param str the string to split |
450 |
* |
451 |
* @param result_list pointer to return value for the newly created list; the |
452 |
* caller is responsible for freeing both *result_list and **result_list. |
453 |
* |
454 |
* @param result_size pointer to return value for the size of the newly |
455 |
* created list |
456 |
*/ |
457 |
static void |
458 |
build_stringlist (const char *str, char ***result_list, size_t * result_size) |
459 |
{ |
460 |
char *dup; |
461 |
char *p; |
462 |
size_t size; |
463 |
size_t i; |
464 |
|
465 |
dup = strdup (str); |
466 |
if (dup == NULL) |
467 |
fatal ("out of memory"); |
468 |
|
469 |
size = 0; |
470 |
for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ",")) |
471 |
size++; |
472 |
|
473 |
*result_list = (char **)malloc (size * sizeof (*result_list)); |
474 |
|
475 |
*result_size = size; |
476 |
|
477 |
for (i = 0; i < size; i++) |
478 |
{ |
479 |
(*result_list)[i] = dup; |
480 |
dup = dup + strlen (dup) + 1; |
481 |
} |
482 |
} |