… | |
… | |
282 | |
282 | |
283 | LOG (llevDebug, "done.\n"); |
283 | LOG (llevDebug, "done.\n"); |
284 | |
284 | |
285 | } |
285 | } |
286 | |
286 | |
287 | /* Borrowed (again) from the artifacts code for this */ |
|
|
288 | |
|
|
289 | void |
|
|
290 | dump_alchemy (void) |
|
|
291 | { |
|
|
292 | recipelist *fl = formulalist; |
|
|
293 | recipe *formula = NULL; |
|
|
294 | linked_char *next; |
|
|
295 | int num_ingred = 1; |
|
|
296 | |
|
|
297 | fprintf (logfile, "\n"); |
|
|
298 | while (fl) |
|
|
299 | { |
|
|
300 | fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n", |
|
|
301 | num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance); |
|
|
302 | for (formula = fl->items; formula; formula = formula->next) |
|
|
303 | { |
|
|
304 | artifact *art = NULL; |
|
|
305 | char buf[MAX_BUF]; |
|
|
306 | size_t i; |
|
|
307 | |
|
|
308 | for (i = 0; i < formula->arch_names; i++) |
|
|
309 | { |
|
|
310 | const char *string = formula->arch_name[i]; |
|
|
311 | |
|
|
312 | if (archetype::find (string) != NULL) |
|
|
313 | { |
|
|
314 | art = locate_recipe_artifact (formula, i); |
|
|
315 | if (!art && strcmp (formula->title, "NONE")) |
|
|
316 | LOG (llevError, "Formula %s has no artifact!\n", &formula->title); |
|
|
317 | else |
|
|
318 | { |
|
|
319 | if (strcmp (formula->title, "NONE")) |
|
|
320 | sprintf (buf, "%s of %s", string, &formula->title); |
|
|
321 | else |
|
|
322 | sprintf (buf, "%s", string); |
|
|
323 | fprintf (logfile, "%-30s(%d) bookchance %3d ", buf, formula->index, formula->chance); |
|
|
324 | fprintf (logfile, "skill %s", &formula->skill); |
|
|
325 | fprintf (logfile, "\n"); |
|
|
326 | if (formula->ingred != NULL) |
|
|
327 | { |
|
|
328 | int nval = 0, tval = 0; |
|
|
329 | |
|
|
330 | fprintf (logfile, "\tIngred: "); |
|
|
331 | for (next = formula->ingred; next != NULL; next = next->next) |
|
|
332 | { |
|
|
333 | if (nval != 0) |
|
|
334 | fprintf (logfile, ","); |
|
|
335 | fprintf (logfile, "%s(%d)", &next->name, (nval = strtoint (next->name))); |
|
|
336 | tval += nval; |
|
|
337 | } |
|
|
338 | fprintf (logfile, "\n"); |
|
|
339 | if (tval != formula->index) |
|
|
340 | fprintf (logfile, "WARNING:ingredient list and formula values not equal.\n"); |
|
|
341 | } |
|
|
342 | if (formula->skill != NULL) |
|
|
343 | fprintf (logfile, "\tSkill Required: %s", &formula->skill); |
|
|
344 | if (formula->cauldron != NULL) |
|
|
345 | fprintf (logfile, "\tCauldron: %s\n", &formula->cauldron); |
|
|
346 | fprintf (logfile, "\tDifficulty: %d\t Exp: %d\n", formula->diff, formula->exp); |
|
|
347 | } |
|
|
348 | } |
|
|
349 | else |
|
|
350 | LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title); |
|
|
351 | } |
|
|
352 | } |
|
|
353 | fprintf (logfile, "\n"); |
|
|
354 | fl = fl->next; |
|
|
355 | num_ingred++; |
|
|
356 | } |
|
|
357 | } |
|
|
358 | |
|
|
359 | /* Find a treasure with a matching name. The 'depth' parameter is |
287 | /* Find a treasure with a matching name. The 'depth' parameter is |
360 | * only there to prevent infinite loops in treasure lists (a list |
288 | * only there to prevent infinite loops in treasure lists (a list |
361 | * referencing another list pointing back to the first one). */ |
289 | * referencing another list pointing back to the first one). */ |
362 | archetype * |
290 | archetype * |
363 | find_treasure_by_name (const treasure *t, const char *name, int depth) |
291 | find_treasure_by_name (const treasure *t, const char *name, int depth) |
… | |
… | |
485 | |
413 | |
486 | /* failed to find any matching items -- formula should be checked */ |
414 | /* failed to find any matching items -- formula should be checked */ |
487 | return -1; |
415 | return -1; |
488 | } |
416 | } |
489 | |
417 | |
490 | /* code copied from dump_alchemy() and modified by Raphael Quinet */ |
|
|
491 | void |
|
|
492 | dump_alchemy_costs (void) |
|
|
493 | { |
|
|
494 | recipelist *fl = formulalist; |
|
|
495 | recipe *formula = NULL; |
|
|
496 | linked_char *next; |
|
|
497 | int num_ingred = 1; |
|
|
498 | int num_errors = 0; |
|
|
499 | long cost; |
|
|
500 | long tcost; |
|
|
501 | |
|
|
502 | fprintf (logfile, "\n"); |
|
|
503 | while (fl) |
|
|
504 | { |
|
|
505 | fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n", |
|
|
506 | num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance); |
|
|
507 | for (formula = fl->items; formula; formula = formula->next) |
|
|
508 | { |
|
|
509 | artifact *art = NULL; |
|
|
510 | archetype *at = NULL; |
|
|
511 | char buf[MAX_BUF]; |
|
|
512 | size_t i; |
|
|
513 | |
|
|
514 | for (i = 0; i < formula->arch_names; i++) |
|
|
515 | { |
|
|
516 | const char *string = formula->arch_name[i]; |
|
|
517 | |
|
|
518 | if ((at = archetype::find (string)) != NULL) |
|
|
519 | { |
|
|
520 | art = locate_recipe_artifact (formula, i); |
|
|
521 | if (!art && strcmp (formula->title, "NONE")) |
|
|
522 | LOG (llevError, "Formula %s has no artifact\n", &formula->title); |
|
|
523 | else |
|
|
524 | { |
|
|
525 | if (!strcmp (formula->title, "NONE")) |
|
|
526 | sprintf (buf, "%s", string); |
|
|
527 | else |
|
|
528 | sprintf (buf, "%s of %s", string, &formula->title); |
|
|
529 | fprintf (logfile, "\n%-40s bookchance %3d skill %s\n", buf, formula->chance, &(formula->skill)); |
|
|
530 | if (formula->ingred != NULL) |
|
|
531 | { |
|
|
532 | tcost = 0; |
|
|
533 | for (next = formula->ingred; next != NULL; next = next->next) |
|
|
534 | { |
|
|
535 | cost = find_ingred_cost (next->name); |
|
|
536 | if (cost < 0) |
|
|
537 | num_errors++; |
|
|
538 | fprintf (logfile, "\t%-33s%5ld\n", &next->name, cost); |
|
|
539 | if (cost < 0 || tcost < 0) |
|
|
540 | tcost = -1; |
|
|
541 | else |
|
|
542 | tcost += cost; |
|
|
543 | } |
|
|
544 | if (art != NULL && art->item != NULL) |
|
|
545 | cost = at->value * art->item->value; |
|
|
546 | else |
|
|
547 | cost = at->value; |
|
|
548 | fprintf (logfile, "\t\tBuying result costs: %5ld", cost); |
|
|
549 | if (formula->yield > 1) |
|
|
550 | { |
|
|
551 | fprintf (logfile, " to %ld (max %d items)\n", cost * formula->yield, formula->yield); |
|
|
552 | cost = cost * (formula->yield + 1L) / 2L; |
|
|
553 | } |
|
|
554 | else |
|
|
555 | fprintf (logfile, "\n"); |
|
|
556 | fprintf (logfile, "\t\tIngredients cost: %5ld\n\t\tComment: ", tcost); |
|
|
557 | if (tcost < 0) |
|
|
558 | fprintf (logfile, "Could not find some ingredients. Check the formula!\n"); |
|
|
559 | else if (tcost > cost) |
|
|
560 | fprintf (logfile, "Ingredients are much too expensive. Useless formula.\n"); |
|
|
561 | else if (tcost * 2L > cost) |
|
|
562 | fprintf (logfile, "Ingredients are too expensive.\n"); |
|
|
563 | else if (tcost * 10L < cost) |
|
|
564 | fprintf (logfile, "Ingredients are too cheap.\n"); |
|
|
565 | else |
|
|
566 | fprintf (logfile, "OK.\n"); |
|
|
567 | } |
|
|
568 | } |
|
|
569 | } |
|
|
570 | else |
|
|
571 | LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title); |
|
|
572 | } |
|
|
573 | } |
|
|
574 | fprintf (logfile, "\n"); |
|
|
575 | fl = fl->next; |
|
|
576 | num_ingred++; |
|
|
577 | } |
|
|
578 | if (num_errors > 0) |
|
|
579 | fprintf (logfile, "WARNING: %d objects required by the formulae do not exist in the game.\n", num_errors); |
|
|
580 | } |
|
|
581 | |
|
|
582 | const char * |
418 | const char * |
583 | ingred_name (const char *name) |
419 | ingred_name (const char *name) |
584 | { |
420 | { |
585 | const char *cp = name; |
421 | const char *cp = name; |
586 | |
422 | |
587 | if (atoi (cp)) |
423 | if (atoi (cp)) |
588 | cp = strchr (cp, ' ') + 1; |
424 | cp = strchr (cp, ' ') + 1; |
|
|
425 | |
589 | return cp; |
426 | return cp; |
590 | } |
427 | } |
591 | |
428 | |
592 | /* strtoint() - we use this to convert buf into an integer |
429 | /* strtoint() - we use this to convert buf into an integer |
593 | * equal to the coadded sum of the (lowercase) character |
430 | * equal to the coadded sum of the (lowercase) character |