1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | CrossFire, A Multiplayer game for X-windows |
3 | |
3 | |
|
|
4 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | |
7 | This program is free software; you can redistribute it and/or modify |
8 | This program is free software; you can redistribute it and/or modify |
8 | 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 |
… | |
… | |
156 | * so that the treasure name can be printed out |
157 | * so that the treasure name can be printed out |
157 | */ |
158 | */ |
158 | static void |
159 | static void |
159 | check_treasurelist (const treasure *t, const treasurelist * tl) |
160 | check_treasurelist (const treasure *t, const treasurelist * tl) |
160 | { |
161 | { |
161 | if (t->item == NULL && t->name == NULL) |
|
|
162 | LOG (llevError, "Treasurelist %s has element with no name or archetype\n", &tl->name); |
|
|
163 | if (t->chance >= 100 && t->next_yes && (t->next || t->next_no)) |
162 | if (t->chance >= 100 && t->next_yes && (t->next || t->next_no)) |
164 | LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name); |
163 | LOG (llevError, "Treasurelist %s has element that has 100%% generation, next_yes field as well as next or next_no\n", &tl->name); |
165 | /* find_treasurelist will print out its own error message */ |
164 | /* find_treasurelist will print out its own error message */ |
166 | if (t->name && *t->name) |
165 | if (t->name && *t->name) |
167 | (void) find_treasurelist (t->name); |
166 | find_treasurelist (t->name); |
168 | if (t->next) |
167 | if (t->next) |
169 | check_treasurelist (t->next, tl); |
168 | check_treasurelist (t->next, tl); |
170 | if (t->next_yes) |
169 | if (t->next_yes) |
171 | check_treasurelist (t->next_yes, tl); |
170 | check_treasurelist (t->next_yes, tl); |
172 | if (t->next_no) |
171 | if (t->next_no) |
… | |
… | |
336 | |
335 | |
337 | if ((int) t->chance >= 100 || (RANDOM () % 100 + 1) < (int) t->chance) |
336 | if ((int) t->chance >= 100 || (RANDOM () % 100 + 1) < (int) t->chance) |
338 | { |
337 | { |
339 | if (t->name) |
338 | if (t->name) |
340 | { |
339 | { |
341 | if (strcmp (t->name, "NONE") && difficulty >= t->magic) |
340 | if (difficulty >= t->magic) |
342 | { |
341 | { |
343 | treasurelist *tl = find_treasurelist (t->name); |
342 | treasurelist *tl = find_treasurelist (t->name); |
344 | if (tl) |
343 | if (tl) |
345 | create_treasure (tl, op, flag, difficulty, tries); |
344 | create_treasure (tl, op, flag, difficulty, tries); |
346 | } |
345 | } |
347 | } |
346 | } |
348 | else |
347 | else |
349 | { |
348 | { |
350 | if (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE)) |
349 | if (t->item && (t->item->clone.invisible != 0 || !(flag & GT_INVISIBLE))) |
351 | { |
350 | { |
352 | tmp = arch_to_object (t->item); |
351 | tmp = arch_to_object (t->item); |
353 | if (t->nrof && tmp->nrof <= 1) |
352 | if (t->nrof && tmp->nrof <= 1) |
354 | tmp->nrof = RANDOM () % ((int) t->nrof) + 1; |
353 | tmp->nrof = RANDOM () % ((int) t->nrof) + 1; |
355 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
354 | fix_generated_item (tmp, op, difficulty, t->magic, flag); |
… | |
… | |
395 | return; |
394 | return; |
396 | } |
395 | } |
397 | |
396 | |
398 | if (t->name) |
397 | if (t->name) |
399 | { |
398 | { |
400 | if (!strcmp (t->name, "NONE")) |
|
|
401 | return; |
|
|
402 | |
|
|
403 | if (difficulty >= t->magic) |
399 | if (difficulty >= t->magic) |
404 | { |
400 | { |
405 | treasurelist *tl = find_treasurelist (t->name); |
401 | treasurelist *tl = find_treasurelist (t->name); |
406 | if (tl) |
402 | if (tl) |
407 | create_treasure (tl, op, flag, difficulty, tries); |
403 | create_treasure (tl, op, flag, difficulty, tries); |
… | |
… | |
410 | create_one_treasure (tl, op, flag, difficulty, tries); |
406 | create_one_treasure (tl, op, flag, difficulty, tries); |
411 | |
407 | |
412 | return; |
408 | return; |
413 | } |
409 | } |
414 | |
410 | |
415 | if ((t->item && t->item->clone.invisible != 0) || flag != GT_INVISIBLE) |
411 | if (t->item && (t->item->clone.invisible != 0 || flag != GT_INVISIBLE)) |
416 | { |
412 | { |
417 | object *tmp = arch_to_object (t->item); |
413 | object *tmp = arch_to_object (t->item); |
418 | |
414 | |
419 | if (!tmp) |
415 | if (!tmp) |
420 | return; |
416 | return; |
… | |
… | |
434 | * list transitions, or so that excessively good treasure will not be |
430 | * list transitions, or so that excessively good treasure will not be |
435 | * created on weak maps, because it will exceed the number of allowed tries |
431 | * created on weak maps, because it will exceed the number of allowed tries |
436 | * to do that. |
432 | * to do that. |
437 | */ |
433 | */ |
438 | void |
434 | void |
439 | create_treasure (treasurelist * t, object *op, int flag, int difficulty, int tries) |
435 | create_treasure (treasurelist *tl, object *op, int flag, int difficulty, int tries) |
440 | { |
436 | { |
441 | |
437 | |
442 | if (tries++ > 100) |
438 | if (tries++ > 100) |
443 | { |
439 | { |
444 | LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); |
440 | LOG (llevDebug, "createtreasure: tries exceeded 100, returning without making treasure\n"); |
445 | return; |
441 | return; |
446 | } |
442 | } |
447 | if (t->total_chance) |
443 | if (tl->total_chance) |
448 | create_one_treasure (t, op, flag, difficulty, tries); |
444 | create_one_treasure (tl, op, flag, difficulty, tries); |
449 | else |
445 | else |
450 | create_all_treasures (t->items, op, flag, difficulty, tries); |
446 | create_all_treasures (tl->items, op, flag, difficulty, tries); |
451 | } |
447 | } |
452 | |
448 | |
453 | /* This is similar to the old generate treasure function. However, |
449 | /* This is similar to the old generate treasure function. However, |
454 | * it instead takes a treasurelist. It is really just a wrapper around |
450 | * it instead takes a treasurelist. It is really just a wrapper around |
455 | * create_treasure. We create a dummy object that the treasure gets |
451 | * create_treasure. We create a dummy object that the treasure gets |
456 | * inserted into, and then return that treausre |
452 | * inserted into, and then return that treausre |
457 | */ |
453 | */ |
458 | object * |
454 | object * |
459 | generate_treasure (treasurelist *t, int difficulty) |
455 | generate_treasure (treasurelist *tl, int difficulty) |
460 | { |
456 | { |
461 | difficulty = clamp (difficulty, 1, settings.max_level); |
457 | difficulty = clamp (difficulty, 1, settings.max_level); |
462 | |
458 | |
463 | object *ob = object::create (), *tmp; |
459 | object *ob = object::create (), *tmp; |
464 | |
460 | |
465 | create_treasure (t, ob, 0, difficulty, 0); |
461 | create_treasure (tl, ob, 0, difficulty, 0); |
466 | |
462 | |
467 | /* Don't want to free the object we are about to return */ |
463 | /* Don't want to free the object we are about to return */ |
468 | tmp = ob->inv; |
464 | tmp = ob->inv; |
469 | if (tmp != NULL) |
465 | if (tmp != NULL) |
470 | tmp->remove (); |
466 | tmp->remove (); |
… | |
… | |
1176 | */ |
1172 | */ |
1177 | |
1173 | |
1178 | static artifactlist * |
1174 | static artifactlist * |
1179 | get_empty_artifactlist (void) |
1175 | get_empty_artifactlist (void) |
1180 | { |
1176 | { |
1181 | artifactlist *tl = (artifactlist *) malloc (sizeof (artifactlist)); |
1177 | artifactlist *al = (artifactlist *) malloc (sizeof (artifactlist)); |
1182 | |
1178 | |
1183 | if (tl == NULL) |
1179 | if (al == NULL) |
1184 | fatal (OUT_OF_MEMORY); |
1180 | fatal (OUT_OF_MEMORY); |
1185 | tl->next = NULL; |
1181 | al->next = NULL; |
1186 | tl->items = NULL; |
1182 | al->items = NULL; |
1187 | tl->total_chance = 0; |
1183 | al->total_chance = 0; |
1188 | return tl; |
1184 | return al; |
1189 | } |
1185 | } |
1190 | |
1186 | |
1191 | /* |
1187 | /* |
1192 | * Allocate and return the pointer to an empty artifact structure. |
1188 | * Allocate and return the pointer to an empty artifact structure. |
1193 | */ |
1189 | */ |
1194 | |
1190 | |
1195 | static artifact * |
1191 | static artifact * |
1196 | get_empty_artifact (void) |
1192 | get_empty_artifact (void) |
1197 | { |
1193 | { |
1198 | artifact *t = (artifact *) malloc (sizeof (artifact)); |
1194 | artifact *a = (artifact *) malloc (sizeof (artifact)); |
1199 | |
1195 | |
1200 | if (t == NULL) |
1196 | if (a == NULL) |
1201 | fatal (OUT_OF_MEMORY); |
1197 | fatal (OUT_OF_MEMORY); |
1202 | t->item = NULL; |
1198 | a->item = NULL; |
1203 | t->next = NULL; |
1199 | a->next = NULL; |
1204 | t->chance = 0; |
1200 | a->chance = 0; |
1205 | t->difficulty = 0; |
1201 | a->difficulty = 0; |
1206 | t->allowed = NULL; |
1202 | a->allowed = NULL; |
1207 | return t; |
1203 | return a; |
1208 | } |
1204 | } |
1209 | |
1205 | |
1210 | /* |
1206 | /* |
1211 | * Searches the artifact lists and returns one that has the same type |
1207 | * Searches the artifact lists and returns one that has the same type |
1212 | * of objects on it. |
1208 | * of objects on it. |
… | |
… | |
1262 | treasurelist *tl; |
1258 | treasurelist *tl; |
1263 | int i; |
1259 | int i; |
1264 | |
1260 | |
1265 | if (depth > 100) |
1261 | if (depth > 100) |
1266 | return; |
1262 | return; |
1267 | while (t != NULL) |
1263 | while (t) |
1268 | { |
1264 | { |
1269 | if (t->name != NULL) |
1265 | if (t->name) |
1270 | { |
1266 | { |
1271 | for (i = 0; i < depth; i++) |
1267 | for (i = 0; i < depth; i++) |
1272 | fprintf (logfile, " "); |
1268 | fprintf (logfile, " "); |
1273 | fprintf (logfile, "{ (list: %s)\n", &t->name); |
1269 | fprintf (logfile, "{ (list: %s)\n", &t->name); |
1274 | tl = find_treasurelist (t->name); |
1270 | tl = find_treasurelist (t->name); |
… | |
… | |
1280 | } |
1276 | } |
1281 | else |
1277 | else |
1282 | { |
1278 | { |
1283 | for (i = 0; i < depth; i++) |
1279 | for (i = 0; i < depth; i++) |
1284 | fprintf (logfile, " "); |
1280 | fprintf (logfile, " "); |
1285 | if (t->item->clone.type == FLESH) |
1281 | if (t->item && t->item->clone.type == FLESH) |
1286 | fprintf (logfile, "%s's %s\n", name, &t->item->clone.name); |
1282 | fprintf (logfile, "%s's %s\n", name, &t->item->clone.name); |
1287 | else |
1283 | else |
1288 | fprintf (logfile, "%s\n", &t->item->clone.name); |
1284 | fprintf (logfile, "%s\n", &t->item->clone.name); |
1289 | } |
1285 | } |
|
|
1286 | |
1290 | if (t->next_yes != NULL) |
1287 | if (t->next_yes) |
1291 | { |
1288 | { |
1292 | for (i = 0; i < depth; i++) |
1289 | for (i = 0; i < depth; i++) |
1293 | fprintf (logfile, " "); |
1290 | fprintf (logfile, " "); |
1294 | fprintf (logfile, " (if yes)\n"); |
1291 | fprintf (logfile, " (if yes)\n"); |
1295 | dump_monster_treasure_rec (name, t->next_yes, depth + 1); |
1292 | dump_monster_treasure_rec (name, t->next_yes, depth + 1); |
1296 | } |
1293 | } |
|
|
1294 | |
1297 | if (t->next_no != NULL) |
1295 | if (t->next_no) |
1298 | { |
1296 | { |
1299 | for (i = 0; i < depth; i++) |
1297 | for (i = 0; i < depth; i++) |
1300 | fprintf (logfile, " "); |
1298 | fprintf (logfile, " "); |
1301 | fprintf (logfile, " (if no)\n"); |
1299 | fprintf (logfile, " (if no)\n"); |
1302 | dump_monster_treasure_rec (name, t->next_no, depth + 1); |
1300 | dump_monster_treasure_rec (name, t->next_no, depth + 1); |
1303 | } |
1301 | } |
|
|
1302 | |
1304 | t = t->next; |
1303 | t = t->next; |
1305 | } |
1304 | } |
1306 | } |
1305 | } |
1307 | |
1306 | |
1308 | /* |
1307 | /* |
… | |
… | |
1808 | /* special_potion() - so that old potion code is still done right. */ |
1807 | /* special_potion() - so that old potion code is still done right. */ |
1809 | |
1808 | |
1810 | int |
1809 | int |
1811 | special_potion (object *op) |
1810 | special_potion (object *op) |
1812 | { |
1811 | { |
1813 | |
|
|
1814 | int i; |
|
|
1815 | |
|
|
1816 | if (op->attacktype) |
1812 | if (op->attacktype) |
1817 | return 1; |
1813 | return 1; |
1818 | |
1814 | |
1819 | if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha) |
1815 | if (op->stats.Str || op->stats.Dex || op->stats.Con || op->stats.Pow || op->stats.Wis || op->stats.Int || op->stats.Cha) |
1820 | return 1; |
1816 | return 1; |
1821 | |
1817 | |
1822 | for (i = 0; i < NROFATTACKS; i++) |
1818 | for (int i = 0; i < NROFATTACKS; i++) |
1823 | if (op->resist[i]) |
1819 | if (op->resist[i]) |
1824 | return 1; |
1820 | return 1; |
1825 | |
1821 | |
1826 | return 0; |
1822 | return 0; |
1827 | } |
1823 | } |