server/common/recipe.C

/* Basic stuff for use with the alchemy code. Clearly some of this stuff
 * could go into server/alchemy, but I left it here just in case it proves
 * more generally useful. 
 *
 * Nov 1995 - file created by b.t. thomas@astro.psu.edu 
 */


/* Our definition of 'formula' is any product of an alchemical process.
 * Ingredients are just comma delimited list of archetype (or object) 
 * names. 
 */

/* Example 'formula' entry in libdir/formulae:
 *      Object transparency
 *      chance 10
 *      ingred dust of beholdereye,gem
 *      arch potion_generic
 */

#include <cctype>

#include <global.h>
#include <object.h>

static void build_stringlist (const char *str, char ***result_list, size_t * result_size);

static recipelist *formulalist;

static recipelist *
init_recipelist (void)
{
  recipelist *tl = new recipelist;

  tl->total_chance = 0;
  tl->number = 0;
  tl->items = NULL;
  tl->next = NULL;
  return tl;
}

static recipe *
get_empty_formula (void)
{
  recipe *t = new recipe;

  t->chance = 0;
  t->index = 0;
  t->transmute = 0;
  t->yield = 0;
  t->diff = 0;
  t->exp = 0;
  t->keycode = 0;
  t->title = NULL;
  t->arch_names = 0;
  t->arch_name = NULL;
  t->skill = NULL;
  t->cauldron = NULL;
  t->ingred = NULL;
  t->next = NULL;
  return t;
}

/* get_formulalist() - returns pointer to the formula list */

recipelist *
get_formulalist (int i)
{
  recipelist *fl = formulalist;
  int number = i;

  while (fl && number > 1)
    {
      if (!(fl = fl->next))
        break;
      number--;
    }
  return fl;
}

/* check_recipe() - makes sure we actually have the requested artifact 
 * and archetype. */

static int
check_recipe (const recipe *rp)
{
  size_t i;
  int result;

  result = 1;
  for (i = 0; i < rp->arch_names; i++)
    {
      if (archetype::find (rp->arch_name[i]) != NULL)
        {
          artifact *art = locate_recipe_artifact (rp, i);

          if (!art && strcmp (rp->title, "NONE") != 0)
            {
              LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title);
              result = 0;
            }
        }
      else
        {
          LOG (llevError, "WARNING: Can't find archetype %s for formula %s\n", rp->arch_name[i], &rp->title);
          result = 0;
        }
    }

  return result;
}


/*
 * init_formulae() - Builds up the lists of formula from the file in 
 * the libdir. -b.t. 
 */

