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.53 by root, Sat Apr 21 16:56:30 2007 UTC vs.
Revision 1.73 by root, Sun Apr 20 05:24: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
… …
140 139
141 f.next (); 140 f.next ();
142 141
143 for (;;) 142 for (;;)
144 { 143 {
145 coroapi::cede_to_tick_every (10); 144 coroapi::cede_to_tick ();
146 145
147 switch (f.kw) 146 switch (f.kw)
148 { 147 {
149 case KW_arch: 148 case KW_arch:
150 t->item = archetype::get (f.get_str ()); 149 t->item = archetype::find (f.get_str ());
150
151 if (!t->item)
152 {
153 f.parse_warn ("treasure references unknown archetype");
154 t->item = archetype::empty;
155 }
156
151 break; 157 break;
152 158
153 case KW_list: f.get (t->name); break; 159 case KW_list: f.get (t->name); break;
154 case KW_change_name: f.get (t->change_arch.name); break; 160 case KW_change_name: f.get (t->change_arch.name); break;
155 case KW_change_title: f.get (t->change_arch.title); break; 161 case KW_change_title: f.get (t->change_arch.title); break;
… …
169 t->next = read_treasure (f); 175 t->next = read_treasure (f);
170 return t; 176 return t;
171 177
172 default: 178 default:
173 if (!f.parse_error ("treasurelist", t->name)) 179 if (!f.parse_error ("treasurelist", t->name))
174 return 0; 180 goto error;
175 181
176 return t; 182 return t;
177 } 183 }
178 184
179 f.next (); 185 f.next ();
180 } 186 }
187
188 // not reached
189
190error:
191 delete t;
192 return 0;
181} 193}
182 194
183/* 195/*
184 * Each treasure is parsed with the help of load_treasure(). 196 * Each treasure is parsed with the help of load_treasure().
185 */ 197 */
… …
197 209
198 /* This is a one of the many items on the list should be generated. 210 /* 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 211 * Add up the chance total, and check to make sure the yes & no
200 * fields of the treasures are not being used. 212 * fields of the treasures are not being used.
201 */ 213 */
202 tl->total_chance = 0;
203
204 if (one) 214 if (one)
205 { 215 {
206 for (treasure *t = tl->items; t; t = t->next) 216 for (treasure *t = tl->items; t; t = t->next)
207 { 217 {
208 if (t->next_yes || t->next_no) 218 if (t->next_yes || t->next_no)
209 { 219 {
210 LOG (llevError, "Treasure %s is one item, but on treasure %s\n", &tl->name, t->item ? &t->item->name : &t->name); 220 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"); 221 LOG (llevError, " the next_yes or next_no field is set\n");
212 } 222 }
213 223
214 tl->total_chance += t->chance; 224 tl->total_chance += t->chance;
215 } 225 }
… …
230 * start with equipment, but only their abilities). 240 * start with equipment, but only their abilities).
231 */ 241 */
232static void 242static void
233put_treasure (object *op, object *creator, int flags) 243put_treasure (object *op, object *creator, int flags)
234{ 244{
245 if (flags & GT_ENVIRONMENT)
246 {
235 /* Bit of a hack - spells should never be put onto the map. The entire 247 /* Bit of a hack - spells should never be put onto the map. The entire
236 * treasure stuff is a problem - there is no clear idea of knowing 248 * treasure stuff is a problem - there is no clear idea of knowing
237 * this is the original object, or if this is an object that should be created 249 * this is the original object, or if this is an object that should be created
238 * by another object. 250 * by another object.
239 */ 251 */
240 if (flags & GT_ENVIRONMENT && op->type != SPELL) 252 //TODO: flag such as objects... as such (no drop, anybody?)
241 { 253 if (op->type == SPELL)
242 op->deactivate_recursive (); 254 {
255 op->destroy ();
256 return;
257 }
258
243 op->expand_tail (); 259 op->expand_tail ();
244 260
245 if (ob_blocked (op, creator->map, creator->x, creator->y)) 261 if (op->blocked (creator->map, creator->x, creator->y))
246 op->destroy (); 262 op->destroy ();
247 else 263 else
248 { 264 {
249 SET_FLAG (op, FLAG_OBJ_ORIGINAL); 265 SET_FLAG (op, FLAG_OBJ_ORIGINAL);
250 op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON); 266 op->insert_at (creator, creator, INS_NO_MERGE | INS_NO_WALK_ON);
… …
296 else 312 else
297 LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name); 313 LOG (llevError, "create_all_treasures: undefined reference to treasurelist '%s'.\n", &t->name);
298 } 314 }
299 else 315 else
300 { 316 {
301 if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) 317 if (t->item && (t->item->invisible != 0 || !(flag & GT_INVISIBLE)))
302 { 318 {
303 object *tmp = arch_to_object (t->item); 319 object *tmp = arch_to_object (t->item);
304 320
305 if (t->nrof && tmp->nrof <= 1) 321 if (t->nrof && tmp->nrof <= 1)
306 tmp->nrof = rndm (t->nrof) + 1; 322 tmp->nrof = rndm (t->nrof) + 1;
… …
353 create_treasure (tl, op, flag, difficulty, tries); 369 create_treasure (tl, op, flag, difficulty, tries);
354 } 370 }
355 else if (t->nrof) 371 else if (t->nrof)
356 create_one_treasure (tl, op, flag, difficulty, tries); 372 create_one_treasure (tl, op, flag, difficulty, tries);
357 } 373 }
358 else if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE)) 374 else if (t->item && (t->item->invisible != 0 || flag != GT_INVISIBLE))
359 { 375 {
360 if (object *tmp = arch_to_object (t->item)) 376 if (object *tmp = arch_to_object (t->item))
361 { 377 {
362 if (t->nrof && tmp->nrof <= 1) 378 if (t->nrof && tmp->nrof <= 1)
363 tmp->nrof = rndm (t->nrof) + 1; 379 tmp->nrof = rndm (t->nrof) + 1;
… …
365 fix_generated_item (tmp, op, difficulty, t->magic, flag); 381 fix_generated_item (tmp, op, difficulty, t->magic, flag);
366 change_treasure (t, tmp); 382 change_treasure (t, tmp);
367 put_treasure (tmp, op, flag); 383 put_treasure (tmp, op, flag);
368 } 384 }
369 } 385 }
386}
387
388void
389object::create_treasure (treasurelist *tl, int flags)
390{
391 ::create_treasure (tl, this, flags, map ? map->difficulty : 0);
370} 392}
371 393
372/* This calls the appropriate treasure creation function. tries is passed 394/* This calls the appropriate treasure creation function. tries is passed
373 * to determine how many list transitions or attempts to create treasure 395 * to determine how many list transitions or attempts to create treasure
374 * have been made. It is really in place to prevent infinite loops with 396 * have been made. It is really in place to prevent infinite loops with
… …
385 407
386 if (tries++ > 100) 408 if (tries++ > 100)
387 { 409 {
388 LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); 410 LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n");
389 return; 411 return;
412 }
413
414 if (op->flag [FLAG_TREASURE_ENV])
415 {
416 // do not generate items when there already is something above the object
417 if (op->flag [FLAG_IS_FLOOR] && op->above)
418 return;
419
420 flag |= GT_ENVIRONMENT;
390 } 421 }
391 422
392 if (tl->total_chance) 423 if (tl->total_chance)
393 create_one_treasure (tl, op, flag, difficulty, tries); 424 create_one_treasure (tl, op, flag, difficulty, tries);
394 else 425 else
… …
471 * Removed multiplicator, too many high-level items were generated on low-difficulty maps. 502 * Removed multiplicator, too many high-level items were generated on low-difficulty maps.
472 */ 503 */
473int 504int
474level_for_item (const object *op, int difficulty) 505level_for_item (const object *op, int difficulty)
475{ 506{
476 int olevel = 0;
477
478 if (!op->inv) 507 if (!op->inv)
479 { 508 {
480 LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name); 509 LOG (llevError, "level_for_item: Object %s has no inventory!\n", &op->name);
481 return 0; 510 return 0;
482 } 511 }
483 512
484 olevel = (int) (op->inv->level + (double) difficulty * (1 - drand48 () * drand48 () * 2)); 513 int olevel = op->inv->level + int (difficulty * (1. - rndm () * rndm () * 2.));
485 514
486 if (olevel <= 0) 515 if (olevel <= 0)
487 olevel = rndm (1, MIN (op->inv->level, 1)); 516 olevel = rndm (1, op->inv->level);
488 517
489 if (olevel > MAXLEVEL) 518 return min (olevel, MAXLEVEL);
490 olevel = MAXLEVEL;
491
492 return olevel;
493} 519}
494 520
495/* 521/*
496 * Based upon the specified difficulty and upon the difftomagic_list array, 522 * Based upon the specified difficulty and upon the difftomagic_list array,
497 * a random magical bonus is returned. This is used when determine 523 * a random magical bonus is returned. This is used when determine
… …
553 579
554 op->magic = magic; 580 op->magic = magic;
555 if (op->arch) 581 if (op->arch)
556 { 582 {
557 if (op->type == ARMOUR) 583 if (op->type == ARMOUR)
558 ARMOUR_SPEED (op) = (ARMOUR_SPEED (&op->arch->clone) * (100 + magic * 10)) / 100; 584 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op->arch) * (100 + magic * 10)) / 100;
559 585
560 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */ 586 if (magic < 0 && !(rndm (3))) /* You can't just check the weight always */
561 magic = (-magic); 587 magic = (-magic);
562 op->weight = (op->arch->clone.weight * (100 - magic * 10)) / 100; 588 op->weight = (op->arch->weight * (100 - magic * 10)) / 100;
563 } 589 }
564 else 590 else
565 { 591 {
566 if (op->type == ARMOUR) 592 if (op->type == ARMOUR)
567 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100; 593 ARMOUR_SPEED (op) = (ARMOUR_SPEED (op) * (100 + magic * 10)) / 100;
… …
629 case 2: 655 case 2:
630 case 3: 656 case 3:
631 case 4: 657 case 4:
632 case 5: 658 case 5:
633 case 6: 659 case 6:
634 set_attr_value (&op->stats, r, (signed char) (bonus + get_attr_value (&op->stats, r))); 660 op->stats.stat (r) += bonus;
635 break; 661 break;
636 662
637 case 7: 663 case 7:
638 op->stats.dam += bonus; 664 op->stats.dam += bonus;
639 break; 665 break;
… …
803 ARG_INT (flags))) 829 ARG_INT (flags)))
804 return; 830 return;
805 831
806 if (!(flags & GT_MINIMAL)) 832 if (!(flags & GT_MINIMAL))
807 { 833 {
808 if (op->arch == crown_arch) 834 if (IS_ARCH (op->arch, crown))
809 { 835 {
810 set_magic (difficulty, op, max_magic, flags); 836 set_magic (difficulty, op, max_magic, flags);
811 num_enchantments = calc_item_power (op, 1); 837 num_enchantments = calc_item_power (op, 1);
812 generate_artifact (op, difficulty); 838 generate_artifact (op, difficulty);
813 } 839 }
… …
818 844
819 num_enchantments = calc_item_power (op, 1); 845 num_enchantments = calc_item_power (op, 1);
820 846
821 if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT)) 847 if ((!was_magic && !rndm (CHANCE_FOR_ARTIFACT))
822 || op->type == HORN 848 || op->type == HORN
823 || difficulty >= settings.max_level) /* high difficulties always generate an artifact, 849 || difficulty >= settings.max_level) /* high difficulties always generate an artifact, used for shop_floors or treasures */
824 * used for shop_floors or treasures */
825 generate_artifact (op, difficulty); 850 generate_artifact (op, difficulty);
826 } 851 }
827 852
828 /* Object was made an artifact. Calculate its item_power rating. 853 /* Object was made an artifact. Calculate its item_power rating.
829 * the item_power in the object is what the artfiact adds. 854 * the item_power in the object is what the artfiact adds.
… …
871 { 896 {
872 if (op->type == POTION) 897 if (op->type == POTION)
873 /* Handle healing and magic power potions */ 898 /* Handle healing and magic power potions */
874 if (op->stats.sp && !op->randomitems) 899 if (op->stats.sp && !op->randomitems)
875 { 900 {
876 object *tmp;
877
878 tmp = get_archetype (spell_mapping[op->stats.sp]); 901 object *tmp = get_archetype (spell_mapping [op->stats.sp]);
879 insert_ob_in_ob (tmp, op); 902 insert_ob_in_ob (tmp, op);
880 op->stats.sp = 0; 903 op->stats.sp = 0;
881 } 904 }
882 } 905 }
883 else if (!op->title) /* Only modify object if not special */ 906 else if (!op->title) /* Only modify object if not special */
… …
941 SET_FLAG (op, FLAG_CURSED); 964 SET_FLAG (op, FLAG_CURSED);
942 break; 965 break;
943 } 966 }
944 967
945 case AMULET: 968 case AMULET:
946 if (op->arch == amulet_arch) 969 if (IS_ARCH (op->arch, amulet))
947 op->value *= 5; /* Since it's not just decoration */ 970 op->value *= 5; /* Since it's not just decoration */
948 971
949 case RING: 972 case RING:
950 if (op->arch == NULL) 973 if (!op->arch) // wtf? schmorp
951 { 974 {
952 op->destroy (); 975 op->destroy ();
953 op = 0; 976 op = 0;
954 break; 977 break;
955 } 978 }
956 979
957 if (op->arch != ring_arch && op->arch != amulet_arch) /* It's a special artifact! */ 980 if (!IS_ARCH (op->arch, ring) && !IS_ARCH (op->arch, amulet)) /* It's a special artifact! */
958 break; 981 break;
959 982
960 if (!(flags & GT_ONLY_GOOD) && !(rndm (3))) 983 if (!(flags & GT_ONLY_GOOD) && !(rndm (3)))
961 SET_FLAG (op, FLAG_CURSED); 984 SET_FLAG (op, FLAG_CURSED);
962 985
… …
1115 * Allocate and return the pointer to an empty artifactlist structure. 1138 * Allocate and return the pointer to an empty artifactlist structure.
1116 */ 1139 */
1117static artifactlist * 1140static artifactlist *
1118get_empty_artifactlist (void) 1141get_empty_artifactlist (void)
1119{ 1142{
1120 return salloc0 <artifactlist> (); 1143 return salloc0<artifactlist> ();
1121} 1144}
1122 1145
1123/* 1146/*
1124 * Allocate and return the pointer to an empty artifact structure. 1147 * Allocate and return the pointer to an empty artifact structure.
1125 */ 1148 */
1126static artifact * 1149static artifact *
1127get_empty_artifact (void) 1150get_empty_artifact (void)
1128{ 1151{
1129 return salloc0 <artifact> (); 1152 return salloc0<artifact> ();
1130} 1153}
1131 1154
1132/* 1155/*
1133 * Searches the artifact lists and returns one that has the same type 1156 * Searches the artifact lists and returns one that has the same type
1134 * of objects on it. 1157 * of objects on it.
… …
1139 for (artifactlist *al = first_artifactlist; al; al = al->next) 1162 for (artifactlist *al = first_artifactlist; al; al = al->next)
1140 if (al->type == type) 1163 if (al->type == type)
1141 return al; 1164 return al;
1142 1165
1143 return 0; 1166 return 0;
1144}
1145
1146/*
1147 * For debugging purposes. Dumps all tables.
1148 */
1149void
1150dump_artifacts (void)
1151{
1152 artifactlist *al;
1153 artifact *art;
1154 linked_char *next;
1155
1156 fprintf (logfile, "\n");
1157 for (al = first_artifactlist; al != NULL; al = al->next)
1158 {
1159 fprintf (logfile, "Artifact has type %d, total_chance=%d\n", al->type, al->total_chance);
1160 for (art = al->items; art != NULL; art = art->next)
1161 {
1162 fprintf (logfile, "Artifact %-30s Difficulty %3d Chance %5d\n", &art->item->name, art->difficulty, art->chance);
1163 if (art->allowed != NULL)
1164 {
1165 fprintf (logfile, "\tallowed combinations:");
1166 for (next = art->allowed; next != NULL; next = next->next)
1167 fprintf (logfile, "%s,", &next->name);
1168 fprintf (logfile, "\n");
1169 }
1170 }
1171 }
1172 fprintf (logfile, "\n");
1173}
1174
1175/*
1176 * For debugging purposes. Dumps all treasures recursively (see below).
1177 */
1178void
1179dump_monster_treasure_rec (const char *name, treasure *t, int depth)
1180{
1181 treasurelist *tl;
1182 int i;
1183
1184 if (depth > 100)
1185 return;
1186
1187 while (t)
1188 {
1189 if (t->name)
1190 {
1191 for (i = 0; i < depth; i++)
1192 fprintf (logfile, " ");
1193
1194 fprintf (logfile, "{ (list: %s)\n", &t->name);
1195
1196 tl = treasurelist::find (t->name);
1197 if (tl)
1198 dump_monster_treasure_rec (name, tl->items, depth + 2);
1199
1200 for (i = 0; i < depth; i++)
1201 fprintf (logfile, " ");
1202
1203 fprintf (logfile, "} (end of list: %s)\n", &t->name);
1204 }
1205 else
1206 {
1207 for (i = 0; i < depth; i++)
1208 fprintf (logfile, " ");
1209
1210 if (t->item && t->item->clone.type == FLESH)
1211 fprintf (logfile, "%s's %s\n", name, &t->item->clone.name);
1212 else
1213 fprintf (logfile, "%s\n", &t->item->clone.name);
1214 }
1215
1216 if (t->next_yes)
1217 {
1218 for (i = 0; i < depth; i++)
1219 fprintf (logfile, " ");
1220
1221 fprintf (logfile, " (if yes)\n");
1222 dump_monster_treasure_rec (name, t->next_yes, depth + 1);
1223 }
1224
1225 if (t->next_no)
1226 {
1227 for (i = 0; i < depth; i++)
1228 fprintf (logfile, " ");
1229
1230 fprintf (logfile, " (if no)\n");
1231 dump_monster_treasure_rec (name, t->next_no, depth + 1);
1232 }
1233
1234 t = t->next;
1235 }
1236}
1237
1238/*
1239 * For debugging purposes. Dumps all treasures for a given monster.
1240 * Created originally by Raphael Quinet for debugging the alchemy code.
1241 */
1242void
1243dump_monster_treasure (const char *name)
1244{
1245 archetype *at;
1246 int found;
1247
1248 found = 0;
1249 fprintf (logfile, "\n");
1250
1251 for (at = first_archetype; at != NULL; at = at->next)
1252 if (!strcasecmp (at->clone.name, name) && at->clone.title == NULL)
1253 {
1254 fprintf (logfile, "treasures for %s (arch: %s)\n", &at->clone.name, &at->name);
1255 if (at->clone.randomitems != NULL)
1256 dump_monster_treasure_rec (at->clone.name, at->clone.randomitems->items, 1);
1257 else
1258 fprintf (logfile, "(nothing)\n");
1259
1260 fprintf (logfile, "\n");
1261 found++;
1262 }
1263
1264 if (found == 0)
1265 fprintf (logfile, "No objects have the name %s!\n\n", name);
1266} 1167}
1267 1168
1268/* 1169/*
1269 * Builds up the lists of artifacts from the file in the libdir. 1170 * Builds up the lists of artifacts from the file in the libdir.
1270 */ 1171 */
… …
1284 sprintf (filename, "%s/artifacts", settings.datadir); 1185 sprintf (filename, "%s/artifacts", settings.datadir);
1285 object_thawer f (filename); 1186 object_thawer f (filename);
1286 1187
1287 if (!f) 1188 if (!f)
1288 return; 1189 return;
1289
1290 f.next ();
1291 1190
1292 for (;;) 1191 for (;;)
1293 { 1192 {
1294 switch (f.kw) 1193 switch (f.kw)
1295 { 1194 {
… …
1399#endif 1298#endif
1400 op->face = change->face; 1299 op->face = change->face;
1401 } 1300 }
1402 1301
1403 for (i = 0; i < NUM_STATS; i++) 1302 for (i = 0; i < NUM_STATS; i++)
1404 change_attr_value (&(op->stats), i, get_attr_value (&(change->stats), i)); 1303 change_attr_value (&(op->stats), i, change->stats.stat (i));
1405 1304
1406 op->attacktype |= change->attacktype; 1305 op->attacktype |= change->attacktype;
1407 op->path_attuned |= change->path_attuned; 1306 op->path_attuned |= change->path_attuned;
1408 op->path_repelled |= change->path_repelled; 1307 op->path_repelled |= change->path_repelled;
1409 op->path_denied |= change->path_denied; 1308 op->path_denied |= change->path_denied;
… …
1593 name = tmp->name + 1, neg = 1; 1492 name = tmp->name + 1, neg = 1;
1594 else 1493 else
1595 name = tmp->name, neg = 0; 1494 name = tmp->name, neg = 0;
1596 1495
1597 /* If we match name, then return the opposite of 'neg' */ 1496 /* If we match name, then return the opposite of 'neg' */
1598 if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->name))) 1497 if (!strcmp (name, op->name) || (op->arch && !strcmp (name, op->arch->archname)))
1599 return !neg; 1498 return !neg;
1600 1499
1601 /* Set success as true, since if the match was an inverse, it means 1500 /* Set success as true, since if the match was an inverse, it means
1602 * everything is allowed except what we match 1501 * everything is allowed except what we match
1603 */ 1502 */

Diff Legend

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