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 |
… | |
… | |
109 | /* these are needed for creation of a linked list of |
108 | /* these are needed for creation of a linked list of |
110 | * pointers to all (hostile) monster objects */ |
109 | * pointers to all (hostile) monster objects */ |
111 | |
110 | |
112 | static int nrofmon = 0, need_to_write_bookarchive = 0; |
111 | static int nrofmon = 0, need_to_write_bookarchive = 0; |
113 | |
112 | |
114 | |
|
|
115 | /* this is needed to keep track of status of initialisation |
|
|
116 | * of the message file */ |
|
|
117 | static int nrofmsg = 0; |
|
|
118 | |
|
|
119 | /* first_msg is the started of the linked list of messages as read from |
113 | /* first_msg is the started of the linked list of messages as read from |
120 | * the messages file |
114 | * the messages file |
121 | */ |
115 | */ |
122 | static linked_char *first_msg = NULL; |
116 | static linked_char *first_msg = NULL; |
123 | |
117 | |
124 | /* |
118 | /* |
125 | * Spellpath information |
119 | * Spellpath information |
126 | */ |
120 | */ |
127 | |
|
|
128 | static uint32 spellpathdef[NRSPELLPATHS] = { |
121 | static uint32 spellpathdef[NRSPELLPATHS] = { |
129 | PATH_PROT, |
122 | PATH_PROT, |
130 | PATH_FIRE, |
123 | PATH_FIRE, |
131 | PATH_FROST, |
124 | PATH_FROST, |
132 | PATH_ELEC, |
125 | PATH_ELEC, |
… | |
… | |
498 | /*subtype 50 */ {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_3, "readable-monument-gravestone-3"}, |
491 | /*subtype 50 */ {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_3, "readable-monument-gravestone-3"}, |
499 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_1, "readable-monument-wall-1"}, |
492 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_1, "readable-monument-wall-1"}, |
500 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_2, "readable-monument-wall-2"}, |
493 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_2, "readable-monument-wall-2"}, |
501 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_3, "readable-monument-wall-3"} |
494 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_3, "readable-monument-wall-3"} |
502 | }; |
495 | }; |
503 | int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); |
496 | static int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); |
504 | |
497 | |
505 | static int max_titles[6] = { |
498 | static int max_titles[6] = { |
506 | ((sizeof (light_book_name) / sizeof (char *)) + (sizeof (heavy_book_name) / sizeof (char *))) * (sizeof (book_author) / sizeof (char *)), |
499 | ((sizeof (light_book_name) / sizeof (char *)) + (sizeof (heavy_book_name) / sizeof (char *))) * (sizeof (book_author) / sizeof (char *)), |
507 | (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)), |
500 | (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)), |
508 | (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)), |
501 | (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)), |
… | |
… | |
570 | * (shstr.c ?), but the quantity BOOK_BUF will need to be defined. */ |
563 | * (shstr.c ?), but the quantity BOOK_BUF will need to be defined. */ |
571 | |
564 | |
572 | /* nstrtok() - simple routine to return the number of list |
565 | /* nstrtok() - simple routine to return the number of list |
573 | * items in buf1 as separated by the value of buf2 |
566 | * items in buf1 as separated by the value of buf2 |
574 | */ |
567 | */ |
575 | |
568 | static int |
576 | int |
|
|
577 | nstrtok (const char *buf1, const char *buf2) |
569 | nstrtok (const char *buf1, const char *buf2) |
578 | { |
570 | { |
579 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
571 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
580 | int number = 0; |
572 | int number = 0; |
581 | |
573 | |
… | |
… | |
594 | |
586 | |
595 | /* strtoktolin() - takes a string in buf1 and separates it into |
587 | /* strtoktolin() - takes a string in buf1 and separates it into |
596 | * a list of strings delimited by buf2. Then returns a comma |
588 | * a list of strings delimited by buf2. Then returns a comma |
597 | * separated string w/ decent punctuation. |
589 | * separated string w/ decent punctuation. |
598 | */ |
590 | */ |
599 | |
591 | static char * |
600 | char * |
|
|
601 | strtoktolin (const char *buf1, const char *buf2) |
592 | strtoktolin (const char *buf1, const char *buf2) |
602 | { |
593 | { |
603 | int maxi, i = nstrtok (buf1, buf2); |
594 | int maxi, i = nstrtok (buf1, buf2); |
604 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
595 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
605 | static char rbuf[BOOK_BUF]; |
596 | static char rbuf[BOOK_BUF]; |
… | |
… | |
620 | else |
611 | else |
621 | strcat (rbuf, "."); |
612 | strcat (rbuf, "."); |
622 | tbuf = strtok (NULL, sbuf); |
613 | tbuf = strtok (NULL, sbuf); |
623 | } |
614 | } |
624 | return (char *) rbuf; |
615 | return (char *) rbuf; |
625 | } |
|
|
626 | |
|
|
627 | int |
|
|
628 | book_overflow (const char *buf1, const char *buf2, int booksize) |
|
|
629 | { |
|
|
630 | |
|
|
631 | if (buf_overflow (buf1, buf2, BOOK_BUF - 2) /* 2 less so always room for trailing \n */ |
|
|
632 | || buf_overflow (buf1, buf2, booksize)) |
|
|
633 | return 1; |
|
|
634 | return 0; |
|
|
635 | |
|
|
636 | |
|
|
637 | } |
616 | } |
638 | |
617 | |
639 | /***************************************************************************** |
618 | /***************************************************************************** |
640 | * |
619 | * |
641 | * Start of initialisation related functions. |
620 | * Start of initialisation related functions. |
… | |
… | |
736 | } |
715 | } |
737 | |
716 | |
738 | /* init_mon_info() - creates the linked list of pointers to |
717 | /* init_mon_info() - creates the linked list of pointers to |
739 | * monster archetype objects if not called previously |
718 | * monster archetype objects if not called previously |
740 | */ |
719 | */ |
741 | |
|
|
742 | static void |
720 | static void |
743 | init_mon_info (void) |
721 | init_mon_info () |
744 | { |
722 | { |
745 | archetype *at; |
723 | archetype *at; |
746 | static int did_init_mon_info = 0; |
724 | static int did_init_mon_info = 0; |
747 | |
725 | |
748 | if (did_init_mon_info) |
726 | if (did_init_mon_info) |
749 | return; |
727 | return; |
750 | |
728 | |
751 | did_init_mon_info = 1; |
729 | did_init_mon_info = 1; |
752 | |
730 | |
753 | for_all_archetypes (at) |
731 | for_all_archetypes (at) |
754 | { |
732 | if (at->flag [FLAG_MONSTER] |
755 | if (QUERY_FLAG (at, FLAG_MONSTER) && (!QUERY_FLAG (at, FLAG_CHANGING) || QUERY_FLAG (at, FLAG_UNAGGRESSIVE))) |
733 | && at->is_head () |
|
|
734 | && (!at->flag [FLAG_CHANGING] || at->flag [FLAG_UNAGGRESSIVE])) |
756 | { |
735 | { |
757 | objectlink *mon = new objectlink; |
736 | objectlink *mon = new objectlink; |
758 | |
737 | |
759 | mon->ob = at; |
738 | mon->ob = at; |
760 | mon->next = first_mon_info; |
739 | mon->next = first_mon_info; |
761 | first_mon_info = mon; |
740 | first_mon_info = mon; |
762 | nrofmon++; |
741 | nrofmon++; |
763 | } |
742 | } |
764 | } |
|
|
765 | |
743 | |
766 | LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); |
744 | LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); |
767 | } |
745 | } |
768 | |
746 | |
769 | /* init_readable() - initialise linked lists utilized by |
747 | /* init_readable() - initialise linked lists utilized by |
… | |
… | |
830 | * handled directly in change_book_name(). Names are based on text |
808 | * handled directly in change_book_name(). Names are based on text |
831 | * msgtype |
809 | * msgtype |
832 | * this sets book book->name based on msgtype given. What name |
810 | * this sets book book->name based on msgtype given. What name |
833 | * is given is based on various criteria |
811 | * is given is based on various criteria |
834 | */ |
812 | */ |
835 | |
|
|
836 | static void |
813 | static void |
837 | new_text_name (object *book, int msgtype) |
814 | new_text_name (object *book, int msgtype) |
838 | { |
815 | { |
839 | int nbr; |
816 | int nbr; |
840 | char name[MAX_BUF]; |
817 | char name[MAX_BUF]; |
… | |
… | |
992 | * levels and architypes. -b.t. |
969 | * levels and architypes. -b.t. |
993 | */ |
970 | */ |
994 | |
971 | |
995 | #define MAX_TITLE_CHECK 20 |
972 | #define MAX_TITLE_CHECK 20 |
996 | |
973 | |
997 | void |
974 | static void |
998 | change_book (object *book, int msgtype) |
975 | change_book (object *book, int msgtype) |
999 | { |
976 | { |
1000 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
977 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1001 | |
978 | |
1002 | switch (book->type) |
979 | switch (book->type) |
… | |
… | |
1126 | * list of all monsters in the current game. If level is non-zero, |
1103 | * list of all monsters in the current game. If level is non-zero, |
1127 | * then only monsters greater than that level will be returned. |
1104 | * then only monsters greater than that level will be returned. |
1128 | * Changed 971225 to be greater than equal to level passed. Also |
1105 | * Changed 971225 to be greater than equal to level passed. Also |
1129 | * made choosing by level more random. |
1106 | * made choosing by level more random. |
1130 | */ |
1107 | */ |
1131 | |
|
|
1132 | object * |
1108 | object * |
1133 | get_random_mon (int level) |
1109 | get_random_mon (int level) |
1134 | { |
1110 | { |
1135 | objectlink *mon = first_mon_info; |
1111 | objectlink *mon = first_mon_info; |
1136 | int i = 0, monnr; |
1112 | int i = 0, monnr; |
… | |
… | |
1194 | |
1170 | |
1195 | /* |
1171 | /* |
1196 | * Returns a description of the monster. This really needs to be |
1172 | * Returns a description of the monster. This really needs to be |
1197 | * redone, as describe_item really gives a pretty internal description. |
1173 | * redone, as describe_item really gives a pretty internal description. |
1198 | */ |
1174 | */ |
1199 | |
1175 | static const char * |
1200 | char * |
|
|
1201 | mon_desc (const object *mon) |
1176 | mon_desc (const object *mon) |
1202 | { |
1177 | { |
1203 | static char retbuf[HUGE_BUF]; |
1178 | static dynbuf_text buf; buf.clear (); |
1204 | |
1179 | |
1205 | sprintf (retbuf, " *** %s ***\n", &mon->name); |
1180 | buf.printf ("B<< %s >>\r", &mon->name); |
1206 | strcat (retbuf, describe_item (mon, NULL)); |
1181 | buf << describe_item (mon, 0); |
1207 | |
1182 | |
1208 | return retbuf; |
1183 | return buf; |
1209 | } |
1184 | } |
1210 | |
1185 | |
1211 | |
1186 | |
1212 | /* This function returns the next monsters after 'tmp'. If no match is |
1187 | /* This function returns the next monsters after 'tmp'. If no match is |
1213 | * found, it returns NULL (changed 0.94.3 to do this, since the |
1188 | * found, it returns NULL (changed 0.94.3 to do this, since the |
1214 | * calling function (mon_info_msg) seems to expect that. |
1189 | * calling function (mon_info_msg) seems to expect that. |
1215 | */ |
1190 | */ |
1216 | |
1191 | static object * |
1217 | object * |
|
|
1218 | get_next_mon (object *tmp) |
1192 | get_next_mon (object *tmp) |
1219 | { |
1193 | { |
1220 | objectlink *mon; |
1194 | objectlink *mon; |
1221 | |
1195 | |
1222 | for (mon = first_mon_info; mon; mon = mon->next) |
1196 | for (mon = first_mon_info; mon; mon = mon->next) |
… | |
… | |
1224 | break; |
1198 | break; |
1225 | |
1199 | |
1226 | /* didn't find a match */ |
1200 | /* didn't find a match */ |
1227 | if (!mon) |
1201 | if (!mon) |
1228 | return NULL; |
1202 | return NULL; |
|
|
1203 | |
1229 | if (mon->next) |
1204 | if (mon->next) |
1230 | return mon->next->ob; |
1205 | return mon->next->ob; |
1231 | else |
1206 | else |
1232 | return first_mon_info->ob; |
1207 | return first_mon_info->ob; |
1233 | |
1208 | |
1234 | } |
1209 | } |
1235 | |
1210 | |
1236 | |
|
|
1237 | |
|
|
1238 | /* mon_info_msg() - generate a message detailing the properties |
1211 | /* mon_info_msg() - generate a message detailing the properties |
1239 | * of a randomly selected monster. |
1212 | * of a randomly selected monster. |
1240 | */ |
1213 | */ |
1241 | |
1214 | static const char * |
1242 | char * |
|
|
1243 | mon_info_msg (int level, int booksize) |
1215 | mon_info_msg (int level) |
1244 | { |
1216 | { |
1245 | static char retbuf[BOOK_BUF]; |
1217 | static dynbuf_text buf; buf.clear (); |
1246 | char tmpbuf[HUGE_BUF]; |
|
|
1247 | object *tmp; |
|
|
1248 | |
1218 | |
1249 | /*preamble */ |
1219 | /*preamble */ |
1250 | strcpy (retbuf, "This beastiary contains:"); |
1220 | buf << "This beastiary contains:\n"; |
1251 | |
1221 | |
1252 | /* lets print info on as many monsters as will fit in our |
1222 | /* lets print info on as many monsters as will fit in our |
1253 | * document. |
1223 | * document. |
1254 | * 8-96 Had to change this a bit, otherwise there would |
1224 | * 8-96 Had to change this a bit, otherwise there would |
1255 | * have been an impossibly large number of combinations |
1225 | * have been an impossibly large number of combinations |
1256 | * of text! (and flood out the available number of titles |
1226 | * of text! (and flood out the available number of titles |
1257 | * in the archive in a snap!) -b.t. |
1227 | * in the archive in a snap!) -b.t. |
1258 | */ |
1228 | */ |
1259 | tmp = get_random_mon (level * 3); |
1229 | object *tmp = get_random_mon (level * 3); |
1260 | while (tmp) |
1230 | while (tmp && buf.size () < BOOK_BUF) |
1261 | { |
1231 | { |
1262 | /* monster description */ |
1232 | /* monster description */ |
1263 | sprintf (tmpbuf, "\n---\n%s", mon_desc (tmp)); |
1233 | buf.printf ("\n%s\n", mon_desc (tmp)); |
1264 | |
|
|
1265 | if (!book_overflow (retbuf, tmpbuf, booksize)) |
|
|
1266 | strcat (retbuf, tmpbuf); |
|
|
1267 | else |
|
|
1268 | break; |
|
|
1269 | |
1234 | |
1270 | /* Note that the value this returns is not based on level */ |
1235 | /* Note that the value this returns is not based on level */ |
1271 | tmp = get_next_mon (tmp); |
1236 | tmp = get_next_mon (tmp); |
1272 | } |
1237 | } |
1273 | |
1238 | |
1274 | #ifdef BOOK_MSG_DEBUG |
|
|
1275 | LOG (llevDebug, "\n mon_info_msg() created string: %d\n", strlen (retbuf)); |
|
|
1276 | LOG (llevDebug, " MADE THIS:\n%s\n", retbuf); |
|
|
1277 | #endif |
|
|
1278 | |
|
|
1279 | return retbuf; |
1239 | return buf; |
1280 | } |
1240 | } |
1281 | |
1241 | |
1282 | |
1242 | |
1283 | /***************************************************************************** |
1243 | /***************************************************************************** |
1284 | * Artifact msg generation code. |
1244 | * Artifact msg generation code. |
1285 | ****************************************************************************/ |
1245 | ****************************************************************************/ |
1286 | |
1246 | |
1287 | /* artifact_msg() - generate a message detailing the properties |
1247 | /* artifact_msg() - generate a message detailing the properties |
1288 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1248 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1289 | */ |
1249 | */ |
1290 | const char * |
1250 | static const char * |
1291 | artifact_msg (int level, int booksize) |
1251 | artifact_msg (int level) |
1292 | { |
1252 | { |
1293 | artifactlist *al = NULL; |
1253 | artifactlist *al = NULL; |
1294 | artifact *art; |
1254 | artifact *art; |
1295 | int chance, i, type, index; |
1255 | int chance, i, type, index; |
1296 | int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1; |
1256 | int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1; |
1297 | const char *ch; |
1257 | const char *ch; |
1298 | char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1258 | char name[MAX_BUF]; |
1299 | static char retbuf[BOOK_BUF]; |
|
|
1300 | object *tmp = NULL; |
1259 | object *tmp = NULL; |
|
|
1260 | |
|
|
1261 | static dynbuf_text buf; buf.clear (); |
1301 | |
1262 | |
1302 | /* values greater than 5 create msg buffers that are too big! */ |
1263 | /* values greater than 5 create msg buffers that are too big! */ |
1303 | if (book_entries > 5) |
1264 | if (book_entries > 5) |
1304 | book_entries = 5; |
1265 | book_entries = 5; |
1305 | |
1266 | |
… | |
… | |
1334 | |
1295 | |
1335 | /* the base 'generic' name for our artifact */ |
1296 | /* the base 'generic' name for our artifact */ |
1336 | assign (name, art_name_array[index].name); |
1297 | assign (name, art_name_array[index].name); |
1337 | |
1298 | |
1338 | /* Ok, lets print out the contents */ |
1299 | /* Ok, lets print out the contents */ |
1339 | sprintf (retbuf, "Herein %s detailed %s...\n", book_entries > 1 ? "are" : "is", book_entries > 1 ? "some artifacts" : "an artifact"); |
1300 | buf.printf ("Herein %s detailed %s...\n", |
|
|
1301 | book_entries > 1 ? "are" : "is", |
|
|
1302 | book_entries > 1 ? "some artifacts" : "an artifact"); |
1340 | |
1303 | |
1341 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1304 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1342 | * as long as we have space up to the allowed max # (book_entires) |
1305 | * as long as we have space up to the allowed max # (book_entires) |
1343 | */ |
1306 | */ |
1344 | while (book_entries > 0) |
1307 | while (book_entries > 0 && buf.size () < BOOK_BUF) |
1345 | { |
1308 | { |
1346 | |
1309 | |
1347 | if (art == NULL) |
1310 | if (!art) |
1348 | art = al->items; |
1311 | art = al->items; |
1349 | |
1312 | |
1350 | /* separator of items */ |
1313 | buf << '\n'; |
1351 | strcpy (buf, "--- \n"); |
|
|
1352 | |
1314 | |
1353 | /* Name */ |
1315 | /* Name */ |
1354 | if (art->allowed && art->allowed->name != shstr_All) |
1316 | if (art->allowed && art->allowed->name != shstr_All) |
1355 | { |
1317 | { |
1356 | linked_char *temp, *next = art->allowed; |
1318 | linked_char *temp, *next = art->allowed; |
… | |
… | |
1359 | { |
1321 | { |
1360 | temp = next; |
1322 | temp = next; |
1361 | next = next->next; |
1323 | next = next->next; |
1362 | } |
1324 | } |
1363 | while (next && rndm (2)); |
1325 | while (next && rndm (2)); |
|
|
1326 | |
1364 | sprintf (buf, "%s A %s of %s", buf, &temp->name, &art->item->name); |
1327 | buf.printf ("A B<< %s of %s >>", &temp->name, &art->item->name); |
1365 | } |
1328 | } |
1366 | else /* default name is used */ |
1329 | else /* default name is used */ |
1367 | sprintf (buf, "%s The %s of %s", buf, name, &art->item->name); |
1330 | buf.printf ("The B<< %s of %s >>", name, &art->item->name); |
|
|
1331 | |
|
|
1332 | buf << " is "; |
1368 | |
1333 | |
1369 | /* chance of finding */ |
1334 | /* chance of finding */ |
1370 | chance = (int) (100 * ((float) art->chance / al->total_chance)); |
1335 | chance = (int) (100 * ((float) art->chance / al->total_chance)); |
1371 | if (chance >= 20) |
1336 | if (chance >= 20) |
1372 | sprintf (sbuf, "an uncommon"); |
1337 | buf << "an uncommon"; |
1373 | else if (chance >= 10) |
1338 | else if (chance >= 10) |
1374 | sprintf (sbuf, "an unusual"); |
1339 | buf << "an unusual"; |
1375 | else if (chance >= 5) |
1340 | else if (chance >= 5) |
1376 | sprintf (sbuf, "a rare"); |
1341 | buf << "a rare"; |
1377 | else |
1342 | else |
1378 | sprintf (sbuf, "a very rare"); |
1343 | buf << "a very rare"; |
1379 | sprintf (buf, "%s is %s\n", buf, sbuf); |
|
|
1380 | |
1344 | |
1381 | /* value of artifact */ |
1345 | /* value of artifact */ |
1382 | sprintf (buf, "%s item with a value that is %d times normal.\n", buf, art->item->value); |
1346 | buf << " item with a value that is " << art->item->value << " times normal.\n"; |
1383 | |
1347 | |
1384 | /* include the message about the artifact, if exists, and book |
1348 | /* include the message about the artifact, if exists, and book |
1385 | * level is kinda high */ |
1349 | * level is kinda high */ |
1386 | if (art->item->msg |
1350 | if (art->item->msg |
1387 | && rndm (4) + 1 < level |
1351 | && rndm (4) + 1 < level) |
1388 | && !(strlen (art->item->msg) + strlen (buf) > BOOK_BUF)) |
|
|
1389 | strcat (buf, art->item->msg); |
1352 | buf << art->item->msg; |
1390 | |
1353 | |
1391 | /* properties of the artifact */ |
1354 | /* properties of the artifact */ |
1392 | tmp = object::create (); |
1355 | tmp = object::create (); |
1393 | add_abilities (tmp, art->item); |
1356 | add_abilities (tmp, art->item); |
1394 | tmp->type = type; |
1357 | tmp->type = type; |
1395 | SET_FLAG (tmp, FLAG_IDENTIFIED); |
1358 | SET_FLAG (tmp, FLAG_IDENTIFIED); |
1396 | if ((ch = describe_item (tmp, NULL)) != NULL && strlen (ch) > 1) |
1359 | if ((ch = describe_item (tmp, 0)) && strlen (ch) > 1) |
1397 | sprintf (buf, "%s Properties of this artifact include: \n %s \n", buf, ch); |
1360 | buf << "\rProperties of this artifact include:\r" << ch << "\n"; |
|
|
1361 | |
1398 | tmp->destroy (); |
1362 | tmp->destroy (); |
1399 | /* add the buf if it will fit */ |
|
|
1400 | if (!book_overflow (retbuf, buf, booksize)) |
|
|
1401 | strcat (retbuf, buf); |
|
|
1402 | else |
|
|
1403 | break; |
|
|
1404 | |
1363 | |
1405 | art = art->next; |
1364 | art = art->next; |
1406 | book_entries--; |
1365 | book_entries--; |
1407 | } |
1366 | } |
1408 | |
1367 | |
1409 | #ifdef BOOK_MSG_DEBUG |
|
|
1410 | LOG (llevDebug, "artifact_msg() created string: %d\n", strlen (retbuf)); |
|
|
1411 | LOG (llevDebug, " MADE THIS:\n%s", retbuf); |
|
|
1412 | #endif |
|
|
1413 | return retbuf; |
1368 | return buf; |
1414 | } |
1369 | } |
1415 | |
1370 | |
1416 | /***************************************************************************** |
1371 | /***************************************************************************** |
1417 | * Spellpath message generation |
1372 | * Spellpath message generation |
1418 | *****************************************************************************/ |
1373 | *****************************************************************************/ |
1419 | |
1374 | |
1420 | /* spellpath_msg() - generate a message detailing the member |
1375 | /* spellpath_msg() - generate a message detailing the member |
1421 | * incantations/prayers (and some of their properties) belonging to |
1376 | * incantations/prayers (and some of their properties) belonging to |
1422 | * a given spellpath. |
1377 | * a given spellpath. |
1423 | */ |
1378 | */ |
1424 | |
1379 | static char * |
1425 | char * |
|
|
1426 | spellpath_msg (int level, int booksize) |
1380 | spellpath_msg (int level) |
1427 | { |
1381 | { |
|
|
1382 | static dynbuf_text buf; buf.clear (); |
|
|
1383 | |
1428 | static char retbuf[BOOK_BUF]; |
1384 | static char retbuf[BOOK_BUF]; |
1429 | char tmpbuf[BOOK_BUF]; |
1385 | char tmpbuf[BOOK_BUF]; |
1430 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
1386 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
1431 | int did_first_sp = 0; |
|
|
1432 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1387 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1433 | archetype *at; |
1388 | archetype *at; |
1434 | |
1389 | |
1435 | /* Preamble */ |
1390 | /* Preamble */ |
1436 | sprintf (retbuf, "Herein are detailed the names of %s\n", prayers ? "prayers" : "incantations"); |
1391 | buf << "Herein are detailed the names of " |
|
|
1392 | << (prayers ? "prayers" : "incantations"); |
1437 | |
1393 | |
1438 | if (path == -1) |
1394 | if (path == -1) |
1439 | strcat (retbuf, "having no known spell path.\n"); |
1395 | buf << " having no known spell path.\n"; |
1440 | else |
1396 | else |
1441 | sprintf (retbuf, "%sbelonging to the path of %s:\n", retbuf, spellpathnames[path]); |
1397 | buf << " belonging to the path of B<< " << spellpathnames[path] << " >>:\n\n"; |
|
|
1398 | |
|
|
1399 | int seen = 0; |
1442 | |
1400 | |
1443 | for_all_archetypes (at) |
1401 | for_all_archetypes (at) |
1444 | { |
|
|
1445 | /* Determine if this is an appropriate spell. Must |
1402 | /* Determine if this is an appropriate spell. Must |
1446 | * be of matching path, must be of appropriate type (prayer |
1403 | * be of matching path, must be of appropriate type (prayer |
1447 | * or not), and must be within the valid level range. |
1404 | * or not), and must be within the valid level range. |
1448 | */ |
1405 | */ |
1449 | if (at->type == SPELL && at->path_attuned & pnum && |
1406 | if (at->type == SPELL && at->path_attuned & pnum && |
1450 | ((at->stats.grace && prayers) || (at->stats.sp && !prayers)) && (at->level < (level * 8))) |
1407 | ((at->stats.grace && prayers) || (at->stats.sp && !prayers)) && (at->level < (level * 8))) |
1451 | { |
1408 | { |
1452 | assign (tmpbuf, at->object::name); |
1409 | seen = 1; |
1453 | |
1410 | buf << at->object::name << '\r'; |
1454 | if (book_overflow (retbuf, tmpbuf, booksize)) |
|
|
1455 | break; |
|
|
1456 | else |
|
|
1457 | { |
|
|
1458 | if (did_first_sp) |
|
|
1459 | strcat (retbuf, ",\n"); |
|
|
1460 | did_first_sp = 1; |
|
|
1461 | strcat (retbuf, tmpbuf); |
|
|
1462 | } |
|
|
1463 | } |
1411 | } |
1464 | } |
1412 | |
1465 | /* Geez, no spells were generated. */ |
1413 | /* Geez, no spells were generated. */ |
1466 | if (!did_first_sp) |
1414 | if (!seen) |
1467 | { |
|
|
1468 | if (rndm (4)) /* usually, lets make a recursive call... */ |
1415 | if (rndm (4)) /* usually, lets make a recursive call... */ |
1469 | spellpath_msg (level, booksize); |
1416 | return spellpath_msg (level); |
1470 | else /* give up, cause knowing no spells exist for path is info too. */ |
1417 | else /* give up, cause knowing no spells exist for path is info too. */ |
1471 | strcat (retbuf, "\n - no known spells exist -\n"); |
1418 | buf << "- no known spells exist.\n"; |
1472 | } |
|
|
1473 | else |
|
|
1474 | { |
|
|
1475 | strcat (retbuf, "\n"); |
|
|
1476 | } |
|
|
1477 | |
1419 | |
1478 | #ifdef BOOK_MSG_DEBUG |
|
|
1479 | LOG (llevDebug, "spellpath_msg() created string: %d\n", strlen (retbuf)); |
|
|
1480 | LOG (llevDebug, " MADE THIS:\n%s", retbuf); |
|
|
1481 | #endif |
|
|
1482 | return retbuf; |
1420 | return buf; |
1483 | } |
1421 | } |
1484 | |
1422 | |
1485 | /* formula_msg() - generate a message detailing the properties |
1423 | /* formula_msg() - generate a message detailing the properties |
1486 | * of a randomly selected alchemical formula. |
1424 | * of a randomly selected alchemical formula. |
1487 | */ |
1425 | */ |
1488 | void |
1426 | static void |
1489 | make_formula_book (object *book, int level) |
1427 | make_formula_book (object *book, int level) |
1490 | { |
1428 | { |
1491 | char retbuf[BOOK_BUF], title[MAX_BUF]; |
1429 | char title[MAX_BUF]; |
1492 | recipelist *fl; |
1430 | recipelist *fl; |
1493 | recipe *formula = NULL; |
1431 | recipe *formula = NULL; |
1494 | int chance; |
1432 | int chance; |
|
|
1433 | |
|
|
1434 | static dynbuf_text buf; buf.clear (); |
1495 | |
1435 | |
1496 | /* the higher the book level, the more complex (ie number of |
1436 | /* the higher the book level, the more complex (ie number of |
1497 | * ingredients) the formula can be. |
1437 | * ingredients) the formula can be. |
1498 | */ |
1438 | */ |
1499 | fl = get_formulalist (rndm (level) / 3 + 1); |
1439 | fl = get_formulalist (rndm (level) / 3 + 1); |
… | |
… | |
1512 | /* get a random formula, weighted by its bookchance */ |
1452 | /* get a random formula, weighted by its bookchance */ |
1513 | chance = rndm (fl->total_chance); |
1453 | chance = rndm (fl->total_chance); |
1514 | for (formula = fl->items; formula; formula = formula->next) |
1454 | for (formula = fl->items; formula; formula = formula->next) |
1515 | { |
1455 | { |
1516 | chance -= formula->chance; |
1456 | chance -= formula->chance; |
|
|
1457 | |
1517 | if (chance <= 0) |
1458 | if (chance <= 0) |
1518 | break; |
1459 | break; |
1519 | } |
1460 | } |
1520 | |
1461 | |
1521 | if (!formula || formula->arch_names <= 0) |
1462 | if (!formula || formula->arch_names <= 0) |
1522 | { |
1463 | { |
1523 | book->msg = "<indecipherable text>\n"; |
1464 | book->msg = "<indecipherable text>\n"; |
1524 | new_text_name (book, 4); |
1465 | new_text_name (book, 4); |
1525 | add_author (book, 4); |
1466 | add_author (book, 4); |
1526 | |
1467 | return; |
1527 | } |
1468 | } |
|
|
1469 | |
|
|
1470 | /* looks like a formula was found. Base the amount |
|
|
1471 | * of information on the booklevel and the spellevel |
|
|
1472 | * of the formula. */ |
|
|
1473 | |
|
|
1474 | const char *op_name = formula->arch_name [rndm (formula->arch_names)]; |
|
|
1475 | archetype *at; |
|
|
1476 | |
|
|
1477 | /* preamble */ |
|
|
1478 | buf << "Herein is described a project using B<< " |
|
|
1479 | << (formula->skill ? &formula->skill : "an unknown skill") |
|
|
1480 | << " >>:\n\n"; |
|
|
1481 | |
|
|
1482 | if ((at = archetype::find (op_name))) |
|
|
1483 | op_name = at->object::name; |
1528 | else |
1484 | else |
|
|
1485 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
|
|
1486 | |
|
|
1487 | /* item name */ |
|
|
1488 | if (formula->title != shstr_NONE) |
|
|
1489 | { |
|
|
1490 | buf.printf ("The B<< %s of %s >>", op_name, &formula->title); |
|
|
1491 | /* This results in things like pile of philo. sulfur. |
|
|
1492 | * while philo. sulfur may look better, without this, |
|
|
1493 | * you get things like 'the wise' because its missing the |
|
|
1494 | * water of section. |
|
|
1495 | */ |
|
|
1496 | sprintf (title, "%s: %s of %s", |
|
|
1497 | formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); |
1529 | { |
1498 | } |
1530 | /* looks like a formula was found. Base the amount |
1499 | else |
1531 | * of information on the booklevel and the spellevel |
1500 | { |
1532 | * of the formula. */ |
1501 | buf << "The B<< " << op_name; |
1533 | |
1502 | |
1534 | const char *op_name = formula->arch_name [rndm (formula->arch_names)]; |
1503 | sprintf (title, "%s: %s", formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name); |
|
|
1504 | if (at->title) |
|
|
1505 | { |
|
|
1506 | buf << " " << at->title; |
|
|
1507 | strcat (title, " "); |
|
|
1508 | strcat (title, at->title); |
|
|
1509 | } |
|
|
1510 | |
|
|
1511 | buf << " >>"; |
|
|
1512 | } |
|
|
1513 | |
|
|
1514 | /* Lets name the book something meaningful ! */ |
|
|
1515 | book->name = title; |
|
|
1516 | book->title = NULL; |
|
|
1517 | |
|
|
1518 | /* ingredients to make it */ |
|
|
1519 | if (formula->ingred) |
|
|
1520 | { |
|
|
1521 | linked_char *next; |
1535 | archetype *at; |
1522 | archetype *at; |
1536 | |
1523 | |
1537 | /* preamble */ |
|
|
1538 | sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill"); |
|
|
1539 | |
|
|
1540 | if ((at = archetype::find (op_name)) != (archetype *) NULL) |
|
|
1541 | op_name = at->object::name; |
|
|
1542 | else |
|
|
1543 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
|
|
1544 | |
|
|
1545 | /* item name */ |
|
|
1546 | if (formula->title != shstr_NONE) |
|
|
1547 | { |
|
|
1548 | sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title); |
|
|
1549 | /* This results in things like pile of philo. sulfur. |
|
|
1550 | * while philo. sulfur may look better, without this, |
|
|
1551 | * you get things like 'the wise' because its missing the |
|
|
1552 | * water of section. |
|
|
1553 | */ |
|
|
1554 | sprintf (title, "%s: %s of %s", |
|
|
1555 | formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); |
|
|
1556 | } |
|
|
1557 | else |
|
|
1558 | { |
|
|
1559 | sprintf (retbuf, "%sThe %s", retbuf, op_name); |
|
|
1560 | sprintf (title, "%s: %s", formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name); |
|
|
1561 | if (at->title) |
|
|
1562 | { |
|
|
1563 | strcat (retbuf, " "); |
|
|
1564 | strcat (retbuf, at->title); |
|
|
1565 | strcat (title, " "); |
|
|
1566 | strcat (title, at->title); |
|
|
1567 | } |
|
|
1568 | } |
|
|
1569 | |
|
|
1570 | /* Lets name the book something meaningful ! */ |
|
|
1571 | book->name = title; |
|
|
1572 | book->title = NULL; |
|
|
1573 | |
|
|
1574 | /* ingredients to make it */ |
|
|
1575 | if (formula->ingred != NULL) |
|
|
1576 | { |
|
|
1577 | linked_char *next; |
|
|
1578 | archetype *at; |
|
|
1579 | |
|
|
1580 | at = archetype::find (formula->cauldron); |
1524 | at = archetype::find (formula->cauldron); |
1581 | |
1525 | |
1582 | sprintf (retbuf + strlen (retbuf), |
1526 | buf.printf (" may be made at %s using the following ingredients:\n\n", |
1583 | " may be made at %s using the following ingredients:\n", at ? query_name (at) : "an unknown place"); |
1527 | at ? query_name (at) : "an appropriate place"); |
1584 | |
1528 | |
1585 | for (next = formula->ingred; next != NULL; next = next->next) |
1529 | for (next = formula->ingred; next; next = next->next) |
1586 | { |
1530 | buf << next->name << '\r'; |
1587 | strcat (retbuf, next->name); |
1531 | } |
1588 | strcat (retbuf, "\n"); |
|
|
1589 | } |
|
|
1590 | } |
|
|
1591 | else |
1532 | else |
1592 | LOG (llevError, "formula_msg() no ingredient list for object %s of %s\n", op_name, &formula->title); |
1533 | LOG (llevError, "formula_msg() no ingredient list for object %s of %s\n", op_name, &formula->title); |
1593 | if (retbuf[strlen (retbuf) - 1] != '\n') |
|
|
1594 | strcat (retbuf, "\n"); |
|
|
1595 | |
1534 | |
1596 | book->msg = retbuf; |
1535 | book->msg = buf; |
1597 | } |
|
|
1598 | } |
1536 | } |
1599 | |
1537 | |
1600 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
1538 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
1601 | if(variable) { \ |
1539 | if(variable) { \ |
1602 | int i,j=0; \ |
1540 | int i,j=0; \ |
… | |
… | |
1613 | } |
1551 | } |
1614 | |
1552 | |
1615 | /* god_info_msg() - generate a message detailing the properties |
1553 | /* god_info_msg() - generate a message detailing the properties |
1616 | * of a random god. Used by the book hack. b.t. |
1554 | * of a random god. Used by the book hack. b.t. |
1617 | */ |
1555 | */ |
1618 | const char * |
1556 | static const char * |
1619 | god_info_msg (int level, int booksize) |
1557 | god_info_msg (int level) |
1620 | { |
1558 | { |
1621 | static char retbuf[BOOK_BUF]; |
|
|
1622 | const char *name = NULL; |
1559 | const char *name = NULL; |
1623 | char buf[BOOK_BUF]; |
|
|
1624 | int i; |
|
|
1625 | size_t introlen; |
|
|
1626 | object *god = pntr_to_god_obj (get_rand_god ()); |
1560 | object *god = pntr_to_god_obj (get_rand_god ()); |
1627 | |
1561 | |
|
|
1562 | static dynbuf_text buf; buf.clear (); |
|
|
1563 | |
1628 | if (!god) |
1564 | if (!god) |
1629 | return (char *) NULL; /* oops, problems... */ |
1565 | return 0; /* oops, problems... */ |
|
|
1566 | |
1630 | name = god->name; |
1567 | name = god->name; |
1631 | |
1568 | |
1632 | /* preamble.. */ |
1569 | /* preamble.. */ |
1633 | sprintf (retbuf, "This document contains knowledge concerning\n"); |
1570 | buf << "This document contains knowledge concerning the diety B<< " |
1634 | sprintf (retbuf, "%sthe diety %s", retbuf, name); |
1571 | << name << " >>"; |
1635 | |
1572 | |
1636 | /* Always have as default information the god's descriptive terms. */ |
1573 | /* Always have as default information the god's descriptive terms. */ |
1637 | if (nstrtok (god->msg, ",") > 0) |
1574 | if (nstrtok (god->msg, ",") > 0) |
1638 | { |
1575 | buf << ", known as" << strtoktolin (god->msg, ","); |
1639 | strcat (retbuf, ", known as"); |
|
|
1640 | strcat (retbuf, strtoktolin (god->msg, ",")); |
|
|
1641 | } |
|
|
1642 | else |
1576 | else |
1643 | strcat (retbuf, "..."); |
1577 | buf << "..."; |
1644 | |
1578 | |
1645 | strcat (retbuf, "\n ---\n"); |
1579 | buf << "\n\n"; |
|
|
1580 | |
1646 | introlen = strlen (retbuf); /* so we will know if no new info is added later */ |
1581 | int introlen = buf.size (); /* so we will know if no new info is added later */ |
1647 | |
1582 | |
1648 | /* Information about the god is random, and based on the level of the |
1583 | /* Information about the god is random, and based on the level of the |
1649 | * 'book'. Probably there is a more intellegent way to implement |
1584 | * 'book'. Probably there is a more intellegent way to implement |
1650 | * this ... |
1585 | * this ... |
1651 | */ |
1586 | */ |
1652 | while (level > 0) |
1587 | while (level > 0 && buf.size () < BOOK_BUF) |
1653 | { |
1588 | { |
1654 | sprintf (buf, " "); |
|
|
1655 | if (level == 2 && rndm (2)) |
1589 | if (level == 2 && rndm (2)) |
1656 | { /* enemy god */ |
1590 | { /* enemy god */ |
1657 | const char *enemy = god->title; |
1591 | const char *enemy = god->title; |
1658 | |
1592 | |
1659 | if (enemy) |
1593 | if (enemy) |
1660 | sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); |
1594 | buf.printf ("The gods %s and %s are enemies.\r", name, enemy); |
1661 | } |
1595 | } |
1662 | |
1596 | |
1663 | if (level == 3 && rndm (2)) |
1597 | if (level == 3 && rndm (2)) |
1664 | { /* enemy race, what the god's holy word effects */ |
1598 | { /* enemy race, what the god's holy word effects */ |
1665 | const char *enemy = god->slaying; |
1599 | const char *enemy = god->slaying; |
|
|
1600 | int i; |
1666 | |
1601 | |
1667 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1602 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1668 | if ((i = nstrtok (enemy, ",")) > 0) |
1603 | if ((i = nstrtok (enemy, ",")) > 0) |
1669 | { |
1604 | { |
1670 | char tmpbuf[MAX_BUF]; |
1605 | char tmpbuf[MAX_BUF]; |
1671 | |
1606 | |
1672 | sprintf (buf, "The holy words of %s have the power to\n", name); |
1607 | buf << "The holy words of " << name |
1673 | strcat (buf, "slay creatures belonging to the "); |
1608 | << " have the power to slay creatures belonging to the "; |
|
|
1609 | |
1674 | if (i > 1) |
1610 | if (i > 1) |
1675 | sprintf (tmpbuf, "following \n races:%s", strtoktolin (enemy, ",")); |
1611 | buf << "following races:" << strtoktolin (enemy, ","); |
1676 | else |
1612 | else |
1677 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1613 | buf << "race of" << strtoktolin (enemy, ","); |
1678 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1614 | |
|
|
1615 | buf << '\r'; |
1679 | } |
1616 | } |
1680 | } |
1617 | } |
1681 | |
1618 | |
1682 | if (level == 4 && rndm (2)) |
1619 | if (level == 4 && rndm (2)) |
1683 | { /* Priest of god gets these protect,vulnerable... */ |
1620 | { /* Priest of god gets these protect,vulnerable... */ |
1684 | char tmpbuf[MAX_BUF]; |
|
|
1685 | |
|
|
1686 | if (const char *cp = describe_resistance (god, 1)) |
1621 | if (const char *cp = describe_resistance (god, 1)) |
1687 | { /* This god does have protections */ |
1622 | { /* This god does have protections */ |
1688 | sprintf (tmpbuf, "%s has a potent aura which is extended\n", name); |
1623 | buf << name |
|
|
1624 | << " has a potent aura which is extended to" |
1689 | strcat (tmpbuf, "faithful priests. The effects of this aura include:\n"); |
1625 | " faithful priests. The effects of this aura include: " |
1690 | strcat (tmpbuf, cp); |
1626 | << cp |
1691 | strcat (buf, tmpbuf); |
1627 | << ".\r"; |
1692 | strcat (buf, "\n ---\n"); |
|
|
1693 | } |
1628 | } |
1694 | else |
|
|
1695 | sprintf (buf, " "); |
|
|
1696 | } |
1629 | } |
1697 | |
1630 | |
1698 | if (level == 5 && rndm (2)) |
1631 | if (level == 5 && rndm (2)) |
1699 | { /* aligned race, summoning */ |
1632 | { /* aligned race, summoning */ |
1700 | const char *race = god->race; /* aligned race */ |
1633 | const char *race = god->race; /* aligned race */ |
|
|
1634 | int i; |
1701 | |
1635 | |
1702 | if (race && !(god->path_denied & PATH_SUMMON)) |
1636 | if (race && !(god->path_denied & PATH_SUMMON)) |
1703 | if ((i = nstrtok (race, ",")) > 0) |
1637 | if ((i = nstrtok (race, ",")) > 0) |
1704 | { |
1638 | { |
1705 | char tmpbuf[MAX_BUF]; |
1639 | buf << "Creatures sacred to " << name << " include the "; |
1706 | |
|
|
1707 | sprintf (buf, "Creatures sacred to %s include the \n", name); |
|
|
1708 | if (i > 1) |
1640 | if (i > 1) |
1709 | sprintf (tmpbuf, "following \n races:%s", strtoktolin (race, ",")); |
1641 | buf << "following races:" << strtoktolin (race, ","); |
1710 | else |
1642 | else |
1711 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1643 | buf << "race of" << strtoktolin (race, ","); |
1712 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1644 | |
|
|
1645 | buf << '\r'; |
1713 | } |
1646 | } |
1714 | } |
1647 | } |
1715 | |
1648 | |
1716 | if (level == 6 && rndm (2)) |
1649 | if (level == 6 && rndm (2)) |
1717 | { /* blessing,curse properties of the god */ |
1650 | { /* blessing,curse properties of the god */ |
1718 | char tmpbuf[MAX_BUF]; |
|
|
1719 | |
|
|
1720 | if (const char *cp = describe_resistance (god, 1)) |
1651 | if (const char *cp = describe_resistance (god, 1)) |
1721 | { /* This god does have protections */ |
1652 | { /* This god does have protections */ |
1722 | sprintf (tmpbuf, "\nThe priests of %s are known to be able to \n", name); |
1653 | buf << "The priests of " << name |
|
|
1654 | << " are known to be able to " |
1723 | strcat (tmpbuf, "bestow a blessing which makes the recipient\n"); |
1655 | "bestow a blessing which makes the recipient " |
1724 | strcat (tmpbuf, cp); |
1656 | << cp |
1725 | strcat (buf, tmpbuf); |
1657 | << '\r'; |
1726 | strcat (buf, "\n ---\n"); |
|
|
1727 | } |
1658 | } |
1728 | else |
|
|
1729 | sprintf (buf, " "); |
|
|
1730 | |
|
|
1731 | } |
1659 | } |
1732 | |
1660 | |
1733 | if (level == 8 && rndm (2)) |
1661 | if (level == 8 && rndm (2)) |
1734 | { /* immunity, holy possession */ |
1662 | { /* immunity, holy possession */ |
1735 | int has_effect = 0, tmpvar; |
1663 | buf << "The priests of " << name |
1736 | char tmpbuf[MAX_BUF]; |
1664 | << " are known to make cast a mighty" |
|
|
1665 | " prayer of possession"; |
|
|
1666 | |
|
|
1667 | int first = 1; |
1737 | |
1668 | |
1738 | sprintf (tmpbuf, "\n"); |
|
|
1739 | sprintf (tmpbuf, "The priests of %s are known to make cast a mighty \n", name); |
|
|
1740 | |
|
|
1741 | strcat (tmpbuf, "prayer of possession which gives the recipient\n"); |
|
|
1742 | |
|
|
1743 | for (tmpvar = 0; tmpvar < NROFATTACKS; tmpvar++) |
1669 | for (int i = 0; i < NROFATTACKS; i++) |
|
|
1670 | if (god->resist[i] == 100) |
1744 | { |
1671 | { |
1745 | if (god->resist[tmpvar] == 100) |
1672 | if (first) |
1746 | { |
1673 | { |
|
|
1674 | buf << " which gives the recipient"; |
1747 | has_effect = 1; |
1675 | first = 0; |
1748 | sprintf (tmpbuf + strlen (tmpbuf), "Immunity to %s", attacktype_desc[tmpvar]); |
|
|
1749 | } |
1676 | } |
|
|
1677 | else |
|
|
1678 | buf << ", "; |
|
|
1679 | |
|
|
1680 | buf << " immunity to " << attacktype_desc[i]; |
1750 | } |
1681 | } |
1751 | |
1682 | |
1752 | if (has_effect) |
1683 | buf << ".\r"; |
1753 | { |
|
|
1754 | strcat (buf, tmpbuf); |
|
|
1755 | strcat (buf, "\n ---\n"); |
|
|
1756 | } |
|
|
1757 | else |
|
|
1758 | sprintf (buf, " "); |
|
|
1759 | } |
1684 | } |
1760 | |
1685 | |
1761 | if (level == 12 && rndm (2)) |
1686 | if (level == 12 && rndm (2)) |
1762 | { /* spell paths */ |
1687 | { /* spell paths */ |
|
|
1688 | //TODO: |
1763 | int has_effect = 0, tmpvar; |
1689 | int has_effect = 0, tmpvar; |
1764 | char tmpbuf[MAX_BUF]; |
1690 | char tmpbuf[MAX_BUF]; |
1765 | |
1691 | |
1766 | sprintf (tmpbuf, "\n"); |
1692 | sprintf (tmpbuf, "\n"); |
1767 | sprintf (tmpbuf, "It is rarely known fact that the priests of %s\n", name); |
1693 | sprintf (tmpbuf, "It is rarely known fact that the priests of %s\n", name); |
… | |
… | |
1784 | has_effect = 1; |
1710 | has_effect = 1; |
1785 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1711 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1786 | } |
1712 | } |
1787 | |
1713 | |
1788 | if (has_effect) |
1714 | if (has_effect) |
1789 | { |
1715 | buf << tmpbuf << '\r'; |
1790 | strcat (buf, tmpbuf); |
|
|
1791 | strcat (buf, "\n ---\n"); |
|
|
1792 | } |
|
|
1793 | else |
1716 | else |
1794 | sprintf (buf, " "); |
1717 | buf << '\r'; |
1795 | } |
1718 | } |
1796 | |
1719 | |
1797 | /* check to be sure new buffer size dont exceed either |
|
|
1798 | * the maximum buffer size, or the 'natural' size of the |
|
|
1799 | * book... |
|
|
1800 | */ |
|
|
1801 | if (book_overflow (retbuf, buf, booksize)) |
|
|
1802 | break; |
|
|
1803 | else if (strlen (buf) > 1) |
|
|
1804 | strcat (retbuf, buf); |
|
|
1805 | |
|
|
1806 | level--; |
1720 | level--; |
1807 | } |
1721 | } |
1808 | |
1722 | |
1809 | if (strlen (retbuf) == introlen) |
1723 | if (buf.size () == introlen) |
1810 | { /* we got no information beyond the preamble! */ |
1724 | /* we got no information beyond the preamble! */ |
1811 | strcat (retbuf, " [Unfortunately the rest of the information is\n"); |
1725 | buf << "[Unfortunately the rest of the information is hopelessly garbled!]"; |
1812 | strcat (retbuf, " hopelessly garbled!]\n ---\n"); |
1726 | |
1813 | } |
|
|
1814 | #ifdef BOOK_MSG_DEBUG |
|
|
1815 | LOG (llevDebug, "\n god_info_msg() created string: %d\n", strlen (retbuf)); |
|
|
1816 | LOG (llevDebug, " MADE THIS:\n%s", retbuf); |
|
|
1817 | #endif |
|
|
1818 | return retbuf; |
1727 | return buf; |
1819 | } |
1728 | } |
1820 | |
1729 | |
1821 | /* tailor_readable_ob()- The main routine. This chooses a random |
1730 | /* tailor_readable_ob()- The main routine. This chooses a random |
1822 | * message to put in given readable object (type==BOOK) which will |
1731 | * message to put in given readable object (type==BOOK) which will |
1823 | * be referred hereafter as a 'book'. We use the book level to de- |
1732 | * be referred hereafter as a 'book'. We use the book level to de- |
… | |
… | |
1835 | * |
1744 | * |
1836 | */ |
1745 | */ |
1837 | void |
1746 | void |
1838 | tailor_readable_ob (object *book, int msg_type) |
1747 | tailor_readable_ob (object *book, int msg_type) |
1839 | { |
1748 | { |
1840 | char msgbuf[BOOK_BUF]; |
|
|
1841 | int level = book->level ? rndm (book->level) + 1 : 1; |
1749 | int level = book->level ? rndm (book->level) + 1 : 1; |
1842 | int book_buf_size; |
|
|
1843 | |
1750 | |
1844 | /* safety */ |
1751 | /* safety */ |
1845 | if (book->type != BOOK) |
1752 | if (book->type != BOOK) |
1846 | return; |
1753 | return; |
1847 | |
1754 | |
1848 | if (level <= 0) |
1755 | if (level <= 0) |
1849 | return; /* if no level no point in doing any more... */ |
1756 | return; /* if no level no point in doing any more... */ |
1850 | |
|
|
1851 | /* Max text length this book can have. */ |
|
|
1852 | book_buf_size = BOOKSIZE (book); |
|
|
1853 | |
1757 | |
1854 | /* &&& The message switch &&& */ |
1758 | /* &&& The message switch &&& */ |
1855 | /* Below all of the possible types of messages in the "book"s. |
1759 | /* Below all of the possible types of messages in the "book"s. |
1856 | */ |
1760 | */ |
1857 | /* |
1761 | /* |
… | |
… | |
1860 | * 2) make sure there is an entry in max_titles[] array. |
1764 | * 2) make sure there is an entry in max_titles[] array. |
1861 | * 3) make sure there are entries for your case in new_text_title() |
1765 | * 3) make sure there are entries for your case in new_text_title() |
1862 | * and add_authour(). |
1766 | * and add_authour(). |
1863 | * 4) you may want separate authour/book name arrays in read.h |
1767 | * 4) you may want separate authour/book name arrays in read.h |
1864 | */ |
1768 | */ |
|
|
1769 | const char *new_msg = ""; |
1865 | msg_type = msg_type > 0 ? msg_type : rndm (8); |
1770 | msg_type = msg_type > 0 ? msg_type : rndm (8); |
1866 | switch (msg_type) |
1771 | switch (msg_type) |
1867 | { |
1772 | { |
1868 | case 1: /* monster attrib */ |
1773 | case 1: /* monster attrib */ |
1869 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1774 | new_msg = mon_info_msg (level); |
1870 | break; |
1775 | break; |
1871 | case 2: /* artifact attrib */ |
1776 | case 2: /* artifact attrib */ |
1872 | strcpy (msgbuf, artifact_msg (level, book_buf_size)); |
1777 | new_msg = artifact_msg (level); |
1873 | break; |
1778 | break; |
1874 | case 3: /* grouping incantations/prayers by path */ |
1779 | case 3: /* grouping incantations/prayers by path */ |
1875 | strcpy (msgbuf, spellpath_msg (level, book_buf_size)); |
1780 | new_msg = spellpath_msg (level); |
1876 | break; |
1781 | break; |
1877 | case 4: /* describe an alchemy formula */ |
1782 | case 4: /* describe an alchemy formula */ |
1878 | make_formula_book (book, level); |
1783 | make_formula_book (book, level); |
1879 | /* make_formula_book already gives title */ |
1784 | /* make_formula_book already gives title */ |
1880 | return; |
1785 | return; |
1881 | break; |
|
|
1882 | case 5: /* bits of information about a god */ |
1786 | case 5: /* bits of information about a god */ |
1883 | strcpy (msgbuf, god_info_msg (level, book_buf_size)); |
1787 | new_msg = god_info_msg (level); |
1884 | break; |
1788 | break; |
1885 | case 0: /* use info list in lib/ */ |
1789 | case 0: /* use info list in lib/ */ |
1886 | default: |
1790 | default: |
1887 | cfperl_make_book (book, level); |
1791 | cfperl_make_book (book, level); |
|
|
1792 | /* already gives title */ |
1888 | return; |
1793 | return; |
1889 | } |
1794 | } |
1890 | |
1795 | |
1891 | strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */ |
|
|
1892 | |
|
|
1893 | if (strlen (msgbuf) > 1) |
1796 | if (strlen (new_msg) > 1) |
1894 | { |
1797 | { |
1895 | book->msg = msgbuf; |
1798 | book->msg = new_msg; |
1896 | /* lets give the "book" a new name, which may be a compound word */ |
1799 | /* lets give the "book" a new name, which may be a compound word */ |
1897 | change_book (book, msg_type); |
1800 | change_book (book, msg_type); |
1898 | } |
1801 | } |
1899 | } |
1802 | } |
1900 | |
|
|
1901 | |
|
|
1902 | /***************************************************************************** |
|
|
1903 | * |
|
|
1904 | * Cleanup routine for readble stuff. |
|
|
1905 | * |
|
|
1906 | *****************************************************************************/ |
|
|
1907 | |
|
|
1908 | void |
|
|
1909 | free_all_readable (void) |
|
|
1910 | { |
|
|
1911 | titlelist *tlist, *tnext; |
|
|
1912 | title *title1, *titlenext; |
|
|
1913 | linked_char *lmsg, *nextmsg; |
|
|
1914 | objectlink *monlink, *nextmon; |
|
|
1915 | |
|
|
1916 | LOG (llevDebug, "freeing all book information\n"); |
|
|
1917 | |
|
|
1918 | for (tlist = booklist; tlist != NULL; tlist = tnext) |
|
|
1919 | { |
|
|
1920 | tnext = tlist->next; |
|
|
1921 | |
|
|
1922 | for (title1 = tlist->first_book; title1; title1 = titlenext) |
|
|
1923 | { |
|
|
1924 | titlenext = title1->next; |
|
|
1925 | delete title1; |
|
|
1926 | } |
|
|
1927 | |
|
|
1928 | delete tlist; |
|
|
1929 | } |
|
|
1930 | |
|
|
1931 | for (lmsg = first_msg; lmsg; lmsg = nextmsg) |
|
|
1932 | { |
|
|
1933 | nextmsg = lmsg->next; |
|
|
1934 | delete lmsg; |
|
|
1935 | } |
|
|
1936 | |
|
|
1937 | for (monlink = first_mon_info; monlink; monlink = nextmon) |
|
|
1938 | { |
|
|
1939 | nextmon = monlink->next; |
|
|
1940 | delete monlink; |
|
|
1941 | } |
|
|
1942 | } |
|
|
1943 | |
|
|
1944 | |
1803 | |
1945 | /***************************************************************************** |
1804 | /***************************************************************************** |
1946 | * |
1805 | * |
1947 | * Writeback routine for updating the bookarchive. |
1806 | * Writeback routine for updating the bookarchive. |
1948 | * |
1807 | * |
1949 | ****************************************************************************/ |
1808 | ****************************************************************************/ |
1950 | |
|
|
1951 | /* write_book_archive() - write out the updated book archive */ |
1809 | /* write_book_archive() - write out the updated book archive */ |
1952 | |
|
|
1953 | void |
1810 | void |
1954 | write_book_archive (void) |
1811 | write_book_archive (void) |
1955 | { |
1812 | { |
1956 | FILE *fp; |
1813 | FILE *fp; |
1957 | int index = 0; |
1814 | int index = 0; |
… | |
… | |
1960 | titlelist *bl = get_titlelist (0); |
1817 | titlelist *bl = get_titlelist (0); |
1961 | |
1818 | |
1962 | /* If nothing changed, don't write anything */ |
1819 | /* If nothing changed, don't write anything */ |
1963 | if (!need_to_write_bookarchive) |
1820 | if (!need_to_write_bookarchive) |
1964 | return; |
1821 | return; |
|
|
1822 | |
1965 | need_to_write_bookarchive = 0; |
1823 | need_to_write_bookarchive = 0; |
1966 | |
1824 | |
1967 | sprintf (fname, "%s/bookarch", settings.localdir); |
1825 | sprintf (fname, "%s/bookarch", settings.localdir); |
1968 | LOG (llevDebug, "Updating book archive: %s...\n", fname); |
1826 | LOG (llevDebug, "Updating book archive: %s...\n", fname); |
1969 | |
1827 | |
1970 | if ((fp = fopen (fname, "w")) == NULL) |
1828 | if ((fp = fopen (fname, "w")) == NULL) |
1971 | { |
|
|
1972 | LOG (llevDebug, "Can't open book archive file %s\n", fname); |
1829 | LOG (llevDebug, "Can't open book archive file %s\n", fname); |
1973 | } |
|
|
1974 | else |
1830 | else |
1975 | { |
1831 | { |
1976 | while (bl) |
1832 | while (bl) |
1977 | { |
1833 | { |
1978 | for (book = bl->first_book; book; book = book->next) |
1834 | for (book = bl->first_book; book; book = book->next) |
… | |
… | |
1985 | fprintf (fp, "type %d\n", index); |
1841 | fprintf (fp, "type %d\n", index); |
1986 | fprintf (fp, "size %d\n", book->size); |
1842 | fprintf (fp, "size %d\n", book->size); |
1987 | fprintf (fp, "index %d\n", book->msg_index); |
1843 | fprintf (fp, "index %d\n", book->msg_index); |
1988 | fprintf (fp, "end\n"); |
1844 | fprintf (fp, "end\n"); |
1989 | } |
1845 | } |
|
|
1846 | |
1990 | bl = bl->next; |
1847 | bl = bl->next; |
1991 | index++; |
1848 | index++; |
1992 | } |
1849 | } |
|
|
1850 | |
1993 | fclose (fp); |
1851 | fclose (fp); |
1994 | chmod (fname, SAVE_MODE); |
1852 | chmod (fname, SAVE_MODE); |
1995 | } |
1853 | } |
1996 | } |
1854 | } |
|
|
1855 | |
1997 | readable_message_type * |
1856 | readable_message_type * |
1998 | get_readable_message_type (object *readable) |
1857 | get_readable_message_type (object *readable) |
1999 | { |
1858 | { |
2000 | uint8 subtype = readable->subtype; |
1859 | uint8 subtype = readable->subtype; |
2001 | |
1860 | |