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,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 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 | |
111 | static int nrofmon = 0, need_to_write_bookarchive = 0; |
111 | static 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 */ |
|
|
116 | static int nrofmsg = 0; |
|
|
117 | |
|
|
118 | /* first_msg is the started of the linked list of messages as read from |
|
|
119 | * the messages file |
|
|
120 | */ |
|
|
121 | static linked_char *first_msg = NULL; |
|
|
122 | |
|
|
123 | /* |
113 | /* |
124 | * Spellpath information |
114 | * Spellpath information |
125 | */ |
115 | */ |
126 | |
|
|
127 | static uint32 spellpathdef[NRSPELLPATHS] = { |
116 | static uint32 spellpathdef[NRSPELLPATHS] = { |
128 | PATH_PROT, |
117 | PATH_PROT, |
129 | PATH_FIRE, |
118 | PATH_FIRE, |
130 | PATH_FROST, |
119 | PATH_FROST, |
131 | PATH_ELEC, |
120 | PATH_ELEC, |
… | |
… | |
497 | /*subtype 50 */ {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_3, "readable-monument-gravestone-3"}, |
486 | /*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"}, |
487 | {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"}, |
488 | {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"} |
489 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_3, "readable-monument-wall-3"} |
501 | }; |
490 | }; |
502 | int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); |
491 | static int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); |
503 | |
492 | |
504 | static int max_titles[6] = { |
493 | static int max_titles[6] = { |
505 | ((sizeof (light_book_name) / sizeof (char *)) + (sizeof (heavy_book_name) / sizeof (char *))) * (sizeof (book_author) / sizeof (char *)), |
494 | ((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 *)), |
495 | (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)), |
507 | (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)), |
496 | (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)), |
… | |
… | |
515 | * Start of misc. readable functions used by others functions in this file |
504 | * Start of misc. readable functions used by others functions in this file |
516 | * |
505 | * |
517 | *****************************************************************************/ |
506 | *****************************************************************************/ |
518 | |
507 | |
519 | static titlelist * |
508 | static titlelist * |
520 | get_empty_booklist (void) |
509 | get_empty_booklist () |
521 | { |
510 | { |
522 | titlelist *bl = new titlelist; |
511 | titlelist *bl = new titlelist; |
523 | |
512 | |
524 | bl->number = 0; |
513 | bl->number = 0; |
525 | bl->first_book = NULL; |
514 | bl->first_book = NULL; |
526 | bl->next = NULL; |
515 | bl->next = NULL; |
527 | return bl; |
516 | return bl; |
528 | } |
517 | } |
529 | |
518 | |
530 | static title * |
519 | static title * |
531 | get_empty_book (void) |
520 | get_empty_book () |
532 | { |
521 | { |
533 | title *t = new title; |
522 | title *t = new title; |
534 | |
523 | |
535 | t->name = NULL; |
524 | t->name = NULL; |
536 | t->archname = NULL; |
525 | t->archname = NULL; |
… | |
… | |
569 | * (shstr.c ?), but the quantity BOOK_BUF will need to be defined. */ |
558 | * (shstr.c ?), but the quantity BOOK_BUF will need to be defined. */ |
570 | |
559 | |
571 | /* nstrtok() - simple routine to return the number of list |
560 | /* nstrtok() - simple routine to return the number of list |
572 | * items in buf1 as separated by the value of buf2 |
561 | * items in buf1 as separated by the value of buf2 |
573 | */ |
562 | */ |
574 | |
563 | static int |
575 | int |
|
|
576 | nstrtok (const char *buf1, const char *buf2) |
564 | nstrtok (const char *buf1, const char *buf2) |
577 | { |
565 | { |
578 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
566 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
579 | int number = 0; |
567 | int number = 0; |
580 | |
568 | |
… | |
… | |
593 | |
581 | |
594 | /* strtoktolin() - takes a string in buf1 and separates it into |
582 | /* strtoktolin() - takes a string in buf1 and separates it into |
595 | * a list of strings delimited by buf2. Then returns a comma |
583 | * a list of strings delimited by buf2. Then returns a comma |
596 | * separated string w/ decent punctuation. |
584 | * separated string w/ decent punctuation. |
597 | */ |
585 | */ |
598 | |
586 | static char * |
599 | char * |
|
|
600 | strtoktolin (const char *buf1, const char *buf2) |
587 | strtoktolin (const char *buf1, const char *buf2) |
601 | { |
588 | { |
602 | int maxi, i = nstrtok (buf1, buf2); |
589 | int maxi, i = nstrtok (buf1, buf2); |
603 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
590 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
604 | static char rbuf[BOOK_BUF]; |
591 | static char rbuf[BOOK_BUF]; |
… | |
… | |
621 | tbuf = strtok (NULL, sbuf); |
608 | tbuf = strtok (NULL, sbuf); |
622 | } |
609 | } |
623 | return (char *) rbuf; |
610 | return (char *) rbuf; |
624 | } |
611 | } |
625 | |
612 | |
626 | int |
|
|
627 | book_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 | } |
|
|
637 | |
|
|
638 | /***************************************************************************** |
613 | /***************************************************************************** |
639 | * |
614 | * |
640 | * Start of initialisation related functions. |
615 | * Start of initialisation related functions. |
641 | * |
616 | * |
642 | ****************************************************************************/ |
617 | ****************************************************************************/ |
… | |
… | |
644 | /* init_book_archive() - if not called before, initialise the info list |
619 | /* init_book_archive() - if not called before, initialise the info list |
645 | * This reads in the bookarch file into memory. bookarch is the file |
620 | * This reads in the bookarch file into memory. bookarch is the file |
646 | * created and updated across multiple runs of the program. |
621 | * created and updated across multiple runs of the program. |
647 | */ |
622 | */ |
648 | static void |
623 | static void |
649 | init_book_archive (void) |
624 | init_book_archive () |
650 | { |
625 | { |
651 | FILE *fp; |
626 | FILE *fp; |
652 | int comp, nroftitle = 0; |
627 | int comp, nroftitle = 0; |
653 | char buf[MAX_BUF], fname[MAX_BUF], *cp; |
628 | char buf[MAX_BUF], fname[MAX_BUF], *cp; |
654 | title *book = NULL; |
629 | title *book = NULL; |
… | |
… | |
735 | } |
710 | } |
736 | |
711 | |
737 | /* init_mon_info() - creates the linked list of pointers to |
712 | /* init_mon_info() - creates the linked list of pointers to |
738 | * monster archetype objects if not called previously |
713 | * monster archetype objects if not called previously |
739 | */ |
714 | */ |
740 | |
|
|
741 | static void |
715 | static void |
742 | init_mon_info (void) |
716 | init_mon_info () |
743 | { |
717 | { |
744 | archetype *at; |
718 | archetype *at; |
745 | static int did_init_mon_info = 0; |
719 | static int did_init_mon_info = 0; |
746 | |
720 | |
747 | if (did_init_mon_info) |
721 | if (did_init_mon_info) |
748 | return; |
722 | return; |
749 | |
723 | |
750 | did_init_mon_info = 1; |
724 | did_init_mon_info = 1; |
751 | |
725 | |
752 | for_all_archetypes (at) |
726 | for_all_archetypes (at) |
753 | { |
727 | if (at->flag [FLAG_MONSTER] |
754 | if (QUERY_FLAG (at, FLAG_MONSTER) && (!QUERY_FLAG (at, FLAG_CHANGING) || QUERY_FLAG (at, FLAG_UNAGGRESSIVE))) |
728 | && at->is_head () |
|
|
729 | && (!at->flag [FLAG_CHANGING] || at->flag [FLAG_UNAGGRESSIVE])) |
755 | { |
730 | { |
756 | objectlink *mon = new objectlink; |
731 | objectlink *mon = new objectlink; |
757 | |
732 | |
758 | mon->ob = at; |
733 | mon->ob = at; |
759 | mon->next = first_mon_info; |
734 | mon->next = first_mon_info; |
760 | first_mon_info = mon; |
735 | first_mon_info = mon; |
761 | nrofmon++; |
736 | nrofmon++; |
762 | } |
737 | } |
763 | } |
|
|
764 | |
738 | |
765 | LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); |
739 | LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); |
766 | } |
740 | } |
767 | |
741 | |
768 | /* init_readable() - initialise linked lists utilized by |
742 | /* init_readable() - initialise linked lists utilized by |
… | |
… | |
770 | * |
744 | * |
771 | * This is the function called by the main routine to initialise |
745 | * This is the function called by the main routine to initialise |
772 | * all the readable information. |
746 | * all the readable information. |
773 | */ |
747 | */ |
774 | void |
748 | void |
775 | init_readable (void) |
749 | init_readable () |
776 | { |
750 | { |
777 | static int did_this; |
751 | static int did_this; |
778 | |
752 | |
779 | if (did_this) |
753 | if (did_this) |
780 | return; |
754 | return; |
… | |
… | |
817 | else |
791 | else |
818 | t = t->next; |
792 | t = t->next; |
819 | |
793 | |
820 | #ifdef ARCHIVE_DEBUG |
794 | #ifdef ARCHIVE_DEBUG |
821 | if (t) |
795 | if (t) |
822 | LOG (llevDebug, "Found title match (list %d): %s %s (%d)\n", msgtype, t->name, t->authour, t->msg_index); |
796 | LOG (llevDebug, "Found title match (list %d): %s %s (%d)\n", msgtype, &t->name, &t->authour, t->msg_index); |
823 | #endif |
797 | #endif |
824 | |
798 | |
825 | return t; |
799 | return t; |
826 | } |
800 | } |
827 | |
801 | |
… | |
… | |
829 | * handled directly in change_book_name(). Names are based on text |
803 | * handled directly in change_book_name(). Names are based on text |
830 | * msgtype |
804 | * msgtype |
831 | * this sets book book->name based on msgtype given. What name |
805 | * this sets book book->name based on msgtype given. What name |
832 | * is given is based on various criteria |
806 | * is given is based on various criteria |
833 | */ |
807 | */ |
834 | |
|
|
835 | static void |
808 | static void |
836 | new_text_name (object *book, int msgtype) |
809 | new_text_name (object *book, int msgtype) |
837 | { |
810 | { |
838 | int nbr; |
811 | int nbr; |
839 | char name[MAX_BUF]; |
812 | char name[MAX_BUF]; |
… | |
… | |
975 | |
948 | |
976 | /* We have stuff we need to write now */ |
949 | /* We have stuff we need to write now */ |
977 | need_to_write_bookarchive = 1; |
950 | need_to_write_bookarchive = 1; |
978 | |
951 | |
979 | #ifdef ARCHIVE_DEBUG |
952 | #ifdef ARCHIVE_DEBUG |
980 | LOG (llevDebug, "Archiving new title: %s %s (%d)\n", book->name, book->title, msgtype); |
953 | LOG (llevDebug, "Archiving new title: %s %s (%d)\n", &book->name, &book->title, msgtype); |
981 | #endif |
954 | #endif |
982 | |
955 | |
983 | } |
956 | } |
984 | |
957 | |
985 | |
958 | |
… | |
… | |
991 | * levels and architypes. -b.t. |
964 | * levels and architypes. -b.t. |
992 | */ |
965 | */ |
993 | |
966 | |
994 | #define MAX_TITLE_CHECK 20 |
967 | #define MAX_TITLE_CHECK 20 |
995 | |
968 | |
996 | void |
969 | static void |
997 | change_book (object *book, int msgtype) |
970 | change_book (object *book, int msgtype) |
998 | { |
971 | { |
999 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
972 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1000 | |
973 | |
1001 | switch (book->type) |
974 | switch (book->type) |
… | |
… | |
1051 | if (numb == maxnames) |
1024 | if (numb == maxnames) |
1052 | { |
1025 | { |
1053 | #ifdef ARCHIVE_DEBUG |
1026 | #ifdef ARCHIVE_DEBUG |
1054 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
1027 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
1055 | #endif |
1028 | #endif |
1056 | break; |
|
|
1057 | } |
1029 | } |
1058 | /* shouldnt change map-maker books */ |
1030 | /* shouldnt change map-maker books */ |
1059 | else if (!book->title) |
1031 | else if (!book->title) |
1060 | do |
1032 | do |
1061 | { |
1033 | { |
… | |
… | |
1076 | */ |
1048 | */ |
1077 | |
1049 | |
1078 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1050 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1079 | { /* got to check maxnames again */ |
1051 | { /* got to check maxnames again */ |
1080 | #ifdef ARCHIVE_DEBUG |
1052 | #ifdef ARCHIVE_DEBUG |
1081 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames); |
1053 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", &book->name, &book->title, numb, maxnames); |
1082 | #endif |
1054 | #endif |
1083 | /* restore old book properties here */ |
1055 | /* restore old book properties here */ |
1084 | book->title = old_title; |
1056 | book->title = old_title; |
1085 | |
1057 | |
1086 | if (rndm (4)) |
1058 | if (rndm (4)) |
… | |
… | |
1126 | * list of all monsters in the current game. If level is non-zero, |
1098 | * list of all monsters in the current game. If level is non-zero, |
1127 | * then only monsters greater than that level will be returned. |
1099 | * then only monsters greater than that level will be returned. |
1128 | * Changed 971225 to be greater than equal to level passed. Also |
1100 | * Changed 971225 to be greater than equal to level passed. Also |
1129 | * made choosing by level more random. |
1101 | * made choosing by level more random. |
1130 | */ |
1102 | */ |
1131 | |
|
|
1132 | object * |
1103 | object * |
1133 | get_random_mon (int level) |
1104 | get_random_mon (int level) |
1134 | { |
1105 | { |
1135 | objectlink *mon = first_mon_info; |
1106 | objectlink *mon = first_mon_info; |
1136 | int i = 0, monnr; |
1107 | int i = 0, monnr; |
… | |
… | |
1194 | |
1165 | |
1195 | /* |
1166 | /* |
1196 | * Returns a description of the monster. This really needs to be |
1167 | * Returns a description of the monster. This really needs to be |
1197 | * redone, as describe_item really gives a pretty internal description. |
1168 | * redone, as describe_item really gives a pretty internal description. |
1198 | */ |
1169 | */ |
1199 | |
1170 | static const char * |
1200 | char * |
|
|
1201 | mon_desc (const object *mon) |
1171 | mon_desc (const object *mon) |
1202 | { |
1172 | { |
1203 | static char retbuf[HUGE_BUF]; |
1173 | static dynbuf_text buf; buf.clear (); |
1204 | |
1174 | |
1205 | sprintf (retbuf, " *** %s ***\n", &mon->name); |
1175 | buf.printf ("B<< %s >>\r", &mon->name); |
1206 | strcat (retbuf, describe_item (mon, NULL)); |
1176 | buf << describe_item (mon, 0); |
1207 | |
1177 | |
1208 | return retbuf; |
1178 | return buf; |
1209 | } |
1179 | } |
1210 | |
1180 | |
1211 | |
1181 | |
1212 | /* This function returns the next monsters after 'tmp'. If no match is |
1182 | /* This function returns the next monsters after 'tmp'. If no match is |
1213 | * found, it returns NULL (changed 0.94.3 to do this, since the |
1183 | * found, it returns NULL (changed 0.94.3 to do this, since the |
1214 | * calling function (mon_info_msg) seems to expect that. |
1184 | * calling function (mon_info_msg) seems to expect that. |
1215 | */ |
1185 | */ |
1216 | |
1186 | static object * |
1217 | object * |
|
|
1218 | get_next_mon (object *tmp) |
1187 | get_next_mon (object *tmp) |
1219 | { |
1188 | { |
1220 | objectlink *mon; |
1189 | objectlink *mon; |
1221 | |
1190 | |
1222 | for (mon = first_mon_info; mon; mon = mon->next) |
1191 | for (mon = first_mon_info; mon; mon = mon->next) |
… | |
… | |
1224 | break; |
1193 | break; |
1225 | |
1194 | |
1226 | /* didn't find a match */ |
1195 | /* didn't find a match */ |
1227 | if (!mon) |
1196 | if (!mon) |
1228 | return NULL; |
1197 | return NULL; |
|
|
1198 | |
1229 | if (mon->next) |
1199 | if (mon->next) |
1230 | return mon->next->ob; |
1200 | return mon->next->ob; |
1231 | else |
1201 | else |
1232 | return first_mon_info->ob; |
1202 | return first_mon_info->ob; |
1233 | |
1203 | |
1234 | } |
1204 | } |
1235 | |
1205 | |
1236 | |
|
|
1237 | |
|
|
1238 | /* mon_info_msg() - generate a message detailing the properties |
1206 | /* mon_info_msg() - generate a message detailing the properties |
1239 | * of a randomly selected monster. |
1207 | * of a randomly selected monster. |
1240 | */ |
1208 | */ |
1241 | |
1209 | static const char * |
1242 | char * |
|
|
1243 | mon_info_msg (int level, int booksize) |
1210 | mon_info_msg (int level) |
1244 | { |
1211 | { |
1245 | static char retbuf[BOOK_BUF]; |
1212 | static dynbuf_text buf; buf.clear (); |
1246 | char tmpbuf[HUGE_BUF]; |
|
|
1247 | object *tmp; |
|
|
1248 | |
1213 | |
1249 | /*preamble */ |
1214 | /*preamble */ |
1250 | strcpy (retbuf, "This beastiary contains:"); |
1215 | buf << "This beastiary contains:\n"; |
1251 | |
1216 | |
1252 | /* lets print info on as many monsters as will fit in our |
1217 | /* lets print info on as many monsters as will fit in our |
1253 | * document. |
1218 | * document. |
1254 | * 8-96 Had to change this a bit, otherwise there would |
1219 | * 8-96 Had to change this a bit, otherwise there would |
1255 | * have been an impossibly large number of combinations |
1220 | * have been an impossibly large number of combinations |
1256 | * of text! (and flood out the available number of titles |
1221 | * of text! (and flood out the available number of titles |
1257 | * in the archive in a snap!) -b.t. |
1222 | * in the archive in a snap!) -b.t. |
1258 | */ |
1223 | */ |
1259 | tmp = get_random_mon (level * 3); |
1224 | object *tmp = get_random_mon (level * 3); |
1260 | while (tmp) |
1225 | while (tmp && buf.size () < BOOK_BUF) |
1261 | { |
1226 | { |
1262 | /* monster description */ |
1227 | /* monster description */ |
1263 | sprintf (tmpbuf, "\n---\n%s", mon_desc (tmp)); |
1228 | buf.printf ("\n%s\n", mon_desc (tmp)); |
1264 | |
|
|
1265 | if (!book_overflow (retbuf, tmpbuf, booksize)) |
|
|
1266 | strcat (retbuf, tmpbuf); |
|
|
1267 | else |
|
|
1268 | break; |
|
|
1269 | |
1229 | |
1270 | /* Note that the value this returns is not based on level */ |
1230 | /* Note that the value this returns is not based on level */ |
1271 | tmp = get_next_mon (tmp); |
1231 | tmp = get_next_mon (tmp); |
1272 | } |
1232 | } |
1273 | |
1233 | |
1274 | #ifdef BOOK_MSG_DEBUG |
|
|
1275 | LOG (llevDebug, "\n mon_info_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1276 | fprintf (logfile, " MADE THIS:\n%s\n", retbuf); |
|
|
1277 | #endif |
|
|
1278 | |
|
|
1279 | return retbuf; |
1234 | return buf; |
1280 | } |
1235 | } |
1281 | |
1236 | |
1282 | |
1237 | |
1283 | /***************************************************************************** |
1238 | /***************************************************************************** |
1284 | * Artifact msg generation code. |
1239 | * Artifact msg generation code. |
1285 | ****************************************************************************/ |
1240 | ****************************************************************************/ |
1286 | |
1241 | |
1287 | /* artifact_msg() - generate a message detailing the properties |
1242 | /* artifact_msg() - generate a message detailing the properties |
1288 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1243 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1289 | */ |
1244 | */ |
1290 | const char * |
1245 | static const char * |
1291 | artifact_msg (int level, int booksize) |
1246 | artifact_msg (int level) |
1292 | { |
1247 | { |
1293 | artifactlist *al = NULL; |
1248 | artifactlist *al = NULL; |
1294 | artifact *art; |
1249 | artifact *art; |
1295 | int chance, i, type, index; |
1250 | int chance, i, type, index; |
1296 | int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1; |
1251 | int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1; |
1297 | const char *ch; |
1252 | const char *ch; |
1298 | char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1253 | char name[MAX_BUF]; |
1299 | static char retbuf[BOOK_BUF]; |
|
|
1300 | object *tmp = NULL; |
1254 | object *tmp = NULL; |
|
|
1255 | |
|
|
1256 | static dynbuf_text buf; buf.clear (); |
1301 | |
1257 | |
1302 | /* values greater than 5 create msg buffers that are too big! */ |
1258 | /* values greater than 5 create msg buffers that are too big! */ |
1303 | if (book_entries > 5) |
1259 | if (book_entries > 5) |
1304 | book_entries = 5; |
1260 | book_entries = 5; |
1305 | |
1261 | |
… | |
… | |
1334 | |
1290 | |
1335 | /* the base 'generic' name for our artifact */ |
1291 | /* the base 'generic' name for our artifact */ |
1336 | assign (name, art_name_array[index].name); |
1292 | assign (name, art_name_array[index].name); |
1337 | |
1293 | |
1338 | /* Ok, lets print out the contents */ |
1294 | /* Ok, lets print out the contents */ |
1339 | sprintf (retbuf, "Herein %s detailed %s...\n", book_entries > 1 ? "are" : "is", book_entries > 1 ? "some artifacts" : "an artifact"); |
1295 | buf.printf ("Herein %s detailed %s...\n", |
|
|
1296 | book_entries > 1 ? "are" : "is", |
|
|
1297 | book_entries > 1 ? "some artifacts" : "an artifact"); |
1340 | |
1298 | |
1341 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1299 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1342 | * as long as we have space up to the allowed max # (book_entires) |
1300 | * as long as we have space up to the allowed max # (book_entires) |
1343 | */ |
1301 | */ |
1344 | while (book_entries > 0) |
1302 | while (book_entries > 0 && buf.size () < BOOK_BUF) |
1345 | { |
1303 | { |
1346 | |
1304 | |
1347 | if (art == NULL) |
1305 | if (!art) |
1348 | art = al->items; |
1306 | art = al->items; |
1349 | |
1307 | |
1350 | /* separator of items */ |
1308 | buf << '\n'; |
1351 | strcpy (buf, "--- \n"); |
|
|
1352 | |
1309 | |
1353 | /* Name */ |
1310 | /* Name */ |
1354 | if (art->allowed != NULL && strcmp (art->allowed->name, "All")) |
1311 | if (art->allowed && art->allowed->name != shstr_All) |
1355 | { |
1312 | { |
1356 | linked_char *temp, *next = art->allowed; |
1313 | linked_char *temp, *next = art->allowed; |
1357 | |
1314 | |
1358 | do |
1315 | do |
1359 | { |
1316 | { |
1360 | temp = next; |
1317 | temp = next; |
1361 | next = next->next; |
1318 | next = next->next; |
1362 | } |
1319 | } |
1363 | while (next && rndm (2)); |
1320 | while (next && rndm (2)); |
|
|
1321 | |
1364 | sprintf (buf, "%s A %s of %s", buf, &temp->name, &art->item->name); |
1322 | buf.printf ("A B<< %s of %s >>", &temp->name, &art->item->name); |
1365 | } |
1323 | } |
1366 | else /* default name is used */ |
1324 | else /* default name is used */ |
1367 | sprintf (buf, "%s The %s of %s", buf, name, &art->item->name); |
1325 | buf.printf ("The B<< %s of %s >>", name, &art->item->name); |
|
|
1326 | |
|
|
1327 | buf << " is "; |
1368 | |
1328 | |
1369 | /* chance of finding */ |
1329 | /* chance of finding */ |
1370 | chance = (int) (100 * ((float) art->chance / al->total_chance)); |
1330 | chance = (int) (100 * ((float) art->chance / al->total_chance)); |
1371 | if (chance >= 20) |
1331 | if (chance >= 20) |
1372 | sprintf (sbuf, "an uncommon"); |
1332 | buf << "an uncommon"; |
1373 | else if (chance >= 10) |
1333 | else if (chance >= 10) |
1374 | sprintf (sbuf, "an unusual"); |
1334 | buf << "an unusual"; |
1375 | else if (chance >= 5) |
1335 | else if (chance >= 5) |
1376 | sprintf (sbuf, "a rare"); |
1336 | buf << "a rare"; |
1377 | else |
1337 | else |
1378 | sprintf (sbuf, "a very rare"); |
1338 | buf << "a very rare"; |
1379 | sprintf (buf, "%s is %s\n", buf, sbuf); |
|
|
1380 | |
1339 | |
1381 | /* value of artifact */ |
1340 | /* value of artifact */ |
1382 | sprintf (buf, "%s item with a value that is %d times normal.\n", buf, art->item->value); |
1341 | buf << " item with a value that is " << art->item->value << " times normal.\n"; |
1383 | |
1342 | |
1384 | /* include the message about the artifact, if exists, and book |
1343 | /* include the message about the artifact, if exists, and book |
1385 | * level is kinda high */ |
1344 | * level is kinda high */ |
1386 | if (art->item->msg |
1345 | if (art->item->msg |
1387 | && rndm (4) + 1 < level |
1346 | && rndm (4) + 1 < level) |
1388 | && !(strlen (art->item->msg) + strlen (buf) > BOOK_BUF)) |
|
|
1389 | strcat (buf, art->item->msg); |
1347 | buf << art->item->msg; |
1390 | |
1348 | |
1391 | /* properties of the artifact */ |
1349 | /* properties of the artifact */ |
1392 | tmp = object::create (); |
1350 | tmp = object::create (); |
1393 | add_abilities (tmp, art->item); |
1351 | add_abilities (tmp, art->item); |
1394 | tmp->type = type; |
1352 | tmp->type = type; |
1395 | SET_FLAG (tmp, FLAG_IDENTIFIED); |
1353 | tmp->set_flag (FLAG_IDENTIFIED); |
1396 | if ((ch = describe_item (tmp, NULL)) != NULL && strlen (ch) > 1) |
1354 | if ((ch = describe_item (tmp, 0)) && strlen (ch) > 1) |
1397 | sprintf (buf, "%s Properties of this artifact include: \n %s \n", buf, ch); |
1355 | buf << "\rProperties of this artifact include:\r" << ch << "\n"; |
|
|
1356 | |
1398 | tmp->destroy (); |
1357 | 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 | |
1358 | |
1405 | art = art->next; |
1359 | art = art->next; |
1406 | book_entries--; |
1360 | book_entries--; |
1407 | } |
1361 | } |
1408 | |
1362 | |
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; |
1363 | return buf; |
1414 | } |
1364 | } |
1415 | |
1365 | |
1416 | /***************************************************************************** |
1366 | /***************************************************************************** |
1417 | * Spellpath message generation |
1367 | * Spellpath message generation |
1418 | *****************************************************************************/ |
1368 | *****************************************************************************/ |
1419 | |
1369 | |
1420 | /* spellpath_msg() - generate a message detailing the member |
1370 | /* spellpath_msg() - generate a message detailing the member |
1421 | * incantations/prayers (and some of their properties) belonging to |
1371 | * incantations/prayers (and some of their properties) belonging to |
1422 | * a given spellpath. |
1372 | * a given spellpath. |
1423 | */ |
1373 | */ |
1424 | |
1374 | static char * |
1425 | char * |
|
|
1426 | spellpath_msg (int level, int booksize) |
1375 | spellpath_msg (int level) |
1427 | { |
1376 | { |
|
|
1377 | static dynbuf_text buf; buf.clear (); |
|
|
1378 | |
1428 | static char retbuf[BOOK_BUF]; |
1379 | static char retbuf[BOOK_BUF]; |
1429 | char tmpbuf[BOOK_BUF]; |
1380 | char tmpbuf[BOOK_BUF]; |
1430 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
1381 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
1431 | int did_first_sp = 0; |
|
|
1432 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1382 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1433 | archetype *at; |
1383 | archetype *at; |
1434 | |
1384 | |
1435 | /* Preamble */ |
1385 | /* Preamble */ |
1436 | sprintf (retbuf, "Herein are detailed the names of %s\n", prayers ? "prayers" : "incantations"); |
1386 | buf << "Herein are detailed the names of " |
|
|
1387 | << (prayers ? "prayers" : "incantations"); |
1437 | |
1388 | |
1438 | if (path == -1) |
1389 | if (path == -1) |
1439 | strcat (retbuf, "having no known spell path.\n"); |
1390 | buf << " having no known spell path.\n"; |
1440 | else |
1391 | else |
1441 | sprintf (retbuf, "%sbelonging to the path of %s:\n", retbuf, spellpathnames[path]); |
1392 | buf << " belonging to the path of B<< " << spellpathnames[path] << " >>:\n\n"; |
|
|
1393 | |
|
|
1394 | int seen = 0; |
1442 | |
1395 | |
1443 | for_all_archetypes (at) |
1396 | for_all_archetypes (at) |
1444 | { |
|
|
1445 | /* Determine if this is an appropriate spell. Must |
1397 | /* Determine if this is an appropriate spell. Must |
1446 | * be of matching path, must be of appropriate type (prayer |
1398 | * be of matching path, must be of appropriate type (prayer |
1447 | * or not), and must be within the valid level range. |
1399 | * or not), and must be within the valid level range. |
1448 | */ |
1400 | */ |
1449 | if (at->type == SPELL && at->path_attuned & pnum && |
1401 | if (at->type == SPELL && at->path_attuned & pnum && |
1450 | ((at->stats.grace && prayers) || (at->stats.sp && !prayers)) && (at->level < (level * 8))) |
1402 | ((at->stats.grace && prayers) || (at->stats.sp && !prayers)) && (at->level < (level * 8))) |
1451 | { |
1403 | { |
1452 | assign (tmpbuf, at->object::name); |
1404 | seen = 1; |
1453 | |
1405 | 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 | } |
1406 | } |
1464 | } |
1407 | |
1465 | /* Geez, no spells were generated. */ |
1408 | /* Geez, no spells were generated. */ |
1466 | if (!did_first_sp) |
1409 | if (!seen) |
1467 | { |
|
|
1468 | if (rndm (4)) /* usually, lets make a recursive call... */ |
1410 | if (rndm (4)) /* usually, lets make a recursive call... */ |
1469 | spellpath_msg (level, booksize); |
1411 | return spellpath_msg (level); |
1470 | else /* give up, cause knowing no spells exist for path is info too. */ |
1412 | else /* give up, cause knowing no spells exist for path is info too. */ |
1471 | strcat (retbuf, "\n - no known spells exist -\n"); |
1413 | buf << "- no known spells exist.\n"; |
1472 | } |
1414 | |
1473 | else |
|
|
1474 | { |
|
|
1475 | strcat (retbuf, "\n"); |
|
|
1476 | } |
|
|
1477 | return retbuf; |
1415 | return buf; |
1478 | } |
1416 | } |
1479 | |
1417 | |
1480 | /* formula_msg() - generate a message detailing the properties |
1418 | /* formula_msg() - generate a message detailing the properties |
1481 | * of a randomly selected alchemical formula. |
1419 | * of a randomly selected alchemical formula. |
1482 | */ |
1420 | */ |
1483 | void |
1421 | static void |
1484 | make_formula_book (object *book, int level) |
1422 | make_formula_book (object *book, int level) |
1485 | { |
1423 | { |
1486 | char retbuf[BOOK_BUF], title[MAX_BUF]; |
1424 | char title[MAX_BUF]; |
1487 | recipelist *fl; |
1425 | recipelist *fl; |
1488 | recipe *formula = NULL; |
1426 | recipe *formula = NULL; |
1489 | int chance; |
1427 | int chance; |
|
|
1428 | |
|
|
1429 | static dynbuf_text buf; buf.clear (); |
1490 | |
1430 | |
1491 | /* the higher the book level, the more complex (ie number of |
1431 | /* the higher the book level, the more complex (ie number of |
1492 | * ingredients) the formula can be. |
1432 | * ingredients) the formula can be. |
1493 | */ |
1433 | */ |
1494 | fl = get_formulalist (rndm (level) / 3 + 1); |
1434 | fl = get_formulalist (rndm (level) / 3 + 1); |
… | |
… | |
1507 | /* get a random formula, weighted by its bookchance */ |
1447 | /* get a random formula, weighted by its bookchance */ |
1508 | chance = rndm (fl->total_chance); |
1448 | chance = rndm (fl->total_chance); |
1509 | for (formula = fl->items; formula; formula = formula->next) |
1449 | for (formula = fl->items; formula; formula = formula->next) |
1510 | { |
1450 | { |
1511 | chance -= formula->chance; |
1451 | chance -= formula->chance; |
|
|
1452 | |
1512 | if (chance <= 0) |
1453 | if (chance <= 0) |
1513 | break; |
1454 | break; |
1514 | } |
1455 | } |
1515 | |
1456 | |
1516 | if (!formula || formula->arch_names <= 0) |
1457 | if (!formula || formula->arch_names <= 0) |
1517 | { |
1458 | { |
1518 | book->msg = "<indecipherable text>\n"; |
1459 | book->msg = "<indecipherable text>\n"; |
1519 | new_text_name (book, 4); |
1460 | new_text_name (book, 4); |
1520 | add_author (book, 4); |
1461 | add_author (book, 4); |
1521 | |
1462 | return; |
1522 | } |
1463 | } |
|
|
1464 | |
|
|
1465 | /* looks like a formula was found. Base the amount |
|
|
1466 | * of information on the booklevel and the spellevel |
|
|
1467 | * of the formula. */ |
|
|
1468 | |
|
|
1469 | const char *op_name = formula->arch_name [rndm (formula->arch_names)]; |
|
|
1470 | archetype *at; |
|
|
1471 | |
|
|
1472 | /* preamble */ |
|
|
1473 | buf << "Herein is described a project using B<< " |
|
|
1474 | << (formula->skill ? &formula->skill : "an unknown skill") |
|
|
1475 | << " >>:\n\n"; |
|
|
1476 | |
|
|
1477 | if ((at = archetype::find (op_name))) |
|
|
1478 | op_name = at->object::name; |
1523 | else |
1479 | else |
|
|
1480 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
|
|
1481 | |
|
|
1482 | /* item name */ |
|
|
1483 | if (formula->title != shstr_NONE) |
|
|
1484 | { |
|
|
1485 | buf.printf ("The B<< %s of %s >>", op_name, &formula->title); |
|
|
1486 | /* This results in things like pile of philo. sulfur. |
|
|
1487 | * while philo. sulfur may look better, without this, |
|
|
1488 | * you get things like 'the wise' because its missing the |
|
|
1489 | * water of section. |
|
|
1490 | */ |
|
|
1491 | sprintf (title, "%s: %s of %s", |
|
|
1492 | formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); |
1524 | { |
1493 | } |
1525 | /* looks like a formula was found. Base the amount |
1494 | else |
1526 | * of information on the booklevel and the spellevel |
1495 | { |
1527 | * of the formula. */ |
1496 | buf << "The B<< " << op_name; |
1528 | |
1497 | |
1529 | const char *op_name = formula->arch_name [rndm (formula->arch_names)]; |
1498 | sprintf (title, "%s: %s", formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name); |
|
|
1499 | if (at->title) |
|
|
1500 | { |
|
|
1501 | buf << " " << at->title; |
|
|
1502 | strcat (title, " "); |
|
|
1503 | strcat (title, at->title); |
|
|
1504 | } |
|
|
1505 | |
|
|
1506 | buf << " >>"; |
|
|
1507 | } |
|
|
1508 | |
|
|
1509 | /* Lets name the book something meaningful ! */ |
|
|
1510 | book->name = title; |
|
|
1511 | book->title = NULL; |
|
|
1512 | |
|
|
1513 | /* ingredients to make it */ |
|
|
1514 | if (formula->ingred) |
|
|
1515 | { |
|
|
1516 | linked_char *next; |
1530 | archetype *at; |
1517 | archetype *at; |
1531 | |
1518 | |
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 [rndm (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 [rndm (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); |
1519 | at = archetype::find (formula->cauldron); |
1575 | |
1520 | |
1576 | sprintf (retbuf + strlen (retbuf), |
1521 | 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"); |
1522 | at ? query_name (at) : "an appropriate place"); |
1578 | |
1523 | |
1579 | for (next = formula->ingred; next != NULL; next = next->next) |
1524 | for (next = formula->ingred; next; next = next->next) |
1580 | { |
1525 | buf << next->name << '\r'; |
1581 | strcat (retbuf, next->name); |
1526 | } |
1582 | strcat (retbuf, "\n"); |
|
|
1583 | } |
|
|
1584 | } |
|
|
1585 | else |
1527 | else |
1586 | LOG (llevError, "formula_msg() no ingredient list for object %s of %s\n", op_name, &formula->title); |
1528 | 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 | |
1529 | |
1590 | book->msg = retbuf; |
1530 | book->msg = buf; |
1591 | } |
|
|
1592 | } |
1531 | } |
1593 | |
1532 | |
1594 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
1533 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
1595 | if(variable) { \ |
1534 | if(variable) { \ |
1596 | int i,j=0; \ |
1535 | int i,j=0; \ |
… | |
… | |
1607 | } |
1546 | } |
1608 | |
1547 | |
1609 | /* god_info_msg() - generate a message detailing the properties |
1548 | /* god_info_msg() - generate a message detailing the properties |
1610 | * of a random god. Used by the book hack. b.t. |
1549 | * of a random god. Used by the book hack. b.t. |
1611 | */ |
1550 | */ |
1612 | const char * |
1551 | static const char * |
1613 | god_info_msg (int level, int booksize) |
1552 | god_info_msg (int level) |
1614 | { |
1553 | { |
1615 | static char retbuf[BOOK_BUF]; |
|
|
1616 | const char *name = NULL; |
1554 | 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 ()); |
1555 | object *god = pntr_to_god_obj (get_rand_god ()); |
1621 | |
1556 | |
|
|
1557 | static dynbuf_text buf; buf.clear (); |
|
|
1558 | |
1622 | if (!god) |
1559 | if (!god) |
1623 | return (char *) NULL; /* oops, problems... */ |
1560 | return 0; /* oops, problems... */ |
|
|
1561 | |
1624 | name = god->name; |
1562 | name = god->name; |
1625 | |
1563 | |
1626 | /* preamble.. */ |
1564 | /* preamble.. */ |
1627 | sprintf (retbuf, "This document contains knowledge concerning\n"); |
1565 | buf << "This document contains knowledge concerning the diety B<< " |
1628 | sprintf (retbuf, "%sthe diety %s", retbuf, name); |
1566 | << name << " >>"; |
1629 | |
1567 | |
1630 | /* Always have as default information the god's descriptive terms. */ |
1568 | /* Always have as default information the god's descriptive terms. */ |
1631 | if (nstrtok (god->msg, ",") > 0) |
1569 | if (nstrtok (god->msg, ",") > 0) |
1632 | { |
1570 | buf << ", known as" << strtoktolin (god->msg, ","); |
1633 | strcat (retbuf, ", known as"); |
|
|
1634 | strcat (retbuf, strtoktolin (god->msg, ",")); |
|
|
1635 | } |
|
|
1636 | else |
1571 | else |
1637 | strcat (retbuf, "..."); |
1572 | buf << "..."; |
1638 | |
1573 | |
1639 | strcat (retbuf, "\n ---\n"); |
1574 | buf << "\n\n"; |
|
|
1575 | |
1640 | introlen = strlen (retbuf); /* so we will know if no new info is added later */ |
1576 | int introlen = buf.size (); /* so we will know if no new info is added later */ |
1641 | |
1577 | |
1642 | /* Information about the god is random, and based on the level of the |
1578 | /* Information about the god is random, and based on the level of the |
1643 | * 'book'. Probably there is a more intellegent way to implement |
1579 | * 'book'. Probably there is a more intellegent way to implement |
1644 | * this ... |
1580 | * this ... |
1645 | */ |
1581 | */ |
1646 | while (level > 0) |
1582 | while (level > 0 && buf.size () < BOOK_BUF) |
1647 | { |
1583 | { |
1648 | sprintf (buf, " "); |
|
|
1649 | if (level == 2 && rndm (2)) |
1584 | if (level == 2 && rndm (2)) |
1650 | { /* enemy god */ |
1585 | { /* enemy god */ |
1651 | const char *enemy = god->title; |
1586 | const char *enemy = god->title; |
1652 | |
1587 | |
1653 | if (enemy) |
1588 | if (enemy) |
1654 | sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); |
1589 | buf.printf ("The gods %s and %s are enemies.\r", name, enemy); |
1655 | } |
1590 | } |
1656 | |
1591 | |
1657 | if (level == 3 && rndm (2)) |
1592 | if (level == 3 && rndm (2)) |
1658 | { /* enemy race, what the god's holy word effects */ |
1593 | { /* enemy race, what the god's holy word effects */ |
1659 | const char *enemy = god->slaying; |
1594 | const char *enemy = god->slaying; |
|
|
1595 | int i; |
1660 | |
1596 | |
1661 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1597 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1662 | if ((i = nstrtok (enemy, ",")) > 0) |
1598 | if ((i = nstrtok (enemy, ",")) > 0) |
1663 | { |
1599 | { |
1664 | char tmpbuf[MAX_BUF]; |
1600 | char tmpbuf[MAX_BUF]; |
1665 | |
1601 | |
1666 | sprintf (buf, "The holy words of %s have the power to\n", name); |
1602 | buf << "The holy words of " << name |
1667 | strcat (buf, "slay creatures belonging to the "); |
1603 | << " have the power to slay creatures belonging to the "; |
|
|
1604 | |
1668 | if (i > 1) |
1605 | if (i > 1) |
1669 | sprintf (tmpbuf, "following \n races:%s", strtoktolin (enemy, ",")); |
1606 | buf << "following races:" << strtoktolin (enemy, ","); |
1670 | else |
1607 | else |
1671 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1608 | buf << "race of" << strtoktolin (enemy, ","); |
1672 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1609 | |
|
|
1610 | buf << '\r'; |
1673 | } |
1611 | } |
1674 | } |
1612 | } |
1675 | |
1613 | |
1676 | if (level == 4 && rndm (2)) |
1614 | if (level == 4 && rndm (2)) |
1677 | { /* Priest of god gets these protect,vulnerable... */ |
1615 | { /* Priest of god gets these protect,vulnerable... */ |
1678 | char tmpbuf[MAX_BUF]; |
|
|
1679 | |
|
|
1680 | if (const char *cp = describe_resistance (god, 1)) |
1616 | if (const char *cp = describe_resistance (god, 1)) |
1681 | { /* This god does have protections */ |
1617 | { /* This god does have protections */ |
1682 | sprintf (tmpbuf, "%s has a potent aura which is extended\n", name); |
1618 | buf << name |
|
|
1619 | << " has a potent aura which is extended to" |
1683 | strcat (tmpbuf, "faithful priests. The effects of this aura include:\n"); |
1620 | " faithful priests. The effects of this aura include: " |
1684 | strcat (tmpbuf, cp); |
1621 | << cp |
1685 | strcat (buf, tmpbuf); |
1622 | << ".\r"; |
1686 | strcat (buf, "\n ---\n"); |
|
|
1687 | } |
1623 | } |
1688 | else |
|
|
1689 | sprintf (buf, " "); |
|
|
1690 | } |
1624 | } |
1691 | |
1625 | |
1692 | if (level == 5 && rndm (2)) |
1626 | if (level == 5 && rndm (2)) |
1693 | { /* aligned race, summoning */ |
1627 | { /* aligned race, summoning */ |
1694 | const char *race = god->race; /* aligned race */ |
1628 | const char *race = god->race; /* aligned race */ |
|
|
1629 | int i; |
1695 | |
1630 | |
1696 | if (race && !(god->path_denied & PATH_SUMMON)) |
1631 | if (race && !(god->path_denied & PATH_SUMMON)) |
1697 | if ((i = nstrtok (race, ",")) > 0) |
1632 | if ((i = nstrtok (race, ",")) > 0) |
1698 | { |
1633 | { |
1699 | char tmpbuf[MAX_BUF]; |
1634 | buf << "Creatures sacred to " << name << " include the "; |
1700 | |
|
|
1701 | sprintf (buf, "Creatures sacred to %s include the \n", name); |
|
|
1702 | if (i > 1) |
1635 | if (i > 1) |
1703 | sprintf (tmpbuf, "following \n races:%s", strtoktolin (race, ",")); |
1636 | buf << "following races:" << strtoktolin (race, ","); |
1704 | else |
1637 | else |
1705 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1638 | buf << "race of" << strtoktolin (race, ","); |
1706 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1639 | |
|
|
1640 | buf << '\r'; |
1707 | } |
1641 | } |
1708 | } |
1642 | } |
1709 | |
1643 | |
1710 | if (level == 6 && rndm (2)) |
1644 | if (level == 6 && rndm (2)) |
1711 | { /* blessing,curse properties of the god */ |
1645 | { /* blessing,curse properties of the god */ |
1712 | char tmpbuf[MAX_BUF]; |
|
|
1713 | |
|
|
1714 | if (const char *cp = describe_resistance (god, 1)) |
1646 | if (const char *cp = describe_resistance (god, 1)) |
1715 | { /* This god does have protections */ |
1647 | { /* This god does have protections */ |
1716 | sprintf (tmpbuf, "\nThe priests of %s are known to be able to \n", name); |
1648 | buf << "The priests of " << name |
|
|
1649 | << " are known to be able to " |
1717 | strcat (tmpbuf, "bestow a blessing which makes the recipient\n"); |
1650 | "bestow a blessing which makes the recipient " |
1718 | strcat (tmpbuf, cp); |
1651 | << cp |
1719 | strcat (buf, tmpbuf); |
1652 | << '\r'; |
1720 | strcat (buf, "\n ---\n"); |
|
|
1721 | } |
1653 | } |
1722 | else |
|
|
1723 | sprintf (buf, " "); |
|
|
1724 | |
|
|
1725 | } |
1654 | } |
1726 | |
1655 | |
1727 | if (level == 8 && rndm (2)) |
1656 | if (level == 8 && rndm (2)) |
1728 | { /* immunity, holy possession */ |
1657 | { /* immunity, holy possession */ |
1729 | int has_effect = 0, tmpvar; |
1658 | buf << "The priests of " << name |
1730 | char tmpbuf[MAX_BUF]; |
1659 | << " are known to make cast a mighty" |
|
|
1660 | " prayer of possession"; |
|
|
1661 | |
|
|
1662 | int first = 1; |
1731 | |
1663 | |
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++) |
1664 | for (int i = 0; i < NROFATTACKS; i++) |
|
|
1665 | if (god->resist[i] == 100) |
1738 | { |
1666 | { |
1739 | if (god->resist[tmpvar] == 100) |
1667 | if (first) |
1740 | { |
1668 | { |
|
|
1669 | buf << " which gives the recipient"; |
1741 | has_effect = 1; |
1670 | first = 0; |
1742 | sprintf (tmpbuf + strlen (tmpbuf), "Immunity to %s", attacktype_desc[tmpvar]); |
|
|
1743 | } |
1671 | } |
|
|
1672 | else |
|
|
1673 | buf << ", "; |
|
|
1674 | |
|
|
1675 | buf << " immunity to " << attacktype_desc[i]; |
1744 | } |
1676 | } |
1745 | |
1677 | |
1746 | if (has_effect) |
1678 | buf << ".\r"; |
1747 | { |
|
|
1748 | strcat (buf, tmpbuf); |
|
|
1749 | strcat (buf, "\n ---\n"); |
|
|
1750 | } |
|
|
1751 | else |
|
|
1752 | sprintf (buf, " "); |
|
|
1753 | } |
1679 | } |
1754 | |
1680 | |
1755 | if (level == 12 && rndm (2)) |
1681 | if (level == 12 && rndm (2)) |
1756 | { /* spell paths */ |
1682 | { /* spell paths */ |
|
|
1683 | //TODO: |
1757 | int has_effect = 0, tmpvar; |
1684 | int has_effect = 0, tmpvar; |
1758 | char tmpbuf[MAX_BUF]; |
1685 | char tmpbuf[MAX_BUF]; |
1759 | |
1686 | |
1760 | sprintf (tmpbuf, "\n"); |
1687 | sprintf (tmpbuf, "\n"); |
1761 | sprintf (tmpbuf, "It is rarely known fact that the priests of %s\n", name); |
1688 | sprintf (tmpbuf, "It is rarely known fact that the priests of %s\n", name); |
… | |
… | |
1778 | has_effect = 1; |
1705 | has_effect = 1; |
1779 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1706 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1780 | } |
1707 | } |
1781 | |
1708 | |
1782 | if (has_effect) |
1709 | if (has_effect) |
1783 | { |
1710 | buf << tmpbuf << '\r'; |
1784 | strcat (buf, tmpbuf); |
|
|
1785 | strcat (buf, "\n ---\n"); |
|
|
1786 | } |
|
|
1787 | else |
1711 | else |
1788 | sprintf (buf, " "); |
1712 | buf << '\r'; |
1789 | } |
1713 | } |
1790 | |
1714 | |
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--; |
1715 | level--; |
1801 | } |
1716 | } |
1802 | |
1717 | |
1803 | if (strlen (retbuf) == introlen) |
1718 | if (buf.size () == introlen) |
1804 | { /* we got no information beyond the preamble! */ |
1719 | /* we got no information beyond the preamble! */ |
1805 | strcat (retbuf, " [Unfortunately the rest of the information is\n"); |
1720 | buf << "[Unfortunately the rest of the information is hopelessly garbled!]"; |
1806 | strcat (retbuf, " hopelessly garbled!]\n ---\n"); |
1721 | |
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; |
1722 | return buf; |
1813 | } |
1723 | } |
1814 | |
1724 | |
1815 | /* tailor_readable_ob()- The main routine. This chooses a random |
1725 | /* tailor_readable_ob()- The main routine. This chooses a random |
1816 | * message to put in given readable object (type==BOOK) which will |
1726 | * 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- |
1727 | * be referred hereafter as a 'book'. We use the book level to de- |
… | |
… | |
1829 | * |
1739 | * |
1830 | */ |
1740 | */ |
1831 | void |
1741 | void |
1832 | tailor_readable_ob (object *book, int msg_type) |
1742 | tailor_readable_ob (object *book, int msg_type) |
1833 | { |
1743 | { |
1834 | char msgbuf[BOOK_BUF]; |
|
|
1835 | int level = book->level ? rndm (book->level) + 1 : 1; |
1744 | int level = book->level ? rndm (book->level) + 1 : 1; |
1836 | int book_buf_size; |
|
|
1837 | |
1745 | |
1838 | /* safety */ |
1746 | /* safety */ |
1839 | if (book->type != BOOK) |
1747 | if (book->type != BOOK) |
1840 | return; |
1748 | return; |
1841 | |
1749 | |
1842 | if (level <= 0) |
1750 | if (level <= 0) |
1843 | return; /* if no level no point in doing any more... */ |
1751 | 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 | |
1752 | |
1848 | /* &&& The message switch &&& */ |
1753 | /* &&& The message switch &&& */ |
1849 | /* Below all of the possible types of messages in the "book"s. |
1754 | /* Below all of the possible types of messages in the "book"s. |
1850 | */ |
1755 | */ |
1851 | /* |
1756 | /* |
… | |
… | |
1854 | * 2) make sure there is an entry in max_titles[] array. |
1759 | * 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() |
1760 | * 3) make sure there are entries for your case in new_text_title() |
1856 | * and add_authour(). |
1761 | * and add_authour(). |
1857 | * 4) you may want separate authour/book name arrays in read.h |
1762 | * 4) you may want separate authour/book name arrays in read.h |
1858 | */ |
1763 | */ |
|
|
1764 | const char *new_msg = ""; |
1859 | msg_type = msg_type > 0 ? msg_type : rndm (8); |
1765 | msg_type = msg_type > 0 ? msg_type : rndm (8); |
1860 | switch (msg_type) |
1766 | switch (msg_type) |
1861 | { |
1767 | { |
1862 | case 1: /* monster attrib */ |
1768 | case 1: /* monster attrib */ |
1863 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1769 | new_msg = mon_info_msg (level); |
1864 | break; |
1770 | break; |
1865 | case 2: /* artifact attrib */ |
1771 | case 2: /* artifact attrib */ |
1866 | strcpy (msgbuf, artifact_msg (level, book_buf_size)); |
1772 | new_msg = artifact_msg (level); |
1867 | break; |
1773 | break; |
1868 | case 3: /* grouping incantations/prayers by path */ |
1774 | case 3: /* grouping incantations/prayers by path */ |
1869 | strcpy (msgbuf, spellpath_msg (level, book_buf_size)); |
1775 | new_msg = spellpath_msg (level); |
1870 | break; |
1776 | break; |
1871 | case 4: /* describe an alchemy formula */ |
1777 | case 4: /* describe an alchemy formula */ |
1872 | make_formula_book (book, level); |
1778 | make_formula_book (book, level); |
1873 | /* make_formula_book already gives title */ |
1779 | /* make_formula_book already gives title */ |
1874 | return; |
1780 | return; |
1875 | break; |
|
|
1876 | case 5: /* bits of information about a god */ |
1781 | case 5: /* bits of information about a god */ |
1877 | strcpy (msgbuf, god_info_msg (level, book_buf_size)); |
1782 | new_msg = god_info_msg (level); |
1878 | break; |
1783 | break; |
1879 | case 0: /* use info list in lib/ */ |
1784 | case 0: /* use info list in lib/ */ |
1880 | default: |
1785 | default: |
1881 | cfperl_make_book (book, level); |
1786 | cfperl_make_book (book, level); |
|
|
1787 | /* already gives title */ |
1882 | return; |
1788 | return; |
1883 | } |
1789 | } |
1884 | |
1790 | |
1885 | strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */ |
|
|
1886 | |
|
|
1887 | if (strlen (msgbuf) > 1) |
1791 | if (strlen (new_msg) > 1) |
1888 | { |
1792 | { |
1889 | book->msg = msgbuf; |
1793 | book->msg = new_msg; |
1890 | /* lets give the "book" a new name, which may be a compound word */ |
1794 | /* lets give the "book" a new name, which may be a compound word */ |
1891 | change_book (book, msg_type); |
1795 | change_book (book, msg_type); |
1892 | } |
1796 | } |
1893 | } |
1797 | } |
1894 | |
|
|
1895 | |
|
|
1896 | /***************************************************************************** |
|
|
1897 | * |
|
|
1898 | * Cleanup routine for readble stuff. |
|
|
1899 | * |
|
|
1900 | *****************************************************************************/ |
|
|
1901 | |
|
|
1902 | void |
|
|
1903 | free_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 | |
1798 | |
1939 | /***************************************************************************** |
1799 | /***************************************************************************** |
1940 | * |
1800 | * |
1941 | * Writeback routine for updating the bookarchive. |
1801 | * Writeback routine for updating the bookarchive. |
1942 | * |
1802 | * |
1943 | ****************************************************************************/ |
1803 | ****************************************************************************/ |
1944 | |
|
|
1945 | /* write_book_archive() - write out the updated book archive */ |
1804 | /* write_book_archive() - write out the updated book archive */ |
1946 | |
|
|
1947 | void |
1805 | void |
1948 | write_book_archive (void) |
1806 | write_book_archive () |
1949 | { |
1807 | { |
1950 | FILE *fp; |
1808 | FILE *fp; |
1951 | int index = 0; |
1809 | int index = 0; |
1952 | char fname[MAX_BUF]; |
1810 | char fname[MAX_BUF]; |
1953 | title *book = NULL; |
1811 | title *book = NULL; |
1954 | titlelist *bl = get_titlelist (0); |
1812 | titlelist *bl = get_titlelist (0); |
1955 | |
1813 | |
1956 | /* If nothing changed, don't write anything */ |
1814 | /* If nothing changed, don't write anything */ |
1957 | if (!need_to_write_bookarchive) |
1815 | if (!need_to_write_bookarchive) |
1958 | return; |
1816 | return; |
|
|
1817 | |
1959 | need_to_write_bookarchive = 0; |
1818 | need_to_write_bookarchive = 0; |
1960 | |
1819 | |
1961 | sprintf (fname, "%s/bookarch", settings.localdir); |
1820 | sprintf (fname, "%s/bookarch", settings.localdir); |
1962 | LOG (llevDebug, "Updating book archive: %s...\n", fname); |
1821 | LOG (llevDebug, "Updating book archive: %s...\n", fname); |
1963 | |
1822 | |
1964 | if ((fp = fopen (fname, "w")) == NULL) |
1823 | if ((fp = fopen (fname, "w")) == NULL) |
1965 | { |
|
|
1966 | LOG (llevDebug, "Can't open book archive file %s\n", fname); |
1824 | LOG (llevDebug, "Can't open book archive file %s\n", fname); |
1967 | } |
|
|
1968 | else |
1825 | else |
1969 | { |
1826 | { |
1970 | while (bl) |
1827 | while (bl) |
1971 | { |
1828 | { |
1972 | for (book = bl->first_book; book; book = book->next) |
1829 | for (book = bl->first_book; book; book = book->next) |
… | |
… | |
1979 | fprintf (fp, "type %d\n", index); |
1836 | fprintf (fp, "type %d\n", index); |
1980 | fprintf (fp, "size %d\n", book->size); |
1837 | fprintf (fp, "size %d\n", book->size); |
1981 | fprintf (fp, "index %d\n", book->msg_index); |
1838 | fprintf (fp, "index %d\n", book->msg_index); |
1982 | fprintf (fp, "end\n"); |
1839 | fprintf (fp, "end\n"); |
1983 | } |
1840 | } |
|
|
1841 | |
1984 | bl = bl->next; |
1842 | bl = bl->next; |
1985 | index++; |
1843 | index++; |
1986 | } |
1844 | } |
|
|
1845 | |
1987 | fclose (fp); |
1846 | fclose (fp); |
1988 | chmod (fname, SAVE_MODE); |
1847 | chmod (fname, SAVE_MODE); |
1989 | } |
1848 | } |
1990 | } |
1849 | } |
|
|
1850 | |
1991 | readable_message_type * |
1851 | readable_message_type * |
1992 | get_readable_message_type (object *readable) |
1852 | get_readable_message_type (object *readable) |
1993 | { |
1853 | { |
1994 | uint8 subtype = readable->subtype; |
1854 | uint8 subtype = readable->subtype; |
1995 | |
1855 | |