[ViewVC] Diff of: cvs/deliantra/server/common/recipe.C

Comparing deliantra/server/common/recipe.C (file contents):
Revision 1.24 by root, Thu Nov 8 19:43:23 2007 UTC vs.
Revision 1.37 by root, Thu Apr 15 03:34:30 2010 UTC

…		…
1	/*	1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.	2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*	3	*
4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team	4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992,2007 Frank Tore Johansen	6	* Copyright (©) 1992 Frank Tore Johansen
7	*	7	*
8	* Deliantra is free software: you can redistribute it and/or modify	8	* Deliantra is free software: you can redistribute it and/or modify it under
9	* it under the terms of the GNU General Public License as published by	9	* the terms of the Affero GNU General Public License as published by the
10	* the Free Software Foundation, either version 3 of the License, or	10	* Free Software Foundation, either version 3 of the License, or (at your
11	* (at your option) any later version.	11	* option) any later version.
12	*	12	*
13	* This program is distributed in the hope that it will be useful,	13	* This program is distributed in the hope that it will be useful,
14	* but WITHOUT ANY WARRANTY; without even the implied warranty of	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	* GNU General Public License for more details.	16	* GNU General Public License for more details.
17	*	17	*
18	* You should have received a copy of the GNU General Public License	18	* You should have received a copy of the Affero GNU General Public License
19	* along with this program. If not, see <http://www.gnu.org/licenses/>.	19	* and the GNU General Public License along with this program. If not, see
		20	* <http://www.gnu.org/licenses/>.
20	*	21	*
21	* The authors can be reached via e-mail to <support@deliantra.net>	22	* The authors can be reached via e-mail to <support@deliantra.net>
22	*/	23	*/
23		24
24	/* Basic stuff for use with the alchemy code. Clearly some of this stuff	25	/* Basic stuff for use with the alchemy code. Clearly some of this stuff
49	static void build_stringlist (const char str, char *result_list, size_t result_size);	50	static void build_stringlist (const char str, char *result_list, size_t result_size);
50		51
51	static recipelist *formulalist;	52	static recipelist *formulalist;
52		53
53	static recipelist *	54	static recipelist *
54	init_recipelist (void)	55	init_recipelist ()
55	{	56	{
56	recipelist *tl = new recipelist;	57	recipelist *tl = new recipelist;
57		58
58	tl->total_chance = 0;	59	tl->total_chance = 0;
59	tl->number = 0;	60	tl->number = 0;
…		…
62		63
63	return tl;	64	return tl;
64	}	65	}
65		66
66	static recipe *	67	static recipe *
67	get_empty_formula (void)	68	get_empty_formula ()
68	{	69	{
69	recipe *t = new recipe;	70	recipe *t = new recipe;
70		71
71	t->chance = 0;	72	t->chance = 0;
72	t->index = 0;	73	t->index = 0;
73	t->transmute = 0;	74	t->transmute = 0;
74	t->yield = 0;	75	t->yield = 0;
75	t->diff = 0;	76	t->diff = 0;
76	t->exp = 0;	77	t->exp = 0;
77	t->keycode = 0;	78	t->keycode = 0;
78	t->title = NULL;	79	t->title = 0;
79	t->arch_names = 0;	80	t->arch_names = 0;
80	t->arch_name = NULL;	81	t->arch_name = 0;
81	t->skill = NULL;	82	t->skill = 0;
82	t->cauldron = NULL;	83	t->cauldron = 0;
83	t->ingred = NULL;	84	t->ingred = 0;
84	t->next = NULL;	85	t->next = 0;
		86
85	return t;	87	return t;
86	}	88	}
87		89
88	/* get_formulalist() - returns pointer to the formula list */	90	/* get_formulalist() - returns pointer to the formula list */
89	recipelist *	91	recipelist *
…		…
110	size_t i;	112	size_t i;
111	int result = 1;	113	int result = 1;
112		114
113	for (i = 0; i < rp->arch_names; i++)	115	for (i = 0; i < rp->arch_names; i++)
114	{	116	{
115	if (archetype::find (rp->arch_name[i]) != NULL)	117	if (archetype::find (rp->arch_name[i]))
116	{	118	{
117	artifact *art = locate_recipe_artifact (rp, i);	119	artifact *art = locate_recipe_artifact (rp, i);
118		120
119	if (!art && strcmp (rp->title, "NONE") != 0)	121	if (!art && rp->title != shstr_NONE)
120	{	122	{
121	LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title);	123	LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title);
122	result = 0;	124	result = 0;
123	}	125	}
124	}	126	}
…		…
128	result = 0;	130	result = 0;
129	}	131	}
130	}	132	}
131		133
132	return result;	134	return result;
133	}
134
135	/*
136	* init_formulae() - Builds up the lists of formula from the file in
137	* the libdir. -b.t.
138	*/
139	void
140	init_formulae (void)
141	{
142	static int has_been_done = 0;
143	FILE *fp;
144	char filename[MAX_BUF], buf[MAX_BUF], cp, next;
145	recipe *formula = NULL;
146	recipelist *fl = init_recipelist ();
147	linked_char *tmp;
148	int value, comp;
149
150	if (!formulalist)
151	formulalist = fl;
152
153	if (has_been_done)
154	return;
155	else
156	has_been_done = 1;
157
158	sprintf (filename, "%s/formulae", settings.datadir);
159	LOG (llevDebug, "Reading alchemical formulae from %s...\n", filename);
160	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)
161	{
162	LOG (llevError, "Can't open %s.\n", filename);
163	return;
164	}
165
166	while (fgets (buf, MAX_BUF, fp) != NULL)
167	{
168	if (*buf == '#')
169	continue;
170	if ((cp = strchr (buf, '\n')) != NULL)
171	*cp = '\0';
172	cp = buf;
173	while (cp == ' ') / Skip blanks */
174	cp++;
175
176	if (!strncmp (cp, "object", 6))
177	{
178	formula = get_empty_formula ();
179	formula->title = strchr (cp, ' ') + 1;
180	}
181	else if (!strncmp (cp, "keycode", 7))
182	formula->keycode = strchr (cp, ' ') + 1;
183	else if (sscanf (cp, "trans %d", &value))
184	formula->transmute = (uint16) value;
185	else if (sscanf (cp, "yield %d", &value))
186	formula->yield = (uint16) value;
187	else if (sscanf (cp, "chance %d", &value))
188	formula->chance = (uint16) value;
189	else if (sscanf (cp, "exp %d", &value))
190	formula->exp = (uint16) value;
191	else if (sscanf (cp, "diff %d", &value))
192	formula->diff = (uint16) value;
193	else if (!strncmp (cp, "ingred", 6))
194	{
195	int numb_ingred = 1;
196
197	cp = strchr (cp, ' ') + 1;
198	do
199	{
200	if ((next = strchr (cp, ',')) != NULL)
201	{
202	*(next++) = '\0';
203	numb_ingred++;
204	}
205
206	tmp = new linked_char;
207
208	tmp->name = cp;
209	tmp->next = formula->ingred;
210	formula->ingred = tmp;
211	/* each ingredient's ASCII value is coadded. Later on this
212	* value will be used allow us to search the formula lists
213	* quickly for the right recipe.
214	*/
215	formula->index += strtoint (cp);
216	}
217	while ((cp = next) != NULL);
218
219	/* now find the correct (# of ingred ordered) formulalist */
220	fl = formulalist;
221	while (numb_ingred != 1)
222	{
223	if (!fl->next)
224	fl->next = init_recipelist ();
225
226	fl = fl->next;
227	numb_ingred--;
228	}
229
230	fl->total_chance += formula->chance;
231	fl->number++;
232	formula->next = fl->items;
233	fl->items = formula;
234	}
235	else if (!strncmp (cp, "arch", 4))
236	{
237	build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names);
238	check_recipe (formula);
239	}
240	else if (!strncmp (cp, "skill", 5))
241	formula->skill = strchr (cp, ' ') + 1;
242	else if (!strncmp (cp, "cauldron", 8))
243	formula->cauldron = strchr (cp, ' ') + 1;
244	else
245	LOG (llevError, "Unknown input in file %s: %s\n", filename, buf);
246	}
247
248	LOG (llevDebug, "done.\n");
249	close_and_delete (fp, comp);
250	/* Lastly, lets check for problems in formula we got */
251	check_formulae ();
252	}	135	}
253		136
254	/* check_formulae()- since we are doing a squential search on the	137	/* check_formulae()- since we are doing a squential search on the
255	* formulae lists now, we have to be carefull that we dont have 2	138	* formulae lists now, we have to be carefull that we dont have 2
256	* formula with the exact same index value. Under the new nbatches	139	* formula with the exact same index value. Under the new nbatches
257	* code, it is possible to have multiples of ingredients in a cauldron	140	* code, it is possible to have multiples of ingredients in a cauldron
258	* which could result in an index formula mismatch. We don't check for	141	* which could result in an index formula mismatch. We don't check for
259	* that possibility here. -b.t.	142	* that possibility here. -b.t.
260	*/	143	*/
261	void	144	static void
262	check_formulae (void)	145	check_formulae ()
263	{	146	{
264	recipelist *fl;	147	recipelist *fl;
265	recipe check, formula;	148	recipe check, formula;
266	int numb = 1;	149	int numb = 1;
267		150
…		…
282		165
283	LOG (llevDebug, "done.\n");	166	LOG (llevDebug, "done.\n");
284		167
285	}	168	}
286		169
287	/* Borrowed (again) from the artifacts code for this */	170	/*
288		171	* init_formulae() - Builds up the lists of formula from the file in
		172	* the libdir. -b.t.
		173	*/
