ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/recipe.C
(Generate patch)

Comparing deliantra/server/common/recipe.C (file contents):
Revision 1.1 by elmex, Sun Aug 13 17:16:00 2006 UTC vs.
Revision 1.48 by root, Sat Nov 17 23:40:00 2018 UTC

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

Diff Legend

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