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;

  object_thawer thawer (settings.datadir, "formulae");

  if (!thawer)
    {
      LOG (llevError, "Can't open %s.\n", thawer.name);
      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: ;
    }

  /* 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.40
Committed:	Wed Apr 28 19:49:50 2010 UTC (14 years ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.39:	+2 -6 lines
Log Message:	less MAX_BUF, more object_thawer dir/file convenience
#	Content
1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*
4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992 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 ()
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 ()
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 = 0;
80	t->arch_names = 0;
81	t->arch_name = 0;
82	t->skill = 0;
83	t->cauldron = 0;
84	t->ingred = 0;
85	t->next = 0;
86
87	return t;
88	}
89
90	/* get_formulalist() - returns pointer to the formula list */
91	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
104	return fl;
105	}
106
107	/* check_recipe() - makes sure we actually have the requested artifact
108	* and archetype. */
109	static int
110	check_recipe (const recipe *rp)
111	{
112	size_t i;
113	int result = 1;
114
115	for (i = 0; i < rp->arch_names; i++)
116	{
117	if (archetype::find (rp->arch_name[i]))
118	{
119	artifact *art = locate_recipe_artifact (rp, i);
120
121	if (!art && rp->title != shstr_NONE)
122	{
123	LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title);
124	result = 0;
125	}
126	}
127	else
128	{
129	LOG (llevError, "WARNING: Can't find archetype %s for formula %s\n", rp->arch_name[i], &rp->title);
130	result = 0;
131	}
132	}
133
134	return result;
135	}
136
137	/* 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	static void
145	check_formulae ()
146	{
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	/*
171	* init_formulae() - Builds up the lists of formula from the file in
172	* the libdir. -b.t.
173	*/
174	void
175	init_formulae ()
176	{
177	static int has_been_done = 0;
178	FILE *fp;
179	char filename[MAX_BUF], buf[MAX_BUF], cp, next;
180	recipelist *fl = init_recipelist ();
181	linked_char *tmp;
182	int value, comp;
183
184	if (!formulalist)
185	formulalist = fl;
186
187	if (has_been_done)
188	return;
189	else
190	has_been_done = 1;
191
192	object_thawer thawer (settings.datadir, "formulae");
193
194	if (!thawer)
195	{
196	LOG (llevError, "Can't open %s.\n", thawer.name);
197	return;
198	}
199
200	while (thawer.kw)
201	{
202	if (thawer.kw != KW_object)
203	if (!thawer.parse_error ("formulae file"))
204	break;
205
206	recipe *formula = get_empty_formula ();
207	thawer.get (formula->title);
208
209	for (;;)
210	{
211	thawer.next ();
212
213	switch (thawer.kw)
214	{
215	case KW_keycode: thawer.get (formula->keycode ); break;
216	case KW_trans: thawer.get (formula->transmute); break;
217	case KW_yield: thawer.get (formula->yield ); break;
218	case KW_chance: thawer.get (formula->chance ); break;
219	case KW_exp: thawer.get (formula->exp ); break;
220	case KW_diff: thawer.get (formula->diff ); break;
221	case KW_skill: thawer.get (formula->skill ); break;
222	case KW_cauldron: thawer.get (formula->cauldron ); break;
223
224	case KW_arch:
225	{
226	build_stringlist (thawer.value_nn, &formula->arch_name, &formula->arch_names);
227	check_recipe (formula);
228	}
229	break;
230
231	case KW_ingred:
232	if (thawer.value)
233	{
234	int numb_ingred = 1;
235	char *cp = thawer.value;
236
237	do
238	{
239	if ((next = strchr (cp, ',')))
240	{
241	*next++ = '\0';
242	++numb_ingred;
243	}
244
245	tmp = new linked_char;
246
247	tmp->name = cp;
248	tmp->next = formula->ingred;
249	formula->ingred = tmp;
250	/* each ingredient's ASCII value is coadded. Later on this
251	* value will be used allow us to search the formula lists
252	* quickly for the right recipe.
253	*/
254	formula->index += strtoint (cp);
255	}
256	while ((cp = next));
257
258	/* now find the correct (# of ingred ordered) formulalist */
259	fl = formulalist;
260	while (numb_ingred != 1)
261	{
262	if (!fl->next)
263	fl->next = init_recipelist ();
264
265	fl = fl->next;
266	numb_ingred--;
267	}
268
269	fl->total_chance += formula->chance;
270	fl->number++;
271	formula->next = fl->items;
272	fl->items = formula;
273	}
274	break;
275
276	default:
277	delete formula;
278	case KW_EOF:
279	case KW_object:
280	goto next_object;
281	}
282	}
283
284	next_object: ;
285	}
286
287	/* Lastly, lets check for problems in formula we got */
288	check_formulae ();
289	}
290
291	/* Find a treasure with a matching name. The 'depth' parameter is
292	* only there to prevent infinite loops in treasure lists (a list
293	* referencing another list pointing back to the first one). */
294	static archetype *
295	find_treasure_by_name (const treasure t, const char name, int depth)
296	{
297	if (depth > 10)
298	return 0;
299
300	while (t)
301	{
302	if (t->name)
303	{
304	if (treasurelist *tl = treasurelist::find (t->name))
305	if (tl->items)
306	if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1))
307	return at;
308	}
309	else
310	{
311	if (t->item && !strcasecmp (t->item->object::name, name))
312	return t->item;
313	}
314
315	if (t->next_yes)
316	if (archetype *at = find_treasure_by_name (t->next_yes, name, depth))
317	return at;
318
319	if (t->next_no)
320	if (archetype *at = find_treasure_by_name (t->next_no, name, depth))
321	return at;
322
323	t = t->next;
324	}
325
326	return 0;
327	}
328
329	static const char *
330	ingred_name (const char *name)
331	{
332	const char *cp = name;
333
334	if (atoi (cp))
335	cp = strchr (cp, ' ') + 1;
336
337	return cp;
338	}
339
340	static int
341	numb_ingred (const char *buf)
342	{
343	int numb;
344
345	if ((numb = atoi (buf)))
346	return numb;
347	else
348	return 1;
349	}
350
351	/* strtoint() - we use this to convert buf into an integer
352	* equal to the coadded sum of the (lowercase) character
353	* ASCII values in buf (times prepended integers).
354	* Some kind of hashing.
355	*/
356	int
357	strtoint (const char *buf)
358	{
359	const char *cp = ingred_name (buf);
360	int val = 0, len = strlen (cp), mult = numb_ingred (buf);
361
362	while (len)
363	{
364	val += tolower (*cp);
365	cp++;
366	len--;
367	}
368
369	return val * mult;
370	}
371
372	artifact *
373	locate_recipe_artifact (const recipe *rp, size_t idx)
374	{
375	archetype *at = archetype::find (rp->arch_name [idx]);
376
377	if (at)
378	if (artifactlist *al = find_artifactlist (at->type))
379	for (artifact *art = al->items; art; art = art->next)
380	if (art->item->name == rp->title)
381	return art;
382
383	return 0;
384	}
385
386	static recipelist *
387	get_random_recipelist ()
388	{
389	recipelist *fl = NULL;
390	int number = 0, roll = 0;
391
392	/* first, determine # of recipelist we have */
393	for (fl = get_formulalist (1); fl; fl = fl->next)
394	number++;
395
396	/* now, randomly choose one */
397	if (number > 0)
398	roll = rndm (number);
399
400	fl = get_formulalist (1);
401	while (roll && fl)
402	{
403	if (fl->next)
404	fl = fl->next;
405	else
406	break;
407	roll--;
408	}
409	if (!fl) /* failed! */
410	LOG (llevError, "get_random_recipelist(): no recipelists found!\n");
411	else if (fl->total_chance == 0)
412	fl = get_random_recipelist ();
413
414	return fl;
415	}
416
417	recipe *
418	get_random_recipe (recipelist * rpl)
419	{
420	recipelist *fl = rpl;
421	recipe *rp = NULL;
422	int r = 0;
423
424	/* looks like we have to choose a random one */
425	if (fl == NULL)
426	if ((fl = get_random_recipelist ()) == NULL)
427	return rp;
428
429	if (fl->total_chance > 0)
430	{
431	r = rndm (fl->total_chance);
432	for (rp = fl->items; rp; rp = rp->next)
433	{
434	r -= rp->chance;
435	if (r < 0)
436	break;
437	}
438	}
439	return rp;
440	}
441
442	/**
443	* Split a comma separated string list into words.
444	*
445	* @param str the string to split
446	*
447	* @param result_list pointer to return value for the newly created list; the
448	* caller is responsible for freeing both result_list and *result_list.
449	*
450	* @param result_size pointer to return value for the size of the newly
451	* created list
452	*/
453	static void
454	build_stringlist (const char str, char *result_list, size_t result_size)
455	{
456	char *dup;
457	char *p;
458	size_t size;
459	size_t i;
460
461	dup = strdup (str);
462	if (dup == NULL)
463	fatal ("out of memory");
464
465	size = 0;
466	for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ","))
467	size++;
468
469	result_list = (char )malloc (size sizeof (*result_list));
470
471	*result_size = size;
472
473	for (i = 0; i < size; i++)
474	{
475	(*result_list)[i] = dup;
476	dup = dup + strlen (dup) + 1;
477	}
478	}