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.5 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.34 by root, Fri Mar 26 00:59:20 2010 UTC

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

Diff Legend

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