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.35 by root, Sun Aug 31 05:47:14 2008 UTC vs.
Revision 1.52 by root, Fri Nov 6 13:31:47 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
… …
108/* these are needed for creation of a linked list of 108/* these are needed for creation of a linked list of
109 * pointers to all (hostile) monster objects */ 109 * pointers to all (hostile) monster objects */
110 110
111static int nrofmon = 0, need_to_write_bookarchive = 0; 111static int nrofmon = 0, need_to_write_bookarchive = 0;
112 112
113
114/* this is needed to keep track of status of initialisation
115 * of the message file */
116static int nrofmsg = 0;
117
118/* 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
119 * the messages file 114 * the messages file
120 */ 115 */
121static linked_char *first_msg = NULL; 116static linked_char *first_msg = NULL;
122 117
123/* 118/*
124 * Spellpath information 119 * Spellpath information
125 */ 120 */
126
127static uint32 spellpathdef[NRSPELLPATHS] = { 121static uint32 spellpathdef[NRSPELLPATHS] = {
128 PATH_PROT, 122 PATH_PROT,
129 PATH_FIRE, 123 PATH_FIRE,
130 PATH_FROST, 124 PATH_FROST,
131 PATH_ELEC, 125 PATH_ELEC,
… …
497 /*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"},
498 {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"},
499 {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"},
500 {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"}
501}; 495};
502int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); 496static int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type);
503 497
504static int max_titles[6] = { 498static int max_titles[6] = {
505 ((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 *)),
506 (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)), 500 (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)),
507 (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)), 501 (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)),
… …
569 * (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. */
570 564
571/* nstrtok() - simple routine to return the number of list 565/* nstrtok() - simple routine to return the number of list
572 * items in buf1 as separated by the value of buf2 566 * items in buf1 as separated by the value of buf2
573 */ 567 */
574 568static int
575int
576nstrtok (const char *buf1, const char *buf2) 569nstrtok (const char *buf1, const char *buf2)
577{ 570{
578 char *tbuf, sbuf[12], buf[MAX_BUF]; 571 char *tbuf, sbuf[12], buf[MAX_BUF];
579 int number = 0; 572 int number = 0;
580 573
… …
593 586
594/* strtoktolin() - takes a string in buf1 and separates it into 587/* strtoktolin() - takes a string in buf1 and separates it into
595 * a list of strings delimited by buf2. Then returns a comma 588 * a list of strings delimited by buf2. Then returns a comma
596 * separated string w/ decent punctuation. 589 * separated string w/ decent punctuation.
597 */ 590 */
598 591static char *
599char *
600strtoktolin (const char *buf1, const char *buf2) 592strtoktolin (const char *buf1, const char *buf2)
601{ 593{
602 int maxi, i = nstrtok (buf1, buf2); 594 int maxi, i = nstrtok (buf1, buf2);
603 char *tbuf, buf[MAX_BUF], sbuf[12]; 595 char *tbuf, buf[MAX_BUF], sbuf[12];
604 static char rbuf[BOOK_BUF]; 596 static char rbuf[BOOK_BUF];
… …
619 else 611 else
620 strcat (rbuf, "."); 612 strcat (rbuf, ".");
621 tbuf = strtok (NULL, sbuf); 613 tbuf = strtok (NULL, sbuf);
622 } 614 }
623 return (char *) rbuf; 615 return (char *) rbuf;
624}
625
626int
627book_overflow (const char *buf1, const char *buf2, int booksize)
628{
629
630 if (buf_overflow (buf1, buf2, BOOK_BUF - 2) /* 2 less so always room for trailing \n */
631 || buf_overflow (buf1, buf2, booksize))
632 return 1;
633 return 0;
634
635
636} 616}
637 617
638/***************************************************************************** 618/*****************************************************************************
639 * 619 *
640 * Start of initialisation related functions. 620 * Start of initialisation related functions.
… …
735} 715}
736 716
737/* init_mon_info() - creates the linked list of pointers to 717/* init_mon_info() - creates the linked list of pointers to
738 * monster archetype objects if not called previously 718 * monster archetype objects if not called previously
739 */ 719 */
740
741static void 720static void
742init_mon_info (void) 721init_mon_info ()
743{ 722{
744 archetype *at; 723 archetype *at;
745 static int did_init_mon_info = 0; 724 static int did_init_mon_info = 0;
746 725
747 if (did_init_mon_info) 726 if (did_init_mon_info)
748 return; 727 return;
749 728
750 did_init_mon_info = 1; 729 did_init_mon_info = 1;
751 730
752 for_all_archetypes (at) 731 for_all_archetypes (at)
753 { 732 if (at->flag [FLAG_MONSTER]
754 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]))
755 { 735 {
756 objectlink *mon = new objectlink; 736 objectlink *mon = new objectlink;
757 737
758 mon->ob = at; 738 mon->ob = at;
759 mon->next = first_mon_info; 739 mon->next = first_mon_info;
760 first_mon_info = mon; 740 first_mon_info = mon;
761 nrofmon++; 741 nrofmon++;
762 } 742 }
763 }
764 743
765 LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); 744 LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon);
766} 745}
767 746
768/* init_readable() - initialise linked lists utilized by 747/* init_readable() - initialise linked lists utilized by
… …
817 else 796 else
818 t = t->next; 797 t = t->next;
819 798
820#ifdef ARCHIVE_DEBUG 799#ifdef ARCHIVE_DEBUG
821 if (t) 800 if (t)
822 LOG (llevDebug, "Found title match (list %d): %s %s (%d)\n", msgtype, t->name, t->authour, t->msg_index); 801 LOG (llevDebug, "Found title match (list %d): %s %s (%d)\n", msgtype, &t->name, &t->authour, t->msg_index);
823#endif 802#endif
824 803
825 return t; 804 return t;
826} 805}
827 806
… …
829 * handled directly in change_book_name(). Names are based on text 808 * handled directly in change_book_name(). Names are based on text
830 * msgtype 809 * msgtype
831 * this sets book book->name based on msgtype given. What name 810 * this sets book book->name based on msgtype given. What name
832 * is given is based on various criteria 811 * is given is based on various criteria
833 */ 812 */
834
835static void 813static void
836new_text_name (object *book, int msgtype) 814new_text_name (object *book, int msgtype)
837{ 815{
838 int nbr; 816 int nbr;
839 char name[MAX_BUF]; 817 char name[MAX_BUF];
… …
932 */ 910 */
933 911
934static int 912static int
935unique_book (const object *book, int msgtype) 913unique_book (const object *book, int msgtype)
936{ 914{
937 title *test;
938
939 if (!booklist) 915 if (!booklist)
940 return 1; /* No archival entries! Must be unique! */ 916 return 1; /* No archival entries! Must be unique! */
941 917
942 /* Go through the booklist. If the author and name match, not unique so 918 /* Go through the booklist. If the author and name match, not unique so
943 * return 0. 919 * return 0.
944 */ 920 */
945 for (test = get_titlelist (msgtype)->first_book; test; test = test->next) 921 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)) 922 if (test->name == book->name && book->title == test->authour)
948 return 0; 923 return 0;
949 } 924
950 return 1; 925 return 1;
951} 926}
952 927
953/* add_book_to_list() */ 928/* add_book_to_list() */
954 929
… …
978 953
979 /* We have stuff we need to write now */ 954 /* We have stuff we need to write now */
980 need_to_write_bookarchive = 1; 955 need_to_write_bookarchive = 1;
981 956
982#ifdef ARCHIVE_DEBUG 957#ifdef ARCHIVE_DEBUG
983 LOG (llevDebug, "Archiving new title: %s %s (%d)\n", book->name, book->title, msgtype); 958 LOG (llevDebug, "Archiving new title: %s %s (%d)\n", &book->name, &book->title, msgtype);
984#endif 959#endif
985 960
986} 961}
987 962
988 963
… …
994 * levels and architypes. -b.t. 969 * levels and architypes. -b.t.
995 */ 970 */
996 971
997#define MAX_TITLE_CHECK 20 972#define MAX_TITLE_CHECK 20
998 973
999void 974static void
1000change_book (object *book, int msgtype) 975change_book (object *book, int msgtype)
1001{ 976{
1002 int nbr = sizeof (book_descrpt) / sizeof (char *); 977 int nbr = sizeof (book_descrpt) / sizeof (char *);
1003 978
1004 switch (book->type) 979 switch (book->type)
… …
1054 if (numb == maxnames) 1029 if (numb == maxnames)
1055 { 1030 {
1056#ifdef ARCHIVE_DEBUG 1031#ifdef ARCHIVE_DEBUG
1057 LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); 1032 LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames);
1058#endif 1033#endif
1059 break;
1060 } 1034 }
1061 /* shouldnt change map-maker books */ 1035 /* shouldnt change map-maker books */
1062 else if (!book->title) 1036 else if (!book->title)
1063 do 1037 do
1064 { 1038 {
… …
1079 */ 1053 */
1080 1054
1081 if (tries == MAX_TITLE_CHECK || numb == maxnames) 1055 if (tries == MAX_TITLE_CHECK || numb == maxnames)
1082 { /* got to check maxnames again */ 1056 { /* got to check maxnames again */
1083#ifdef ARCHIVE_DEBUG 1057#ifdef ARCHIVE_DEBUG
1084 LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames); 1058 LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", &book->name, &book->title, numb, maxnames);
1085#endif 1059#endif
1086 /* restore old book properties here */ 1060 /* restore old book properties here */
1087 book->title = old_title; 1061 book->title = old_title;
1088 1062
1089 if (RANDOM () % 4) 1063 if (rndm (4))
1090 { 1064 {
1091 /* Lets give the book a description to individualize it some */ 1065 /* Lets give the book a description to individualize it some */
1092 char new_name[MAX_BUF]; 1066 char new_name[MAX_BUF];
1093 1067
1094 snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name); 1068 snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name);
… …
1129 * 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,
1130 * then only monsters greater than that level will be returned. 1104 * then only monsters greater than that level will be returned.
1131 * Changed 971225 to be greater than equal to level passed. Also 1105 * Changed 971225 to be greater than equal to level passed. Also
1132 * made choosing by level more random. 1106 * made choosing by level more random.
1133 */ 1107 */
1134
1135object * 1108object *
1136get_random_mon (int level) 1109get_random_mon (int level)
1137{ 1110{
1138 objectlink *mon = first_mon_info; 1111 objectlink *mon = first_mon_info;
1139 int i = 0, monnr; 1112 int i = 0, monnr;
… …
1143 return (object *) NULL; 1116 return (object *) NULL;
1144 1117
1145 if (!level) 1118 if (!level)
1146 { 1119 {
1147 /* lets get a random monster from the mon_info linked list */ 1120 /* lets get a random monster from the mon_info linked list */
1148 monnr = RANDOM () % nrofmon; 1121 monnr = rndm (nrofmon);
1149 1122
1150 for (mon = first_mon_info, i = 0; mon; mon = mon->next) 1123 for (mon = first_mon_info, i = 0; mon; mon = mon->next)
1151 if (i++ == monnr) 1124 if (i++ == monnr)
1152 break; 1125 break;
1153 1126
… …
1180 { 1153 {
1181 LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level); 1154 LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level);
1182 return NULL; 1155 return NULL;
1183 } 1156 }
1184 1157
1185 monnr = RANDOM () % i; 1158 monnr = rndm (i);
1186 for (mon = first_mon_info; mon; mon = mon->next) 1159 for (mon = first_mon_info; mon; mon = mon->next)
1187 if (mon->ob->level >= level && monnr-- == 0) 1160 if (mon->ob->level >= level && monnr-- == 0)
1188 return mon->ob; 1161 return mon->ob;
1189 1162
1190 if (!mon) 1163 if (!mon)
… …
1197 1170
1198/* 1171/*
1199 * Returns a description of the monster. This really needs to be 1172 * Returns a description of the monster. This really needs to be
1200 * redone, as describe_item really gives a pretty internal description. 1173 * redone, as describe_item really gives a pretty internal description.
1201 */ 1174 */
1202 1175static const char *
1203char *
1204mon_desc (const object *mon) 1176mon_desc (const object *mon)
1205{ 1177{
1206 static char retbuf[HUGE_BUF]; 1178 static dynbuf_text buf; buf.clear ();
1207 1179
1208 sprintf (retbuf, " *** %s ***\n", &mon->name); 1180 buf.printf ("B<< %s >>\r", &mon->name);
1209 strcat (retbuf, describe_item (mon, NULL)); 1181 buf << describe_item (mon, 0);
1210 1182
1211 return retbuf; 1183 return buf;
1212} 1184}
1213 1185
1214 1186
1215/* 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
1216 * 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
1217 * calling function (mon_info_msg) seems to expect that. 1189 * calling function (mon_info_msg) seems to expect that.
1218 */ 1190 */
1219 1191static object *
1220object *
1221get_next_mon (object *tmp) 1192get_next_mon (object *tmp)
1222{ 1193{
1223 objectlink *mon; 1194 objectlink *mon;
1224 1195
1225 for (mon = first_mon_info; mon; mon = mon->next) 1196 for (mon = first_mon_info; mon; mon = mon->next)
… …
1227 break; 1198 break;
1228 1199
1229 /* didn't find a match */ 1200 /* didn't find a match */
1230 if (!mon) 1201 if (!mon)
1231 return NULL; 1202 return NULL;
1203
1232 if (mon->next) 1204 if (mon->next)
1233 return mon->next->ob; 1205 return mon->next->ob;
1234 else 1206 else
1235 return first_mon_info->ob; 1207 return first_mon_info->ob;
1236 1208
1237} 1209}
1238 1210
1239
1240
1241/* mon_info_msg() - generate a message detailing the properties 1211/* mon_info_msg() - generate a message detailing the properties
1242 * of a randomly selected monster. 1212 * of a randomly selected monster.
1243 */ 1213 */
1244 1214static const char *
1245char *
1246mon_info_msg (int level, int booksize) 1215mon_info_msg (int level)
1247{ 1216{
1248 static char retbuf[BOOK_BUF]; 1217 static dynbuf_text buf; buf.clear ();
1249 char tmpbuf[HUGE_BUF];
1250 object *tmp;
1251 1218
1252 /*preamble */ 1219 /*preamble */
1253 strcpy (retbuf, "This beastiary contains:"); 1220 buf << "This beastiary contains:\n";
1254 1221
1255 /* 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
1256 * document. 1223 * document.
1257 * 8-96 Had to change this a bit, otherwise there would 1224 * 8-96 Had to change this a bit, otherwise there would
1258 * have been an impossibly large number of combinations 1225 * have been an impossibly large number of combinations
1259 * of text! (and flood out the available number of titles 1226 * of text! (and flood out the available number of titles
1260 * in the archive in a snap!) -b.t. 1227 * in the archive in a snap!) -b.t.
1261 */ 1228 */
1262 tmp = get_random_mon (level * 3); 1229 object *tmp = get_random_mon (level * 3);
1263 while (tmp) 1230 while (tmp && buf.size () < BOOK_BUF)
1264 { 1231 {
1265 /* monster description */ 1232 /* monster description */
1266 sprintf (tmpbuf, "\n---\n%s", mon_desc (tmp)); 1233 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 1234
1273 /* Note that the value this returns is not based on level */ 1235 /* Note that the value this returns is not based on level */
1274 tmp = get_next_mon (tmp); 1236 tmp = get_next_mon (tmp);
1275 } 1237 }
1276 1238
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; 1239 return buf;
1283} 1240}
1284 1241
1285 1242
1286/***************************************************************************** 1243/*****************************************************************************
1287 * Artifact msg generation code. 1244 * Artifact msg generation code.
1288 ****************************************************************************/ 1245 ****************************************************************************/
1289 1246
1290/* artifact_msg() - generate a message detailing the properties 1247/* artifact_msg() - generate a message detailing the properties
1291 * of 1-6 artifacts drawn sequentially from the artifact list. 1248 * of 1-6 artifacts drawn sequentially from the artifact list.
1292 */ 1249 */
1293const char * 1250static const char *
1294artifact_msg (int level, int booksize) 1251artifact_msg (int level)
1295{ 1252{
1296 artifactlist *al = NULL; 1253 artifactlist *al = NULL;
1297 artifact *art; 1254 artifact *art;
1298 int chance, i, type, index; 1255 int chance, i, type, index;
1299 int book_entries = level > 5 ? RANDOM () % 3 + RANDOM () % 3 + 2 : RANDOM () % level + 1; 1256 int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1;
1300 const char *ch; 1257 const char *ch;
1301 char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; 1258 char name[MAX_BUF];
1302 static char retbuf[BOOK_BUF];
1303 object *tmp = NULL; 1259 object *tmp = NULL;
1260
1261 static dynbuf_text buf; buf.clear ();
1304 1262
1305 /* values greater than 5 create msg buffers that are too big! */ 1263 /* values greater than 5 create msg buffers that are too big! */
1306 if (book_entries > 5) 1264 if (book_entries > 5)
1307 book_entries = 5; 1265 book_entries = 5;
1308 1266
… …
1312 * for that type exists! 1270 * for that type exists!
1313 */ 1271 */
1314 i = 0; 1272 i = 0;
1315 do 1273 do
1316 { 1274 {
1317 index = RANDOM () % (sizeof (art_name_array) / sizeof (arttypename)); 1275 index = rndm (sizeof (art_name_array) / sizeof (arttypename));
1318 type = art_name_array[index].type; 1276 type = art_name_array[index].type;
1319 al = find_artifactlist (type); 1277 al = find_artifactlist (type);
1320 i++; 1278 i++;
1321 } 1279 }
1322 while ((al == NULL) && (i < 10)); 1280 while ((al == NULL) && (i < 10));
… …
1325 return "None"; 1283 return "None";
1326 1284
1327 /* There is no reason to start on the artifact list at the begining. Lets 1285 /* There is no reason to start on the artifact list at the begining. Lets
1328 * take our starting position randomly... */ 1286 * take our starting position randomly... */
1329 art = al->items; 1287 art = al->items;
1330 for (i = RANDOM () % level + RANDOM () % 2 + 1; i > 0; i--) 1288 for (i = rndm (level) + rndm (2) + 1; i > 0; i--)
1331 { 1289 {
1332 if (art == NULL) 1290 if (!art)
1333 art = al->items; /* hmm, out of stuff, loop back around */ 1291 art = al->items; /* hmm, out of stuff, loop back around */
1292
1334 art = art->next; 1293 art = art->next;
1335 } 1294 }
1336 1295
1337 /* the base 'generic' name for our artifact */ 1296 /* the base 'generic' name for our artifact */
1338 assign (name, art_name_array[index].name); 1297 assign (name, art_name_array[index].name);
1339 1298
1340 /* Ok, lets print out the contents */ 1299 /* Ok, lets print out the contents */
1341 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");
1342 1303
1343 /* artifact msg attributes loop. Lets keep adding entries to the 'book' 1304 /* artifact msg attributes loop. Lets keep adding entries to the 'book'
1344 * 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)
1345 */ 1306 */
1346 while (book_entries > 0) 1307 while (book_entries > 0 && buf.size () < BOOK_BUF)
1347 { 1308 {
1348 1309
1349 if (art == NULL) 1310 if (!art)
1350 art = al->items; 1311 art = al->items;
1351 1312
1352 /* separator of items */ 1313 buf << '\n';
1353 strcpy (buf, "--- \n");
1354 1314
1355 /* Name */ 1315 /* Name */
1356 if (art->allowed != NULL && strcmp (art->allowed->name, "All")) 1316 if (art->allowed && art->allowed->name != shstr_All)
1357 { 1317 {
1358 linked_char *temp, *next = art->allowed; 1318 linked_char *temp, *next = art->allowed;
1359 1319
1360 do 1320 do
1361 { 1321 {
1362 temp = next; 1322 temp = next;
1363 next = next->next; 1323 next = next->next;
1364 } 1324 }
1365 while (next && !RANDOM () % 2); 1325 while (next && rndm (2));
1326
1366 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);
1367 } 1328 }
1368 else /* default name is used */ 1329 else /* default name is used */
1369 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 ";
1370 1333
1371 /* chance of finding */ 1334 /* chance of finding */
1372 chance = (int) (100 * ((float) art->chance / al->total_chance)); 1335 chance = (int) (100 * ((float) art->chance / al->total_chance));
1373 if (chance >= 20) 1336 if (chance >= 20)
1374 sprintf (sbuf, "an uncommon"); 1337 buf << "an uncommon";
1375 else if (chance >= 10) 1338 else if (chance >= 10)
1376 sprintf (sbuf, "an unusual"); 1339 buf << "an unusual";
1377 else if (chance >= 5) 1340 else if (chance >= 5)
1378 sprintf (sbuf, "a rare"); 1341 buf << "a rare";
1379 else 1342 else
1380 sprintf (sbuf, "a very rare"); 1343 buf << "a very rare";
1381 sprintf (buf, "%s is %s\n", buf, sbuf);
1382 1344
1383 /* value of artifact */ 1345 /* value of artifact */
1384 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";
1385 1347
1386 /* include the message about the artifact, if exists, and book 1348 /* include the message about the artifact, if exists, and book
1387 * level is kinda high */ 1349 * level is kinda high */
1388 if (art->item->msg && (RANDOM () % 4 + 1) < level && !((strlen (art->item->msg) + strlen (buf)) > BOOK_BUF)) 1350 if (art->item->msg
1351 && rndm (4) + 1 < level)
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 strng: %d\n", strlen (retbuf));
1411 fprintf (logfile, " 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 1379static char *
1425char *
1426spellpath_msg (int level, int booksize) 1380spellpath_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 = RANDOM () % NRSPELLPATHS, prayers = RANDOM () % 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 (RANDOM () % 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 } 1419
1473 else
1474 {
1475 strcat (retbuf, "\n");
1476 }
1477 return retbuf; 1420 return buf;
1478} 1421}
1479 1422
1480/* formula_msg() - generate a message detailing the properties 1423/* formula_msg() - generate a message detailing the properties
1481 * of a randomly selected alchemical formula. 1424 * of a randomly selected alchemical formula.
1482 */ 1425 */
1483void 1426static void
1484make_formula_book (object *book, int level) 1427make_formula_book (object *book, int level)
1485{ 1428{
1486 char retbuf[BOOK_BUF], title[MAX_BUF]; 1429 char title[MAX_BUF];
1487 recipelist *fl; 1430 recipelist *fl;
1488 recipe *formula = NULL; 1431 recipe *formula = NULL;
1489 int chance; 1432 int chance;
1490 1433
1434 static dynbuf_text buf; buf.clear ();
1435
1491 /* the higher the book level, the more complex (ie number of 1436 /* the higher the book level, the more complex (ie number of
1492 * ingredients) the formula can be. 1437 * ingredients) the formula can be.
1493 */ 1438 */
1494 fl = get_formulalist (((RANDOM () % level) / 3) + 1); 1439 fl = get_formulalist (rndm (level) / 3 + 1);
1495 1440
1496 if (!fl) 1441 if (!fl)
1497 fl = get_formulalist (1); /* safety */ 1442 fl = get_formulalist (1); /* safety */
1498 1443
1499 if (fl->total_chance == 0) 1444 if (fl->total_chance == 0)
… …
1503 add_author (book, 4); 1448 add_author (book, 4);
1504 return; 1449 return;
1505 } 1450 }
1506 1451
1507 /* get a random formula, weighted by its bookchance */ 1452 /* get a random formula, weighted by its bookchance */
1508 chance = RANDOM () % fl->total_chance; 1453 chance = rndm (fl->total_chance);
1509 for (formula = fl->items; formula != NULL; formula = formula->next) 1454 for (formula = fl->items; formula; formula = formula->next)
1510 { 1455 {
1511 chance -= formula->chance; 1456 chance -= formula->chance;
1457
1512 if (chance <= 0) 1458 if (chance <= 0)
1513 break; 1459 break;
1514 } 1460 }
1515 1461
1516 if (!formula || formula->arch_names <= 0) 1462 if (!formula || formula->arch_names <= 0)
1517 { 1463 {
1518 book->msg = "<indecipherable text>\n"; 1464 book->msg = "<indecipherable text>\n";
1519 new_text_name (book, 4); 1465 new_text_name (book, 4);
1520 add_author (book, 4); 1466 add_author (book, 4);
1521 1467 return;
1522 } 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;
1523 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);
1524 { 1498 }
1525 /* looks like a formula was found. Base the amount 1499 else
1526 * of information on the booklevel and the spellevel 1500 {
1527 * of the formula. */ 1501 buf << "The B<< " << op_name;
1528 1502
1529 const char *op_name = formula->arch_name[RANDOM () % 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;
1530 archetype *at; 1522 archetype *at;
1531 1523
1532 /* preamble */
1533 sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill");
1534
1535 if ((at = archetype::find (op_name)) != (archetype *) NULL)
1536 op_name = at->object::name;
1537 else
1538 LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name);
1539
1540 /* item name */
1541 if (strcmp (formula->title, "NONE"))
1542 {
1543 sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title);
1544 /* This results in things like pile of philo. sulfur.
1545 * while philo. sulfur may look better, without this,
1546 * you get things like 'the wise' because its missing the
1547 * water of section.
1548 */
1549 sprintf (title, "%s: %s of %s",
1550 formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title);
1551 }
1552 else
1553 {
1554 sprintf (retbuf, "%sThe %s", retbuf, op_name);
1555 sprintf (title, "%s: %s", formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name);
1556 if (at->title)
1557 {
1558 strcat (retbuf, " ");
1559 strcat (retbuf, at->title);
1560 strcat (title, " ");
1561 strcat (title, at->title);
1562 }
1563 }
1564 /* Lets name the book something meaningful ! */
1565 book->name = title;
1566 book->title = NULL;
1567
1568 /* ingredients to make it */
1569 if (formula->ingred != NULL)
1570 {
1571 linked_char *next;
1572 archetype *at;
1573
1574 at = archetype::find (formula->cauldron); 1524 at = archetype::find (formula->cauldron);
1575 1525
1576 sprintf (retbuf + strlen (retbuf), 1526 buf.printf (" may be made at %s using the following ingredients:\n\n",
1577 " 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");
1578 1528
1579 for (next = formula->ingred; next != NULL; next = next->next) 1529 for (next = formula->ingred; next; next = next->next)
1580 { 1530 buf << next->name << '\r';
1581 strcat (retbuf, next->name); 1531 }
1582 strcat (retbuf, "\n");
1583 }
1584 }
1585 else 1532 else
1586 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);
1587 if (retbuf[strlen (retbuf) - 1] != '\n')
1588 strcat (retbuf, "\n");
1589 1534
1590 book->msg = retbuf; 1535 book->msg = buf;
1591 }
1592} 1536}
1593 1537
1594#define DESCRIBE_PATH(retbuf, variable, name) \ 1538#define DESCRIBE_PATH(retbuf, variable, name) \
1595 if(variable) { \ 1539 if(variable) { \
1596 int i,j=0; \ 1540 int i,j=0; \
… …
1607 } 1551 }
1608 1552
1609/* god_info_msg() - generate a message detailing the properties 1553/* god_info_msg() - generate a message detailing the properties
1610 * of a random god. Used by the book hack. b.t. 1554 * of a random god. Used by the book hack. b.t.
1611 */ 1555 */
1612const char * 1556static const char *
1613god_info_msg (int level, int booksize) 1557god_info_msg (int level)
1614{ 1558{
1615 static char retbuf[BOOK_BUF];
1616 const char *name = NULL; 1559 const char *name = NULL;
1617 char buf[BOOK_BUF];
1618 int i;
1619 size_t introlen;
1620 object *god = pntr_to_god_obj (get_rand_god ()); 1560 object *god = pntr_to_god_obj (get_rand_god ());
1621 1561
1562 static dynbuf_text buf; buf.clear ();
1563
1622 if (!god) 1564 if (!god)
1623 return (char *) NULL; /* oops, problems... */ 1565 return 0; /* oops, problems... */
1566
1624 name = god->name; 1567 name = god->name;
1625 1568
1626 /* preamble.. */ 1569 /* preamble.. */
1627 sprintf (retbuf, "This document contains knowledge concerning\n"); 1570 buf << "This document contains knowledge concerning the diety B<< "
1628 sprintf (retbuf, "%sthe diety %s", retbuf, name); 1571 << name << " >>";
1629 1572
1630 /* Always have as default information the god's descriptive terms. */ 1573 /* Always have as default information the god's descriptive terms. */
1631 if (nstrtok (god->msg, ",") > 0) 1574 if (nstrtok (god->msg, ",") > 0)
1632 { 1575 buf << ", known as" << strtoktolin (god->msg, ",");
1633 strcat (retbuf, ", known as");
1634 strcat (retbuf, strtoktolin (god->msg, ","));
1635 }
1636 else 1576 else
1637 strcat (retbuf, "..."); 1577 buf << "...";
1638 1578
1639 strcat (retbuf, "\n ---\n"); 1579 buf << "\n\n";
1580
1640 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 */
1641 1582
1642 /* 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
1643 * 'book'. Probably there is a more intellegent way to implement 1584 * 'book'. Probably there is a more intellegent way to implement
1644 * this ... 1585 * this ...
1645 */ 1586 */
1646 while (level > 0) 1587 while (level > 0 && buf.size () < BOOK_BUF)
1647 { 1588 {
1648 sprintf (buf, " ");
1649 if (level == 2 && RANDOM () % 2) 1589 if (level == 2 && rndm (2))
1650 { /* enemy god */ 1590 { /* enemy god */
1651 const char *enemy = god->title; 1591 const char *enemy = god->title;
1652 1592
1653 if (enemy) 1593 if (enemy)
1654 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);
1655 } 1595 }
1656 1596
1657 if (level == 3 && RANDOM () % 2) 1597 if (level == 3 && rndm (2))
1658 { /* enemy race, what the god's holy word effects */ 1598 { /* enemy race, what the god's holy word effects */
1659 const char *enemy = god->slaying; 1599 const char *enemy = god->slaying;
1600 int i;
1660 1601
1661 if (enemy && !(god->path_denied & PATH_TURNING)) 1602 if (enemy && !(god->path_denied & PATH_TURNING))
1662 if ((i = nstrtok (enemy, ",")) > 0) 1603 if ((i = nstrtok (enemy, ",")) > 0)
1663 { 1604 {
1664 char tmpbuf[MAX_BUF]; 1605 char tmpbuf[MAX_BUF];
1665 1606
1666 sprintf (buf, "The holy words of %s have the power to\n", name); 1607 buf << "The holy words of " << name
1667 strcat (buf, "slay creatures belonging to the "); 1608 << " have the power to slay creatures belonging to the ";
1609
1668 if (i > 1) 1610 if (i > 1)
1669 sprintf (tmpbuf, "following \n races:%s", strtoktolin (enemy, ",")); 1611 buf << "following races:" << strtoktolin (enemy, ",");
1670 else 1612 else
1671 sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); 1613 buf << "race of" << strtoktolin (enemy, ",");
1672 sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); 1614
1615 buf << '\r';
1673 } 1616 }
1674 } 1617 }
1675 1618
1676 if (level == 4 && RANDOM () % 2) 1619 if (level == 4 && rndm (2))
1677 { /* Priest of god gets these protect,vulnerable... */ 1620 { /* Priest of god gets these protect,vulnerable... */
1678 char tmpbuf[MAX_BUF];
1679
1680 if (const char *cp = describe_resistance (god, 1)) 1621 if (const char *cp = describe_resistance (god, 1))
1681 { /* This god does have protections */ 1622 { /* This god does have protections */
1682 sprintf (tmpbuf, "%s has a potent aura which is extended\n", name); 1623 buf << name
1624 << " has a potent aura which is extended to"
1683 strcat (tmpbuf, "faithful priests. The effects of this aura include:\n"); 1625 " faithful priests. The effects of this aura include: "
1684 strcat (tmpbuf, cp); 1626 << cp
1685 strcat (buf, tmpbuf); 1627 << ".\r";
1686 strcat (buf, "\n ---\n");
1687 } 1628 }
1688 else
1689 sprintf (buf, " ");
1690 } 1629 }
1691 1630
1692 if (level == 5 && RANDOM () % 2) 1631 if (level == 5 && rndm (2))
1693 { /* aligned race, summoning */ 1632 { /* aligned race, summoning */
1694 const char *race = god->race; /* aligned race */ 1633 const char *race = god->race; /* aligned race */
1634 int i;
1695 1635
1696 if (race && !(god->path_denied & PATH_SUMMON)) 1636 if (race && !(god->path_denied & PATH_SUMMON))
1697 if ((i = nstrtok (race, ",")) > 0) 1637 if ((i = nstrtok (race, ",")) > 0)
1698 { 1638 {
1699 char tmpbuf[MAX_BUF]; 1639 buf << "Creatures sacred to " << name << " include the ";
1700
1701 sprintf (buf, "Creatures sacred to %s include the \n", name);
1702 if (i > 1) 1640 if (i > 1)
1703 sprintf (tmpbuf, "following \n races:%s", strtoktolin (race, ",")); 1641 buf << "following races:" << strtoktolin (race, ",");
1704 else 1642 else
1705 sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); 1643 buf << "race of" << strtoktolin (race, ",");
1706 sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); 1644
1645 buf << '\r';
1707 } 1646 }
1708 } 1647 }
1709 1648
1710 if (level == 6 && RANDOM () % 2) 1649 if (level == 6 && rndm (2))
1711 { /* blessing,curse properties of the god */ 1650 { /* blessing,curse properties of the god */
1712 char tmpbuf[MAX_BUF];
1713
1714 if (const char *cp = describe_resistance (god, 1)) 1651 if (const char *cp = describe_resistance (god, 1))
1715 { /* This god does have protections */ 1652 { /* This god does have protections */
1716 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 "
1717 strcat (tmpbuf, "bestow a blessing which makes the recipient\n"); 1655 "bestow a blessing which makes the recipient "
1718 strcat (tmpbuf, cp); 1656 << cp
1719 strcat (buf, tmpbuf); 1657 << '\r';
1720 strcat (buf, "\n ---\n");
1721 } 1658 }
1722 else
1723 sprintf (buf, " ");
1724
1725 } 1659 }
1726 1660
1727 if (level == 8 && RANDOM () % 2) 1661 if (level == 8 && rndm (2))
1728 { /* immunity, holy possession */ 1662 { /* immunity, holy possession */
1729 int has_effect = 0, tmpvar; 1663 buf << "The priests of " << name
1730 char tmpbuf[MAX_BUF]; 1664 << " are known to make cast a mighty"
1665 " prayer of possession";
1666
1667 int first = 1;
1731 1668
1732 sprintf (tmpbuf, "\n");
1733 sprintf (tmpbuf, "The priests of %s are known to make cast a mighty \n", name);
1734
1735 strcat (tmpbuf, "prayer of possession which gives the recipient\n");
1736
1737 for (tmpvar = 0; tmpvar < NROFATTACKS; tmpvar++) 1669 for (int i = 0; i < NROFATTACKS; i++)
1670 if (god->resist[i] == 100)
1738 { 1671 {
1739 if (god->resist[tmpvar] == 100) 1672 if (first)
1740 { 1673 {
1674 buf << " which gives the recipient";
1741 has_effect = 1; 1675 first = 0;
1742 sprintf (tmpbuf + strlen (tmpbuf), "Immunity to %s", attacktype_desc[tmpvar]);
1743 } 1676 }
1677 else
1678 buf << ", ";
1679
1680 buf << " immunity to " << attacktype_desc[i];
1744 } 1681 }
1745 1682
1746 if (has_effect) 1683 buf << ".\r";
1747 {
1748 strcat (buf, tmpbuf);
1749 strcat (buf, "\n ---\n");
1750 }
1751 else
1752 sprintf (buf, " ");
1753 } 1684 }
1754 1685
1755 if (level == 12 && RANDOM () % 2) 1686 if (level == 12 && rndm (2))
1756 { /* spell paths */ 1687 { /* spell paths */
1688 //TODO:
1757 int has_effect = 0, tmpvar; 1689 int has_effect = 0, tmpvar;
1758 char tmpbuf[MAX_BUF]; 1690 char tmpbuf[MAX_BUF];
1759 1691
1760 sprintf (tmpbuf, "\n"); 1692 sprintf (tmpbuf, "\n");
1761 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);
… …
1778 has_effect = 1; 1710 has_effect = 1;
1779 DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); 1711 DESCRIBE_PATH (tmpbuf, tmpvar, "Denied");
1780 } 1712 }
1781 1713
1782 if (has_effect) 1714 if (has_effect)
1783 { 1715 buf << tmpbuf << '\r';
1784 strcat (buf, tmpbuf);
1785 strcat (buf, "\n ---\n");
1786 }
1787 else 1716 else
1788 sprintf (buf, " "); 1717 buf << '\r';
1789 } 1718 }
1790 1719
1791 /* check to be sure new buffer size dont exceed either
1792 * the maximum buffer size, or the 'natural' size of the
1793 * book...
1794 */
1795 if (book_overflow (retbuf, buf, booksize))
1796 break;
1797 else if (strlen (buf) > 1)
1798 strcat (retbuf, buf);
1799
1800 level--; 1720 level--;
1801 } 1721 }
1802 1722
1803 if (strlen (retbuf) == introlen) 1723 if (buf.size () == introlen)
1804 { /* we got no information beyond the preamble! */ 1724 /* we got no information beyond the preamble! */
1805 strcat (retbuf, " [Unfortunately the rest of the information is\n"); 1725 buf << "[Unfortunately the rest of the information is hopelessly garbled!]";
1806 strcat (retbuf, " hopelessly garbled!]\n ---\n"); 1726
1807 }
1808#ifdef BOOK_MSG_DEBUG
1809 LOG (llevDebug, "\n god_info_msg() created strng: %d\n", strlen (retbuf));
1810 fprintf (logfile, " MADE THIS:\n%s", retbuf);
1811#endif
1812 return retbuf; 1727 return buf;
1813} 1728}
1814 1729
1815/* tailor_readable_ob()- The main routine. This chooses a random 1730/* tailor_readable_ob()- The main routine. This chooses a random
1816 * message to put in given readable object (type==BOOK) which will 1731 * message to put in given readable object (type==BOOK) which will
1817 * 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-
… …
1829 * 1744 *
1830 */ 1745 */
1831void 1746void
1832tailor_readable_ob (object *book, int msg_type) 1747tailor_readable_ob (object *book, int msg_type)
1833{ 1748{
1834 char msgbuf[BOOK_BUF];
1835 int level = book->level ? (RANDOM () % book->level) + 1 : 1; 1749 int level = book->level ? rndm (book->level) + 1 : 1;
1836 int book_buf_size;
1837 1750
1838 /* safety */ 1751 /* safety */
1839 if (book->type != BOOK) 1752 if (book->type != BOOK)
1840 return; 1753 return;
1841 1754
1842 if (level <= 0) 1755 if (level <= 0)
1843 return; /* if no level no point in doing any more... */ 1756 return; /* if no level no point in doing any more... */
1844
1845 /* Max text length this book can have. */
1846 book_buf_size = BOOKSIZE (book);
1847 1757
1848 /* &&& The message switch &&& */ 1758 /* &&& The message switch &&& */
1849 /* 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.
1850 */ 1760 */
1851 /* 1761 /*
… …
1854 * 2) make sure there is an entry in max_titles[] array. 1764 * 2) make sure there is an entry in max_titles[] array.
1855 * 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()
1856 * and add_authour(). 1766 * and add_authour().
1857 * 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
1858 */ 1768 */
1769 const char *new_msg = "";
1859 msg_type = msg_type > 0 ? msg_type : (RANDOM () % 8); 1770 msg_type = msg_type > 0 ? msg_type : rndm (8);
1860 switch (msg_type) 1771 switch (msg_type)
1861 { 1772 {
1862 case 1: /* monster attrib */ 1773 case 1: /* monster attrib */
1863 strcpy (msgbuf, mon_info_msg (level, book_buf_size)); 1774 new_msg = mon_info_msg (level);
1864 break; 1775 break;
1865 case 2: /* artifact attrib */ 1776 case 2: /* artifact attrib */
1866 strcpy (msgbuf, artifact_msg (level, book_buf_size)); 1777 new_msg = artifact_msg (level);
1867 break; 1778 break;
1868 case 3: /* grouping incantations/prayers by path */ 1779 case 3: /* grouping incantations/prayers by path */
1869 strcpy (msgbuf, spellpath_msg (level, book_buf_size)); 1780 new_msg = spellpath_msg (level);
1870 break; 1781 break;
1871 case 4: /* describe an alchemy formula */ 1782 case 4: /* describe an alchemy formula */
1872 make_formula_book (book, level); 1783 make_formula_book (book, level);
1873 /* make_formula_book already gives title */ 1784 /* make_formula_book already gives title */
1874 return; 1785 return;
1875 break;
1876 case 5: /* bits of information about a god */ 1786 case 5: /* bits of information about a god */
1877 strcpy (msgbuf, god_info_msg (level, book_buf_size)); 1787 new_msg = god_info_msg (level);
1878 break; 1788 break;
1879 case 0: /* use info list in lib/ */ 1789 case 0: /* use info list in lib/ */
1880 default: 1790 default:
1881 cfperl_make_book (book, level); 1791 cfperl_make_book (book, level);
1792 /* already gives title */
1882 return; 1793 return;
1883 } 1794 }
1884 1795
1885 strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */
1886
1887 if (strlen (msgbuf) > 1) 1796 if (strlen (new_msg) > 1)
1888 { 1797 {
1889 book->msg = msgbuf; 1798 book->msg = new_msg;
1890 /* 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 */
1891 change_book (book, msg_type); 1800 change_book (book, msg_type);
1892 } 1801 }
1893} 1802}
1894
1895
1896/*****************************************************************************
1897 *
1898 * Cleanup routine for readble stuff.
1899 *
1900 *****************************************************************************/
1901
1902void
1903free_all_readable (void)
1904{
1905 titlelist *tlist, *tnext;
1906 title *title1, *titlenext;
1907 linked_char *lmsg, *nextmsg;
1908 objectlink *monlink, *nextmon;
1909
1910 LOG (llevDebug, "freeing all book information\n");
1911
1912 for (tlist = booklist; tlist != NULL; tlist = tnext)
1913 {
1914 tnext = tlist->next;
1915
1916 for (title1 = tlist->first_book; title1; title1 = titlenext)
1917 {
1918 titlenext = title1->next;
1919 delete title1;
1920 }
1921
1922 delete tlist;
1923 }
1924
1925 for (lmsg = first_msg; lmsg; lmsg = nextmsg)
1926 {
1927 nextmsg = lmsg->next;
1928 delete lmsg;
1929 }
1930
1931 for (monlink = first_mon_info; monlink; monlink = nextmon)
1932 {
1933 nextmon = monlink->next;
1934 delete monlink;
1935 }
1936}
1937
1938 1803
1939/***************************************************************************** 1804/*****************************************************************************
1940 * 1805 *
1941 * Writeback routine for updating the bookarchive. 1806 * Writeback routine for updating the bookarchive.
1942 * 1807 *
1943 ****************************************************************************/ 1808 ****************************************************************************/
1944
1945/* write_book_archive() - write out the updated book archive */ 1809/* write_book_archive() - write out the updated book archive */
1946
1947void 1810void
1948write_book_archive (void) 1811write_book_archive (void)
1949{ 1812{
1950 FILE *fp; 1813 FILE *fp;
1951 int index = 0; 1814 int index = 0;
… …
1954 titlelist *bl = get_titlelist (0); 1817 titlelist *bl = get_titlelist (0);
1955 1818
1956 /* If nothing changed, don't write anything */ 1819 /* If nothing changed, don't write anything */
1957 if (!need_to_write_bookarchive) 1820 if (!need_to_write_bookarchive)
1958 return; 1821 return;
1822
1959 need_to_write_bookarchive = 0; 1823 need_to_write_bookarchive = 0;
1960 1824
1961 sprintf (fname, "%s/bookarch", settings.localdir); 1825 sprintf (fname, "%s/bookarch", settings.localdir);
1962 LOG (llevDebug, "Updating book archive: %s...\n", fname); 1826 LOG (llevDebug, "Updating book archive: %s...\n", fname);
1963 1827
1964 if ((fp = fopen (fname, "w")) == NULL) 1828 if ((fp = fopen (fname, "w")) == NULL)
1965 {
1966 LOG (llevDebug, "Can't open book archive file %s\n", fname); 1829 LOG (llevDebug, "Can't open book archive file %s\n", fname);
1967 }
1968 else 1830 else
1969 { 1831 {
1970 while (bl) 1832 while (bl)
1971 { 1833 {
1972 for (book = bl->first_book; book; book = book->next) 1834 for (book = bl->first_book; book; book = book->next)
… …
1979 fprintf (fp, "type %d\n", index); 1841 fprintf (fp, "type %d\n", index);
1980 fprintf (fp, "size %d\n", book->size); 1842 fprintf (fp, "size %d\n", book->size);
1981 fprintf (fp, "index %d\n", book->msg_index); 1843 fprintf (fp, "index %d\n", book->msg_index);
1982 fprintf (fp, "end\n"); 1844 fprintf (fp, "end\n");
1983 } 1845 }
1846
1984 bl = bl->next; 1847 bl = bl->next;
1985 index++; 1848 index++;
1986 } 1849 }
1850
1987 fclose (fp); 1851 fclose (fp);
1988 chmod (fname, SAVE_MODE); 1852 chmod (fname, SAVE_MODE);
1989 } 1853 }
1990} 1854}
1855
1991readable_message_type * 1856readable_message_type *
1992get_readable_message_type (object *readable) 1857get_readable_message_type (object *readable)
1993{ 1858{
1994 uint8 subtype = readable->subtype; 1859 uint8 subtype = readable->subtype;
1995 1860

Diff Legend

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