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

Comparing deliantra/server/common/recipe.C (file contents):
Revision 1.8 by root, Tue Dec 12 20:53:02 2006 UTC vs.
Revision 1.32 by root, Fri Nov 6 13:31:47 2009 UTC

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

Diff Legend

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

Comparing deliantra/server/common/recipe.C (file contents): Revision 1.8 by root, Tue Dec 12 20:53:02 2006 UTC vs. Revision 1.32 by root, Fri Nov 6 13:31:47 2009 UTC

Diff Legend

Comparing deliantra/server/common/recipe.C (file contents):
Revision 1.8 by root, Tue Dec 12 20:53:02 2006 UTC vs.
Revision 1.32 by root, Fri Nov 6 13:31:47 2009 UTC