1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
… | |
… | |
30 | |
30 | |
31 | #include <global.h> |
31 | #include <global.h> |
32 | #include <book.h> |
32 | #include <book.h> |
33 | #include <living.h> |
33 | #include <living.h> |
34 | #include <spells.h> |
34 | #include <spells.h> |
35 | |
|
|
36 | |
35 | |
37 | /* Define this if you want to archive book titles by contents. |
36 | /* Define this if you want to archive book titles by contents. |
38 | * This option should enforce UNIQUE combinations of titles,authors and |
37 | * This option should enforce UNIQUE combinations of titles,authors and |
39 | * msg contents during and *between* game sessions. |
38 | * msg contents during and *between* game sessions. |
40 | * Note: a slight degeneracy exists since books are archived based on an integer |
39 | * Note: a slight degeneracy exists since books are archived based on an integer |
… | |
… | |
570 | * (shstr.c ?), but the quantity BOOK_BUF will need to be defined. */ |
569 | * (shstr.c ?), but the quantity BOOK_BUF will need to be defined. */ |
571 | |
570 | |
572 | /* nstrtok() - simple routine to return the number of list |
571 | /* nstrtok() - simple routine to return the number of list |
573 | * items in buf1 as separated by the value of buf2 |
572 | * items in buf1 as separated by the value of buf2 |
574 | */ |
573 | */ |
575 | |
574 | static int |
576 | int |
|
|
577 | nstrtok (const char *buf1, const char *buf2) |
575 | nstrtok (const char *buf1, const char *buf2) |
578 | { |
576 | { |
579 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
577 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
580 | int number = 0; |
578 | int number = 0; |
581 | |
579 | |
… | |
… | |
594 | |
592 | |
595 | /* strtoktolin() - takes a string in buf1 and separates it into |
593 | /* strtoktolin() - takes a string in buf1 and separates it into |
596 | * a list of strings delimited by buf2. Then returns a comma |
594 | * a list of strings delimited by buf2. Then returns a comma |
597 | * separated string w/ decent punctuation. |
595 | * separated string w/ decent punctuation. |
598 | */ |
596 | */ |
599 | |
597 | static char * |
600 | char * |
|
|
601 | strtoktolin (const char *buf1, const char *buf2) |
598 | strtoktolin (const char *buf1, const char *buf2) |
602 | { |
599 | { |
603 | int maxi, i = nstrtok (buf1, buf2); |
600 | int maxi, i = nstrtok (buf1, buf2); |
604 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
601 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
605 | static char rbuf[BOOK_BUF]; |
602 | static char rbuf[BOOK_BUF]; |
… | |
… | |
622 | tbuf = strtok (NULL, sbuf); |
619 | tbuf = strtok (NULL, sbuf); |
623 | } |
620 | } |
624 | return (char *) rbuf; |
621 | return (char *) rbuf; |
625 | } |
622 | } |
626 | |
623 | |
627 | int |
624 | static int |
628 | book_overflow (const char *buf1, const char *buf2, int booksize) |
625 | book_overflow (const char *buf1, const char *buf2, int booksize) |
629 | { |
626 | { |
630 | |
|
|
631 | if (buf_overflow (buf1, buf2, BOOK_BUF - 2) /* 2 less so always room for trailing \n */ |
627 | if (buf_overflow (buf1, buf2, BOOK_BUF - 2) /* 2 less so always room for trailing \n */ |
632 | || buf_overflow (buf1, buf2, booksize)) |
628 | || buf_overflow (buf1, buf2, booksize)) |
633 | return 1; |
629 | return 1; |
|
|
630 | |
634 | return 0; |
631 | return 0; |
635 | |
|
|
636 | |
|
|
637 | } |
632 | } |
638 | |
633 | |
639 | /***************************************************************************** |
634 | /***************************************************************************** |
640 | * |
635 | * |
641 | * Start of initialisation related functions. |
636 | * Start of initialisation related functions. |
… | |
… | |
818 | else |
813 | else |
819 | t = t->next; |
814 | t = t->next; |
820 | |
815 | |
821 | #ifdef ARCHIVE_DEBUG |
816 | #ifdef ARCHIVE_DEBUG |
822 | if (t) |
817 | if (t) |
823 | LOG (llevDebug, "Found title match (list %d): %s %s (%d)\n", msgtype, t->name, t->authour, t->msg_index); |
818 | LOG (llevDebug, "Found title match (list %d): %s %s (%d)\n", msgtype, &t->name, &t->authour, t->msg_index); |
824 | #endif |
819 | #endif |
825 | |
820 | |
826 | return t; |
821 | return t; |
827 | } |
822 | } |
828 | |
823 | |
… | |
… | |
830 | * handled directly in change_book_name(). Names are based on text |
825 | * handled directly in change_book_name(). Names are based on text |
831 | * msgtype |
826 | * msgtype |
832 | * this sets book book->name based on msgtype given. What name |
827 | * this sets book book->name based on msgtype given. What name |
833 | * is given is based on various criteria |
828 | * is given is based on various criteria |
834 | */ |
829 | */ |
835 | |
|
|
836 | static void |
830 | static void |
837 | new_text_name (object *book, int msgtype) |
831 | new_text_name (object *book, int msgtype) |
838 | { |
832 | { |
839 | int nbr; |
833 | int nbr; |
840 | char name[MAX_BUF]; |
834 | char name[MAX_BUF]; |
… | |
… | |
976 | |
970 | |
977 | /* We have stuff we need to write now */ |
971 | /* We have stuff we need to write now */ |
978 | need_to_write_bookarchive = 1; |
972 | need_to_write_bookarchive = 1; |
979 | |
973 | |
980 | #ifdef ARCHIVE_DEBUG |
974 | #ifdef ARCHIVE_DEBUG |
981 | LOG (llevDebug, "Archiving new title: %s %s (%d)\n", book->name, book->title, msgtype); |
975 | LOG (llevDebug, "Archiving new title: %s %s (%d)\n", &book->name, &book->title, msgtype); |
982 | #endif |
976 | #endif |
983 | |
977 | |
984 | } |
978 | } |
985 | |
979 | |
986 | |
980 | |
… | |
… | |
992 | * levels and architypes. -b.t. |
986 | * levels and architypes. -b.t. |
993 | */ |
987 | */ |
994 | |
988 | |
995 | #define MAX_TITLE_CHECK 20 |
989 | #define MAX_TITLE_CHECK 20 |
996 | |
990 | |
997 | void |
991 | static void |
998 | change_book (object *book, int msgtype) |
992 | change_book (object *book, int msgtype) |
999 | { |
993 | { |
1000 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
994 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1001 | |
995 | |
1002 | switch (book->type) |
996 | switch (book->type) |
… | |
… | |
1052 | if (numb == maxnames) |
1046 | if (numb == maxnames) |
1053 | { |
1047 | { |
1054 | #ifdef ARCHIVE_DEBUG |
1048 | #ifdef ARCHIVE_DEBUG |
1055 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
1049 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
1056 | #endif |
1050 | #endif |
1057 | break; |
|
|
1058 | } |
1051 | } |
1059 | /* shouldnt change map-maker books */ |
1052 | /* shouldnt change map-maker books */ |
1060 | else if (!book->title) |
1053 | else if (!book->title) |
1061 | do |
1054 | do |
1062 | { |
1055 | { |
… | |
… | |
1077 | */ |
1070 | */ |
1078 | |
1071 | |
1079 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1072 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1080 | { /* got to check maxnames again */ |
1073 | { /* got to check maxnames again */ |
1081 | #ifdef ARCHIVE_DEBUG |
1074 | #ifdef ARCHIVE_DEBUG |
1082 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames); |
1075 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", &book->name, &book->title, numb, maxnames); |
1083 | #endif |
1076 | #endif |
1084 | /* restore old book properties here */ |
1077 | /* restore old book properties here */ |
1085 | book->title = old_title; |
1078 | book->title = old_title; |
1086 | |
1079 | |
1087 | if (rndm (4)) |
1080 | if (rndm (4)) |
… | |
… | |
1127 | * list of all monsters in the current game. If level is non-zero, |
1120 | * list of all monsters in the current game. If level is non-zero, |
1128 | * then only monsters greater than that level will be returned. |
1121 | * then only monsters greater than that level will be returned. |
1129 | * Changed 971225 to be greater than equal to level passed. Also |
1122 | * Changed 971225 to be greater than equal to level passed. Also |
1130 | * made choosing by level more random. |
1123 | * made choosing by level more random. |
1131 | */ |
1124 | */ |
1132 | |
|
|
1133 | object * |
1125 | object * |
1134 | get_random_mon (int level) |
1126 | get_random_mon (int level) |
1135 | { |
1127 | { |
1136 | objectlink *mon = first_mon_info; |
1128 | objectlink *mon = first_mon_info; |
1137 | int i = 0, monnr; |
1129 | int i = 0, monnr; |
… | |
… | |
1195 | |
1187 | |
1196 | /* |
1188 | /* |
1197 | * Returns a description of the monster. This really needs to be |
1189 | * Returns a description of the monster. This really needs to be |
1198 | * redone, as describe_item really gives a pretty internal description. |
1190 | * redone, as describe_item really gives a pretty internal description. |
1199 | */ |
1191 | */ |
1200 | |
1192 | static const char * |
1201 | char * |
|
|
1202 | mon_desc (const object *mon) |
1193 | mon_desc (const object *mon) |
1203 | { |
1194 | { |
1204 | static char retbuf[HUGE_BUF]; |
1195 | static dynbuf_text buf; buf.clear (); |
1205 | |
1196 | |
1206 | sprintf (retbuf, " *** %s ***\n", &mon->name); |
1197 | buf.printf ("B<< %s >>\r", &mon->name); |
1207 | strcat (retbuf, describe_item (mon, NULL)); |
1198 | buf << describe_item (mon, 0); |
1208 | |
1199 | |
1209 | return retbuf; |
1200 | return buf; |
1210 | } |
1201 | } |
1211 | |
1202 | |
1212 | |
1203 | |
1213 | /* This function returns the next monsters after 'tmp'. If no match is |
1204 | /* This function returns the next monsters after 'tmp'. If no match is |
1214 | * found, it returns NULL (changed 0.94.3 to do this, since the |
1205 | * found, it returns NULL (changed 0.94.3 to do this, since the |
1215 | * calling function (mon_info_msg) seems to expect that. |
1206 | * calling function (mon_info_msg) seems to expect that. |
1216 | */ |
1207 | */ |
1217 | |
1208 | static object * |
1218 | object * |
|
|
1219 | get_next_mon (object *tmp) |
1209 | get_next_mon (object *tmp) |
1220 | { |
1210 | { |
1221 | objectlink *mon; |
1211 | objectlink *mon; |
1222 | |
1212 | |
1223 | for (mon = first_mon_info; mon; mon = mon->next) |
1213 | for (mon = first_mon_info; mon; mon = mon->next) |
… | |
… | |
1232 | else |
1222 | else |
1233 | return first_mon_info->ob; |
1223 | return first_mon_info->ob; |
1234 | |
1224 | |
1235 | } |
1225 | } |
1236 | |
1226 | |
1237 | |
|
|
1238 | |
|
|
1239 | /* mon_info_msg() - generate a message detailing the properties |
1227 | /* mon_info_msg() - generate a message detailing the properties |
1240 | * of a randomly selected monster. |
1228 | * of a randomly selected monster. |
1241 | */ |
1229 | */ |
1242 | |
1230 | static const char * |
1243 | char * |
|
|
1244 | mon_info_msg (int level, int booksize) |
1231 | mon_info_msg (int level, int booksize) |
1245 | { |
1232 | { |
1246 | static char retbuf[BOOK_BUF]; |
1233 | static dynbuf_text buf; buf.clear (); |
1247 | char tmpbuf[HUGE_BUF]; |
|
|
1248 | object *tmp; |
|
|
1249 | |
1234 | |
1250 | /*preamble */ |
1235 | /*preamble */ |
1251 | strcpy (retbuf, "This beastiary contains:"); |
1236 | buf << "This beastiary contains:\n"; |
1252 | |
1237 | |
1253 | /* lets print info on as many monsters as will fit in our |
1238 | /* lets print info on as many monsters as will fit in our |
1254 | * document. |
1239 | * document. |
1255 | * 8-96 Had to change this a bit, otherwise there would |
1240 | * 8-96 Had to change this a bit, otherwise there would |
1256 | * have been an impossibly large number of combinations |
1241 | * have been an impossibly large number of combinations |
1257 | * of text! (and flood out the available number of titles |
1242 | * of text! (and flood out the available number of titles |
1258 | * in the archive in a snap!) -b.t. |
1243 | * in the archive in a snap!) -b.t. |
1259 | */ |
1244 | */ |
1260 | tmp = get_random_mon (level * 3); |
1245 | object *tmp = get_random_mon (level * 3); |
1261 | while (tmp) |
1246 | while (tmp && buf.size () < BOOK_BUF) |
1262 | { |
1247 | { |
1263 | /* monster description */ |
1248 | /* monster description */ |
1264 | sprintf (tmpbuf, "\n---\n%s", mon_desc (tmp)); |
1249 | buf.printf ("\n%s\n", mon_desc (tmp)); |
1265 | |
|
|
1266 | if (!book_overflow (retbuf, tmpbuf, booksize)) |
|
|
1267 | strcat (retbuf, tmpbuf); |
|
|
1268 | else |
|
|
1269 | break; |
|
|
1270 | |
1250 | |
1271 | /* Note that the value this returns is not based on level */ |
1251 | /* Note that the value this returns is not based on level */ |
1272 | tmp = get_next_mon (tmp); |
1252 | tmp = get_next_mon (tmp); |
1273 | } |
1253 | } |
1274 | |
1254 | |
1275 | #ifdef BOOK_MSG_DEBUG |
|
|
1276 | LOG (llevDebug, "\n mon_info_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1277 | fprintf (logfile, " MADE THIS:\n%s\n", retbuf); |
|
|
1278 | #endif |
|
|
1279 | |
|
|
1280 | return retbuf; |
1255 | return buf; |
1281 | } |
1256 | } |
1282 | |
1257 | |
1283 | |
1258 | |
1284 | /***************************************************************************** |
1259 | /***************************************************************************** |
1285 | * Artifact msg generation code. |
1260 | * Artifact msg generation code. |
1286 | ****************************************************************************/ |
1261 | ****************************************************************************/ |
1287 | |
1262 | |
1288 | /* artifact_msg() - generate a message detailing the properties |
1263 | /* artifact_msg() - generate a message detailing the properties |
1289 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1264 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1290 | */ |
1265 | */ |
1291 | const char * |
1266 | static const char * |
1292 | artifact_msg (int level, int booksize) |
1267 | artifact_msg (int level, int booksize) |
1293 | { |
1268 | { |
1294 | artifactlist *al = NULL; |
1269 | artifactlist *al = NULL; |
1295 | artifact *art; |
1270 | artifact *art; |
1296 | int chance, i, type, index; |
1271 | int chance, i, type, index; |
1297 | int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1; |
1272 | int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1; |
1298 | const char *ch; |
1273 | const char *ch; |
1299 | char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1274 | char name[MAX_BUF]; |
1300 | static char retbuf[BOOK_BUF]; |
|
|
1301 | object *tmp = NULL; |
1275 | object *tmp = NULL; |
|
|
1276 | |
|
|
1277 | static dynbuf_text buf; buf.clear (); |
1302 | |
1278 | |
1303 | /* values greater than 5 create msg buffers that are too big! */ |
1279 | /* values greater than 5 create msg buffers that are too big! */ |
1304 | if (book_entries > 5) |
1280 | if (book_entries > 5) |
1305 | book_entries = 5; |
1281 | book_entries = 5; |
1306 | |
1282 | |
… | |
… | |
1335 | |
1311 | |
1336 | /* the base 'generic' name for our artifact */ |
1312 | /* the base 'generic' name for our artifact */ |
1337 | assign (name, art_name_array[index].name); |
1313 | assign (name, art_name_array[index].name); |
1338 | |
1314 | |
1339 | /* Ok, lets print out the contents */ |
1315 | /* Ok, lets print out the contents */ |
1340 | sprintf (retbuf, "Herein %s detailed %s...\n", book_entries > 1 ? "are" : "is", book_entries > 1 ? "some artifacts" : "an artifact"); |
1316 | buf.printf ("Herein %s detailed %s...\n", |
|
|
1317 | book_entries > 1 ? "are" : "is", |
|
|
1318 | book_entries > 1 ? "some artifacts" : "an artifact"); |
1341 | |
1319 | |
1342 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1320 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1343 | * as long as we have space up to the allowed max # (book_entires) |
1321 | * as long as we have space up to the allowed max # (book_entires) |
1344 | */ |
1322 | */ |
1345 | while (book_entries > 0) |
1323 | while (book_entries > 0 && buf.size () < BOOK_BUF) |
1346 | { |
1324 | { |
1347 | |
1325 | |
1348 | if (art == NULL) |
1326 | if (!art) |
1349 | art = al->items; |
1327 | art = al->items; |
1350 | |
1328 | |
1351 | /* separator of items */ |
1329 | buf << '\n'; |
1352 | strcpy (buf, "--- \n"); |
|
|
1353 | |
1330 | |
1354 | /* Name */ |
1331 | /* Name */ |
1355 | if (art->allowed && art->allowed->name != shstr_All) |
1332 | if (art->allowed && art->allowed->name != shstr_All) |
1356 | { |
1333 | { |
1357 | linked_char *temp, *next = art->allowed; |
1334 | linked_char *temp, *next = art->allowed; |
… | |
… | |
1360 | { |
1337 | { |
1361 | temp = next; |
1338 | temp = next; |
1362 | next = next->next; |
1339 | next = next->next; |
1363 | } |
1340 | } |
1364 | while (next && rndm (2)); |
1341 | while (next && rndm (2)); |
|
|
1342 | |
1365 | sprintf (buf, "%s A %s of %s", buf, &temp->name, &art->item->name); |
1343 | buf.printf ("A B<< %s of %s >>", &temp->name, &art->item->name); |
1366 | } |
1344 | } |
1367 | else /* default name is used */ |
1345 | else /* default name is used */ |
1368 | sprintf (buf, "%s The %s of %s", buf, name, &art->item->name); |
1346 | buf.printf ("The B<< %s of %s >>", name, &art->item->name); |
|
|
1347 | |
|
|
1348 | buf << " is "; |
1369 | |
1349 | |
1370 | /* chance of finding */ |
1350 | /* chance of finding */ |
1371 | chance = (int) (100 * ((float) art->chance / al->total_chance)); |
1351 | chance = (int) (100 * ((float) art->chance / al->total_chance)); |
1372 | if (chance >= 20) |
1352 | if (chance >= 20) |
1373 | sprintf (sbuf, "an uncommon"); |
1353 | buf << "an uncommon"; |
1374 | else if (chance >= 10) |
1354 | else if (chance >= 10) |
1375 | sprintf (sbuf, "an unusual"); |
1355 | buf << "an unusual"; |
1376 | else if (chance >= 5) |
1356 | else if (chance >= 5) |
1377 | sprintf (sbuf, "a rare"); |
1357 | buf << "a rare"; |
1378 | else |
1358 | else |
1379 | sprintf (sbuf, "a very rare"); |
1359 | buf << "a very rare"; |
1380 | sprintf (buf, "%s is %s\n", buf, sbuf); |
|
|
1381 | |
1360 | |
1382 | /* value of artifact */ |
1361 | /* value of artifact */ |
1383 | sprintf (buf, "%s item with a value that is %d times normal.\n", buf, art->item->value); |
1362 | buf << " item with a value that is " << art->item->value << " times normal.\n"; |
1384 | |
1363 | |
1385 | /* include the message about the artifact, if exists, and book |
1364 | /* include the message about the artifact, if exists, and book |
1386 | * level is kinda high */ |
1365 | * level is kinda high */ |
1387 | if (art->item->msg |
1366 | if (art->item->msg |
1388 | && rndm (4) + 1 < level |
1367 | && rndm (4) + 1 < level) |
1389 | && !(strlen (art->item->msg) + strlen (buf) > BOOK_BUF)) |
|
|
1390 | strcat (buf, art->item->msg); |
1368 | buf << art->item->msg; |
1391 | |
1369 | |
1392 | /* properties of the artifact */ |
1370 | /* properties of the artifact */ |
1393 | tmp = object::create (); |
1371 | tmp = object::create (); |
1394 | add_abilities (tmp, art->item); |
1372 | add_abilities (tmp, art->item); |
1395 | tmp->type = type; |
1373 | tmp->type = type; |
1396 | SET_FLAG (tmp, FLAG_IDENTIFIED); |
1374 | SET_FLAG (tmp, FLAG_IDENTIFIED); |
1397 | if ((ch = describe_item (tmp, NULL)) != NULL && strlen (ch) > 1) |
1375 | if ((ch = describe_item (tmp, 0)) && strlen (ch) > 1) |
1398 | sprintf (buf, "%s Properties of this artifact include: \n %s \n", buf, ch); |
1376 | buf << "\rProperties of this artifact include:\r" << ch << "\n"; |
|
|
1377 | |
1399 | tmp->destroy (); |
1378 | tmp->destroy (); |
1400 | /* add the buf if it will fit */ |
|
|
1401 | if (!book_overflow (retbuf, buf, booksize)) |
|
|
1402 | strcat (retbuf, buf); |
|
|
1403 | else |
|
|
1404 | break; |
|
|
1405 | |
1379 | |
1406 | art = art->next; |
1380 | art = art->next; |
1407 | book_entries--; |
1381 | book_entries--; |
1408 | } |
1382 | } |
1409 | |
1383 | |
1410 | #ifdef BOOK_MSG_DEBUG |
|
|
1411 | LOG (llevDebug, "artifact_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1412 | fprintf (logfile, " MADE THIS:\n%s", retbuf); |
|
|
1413 | #endif |
|
|
1414 | return retbuf; |
1384 | return buf; |
1415 | } |
1385 | } |
1416 | |
1386 | |
1417 | /***************************************************************************** |
1387 | /***************************************************************************** |
1418 | * Spellpath message generation |
1388 | * Spellpath message generation |
1419 | *****************************************************************************/ |
1389 | *****************************************************************************/ |
1420 | |
1390 | |
1421 | /* spellpath_msg() - generate a message detailing the member |
1391 | /* spellpath_msg() - generate a message detailing the member |
1422 | * incantations/prayers (and some of their properties) belonging to |
1392 | * incantations/prayers (and some of their properties) belonging to |
1423 | * a given spellpath. |
1393 | * a given spellpath. |
1424 | */ |
1394 | */ |
1425 | |
1395 | static char * |
1426 | char * |
|
|
1427 | spellpath_msg (int level, int booksize) |
1396 | spellpath_msg (int level, int booksize) |
1428 | { |
1397 | { |
|
|
1398 | static dynbuf_text buf; buf.clear (); |
|
|
1399 | |
1429 | static char retbuf[BOOK_BUF]; |
1400 | static char retbuf[BOOK_BUF]; |
1430 | char tmpbuf[BOOK_BUF]; |
1401 | char tmpbuf[BOOK_BUF]; |
1431 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
1402 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
1432 | int did_first_sp = 0; |
|
|
1433 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1403 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1434 | archetype *at; |
1404 | archetype *at; |
1435 | |
1405 | |
1436 | /* Preamble */ |
1406 | /* Preamble */ |
1437 | sprintf (retbuf, "Herein are detailed the names of %s\n", prayers ? "prayers" : "incantations"); |
1407 | buf << "Herein are detailed the names of " |
|
|
1408 | << (prayers ? "prayers" : "incantations"); |
1438 | |
1409 | |
1439 | if (path == -1) |
1410 | if (path == -1) |
1440 | strcat (retbuf, "having no known spell path.\n"); |
1411 | buf << " having no known spell path.\n"; |
1441 | else |
1412 | else |
1442 | sprintf (retbuf, "%sbelonging to the path of %s:\n", retbuf, spellpathnames[path]); |
1413 | buf << " belonging to the path of B<< " << spellpathnames[path] << " >>:\n\n"; |
|
|
1414 | |
|
|
1415 | int seen = 0; |
1443 | |
1416 | |
1444 | for_all_archetypes (at) |
1417 | for_all_archetypes (at) |
1445 | { |
|
|
1446 | /* Determine if this is an appropriate spell. Must |
1418 | /* Determine if this is an appropriate spell. Must |
1447 | * be of matching path, must be of appropriate type (prayer |
1419 | * be of matching path, must be of appropriate type (prayer |
1448 | * or not), and must be within the valid level range. |
1420 | * or not), and must be within the valid level range. |
1449 | */ |
1421 | */ |
1450 | if (at->type == SPELL && at->path_attuned & pnum && |
1422 | if (at->type == SPELL && at->path_attuned & pnum && |
1451 | ((at->stats.grace && prayers) || (at->stats.sp && !prayers)) && (at->level < (level * 8))) |
1423 | ((at->stats.grace && prayers) || (at->stats.sp && !prayers)) && (at->level < (level * 8))) |
1452 | { |
1424 | { |
1453 | assign (tmpbuf, at->object::name); |
1425 | seen = 1; |
1454 | |
1426 | buf << at->object::name << '\r'; |
1455 | if (book_overflow (retbuf, tmpbuf, booksize)) |
|
|
1456 | break; |
|
|
1457 | else |
|
|
1458 | { |
|
|
1459 | if (did_first_sp) |
|
|
1460 | strcat (retbuf, ",\n"); |
|
|
1461 | did_first_sp = 1; |
|
|
1462 | strcat (retbuf, tmpbuf); |
|
|
1463 | } |
|
|
1464 | } |
1427 | } |
1465 | } |
1428 | |
1466 | /* Geez, no spells were generated. */ |
1429 | /* Geez, no spells were generated. */ |
1467 | if (!did_first_sp) |
1430 | if (!seen) |
1468 | { |
|
|
1469 | if (rndm (4)) /* usually, lets make a recursive call... */ |
1431 | if (rndm (4)) /* usually, lets make a recursive call... */ |
1470 | spellpath_msg (level, booksize); |
1432 | return spellpath_msg (level, booksize); |
1471 | else /* give up, cause knowing no spells exist for path is info too. */ |
1433 | else /* give up, cause knowing no spells exist for path is info too. */ |
1472 | strcat (retbuf, "\n - no known spells exist -\n"); |
1434 | buf << "- no known spells exist.\n"; |
1473 | } |
1435 | |
1474 | else |
|
|
1475 | { |
|
|
1476 | strcat (retbuf, "\n"); |
|
|
1477 | } |
|
|
1478 | return retbuf; |
1436 | return buf; |
1479 | } |
1437 | } |
1480 | |
1438 | |
1481 | /* formula_msg() - generate a message detailing the properties |
1439 | /* formula_msg() - generate a message detailing the properties |
1482 | * of a randomly selected alchemical formula. |
1440 | * of a randomly selected alchemical formula. |
1483 | */ |
1441 | */ |
1484 | void |
1442 | static void |
1485 | make_formula_book (object *book, int level) |
1443 | make_formula_book (object *book, int level) |
1486 | { |
1444 | { |
1487 | char retbuf[BOOK_BUF], title[MAX_BUF]; |
1445 | char title[MAX_BUF]; |
1488 | recipelist *fl; |
1446 | recipelist *fl; |
1489 | recipe *formula = NULL; |
1447 | recipe *formula = NULL; |
1490 | int chance; |
1448 | int chance; |
|
|
1449 | |
|
|
1450 | static dynbuf_text buf; buf.clear (); |
1491 | |
1451 | |
1492 | /* the higher the book level, the more complex (ie number of |
1452 | /* the higher the book level, the more complex (ie number of |
1493 | * ingredients) the formula can be. |
1453 | * ingredients) the formula can be. |
1494 | */ |
1454 | */ |
1495 | fl = get_formulalist (rndm (level) / 3 + 1); |
1455 | fl = get_formulalist (rndm (level) / 3 + 1); |
… | |
… | |
1508 | /* get a random formula, weighted by its bookchance */ |
1468 | /* get a random formula, weighted by its bookchance */ |
1509 | chance = rndm (fl->total_chance); |
1469 | chance = rndm (fl->total_chance); |
1510 | for (formula = fl->items; formula; formula = formula->next) |
1470 | for (formula = fl->items; formula; formula = formula->next) |
1511 | { |
1471 | { |
1512 | chance -= formula->chance; |
1472 | chance -= formula->chance; |
|
|
1473 | |
1513 | if (chance <= 0) |
1474 | if (chance <= 0) |
1514 | break; |
1475 | break; |
1515 | } |
1476 | } |
1516 | |
1477 | |
1517 | if (!formula || formula->arch_names <= 0) |
1478 | if (!formula || formula->arch_names <= 0) |
1518 | { |
1479 | { |
1519 | book->msg = "<indecipherable text>\n"; |
1480 | book->msg = "<indecipherable text>\n"; |
1520 | new_text_name (book, 4); |
1481 | new_text_name (book, 4); |
1521 | add_author (book, 4); |
1482 | add_author (book, 4); |
1522 | |
1483 | return; |
1523 | } |
1484 | } |
|
|
1485 | |
|
|
1486 | /* looks like a formula was found. Base the amount |
|
|
1487 | * of information on the booklevel and the spellevel |
|
|
1488 | * of the formula. */ |
|
|
1489 | |
|
|
1490 | const char *op_name = formula->arch_name [rndm (formula->arch_names)]; |
|
|
1491 | archetype *at; |
|
|
1492 | |
|
|
1493 | /* preamble */ |
|
|
1494 | buf << "Herein is described a project using B<< " |
|
|
1495 | << (formula->skill ? &formula->skill : "an unknown skill") |
|
|
1496 | << " >>:\n\n"; |
|
|
1497 | |
|
|
1498 | if ((at = archetype::find (op_name))) |
|
|
1499 | op_name = at->object::name; |
1524 | else |
1500 | else |
|
|
1501 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
|
|
1502 | |
|
|
1503 | /* item name */ |
|
|
1504 | if (formula->title != shstr_NONE) |
|
|
1505 | { |
|
|
1506 | buf.printf ("The B<< %s of %s >>", op_name, &formula->title); |
|
|
1507 | /* This results in things like pile of philo. sulfur. |
|
|
1508 | * while philo. sulfur may look better, without this, |
|
|
1509 | * you get things like 'the wise' because its missing the |
|
|
1510 | * water of section. |
|
|
1511 | */ |
|
|
1512 | sprintf (title, "%s: %s of %s", |
|
|
1513 | formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); |
1525 | { |
1514 | } |
1526 | /* looks like a formula was found. Base the amount |
1515 | else |
1527 | * of information on the booklevel and the spellevel |
1516 | { |
1528 | * of the formula. */ |
1517 | buf << "The B<< " << op_name; |
1529 | |
1518 | |
1530 | const char *op_name = formula->arch_name [rndm (formula->arch_names)]; |
1519 | sprintf (title, "%s: %s", formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name); |
|
|
1520 | if (at->title) |
|
|
1521 | { |
|
|
1522 | buf << " " << at->title; |
|
|
1523 | strcat (title, " "); |
|
|
1524 | strcat (title, at->title); |
|
|
1525 | } |
|
|
1526 | |
|
|
1527 | buf << " >>"; |
|
|
1528 | } |
|
|
1529 | |
|
|
1530 | /* Lets name the book something meaningful ! */ |
|
|
1531 | book->name = title; |
|
|
1532 | book->title = NULL; |
|
|
1533 | |
|
|
1534 | /* ingredients to make it */ |
|
|
1535 | if (formula->ingred) |
|
|
1536 | { |
|
|
1537 | linked_char *next; |
1531 | archetype *at; |
1538 | archetype *at; |
1532 | |
1539 | |
1533 | /* preamble */ |
|
|
1534 | sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill"); |
|
|
1535 | |
|
|
1536 | if ((at = archetype::find (op_name)) != (archetype *) NULL) |
|
|
1537 | op_name = at->object::name; |
|
|
1538 | else |
|
|
1539 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
|
|
1540 | |
|
|
1541 | /* item name */ |
|
|
1542 | if (formula->title != shstr_NONE) |
|
|
1543 | { |
|
|
1544 | sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title); |
|
|
1545 | /* This results in things like pile of philo. sulfur. |
|
|
1546 | * while philo. sulfur may look better, without this, |
|
|
1547 | * you get things like 'the wise' because its missing the |
|
|
1548 | * water of section. |
|
|
1549 | */ |
|
|
1550 | sprintf (title, "%s: %s of %s", |
|
|
1551 | formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); |
|
|
1552 | } |
|
|
1553 | else |
|
|
1554 | { |
|
|
1555 | sprintf (retbuf, "%sThe %s", retbuf, op_name); |
|
|
1556 | sprintf (title, "%s: %s", formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name); |
|
|
1557 | if (at->title) |
|
|
1558 | { |
|
|
1559 | strcat (retbuf, " "); |
|
|
1560 | strcat (retbuf, at->title); |
|
|
1561 | strcat (title, " "); |
|
|
1562 | strcat (title, at->title); |
|
|
1563 | } |
|
|
1564 | } |
|
|
1565 | |
|
|
1566 | /* Lets name the book something meaningful ! */ |
|
|
1567 | book->name = title; |
|
|
1568 | book->title = NULL; |
|
|
1569 | |
|
|
1570 | /* ingredients to make it */ |
|
|
1571 | if (formula->ingred != NULL) |
|
|
1572 | { |
|
|
1573 | linked_char *next; |
|
|
1574 | archetype *at; |
|
|
1575 | |
|
|
1576 | at = archetype::find (formula->cauldron); |
1540 | at = archetype::find (formula->cauldron); |
1577 | |
1541 | |
1578 | sprintf (retbuf + strlen (retbuf), |
1542 | buf.printf (" may be made at %s using the following ingredients:\n\n", |
1579 | " may be made at %s using the following ingredients:\n", at ? query_name (at) : "an unknown place"); |
1543 | at ? query_name (at) : "an appropriate place"); |
1580 | |
1544 | |
1581 | for (next = formula->ingred; next != NULL; next = next->next) |
1545 | for (next = formula->ingred; next; next = next->next) |
1582 | { |
1546 | buf << next->name << '\r'; |
1583 | strcat (retbuf, next->name); |
1547 | } |
1584 | strcat (retbuf, "\n"); |
|
|
1585 | } |
|
|
1586 | } |
|
|
1587 | else |
1548 | else |
1588 | LOG (llevError, "formula_msg() no ingredient list for object %s of %s\n", op_name, &formula->title); |
1549 | LOG (llevError, "formula_msg() no ingredient list for object %s of %s\n", op_name, &formula->title); |
1589 | if (retbuf[strlen (retbuf) - 1] != '\n') |
|
|
1590 | strcat (retbuf, "\n"); |
|
|
1591 | |
1550 | |
1592 | book->msg = retbuf; |
1551 | book->msg = buf; |
1593 | } |
|
|
1594 | } |
1552 | } |
1595 | |
1553 | |
1596 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
1554 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
1597 | if(variable) { \ |
1555 | if(variable) { \ |
1598 | int i,j=0; \ |
1556 | int i,j=0; \ |
… | |
… | |
1609 | } |
1567 | } |
1610 | |
1568 | |
1611 | /* god_info_msg() - generate a message detailing the properties |
1569 | /* god_info_msg() - generate a message detailing the properties |
1612 | * of a random god. Used by the book hack. b.t. |
1570 | * of a random god. Used by the book hack. b.t. |
1613 | */ |
1571 | */ |
1614 | const char * |
1572 | static const char * |
1615 | god_info_msg (int level, int booksize) |
1573 | god_info_msg (int level, int booksize) |
1616 | { |
1574 | { |
1617 | static char retbuf[BOOK_BUF]; |
|
|
1618 | const char *name = NULL; |
1575 | const char *name = NULL; |
1619 | char buf[BOOK_BUF]; |
|
|
1620 | int i; |
|
|
1621 | size_t introlen; |
|
|
1622 | object *god = pntr_to_god_obj (get_rand_god ()); |
1576 | object *god = pntr_to_god_obj (get_rand_god ()); |
1623 | |
1577 | |
|
|
1578 | static dynbuf_text buf; buf.clear (); |
|
|
1579 | |
1624 | if (!god) |
1580 | if (!god) |
1625 | return (char *) NULL; /* oops, problems... */ |
1581 | return 0; /* oops, problems... */ |
|
|
1582 | |
1626 | name = god->name; |
1583 | name = god->name; |
1627 | |
1584 | |
1628 | /* preamble.. */ |
1585 | /* preamble.. */ |
1629 | sprintf (retbuf, "This document contains knowledge concerning\n"); |
1586 | buf << "This document contains knowledge concerning the diety B<< " |
1630 | sprintf (retbuf, "%sthe diety %s", retbuf, name); |
1587 | << name << " >>"; |
1631 | |
1588 | |
1632 | /* Always have as default information the god's descriptive terms. */ |
1589 | /* Always have as default information the god's descriptive terms. */ |
1633 | if (nstrtok (god->msg, ",") > 0) |
1590 | if (nstrtok (god->msg, ",") > 0) |
1634 | { |
1591 | buf << ", known as" << strtoktolin (god->msg, ","); |
1635 | strcat (retbuf, ", known as"); |
|
|
1636 | strcat (retbuf, strtoktolin (god->msg, ",")); |
|
|
1637 | } |
|
|
1638 | else |
1592 | else |
1639 | strcat (retbuf, "..."); |
1593 | buf << "..."; |
1640 | |
1594 | |
1641 | strcat (retbuf, "\n ---\n"); |
1595 | buf << "\n\n"; |
|
|
1596 | |
1642 | introlen = strlen (retbuf); /* so we will know if no new info is added later */ |
1597 | int introlen = buf.size (); /* so we will know if no new info is added later */ |
1643 | |
1598 | |
1644 | /* Information about the god is random, and based on the level of the |
1599 | /* Information about the god is random, and based on the level of the |
1645 | * 'book'. Probably there is a more intellegent way to implement |
1600 | * 'book'. Probably there is a more intellegent way to implement |
1646 | * this ... |
1601 | * this ... |
1647 | */ |
1602 | */ |
1648 | while (level > 0) |
1603 | while (level > 0 && buf.size () < BOOK_BUF) |
1649 | { |
1604 | { |
1650 | sprintf (buf, " "); |
|
|
1651 | if (level == 2 && rndm (2)) |
1605 | if (level == 2 && rndm (2)) |
1652 | { /* enemy god */ |
1606 | { /* enemy god */ |
1653 | const char *enemy = god->title; |
1607 | const char *enemy = god->title; |
1654 | |
1608 | |
1655 | if (enemy) |
1609 | if (enemy) |
1656 | sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); |
1610 | buf.printf ("The gods %s and %s are enemies.\r", name, enemy); |
1657 | } |
1611 | } |
1658 | |
1612 | |
1659 | if (level == 3 && rndm (2)) |
1613 | if (level == 3 && rndm (2)) |
1660 | { /* enemy race, what the god's holy word effects */ |
1614 | { /* enemy race, what the god's holy word effects */ |
1661 | const char *enemy = god->slaying; |
1615 | const char *enemy = god->slaying; |
|
|
1616 | int i; |
1662 | |
1617 | |
1663 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1618 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1664 | if ((i = nstrtok (enemy, ",")) > 0) |
1619 | if ((i = nstrtok (enemy, ",")) > 0) |
1665 | { |
1620 | { |
1666 | char tmpbuf[MAX_BUF]; |
1621 | char tmpbuf[MAX_BUF]; |
1667 | |
1622 | |
1668 | sprintf (buf, "The holy words of %s have the power to\n", name); |
1623 | buf << "The holy words of " << name |
1669 | strcat (buf, "slay creatures belonging to the "); |
1624 | << " have the power to slay creatures belonging to the "; |
|
|
1625 | |
1670 | if (i > 1) |
1626 | if (i > 1) |
1671 | sprintf (tmpbuf, "following \n races:%s", strtoktolin (enemy, ",")); |
1627 | buf << "following races:" << strtoktolin (enemy, ","); |
1672 | else |
1628 | else |
1673 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1629 | buf << "race of" << strtoktolin (enemy, ","); |
1674 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1630 | |
|
|
1631 | buf << '\r'; |
1675 | } |
1632 | } |
1676 | } |
1633 | } |
1677 | |
1634 | |
1678 | if (level == 4 && rndm (2)) |
1635 | if (level == 4 && rndm (2)) |
1679 | { /* Priest of god gets these protect,vulnerable... */ |
1636 | { /* Priest of god gets these protect,vulnerable... */ |
1680 | char tmpbuf[MAX_BUF]; |
|
|
1681 | |
|
|
1682 | if (const char *cp = describe_resistance (god, 1)) |
1637 | if (const char *cp = describe_resistance (god, 1)) |
1683 | { /* This god does have protections */ |
1638 | { /* This god does have protections */ |
1684 | sprintf (tmpbuf, "%s has a potent aura which is extended\n", name); |
1639 | buf << name |
|
|
1640 | << " has a potent aura which is extended to" |
1685 | strcat (tmpbuf, "faithful priests. The effects of this aura include:\n"); |
1641 | " faithful priests. The effects of this aura include: " |
1686 | strcat (tmpbuf, cp); |
1642 | << cp |
1687 | strcat (buf, tmpbuf); |
1643 | << ".\r"; |
1688 | strcat (buf, "\n ---\n"); |
|
|
1689 | } |
1644 | } |
1690 | else |
|
|
1691 | sprintf (buf, " "); |
|
|
1692 | } |
1645 | } |
1693 | |
1646 | |
1694 | if (level == 5 && rndm (2)) |
1647 | if (level == 5 && rndm (2)) |
1695 | { /* aligned race, summoning */ |
1648 | { /* aligned race, summoning */ |
1696 | const char *race = god->race; /* aligned race */ |
1649 | const char *race = god->race; /* aligned race */ |
|
|
1650 | int i; |
1697 | |
1651 | |
1698 | if (race && !(god->path_denied & PATH_SUMMON)) |
1652 | if (race && !(god->path_denied & PATH_SUMMON)) |
1699 | if ((i = nstrtok (race, ",")) > 0) |
1653 | if ((i = nstrtok (race, ",")) > 0) |
1700 | { |
1654 | { |
1701 | char tmpbuf[MAX_BUF]; |
1655 | buf << "Creatures sacred to " << name << " include the "; |
1702 | |
|
|
1703 | sprintf (buf, "Creatures sacred to %s include the \n", name); |
|
|
1704 | if (i > 1) |
1656 | if (i > 1) |
1705 | sprintf (tmpbuf, "following \n races:%s", strtoktolin (race, ",")); |
1657 | buf << "following races:" << strtoktolin (race, ","); |
1706 | else |
1658 | else |
1707 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1659 | buf << "race of" << strtoktolin (race, ","); |
1708 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1660 | |
|
|
1661 | buf << '\r'; |
1709 | } |
1662 | } |
1710 | } |
1663 | } |
1711 | |
1664 | |
1712 | if (level == 6 && rndm (2)) |
1665 | if (level == 6 && rndm (2)) |
1713 | { /* blessing,curse properties of the god */ |
1666 | { /* blessing,curse properties of the god */ |
1714 | char tmpbuf[MAX_BUF]; |
|
|
1715 | |
|
|
1716 | if (const char *cp = describe_resistance (god, 1)) |
1667 | if (const char *cp = describe_resistance (god, 1)) |
1717 | { /* This god does have protections */ |
1668 | { /* This god does have protections */ |
1718 | sprintf (tmpbuf, "\nThe priests of %s are known to be able to \n", name); |
1669 | buf << "The priests of " << name |
|
|
1670 | << " are known to be able to " |
1719 | strcat (tmpbuf, "bestow a blessing which makes the recipient\n"); |
1671 | "bestow a blessing which makes the recipient " |
1720 | strcat (tmpbuf, cp); |
1672 | << cp |
1721 | strcat (buf, tmpbuf); |
1673 | << '\r'; |
1722 | strcat (buf, "\n ---\n"); |
|
|
1723 | } |
1674 | } |
1724 | else |
|
|
1725 | sprintf (buf, " "); |
|
|
1726 | |
|
|
1727 | } |
1675 | } |
1728 | |
1676 | |
1729 | if (level == 8 && rndm (2)) |
1677 | if (level == 8 && rndm (2)) |
1730 | { /* immunity, holy possession */ |
1678 | { /* immunity, holy possession */ |
1731 | int has_effect = 0, tmpvar; |
1679 | buf << "The priests of " << name |
1732 | char tmpbuf[MAX_BUF]; |
1680 | << " are known to make cast a mighty" |
|
|
1681 | " prayer of possession"; |
|
|
1682 | |
|
|
1683 | int first = 1; |
1733 | |
1684 | |
1734 | sprintf (tmpbuf, "\n"); |
|
|
1735 | sprintf (tmpbuf, "The priests of %s are known to make cast a mighty \n", name); |
|
|
1736 | |
|
|
1737 | strcat (tmpbuf, "prayer of possession which gives the recipient\n"); |
|
|
1738 | |
|
|
1739 | for (tmpvar = 0; tmpvar < NROFATTACKS; tmpvar++) |
1685 | for (int i = 0; i < NROFATTACKS; i++) |
|
|
1686 | if (god->resist[i] == 100) |
1740 | { |
1687 | { |
1741 | if (god->resist[tmpvar] == 100) |
1688 | if (first) |
1742 | { |
1689 | { |
|
|
1690 | buf << " which gives the recipient"; |
1743 | has_effect = 1; |
1691 | first = 0; |
1744 | sprintf (tmpbuf + strlen (tmpbuf), "Immunity to %s", attacktype_desc[tmpvar]); |
|
|
1745 | } |
1692 | } |
|
|
1693 | else |
|
|
1694 | buf << ", "; |
|
|
1695 | |
|
|
1696 | buf << " immunity to " << attacktype_desc[i]; |
1746 | } |
1697 | } |
1747 | |
1698 | |
1748 | if (has_effect) |
1699 | buf << ".\r"; |
1749 | { |
|
|
1750 | strcat (buf, tmpbuf); |
|
|
1751 | strcat (buf, "\n ---\n"); |
|
|
1752 | } |
|
|
1753 | else |
|
|
1754 | sprintf (buf, " "); |
|
|
1755 | } |
1700 | } |
1756 | |
1701 | |
1757 | if (level == 12 && rndm (2)) |
1702 | if (level == 12 && rndm (2)) |
1758 | { /* spell paths */ |
1703 | { /* spell paths */ |
|
|
1704 | //TODO: |
1759 | int has_effect = 0, tmpvar; |
1705 | int has_effect = 0, tmpvar; |
1760 | char tmpbuf[MAX_BUF]; |
1706 | char tmpbuf[MAX_BUF]; |
1761 | |
1707 | |
1762 | sprintf (tmpbuf, "\n"); |
1708 | sprintf (tmpbuf, "\n"); |
1763 | sprintf (tmpbuf, "It is rarely known fact that the priests of %s\n", name); |
1709 | sprintf (tmpbuf, "It is rarely known fact that the priests of %s\n", name); |
… | |
… | |
1780 | has_effect = 1; |
1726 | has_effect = 1; |
1781 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1727 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1782 | } |
1728 | } |
1783 | |
1729 | |
1784 | if (has_effect) |
1730 | if (has_effect) |
1785 | { |
1731 | buf << tmpbuf << '\r'; |
1786 | strcat (buf, tmpbuf); |
|
|
1787 | strcat (buf, "\n ---\n"); |
|
|
1788 | } |
|
|
1789 | else |
1732 | else |
1790 | sprintf (buf, " "); |
1733 | buf << '\r'; |
1791 | } |
1734 | } |
1792 | |
1735 | |
1793 | /* check to be sure new buffer size dont exceed either |
|
|
1794 | * the maximum buffer size, or the 'natural' size of the |
|
|
1795 | * book... |
|
|
1796 | */ |
|
|
1797 | if (book_overflow (retbuf, buf, booksize)) |
|
|
1798 | break; |
|
|
1799 | else if (strlen (buf) > 1) |
|
|
1800 | strcat (retbuf, buf); |
|
|
1801 | |
|
|
1802 | level--; |
1736 | level--; |
1803 | } |
1737 | } |
1804 | |
1738 | |
1805 | if (strlen (retbuf) == introlen) |
1739 | if (buf.size () == introlen) |
1806 | { /* we got no information beyond the preamble! */ |
1740 | /* we got no information beyond the preamble! */ |
1807 | strcat (retbuf, " [Unfortunately the rest of the information is\n"); |
1741 | buf << "[Unfortunately the rest of the information is hopelessly garbled!]"; |
1808 | strcat (retbuf, " hopelessly garbled!]\n ---\n"); |
1742 | |
1809 | } |
|
|
1810 | #ifdef BOOK_MSG_DEBUG |
|
|
1811 | LOG (llevDebug, "\n god_info_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1812 | fprintf (logfile, " MADE THIS:\n%s", retbuf); |
|
|
1813 | #endif |
|
|
1814 | return retbuf; |
1743 | return buf; |
1815 | } |
1744 | } |
1816 | |
1745 | |
1817 | /* tailor_readable_ob()- The main routine. This chooses a random |
1746 | /* tailor_readable_ob()- The main routine. This chooses a random |
1818 | * message to put in given readable object (type==BOOK) which will |
1747 | * message to put in given readable object (type==BOOK) which will |
1819 | * be referred hereafter as a 'book'. We use the book level to de- |
1748 | * be referred hereafter as a 'book'. We use the book level to de- |
… | |
… | |
1872 | break; |
1801 | break; |
1873 | case 4: /* describe an alchemy formula */ |
1802 | case 4: /* describe an alchemy formula */ |
1874 | make_formula_book (book, level); |
1803 | make_formula_book (book, level); |
1875 | /* make_formula_book already gives title */ |
1804 | /* make_formula_book already gives title */ |
1876 | return; |
1805 | return; |
1877 | break; |
|
|
1878 | case 5: /* bits of information about a god */ |
1806 | case 5: /* bits of information about a god */ |
1879 | strcpy (msgbuf, god_info_msg (level, book_buf_size)); |
1807 | strcpy (msgbuf, god_info_msg (level, book_buf_size)); |
1880 | break; |
1808 | break; |
1881 | case 0: /* use info list in lib/ */ |
1809 | case 0: /* use info list in lib/ */ |
1882 | default: |
1810 | default: |
1883 | cfperl_make_book (book, level); |
1811 | cfperl_make_book (book, level); |
|
|
1812 | /* already gives title */ |
1884 | return; |
1813 | return; |
1885 | } |
1814 | } |
1886 | |
|
|
1887 | strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */ |
|
|
1888 | |
1815 | |
1889 | if (strlen (msgbuf) > 1) |
1816 | if (strlen (msgbuf) > 1) |
1890 | { |
1817 | { |
1891 | book->msg = msgbuf; |
1818 | book->msg = msgbuf; |
1892 | /* lets give the "book" a new name, which may be a compound word */ |
1819 | /* lets give the "book" a new name, which may be a compound word */ |
… | |
… | |
1909 | linked_char *lmsg, *nextmsg; |
1836 | linked_char *lmsg, *nextmsg; |
1910 | objectlink *monlink, *nextmon; |
1837 | objectlink *monlink, *nextmon; |
1911 | |
1838 | |
1912 | LOG (llevDebug, "freeing all book information\n"); |
1839 | LOG (llevDebug, "freeing all book information\n"); |
1913 | |
1840 | |
1914 | for (tlist = booklist; tlist != NULL; tlist = tnext) |
1841 | for (tlist = booklist; tlist; tlist = tnext) |
1915 | { |
1842 | { |
1916 | tnext = tlist->next; |
1843 | tnext = tlist->next; |
1917 | |
1844 | |
1918 | for (title1 = tlist->first_book; title1; title1 = titlenext) |
1845 | for (title1 = tlist->first_book; title1; title1 = titlenext) |
1919 | { |
1846 | { |