| 1 | /* |
1 | /* |
| 2 | * CrossFire, A Multiplayer game |
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 |
| … | |
… | |
| 203 | { |
203 | { |
| 204 | for (treasure *t = tl->items; t; t = t->next) |
204 | for (treasure *t = tl->items; t; t = t->next) |
| 205 | { |
205 | { |
| 206 | if (t->next_yes || t->next_no) |
206 | if (t->next_yes || t->next_no) |
| 207 | { |
207 | { |
| 208 | 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); |
| 209 | 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"); |
| 210 | } |
210 | } |
| 211 | |
211 | |
| 212 | tl->total_chance += t->chance; |
212 | tl->total_chance += t->chance; |
| 213 | } |
213 | } |
| … | |
… | |
| 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; |
| … | |
… | |
| 1268 | fprintf (logfile, "\n"); |
1268 | fprintf (logfile, "\n"); |
| 1269 | |
1269 | |
| 1270 | for (at = first_archetype; at != NULL; at = at->next) |
1270 | for (at = first_archetype; at != NULL; at = at->next) |
| 1271 | if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) |
1271 | if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) |
| 1272 | { |
1272 | { |
| 1273 | 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); |
| 1274 | if (at->clone.randomitems != NULL) |
1274 | if (at->clone.randomitems != NULL) |
| 1275 | 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); |
| 1276 | else |
1276 | else |
| 1277 | fprintf (logfile, "(nothing)\n"); |
1277 | fprintf (logfile, "(nothing)\n"); |
| 1278 | |
1278 | |
| … | |
… | |
| 1418 | #endif |
1418 | #endif |
| 1419 | op->face = change->face; |
1419 | op->face = change->face; |
| 1420 | } |
1420 | } |
| 1421 | |
1421 | |
| 1422 | for (i = 0; i < NUM_STATS; i++) |
1422 | for (i = 0; i < NUM_STATS; i++) |
| 1423 | change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i)); |
1423 | change_attr_value (&(op->stats), i, change->stats.stat (i)); |
| 1424 | |
1424 | |
| 1425 | op->attacktype |= change->attacktype; |
1425 | op->attacktype |= change->attacktype; |
| 1426 | op->path_attuned |= change->path_attuned; |
1426 | op->path_attuned |= change->path_attuned; |
| 1427 | op->path_repelled |= change->path_repelled; |
1427 | op->path_repelled |= change->path_repelled; |
| 1428 | op->path_denied |= change->path_denied; |
1428 | op->path_denied |= change->path_denied; |
| … | |
… | |
| 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 | */ |
