ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/readable.C
(Generate patch)

Comparing deliantra/server/common/readable.C (file contents):
Revision 1.38 by root, Sat Dec 27 02:31:19 2008 UTC vs.
Revision 1.48 by root, Thu Oct 15 23:25:53 2009 UTC

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

Diff Legend

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