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,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * 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 it under |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * any later version. |
11 | * 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 Affero GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * 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> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /* This file contains code relevant to the BOOKS hack -- designed |
25 | /* This file contains code relevant to the BOOKS hack -- designed |
26 | * to allow randomly occuring messages in non-magical texts. |
26 | * to allow randomly occuring messages in non-magical texts. |
27 | */ |
27 | */ |
… | |
… | |
30 | |
30 | |
31 | #include <global.h> |
31 | #include <global.h> |
32 | #include <book.h> |
32 | #include <book.h> |
33 | #include <living.h> |
33 | #include <living.h> |
34 | #include <spells.h> |
34 | #include <spells.h> |
35 | |
|
|
36 | |
35 | |
37 | /* Define this if you want to archive book titles by contents. |
36 | /* Define this if you want to archive book titles by contents. |
38 | * This option should enforce UNIQUE combinations of titles,authors and |
37 | * This option should enforce UNIQUE combinations of titles,authors and |
39 | * msg contents during and *between* game sessions. |
38 | * msg contents during and *between* game sessions. |
40 | * 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 |
… | |
… | |
109 | /* these are needed for creation of a linked list of |
108 | /* these are needed for creation of a linked list of |
110 | * pointers to all (hostile) monster objects */ |
109 | * pointers to all (hostile) monster objects */ |
111 | |
110 | |
112 | static int nrofmon = 0, need_to_write_bookarchive = 0; |
111 | static int nrofmon = 0, need_to_write_bookarchive = 0; |
113 | |
112 | |
114 | |
|
|
115 | /* this is needed to keep track of status of initialisation |
|
|
116 | * of the message file */ |
|
|
117 | static int nrofmsg = 0; |
|
|
118 | |
|
|
119 | /* first_msg is the started of the linked list of messages as read from |
|
|
120 | * the messages file |
|
|
121 | */ |
|
|
122 | static linked_char *first_msg = NULL; |
|
|
123 | |
|
|
124 | /* |
113 | /* |
125 | * Spellpath information |
114 | * Spellpath information |
126 | */ |
115 | */ |
127 | |
|
|
128 | static uint32 spellpathdef[NRSPELLPATHS] = { |
116 | static uint32 spellpathdef[NRSPELLPATHS] = { |
129 | PATH_PROT, |
117 | PATH_PROT, |
130 | PATH_FIRE, |
118 | PATH_FIRE, |
131 | PATH_FROST, |
119 | PATH_FROST, |
132 | PATH_ELEC, |
120 | PATH_ELEC, |
… | |
… | |
498 | /*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"}, |
499 | {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"}, |
500 | {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"}, |
501 | {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"} |
502 | }; |
490 | }; |
503 | 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); |
504 | |
492 | |
505 | static int max_titles[6] = { |
493 | static int max_titles[6] = { |
506 | ((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 *)), |
507 | (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)), |
495 | (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)), |
508 | (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)), |
496 | (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)), |
… | |
… | |
570 | * (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. */ |
571 | |
559 | |
572 | /* nstrtok() - simple routine to return the number of list |
560 | /* nstrtok() - simple routine to return the number of list |
573 | * items in buf1 as separated by the value of buf2 |
561 | * items in buf1 as separated by the value of buf2 |
574 | */ |
562 | */ |
575 | |
563 | static int |
576 | int |
|
|
577 | nstrtok (const char *buf1, const char *buf2) |
564 | nstrtok (const char *buf1, const char *buf2) |
578 | { |
565 | { |
579 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
566 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
580 | int number = 0; |
567 | int number = 0; |
581 | |
568 | |
… | |
… | |
594 | |
581 | |
595 | /* strtoktolin() - takes a string in buf1 and separates it into |
582 | /* strtoktolin() - takes a string in buf1 and separates it into |
596 | * a list of strings delimited by buf2. Then returns a comma |
583 | * a list of strings delimited by buf2. Then returns a comma |
597 | * separated string w/ decent punctuation. |
584 | * separated string w/ decent punctuation. |
598 | */ |
585 | */ |
599 | |
586 | static char * |
600 | char * |
|
|
601 | strtoktolin (const char *buf1, const char *buf2) |
587 | strtoktolin (const char *buf1, const char *buf2) |
602 | { |
588 | { |
603 | int maxi, i = nstrtok (buf1, buf2); |
589 | int maxi, i = nstrtok (buf1, buf2); |
604 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
590 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
605 | static char rbuf[BOOK_BUF]; |
591 | static char rbuf[BOOK_BUF]; |
… | |
… | |
620 | else |
606 | else |
621 | strcat (rbuf, "."); |
607 | strcat (rbuf, "."); |
622 | tbuf = strtok (NULL, sbuf); |
608 | tbuf = strtok (NULL, sbuf); |
623 | } |
609 | } |
624 | return (char *) rbuf; |
610 | return (char *) rbuf; |
625 | } |
|
|
626 | |
|
|
627 | int |
|
|
628 | book_overflow (const char *buf1, const char *buf2, int booksize) |
|
|
629 | { |
|
|
630 | |
|
|
631 | if (buf_overflow (buf1, buf2, BOOK_BUF - 2) /* 2 less so always room for trailing \n */ |
|
|
632 | || buf_overflow (buf1, buf2, booksize)) |
|
|
633 | return 1; |
|
|
634 | return 0; |
|
|
635 | |
|
|
636 | |
|
|
637 | } |
611 | } |
638 | |
612 | |
639 | /***************************************************************************** |
613 | /***************************************************************************** |
640 | * |
614 | * |
641 | * Start of initialisation related functions. |
615 | * Start of initialisation related functions. |
… | |
… | |
736 | } |
710 | } |
737 | |
711 | |
738 | /* init_mon_info() - creates the linked list of pointers to |
712 | /* init_mon_info() - creates the linked list of pointers to |
739 | * monster archetype objects if not called previously |
713 | * monster archetype objects if not called previously |
740 | */ |
714 | */ |
741 | |
|
|
742 | static void |
715 | static void |
743 | init_mon_info (void) |
716 | init_mon_info () |
744 | { |
717 | { |
745 | archetype *at; |
718 | archetype *at; |
746 | static int did_init_mon_info = 0; |
719 | static int did_init_mon_info = 0; |
747 | |
720 | |
748 | if (did_init_mon_info) |
721 | if (did_init_mon_info) |
749 | return; |
722 | return; |
750 | |
723 | |
751 | did_init_mon_info = 1; |
724 | did_init_mon_info = 1; |
752 | |
725 | |
753 | for_all_archetypes (at) |
726 | for_all_archetypes (at) |
754 | { |
727 | if (at->flag [FLAG_MONSTER] |
755 | 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])) |
756 | { |
730 | { |
757 | objectlink *mon = new objectlink; |
731 | objectlink *mon = new objectlink; |
758 | |
732 | |
759 | mon->ob = at; |
733 | mon->ob = at; |
760 | mon->next = first_mon_info; |
734 | mon->next = first_mon_info; |
761 | first_mon_info = mon; |
735 | first_mon_info = mon; |
762 | nrofmon++; |
736 | nrofmon++; |
763 | } |
737 | } |
764 | } |
|
|
765 | |
738 | |
766 | LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); |
739 | LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); |
767 | } |
740 | } |
768 | |
741 | |
769 | /* init_readable() - initialise linked lists utilized by |
742 | /* init_readable() - initialise linked lists utilized by |
… | |
… | |
818 | else |
791 | else |
819 | t = t->next; |
792 | t = t->next; |
820 | |
793 | |
821 | #ifdef ARCHIVE_DEBUG |
794 | #ifdef ARCHIVE_DEBUG |
822 | if (t) |
795 | if (t) |
823 | 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); |
824 | #endif |
797 | #endif |
825 | |
798 | |
826 | return t; |
799 | return t; |
827 | } |
800 | } |
828 | |
801 | |
… | |
… | |
830 | * handled directly in change_book_name(). Names are based on text |
803 | * handled directly in change_book_name(). Names are based on text |
831 | * msgtype |
804 | * msgtype |
832 | * this sets book book->name based on msgtype given. What name |
805 | * this sets book book->name based on msgtype given. What name |
833 | * is given is based on various criteria |
806 | * is given is based on various criteria |
834 | */ |
807 | */ |
835 | |
|
|
836 | static void |
808 | static void |
837 | new_text_name (object *book, int msgtype) |
809 | new_text_name (object *book, int msgtype) |
838 | { |
810 | { |
839 | int nbr; |
811 | int nbr; |
840 | char name[MAX_BUF]; |
812 | char name[MAX_BUF]; |
… | |
… | |
933 | */ |
905 | */ |
934 | |
906 | |
935 | static int |
907 | static int |
936 | unique_book (const object *book, int msgtype) |
908 | unique_book (const object *book, int msgtype) |
937 | { |
909 | { |
938 | title *test; |
|
|
939 | |
|
|
940 | if (!booklist) |
910 | if (!booklist) |
941 | return 1; /* No archival entries! Must be unique! */ |
911 | return 1; /* No archival entries! Must be unique! */ |
942 | |
912 | |
943 | /* Go through the booklist. If the author and name match, not unique so |
913 | /* Go through the booklist. If the author and name match, not unique so |
944 | * return 0. |
914 | * return 0. |
945 | */ |
915 | */ |
946 | for (test = get_titlelist (msgtype)->first_book; test; test = test->next) |
916 | for (title *test = get_titlelist (msgtype)->first_book; test; test = test->next) |
947 | { |
|
|
948 | if (!strcmp (test->name, book->name) && !strcmp (book->title, test->authour)) |
917 | if (test->name == book->name && book->title == test->authour) |
949 | return 0; |
918 | return 0; |
950 | } |
919 | |
951 | return 1; |
920 | return 1; |
952 | } |
921 | } |
953 | |
922 | |
954 | /* add_book_to_list() */ |
923 | /* add_book_to_list() */ |
955 | |
924 | |
… | |
… | |
979 | |
948 | |
980 | /* We have stuff we need to write now */ |
949 | /* We have stuff we need to write now */ |
981 | need_to_write_bookarchive = 1; |
950 | need_to_write_bookarchive = 1; |
982 | |
951 | |
983 | #ifdef ARCHIVE_DEBUG |
952 | #ifdef ARCHIVE_DEBUG |
984 | 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); |
985 | #endif |
954 | #endif |
986 | |
955 | |
987 | } |
956 | } |
988 | |
957 | |
989 | |
958 | |
… | |
… | |
995 | * levels and architypes. -b.t. |
964 | * levels and architypes. -b.t. |
996 | */ |
965 | */ |
997 | |
966 | |
998 | #define MAX_TITLE_CHECK 20 |
967 | #define MAX_TITLE_CHECK 20 |
999 | |
968 | |
1000 | void |
969 | static void |
1001 | change_book (object *book, int msgtype) |
970 | change_book (object *book, int msgtype) |
1002 | { |
971 | { |
1003 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
972 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1004 | |
973 | |
1005 | switch (book->type) |
974 | switch (book->type) |
1006 | { |
975 | { |
1007 | case BOOK: |
976 | case BOOK: |
1008 | { |
977 | { |
1009 | titlelist *tl = get_titlelist (msgtype); |
978 | titlelist *tl = get_titlelist (msgtype); |
1010 | title *t = NULL; |
979 | title *t = NULL; |
1011 | int tries = 0; |
980 | int tries = 0; |
1012 | |
981 | |
1013 | /* look to see if our msg already been archived. If so, alter |
982 | /* 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, |
983 | * 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 |
984 | * then we archive the new title/name/msg combo if there is |
1016 | * room on the titlelist. |
985 | * room on the titlelist. |
1017 | */ |
986 | */ |
1018 | |
987 | |
1019 | if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) |
988 | if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) |
1020 | { |
989 | { |
1021 | object *tmpbook; |
|
|
1022 | |
|
|
1023 | /* alter book properties */ |
990 | /* alter book properties */ |
1024 | if ((tmpbook = get_archetype (t->archname)) != NULL) |
991 | if (object *tmpbook = get_archetype (t->archname)) |
|
|
992 | { |
|
|
993 | tmpbook->msg = book->msg; |
|
|
994 | tmpbook->copy_to (book); |
|
|
995 | tmpbook->destroy (); |
|
|
996 | } |
|
|
997 | |
|
|
998 | book->title = t->authour; |
|
|
999 | book->name = t->name; |
|
|
1000 | book->level = t->level; |
|
|
1001 | } |
|
|
1002 | /* Don't have any default title, so lets make up a new one */ |
|
|
1003 | else |
|
|
1004 | { |
|
|
1005 | int numb, maxnames = max_titles[msgtype]; |
|
|
1006 | const char *old_title; |
|
|
1007 | const char *old_name; |
|
|
1008 | |
|
|
1009 | old_title = book->title; |
|
|
1010 | old_name = book->name; |
|
|
1011 | |
|
|
1012 | /* some pre-generated books have title already set (from |
|
|
1013 | * maps), also don't bother looking for unique title if |
|
|
1014 | * we already used up all the available names! */ |
|
|
1015 | |
|
|
1016 | if (!tl) |
|
|
1017 | { |
|
|
1018 | LOG (llevError, "change_book_name(): can't find title list\n"); |
|
|
1019 | numb = 0; |
|
|
1020 | } |
|
|
1021 | else |
|
|
1022 | numb = tl->number; |
|
|
1023 | |
|
|
1024 | if (numb == maxnames) |
|
|
1025 | { |
|
|
1026 | #ifdef ARCHIVE_DEBUG |
|
|
1027 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
|
|
1028 | #endif |
|
|
1029 | } |
|
|
1030 | /* shouldnt change map-maker books */ |
|
|
1031 | else if (!book->title) |
|
|
1032 | do |
1025 | { |
1033 | { |
1026 | tmpbook->msg = book->msg; |
1034 | /* random book name */ |
1027 | tmpbook->copy_to (book); |
1035 | new_text_name (book, msgtype); |
1028 | tmpbook->destroy (); |
1036 | add_author (book, msgtype); /* random author */ |
|
|
1037 | tries++; |
1029 | } |
1038 | } |
|
|
1039 | while (!unique_book (book, msgtype) && tries < MAX_TITLE_CHECK); |
1030 | |
1040 | |
1031 | book->title = t->authour; |
1041 | /* Now deal with 2 cases. |
1032 | book->name = t->name; |
1042 | * 1)If no space for a new title exists lets just restore |
1033 | book->level = t->level; |
1043 | * the old book properties. Remember, if the book had |
|
|
1044 | * matchd an older entry on the titlelist, we shouldnt |
|
|
1045 | * have called this routine in the first place! |
|
|
1046 | * 2) If we got a unique title, we need to add it to |
|
|
1047 | * the list. |
1034 | } |
1048 | */ |
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 | |
1049 | |
1042 | old_title = book->title; |
1050 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1043 | old_name = book->name; |
1051 | { /* 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 |
1052 | #ifdef ARCHIVE_DEBUG |
1060 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
1053 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", &book->name, &book->title, numb, maxnames); |
1061 | #endif |
1054 | #endif |
1062 | break; |
1055 | /* restore old book properties here */ |
1063 | } |
1056 | book->title = old_title; |
1064 | /* shouldnt change map-maker books */ |
1057 | |
1065 | else if (!book->title) |
1058 | if (rndm (4)) |
1066 | do |
|
|
1067 | { |
1059 | { |
1068 | /* random book name */ |
1060 | /* Lets give the book a description to individualize it some */ |
1069 | new_text_name (book, msgtype); |
1061 | char new_name[MAX_BUF]; |
1070 | add_author (book, msgtype); /* random author */ |
1062 | |
1071 | tries++; |
1063 | snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name); |
|
|
1064 | |
|
|
1065 | book->name = new_name; |
1072 | } |
1066 | } |
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 |
1067 | else |
1102 | { |
1068 | { |
1103 | book->name = old_name; |
1069 | book->name = old_name; |
1104 | } |
1070 | } |
1105 | } |
1071 | } |
1106 | else if (book->title && strlen (book->msg) > 5) |
1072 | else if (book->title && strlen (book->msg) > 5) |
1107 | { /* archive if long msg texts */ |
1073 | { /* archive if long msg texts */ |
1108 | add_book_to_list (book, msgtype); |
1074 | add_book_to_list (book, msgtype); |
1109 | } |
1075 | } |
1110 | } |
1076 | } |
1111 | break; |
1077 | break; |
1112 | } |
1078 | } |
1113 | |
1079 | |
1114 | default: |
1080 | default: |
1115 | LOG (llevError, "change_book_name() called w/ illegal obj type.\n"); |
1081 | LOG (llevError, "change_book_name() called w/ illegal obj type.\n"); |
1116 | return; |
1082 | return; |
1117 | } |
1083 | } |
1118 | } |
1084 | } |
1119 | |
1085 | |
1120 | /***************************************************************************** |
1086 | /***************************************************************************** |
1121 | * |
1087 | * |
… | |
… | |
1132 | * 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, |
1133 | * then only monsters greater than that level will be returned. |
1099 | * then only monsters greater than that level will be returned. |
1134 | * Changed 971225 to be greater than equal to level passed. Also |
1100 | * Changed 971225 to be greater than equal to level passed. Also |
1135 | * made choosing by level more random. |
1101 | * made choosing by level more random. |
1136 | */ |
1102 | */ |
1137 | |
|
|
1138 | object * |
1103 | object * |
1139 | get_random_mon (int level) |
1104 | get_random_mon (int level) |
1140 | { |
1105 | { |
1141 | objectlink *mon = first_mon_info; |
1106 | objectlink *mon = first_mon_info; |
1142 | int i = 0, monnr; |
1107 | int i = 0, monnr; |
… | |
… | |
1146 | return (object *) NULL; |
1111 | return (object *) NULL; |
1147 | |
1112 | |
1148 | if (!level) |
1113 | if (!level) |
1149 | { |
1114 | { |
1150 | /* lets get a random monster from the mon_info linked list */ |
1115 | /* lets get a random monster from the mon_info linked list */ |
1151 | monnr = RANDOM () % nrofmon; |
1116 | monnr = rndm (nrofmon); |
1152 | |
1117 | |
1153 | for (mon = first_mon_info, i = 0; mon; mon = mon->next) |
1118 | for (mon = first_mon_info, i = 0; mon; mon = mon->next) |
1154 | if (i++ == monnr) |
1119 | if (i++ == monnr) |
1155 | break; |
1120 | break; |
1156 | |
1121 | |
… | |
… | |
1183 | { |
1148 | { |
1184 | LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level); |
1149 | LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level); |
1185 | return NULL; |
1150 | return NULL; |
1186 | } |
1151 | } |
1187 | |
1152 | |
1188 | monnr = RANDOM () % i; |
1153 | monnr = rndm (i); |
1189 | for (mon = first_mon_info; mon; mon = mon->next) |
1154 | for (mon = first_mon_info; mon; mon = mon->next) |
1190 | if (mon->ob->level >= level && monnr-- == 0) |
1155 | if (mon->ob->level >= level && monnr-- == 0) |
1191 | return mon->ob; |
1156 | return mon->ob; |
1192 | |
1157 | |
1193 | if (!mon) |
1158 | if (!mon) |
… | |
… | |
1200 | |
1165 | |
1201 | /* |
1166 | /* |
1202 | * Returns a description of the monster. This really needs to be |
1167 | * Returns a description of the monster. This really needs to be |
1203 | * redone, as describe_item really gives a pretty internal description. |
1168 | * redone, as describe_item really gives a pretty internal description. |
1204 | */ |
1169 | */ |
1205 | |
1170 | static const char * |
1206 | char * |
|
|
1207 | mon_desc (const object *mon) |
1171 | mon_desc (const object *mon) |
1208 | { |
1172 | { |
1209 | static char retbuf[HUGE_BUF]; |
1173 | static dynbuf_text buf; buf.clear (); |
1210 | |
1174 | |
1211 | sprintf (retbuf, " *** %s ***\n", &mon->name); |
1175 | buf.printf ("B<< %s >>\r", &mon->name); |
1212 | strcat (retbuf, describe_item (mon, NULL)); |
1176 | buf << describe_item (mon, 0); |
1213 | |
1177 | |
1214 | return retbuf; |
1178 | return buf; |
1215 | } |
1179 | } |
1216 | |
1180 | |
1217 | |
1181 | |
1218 | /* 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 |
1219 | * 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 |
1220 | * calling function (mon_info_msg) seems to expect that. |
1184 | * calling function (mon_info_msg) seems to expect that. |
1221 | */ |
1185 | */ |
1222 | |
1186 | static object * |
1223 | object * |
|
|
1224 | get_next_mon (object *tmp) |
1187 | get_next_mon (object *tmp) |
1225 | { |
1188 | { |
1226 | objectlink *mon; |
1189 | objectlink *mon; |
1227 | |
1190 | |
1228 | for (mon = first_mon_info; mon; mon = mon->next) |
1191 | for (mon = first_mon_info; mon; mon = mon->next) |
… | |
… | |
1230 | break; |
1193 | break; |
1231 | |
1194 | |
1232 | /* didn't find a match */ |
1195 | /* didn't find a match */ |
1233 | if (!mon) |
1196 | if (!mon) |
1234 | return NULL; |
1197 | return NULL; |
|
|
1198 | |
1235 | if (mon->next) |
1199 | if (mon->next) |
1236 | return mon->next->ob; |
1200 | return mon->next->ob; |
1237 | else |
1201 | else |
1238 | return first_mon_info->ob; |
1202 | return first_mon_info->ob; |
1239 | |
1203 | |
1240 | } |
1204 | } |
1241 | |
1205 | |
1242 | |
|
|
1243 | |
|
|
1244 | /* mon_info_msg() - generate a message detailing the properties |
1206 | /* mon_info_msg() - generate a message detailing the properties |
1245 | * of a randomly selected monster. |
1207 | * of a randomly selected monster. |
1246 | */ |
1208 | */ |
1247 | |
1209 | static const char * |
1248 | char * |
|
|
1249 | mon_info_msg (int level, int booksize) |
1210 | mon_info_msg (int level) |
1250 | { |
1211 | { |
1251 | static char retbuf[BOOK_BUF]; |
1212 | static dynbuf_text buf; buf.clear (); |
1252 | char tmpbuf[HUGE_BUF]; |
|
|
1253 | object *tmp; |
|
|
1254 | |
1213 | |
1255 | /*preamble */ |
1214 | /*preamble */ |
1256 | strcpy (retbuf, "This beastiary contains:"); |
1215 | buf << "This beastiary contains:\n"; |
1257 | |
1216 | |
1258 | /* 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 |
1259 | * document. |
1218 | * document. |
1260 | * 8-96 Had to change this a bit, otherwise there would |
1219 | * 8-96 Had to change this a bit, otherwise there would |
1261 | * have been an impossibly large number of combinations |
1220 | * have been an impossibly large number of combinations |
1262 | * of text! (and flood out the available number of titles |
1221 | * of text! (and flood out the available number of titles |
1263 | * in the archive in a snap!) -b.t. |
1222 | * in the archive in a snap!) -b.t. |
1264 | */ |
1223 | */ |
1265 | tmp = get_random_mon (level * 3); |
1224 | object *tmp = get_random_mon (level * 3); |
1266 | while (tmp) |
1225 | while (tmp && buf.size () < BOOK_BUF) |
1267 | { |
1226 | { |
1268 | /* monster description */ |
1227 | /* monster description */ |
1269 | sprintf (tmpbuf, "\n---\n%s", mon_desc (tmp)); |
1228 | buf.printf ("\n%s\n", mon_desc (tmp)); |
1270 | |
|
|
1271 | if (!book_overflow (retbuf, tmpbuf, booksize)) |
|
|
1272 | strcat (retbuf, tmpbuf); |
|
|
1273 | else |
|
|
1274 | break; |
|
|
1275 | |
1229 | |
1276 | /* Note that the value this returns is not based on level */ |
1230 | /* Note that the value this returns is not based on level */ |
1277 | tmp = get_next_mon (tmp); |
1231 | tmp = get_next_mon (tmp); |
1278 | } |
1232 | } |
1279 | |
1233 | |
1280 | #ifdef BOOK_MSG_DEBUG |
|
|
1281 | LOG (llevDebug, "\n mon_info_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1282 | fprintf (logfile, " MADE THIS:\n%s\n", retbuf); |
|
|
1283 | #endif |
|
|
1284 | |
|
|
1285 | return retbuf; |
1234 | return buf; |
1286 | } |
1235 | } |
1287 | |
1236 | |
1288 | |
1237 | |
1289 | /***************************************************************************** |
1238 | /***************************************************************************** |
1290 | * Artifact msg generation code. |
1239 | * Artifact msg generation code. |
1291 | ****************************************************************************/ |
1240 | ****************************************************************************/ |
1292 | |
1241 | |
1293 | /* artifact_msg() - generate a message detailing the properties |
1242 | /* artifact_msg() - generate a message detailing the properties |
1294 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1243 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1295 | */ |
1244 | */ |
1296 | const char * |
1245 | static const char * |
1297 | artifact_msg (int level, int booksize) |
1246 | artifact_msg (int level) |
1298 | { |
1247 | { |
1299 | artifactlist *al = NULL; |
1248 | artifactlist *al = NULL; |
1300 | artifact *art; |
1249 | artifact *art; |
1301 | int chance, i, type, index; |
1250 | int chance, i, type, index; |
1302 | int book_entries = level > 5 ? RANDOM () % 3 + RANDOM () % 3 + 2 : RANDOM () % level + 1; |
1251 | int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1; |
1303 | const char *ch; |
1252 | const char *ch; |
1304 | char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1253 | char name[MAX_BUF]; |
1305 | static char retbuf[BOOK_BUF]; |
|
|
1306 | object *tmp = NULL; |
1254 | object *tmp = NULL; |
|
|
1255 | |
|
|
1256 | static dynbuf_text buf; buf.clear (); |
1307 | |
1257 | |
1308 | /* values greater than 5 create msg buffers that are too big! */ |
1258 | /* values greater than 5 create msg buffers that are too big! */ |
1309 | if (book_entries > 5) |
1259 | if (book_entries > 5) |
1310 | book_entries = 5; |
1260 | book_entries = 5; |
1311 | |
1261 | |
… | |
… | |
1315 | * for that type exists! |
1265 | * for that type exists! |
1316 | */ |
1266 | */ |
1317 | i = 0; |
1267 | i = 0; |
1318 | do |
1268 | do |
1319 | { |
1269 | { |
1320 | index = RANDOM () % (sizeof (art_name_array) / sizeof (arttypename)); |
1270 | index = rndm (sizeof (art_name_array) / sizeof (arttypename)); |
1321 | type = art_name_array[index].type; |
1271 | type = art_name_array[index].type; |
1322 | al = find_artifactlist (type); |
1272 | al = find_artifactlist (type); |
1323 | i++; |
1273 | i++; |
1324 | } |
1274 | } |
1325 | while ((al == NULL) && (i < 10)); |
1275 | while ((al == NULL) && (i < 10)); |
… | |
… | |
1328 | return "None"; |
1278 | return "None"; |
1329 | |
1279 | |
1330 | /* There is no reason to start on the artifact list at the begining. Lets |
1280 | /* There is no reason to start on the artifact list at the begining. Lets |
1331 | * take our starting position randomly... */ |
1281 | * take our starting position randomly... */ |
1332 | art = al->items; |
1282 | art = al->items; |
1333 | for (i = RANDOM () % level + RANDOM () % 2 + 1; i > 0; i--) |
1283 | for (i = rndm (level) + rndm (2) + 1; i > 0; i--) |
1334 | { |
1284 | { |
1335 | if (art == NULL) |
1285 | if (!art) |
1336 | art = al->items; /* hmm, out of stuff, loop back around */ |
1286 | art = al->items; /* hmm, out of stuff, loop back around */ |
|
|
1287 | |
1337 | art = art->next; |
1288 | art = art->next; |
1338 | } |
1289 | } |
1339 | |
1290 | |
1340 | /* the base 'generic' name for our artifact */ |
1291 | /* the base 'generic' name for our artifact */ |
1341 | assign (name, art_name_array[index].name); |
1292 | assign (name, art_name_array[index].name); |
1342 | |
1293 | |
1343 | /* Ok, lets print out the contents */ |
1294 | /* Ok, lets print out the contents */ |
1344 | 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"); |
1345 | |
1298 | |
1346 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1299 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1347 | * 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) |
1348 | */ |
1301 | */ |
1349 | while (book_entries > 0) |
1302 | while (book_entries > 0 && buf.size () < BOOK_BUF) |
1350 | { |
1303 | { |
1351 | |
1304 | |
1352 | if (art == NULL) |
1305 | if (!art) |
1353 | art = al->items; |
1306 | art = al->items; |
1354 | |
1307 | |
1355 | /* separator of items */ |
1308 | buf << '\n'; |
1356 | strcpy (buf, "--- \n"); |
|
|
1357 | |
1309 | |
1358 | /* Name */ |
1310 | /* Name */ |
1359 | if (art->allowed != NULL && strcmp (art->allowed->name, "All")) |
1311 | if (art->allowed && art->allowed->name != shstr_All) |
1360 | { |
1312 | { |
1361 | linked_char *temp, *next = art->allowed; |
1313 | linked_char *temp, *next = art->allowed; |
1362 | |
1314 | |
1363 | do |
1315 | do |
1364 | { |
1316 | { |
1365 | temp = next; |
1317 | temp = next; |
1366 | next = next->next; |
1318 | next = next->next; |
1367 | } |
1319 | } |
1368 | while (next && !RANDOM () % 2); |
1320 | while (next && rndm (2)); |
|
|
1321 | |
1369 | 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); |
1370 | } |
1323 | } |
1371 | else /* default name is used */ |
1324 | else /* default name is used */ |
1372 | 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 "; |
1373 | |
1328 | |
1374 | /* chance of finding */ |
1329 | /* chance of finding */ |
1375 | chance = (int) (100 * ((float) art->chance / al->total_chance)); |
1330 | chance = (int) (100 * ((float) art->chance / al->total_chance)); |
1376 | if (chance >= 20) |
1331 | if (chance >= 20) |
1377 | sprintf (sbuf, "an uncommon"); |
1332 | buf << "an uncommon"; |
1378 | else if (chance >= 10) |
1333 | else if (chance >= 10) |
1379 | sprintf (sbuf, "an unusual"); |
1334 | buf << "an unusual"; |
1380 | else if (chance >= 5) |
1335 | else if (chance >= 5) |
1381 | sprintf (sbuf, "a rare"); |
1336 | buf << "a rare"; |
1382 | else |
1337 | else |
1383 | sprintf (sbuf, "a very rare"); |
1338 | buf << "a very rare"; |
1384 | sprintf (buf, "%s is %s\n", buf, sbuf); |
|
|
1385 | |
1339 | |
1386 | /* value of artifact */ |
1340 | /* value of artifact */ |
1387 | 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"; |
1388 | |
1342 | |
1389 | /* include the message about the artifact, if exists, and book |
1343 | /* include the message about the artifact, if exists, and book |
1390 | * level is kinda high */ |
1344 | * level is kinda high */ |
1391 | if (art->item->msg && (RANDOM () % 4 + 1) < level && !((strlen (art->item->msg) + strlen (buf)) > BOOK_BUF)) |
1345 | if (art->item->msg |
|
|
1346 | && rndm (4) + 1 < level) |
1392 | strcat (buf, art->item->msg); |
1347 | buf << art->item->msg; |
1393 | |
1348 | |
1394 | /* properties of the artifact */ |
1349 | /* properties of the artifact */ |
1395 | tmp = object::create (); |
1350 | tmp = object::create (); |
1396 | add_abilities (tmp, art->item); |
1351 | add_abilities (tmp, art->item); |
1397 | tmp->type = type; |
1352 | tmp->type = type; |
1398 | SET_FLAG (tmp, FLAG_IDENTIFIED); |
1353 | SET_FLAG (tmp, FLAG_IDENTIFIED); |
1399 | if ((ch = describe_item (tmp, NULL)) != NULL && strlen (ch) > 1) |
1354 | if ((ch = describe_item (tmp, 0)) && strlen (ch) > 1) |
1400 | sprintf (buf, "%s Properties of this artifact include: \n %s \n", buf, ch); |
1355 | buf << "\rProperties of this artifact include:\r" << ch << "\n"; |
|
|
1356 | |
1401 | tmp->destroy (); |
1357 | tmp->destroy (); |
1402 | /* add the buf if it will fit */ |
|
|
1403 | if (!book_overflow (retbuf, buf, booksize)) |
|
|
1404 | strcat (retbuf, buf); |
|
|
1405 | else |
|
|
1406 | break; |
|
|
1407 | |
1358 | |
1408 | art = art->next; |
1359 | art = art->next; |
1409 | book_entries--; |
1360 | book_entries--; |
1410 | } |
1361 | } |
1411 | |
1362 | |
1412 | #ifdef BOOK_MSG_DEBUG |
|
|
1413 | LOG (llevDebug, "artifact_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1414 | fprintf (logfile, " MADE THIS:\n%s", retbuf); |
|
|
1415 | #endif |
|
|
1416 | return retbuf; |
1363 | return buf; |
1417 | } |
1364 | } |
1418 | |
1365 | |
1419 | /***************************************************************************** |
1366 | /***************************************************************************** |
1420 | * Spellpath message generation |
1367 | * Spellpath message generation |
1421 | *****************************************************************************/ |
1368 | *****************************************************************************/ |
1422 | |
1369 | |
1423 | /* spellpath_msg() - generate a message detailing the member |
1370 | /* spellpath_msg() - generate a message detailing the member |
1424 | * incantations/prayers (and some of their properties) belonging to |
1371 | * incantations/prayers (and some of their properties) belonging to |
1425 | * a given spellpath. |
1372 | * a given spellpath. |
1426 | */ |
1373 | */ |
1427 | |
1374 | static char * |
1428 | char * |
|
|
1429 | spellpath_msg (int level, int booksize) |
1375 | spellpath_msg (int level) |
1430 | { |
1376 | { |
|
|
1377 | static dynbuf_text buf; buf.clear (); |
|
|
1378 | |
1431 | static char retbuf[BOOK_BUF]; |
1379 | static char retbuf[BOOK_BUF]; |
1432 | char tmpbuf[BOOK_BUF]; |
1380 | char tmpbuf[BOOK_BUF]; |
1433 | int path = RANDOM () % NRSPELLPATHS, prayers = RANDOM () % 2; |
1381 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
1434 | int did_first_sp = 0; |
|
|
1435 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1382 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1436 | archetype *at; |
1383 | archetype *at; |
1437 | |
1384 | |
1438 | /* Preamble */ |
1385 | /* Preamble */ |
1439 | 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"); |
1440 | |
1388 | |
1441 | if (path == -1) |
1389 | if (path == -1) |
1442 | strcat (retbuf, "having no known spell path.\n"); |
1390 | buf << " having no known spell path.\n"; |
1443 | else |
1391 | else |
1444 | 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; |
1445 | |
1395 | |
1446 | for_all_archetypes (at) |
1396 | for_all_archetypes (at) |
1447 | { |
|
|
1448 | /* Determine if this is an appropriate spell. Must |
1397 | /* Determine if this is an appropriate spell. Must |
1449 | * be of matching path, must be of appropriate type (prayer |
1398 | * be of matching path, must be of appropriate type (prayer |
1450 | * or not), and must be within the valid level range. |
1399 | * or not), and must be within the valid level range. |
1451 | */ |
1400 | */ |
1452 | if (at->type == SPELL && at->path_attuned & pnum && |
1401 | if (at->type == SPELL && at->path_attuned & pnum && |
1453 | ((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))) |
1454 | { |
1403 | { |
1455 | assign (tmpbuf, at->object::name); |
1404 | seen = 1; |
1456 | |
1405 | buf << at->object::name << '\r'; |
1457 | if (book_overflow (retbuf, tmpbuf, booksize)) |
|
|
1458 | break; |
|
|
1459 | else |
|
|
1460 | { |
|
|
1461 | if (did_first_sp) |
|
|
1462 | strcat (retbuf, ",\n"); |
|
|
1463 | did_first_sp = 1; |
|
|
1464 | strcat (retbuf, tmpbuf); |
|
|
1465 | } |
|
|
1466 | } |
1406 | } |
1467 | } |
1407 | |
1468 | /* Geez, no spells were generated. */ |
1408 | /* Geez, no spells were generated. */ |
1469 | if (!did_first_sp) |
1409 | if (!seen) |
1470 | { |
|
|
1471 | if (RANDOM () % 4) /* usually, lets make a recursive call... */ |
1410 | if (rndm (4)) /* usually, lets make a recursive call... */ |
1472 | spellpath_msg (level, booksize); |
1411 | return spellpath_msg (level); |
1473 | 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. */ |
1474 | strcat (retbuf, "\n - no known spells exist -\n"); |
1413 | buf << "- no known spells exist.\n"; |
1475 | } |
1414 | |
1476 | else |
|
|
1477 | { |
|
|
1478 | strcat (retbuf, "\n"); |
|
|
1479 | } |
|
|
1480 | return retbuf; |
1415 | return buf; |
1481 | } |
1416 | } |
1482 | |
1417 | |
1483 | /* formula_msg() - generate a message detailing the properties |
1418 | /* formula_msg() - generate a message detailing the properties |
1484 | * of a randomly selected alchemical formula. |
1419 | * of a randomly selected alchemical formula. |
1485 | */ |
1420 | */ |
1486 | void |
1421 | static void |
1487 | make_formula_book (object *book, int level) |
1422 | make_formula_book (object *book, int level) |
1488 | { |
1423 | { |
1489 | char retbuf[BOOK_BUF], title[MAX_BUF]; |
1424 | char title[MAX_BUF]; |
1490 | recipelist *fl; |
1425 | recipelist *fl; |
1491 | recipe *formula = NULL; |
1426 | recipe *formula = NULL; |
1492 | int chance; |
1427 | int chance; |
1493 | |
1428 | |
|
|
1429 | static dynbuf_text buf; buf.clear (); |
|
|
1430 | |
1494 | /* the higher the book level, the more complex (ie number of |
1431 | /* the higher the book level, the more complex (ie number of |
1495 | * ingredients) the formula can be. |
1432 | * ingredients) the formula can be. |
1496 | */ |
1433 | */ |
1497 | fl = get_formulalist (((RANDOM () % level) / 3) + 1); |
1434 | fl = get_formulalist (rndm (level) / 3 + 1); |
1498 | |
1435 | |
1499 | if (!fl) |
1436 | if (!fl) |
1500 | fl = get_formulalist (1); /* safety */ |
1437 | fl = get_formulalist (1); /* safety */ |
1501 | |
1438 | |
1502 | if (fl->total_chance == 0) |
1439 | if (fl->total_chance == 0) |
… | |
… | |
1506 | add_author (book, 4); |
1443 | add_author (book, 4); |
1507 | return; |
1444 | return; |
1508 | } |
1445 | } |
1509 | |
1446 | |
1510 | /* get a random formula, weighted by its bookchance */ |
1447 | /* get a random formula, weighted by its bookchance */ |
1511 | chance = RANDOM () % fl->total_chance; |
1448 | chance = rndm (fl->total_chance); |
1512 | for (formula = fl->items; formula != NULL; formula = formula->next) |
1449 | for (formula = fl->items; formula; formula = formula->next) |
1513 | { |
1450 | { |
1514 | chance -= formula->chance; |
1451 | chance -= formula->chance; |
|
|
1452 | |
1515 | if (chance <= 0) |
1453 | if (chance <= 0) |
1516 | break; |
1454 | break; |
1517 | } |
1455 | } |
1518 | |
1456 | |
1519 | if (!formula || formula->arch_names <= 0) |
1457 | if (!formula || formula->arch_names <= 0) |
1520 | { |
1458 | { |
1521 | book->msg = "<indecipherable text>\n"; |
1459 | book->msg = "<indecipherable text>\n"; |
1522 | new_text_name (book, 4); |
1460 | new_text_name (book, 4); |
1523 | add_author (book, 4); |
1461 | add_author (book, 4); |
1524 | |
1462 | return; |
1525 | } |
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; |
1526 | 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); |
1527 | { |
1493 | } |
1528 | /* looks like a formula was found. Base the amount |
1494 | else |
1529 | * of information on the booklevel and the spellevel |
1495 | { |
1530 | * of the formula. */ |
1496 | buf << "The B<< " << op_name; |
1531 | |
1497 | |
1532 | const char *op_name = formula->arch_name[RANDOM () % 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; |
1533 | archetype *at; |
1517 | archetype *at; |
1534 | |
1518 | |
1535 | /* preamble */ |
|
|
1536 | sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill"); |
|
|
1537 | |
|
|
1538 | if ((at = archetype::find (op_name)) != (archetype *) NULL) |
|
|
1539 | op_name = at->object::name; |
|
|
1540 | else |
|
|
1541 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
|
|
1542 | |
|
|
1543 | /* item name */ |
|
|
1544 | if (strcmp (formula->title, "NONE")) |
|
|
1545 | { |
|
|
1546 | sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title); |
|
|
1547 | /* This results in things like pile of philo. sulfur. |
|
|
1548 | * while philo. sulfur may look better, without this, |
|
|
1549 | * you get things like 'the wise' because its missing the |
|
|
1550 | * water of section. |
|
|
1551 | */ |
|
|
1552 | sprintf (title, "%s: %s of %s", |
|
|
1553 | formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); |
|
|
1554 | } |
|
|
1555 | else |
|
|
1556 | { |
|
|
1557 | sprintf (retbuf, "%sThe %s", retbuf, op_name); |
|
|
1558 | sprintf (title, "%s: %s", formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name); |
|
|
1559 | if (at->title) |
|
|
1560 | { |
|
|
1561 | strcat (retbuf, " "); |
|
|
1562 | strcat (retbuf, at->title); |
|
|
1563 | strcat (title, " "); |
|
|
1564 | strcat (title, at->title); |
|
|
1565 | } |
|
|
1566 | } |
|
|
1567 | /* Lets name the book something meaningful ! */ |
|
|
1568 | book->name = title; |
|
|
1569 | book->title = NULL; |
|
|
1570 | |
|
|
1571 | /* ingredients to make it */ |
|
|
1572 | if (formula->ingred != NULL) |
|
|
1573 | { |
|
|
1574 | linked_char *next; |
|
|
1575 | archetype *at; |
|
|
1576 | |
|
|
1577 | at = archetype::find (formula->cauldron); |
1519 | at = archetype::find (formula->cauldron); |
1578 | |
1520 | |
1579 | sprintf (retbuf + strlen (retbuf), |
1521 | buf.printf (" may be made at %s using the following ingredients:\n\n", |
1580 | " 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"); |
1581 | |
1523 | |
1582 | for (next = formula->ingred; next != NULL; next = next->next) |
1524 | for (next = formula->ingred; next; next = next->next) |
1583 | { |
1525 | buf << next->name << '\r'; |
1584 | strcat (retbuf, next->name); |
1526 | } |
1585 | strcat (retbuf, "\n"); |
|
|
1586 | } |
|
|
1587 | } |
|
|
1588 | else |
1527 | else |
1589 | 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); |
1590 | if (retbuf[strlen (retbuf) - 1] != '\n') |
1529 | |
|
|
1530 | book->msg = buf; |
|
|
1531 | } |
|
|
1532 | |
|
|
1533 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
|
|
1534 | if(variable) { \ |
|
|
1535 | int i,j=0; \ |
|
|
1536 | strcat(retbuf,"(" name ": "); \ |
|
|
1537 | for(i=0; i<NRSPELLPATHS; i++) \ |
|
|
1538 | if(variable & (1<<i)) { \ |
|
|
1539 | if (j) \ |
|
|
1540 | strcat(retbuf,", "); \ |
|
|
1541 | else \ |
|
|
1542 | j = 1; \ |
|
|
1543 | strcat(retbuf, spellpathnames[i]); \ |
|
|
1544 | } \ |
1591 | strcat (retbuf, "\n"); |
1545 | strcat(retbuf,")"); \ |
1592 | |
|
|
1593 | book->msg = retbuf; |
|
|
1594 | } |
1546 | } |
1595 | } |
|
|
1596 | |
1547 | |
1597 | /* god_info_msg() - generate a message detailing the properties |
1548 | /* god_info_msg() - generate a message detailing the properties |
1598 | * of a random god. Used by the book hack. b.t. |
1549 | * of a random god. Used by the book hack. b.t. |
1599 | */ |
1550 | */ |
1600 | const char * |
1551 | static const char * |
1601 | god_info_msg (int level, int booksize) |
1552 | god_info_msg (int level) |
1602 | { |
1553 | { |
1603 | static char retbuf[BOOK_BUF]; |
|
|
1604 | const char *name = NULL; |
1554 | const char *name = NULL; |
1605 | char buf[BOOK_BUF]; |
|
|
1606 | int i; |
|
|
1607 | size_t introlen; |
|
|
1608 | object *god = pntr_to_god_obj (get_rand_god ()); |
1555 | object *god = pntr_to_god_obj (get_rand_god ()); |
1609 | |
1556 | |
|
|
1557 | static dynbuf_text buf; buf.clear (); |
|
|
1558 | |
1610 | if (!god) |
1559 | if (!god) |
1611 | return (char *) NULL; /* oops, problems... */ |
1560 | return 0; /* oops, problems... */ |
|
|
1561 | |
1612 | name = god->name; |
1562 | name = god->name; |
1613 | |
1563 | |
1614 | /* preamble.. */ |
1564 | /* preamble.. */ |
1615 | sprintf (retbuf, "This document contains knowledge concerning\n"); |
1565 | buf << "This document contains knowledge concerning the diety B<< " |
1616 | sprintf (retbuf, "%sthe diety %s", retbuf, name); |
1566 | << name << " >>"; |
1617 | |
1567 | |
1618 | /* Always have as default information the god's descriptive terms. */ |
1568 | /* Always have as default information the god's descriptive terms. */ |
1619 | if (nstrtok (god->msg, ",") > 0) |
1569 | if (nstrtok (god->msg, ",") > 0) |
1620 | { |
1570 | buf << ", known as" << strtoktolin (god->msg, ","); |
1621 | strcat (retbuf, ", known as"); |
|
|
1622 | strcat (retbuf, strtoktolin (god->msg, ",")); |
|
|
1623 | } |
|
|
1624 | else |
1571 | else |
1625 | strcat (retbuf, "..."); |
1572 | buf << "..."; |
1626 | |
1573 | |
1627 | strcat (retbuf, "\n ---\n"); |
1574 | buf << "\n\n"; |
|
|
1575 | |
1628 | 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 */ |
1629 | |
1577 | |
1630 | /* 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 |
1631 | * 'book'. Probably there is a more intellegent way to implement |
1579 | * 'book'. Probably there is a more intellegent way to implement |
1632 | * this ... |
1580 | * this ... |
1633 | */ |
1581 | */ |
1634 | |
1582 | while (level > 0 && buf.size () < BOOK_BUF) |
1635 | while (level > 0) |
|
|
1636 | { |
1583 | { |
1637 | sprintf (buf, " "); |
|
|
1638 | if (level == 2 && RANDOM () % 2) |
1584 | if (level == 2 && rndm (2)) |
1639 | { /* enemy god */ |
1585 | { /* enemy god */ |
1640 | const char *enemy = god->title; |
1586 | const char *enemy = god->title; |
1641 | |
1587 | |
1642 | if (enemy) |
1588 | if (enemy) |
1643 | 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); |
1644 | } |
1590 | } |
1645 | |
1591 | |
1646 | if (level == 3 && RANDOM () % 2) |
1592 | if (level == 3 && rndm (2)) |
1647 | { /* enemy race, what the god's holy word effects */ |
1593 | { /* enemy race, what the god's holy word effects */ |
1648 | const char *enemy = god->slaying; |
1594 | const char *enemy = god->slaying; |
|
|
1595 | int i; |
1649 | |
1596 | |
1650 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1597 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1651 | if ((i = nstrtok (enemy, ",")) > 0) |
1598 | if ((i = nstrtok (enemy, ",")) > 0) |
1652 | { |
1599 | { |
1653 | char tmpbuf[MAX_BUF]; |
1600 | char tmpbuf[MAX_BUF]; |
1654 | |
1601 | |
1655 | sprintf (buf, "The holy words of %s have the power to\n", name); |
1602 | buf << "The holy words of " << name |
1656 | strcat (buf, "slay creatures belonging to the "); |
1603 | << " have the power to slay creatures belonging to the "; |
|
|
1604 | |
1657 | if (i > 1) |
1605 | if (i > 1) |
1658 | sprintf (tmpbuf, "following \n races:%s", strtoktolin (enemy, ",")); |
1606 | buf << "following races:" << strtoktolin (enemy, ","); |
1659 | else |
1607 | else |
1660 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1608 | buf << "race of" << strtoktolin (enemy, ","); |
1661 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1609 | |
|
|
1610 | buf << '\r'; |
1662 | } |
1611 | } |
1663 | } |
1612 | } |
1664 | |
1613 | |
1665 | if (level == 4 && RANDOM () % 2) |
1614 | if (level == 4 && rndm (2)) |
1666 | { /* Priest of god gets these protect,vulnerable... */ |
1615 | { /* Priest of god gets these protect,vulnerable... */ |
1667 | char tmpbuf[MAX_BUF]; |
|
|
1668 | |
|
|
1669 | if (const char *cp = describe_resistance (god, 1)) |
1616 | if (const char *cp = describe_resistance (god, 1)) |
1670 | { /* This god does have protections */ |
1617 | { /* This god does have protections */ |
1671 | sprintf (tmpbuf, "%s has a potent aura which is extended\n", name); |
1618 | buf << name |
|
|
1619 | << " has a potent aura which is extended to" |
1672 | strcat (tmpbuf, "faithful priests. The effects of this aura include:\n"); |
1620 | " faithful priests. The effects of this aura include: " |
1673 | strcat (tmpbuf, cp); |
1621 | << cp |
1674 | strcat (buf, tmpbuf); |
1622 | << ".\r"; |
1675 | strcat (buf, "\n ---\n"); |
|
|
1676 | } |
1623 | } |
1677 | else |
|
|
1678 | sprintf (buf, " "); |
|
|
1679 | } |
1624 | } |
1680 | |
1625 | |
1681 | if (level == 5 && RANDOM () % 2) |
1626 | if (level == 5 && rndm (2)) |
1682 | { /* aligned race, summoning */ |
1627 | { /* aligned race, summoning */ |
1683 | const char *race = god->race; /* aligned race */ |
1628 | const char *race = god->race; /* aligned race */ |
|
|
1629 | int i; |
1684 | |
1630 | |
1685 | if (race && !(god->path_denied & PATH_SUMMON)) |
1631 | if (race && !(god->path_denied & PATH_SUMMON)) |
1686 | if ((i = nstrtok (race, ",")) > 0) |
1632 | if ((i = nstrtok (race, ",")) > 0) |
1687 | { |
1633 | { |
1688 | char tmpbuf[MAX_BUF]; |
1634 | buf << "Creatures sacred to " << name << " include the "; |
1689 | |
|
|
1690 | sprintf (buf, "Creatures sacred to %s include the \n", name); |
|
|
1691 | if (i > 1) |
1635 | if (i > 1) |
1692 | sprintf (tmpbuf, "following \n races:%s", strtoktolin (race, ",")); |
1636 | buf << "following races:" << strtoktolin (race, ","); |
1693 | else |
1637 | else |
1694 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1638 | buf << "race of" << strtoktolin (race, ","); |
1695 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1639 | |
|
|
1640 | buf << '\r'; |
1696 | } |
1641 | } |
1697 | } |
1642 | } |
1698 | |
1643 | |
1699 | if (level == 6 && RANDOM () % 2) |
1644 | if (level == 6 && rndm (2)) |
1700 | { /* blessing,curse properties of the god */ |
1645 | { /* blessing,curse properties of the god */ |
1701 | char tmpbuf[MAX_BUF]; |
|
|
1702 | |
|
|
1703 | if (const char *cp = describe_resistance (god, 1)) |
1646 | if (const char *cp = describe_resistance (god, 1)) |
1704 | { /* This god does have protections */ |
1647 | { /* This god does have protections */ |
1705 | 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 " |
1706 | strcat (tmpbuf, "bestow a blessing which makes the recipient\n"); |
1650 | "bestow a blessing which makes the recipient " |
1707 | strcat (tmpbuf, cp); |
1651 | << cp |
1708 | strcat (buf, tmpbuf); |
1652 | << '\r'; |
1709 | strcat (buf, "\n ---\n"); |
|
|
1710 | } |
1653 | } |
1711 | else |
|
|
1712 | sprintf (buf, " "); |
|
|
1713 | |
|
|
1714 | } |
1654 | } |
1715 | |
1655 | |
1716 | if (level == 8 && RANDOM () % 2) |
1656 | if (level == 8 && rndm (2)) |
1717 | { /* immunity, holy possession */ |
1657 | { /* immunity, holy possession */ |
1718 | int has_effect = 0, tmpvar; |
1658 | buf << "The priests of " << name |
1719 | char tmpbuf[MAX_BUF]; |
1659 | << " are known to make cast a mighty" |
|
|
1660 | " prayer of possession"; |
|
|
1661 | |
|
|
1662 | int first = 1; |
1720 | |
1663 | |
1721 | sprintf (tmpbuf, "\n"); |
|
|
1722 | sprintf (tmpbuf, "The priests of %s are known to make cast a mighty \n", name); |
|
|
1723 | |
|
|
1724 | strcat (tmpbuf, "prayer of possession which gives the recipient\n"); |
|
|
1725 | |
|
|
1726 | for (tmpvar = 0; tmpvar < NROFATTACKS; tmpvar++) |
1664 | for (int i = 0; i < NROFATTACKS; i++) |
|
|
1665 | if (god->resist[i] == 100) |
1727 | { |
1666 | { |
1728 | if (god->resist[tmpvar] == 100) |
1667 | if (first) |
1729 | { |
1668 | { |
|
|
1669 | buf << " which gives the recipient"; |
1730 | has_effect = 1; |
1670 | first = 0; |
1731 | sprintf (tmpbuf + strlen (tmpbuf), "Immunity to %s", attacktype_desc[tmpvar]); |
|
|
1732 | } |
1671 | } |
|
|
1672 | else |
|
|
1673 | buf << ", "; |
|
|
1674 | |
|
|
1675 | buf << " immunity to " << attacktype_desc[i]; |
1733 | } |
1676 | } |
1734 | |
1677 | |
1735 | if (has_effect) |
1678 | buf << ".\r"; |
1736 | { |
|
|
1737 | strcat (buf, tmpbuf); |
|
|
1738 | strcat (buf, "\n ---\n"); |
|
|
1739 | } |
|
|
1740 | else |
|
|
1741 | sprintf (buf, " "); |
|
|
1742 | } |
1679 | } |
1743 | |
1680 | |
1744 | if (level == 12 && RANDOM () % 2) |
1681 | if (level == 12 && rndm (2)) |
1745 | { /* spell paths */ |
1682 | { /* spell paths */ |
|
|
1683 | //TODO: |
1746 | int has_effect = 0, tmpvar; |
1684 | int has_effect = 0, tmpvar; |
1747 | char tmpbuf[MAX_BUF]; |
1685 | char tmpbuf[MAX_BUF]; |
1748 | |
1686 | |
1749 | sprintf (tmpbuf, "\n"); |
1687 | sprintf (tmpbuf, "\n"); |
1750 | 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); |
… | |
… | |
1767 | has_effect = 1; |
1705 | has_effect = 1; |
1768 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1706 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1769 | } |
1707 | } |
1770 | |
1708 | |
1771 | if (has_effect) |
1709 | if (has_effect) |
1772 | { |
1710 | buf << tmpbuf << '\r'; |
1773 | strcat (buf, tmpbuf); |
|
|
1774 | strcat (buf, "\n ---\n"); |
|
|
1775 | } |
|
|
1776 | else |
1711 | else |
1777 | sprintf (buf, " "); |
1712 | buf << '\r'; |
1778 | } |
1713 | } |
1779 | |
1714 | |
1780 | /* check to be sure new buffer size dont exceed either |
|
|
1781 | * the maximum buffer size, or the 'natural' size of the |
|
|
1782 | * book... |
|
|
1783 | */ |
|
|
1784 | if (book_overflow (retbuf, buf, booksize)) |
|
|
1785 | break; |
|
|
1786 | else if (strlen (buf) > 1) |
|
|
1787 | strcat (retbuf, buf); |
|
|
1788 | |
|
|
1789 | level--; |
1715 | level--; |
1790 | } |
1716 | } |
1791 | |
1717 | |
1792 | if (strlen (retbuf) == introlen) |
1718 | if (buf.size () == introlen) |
1793 | { /* we got no information beyond the preamble! */ |
1719 | /* we got no information beyond the preamble! */ |
1794 | strcat (retbuf, " [Unfortunately the rest of the information is\n"); |
1720 | buf << "[Unfortunately the rest of the information is hopelessly garbled!]"; |
1795 | strcat (retbuf, " hopelessly garbled!]\n ---\n"); |
1721 | |
1796 | } |
|
|
1797 | #ifdef BOOK_MSG_DEBUG |
|
|
1798 | LOG (llevDebug, "\n god_info_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1799 | fprintf (logfile, " MADE THIS:\n%s", retbuf); |
|
|
1800 | #endif |
|
|
1801 | return retbuf; |
1722 | return buf; |
1802 | } |
1723 | } |
1803 | |
1724 | |
1804 | /* tailor_readable_ob()- The main routine. This chooses a random |
1725 | /* tailor_readable_ob()- The main routine. This chooses a random |
1805 | * message to put in given readable object (type==BOOK) which will |
1726 | * message to put in given readable object (type==BOOK) which will |
1806 | * 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- |
… | |
… | |
1818 | * |
1739 | * |
1819 | */ |
1740 | */ |
1820 | void |
1741 | void |
1821 | tailor_readable_ob (object *book, int msg_type) |
1742 | tailor_readable_ob (object *book, int msg_type) |
1822 | { |
1743 | { |
1823 | char msgbuf[BOOK_BUF]; |
|
|
1824 | int level = book->level ? (RANDOM () % book->level) + 1 : 1; |
1744 | int level = book->level ? rndm (book->level) + 1 : 1; |
1825 | int book_buf_size; |
|
|
1826 | |
1745 | |
1827 | /* safety */ |
1746 | /* safety */ |
1828 | if (book->type != BOOK) |
1747 | if (book->type != BOOK) |
1829 | return; |
1748 | return; |
1830 | |
1749 | |
1831 | if (level <= 0) |
1750 | if (level <= 0) |
1832 | return; /* if no level no point in doing any more... */ |
1751 | return; /* if no level no point in doing any more... */ |
1833 | |
|
|
1834 | /* Max text length this book can have. */ |
|
|
1835 | book_buf_size = BOOKSIZE (book); |
|
|
1836 | |
1752 | |
1837 | /* &&& The message switch &&& */ |
1753 | /* &&& The message switch &&& */ |
1838 | /* 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. |
1839 | */ |
1755 | */ |
1840 | /* |
1756 | /* |
… | |
… | |
1843 | * 2) make sure there is an entry in max_titles[] array. |
1759 | * 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() |
1760 | * 3) make sure there are entries for your case in new_text_title() |
1845 | * and add_authour(). |
1761 | * and add_authour(). |
1846 | * 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 |
1847 | */ |
1763 | */ |
1848 | |
1764 | const char *new_msg = ""; |
1849 | msg_type = msg_type > 0 ? msg_type : (RANDOM () % 6); |
1765 | msg_type = msg_type > 0 ? msg_type : rndm (8); |
1850 | switch (msg_type) |
1766 | switch (msg_type) |
1851 | { |
1767 | { |
1852 | case 1: /* monster attrib */ |
1768 | case 1: /* monster attrib */ |
1853 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1769 | new_msg = mon_info_msg (level); |
1854 | break; |
1770 | break; |
1855 | case 2: /* artifact attrib */ |
1771 | case 2: /* artifact attrib */ |
1856 | strcpy (msgbuf, artifact_msg (level, book_buf_size)); |
1772 | new_msg = artifact_msg (level); |
1857 | break; |
1773 | break; |
1858 | case 3: /* grouping incantations/prayers by path */ |
1774 | case 3: /* grouping incantations/prayers by path */ |
1859 | strcpy (msgbuf, spellpath_msg (level, book_buf_size)); |
1775 | new_msg = spellpath_msg (level); |
1860 | break; |
1776 | break; |
1861 | case 4: /* describe an alchemy formula */ |
1777 | case 4: /* describe an alchemy formula */ |
1862 | make_formula_book (book, level); |
1778 | make_formula_book (book, level); |
1863 | /* make_formula_book already gives title */ |
1779 | /* make_formula_book already gives title */ |
1864 | return; |
1780 | return; |
1865 | break; |
|
|
1866 | case 5: /* bits of information about a god */ |
1781 | case 5: /* bits of information about a god */ |
1867 | strcpy (msgbuf, god_info_msg (level, book_buf_size)); |
1782 | new_msg = god_info_msg (level); |
1868 | break; |
1783 | break; |
1869 | case 0: /* use info list in lib/ */ |
1784 | case 0: /* use info list in lib/ */ |
1870 | default: |
1785 | default: |
1871 | cfperl_make_book (book, level); |
1786 | cfperl_make_book (book, level); |
|
|
1787 | /* already gives title */ |
1872 | return; |
1788 | return; |
1873 | } |
1789 | } |
1874 | |
1790 | |
1875 | strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */ |
|
|
1876 | |
|
|
1877 | if (strlen (msgbuf) > 1) |
1791 | if (strlen (new_msg) > 1) |
1878 | { |
1792 | { |
1879 | book->msg = msgbuf; |
1793 | book->msg = new_msg; |
1880 | /* 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 */ |
1881 | change_book (book, msg_type); |
1795 | change_book (book, msg_type); |
1882 | } |
1796 | } |
1883 | |
|
|
1884 | } |
1797 | } |
1885 | |
|
|
1886 | |
|
|
1887 | /***************************************************************************** |
|
|
1888 | * |
|
|
1889 | * Cleanup routine for readble stuff. |
|
|
1890 | * |
|
|
1891 | *****************************************************************************/ |
|
|
1892 | |
|
|
1893 | void |
|
|
1894 | free_all_readable (void) |
|
|
1895 | { |
|
|
1896 | titlelist *tlist, *tnext; |
|
|
1897 | title *title1, *titlenext; |
|
|
1898 | linked_char *lmsg, *nextmsg; |
|
|
1899 | objectlink *monlink, *nextmon; |
|
|
1900 | |
|
|
1901 | LOG (llevDebug, "freeing all book information\n"); |
|
|
1902 | |
|
|
1903 | for (tlist = booklist; tlist != NULL; tlist = tnext) |
|
|
1904 | { |
|
|
1905 | tnext = tlist->next; |
|
|
1906 | |
|
|
1907 | for (title1 = tlist->first_book; title1; title1 = titlenext) |
|
|
1908 | { |
|
|
1909 | titlenext = title1->next; |
|
|
1910 | delete title1; |
|
|
1911 | } |
|
|
1912 | |
|
|
1913 | delete tlist; |
|
|
1914 | } |
|
|
1915 | |
|
|
1916 | for (lmsg = first_msg; lmsg; lmsg = nextmsg) |
|
|
1917 | { |
|
|
1918 | nextmsg = lmsg->next; |
|
|
1919 | delete lmsg; |
|
|
1920 | } |
|
|
1921 | |
|
|
1922 | for (monlink = first_mon_info; monlink; monlink = nextmon) |
|
|
1923 | { |
|
|
1924 | nextmon = monlink->next; |
|
|
1925 | delete monlink; |
|
|
1926 | } |
|
|
1927 | } |
|
|
1928 | |
|
|
1929 | |
1798 | |
1930 | /***************************************************************************** |
1799 | /***************************************************************************** |
1931 | * |
1800 | * |
1932 | * Writeback routine for updating the bookarchive. |
1801 | * Writeback routine for updating the bookarchive. |
1933 | * |
1802 | * |
1934 | ****************************************************************************/ |
1803 | ****************************************************************************/ |
1935 | |
|
|
1936 | /* write_book_archive() - write out the updated book archive */ |
1804 | /* write_book_archive() - write out the updated book archive */ |
1937 | |
|
|
1938 | void |
1805 | void |
1939 | write_book_archive (void) |
1806 | write_book_archive (void) |
1940 | { |
1807 | { |
1941 | FILE *fp; |
1808 | FILE *fp; |
1942 | int index = 0; |
1809 | int index = 0; |
… | |
… | |
1945 | titlelist *bl = get_titlelist (0); |
1812 | titlelist *bl = get_titlelist (0); |
1946 | |
1813 | |
1947 | /* If nothing changed, don't write anything */ |
1814 | /* If nothing changed, don't write anything */ |
1948 | if (!need_to_write_bookarchive) |
1815 | if (!need_to_write_bookarchive) |
1949 | return; |
1816 | return; |
|
|
1817 | |
1950 | need_to_write_bookarchive = 0; |
1818 | need_to_write_bookarchive = 0; |
1951 | |
1819 | |
1952 | sprintf (fname, "%s/bookarch", settings.localdir); |
1820 | sprintf (fname, "%s/bookarch", settings.localdir); |
1953 | LOG (llevDebug, "Updating book archive: %s...\n", fname); |
1821 | LOG (llevDebug, "Updating book archive: %s...\n", fname); |
1954 | |
1822 | |
1955 | if ((fp = fopen (fname, "w")) == NULL) |
1823 | if ((fp = fopen (fname, "w")) == NULL) |
1956 | { |
|
|
1957 | LOG (llevDebug, "Can't open book archive file %s\n", fname); |
1824 | LOG (llevDebug, "Can't open book archive file %s\n", fname); |
1958 | } |
|
|
1959 | else |
1825 | else |
1960 | { |
1826 | { |
1961 | while (bl) |
1827 | while (bl) |
1962 | { |
1828 | { |
1963 | for (book = bl->first_book; book; book = book->next) |
1829 | for (book = bl->first_book; book; book = book->next) |
… | |
… | |
1970 | fprintf (fp, "type %d\n", index); |
1836 | fprintf (fp, "type %d\n", index); |
1971 | fprintf (fp, "size %d\n", book->size); |
1837 | fprintf (fp, "size %d\n", book->size); |
1972 | fprintf (fp, "index %d\n", book->msg_index); |
1838 | fprintf (fp, "index %d\n", book->msg_index); |
1973 | fprintf (fp, "end\n"); |
1839 | fprintf (fp, "end\n"); |
1974 | } |
1840 | } |
|
|
1841 | |
1975 | bl = bl->next; |
1842 | bl = bl->next; |
1976 | index++; |
1843 | index++; |
1977 | } |
1844 | } |
|
|
1845 | |
1978 | fclose (fp); |
1846 | fclose (fp); |
1979 | chmod (fname, SAVE_MODE); |
1847 | chmod (fname, SAVE_MODE); |
1980 | } |
1848 | } |
1981 | } |
1849 | } |
|
|
1850 | |
1982 | readable_message_type * |
1851 | readable_message_type * |
1983 | get_readable_message_type (object *readable) |
1852 | get_readable_message_type (object *readable) |
1984 | { |
1853 | { |
1985 | uint8 subtype = readable->subtype; |
1854 | uint8 subtype = readable->subtype; |
1986 | |
1855 | |