server/common/recipe.C

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
 * Copyright (©) 1992 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 ()
{
  recipelist *tl = new recipelist;

  tl->total_chance = 0;
  tl->number = 0;
  tl->items  = 0;
  tl->next   = 0;

  return tl;
}

static recipe *
get_empty_formula ()
{
  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      = 0;
  t->arch_names = 0;
  t->arch_name  = 0;
  t->skill      = 0;
  t->cauldron   = 0;
  t->ingred     = 0;
  t->next       = 0;

  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;
}

/* 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.
 */
static void
check_formulae ()
{
  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");

}

/*
 * init_formulae() - Builds up the lists of formula from the file in 
 * the libdir. -b.t. 
 */
void
init_formulae ()
{
  static int has_been_done = 0;
  FILE *fp;
  char filename[MAX_BUF], buf[MAX_BUF], *cp, *next;
  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);

  object_thawer thawer (filename);

  if (!thawer)
    {
      LOG (llevError, "Can't open %s.\n", filename);
      return;
    }

  while (thawer.kw)
    {
      if (thawer.kw != KW_object)
        if (!thawer.parse_error ("formulae file"))
          break;

      recipe *formula = get_empty_formula ();
      thawer.get (formula->title);

      for (;;)
        {
          thawer.next ();

          switch (thawer.kw)
            {
              case KW_keycode:  thawer.get (formula->keycode  ); break;
              case KW_trans:    thawer.get (formula->transmute); break;
              case KW_yield:    thawer.get (formula->yield    ); break;
              case KW_chance:   thawer.get (formula->chance   ); break;
              case KW_exp:      thawer.get (formula->exp      ); break;
              case KW_diff:     thawer.get (formula->diff     ); break;
              case KW_skill:    thawer.get (formula->skill    ); break;
              case KW_cauldron: thawer.get (formula->cauldron ); break;

              case KW_arch:
                {
                  build_stringlist (thawer.value_nn, &formula->arch_name, &formula->arch_names);
                  check_recipe (formula);
                }
                break;

              case KW_ingred:
                if (thawer.value)
                  {
                    int numb_ingred = 1;
                    char *cp = thawer.value;

                    do
                      {
                        if ((next = strchr (cp, ',')))
                          {
                            *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));

                    /* 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;
                  }
                break;

              default:
                delete formula;
              case KW_EOF:
              case KW_object:
                goto next_object;
            }
        }

next_object: ;
    }

  LOG (llevDebug, "done.\n");
  /* Lastly, lets check for problems in formula we got */
  check_formulae ();
}

/* 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). */
static 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;
}

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

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

  return cp;
}

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

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

/* 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).
 * Some kind of hashing.
 */
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;
}

static recipelist *
get_random_recipelist ()
{
  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;
}

