1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* 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 |
… | |
… | |
49 | static void build_stringlist (const char *str, char ***result_list, size_t * result_size); |
50 | static void build_stringlist (const char *str, char ***result_list, size_t * result_size); |
50 | |
51 | |
51 | static recipelist *formulalist; |
52 | static recipelist *formulalist; |
52 | |
53 | |
53 | static recipelist * |
54 | static recipelist * |
54 | init_recipelist (void) |
55 | init_recipelist () |
55 | { |
56 | { |
56 | recipelist *tl = new recipelist; |
57 | recipelist *tl = new recipelist; |
57 | |
58 | |
58 | tl->total_chance = 0; |
59 | tl->total_chance = 0; |
59 | tl->number = 0; |
60 | tl->number = 0; |
… | |
… | |
62 | |
63 | |
63 | return tl; |
64 | return tl; |
64 | } |
65 | } |
65 | |
66 | |
66 | static recipe * |
67 | static recipe * |
67 | get_empty_formula (void) |
68 | get_empty_formula () |
68 | { |
69 | { |
69 | recipe *t = new recipe; |
70 | recipe *t = new recipe; |
70 | |
71 | |
71 | t->chance = 0; |
72 | t->chance = 0; |
72 | t->index = 0; |
73 | t->index = 0; |
73 | t->transmute = 0; |
74 | t->transmute = 0; |
74 | t->yield = 0; |
75 | t->yield = 0; |
75 | t->diff = 0; |
76 | t->diff = 0; |
76 | t->exp = 0; |
77 | t->exp = 0; |
77 | t->keycode = 0; |
78 | t->keycode = 0; |
78 | t->title = NULL; |
79 | t->title = 0; |
79 | t->arch_names = 0; |
80 | t->arch_names = 0; |
80 | t->arch_name = NULL; |
81 | t->arch_name = 0; |
81 | t->skill = NULL; |
82 | t->skill = 0; |
82 | t->cauldron = NULL; |
83 | t->cauldron = 0; |
83 | t->ingred = NULL; |
84 | t->ingred = 0; |
84 | t->next = NULL; |
85 | t->next = 0; |
|
|
86 | |
85 | return t; |
87 | return t; |
86 | } |
88 | } |
87 | |
89 | |
88 | /* get_formulalist() - returns pointer to the formula list */ |
90 | /* get_formulalist() - returns pointer to the formula list */ |
89 | recipelist * |
91 | recipelist * |
… | |
… | |
110 | size_t i; |
112 | size_t i; |
111 | int result = 1; |
113 | int result = 1; |
112 | |
114 | |
113 | for (i = 0; i < rp->arch_names; i++) |
115 | for (i = 0; i < rp->arch_names; i++) |
114 | { |
116 | { |
115 | if (archetype::find (rp->arch_name[i]) != NULL) |
117 | if (archetype::find (rp->arch_name[i])) |
116 | { |
118 | { |
117 | artifact *art = locate_recipe_artifact (rp, i); |
119 | artifact *art = locate_recipe_artifact (rp, i); |
118 | |
120 | |
119 | if (!art && strcmp (rp->title, "NONE") != 0) |
121 | if (!art && rp->title != shstr_NONE) |
120 | { |
122 | { |
121 | LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title); |
123 | LOG (llevError, "WARNING: Formula %s of %s has no artifact.\n", rp->arch_name[i], &rp->title); |
122 | result = 0; |
124 | result = 0; |
123 | } |
125 | } |
124 | } |
126 | } |
… | |
… | |
128 | result = 0; |
130 | result = 0; |
129 | } |
131 | } |
130 | } |
132 | } |
131 | |
133 | |
132 | return result; |
134 | return result; |
133 | } |
|
|
134 | |
|
|
135 | /* |
|
|
136 | * init_formulae() - Builds up the lists of formula from the file in |
|
|
137 | * the libdir. -b.t. |
|
|
138 | */ |
|
|
139 | void |
|
|
140 | init_formulae (void) |
|
|
141 | { |
|
|
142 | static int has_been_done = 0; |
|
|
143 | FILE *fp; |
|
|
144 | char filename[MAX_BUF], buf[MAX_BUF], *cp, *next; |
|
|
145 | recipe *formula = NULL; |
|
|
146 | recipelist *fl = init_recipelist (); |
|
|
147 | linked_char *tmp; |
|
|
148 | int value, comp; |
|
|
149 | |
|
|
150 | if (!formulalist) |
|
|
151 | formulalist = fl; |
|
|
152 | |
|
|
153 | if (has_been_done) |
|
|
154 | return; |
|
|
155 | else |
|
|
156 | has_been_done = 1; |
|
|
157 | |
|
|
158 | sprintf (filename, "%s/formulae", settings.datadir); |
|
|
159 | LOG (llevDebug, "Reading alchemical formulae from %s...\n", filename); |
|
|
160 | if ((fp = open_and_uncompress (filename, 0, &comp)) == NULL) |
|
|
161 | { |
|
|
162 | LOG (llevError, "Can't open %s.\n", filename); |
|
|
163 | return; |
|
|
164 | } |
|
|
165 | |
|
|
166 | while (fgets (buf, MAX_BUF, fp) != NULL) |
|
|
167 | { |
|
|
168 | if (*buf == '#') |
|
|
169 | continue; |
|
|
170 | if ((cp = strchr (buf, '\n')) != NULL) |
|
|
171 | *cp = '\0'; |
|
|
172 | cp = buf; |
|
|
173 | while (*cp == ' ') /* Skip blanks */ |
|
|
174 | cp++; |
|
|
175 | |
|
|
176 | if (!strncmp (cp, "object", 6)) |
|
|
177 | { |
|
|
178 | formula = get_empty_formula (); |
|
|
179 | formula->title = strchr (cp, ' ') + 1; |
|
|
180 | } |
|
|
181 | else if (!strncmp (cp, "keycode", 7)) |
|
|
182 | formula->keycode = strchr (cp, ' ') + 1; |
|
|
183 | else if (sscanf (cp, "trans %d", &value)) |
|
|
184 | formula->transmute = (uint16) value; |
|
|
185 | else if (sscanf (cp, "yield %d", &value)) |
|
|
186 | formula->yield = (uint16) value; |
|
|
187 | else if (sscanf (cp, "chance %d", &value)) |
|
|
188 | formula->chance = (uint16) value; |
|
|
189 | else if (sscanf (cp, "exp %d", &value)) |
|
|
190 | formula->exp = (uint16) value; |
|
|
191 | else if (sscanf (cp, "diff %d", &value)) |
|
|
192 | formula->diff = (uint16) value; |
|
|
193 | else if (!strncmp (cp, "ingred", 6)) |
|
|
194 | { |
|
|
195 | int numb_ingred = 1; |
|
|
196 | |
|
|
197 | cp = strchr (cp, ' ') + 1; |
|
|
198 | do |
|
|
199 | { |
|
|
200 | if ((next = strchr (cp, ',')) != NULL) |
|
|
201 | { |
|
|
202 | *(next++) = '\0'; |
|
|
203 | numb_ingred++; |
|
|
204 | } |
|
|
205 | |
|
|
206 | tmp = new linked_char; |
|
|
207 | |
|
|
208 | tmp->name = cp; |
|
|
209 | tmp->next = formula->ingred; |
|
|
210 | formula->ingred = tmp; |
|
|
211 | /* each ingredient's ASCII value is coadded. Later on this |
|
|
212 | * value will be used allow us to search the formula lists |
|
|
213 | * quickly for the right recipe. |
|
|
214 | */ |
|
|
215 | formula->index += strtoint (cp); |
|
|
216 | } |
|
|
217 | while ((cp = next) != NULL); |
|
|
218 | |
|
|
219 | /* now find the correct (# of ingred ordered) formulalist */ |
|
|
220 | fl = formulalist; |
|
|
221 | while (numb_ingred != 1) |
|
|
222 | { |
|
|
223 | if (!fl->next) |
|
|
224 | fl->next = init_recipelist (); |
|
|
225 | |
|
|
226 | fl = fl->next; |
|
|
227 | numb_ingred--; |
|
|
228 | } |
|
|
229 | |
|
|
230 | fl->total_chance += formula->chance; |
|
|
231 | fl->number++; |
|
|
232 | formula->next = fl->items; |
|
|
233 | fl->items = formula; |
|
|
234 | } |
|
|
235 | else if (!strncmp (cp, "arch", 4)) |
|
|
236 | { |
|
|
237 | build_stringlist (strchr (cp, ' ') + 1, &formula->arch_name, &formula->arch_names); |
|
|
238 | check_recipe (formula); |
|
|
239 | } |
|
|
240 | else if (!strncmp (cp, "skill", 5)) |
|
|
241 | formula->skill = strchr (cp, ' ') + 1; |
|
|
242 | else if (!strncmp (cp, "cauldron", 8)) |
|
|
243 | formula->cauldron = strchr (cp, ' ') + 1; |
|
|
244 | else |
|
|
245 | LOG (llevError, "Unknown input in file %s: %s\n", filename, buf); |
|
|
246 | } |
|
|
247 | |
|
|
248 | LOG (llevDebug, "done.\n"); |
|
|
249 | close_and_delete (fp, comp); |
|
|
250 | /* Lastly, lets check for problems in formula we got */ |
|
|
251 | check_formulae (); |
|
|
252 | } |
135 | } |
253 | |
136 | |
254 | /* check_formulae()- since we are doing a squential search on the |
137 | /* check_formulae()- since we are doing a squential search on the |
255 | * formulae lists now, we have to be carefull that we dont have 2 |
138 | * formulae lists now, we have to be carefull that we dont have 2 |
256 | * formula with the exact same index value. Under the new nbatches |
139 | * formula with the exact same index value. Under the new nbatches |
257 | * code, it is possible to have multiples of ingredients in a cauldron |
140 | * code, it is possible to have multiples of ingredients in a cauldron |
258 | * which could result in an index formula mismatch. We *don't* check for |
141 | * which could result in an index formula mismatch. We *don't* check for |
259 | * that possibility here. -b.t. |
142 | * that possibility here. -b.t. |
260 | */ |
143 | */ |
261 | void |
144 | static void |
262 | check_formulae (void) |
145 | check_formulae () |
263 | { |
146 | { |
264 | recipelist *fl; |
147 | recipelist *fl; |
265 | recipe *check, *formula; |
148 | recipe *check, *formula; |
266 | int numb = 1; |
149 | int numb = 1; |
267 | |
150 | |
… | |
… | |
282 | |
165 | |
283 | LOG (llevDebug, "done.\n"); |
166 | LOG (llevDebug, "done.\n"); |
284 | |
167 | |
285 | } |
168 | } |
286 | |
169 | |
|
|
170 | /* |
|
|
171 | * init_formulae() - Builds up the lists of formula from the file in |
|
|
172 | * the libdir. -b.t. |
|
|
173 | */ |
|
|
174 | void |
|
|
175 | init_formulae () |
|
|
176 | { |
|
|
177 | static int has_been_done = 0; |
|
|
178 | char *next; |
|
|
179 | recipelist *fl = init_recipelist (); |
|
|
180 | linked_char *tmp; |
|
|
181 | |
|
|
182 | if (!formulalist) |
|
|
183 | formulalist = fl; |
|
|
184 | |
|
|
185 | if (has_been_done) |
|
|
186 | return; |
|
|
187 | else |
|
|
188 | has_been_done = 1; |
|
|
189 | |
|
|
190 | object_thawer thawer (settings.datadir, "formulae"); |
|
|
191 | |
|
|
192 | if (!thawer) |
|
|
193 | { |
|
|
194 | LOG (llevError, "Can't open %s.\n", thawer.name); |
|
|
195 | return; |
|
|
196 | } |
|
|
197 | |
|
|
198 | while (thawer.kw) |
|
|
199 | { |
|
|
200 | if (thawer.kw != KW_object) |
|
|
201 | if (!thawer.parse_error ("formulae file")) |
|
|
202 | break; |
|
|
203 | |
|
|
204 | recipe *formula = get_empty_formula (); |
|
|
205 | thawer.get (formula->title); |
|
|
206 | |
|
|
207 | for (;;) |
|
|
208 | { |
|
|
209 | thawer.next (); |
|
|
210 | |
|
|
211 | switch (thawer.kw) |
|
|
212 | { |
|
|
213 | case KW_keycode: thawer.get (formula->keycode ); break; |
|
|
214 | case KW_trans: thawer.get (formula->transmute); break; |
|
|
215 | case KW_yield: thawer.get (formula->yield ); break; |
|
|
216 | case KW_chance: thawer.get (formula->chance ); break; |
|
|
217 | case KW_exp: thawer.get (formula->exp ); break; |
|
|
218 | case KW_diff: thawer.get (formula->diff ); break; |
|
|
219 | case KW_skill: thawer.get (formula->skill ); break; |
|
|
220 | case KW_cauldron: thawer.get (formula->cauldron ); break; |
|
|
221 | |
|
|
222 | case KW_arch: |
|
|
223 | { |
|
|
224 | build_stringlist (thawer.value_nn, &formula->arch_name, &formula->arch_names); |
|
|
225 | check_recipe (formula); |
|
|
226 | } |
|
|
227 | break; |
|
|
228 | |
|
|
229 | case KW_ingred: |
|
|
230 | if (thawer.value) |
|
|
231 | { |
|
|
232 | int numb_ingred = 1; |
|
|
233 | char *cp = thawer.value; |
|
|
234 | |
|
|
235 | do |
|
|
236 | { |
|
|
237 | if ((next = strchr (cp, ','))) |
|
|
238 | { |
|
|
239 | *next++ = '\0'; |
|
|
240 | ++numb_ingred; |
|
|
241 | } |
|
|
242 | |
|
|
243 | tmp = new linked_char; |
|
|
244 | |
|
|
245 | tmp->name = cp; |
|
|
246 | tmp->next = formula->ingred; |
|
|
247 | formula->ingred = tmp; |
|
|
248 | /* each ingredient's ASCII value is coadded. Later on this |
|
|
249 | * value will be used allow us to search the formula lists |
|
|
250 | * quickly for the right recipe. |
|
|
251 | */ |
|
|
252 | formula->index += strtoint (cp); |
|
|
253 | } |
|
|
254 | while ((cp = next)); |
|
|
255 | |
|
|
256 | /* now find the correct (# of ingred ordered) formulalist */ |
|
|
257 | fl = formulalist; |
|
|
258 | while (numb_ingred != 1) |
|
|
259 | { |
|
|
260 | if (!fl->next) |
|
|
261 | fl->next = init_recipelist (); |
|
|
262 | |
|
|
263 | fl = fl->next; |
|
|
264 | numb_ingred--; |
|
|
265 | } |
|
|
266 | |
|
|
267 | fl->total_chance += formula->chance; |
|
|
268 | fl->number++; |
|
|
269 | formula->next = fl->items; |
|
|
270 | fl->items = formula; |
|
|
271 | } |
|
|
272 | break; |
|
|
273 | |
|
|
274 | default: |
|
|
275 | delete formula; |
|
|
276 | case KW_EOF: |
|
|
277 | case KW_object: |
|
|
278 | goto next_object; |
|
|
279 | } |
|
|
280 | } |
|
|
281 | |
|
|
282 | next_object: ; |
|
|
283 | } |
|
|
284 | |
|
|
285 | /* Lastly, lets check for problems in formula we got */ |
|
|
286 | check_formulae (); |
|
|
287 | } |
|
|
288 | |
287 | /* Find a treasure with a matching name. The 'depth' parameter is |
289 | /* Find a treasure with a matching name. The 'depth' parameter is |
288 | * only there to prevent infinite loops in treasure lists (a list |
290 | * only there to prevent infinite loops in treasure lists (a list |
289 | * referencing another list pointing back to the first one). */ |
291 | * referencing another list pointing back to the first one). */ |
290 | archetype * |
292 | static archetype * |
291 | find_treasure_by_name (const treasure *t, const char *name, int depth) |
293 | find_treasure_by_name (const treasure *t, const char *name, int depth) |
292 | { |
294 | { |
293 | if (depth > 10) |
295 | if (depth > 10) |
294 | return 0; |
296 | return 0; |
295 | |
297 | |
… | |
… | |
320 | } |
322 | } |
321 | |
323 | |
322 | return 0; |
324 | return 0; |
323 | } |
325 | } |
324 | |
326 | |
325 | /* If several archetypes have the same name, the value of the first |
|
|
326 | * one with that name will be returned. This happens for the |
|
|
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). */ |
|
|
333 | long |
|
|
334 | find_ingred_cost (const char *name) |
|
|
335 | { |
|
|
336 | archetype *at2; |
|
|
337 | artifactlist *al; |
|
|
338 | artifact *art; |
|
|
339 | long mult; |
|
|
340 | char *cp; |
|
|
341 | char part1[100]; |
|
|
342 | char part2[100]; |
|
|
343 | |
|
|
344 | /* same as atoi(), but skip number */ |
|
|
345 | mult = 0; |
|
|
346 | while (isdigit (*name)) |
|
|
347 | { |
|
|
348 | mult = 10 * mult + (*name - '0'); |
|
|
349 | name++; |
|
|
350 | } |
|
|
351 | |
|
|
352 | if (mult > 0) |
|
|
353 | name++; |
|
|
354 | else |
|
|
355 | mult = 1; |
|
|
356 | |
|
|
357 | /* first, try to match the name of an archetype */ |
|
|
358 | for_all_archetypes (at) |
|
|
359 | { |
|
|
360 | if (at->title != NULL) |
|
|
361 | { |
|
|
362 | /* inefficient, but who cares? */ |
|
|
363 | sprintf (part1, "%s %s", &at->object::name, &at->title); |
|
|
364 | if (!strcasecmp (part1, name)) |
|
|
365 | return mult * at->value; |
|
|
366 | } |
|
|
367 | if (!strcasecmp (at->object::name, name)) |
|
|
368 | return mult * at->value; |
|
|
369 | } |
|
|
370 | |
|
|
371 | /* second, try to match an artifact ("arch of something") */ |
|
|
372 | cp = strstr (name, " of "); |
|
|
373 | if (cp != NULL) |
|
|
374 | { |
|
|
375 | strcpy (part1, name); |
|
|
376 | part1[cp - name] = '\0'; |
|
|
377 | strcpy (part2, cp + 4); |
|
|
378 | |
|
|
379 | /* find the first archetype matching the first part of the name */ |
|
|
380 | for_all_archetypes (at) |
|
|
381 | if (!strcasecmp (at->object::name, part1) && at->title == NULL) |
|
|
382 | { |
|
|
383 | /* find the first artifact derived from that archetype (same type) */ |
|
|
384 | for (al = first_artifactlist; al; al = al->next) |
|
|
385 | if (al->type == at->type) |
|
|
386 | { |
|
|
387 | for (art = al->items; art; art = art->next) |
|
|
388 | if (!strcasecmp (art->item->name, part2)) |
|
|
389 | return mult * at->value * art->item->value; |
|
|
390 | } |
|
|
391 | } |
|
|
392 | } |
|
|
393 | |
|
|
394 | /* third, try to match a body part ("arch's something") */ |
|
|
395 | cp = strstr (name, "'s "); |
|
|
396 | if (cp) |
|
|
397 | { |
|
|
398 | strcpy (part1, name); |
|
|
399 | part1[cp - name] = '\0'; |
|
|
400 | strcpy (part2, cp + 3); |
|
|
401 | /* examine all archetypes matching the first part of the name */ |
|
|
402 | for_all_archetypes (at) |
|
|
403 | if (!strcasecmp (at->object::name, part1) && at->title == NULL) |
|
|
404 | { |
|
|
405 | if (at->randomitems) |
|
|
406 | { |
|
|
407 | at2 = find_treasure_by_name (at->randomitems->items, part2, 0); |
|
|
408 | if (at2) |
|
|
409 | return mult * at2->value * isqrt (at->level * 2); |
|
|
410 | } |
|
|
411 | } |
|
|
412 | } |
|
|
413 | |
|
|
414 | /* failed to find any matching items -- formula should be checked */ |
|
|
415 | return -1; |
|
|
416 | } |
|
|
417 | |
|
|
418 | const char * |
327 | static const char * |
419 | ingred_name (const char *name) |
328 | ingred_name (const char *name) |
420 | { |
329 | { |
421 | const char *cp = name; |
330 | const char *cp = name; |
422 | |
331 | |
423 | if (atoi (cp)) |
332 | if (atoi (cp)) |
424 | cp = strchr (cp, ' ') + 1; |
333 | cp = strchr (cp, ' ') + 1; |
425 | |
334 | |
426 | return cp; |
335 | return cp; |
|
|
336 | } |
|
|
337 | |
|
|
338 | static int |
|
|
339 | numb_ingred (const char *buf) |
|
|
340 | { |
|
|
341 | int numb; |
|
|
342 | |
|
|
343 | if ((numb = atoi (buf))) |
|
|
344 | return numb; |
|
|
345 | else |
|
|
346 | return 1; |
427 | } |
347 | } |
428 | |
348 | |
429 | /* strtoint() - we use this to convert buf into an integer |
349 | /* strtoint() - we use this to convert buf into an integer |
430 | * equal to the coadded sum of the (lowercase) character |
350 | * equal to the coadded sum of the (lowercase) character |
431 | * ASCII values in buf (times prepended integers). |
351 | * ASCII values in buf (times prepended integers). |
|
|
352 | * Some kind of hashing. |
432 | */ |
353 | */ |
433 | |
|
|
434 | int |
354 | int |
435 | strtoint (const char *buf) |
355 | strtoint (const char *buf) |
436 | { |
356 | { |
437 | const char *cp = ingred_name (buf); |
357 | const char *cp = ingred_name (buf); |
438 | int val = 0, len = strlen (cp), mult = numb_ingred (buf); |
358 | int val = 0, len = strlen (cp), mult = numb_ingred (buf); |
… | |
… | |
441 | { |
361 | { |
442 | val += tolower (*cp); |
362 | val += tolower (*cp); |
443 | cp++; |
363 | cp++; |
444 | len--; |
364 | len--; |
445 | } |
365 | } |
|
|
366 | |
446 | return val * mult; |
367 | return val * mult; |
447 | } |
368 | } |
448 | |
369 | |
449 | artifact * |
370 | artifact * |
450 | locate_recipe_artifact (const recipe *rp, size_t idx) |
371 | locate_recipe_artifact (const recipe *rp, size_t idx) |
… | |
… | |
458 | return art; |
379 | return art; |
459 | |
380 | |
460 | return 0; |
381 | return 0; |
461 | } |
382 | } |
462 | |
383 | |
463 | int |
|
|
464 | numb_ingred (const char *buf) |
|
|
465 | { |
|
|
466 | int numb; |
|
|
467 | |
|
|
468 | if ((numb = atoi (buf))) |
|
|
469 | return numb; |
|
|
470 | else |
|
|
471 | return 1; |
|
|
472 | } |
|
|
473 | |
|
|
474 | recipelist * |
384 | static recipelist * |
475 | get_random_recipelist (void) |
385 | get_random_recipelist () |
476 | { |
386 | { |
477 | recipelist *fl = NULL; |
387 | recipelist *fl = NULL; |
478 | int number = 0, roll = 0; |
388 | int number = 0, roll = 0; |
479 | |
389 | |
480 | /* first, determine # of recipelist we have */ |
390 | /* first, determine # of recipelist we have */ |
… | |
… | |
523 | if (r < 0) |
433 | if (r < 0) |
524 | break; |
434 | break; |
525 | } |
435 | } |
526 | } |
436 | } |
527 | return rp; |
437 | return rp; |
528 | } |
|
|
529 | |
|
|
530 | void |
|
|
531 | free_all_recipes (void) |
|
|
532 | { |
|
|
533 | recipelist *fl = formulalist, *flnext; |
|
|
534 | recipe *formula = NULL, *next; |
|
|
535 | linked_char *lchar, *charnext; |
|
|
536 | |
|
|
537 | LOG (llevDebug, "Freeing all the recipes\n"); |
|
|
538 | for (fl = formulalist; fl != NULL; fl = flnext) |
|
|
539 | { |
|
|
540 | flnext = fl->next; |
|
|
541 | |
|
|
542 | for (formula = fl->items; formula != NULL; formula = next) |
|
|
543 | { |
|
|
544 | next = formula->next; |
|
|
545 | |
|
|
546 | free (formula->arch_name[0]); |
|
|
547 | free (formula->arch_name); |
|
|
548 | |
|
|
549 | for (lchar = formula->ingred; lchar; lchar = charnext) |
|
|
550 | { |
|
|
551 | charnext = lchar->next; |
|
|
552 | delete lchar; |
|
|
553 | } |
|
|
554 | delete formula; |
|
|
555 | } |
|
|
556 | |
|
|
557 | delete fl; |
|
|
558 | } |
|
|
559 | } |
438 | } |
560 | |
439 | |
561 | /** |
440 | /** |
562 | * Split a comma separated string list into words. |
441 | * Split a comma separated string list into words. |
563 | * |
442 | * |
… | |
… | |
576 | char *p; |
455 | char *p; |
577 | size_t size; |
456 | size_t size; |
578 | size_t i; |
457 | size_t i; |
579 | |
458 | |
580 | dup = strdup (str); |
459 | dup = strdup (str); |
581 | if (dup == NULL) |
|
|
582 | fatal (OUT_OF_MEMORY); |
|
|
583 | |
460 | |
584 | size = 0; |
461 | size = 0; |
585 | for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ",")) |
462 | for (p = strtok (dup, ","); p != NULL; p = strtok (NULL, ",")) |
586 | size++; |
463 | size++; |
587 | |
464 | |
588 | *result_list = (char **) malloc (size * sizeof (*result_list)); |
465 | *result_list = (char **)malloc (size * sizeof (*result_list)); |
589 | |
466 | |
590 | *result_size = size; |
467 | *result_size = size; |
591 | |
468 | |
592 | for (i = 0; i < size; i++) |
469 | for (i = 0; i < size; i++) |
593 | { |
470 | { |