1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
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 |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) 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, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License 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 |
18 | * You should have received a copy of the GNU General Public License |
19 | * along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at <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. |
26 | * It is useful for finding bugs in the treasures file. Since it only |
25 | * 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 |
26 | * slows the startup some (and not actual game play), it is by default |
… | |
… | |
197 | |
196 | |
198 | /* This is a one of the many items on the list should be generated. |
197 | /* 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 |
198 | * Add up the chance total, and check to make sure the yes & no |
200 | * fields of the treasures are not being used. |
199 | * fields of the treasures are not being used. |
201 | */ |
200 | */ |
202 | tl->total_chance = 0; |
|
|
203 | |
|
|
204 | if (one) |
201 | if (one) |
205 | { |
202 | { |
206 | for (treasure *t = tl->items; t; t = t->next) |
203 | for (treasure *t = tl->items; t; t = t->next) |
207 | { |
204 | { |
208 | if (t->next_yes || t->next_no) |
205 | if (t->next_yes || t->next_no) |
209 | { |
206 | { |
210 | 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); |
211 | 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"); |
212 | } |
209 | } |
213 | |
210 | |
214 | tl->total_chance += t->chance; |
211 | tl->total_chance += t->chance; |
215 | } |
212 | } |
… | |
… | |
302 | else |
299 | else |
303 | 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); |
304 | } |
301 | } |
305 | else |
302 | else |
306 | { |
303 | { |
307 | if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) |
304 | if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE))) |
308 | { |
305 | { |
309 | object *tmp = arch_to_object (t->item); |
306 | object *tmp = arch_to_object (t->item); |
310 | |
307 | |
311 | if (t->nrof && tmp->nrof <= 1) |
308 | if (t->nrof && tmp->nrof <= 1) |
312 | tmp->nrof = rndm (t->nrof) + 1; |
309 | tmp->nrof = rndm (t->nrof) + 1; |
… | |
… | |
359 | create_treasure (tl, op, flag, difficulty, tries); |
356 | create_treasure (tl, op, flag, difficulty, tries); |
360 | } |
357 | } |
361 | else if (t->nrof) |
358 | else if (t->nrof) |
362 | create_one_treasure (tl, op, flag, difficulty, tries); |
359 | create_one_treasure (tl, op, flag, difficulty, tries); |
363 | } |
360 | } |
364 | else if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE)) |
361 | else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE)) |
365 | { |
362 | { |
366 | if (object *tmp = arch_to_object (t->item)) |
363 | if (object *tmp = arch_to_object (t->item)) |
367 | { |
364 | { |
368 | if (t->nrof && tmp->nrof <= 1) |
365 | if (t->nrof && tmp->nrof <= 1) |
369 | tmp->nrof = rndm (t->nrof) + 1; |
366 | tmp->nrof = rndm (t->nrof) + 1; |
… | |
… | |
397 | |
394 | |
398 | if (tries++ > 100) |
395 | if (tries++ > 100) |
399 | { |
396 | { |
400 | LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); |
397 | LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); |
401 | return; |
398 | return; |
|
|
399 | } |
|
|
400 | |
|
|
401 | if (op->flag [FLAG_TREASURE_ENV]) |
|
|
402 | { |
|
|
403 | // do not generate items when there already is something above the object |
|
|
404 | if (op->flag [FLAG_IS_FLOOR] && op->above) |
|
|
405 | return; |
|
|
406 | |
|
|
407 | flag |= GT_ENVIRONMENT; |
402 | } |
408 | } |
403 | |
409 | |
404 | if (tl->total_chance) |
410 | if (tl->total_chance) |
405 | create_one_treasure (tl, op, flag, difficulty, tries); |
411 | create_one_treasure (tl, op, flag, difficulty, tries); |
406 | else |
412 | else |
… | |
… | |
565 | |
571 | |
566 | op->magic = magic; |
572 | op->magic = magic; |
567 | if (op->arch) |
573 | if (op->arch) |
568 | { |
574 | { |
569 | if (op->type == ARMOUR) |
575 | if (op->type == ARMOUR) |
570 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100; |
576 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100; |
571 | |
577 | |
572 | 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 */ |
573 | magic = (-magic); |
579 | magic = (-magic); |
574 | op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100; |
580 | op->weight = (op->arch->weight * (100 - magic * 10)) / 100; |
575 | } |
581 | } |
576 | else |
582 | else |
577 | { |
583 | { |
578 | if (op->type == ARMOUR) |
584 | if (op->type == ARMOUR) |
579 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; |
585 | ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; |
… | |
… | |
641 | case 2: |
647 | case 2: |
642 | case 3: |
648 | case 3: |
643 | case 4: |
649 | case 4: |
644 | case 5: |
650 | case 5: |
645 | case 6: |
651 | case 6: |
646 | set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r))); |
652 | op->stats.stat (r) += bonus; |
647 | break; |
653 | break; |
648 | |
654 | |
649 | case 7: |
655 | case 7: |
650 | op->stats.dam += bonus; |
656 | op->stats.dam += bonus; |
651 | break; |
657 | break; |
… | |
… | |
1217 | else |
1223 | else |
1218 | { |
1224 | { |
1219 | for (i = 0; i < depth; i++) |
1225 | for (i = 0; i < depth; i++) |
1220 | fprintf (logfile, " "); |
1226 | fprintf (logfile, " "); |
1221 | |
1227 | |
1222 | if (t->item && t->item->clone.type == FLESH) |
1228 | if (t->item && t->item->type == FLESH) |
1223 | fprintf (logfile, "%s's %s\n", name, &t->item->clone.name); |
1229 | fprintf (logfile, "%s's %s\n", name, &t->item->object::name); |
1224 | else |
1230 | else |
1225 | fprintf (logfile, "%s\n", &t->item->clone.name); |
1231 | fprintf (logfile, "%s\n", &t->item->object::name); |
1226 | } |
1232 | } |
1227 | |
1233 | |
1228 | if (t->next_yes) |
1234 | if (t->next_yes) |
1229 | { |
1235 | { |
1230 | for (i = 0; i < depth; i++) |
1236 | for (i = 0; i < depth; i++) |
… | |
… | |
1258 | int found; |
1264 | int found; |
1259 | |
1265 | |
1260 | found = 0; |
1266 | found = 0; |
1261 | fprintf (logfile, "\n"); |
1267 | fprintf (logfile, "\n"); |
1262 | |
1268 | |
1263 | for (at = first_archetype; at != NULL; at = at->next) |
1269 | for_all_archetypes (at) |
1264 | if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL) |
1270 | if (!strcasecmp (at->object::name, name) && at->title == NULL) |
1265 | { |
1271 | { |
1266 | 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); |
1267 | if (at->clone.randomitems != NULL) |
1273 | if (at->randomitems != NULL) |
1268 | dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1); |
1274 | dump_monster_treasure_rec (at->object::name, at->randomitems->items, 1); |
1269 | else |
1275 | else |
1270 | fprintf (logfile, "(nothing)\n"); |
1276 | fprintf (logfile, "(nothing)\n"); |
1271 | |
1277 | |
1272 | fprintf (logfile, "\n"); |
1278 | fprintf (logfile, "\n"); |
1273 | found++; |
1279 | found++; |
… | |
… | |
1296 | sprintf (filename, "%s/artifacts", settings.datadir); |
1302 | sprintf (filename, "%s/artifacts", settings.datadir); |
1297 | object_thawer f (filename); |
1303 | object_thawer f (filename); |
1298 | |
1304 | |
1299 | if (!f) |
1305 | if (!f) |
1300 | return; |
1306 | return; |
1301 | |
|
|
1302 | f.next (); |
|
|
1303 | |
1307 | |
1304 | for (;;) |
1308 | for (;;) |
1305 | { |
1309 | { |
1306 | switch (f.kw) |
1310 | switch (f.kw) |
1307 | { |
1311 | { |
… | |
… | |
1411 | #endif |
1415 | #endif |
1412 | op->face = change->face; |
1416 | op->face = change->face; |
1413 | } |
1417 | } |
1414 | |
1418 | |
1415 | for (i = 0; i < NUM_STATS; i++) |
1419 | for (i = 0; i < NUM_STATS; i++) |
1416 | change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i)); |
1420 | change_attr_value (&(op->stats), i, change->stats.stat (i)); |
1417 | |
1421 | |
1418 | op->attacktype |= change->attacktype; |
1422 | op->attacktype |= change->attacktype; |
1419 | op->path_attuned |= change->path_attuned; |
1423 | op->path_attuned |= change->path_attuned; |
1420 | op->path_repelled |= change->path_repelled; |
1424 | op->path_repelled |= change->path_repelled; |
1421 | op->path_denied |= change->path_denied; |
1425 | op->path_denied |= change->path_denied; |
… | |
… | |
1605 | name = tmp->name + 1, neg = 1; |
1609 | name = tmp->name + 1, neg = 1; |
1606 | else |
1610 | else |
1607 | name = tmp->name, neg = 0; |
1611 | name = tmp->name, neg = 0; |
1608 | |
1612 | |
1609 | /* If we match name, then return the opposite of 'neg' */ |
1613 | /* If we match name, then return the opposite of 'neg' */ |
1610 | 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))) |
1611 | return !neg; |
1615 | return !neg; |
1612 | |
1616 | |
1613 | /* 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 |
1614 | * everything is allowed except what we match |
1618 | * everything is allowed except what we match |
1615 | */ |
1619 | */ |