|
|
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 | |
1 | /* Basic stuff for use with the alchemy code. Clearly some of this stuff |
24 | /* 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 |
25 | * could go into server/alchemy, but I left it here just in case it proves |
3 | * more generally useful. |
26 | * more generally useful. |
4 | * |
27 | * |
5 | * Nov 1995 - file created by b.t. thomas@astro.psu.edu |
28 | * Nov 1995 - file created by b.t. thomas@astro.psu.edu |
… | |
… | |
259 | |
282 | |
260 | LOG (llevDebug, "done.\n"); |
283 | LOG (llevDebug, "done.\n"); |
261 | |
284 | |
262 | } |
285 | } |
263 | |
286 | |
264 | /* Borrowed (again) from the artifacts code for this */ |
|
|
265 | |
|
|
266 | void |
|
|
267 | dump_alchemy (void) |
|
|
268 | { |
|
|
269 | recipelist *fl = formulalist; |
|
|
270 | recipe *formula = NULL; |
|
|
271 | linked_char *next; |
|
|
272 | int num_ingred = 1; |
|
|
273 | |
|
|
274 | fprintf (logfile, "\n"); |
|
|
275 | while (fl) |
|
|
276 | { |
|
|
277 | fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n", |
|
|
278 | num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance); |
|
|
279 | for (formula = fl->items; formula; formula = formula->next) |
|
|
280 | { |
|
|
281 | artifact *art = NULL; |
|
|
282 | char buf[MAX_BUF]; |
|
|
283 | size_t i; |
|
|
284 | |
|
|
285 | for (i = 0; i < formula->arch_names; i++) |
|
|
286 | { |
|
|
287 | const char *string = formula->arch_name[i]; |
|
|
288 | |
|
|
289 | if (archetype::find (string) != NULL) |
|
|
290 | { |
|
|
291 | art = locate_recipe_artifact (formula, i); |
|
|
292 | if (!art && strcmp (formula->title, "NONE")) |
|
|
293 | LOG (llevError, "Formula %s has no artifact!\n", &formula->title); |
|
|
294 | else |
|
|
295 | { |
|
|
296 | if (strcmp (formula->title, "NONE")) |
|
|
297 | sprintf (buf, "%s of %s", string, &formula->title); |
|
|
298 | else |
|
|
299 | sprintf (buf, "%s", string); |
|
|
300 | fprintf (logfile, "%-30s(%d) bookchance %3d ", buf, formula->index, formula->chance); |
|
|
301 | fprintf (logfile, "skill %s", &formula->skill); |
|
|
302 | fprintf (logfile, "\n"); |
|
|
303 | if (formula->ingred != NULL) |
|
|
304 | { |
|
|
305 | int nval = 0, tval = 0; |
|
|
306 | |
|
|
307 | fprintf (logfile, "\tIngred: "); |
|
|
308 | for (next = formula->ingred; next != NULL; next = next->next) |
|
|
309 | { |
|
|
310 | if (nval != 0) |
|
|
311 | fprintf (logfile, ","); |
|
|
312 | fprintf (logfile, "%s(%d)", &next->name, (nval = strtoint (next->name))); |
|
|
313 | tval += nval; |
|
|
314 | } |
|
|
315 | fprintf (logfile, "\n"); |
|
|
316 | if (tval != formula->index) |
|
|
317 | fprintf (logfile, "WARNING:ingredient list and formula values not equal.\n"); |
|
|
318 | } |
|
|
319 | if (formula->skill != NULL) |
|
|
320 | fprintf (logfile, "\tSkill Required: %s", &formula->skill); |
|
|
321 | if (formula->cauldron != NULL) |
|
|
322 | fprintf (logfile, "\tCauldron: %s\n", &formula->cauldron); |
|
|
323 | fprintf (logfile, "\tDifficulty: %d\t Exp: %d\n", formula->diff, formula->exp); |
|
|
324 | } |
|
|
325 | } |
|
|
326 | else |
|
|
327 | LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title); |
|
|
328 | } |
|
|
329 | } |
|
|
330 | fprintf (logfile, "\n"); |
|
|
331 | fl = fl->next; |
|
|
332 | num_ingred++; |
|
|
333 | } |
|
|
334 | } |
|
|
335 | |
|
|
336 | /* Find a treasure with a matching name. The 'depth' parameter is |
287 | /* Find a treasure with a matching name. The 'depth' parameter is |
337 | * only there to prevent infinite loops in treasure lists (a list |
288 | * only there to prevent infinite loops in treasure lists (a list |
338 | * referencing another list pointing back to the first one). */ |
289 | * referencing another list pointing back to the first one). */ |
339 | archetype * |
290 | archetype * |
340 | 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) |
… | |
… | |
351 | if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1)) |
302 | if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1)) |
352 | return at; |
303 | return at; |
353 | } |
304 | } |
354 | else |
305 | else |
355 | { |
306 | { |
356 | if (t->item && !strcasecmp (t->item->clone.name, name)) |
307 | if (t->item && !strcasecmp (t->item->object::name, name)) |
357 | return t->item; |
308 | return t->item; |
358 | } |
309 | } |
359 | |
310 | |
360 | if (t->next_yes) |
311 | if (t->next_yes) |
361 | if (archetype *at = find_treasure_by_name (t->next_yes, name, depth)) |
312 | if (archetype *at = find_treasure_by_name (t->next_yes, name, depth)) |
… | |
… | |
380 | * body parts that we are looking for (e.g. big_dragon and |
331 | * body parts that we are looking for (e.g. big_dragon and |
381 | * big_dragon_worthless). */ |
332 | * big_dragon_worthless). */ |
382 | long |
333 | long |
383 | find_ingred_cost (const char *name) |
334 | find_ingred_cost (const char *name) |
384 | { |
335 | { |
385 | archetype *at; |
|
|
386 | archetype *at2; |
336 | archetype *at2; |
387 | artifactlist *al; |
337 | artifactlist *al; |
388 | artifact *art; |
338 | artifact *art; |
389 | long mult; |
339 | long mult; |
390 | char *cp; |
340 | char *cp; |
… | |
… | |
403 | name++; |
353 | name++; |
404 | else |
354 | else |
405 | mult = 1; |
355 | mult = 1; |
406 | |
356 | |
407 | /* first, try to match the name of an archetype */ |
357 | /* first, try to match the name of an archetype */ |
408 | for (at = first_archetype; at != NULL; at = at->next) |
358 | for_all_archetypes (at) |
409 | { |
359 | { |
410 | if (at->clone.title != NULL) |
360 | if (at->title != NULL) |
411 | { |
361 | { |
412 | /* inefficient, but who cares? */ |
362 | /* inefficient, but who cares? */ |
413 | sprintf (part1, "%s %s", &at->clone.name, &at->clone.title); |
363 | sprintf (part1, "%s %s", &at->object::name, &at->title); |
414 | if (!strcasecmp (part1, name)) |
364 | if (!strcasecmp (part1, name)) |
415 | return mult * at->clone.value; |
365 | return mult * at->value; |
416 | } |
366 | } |
417 | if (!strcasecmp (at->clone.name, name)) |
367 | if (!strcasecmp (at->object::name, name)) |
418 | return mult * at->clone.value; |
368 | return mult * at->value; |
419 | } |
369 | } |
420 | |
370 | |
421 | /* second, try to match an artifact ("arch of something") */ |
371 | /* second, try to match an artifact ("arch of something") */ |
422 | cp = strstr (name, " of "); |
372 | cp = strstr (name, " of "); |
423 | if (cp != NULL) |
373 | if (cp != NULL) |
424 | { |
374 | { |
425 | strcpy (part1, name); |
375 | strcpy (part1, name); |
426 | part1[cp - name] = '\0'; |
376 | part1[cp - name] = '\0'; |
427 | strcpy (part2, cp + 4); |
377 | strcpy (part2, cp + 4); |
|
|
378 | |
428 | /* find the first archetype matching the first part of the name */ |
379 | /* find the first archetype matching the first part of the name */ |
429 | for (at = first_archetype; at; at = at->next) |
380 | for_all_archetypes (at) |
430 | if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL) |
381 | if (!strcasecmp (at->object::name, part1) && at->title == NULL) |
431 | break; |
|
|
432 | if (at != NULL) |
|
|
433 | { |
382 | { |
434 | /* find the first artifact derived from that archetype (same type) */ |
383 | /* find the first artifact derived from that archetype (same type) */ |
435 | for (al = first_artifactlist; al; al = al->next) |
384 | for (al = first_artifactlist; al; al = al->next) |
436 | if (al->type == at->clone.type) |
385 | if (al->type == at->type) |
437 | { |
386 | { |
438 | for (art = al->items; art; art = art->next) |
387 | for (art = al->items; art; art = art->next) |
439 | if (!strcasecmp (art->item->name, part2)) |
388 | if (!strcasecmp (art->item->name, part2)) |
440 | return mult * at->clone.value * art->item->value; |
389 | return mult * at->value * art->item->value; |
441 | } |
390 | } |
442 | } |
391 | } |
443 | } |
392 | } |
444 | |
393 | |
445 | /* third, try to match a body part ("arch's something") */ |
394 | /* third, try to match a body part ("arch's something") */ |
446 | cp = strstr (name, "'s "); |
395 | cp = strstr (name, "'s "); |
447 | if (cp) |
396 | if (cp) |
448 | { |
397 | { |
449 | strcpy (part1, name); |
398 | strcpy (part1, name); |
450 | part1[cp - name] = '\0'; |
399 | part1[cp - name] = '\0'; |
451 | strcpy (part2, cp + 3); |
400 | strcpy (part2, cp + 3); |
452 | /* examine all archetypes matching the first part of the name */ |
401 | /* examine all archetypes matching the first part of the name */ |
453 | for (at = first_archetype; at; at = at->next) |
402 | for_all_archetypes (at) |
454 | if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL) |
403 | if (!strcasecmp (at->object::name, part1) && at->title == NULL) |
455 | { |
404 | { |
456 | if (at->clone.randomitems) |
405 | if (at->randomitems) |
457 | { |
406 | { |
458 | at2 = find_treasure_by_name (at->clone.randomitems->items, part2, 0); |
407 | at2 = find_treasure_by_name (at->randomitems->items, part2, 0); |
459 | if (at2) |
408 | if (at2) |
460 | return mult * at2->clone.value * isqrt (at->clone.level * 2); |
409 | return mult * at2->value * isqrt (at->level * 2); |
461 | } |
410 | } |
462 | } |
411 | } |
463 | } |
412 | } |
464 | |
413 | |
465 | /* failed to find any matching items -- formula should be checked */ |
414 | /* failed to find any matching items -- formula should be checked */ |
466 | return -1; |
415 | return -1; |
467 | } |
416 | } |
468 | |
417 | |
469 | /* code copied from dump_alchemy() and modified by Raphael Quinet */ |
|
|
470 | void |
|
|
471 | dump_alchemy_costs (void) |
|
|
472 | { |
|
|
473 | recipelist *fl = formulalist; |
|
|
474 | recipe *formula = NULL; |
|
|
475 | linked_char *next; |
|
|
476 | int num_ingred = 1; |
|
|
477 | int num_errors = 0; |
|
|
478 | long cost; |
|
|
479 | long tcost; |
|
|
480 | |
|
|
481 | fprintf (logfile, "\n"); |
|
|
482 | while (fl) |
|
|
483 | { |
|
|
484 | fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n", |
|
|
485 | num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance); |
|
|
486 | for (formula = fl->items; formula; formula = formula->next) |
|
|
487 | { |
|
|
488 | artifact *art = NULL; |
|
|
489 | archetype *at = NULL; |
|
|
490 | char buf[MAX_BUF]; |
|
|
491 | size_t i; |
|
|
492 | |
|
|
493 | for (i = 0; i < formula->arch_names; i++) |
|
|
494 | { |
|
|
495 | const char *string = formula->arch_name[i]; |
|
|
496 | |
|
|
497 | if ((at = archetype::find (string)) != NULL) |
|
|
498 | { |
|
|
499 | art = locate_recipe_artifact (formula, i); |
|
|
500 | if (!art && strcmp (formula->title, "NONE")) |
|
|
501 | LOG (llevError, "Formula %s has no artifact\n", &formula->title); |
|
|
502 | else |
|
|
503 | { |
|
|
504 | if (!strcmp (formula->title, "NONE")) |
|
|
505 | sprintf (buf, "%s", string); |
|
|
506 | else |
|
|
507 | sprintf (buf, "%s of %s", string, &formula->title); |
|
|
508 | fprintf (logfile, "\n%-40s bookchance %3d skill %s\n", buf, formula->chance, &(formula->skill)); |
|
|
509 | if (formula->ingred != NULL) |
|
|
510 | { |
|
|
511 | tcost = 0; |
|
|
512 | for (next = formula->ingred; next != NULL; next = next->next) |
|
|
513 | { |
|
|
514 | cost = find_ingred_cost (next->name); |
|
|
515 | if (cost < 0) |
|
|
516 | num_errors++; |
|
|
517 | fprintf (logfile, "\t%-33s%5ld\n", &next->name, cost); |
|
|
518 | if (cost < 0 || tcost < 0) |
|
|
519 | tcost = -1; |
|
|
520 | else |
|
|
521 | tcost += cost; |
|
|
522 | } |
|
|
523 | if (art != NULL && art->item != NULL) |
|
|
524 | cost = at->clone.value * art->item->value; |
|
|
525 | else |
|
|
526 | cost = at->clone.value; |
|
|
527 | fprintf (logfile, "\t\tBuying result costs: %5ld", cost); |
|
|
528 | if (formula->yield > 1) |
|
|
529 | { |
|
|
530 | fprintf (logfile, " to %ld (max %d items)\n", cost * formula->yield, formula->yield); |
|
|
531 | cost = cost * (formula->yield + 1L) / 2L; |
|
|
532 | } |
|
|
533 | else |
|
|
534 | fprintf (logfile, "\n"); |
|
|
535 | fprintf (logfile, "\t\tIngredients cost: %5ld\n\t\tComment: ", tcost); |
|
|
536 | if (tcost < 0) |
|
|
537 | fprintf (logfile, "Could not find some ingredients. Check the formula!\n"); |
|
|
538 | else if (tcost > cost) |
|
|
539 | fprintf (logfile, "Ingredients are much too expensive. Useless formula.\n"); |
|
|
540 | else if (tcost * 2L > cost) |
|
|
541 | fprintf (logfile, "Ingredients are too expensive.\n"); |
|
|
542 | else if (tcost * 10L < cost) |
|
|
543 | fprintf (logfile, "Ingredients are too cheap.\n"); |
|
|
544 | else |
|
|
545 | fprintf (logfile, "OK.\n"); |
|
|
546 | } |
|
|
547 | } |
|
|
548 | } |
|
|
549 | else |
|
|
550 | LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title); |
|
|
551 | } |
|
|
552 | } |
|
|
553 | fprintf (logfile, "\n"); |
|
|
554 | fl = fl->next; |
|
|
555 | num_ingred++; |
|
|
556 | } |
|
|
557 | if (num_errors > 0) |
|
|
558 | fprintf (logfile, "WARNING: %d objects required by the formulae do not exist in the game.\n", num_errors); |
|
|
559 | } |
|
|
560 | |
|
|
561 | const char * |
418 | const char * |
562 | ingred_name (const char *name) |
419 | ingred_name (const char *name) |
563 | { |
420 | { |
564 | const char *cp = name; |
421 | const char *cp = name; |
565 | |
422 | |
566 | if (atoi (cp)) |
423 | if (atoi (cp)) |
567 | cp = strchr (cp, ' ') + 1; |
424 | cp = strchr (cp, ' ') + 1; |
|
|
425 | |
568 | return cp; |
426 | return cp; |
569 | } |
427 | } |
570 | |
428 | |
571 | /* strtoint() - we use this to convert buf into an integer |
429 | /* strtoint() - we use this to convert buf into an integer |
572 | * equal to the coadded sum of the (lowercase) character |
430 | * equal to the coadded sum of the (lowercase) character |
… | |
… | |
592 | locate_recipe_artifact (const recipe *rp, size_t idx) |
450 | locate_recipe_artifact (const recipe *rp, size_t idx) |
593 | { |
451 | { |
594 | archetype *at = archetype::find (rp->arch_name [idx]); |
452 | archetype *at = archetype::find (rp->arch_name [idx]); |
595 | |
453 | |
596 | if (at) |
454 | if (at) |
597 | if (artifactlist *al = find_artifactlist (at->clone.type)) |
455 | if (artifactlist *al = find_artifactlist (at->type)) |
598 | for (artifact *art = al->items; art; art = art->next) |
456 | for (artifact *art = al->items; art; art = art->next) |
599 | if (art->item->name == rp->title) |
457 | if (art->item->name == rp->title) |
600 | return art; |
458 | return art; |
601 | |
459 | |
602 | return 0; |
460 | return 0; |