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.50 by root, Thu Apr 19 16:23:46 2007 UTC vs.
Revision 1.79 by root, Tue Jul 29 02:00:55 2008 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 * Deliantra 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 <support@deliantra.net>
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
… …
33 32
34//#define TREASURE_VERBOSE 33//#define TREASURE_VERBOSE
35 34
36#include <global.h> 35#include <global.h>
37#include <treasure.h> 36#include <treasure.h>
38#include <funcpoint.h>
39#include <loader.h> 37#include <loader.h>
40 38
41extern char *spell_mapping[]; 39extern char *spell_mapping[];
42 40
43static treasurelist *first_treasurelist; 41static treasurelist *first_treasurelist;
… …
47typedef std::tr1::unordered_map< 45typedef std::tr1::unordered_map<
48 const char *, 46 const char *,
49 treasurelist *, 47 treasurelist *,
50 str_hash, 48 str_hash,
51 str_equal, 49 str_equal,
52 slice_allocator< std::pair<const char *const, treasurelist *> >, 50 slice_allocator< std::pair<const char *const, treasurelist *> >
53 true
54> tl_map_t; 51> tl_map_t;
55 52
56static tl_map_t tl_map; 53static tl_map_t tl_map;
57 54
58/* 55/*
… …
140 137
141 f.next (); 138 f.next ();
142 139
143 for (;;) 140 for (;;)
144 { 141 {
145 coroapi::cede_to_tick_every (10); 142 coroapi::cede_to_tick ();
146 143
147 switch (f.kw) 144 switch (f.kw)
148 { 145 {
149 case KW_arch: 146 case KW_arch:
150 t->item = archetype::get (f.get_str ()); 147 t->item = archetype::find (f.get_str ());
148
149 if (!t->item)
150 {
151 f.parse_warn ("treasure references unknown archetype");
152 t->item = archetype::empty;
153 }
154
151 break; 155 break;
152 156
153 case KW_list: f.get (t->name); break; 157 case KW_list: f.get (t->name); break;
154 case KW_change_name: f.get (t->change_arch.name); break; 158 case KW_change_name: f.get (t->change_arch.name); break;
155 case KW_change_title: f.get (t->change_arch.title); break; 159 case KW_change_title: f.get (t->change_arch.title); break;
… …
169 t->next = read_treasure (f); 173 t->next = read_treasure (f);
170 return t; 174 return t;
171 175
172 default: 176 default:
173 if (!f.parse_error ("treasurelist", t->name)) 177 if (!f.parse_error ("treasurelist", t->name))
174 return 0; 178 goto error;
175 179
176 return t; 180 return t;
177 } 181 }
178 182
179 f.next (); 183 f.next ();
180 } 184 }
185
186 // not reached
187
188error:
189 delete t;
190 return 0;
181} 191}
182 192
183/* 193/*
184 * Each treasure is parsed with the help of load_treasure(). 194 * Each treasure is parsed with the help of load_treasure().
185 */ 195 */
… …
197 207
198 /* This is a one of the many items on the list should be generated. 208 /* 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 209 * Add up the chance total, and check to make sure the yes & no
200 * fields of the treasures are not being used. 210 * fields of the treasures are not being used.
201 */ 211 */
202 tl->total_chance = 0;
203
204 if (one) 212 if (one)
205 { 213 {
206 for (treasure *t = tl->items; t; t = t->next) 214 for (treasure *t = tl->items; t; t = t->next)
207 { 215 {
208 if (t->next_yes || t->next_no) 216 if (t->next_yes || t->next_no)
209 { 217 {
210 LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); 218 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"); 219 LOG (llevError, " the next_yes or next_no field is set\n");
212 } 220 }
213 221
214 tl->total_chance += t->chance; 222 tl->total_chance += t->chance;
215 } 223 }
… …
230 * start with equipment, but only their abilities). 238 * start with equipment, but only their abilities).
231 */ 239 */
232static void 240static void
233put_treasure (object *op, object *creator, int flags) 241put_treasure (object *op, object *creator, int flags)
234{ 242{
235 object *tmp; 243 if (flags & GT_ENVIRONMENT)
236 244 {
237 /* Bit of a hack - spells should never be put onto the map. The entire 245 /* Bit of a hack - spells should never be put onto the map. The entire
238 * treasure stuff is a problem - there is no clear idea of knowing 246 * treasure stuff is a problem - there is no clear idea of knowing
239 * this is the original object, or if this is an object that should be created 247 * this is the original object, or if this is an object that should be created
240 * by another object. 248 * by another object.
241 */ 249 */
242 if (flags & GT_ENVIRONMENT && op->type != SPELL) 250 //TODO: flag such as objects... as such (no drop, anybody?)
243 { 251 if (op->type == SPELL)
252 {
253 op->destroy ();
254 return;
255 }
256
257 op->expand_tail ();
258
259 if (!creator->is_on_map () || op->blocked (creator->map, creator->x, creator->y))
260 op->destroy ();
261 else
262 {
244 SET_FLAG (op, FLAG_OBJ_ORIGINAL); 263 SET_FLAG (op, FLAG_OBJ_ORIGINAL);
245 op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); 264 op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);
265 }
246 } 266 }
247 else 267 else
248 { 268 {
249 op = creator->insert (op); 269 op = creator->insert (op);
250 270
251 if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER)) 271 if ((flags & GT_APPLY) && QUERY_FLAG (creator, FLAG_MONSTER))
252 monster_check_apply (creator, op); 272 monster_check_apply (creator, op);
253
254 if ((flags & GT_UPDATE_INV) && (tmp = creator->in_player ()))
255 esrv_send_item (tmp, op);
256 } 273 }
257} 274}
258 275
259/* if there are change_xxx commands in the treasure, we include the changes 276/* if there are change_xxx commands in the treasure, we include the changes
260 * in the generated object 277 * in the generated object
… …
289 else 306 else
290 LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name); 307 LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
291 } 308 }
292 else 309 else
293 { 310 {
294 if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) 311 if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE)))
295 { 312 {
296 object *tmp = arch_to_object (t->item); 313 object *tmp = arch_to_object (t->item);
297 314
298 if (t->nrof && tmp->nrof <= 1) 315 if (t->nrof && tmp->nrof <= 1)
299 tmp->nrof = rndm (t->nrof) + 1; 316 tmp->nrof = rndm (t->nrof) + 1;
… …
346 create_treasure (tl, op, flag, difficulty, tries); 363 create_treasure (tl, op, flag, difficulty, tries);
347 } 364 }
348 else if (t->nrof) 365 else if (t->nrof)
349 create_one_treasure (tl, op, flag, difficulty, tries); 366 create_one_treasure (tl, op, flag, difficulty, tries);
350 } 367 }
351 else if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE)) 368 else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE))
352 { 369 {
353 if (object *tmp = arch_to_object (t->item)) 370 if (object *tmp = arch_to_object (t->item))
354 { 371 {
355 if (t->nrof && tmp->nrof <= 1) 372 if (t->nrof && tmp->nrof <= 1)
356 tmp->nrof = rndm (t->nrof) + 1; 373 tmp->nrof = rndm (t->nrof) + 1;
… …
358 fix_generated_item (tmp, op, difficulty, t->magic, flag); 375 fix_generated_item (tmp, op, difficulty, t->magic, flag);
359 change_treasure (t, tmp); 376 change_treasure (t, tmp);
360 put_treasure (tmp, op, flag); 377 put_treasure (tmp, op, flag);
361 } 378 }
362 } 379 }
380}
381
382void
383object::create_treasure (treasurelist *tl, int flags)
384{
385 ::create_treasure (tl, this, flags, map ? map->difficulty : 0);
363} 386}
364 387
365/* This calls the appropriate treasure creation function. tries is passed 388/* This calls the appropriate treasure creation function. tries is passed
366 * to determine how many list transitions or attempts to create treasure 389 * to determine how many list transitions or attempts to create treasure
367 * have been made. It is really in place to prevent infinite loops with 390 * have been made. It is really in place to prevent infinite loops with
… …
378 401
379 if (tries++ > 100) 402 if (tries++ > 100)
380 { 403 {
381 LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); 404 LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
382 return; 405 return;
406 }
407
408 if (op->flag [FLAG_TREASURE_ENV])
409 {
410 // do not generate items when there already is something above the object
411 if (op->flag [FLAG_IS_FLOOR] && op->above)
412 return;
413
414 flag |= GT_ENVIRONMENT;
383 } 415 }
384 416
385 if (tl->total_chance) 417 if (tl->total_chance)
386 create_one_treasure (tl, op, flag, difficulty, tries); 418 create_one_treasure (tl, op, flag, difficulty, tries);
387 else 419 else
… …
464 * Removed multiplicator, too many high-level items were generated on low-difficulty maps. 496 * Removed multiplicator, too many high-level items were generated on low-difficulty maps.
465 */ 497 */
466int 498int
467level_for_item (const object *op, int difficulty) 499level_for_item (const object *op, int difficulty)
468{ 500{
469 int olevel = 0;
470
471 if (!op->inv) 501 if (!op->inv)
472 { 502 {
473 LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name); 503 LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);
474 return 0; 504 return 0;
475 } 505 }
476 506
477 olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2)); 507 int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.));
478 508
479 if (olevel <= 0) 509 if (olevel <= 0)
480 olevel = rndm (1, MIN (op->inv->level, 1)); 510 olevel = rndm (1, op->inv->level);
481 511
482 if (olevel > MAXLEVEL) 512 return min (olevel, MAXLEVEL);
483 olevel = MAXLEVEL;
484
485 return olevel;
486} 513}
487 514
488/* 515/*
489 * Based upon the specified difficulty and upon the difftomagic_list array, 516 * Based upon the specified difficulty and upon the difftomagic_list array,
490 * a random magical bonus is returned. This is used when determine 517 * a random magical bonus is returned. This is used when determine
… …
546 573
547 op->magic = magic; 574 op->magic = magic;
548 if (op->arch) 575 if (op->arch)
549 { 576 {
550 if (op->type == ARMOUR) 577 if (op->type == ARMOUR)
551 ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100; 578 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
552 579
553 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ 580 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
554 magic = (-magic); 581 magic = (-magic);
582
555 op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100; 583 op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
556 } 584 }
557 else 585 else
558 { 586 {
559 if (op->type == ARMOUR) 587 if (op->type == ARMOUR)
560 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; 588 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
589
561 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ 590 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
562 magic = (-magic); 591 magic = (-magic);
592
563 op->weight = (op->weight * (100 - magic * 10)) / 100; 593 op->weight = (op->weight * (100 - magic * 10)) / 100;
564 } 594 }
565} 595}
566 596
567/* 597/*
… …
622 case 2: 652 case 2:
623 case 3: 653 case 3:
624 case 4: 654 case 4:
625 case 5: 655 case 5:
626 case 6: 656 case 6:
627 set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r))); 657 op->stats.stat (r) += bonus;
628 break; 658 break;
629 659
630 case 7: 660 case 7:
631 op->stats.dam += bonus; 661 op->stats.dam += bonus;
632 break; 662 break;
… …
796 ARG_INT (flags))) 826 ARG_INT (flags)))
797 return; 827 return;
798 828
799 if (!(flags & GT_MINIMAL)) 829 if (!(flags & GT_MINIMAL))
800 { 830 {
801 if (op->arch == crown_arch) 831 if (IS_ARCH (op->arch, crown))
802 { 832 {
803 set_magic (difficulty, op, max_magic, flags); 833 set_magic (difficulty, op, max_magic, flags);
804 num_enchantments = calc_item_power (op, 1); 834 num_enchantments = calc_item_power (op, 1);
805 generate_artifact (op, difficulty); 835 generate_artifact (op, difficulty);
806 } 836 }
… …
811 841
812 num_enchantments = calc_item_power (op, 1); 842 num_enchantments = calc_item_power (op, 1);
813 843
814 if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT)) 844 if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
815 || op->type == HORN 845 || op->type == HORN
816 || difficulty >= settings.max_level) /* high difficulties always generate an artifact, 846 || difficulty >= settings.max_level) /* high difficulties always generate an artifact, used for shop_floors or treasures */
817 * used for shop_floors or treasures */
818 generate_artifact (op, difficulty); 847 generate_artifact (op, difficulty);
819 } 848 }
820 849
821 /* Object was made an artifact. Calculate its item_power rating. 850 /* Object was made an artifact. Calculate its item_power rating.
822 * the item_power in the object is what the artfiact adds. 851 * the item_power in the object is what the artfiact adds.
… …
864 { 893 {
865 if (op->type == POTION) 894 if (op->type == POTION)
866 /* Handle healing and magic power potions */ 895 /* Handle healing and magic power potions */
867 if (op->stats.sp && !op->randomitems) 896 if (op->stats.sp && !op->randomitems)
868 { 897 {
869 object *tmp;
870
871 tmp = get_archetype (spell_mapping[op->stats.sp]); 898 object *tmp = get_archetype (spell_mapping [op->stats.sp]);
872 insert_ob_in_ob (tmp, op); 899 insert_ob_in_ob (tmp, op);
873 op->stats.sp = 0; 900 op->stats.sp = 0;
874 } 901 }
875 } 902 }
876 else if (!op->title) /* Only modify object if not special */ 903 else if (!op->title) /* Only modify object if not special */
… …
934 SET_FLAG (op, FLAG_CURSED); 961 SET_FLAG (op, FLAG_CURSED);
935 break; 962 break;
936 } 963 }
937 964
938 case AMULET: 965 case AMULET:
939 if (op->arch == amulet_arch) 966 if (IS_ARCH (op->arch, amulet))
940 op->value *= 5; /* Since it's not just decoration */ 967 op->value *= 5; /* Since it's not just decoration */
941 968
942 case RING: 969 case RING:
943 if (op->arch == NULL) 970 if (!op->arch) // wtf? schmorp
944 { 971 {
945 op->destroy (); 972 op->destroy ();
946 op = 0; 973 op = 0;
947 break; 974 break;
948 } 975 }
949 976
950 if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */ 977 if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */
951 break; 978 break;
952 979
953 if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) 980 if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
954 SET_FLAG (op, FLAG_CURSED); 981 SET_FLAG (op, FLAG_CURSED);
955 982
… …
1108 * Allocate and return the pointer to an empty artifactlist structure. 1135 * Allocate and return the pointer to an empty artifactlist structure.
1109 */ 1136 */
1110static artifactlist * 1137static artifactlist *
1111get_empty_artifactlist (void) 1138get_empty_artifactlist (void)
1112{ 1139{
1113 return salloc0 <artifactlist> (); 1140 return salloc0<artifactlist> ();
1114} 1141}
1115 1142
1116/* 1143/*
1117 * Allocate and return the pointer to an empty artifact structure. 1144 * Allocate and return the pointer to an empty artifact structure.
1118 */ 1145 */
1119static artifact * 1146static artifact *
1120get_empty_artifact (void) 1147get_empty_artifact (void)
1121{ 1148{
1122 return salloc0 <artifact> (); 1149 return salloc0<artifact> ();
1123} 1150}
1124 1151
1125/* 1152/*
1126 * Searches the artifact lists and returns one that has the same type 1153 * Searches the artifact lists and returns one that has the same type
1127 * of objects on it. 1154 * of objects on it.
… …
1132 for (artifactlist *al = first_artifactlist; al; al = al->next) 1159 for (artifactlist *al = first_artifactlist; al; al = al->next)
1133 if (al->type == type) 1160 if (al->type == type)
1134 return al; 1161 return al;
1135 1162
1136 return 0; 1163 return 0;
1137}
1138
1139/*
1140 * For debugging purposes. Dumps all tables.
1141 */
1142void
1143dump_artifacts (void)
1144{
1145 artifactlist *al;
1146 artifact *art;
1147 linked_char *next;
1148
1149 fprintf (logfile, "\n");
1150 for (al = first_artifactlist; al != NULL; al = al->next)
1151 {
1152 fprintf (logfile, "Artifact has type %d, total_chance=%d\n", al->type, al->total_chance);
1153 for (art = al->items; art != NULL; art = art->next)
1154 {
1155 fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1156 if (art->allowed != NULL)
1157 {
1158 fprintf (logfile, "\tallowed combinations:");
1159 for (next = art->allowed; next != NULL; next = next->next)
1160 fprintf (logfile, "%s,", &next->name);
1161 fprintf (logfile, "\n");
1162 }
1163 }
1164 }
1165 fprintf (logfile, "\n");
1166}
1167
1168/*
1169 * For debugging purposes. Dumps all treasures recursively (see below).
1170 */
1171void
1172dump_monster_treasure_rec (const char *name, treasure *t, int depth)
1173{
1174 treasurelist *tl;
1175 int i;
1176
1177 if (depth > 100)
1178 return;
1179
1180 while (t)
1181 {
1182 if (t->name)
1183 {
1184 for (i = 0; i < depth; i++)
1185 fprintf (logfile, " ");
1186
1187 fprintf (logfile, "{ (list: %s)\n", &t->name);
1188
1189 tl = treasurelist::find (t->name);
1190 if (tl)
1191 dump_monster_treasure_rec (name, tl->items, depth + 2);
1192
1193 for (i = 0; i < depth; i++)
1194 fprintf (logfile, " ");
1195
1196 fprintf (logfile, "} (end of list: %s)\n", &t->name);
1197 }
1198 else
1199 {
1200 for (i = 0; i < depth; i++)
1201 fprintf (logfile, " ");
1202
1203 if (t->item && t->item->clone.type == FLESH)
1204 fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1205 else
1206 fprintf (logfile, "%s\n", &t->item->clone.name);
1207 }
1208
1209 if (t->next_yes)
1210 {
1211 for (i = 0; i < depth; i++)
1212 fprintf (logfile, " ");
1213
1214 fprintf (logfile, " (if yes)\n");
1215 dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1216 }
1217
1218 if (t->next_no)
1219 {
1220 for (i = 0; i < depth; i++)
1221 fprintf (logfile, " ");
1222
1223 fprintf (logfile, " (if no)\n");
1224 dump_monster_treasure_rec (name, t->next_no, depth + 1);
1225 }
1226
1227 t = t->next;
1228 }
1229}
1230
1231/*
1232 * For debugging purposes. Dumps all treasures for a given monster.
1233 * Created originally by Raphael Quinet for debugging the alchemy code.
1234 */
1235void
1236dump_monster_treasure (const char *name)
1237{
1238 archetype *at;
1239 int found;
1240
1241 found = 0;
1242 fprintf (logfile, "\n");
1243
1244 for (at = first_archetype; at != NULL; at = at->next)
1245 if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1246 {
1247 fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1248 if (at->clone.randomitems != NULL)
1249 dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1250 else
1251 fprintf (logfile, "(nothing)\n");
1252
1253 fprintf (logfile, "\n");
1254 found++;
1255 }
1256
1257 if (found == 0)
1258 fprintf (logfile, "No objects have the name %s!\n\n", name);
1259} 1164}
1260 1165
1261/* 1166/*
1262 * Builds up the lists of artifacts from the file in the libdir. 1167 * Builds up the lists of artifacts from the file in the libdir.
1263 */ 1168 */
… …
1277 sprintf (filename, "%s/artifacts", settings.datadir); 1182 sprintf (filename, "%s/artifacts", settings.datadir);
1278 object_thawer f (filename); 1183 object_thawer f (filename);
1279 1184
1280 if (!f) 1185 if (!f)
1281 return; 1186 return;
1282
1283 f.next ();
1284 1187
1285 for (;;) 1188 for (;;)
1286 { 1189 {
1287 switch (f.kw) 1190 switch (f.kw)
1288 { 1191 {
… …
1392#endif 1295#endif
1393 op->face = change->face; 1296 op->face = change->face;
1394 } 1297 }
1395 1298
1396 for (i = 0; i < NUM_STATS; i++) 1299 for (i = 0; i < NUM_STATS; i++)
1397 change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i)); 1300 change_attr_value (&(op->stats), i, change->stats.stat (i));
1398 1301
1399 op->attacktype |= change->attacktype; 1302 op->attacktype |= change->attacktype;
1400 op->path_attuned |= change->path_attuned; 1303 op->path_attuned |= change->path_attuned;
1401 op->path_repelled |= change->path_repelled; 1304 op->path_repelled |= change->path_repelled;
1402 op->path_denied |= change->path_denied; 1305 op->path_denied |= change->path_denied;
… …
1566 if (change->msg) 1469 if (change->msg)
1567 op->msg = change->msg; 1470 op->msg = change->msg;
1568} 1471}
1569 1472
1570static int 1473static int
1571legal_artifact_combination (object *op, artifact * art) 1474legal_artifact_combination (object *op, artifact *art)
1572{ 1475{
1573 int neg, success = 0; 1476 int neg, success = 0;
1574 linked_char *tmp; 1477 linked_char *tmp;
1575 const char *name; 1478 const char *name;
1576 1479
1577 if (art->allowed == (linked_char *) NULL) 1480 if (!art->allowed)
1578 return 1; /* Ie, "all" */ 1481 return 1; /* Ie, "all" */
1482
1579 for (tmp = art->allowed; tmp; tmp = tmp->next) 1483 for (tmp = art->allowed; tmp; tmp = tmp->next)
1580 { 1484 {
1581#ifdef TREASURE_VERBOSE 1485#ifdef TREASURE_VERBOSE
1582 LOG (llevDebug, "legal_art: %s\n", &tmp->name); 1486 LOG (llevDebug, "legal_art: %s\n", &tmp->name);
1583#endif 1487#endif
… …
1585 name = tmp->name + 1, neg = 1; 1489 name = tmp->name + 1, neg = 1;
1586 else 1490 else
1587 name = tmp->name, neg = 0; 1491 name = tmp->name, neg = 0;
1588 1492
1589 /* If we match name, then return the opposite of 'neg' */ 1493 /* If we match name, then return the opposite of 'neg' */
1590 if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->name))) 1494 if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname)))
1591 return !neg; 1495 return !neg;
1592 1496
1593 /* Set success as true, since if the match was an inverse, it means 1497 /* Set success as true, since if the match was an inverse, it means
1594 * everything is allowed except what we match 1498 * everything is allowed except what we match
1595 */ 1499 */
1596 else if (neg) 1500 else if (neg)
1597 success = 1; 1501 success = 1;
1598 } 1502 }
1503
1599 return success; 1504 return success;
1600} 1505}
1601 1506
1602/* 1507/*
1603 * Fixes the given object, giving it the abilities and titles 1508 * Fixes the given object, giving it the abilities and titles

Diff Legend

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