| 1 | /* |
1 | /* |
| 2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
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 it |
8 | * Deliantra is free software: you can redistribute it and/or modify |
| 9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
| 10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
| 11 | * any later version. |
11 | * (at your option) any later version. |
| 12 | * |
12 | * |
| 13 | * This program is distributed in the hope that it will be useful, but |
13 | * This program is distributed in the hope that it will be useful, |
| 14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 | * 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 along |
18 | * You should have received a copy of the GNU General Public License |
| 19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
| 21 | * |
20 | * |
| 22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 23 | */ |
22 | */ |
| 24 | |
23 | |
| 25 | /* This file contains code relevant to the BOOKS hack -- designed |
24 | /* This file contains code relevant to the BOOKS hack -- designed |
| 26 | * to allow randomly occuring messages in non-magical texts. |
25 | * to allow randomly occuring messages in non-magical texts. |
| 27 | */ |
26 | */ |
| … | |
… | |
| 1002 | { |
1001 | { |
| 1003 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1002 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
| 1004 | |
1003 | |
| 1005 | switch (book->type) |
1004 | switch (book->type) |
| 1006 | { |
1005 | { |
| 1007 | case BOOK: |
1006 | case BOOK: |
| 1008 | { |
1007 | { |
| 1009 | titlelist *tl = get_titlelist (msgtype); |
1008 | titlelist *tl = get_titlelist (msgtype); |
| 1010 | title *t = NULL; |
1009 | title *t = NULL; |
| 1011 | int tries = 0; |
1010 | int tries = 0; |
| 1012 | |
1011 | |
| 1013 | /* look to see if our msg already been archived. If so, alter |
1012 | /* look to see if our msg already been archived. If so, alter |
| 1014 | * the book to match the archival text. If we fail to match, |
1013 | * the book to match the archival text. If we fail to match, |
| 1015 | * then we archive the new title/name/msg combo if there is |
1014 | * then we archive the new title/name/msg combo if there is |
| 1016 | * room on the titlelist. |
1015 | * room on the titlelist. |
| 1017 | */ |
1016 | */ |
| 1018 | |
1017 | |
| 1019 | if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) |
1018 | if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) |
| 1020 | { |
1019 | { |
| 1021 | object *tmpbook; |
|
|
| 1022 | |
|
|
| 1023 | /* alter book properties */ |
1020 | /* alter book properties */ |
| 1024 | if ((tmpbook = get_archetype (t->archname)) != NULL) |
1021 | if (object *tmpbook = get_archetype (t->archname)) |
|
|
1022 | { |
|
|
1023 | tmpbook->msg = book->msg; |
|
|
1024 | tmpbook->copy_to (book); |
|
|
1025 | tmpbook->destroy (); |
|
|
1026 | } |
|
|
1027 | |
|
|
1028 | book->title = t->authour; |
|
|
1029 | book->name = t->name; |
|
|
1030 | book->level = t->level; |
|
|
1031 | } |
|
|
1032 | /* Don't have any default title, so lets make up a new one */ |
|
|
1033 | else |
|
|
1034 | { |
|
|
1035 | int numb, maxnames = max_titles[msgtype]; |
|
|
1036 | const char *old_title; |
|
|
1037 | const char *old_name; |
|
|
1038 | |
|
|
1039 | old_title = book->title; |
|
|
1040 | old_name = book->name; |
|
|
1041 | |
|
|
1042 | /* some pre-generated books have title already set (from |
|
|
1043 | * maps), also don't bother looking for unique title if |
|
|
1044 | * we already used up all the available names! */ |
|
|
1045 | |
|
|
1046 | if (!tl) |
|
|
1047 | { |
|
|
1048 | LOG (llevError, "change_book_name(): can't find title list\n"); |
|
|
1049 | numb = 0; |
|
|
1050 | } |
|
|
1051 | else |
|
|
1052 | numb = tl->number; |
|
|
1053 | |
|
|
1054 | if (numb == maxnames) |
|
|
1055 | { |
|
|
1056 | #ifdef ARCHIVE_DEBUG |
|
|
1057 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
|
|
1058 | #endif |
|
|
1059 | break; |
|
|
1060 | } |
|
|
1061 | /* shouldnt change map-maker books */ |
|
|
1062 | else if (!book->title) |
|
|
1063 | do |
| 1025 | { |
1064 | { |
| 1026 | tmpbook->msg = book->msg; |
1065 | /* random book name */ |
| 1027 | tmpbook->copy_to (book); |
1066 | new_text_name (book, msgtype); |
| 1028 | tmpbook->destroy (); |
1067 | add_author (book, msgtype); /* random author */ |
|
|
1068 | tries++; |
| 1029 | } |
1069 | } |
|
|
1070 | while (!unique_book (book, msgtype) && tries < MAX_TITLE_CHECK); |
| 1030 | |
1071 | |
| 1031 | book->title = t->authour; |
1072 | /* Now deal with 2 cases. |
| 1032 | book->name = t->name; |
1073 | * 1)If no space for a new title exists lets just restore |
| 1033 | book->level = t->level; |
1074 | * the old book properties. Remember, if the book had |
|
|
1075 | * matchd an older entry on the titlelist, we shouldnt |
|
|
1076 | * have called this routine in the first place! |
|
|
1077 | * 2) If we got a unique title, we need to add it to |
|
|
1078 | * the list. |
| 1034 | } |
1079 | */ |
| 1035 | /* Don't have any default title, so lets make up a new one */ |
|
|
| 1036 | else |
|
|
| 1037 | { |
|
|
| 1038 | int numb, maxnames = max_titles[msgtype]; |
|
|
| 1039 | const char *old_title; |
|
|
| 1040 | const char *old_name; |
|
|
| 1041 | |
1080 | |
| 1042 | old_title = book->title; |
1081 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
| 1043 | old_name = book->name; |
1082 | { /* got to check maxnames again */ |
| 1044 | |
|
|
| 1045 | /* some pre-generated books have title already set (from |
|
|
| 1046 | * maps), also don't bother looking for unique title if |
|
|
| 1047 | * we already used up all the available names! */ |
|
|
| 1048 | |
|
|
| 1049 | if (!tl) |
|
|
| 1050 | { |
|
|
| 1051 | LOG (llevError, "change_book_name(): can't find title list\n"); |
|
|
| 1052 | numb = 0; |
|
|
| 1053 | } |
|
|
| 1054 | else |
|
|
| 1055 | numb = tl->number; |
|
|
| 1056 | |
|
|
| 1057 | if (numb == maxnames) |
|
|
| 1058 | { |
|
|
| 1059 | #ifdef ARCHIVE_DEBUG |
1083 | #ifdef ARCHIVE_DEBUG |
| 1060 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
1084 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames); |
| 1061 | #endif |
1085 | #endif |
| 1062 | break; |
1086 | /* restore old book properties here */ |
| 1063 | } |
1087 | book->title = old_title; |
| 1064 | /* shouldnt change map-maker books */ |
1088 | |
| 1065 | else if (!book->title) |
1089 | if (RANDOM () % 4) |
| 1066 | do |
|
|
| 1067 | { |
1090 | { |
| 1068 | /* random book name */ |
1091 | /* Lets give the book a description to individualize it some */ |
| 1069 | new_text_name (book, msgtype); |
1092 | char new_name[MAX_BUF]; |
| 1070 | add_author (book, msgtype); /* random author */ |
1093 | |
| 1071 | tries++; |
1094 | snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name); |
|
|
1095 | |
|
|
1096 | book->name = new_name; |
| 1072 | } |
1097 | } |
| 1073 | while (!unique_book (book, msgtype) && tries < MAX_TITLE_CHECK); |
|
|
| 1074 | |
|
|
| 1075 | /* Now deal with 2 cases. |
|
|
| 1076 | * 1)If no space for a new title exists lets just restore |
|
|
| 1077 | * the old book properties. Remember, if the book had |
|
|
| 1078 | * matchd an older entry on the titlelist, we shouldnt |
|
|
| 1079 | * have called this routine in the first place! |
|
|
| 1080 | * 2) If we got a unique title, we need to add it to |
|
|
| 1081 | * the list. |
|
|
| 1082 | */ |
|
|
| 1083 | |
|
|
| 1084 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
|
|
| 1085 | { /* got to check maxnames again */ |
|
|
| 1086 | #ifdef ARCHIVE_DEBUG |
|
|
| 1087 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames); |
|
|
| 1088 | #endif |
|
|
| 1089 | /* restore old book properties here */ |
|
|
| 1090 | book->title = old_title; |
|
|
| 1091 | |
|
|
| 1092 | if (RANDOM () % 4) |
|
|
| 1093 | { |
|
|
| 1094 | /* Lets give the book a description to individualize it some */ |
|
|
| 1095 | char new_name[MAX_BUF]; |
|
|
| 1096 | |
|
|
| 1097 | snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name); |
|
|
| 1098 | |
|
|
| 1099 | book->name = new_name; |
|
|
| 1100 | } |
|
|
| 1101 | else |
1098 | else |
| 1102 | { |
1099 | { |
| 1103 | book->name = old_name; |
1100 | book->name = old_name; |
| 1104 | } |
1101 | } |
| 1105 | } |
1102 | } |
| 1106 | else if (book->title && strlen (book->msg) > 5) |
1103 | else if (book->title && strlen (book->msg) > 5) |
| 1107 | { /* archive if long msg texts */ |
1104 | { /* archive if long msg texts */ |
| 1108 | add_book_to_list (book, msgtype); |
1105 | add_book_to_list (book, msgtype); |
| 1109 | } |
1106 | } |
| 1110 | } |
1107 | } |
| 1111 | break; |
1108 | break; |
| 1112 | } |
1109 | } |
| 1113 | |
1110 | |
| 1114 | default: |
1111 | default: |
| 1115 | LOG (llevError, "change_book_name() called w/ illegal obj type.\n"); |
1112 | LOG (llevError, "change_book_name() called w/ illegal obj type.\n"); |
| 1116 | return; |
1113 | return; |
| 1117 | } |
1114 | } |
| 1118 | } |
1115 | } |
| 1119 | |
1116 | |
| 1120 | /***************************************************************************** |
1117 | /***************************************************************************** |
| 1121 | * |
1118 | * |
| … | |
… | |
| 1592 | |
1589 | |
| 1593 | book->msg = retbuf; |
1590 | book->msg = retbuf; |
| 1594 | } |
1591 | } |
| 1595 | } |
1592 | } |
| 1596 | |
1593 | |
|
|
1594 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
|
|
1595 | if(variable) { \ |
|
|
1596 | int i,j=0; \ |
|
|
1597 | strcat(retbuf,"(" name ": "); \ |
|
|
1598 | for(i=0; i<NRSPELLPATHS; i++) \ |
|
|
1599 | if(variable & (1<<i)) { \ |
|
|
1600 | if (j) \ |
|
|
1601 | strcat(retbuf,", "); \ |
|
|
1602 | else \ |
|
|
1603 | j = 1; \ |
|
|
1604 | strcat(retbuf, spellpathnames[i]); \ |
|
|
1605 | } \ |
|
|
1606 | strcat(retbuf,")"); \ |
|
|
1607 | } |
|
|
1608 | |
| 1597 | /* god_info_msg() - generate a message detailing the properties |
1609 | /* god_info_msg() - generate a message detailing the properties |
| 1598 | * of a random god. Used by the book hack. b.t. |
1610 | * of a random god. Used by the book hack. b.t. |
| 1599 | */ |
1611 | */ |
| 1600 | const char * |
1612 | const char * |
| 1601 | god_info_msg (int level, int booksize) |
1613 | god_info_msg (int level, int booksize) |
| … | |
… | |
| 1629 | |
1641 | |
| 1630 | /* Information about the god is random, and based on the level of the |
1642 | /* Information about the god is random, and based on the level of the |
| 1631 | * 'book'. Probably there is a more intellegent way to implement |
1643 | * 'book'. Probably there is a more intellegent way to implement |
| 1632 | * this ... |
1644 | * this ... |
| 1633 | */ |
1645 | */ |
| 1634 | |
|
|
| 1635 | while (level > 0) |
1646 | while (level > 0) |
| 1636 | { |
1647 | { |
| 1637 | sprintf (buf, " "); |
1648 | sprintf (buf, " "); |
| 1638 | if (level == 2 && RANDOM () % 2) |
1649 | if (level == 2 && RANDOM () % 2) |
| 1639 | { /* enemy god */ |
1650 | { /* enemy god */ |
| … | |
… | |
| 1843 | * 2) make sure there is an entry in max_titles[] array. |
1854 | * 2) make sure there is an entry in max_titles[] array. |
| 1844 | * 3) make sure there are entries for your case in new_text_title() |
1855 | * 3) make sure there are entries for your case in new_text_title() |
| 1845 | * and add_authour(). |
1856 | * and add_authour(). |
| 1846 | * 4) you may want separate authour/book name arrays in read.h |
1857 | * 4) you may want separate authour/book name arrays in read.h |
| 1847 | */ |
1858 | */ |
| 1848 | |
|
|
| 1849 | msg_type = msg_type > 0 ? msg_type : (RANDOM () % 6); |
1859 | msg_type = msg_type > 0 ? msg_type : (RANDOM () % 8); |
| 1850 | switch (msg_type) |
1860 | switch (msg_type) |
| 1851 | { |
1861 | { |
| 1852 | case 1: /* monster attrib */ |
1862 | case 1: /* monster attrib */ |
| 1853 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1863 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
| 1854 | break; |
1864 | break; |
| … | |
… | |
| 1878 | { |
1888 | { |
| 1879 | book->msg = msgbuf; |
1889 | book->msg = msgbuf; |
| 1880 | /* lets give the "book" a new name, which may be a compound word */ |
1890 | /* lets give the "book" a new name, which may be a compound word */ |
| 1881 | change_book (book, msg_type); |
1891 | change_book (book, msg_type); |
| 1882 | } |
1892 | } |
| 1883 | |
|
|
| 1884 | } |
1893 | } |
| 1885 | |
1894 | |
| 1886 | |
1895 | |
| 1887 | /***************************************************************************** |
1896 | /***************************************************************************** |
| 1888 | * |
1897 | * |
