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

Comparing deliantra/server/common/recipe.C (file contents):
Revision 1.15 by root, Sat Jan 27 02:19:36 2007 UTC vs.
Revision 1.48 by root, Sat Nov 17 23:40:00 2018 UTC

…		…
		1	/*
		2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
		3	*
		4	* Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
		5	* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
		6	* Copyright (©) 2002 Mark Wedel & Crossfire Development Team
		7	* Copyright (©) 1992 Frank Tore Johansen
		8	*
		9	* Deliantra is free software: you can redistribute it and/or modify it under
		10	* the terms of the Affero GNU General Public License as published by the
		11	* Free Software Foundation, either version 3 of the License, or (at your
		12	* option) any later version.
		13	*
		14	* This program is distributed in the hope that it will be useful,
		15	* but WITHOUT ANY WARRANTY; without even the implied warranty of
		16	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
		17	* GNU General Public License for more details.
		18	*
		19	* You should have received a copy of the Affero GNU General Public License
		20	* and the GNU General Public License along with this program. If not, see
		21	* <http://www.gnu.org/licenses/>.
		22	*
		23	* The authors can be reached via e-mail to <support@deliantra.net>
		24	*/
		25
1	/* Basic stuff for use with the alchemy code. Clearly some of this stuff	26	/* 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	27	* could go into server/alchemy, but I left it here just in case it proves
3	* more generally useful.	28	* more generally useful.
4	*	29	*
5	* Nov 1995 - file created by b.t. thomas@astro.psu.edu	30	* Nov 1995 - file created by b.t. thomas@astro.psu.edu
6	*/	31	*/
7		32
8		33
9	/* Our definition of 'formula' is any product of an alchemical process.	34	/* Our definition of 'formula' is any product of an alchemical process.
10	* Ingredients are just comma delimited list of archetype (or object)	35	* Ingredients are just comma delimited list of archetype (or object)
11	* names.	36	* names.
12	*/	37	*/
13		38
14	/* Example 'formula' entry in libdir/formulae:	39	/* Example 'formula' entry in libdir/formulae:
15	* Object transparency	40	* object transparency
16	* chance 10	41	* chance 10
17	* ingred dust of beholdereye,gem	42	* ingred dust of beholdereye,gem
18	* arch potion_generic	43	* arch potion_generic
19	*/	44	*/
20		45
26	static void build_stringlist (const char str, char *result_list, size_t result_size);	51	static void build_stringlist (const char str, char *result_list, size_t result_size);
27		52
28	static recipelist *formulalist;	53	static recipelist *formulalist;
29		54
30	static recipelist *	55	static recipelist *
31	init_recipelist (void)	56	init_recipelist ()
32	{	57	{
33	recipelist *tl = new recipelist;	58	recipelist *tl = new recipelist;
34		59
35	tl->total_chance = 0;	60	tl->total_chance = 0;
36	tl->number = 0;	61	tl->number = 0;
37	tl->items = NULL;	62	tl->items = 0;
38	tl->next = NULL;	63	tl->next = 0;
		64
39	return tl;	65	return tl;
40	}	66	}
41		67
42	static recipe *	68	static recipe *
43	get_empty_formula (void)	69	get_empty_formula ()
44	{	70	{
45	recipe *t = new recipe;	71	recipe *t = new recipe;
46		72
47	t->chance = 0;	73	t->chance = 0;
48	t->index = 0;	74	t->index = 0;
49	t->transmute = 0;	75	t->transmute = 0;
50	t->yield = 0;	76	t->yield = 0;
51	t->diff = 0;	77	t->diff = 0;
52	t->exp = 0;	78	t->exp = 0;
53	t->keycode = 0;	79	t->keycode = 0;
54	t->title = NULL;	80	t->title = 0;
55	t->arch_names = 0;	81	t->arch_names = 0;
56	t->arch_name = NULL;	82	t->arch_name = 0;
57	t->skill = NULL;	83	t->skill = 0;
58	t->cauldron = NULL;	84	t->cauldron = 0;
59	t->ingred = NULL;	85	t->ingred = 0;
60	t->next = NULL;	86	t->next = 0;
		87
61	return t;	88	return t;
62	}	89	}
63		90
64	/* get_formulalist() - returns pointer to the formula list */	91	/* get_formulalist() - returns pointer to the formula list */
65
66	recipelist *	92	recipelist *
67	get_formulalist (int i)	93	get_formulalist (int i)
68	{	94	{
69	recipelist *fl = formulalist;	95	recipelist *fl = formulalist;
70	int number = i;	96	int number = i;
…		…
73	{	99	{
74	if (!(fl = fl->next))	100	if (!(fl = fl->next))
75	break;	101	break;
76	number--;	102	number--;
77	}	103	}
		104
78	return fl;	105	return fl;
79	}	106	}
80		107
81	/* check_recipe() - makes sure we actually have the requested artifact	108	/* check_recipe() - makes sure we actually have the requested artifact
82	* and archetype. */	109	* and archetype. */
83
84	static int	110	static int
85	check_recipe (const recipe *rp)	111	check_recipe (const recipe *rp)
86	{	112	{
87	size_t i;	113	size_t i;
88	int result;	114	int result = 1;
89		115
90	result = 1;
91	for (i = 0; i < rp->arch_names; i++)	116	for (i = 0; i < rp->arch_names; i++)
92	{	117	{
93	if (archetype::find (rp->arch_name[i]) != NULL)	118	if (archetype::find (rp->arch_name[i]))
94	{	119	{
95	artifact *art = locate_recipe_artifact (rp, i);	120	artifact *art = locate_recipe_artifact (rp, i);
96		121
97	if (!art && strcmp (rp->title, "NONE") != 0)	122	if (!art && rp->title != shstr_NONE)
98	{	123	{
99	LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title);	124	LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title);
100	result = 0;	125	result = 0;
101	}	126	}
102	}	127	}
…		…
106	result = 0;	131	result = 0;
107	}	132	}
108	}	133	}
109		134
110	return result;	135	return result;
111	}
112
113
114	/*
115	* init_formulae() - Builds up the lists of formula from the file in
116	* the libdir. -b.t.
117	*/
118
119	void
120	init_formulae (void)
121	{
122	static int has_been_done = 0;
123	FILE *fp;
124	char filename[MAX_BUF], buf[MAX_BUF], cp, next;
125	recipe *formula = NULL;
126	recipelist *fl = init_recipelist ();
127	linked_char *tmp;
128	int value, comp;
129
130	if (!formulalist)
131	formulalist = fl;
132
133	if (has_been_done)
134	return;
135	else
136	has_been_done = 1;
137
138	sprintf (filename, "%s/formulae", settings.datadir);
139	LOG (llevDebug, "Reading alchemical formulae from %s...\n", filename);
140	if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL)
141	{
142	LOG (llevError, "Can't open %s.\n", filename);
143	return;
144	}
145
146	while (fgets (buf, MAX_BUF, fp) != NULL)
147	{
148	if (*buf == '#')
149	continue;
150	if ((cp = strchr (buf, '\n')) != NULL)
151	*cp = '\0';
152	cp = buf;
153	while (cp == ' ') / Skip blanks */
154	cp++;
155
156	if (!strncmp (cp, "Object", 6))
157	{
158	formula = get_empty_formula ();
159	formula->title = strchr (cp, ' ') + 1;
160	}
161	else if (!strncmp (cp, "keycode", 7))
162	{
163	formula->keycode = strchr (cp, ' ') + 1;
164	}
165	else if (sscanf (cp, "trans %d", &value))
166	{
167	formula->transmute = (uint16) value;
168	}
169	else if (sscanf (cp, "yield %d", &value))
170	{
171	formula->yield = (uint16) value;
172	}
173	else if (sscanf (cp, "chance %d", &value))
174	{
175	formula->chance = (uint16) value;
176	}
177	else if (sscanf (cp, "exp %d", &value))
178	{
179	formula->exp = (uint16) value;
180	}
181	else if (sscanf (cp, "diff %d", &value))
182	{
183	formula->diff = (uint16) value;
184	}
185	else if (!strncmp (cp, "ingred", 6))
186	{
187	int numb_ingred = 1;
188
189	cp = strchr (cp, ' ') + 1;
190	do
191	{
192	if ((next = strchr (cp, ',')) != NULL)
193	{
194	*(next++) = '\0';
195	numb_ingred++;
196	}
197	tmp = new linked_char;
198
199	tmp->name = cp;
200	tmp->next = formula->ingred;
201	formula->ingred = tmp;
202	/* each ingredient's ASCII value is coadded. Later on this
203	* value will be used allow us to search the formula lists
204	* quickly for the right recipe.
205	*/
206	formula->index += strtoint (cp);
207	}
208	while ((cp = next) != NULL);
209	/* now find the correct (# of ingred ordered) formulalist */
210	fl = formulalist;
211	while (numb_ingred != 1)
212	{
213	if (!fl->next)
214	fl->next = init_recipelist ();
215	fl = fl->next;
216	numb_ingred--;
217	}
218	fl->total_chance += formula->chance;
219	fl->number++;
220	formula->next = fl->items;
221	fl->items = formula;
222	}
223	else if (!strncmp (cp, "arch", 4))
224	{
225	build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names);
226	check_recipe (formula);
227	}
228	else if (!strncmp (cp, "skill", 5))
229	{
230	formula->skill = strchr (cp, ' ') + 1;
231	}
232	else if (!strncmp (cp, "cauldron", 8))
233	{
234	formula->cauldron = strchr (cp, ' ') + 1;
235	}
236	else
237	LOG (llevError, "Unknown input in file %s: %s\n", filename, buf);
238	}
239	LOG (llevDebug, "done.\n");
240	close_and_delete (fp, comp);
241	/* Lastly, lets check for problems in formula we got */
242	check_formulae ();
243	}	136	}
244		137
245	/* check_formulae()- since we are doing a squential search on the	138	/* check_formulae()- since we are doing a squential search on the
246	* formulae lists now, we have to be carefull that we dont have 2	139	* formulae lists now, we have to be carefull that we dont have 2
247	* formula with the exact same index value. Under the new nbatches	140	* formula with the exact same index value. Under the new nbatches
248	* code, it is possible to have multiples of ingredients in a cauldron	141	* code, it is possible to have multiples of ingredients in a cauldron
249	* which could result in an index formula mismatch. We don't check for	142	* which could result in an index formula mismatch. We don't check for
250	* that possibility here. -b.t.	143	* that possibility here. -b.t.
251	*/	144	*/
252	void	145	static void
253	check_formulae (void)	146	check_formulae ()
254	{	147	{
255	recipelist *fl;	148	recipelist *fl;
256	recipe check, formula;	149	recipe check, formula;
257	int numb = 1;	150	int numb = 1;
258		151
259	LOG (llevDebug, "Checking formulae lists...\n");	152	LOG (llevDebug, "Checking formulae lists...\n");
260		153
261	for (fl = formulalist; fl != NULL; fl = fl->next)	154	for (fl = formulalist; fl; fl = fl->next)
262	{	155	{
263	for (formula = fl->items; formula != NULL; formula = formula->next)	156	for (formula = fl->items; formula; formula = formula->next)
264	for (check = formula->next; check != NULL; check = check->next)	157	for (check = formula->next; check; check = check->next)
265	if (check->index == formula->index)	158	if (check->index == formula->index)
266	{	159	{
267	LOG (llevError, " ERROR: On %d ingred list: ", numb);	160	LOG (llevError, " ERROR: On %d ingred list: ", numb);
268	LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n",	161	LOG (llevError, "Formulae [%s] of %s and [%s] of %s have matching index id (%d)\n",
269	formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index);	162	formula->arch_name[0], &formula->title, check->arch_name[0], &check->title, formula->index);
…		…
273		166
274	LOG (llevDebug, "done.\n");	167	LOG (llevDebug, "done.\n");
275		168
276	}	169	}
277		170
278	/* Borrowed (again) from the artifacts code for this */	171	/*
279		172	* init_formulae() - Builds up the lists of formula from the file in
		173	* the libdir. -b.t.
		174	*/
280	void	175	void
281	dump_alchemy (void)	176	init_formulae ()
282	{	177	{
283	recipelist *fl = formulalist;	178	static int has_been_done = 0;
284	recipe *formula = NULL;	179	char *next;
		180	recipelist *fl = init_recipelist ();
285	linked_char *next;	181	linked_char *tmp;
286	int num_ingred = 1;
287		182
288	fprintf (logfile, "\n");	183	if (!formulalist)
289	while (fl)	184	formulalist = fl;
		185
		186	if (has_been_done)
		187	return;
		188	else
		189	has_been_done = 1;
		190
		191	object_thawer thawer (settings.datadir, "formulae");
		192
		193	if (!thawer)
		194	{
		195	LOG (llevError, "Can't open %s.\n", thawer.name);
		196	return;
290	{	197	}
291	fprintf (logfile, "\n Formulae with %d ingredient%s %d Formulae with total_chance=%d\n",
292	num_ingred, num_ingred > 1 ? "s." : ".", fl->number, fl->total_chance);
293	for (formula = fl->items; formula != NULL; formula = formula->next)
294	{
295	artifact *art = NULL;
296	char buf[MAX_BUF];
297	size_t i;
298		198
299	for (i = 0; i < formula->arch_names; i++)	199	while (thawer.kw)
		200	{
		201	if (thawer.kw != KW_object)
		202	if (!thawer.parse_error ("formulae file"))
		203	break;
		204
		205	recipe *formula = get_empty_formula ();
		206	thawer.get (formula->title);
		207
		208	for (;;)
		209	{
		210	thawer.next ();
		211
		212	switch (thawer.kw)
300	{	213	{
301	const char *string = formula->arch_name[i];	214	case KW_keycode: thawer.get (formula->keycode ); break;
		215	case KW_trans: thawer.get (formula->transmute); break;
		216	case KW_yield: thawer.get (formula->yield ); break;
		217	case KW_chance: thawer.get (formula->chance ); break;
		218	case KW_exp: thawer.get (formula->exp ); break;
		219	case KW_diff: thawer.get (formula->diff ); break;
		220	case KW_skill: thawer.get (formula->skill ); break;
		221	case KW_cauldron: thawer.get (formula->cauldron ); break;
302		222
303	if (archetype::find (string) != NULL)	223	case KW_arch:
304	{	224	{
		225	build_stringlist (thawer.value_nn, &formula->arch_name, &formula->arch_names);
305	art = locate_recipe_artifact (formula, i);	226	check_recipe (formula);
306	if (!art && strcmp (formula->title, "NONE"))
307	LOG (llevError, "Formula %s has no artifact\n", &formula->title);
308	else
309	{
310	if (strcmp (formula->title, "NONE"))
311	sprintf (buf, "%s of %s", string, &formula->title);
312	else
313	sprintf (buf, "%s", string);
314	fprintf (logfile, "%-30s(%d) bookchance %3d ", buf, formula->index, formula->chance);
315	fprintf (logfile, "skill %s", &formula->skill);
316	fprintf (logfile, "\n");
317	if (formula->ingred != NULL)
318	{
319	int nval = 0, tval = 0;
320
321	fprintf (logfile, "\tIngred: ");
322	for (next = formula->ingred; next != NULL; next = next->next)
323	{
324	if (nval != 0)
325	fprintf (logfile, ",");
326	fprintf (logfile, "%s(%d)", &next->name, (nval = strtoint (next->name)));
327	tval += nval;
328	}
329	fprintf (logfile, "\n");
330	if (tval != formula->index)
331	fprintf (logfile, "WARNING:ingredient list and formula values not equal.\n");
332	}
333	if (formula->skill != NULL)
334	fprintf (logfile, "\tSkill Required: %s", &formula->skill);
335	if (formula->cauldron != NULL)
336	fprintf (logfile, "\tCauldron: %s\n", &formula->cauldron);
337	fprintf (logfile, "\tDifficulty: %d\t Exp: %d\n", formula->diff, formula->exp);
338	}
339	}	227	}
		228	break;
		229
		230	case KW_ingred:
		231	if (thawer.value)
		232	{
		233	int numb_ingred = 1;
		234	char *cp = thawer.value;
		235
		236	do
		237	{
		238	if ((next = strchr (cp, ',')))
		239	{
		240	*next++ = '\0';
		241	++numb_ingred;
		242	}
		243
		244	tmp = new linked_char;
		245
		246	tmp->name = cp;
		247	tmp->next = formula->ingred;
		248	formula->ingred = tmp;
		249	/* each ingredient's ASCII value is coadded. Later on this
		250	* value will be used allow us to search the formula lists
		251	* quickly for the right recipe.
		252	*/
		253	formula->index += strtoint (cp);
		254	}
		255	while ((cp = next));
		256
		257	/* now find the correct (# of ingred ordered) formulalist */
		258	fl = formulalist;
		259	while (numb_ingred != 1)
		260	{
		261	if (!fl->next)
		262	fl->next = init_recipelist ();
		263
		264	fl = fl->next;
		265	numb_ingred--;
		266	}
		267
		268	fl->total_chance += formula->chance;
		269	fl->number++;
		270	formula->next = fl->items;
		271	fl->items = formula;
		272	}
		273	break;
		274
340	else	275	default:
341	LOG (llevError, "Can't find archetype:%s for formula %s\n", string, &formula->title);	276	delete formula;
		277	case KW_EOF:
		278	case KW_object:
		279	goto next_object;
342	}	280	}
343	}	281	}
344	fprintf (logfile, "\n");	282
345	fl = fl->next;	283	next_object: ;
346	num_ingred++;
347	}	284	}
		285
		286	/* Lastly, lets check for problems in formula we got */
		287	check_formulae ();
348	}	288	}
349		289
350	/* Find a treasure with a matching name. The 'depth' parameter is	290	/* Find a treasure with a matching name. The 'depth' parameter is
351	* only there to prevent infinite loops in treasure lists (a list	291	* only there to prevent infinite loops in treasure lists (a list
352	* referencing another list pointing back to the first one). */	292	* referencing another list pointing back to the first one). */
353	archetype *	293	static archetype *
354	find_treasure_by_name (const treasure t, const char name, int depth)	294	find_treasure_by_name (const treasure t, const char name, int depth)
355	{	295	{
356	treasurelist *tl;
357	archetype *at;
358
359	if (depth > 10)	296	if (depth > 10)
360	return 0;	297	return 0;
361		298
362	while (t)	299	while (t)
363	{	300	{
364	if (t->name)	301	if (t->name)
365	{	302	{
366	tl = find_treasurelist (t->name);	303	if (treasurelist *tl = treasurelist::find (t->name))
367
368	if (tl)	304	if (tl->items)
369	{
370	at = find_treasure_by_name (tl->items, name, depth + 1);	305	if (archetype *at = find_treasure_by_name (tl->items, name, depth + 1))
371
372	if (at)
373	return at;	306	return at;
374	}
375	}	307	}
376	else	308	else
377	{	309	{
378	if (t->item && !strcasecmp (t->item->clone.name, name))	310	if (t->item && !strcasecmp (t->item->object::name, name))
379	return t->item;	311	return t->item;
380	}	312	}
381		313
382	if (t->next_yes)	314	if (t->next_yes)
383	{
384	at = find_treasure_by_name (t->next_yes, name, depth);	315	if (archetype *at = find_treasure_by_name (t->next_yes, name, depth))
385	if (at)
386	return at;	316	return at;
387	}
388		317
389	if (t->next_no)	318	if (t->next_no)
390	{
391	at = find_treasure_by_name (t->next_no, name, depth);	319	if (archetype *at = find_treasure_by_name (t->next_no, name, depth))
392	if (at)
393	return at;	320	return at;
394	}	321
395	t = t->next;	322	t = t->next;
396	}	323	}
		324
397	return 0;	325	return 0;
398	}	326	}
399		327
400	/* If several archetypes have the same name, the value of the first
401	* one with that name will be returned. This happens for the
402	* mushrooms (mushroom_1, mushroom_2 and mushroom_3). For the
403	* monsters' body parts, there may be several monsters with the same
404	* name. This is not a problem if these monsters have the same level
405	* (e.g. sage & c_sage) or if only one of the monsters generates the
406	* body parts that we are looking for (e.g. big_dragon and
407	* big_dragon_worthless). */
408	long
409	find_ingred_cost (const char *name)
410	{
411	archetype *at;
412	archetype *at2;
413	artifactlist *al;
414	artifact *art;
415	long mult;
416	char *cp;
417	char part1[100];
418	char part2[100];
419
420	/* same as atoi(), but skip number */
421	mult = 0;
422	while (isdigit (*name))
423	{
424	mult = 10 * mult + (*name - '0');
425	name++;
426	}
427	if (mult > 0)
428	name++;
429	else
430	mult = 1;
431	/* first, try to match the name of an archetype */
432	for (at = first_archetype; at != NULL; at = at->next)
433	{
434	if (at->clone.title != NULL)
435	{
436	/* inefficient, but who cares? */
437	sprintf (part1, "%s %s", &at->clone.name, &at->clone.title);
438	if (!strcasecmp (part1, name))
439	return mult * at->clone.value;
440	}
441	if (!strcasecmp (at->clone.name, name))
442	return mult * at->clone.value;
443	}
444	/* second, try to match an artifact ("arch of something") */
445	cp = strstr (name, " of ");
446	if (cp != NULL)
447	{
448	strcpy (part1, name);
449	part1[cp - name] = '\0';
450	strcpy (part2, cp + 4);
451	/* find the first archetype matching the first part of the name */
452	for (at = first_archetype; at != NULL; at = at->next)
453	if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL)
454	break;
455	if (at != NULL)
456	{
457	/* find the first artifact derived from that archetype (same type) */
458	for (al = first_artifactlist; al != NULL; al = al->next)
459	if (al->type == at->clone.type)
460	{
461	for (art = al->items; art != NULL; art = art->next)
462	if (!strcasecmp (art->item->name, part2))
463	return mult * at->clone.value * art->item->value;
464	}
465	}
466	}
467	/* third, try to match a body part ("arch's something") */
468	cp = strstr (name, "'s ");
469	if (cp != NULL)
470	{
471	strcpy (part1, name);
472	part1[cp - name] = '\0';
473	strcpy (part2, cp + 3);
474	/* examine all archetypes matching the first part of the name */
475	for (at = first_archetype; at != NULL; at = at->next)
476	if (!strcasecmp (at->clone.name, part1) && at->clone.title == NULL)
477	{
478	if (at->clone.randomitems != NULL)
479	{
480	at2 = find_treasure_by_name (at->clone.randomitems->items, part2, 0);
481	if (at2)
482	return mult * at2->clone.value * isqrt (at->clone.level * 2);
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 != NULL; 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->clone.value * art->item->value;
546	else
547	cost = at->clone.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 *	328	static const char *
583	ingred_name (const char *name)	329	ingred_name (const char *name)
584	{	330	{
585	const char *cp = name;	331	const char *cp = name;
586		332
587	if (atoi (cp))	333	if (atoi (cp))
588	cp = strchr (cp, ' ') + 1;	334	cp = strchr (cp, ' ') + 1;
		335
589	return cp;	336	return cp;
590	}	337	}
591		338
592	/* strtoint() - we use this to convert buf into an integer	339	static int
593	* equal to the coadded sum of the (lowercase) character
594	* ASCII values in buf (times prepended integers).
595	*/
596
597	int
598	strtoint (const char *buf)
599	{
600	const char *cp = ingred_name (buf);
601	int val = 0, len = strlen (cp), mult = numb_ingred (buf);
602
603	while (len)
604	{
605	val += tolower (*cp);
606	cp++;
607	len--;
608	}
609	return val * mult;
610	}
611
612	artifact *
613	locate_recipe_artifact (const recipe *rp, size_t idx)
614	{
615	object *item = get_archetype (rp->arch_name[idx]);
616	artifactlist *at = NULL;
617	artifact *art = NULL;
618
619	if (!item)
620	return (artifact *) NULL;
621
622	if ((at = find_artifactlist (item->type)))
623	for (art = at->items; art; art = art->next)
624	if (!strcmp (art->item->name, rp->title))
625	break;
626
627	item->destroy ();
628
629	return art;
630	}
631
632	int
633	numb_ingred (const char *buf)	340	numb_ingred (const char *buf)
634	{	341	{
635	int numb;	342	int numb;
636		343
637	if ((numb = atoi (buf)))	344	if ((numb = atoi (buf)))
638	return numb;	345	return numb;
639	else	346	else
640	return 1;	347	return 1;
641	}	348	}
642		349
		350	/* strtoint() - we use this to convert buf into an integer
		351	* equal to the coadded sum of the (lowercase) character
		352	* ASCII values in buf (times prepended integers).
		353	* Some kind of hashing.
		354	*/
		355	int
		356	strtoint (const char *buf)
		357	{
		358	const char *cp = ingred_name (buf);
		359	int val = 0, len = strlen (cp), mult = numb_ingred (buf);
		360
		361	while (len)
		362	{
		363	val += tolower (*cp);
		364	cp++;
		365	len--;
		366	}
		367
		368	return val * mult;
		369	}
		370
		371	artifact *
		372	locate_recipe_artifact (const recipe *rp, size_t idx)
		373	{
		374	archetype *at = archetype::find (rp->arch_name [idx]);
		375
		376	if (at)
		377	if (artifactlist *al = find_artifactlist (at->type))
		378	for (artifact *art = al->items; art; art = art->next)
		379	if (art->item->name == rp->title)
		380	return art;
		381
		382	return 0;
		383	}
		384
643	recipelist *	385	static recipelist *
644	get_random_recipelist (void)	386	get_random_recipelist ()
645	{	387	{
646	recipelist *fl = NULL;	388	recipelist *fl = NULL;
647	int number = 0, roll = 0;	389	int number = 0, roll = 0;
648		390
649	/* first, determine # of recipelist we have */	391	/* first, determine # of recipelist we have */
…		…
694	}	436	}
695	}	437	}
696	return rp;	438	return rp;
697	}	439	}
698		440
699	void
700	free_all_recipes (void)
701	{
702	recipelist fl = formulalist, flnext;
703	recipe formula = NULL, next;
704	linked_char lchar, charnext;
705
706	LOG (llevDebug, "Freeing all the recipes\n");
707	for (fl = formulalist; fl != NULL; fl = flnext)
708	{
709	flnext = fl->next;
710
711	for (formula = fl->items; formula != NULL; formula = next)
712	{
713	next = formula->next;
714
715	free (formula->arch_name[0]);
716	free (formula->arch_name);
717
718	for (lchar = formula->ingred; lchar; lchar = charnext)
719	{
720	charnext = lchar->next;
721	delete lchar;
722	}
723	delete formula;
724	}
725
726	delete fl;
727	}
728	}
729
730	/**	441	/**
731	* Split a comma separated string list into words.	442	* Split a comma separated string list into words.
732	*	443	*
733	* @param str the string to split	444	* @param str the string to split
734	*	445	*
…		…
745	char *p;	456	char *p;
746	size_t size;	457	size_t size;
747	size_t i;	458	size_t i;
748		459
749	dup = strdup (str);	460	dup = strdup (str);
750	if (dup == NULL)
751	fatal (OUT_OF_MEMORY);
752		461
753	size = 0;	462	size = 0;
754	for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ","))	463	for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ","))
755	size++;	464	size++;
756		465
757	result_list = (char ) malloc (size sizeof (*result_list));	466	result_list = (char )malloc (size sizeof (*result_list));
758		467
759	*result_size = size;	468	*result_size = size;
760		469
761	for (i = 0; i < size; i++)	470	for (i = 0; i < size; i++)
762	{	471	{

Diff Legend

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

Comparing deliantra/server/common/recipe.C (file contents): Revision 1.15 by root, Sat Jan 27 02:19:36 2007 UTC vs. Revision 1.48 by root, Sat Nov 17 23:40:00 2018 UTC

Diff Legend

Comparing deliantra/server/common/recipe.C (file contents):
Revision 1.15 by root, Sat Jan 27 02:19:36 2007 UTC vs.
Revision 1.48 by root, Sat Nov 17 23:40:00 2018 UTC