void
init_formulae (void)
{
  static int has_been_done = 0;
  FILE *fp;
  char filename[MAX_BUF], buf[MAX_BUF], *cp, *next;
  recipe *formula = NULL;
  recipelist *fl = init_recipelist ();
  linked_char *tmp;
  int value, comp;

  if (!formulalist)
    formulalist = fl;

  if (has_been_done)
    return;
  else
    has_been_done = 1;

  sprintf (filename, "%s/formulae", settings.datadir);
  LOG (llevDebug, "Reading alchemical formulae from %s...\n", filename);
  if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)
    {
      LOG (llevError, "Can't open %s.\n", filename);
      return;
    }

  while (fgets (buf, MAX_BUF, fp) != NULL)
    {
      if (*buf == '#')
        continue;
      if ((cp = strchr (buf, '\n')) != NULL)
        *cp = '\0';
      cp = buf;
      while (*cp == ' ')        /* Skip blanks */
        cp++;

      if (!strncmp (cp, "Object", 6))
        {
          formula = get_empty_formula ();
          formula->title = strchr (cp, ' ') + 1;
        }
      else if (!strncmp (cp, "keycode", 7))
        {
          formula->keycode = strchr (cp, ' ') + 1;
        }
      else if (sscanf (cp, "trans %d", &value))
        {
          formula->transmute = (uint16) value;
        }
      else if (sscanf (cp, "yield %d", &value))
        {
          formula->yield = (uint16) value;
        }
      else if (sscanf (cp, "chance %d", &value))
        {
          formula->chance = (uint16) value;
        }
      else if (sscanf (cp, "exp %d", &value))
        {
          formula->exp = (uint16) value;
        }
      else if (sscanf (cp, "diff %d", &value))
        {
          formula->diff = (uint16) value;
        }
      else if (!strncmp (cp, "ingred", 6))
        {
          int numb_ingred = 1;

          cp = strchr (cp, ' ') + 1;
          do
            {
              if ((next = strchr (cp, ',')) != NULL)
                {
                  *(next++) = '\0';
                  numb_ingred++;
                }
              tmp = new linked_char;

              tmp->name = cp;
              tmp->next = formula->ingred;
              formula->ingred = tmp;
              /* each ingredient's ASCII value is coadded. Later on this 
               * value will be used allow us to search the formula lists 
               * quickly for the right recipe. 
               */
              formula->index += strtoint (cp);
            }
          while ((cp = next) != NULL);
          /* now find the correct (# of ingred ordered) formulalist */
          fl = formulalist;
          while (numb_ingred != 1)
            {
              if (!fl->next)
                fl->next = init_recipelist ();
              fl = fl->next;
              numb_ingred--;
            }
          fl->total_chance += formula->chance;
          fl->number++;
          formula->next = fl->items;
          fl->items = formula;
        }
      else if (!strncmp (cp, "arch", 4))
        {
          build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names);
          check_recipe (formula);
        }
      else if (!strncmp (cp, "skill", 5))
        {
          formula->skill = strchr (cp, ' ') + 1;
        }
      else if (!strncmp (cp, "cauldron", 8))
        {
          formula->cauldron = strchr (cp, ' ') + 1;
        }
      else
        LOG (llevError, "Unknown input in file %s: %s\n", filename, buf);
    }
  LOG (llevDebug, "done.\n");
  close_and_delete (fp, comp);
  /* Lastly, lets check for problems in formula we got */
  check_formulae ();
}

/* check_formulae()- since we are doing a squential search on the
 * formulae lists now, we have to be carefull that we dont have 2
 * formula with the exact same index value. Under the new nbatches
 * code, it is possible to have multiples of ingredients in a cauldron
 * which could result in an index formula mismatch. We *don't* check for
 * that possibility here. -b.t.
 */
void
check_formulae (void)
{
  recipelist *fl;
  recipe *check, *formula;
  int numb = 1;

  LOG (llevDebug, "Checking formulae lists...\n");

  for (fl = formulalist; fl != NULL; fl = fl->next)
    {
      for (formula = fl->items; formula != NULL; formula = formula->next)
        for (check = formula->next; check != NULL; check = check->next)
          if (check->index == formula->index)
            {
              LOG (llevError, " ERROR: On %d ingred list: ", numb);
              LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n",
                   formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index);
            }
      numb++;
    }

  LOG (llevDebug, "done.\n");

}

/* Borrowed (again) from the artifacts code for this  */