/**
 * 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.39
Committed:	Fri Apr 16 07:32:03 2010 UTC (14 years, 1 month ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.38:	+1 -0 lines
Log Message:	sigh
#	User	Rev	Content
1	root	1.20	/*
2	root	1.24	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	root	1.21	*
4	root	1.35	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	root	1.34	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6			* Copyright (©) 1992 Frank Tore Johansen
7	root	1.21	*
8	root	1.28	* 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	root	1.21	*
13	root	1.23	* 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	root	1.21	*
18	root	1.28	* 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	root	1.21	*
22	root	1.24	* The authors can be reached via e-mail to <support@deliantra.net>
23	root	1.20	*/
24
25	elmex	1.1	/* 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	root	1.18	* object transparency
40	elmex	1.1	* chance 10
41			* ingred dust of beholdereye,gem
42			* arch potion_generic
43			*/
44
45	root	1.11	#include <cctype>
46
47	elmex	1.1	#include <global.h>
48			#include <object.h>
49
50	root	1.5	static void build_stringlist (const char str, char *result_list, size_t result_size);
51	elmex	1.1
52			static recipelist *formulalist;
53
54	root	1.5	static recipelist *
55	root	1.33	init_recipelist ()
56	root	1.5	{
57	root	1.3	recipelist *tl = new recipelist;
58
59	root	1.5	tl->total_chance = 0;
60			tl->number = 0;
61	root	1.19	tl->items = 0;
62			tl->next = 0;
63
64	elmex	1.1	return tl;
65			}
66
67	root	1.5	static recipe *
68	root	1.33	get_empty_formula ()
69	root	1.5	{
70	root	1.3	recipe *t = new recipe;
71
72	root	1.37	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 = 0;
80	elmex	1.1	t->arch_names = 0;
81	root	1.37	t->arch_name = 0;
82			t->skill = 0;
83			t->cauldron = 0;
84			t->ingred = 0;
85			t->next = 0;
86
87	elmex	1.1	return t;
88			}
89	root	1.5
90	elmex	1.1	/* get_formulalist() - returns pointer to the formula list */
91	root	1.5	recipelist *
92			get_formulalist (int i)
93			{
94			recipelist *fl = formulalist;
95			int number = i;
96
97			while (fl && number > 1)
98			{
99			if (!(fl = fl->next))
100			break;
101			number--;
102			}
103	root	1.18
104	elmex	1.1	return fl;
105			}
106
107			/* check_recipe() - makes sure we actually have the requested artifact
108			* and archetype. */
109	root	1.5	static int
110			check_recipe (const recipe *rp)
111			{
112			size_t i;
113	root	1.18	int result = 1;
114	root	1.5
115			for (i = 0; i < rp->arch_names; i++)
116			{
117	root	1.27	if (archetype::find (rp->arch_name[i]))
118	root	1.5	{
119			artifact *art = locate_recipe_artifact (rp, i);
120
121	root	1.27	if (!art && rp->title != shstr_NONE)
122	root	1.5	{
123	pippijn	1.12	LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title);
124	root	1.5	result = 0;
125	elmex	1.1	}
126	root	1.5	}
127			else
128			{
129	pippijn	1.12	LOG (llevError, "WARNING: Can't find archetype %s for formula %s\n", rp->arch_name[i], &rp->title);
130	root	1.5	result = 0;
131	elmex	1.1	}
132			}
133	root	1.5
134			return result;
135	elmex	1.1	}
136
137	root	1.29	/* check_formulae()- since we are doing a squential search on the
138			* formulae lists now, we have to be carefull that we dont have 2
139			* formula with the exact same index value. Under the new nbatches
140			* code, it is possible to have multiples of ingredients in a cauldron
141			* which could result in an index formula mismatch. We don't check for
142			* that possibility here. -b.t.
143			*/
144	root	1.30	static void
145	root	1.33	check_formulae ()
146	root	1.29	{
147			recipelist *fl;
148			recipe check, formula;
149			int numb = 1;
150
151			LOG (llevDebug, "Checking formulae lists...\n");
152
153			for (fl = formulalist; fl; fl = fl->next)
154			{
155			for (formula = fl->items; formula; formula = formula->next)
156			for (check = formula->next; check; check = check->next)
157			if (check->index == formula->index)
158			{
159			LOG (llevError, " ERROR: On %d ingred list: ", numb);
160			LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n",
161			formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index);
162			}
163			numb++;
164			}
165
166			LOG (llevDebug, "done.\n");
167
168			}
169
170	elmex	1.1	/*
171			* init_formulae() - Builds up the lists of formula from the file in
172			* the libdir. -b.t.
173			*/
174	root	1.5	void
175	root	1.33	init_formulae ()
176	root	1.5	{
177			static int has_been_done = 0;
178	elmex	1.1	FILE *fp;
179			char filename[MAX_BUF], buf[MAX_BUF], cp, next;
180	root	1.5	recipelist *fl = init_recipelist ();
181	elmex	1.1	linked_char *tmp;
182			int value, comp;
183
184	root	1.5	if (!formulalist)
185			formulalist = fl;
186
187			if (has_been_done)
188	elmex	1.1	return;
189	root	1.5	else
190			has_been_done = 1;
191
192			sprintf (filename, "%s/formulae", settings.datadir);
193	pippijn	1.12	LOG (llevDebug, "Reading alchemical formulae from %s...\n", filename);
194	root	1.37
195			object_thawer thawer (filename);
196
197			if (!thawer)
198	root	1.5	{
199			LOG (llevError, "Can't open %s.\n", filename);
200			return;
201			}
202
203	root	1.37	while (thawer.kw)
204	root	1.5	{
205	root	1.37	if (thawer.kw != KW_object)
206	root	1.38	if (!thawer.parse_error ("formulae file"))
207	root	1.37	break;
208
209			recipe *formula = get_empty_formula ();
210			thawer.get (formula->title);
211	root	1.5
212	root	1.37	for (;;)
213	root	1.5	{
214	root	1.37	thawer.next ();
215	root	1.5
216	root	1.37	switch (thawer.kw)
217	root	1.5	{
218	root	1.37	case KW_keycode: thawer.get (formula->keycode ); break;
219			case KW_trans: thawer.get (formula->transmute); break;
220			case KW_yield: thawer.get (formula->yield ); break;
221			case KW_chance: thawer.get (formula->chance ); break;
222			case KW_exp: thawer.get (formula->exp ); break;
223			case KW_diff: thawer.get (formula->diff ); break;
224			case KW_skill: thawer.get (formula->skill ); break;
225			case KW_cauldron: thawer.get (formula->cauldron ); break;
226
227			case KW_arch:
228	root	1.5	{
229	root	1.37	build_stringlist (thawer.value_nn, &formula->arch_name, &formula->arch_names);
230			check_recipe (formula);
231	root	1.5	}
232	root	1.37	break;
233	root	1.18
234	root	1.37	case KW_ingred:
235			if (thawer.value)
236			{
237			int numb_ingred = 1;
238			char *cp = thawer.value;
239
240			do
241			{
242			if ((next = strchr (cp, ',')))
243			{
244			*next++ = '\0';
245			++numb_ingred;
246			}
247
248			tmp = new linked_char;
249
250			tmp->name = cp;
251			tmp->next = formula->ingred;
252			formula->ingred = tmp;
253			/* each ingredient's ASCII value is coadded. Later on this
254			* value will be used allow us to search the formula lists
255			* quickly for the right recipe.
256			*/
257			formula->index += strtoint (cp);
258			}
259			while ((cp = next));
260
261			/* now find the correct (# of ingred ordered) formulalist */
262			fl = formulalist;
263			while (numb_ingred != 1)
264			{
265			if (!fl->next)
266			fl->next = init_recipelist ();
267
268			fl = fl->next;
269			numb_ingred--;
270			}
271
272			fl->total_chance += formula->chance;
273			fl->number++;
274			formula->next = fl->items;
275			fl->items = formula;
276			}
277			break;
278	root	1.5
279	root	1.37	default:
280	root	1.38	delete formula;
281	root	1.39	case KW_EOF:
282	root	1.38	case KW_object:
283	root	1.37	goto next_object;
284	root	1.5	}
285	root	1.37	}
286	root	1.18
287	root	1.37	next_object: ;
288	root	1.5	}
289	root	1.18
290	root	1.5	LOG (llevDebug, "done.\n");
291	elmex	1.1	/* Lastly, lets check for problems in formula we got */
292	root	1.5	check_formulae ();
293	elmex	1.1	}
294
295			/* Find a treasure with a matching name. The 'depth' parameter is
296			* only there to prevent infinite loops in treasure lists (a list
297			* referencing another list pointing back to the first one). */
298	root	1.31	static archetype *
299	root	1.5	find_treasure_by_name (const treasure t, const char name, int depth)
300	elmex	1.1	{
301			if (depth > 10)
302	elmex	1.10	return 0;
303
304			while (t)
305	elmex	1.1	{
306	elmex	1.10	if (t->name)
307	root	1.2	{
308	root	1.19	if (treasurelist *tl = treasurelist::find (t->name))
309			if (tl->items)
310			if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1))
311	elmex	1.10	return at;
312	root	1.2	}
313	elmex	1.1	else
314	root	1.2	{
315	root	1.22	if (t->item && !strcasecmp (t->item->object::name, name))
316	root	1.2	return t->item;
317			}
318	elmex	1.10
319			if (t->next_yes)
320	root	1.19	if (archetype *at = find_treasure_by_name (t->next_yes, name, depth))
321			return at;
322	elmex	1.10
323			if (t->next_no)
324	root	1.19	if (archetype *at = find_treasure_by_name (t->next_no, name, depth))
325			return at;
326
327	elmex	1.1	t = t->next;
328			}
329	root	1.19
330	elmex	1.10	return 0;
331	elmex	1.1	}
332
333	root	1.31	static const char *
334	root	1.5	ingred_name (const char *name)
335			{
336			const char *cp = name;
337
338			if (atoi (cp))
339			cp = strchr (cp, ' ') + 1;
340	root	1.25
341	elmex	1.1	return cp;
342			}
343
344	root	1.31	static int
345	root	1.29	numb_ingred (const char *buf)
346			{
347			int numb;
348
349			if ((numb = atoi (buf)))
350			return numb;
351			else
352			return 1;
353			}
354
355	elmex	1.1	/* strtoint() - we use this to convert buf into an integer
356			* equal to the coadded sum of the (lowercase) character
357			* ASCII values in buf (times prepended integers).
358	root	1.29	* Some kind of hashing.
359	elmex	1.1	*/
360	root	1.5	int
361			strtoint (const char *buf)
362			{
363			const char *cp = ingred_name (buf);
364			int val = 0, len = strlen (cp), mult = numb_ingred (buf);
365	elmex	1.1
366	root	1.5	while (len)
367			{
368			val += tolower (*cp);
369			cp++;
370			len--;
371			}
372	root	1.29
373	root	1.5	return val * mult;
374	elmex	1.1	}
375
376	root	1.5	artifact *
377			locate_recipe_artifact (const recipe *rp, size_t idx)
378			{
379	root	1.18	archetype *at = archetype::find (rp->arch_name [idx]);
380	elmex	1.1
381	root	1.18	if (at)
382	root	1.22	if (artifactlist *al = find_artifactlist (at->type))
383	root	1.18	for (artifact *art = al->items; art; art = art->next)
384			if (art->item->name == rp->title)
385			return art;
386	elmex	1.1
387	root	1.18	return 0;
388	elmex	1.1	}
389
390	root	1.31	static recipelist *
391	root	1.33	get_random_recipelist ()
392	root	1.5	{
393			recipelist *fl = NULL;
394			int number = 0, roll = 0;
395
396			/* first, determine # of recipelist we have */
397			for (fl = get_formulalist (1); fl; fl = fl->next)
398			number++;
399
400			/* now, randomly choose one */
401			if (number > 0)
402	root	1.15	roll = rndm (number);
403	root	1.5
404			fl = get_formulalist (1);
405			while (roll && fl)
406			{
407			if (fl->next)
408			fl = fl->next;
409			else
410			break;
411			roll--;
412			}
413			if (!fl) /* failed! */
414			LOG (llevError, "get_random_recipelist(): no recipelists found!\n");
415			else if (fl->total_chance == 0)
416			fl = get_random_recipelist ();
417
418			return fl;
419	elmex	1.1	}
420
421	root	1.5	recipe *
422			get_random_recipe (recipelist * rpl)
423			{
424			recipelist *fl = rpl;
425			recipe *rp = NULL;
426			int r = 0;
427
428			/* looks like we have to choose a random one */
429			if (fl == NULL)
430			if ((fl = get_random_recipelist ()) == NULL)
431			return rp;
432
433			if (fl->total_chance > 0)
434			{
435	root	1.15	r = rndm (fl->total_chance);
436	root	1.5	for (rp = fl->items; rp; rp = rp->next)
437			{
438			r -= rp->chance;
439			if (r < 0)
440			break;
441			}
442	elmex	1.1	}
443			return rp;
444			}
445
446			/**
447			* Split a comma separated string list into words.
448			*
449			* @param str the string to split
450			*
451			* @param result_list pointer to return value for the newly created list; the
452			* caller is responsible for freeing both result_list and *result_list.
453			*
454			* @param result_size pointer to return value for the size of the newly
455			* created list
456			*/
457	root	1.5	static void
458			build_stringlist (const char str, char *result_list, size_t result_size)
459	elmex	1.1	{
460	root	1.5	char *dup;
461			char *p;
462			size_t size;
463			size_t i;
464	elmex	1.1
465	root	1.11	dup = strdup (str);
466	root	1.5	if (dup == NULL)
467	root	1.36	fatal ("out of memory");
468	elmex	1.1
469	root	1.5	size = 0;
470			for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ","))
471			size++;
472	elmex	1.1
473	root	1.36	result_list = (char )malloc (size sizeof (*result_list));
474	root	1.3
475	root	1.5	*result_size = size;
476	elmex	1.1
477	root	1.5	for (i = 0; i < size; i++)
478			{
479			(*result_list)[i] = dup;
480			dup = dup + strlen (dup) + 1;
481	elmex	1.1	}
482			}