ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/recipe.C
(Generate patch)

Comparing deliantra/server/common/recipe.C (file contents):
Revision 1.20 by root, Thu May 17 21:32:08 2007 UTC vs.
Revision 1.32 by root, Fri Nov 6 13:31:47 2009 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25/* Basic stuff for use with the alchemy code. Clearly some of this stuff 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 26 * could go into server/alchemy, but I left it here just in case it proves
27 * more generally useful. 27 * more generally useful.
… …
111 size_t i; 111 size_t i;
112 int result = 1; 112 int result = 1;
113 113
114 for (i = 0; i < rp->arch_names; i++) 114 for (i = 0; i < rp->arch_names; i++)
115 { 115 {
116 if (archetype::find (rp->arch_name[i]) != NULL) 116 if (archetype::find (rp->arch_name[i]))
117 { 117 {
118 artifact *art = locate_recipe_artifact (rp, i); 118 artifact *art = locate_recipe_artifact (rp, i);
119 119
120 if (!art && strcmp (rp->title, "NONE") != 0) 120 if (!art && rp->title != shstr_NONE)
121 { 121 {
122 LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title); 122 LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title);
123 result = 0; 123 result = 0;
124 } 124 }
125 } 125 }
… …
129 result = 0; 129 result = 0;
130 } 130 }
131 } 131 }
132 132
133 return result; 133 return result;
134}
135
136/* check_formulae()- since we are doing a squential search on the
137 * formulae lists now, we have to be carefull that we dont have 2
138 * formula with the exact same index value. Under the new nbatches
139 * code, it is possible to have multiples of ingredients in a cauldron
140 * which could result in an index formula mismatch. We *don't* check for
141 * that possibility here. -b.t.
142 */
143static void
144check_formulae (void)
145{
146 recipelist *fl;
147 recipe *check, *formula;
148 int numb = 1;
149
150 LOG (llevDebug, "Checking formulae lists...\n");
151
152 for (fl = formulalist; fl; fl = fl->next)
153 {
154 for (formula = fl->items; formula; formula = formula->next)
155 for (check = formula->next; check; check = check->next)
156 if (check->index == formula->index)
157 {
158 LOG (llevError, " ERROR: On %d ingred list: ", numb);
159 LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n",
160 formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index);
161 }
162 numb++;
163 }
164
165 LOG (llevDebug, "done.\n");
166
134} 167}
135 168
136/* 169/*
137 * init_formulae() - Builds up the lists of formula from the file in 170 * init_formulae() - Builds up the lists of formula from the file in
138 * the libdir. -b.t. 171 * the libdir. -b.t.
… …
250 close_and_delete (fp, comp); 283 close_and_delete (fp, comp);
251 /* Lastly, lets check for problems in formula we got */ 284 /* Lastly, lets check for problems in formula we got */
252 check_formulae (); 285 check_formulae ();
253} 286}
254 287
255/* check_formulae()- since we are doing a squential search on the
256 * formulae lists now, we have to be carefull that we dont have 2
257 * formula with the exact same index value. Under the new nbatches
258 * code, it is possible to have multiples of ingredients in a cauldron
259 * which could result in an index formula mismatch. We *don't* check for
260 * that possibility here. -b.t.
261 */
262void
263check_formulae (void)
264{
265 recipelist *fl;
266 recipe *check, *formula;
267 int numb = 1;
268
269 LOG (llevDebug, "Checking formulae lists...\n");
270
271 for (fl = formulalist; fl; fl = fl->next)
272 {
273 for (formula = fl->items; formula; formula = formula->next)
274 for (check = formula->next; check; check = check->next)
275 if (check->index == formula->index)
276 {
277 LOG (llevError, " ERROR: On %d ingred list: ", numb);
278 LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n",
279 formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index);
280 }
281 numb++;
282 }
283
284 LOG (llevDebug, "done.\n");
285
286}
287
288/* Borrowed (again) from the artifacts code for this */
289
290void
291dump_alchemy (void)
292{
293 recipelist *fl = formulalist;
294 recipe *formula = NULL;
295 linked_char *next;
296 int num_ingred = 1;
297
298 fprintf (logfile, "\n");
299 while (fl)
300 {
301 fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n",
302 num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance);
303 for (formula = fl->items; formula; formula = formula->next)
304 {
305 artifact *art = NULL;
306 char buf[MAX_BUF];
307 size_t i;
308
309 for (i = 0; i < formula->arch_names; i++)
310 {
311 const char *string = formula->arch_name[i];
312
313 if (archetype::find (string) != NULL)
314 {
315 art = locate_recipe_artifact (formula, i);
316 if (!art && strcmp (formula->title, "NONE"))
317 LOG (llevError, "Formula %s has no artifact!\n", &formula->title);
318 else
319 {
320 if (strcmp (formula->title, "NONE"))
321 sprintf (buf, "%s of %s", string, &formula->title);
322 else
323 sprintf (buf, "%s", string);
324 fprintf (logfile, "%-30s(%d) bookchance %3d ", buf, formula->index, formula->chance);
325 fprintf (logfile, "skill %s", &formula->skill);
326 fprintf (logfile, "\n");
327 if (formula->ingred != NULL)
328 {
329 int nval = 0, tval = 0;
330
331 fprintf (logfile, "\tIngred: ");
332 for (next = formula->ingred; next != NULL; next = next->next)
333 {
334 if (nval != 0)
335 fprintf (logfile, ",");
336 fprintf (logfile, "%s(%d)", &next->name, (nval = strtoint (next->name)));
337 tval += nval;
338 }
339 fprintf (logfile, "\n");
340 if (tval != formula->index)
341 fprintf (logfile, "WARNING:ingredient list and formula values not equal.\n");
342 }
343 if (formula->skill != NULL)
344 fprintf (logfile, "\tSkill Required: %s", &formula->skill);
345 if (formula->cauldron != NULL)
346 fprintf (logfile, "\tCauldron: %s\n", &formula->cauldron);
347 fprintf (logfile, "\tDifficulty: %d\t Exp: %d\n", formula->diff, formula->exp);
348 }
349 }
350 else
351 LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title);
352 }
353 }
354 fprintf (logfile, "\n");
355 fl = fl->next;
356 num_ingred++;
357 }
358}
359
360/* Find a treasure with a matching name. The 'depth' parameter is 288/* Find a treasure with a matching name. The 'depth' parameter is
361 * only there to prevent infinite loops in treasure lists (a list 289 * only there to prevent infinite loops in treasure lists (a list
362 * referencing another list pointing back to the first one). */ 290 * referencing another list pointing back to the first one). */
363archetype * 291static archetype *
364find_treasure_by_name (const treasure *t, const char *name, int depth) 292find_treasure_by_name (const treasure *t, const char *name, int depth)
365{ 293{
366 if (depth > 10) 294 if (depth > 10)
367 return 0; 295 return 0;
368 296
… …
375 if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1)) 303 if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1))
376 return at; 304 return at;
377 } 305 }
378 else 306 else
379 { 307 {
380 if (t->item && !strcasecmp (t->item->clone.name, name)) 308 if (t->item && !strcasecmp (t->item->object::name, name))
381 return t->item; 309 return t->item;
382 } 310 }
383 311
384 if (t->next_yes) 312 if (t->next_yes)
385 if (archetype *at = find_treasure_by_name (t->next_yes, name, depth)) 313 if (archetype *at = find_treasure_by_name (t->next_yes, name, depth))
… …
393 } 321 }
394 322
395 return 0; 323 return 0;
396} 324}
397 325
398/* If several archetypes have the same name, the value of the first
399 * one with that name will be returned. This happens for the
400 * mushrooms (mushroom_1, mushroom_2 and mushroom_3). For the
401 * monsters' body parts, there may be several monsters with the same
402 * name. This is not a problem if these monsters have the same level
403 * (e.g. sage & c_sage) or if only one of the monsters generates the
404 * body parts that we are looking for (e.g. big_dragon and
405 * big_dragon_worthless). */
406long
407find_ingred_cost (const char *name)
408{
409 archetype *at;
410 archetype *at2;
411 artifactlist *al;
412 artifact *art;
413 long mult;
414 char *cp;
415 char part1[100];
416 char part2[100];
417
418 /* same as atoi(), but skip number */
419 mult = 0;
420 while (isdigit (*name))
421 {
422 mult = 10 * mult + (*name - '0');
423 name++;
424 }
425
426 if (mult > 0)
427 name++;
428 else
429 mult = 1;
430
431 /* first, try to match the name of an archetype */
432 for (at = first_archetype; at != NULL; at = at->next)
433 {
434 if (at->clone.title != NULL)
435 {
436 /* inefficient, but who cares? */
437 sprintf (part1, "%s %s", &at->clone.name, &at->clone.title);
438 if (!strcasecmp (part1, name))
439 return mult * at->clone.value;
440 }
441 if (!strcasecmp (at->clone.name, name))
442 return mult * at->clone.value;
443 }
444
445 /* second, try to match an artifact ("arch of something") */
446 cp = strstr (name, " of ");
447 if (cp != NULL)
448 {
449 strcpy (part1, name);
450 part1[cp - name] = '\0';
451 strcpy (part2, cp + 4);
452 /* find the first archetype matching the first part of the name */
453 for (at = first_archetype; at; at = at->next)
454 if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL)
455 break;
456 if (at != NULL)
457 {
458 /* find the first artifact derived from that archetype (same type) */
459 for (al = first_artifactlist; al; al = al->next)
460 if (al->type == at->clone.type)
461 {
462 for (art = al->items; art; art = art->next)
463 if (!strcasecmp (art->item->name, part2))
464 return mult * at->clone.value * art->item->value;
465 }
466 }
467 }
468
469 /* third, try to match a body part ("arch's something") */
470 cp = strstr (name, "'s ");
471 if (cp)
472 {
473 strcpy (part1, name);
474 part1[cp - name] = '\0';
475 strcpy (part2, cp + 3);
476 /* examine all archetypes matching the first part of the name */
477 for (at = first_archetype; at; at = at->next)
478 if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL)
479 {
480 if (at->clone.randomitems)
481 {
482 at2 = find_treasure_by_name (at->clone.randomitems->items, part2, 0);
483 if (at2)
484 return mult * at2->clone.value * isqrt (at->clone.level * 2);
485 }
486 }
487 }
488
489 /* failed to find any matching items -- formula should be checked */
490 return -1;
491}
492
493/* code copied from dump_alchemy() and modified by Raphael Quinet */
494void
495dump_alchemy_costs (void)
496{
497 recipelist *fl = formulalist;
498 recipe *formula = NULL;
499 linked_char *next;
500 int num_ingred = 1;
501 int num_errors = 0;
502 long cost;
503 long tcost;
504
505 fprintf (logfile, "\n");
506 while (fl)
507 {
508 fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n",
509 num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance);
510 for (formula = fl->items; formula; formula = formula->next)
511 {
512 artifact *art = NULL;
513 archetype *at = NULL;
514 char buf[MAX_BUF];
515 size_t i;
516
517 for (i = 0; i < formula->arch_names; i++)
518 {
519 const char *string = formula->arch_name[i];
520
521 if ((at = archetype::find (string)) != NULL)
522 {
523 art = locate_recipe_artifact (formula, i);
524 if (!art && strcmp (formula->title, "NONE"))
525 LOG (llevError, "Formula %s has no artifact\n", &formula->title);
526 else
527 {
528 if (!strcmp (formula->title, "NONE"))
529 sprintf (buf, "%s", string);
530 else
531 sprintf (buf, "%s of %s", string, &formula->title);
532 fprintf (logfile, "\n%-40s bookchance %3d skill %s\n", buf, formula->chance, &(formula->skill));
533 if (formula->ingred != NULL)
534 {
535 tcost = 0;
536 for (next = formula->ingred; next != NULL; next = next->next)
537 {
538 cost = find_ingred_cost (next->name);
539 if (cost < 0)
540 num_errors++;
541 fprintf (logfile, "\t%-33s%5ld\n", &next->name, cost);
542 if (cost < 0 || tcost < 0)
543 tcost = -1;
544 else
545 tcost += cost;
546 }
547 if (art != NULL && art->item != NULL)
548 cost = at->clone.value * art->item->value;
549 else
550 cost = at->clone.value;
551 fprintf (logfile, "\t\tBuying result costs: %5ld", cost);
552 if (formula->yield > 1)
553 {
554 fprintf (logfile, " to %ld (max %d items)\n", cost * formula->yield, formula->yield);
555 cost = cost * (formula->yield + 1L) / 2L;
556 }
557 else
558 fprintf (logfile, "\n");
559 fprintf (logfile, "\t\tIngredients cost: %5ld\n\t\tComment: ", tcost);
560 if (tcost < 0)
561 fprintf (logfile, "Could not find some ingredients. Check the formula!\n");
562 else if (tcost > cost)
563 fprintf (logfile, "Ingredients are much too expensive. Useless formula.\n");
564 else if (tcost * 2L > cost)
565 fprintf (logfile, "Ingredients are too expensive.\n");
566 else if (tcost * 10L < cost)
567 fprintf (logfile, "Ingredients are too cheap.\n");
568 else
569 fprintf (logfile, "OK.\n");
570 }
571 }
572 }
573 else
574 LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title);
575 }
576 }
577 fprintf (logfile, "\n");
578 fl = fl->next;
579 num_ingred++;
580 }
581 if (num_errors > 0)
582 fprintf (logfile, "WARNING: %d objects required by the formulae do not exist in the game.\n", num_errors);
583}
584
585const char * 326static const char *
586ingred_name (const char *name) 327ingred_name (const char *name)
587{ 328{
588 const char *cp = name; 329 const char *cp = name;
589 330
590 if (atoi (cp)) 331 if (atoi (cp))
591 cp = strchr (cp, ' ') + 1; 332 cp = strchr (cp, ' ') + 1;
333
592 return cp; 334 return cp;
593} 335}
594 336
595/* strtoint() - we use this to convert buf into an integer 337static int
596 * equal to the coadded sum of the (lowercase) character
597 * ASCII values in buf (times prepended integers).
598 */
599
600int
601strtoint (const char *buf)
602{
603 const char *cp = ingred_name (buf);
604 int val = 0, len = strlen (cp), mult = numb_ingred (buf);
605
606 while (len)
607 {
608 val += tolower (*cp);
609 cp++;
610 len--;
611 }
612 return val * mult;
613}
614
615artifact *
616locate_recipe_artifact (const recipe *rp, size_t idx)
617{
618 archetype *at = archetype::find (rp->arch_name [idx]);
619
620 if (at)
621 if (artifactlist *al = find_artifactlist (at->clone.type))
622 for (artifact *art = al->items; art; art = art->next)
623 if (art->item->name == rp->title)
624 return art;
625
626 return 0;
627}
628
629int
630numb_ingred (const char *buf) 338numb_ingred (const char *buf)
631{ 339{
632 int numb; 340 int numb;
633 341
634 if ((numb = atoi (buf))) 342 if ((numb = atoi (buf)))
635 return numb; 343 return numb;
636 else 344 else
637 return 1; 345 return 1;
638} 346}
639 347
348/* strtoint() - we use this to convert buf into an integer
349 * equal to the coadded sum of the (lowercase) character
350 * ASCII values in buf (times prepended integers).
351 * Some kind of hashing.
352 */
353int
354strtoint (const char *buf)
355{
356 const char *cp = ingred_name (buf);
357 int val = 0, len = strlen (cp), mult = numb_ingred (buf);
358
359 while (len)
360 {
361 val += tolower (*cp);
362 cp++;
363 len--;
364 }
365
366 return val * mult;
367}
368
369artifact *
370locate_recipe_artifact (const recipe *rp, size_t idx)
371{
372 archetype *at = archetype::find (rp->arch_name [idx]);
373
374 if (at)
375 if (artifactlist *al = find_artifactlist (at->type))
376 for (artifact *art = al->items; art; art = art->next)
377 if (art->item->name == rp->title)
378 return art;
379
380 return 0;
381}
382
640recipelist * 383static recipelist *
641get_random_recipelist (void) 384get_random_recipelist (void)
642{ 385{
643 recipelist *fl = NULL; 386 recipelist *fl = NULL;
644 int number = 0, roll = 0; 387 int number = 0, roll = 0;
645 388
… …
689 if (r < 0) 432 if (r < 0)
690 break; 433 break;
691 } 434 }
692 } 435 }
693 return rp; 436 return rp;
694}
695
696void
697free_all_recipes (void)
698{
699 recipelist *fl = formulalist, *flnext;
700 recipe *formula = NULL, *next;
701 linked_char *lchar, *charnext;
702
703 LOG (llevDebug, "Freeing all the recipes\n");
704 for (fl = formulalist; fl != NULL; fl = flnext)
705 {
706 flnext = fl->next;
707
708 for (formula = fl->items; formula != NULL; formula = next)
709 {
710 next = formula->next;
711
712 free (formula->arch_name[0]);
713 free (formula->arch_name);
714
715 for (lchar = formula->ingred; lchar; lchar = charnext)
716 {
717 charnext = lchar->next;
718 delete lchar;
719 }
720 delete formula;
721 }
722
723 delete fl;
724 }
725} 437}
726 438
727/** 439/**
728 * Split a comma separated string list into words. 440 * Split a comma separated string list into words.
729 * 441 *

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines