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 | */ |
… | |
… | |
932 | */ |
933 | */ |
933 | |
934 | |
934 | static int |
935 | static int |
935 | unique_book (const object *book, int msgtype) |
936 | unique_book (const object *book, int msgtype) |
936 | { |
937 | { |
937 | title *test; |
|
|
938 | |
|
|
939 | if (!booklist) |
938 | if (!booklist) |
940 | return 1; /* No archival entries! Must be unique! */ |
939 | return 1; /* No archival entries! Must be unique! */ |
941 | |
940 | |
942 | /* Go through the booklist. If the author and name match, not unique so |
941 | /* Go through the booklist. If the author and name match, not unique so |
943 | * return 0. |
942 | * return 0. |
944 | */ |
943 | */ |
945 | for (test = get_titlelist (msgtype)->first_book; test; test = test->next) |
944 | 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)) |
945 | if (test->name == book->name && book->title == test->authour) |
948 | return 0; |
946 | return 0; |
949 | } |
947 | |
950 | return 1; |
948 | return 1; |
951 | } |
949 | } |
952 | |
950 | |
953 | /* add_book_to_list() */ |
951 | /* add_book_to_list() */ |
954 | |
952 | |
… | |
… | |
1001 | { |
999 | { |
1002 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1000 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1003 | |
1001 | |
1004 | switch (book->type) |
1002 | switch (book->type) |
1005 | { |
1003 | { |
1006 | case BOOK: |
1004 | case BOOK: |
1007 | { |
1005 | { |
1008 | titlelist *tl = get_titlelist (msgtype); |
1006 | titlelist *tl = get_titlelist (msgtype); |
1009 | title *t = NULL; |
1007 | title *t = NULL; |
1010 | int tries = 0; |
1008 | int tries = 0; |
1011 | |
1009 | |
1012 | /* look to see if our msg already been archived. If so, alter |
1010 | /* 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, |
1011 | * 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 |
1012 | * then we archive the new title/name/msg combo if there is |
1015 | * room on the titlelist. |
1013 | * room on the titlelist. |
1016 | */ |
1014 | */ |
1017 | |
1015 | |
1018 | if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) |
1016 | if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) |
1019 | { |
1017 | { |
1020 | object *tmpbook; |
|
|
1021 | |
|
|
1022 | /* alter book properties */ |
1018 | /* alter book properties */ |
1023 | if ((tmpbook = get_archetype (t->archname)) != NULL) |
1019 | if (object *tmpbook = get_archetype (t->archname)) |
|
|
1020 | { |
|
|
1021 | tmpbook->msg = book->msg; |
|
|
1022 | tmpbook->copy_to (book); |
|
|
1023 | tmpbook->destroy (); |
|
|
1024 | } |
|
|
1025 | |
|
|
1026 | book->title = t->authour; |
|
|
1027 | book->name = t->name; |
|
|
1028 | book->level = t->level; |
|
|
1029 | } |
|
|
1030 | /* Don't have any default title, so lets make up a new one */ |
|
|
1031 | else |
|
|
1032 | { |
|
|
1033 | int numb, maxnames = max_titles[msgtype]; |
|
|
1034 | const char *old_title; |
|
|
1035 | const char *old_name; |
|
|
1036 | |
|
|
1037 | old_title = book->title; |
|
|
1038 | old_name = book->name; |
|
|
1039 | |
|
|
1040 | /* some pre-generated books have title already set (from |
|
|
1041 | * maps), also don't bother looking for unique title if |
|
|
1042 | * we already used up all the available names! */ |
|
|
1043 | |
|
|
1044 | if (!tl) |
|
|
1045 | { |
|
|
1046 | LOG (llevError, "change_book_name(): can't find title list\n"); |
|
|
1047 | numb = 0; |
|
|
1048 | } |
|
|
1049 | else |
|
|
1050 | numb = tl->number; |
|
|
1051 | |
|
|
1052 | if (numb == maxnames) |
|
|
1053 | { |
|
|
1054 | #ifdef ARCHIVE_DEBUG |
|
|
1055 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
|
|
1056 | #endif |
|
|
1057 | break; |
|
|
1058 | } |
|
|
1059 | /* shouldnt change map-maker books */ |
|
|
1060 | else if (!book->title) |
|
|
1061 | do |
1024 | { |
1062 | { |
1025 | tmpbook->msg = book->msg; |
1063 | /* random book name */ |
1026 | tmpbook->copy_to (book); |
1064 | new_text_name (book, msgtype); |
1027 | tmpbook->destroy (); |
1065 | add_author (book, msgtype); /* random author */ |
|
|
1066 | tries++; |
1028 | } |
1067 | } |
|
|
1068 | while (!unique_book (book, msgtype) && tries < MAX_TITLE_CHECK); |
1029 | |
1069 | |
1030 | book->title = t->authour; |
1070 | /* Now deal with 2 cases. |
1031 | book->name = t->name; |
1071 | * 1)If no space for a new title exists lets just restore |
1032 | book->level = t->level; |
1072 | * the old book properties. Remember, if the book had |
|
|
1073 | * matchd an older entry on the titlelist, we shouldnt |
|
|
1074 | * have called this routine in the first place! |
|
|
1075 | * 2) If we got a unique title, we need to add it to |
|
|
1076 | * the list. |
1033 | } |
1077 | */ |
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 | |
1078 | |
1041 | old_title = book->title; |
1079 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1042 | old_name = book->name; |
1080 | { /* 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 |
1081 | #ifdef ARCHIVE_DEBUG |
1059 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
1082 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames); |
1060 | #endif |
1083 | #endif |
1061 | break; |
1084 | /* restore old book properties here */ |
1062 | } |
1085 | book->title = old_title; |
1063 | /* shouldnt change map-maker books */ |
1086 | |
1064 | else if (!book->title) |
1087 | if (rndm (4)) |
1065 | do |
|
|
1066 | { |
1088 | { |
1067 | /* random book name */ |
1089 | /* Lets give the book a description to individualize it some */ |
1068 | new_text_name (book, msgtype); |
1090 | char new_name[MAX_BUF]; |
1069 | add_author (book, msgtype); /* random author */ |
1091 | |
1070 | tries++; |
1092 | snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name); |
|
|
1093 | |
|
|
1094 | book->name = new_name; |
1071 | } |
1095 | } |
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 |
1096 | else |
1101 | { |
1097 | { |
1102 | book->name = old_name; |
1098 | book->name = old_name; |
1103 | } |
1099 | } |
1104 | } |
1100 | } |
1105 | else if (book->title && strlen (book->msg) > 5) |
1101 | else if (book->title && strlen (book->msg) > 5) |
1106 | { /* archive if long msg texts */ |
1102 | { /* archive if long msg texts */ |
1107 | add_book_to_list (book, msgtype); |
1103 | add_book_to_list (book, msgtype); |
1108 | } |
1104 | } |
1109 | } |
1105 | } |
1110 | break; |
1106 | break; |
1111 | } |
1107 | } |
1112 | |
1108 | |
1113 | default: |
1109 | default: |
1114 | LOG (llevError, "change_book_name() called w/ illegal obj type.\n"); |
1110 | LOG (llevError, "change_book_name() called w/ illegal obj type.\n"); |
1115 | return; |
1111 | return; |
1116 | } |
1112 | } |
1117 | } |
1113 | } |
1118 | |
1114 | |
1119 | /***************************************************************************** |
1115 | /***************************************************************************** |
1120 | * |
1116 | * |
… | |
… | |
1145 | return (object *) NULL; |
1141 | return (object *) NULL; |
1146 | |
1142 | |
1147 | if (!level) |
1143 | if (!level) |
1148 | { |
1144 | { |
1149 | /* lets get a random monster from the mon_info linked list */ |
1145 | /* lets get a random monster from the mon_info linked list */ |
1150 | monnr = RANDOM () % nrofmon; |
1146 | monnr = rndm (nrofmon); |
1151 | |
1147 | |
1152 | for (mon = first_mon_info, i = 0; mon; mon = mon->next) |
1148 | for (mon = first_mon_info, i = 0; mon; mon = mon->next) |
1153 | if (i++ == monnr) |
1149 | if (i++ == monnr) |
1154 | break; |
1150 | break; |
1155 | |
1151 | |
… | |
… | |
1182 | { |
1178 | { |
1183 | LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level); |
1179 | LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level); |
1184 | return NULL; |
1180 | return NULL; |
1185 | } |
1181 | } |
1186 | |
1182 | |
1187 | monnr = RANDOM () % i; |
1183 | monnr = rndm (i); |
1188 | for (mon = first_mon_info; mon; mon = mon->next) |
1184 | for (mon = first_mon_info; mon; mon = mon->next) |
1189 | if (mon->ob->level >= level && monnr-- == 0) |
1185 | if (mon->ob->level >= level && monnr-- == 0) |
1190 | return mon->ob; |
1186 | return mon->ob; |
1191 | |
1187 | |
1192 | if (!mon) |
1188 | if (!mon) |
… | |
… | |
1296 | artifact_msg (int level, int booksize) |
1292 | artifact_msg (int level, int booksize) |
1297 | { |
1293 | { |
1298 | artifactlist *al = NULL; |
1294 | artifactlist *al = NULL; |
1299 | artifact *art; |
1295 | artifact *art; |
1300 | int chance, i, type, index; |
1296 | int chance, i, type, index; |
1301 | int book_entries = level > 5 ? RANDOM () % 3 + RANDOM () % 3 + 2 : RANDOM () % level + 1; |
1297 | int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1; |
1302 | const char *ch; |
1298 | const char *ch; |
1303 | char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1299 | char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1304 | static char retbuf[BOOK_BUF]; |
1300 | static char retbuf[BOOK_BUF]; |
1305 | object *tmp = NULL; |
1301 | object *tmp = NULL; |
1306 | |
1302 | |
… | |
… | |
1314 | * for that type exists! |
1310 | * for that type exists! |
1315 | */ |
1311 | */ |
1316 | i = 0; |
1312 | i = 0; |
1317 | do |
1313 | do |
1318 | { |
1314 | { |
1319 | index = RANDOM () % (sizeof (art_name_array) / sizeof (arttypename)); |
1315 | index = rndm (sizeof (art_name_array) / sizeof (arttypename)); |
1320 | type = art_name_array[index].type; |
1316 | type = art_name_array[index].type; |
1321 | al = find_artifactlist (type); |
1317 | al = find_artifactlist (type); |
1322 | i++; |
1318 | i++; |
1323 | } |
1319 | } |
1324 | while ((al == NULL) && (i < 10)); |
1320 | while ((al == NULL) && (i < 10)); |
… | |
… | |
1327 | return "None"; |
1323 | return "None"; |
1328 | |
1324 | |
1329 | /* There is no reason to start on the artifact list at the begining. Lets |
1325 | /* There is no reason to start on the artifact list at the begining. Lets |
1330 | * take our starting position randomly... */ |
1326 | * take our starting position randomly... */ |
1331 | art = al->items; |
1327 | art = al->items; |
1332 | for (i = RANDOM () % level + RANDOM () % 2 + 1; i > 0; i--) |
1328 | for (i = rndm (level) + rndm (2) + 1; i > 0; i--) |
1333 | { |
1329 | { |
1334 | if (art == NULL) |
1330 | if (!art) |
1335 | art = al->items; /* hmm, out of stuff, loop back around */ |
1331 | art = al->items; /* hmm, out of stuff, loop back around */ |
|
|
1332 | |
1336 | art = art->next; |
1333 | art = art->next; |
1337 | } |
1334 | } |
1338 | |
1335 | |
1339 | /* the base 'generic' name for our artifact */ |
1336 | /* the base 'generic' name for our artifact */ |
1340 | assign (name, art_name_array[index].name); |
1337 | assign (name, art_name_array[index].name); |
… | |
… | |
1353 | |
1350 | |
1354 | /* separator of items */ |
1351 | /* separator of items */ |
1355 | strcpy (buf, "--- \n"); |
1352 | strcpy (buf, "--- \n"); |
1356 | |
1353 | |
1357 | /* Name */ |
1354 | /* Name */ |
1358 | if (art->allowed != NULL && strcmp (art->allowed->name, "All")) |
1355 | if (art->allowed && art->allowed->name != shstr_All) |
1359 | { |
1356 | { |
1360 | linked_char *temp, *next = art->allowed; |
1357 | linked_char *temp, *next = art->allowed; |
1361 | |
1358 | |
1362 | do |
1359 | do |
1363 | { |
1360 | { |
1364 | temp = next; |
1361 | temp = next; |
1365 | next = next->next; |
1362 | next = next->next; |
1366 | } |
1363 | } |
1367 | while (next && !RANDOM () % 2); |
1364 | while (next && rndm (2)); |
1368 | sprintf (buf, "%s A %s of %s", buf, &temp->name, &art->item->name); |
1365 | sprintf (buf, "%s A %s of %s", buf, &temp->name, &art->item->name); |
1369 | } |
1366 | } |
1370 | else /* default name is used */ |
1367 | else /* default name is used */ |
1371 | sprintf (buf, "%s The %s of %s", buf, name, &art->item->name); |
1368 | sprintf (buf, "%s The %s of %s", buf, name, &art->item->name); |
1372 | |
1369 | |
… | |
… | |
1385 | /* value of artifact */ |
1382 | /* value of artifact */ |
1386 | sprintf (buf, "%s item with a value that is %d times normal.\n", buf, art->item->value); |
1383 | sprintf (buf, "%s item with a value that is %d times normal.\n", buf, art->item->value); |
1387 | |
1384 | |
1388 | /* include the message about the artifact, if exists, and book |
1385 | /* include the message about the artifact, if exists, and book |
1389 | * level is kinda high */ |
1386 | * level is kinda high */ |
1390 | if (art->item->msg && (RANDOM () % 4 + 1) < level && !((strlen (art->item->msg) + strlen (buf)) > BOOK_BUF)) |
1387 | if (art->item->msg |
|
|
1388 | && rndm (4) + 1 < level |
|
|
1389 | && !(strlen (art->item->msg) + strlen (buf) > BOOK_BUF)) |
1391 | strcat (buf, art->item->msg); |
1390 | strcat (buf, art->item->msg); |
1392 | |
1391 | |
1393 | /* properties of the artifact */ |
1392 | /* properties of the artifact */ |
1394 | tmp = object::create (); |
1393 | tmp = object::create (); |
1395 | add_abilities (tmp, art->item); |
1394 | add_abilities (tmp, art->item); |
… | |
… | |
1427 | char * |
1426 | char * |
1428 | spellpath_msg (int level, int booksize) |
1427 | spellpath_msg (int level, int booksize) |
1429 | { |
1428 | { |
1430 | static char retbuf[BOOK_BUF]; |
1429 | static char retbuf[BOOK_BUF]; |
1431 | char tmpbuf[BOOK_BUF]; |
1430 | char tmpbuf[BOOK_BUF]; |
1432 | int path = RANDOM () % NRSPELLPATHS, prayers = RANDOM () % 2; |
1431 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
1433 | int did_first_sp = 0; |
1432 | int did_first_sp = 0; |
1434 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1433 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1435 | archetype *at; |
1434 | archetype *at; |
1436 | |
1435 | |
1437 | /* Preamble */ |
1436 | /* Preamble */ |
… | |
… | |
1465 | } |
1464 | } |
1466 | } |
1465 | } |
1467 | /* Geez, no spells were generated. */ |
1466 | /* Geez, no spells were generated. */ |
1468 | if (!did_first_sp) |
1467 | if (!did_first_sp) |
1469 | { |
1468 | { |
1470 | if (RANDOM () % 4) /* usually, lets make a recursive call... */ |
1469 | if (rndm (4)) /* usually, lets make a recursive call... */ |
1471 | spellpath_msg (level, booksize); |
1470 | spellpath_msg (level, booksize); |
1472 | else /* give up, cause knowing no spells exist for path is info too. */ |
1471 | else /* give up, cause knowing no spells exist for path is info too. */ |
1473 | strcat (retbuf, "\n - no known spells exist -\n"); |
1472 | strcat (retbuf, "\n - no known spells exist -\n"); |
1474 | } |
1473 | } |
1475 | else |
1474 | else |
… | |
… | |
1491 | int chance; |
1490 | int chance; |
1492 | |
1491 | |
1493 | /* the higher the book level, the more complex (ie number of |
1492 | /* the higher the book level, the more complex (ie number of |
1494 | * ingredients) the formula can be. |
1493 | * ingredients) the formula can be. |
1495 | */ |
1494 | */ |
1496 | fl = get_formulalist (((RANDOM () % level) / 3) + 1); |
1495 | fl = get_formulalist (rndm (level) / 3 + 1); |
1497 | |
1496 | |
1498 | if (!fl) |
1497 | if (!fl) |
1499 | fl = get_formulalist (1); /* safety */ |
1498 | fl = get_formulalist (1); /* safety */ |
1500 | |
1499 | |
1501 | if (fl->total_chance == 0) |
1500 | if (fl->total_chance == 0) |
… | |
… | |
1505 | add_author (book, 4); |
1504 | add_author (book, 4); |
1506 | return; |
1505 | return; |
1507 | } |
1506 | } |
1508 | |
1507 | |
1509 | /* get a random formula, weighted by its bookchance */ |
1508 | /* get a random formula, weighted by its bookchance */ |
1510 | chance = RANDOM () % fl->total_chance; |
1509 | chance = rndm (fl->total_chance); |
1511 | for (formula = fl->items; formula != NULL; formula = formula->next) |
1510 | for (formula = fl->items; formula; formula = formula->next) |
1512 | { |
1511 | { |
1513 | chance -= formula->chance; |
1512 | chance -= formula->chance; |
1514 | if (chance <= 0) |
1513 | if (chance <= 0) |
1515 | break; |
1514 | break; |
1516 | } |
1515 | } |
… | |
… | |
1526 | { |
1525 | { |
1527 | /* looks like a formula was found. Base the amount |
1526 | /* looks like a formula was found. Base the amount |
1528 | * of information on the booklevel and the spellevel |
1527 | * of information on the booklevel and the spellevel |
1529 | * of the formula. */ |
1528 | * of the formula. */ |
1530 | |
1529 | |
1531 | const char *op_name = formula->arch_name[RANDOM () % formula->arch_names]; |
1530 | const char *op_name = formula->arch_name [rndm (formula->arch_names)]; |
1532 | archetype *at; |
1531 | archetype *at; |
1533 | |
1532 | |
1534 | /* preamble */ |
1533 | /* preamble */ |
1535 | sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill"); |
1534 | sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill"); |
1536 | |
1535 | |
… | |
… | |
1538 | op_name = at->object::name; |
1537 | op_name = at->object::name; |
1539 | else |
1538 | else |
1540 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
1539 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
1541 | |
1540 | |
1542 | /* item name */ |
1541 | /* item name */ |
1543 | if (strcmp (formula->title, "NONE")) |
1542 | if (formula->title != shstr_NONE) |
1544 | { |
1543 | { |
1545 | sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title); |
1544 | sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title); |
1546 | /* This results in things like pile of philo. sulfur. |
1545 | /* This results in things like pile of philo. sulfur. |
1547 | * while philo. sulfur may look better, without this, |
1546 | * while philo. sulfur may look better, without this, |
1548 | * you get things like 'the wise' because its missing the |
1547 | * you get things like 'the wise' because its missing the |
1549 | * water of section. |
1548 | * water of section. |
1550 | */ |
1549 | */ |
1551 | sprintf (title, "%s: %s of %s", |
1550 | sprintf (title, "%s: %s of %s", |
1552 | formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); |
1551 | formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); |
1553 | } |
1552 | } |
1554 | else |
1553 | else |
1555 | { |
1554 | { |
1556 | sprintf (retbuf, "%sThe %s", retbuf, op_name); |
1555 | sprintf (retbuf, "%sThe %s", retbuf, op_name); |
1557 | sprintf (title, "%s: %s", formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name); |
1556 | sprintf (title, "%s: %s", formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name); |
1558 | if (at->title) |
1557 | if (at->title) |
1559 | { |
1558 | { |
1560 | strcat (retbuf, " "); |
1559 | strcat (retbuf, " "); |
1561 | strcat (retbuf, at->title); |
1560 | strcat (retbuf, at->title); |
1562 | strcat (title, " "); |
1561 | strcat (title, " "); |
1563 | strcat (title, at->title); |
1562 | strcat (title, at->title); |
1564 | } |
1563 | } |
1565 | } |
1564 | } |
|
|
1565 | |
1566 | /* Lets name the book something meaningful ! */ |
1566 | /* Lets name the book something meaningful ! */ |
1567 | book->name = title; |
1567 | book->name = title; |
1568 | book->title = NULL; |
1568 | book->title = NULL; |
1569 | |
1569 | |
1570 | /* ingredients to make it */ |
1570 | /* ingredients to make it */ |
… | |
… | |
1646 | * this ... |
1646 | * this ... |
1647 | */ |
1647 | */ |
1648 | while (level > 0) |
1648 | while (level > 0) |
1649 | { |
1649 | { |
1650 | sprintf (buf, " "); |
1650 | sprintf (buf, " "); |
1651 | if (level == 2 && RANDOM () % 2) |
1651 | if (level == 2 && rndm (2)) |
1652 | { /* enemy god */ |
1652 | { /* enemy god */ |
1653 | const char *enemy = god->title; |
1653 | const char *enemy = god->title; |
1654 | |
1654 | |
1655 | if (enemy) |
1655 | if (enemy) |
1656 | sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); |
1656 | sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); |
1657 | } |
1657 | } |
1658 | |
1658 | |
1659 | if (level == 3 && RANDOM () % 2) |
1659 | if (level == 3 && rndm (2)) |
1660 | { /* enemy race, what the god's holy word effects */ |
1660 | { /* enemy race, what the god's holy word effects */ |
1661 | const char *enemy = god->slaying; |
1661 | const char *enemy = god->slaying; |
1662 | |
1662 | |
1663 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1663 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1664 | if ((i = nstrtok (enemy, ",")) > 0) |
1664 | if ((i = nstrtok (enemy, ",")) > 0) |
… | |
… | |
1673 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1673 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1674 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1674 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1675 | } |
1675 | } |
1676 | } |
1676 | } |
1677 | |
1677 | |
1678 | if (level == 4 && RANDOM () % 2) |
1678 | if (level == 4 && rndm (2)) |
1679 | { /* Priest of god gets these protect,vulnerable... */ |
1679 | { /* Priest of god gets these protect,vulnerable... */ |
1680 | char tmpbuf[MAX_BUF]; |
1680 | char tmpbuf[MAX_BUF]; |
1681 | |
1681 | |
1682 | if (const char *cp = describe_resistance (god, 1)) |
1682 | if (const char *cp = describe_resistance (god, 1)) |
1683 | { /* This god does have protections */ |
1683 | { /* This god does have protections */ |
… | |
… | |
1689 | } |
1689 | } |
1690 | else |
1690 | else |
1691 | sprintf (buf, " "); |
1691 | sprintf (buf, " "); |
1692 | } |
1692 | } |
1693 | |
1693 | |
1694 | if (level == 5 && RANDOM () % 2) |
1694 | if (level == 5 && rndm (2)) |
1695 | { /* aligned race, summoning */ |
1695 | { /* aligned race, summoning */ |
1696 | const char *race = god->race; /* aligned race */ |
1696 | const char *race = god->race; /* aligned race */ |
1697 | |
1697 | |
1698 | if (race && !(god->path_denied & PATH_SUMMON)) |
1698 | if (race && !(god->path_denied & PATH_SUMMON)) |
1699 | if ((i = nstrtok (race, ",")) > 0) |
1699 | if ((i = nstrtok (race, ",")) > 0) |
… | |
… | |
1707 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1707 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1708 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1708 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1709 | } |
1709 | } |
1710 | } |
1710 | } |
1711 | |
1711 | |
1712 | if (level == 6 && RANDOM () % 2) |
1712 | if (level == 6 && rndm (2)) |
1713 | { /* blessing,curse properties of the god */ |
1713 | { /* blessing,curse properties of the god */ |
1714 | char tmpbuf[MAX_BUF]; |
1714 | char tmpbuf[MAX_BUF]; |
1715 | |
1715 | |
1716 | if (const char *cp = describe_resistance (god, 1)) |
1716 | if (const char *cp = describe_resistance (god, 1)) |
1717 | { /* This god does have protections */ |
1717 | { /* This god does have protections */ |
… | |
… | |
1724 | else |
1724 | else |
1725 | sprintf (buf, " "); |
1725 | sprintf (buf, " "); |
1726 | |
1726 | |
1727 | } |
1727 | } |
1728 | |
1728 | |
1729 | if (level == 8 && RANDOM () % 2) |
1729 | if (level == 8 && rndm (2)) |
1730 | { /* immunity, holy possession */ |
1730 | { /* immunity, holy possession */ |
1731 | int has_effect = 0, tmpvar; |
1731 | int has_effect = 0, tmpvar; |
1732 | char tmpbuf[MAX_BUF]; |
1732 | char tmpbuf[MAX_BUF]; |
1733 | |
1733 | |
1734 | sprintf (tmpbuf, "\n"); |
1734 | sprintf (tmpbuf, "\n"); |
… | |
… | |
1752 | } |
1752 | } |
1753 | else |
1753 | else |
1754 | sprintf (buf, " "); |
1754 | sprintf (buf, " "); |
1755 | } |
1755 | } |
1756 | |
1756 | |
1757 | if (level == 12 && RANDOM () % 2) |
1757 | if (level == 12 && rndm (2)) |
1758 | { /* spell paths */ |
1758 | { /* spell paths */ |
1759 | int has_effect = 0, tmpvar; |
1759 | int has_effect = 0, tmpvar; |
1760 | char tmpbuf[MAX_BUF]; |
1760 | char tmpbuf[MAX_BUF]; |
1761 | |
1761 | |
1762 | sprintf (tmpbuf, "\n"); |
1762 | sprintf (tmpbuf, "\n"); |
… | |
… | |
1832 | */ |
1832 | */ |
1833 | void |
1833 | void |
1834 | tailor_readable_ob (object *book, int msg_type) |
1834 | tailor_readable_ob (object *book, int msg_type) |
1835 | { |
1835 | { |
1836 | char msgbuf[BOOK_BUF]; |
1836 | char msgbuf[BOOK_BUF]; |
1837 | int level = book->level ? (RANDOM () % book->level) + 1 : 1; |
1837 | int level = book->level ? rndm (book->level) + 1 : 1; |
1838 | int book_buf_size; |
1838 | int book_buf_size; |
1839 | |
1839 | |
1840 | /* safety */ |
1840 | /* safety */ |
1841 | if (book->type != BOOK) |
1841 | if (book->type != BOOK) |
1842 | return; |
1842 | return; |
… | |
… | |
1856 | * 2) make sure there is an entry in max_titles[] array. |
1856 | * 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() |
1857 | * 3) make sure there are entries for your case in new_text_title() |
1858 | * and add_authour(). |
1858 | * and add_authour(). |
1859 | * 4) you may want separate authour/book name arrays in read.h |
1859 | * 4) you may want separate authour/book name arrays in read.h |
1860 | */ |
1860 | */ |
1861 | |
|
|
1862 | msg_type = msg_type > 0 ? msg_type : (RANDOM () % 6); |
1861 | msg_type = msg_type > 0 ? msg_type : rndm (8); |
1863 | switch (msg_type) |
1862 | switch (msg_type) |
1864 | { |
1863 | { |
1865 | case 1: /* monster attrib */ |
1864 | case 1: /* monster attrib */ |
1866 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1865 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1867 | break; |
1866 | break; |
… | |
… | |
1891 | { |
1890 | { |
1892 | book->msg = msgbuf; |
1891 | book->msg = msgbuf; |
1893 | /* lets give the "book" a new name, which may be a compound word */ |
1892 | /* lets give the "book" a new name, which may be a compound word */ |
1894 | change_book (book, msg_type); |
1893 | change_book (book, msg_type); |
1895 | } |
1894 | } |
1896 | |
|
|
1897 | } |
1895 | } |
1898 | |
1896 | |
1899 | |
1897 | |
1900 | /***************************************************************************** |
1898 | /***************************************************************************** |
1901 | * |
1899 | * |