| 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 <global.h> |
| 22 |
#include <object.h> |
| 23 |
#include <ctype.h> |
| 24 |
|
| 25 |
static void build_stringlist (const char *str, char ***result_list, size_t * result_size); |
| 26 |
|
| 27 |
static recipelist *formulalist; |
| 28 |
|
| 29 |
static recipelist * |
| 30 |
init_recipelist (void) |
| 31 |
{ |
| 32 |
recipelist *tl = new recipelist; |
| 33 |
|
| 34 |
tl->total_chance = 0; |
| 35 |
tl->number = 0; |
| 36 |
tl->items = NULL; |
| 37 |
tl->next = NULL; |
| 38 |
return tl; |
| 39 |
} |
| 40 |
|
| 41 |
static recipe * |
| 42 |
get_empty_formula (void) |
| 43 |
{ |
| 44 |
recipe *t = new recipe; |
| 45 |
|
| 46 |
t->chance = 0; |
| 47 |
t->index = 0; |
| 48 |
t->transmute = 0; |
| 49 |
t->yield = 0; |
| 50 |
t->diff = 0; |
| 51 |
t->exp = 0; |
| 52 |
t->keycode = 0; |
| 53 |
t->title = NULL; |
| 54 |
t->arch_names = 0; |
| 55 |
t->arch_name = NULL; |
| 56 |
t->skill = NULL; |
| 57 |
t->cauldron = NULL; |
| 58 |
t->ingred = NULL; |
| 59 |
t->next = NULL; |
| 60 |
return t; |
| 61 |
} |
| 62 |
|
| 63 |
/* get_formulalist() - returns pointer to the formula list */ |
| 64 |
|
| 65 |
recipelist * |
| 66 |
get_formulalist (int i) |
| 67 |
{ |
| 68 |
recipelist *fl = formulalist; |
| 69 |
int number = i; |
| 70 |
|
| 71 |
while (fl && number > 1) |
| 72 |
{ |
| 73 |
if (!(fl = fl->next)) |
| 74 |
break; |
| 75 |
number--; |
| 76 |
} |
| 77 |
return fl; |
| 78 |
} |
| 79 |
|
| 80 |
/* check_recipe() - makes sure we actually have the requested artifact |
| 81 |
* and archetype. */ |
| 82 |
|
| 83 |
static int |
| 84 |
check_recipe (const recipe *rp) |
| 85 |
{ |
| 86 |
size_t i; |
| 87 |
int result; |
| 88 |
|
| 89 |
result = 1; |
| 90 |
for (i = 0; i < rp->arch_names; i++) |
| 91 |
{ |
| 92 |
if (archetype::find (rp->arch_name[i]) != NULL) |
| 93 |
{ |
| 94 |
artifact *art = locate_recipe_artifact (rp, i); |
| 95 |
|
| 96 |
if (!art && strcmp (rp->title, "NONE") != 0) |
| 97 |
{ |
| 98 |
LOG (llevError, "\nWARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title); |
| 99 |
result = 0; |
| 100 |
} |
| 101 |
} |
| 102 |
else |
| 103 |
{ |
| 104 |
LOG (llevError, "\nWARNING: Can't find archetype %s for formula %s\n", rp->arch_name[i], &rp->title); |
| 105 |
result = 0; |
| 106 |
} |
| 107 |
} |
| 108 |
|
| 109 |
return result; |
| 110 |
} |
| 111 |
|
| 112 |
|
| 113 |
/* |
| 114 |
* init_formulae() - Builds up the lists of formula from the file in |
| 115 |
* the libdir. -b.t. |
| 116 |
*/ |
| 117 |
|
| 118 |
void |
| 119 |
init_formulae (void) |
| 120 |
{ |
| 121 |
static int has_been_done = 0; |
| 122 |
FILE *fp; |
| 123 |
char filename[MAX_BUF], buf[MAX_BUF], *cp, *next; |
| 124 |
recipe *formula = NULL; |
| 125 |
recipelist *fl = init_recipelist (); |
| 126 |
linked_char *tmp; |
| 127 |
int value, comp; |
| 128 |
|
| 129 |
if (!formulalist) |
| 130 |
formulalist = fl; |
| 131 |
|
| 132 |
if (has_been_done) |
| 133 |
return; |
| 134 |
else |
| 135 |
has_been_done = 1; |
| 136 |
|
| 137 |
sprintf (filename, "%s/formulae", settings.datadir); |
| 138 |
LOG (llevDebug, "Reading alchemical formulae from %s...", filename); |
| 139 |
if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL) |
| 140 |
{ |
| 141 |
LOG (llevError, "Can't open %s.\n", filename); |
| 142 |
return; |
| 143 |
} |
| 144 |
|
| 145 |
while (fgets (buf, MAX_BUF, fp) != NULL) |
| 146 |
{ |
| 147 |
if (*buf == '#') |
| 148 |
continue; |
| 149 |
if ((cp = strchr (buf, '\n')) != NULL) |
| 150 |
*cp = '\0'; |
| 151 |
cp = buf; |
| 152 |
while (*cp == ' ') /* Skip blanks */ |
| 153 |
cp++; |
| 154 |
|
| 155 |
if (!strncmp (cp, "Object", 6)) |
| 156 |
{ |
| 157 |
formula = get_empty_formula (); |
| 158 |
formula->title = strchr (cp, ' ') + 1; |
| 159 |
} |
| 160 |
else if (!strncmp (cp, "keycode", 7)) |
| 161 |
{ |
| 162 |
formula->keycode = strchr (cp, ' ') + 1; |
| 163 |
} |
| 164 |
else if (sscanf (cp, "trans %d", &value)) |
| 165 |
{ |
| 166 |
formula->transmute = (uint16) value; |
| 167 |
} |
| 168 |
else if (sscanf (cp, "yield %d", &value)) |
| 169 |
{ |
| 170 |
formula->yield = (uint16) value; |
| 171 |
} |
| 172 |
else if (sscanf (cp, "chance %d", &value)) |
| 173 |
{ |
| 174 |
formula->chance = (uint16) value; |
| 175 |
} |
| 176 |
else if (sscanf (cp, "exp %d", &value)) |
| 177 |
{ |
| 178 |
formula->exp = (uint16) value; |
| 179 |
} |
| 180 |
else if (sscanf (cp, "diff %d", &value)) |
| 181 |
{ |
| 182 |
formula->diff = (uint16) value; |
| 183 |
} |
| 184 |
else if (!strncmp (cp, "ingred", 6)) |
| 185 |
{ |
| 186 |
int numb_ingred = 1; |
| 187 |
|
| 188 |
cp = strchr (cp, ' ') + 1; |
| 189 |
do |
| 190 |
{ |
| 191 |
if ((next = strchr (cp, ',')) != NULL) |
| 192 |
{ |
| 193 |
*(next++) = '\0'; |
| 194 |
numb_ingred++; |
| 195 |
} |
| 196 |
tmp = new linked_char; |
| 197 |
|
| 198 |
tmp->name = cp; |
| 199 |
tmp->next = formula->ingred; |
| 200 |
formula->ingred = tmp; |
| 201 |
/* each ingredient's ASCII value is coadded. Later on this |
| 202 |
* value will be used allow us to search the formula lists |
| 203 |
* quickly for the right recipe. |
| 204 |
*/ |
| 205 |
formula->index += strtoint (cp); |
| 206 |
} |
| 207 |
while ((cp = next) != NULL); |
| 208 |
/* now find the correct (# of ingred ordered) formulalist */ |
| 209 |
fl = formulalist; |
| 210 |
while (numb_ingred != 1) |
| 211 |
{ |
| 212 |
if (!fl->next) |
| 213 |
fl->next = init_recipelist (); |
| 214 |
fl = fl->next; |
| 215 |
numb_ingred--; |
| 216 |
} |
| 217 |
fl->total_chance += formula->chance; |
| 218 |
fl->number++; |
| 219 |
formula->next = fl->items; |
| 220 |
fl->items = formula; |
| 221 |
} |
| 222 |
else if (!strncmp (cp, "arch", 4)) |
| 223 |
{ |
| 224 |
build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names); |
| 225 |
check_recipe (formula); |
| 226 |
} |
| 227 |
else if (!strncmp (cp, "skill", 5)) |
| 228 |
{ |
| 229 |
formula->skill = strchr (cp, ' ') + 1; |
| 230 |
} |
| 231 |
else if (!strncmp (cp, "cauldron", 8)) |
| 232 |
{ |
| 233 |
formula->cauldron = strchr (cp, ' ') + 1; |
| 234 |
} |
| 235 |
else |
| 236 |
LOG (llevError, "Unknown input in file %s: %s\n", filename, buf); |
| 237 |
} |
| 238 |
LOG (llevDebug, "done.\n"); |
| 239 |
close_and_delete (fp, comp); |
| 240 |
/* Lastly, lets check for problems in formula we got */ |
| 241 |
check_formulae (); |
| 242 |
} |
| 243 |
|
| 244 |
/* check_formulae()- since we are doing a squential search on the |
| 245 |
* formulae lists now, we have to be carefull that we dont have 2 |
| 246 |
* formula with the exact same index value. Under the new nbatches |
| 247 |
* code, it is possible to have multiples of ingredients in a cauldron |
| 248 |
* which could result in an index formula mismatch. We *don't* check for |
| 249 |
* that possibility here. -b.t. |
| 250 |
*/ |
| 251 |
void |
| 252 |
check_formulae (void) |
| 253 |
{ |
| 254 |
recipelist *fl; |
| 255 |
recipe *check, *formula; |
| 256 |
int numb = 1; |
| 257 |
|
| 258 |
LOG (llevDebug, "Checking formulae lists..."); |
| 259 |
|
| 260 |
for (fl = formulalist; fl != NULL; fl = fl->next) |
| 261 |
{ |
| 262 |
for (formula = fl->items; formula != NULL; formula = formula->next) |
| 263 |
for (check = formula->next; check != NULL; check = check->next) |
| 264 |
if (check->index == formula->index) |
| 265 |
{ |
| 266 |
LOG (llevError, " ERROR: On %d ingred list: ", numb); |
| 267 |
LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n", |
| 268 |
formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index); |
| 269 |
} |
| 270 |
numb++; |
| 271 |
} |
| 272 |
|
| 273 |
LOG (llevDebug, "done.\n"); |
| 274 |
|
| 275 |
} |
| 276 |
|
| 277 |
/* Borrowed (again) from the artifacts code for this */ |
| 278 |
|
| 279 |
void |
| 280 |
dump_alchemy (void) |
| 281 |
{ |
| 282 |
recipelist *fl = formulalist; |
| 283 |
recipe *formula = NULL; |
| 284 |
linked_char *next; |
| 285 |
int num_ingred = 1; |
| 286 |
|
| 287 |
fprintf (logfile, "\n"); |
| 288 |
while (fl) |
| 289 |
{ |
| 290 |
fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n", |
| 291 |
num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance); |
| 292 |
for (formula = fl->items; formula != NULL; formula = formula->next) |
| 293 |
{ |
| 294 |
artifact *art = NULL; |
| 295 |
char buf[MAX_BUF]; |
| 296 |
size_t i; |
| 297 |
|
| 298 |
for (i = 0; i < formula->arch_names; i++) |
| 299 |
{ |
| 300 |
const char *string = formula->arch_name[i]; |
| 301 |
|
| 302 |
if (archetype::find (string) != NULL) |
| 303 |
{ |
| 304 |
art = locate_recipe_artifact (formula, i); |
| 305 |
if (!art && strcmp (formula->title, "NONE")) |
| 306 |
LOG (llevError, "Formula %s has no artifact\n", &formula->title); |
| 307 |
else |
| 308 |
{ |
| 309 |
if (strcmp (formula->title, "NONE")) |
| 310 |
sprintf (buf, "%s of %s", string, &formula->title); |
| 311 |
else |
| 312 |
sprintf (buf, "%s", string); |
| 313 |
fprintf (logfile, "%-30s(%d) bookchance %3d ", buf, formula->index, formula->chance); |
| 314 |
fprintf (logfile, "skill %s", &formula->skill); |
| 315 |
fprintf (logfile, "\n"); |
| 316 |
if (formula->ingred != NULL) |
| 317 |
{ |
| 318 |
int nval = 0, tval = 0; |
| 319 |
|
| 320 |
fprintf (logfile, "\tIngred: "); |
| 321 |
for (next = formula->ingred; next != NULL; next = next->next) |
| 322 |
{ |
| 323 |
if (nval != 0) |
| 324 |
fprintf (logfile, ","); |
| 325 |
fprintf (logfile, "%s(%d)", &next->name, (nval = strtoint (next->name))); |
| 326 |
tval += nval; |
| 327 |
} |
| 328 |
fprintf (logfile, "\n"); |
| 329 |
if (tval != formula->index) |
| 330 |
fprintf (logfile, "WARNING:ingredient list and formula values not equal.\n"); |
| 331 |
} |
| 332 |
if (formula->skill != NULL) |
| 333 |
fprintf (logfile, "\tSkill Required: %s", &formula->skill); |
| 334 |
if (formula->cauldron != NULL) |
| 335 |
fprintf (logfile, "\tCauldron: %s\n", &formula->cauldron); |
| 336 |
fprintf (logfile, "\tDifficulty: %d\t Exp: %d\n", formula->diff, formula->exp); |
| 337 |
} |
| 338 |
} |
| 339 |
else |
| 340 |
LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title); |
| 341 |
} |
| 342 |
} |
| 343 |
fprintf (logfile, "\n"); |
| 344 |
fl = fl->next; |
| 345 |
num_ingred++; |
| 346 |
} |
| 347 |
} |
| 348 |
|
| 349 |
/* Find a treasure with a matching name. The 'depth' parameter is |
| 350 |
* only there to prevent infinite loops in treasure lists (a list |
| 351 |
* referencing another list pointing back to the first one). */ |
| 352 |
archetype * |
| 353 |
find_treasure_by_name (const treasure *t, const char *name, int depth) |
| 354 |
{ |
| 355 |
treasurelist *tl; |
| 356 |
archetype *at; |
| 357 |
|
| 358 |
if (depth > 10) |
| 359 |
return 0; |
| 360 |
|
| 361 |
while (t) |
| 362 |
{ |
| 363 |
if (t->name) |
| 364 |
{ |
| 365 |
tl = find_treasurelist (t->name); |
| 366 |
|
| 367 |
if (tl) |
| 368 |
{ |
| 369 |
at = find_treasure_by_name (tl->items, name, depth + 1); |
| 370 |
|
| 371 |
if (at) |
| 372 |
return at; |
| 373 |
} |
| 374 |
} |
| 375 |
else |
| 376 |
{ |
| 377 |
if (!strcasecmp (t->item->clone.name, name)) |
| 378 |
return t->item; |
| 379 |
} |
| 380 |
|
| 381 |
if (t->next_yes) |
| 382 |
{ |
| 383 |
at = find_treasure_by_name (t->next_yes, name, depth); |
| 384 |
if (at) |
| 385 |
return at; |
| 386 |
} |
| 387 |
|
| 388 |
if (t->next_no) |
| 389 |
{ |
| 390 |
at = find_treasure_by_name (t->next_no, name, depth); |
| 391 |
if (at) |
| 392 |
return at; |
| 393 |
} |
| 394 |
t = t->next; |
| 395 |
} |
| 396 |
return 0; |
| 397 |
} |
| 398 |
|
| 399 |
/* If several archetypes have the same name, the value of the first |
| 400 |
* one with that name will be returned. This happens for the |
| 401 |
* mushrooms (mushroom_1, mushroom_2 and mushroom_3). For the |
| 402 |
* monsters' body parts, there may be several monsters with the same |
| 403 |
* name. This is not a problem if these monsters have the same level |
| 404 |
* (e.g. sage & c_sage) or if only one of the monsters generates the |
| 405 |
* body parts that we are looking for (e.g. big_dragon and |
| 406 |
* big_dragon_worthless). */ |
| 407 |
long |
| 408 |
find_ingred_cost (const char *name) |
| 409 |
{ |
| 410 |
archetype *at; |
| 411 |
archetype *at2; |
| 412 |
artifactlist *al; |
| 413 |
artifact *art; |
| 414 |
long mult; |
| 415 |
char *cp; |
| 416 |
char part1[100]; |
| 417 |
char part2[100]; |
| 418 |
|
| 419 |
/* same as atoi(), but skip number */ |
| 420 |
mult = 0; |
| 421 |
while (isdigit (*name)) |
| 422 |
{ |
| 423 |
mult = 10 * mult + (*name - '0'); |
| 424 |
name++; |
| 425 |
} |
| 426 |
if (mult > 0) |
| 427 |
name++; |
| 428 |
else |
| 429 |
mult = 1; |
| 430 |
/* first, try to match the name of an archetype */ |
| 431 |
for (at = first_archetype; at != NULL; at = at->next) |
| 432 |
{ |
| 433 |
if (at->clone.title != NULL) |
| 434 |
{ |
| 435 |
/* inefficient, but who cares? */ |
| 436 |
sprintf (part1, "%s %s", &at->clone.name, &at->clone.title); |
| 437 |
if (!strcasecmp (part1, name)) |
| 438 |
return mult * at->clone.value; |
| 439 |
} |
| 440 |
if (!strcasecmp (at->clone.name, name)) |
| 441 |
return mult * at->clone.value; |
| 442 |
} |
| 443 |
/* second, try to match an artifact ("arch of something") */ |
| 444 |
cp = strstr (name, " of "); |
| 445 |
if (cp != NULL) |
| 446 |
{ |
| 447 |
strcpy (part1, name); |
| 448 |
part1[cp - name] = '\0'; |
| 449 |
strcpy (part2, cp + 4); |
| 450 |
/* find the first archetype matching the first part of the name */ |
| 451 |
for (at = first_archetype; at != NULL; at = at->next) |
| 452 |
if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL) |
| 453 |
break; |
| 454 |
if (at != NULL) |
| 455 |
{ |
| 456 |
/* find the first artifact derived from that archetype (same type) */ |
| 457 |
for (al = first_artifactlist; al != NULL; al = al->next) |
| 458 |
if (al->type == at->clone.type) |
| 459 |
{ |
| 460 |
for (art = al->items; art != NULL; art = art->next) |
| 461 |
if (!strcasecmp (art->item->name, part2)) |
| 462 |
return mult * at->clone.value * art->item->value; |
| 463 |
} |
| 464 |
} |
| 465 |
} |
| 466 |
/* third, try to match a body part ("arch's something") */ |
| 467 |
cp = strstr (name, "'s "); |
| 468 |
if (cp != NULL) |
| 469 |
{ |
| 470 |
strcpy (part1, name); |
| 471 |
part1[cp - name] = '\0'; |
| 472 |
strcpy (part2, cp + 3); |
| 473 |
/* examine all archetypes matching the first part of the name */ |
| 474 |
for (at = first_archetype; at != NULL; at = at->next) |
| 475 |
if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL) |
| 476 |
{ |
| 477 |
if (at->clone.randomitems != NULL) |
| 478 |
{ |
| 479 |
at2 = find_treasure_by_name (at->clone.randomitems->items, part2, 0); |
| 480 |
if (at2) |
| 481 |
return mult * at2->clone.value * isqrt (at->clone.level * 2); |
| 482 |
} |
| 483 |
} |
| 484 |
} |
| 485 |
/* failed to find any matching items -- formula should be checked */ |
| 486 |
return -1; |
| 487 |
} |
| 488 |
|
| 489 |
/* code copied from dump_alchemy() and modified by Raphael Quinet */ |
| 490 |
void |
| 491 |
dump_alchemy_costs (void) |
| 492 |
{ |
| 493 |
recipelist *fl = formulalist; |
| 494 |
recipe *formula = NULL; |
| 495 |
linked_char *next; |
| 496 |
int num_ingred = 1; |
| 497 |
int num_errors = 0; |
| 498 |
long cost; |
| 499 |
long tcost; |
| 500 |
|
| 501 |
fprintf (logfile, "\n"); |
| 502 |
while (fl) |
| 503 |
{ |
| 504 |
fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n", |
| 505 |
num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance); |
| 506 |
for (formula = fl->items; formula != NULL; formula = formula->next) |
| 507 |
{ |
| 508 |
artifact *art = NULL; |
| 509 |
archetype *at = NULL; |
| 510 |
char buf[MAX_BUF]; |
| 511 |
size_t i; |
| 512 |
|
| 513 |
for (i = 0; i < formula->arch_names; i++) |
| 514 |
{ |
| 515 |
const char *string = formula->arch_name[i]; |
| 516 |
|
| 517 |
if ((at = archetype::find (string)) != NULL) |
| 518 |
{ |
| 519 |
art = locate_recipe_artifact (formula, i); |
| 520 |
if (!art && strcmp (formula->title, "NONE")) |
| 521 |
LOG (llevError, "Formula %s has no artifact\n", &formula->title); |
| 522 |
else |
| 523 |
{ |
| 524 |
if (!strcmp (formula->title, "NONE")) |
| 525 |
sprintf (buf, "%s", string); |
| 526 |
else |
| 527 |
sprintf (buf, "%s of %s", string, &formula->title); |
| 528 |
fprintf (logfile, "\n%-40s bookchance %3d skill %s\n", buf, formula->chance, &(formula->skill)); |
| 529 |
if (formula->ingred != NULL) |
| 530 |
{ |
| 531 |
tcost = 0; |
| 532 |
for (next = formula->ingred; next != NULL; next = next->next) |
| 533 |
{ |
| 534 |
cost = find_ingred_cost (next->name); |
| 535 |
if (cost < 0) |
| 536 |
num_errors++; |
| 537 |
fprintf (logfile, "\t%-33s%5ld\n", &next->name, cost); |
| 538 |
if (cost < 0 || tcost < 0) |
| 539 |
tcost = -1; |
| 540 |
else |
| 541 |
tcost += cost; |
| 542 |
} |
| 543 |
if (art != NULL && art->item != NULL) |
| 544 |
cost = at->clone.value * art->item->value; |
| 545 |
else |
| 546 |
cost = at->clone.value; |
| 547 |
fprintf (logfile, "\t\tBuying result costs: %5ld", cost); |
| 548 |
if (formula->yield > 1) |
| 549 |
{ |
| 550 |
fprintf (logfile, " to %ld (max %d items)\n", cost * formula->yield, formula->yield); |
| 551 |
cost = cost * (formula->yield + 1L) / 2L; |
| 552 |
} |
| 553 |
else |
| 554 |
fprintf (logfile, "\n"); |
| 555 |
fprintf (logfile, "\t\tIngredients cost: %5ld\n\t\tComment: ", tcost); |
| 556 |
if (tcost < 0) |
| 557 |
fprintf (logfile, "Could not find some ingredients. Check the formula!\n"); |
| 558 |
else if (tcost > cost) |
| 559 |
fprintf (logfile, "Ingredients are much too expensive. Useless formula.\n"); |
| 560 |
else if (tcost * 2L > cost) |
| 561 |
fprintf (logfile, "Ingredients are too expensive.\n"); |
| 562 |
else if (tcost * 10L < cost) |
| 563 |
fprintf (logfile, "Ingredients are too cheap.\n"); |
| 564 |
else |
| 565 |
fprintf (logfile, "OK.\n"); |
| 566 |
} |
| 567 |
} |
| 568 |
} |
| 569 |
else |
| 570 |
LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title); |
| 571 |
} |
| 572 |
} |
| 573 |
fprintf (logfile, "\n"); |
| 574 |
fl = fl->next; |
| 575 |
num_ingred++; |
| 576 |
} |
| 577 |
if (num_errors > 0) |
| 578 |
fprintf (logfile, "WARNING: %d objects required by the formulae do not exist in the game.\n", num_errors); |
| 579 |
} |
| 580 |
|
| 581 |
const char * |
| 582 |
ingred_name (const char *name) |
| 583 |
{ |
| 584 |
const char *cp = name; |
| 585 |
|
| 586 |
if (atoi (cp)) |
| 587 |
cp = strchr (cp, ' ') + 1; |
| 588 |
return cp; |
| 589 |
} |
| 590 |
|
| 591 |
/* strtoint() - we use this to convert buf into an integer |
| 592 |
* equal to the coadded sum of the (lowercase) character |
| 593 |
* ASCII values in buf (times prepended integers). |
| 594 |
*/ |
| 595 |
|
| 596 |
int |
| 597 |
strtoint (const char *buf) |
| 598 |
{ |
| 599 |
const char *cp = ingred_name (buf); |
| 600 |
int val = 0, len = strlen (cp), mult = numb_ingred (buf); |
| 601 |
|
| 602 |
while (len) |
| 603 |
{ |
| 604 |
val += tolower (*cp); |
| 605 |
cp++; |
| 606 |
len--; |
| 607 |
} |
| 608 |
return val * mult; |
| 609 |
} |
| 610 |
|
| 611 |
artifact * |
| 612 |
locate_recipe_artifact (const recipe *rp, size_t idx) |
| 613 |
{ |
| 614 |
object *item = get_archetype (rp->arch_name[idx]); |
| 615 |
artifactlist *at = NULL; |
| 616 |
artifact *art = NULL; |
| 617 |
|
| 618 |
if (!item) |
| 619 |
return (artifact *) NULL; |
| 620 |
|
| 621 |
if ((at = find_artifactlist (item->type))) |
| 622 |
for (art = at->items; art; art = art->next) |
| 623 |
if (!strcmp (art->item->name, rp->title)) |
| 624 |
break; |
| 625 |
|
| 626 |
item->destroy (); |
| 627 |
|
| 628 |
return art; |
| 629 |
} |
| 630 |
|
| 631 |
int |
| 632 |
numb_ingred (const char *buf) |
| 633 |
{ |
| 634 |
int numb; |
| 635 |
|
| 636 |
if ((numb = atoi (buf))) |
| 637 |
return numb; |
| 638 |
else |
| 639 |
return 1; |
| 640 |
} |
| 641 |
|
| 642 |
recipelist * |
| 643 |
get_random_recipelist (void) |
| 644 |
{ |
| 645 |
recipelist *fl = NULL; |
| 646 |
int number = 0, roll = 0; |
| 647 |
|
| 648 |
/* first, determine # of recipelist we have */ |
| 649 |
for (fl = get_formulalist (1); fl; fl = fl->next) |
| 650 |
number++; |
| 651 |
|
| 652 |
/* now, randomly choose one */ |
| 653 |
if (number > 0) |
| 654 |
roll = RANDOM () % number; |
| 655 |
|
| 656 |
fl = get_formulalist (1); |
| 657 |
while (roll && fl) |
| 658 |
{ |
| 659 |
if (fl->next) |
| 660 |
fl = fl->next; |
| 661 |
else |
| 662 |
break; |
| 663 |
roll--; |
| 664 |
} |
| 665 |
if (!fl) /* failed! */ |
| 666 |
LOG (llevError, "get_random_recipelist(): no recipelists found!\n"); |
| 667 |
else if (fl->total_chance == 0) |
| 668 |
fl = get_random_recipelist (); |
| 669 |
|
| 670 |
return fl; |
| 671 |
} |
| 672 |
|
| 673 |
recipe * |
| 674 |
get_random_recipe (recipelist * rpl) |
| 675 |
{ |
| 676 |
recipelist *fl = rpl; |
| 677 |
recipe *rp = NULL; |
| 678 |
int r = 0; |
| 679 |
|
| 680 |
/* looks like we have to choose a random one */ |
| 681 |
if (fl == NULL) |
| 682 |
if ((fl = get_random_recipelist ()) == NULL) |
| 683 |
return rp; |
| 684 |
|
| 685 |
if (fl->total_chance > 0) |
| 686 |
{ |
| 687 |
r = RANDOM () % fl->total_chance; |
| 688 |
for (rp = fl->items; rp; rp = rp->next) |
| 689 |
{ |
| 690 |
r -= rp->chance; |
| 691 |
if (r < 0) |
| 692 |
break; |
| 693 |
} |
| 694 |
} |
| 695 |
return rp; |
| 696 |
} |
| 697 |
|
| 698 |
void |
| 699 |
free_all_recipes (void) |
| 700 |
{ |
| 701 |
recipelist *fl = formulalist, *flnext; |
| 702 |
recipe *formula = NULL, *next; |
| 703 |
linked_char *lchar, *charnext; |
| 704 |
|
| 705 |
LOG (llevDebug, "Freeing all the recipes\n"); |
| 706 |
for (fl = formulalist; fl != NULL; fl = flnext) |
| 707 |
{ |
| 708 |
flnext = fl->next; |
| 709 |
|
| 710 |
for (formula = fl->items; formula != NULL; formula = next) |
| 711 |
{ |
| 712 |
next = formula->next; |
| 713 |
|
| 714 |
free (formula->arch_name[0]); |
| 715 |
free (formula->arch_name); |
| 716 |
|
| 717 |
for (lchar = formula->ingred; lchar; lchar = charnext) |
| 718 |
{ |
| 719 |
charnext = lchar->next; |
| 720 |
delete lchar; |
| 721 |
} |
| 722 |
delete formula; |
| 723 |
} |
| 724 |
|
| 725 |
delete fl; |
| 726 |
} |
| 727 |
} |
| 728 |
|
| 729 |
/** |
| 730 |
* Split a comma separated string list into words. |
| 731 |
* |
| 732 |
* @param str the string to split |
| 733 |
* |
| 734 |
* @param result_list pointer to return value for the newly created list; the |
| 735 |
* caller is responsible for freeing both *result_list and **result_list. |
| 736 |
* |
| 737 |
* @param result_size pointer to return value for the size of the newly |
| 738 |
* created list |
| 739 |
*/ |
| 740 |
static void |
| 741 |
build_stringlist (const char *str, char ***result_list, size_t * result_size) |
| 742 |
{ |
| 743 |
char *dup; |
| 744 |
char *p; |
| 745 |
size_t size; |
| 746 |
size_t i; |
| 747 |
|
| 748 |
dup = strdup_local (str); |
| 749 |
if (dup == NULL) |
| 750 |
fatal (OUT_OF_MEMORY); |
| 751 |
|
| 752 |
size = 0; |
| 753 |
for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ",")) |
| 754 |
size++; |
| 755 |
|
| 756 |
*result_list = (char **) malloc (size * sizeof (*result_list)); |
| 757 |
|
| 758 |
*result_size = size; |
| 759 |
|
| 760 |
for (i = 0; i < size; i++) |
| 761 |
{ |
| 762 |
(*result_list)[i] = dup; |
| 763 |
dup = dup + strlen (dup) + 1; |
| 764 |
} |
| 765 |
} |
