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

Comparing deliantra/server/common/treasure.C (file contents):
Revision 1.42 by root, Mon Apr 16 10:14:25 2007 UTC vs.
Revision 1.50 by root, Thu Apr 19 16:23:46 2007 UTC

… …
54> tl_map_t; 54> tl_map_t;
55 55
56static tl_map_t tl_map; 56static tl_map_t tl_map;
57 57
58/* 58/*
59 * Initialize global archtype pointers: 59 * Searches for the given treasurelist
60 */
61void
62init_archetype_pointers ()
63{
64 int prev_warn = warn_archetypes;
65
66 warn_archetypes = 1;
67
68 if (ring_arch == NULL)
69 ring_arch = archetype::find ("ring");
70 if (amulet_arch == NULL)
71 amulet_arch = archetype::find ("amulet");
72 if (staff_arch == NULL)
73 staff_arch = archetype::find ("staff");
74 if (crown_arch == NULL)
75 crown_arch = archetype::find ("crown");
76
77 warn_archetypes = prev_warn;
78}
79
80/*
81 * Searches for the given treasurelist in the globally linked list
82 * of treasurelists which has been built by load_treasures().
83 */ 60 */
84treasurelist * 61treasurelist *
85treasurelist::find (const char *name) 62treasurelist::find (const char *name)
86{ 63{
87 if (!name) 64 if (!name)
88 return 0; 65 return 0;
89 66
90 AUTODECL (i, tl_map.find (name)); 67 auto (i, tl_map.find (name));
91 68
92 if (i == tl_map.end ()) 69 if (i == tl_map.end ())
93 return 0; 70 return 0;
94 71
95 return i->second; 72 return i->second;
… …
125 if (tl->items) 102 if (tl->items)
126 { 103 {
127 free_treasurestruct (tl->items); 104 free_treasurestruct (tl->items);
128 tl->items = 0; 105 tl->items = 0;
129 } 106 }
107
108 tl->total_chance = 0;
130} 109}
110
111#ifdef TREASURE_DEBUG
112/* recursived checks the linked list. Treasurelist is passed only
113 * so that the treasure name can be printed out
114 */
115static void
116check_treasurelist (const treasure *t, const treasurelist * tl)
117{
118 if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
119 LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
120
121 if (t->next)
122 check_treasurelist (t->next, tl);
123
124 if (t->next_yes)
125 check_treasurelist (t->next_yes, tl);
126
127 if (t->next_no)
128 check_treasurelist (t->next_no, tl);
129}
130#endif
131 131
132/* 132/*
133 * Reads the lib/treasure file from disk, and parses the contents 133 * Reads the lib/treasure file from disk, and parses the contents
134 * into an internal treasure structure (very linked lists) 134 * into an internal treasure structure (very linked lists)
135 */ 135 */
136static treasure * 136static treasure *
137load_treasure (object_thawer &f) 137read_treasure (object_thawer &f)
138{ 138{
139 treasure *t = new treasure; 139 treasure *t = new treasure;
140 int value;
141 140
142 nroftreasures++; 141 f.next ();
143 142
144 for (;;) 143 for (;;)
145 { 144 {
146 coroapi::cede_every (10); 145 coroapi::cede_to_tick_every (10);
147
148 f.next ();
149 146
150 switch (f.kw) 147 switch (f.kw)
151 { 148 {
152 case KW_arch: 149 case KW_arch:
153 if (!(t->item = archetype::find (f.get_str ()))) 150 t->item = archetype::get (f.get_str ());
154 LOG (llevError, "%s:%d treasure references unknown archetype '%s', skipping.\n", f.name, f.linenum, f.get_str ());
155 break; 151 break;
156 152
157 case KW_list: f.get (t->name); break; 153 case KW_list: f.get (t->name); break;
158 case KW_change_name: f.get (t->change_arch.name); break; 154 case KW_change_name: f.get (t->change_arch.name); break;
159 case KW_change_title: f.get (t->change_arch.title); break; 155 case KW_change_title: f.get (t->change_arch.title); break;
160 case KW_change_slaying: f.get (t->change_arch.slaying); break; 156 case KW_change_slaying: f.get (t->change_arch.slaying); break;
161 case KW_chance: f.get (t->chance); break; 157 case KW_chance: f.get (t->chance); break;
162 case KW_nrof: f.get (t->nrof); break; 158 case KW_nrof: f.get (t->nrof); break;
163 case KW_magic: f.get (t->magic); break; 159 case KW_magic: f.get (t->magic); break;
164 160
165 case KW_yes: t->next_yes = load_treasure (f); break; 161 case KW_yes: t->next_yes = read_treasure (f); continue;
166 case KW_no: t->next_no = load_treasure (f); break; 162 case KW_no: t->next_no = read_treasure (f); continue;
167 163
168 case KW_end: 164 case KW_end:
165 f.next ();
169 return t; 166 return t;
170 167
171 case KW_more: 168 case KW_more:
172 t->next = load_treasure (f); 169 t->next = read_treasure (f);
173 return t; 170 return t;
174 171
175 default: 172 default:
176 if (!f.parse_error ("treasure list")) 173 if (!f.parse_error ("treasurelist", t->name))
177 return t; // error 174 return 0;
178 175
179 return t; 176 return t;
180 } 177 }
181 }
182}
183 178
184#ifdef TREASURE_DEBUG 179 f.next ();
185/* recursived checks the linked list. Treasurelist is passed only 180 }
186 * so that the treasure name can be printed out
187 */
188static void
189check_treasurelist (const treasure *t, const treasurelist * tl)
190{
191 if (t->chance >= 100 && t->next_yes && (t->next || t->next_no))
192 LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name);
193
194 if (t->next)
195 check_treasurelist (t->next, tl);
196
197 if (t->next_yes)
198 check_treasurelist (t->next_yes, tl);
199
200 if (t->next_no)
201 check_treasurelist (t->next_no, tl);
202} 181}
203#endif
204 182
205/* 183/*
206 * Opens LIBDIR/treasure and reads all treasure-declarations from it.
207 * Each treasure is parsed with the help of load_treasure(). 184 * Each treasure is parsed with the help of load_treasure().
208 */ 185 */
209bool 186treasurelist *
210load_treasures () 187treasurelist::read (object_thawer &f)
211{ 188{
212 treasure *t; 189 assert (f.kw == KW_treasure || f.kw == KW_treasureone);
213 int comp, line = 0;
214 190
215 char filename[MAX_BUF]; 191 bool one = f.kw == KW_treasureone;
216 sprintf (filename, "%s/%s", settings.datadir, settings.treasures); 192 treasurelist *tl = treasurelist::get (f.get_str ());
217 193 clear (tl);
218 object_thawer f (filename); 194 tl->items = read_treasure (f);
219 195 if (!tl->items)
220 if (!f)
221 {
222 LOG (llevError, "Can't open treasure file.\n");
223 return false; 196 return 0;
197
198 /* This is a one of the many items on the list should be generated.
199 * Add up the chance total, and check to make sure the yes & no
200 * fields of the treasures are not being used.
201 */
202 tl->total_chance = 0;
203
204 if (one)
224 } 205 {
225 206 for (treasure *t = tl->items; t; t = t->next)
226 f.next ();
227
228 for (;;)
229 {
230 switch (f.kw)
231 { 207 {
232 case KW_treasure: 208 if (t->next_yes || t->next_no)
233 case KW_treasureone:
234 { 209 {
235 bool one = f.kw == KW_treasureone;
236 treasurelist *tl = treasurelist::get (f.get_str ());
237
238 clear (tl);
239 tl->items = load_treasure (f);
240
241 if (!tl->items)
242 return false;
243
244 /* This is a one of the many items on the list should be generated.
245 * Add up the chance total, and check to make sure the yes & no
246 * fields of the treasures are not being used.
247 */
248 if (one)
249 {
250 for (t = tl->items; t; t = t->next)
251 {
252#ifdef TREASURE_DEBUG
253 if (t->next_yes || t->next_no)
254 {
255 LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); 210 LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name);
256 LOG (llevError, " the next_yes or next_no field is set\n"); 211 LOG (llevError, " the next_yes or next_no field is set\n");
257 }
258#endif
259 tl->total_chance += t->chance;
260 }
261 }
262 } 212 }
263 break;
264 213
265 case KW_EOF: 214 tl->total_chance += t->chance;
266#ifdef TREASURE_DEBUG
267 /* Perform some checks on how valid the treasure data actually is.
268 * verify that list transitions work (ie, the list that it is supposed
269 * to transition to exists). Also, verify that at least the name
270 * or archetype is set for each treasure element.
271 */
272 for (treasurelist *tl = first_treasurelist; tl; tl = tl->next)
273 check_treasurelist (tl->items, tl);
274#endif
275 return true;
276
277 default:
278 if (!f.parse_error ("treasure lists"))
279 return false;
280
281 break;
282 } 215 }
283
284 f.next ();
285 } 216 }
217
218 return tl;
286} 219}
287 220
288/* 221/*
289 * Generates the objects specified by the given treasure. 222 * Generates the objects specified by the given treasure.
290 * It goes recursively through the rest of the linked list. 223 * It goes recursively through the rest of the linked list.
… …
349 if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance) 282 if ((int) t->chance >= 100 || (rndm (100) + 1) < (int) t->chance)
350 { 283 {
351 if (t->name) 284 if (t->name)
352 { 285 {
353 if (difficulty >= t->magic) 286 if (difficulty >= t->magic)
287 if (treasurelist *tl = treasurelist::find (t->name))
354 create_treasure (treasurelist::find (t->name), op, flag, difficulty, tries); 288 create_treasure (tl, op, flag, difficulty, tries);
289 else
290 LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
355 } 291 }
356 else 292 else
357 { 293 {
358 if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) 294 if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE)))
359 { 295 {
… …
460object * 396object *
461generate_treasure (treasurelist *tl, int difficulty) 397generate_treasure (treasurelist *tl, int difficulty)
462{ 398{
463 difficulty = clamp (difficulty, 1, settings.max_level); 399 difficulty = clamp (difficulty, 1, settings.max_level);
464 400
465 object *ob = object::create (), *tmp; 401 object *ob = object::create ();
466 402
467 create_treasure (tl, ob, 0, difficulty, 0); 403 create_treasure (tl, ob, 0, difficulty, 0);
468 404
469 /* Don't want to free the object we are about to return */ 405 /* Don't want to free the object we are about to return */
470 tmp = ob->inv; 406 object *tmp = ob->inv;
471 if (tmp != NULL) 407 if (tmp)
472 tmp->remove (); 408 tmp->remove ();
473 409
474 if (ob->inv) 410 if (ob->inv)
475 LOG (llevError, "In generate treasure, created multiple objects.\n"); 411 LOG (llevError, "In generate treasure, created multiple objects.\n");
476 412
… …
484 * The array has two arguments, the difficulty of the level, and the 420 * The array has two arguments, the difficulty of the level, and the
485 * magical bonus "wanted". 421 * magical bonus "wanted".
486 */ 422 */
487 423
488static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = { 424static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = {
489
490// chance of magic difficulty 425// chance of magic difficulty
491// +0 +1 +2 +3 +4 426// +0 +1 +2 +3 +4
492 {95, 2, 2, 1, 0}, // 1 427 {95, 2, 2, 1, 0}, // 1
493 {92, 5, 2, 1, 0}, // 2 428 {92, 5, 2, 1, 0}, // 2
494 {85, 10, 4, 1, 0}, // 3 429 {85, 10, 4, 1, 0}, // 3
… …
520 { 0, 0, 0, 3, 97}, // 29 455 { 0, 0, 0, 3, 97}, // 29
521 { 0, 0, 0, 0, 100}, // 30 456 { 0, 0, 0, 0, 100}, // 30
522 { 0, 0, 0, 0, 100}, // 31 457 { 0, 0, 0, 0, 100}, // 31
523}; 458};
524 459
525
526/* calculate the appropriate level for wands staves and scrolls. 460/* calculate the appropriate level for wands staves and scrolls.
527 * This code presumes that op has had its spell object created (in op->inv) 461 * This code presumes that op has had its spell object created (in op->inv)
528 * 462 *
529 * elmex Wed Aug 9 17:44:59 CEST 2006: 463 * elmex Wed Aug 9 17:44:59 CEST 2006:
530 * Removed multiplicator, too many high-level items were generated on low-difficulty maps. 464 * Removed multiplicator, too many high-level items were generated on low-difficulty maps.
531 */ 465 */
532
533int 466int
534level_for_item (const object *op, int difficulty) 467level_for_item (const object *op, int difficulty)
535{ 468{
536 int olevel = 0; 469 int olevel = 0;
537 470
… …
847 save_item_power = op->item_power; 780 save_item_power = op->item_power;
848 op->item_power = 0; 781 op->item_power = 0;
849 782
850 if (op->randomitems && op->type != SPELL) 783 if (op->randomitems && op->type != SPELL)
851 { 784 {
852 create_treasure (op->randomitems, op, flags, difficulty, 0); 785 create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0);
853 if (!op->inv)
854 LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", op->debug_desc ());
855
856 /* So the treasure doesn't get created again */ 786 /* So the treasure doesn't get created again */
857 op->randomitems = 0; 787 op->randomitems = 0;
858 } 788 }
859 789
860 if (difficulty < 1) 790 if (difficulty < 1)
… …
1356 { 1286 {
1357 switch (f.kw) 1287 switch (f.kw)
1358 { 1288 {
1359 case KW_allowed: 1289 case KW_allowed:
1360 if (!art) 1290 if (!art)
1361 {
1362 art = get_empty_artifact (); 1291 art = get_empty_artifact ();
1363 nrofartifacts++;
1364 }
1365 1292
1366 { 1293 {
1367 if (!strcmp (f.get_str (), "all")) 1294 if (!strcmp (f.get_str (), "all"))
1368 break; 1295 break;
1369 1296
1370 char *next, *cp = f.get_str (); 1297 char *next, *cp = f.get_str ();
1371 1298
1372 do 1299 do
1373 { 1300 {
1374 nrofallowedstr++;
1375
1376 if ((next = strchr (cp, ','))) 1301 if ((next = strchr (cp, ',')))
1377 *next++ = '\0'; 1302 *next++ = '\0';
1378 1303
1379 linked_char *tmp = new linked_char; 1304 linked_char *tmp = new linked_char;
1380 1305
… …
1395 break; 1320 break;
1396 1321
1397 case KW_object: 1322 case KW_object:
1398 { 1323 {
1399 art->item = object::create (); 1324 art->item = object::create ();
1325 f.get (art->item->name);
1326 f.next ();
1400 1327
1401 if (!art->item->parse_kv (f)) 1328 if (!art->item->parse_kv (f))
1402 LOG (llevError, "Init_Artifacts: Could not load object.\n"); 1329 LOG (llevError, "Init_Artifacts: Could not load object.\n");
1403 1330
1404 al = find_artifactlist (art->item->type); 1331 al = find_artifactlist (art->item->type);
… …
1430 } 1357 }
1431 1358
1432done: 1359done:
1433 for (al = first_artifactlist; al; al = al->next) 1360 for (al = first_artifactlist; al; al = al->next)
1434 { 1361 {
1362 al->total_chance = 0;
1363
1435 for (art = al->items; art; art = art->next) 1364 for (art = al->items; art; art = art->next)
1436 { 1365 {
1437 if (!art->chance) 1366 if (!art->chance)
1438 LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name); 1367 LOG (llevError, "Warning: artifact with no chance: %s\n", &art->item->name);
1439 else 1368 else
… …
1445 } 1374 }
1446 1375
1447 LOG (llevDebug, "done.\n"); 1376 LOG (llevDebug, "done.\n");
1448} 1377}
1449 1378
1450
1451/* 1379/*
1452 * Used in artifact generation. The bonuses of the first object 1380 * Used in artifact generation. The bonuses of the first object
1453 * is modified by the bonuses of the second object. 1381 * is modified by the bonuses of the second object.
1454 */ 1382 */
1455
1456void 1383void
1457add_abilities (object *op, object *change) 1384add_abilities (object *op, object *change)
1458{ 1385{
1459 int i, tmp; 1386 int i, tmp;
1460 1387
… …
1813 SET_FLAG (item, FLAG_NO_STEAL); 1740 SET_FLAG (item, FLAG_NO_STEAL);
1814 } 1741 }
1815} 1742}
1816 1743
1817/* special_potion() - so that old potion code is still done right. */ 1744/* special_potion() - so that old potion code is still done right. */
1818
1819int 1745int
1820special_potion (object *op) 1746special_potion (object *op)
1821{ 1747{
1822 if (op->attacktype) 1748 if (op->attacktype)
1823 return 1; 1749 return 1;

Diff Legend

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