void
dump_alchemy (void)
{
  recipelist *fl = formulalist;
  recipe *formula = NULL;
  linked_char *next;
  int num_ingred = 1;

  fprintf (logfile, "\n");
  while (fl)
    {
      fprintf (logfile, "\n Formulae with %d ingredient%s  %d Formulae with total_chance=%d\n",
               num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance);
      for (formula = fl->items; formula != NULL; formula = formula->next)
        {
          artifact *art = NULL;
          char buf[MAX_BUF];
          size_t i;

          for (i = 0; i < formula->arch_names; i++)
            {
              const char *string = formula->arch_name[i];

              if (archetype::find (string) != NULL)
                {
                  art = locate_recipe_artifact (formula, i);
                  if (!art && strcmp (formula->title, "NONE"))
                    LOG (llevError, "Formula %s has no artifact\n", &formula->title);
                  else
                    {
                      if (strcmp (formula->title, "NONE"))
                        sprintf (buf, "%s of %s", string, &formula->title);
                      else
                        sprintf (buf, "%s", string);
                      fprintf (logfile, "%-30s(%d) bookchance %3d  ", buf, formula->index, formula->chance);
                      fprintf (logfile, "skill %s", &formula->skill);
                      fprintf (logfile, "\n");
                      if (formula->ingred != NULL)
                        {
                          int nval = 0, tval = 0;

                          fprintf (logfile, "\tIngred: ");
                          for (next = formula->ingred; next != NULL; next = next->next)
                            {
                              if (nval != 0)
                                fprintf (logfile, ",");
                              fprintf (logfile, "%s(%d)", &next->name, (nval = strtoint (next->name)));
                              tval += nval;
                            }
                          fprintf (logfile, "\n");
                          if (tval != formula->index)
                            fprintf (logfile, "WARNING:ingredient list and formula values not equal.\n");
                        }
                      if (formula->skill != NULL)
                        fprintf (logfile, "\tSkill Required: %s", &formula->skill);
                      if (formula->cauldron != NULL)
                        fprintf (logfile, "\tCauldron: %s\n", &formula->cauldron);
                      fprintf (logfile, "\tDifficulty: %d\t Exp: %d\n", formula->diff, formula->exp);
                    }
                }
              else
                LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title);
            }
        }
      fprintf (logfile, "\n");
      fl = fl->next;
      num_ingred++;
    }
}

/* Find a treasure with a matching name.  The 'depth' parameter is
 * only there to prevent infinite loops in treasure lists (a list
 * referencing another list pointing back to the first one). */
archetype *
find_treasure_by_name (const treasure *t, const char *name, int depth)
{
  treasurelist *tl;
  archetype *at;

  if (depth > 10)
    return 0;

  while (t)
    {
      if (t->name)
        {
          tl = find_treasurelist (t->name);

          if (tl)
            {
              at = find_treasure_by_name (tl->items, name, depth + 1);

              if (at)
                return at;
            }
        }
      else
        {
          if (t->item && !strcasecmp (t->item->clone.name, name))
            return t->item;
        }

      if (t->next_yes)
        {
          at = find_treasure_by_name (t->next_yes, name, depth);
          if (at)
            return at;
        }

      if (t->next_no)
        {
          at = find_treasure_by_name (t->next_no, name, depth);
          if (at)
            return at;
        }
      t = t->next;
    }
  return 0;
}

/* If several archetypes have the same name, the value of the first
 * one with that name will be returned.  This happens for the
 * mushrooms (mushroom_1, mushroom_2 and mushroom_3).  For the
 * monsters' body parts, there may be several monsters with the same
 * name.  This is not a problem if these monsters have the same level
 * (e.g. sage & c_sage) or if only one of the monsters generates the
 * body parts that we are looking for (e.g. big_dragon and
 * big_dragon_worthless). */
long
find_ingred_cost (const char *name)
{
  archetype *at;
  archetype *at2;
  artifactlist *al;
  artifact *art;
  long mult;
  char *cp;
  char part1[100];
  char part2[100];

  /* same as atoi(), but skip number */
  mult = 0;
  while (isdigit (*name))
    {
      mult = 10 * mult + (*name - '0');
      name++;
    }

  if (mult > 0)
    name++;
  else
    mult = 1;

  /* first, try to match the name of an archetype */
  for (at = first_archetype; at != NULL; at = at->next)
    {
      if (at->clone.title != NULL)
        {
          /* inefficient, but who cares? */
          sprintf (part1, "%s %s", &at->clone.name, &at->clone.title);
          if (!strcasecmp (part1, name))
            return mult * at->clone.value;
        }
      if (!strcasecmp (at->clone.name, name))
        return mult * at->clone.value;
    }

  /* second, try to match an artifact ("arch of something") */
  cp = strstr (name, " of ");
  if (cp != NULL)
    {
      strcpy (part1, name);
      part1[cp - name] = '\0';
      strcpy (part2, cp + 4);
      /* find the first archetype matching the first part of the name */
      for (at = first_archetype; at != NULL; at = at->next)
        if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL)
          break;
      if (at != NULL)
        {
          /* find the first artifact derived from that archetype (same type) */
          for (al = first_artifactlist; al != NULL; al = al->next)
            if (al->type == at->clone.type)
              {
                for (art = al->items; art != NULL; art = art->next)
                  if (!strcasecmp (art->item->name, part2))
                    return mult * at->clone.value * art->item->value;
              }
        }
    }

  /* third, try to match a body part ("arch's something") */
  cp = strstr (name, "'s ");
  if (cp)
    {
      strcpy (part1, name);
      part1[cp - name] = '\0';
      strcpy (part2, cp + 3);
      /* examine all archetypes matching the first part of the name */
      for (at = first_archetype; at != NULL; at = at->next)
        if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL)
          {
            if (at->clone.randomitems != NULL)
              {
                at2 = find_treasure_by_name (at->clone.randomitems->items, part2, 0);
                if (at2)
                  return mult * at2->clone.value * isqrt (at->clone.level * 2);
              }
          }
    }

  /* failed to find any matching items -- formula should be checked */
  return -1;
}

