… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 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 |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* This file contains code relevant to the BOOKS hack -- designed |
25 | /* This file contains code relevant to the BOOKS hack -- designed |
… | |
… | |
29 | |
30 | |
30 | #include <global.h> |
31 | #include <global.h> |
31 | #include <book.h> |
32 | #include <book.h> |
32 | #include <living.h> |
33 | #include <living.h> |
33 | #include <spells.h> |
34 | #include <spells.h> |
34 | |
|
|
35 | |
35 | |
36 | /* Define this if you want to archive book titles by contents. |
36 | /* Define this if you want to archive book titles by contents. |
37 | * This option should enforce UNIQUE combinations of titles,authors and |
37 | * This option should enforce UNIQUE combinations of titles,authors and |
38 | * msg contents during and *between* game sessions. |
38 | * msg contents during and *between* game sessions. |
39 | * 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 |
… | |
… | |
569 | * (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. */ |
570 | |
570 | |
571 | /* nstrtok() - simple routine to return the number of list |
571 | /* nstrtok() - simple routine to return the number of list |
572 | * items in buf1 as separated by the value of buf2 |
572 | * items in buf1 as separated by the value of buf2 |
573 | */ |
573 | */ |
574 | |
574 | static int |
575 | int |
|
|
576 | nstrtok (const char *buf1, const char *buf2) |
575 | nstrtok (const char *buf1, const char *buf2) |
577 | { |
576 | { |
578 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
577 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
579 | int number = 0; |
578 | int number = 0; |
580 | |
579 | |
… | |
… | |
593 | |
592 | |
594 | /* strtoktolin() - takes a string in buf1 and separates it into |
593 | /* strtoktolin() - takes a string in buf1 and separates it into |
595 | * a list of strings delimited by buf2. Then returns a comma |
594 | * a list of strings delimited by buf2. Then returns a comma |
596 | * separated string w/ decent punctuation. |
595 | * separated string w/ decent punctuation. |
597 | */ |
596 | */ |
598 | |
597 | static char * |
599 | char * |
|
|
600 | strtoktolin (const char *buf1, const char *buf2) |
598 | strtoktolin (const char *buf1, const char *buf2) |
601 | { |
599 | { |
602 | int maxi, i = nstrtok (buf1, buf2); |
600 | int maxi, i = nstrtok (buf1, buf2); |
603 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
601 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
604 | static char rbuf[BOOK_BUF]; |
602 | static char rbuf[BOOK_BUF]; |
… | |
… | |
621 | tbuf = strtok (NULL, sbuf); |
619 | tbuf = strtok (NULL, sbuf); |
622 | } |
620 | } |
623 | return (char *) rbuf; |
621 | return (char *) rbuf; |
624 | } |
622 | } |
625 | |
623 | |
626 | int |
624 | static int |
627 | book_overflow (const char *buf1, const char *buf2, int booksize) |
625 | book_overflow (const char *buf1, const char *buf2, int booksize) |
628 | { |
626 | { |
629 | |
|
|
630 | 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 */ |
631 | || buf_overflow (buf1, buf2, booksize)) |
628 | || buf_overflow (buf1, buf2, booksize)) |
632 | return 1; |
629 | return 1; |
|
|
630 | |
633 | return 0; |
631 | return 0; |
634 | |
|
|
635 | |
|
|
636 | } |
632 | } |
637 | |
633 | |
638 | /***************************************************************************** |
634 | /***************************************************************************** |
639 | * |
635 | * |
640 | * Start of initialisation related functions. |
636 | * Start of initialisation related functions. |
… | |
… | |
817 | else |
813 | else |
818 | t = t->next; |
814 | t = t->next; |
819 | |
815 | |
820 | #ifdef ARCHIVE_DEBUG |
816 | #ifdef ARCHIVE_DEBUG |
821 | if (t) |
817 | if (t) |
822 | 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); |
823 | #endif |
819 | #endif |
824 | |
820 | |
825 | return t; |
821 | return t; |
826 | } |
822 | } |
827 | |
823 | |
… | |
… | |
829 | * handled directly in change_book_name(). Names are based on text |
825 | * handled directly in change_book_name(). Names are based on text |
830 | * msgtype |
826 | * msgtype |
831 | * this sets book book->name based on msgtype given. What name |
827 | * this sets book book->name based on msgtype given. What name |
832 | * is given is based on various criteria |
828 | * is given is based on various criteria |
833 | */ |
829 | */ |
834 | |
|
|
835 | static void |
830 | static void |
836 | new_text_name (object *book, int msgtype) |
831 | new_text_name (object *book, int msgtype) |
837 | { |
832 | { |
838 | int nbr; |
833 | int nbr; |
839 | char name[MAX_BUF]; |
834 | char name[MAX_BUF]; |
… | |
… | |
975 | |
970 | |
976 | /* We have stuff we need to write now */ |
971 | /* We have stuff we need to write now */ |
977 | need_to_write_bookarchive = 1; |
972 | need_to_write_bookarchive = 1; |
978 | |
973 | |
979 | #ifdef ARCHIVE_DEBUG |
974 | #ifdef ARCHIVE_DEBUG |
980 | 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); |
981 | #endif |
976 | #endif |
982 | |
977 | |
983 | } |
978 | } |
984 | |
979 | |
985 | |
980 | |
… | |
… | |
991 | * levels and architypes. -b.t. |
986 | * levels and architypes. -b.t. |
992 | */ |
987 | */ |
993 | |
988 | |
994 | #define MAX_TITLE_CHECK 20 |
989 | #define MAX_TITLE_CHECK 20 |
995 | |
990 | |
996 | void |
991 | static void |
997 | change_book (object *book, int msgtype) |
992 | change_book (object *book, int msgtype) |
998 | { |
993 | { |
999 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
994 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1000 | |
995 | |
1001 | switch (book->type) |
996 | switch (book->type) |
… | |
… | |
1051 | if (numb == maxnames) |
1046 | if (numb == maxnames) |
1052 | { |
1047 | { |
1053 | #ifdef ARCHIVE_DEBUG |
1048 | #ifdef ARCHIVE_DEBUG |
1054 | 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); |
1055 | #endif |
1050 | #endif |
1056 | break; |
|
|
1057 | } |
1051 | } |
1058 | /* shouldnt change map-maker books */ |
1052 | /* shouldnt change map-maker books */ |
1059 | else if (!book->title) |
1053 | else if (!book->title) |
1060 | do |
1054 | do |
1061 | { |
1055 | { |
… | |
… | |
1076 | */ |
1070 | */ |
1077 | |
1071 | |
1078 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1072 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1079 | { /* got to check maxnames again */ |
1073 | { /* got to check maxnames again */ |
1080 | #ifdef ARCHIVE_DEBUG |
1074 | #ifdef ARCHIVE_DEBUG |
1081 | 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); |
1082 | #endif |
1076 | #endif |
1083 | /* restore old book properties here */ |
1077 | /* restore old book properties here */ |
1084 | book->title = old_title; |
1078 | book->title = old_title; |
1085 | |
1079 | |
1086 | if (rndm (4)) |
1080 | if (rndm (4)) |
… | |
… | |
1126 | * 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, |
1127 | * then only monsters greater than that level will be returned. |
1121 | * then only monsters greater than that level will be returned. |
1128 | * Changed 971225 to be greater than equal to level passed. Also |
1122 | * Changed 971225 to be greater than equal to level passed. Also |
1129 | * made choosing by level more random. |
1123 | * made choosing by level more random. |
1130 | */ |
1124 | */ |
1131 | |
|
|
1132 | object * |
1125 | object * |
1133 | get_random_mon (int level) |
1126 | get_random_mon (int level) |
1134 | { |
1127 | { |
1135 | objectlink *mon = first_mon_info; |
1128 | objectlink *mon = first_mon_info; |
1136 | int i = 0, monnr; |
1129 | int i = 0, monnr; |
… | |
… | |
1194 | |
1187 | |
1195 | /* |
1188 | /* |
1196 | * Returns a description of the monster. This really needs to be |
1189 | * Returns a description of the monster. This really needs to be |
1197 | * redone, as describe_item really gives a pretty internal description. |
1190 | * redone, as describe_item really gives a pretty internal description. |
1198 | */ |
1191 | */ |
1199 | |
1192 | static const char * |
1200 | char * |
|
|
1201 | mon_desc (const object *mon) |
1193 | mon_desc (const object *mon) |
1202 | { |
1194 | { |
1203 | static char retbuf[HUGE_BUF]; |
1195 | static dynbuf_text buf; buf.clear (); |
1204 | |
1196 | |
1205 | sprintf (retbuf, " *** %s ***\n", &mon->name); |
1197 | buf.printf (" *** %s ***\n", &mon->name); |
1206 | strcat (retbuf, describe_item (mon, NULL)); |
1198 | buf << describe_item (mon, 0); |
1207 | |
1199 | |
1208 | return retbuf; |
1200 | return buf; |
1209 | } |
1201 | } |
1210 | |
1202 | |
1211 | |
1203 | |
1212 | /* 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 |
1213 | * 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 |
1214 | * calling function (mon_info_msg) seems to expect that. |
1206 | * calling function (mon_info_msg) seems to expect that. |
1215 | */ |
1207 | */ |
1216 | |
1208 | static object * |
1217 | object * |
|
|
1218 | get_next_mon (object *tmp) |
1209 | get_next_mon (object *tmp) |
1219 | { |
1210 | { |
1220 | objectlink *mon; |
1211 | objectlink *mon; |
1221 | |
1212 | |
1222 | for (mon = first_mon_info; mon; mon = mon->next) |
1213 | for (mon = first_mon_info; mon; mon = mon->next) |
… | |
… | |
1231 | else |
1222 | else |
1232 | return first_mon_info->ob; |
1223 | return first_mon_info->ob; |
1233 | |
1224 | |
1234 | } |
1225 | } |
1235 | |
1226 | |
1236 | |
|
|
1237 | |
|
|
1238 | /* mon_info_msg() - generate a message detailing the properties |
1227 | /* mon_info_msg() - generate a message detailing the properties |
1239 | * of a randomly selected monster. |
1228 | * of a randomly selected monster. |
1240 | */ |
1229 | */ |
1241 | |
1230 | static const char * |
1242 | char * |
|
|
1243 | mon_info_msg (int level, int booksize) |
1231 | mon_info_msg (int level, int booksize) |
1244 | { |
1232 | { |
1245 | static char retbuf[BOOK_BUF]; |
1233 | static dynbuf_text buf; buf.clear (); |
1246 | char tmpbuf[HUGE_BUF]; |
|
|
1247 | object *tmp; |
|
|
1248 | |
1234 | |
1249 | /*preamble */ |
1235 | /*preamble */ |
1250 | strcpy (retbuf, "This beastiary contains:"); |
1236 | buf << "This beastiary contains:\n"; |
1251 | |
1237 | |
1252 | /* 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 |
1253 | * document. |
1239 | * document. |
1254 | * 8-96 Had to change this a bit, otherwise there would |
1240 | * 8-96 Had to change this a bit, otherwise there would |
1255 | * have been an impossibly large number of combinations |
1241 | * have been an impossibly large number of combinations |
1256 | * of text! (and flood out the available number of titles |
1242 | * of text! (and flood out the available number of titles |
1257 | * in the archive in a snap!) -b.t. |
1243 | * in the archive in a snap!) -b.t. |
1258 | */ |
1244 | */ |
1259 | tmp = get_random_mon (level * 3); |
1245 | object *tmp = get_random_mon (level * 3); |
1260 | while (tmp) |
1246 | while (tmp && buf.size () < BOOK_BUF) |
1261 | { |
1247 | { |
1262 | /* monster description */ |
1248 | /* monster description */ |
1263 | sprintf (tmpbuf, "\n---\n%s", mon_desc (tmp)); |
1249 | 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 | |
1250 | |
1270 | /* Note that the value this returns is not based on level */ |
1251 | /* Note that the value this returns is not based on level */ |
1271 | tmp = get_next_mon (tmp); |
1252 | tmp = get_next_mon (tmp); |
1272 | } |
1253 | } |
1273 | |
1254 | |
1274 | #ifdef BOOK_MSG_DEBUG |
|
|
1275 | LOG (llevDebug, "\n mon_info_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1276 | fprintf (logfile, " MADE THIS:\n%s\n", retbuf); |
|
|
1277 | #endif |
|
|
1278 | |
|
|
1279 | return retbuf; |
1255 | return buf; |
1280 | } |
1256 | } |
1281 | |
1257 | |
1282 | |
1258 | |
1283 | /***************************************************************************** |
1259 | /***************************************************************************** |
1284 | * Artifact msg generation code. |
1260 | * Artifact msg generation code. |
1285 | ****************************************************************************/ |
1261 | ****************************************************************************/ |
1286 | |
1262 | |
1287 | /* artifact_msg() - generate a message detailing the properties |
1263 | /* artifact_msg() - generate a message detailing the properties |
1288 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1264 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1289 | */ |
1265 | */ |
1290 | const char * |
1266 | static const char * |
1291 | artifact_msg (int level, int booksize) |
1267 | artifact_msg (int level, int booksize) |
1292 | { |
1268 | { |
1293 | artifactlist *al = NULL; |
1269 | artifactlist *al = NULL; |
1294 | artifact *art; |
1270 | artifact *art; |
1295 | int chance, i, type, index; |
1271 | int chance, i, type, index; |
… | |
… | |
1349 | |
1325 | |
1350 | /* separator of items */ |
1326 | /* separator of items */ |
1351 | strcpy (buf, "--- \n"); |
1327 | strcpy (buf, "--- \n"); |
1352 | |
1328 | |
1353 | /* Name */ |
1329 | /* Name */ |
1354 | if (art->allowed != NULL && strcmp (art->allowed->name, "All")) |
1330 | if (art->allowed && art->allowed->name != shstr_All) |
1355 | { |
1331 | { |
1356 | linked_char *temp, *next = art->allowed; |
1332 | linked_char *temp, *next = art->allowed; |
1357 | |
1333 | |
1358 | do |
1334 | do |
1359 | { |
1335 | { |
… | |
… | |
1405 | art = art->next; |
1381 | art = art->next; |
1406 | book_entries--; |
1382 | book_entries--; |
1407 | } |
1383 | } |
1408 | |
1384 | |
1409 | #ifdef BOOK_MSG_DEBUG |
1385 | #ifdef BOOK_MSG_DEBUG |
1410 | LOG (llevDebug, "artifact_msg() created strng: %d\n", strlen (retbuf)); |
1386 | LOG (llevDebug, "artifact_msg() created string: %d\n", strlen (retbuf)); |
1411 | fprintf (logfile, " MADE THIS:\n%s", retbuf); |
1387 | LOG (llevDebug, " MADE THIS:\n%s", retbuf); |
1412 | #endif |
1388 | #endif |
1413 | return retbuf; |
1389 | return retbuf; |
1414 | } |
1390 | } |
1415 | |
1391 | |
1416 | /***************************************************************************** |
1392 | /***************************************************************************** |
… | |
… | |
1419 | |
1395 | |
1420 | /* spellpath_msg() - generate a message detailing the member |
1396 | /* spellpath_msg() - generate a message detailing the member |
1421 | * incantations/prayers (and some of their properties) belonging to |
1397 | * incantations/prayers (and some of their properties) belonging to |
1422 | * a given spellpath. |
1398 | * a given spellpath. |
1423 | */ |
1399 | */ |
1424 | |
1400 | static char * |
1425 | char * |
|
|
1426 | spellpath_msg (int level, int booksize) |
1401 | spellpath_msg (int level, int booksize) |
1427 | { |
1402 | { |
1428 | static char retbuf[BOOK_BUF]; |
1403 | static char retbuf[BOOK_BUF]; |
1429 | char tmpbuf[BOOK_BUF]; |
1404 | char tmpbuf[BOOK_BUF]; |
1430 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
1405 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
… | |
… | |
1472 | } |
1447 | } |
1473 | else |
1448 | else |
1474 | { |
1449 | { |
1475 | strcat (retbuf, "\n"); |
1450 | strcat (retbuf, "\n"); |
1476 | } |
1451 | } |
|
|
1452 | |
|
|
1453 | #ifdef BOOK_MSG_DEBUG |
|
|
1454 | LOG (llevDebug, "spellpath_msg() created string: %d\n", strlen (retbuf)); |
|
|
1455 | LOG (llevDebug, " MADE THIS:\n%s", retbuf); |
|
|
1456 | #endif |
1477 | return retbuf; |
1457 | return retbuf; |
1478 | } |
1458 | } |
1479 | |
1459 | |
1480 | /* formula_msg() - generate a message detailing the properties |
1460 | /* formula_msg() - generate a message detailing the properties |
1481 | * of a randomly selected alchemical formula. |
1461 | * of a randomly selected alchemical formula. |
1482 | */ |
1462 | */ |
1483 | void |
1463 | static void |
1484 | make_formula_book (object *book, int level) |
1464 | make_formula_book (object *book, int level) |
1485 | { |
1465 | { |
1486 | char retbuf[BOOK_BUF], title[MAX_BUF]; |
1466 | char retbuf[BOOK_BUF], title[MAX_BUF]; |
1487 | recipelist *fl; |
1467 | recipelist *fl; |
1488 | recipe *formula = NULL; |
1468 | recipe *formula = NULL; |
… | |
… | |
1536 | op_name = at->object::name; |
1516 | op_name = at->object::name; |
1537 | else |
1517 | else |
1538 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
1518 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
1539 | |
1519 | |
1540 | /* item name */ |
1520 | /* item name */ |
1541 | if (strcmp (formula->title, "NONE")) |
1521 | if (formula->title != shstr_NONE) |
1542 | { |
1522 | { |
1543 | sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title); |
1523 | sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title); |
1544 | /* This results in things like pile of philo. sulfur. |
1524 | /* This results in things like pile of philo. sulfur. |
1545 | * while philo. sulfur may look better, without this, |
1525 | * while philo. sulfur may look better, without this, |
1546 | * you get things like 'the wise' because its missing the |
1526 | * you get things like 'the wise' because its missing the |
… | |
… | |
1559 | strcat (retbuf, at->title); |
1539 | strcat (retbuf, at->title); |
1560 | strcat (title, " "); |
1540 | strcat (title, " "); |
1561 | strcat (title, at->title); |
1541 | strcat (title, at->title); |
1562 | } |
1542 | } |
1563 | } |
1543 | } |
|
|
1544 | |
1564 | /* Lets name the book something meaningful ! */ |
1545 | /* Lets name the book something meaningful ! */ |
1565 | book->name = title; |
1546 | book->name = title; |
1566 | book->title = NULL; |
1547 | book->title = NULL; |
1567 | |
1548 | |
1568 | /* ingredients to make it */ |
1549 | /* ingredients to make it */ |
… | |
… | |
1607 | } |
1588 | } |
1608 | |
1589 | |
1609 | /* god_info_msg() - generate a message detailing the properties |
1590 | /* god_info_msg() - generate a message detailing the properties |
1610 | * of a random god. Used by the book hack. b.t. |
1591 | * of a random god. Used by the book hack. b.t. |
1611 | */ |
1592 | */ |
1612 | const char * |
1593 | static const char * |
1613 | god_info_msg (int level, int booksize) |
1594 | god_info_msg (int level, int booksize) |
1614 | { |
1595 | { |
1615 | static char retbuf[BOOK_BUF]; |
1596 | static char retbuf[BOOK_BUF]; |
1616 | const char *name = NULL; |
1597 | const char *name = NULL; |
1617 | char buf[BOOK_BUF]; |
1598 | char buf[BOOK_BUF]; |
… | |
… | |
1804 | { /* we got no information beyond the preamble! */ |
1785 | { /* we got no information beyond the preamble! */ |
1805 | strcat (retbuf, " [Unfortunately the rest of the information is\n"); |
1786 | strcat (retbuf, " [Unfortunately the rest of the information is\n"); |
1806 | strcat (retbuf, " hopelessly garbled!]\n ---\n"); |
1787 | strcat (retbuf, " hopelessly garbled!]\n ---\n"); |
1807 | } |
1788 | } |
1808 | #ifdef BOOK_MSG_DEBUG |
1789 | #ifdef BOOK_MSG_DEBUG |
1809 | LOG (llevDebug, "\n god_info_msg() created strng: %d\n", strlen (retbuf)); |
1790 | LOG (llevDebug, "\n god_info_msg() created string: %d\n", strlen (retbuf)); |
1810 | fprintf (logfile, " MADE THIS:\n%s", retbuf); |
1791 | LOG (llevDebug, " MADE THIS:\n%s", retbuf); |
1811 | #endif |
1792 | #endif |
1812 | return retbuf; |
1793 | return retbuf; |
1813 | } |
1794 | } |
1814 | |
1795 | |
1815 | /* tailor_readable_ob()- The main routine. This chooses a random |
1796 | /* tailor_readable_ob()- The main routine. This chooses a random |