1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | |
25 | |
25 | /* This file contains code relevant to the BOOKS hack -- designed |
26 | /* This file contains code relevant to the BOOKS hack -- designed |
26 | * to allow randomly occuring messages in non-magical texts. |
27 | * to allow randomly occuring messages in non-magical texts. |
27 | */ |
28 | */ |
… | |
… | |
110 | * pointers to all (hostile) monster objects */ |
111 | * pointers to all (hostile) monster objects */ |
111 | |
112 | |
112 | static int nrofmon = 0, need_to_write_bookarchive = 0; |
113 | static int nrofmon = 0, need_to_write_bookarchive = 0; |
113 | |
114 | |
114 | |
115 | |
115 | /* this is needed to keep track of status of initialization |
116 | /* this is needed to keep track of status of initialisation |
116 | * of the message file */ |
117 | * of the message file */ |
117 | static int nrofmsg = 0; |
118 | static int nrofmsg = 0; |
118 | |
119 | |
119 | /* first_msg is the started of the linked list of messages as read from |
120 | /* first_msg is the started of the linked list of messages as read from |
120 | * the messages file |
121 | * the messages file |
… | |
… | |
187 | {"Shield", SHIELD}, |
188 | {"Shield", SHIELD}, |
188 | {"Bracers", BRACERS}, |
189 | {"Bracers", BRACERS}, |
189 | {"Boots", BOOTS}, |
190 | {"Boots", BOOTS}, |
190 | {"Cloak", CLOAK}, |
191 | {"Cloak", CLOAK}, |
191 | {"Gloves", GLOVES}, |
192 | {"Gloves", GLOVES}, |
192 | {"Gridle", GIRDLE}, |
193 | {"Girdle", GIRDLE}, |
193 | {"Ring", RING}, |
194 | {"Ring", RING}, |
194 | {"Horn", HORN}, |
195 | {"Horn", HORN}, |
195 | {"Missile Weapon", BOW}, |
196 | {"Missile Weapon", BOW}, |
196 | {"Missile", ARROW}, |
197 | {"Missile", ARROW}, |
197 | {"Hand Weapon", WEAPON}, |
198 | {"Hand Weapon", WEAPON}, |
… | |
… | |
636 | |
637 | |
637 | } |
638 | } |
638 | |
639 | |
639 | /***************************************************************************** |
640 | /***************************************************************************** |
640 | * |
641 | * |
641 | * Start of initialization related functions. |
642 | * Start of initialisation related functions. |
642 | * |
643 | * |
643 | ****************************************************************************/ |
644 | ****************************************************************************/ |
644 | |
645 | |
645 | /* init_msgfile() - if not called before, initialize the info list |
|
|
646 | * reads the messages file into the list pointed to by first_msg |
|
|
647 | */ |
|
|
648 | |
|
|
649 | static void |
|
|
650 | init_msgfile (void) |
|
|
651 | { |
|
|
652 | FILE *fp; |
|
|
653 | char buf[MAX_BUF], msgbuf[HUGE_BUF], fname[MAX_BUF], *cp; |
|
|
654 | int comp; |
|
|
655 | static int did_init_msgfile; |
|
|
656 | |
|
|
657 | if (did_init_msgfile) |
|
|
658 | return; |
|
|
659 | did_init_msgfile = 1; |
|
|
660 | |
|
|
661 | sprintf (fname, "%s/messages", settings.datadir); |
|
|
662 | LOG (llevDebug, "Reading messages from %s...", fname); |
|
|
663 | |
|
|
664 | if ((fp = open_and_uncompress (fname, 0, &comp)) != NULL) |
|
|
665 | { |
|
|
666 | linked_char *tmp = NULL; |
|
|
667 | |
|
|
668 | while (fgets (buf, MAX_BUF, fp) != NULL) |
|
|
669 | { |
|
|
670 | if (*buf == '#') |
|
|
671 | continue; |
|
|
672 | if ((cp = strchr (buf, '\n')) != NULL) |
|
|
673 | *cp = '\0'; |
|
|
674 | cp = buf; |
|
|
675 | while (*cp == ' ') /* Skip blanks */ |
|
|
676 | cp++; |
|
|
677 | if (!strncmp (cp, "ENDMSG", 6)) |
|
|
678 | { |
|
|
679 | if (strlen (msgbuf) > BOOK_BUF) |
|
|
680 | { |
|
|
681 | LOG (llevDebug, "Warning: this string exceeded max book buf size:"); |
|
|
682 | LOG (llevDebug, " %s", msgbuf); |
|
|
683 | } |
|
|
684 | tmp->name = msgbuf; |
|
|
685 | tmp->next = first_msg; |
|
|
686 | first_msg = tmp; |
|
|
687 | nrofmsg++; |
|
|
688 | continue; |
|
|
689 | } |
|
|
690 | else if (!strncmp (cp, "MSG", 3)) |
|
|
691 | { |
|
|
692 | tmp = new linked_char; |
|
|
693 | |
|
|
694 | strcpy (msgbuf, " "); /* reset msgbuf for new message */ |
|
|
695 | continue; |
|
|
696 | } |
|
|
697 | else if (!buf_overflow (msgbuf, cp, HUGE_BUF - 1)) |
|
|
698 | { |
|
|
699 | strcat (msgbuf, cp); |
|
|
700 | strcat (msgbuf, "\n"); |
|
|
701 | } |
|
|
702 | } |
|
|
703 | close_and_delete (fp, comp); |
|
|
704 | } |
|
|
705 | |
|
|
706 | #ifdef BOOK_MSG_DEBUG |
|
|
707 | LOG (llevDebug, "\ninit_info_listfile() got %d messages.\n", nrofmsg); |
|
|
708 | #endif |
|
|
709 | LOG (llevDebug, "done.\n"); |
|
|
710 | } |
|
|
711 | |
|
|
712 | |
|
|
713 | /* init_book_archive() - if not called before, initialize the info list |
646 | /* init_book_archive() - if not called before, initialise the info list |
714 | * This reads in the bookarch file into memory. bookarch is the file |
647 | * This reads in the bookarch file into memory. bookarch is the file |
715 | * created and updated across multiple runs of the program. |
648 | * created and updated across multiple runs of the program. |
716 | */ |
649 | */ |
717 | |
|
|
718 | static void |
650 | static void |
719 | init_book_archive (void) |
651 | init_book_archive (void) |
720 | { |
652 | { |
721 | FILE *fp; |
653 | FILE *fp; |
722 | int comp, nroftitle = 0; |
654 | int comp, nroftitle = 0; |
… | |
… | |
788 | book->next = bl->first_book; |
720 | book->next = bl->first_book; |
789 | bl->first_book = book; |
721 | bl->first_book = book; |
790 | bl->number++; |
722 | bl->number++; |
791 | } |
723 | } |
792 | } |
724 | } |
793 | LOG (llevDebug, " book archives(used/avail): "); |
725 | LOG (llevDebug, "book archives(used/avail): \n"); |
794 | for (bl = booklist, i = 0; bl != NULL && i < sizeof (max_titles) / sizeof (*max_titles); bl = bl->next, i++) |
726 | for (bl = booklist, i = 0; bl != NULL && i < sizeof (max_titles) / sizeof (*max_titles); bl = bl->next, i++) |
795 | { |
727 | { |
796 | LOG (llevDebug, "(%d/%d)", bl->number, max_titles[i]); |
728 | LOG (llevDebug, " (%d/%d)\n", bl->number, max_titles[i]); |
797 | } |
729 | } |
798 | LOG (llevDebug, "\n"); |
|
|
799 | close_and_delete (fp, comp); |
730 | close_and_delete (fp, comp); |
800 | } |
731 | } |
801 | |
732 | |
802 | #ifdef BOOK_MSG_DEBUG |
733 | #ifdef BOOK_MSG_DEBUG |
803 | LOG (llevDebug, "\n init_book_archive() got %d titles.\n", nroftitle); |
734 | LOG (llevDebug, "init_book_archive() got %d titles.\n", nroftitle); |
804 | #endif |
735 | #endif |
805 | LOG (llevDebug, " done.\n"); |
736 | LOG (llevDebug, " done.\n"); |
806 | } |
737 | } |
807 | |
738 | |
808 | /* init_mon_info() - creates the linked list of pointers to |
739 | /* init_mon_info() - creates the linked list of pointers to |
… | |
… | |
815 | archetype *at; |
746 | archetype *at; |
816 | static int did_init_mon_info = 0; |
747 | static int did_init_mon_info = 0; |
817 | |
748 | |
818 | if (did_init_mon_info) |
749 | if (did_init_mon_info) |
819 | return; |
750 | return; |
|
|
751 | |
820 | did_init_mon_info = 1; |
752 | did_init_mon_info = 1; |
821 | |
753 | |
822 | |
754 | |
823 | for (at = first_archetype; at != NULL; at = at->next) |
755 | for (at = first_archetype; at != NULL; at = at->next) |
824 | { |
756 | { |
825 | if (QUERY_FLAG (&at->clone, FLAG_MONSTER) && (!QUERY_FLAG (&at->clone, FLAG_CHANGING) || QUERY_FLAG (&at->clone, FLAG_UNAGGRESSIVE))) |
757 | if (QUERY_FLAG (&at->clone, FLAG_MONSTER) && (!QUERY_FLAG (&at->clone, FLAG_CHANGING) || QUERY_FLAG (&at->clone, FLAG_UNAGGRESSIVE))) |
826 | { |
758 | { |
827 | objectlink *mon = (objectlink *) malloc (sizeof (objectlink)); |
759 | objectlink *mon = new objectlink; |
828 | |
760 | |
829 | mon->ob = &at->clone; |
761 | mon->ob = &at->clone; |
830 | mon->id = nrofmon; |
|
|
831 | mon->next = first_mon_info; |
762 | mon->next = first_mon_info; |
832 | first_mon_info = mon; |
763 | first_mon_info = mon; |
833 | nrofmon++; |
764 | nrofmon++; |
834 | } |
765 | } |
835 | } |
766 | } |
|
|
767 | |
836 | LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); |
768 | LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); |
837 | } |
769 | } |
838 | |
770 | |
839 | |
|
|
840 | /* init_readable() - initialize linked lists utilized by |
771 | /* init_readable() - initialise linked lists utilized by |
841 | * message functions in tailor_readable_ob() |
772 | * message functions in tailor_readable_ob() |
842 | * |
773 | * |
843 | * This is the function called by the main routine to initialize |
774 | * This is the function called by the main routine to initialise |
844 | * all the readable information. |
775 | * all the readable information. |
845 | */ |
776 | */ |
846 | |
|
|
847 | void |
777 | void |
848 | init_readable (void) |
778 | init_readable (void) |
849 | { |
779 | { |
850 | static int did_this; |
780 | static int did_this; |
851 | |
781 | |
852 | if (did_this) |
782 | if (did_this) |
853 | return; |
783 | return; |
|
|
784 | |
854 | did_this = 1; |
785 | did_this = 1; |
855 | |
786 | |
856 | LOG (llevDebug, "Initializing reading data..."); |
787 | LOG (llevDebug, "Initialising reading data...\n"); |
857 | init_msgfile (); |
|
|
858 | init_book_archive (); |
788 | init_book_archive (); |
859 | init_mon_info (); |
789 | init_mon_info (); |
860 | LOG (llevDebug, " Done\n"); |
790 | LOG (llevDebug, " Done\n"); |
861 | |
|
|
862 | } |
791 | } |
863 | |
792 | |
864 | /***************************************************************************** |
793 | /***************************************************************************** |
865 | * |
794 | * |
866 | * This is the start of the administrative functions when creating |
795 | * This is the start of the administrative functions when creating |
867 | * new books (ie, updating title and the like) |
796 | * new books (ie, updating title and the like) |
868 | * |
797 | * |
869 | *****************************************************************************/ |
798 | *****************************************************************************/ |
870 | |
799 | |
871 | |
|
|
872 | /* find_title() - Search the titlelist (based on msgtype) to see if |
800 | /* find_title() - Search the titlelist (based on msgtype) to see if |
873 | * book matches something already there. IF so, return that title. |
801 | * book matches something already there. IF so, return that title. |
874 | */ |
802 | */ |
875 | |
|
|
876 | static title * |
803 | static title * |
877 | find_title (const object *book, int msgtype) |
804 | find_title (const object *book, int msgtype) |
878 | { |
805 | { |
879 | title *t = NULL; |
806 | title *t = NULL; |
880 | titlelist *tl = get_titlelist (msgtype); |
807 | titlelist *tl = get_titlelist (msgtype); |
… | |
… | |
917 | if (book->type != BOOK) |
844 | if (book->type != BOOK) |
918 | return; |
845 | return; |
919 | |
846 | |
920 | switch (msgtype) |
847 | switch (msgtype) |
921 | { |
848 | { |
922 | case 1: /*monster */ |
849 | case 1: /*monster */ |
923 | nbr = sizeof (mon_book_name) / sizeof (char *); |
850 | nbr = sizeof (mon_book_name) / sizeof (char *); |
924 | strcpy (name, mon_book_name[RANDOM () % nbr]); |
851 | assign (name, mon_book_name[rndm (nbr)]); |
925 | break; |
852 | break; |
926 | case 2: /*artifact */ |
853 | case 2: /*artifact */ |
927 | nbr = sizeof (art_book_name) / sizeof (char *); |
854 | nbr = sizeof (art_book_name) / sizeof (char *); |
928 | strcpy (name, art_book_name[RANDOM () % nbr]); |
855 | assign (name, art_book_name[rndm (nbr)]); |
929 | break; |
856 | break; |
930 | case 3: /*spellpath */ |
857 | case 3: /*spellpath */ |
931 | nbr = sizeof (path_book_name) / sizeof (char *); |
858 | nbr = sizeof (path_book_name) / sizeof (char *); |
932 | strcpy (name, path_book_name[RANDOM () % nbr]); |
859 | assign (name, path_book_name[rndm (nbr)]); |
933 | break; |
860 | break; |
934 | case 4: /*alchemy */ |
861 | case 4: /*alchemy */ |
935 | nbr = sizeof (formula_book_name) / sizeof (char *); |
862 | nbr = sizeof (formula_book_name) / sizeof (char *); |
936 | strcpy (name, formula_book_name[RANDOM () % nbr]); |
863 | assign (name, formula_book_name[rndm (nbr)]); |
937 | break; |
864 | break; |
938 | case 5: /*gods */ |
865 | case 5: /*gods */ |
939 | nbr = sizeof (gods_book_name) / sizeof (char *); |
866 | nbr = sizeof (gods_book_name) / sizeof (char *); |
940 | strcpy (name, gods_book_name[RANDOM () % nbr]); |
867 | assign (name, gods_book_name[rndm (nbr)]); |
941 | break; |
868 | break; |
942 | case 6: /*msg file */ |
869 | case 6: /*msg file */ |
943 | default: |
870 | default: |
944 | if (book->weight > 2000) |
871 | if (book->weight > 2000) |
945 | { /* based on weight */ |
872 | { /* based on weight */ |
946 | nbr = sizeof (heavy_book_name) / sizeof (char *); |
873 | nbr = sizeof (heavy_book_name) / sizeof (char *); |
947 | strcpy (name, heavy_book_name[RANDOM () % nbr]); |
874 | assign (name, heavy_book_name[rndm (nbr)]); |
948 | } |
875 | } |
949 | else if (book->weight < 2001) |
876 | else if (book->weight < 2001) |
950 | { |
877 | { |
951 | nbr = sizeof (light_book_name) / sizeof (char *); |
878 | nbr = sizeof (light_book_name) / sizeof (char *); |
952 | strcpy (name, light_book_name[RANDOM () % nbr]); |
879 | assign (name, light_book_name[rndm (nbr)]); |
953 | } |
880 | } |
954 | break; |
881 | break; |
955 | } |
882 | } |
956 | |
883 | |
957 | book->name = name; |
884 | book->name = name; |
958 | } |
885 | } |
959 | |
886 | |
… | |
… | |
971 | if (msgtype < 0 || strlen (op->msg) < 5) |
898 | if (msgtype < 0 || strlen (op->msg) < 5) |
972 | return; |
899 | return; |
973 | |
900 | |
974 | switch (msgtype) |
901 | switch (msgtype) |
975 | { |
902 | { |
976 | case 1: /* monster */ |
903 | case 1: /* monster */ |
977 | nbr = sizeof (mon_author) / sizeof (char *); |
904 | nbr = sizeof (mon_author) / sizeof (char *); |
978 | strcpy (name, mon_author[RANDOM () % nbr]); |
905 | assign (name, mon_author[rndm (nbr)]); |
979 | break; |
906 | break; |
980 | case 2: /* artifacts */ |
907 | case 2: /* artifacts */ |
981 | nbr = sizeof (art_author) / sizeof (char *); |
908 | nbr = sizeof (art_author) / sizeof (char *); |
982 | strcpy (name, art_author[RANDOM () % nbr]); |
909 | assign (name, art_author[rndm (nbr)]); |
983 | break; |
910 | break; |
984 | case 3: /* spellpath */ |
911 | case 3: /* spellpath */ |
985 | nbr = sizeof (path_author) / sizeof (char *); |
912 | nbr = sizeof (path_author) / sizeof (char *); |
986 | strcpy (name, path_author[RANDOM () % nbr]); |
913 | assign (name, path_author[rndm (nbr)]); |
987 | break; |
914 | break; |
988 | case 4: /* alchemy */ |
915 | case 4: /* alchemy */ |
989 | nbr = sizeof (formula_author) / sizeof (char *); |
916 | nbr = sizeof (formula_author) / sizeof (char *); |
990 | strcpy (name, formula_author[RANDOM () % nbr]); |
917 | assign (name, formula_author[rndm (nbr)]); |
991 | break; |
918 | break; |
992 | case 5: /* gods */ |
919 | case 5: /* gods */ |
993 | nbr = sizeof (gods_author) / sizeof (char *); |
920 | nbr = sizeof (gods_author) / sizeof (char *); |
994 | strcpy (name, gods_author[RANDOM () % nbr]); |
921 | assign (name, gods_author[rndm (nbr)]); |
995 | break; |
922 | break; |
996 | case 6: /* msg file */ |
923 | case 6: /* msg file */ |
997 | default: |
924 | default: |
998 | strcpy (name, book_author[RANDOM () % nbr]); |
925 | assign (name, book_author[rndm (nbr)]); |
999 | } |
926 | } |
1000 | |
927 | |
1001 | sprintf (title, "of %s", name); |
928 | sprintf (title, "of %s", name); |
1002 | op->title = title; |
929 | op->title = title; |
1003 | } |
930 | } |
… | |
… | |
1097 | |
1024 | |
1098 | /* alter book properties */ |
1025 | /* alter book properties */ |
1099 | if ((tmpbook = get_archetype (t->archname)) != NULL) |
1026 | if ((tmpbook = get_archetype (t->archname)) != NULL) |
1100 | { |
1027 | { |
1101 | tmpbook->msg = book->msg; |
1028 | tmpbook->msg = book->msg; |
1102 | copy_object (tmpbook, book); |
1029 | tmpbook->copy_to (book); |
1103 | free_object (tmpbook); |
1030 | tmpbook->destroy (); |
1104 | } |
1031 | } |
1105 | |
1032 | |
1106 | book->title = t->authour; |
1033 | book->title = t->authour; |
1107 | book->name = t->name; |
1034 | book->name = t->name; |
1108 | book->level = t->level; |
1035 | book->level = t->level; |
… | |
… | |
1167 | if (RANDOM () % 4) |
1094 | if (RANDOM () % 4) |
1168 | { |
1095 | { |
1169 | /* Lets give the book a description to individualize it some */ |
1096 | /* Lets give the book a description to individualize it some */ |
1170 | char new_name[MAX_BUF]; |
1097 | char new_name[MAX_BUF]; |
1171 | |
1098 | |
1172 | snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[RANDOM () % nbr], old_name); |
1099 | snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name); |
1173 | |
1100 | |
1174 | book->name = new_name; |
1101 | book->name = new_name; |
1175 | } |
1102 | } |
1176 | else |
1103 | else |
1177 | { |
1104 | { |
… | |
… | |
1366 | ****************************************************************************/ |
1293 | ****************************************************************************/ |
1367 | |
1294 | |
1368 | /* artifact_msg() - generate a message detailing the properties |
1295 | /* artifact_msg() - generate a message detailing the properties |
1369 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1296 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1370 | */ |
1297 | */ |
1371 | |
1298 | const char * |
1372 | char * |
|
|
1373 | artifact_msg (int level, int booksize) |
1299 | artifact_msg (int level, int booksize) |
1374 | { |
1300 | { |
1375 | artifactlist *al = NULL; |
1301 | artifactlist *al = NULL; |
1376 | artifact *art; |
1302 | artifact *art; |
1377 | int chance, i, type, index; |
1303 | int chance, i, type, index; |
1378 | int book_entries = level > 5 ? RANDOM () % 3 + RANDOM () % 3 + 2 : RANDOM () % level + 1; |
1304 | int book_entries = level > 5 ? RANDOM () % 3 + RANDOM () % 3 + 2 : RANDOM () % level + 1; |
|
|
1305 | const char *ch; |
1379 | char *ch, name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1306 | char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1380 | static char retbuf[BOOK_BUF]; |
1307 | static char retbuf[BOOK_BUF]; |
1381 | object *tmp = NULL; |
1308 | object *tmp = NULL; |
1382 | |
1309 | |
1383 | /* values greater than 5 create msg buffers that are too big! */ |
1310 | /* values greater than 5 create msg buffers that are too big! */ |
1384 | if (book_entries > 5) |
1311 | if (book_entries > 5) |
… | |
… | |
1398 | i++; |
1325 | i++; |
1399 | } |
1326 | } |
1400 | while ((al == NULL) && (i < 10)); |
1327 | while ((al == NULL) && (i < 10)); |
1401 | |
1328 | |
1402 | if (i == 10) /* Unable to find a message */ |
1329 | if (i == 10) /* Unable to find a message */ |
1403 | return ("None"); |
1330 | return "None"; |
1404 | |
1331 | |
1405 | /* There is no reason to start on the artifact list at the begining. Lets |
1332 | /* There is no reason to start on the artifact list at the begining. Lets |
1406 | * take our starting position randomly... */ |
1333 | * take our starting position randomly... */ |
1407 | art = al->items; |
1334 | art = al->items; |
1408 | for (i = RANDOM () % level + RANDOM () % 2 + 1; i > 0; i--) |
1335 | for (i = RANDOM () % level + RANDOM () % 2 + 1; i > 0; i--) |
… | |
… | |
1411 | art = al->items; /* hmm, out of stuff, loop back around */ |
1338 | art = al->items; /* hmm, out of stuff, loop back around */ |
1412 | art = art->next; |
1339 | art = art->next; |
1413 | } |
1340 | } |
1414 | |
1341 | |
1415 | /* the base 'generic' name for our artifact */ |
1342 | /* the base 'generic' name for our artifact */ |
1416 | strcpy (name, art_name_array[index].name); |
1343 | assign (name, art_name_array[index].name); |
1417 | |
1344 | |
1418 | /* Ok, lets print out the contents */ |
1345 | /* Ok, lets print out the contents */ |
1419 | sprintf (retbuf, "Herein %s detailed %s...\n", book_entries > 1 ? "are" : "is", book_entries > 1 ? "some artifacts" : "an artifact"); |
1346 | sprintf (retbuf, "Herein %s detailed %s...\n", book_entries > 1 ? "are" : "is", book_entries > 1 ? "some artifacts" : "an artifact"); |
1420 | |
1347 | |
1421 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1348 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
… | |
… | |
1465 | * level is kinda high */ |
1392 | * level is kinda high */ |
1466 | if (art->item->msg && (RANDOM () % 4 + 1) < level && !((strlen (art->item->msg) + strlen (buf)) > BOOK_BUF)) |
1393 | if (art->item->msg && (RANDOM () % 4 + 1) < level && !((strlen (art->item->msg) + strlen (buf)) > BOOK_BUF)) |
1467 | strcat (buf, art->item->msg); |
1394 | strcat (buf, art->item->msg); |
1468 | |
1395 | |
1469 | /* properties of the artifact */ |
1396 | /* properties of the artifact */ |
1470 | tmp = get_object (); |
1397 | tmp = object::create (); |
1471 | add_abilities (tmp, art->item); |
1398 | add_abilities (tmp, art->item); |
1472 | tmp->type = type; |
1399 | tmp->type = type; |
1473 | SET_FLAG (tmp, FLAG_IDENTIFIED); |
1400 | SET_FLAG (tmp, FLAG_IDENTIFIED); |
1474 | if ((ch = describe_item (tmp, NULL)) != NULL && strlen (ch) > 1) |
1401 | if ((ch = describe_item (tmp, NULL)) != NULL && strlen (ch) > 1) |
1475 | sprintf (buf, "%s Properties of this artifact include: \n %s \n", buf, ch); |
1402 | sprintf (buf, "%s Properties of this artifact include: \n %s \n", buf, ch); |
1476 | free_object (tmp); |
1403 | tmp->destroy (); |
1477 | /* add the buf if it will fit */ |
1404 | /* add the buf if it will fit */ |
1478 | if (!book_overflow (retbuf, buf, booksize)) |
1405 | if (!book_overflow (retbuf, buf, booksize)) |
1479 | strcat (retbuf, buf); |
1406 | strcat (retbuf, buf); |
1480 | else |
1407 | else |
1481 | break; |
1408 | break; |
… | |
… | |
1525 | * or not), and must be within the valid level range. |
1452 | * or not), and must be within the valid level range. |
1526 | */ |
1453 | */ |
1527 | if (at->clone.type == SPELL && at->clone.path_attuned & pnum && |
1454 | if (at->clone.type == SPELL && at->clone.path_attuned & pnum && |
1528 | ((at->clone.stats.grace && prayers) || (at->clone.stats.sp && !prayers)) && (at->clone.level < (level * 8))) |
1455 | ((at->clone.stats.grace && prayers) || (at->clone.stats.sp && !prayers)) && (at->clone.level < (level * 8))) |
1529 | { |
1456 | { |
1530 | strcpy (tmpbuf, at->clone.name); |
1457 | assign (tmpbuf, at->clone.name); |
1531 | |
1458 | |
1532 | if (book_overflow (retbuf, tmpbuf, booksize)) |
1459 | if (book_overflow (retbuf, tmpbuf, booksize)) |
1533 | break; |
1460 | break; |
1534 | else |
1461 | else |
1535 | { |
1462 | { |
… | |
… | |
1553 | strcat (retbuf, "\n"); |
1480 | strcat (retbuf, "\n"); |
1554 | } |
1481 | } |
1555 | return retbuf; |
1482 | return retbuf; |
1556 | } |
1483 | } |
1557 | |
1484 | |
1558 | |
|
|
1559 | |
|
|
1560 | /* formula_msg() - generate a message detailing the properties |
1485 | /* formula_msg() - generate a message detailing the properties |
1561 | * of a randomly selected alchemical formula. |
1486 | * of a randomly selected alchemical formula. |
1562 | */ |
1487 | */ |
1563 | |
|
|
1564 | void |
1488 | void |
1565 | make_formula_book (object *book, int level) |
1489 | make_formula_book (object *book, int level) |
1566 | { |
1490 | { |
1567 | char retbuf[BOOK_BUF], title[MAX_BUF]; |
1491 | char retbuf[BOOK_BUF], title[MAX_BUF]; |
1568 | recipelist *fl; |
1492 | recipelist *fl; |
… | |
… | |
1611 | archetype *at; |
1535 | archetype *at; |
1612 | |
1536 | |
1613 | /* preamble */ |
1537 | /* preamble */ |
1614 | sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill"); |
1538 | sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill"); |
1615 | |
1539 | |
1616 | if ((at = find_archetype (op_name)) != (archetype *) NULL) |
1540 | if ((at = archetype::find (op_name)) != (archetype *) NULL) |
1617 | op_name = at->clone.name; |
1541 | op_name = at->clone.name; |
1618 | else |
1542 | else |
1619 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
1543 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
1620 | |
1544 | |
1621 | /* item name */ |
1545 | /* item name */ |
… | |
… | |
1650 | if (formula->ingred != NULL) |
1574 | if (formula->ingred != NULL) |
1651 | { |
1575 | { |
1652 | linked_char *next; |
1576 | linked_char *next; |
1653 | archetype *at; |
1577 | archetype *at; |
1654 | |
1578 | |
1655 | at = find_archetype (formula->cauldron); |
1579 | at = archetype::find (formula->cauldron); |
1656 | |
1580 | |
1657 | sprintf (retbuf + strlen (retbuf), |
1581 | sprintf (retbuf + strlen (retbuf), |
1658 | " may be made at %s using the following ingredients:\n", at ? query_name (&at->clone) : "an unknown place"); |
1582 | " may be made at %s using the following ingredients:\n", at ? query_name (&at->clone) : "an unknown place"); |
1659 | |
1583 | |
1660 | for (next = formula->ingred; next != NULL; next = next->next) |
1584 | for (next = formula->ingred; next != NULL; next = next->next) |
… | |
… | |
1670 | |
1594 | |
1671 | book->msg = retbuf; |
1595 | book->msg = retbuf; |
1672 | } |
1596 | } |
1673 | } |
1597 | } |
1674 | |
1598 | |
1675 | |
|
|
1676 | /* msgfile_msg() - generate a message drawn randomly from a |
|
|
1677 | * file in lib/. Level currently has no effect on the message |
|
|
1678 | * which is returned. |
|
|
1679 | */ |
|
|
1680 | |
|
|
1681 | char * |
|
|
1682 | msgfile_msg (int level, int booksize) |
|
|
1683 | { |
|
|
1684 | static char retbuf[BOOK_BUF]; |
|
|
1685 | int i, msgnum; |
|
|
1686 | linked_char *msg = NULL; |
|
|
1687 | |
|
|
1688 | /* get a random message for the 'book' from linked list */ |
|
|
1689 | if (nrofmsg > 1) |
|
|
1690 | { |
|
|
1691 | msg = first_msg; |
|
|
1692 | msgnum = RANDOM () % nrofmsg; |
|
|
1693 | for (i = 0; msg && i < nrofmsg && i != msgnum; i++) |
|
|
1694 | msg = msg->next; |
|
|
1695 | } |
|
|
1696 | |
|
|
1697 | if (msg && !book_overflow (retbuf, msg->name, booksize)) |
|
|
1698 | strcpy (retbuf, msg->name); |
|
|
1699 | else |
|
|
1700 | sprintf (retbuf, "\n <undecipherable text>"); |
|
|
1701 | |
|
|
1702 | #ifdef BOOK_MSG_DEBUG |
|
|
1703 | LOG (llevDebug, "\n info_list_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1704 | LOG (llevDebug, " MADE THIS:\n%s\n", retbuf); |
|
|
1705 | #endif |
|
|
1706 | |
|
|
1707 | return retbuf; |
|
|
1708 | } |
|
|
1709 | |
|
|
1710 | |
|
|
1711 | /* god_info_msg() - generate a message detailing the properties |
1599 | /* god_info_msg() - generate a message detailing the properties |
1712 | * of a random god. Used by the book hack. b.t. |
1600 | * of a random god. Used by the book hack. b.t. |
1713 | */ |
1601 | */ |
1714 | |
|
|
1715 | const char * |
1602 | const char * |
1716 | god_info_msg (int level, int booksize) |
1603 | god_info_msg (int level, int booksize) |
1717 | { |
1604 | { |
1718 | static char retbuf[BOOK_BUF]; |
1605 | static char retbuf[BOOK_BUF]; |
1719 | const char *name = NULL; |
1606 | const char *name = NULL; |
… | |
… | |
1755 | const char *enemy = god->title; |
1642 | const char *enemy = god->title; |
1756 | |
1643 | |
1757 | if (enemy) |
1644 | if (enemy) |
1758 | sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); |
1645 | sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); |
1759 | } |
1646 | } |
|
|
1647 | |
1760 | if (level == 3 && RANDOM () % 2) |
1648 | if (level == 3 && RANDOM () % 2) |
1761 | { /* enemy race, what the god's holy word effects */ |
1649 | { /* enemy race, what the god's holy word effects */ |
1762 | const char *enemy = god->slaying; |
1650 | const char *enemy = god->slaying; |
1763 | |
1651 | |
1764 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1652 | if (enemy && !(god->path_denied & PATH_TURNING)) |
… | |
… | |
1773 | else |
1661 | else |
1774 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1662 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1775 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1663 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1776 | } |
1664 | } |
1777 | } |
1665 | } |
|
|
1666 | |
1778 | if (level == 4 && RANDOM () % 2) |
1667 | if (level == 4 && RANDOM () % 2) |
1779 | { /* Priest of god gets these protect,vulnerable... */ |
1668 | { /* Priest of god gets these protect,vulnerable... */ |
1780 | char tmpbuf[MAX_BUF], *cp; |
1669 | char tmpbuf[MAX_BUF]; |
1781 | |
1670 | |
1782 | cp = describe_resistance (god, 1); |
1671 | if (const char *cp = describe_resistance (god, 1)) |
1783 | |
|
|
1784 | if (*cp) |
|
|
1785 | { /* This god does have protections */ |
1672 | { /* This god does have protections */ |
1786 | sprintf (tmpbuf, "%s has a potent aura which is extended\n", name); |
1673 | sprintf (tmpbuf, "%s has a potent aura which is extended\n", name); |
1787 | strcat (tmpbuf, "faithful priests. The effects of this aura include:\n"); |
1674 | strcat (tmpbuf, "faithful priests. The effects of this aura include:\n"); |
1788 | strcat (tmpbuf, cp); |
1675 | strcat (tmpbuf, cp); |
1789 | strcat (buf, tmpbuf); |
1676 | strcat (buf, tmpbuf); |
1790 | strcat (buf, "\n ---\n"); |
1677 | strcat (buf, "\n ---\n"); |
1791 | } |
1678 | } |
1792 | else |
1679 | else |
1793 | sprintf (buf, " "); |
1680 | sprintf (buf, " "); |
1794 | } |
1681 | } |
|
|
1682 | |
1795 | if (level == 5 && RANDOM () % 2) |
1683 | if (level == 5 && RANDOM () % 2) |
1796 | { /* aligned race, summoning */ |
1684 | { /* aligned race, summoning */ |
1797 | const char *race = god->race; /* aligned race */ |
1685 | const char *race = god->race; /* aligned race */ |
1798 | |
1686 | |
1799 | if (race && !(god->path_denied & PATH_SUMMON)) |
1687 | if (race && !(god->path_denied & PATH_SUMMON)) |
… | |
… | |
1807 | else |
1695 | else |
1808 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1696 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1809 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1697 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1810 | } |
1698 | } |
1811 | } |
1699 | } |
|
|
1700 | |
1812 | if (level == 6 && RANDOM () % 2) |
1701 | if (level == 6 && RANDOM () % 2) |
1813 | { /* blessing,curse properties of the god */ |
1702 | { /* blessing,curse properties of the god */ |
1814 | char tmpbuf[MAX_BUF], *cp; |
1703 | char tmpbuf[MAX_BUF]; |
1815 | |
1704 | |
1816 | cp = describe_resistance (god, 1); |
1705 | if (const char *cp = describe_resistance (god, 1)) |
1817 | |
|
|
1818 | if (*cp) |
|
|
1819 | { /* This god does have protections */ |
1706 | { /* This god does have protections */ |
1820 | sprintf (tmpbuf, "\nThe priests of %s are known to be able to \n", name); |
1707 | sprintf (tmpbuf, "\nThe priests of %s are known to be able to \n", name); |
1821 | strcat (tmpbuf, "bestow a blessing which makes the recipient\n"); |
1708 | strcat (tmpbuf, "bestow a blessing which makes the recipient\n"); |
1822 | strcat (tmpbuf, cp); |
1709 | strcat (tmpbuf, cp); |
1823 | strcat (buf, tmpbuf); |
1710 | strcat (buf, tmpbuf); |
… | |
… | |
1825 | } |
1712 | } |
1826 | else |
1713 | else |
1827 | sprintf (buf, " "); |
1714 | sprintf (buf, " "); |
1828 | |
1715 | |
1829 | } |
1716 | } |
|
|
1717 | |
1830 | if (level == 8 && RANDOM () % 2) |
1718 | if (level == 8 && RANDOM () % 2) |
1831 | { /* immunity, holy possession */ |
1719 | { /* immunity, holy possession */ |
1832 | int has_effect = 0, tmpvar; |
1720 | int has_effect = 0, tmpvar; |
1833 | char tmpbuf[MAX_BUF]; |
1721 | char tmpbuf[MAX_BUF]; |
1834 | |
1722 | |
… | |
… | |
1843 | { |
1731 | { |
1844 | has_effect = 1; |
1732 | has_effect = 1; |
1845 | sprintf (tmpbuf + strlen (tmpbuf), "Immunity to %s", attacktype_desc[tmpvar]); |
1733 | sprintf (tmpbuf + strlen (tmpbuf), "Immunity to %s", attacktype_desc[tmpvar]); |
1846 | } |
1734 | } |
1847 | } |
1735 | } |
|
|
1736 | |
1848 | if (has_effect) |
1737 | if (has_effect) |
1849 | { |
1738 | { |
1850 | strcat (buf, tmpbuf); |
1739 | strcat (buf, tmpbuf); |
1851 | strcat (buf, "\n ---\n"); |
1740 | strcat (buf, "\n ---\n"); |
1852 | } |
1741 | } |
1853 | else |
1742 | else |
1854 | sprintf (buf, " "); |
1743 | sprintf (buf, " "); |
1855 | } |
1744 | } |
|
|
1745 | |
1856 | if (level == 12 && RANDOM () % 2) |
1746 | if (level == 12 && RANDOM () % 2) |
1857 | { /* spell paths */ |
1747 | { /* spell paths */ |
1858 | int has_effect = 0, tmpvar; |
1748 | int has_effect = 0, tmpvar; |
1859 | char tmpbuf[MAX_BUF]; |
1749 | char tmpbuf[MAX_BUF]; |
1860 | |
1750 | |
1861 | sprintf (tmpbuf, "\n"); |
1751 | sprintf (tmpbuf, "\n"); |
1862 | sprintf (tmpbuf, "It is rarely known fact that the priests of %s\n", name); |
1752 | sprintf (tmpbuf, "It is rarely known fact that the priests of %s\n", name); |
1863 | strcat (tmpbuf, "are mystically transformed. Effects of this include:\n"); |
1753 | strcat (tmpbuf, "are mystically transformed. Effects of this include:\n"); |
|
|
1754 | |
1864 | if ((tmpvar = god->path_attuned)) |
1755 | if ((tmpvar = god->path_attuned)) |
1865 | { |
1756 | { |
1866 | has_effect = 1; |
1757 | has_effect = 1; |
1867 | DESCRIBE_PATH (tmpbuf, tmpvar, "Attuned"); |
1758 | DESCRIBE_PATH (tmpbuf, tmpvar, "Attuned"); |
1868 | } |
1759 | } |
|
|
1760 | |
1869 | if ((tmpvar = god->path_repelled)) |
1761 | if ((tmpvar = god->path_repelled)) |
1870 | { |
1762 | { |
1871 | has_effect = 1; |
1763 | has_effect = 1; |
1872 | DESCRIBE_PATH (tmpbuf, tmpvar, "Repelled"); |
1764 | DESCRIBE_PATH (tmpbuf, tmpvar, "Repelled"); |
1873 | } |
1765 | } |
|
|
1766 | |
1874 | if ((tmpvar = god->path_denied)) |
1767 | if ((tmpvar = god->path_denied)) |
1875 | { |
1768 | { |
1876 | has_effect = 1; |
1769 | has_effect = 1; |
1877 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1770 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1878 | } |
1771 | } |
|
|
1772 | |
1879 | if (has_effect) |
1773 | if (has_effect) |
1880 | { |
1774 | { |
1881 | strcat (buf, tmpbuf); |
1775 | strcat (buf, tmpbuf); |
1882 | strcat (buf, "\n ---\n"); |
1776 | strcat (buf, "\n ---\n"); |
1883 | } |
1777 | } |
… | |
… | |
1891 | */ |
1785 | */ |
1892 | if (book_overflow (retbuf, buf, booksize)) |
1786 | if (book_overflow (retbuf, buf, booksize)) |
1893 | break; |
1787 | break; |
1894 | else if (strlen (buf) > 1) |
1788 | else if (strlen (buf) > 1) |
1895 | strcat (retbuf, buf); |
1789 | strcat (retbuf, buf); |
|
|
1790 | |
1896 | level--; |
1791 | level--; |
1897 | } |
1792 | } |
|
|
1793 | |
1898 | if (strlen (retbuf) == introlen) |
1794 | if (strlen (retbuf) == introlen) |
1899 | { /* we got no information beyond the preamble! */ |
1795 | { /* we got no information beyond the preamble! */ |
1900 | strcat (retbuf, " [Unfortunately the rest of the information is\n"); |
1796 | strcat (retbuf, " [Unfortunately the rest of the information is\n"); |
1901 | strcat (retbuf, " hopelessly garbled!]\n ---\n"); |
1797 | strcat (retbuf, " hopelessly garbled!]\n ---\n"); |
1902 | } |
1798 | } |
… | |
… | |
1921 | * book is the object we are creating into. |
1817 | * book is the object we are creating into. |
1922 | * If msg_type is a positive value, we use that to determine the |
1818 | * If msg_type is a positive value, we use that to determine the |
1923 | * message type - otherwise a random value is used. |
1819 | * message type - otherwise a random value is used. |
1924 | * |
1820 | * |
1925 | */ |
1821 | */ |
1926 | |
|
|
1927 | void |
1822 | void |
1928 | tailor_readable_ob (object *book, int msg_type) |
1823 | tailor_readable_ob (object *book, int msg_type) |
1929 | { |
1824 | { |
1930 | char msgbuf[BOOK_BUF]; |
1825 | char msgbuf[BOOK_BUF]; |
1931 | int level = book->level ? (RANDOM () % book->level) + 1 : 1; |
1826 | int level = book->level ? (RANDOM () % book->level) + 1 : 1; |
… | |
… | |
1954 | */ |
1849 | */ |
1955 | |
1850 | |
1956 | msg_type = msg_type > 0 ? msg_type : (RANDOM () % 6); |
1851 | msg_type = msg_type > 0 ? msg_type : (RANDOM () % 6); |
1957 | switch (msg_type) |
1852 | switch (msg_type) |
1958 | { |
1853 | { |
1959 | case 1: /* monster attrib */ |
1854 | case 1: /* monster attrib */ |
1960 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1855 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1961 | break; |
1856 | break; |
1962 | case 2: /* artifact attrib */ |
1857 | case 2: /* artifact attrib */ |
1963 | strcpy (msgbuf, artifact_msg (level, book_buf_size)); |
1858 | strcpy (msgbuf, artifact_msg (level, book_buf_size)); |
1964 | break; |
1859 | break; |
1965 | case 3: /* grouping incantations/prayers by path */ |
1860 | case 3: /* grouping incantations/prayers by path */ |
1966 | strcpy (msgbuf, spellpath_msg (level, book_buf_size)); |
1861 | strcpy (msgbuf, spellpath_msg (level, book_buf_size)); |
1967 | break; |
1862 | break; |
1968 | case 4: /* describe an alchemy formula */ |
1863 | case 4: /* describe an alchemy formula */ |
1969 | make_formula_book (book, level); |
1864 | make_formula_book (book, level); |
1970 | /* make_formula_book already gives title */ |
1865 | /* make_formula_book already gives title */ |
1971 | return; |
1866 | return; |
1972 | break; |
1867 | break; |
1973 | case 5: /* bits of information about a god */ |
1868 | case 5: /* bits of information about a god */ |
1974 | strcpy (msgbuf, god_info_msg (level, book_buf_size)); |
1869 | strcpy (msgbuf, god_info_msg (level, book_buf_size)); |
1975 | break; |
1870 | break; |
1976 | case 0: /* use info list in lib/ */ |
1871 | case 0: /* use info list in lib/ */ |
1977 | default: |
1872 | default: |
1978 | strcpy (msgbuf, msgfile_msg (level, book_buf_size)); |
1873 | cfperl_make_book (book, level); |
1979 | break; |
1874 | return; |
1980 | } |
1875 | } |
1981 | |
1876 | |
1982 | strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */ |
1877 | strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */ |
|
|
1878 | |
1983 | if (strlen (msgbuf) > 1) |
1879 | if (strlen (msgbuf) > 1) |
1984 | { |
1880 | { |
1985 | book->msg = msgbuf; |
1881 | book->msg = msgbuf; |
1986 | /* lets give the "book" a new name, which may be a compound word */ |
1882 | /* lets give the "book" a new name, which may be a compound word */ |
1987 | change_book (book, msg_type); |
1883 | change_book (book, msg_type); |
… | |
… | |
2016 | delete title1; |
1912 | delete title1; |
2017 | } |
1913 | } |
2018 | |
1914 | |
2019 | delete tlist; |
1915 | delete tlist; |
2020 | } |
1916 | } |
|
|
1917 | |
2021 | for (lmsg = first_msg; lmsg; lmsg = nextmsg) |
1918 | for (lmsg = first_msg; lmsg; lmsg = nextmsg) |
2022 | { |
1919 | { |
2023 | nextmsg = lmsg->next; |
1920 | nextmsg = lmsg->next; |
2024 | delete lmsg; |
1921 | delete lmsg; |
2025 | } |
1922 | } |
|
|
1923 | |
2026 | for (monlink = first_mon_info; monlink; monlink = nextmon) |
1924 | for (monlink = first_mon_info; monlink; monlink = nextmon) |
2027 | { |
1925 | { |
2028 | nextmon = monlink->next; |
1926 | nextmon = monlink->next; |
2029 | free (monlink); |
1927 | delete monlink; |
2030 | } |
1928 | } |
2031 | } |
1929 | } |
2032 | |
1930 | |
2033 | |
1931 | |
2034 | /***************************************************************************** |
1932 | /***************************************************************************** |