/* code copied from dump_alchemy() and modified by Raphael Quinet */
void
dump_alchemy_costs (void)
{
  recipelist *fl = formulalist;
  recipe *formula = NULL;
  linked_char *next;
  int num_ingred = 1;
  int num_errors = 0;
  long cost;
  long tcost;

  fprintf (logfile, "\n");
  while (fl)
    {
      fprintf (logfile, "\n Formulae with %d ingredient%s  %d Formulae with total_chance=%d\n",
               num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance);
      for (formula = fl->items; formula != NULL; formula = formula->next)
        {
          artifact *art = NULL;
          archetype *at = NULL;
          char buf[MAX_BUF];
          size_t i;

          for (i = 0; i < formula->arch_names; i++)
            {
              const char *string = formula->arch_name[i];

              if ((at = archetype::find (string)) != NULL)
                {
                  art = locate_recipe_artifact (formula, i);
                  if (!art && strcmp (formula->title, "NONE"))
                    LOG (llevError, "Formula %s has no artifact\n", &formula->title);
                  else
                    {
                      if (!strcmp (formula->title, "NONE"))
                        sprintf (buf, "%s", string);
                      else
                        sprintf (buf, "%s of %s", string, &formula->title);
                      fprintf (logfile, "\n%-40s bookchance %3d  skill %s\n", buf, formula->chance, &(formula->skill));
                      if (formula->ingred != NULL)
                        {
                          tcost = 0;
                          for (next = formula->ingred; next != NULL; next = next->next)
                            {
                              cost = find_ingred_cost (next->name);
                              if (cost < 0)
                                num_errors++;
                              fprintf (logfile, "\t%-33s%5ld\n", &next->name, cost);
                              if (cost < 0 || tcost < 0)
                                tcost = -1;
                              else
                                tcost += cost;
                            }
                          if (art != NULL && art->item != NULL)
                            cost = at->clone.value * art->item->value;
                          else
                            cost = at->clone.value;
                          fprintf (logfile, "\t\tBuying result costs: %5ld", cost);
                          if (formula->yield > 1)
                            {
                              fprintf (logfile, " to %ld (max %d items)\n", cost * formula->yield, formula->yield);
                              cost = cost * (formula->yield + 1L) / 2L;
                            }
                          else
                            fprintf (logfile, "\n");
                          fprintf (logfile, "\t\tIngredients cost:    %5ld\n\t\tComment: ", tcost);
                          if (tcost < 0)
                            fprintf (logfile, "Could not find some ingredients.  Check the formula!\n");
                          else if (tcost > cost)
                            fprintf (logfile, "Ingredients are much too expensive.  Useless formula.\n");
                          else if (tcost * 2L > cost)
                            fprintf (logfile, "Ingredients are too expensive.\n");
                          else if (tcost * 10L < cost)
                            fprintf (logfile, "Ingredients are too cheap.\n");
                          else
                            fprintf (logfile, "OK.\n");
                        }
                    }
                }
              else
                LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title);
            }
        }
      fprintf (logfile, "\n");
      fl = fl->next;
      num_ingred++;
    }
  if (num_errors > 0)
    fprintf (logfile, "WARNING: %d objects required by the formulae do not exist in the game.\n", num_errors);
}

