server/common/recipe.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
 * Copyright (©) 1992,2007 Frank Tore Johansen
 * 
 * Deliantra is free software: you can redistribute it and/or modify it under
 * the terms of the Affero GNU General Public License as published by the
 * Free Software Foundation, either version 3 of the License, or (at your
 * option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the Affero GNU General Public License
 * and the GNU General Public License along with this program. If not, see
 * <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

/* 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  = 0;
  tl->next   = 0;

  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 = 1;

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

          if (!art && rp->title != shstr_NONE)
            {
              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; fl = fl->next)
    {
      for (formula = fl->items; formula; formula = formula->next)
        for (check = formula->next; check; 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");

}

/* 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)
{
  if (depth > 10)
    return 0;

  while (t)
    {
      if (t->name)
        {
          if (treasurelist *tl = treasurelist::find (t->name))
            if (tl->items)
              if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1))
                return at;
        }
      else
        {
          if (t->item && !strcasecmp (t->item->object::name, name))
            return t->item;
        }

      if (t->next_yes)
        if (archetype *at = find_treasure_by_name (t->next_yes, name, depth))
          return at;

      if (t->next_no)
        if (archetype *at = find_treasure_by_name (t->next_no, name, depth))
          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 *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_all_archetypes (at)
    {
      if (at->title != NULL)
        {
          /* inefficient, but who cares? */
          sprintf (part1, "%s %s", &at->object::name, &at->title);
          if (!strcasecmp (part1, name))
            return mult * at->value;
        }
      if (!strcasecmp (at->object::name, name))
        return mult * at->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_all_archetypes (at)
        if (at->object::name.eq_nc (part1) && !at->title)
          {
            /* find the first artifact derived from that archetype (same type) */
            for (al = first_artifactlist; al; al = al->next)
              if (al->type == at->type)
                {
                  for (art = al->items; art; art = art->next)
                    if (!strcasecmp (art->item->name, part2))
                      return mult * at->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_all_archetypes (at)
        if (at->object::name.eq_nc (part1) && !at->title)
          {
            if (at->randomitems)
              {
                at2 = find_treasure_by_name (at->randomitems->items, part2, 0);
                if (at2)
                  return mult * at2->value * isqrt (at->level * 2);
              }
          }
    }

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

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)
{
  archetype *at = archetype::find (rp->arch_name [idx]);

  if (at)
    if (artifactlist *al = find_artifactlist (at->type))
      for (artifact *art = al->items; art; art = art->next)
        if (art->item->name == rp->title)
          return art;

  return 0;
}

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.28
Committed:	Mon Oct 12 14:00:57 2009 UTC (14 years, 7 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-2_82, rel-2_81
Changes since 1.27:	+7 -6 lines
Log Message:	clarify license
#	Content
1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*
4	* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*
8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* the terms of the Affero GNU General Public License as published by the
10	* Free Software Foundation, either version 3 of the License, or (at your
11	* option) any later version.
12	*
13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.
17	*
18	* You should have received a copy of the Affero GNU General Public License
19	* and the GNU General Public License along with this program. If not, see
20	* <http://www.gnu.org/licenses/>.
21	*
22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/
24
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
27	* more generally useful.
28	*
29	* Nov 1995 - file created by b.t. thomas@astro.psu.edu
30	*/
31
32
33	/* Our definition of 'formula' is any product of an alchemical process.
34	* Ingredients are just comma delimited list of archetype (or object)
35	* names.
36	*/
37
38	/* Example 'formula' entry in libdir/formulae:
39	* object transparency
40	* chance 10
41	* ingred dust of beholdereye,gem
42	* arch potion_generic
43	*/
44
45	#include <cctype>
46
47	#include <global.h>
48	#include <object.h>
49
50	static void build_stringlist (const char str, char *result_list, size_t result_size);
51
52	static recipelist *formulalist;
53
54	static recipelist *
55	init_recipelist (void)
56	{
57	recipelist *tl = new recipelist;
58
59	tl->total_chance = 0;
60	tl->number = 0;
61	tl->items = 0;
62	tl->next = 0;
63
64	return tl;
65	}
66
67	static recipe *
68	get_empty_formula (void)
69	{
70	recipe *t = new recipe;
71
72	t->chance = 0;
73	t->index = 0;
74	t->transmute = 0;
75	t->yield = 0;
76	t->diff = 0;
77	t->exp = 0;
78	t->keycode = 0;
79	t->title = NULL;
80	t->arch_names = 0;
81	t->arch_name = NULL;
82	t->skill = NULL;
83	t->cauldron = NULL;
84	t->ingred = NULL;
85	t->next = NULL;
86	return t;
87	}
88
89	/* get_formulalist() - returns pointer to the formula list */
90	recipelist *
91	get_formulalist (int i)
92	{
93	recipelist *fl = formulalist;
94	int number = i;
95
96	while (fl && number > 1)
97	{
98	if (!(fl = fl->next))
99	break;
100	number--;
101	}
102
103	return fl;
104	}
105
106	/* check_recipe() - makes sure we actually have the requested artifact
107	* and archetype. */
108	static int
109	check_recipe (const recipe *rp)
110	{
111	size_t i;
112	int result = 1;
113
114	for (i = 0; i < rp->arch_names; i++)
115	{
116	if (archetype::find (rp->arch_name[i]))
117	{
118	artifact *art = locate_recipe_artifact (rp, i);
119
120	if (!art && rp->title != shstr_NONE)
121	{
122	LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title);
123	result = 0;
124	}
125	}
126	else
127	{
128	LOG (llevError, "WARNING: Can't find archetype %s for formula %s\n", rp->arch_name[i], &rp->title);
129	result = 0;
130	}
131	}
132
133	return result;
134	}
135
136	/*
137	* init_formulae() - Builds up the lists of formula from the file in
138	* the libdir. -b.t.
139	*/
140	void
141	init_formulae (void)
142	{
143	static int has_been_done = 0;
144	FILE *fp;
145	char filename[MAX_BUF], buf[MAX_BUF], cp, next;
146	recipe *formula = NULL;
147	recipelist *fl = init_recipelist ();
148	linked_char *tmp;
149	int value, comp;
150
151	if (!formulalist)
152	formulalist = fl;
153
154	if (has_been_done)
155	return;
156	else
157	has_been_done = 1;
158
159	sprintf (filename, "%s/formulae", settings.datadir);
160	LOG (llevDebug, "Reading alchemical formulae from %s...\n", filename);
161	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)
162	{
163	LOG (llevError, "Can't open %s.\n", filename);
164	return;
165	}
166
167	while (fgets (buf, MAX_BUF, fp) != NULL)
168	{
169	if (*buf == '#')
170	continue;
171	if ((cp = strchr (buf, '\n')) != NULL)
172	*cp = '\0';
173	cp = buf;
174	while (cp == ' ') / Skip blanks */
175	cp++;
176
177	if (!strncmp (cp, "object", 6))
178	{
179	formula = get_empty_formula ();
180	formula->title = strchr (cp, ' ') + 1;
181	}
182	else if (!strncmp (cp, "keycode", 7))
183	formula->keycode = strchr (cp, ' ') + 1;
184	else if (sscanf (cp, "trans %d", &value))
185	formula->transmute = (uint16) value;
186	else if (sscanf (cp, "yield %d", &value))
187	formula->yield = (uint16) value;
188	else if (sscanf (cp, "chance %d", &value))
189	formula->chance = (uint16) value;
190	else if (sscanf (cp, "exp %d", &value))
191	formula->exp = (uint16) value;
192	else if (sscanf (cp, "diff %d", &value))
193	formula->diff = (uint16) value;
194	else if (!strncmp (cp, "ingred", 6))
195	{
196	int numb_ingred = 1;
197
198	cp = strchr (cp, ' ') + 1;
199	do
200	{
201	if ((next = strchr (cp, ',')) != NULL)
202	{
203	*(next++) = '\0';
204	numb_ingred++;
205	}
206
207	tmp = new linked_char;
208
209	tmp->name = cp;
210	tmp->next = formula->ingred;
211	formula->ingred = tmp;
212	/* each ingredient's ASCII value is coadded. Later on this
213	* value will be used allow us to search the formula lists
214	* quickly for the right recipe.
215	*/
216	formula->index += strtoint (cp);
217	}
218	while ((cp = next) != NULL);
219
220	/* now find the correct (# of ingred ordered) formulalist */
221	fl = formulalist;
222	while (numb_ingred != 1)
223	{
224	if (!fl->next)
225	fl->next = init_recipelist ();
226
227	fl = fl->next;
228	numb_ingred--;
229	}
230
231	fl->total_chance += formula->chance;
232	fl->number++;
233	formula->next = fl->items;
234	fl->items = formula;
235	}
236	else if (!strncmp (cp, "arch", 4))
237	{
238	build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names);
239	check_recipe (formula);
240	}
241	else if (!strncmp (cp, "skill", 5))
242	formula->skill = strchr (cp, ' ') + 1;
243	else if (!strncmp (cp, "cauldron", 8))
244	formula->cauldron = strchr (cp, ' ') + 1;
245	else
246	LOG (llevError, "Unknown input in file %s: %s\n", filename, buf);
247	}
248
249	LOG (llevDebug, "done.\n");
250	close_and_delete (fp, comp);
251	/* Lastly, lets check for problems in formula we got */
252	check_formulae ();
253	}
254
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	*/
262	void
263	check_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	/* Find a treasure with a matching name. The 'depth' parameter is
289	* only there to prevent infinite loops in treasure lists (a list
290	* referencing another list pointing back to the first one). */
291	archetype *
292	find_treasure_by_name (const treasure t, const char name, int depth)
293	{
294	if (depth > 10)
295	return 0;
296
297	while (t)
298	{
299	if (t->name)
300	{
301	if (treasurelist *tl = treasurelist::find (t->name))
302	if (tl->items)
303	if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1))
304	return at;
305	}
306	else
307	{
308	if (t->item && !strcasecmp (t->item->object::name, name))
309	return t->item;
310	}
311
312	if (t->next_yes)
313	if (archetype *at = find_treasure_by_name (t->next_yes, name, depth))
314	return at;
315
316	if (t->next_no)
317	if (archetype *at = find_treasure_by_name (t->next_no, name, depth))
318	return at;
319
320	t = t->next;
321	}
322
323	return 0;
324	}
325
326	/* If several archetypes have the same name, the value of the first
327	* one with that name will be returned. This happens for the
328	* mushrooms (mushroom_1, mushroom_2 and mushroom_3). For the
329	* monsters' body parts, there may be several monsters with the same
330	* name. This is not a problem if these monsters have the same level
331	* (e.g. sage & c_sage) or if only one of the monsters generates the
332	* body parts that we are looking for (e.g. big_dragon and
333	* big_dragon_worthless). */
334	long
335	find_ingred_cost (const char *name)
336	{
337	archetype *at2;
338	artifactlist *al;
339	artifact *art;
340	long mult;
341	char *cp;
342	char part1[100];
343	char part2[100];
344
345	/* same as atoi(), but skip number */
346	mult = 0;
347	while (isdigit (*name))
348	{
349	mult = 10 * mult + (*name - '0');
350	name++;
351	}
352
353	if (mult > 0)
354	name++;
355	else
356	mult = 1;
357
358	/* first, try to match the name of an archetype */
359	for_all_archetypes (at)
360	{
361	if (at->title != NULL)
362	{
363	/* inefficient, but who cares? */
364	sprintf (part1, "%s %s", &at->object::name, &at->title);
365	if (!strcasecmp (part1, name))
366	return mult * at->value;
367	}
368	if (!strcasecmp (at->object::name, name))
369	return mult * at->value;
370	}
371
372	/* second, try to match an artifact ("arch of something") */
373	cp = strstr (name, " of ");
374	if (cp != NULL)
375	{
376	strcpy (part1, name);
377	part1[cp - name] = '\0';
378	strcpy (part2, cp + 4);
379
380	/* find the first archetype matching the first part of the name */
381	for_all_archetypes (at)
382	if (at->object::name.eq_nc (part1) && !at->title)
383	{
384	/* find the first artifact derived from that archetype (same type) */
385	for (al = first_artifactlist; al; al = al->next)
386	if (al->type == at->type)
387	{
388	for (art = al->items; art; art = art->next)
389	if (!strcasecmp (art->item->name, part2))
390	return mult * at->value * art->item->value;
391	}
392	}
393	}
394
395	/* third, try to match a body part ("arch's something") */
396	cp = strstr (name, "'s ");
397	if (cp)
398	{
399	strcpy (part1, name);
400	part1[cp - name] = '\0';
401	strcpy (part2, cp + 3);
402	/* examine all archetypes matching the first part of the name */
403	for_all_archetypes (at)
404	if (at->object::name.eq_nc (part1) && !at->title)
405	{
406	if (at->randomitems)
407	{
408	at2 = find_treasure_by_name (at->randomitems->items, part2, 0);
409	if (at2)
410	return mult * at2->value * isqrt (at->level * 2);
411	}
412	}
413	}
414
415	/* failed to find any matching items -- formula should be checked */
416	return -1;
417	}
418
419	const char *
420	ingred_name (const char *name)
421	{
422	const char *cp = name;
423
424	if (atoi (cp))
425	cp = strchr (cp, ' ') + 1;
426
427	return cp;
428	}
429
430	/* strtoint() - we use this to convert buf into an integer
431	* equal to the coadded sum of the (lowercase) character
432	* ASCII values in buf (times prepended integers).
433	*/
434
435	int
436	strtoint (const char *buf)
437	{
438	const char *cp = ingred_name (buf);
439	int val = 0, len = strlen (cp), mult = numb_ingred (buf);
440
441	while (len)
442	{
443	val += tolower (*cp);
444	cp++;
445	len--;
446	}
447	return val * mult;
448	}
449
450	artifact *
451	locate_recipe_artifact (const recipe *rp, size_t idx)
452	{
453	archetype *at = archetype::find (rp->arch_name [idx]);
454
455	if (at)
456	if (artifactlist *al = find_artifactlist (at->type))
457	for (artifact *art = al->items; art; art = art->next)
458	if (art->item->name == rp->title)
459	return art;
460
461	return 0;
462	}
463
464	int
465	numb_ingred (const char *buf)
466	{
467	int numb;
468
469	if ((numb = atoi (buf)))
470	return numb;
471	else
472	return 1;
473	}
474
475	recipelist *
476	get_random_recipelist (void)
477	{
478	recipelist *fl = NULL;
479	int number = 0, roll = 0;
480
481	/* first, determine # of recipelist we have */
482	for (fl = get_formulalist (1); fl; fl = fl->next)
483	number++;
484
485	/* now, randomly choose one */
486	if (number > 0)
487	roll = rndm (number);
488
489	fl = get_formulalist (1);
490	while (roll && fl)
491	{
492	if (fl->next)
493	fl = fl->next;
494	else
495	break;
496	roll--;
497	}
498	if (!fl) /* failed! */
499	LOG (llevError, "get_random_recipelist(): no recipelists found!\n");
500	else if (fl->total_chance == 0)
501	fl = get_random_recipelist ();
502
503	return fl;
504	}
505
506	recipe *
507	get_random_recipe (recipelist * rpl)
508	{
509	recipelist *fl = rpl;
510	recipe *rp = NULL;
511	int r = 0;
512
513	/* looks like we have to choose a random one */
514	if (fl == NULL)
515	if ((fl = get_random_recipelist ()) == NULL)
516	return rp;
517
518	if (fl->total_chance > 0)
519	{
520	r = rndm (fl->total_chance);
521	for (rp = fl->items; rp; rp = rp->next)
522	{
523	r -= rp->chance;
524	if (r < 0)
525	break;
526	}
527	}
528	return rp;
529	}
530
531	void
532	free_all_recipes (void)
533	{
534	recipelist fl = formulalist, flnext;
535	recipe formula = NULL, next;
536	linked_char lchar, charnext;
537
538	LOG (llevDebug, "Freeing all the recipes\n");
539	for (fl = formulalist; fl != NULL; fl = flnext)
540	{
541	flnext = fl->next;
542
543	for (formula = fl->items; formula != NULL; formula = next)
544	{
545	next = formula->next;
546
547	free (formula->arch_name[0]);
548	free (formula->arch_name);
549
550	for (lchar = formula->ingred; lchar; lchar = charnext)
551	{
552	charnext = lchar->next;
553	delete lchar;
554	}
555	delete formula;
556	}
557
558	delete fl;
559	}
560	}
561
562	/**
563	* Split a comma separated string list into words.
564	*
565	* @param str the string to split
566	*
567	* @param result_list pointer to return value for the newly created list; the
568	* caller is responsible for freeing both result_list and *result_list.
569	*
570	* @param result_size pointer to return value for the size of the newly
571	* created list
572	*/
573	static void
574	build_stringlist (const char str, char *result_list, size_t result_size)
575	{
576	char *dup;
577	char *p;
578	size_t size;
579	size_t i;
580
581	dup = strdup (str);
582	if (dup == NULL)
583	fatal (OUT_OF_MEMORY);
584
585	size = 0;
586	for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ","))
587	size++;
588
589	result_list = (char ) malloc (size sizeof (*result_list));
590
591	*result_size = size;
592
593	for (i = 0; i < size; i++)
594	{
595	(*result_list)[i] = dup;
596	dup = dup + strlen (dup) + 1;
597	}
598	}