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.31 by root, Tue Jul 10 06:05:55 2007 UTC vs.
Revision 1.43 by root, Thu Oct 15 20:45:01 2009 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT 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 <crossfire@schmorp.de> 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
25 * to allow randomly occuring messages in non-magical texts. 26 * to allow randomly occuring messages in non-magical texts.
26 */ 27 */
… …
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)
1005 { 997 {
1006 case BOOK: 998 case BOOK:
1007 { 999 {
1008 titlelist *tl = get_titlelist (msgtype); 1000 titlelist *tl = get_titlelist (msgtype);
1009 title *t = NULL; 1001 title *t = NULL;
1010 int tries = 0; 1002 int tries = 0;
1011 1003
1012 /* look to see if our msg already been archived. If so, alter 1004 /* look to see if our msg already been archived. If so, alter
1013 * the book to match the archival text. If we fail to match, 1005 * the book to match the archival text. If we fail to match,
1014 * then we archive the new title/name/msg combo if there is 1006 * then we archive the new title/name/msg combo if there is
1015 * room on the titlelist. 1007 * room on the titlelist.
1016 */ 1008 */
1017 1009
1018 if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) 1010 if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype)))
1019 { 1011 {
1020 object *tmpbook;
1021
1022 /* alter book properties */ 1012 /* alter book properties */
1023 if ((tmpbook = get_archetype (t->archname)) != NULL) 1013 if (object *tmpbook = get_archetype (t->archname))
1014 {
1015 tmpbook->msg = book->msg;
1016 tmpbook->copy_to (book);
1017 tmpbook->destroy ();
1018 }
1019
1020 book->title = t->authour;
1021 book->name = t->name;
1022 book->level = t->level;
1023 }
1024 /* Don't have any default title, so lets make up a new one */
1025 else
1026 {
1027 int numb, maxnames = max_titles[msgtype];
1028 const char *old_title;
1029 const char *old_name;
1030
1031 old_title = book->title;
1032 old_name = book->name;
1033
1034 /* some pre-generated books have title already set (from
1035 * maps), also don't bother looking for unique title if
1036 * we already used up all the available names! */
1037
1038 if (!tl)
1039 {
1040 LOG (llevError, "change_book_name(): can't find title list\n");
1041 numb = 0;
1042 }
1043 else
1044 numb = tl->number;
1045
1046 if (numb == maxnames)
1047 {
1048#ifdef ARCHIVE_DEBUG
1049 LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames);
1050#endif
1051 }
1052 /* shouldnt change map-maker books */
1053 else if (!book->title)
1054 do
1024 { 1055 {
1025 tmpbook->msg = book->msg; 1056 /* random book name */
1026 tmpbook->copy_to (book); 1057 new_text_name (book, msgtype);
1027 tmpbook->destroy (); 1058 add_author (book, msgtype); /* random author */
1059 tries++;
1028 } 1060 }
1061 while (!unique_book (book, msgtype) && tries < MAX_TITLE_CHECK);
1029 1062
1030 book->title = t->authour; 1063 /* Now deal with 2 cases.
1031 book->name = t->name; 1064 * 1)If no space for a new title exists lets just restore
1032 book->level = t->level; 1065 * the old book properties. Remember, if the book had
1066 * matchd an older entry on the titlelist, we shouldnt
1067 * have called this routine in the first place!
1068 * 2) If we got a unique title, we need to add it to
1069 * the list.
1033 } 1070 */
1034 /* Don't have any default title, so lets make up a new one */
1035 else
1036 {
1037 int numb, maxnames = max_titles[msgtype];
1038 const char *old_title;
1039 const char *old_name;
1040 1071
1041 old_title = book->title; 1072 if (tries == MAX_TITLE_CHECK || numb == maxnames)
1042 old_name = book->name; 1073 { /* got to check maxnames again */
1043
1044 /* some pre-generated books have title already set (from
1045 * maps), also don't bother looking for unique title if
1046 * we already used up all the available names! */
1047
1048 if (!tl)
1049 {
1050 LOG (llevError, "change_book_name(): can't find title list\n");
1051 numb = 0;
1052 }
1053 else
1054 numb = tl->number;
1055
1056 if (numb == maxnames)
1057 {
1058#ifdef ARCHIVE_DEBUG 1074#ifdef ARCHIVE_DEBUG
1059 LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); 1075 LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", &book->name, &book->title, numb, maxnames);
1060#endif 1076#endif
1061 break; 1077 /* restore old book properties here */
1062 } 1078 book->title = old_title;
1063 /* shouldnt change map-maker books */ 1079
1064 else if (!book->title) 1080 if (rndm (4))
1065 do
1066 { 1081 {
1067 /* random book name */ 1082 /* Lets give the book a description to individualize it some */
1068 new_text_name (book, msgtype); 1083 char new_name[MAX_BUF];
1069 add_author (book, msgtype); /* random author */ 1084
1070 tries++; 1085 snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name);
1086
1087 book->name = new_name;
1071 } 1088 }
1072 while (!unique_book (book, msgtype) && tries < MAX_TITLE_CHECK);
1073
1074 /* Now deal with 2 cases.
1075 * 1)If no space for a new title exists lets just restore
1076 * the old book properties. Remember, if the book had
1077 * matchd an older entry on the titlelist, we shouldnt
1078 * have called this routine in the first place!
1079 * 2) If we got a unique title, we need to add it to
1080 * the list.
1081 */
1082
1083 if (tries == MAX_TITLE_CHECK || numb == maxnames)
1084 { /* got to check maxnames again */
1085#ifdef ARCHIVE_DEBUG
1086 LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames);
1087#endif
1088 /* restore old book properties here */
1089 book->title = old_title;
1090
1091 if (RANDOM () % 4)
1092 {
1093 /* Lets give the book a description to individualize it some */
1094 char new_name[MAX_BUF];
1095
1096 snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name);
1097
1098 book->name = new_name;
1099 }
1100 else 1089 else
1101 { 1090 {
1102 book->name = old_name; 1091 book->name = old_name;
1103 } 1092 }
1104 } 1093 }
1105 else if (book->title && strlen (book->msg) > 5) 1094 else if (book->title && strlen (book->msg) > 5)
1106 { /* archive if long msg texts */ 1095 { /* archive if long msg texts */
1107 add_book_to_list (book, msgtype); 1096 add_book_to_list (book, msgtype);
1108 } 1097 }
1109 } 1098 }
1110 break; 1099 break;
1111 } 1100 }
1112 1101
1113 default: 1102 default:
1114 LOG (llevError, "change_book_name() called w/ illegal obj type.\n"); 1103 LOG (llevError, "change_book_name() called w/ illegal obj type.\n");
1115 return; 1104 return;
1116 } 1105 }
1117} 1106}
1118 1107
1119/***************************************************************************** 1108/*****************************************************************************
1120 * 1109 *
… …
1131 * 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,
1132 * then only monsters greater than that level will be returned. 1121 * then only monsters greater than that level will be returned.
1133 * Changed 971225 to be greater than equal to level passed. Also 1122 * Changed 971225 to be greater than equal to level passed. Also
1134 * made choosing by level more random. 1123 * made choosing by level more random.
1135 */ 1124 */
1136
1137object * 1125object *
1138get_random_mon (int level) 1126get_random_mon (int level)
1139{ 1127{
1140 objectlink *mon = first_mon_info; 1128 objectlink *mon = first_mon_info;
1141 int i = 0, monnr; 1129 int i = 0, monnr;
… …
1145 return (object *) NULL; 1133 return (object *) NULL;
1146 1134
1147 if (!level) 1135 if (!level)
1148 { 1136 {
1149 /* lets get a random monster from the mon_info linked list */ 1137 /* lets get a random monster from the mon_info linked list */
1150 monnr = RANDOM () % nrofmon; 1138 monnr = rndm (nrofmon);
1151 1139
1152 for (mon = first_mon_info, i = 0; mon; mon = mon->next) 1140 for (mon = first_mon_info, i = 0; mon; mon = mon->next)
1153 if (i++ == monnr) 1141 if (i++ == monnr)
1154 break; 1142 break;
1155 1143
… …
1182 { 1170 {
1183 LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level); 1171 LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level);
1184 return NULL; 1172 return NULL;
1185 } 1173 }
1186 1174
1187 monnr = RANDOM () % i; 1175 monnr = rndm (i);
1188 for (mon = first_mon_info; mon; mon = mon->next) 1176 for (mon = first_mon_info; mon; mon = mon->next)
1189 if (mon->ob->level >= level && monnr-- == 0) 1177 if (mon->ob->level >= level && monnr-- == 0)
1190 return mon->ob; 1178 return mon->ob;
1191 1179
1192 if (!mon) 1180 if (!mon)
… …
1199 1187
1200/* 1188/*
1201 * Returns a description of the monster. This really needs to be 1189 * Returns a description of the monster. This really needs to be
1202 * redone, as describe_item really gives a pretty internal description. 1190 * redone, as describe_item really gives a pretty internal description.
1203 */ 1191 */
1204 1192static const char *
1205char *
1206mon_desc (const object *mon) 1193mon_desc (const object *mon)
1207{ 1194{
1208 static char retbuf[HUGE_BUF]; 1195 static dynbuf_text buf; buf.clear ();
1209 1196
1210 sprintf (retbuf, " *** %s ***\n", &mon->name); 1197 buf.printf (" *** %s ***\n", &mon->name);
1211 strcat (retbuf, describe_item (mon, NULL)); 1198 buf << describe_item (mon, 0);
1212 1199
1213 return retbuf; 1200 return buf;
1214} 1201}
1215 1202
1216 1203
1217/* 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
1218 * 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
1219 * calling function (mon_info_msg) seems to expect that. 1206 * calling function (mon_info_msg) seems to expect that.
1220 */ 1207 */
1221 1208static object *
1222object *
1223get_next_mon (object *tmp) 1209get_next_mon (object *tmp)
1224{ 1210{
1225 objectlink *mon; 1211 objectlink *mon;
1226 1212
1227 for (mon = first_mon_info; mon; mon = mon->next) 1213 for (mon = first_mon_info; mon; mon = mon->next)
… …
1236 else 1222 else
1237 return first_mon_info->ob; 1223 return first_mon_info->ob;
1238 1224
1239} 1225}
1240 1226
1241
1242
1243/* mon_info_msg() - generate a message detailing the properties 1227/* mon_info_msg() - generate a message detailing the properties
1244 * of a randomly selected monster. 1228 * of a randomly selected monster.
1245 */ 1229 */
1246 1230static const char *
1247char *
1248mon_info_msg (int level, int booksize) 1231mon_info_msg (int level, int booksize)
1249{ 1232{
1250 static char retbuf[BOOK_BUF]; 1233 static dynbuf_text buf; buf.clear ();
1251 char tmpbuf[HUGE_BUF];
1252 object *tmp;
1253 1234
1254 /*preamble */ 1235 /*preamble */
1255 strcpy (retbuf, "This beastiary contains:"); 1236 buf << "This beastiary contains:\n";
1256 1237
1257 /* 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
1258 * document. 1239 * document.
1259 * 8-96 Had to change this a bit, otherwise there would 1240 * 8-96 Had to change this a bit, otherwise there would
1260 * have been an impossibly large number of combinations 1241 * have been an impossibly large number of combinations
1261 * of text! (and flood out the available number of titles 1242 * of text! (and flood out the available number of titles
1262 * in the archive in a snap!) -b.t. 1243 * in the archive in a snap!) -b.t.
1263 */ 1244 */
1264 tmp = get_random_mon (level * 3); 1245 object *tmp = get_random_mon (level * 3);
1265 while (tmp) 1246 while (tmp && buf.size () < BOOK_BUF)
1266 { 1247 {
1267 /* monster description */ 1248 /* monster description */
1268 sprintf (tmpbuf, "\n---\n%s", mon_desc (tmp)); 1249 buf.printf ("\n%s\n", mon_desc (tmp));
1269
1270 if (!book_overflow (retbuf, tmpbuf, booksize))
1271 strcat (retbuf, tmpbuf);
1272 else
1273 break;
1274 1250
1275 /* Note that the value this returns is not based on level */ 1251 /* Note that the value this returns is not based on level */
1276 tmp = get_next_mon (tmp); 1252 tmp = get_next_mon (tmp);
1277 } 1253 }
1278 1254
1279#ifdef BOOK_MSG_DEBUG
1280 LOG (llevDebug, "\n mon_info_msg() created strng: %d\n", strlen (retbuf));
1281 fprintf (logfile, " MADE THIS:\n%s\n", retbuf);
1282#endif
1283
1284 return retbuf; 1255 return buf;
1285} 1256}
1286 1257
1287 1258
1288/***************************************************************************** 1259/*****************************************************************************
1289 * Artifact msg generation code. 1260 * Artifact msg generation code.
1290 ****************************************************************************/ 1261 ****************************************************************************/
1291 1262
1292/* artifact_msg() - generate a message detailing the properties 1263/* artifact_msg() - generate a message detailing the properties
1293 * of 1-6 artifacts drawn sequentially from the artifact list. 1264 * of 1-6 artifacts drawn sequentially from the artifact list.
1294 */ 1265 */
1295const char * 1266static const char *
1296artifact_msg (int level, int booksize) 1267artifact_msg (int level, int booksize)
1297{ 1268{
1298 artifactlist *al = NULL; 1269 artifactlist *al = NULL;
1299 artifact *art; 1270 artifact *art;
1300 int chance, i, type, index; 1271 int chance, i, type, index;
1301 int book_entries = level > 5 ? RANDOM () % 3 + RANDOM () % 3 + 2 : RANDOM () % level + 1; 1272 int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1;
1302 const char *ch; 1273 const char *ch;
1303 char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; 1274 char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF];
1304 static char retbuf[BOOK_BUF]; 1275 static char retbuf[BOOK_BUF];
1305 object *tmp = NULL; 1276 object *tmp = NULL;
1306 1277
… …
1314 * for that type exists! 1285 * for that type exists!
1315 */ 1286 */
1316 i = 0; 1287 i = 0;
1317 do 1288 do
1318 { 1289 {
1319 index = RANDOM () % (sizeof (art_name_array) / sizeof (arttypename)); 1290 index = rndm (sizeof (art_name_array) / sizeof (arttypename));
1320 type = art_name_array[index].type; 1291 type = art_name_array[index].type;
1321 al = find_artifactlist (type); 1292 al = find_artifactlist (type);
1322 i++; 1293 i++;
1323 } 1294 }
1324 while ((al == NULL) && (i < 10)); 1295 while ((al == NULL) && (i < 10));
… …
1327 return "None"; 1298 return "None";
1328 1299
1329 /* There is no reason to start on the artifact list at the begining. Lets 1300 /* There is no reason to start on the artifact list at the begining. Lets
1330 * take our starting position randomly... */ 1301 * take our starting position randomly... */
1331 art = al->items; 1302 art = al->items;
1332 for (i = RANDOM () % level + RANDOM () % 2 + 1; i > 0; i--) 1303 for (i = rndm (level) + rndm (2) + 1; i > 0; i--)
1333 { 1304 {
1334 if (art == NULL) 1305 if (!art)
1335 art = al->items; /* hmm, out of stuff, loop back around */ 1306 art = al->items; /* hmm, out of stuff, loop back around */
1307
1336 art = art->next; 1308 art = art->next;
1337 } 1309 }
1338 1310
1339 /* the base 'generic' name for our artifact */ 1311 /* the base 'generic' name for our artifact */
1340 assign (name, art_name_array[index].name); 1312 assign (name, art_name_array[index].name);
… …
1353 1325
1354 /* separator of items */ 1326 /* separator of items */
1355 strcpy (buf, "--- \n"); 1327 strcpy (buf, "--- \n");
1356 1328
1357 /* Name */ 1329 /* Name */
1358 if (art->allowed != NULL && strcmp (art->allowed->name, "All")) 1330 if (art->allowed && art->allowed->name != shstr_All)
1359 { 1331 {
1360 linked_char *temp, *next = art->allowed; 1332 linked_char *temp, *next = art->allowed;
1361 1333
1362 do 1334 do
1363 { 1335 {
1364 temp = next; 1336 temp = next;
1365 next = next->next; 1337 next = next->next;
1366 } 1338 }
1367 while (next && !RANDOM () % 2); 1339 while (next && rndm (2));
1368 sprintf (buf, "%s A %s of %s", buf, &temp->name, &art->item->name); 1340 sprintf (buf, "%s A %s of %s", buf, &temp->name, &art->item->name);
1369 } 1341 }
1370 else /* default name is used */ 1342 else /* default name is used */
1371 sprintf (buf, "%s The %s of %s", buf, name, &art->item->name); 1343 sprintf (buf, "%s The %s of %s", buf, name, &art->item->name);
1372 1344
… …
1385 /* value of artifact */ 1357 /* value of artifact */
1386 sprintf (buf, "%s item with a value that is %d times normal.\n", buf, art->item->value); 1358 sprintf (buf, "%s item with a value that is %d times normal.\n", buf, art->item->value);
1387 1359
1388 /* include the message about the artifact, if exists, and book 1360 /* include the message about the artifact, if exists, and book
1389 * level is kinda high */ 1361 * level is kinda high */
1390 if (art->item->msg && (RANDOM () % 4 + 1) < level && !((strlen (art->item->msg) + strlen (buf)) > BOOK_BUF)) 1362 if (art->item->msg
1363 && rndm (4) + 1 < level
1364 && !(strlen (art->item->msg) + strlen (buf) > BOOK_BUF))
1391 strcat (buf, art->item->msg); 1365 strcat (buf, art->item->msg);
1392 1366
1393 /* properties of the artifact */ 1367 /* properties of the artifact */
1394 tmp = object::create (); 1368 tmp = object::create ();
1395 add_abilities (tmp, art->item); 1369 add_abilities (tmp, art->item);
… …
1407 art = art->next; 1381 art = art->next;
1408 book_entries--; 1382 book_entries--;
1409 } 1383 }
1410 1384
1411#ifdef BOOK_MSG_DEBUG 1385#ifdef BOOK_MSG_DEBUG
1412 LOG (llevDebug, "artifact_msg() created strng: %d\n", strlen (retbuf)); 1386 LOG (llevDebug, "artifact_msg() created string: %d\n", strlen (retbuf));
1413 fprintf (logfile, " MADE THIS:\n%s", retbuf); 1387 LOG (llevDebug, " MADE THIS:\n%s", retbuf);
1414#endif 1388#endif
1415 return retbuf; 1389 return retbuf;
1416} 1390}
1417 1391
1418/***************************************************************************** 1392/*****************************************************************************
… …
1421 1395
1422/* spellpath_msg() - generate a message detailing the member 1396/* spellpath_msg() - generate a message detailing the member
1423 * incantations/prayers (and some of their properties) belonging to 1397 * incantations/prayers (and some of their properties) belonging to
1424 * a given spellpath. 1398 * a given spellpath.
1425 */ 1399 */
1426 1400static char *
1427char *
1428spellpath_msg (int level, int booksize) 1401spellpath_msg (int level, int booksize)
1429{ 1402{
1430 static char retbuf[BOOK_BUF]; 1403 static char retbuf[BOOK_BUF];
1431 char tmpbuf[BOOK_BUF]; 1404 char tmpbuf[BOOK_BUF];
1432 int path = RANDOM () % NRSPELLPATHS, prayers = RANDOM () % 2; 1405 int path = rndm (NRSPELLPATHS), prayers = rndm (2);
1433 int did_first_sp = 0; 1406 int did_first_sp = 0;
1434 uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; 1407 uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path];
1435 archetype *at; 1408 archetype *at;
1436 1409
1437 /* Preamble */ 1410 /* Preamble */
… …
1465 } 1438 }
1466 } 1439 }
1467 /* Geez, no spells were generated. */ 1440 /* Geez, no spells were generated. */
1468 if (!did_first_sp) 1441 if (!did_first_sp)
1469 { 1442 {
1470 if (RANDOM () % 4) /* usually, lets make a recursive call... */ 1443 if (rndm (4)) /* usually, lets make a recursive call... */
1471 spellpath_msg (level, booksize); 1444 spellpath_msg (level, booksize);
1472 else /* give up, cause knowing no spells exist for path is info too. */ 1445 else /* give up, cause knowing no spells exist for path is info too. */
1473 strcat (retbuf, "\n - no known spells exist -\n"); 1446 strcat (retbuf, "\n - no known spells exist -\n");
1474 } 1447 }
1475 else 1448 else
1476 { 1449 {
1477 strcat (retbuf, "\n"); 1450 strcat (retbuf, "\n");
1478 } 1451 }
1452
1453#ifdef BOOK_MSG_DEBUG
1454 LOG (llevDebug, "spellpath_msg() created string: %d\n", strlen (retbuf));
1455 LOG (llevDebug, " MADE THIS:\n%s", retbuf);
1456#endif
1479 return retbuf; 1457 return retbuf;
1480} 1458}
1481 1459
1482/* formula_msg() - generate a message detailing the properties 1460/* formula_msg() - generate a message detailing the properties
1483 * of a randomly selected alchemical formula. 1461 * of a randomly selected alchemical formula.
1484 */ 1462 */
1485void 1463static void
1486make_formula_book (object *book, int level) 1464make_formula_book (object *book, int level)
1487{ 1465{
1488 char retbuf[BOOK_BUF], title[MAX_BUF]; 1466 char retbuf[BOOK_BUF], title[MAX_BUF];
1489 recipelist *fl; 1467 recipelist *fl;
1490 recipe *formula = NULL; 1468 recipe *formula = NULL;
1491 int chance; 1469 int chance;
1492 1470
1493 /* the higher the book level, the more complex (ie number of 1471 /* the higher the book level, the more complex (ie number of
1494 * ingredients) the formula can be. 1472 * ingredients) the formula can be.
1495 */ 1473 */
1496 fl = get_formulalist (((RANDOM () % level) / 3) + 1); 1474 fl = get_formulalist (rndm (level) / 3 + 1);
1497 1475
1498 if (!fl) 1476 if (!fl)
1499 fl = get_formulalist (1); /* safety */ 1477 fl = get_formulalist (1); /* safety */
1500 1478
1501 if (fl->total_chance == 0) 1479 if (fl->total_chance == 0)
… …
1505 add_author (book, 4); 1483 add_author (book, 4);
1506 return; 1484 return;
1507 } 1485 }
1508 1486
1509 /* get a random formula, weighted by its bookchance */ 1487 /* get a random formula, weighted by its bookchance */
1510 chance = RANDOM () % fl->total_chance; 1488 chance = rndm (fl->total_chance);
1511 for (formula = fl->items; formula != NULL; formula = formula->next) 1489 for (formula = fl->items; formula; formula = formula->next)
1512 { 1490 {
1513 chance -= formula->chance; 1491 chance -= formula->chance;
1514 if (chance <= 0) 1492 if (chance <= 0)
1515 break; 1493 break;
1516 } 1494 }
… …
1526 { 1504 {
1527 /* looks like a formula was found. Base the amount 1505 /* looks like a formula was found. Base the amount
1528 * of information on the booklevel and the spellevel 1506 * of information on the booklevel and the spellevel
1529 * of the formula. */ 1507 * of the formula. */
1530 1508
1531 const char *op_name = formula->arch_name[RANDOM () % formula->arch_names]; 1509 const char *op_name = formula->arch_name [rndm (formula->arch_names)];
1532 archetype *at; 1510 archetype *at;
1533 1511
1534 /* preamble */ 1512 /* preamble */
1535 sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill"); 1513 sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill");
1536 1514
… …
1538 op_name = at->object::name; 1516 op_name = at->object::name;
1539 else 1517 else
1540 LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); 1518 LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name);
1541 1519
1542 /* item name */ 1520 /* item name */
1543 if (strcmp (formula->title, "NONE")) 1521 if (formula->title != shstr_NONE)
1544 { 1522 {
1545 sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title); 1523 sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title);
1546 /* This results in things like pile of philo. sulfur. 1524 /* This results in things like pile of philo. sulfur.
1547 * while philo. sulfur may look better, without this, 1525 * while philo. sulfur may look better, without this,
1548 * you get things like 'the wise' because its missing the 1526 * you get things like 'the wise' because its missing the
1549 * water of section. 1527 * water of section.
1550 */ 1528 */
1551 sprintf (title, "%s: %s of %s", 1529 sprintf (title, "%s: %s of %s",
1552 formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); 1530 formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title);
1553 } 1531 }
1554 else 1532 else
1555 { 1533 {
1556 sprintf (retbuf, "%sThe %s", retbuf, op_name); 1534 sprintf (retbuf, "%sThe %s", retbuf, op_name);
1557 sprintf (title, "%s: %s", formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name); 1535 sprintf (title, "%s: %s", formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name);
1558 if (at->title) 1536 if (at->title)
1559 { 1537 {
1560 strcat (retbuf, " "); 1538 strcat (retbuf, " ");
1561 strcat (retbuf, at->title); 1539 strcat (retbuf, at->title);
1562 strcat (title, " "); 1540 strcat (title, " ");
1563 strcat (title, at->title); 1541 strcat (title, at->title);
1564 } 1542 }
1565 } 1543 }
1544
1566 /* Lets name the book something meaningful ! */ 1545 /* Lets name the book something meaningful ! */
1567 book->name = title; 1546 book->name = title;
1568 book->title = NULL; 1547 book->title = NULL;
1569 1548
1570 /* ingredients to make it */ 1549 /* ingredients to make it */
… …
1609 } 1588 }
1610 1589
1611/* god_info_msg() - generate a message detailing the properties 1590/* god_info_msg() - generate a message detailing the properties
1612 * of a random god. Used by the book hack. b.t. 1591 * of a random god. Used by the book hack. b.t.
1613 */ 1592 */
1614const char * 1593static const char *
1615god_info_msg (int level, int booksize) 1594god_info_msg (int level, int booksize)
1616{ 1595{
1617 static char retbuf[BOOK_BUF]; 1596 static char retbuf[BOOK_BUF];
1618 const char *name = NULL; 1597 const char *name = NULL;
1619 char buf[BOOK_BUF]; 1598 char buf[BOOK_BUF];
… …
1646 * this ... 1625 * this ...
1647 */ 1626 */
1648 while (level > 0) 1627 while (level > 0)
1649 { 1628 {
1650 sprintf (buf, " "); 1629 sprintf (buf, " ");
1651 if (level == 2 && RANDOM () % 2) 1630 if (level == 2 && rndm (2))
1652 { /* enemy god */ 1631 { /* enemy god */
1653 const char *enemy = god->title; 1632 const char *enemy = god->title;
1654 1633
1655 if (enemy) 1634 if (enemy)
1656 sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); 1635 sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy);
1657 } 1636 }
1658 1637
1659 if (level == 3 && RANDOM () % 2) 1638 if (level == 3 && rndm (2))
1660 { /* enemy race, what the god's holy word effects */ 1639 { /* enemy race, what the god's holy word effects */
1661 const char *enemy = god->slaying; 1640 const char *enemy = god->slaying;
1662 1641
1663 if (enemy && !(god->path_denied & PATH_TURNING)) 1642 if (enemy && !(god->path_denied & PATH_TURNING))
1664 if ((i = nstrtok (enemy, ",")) > 0) 1643 if ((i = nstrtok (enemy, ",")) > 0)
… …
1673 sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); 1652 sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ","));
1674 sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); 1653 sprintf (buf, "%s%s\n ---\n", buf, tmpbuf);
1675 } 1654 }
1676 } 1655 }
1677 1656
1678 if (level == 4 && RANDOM () % 2) 1657 if (level == 4 && rndm (2))
1679 { /* Priest of god gets these protect,vulnerable... */ 1658 { /* Priest of god gets these protect,vulnerable... */
1680 char tmpbuf[MAX_BUF]; 1659 char tmpbuf[MAX_BUF];
1681 1660
1682 if (const char *cp = describe_resistance (god, 1)) 1661 if (const char *cp = describe_resistance (god, 1))
1683 { /* This god does have protections */ 1662 { /* This god does have protections */
… …
1689 } 1668 }
1690 else 1669 else
1691 sprintf (buf, " "); 1670 sprintf (buf, " ");
1692 } 1671 }
1693 1672
1694 if (level == 5 && RANDOM () % 2) 1673 if (level == 5 && rndm (2))
1695 { /* aligned race, summoning */ 1674 { /* aligned race, summoning */
1696 const char *race = god->race; /* aligned race */ 1675 const char *race = god->race; /* aligned race */
1697 1676
1698 if (race && !(god->path_denied & PATH_SUMMON)) 1677 if (race && !(god->path_denied & PATH_SUMMON))
1699 if ((i = nstrtok (race, ",")) > 0) 1678 if ((i = nstrtok (race, ",")) > 0)
… …
1707 sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); 1686 sprintf (tmpbuf, "race of%s", strtoktolin (race, ","));
1708 sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); 1687 sprintf (buf, "%s%s\n ---\n", buf, tmpbuf);
1709 } 1688 }
1710 } 1689 }
1711 1690
1712 if (level == 6 && RANDOM () % 2) 1691 if (level == 6 && rndm (2))
1713 { /* blessing,curse properties of the god */ 1692 { /* blessing,curse properties of the god */
1714 char tmpbuf[MAX_BUF]; 1693 char tmpbuf[MAX_BUF];
1715 1694
1716 if (const char *cp = describe_resistance (god, 1)) 1695 if (const char *cp = describe_resistance (god, 1))
1717 { /* This god does have protections */ 1696 { /* This god does have protections */
… …
1724 else 1703 else
1725 sprintf (buf, " "); 1704 sprintf (buf, " ");
1726 1705
1727 } 1706 }
1728 1707
1729 if (level == 8 && RANDOM () % 2) 1708 if (level == 8 && rndm (2))
1730 { /* immunity, holy possession */ 1709 { /* immunity, holy possession */
1731 int has_effect = 0, tmpvar; 1710 int has_effect = 0, tmpvar;
1732 char tmpbuf[MAX_BUF]; 1711 char tmpbuf[MAX_BUF];
1733 1712
1734 sprintf (tmpbuf, "\n"); 1713 sprintf (tmpbuf, "\n");
… …
1752 } 1731 }
1753 else 1732 else
1754 sprintf (buf, " "); 1733 sprintf (buf, " ");
1755 } 1734 }
1756 1735
1757 if (level == 12 && RANDOM () % 2) 1736 if (level == 12 && rndm (2))
1758 { /* spell paths */ 1737 { /* spell paths */
1759 int has_effect = 0, tmpvar; 1738 int has_effect = 0, tmpvar;
1760 char tmpbuf[MAX_BUF]; 1739 char tmpbuf[MAX_BUF];
1761 1740
1762 sprintf (tmpbuf, "\n"); 1741 sprintf (tmpbuf, "\n");
… …
1806 { /* we got no information beyond the preamble! */ 1785 { /* we got no information beyond the preamble! */
1807 strcat (retbuf, " [Unfortunately the rest of the information is\n"); 1786 strcat (retbuf, " [Unfortunately the rest of the information is\n");
1808 strcat (retbuf, " hopelessly garbled!]\n ---\n"); 1787 strcat (retbuf, " hopelessly garbled!]\n ---\n");
1809 } 1788 }
1810#ifdef BOOK_MSG_DEBUG 1789#ifdef BOOK_MSG_DEBUG
1811 LOG (llevDebug, "\n god_info_msg() created strng: %d\n", strlen (retbuf)); 1790 LOG (llevDebug, "\n god_info_msg() created string: %d\n", strlen (retbuf));
1812 fprintf (logfile, " MADE THIS:\n%s", retbuf); 1791 LOG (llevDebug, " MADE THIS:\n%s", retbuf);
1813#endif 1792#endif
1814 return retbuf; 1793 return retbuf;
1815} 1794}
1816 1795
1817/* tailor_readable_ob()- The main routine. This chooses a random 1796/* tailor_readable_ob()- The main routine. This chooses a random
… …
1832 */ 1811 */
1833void 1812void
1834tailor_readable_ob (object *book, int msg_type) 1813tailor_readable_ob (object *book, int msg_type)
1835{ 1814{
1836 char msgbuf[BOOK_BUF]; 1815 char msgbuf[BOOK_BUF];
1837 int level = book->level ? (RANDOM () % book->level) + 1 : 1; 1816 int level = book->level ? rndm (book->level) + 1 : 1;
1838 int book_buf_size; 1817 int book_buf_size;
1839 1818
1840 /* safety */ 1819 /* safety */
1841 if (book->type != BOOK) 1820 if (book->type != BOOK)
1842 return; 1821 return;
… …
1856 * 2) make sure there is an entry in max_titles[] array. 1835 * 2) make sure there is an entry in max_titles[] array.
1857 * 3) make sure there are entries for your case in new_text_title() 1836 * 3) make sure there are entries for your case in new_text_title()
1858 * and add_authour(). 1837 * and add_authour().
1859 * 4) you may want separate authour/book name arrays in read.h 1838 * 4) you may want separate authour/book name arrays in read.h
1860 */ 1839 */
1861
1862 msg_type = msg_type > 0 ? msg_type : (RANDOM () % 6); 1840 msg_type = msg_type > 0 ? msg_type : rndm (8);
1863 switch (msg_type) 1841 switch (msg_type)
1864 { 1842 {
1865 case 1: /* monster attrib */ 1843 case 1: /* monster attrib */
1866 strcpy (msgbuf, mon_info_msg (level, book_buf_size)); 1844 strcpy (msgbuf, mon_info_msg (level, book_buf_size));
1867 break; 1845 break;
… …
1891 { 1869 {
1892 book->msg = msgbuf; 1870 book->msg = msgbuf;
1893 /* lets give the "book" a new name, which may be a compound word */ 1871 /* lets give the "book" a new name, which may be a compound word */
1894 change_book (book, msg_type); 1872 change_book (book, msg_type);
1895 } 1873 }
1896
1897} 1874}
1898 1875
1899 1876
1900/***************************************************************************** 1877/*****************************************************************************
1901 * 1878 *

Diff Legend

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