const char *
ingred_name (const char *name)
{
  const char *cp = name;

  if (atoi (cp))
    cp = strchr (cp, ' ') + 1;
  return cp;
}

/* strtoint() - we use this to convert buf into an integer
 * equal to the coadded sum of the (lowercase) character 
 * ASCII values in buf (times prepended integers).
 */

int
strtoint (const char *buf)
{
  const char *cp = ingred_name (buf);
  int val = 0, len = strlen (cp), mult = numb_ingred (buf);

  while (len)
    {
      val += tolower (*cp);
      cp++;
      len--;
    }
  return val * mult;
}

artifact *
locate_recipe_artifact (const recipe *rp, size_t idx)
{
  object *item = get_archetype (rp->arch_name[idx]);
  artifactlist *at = NULL;
  artifact *art = NULL;

  if (!item)
    return (artifact *) NULL;

  if ((at = find_artifactlist (item->type)))
    for (art = at->items; art; art = art->next)
      if (!strcmp (art->item->name, rp->title))
        break;

  item->destroy ();

  return art;
}

int
numb_ingred (const char *buf)
{
  int numb;

  if ((numb = atoi (buf)))
    return numb;
  else
    return 1;
}

recipelist *
get_random_recipelist (void)
{
  recipelist *fl = NULL;
  int number = 0, roll = 0;

  /* first, determine # of recipelist we have */
  for (fl = get_formulalist (1); fl; fl = fl->next)
    number++;

  /* now, randomly choose one */
  if (number > 0)
    roll = rndm (number);

  fl = get_formulalist (1);
  while (roll && fl)
    {
      if (fl->next)
        fl = fl->next;
      else
        break;
      roll--;
    }
  if (!fl)                      /* failed! */
    LOG (llevError, "get_random_recipelist(): no recipelists found!\n");
  else if (fl->total_chance == 0)
    fl = get_random_recipelist ();

  return fl;
}

recipe *
get_random_recipe (recipelist * rpl)
{
  recipelist *fl = rpl;
  recipe *rp = NULL;
  int r = 0;

  /* looks like we have to choose a random one */
  if (fl == NULL)
    if ((fl = get_random_recipelist ()) == NULL)
      return rp;

  if (fl->total_chance > 0)
    {
      r = rndm (fl->total_chance);
      for (rp = fl->items; rp; rp = rp->next)
        {
          r -= rp->chance;
          if (r < 0)
            break;
        }
    }
  return rp;
}

void
free_all_recipes (void)
{
  recipelist *fl = formulalist, *flnext;
  recipe *formula = NULL, *next;
  linked_char *lchar, *charnext;

  LOG (llevDebug, "Freeing all the recipes\n");
  for (fl = formulalist; fl != NULL; fl = flnext)
    {
      flnext = fl->next;

      for (formula = fl->items; formula != NULL; formula = next)
        {
          next = formula->next;

          free (formula->arch_name[0]);
          free (formula->arch_name);

          for (lchar = formula->ingred; lchar; lchar = charnext)
            {
              charnext = lchar->next;
              delete lchar;
            }
          delete formula;
        }

      delete fl;
    }
}

/**
 * Split a comma separated string list into words.
 *
 * @param str the string to split
 *
 * @param result_list pointer to return value for the newly created list; the
 * caller is responsible for freeing both *result_list and **result_list.
 *
 * @param result_size pointer to return value for the size of the newly
 * created list
 */
static void
build_stringlist (const char *str, char ***result_list, size_t * result_size)
{
  char *dup;
  char *p;
  size_t size;
  size_t i;

  dup = strdup (str);
  if (dup == NULL)
    fatal (OUT_OF_MEMORY);

  size = 0;
  for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ","))
    size++;

  *result_list = (char **) malloc (size * sizeof (*result_list));

  *result_size = size;

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