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

Diff Legend

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