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.22 by root, Mon Jun 4 13:04:00 2007 UTC vs.
Revision 1.35 by root, Fri Mar 26 01:04:44 2010 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software; you can redistribute it and/or modify it 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * under the terms of the GNU General Public License as published by the Free 9 * the terms of the Affero GNU General Public License as published by the
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * 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 along 18 * You should have received a copy of the Affero GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * and the GNU General Public License along with this program. If not, see
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail to <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.
… …
50static void build_stringlist (const char *str, char ***result_list, size_t * result_size); 50static void build_stringlist (const char *str, char ***result_list, size_t * result_size);
51 51
52static recipelist *formulalist; 52static recipelist *formulalist;
53 53
54static recipelist * 54static recipelist *
55init_recipelist (void) 55init_recipelist ()
56{ 56{
57 recipelist *tl = new recipelist; 57 recipelist *tl = new recipelist;
58 58
59 tl->total_chance = 0; 59 tl->total_chance = 0;
60 tl->number = 0; 60 tl->number = 0;
… …
63 63
64 return tl; 64 return tl;
65} 65}
66 66
67static recipe * 67static recipe *
68get_empty_formula (void) 68get_empty_formula ()
69{ 69{
70 recipe *t = new recipe; 70 recipe *t = new recipe;
71 71
72 t->chance = 0; 72 t->chance = 0;
73 t->index = 0; 73 t->index = 0;
… …
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 }
… …
131 } 131 }
132 132
133 return result; 133 return result;
134} 134}
135 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 ()
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
167}
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.
139 */ 172 */
140void 173void
141init_formulae (void) 174init_formulae ()
142{ 175{
143 static int has_been_done = 0; 176 static int has_been_done = 0;
144 FILE *fp; 177 FILE *fp;
145 char filename[MAX_BUF], buf[MAX_BUF], *cp, *next; 178 char filename[MAX_BUF], buf[MAX_BUF], *cp, *next;
146 recipe *formula = NULL; 179 recipe *formula = NULL;
… …
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
… …
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 *at2;
410 artifactlist *al;
411 artifact *art;
412 long mult;
413 char *cp;
414 char part1[100];
415 char part2[100];
416
417 /* same as atoi(), but skip number */
418 mult = 0;
419 while (isdigit (*name))
420 {
421 mult = 10 * mult + (*name - '0');
422 name++;
423 }
424
425 if (mult > 0)
426 name++;
427 else
428 mult = 1;
429
430 /* first, try to match the name of an archetype */
431 for_all_archetypes (at)
432 {
433 if (at->title != NULL)
434 {
435 /* inefficient, but who cares? */
436 sprintf (part1, "%s %s", &at->object::name, &at->title);
437 if (!strcasecmp (part1, name))
438 return mult * at->value;
439 }
440 if (!strcasecmp (at->object::name, name))
441 return mult * at->value;
442 }
443
444 /* second, try to match an artifact ("arch of something") */
445 cp = strstr (name, " of ");
446 if (cp != NULL)
447 {
448 strcpy (part1, name);
449 part1[cp - name] = '\0';
450 strcpy (part2, cp + 4);
451
452 /* find the first archetype matching the first part of the name */
453 for_all_archetypes (at)
454 if (!strcasecmp (at->object::name, part1) && at->title == NULL)
455 {
456 /* find the first artifact derived from that archetype (same type) */
457 for (al = first_artifactlist; al; al = al->next)
458 if (al->type == at->type)
459 {
460 for (art = al->items; art; art = art->next)
461 if (!strcasecmp (art->item->name, part2))
462 return mult * at->value * art->item->value;
463 }
464 }
465 }
466
467 /* third, try to match a body part ("arch's something") */
468 cp = strstr (name, "'s ");
469 if (cp)
470 {
471 strcpy (part1, name);
472 part1[cp - name] = '\0';
473 strcpy (part2, cp + 3);
474 /* examine all archetypes matching the first part of the name */
475 for_all_archetypes (at)
476 if (!strcasecmp (at->object::name, part1) && at->title == NULL)
477 {
478 if (at->randomitems)
479 {
480 at2 = find_treasure_by_name (at->randomitems->items, part2, 0);
481 if (at2)
482 return mult * at2->value * isqrt (at->level * 2);
483 }
484 }
485 }
486
487 /* failed to find any matching items -- formula should be checked */
488 return -1;
489}
490
491/* code copied from dump_alchemy() and modified by Raphael Quinet */
492void
493dump_alchemy_costs (void)
494{
495 recipelist *fl = formulalist;
496 recipe *formula = NULL;
497 linked_char *next;
498 int num_ingred = 1;
499 int num_errors = 0;
500 long cost;
501 long tcost;
502
503 fprintf (logfile, "\n");
504 while (fl)
505 {
506 fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n",
507 num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance);
508 for (formula = fl->items; formula; formula = formula->next)
509 {
510 artifact *art = NULL;
511 archetype *at = NULL;
512 char buf[MAX_BUF];
513 size_t i;
514
515 for (i = 0; i < formula->arch_names; i++)
516 {
517 const char *string = formula->arch_name[i];
518
519 if ((at = archetype::find (string)) != NULL)
520 {
521 art = locate_recipe_artifact (formula, i);
522 if (!art && strcmp (formula->title, "NONE"))
523 LOG (llevError, "Formula %s has no artifact\n", &formula->title);
524 else
525 {
526 if (!strcmp (formula->title, "NONE"))
527 sprintf (buf, "%s", string);
528 else
529 sprintf (buf, "%s of %s", string, &formula->title);
530 fprintf (logfile, "\n%-40s bookchance %3d skill %s\n", buf, formula->chance, &(formula->skill));
531 if (formula->ingred != NULL)
532 {
533 tcost = 0;
534 for (next = formula->ingred; next != NULL; next = next->next)
535 {
536 cost = find_ingred_cost (next->name);
537 if (cost < 0)
538 num_errors++;
539 fprintf (logfile, "\t%-33s%5ld\n", &next->name, cost);
540 if (cost < 0 || tcost < 0)
541 tcost = -1;
542 else
543 tcost += cost;
544 }
545 if (art != NULL && art->item != NULL)
546 cost = at->value * art->item->value;
547 else
548 cost = at->value;
549 fprintf (logfile, "\t\tBuying result costs: %5ld", cost);
550 if (formula->yield > 1)
551 {
552 fprintf (logfile, " to %ld (max %d items)\n", cost * formula->yield, formula->yield);
553 cost = cost * (formula->yield + 1L) / 2L;
554 }
555 else
556 fprintf (logfile, "\n");
557 fprintf (logfile, "\t\tIngredients cost: %5ld\n\t\tComment: ", tcost);
558 if (tcost < 0)
559 fprintf (logfile, "Could not find some ingredients. Check the formula!\n");
560 else if (tcost > cost)
561 fprintf (logfile, "Ingredients are much too expensive. Useless formula.\n");
562 else if (tcost * 2L > cost)
563 fprintf (logfile, "Ingredients are too expensive.\n");
564 else if (tcost * 10L < cost)
565 fprintf (logfile, "Ingredients are too cheap.\n");
566 else
567 fprintf (logfile, "OK.\n");
568 }
569 }
570 }
571 else
572 LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title);
573 }
574 }
575 fprintf (logfile, "\n");
576 fl = fl->next;
577 num_ingred++;
578 }
579 if (num_errors > 0)
580 fprintf (logfile, "WARNING: %d objects required by the formulae do not exist in the game.\n", num_errors);
581}
582
583const char * 326static const char *
584ingred_name (const char *name) 327ingred_name (const char *name)
585{ 328{
586 const char *cp = name; 329 const char *cp = name;
587 330
588 if (atoi (cp)) 331 if (atoi (cp))
589 cp = strchr (cp, ' ') + 1; 332 cp = strchr (cp, ' ') + 1;
333
590 return cp; 334 return cp;
335}
336
337static int
338numb_ingred (const char *buf)
339{
340 int numb;
341
342 if ((numb = atoi (buf)))
343 return numb;
344 else
345 return 1;
591} 346}
592 347
593/* strtoint() - we use this to convert buf into an integer 348/* strtoint() - we use this to convert buf into an integer
594 * equal to the coadded sum of the (lowercase) character 349 * equal to the coadded sum of the (lowercase) character
595 * ASCII values in buf (times prepended integers). 350 * ASCII values in buf (times prepended integers).
351 * Some kind of hashing.
596 */ 352 */
597
598int 353int
599strtoint (const char *buf) 354strtoint (const char *buf)
600{ 355{
601 const char *cp = ingred_name (buf); 356 const char *cp = ingred_name (buf);
602 int val = 0, len = strlen (cp), mult = numb_ingred (buf); 357 int val = 0, len = strlen (cp), mult = numb_ingred (buf);
… …
605 { 360 {
606 val += tolower (*cp); 361 val += tolower (*cp);
607 cp++; 362 cp++;
608 len--; 363 len--;
609 } 364 }
365
610 return val * mult; 366 return val * mult;
611} 367}
612 368
613artifact * 369artifact *
614locate_recipe_artifact (const recipe *rp, size_t idx) 370locate_recipe_artifact (const recipe *rp, size_t idx)
… …
622 return art; 378 return art;
623 379
624 return 0; 380 return 0;
625} 381}
626 382
627int
628numb_ingred (const char *buf)
629{
630 int numb;
631
632 if ((numb = atoi (buf)))
633 return numb;
634 else
635 return 1;
636}
637
638recipelist * 383static recipelist *
639get_random_recipelist (void) 384get_random_recipelist ()
640{ 385{
641 recipelist *fl = NULL; 386 recipelist *fl = NULL;
642 int number = 0, roll = 0; 387 int number = 0, roll = 0;
643 388
644 /* first, determine # of recipelist we have */ 389 /* first, determine # of recipelist we have */
… …
687 if (r < 0) 432 if (r < 0)
688 break; 433 break;
689 } 434 }
690 } 435 }
691 return rp; 436 return rp;
692}
693
694void
695free_all_recipes (void)
696{
697 recipelist *fl = formulalist, *flnext;
698 recipe *formula = NULL, *next;
699 linked_char *lchar, *charnext;
700
701 LOG (llevDebug, "Freeing all the recipes\n");
702 for (fl = formulalist; fl != NULL; fl = flnext)
703 {
704 flnext = fl->next;
705
706 for (formula = fl->items; formula != NULL; formula = next)
707 {
708 next = formula->next;
709
710 free (formula->arch_name[0]);
711 free (formula->arch_name);
712
713 for (lchar = formula->ingred; lchar; lchar = charnext)
714 {
715 charnext = lchar->next;
716 delete lchar;
717 }
718 delete formula;
719 }
720
721 delete fl;
722 }
723} 437}
724 438
725/** 439/**
726 * Split a comma separated string list into words. 440 * Split a comma separated string list into words.
727 * 441 *

Diff Legend

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