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 <global.h>
#include <object.h>
#include <ctype.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, "\nWARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title);
              result = 0;
            }
        }
      else
        {
          LOG (llevError, "\nWARNING: 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...", 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...");

  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 NULL;
  while (t != NULL)
    {
      if (t->name != NULL)
        {
          tl = find_treasurelist (t->name);
          at = find_treasure_by_name (tl->items, name, depth + 1);
          if (at != NULL)
            return at;
        }
      else
        {
          if (!strcasecmp (t->item->clone.name, name))
            return t->item;
        }
      if (t->next_yes != NULL)
        {
          at = find_treasure_by_name (t->next_yes, name, depth);
          if (at != NULL)
            return at;
        }
      if (t->next_no != NULL)
        {
          at = find_treasure_by_name (t->next_no, name, depth);
          if (at != NULL)
            return at;
        }
      t = t->next;
    }
  return NULL;
}

/* 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 != NULL)
    {
      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 != NULL)
                  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;

  free_object (item);

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