1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * 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 along |
18 | * You should have received a copy of the GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
24 | /* TREASURE_DEBUG does some checking on the treasurelists after loading. |
… | |
… | |
203 | { |
202 | { |
204 | for (treasure *t = tl->items; t; t = t->next) |
203 | for (treasure *t = tl->items; t; t = t->next) |
205 | { |
204 | { |
206 | if (t->next_yes || t->next_no) |
205 | if (t->next_yes || t->next_no) |
207 | { |
206 | { |
208 | LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); |
207 | 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"); |
208 | LOG (llevError, " the next_yes or next_no field is set\n"); |
210 | } |
209 | } |
211 | |
210 | |
212 | tl->total_chance += t->chance; |
211 | tl->total_chance += t->chance; |
213 | } |
212 | } |
… | |
… | |
244 | return; |
243 | return; |
245 | } |
244 | } |
246 | |
245 | |
247 | op->expand_tail (); |
246 | op->expand_tail (); |
248 | |
247 | |
249 | if (ob_blocked (op, creator->map, creator->x, creator->y)) |
248 | if (op->blocked (creator->map, creator->x, creator->y)) |
250 | op->destroy (); |
249 | op->destroy (); |
251 | else |
250 | else |
252 | { |
251 | { |
253 | SET_FLAG (op, FLAG_OBJ_ORIGINAL); |
252 | SET_FLAG (op, FLAG_OBJ_ORIGINAL); |
254 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
253 | op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); |
… | |
… | |
300 | else |
299 | else |
301 | LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name); |
300 | LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name); |
302 | } |
301 | } |
303 | else |
302 | else |
304 | { |
303 | { |
305 | if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) |
304 | if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE))) |
306 | { |
305 | { |
307 | object *tmp = arch_to_object (t->item); |
306 | object *tmp = arch_to_object (t->item); |
308 | |
307 | |
309 | if (t->nrof && tmp->nrof <= 1) |
308 | if (t->nrof && tmp->nrof <= 1) |
310 | tmp->nrof = rndm (t->nrof) + 1; |
309 | tmp->nrof = rndm (t->nrof) + 1; |
… | |
… | |
357 | create_treasure (tl, op, flag, difficulty, tries); |
356 | create_treasure (tl, op, flag, difficulty, tries); |
358 | } |
357 | } |
359 | else if (t->nrof) |
358 | else if (t->nrof) |
360 | create_one_treasure (tl, op, flag, difficulty, tries); |
359 | create_one_treasure (tl, op, flag, difficulty, tries); |
361 | } |
360 | } |
362 | else if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE)) |
361 | else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE)) |
363 | { |
362 | { |
364 | if (object *tmp = arch_to_object (t->item)) |
363 | if (object *tmp = arch_to_object (t->item)) |
365 | { |
364 | { |
366 | if (t->nrof && tmp->nrof <= 1) |
365 | if (t->nrof && tmp->nrof <= 1) |
367 | tmp->nrof = rndm (t->nrof) + 1; |
366 | tmp->nrof = rndm (t->nrof) + 1; |
… | |
… | |
572 | |
571 | |
573 | op->magic = magic; |
572 | op->magic = magic; |
574 | if (op->arch) |
573 | if (op->arch) |
575 | { |
574 | { |
576 | if (op->type == ARMOUR) |
575 | if (op->type == ARMOUR) |
577 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100; |
576 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100; |
578 | |
577 | |
579 | if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ |
578 | if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ |
580 | magic = (-magic); |
579 | magic = (-magic); |
581 | op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100; |
580 | op->weight = (op->arch->weight * (100 - magic * 10)) / 100; |
582 | } |
581 | } |
583 | else |
582 | else |
584 | { |
583 | { |
585 | if (op->type == ARMOUR) |
584 | if (op->type == ARMOUR) |
586 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; |
585 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; |
… | |
… | |
1224 | else |
1223 | else |
1225 | { |
1224 | { |
1226 | for (i = 0; i < depth; i++) |
1225 | for (i = 0; i < depth; i++) |
1227 | fprintf (logfile, " "); |
1226 | fprintf (logfile, " "); |
1228 | |
1227 | |
1229 | if (t->item && t->item->clone.type == FLESH) |
1228 | if (t->item && t->item->type == FLESH) |
1230 | fprintf (logfile, "%s's %s\n", name, &t->item->clone.name); |
1229 | fprintf (logfile, "%s's %s\n", name, &t->item->object::name); |
1231 | else |
1230 | else |
1232 | fprintf (logfile, "%s\n", &t->item->clone.name); |
1231 | fprintf (logfile, "%s\n", &t->item->object::name); |
1233 | } |
1232 | } |
1234 | |
1233 | |
1235 | if (t->next_yes) |
1234 | if (t->next_yes) |
1236 | { |
1235 | { |
1237 | for (i = 0; i < depth; i++) |
1236 | for (i = 0; i < depth; i++) |
… | |
… | |
1265 | int found; |
1264 | int found; |
1266 | |
1265 | |
1267 | found = 0; |
1266 | found = 0; |
1268 | fprintf (logfile, "\n"); |
1267 | fprintf (logfile, "\n"); |
1269 | |
1268 | |
1270 | for (at = first_archetype; at != NULL; at = at->next) |
1269 | for_all_archetypes (at) |
1271 | if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) |
1270 | if (!strcasecmp (at->object::name, name) && at->title == NULL) |
1272 | { |
1271 | { |
1273 | fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name); |
1272 | fprintf (logfile, "treasures for %s (arch: %s)\n", &at->object::name, &at->archname); |
1274 | if (at->clone.randomitems != NULL) |
1273 | if (at->randomitems != NULL) |
1275 | dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1); |
1274 | dump_monster_treasure_rec (at->object::name, at->randomitems->items, 1); |
1276 | else |
1275 | else |
1277 | fprintf (logfile, "(nothing)\n"); |
1276 | fprintf (logfile, "(nothing)\n"); |
1278 | |
1277 | |
1279 | fprintf (logfile, "\n"); |
1278 | fprintf (logfile, "\n"); |
1280 | found++; |
1279 | found++; |
… | |
… | |
1303 | sprintf (filename, "%s/artifacts", settings.datadir); |
1302 | sprintf (filename, "%s/artifacts", settings.datadir); |
1304 | object_thawer f (filename); |
1303 | object_thawer f (filename); |
1305 | |
1304 | |
1306 | if (!f) |
1305 | if (!f) |
1307 | return; |
1306 | return; |
1308 | |
|
|
1309 | f.next (); |
|
|
1310 | |
1307 | |
1311 | for (;;) |
1308 | for (;;) |
1312 | { |
1309 | { |
1313 | switch (f.kw) |
1310 | switch (f.kw) |
1314 | { |
1311 | { |
… | |
… | |
1612 | name = tmp->name + 1, neg = 1; |
1609 | name = tmp->name + 1, neg = 1; |
1613 | else |
1610 | else |
1614 | name = tmp->name, neg = 0; |
1611 | name = tmp->name, neg = 0; |
1615 | |
1612 | |
1616 | /* If we match name, then return the opposite of 'neg' */ |
1613 | /* If we match name, then return the opposite of 'neg' */ |
1617 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->name))) |
1614 | if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname))) |
1618 | return !neg; |
1615 | return !neg; |
1619 | |
1616 | |
1620 | /* Set success as true, since if the match was an inverse, it means |
1617 | /* Set success as true, since if the match was an inverse, it means |
1621 | * everything is allowed except what we match |
1618 | * everything is allowed except what we match |
1622 | */ |
1619 | */ |