1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
9 | * it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
11 | * (at your option) any later version. |
11 | * 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, but |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 | * GNU General Public License for more details. |
16 | * 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 GNU General Public License along |
19 | * along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
25 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
26 | * It is useful for finding bugs in the treasures file. Since it only |
26 | * It is useful for finding bugs in the treasures file. Since it only |
27 | * slows the startup some (and not actual game play), it is by default |
27 | * slows the startup some (and not actual game play), it is by default |
… | |
… | |
54 | > tl_map_t; |
54 | > tl_map_t; |
55 | |
55 | |
56 | static tl_map_t tl_map; |
56 | static tl_map_t tl_map; |
57 | |
57 | |
58 | /* |
58 | /* |
59 | * Initialize global archtype pointers: |
|
|
60 | */ |
|
|
61 | void |
|
|
62 | init_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 |
59 | * Searches for the given treasurelist |
82 | */ |
60 | */ |
83 | treasurelist * |
61 | treasurelist * |
84 | treasurelist::find (const char *name) |
62 | treasurelist::find (const char *name) |
85 | { |
63 | { |
… | |
… | |
167 | coroapi::cede_to_tick_every (10); |
145 | coroapi::cede_to_tick_every (10); |
168 | |
146 | |
169 | switch (f.kw) |
147 | switch (f.kw) |
170 | { |
148 | { |
171 | case KW_arch: |
149 | case KW_arch: |
172 | if (!(t->item = archetype::find (f.get_str ()))) |
150 | t->item = archetype::get (f.get_str ()); |
173 | LOG (llevError, "%s:%d treasure references unknown archetype '%s', skipping.\n", f.name, f.linenum, f.get_str ()); |
|
|
174 | break; |
151 | break; |
175 | |
152 | |
176 | case KW_list: f.get (t->name); break; |
153 | case KW_list: f.get (t->name); break; |
177 | case KW_change_name: f.get (t->change_arch.name); break; |
154 | case KW_change_name: f.get (t->change_arch.name); break; |
178 | case KW_change_title: f.get (t->change_arch.title); break; |
155 | case KW_change_title: f.get (t->change_arch.title); break; |
… | |
… | |
220 | |
197 | |
221 | /* This is a one of the many items on the list should be generated. |
198 | /* This is a one of the many items on the list should be generated. |
222 | * Add up the chance total, and check to make sure the yes & no |
199 | * Add up the chance total, and check to make sure the yes & no |
223 | * fields of the treasures are not being used. |
200 | * fields of the treasures are not being used. |
224 | */ |
201 | */ |
225 | tl->total_chance = 0; |
|
|
226 | |
|
|
227 | if (one) |
202 | if (one) |
228 | { |
203 | { |
229 | for (treasure *t = tl->items; t; t = t->next) |
204 | for (treasure *t = tl->items; t; t = t->next) |
230 | { |
205 | { |
231 | if (t->next_yes || t->next_no) |
206 | if (t->next_yes || t->next_no) |
232 | { |
207 | { |
233 | LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); |
208 | LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->archname : &t->name); |
234 | LOG (llevError, " the next_yes or next_no field is set\n"); |
209 | LOG (llevError, " the next_yes or next_no field is set\n"); |
235 | } |
210 | } |
236 | |
211 | |
237 | tl->total_chance += t->chance; |
212 | tl->total_chance += t->chance; |
238 | } |
213 | } |
… | |
… | |
253 | * start with equipment, but only their abilities). |
228 | * start with equipment, but only their abilities). |
254 | */ |
229 | */ |
255 | static void |
230 | static void |
256 | put_treasure (object *op, object *creator, int flags) |
231 | put_treasure (object *op, object *creator, int flags) |
257 | { |
232 | { |
258 | object *tmp; |
233 | if (flags & GT_ENVIRONMENT) |
259 | |
234 | { |
260 | /* Bit of a hack - spells should never be put onto the map. The entire |
235 | /* Bit of a hack - spells should never be put onto the map. The entire |
261 | * treasure stuff is a problem - there is no clear idea of knowing |
236 | * treasure stuff is a problem - there is no clear idea of knowing |
262 | * this is the original object, or if this is an object that should be created |
237 | * this is the original object, or if this is an object that should be created |
263 | * by another object. |
238 | * by another object. |
264 | */ |
239 | */ |
265 | if (flags & GT_ENVIRONMENT && op->type != SPELL) |
240 | //TODO: flag such as objects... as such (no drop, anybody?) |
266 | { |
241 | if (op->type == SPELL) |
|
|
242 | { |
|
|
243 | op->destroy (); |
|
|
244 | return; |
|
|
245 | } |
|
|
246 | |
|
|
247 | op->expand_tail (); |
|
|
248 | |
|
|
249 | if (ob_blocked (op, creator->map, creator->x, creator->y)) |
|
|
250 | op->destroy (); |
|
|
251 | else |
|
|
252 | { |
267 | SET_FLAG (op, FLAG_OBJ_ORIGINAL); |
253 | SET_FLAG (op, FLAG_OBJ_ORIGINAL); |
268 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
254 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
|
|
255 | } |
269 | } |
256 | } |
270 | else |
257 | else |
271 | { |
258 | { |
272 | op = creator->insert (op); |
259 | op = creator->insert (op); |
273 | |
260 | |
274 | if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) |
261 | if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) |
275 | monster_check_apply (creator, op); |
262 | monster_check_apply (creator, op); |
276 | |
263 | |
277 | if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ())) |
264 | if (flags & GT_UPDATE_INV) |
|
|
265 | if (object *tmp = creator->in_player ()) |
278 | esrv_send_item (tmp, op); |
266 | esrv_send_item (tmp, op); |
279 | } |
267 | } |
280 | } |
268 | } |
281 | |
269 | |
282 | /* if there are change_xxx commands in the treasure, we include the changes |
270 | /* if there are change_xxx commands in the treasure, we include the changes |
283 | * in the generated object |
271 | * in the generated object |
… | |
… | |
381 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
369 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
382 | change_treasure (t, tmp); |
370 | change_treasure (t, tmp); |
383 | put_treasure (tmp, op, flag); |
371 | put_treasure (tmp, op, flag); |
384 | } |
372 | } |
385 | } |
373 | } |
|
|
374 | } |
|
|
375 | |
|
|
376 | void |
|
|
377 | object::create_treasure (treasurelist *tl, int flags) |
|
|
378 | { |
|
|
379 | ::create_treasure (tl, this, flags, map ? map->difficulty : 0); |
386 | } |
380 | } |
387 | |
381 | |
388 | /* This calls the appropriate treasure creation function. tries is passed |
382 | /* This calls the appropriate treasure creation function. tries is passed |
389 | * to determine how many list transitions or attempts to create treasure |
383 | * to determine how many list transitions or attempts to create treasure |
390 | * have been made. It is really in place to prevent infinite loops with |
384 | * have been made. It is really in place to prevent infinite loops with |
… | |
… | |
403 | { |
397 | { |
404 | LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); |
398 | LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); |
405 | return; |
399 | return; |
406 | } |
400 | } |
407 | |
401 | |
|
|
402 | if (op->flag [FLAG_TREASURE_ENV]) |
|
|
403 | { |
|
|
404 | // do not generate items when there already is something above the object |
|
|
405 | if (op->flag [FLAG_IS_FLOOR] && op->above) |
|
|
406 | return; |
|
|
407 | |
|
|
408 | flag |= GT_ENVIRONMENT; |
|
|
409 | } |
|
|
410 | |
408 | if (tl->total_chance) |
411 | if (tl->total_chance) |
409 | create_one_treasure (tl, op, flag, difficulty, tries); |
412 | create_one_treasure (tl, op, flag, difficulty, tries); |
410 | else |
413 | else |
411 | create_all_treasures (tl->items, op, flag, difficulty, tries); |
414 | create_all_treasures (tl->items, op, flag, difficulty, tries); |
412 | } |
415 | } |
… | |
… | |
419 | object * |
422 | object * |
420 | generate_treasure (treasurelist *tl, int difficulty) |
423 | generate_treasure (treasurelist *tl, int difficulty) |
421 | { |
424 | { |
422 | difficulty = clamp (difficulty, 1, settings.max_level); |
425 | difficulty = clamp (difficulty, 1, settings.max_level); |
423 | |
426 | |
424 | object *ob = object::create (), *tmp; |
427 | object *ob = object::create (); |
425 | |
428 | |
426 | create_treasure (tl, ob, 0, difficulty, 0); |
429 | create_treasure (tl, ob, 0, difficulty, 0); |
427 | |
430 | |
428 | /* Don't want to free the object we are about to return */ |
431 | /* Don't want to free the object we are about to return */ |
429 | tmp = ob->inv; |
432 | object *tmp = ob->inv; |
430 | if (tmp != NULL) |
433 | if (tmp) |
431 | tmp->remove (); |
434 | tmp->remove (); |
432 | |
435 | |
433 | if (ob->inv) |
436 | if (ob->inv) |
434 | LOG (llevError, "In generate treasure, created multiple objects.\n"); |
437 | LOG (llevError, "In generate treasure, created multiple objects.\n"); |
435 | |
438 | |
… | |
… | |
443 | * The array has two arguments, the difficulty of the level, and the |
446 | * The array has two arguments, the difficulty of the level, and the |
444 | * magical bonus "wanted". |
447 | * magical bonus "wanted". |
445 | */ |
448 | */ |
446 | |
449 | |
447 | static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = { |
450 | static int difftomagic_list[DIFFLEVELS][MAXMAGIC + 1] = { |
448 | |
|
|
449 | // chance of magic difficulty |
451 | // chance of magic difficulty |
450 | // +0 +1 +2 +3 +4 |
452 | // +0 +1 +2 +3 +4 |
451 | {95, 2, 2, 1, 0}, // 1 |
453 | {95, 2, 2, 1, 0}, // 1 |
452 | {92, 5, 2, 1, 0}, // 2 |
454 | {92, 5, 2, 1, 0}, // 2 |
453 | {85, 10, 4, 1, 0}, // 3 |
455 | {85, 10, 4, 1, 0}, // 3 |
… | |
… | |
479 | { 0, 0, 0, 3, 97}, // 29 |
481 | { 0, 0, 0, 3, 97}, // 29 |
480 | { 0, 0, 0, 0, 100}, // 30 |
482 | { 0, 0, 0, 0, 100}, // 30 |
481 | { 0, 0, 0, 0, 100}, // 31 |
483 | { 0, 0, 0, 0, 100}, // 31 |
482 | }; |
484 | }; |
483 | |
485 | |
484 | |
|
|
485 | /* calculate the appropriate level for wands staves and scrolls. |
486 | /* calculate the appropriate level for wands staves and scrolls. |
486 | * This code presumes that op has had its spell object created (in op->inv) |
487 | * This code presumes that op has had its spell object created (in op->inv) |
487 | * |
488 | * |
488 | * elmex Wed Aug 9 17:44:59 CEST 2006: |
489 | * elmex Wed Aug 9 17:44:59 CEST 2006: |
489 | * Removed multiplicator, too many high-level items were generated on low-difficulty maps. |
490 | * Removed multiplicator, too many high-level items were generated on low-difficulty maps. |
490 | */ |
491 | */ |
491 | |
|
|
492 | int |
492 | int |
493 | level_for_item (const object *op, int difficulty) |
493 | level_for_item (const object *op, int difficulty) |
494 | { |
494 | { |
495 | int olevel = 0; |
495 | int olevel = 0; |
496 | |
496 | |
… | |
… | |
648 | case 2: |
648 | case 2: |
649 | case 3: |
649 | case 3: |
650 | case 4: |
650 | case 4: |
651 | case 5: |
651 | case 5: |
652 | case 6: |
652 | case 6: |
653 | set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r))); |
653 | op->stats.stat (r) += bonus; |
654 | break; |
654 | break; |
655 | |
655 | |
656 | case 7: |
656 | case 7: |
657 | op->stats.dam += bonus; |
657 | op->stats.dam += bonus; |
658 | break; |
658 | break; |
… | |
… | |
806 | save_item_power = op->item_power; |
806 | save_item_power = op->item_power; |
807 | op->item_power = 0; |
807 | op->item_power = 0; |
808 | |
808 | |
809 | if (op->randomitems && op->type != SPELL) |
809 | if (op->randomitems && op->type != SPELL) |
810 | { |
810 | { |
811 | create_treasure (op->randomitems, op, flags, difficulty, 0); |
811 | create_treasure (op->randomitems, op, flags & ~GT_ENVIRONMENT, difficulty, 0); |
812 | if (!op->inv) |
|
|
813 | LOG (llevDebug, "fix_generated_item: Unable to generate treasure for %s\n", op->debug_desc ()); |
|
|
814 | |
|
|
815 | /* So the treasure doesn't get created again */ |
812 | /* So the treasure doesn't get created again */ |
816 | op->randomitems = 0; |
813 | op->randomitems = 0; |
817 | } |
814 | } |
818 | |
815 | |
819 | if (difficulty < 1) |
816 | if (difficulty < 1) |
… | |
… | |
1271 | fprintf (logfile, "\n"); |
1268 | fprintf (logfile, "\n"); |
1272 | |
1269 | |
1273 | for (at = first_archetype; at != NULL; at = at->next) |
1270 | for (at = first_archetype; at != NULL; at = at->next) |
1274 | if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) |
1271 | if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) |
1275 | { |
1272 | { |
1276 | fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name); |
1273 | fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->archname); |
1277 | if (at->clone.randomitems != NULL) |
1274 | if (at->clone.randomitems != NULL) |
1278 | dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1); |
1275 | dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1); |
1279 | else |
1276 | else |
1280 | fprintf (logfile, "(nothing)\n"); |
1277 | fprintf (logfile, "(nothing)\n"); |
1281 | |
1278 | |
… | |
… | |
1349 | break; |
1346 | break; |
1350 | |
1347 | |
1351 | case KW_object: |
1348 | case KW_object: |
1352 | { |
1349 | { |
1353 | art->item = object::create (); |
1350 | art->item = object::create (); |
|
|
1351 | f.get (art->item->name); |
|
|
1352 | f.next (); |
1354 | |
1353 | |
1355 | if (!art->item->parse_kv (f)) |
1354 | if (!art->item->parse_kv (f)) |
1356 | LOG (llevError, "Init_Artifacts: Could not load object.\n"); |
1355 | LOG (llevError, "Init_Artifacts: Could not load object.\n"); |
1357 | |
1356 | |
1358 | al = find_artifactlist (art->item->type); |
1357 | al = find_artifactlist (art->item->type); |
… | |
… | |
1419 | #endif |
1418 | #endif |
1420 | op->face = change->face; |
1419 | op->face = change->face; |
1421 | } |
1420 | } |
1422 | |
1421 | |
1423 | for (i = 0; i < NUM_STATS; i++) |
1422 | for (i = 0; i < NUM_STATS; i++) |
1424 | change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i)); |
1423 | change_attr_value (&(op->stats), i, change->stats.stat (i)); |
1425 | |
1424 | |
1426 | op->attacktype |= change->attacktype; |
1425 | op->attacktype |= change->attacktype; |
1427 | op->path_attuned |= change->path_attuned; |
1426 | op->path_attuned |= change->path_attuned; |
1428 | op->path_repelled |= change->path_repelled; |
1427 | op->path_repelled |= change->path_repelled; |
1429 | op->path_denied |= change->path_denied; |
1428 | op->path_denied |= change->path_denied; |
… | |
… | |
1593 | if (change->msg) |
1592 | if (change->msg) |
1594 | op->msg = change->msg; |
1593 | op->msg = change->msg; |
1595 | } |
1594 | } |
1596 | |
1595 | |
1597 | static int |
1596 | static int |
1598 | legal_artifact_combination (object *op, artifact * art) |
1597 | legal_artifact_combination (object *op, artifact *art) |
1599 | { |
1598 | { |
1600 | int neg, success = 0; |
1599 | int neg, success = 0; |
1601 | linked_char *tmp; |
1600 | linked_char *tmp; |
1602 | const char *name; |
1601 | const char *name; |
1603 | |
1602 | |
1604 | if (art->allowed == (linked_char *) NULL) |
1603 | if (!art->allowed) |
1605 | return 1; /* Ie, "all" */ |
1604 | return 1; /* Ie, "all" */ |
|
|
1605 | |
1606 | for (tmp = art->allowed; tmp; tmp = tmp->next) |
1606 | for (tmp = art->allowed; tmp; tmp = tmp->next) |
1607 | { |
1607 | { |
1608 | #ifdef TREASURE_VERBOSE |
1608 | #ifdef TREASURE_VERBOSE |
1609 | LOG (llevDebug, "legal_art: %s\n", &tmp->name); |
1609 | LOG (llevDebug, "legal_art: %s\n", &tmp->name); |
1610 | #endif |
1610 | #endif |
… | |
… | |
1612 | name = tmp->name + 1, neg = 1; |
1612 | name = tmp->name + 1, neg = 1; |
1613 | else |
1613 | else |
1614 | name = tmp->name, neg = 0; |
1614 | name = tmp->name, neg = 0; |
1615 | |
1615 | |
1616 | /* If we match name, then return the opposite of 'neg' */ |
1616 | /* If we match name, then return the opposite of 'neg' */ |
1617 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->name))) |
1617 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname))) |
1618 | return !neg; |
1618 | return !neg; |
1619 | |
1619 | |
1620 | /* Set success as true, since if the match was an inverse, it means |
1620 | /* Set success as true, since if the match was an inverse, it means |
1621 | * everything is allowed except what we match |
1621 | * everything is allowed except what we match |
1622 | */ |
1622 | */ |
1623 | else if (neg) |
1623 | else if (neg) |
1624 | success = 1; |
1624 | success = 1; |
1625 | } |
1625 | } |
|
|
1626 | |
1626 | return success; |
1627 | return success; |
1627 | } |
1628 | } |
1628 | |
1629 | |
1629 | /* |
1630 | /* |
1630 | * Fixes the given object, giving it the abilities and titles |
1631 | * Fixes the given object, giving it the abilities and titles |