289	void	174	void
290	dump_alchemy (void)	175	init_formulae ()
291	{	176	{
292	recipelist *fl = formulalist;	177	static int has_been_done = 0;
293	recipe *formula = NULL;	178	FILE *fp;
		179	char filename[MAX_BUF], buf[MAX_BUF], cp, next;
		180	recipelist *fl = init_recipelist ();
294	linked_char *next;	181	linked_char *tmp;
295	int num_ingred = 1;	182	int value, comp;
296		183
297	fprintf (logfile, "\n");	184	if (!formulalist)
298	while (fl)	185	formulalist = fl;
		186
		187	if (has_been_done)
		188	return;
		189	else
		190	has_been_done = 1;
		191
		192	sprintf (filename, "%s/formulae", settings.datadir);
		193	LOG (llevDebug, "Reading alchemical formulae from %s...\n", filename);
		194
		195	object_thawer thawer (filename);
		196
		197	if (!thawer)
		198	{
		199	LOG (llevError, "Can't open %s.\n", filename);
		200	return;
299	{	201	}
300	fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n",
301	num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance);
302	for (formula = fl->items; formula; formula = formula->next)
303	{
304	artifact *art = NULL;
305	char buf[MAX_BUF];
306	size_t i;
307		202
308	for (i = 0; i < formula->arch_names; i++)	203	while (thawer.kw)
		204	{
		205	if (thawer.kw != KW_object)
		206	if (!thawer.parse_error ("formulae file", "formulae"))
		207	break;
		208
		209	recipe *formula = get_empty_formula ();
		210	thawer.get (formula->title);
		211
		212	for (;;)
		213	{
		214	thawer.next ();
		215
		216	switch (thawer.kw)
309	{	217	{
310	const char *string = formula->arch_name[i];	218	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;
311		226
312	if (archetype::find (string) != NULL)	227	case KW_arch:
313	{	228	{
		229	build_stringlist (thawer.value_nn, &formula->arch_name, &formula->arch_names);
314	art = locate_recipe_artifact (formula, i);	230	check_recipe (formula);
315	if (!art && strcmp (formula->title, "NONE"))
316	LOG (llevError, "Formula %s has no artifact!\n", &formula->title);
317	else
318	{
319	if (strcmp (formula->title, "NONE"))
320	sprintf (buf, "%s of %s", string, &formula->title);
321	else
322	sprintf (buf, "%s", string);
323	fprintf (logfile, "%-30s(%d) bookchance %3d ", buf, formula->index, formula->chance);
324	fprintf (logfile, "skill %s", &formula->skill);
325	fprintf (logfile, "\n");
326	if (formula->ingred != NULL)
327	{
328	int nval = 0, tval = 0;
329
330	fprintf (logfile, "\tIngred: ");
331	for (next = formula->ingred; next != NULL; next = next->next)
332	{
333	if (nval != 0)
334	fprintf (logfile, ",");
335	fprintf (logfile, "%s(%d)", &next->name, (nval = strtoint (next->name)));
336	tval += nval;
337	}
338	fprintf (logfile, "\n");
339	if (tval != formula->index)
340	fprintf (logfile, "WARNING:ingredient list and formula values not equal.\n");
341	}
342	if (formula->skill != NULL)
343	fprintf (logfile, "\tSkill Required: %s", &formula->skill);
344	if (formula->cauldron != NULL)
345	fprintf (logfile, "\tCauldron: %s\n", &formula->cauldron);
346	fprintf (logfile, "\tDifficulty: %d\t Exp: %d\n", formula->diff, formula->exp);
347	}
348	}	231	}
		232	break;
		233
		234	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
349	else	279	default:
350	LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title);	280	goto next_object;
351	}	281	}
352	}	282	}
353	fprintf (logfile, "\n");	283
354	fl = fl->next;	284	next_object: ;
355	num_ingred++;
356	}	285	}
		286
		287	LOG (llevDebug, "done.\n");
		288	/* Lastly, lets check for problems in formula we got */
		289	check_formulae ();
