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

Comparing deliantra/server/common/recipe.C (file contents):
Revision 1.2 by root, Tue Aug 29 08:01:36 2006 UTC vs.
Revision 1.19 by root, Mon Apr 16 06:23:40 2007 UTC

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

Diff Legend

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

Comparing deliantra/server/common/recipe.C (file contents): Revision 1.2 by root, Tue Aug 29 08:01:36 2006 UTC vs. Revision 1.19 by root, Mon Apr 16 06:23:40 2007 UTC

Diff Legend

Comparing deliantra/server/common/recipe.C (file contents):
Revision 1.2 by root, Tue Aug 29 08:01:36 2006 UTC vs.
Revision 1.19 by root, Mon Apr 16 06:23:40 2007 UTC