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

Diff Legend

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