357	}	290	}
358		291
359	/* Find a treasure with a matching name. The 'depth' parameter is	292	/* Find a treasure with a matching name. The 'depth' parameter is
360	* only there to prevent infinite loops in treasure lists (a list	293	* only there to prevent infinite loops in treasure lists (a list
361	* referencing another list pointing back to the first one). */	294	* referencing another list pointing back to the first one). */
362	archetype *	295	static archetype *
363	find_treasure_by_name (const treasure t, const char name, int depth)	296	find_treasure_by_name (const treasure t, const char name, int depth)
364	{	297	{
365	if (depth > 10)	298	if (depth > 10)
366	return 0;	299	return 0;
367		300
…		…
392	}	325	}
393		326
394	return 0;	327	return 0;
395	}	328	}
396		329
397	/* If several archetypes have the same name, the value of the first
398	* one with that name will be returned. This happens for the
399	* mushrooms (mushroom_1, mushroom_2 and mushroom_3). For the
400	* monsters' body parts, there may be several monsters with the same
401	* name. This is not a problem if these monsters have the same level
402	* (e.g. sage & c_sage) or if only one of the monsters generates the
403	* body parts that we are looking for (e.g. big_dragon and
404	* big_dragon_worthless). */
405	long
406	find_ingred_cost (const char *name)
407	{
408	archetype *at2;
409	artifactlist *al;
410	artifact *art;
411	long mult;
412	char *cp;
413	char part1[100];
414	char part2[100];
415
416	/* same as atoi(), but skip number */
417	mult = 0;
418	while (isdigit (*name))
419	{
420	mult = 10 * mult + (*name - '0');
421	name++;
422	}
423
424	if (mult > 0)
425	name++;
426	else
427	mult = 1;
428
429	/* first, try to match the name of an archetype */
430	for_all_archetypes (at)
431	{
432	if (at->title != NULL)
433	{
434	/* inefficient, but who cares? */
435	sprintf (part1, "%s %s", &at->object::name, &at->title);
436	if (!strcasecmp (part1, name))
437	return mult * at->value;
438	}
439	if (!strcasecmp (at->object::name, name))
440	return mult * at->value;
441	}
442
443	/* second, try to match an artifact ("arch of something") */
444	cp = strstr (name, " of ");
445	if (cp != NULL)
446	{
447	strcpy (part1, name);
448	part1[cp - name] = '\0';
449	strcpy (part2, cp + 4);
450
451	/* find the first archetype matching the first part of the name */
452	for_all_archetypes (at)
453	if (!strcasecmp (at->object::name, part1) && at->title == NULL)
454	{
455	/* find the first artifact derived from that archetype (same type) */
456	for (al = first_artifactlist; al; al = al->next)
457	if (al->type == at->type)
458	{
459	for (art = al->items; art; art = art->next)
460	if (!strcasecmp (art->item->name, part2))
461	return mult * at->value * art->item->value;
462	}
463	}
464	}
465
466	/* third, try to match a body part ("arch's something") */
467	cp = strstr (name, "'s ");
468	if (cp)
469	{
470	strcpy (part1, name);
471	part1[cp - name] = '\0';
472	strcpy (part2, cp + 3);
473	/* examine all archetypes matching the first part of the name */
474	for_all_archetypes (at)
475	if (!strcasecmp (at->object::name, part1) && at->title == NULL)
476	{
477	if (at->randomitems)
478	{
479	at2 = find_treasure_by_name (at->randomitems->items, part2, 0);
480	if (at2)
481	return mult * at2->value * isqrt (at->level * 2);
482	}
483	}
484	}
485
486	/* failed to find any matching items -- formula should be checked */
487	return -1;
488	}
489
490	/* code copied from dump_alchemy() and modified by Raphael Quinet */
491	void
492	dump_alchemy_costs (void)
493	{
494	recipelist *fl = formulalist;
495	recipe *formula = NULL;
496	linked_char *next;
497	int num_ingred = 1;
498	int num_errors = 0;
499	long cost;
500	long tcost;
501
502	fprintf (logfile, "\n");
503	while (fl)
504	{
505	fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n",
506	num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance);
507	for (formula = fl->items; formula; formula = formula->next)
508	{
509	artifact *art = NULL;
510	archetype *at = NULL;
511	char buf[MAX_BUF];
512	size_t i;
513
514	for (i = 0; i < formula->arch_names; i++)
515	{
516	const char *string = formula->arch_name[i];
517
518	if ((at = archetype::find (string)) != NULL)
519	{
520	art = locate_recipe_artifact (formula, i);
521	if (!art && strcmp (formula->title, "NONE"))
522	LOG (llevError, "Formula %s has no artifact\n", &formula->title);
523	else
524	{
525	if (!strcmp (formula->title, "NONE"))
526	sprintf (buf, "%s", string);
527	else
528	sprintf (buf, "%s of %s", string, &formula->title);
529	fprintf (logfile, "\n%-40s bookchance %3d skill %s\n", buf, formula->chance, &(formula->skill));
530	if (formula->ingred != NULL)
531	{
532	tcost = 0;
533	for (next = formula->ingred; next != NULL; next = next->next)
534	{
535	cost = find_ingred_cost (next->name);
536	if (cost < 0)
537	num_errors++;
538	fprintf (logfile, "\t%-33s%5ld\n", &next->name, cost);
539	if (cost < 0 \|\| tcost < 0)
540	tcost = -1;
541	else
542	tcost += cost;
543	}
544	if (art != NULL && art->item != NULL)
545	cost = at->value * art->item->value;
546	else
547	cost = at->value;
548	fprintf (logfile, "\t\tBuying result costs: %5ld", cost);
549	if (formula->yield > 1)
550	{
551	fprintf (logfile, " to %ld (max %d items)\n", cost * formula->yield, formula->yield);
552	cost = cost * (formula->yield + 1L) / 2L;
553	}
554	else
555	fprintf (logfile, "\n");
556	fprintf (logfile, "\t\tIngredients cost: %5ld\n\t\tComment: ", tcost);
557	if (tcost < 0)
558	fprintf (logfile, "Could not find some ingredients. Check the formula!\n");
559	else if (tcost > cost)
560	fprintf (logfile, "Ingredients are much too expensive. Useless formula.\n");
561	else if (tcost * 2L > cost)
562	fprintf (logfile, "Ingredients are too expensive.\n");
563	else if (tcost * 10L < cost)
564	fprintf (logfile, "Ingredients are too cheap.\n");
565	else
566	fprintf (logfile, "OK.\n");
567	}
568	}
569	}
570	else
571	LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title);
572	}
573	}
574	fprintf (logfile, "\n");
575	fl = fl->next;
576	num_ingred++;
577	}
578	if (num_errors > 0)
579	fprintf (logfile, "WARNING: %d objects required by the formulae do not exist in the game.\n", num_errors);
580	}
581
582	const char *	330	static const char *
583	ingred_name (const char *name)	331	ingred_name (const char *name)
584	{	332	{
585	const char *cp = name;	333	const char *cp = name;
586		334
587	if (atoi (cp))	335	if (atoi (cp))
588	cp = strchr (cp, ' ') + 1;	336	cp = strchr (cp, ' ') + 1;
		337
589	return cp;	338	return cp;
		339	}
		340
		341	static int
		342	numb_ingred (const char *buf)
		343	{
		344	int numb;
		345
		346	if ((numb = atoi (buf)))
		347	return numb;
		348	else
		349	return 1;
590	}	350	}
591		351
592	/* strtoint() - we use this to convert buf into an integer	352	/* strtoint() - we use this to convert buf into an integer
593	* equal to the coadded sum of the (lowercase) character	353	* equal to the coadded sum of the (lowercase) character
594	* ASCII values in buf (times prepended integers).	354	* ASCII values in buf (times prepended integers).
		355	* Some kind of hashing.
595	*/	356	*/
596
597	int	357	int
598	strtoint (const char *buf)	358	strtoint (const char *buf)
599	{	359	{
600	const char *cp = ingred_name (buf);	360	const char *cp = ingred_name (buf);
601	int val = 0, len = strlen (cp), mult = numb_ingred (buf);	361	int val = 0, len = strlen (cp), mult = numb_ingred (buf);
…		…
604	{	364	{
605	val += tolower (*cp);	365	val += tolower (*cp);
606	cp++;	366	cp++;
607	len--;	367	len--;
608	}	368	}
		369
609	return val * mult;	370	return val * mult;
610	}	371	}
611		372
612	artifact *	373	artifact *
613	locate_recipe_artifact (const recipe *rp, size_t idx)	374	locate_recipe_artifact (const recipe *rp, size_t idx)
…		…
621	return art;	382	return art;
622		383
623	return 0;	384	return 0;
624	}	385	}
625		386
626	int
627	numb_ingred (const char *buf)
628	{
629	int numb;
630
631	if ((numb = atoi (buf)))
632	return numb;
633	else
634	return 1;
635	}
636
637	recipelist *	387	static recipelist *
638	get_random_recipelist (void)	388	get_random_recipelist ()
639	{	389	{
640	recipelist *fl = NULL;	390	recipelist *fl = NULL;
641	int number = 0, roll = 0;	391	int number = 0, roll = 0;
642		392
643	/* first, determine # of recipelist we have */	393	/* first, determine # of recipelist we have */
…		…
686	if (r < 0)	436	if (r < 0)
687	break;	437	break;
688	}	438	}
689	}	439	}
690	return rp;	440	return rp;
691	}
692
693	void
694	free_all_recipes (void)
695	{
696	recipelist fl = formulalist, flnext;
697	recipe formula = NULL, next;
698	linked_char lchar, charnext;
699
700	LOG (llevDebug, "Freeing all the recipes\n");
701	for (fl = formulalist; fl != NULL; fl = flnext)
702	{
703	flnext = fl->next;
704
705	for (formula = fl->items; formula != NULL; formula = next)
706	{
707	next = formula->next;
708
709	free (formula->arch_name[0]);
710	free (formula->arch_name);
711
712	for (lchar = formula->ingred; lchar; lchar = charnext)
713	{
714	charnext = lchar->next;
715	delete lchar;
716	}
717	delete formula;
718	}
719
720	delete fl;
721	}
722	}	441	}
723		442
724	/**	443	/**
725	* Split a comma separated string list into words.	444	* Split a comma separated string list into words.
726	*	445	*
…		…
740	size_t size;	459	size_t size;
741	size_t i;	460	size_t i;
742		461
743	dup = strdup (str);	462	dup = strdup (str);
744	if (dup == NULL)	463	if (dup == NULL)
745	fatal (OUT_OF_MEMORY);	464	fatal ("out of memory");
746		465
747	size = 0;	466	size = 0;
748	for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ","))	467	for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ","))
749	size++;	468	size++;
750		469
751	result_list = (char ) malloc (size sizeof (*result_list));	470	result_list = (char )malloc (size sizeof (*result_list));
752		471
753	*result_size = size;	472	*result_size = size;
754		473
755	for (i = 0; i < size; i++)	474	for (i = 0; i < size; i++)
756	{	475	{

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing deliantra/server/common/recipe.C (file contents): Revision 1.24 by root, Thu Nov 8 19:43:23 2007 UTC vs. Revision 1.37 by root, Thu Apr 15 03:34:30 2010 UTC

Diff Legend

Comparing deliantra/server/common/recipe.C (file contents):
Revision 1.24 by root, Thu Nov 8 19:43:23 2007 UTC vs.
Revision 1.37 by root, Thu Apr 15 03:34:30 2010 UTC