ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/readable.C
(Generate patch)

Comparing deliantra/server/common/readable.C (file contents):
Revision 1.20 by root, Tue Jan 23 01:05:17 2007 UTC vs.
Revision 1.52 by root, Fri Nov 6 13:31:47 2009 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24
25 24
26/* This file contains code relevant to the BOOKS hack -- designed 25/* This file contains code relevant to the BOOKS hack -- designed
27 * to allow randomly occuring messages in non-magical texts. 26 * to allow randomly occuring messages in non-magical texts.
28 */ 27 */
29 28
31 30
32#include <global.h> 31#include <global.h>
33#include <book.h> 32#include <book.h>
34#include <living.h> 33#include <living.h>
35#include <spells.h> 34#include <spells.h>
36
37 35
38/* Define this if you want to archive book titles by contents. 36/* Define this if you want to archive book titles by contents.
39 * This option should enforce UNIQUE combinations of titles,authors and 37 * This option should enforce UNIQUE combinations of titles,authors and
40 * msg contents during and *between* game sessions. 38 * msg contents during and *between* game sessions.
41 * 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
110/* these are needed for creation of a linked list of 108/* these are needed for creation of a linked list of
111 * pointers to all (hostile) monster objects */ 109 * pointers to all (hostile) monster objects */
112 110
113static int nrofmon = 0, need_to_write_bookarchive = 0; 111static int nrofmon = 0, need_to_write_bookarchive = 0;
114 112
115
116/* this is needed to keep track of status of initialisation
117 * of the message file */
118static int nrofmsg = 0;
119
120/* first_msg is the started of the linked list of messages as read from 113/* first_msg is the started of the linked list of messages as read from
121 * the messages file 114 * the messages file
122 */ 115 */
123static linked_char *first_msg = NULL; 116static linked_char *first_msg = NULL;
124 117
125/* 118/*
126 * Spellpath information 119 * Spellpath information
127 */ 120 */
128
129static uint32 spellpathdef[NRSPELLPATHS] = { 121static uint32 spellpathdef[NRSPELLPATHS] = {
130 PATH_PROT, 122 PATH_PROT,
131 PATH_FIRE, 123 PATH_FIRE,
132 PATH_FROST, 124 PATH_FROST,
133 PATH_ELEC, 125 PATH_ELEC,
436 * Be careful to keep the order. If you add readable subtype, add them 428 * Be careful to keep the order. If you add readable subtype, add them
437 * at the bottom of the list. Never delete a subtype because index is used as 429 * at the bottom of the list. Never delete a subtype because index is used as
438 * subtype paramater in arch files! 430 * subtype paramater in arch files!
439 */ 431 */
440static readable_message_type readable_message_types[] = { 432static readable_message_type readable_message_types[] = {
441 /*subtype 0 */ {0, 0}, 433 /*subtype 0 */ {0, 0, "info"},
442 /* book messages subtypes */ 434 /* book messages subtypes */
443 /*subtype 1 */ {MSG_TYPE_BOOK, MSG_TYPE_BOOK_CLASP_1}, 435 /*subtype 1 */ {MSG_TYPE_BOOK, MSG_TYPE_BOOK_CLASP_1, "readable-book-clasp-1"},
444 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_CLASP_2}, 436 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_CLASP_2, "readable-book-clasp-2"},
445 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_ELEGANT_1}, 437 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_ELEGANT_1, "readable-book-elegant-1"},
446 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_ELEGANT_2}, 438 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_ELEGANT_2, "readable-book-elegant-2"},
447 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_QUARTO_1}, 439 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_QUARTO_1, "readable-book-quarto-1"},
448 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_QUARTO_2}, 440 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_QUARTO_2, "readable-book-quarto-2"},
449 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_EVOKER}, 441 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_EVOKER, "readable-book-spell-evocation"},
450 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_PRAYER}, 442 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_PRAYER, "readable-book-spell-praying"},
451 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_PYRO}, 443 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_PYRO, "readable-book-spell-pyromancy"},
452 /*subtype 10 */ {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_SORCERER}, 444 /*subtype 10 */ {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_SORCERER, "readable-book-spell-sorcery"},
453 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_SUMMONER}, 445 {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_SUMMONER, "readable-book-spell-summoning"},
454 /* card messages subtypes */ 446 /* card messages subtypes */
455 {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_1}, 447 {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_1, "readable-card-simple-1"},
456 {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_2}, 448 {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_2, "readable-card-simple-2"},
457 {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_3}, 449 {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_3, "readable-card-simple-3"},
458 {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_1}, 450 {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_1, "readable-card-elegant-1"},
459 {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_2}, 451 {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_2, "readable-card-elegant-2"},
460 {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_3}, 452 {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_3, "readable-card-elegant-3"},
461 {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_1}, 453 {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_1, "readable-card-strange-1"},
462 {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_2}, 454 {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_2, "readable-card-strange-2"},
463 /*subtype 20 */ {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_3}, 455 /*subtype 20 */ {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_3, "readable-card-strange-3"},
464 {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_1}, 456 {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_1, "readable-card-money-1"},
465 {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_2}, 457 {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_2, "readable-card-money-2"},
466 {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_3}, 458 {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_3, "readable-card-money-3"},
467 459
468 /* Paper messages subtypes */ 460 /* Paper messages subtypes */
469 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_1}, 461 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_1, "readable-paper-note-1"},
470 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_2}, 462 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_2, "readable-paper-note-2"},
471 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_3}, 463 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_3, "readable-paper-note-3"},
472 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_OLD_1}, 464 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_OLD_1, "readable-paper-letter-old-1"},
473 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_OLD_2}, 465 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_OLD_2, "readable-paper-letter-old-2"},
474 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_NEW_1}, 466 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_NEW_1, "readable-paper-letter-new-1"},
475 /*subtype 30 */ {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_NEW_2}, 467 /*subtype 30 */ {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_NEW_2, "readable-paper-letter-new-2"},
476 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_ENVELOPE_1}, 468 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_ENVELOPE_1, "readable-paper-envelope-1"},
477 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_ENVELOPE_2}, 469 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_ENVELOPE_2, "readable-paper-envelope-2"},
478 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_OLD_1}, 470 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_OLD_1, "readable-paper-scroll-old-1"},
479 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_OLD_2}, 471 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_OLD_2, "readable-paper-scroll-old-2"},
480 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_NEW_1}, 472 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_NEW_1, "readable-paper-scroll-new-1"},
481 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_NEW_2}, 473 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_NEW_2, "readable-paper-scroll-new-2"},
482 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_MAGIC}, 474 {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_MAGIC, "readable-paper-scroll-magic"},
483 475
484 /* road signs messages subtypes */ 476 /* road signs messages subtypes */
485 {MSG_TYPE_SIGN, MSG_TYPE_SIGN_BASIC}, 477 {MSG_TYPE_SIGN, MSG_TYPE_SIGN_BASIC, "readable-sign-basic"},
486 {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_LEFT}, 478 {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_LEFT, "readable-sign-dir-left"},
487 /*subtype 40 */ {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_RIGHT}, 479 /*subtype 40 */ {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_RIGHT, "readable-sign-dir-right"},
488 {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_BOTH}, 480 {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_BOTH, "readable-sign-dir-both"},
489 481
490 /* stones and monument messages */ 482 /* stones and monument messages */
491 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_1}, 483 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_1, "readable-monument-stone-1"},
492 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_2}, 484 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_2, "readable-monument-stone-2"},
493 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_3}, 485 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_3, "readable-monument-stone-3"},
494 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_1}, 486 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_1, "readable-monument-statue-1"},
495 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_2}, 487 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_2, "readable-monument-statue-2"},
496 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_3}, 488 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_3, "readable-monument-statue-3"},
497 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_1}, 489 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_1, "readable-monument-gravestone-1"},
498 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_2}, 490 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_2, "readable-monument-gravestone-2"},
499 /*subtype 50 */ {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_3}, 491 /*subtype 50 */ {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_3, "readable-monument-gravestone-3"},
500 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_1}, 492 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_1, "readable-monument-wall-1"},
501 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_2}, 493 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_2, "readable-monument-wall-2"},
502 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_3} 494 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_3, "readable-monument-wall-3"}
503}; 495};
504int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); 496static int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type);
505 497
506static int max_titles[6] = { 498static int max_titles[6] = {
507 ((sizeof (light_book_name) / sizeof (char *)) + (sizeof (heavy_book_name) / sizeof (char *))) * (sizeof (book_author) / sizeof (char *)), 499 ((sizeof (light_book_name) / sizeof (char *)) + (sizeof (heavy_book_name) / sizeof (char *))) * (sizeof (book_author) / sizeof (char *)),
508 (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)), 500 (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)),
509 (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)), 501 (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)),
571 * (shstr.c ?), but the quantity BOOK_BUF will need to be defined. */ 563 * (shstr.c ?), but the quantity BOOK_BUF will need to be defined. */
572 564
573/* nstrtok() - simple routine to return the number of list 565/* nstrtok() - simple routine to return the number of list
574 * items in buf1 as separated by the value of buf2 566 * items in buf1 as separated by the value of buf2
575 */ 567 */
576 568static int
577int
578nstrtok (const char *buf1, const char *buf2) 569nstrtok (const char *buf1, const char *buf2)
579{ 570{
580 char *tbuf, sbuf[12], buf[MAX_BUF]; 571 char *tbuf, sbuf[12], buf[MAX_BUF];
581 int number = 0; 572 int number = 0;
582 573
595 586
596/* strtoktolin() - takes a string in buf1 and separates it into 587/* strtoktolin() - takes a string in buf1 and separates it into
597 * a list of strings delimited by buf2. Then returns a comma 588 * a list of strings delimited by buf2. Then returns a comma
598 * separated string w/ decent punctuation. 589 * separated string w/ decent punctuation.
599 */ 590 */
600 591static char *
601char *
602strtoktolin (const char *buf1, const char *buf2) 592strtoktolin (const char *buf1, const char *buf2)
603{ 593{
604 int maxi, i = nstrtok (buf1, buf2); 594 int maxi, i = nstrtok (buf1, buf2);
605 char *tbuf, buf[MAX_BUF], sbuf[12]; 595 char *tbuf, buf[MAX_BUF], sbuf[12];
606 static char rbuf[BOOK_BUF]; 596 static char rbuf[BOOK_BUF];
623 tbuf = strtok (NULL, sbuf); 613 tbuf = strtok (NULL, sbuf);
624 } 614 }
625 return (char *) rbuf; 615 return (char *) rbuf;
626} 616}
627 617
628int
629book_overflow (const char *buf1, const char *buf2, int booksize)
630{
631
632 if (buf_overflow (buf1, buf2, BOOK_BUF - 2) /* 2 less so always room for trailing \n */
633 || buf_overflow (buf1, buf2, booksize))
634 return 1;
635 return 0;
636
637
638}
639
640/***************************************************************************** 618/*****************************************************************************
641 * 619 *
642 * Start of initialisation related functions. 620 * Start of initialisation related functions.
643 * 621 *
644 ****************************************************************************/ 622 ****************************************************************************/
645 623
646/* init_msgfile() - if not called before, initialise the info list
647 * reads the messages file into the list pointed to by first_msg
648*/
649
650static void
651init_msgfile (void)
652{
653 FILE *fp;
654 char buf[MAX_BUF], msgbuf[HUGE_BUF], fname[MAX_BUF], *cp;
655 int comp;
656 static int did_init_msgfile;
657
658 if (did_init_msgfile)
659 return;
660 did_init_msgfile = 1;
661
662 sprintf (fname, "%s/messages", settings.datadir);
663 LOG (llevDebug, "Reading messages from %s...\n", fname);
664
665 if ((fp = open_and_uncompress (fname, 0, &comp)) != NULL)
666 {
667 linked_char *tmp = NULL;
668
669 while (fgets (buf, MAX_BUF, fp) != NULL)
670 {
671 if (*buf == '#')
672 continue;
673 if ((cp = strchr (buf, '\n')) != NULL)
674 *cp = '\0';
675 cp = buf;
676 while (*cp == ' ') /* Skip blanks */
677 cp++;
678 if (!strncmp (cp, "ENDMSG", 6))
679 {
680 if (strlen (msgbuf) > BOOK_BUF)
681 {
682 LOG (llevDebug, "Warning: this string exceeded max book buf size:");
683 LOG (llevDebug, " %s\n", msgbuf);
684 }
685 tmp->name = msgbuf;
686 tmp->next = first_msg;
687 first_msg = tmp;
688 nrofmsg++;
689 continue;
690 }
691 else if (!strncmp (cp, "MSG", 3))
692 {
693 tmp = new linked_char;
694
695 strcpy (msgbuf, " "); /* reset msgbuf for new message */
696 continue;
697 }
698 else if (!buf_overflow (msgbuf, cp, HUGE_BUF - 1))
699 {
700 strcat (msgbuf, cp);
701 strcat (msgbuf, "\n");
702 }
703 }
704 close_and_delete (fp, comp);
705 }
706
707#ifdef BOOK_MSG_DEBUG
708 LOG (llevDebug, "init_info_listfile() got %d messages.\n", nrofmsg);
709#endif
710 LOG (llevDebug, "done.\n");
711}
712
713
714/* init_book_archive() - if not called before, initialise the info list 624/* init_book_archive() - if not called before, initialise the info list
715 * This reads in the bookarch file into memory. bookarch is the file 625 * This reads in the bookarch file into memory. bookarch is the file
716 * created and updated across multiple runs of the program. 626 * created and updated across multiple runs of the program.
717 */ 627 */
718
719static void 628static void
720init_book_archive (void) 629init_book_archive (void)
721{ 630{
722 FILE *fp; 631 FILE *fp;
723 int comp, nroftitle = 0; 632 int comp, nroftitle = 0;
806} 715}
807 716
808/* init_mon_info() - creates the linked list of pointers to 717/* init_mon_info() - creates the linked list of pointers to
809 * monster archetype objects if not called previously 718 * monster archetype objects if not called previously
810 */ 719 */
811
812static void 720static void
813init_mon_info (void) 721init_mon_info ()
814{ 722{
815 archetype *at; 723 archetype *at;
816 static int did_init_mon_info = 0; 724 static int did_init_mon_info = 0;
817 725
818 if (did_init_mon_info) 726 if (did_init_mon_info)
819 return; 727 return;
820 728
821 did_init_mon_info = 1; 729 did_init_mon_info = 1;
822 730
823 731 for_all_archetypes (at)
824 for (at = first_archetype; at != NULL; at = at->next) 732 if (at->flag [FLAG_MONSTER]
825 { 733 && at->is_head ()
826 if (QUERY_FLAG (&at->clone, FLAG_MONSTER) && (!QUERY_FLAG (&at->clone, FLAG_CHANGING) || QUERY_FLAG (&at->clone, FLAG_UNAGGRESSIVE))) 734 && (!at->flag [FLAG_CHANGING] || at->flag [FLAG_UNAGGRESSIVE]))
827 { 735 {
828 objectlink *mon = new objectlink; 736 objectlink *mon = new objectlink;
829 737
830 mon->ob = &at->clone; 738 mon->ob = at;
831 mon->next = first_mon_info; 739 mon->next = first_mon_info;
832 first_mon_info = mon; 740 first_mon_info = mon;
833 nrofmon++; 741 nrofmon++;
834 } 742 }
835 }
836 743
837 LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); 744 LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon);
838} 745}
839
840 746
841/* init_readable() - initialise linked lists utilized by 747/* init_readable() - initialise linked lists utilized by
842 * message functions in tailor_readable_ob() 748 * message functions in tailor_readable_ob()
843 * 749 *
844 * This is the function called by the main routine to initialise 750 * This is the function called by the main routine to initialise
845 * all the readable information. 751 * all the readable information.
846 */ 752 */
847
848void 753void
849init_readable (void) 754init_readable (void)
850{ 755{
851 static int did_this; 756 static int did_this;
852 757
854 return; 759 return;
855 760
856 did_this = 1; 761 did_this = 1;
857 762
858 LOG (llevDebug, "Initialising reading data...\n"); 763 LOG (llevDebug, "Initialising reading data...\n");
859 init_msgfile ();
860 init_book_archive (); 764 init_book_archive ();
861 init_mon_info (); 765 init_mon_info ();
862 LOG (llevDebug, " Done\n"); 766 LOG (llevDebug, " Done\n");
863
864} 767}
865 768
866/***************************************************************************** 769/*****************************************************************************
867 * 770 *
868 * This is the start of the administrative functions when creating 771 * This is the start of the administrative functions when creating
869 * new books (ie, updating title and the like) 772 * new books (ie, updating title and the like)
870 * 773 *
871 *****************************************************************************/ 774 *****************************************************************************/
872 775
873
874/* find_title() - Search the titlelist (based on msgtype) to see if 776/* find_title() - Search the titlelist (based on msgtype) to see if
875 * book matches something already there. IF so, return that title. 777 * book matches something already there. IF so, return that title.
876 */ 778 */
877
878static title * 779static title *
879find_title (const object *book, int msgtype) 780find_title (const object *book, int msgtype)
880{ 781{
881 title *t = NULL; 782 title *t = NULL;
882 titlelist *tl = get_titlelist (msgtype); 783 titlelist *tl = get_titlelist (msgtype);
895 else 796 else
896 t = t->next; 797 t = t->next;
897 798
898#ifdef ARCHIVE_DEBUG 799#ifdef ARCHIVE_DEBUG
899 if (t) 800 if (t)
900 LOG (llevDebug, "Found title match (list %d): %s %s (%d)\n", msgtype, t->name, t->authour, t->msg_index); 801 LOG (llevDebug, "Found title match (list %d): %s %s (%d)\n", msgtype, &t->name, &t->authour, t->msg_index);
901#endif 802#endif
902 803
903 return t; 804 return t;
904} 805}
905 806
907 * handled directly in change_book_name(). Names are based on text 808 * handled directly in change_book_name(). Names are based on text
908 * msgtype 809 * msgtype
909 * this sets book book->name based on msgtype given. What name 810 * this sets book book->name based on msgtype given. What name
910 * is given is based on various criteria 811 * is given is based on various criteria
911 */ 812 */
912
913static void 813static void
914new_text_name (object *book, int msgtype) 814new_text_name (object *book, int msgtype)
915{ 815{
916 int nbr; 816 int nbr;
917 char name[MAX_BUF]; 817 char name[MAX_BUF];
919 if (book->type != BOOK) 819 if (book->type != BOOK)
920 return; 820 return;
921 821
922 switch (msgtype) 822 switch (msgtype)
923 { 823 {
924 case 1: /*monster */ 824 case 1: /*monster */
925 nbr = sizeof (mon_book_name) / sizeof (char *); 825 nbr = sizeof (mon_book_name) / sizeof (char *);
926 strcpy (name, mon_book_name[rndm (nbr)]); 826 assign (name, mon_book_name[rndm (nbr)]);
927 break; 827 break;
928 case 2: /*artifact */ 828 case 2: /*artifact */
929 nbr = sizeof (art_book_name) / sizeof (char *); 829 nbr = sizeof (art_book_name) / sizeof (char *);
930 strcpy (name, art_book_name[rndm (nbr)]); 830 assign (name, art_book_name[rndm (nbr)]);
931 break; 831 break;
932 case 3: /*spellpath */ 832 case 3: /*spellpath */
933 nbr = sizeof (path_book_name) / sizeof (char *); 833 nbr = sizeof (path_book_name) / sizeof (char *);
934 strcpy (name, path_book_name[rndm (nbr)]); 834 assign (name, path_book_name[rndm (nbr)]);
935 break; 835 break;
936 case 4: /*alchemy */ 836 case 4: /*alchemy */
937 nbr = sizeof (formula_book_name) / sizeof (char *); 837 nbr = sizeof (formula_book_name) / sizeof (char *);
938 strcpy (name, formula_book_name[rndm (nbr)]); 838 assign (name, formula_book_name[rndm (nbr)]);
939 break; 839 break;
940 case 5: /*gods */ 840 case 5: /*gods */
941 nbr = sizeof (gods_book_name) / sizeof (char *); 841 nbr = sizeof (gods_book_name) / sizeof (char *);
942 strcpy (name, gods_book_name[rndm (nbr)]); 842 assign (name, gods_book_name[rndm (nbr)]);
943 break; 843 break;
944 case 6: /*msg file */ 844 case 6: /*msg file */
945 default: 845 default:
946 if (book->weight > 2000) 846 if (book->weight > 2000)
947 { /* based on weight */ 847 { /* based on weight */
948 nbr = sizeof (heavy_book_name) / sizeof (char *); 848 nbr = sizeof (heavy_book_name) / sizeof (char *);
949 strcpy (name, heavy_book_name[rndm (nbr)]); 849 assign (name, heavy_book_name[rndm (nbr)]);
950 } 850 }
951 else if (book->weight < 2001) 851 else if (book->weight < 2001)
952 { 852 {
953 nbr = sizeof (light_book_name) / sizeof (char *); 853 nbr = sizeof (light_book_name) / sizeof (char *);
954 strcpy (name, light_book_name[rndm (nbr)]); 854 assign (name, light_book_name[rndm (nbr)]);
955 } 855 }
956 break; 856 break;
957 } 857 }
958 858
959 book->name = name; 859 book->name = name;
960} 860}
961 861
973 if (msgtype < 0 || strlen (op->msg) < 5) 873 if (msgtype < 0 || strlen (op->msg) < 5)
974 return; 874 return;
975 875
976 switch (msgtype) 876 switch (msgtype)
977 { 877 {
978 case 1: /* monster */ 878 case 1: /* monster */
979 nbr = sizeof (mon_author) / sizeof (char *); 879 nbr = sizeof (mon_author) / sizeof (char *);
980 strcpy (name, mon_author[rndm (nbr)]); 880 assign (name, mon_author[rndm (nbr)]);
981 break; 881 break;
982 case 2: /* artifacts */ 882 case 2: /* artifacts */
983 nbr = sizeof (art_author) / sizeof (char *); 883 nbr = sizeof (art_author) / sizeof (char *);
984 strcpy (name, art_author[rndm (nbr)]); 884 assign (name, art_author[rndm (nbr)]);
985 break; 885 break;
986 case 3: /* spellpath */ 886 case 3: /* spellpath */
987 nbr = sizeof (path_author) / sizeof (char *); 887 nbr = sizeof (path_author) / sizeof (char *);
988 strcpy (name, path_author[rndm (nbr)]); 888 assign (name, path_author[rndm (nbr)]);
989 break; 889 break;
990 case 4: /* alchemy */ 890 case 4: /* alchemy */
991 nbr = sizeof (formula_author) / sizeof (char *); 891 nbr = sizeof (formula_author) / sizeof (char *);
992 strcpy (name, formula_author[rndm (nbr)]); 892 assign (name, formula_author[rndm (nbr)]);
993 break; 893 break;
994 case 5: /* gods */ 894 case 5: /* gods */
995 nbr = sizeof (gods_author) / sizeof (char *); 895 nbr = sizeof (gods_author) / sizeof (char *);
996 strcpy (name, gods_author[rndm (nbr)]); 896 assign (name, gods_author[rndm (nbr)]);
997 break; 897 break;
998 case 6: /* msg file */ 898 case 6: /* msg file */
999 default: 899 default:
1000 strcpy (name, book_author[rndm (nbr)]); 900 assign (name, book_author[rndm (nbr)]);
1001 } 901 }
1002 902
1003 sprintf (title, "of %s", name); 903 sprintf (title, "of %s", name);
1004 op->title = title; 904 op->title = title;
1005} 905}
1010 */ 910 */
1011 911
1012static int 912static int
1013unique_book (const object *book, int msgtype) 913unique_book (const object *book, int msgtype)
1014{ 914{
1015 title *test;
1016
1017 if (!booklist) 915 if (!booklist)
1018 return 1; /* No archival entries! Must be unique! */ 916 return 1; /* No archival entries! Must be unique! */
1019 917
1020 /* Go through the booklist. If the author and name match, not unique so 918 /* Go through the booklist. If the author and name match, not unique so
1021 * return 0. 919 * return 0.
1022 */ 920 */
1023 for (test = get_titlelist (msgtype)->first_book; test; test = test->next) 921 for (title *test = get_titlelist (msgtype)->first_book; test; test = test->next)
1024 {
1025 if (!strcmp (test->name, book->name) && !strcmp (book->title, test->authour)) 922 if (test->name == book->name && book->title == test->authour)
1026 return 0; 923 return 0;
1027 } 924
1028 return 1; 925 return 1;
1029} 926}
1030 927
1031/* add_book_to_list() */ 928/* add_book_to_list() */
1032 929
1045 t = get_empty_book (); 942 t = get_empty_book ();
1046 t->name = book->name; 943 t->name = book->name;
1047 t->authour = book->title; 944 t->authour = book->title;
1048 t->size = strlen (book->msg); 945 t->size = strlen (book->msg);
1049 t->msg_index = strtoint (book->msg); 946 t->msg_index = strtoint (book->msg);
1050 t->archname = book->arch->name; 947 t->archname = book->arch->archname;
1051 t->level = book->level; 948 t->level = book->level;
1052 949
1053 t->next = tl->first_book; 950 t->next = tl->first_book;
1054 tl->first_book = t; 951 tl->first_book = t;
1055 tl->number++; 952 tl->number++;
1056 953
1057 /* We have stuff we need to write now */ 954 /* We have stuff we need to write now */
1058 need_to_write_bookarchive = 1; 955 need_to_write_bookarchive = 1;
1059 956
1060#ifdef ARCHIVE_DEBUG 957#ifdef ARCHIVE_DEBUG
1061 LOG (llevDebug, "Archiving new title: %s %s (%d)\n", book->name, book->title, msgtype); 958 LOG (llevDebug, "Archiving new title: %s %s (%d)\n", &book->name, &book->title, msgtype);
1062#endif 959#endif
1063 960
1064} 961}
1065 962
1066 963
1072 * levels and architypes. -b.t. 969 * levels and architypes. -b.t.
1073 */ 970 */
1074 971
1075#define MAX_TITLE_CHECK 20 972#define MAX_TITLE_CHECK 20
1076 973
1077void 974static void
1078change_book (object *book, int msgtype) 975change_book (object *book, int msgtype)
1079{ 976{
1080 int nbr = sizeof (book_descrpt) / sizeof (char *); 977 int nbr = sizeof (book_descrpt) / sizeof (char *);
1081 978
1082 switch (book->type) 979 switch (book->type)
1083 { 980 {
1084 case BOOK: 981 case BOOK:
1085 { 982 {
1086 titlelist *tl = get_titlelist (msgtype); 983 titlelist *tl = get_titlelist (msgtype);
1087 title *t = NULL; 984 title *t = NULL;
1088 int tries = 0; 985 int tries = 0;
1089 986
1090 /* look to see if our msg already been archived. If so, alter 987 /* look to see if our msg already been archived. If so, alter
1091 * the book to match the archival text. If we fail to match, 988 * the book to match the archival text. If we fail to match,
1092 * then we archive the new title/name/msg combo if there is 989 * then we archive the new title/name/msg combo if there is
1093 * room on the titlelist. 990 * room on the titlelist.
1094 */ 991 */
1095 992
1096 if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) 993 if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype)))
1097 { 994 {
1098 object *tmpbook;
1099
1100 /* alter book properties */ 995 /* alter book properties */
1101 if ((tmpbook = get_archetype (t->archname)) != NULL) 996 if (object *tmpbook = get_archetype (t->archname))
997 {
998 tmpbook->msg = book->msg;
999 tmpbook->copy_to (book);
1000 tmpbook->destroy ();
1001 }
1002
1003 book->title = t->authour;
1004 book->name = t->name;
1005 book->level = t->level;
1006 }
1007 /* Don't have any default title, so lets make up a new one */
1008 else
1009 {
1010 int numb, maxnames = max_titles[msgtype];
1011 const char *old_title;
1012 const char *old_name;
1013
1014 old_title = book->title;
1015 old_name = book->name;
1016
1017 /* some pre-generated books have title already set (from
1018 * maps), also don't bother looking for unique title if
1019 * we already used up all the available names! */
1020
1021 if (!tl)
1022 {
1023 LOG (llevError, "change_book_name(): can't find title list\n");
1024 numb = 0;
1025 }
1026 else
1027 numb = tl->number;
1028
1029 if (numb == maxnames)
1030 {
1031#ifdef ARCHIVE_DEBUG
1032 LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames);
1033#endif
1034 }
1035 /* shouldnt change map-maker books */
1036 else if (!book->title)
1037 do
1102 { 1038 {
1103 tmpbook->msg = book->msg; 1039 /* random book name */
1104 tmpbook->copy_to (book); 1040 new_text_name (book, msgtype);
1105 tmpbook->destroy (); 1041 add_author (book, msgtype); /* random author */
1042 tries++;
1106 } 1043 }
1044 while (!unique_book (book, msgtype) && tries < MAX_TITLE_CHECK);
1107 1045
1108 book->title = t->authour; 1046 /* Now deal with 2 cases.
1109 book->name = t->name; 1047 * 1)If no space for a new title exists lets just restore
1110 book->level = t->level; 1048 * the old book properties. Remember, if the book had
1049 * matchd an older entry on the titlelist, we shouldnt
1050 * have called this routine in the first place!
1051 * 2) If we got a unique title, we need to add it to
1052 * the list.
1111 } 1053 */
1112 /* Don't have any default title, so lets make up a new one */
1113 else
1114 {
1115 int numb, maxnames = max_titles[msgtype];
1116 const char *old_title;
1117 const char *old_name;
1118 1054
1119 old_title = book->title; 1055 if (tries == MAX_TITLE_CHECK || numb == maxnames)
1120 old_name = book->name; 1056 { /* got to check maxnames again */
1121
1122 /* some pre-generated books have title already set (from
1123 * maps), also don't bother looking for unique title if
1124 * we already used up all the available names! */
1125
1126 if (!tl)
1127 {
1128 LOG (llevError, "change_book_name(): can't find title list\n");
1129 numb = 0;
1130 }
1131 else
1132 numb = tl->number;
1133
1134 if (numb == maxnames)
1135 {
1136#ifdef ARCHIVE_DEBUG 1057#ifdef ARCHIVE_DEBUG
1137 LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); 1058 LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", &book->name, &book->title, numb, maxnames);
1138#endif 1059#endif
1139 break; 1060 /* restore old book properties here */
1140 } 1061 book->title = old_title;
1141 /* shouldnt change map-maker books */ 1062
1142 else if (!book->title) 1063 if (rndm (4))
1143 do
1144 { 1064 {
1145 /* random book name */ 1065 /* Lets give the book a description to individualize it some */
1146 new_text_name (book, msgtype); 1066 char new_name[MAX_BUF];
1147 add_author (book, msgtype); /* random author */ 1067
1148 tries++; 1068 snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name);
1069
1070 book->name = new_name;
1149 } 1071 }
1150 while (!unique_book (book, msgtype) && tries < MAX_TITLE_CHECK);
1151
1152 /* Now deal with 2 cases.
1153 * 1)If no space for a new title exists lets just restore
1154 * the old book properties. Remember, if the book had
1155 * matchd an older entry on the titlelist, we shouldnt
1156 * have called this routine in the first place!
1157 * 2) If we got a unique title, we need to add it to
1158 * the list.
1159 */
1160
1161 if (tries == MAX_TITLE_CHECK || numb == maxnames)
1162 { /* got to check maxnames again */
1163#ifdef ARCHIVE_DEBUG
1164 LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames);
1165#endif
1166 /* restore old book properties here */
1167 book->title = old_title;
1168
1169 if (RANDOM () % 4)
1170 {
1171 /* Lets give the book a description to individualize it some */
1172 char new_name[MAX_BUF];
1173
1174 snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name);
1175
1176 book->name = new_name;
1177 }
1178 else 1072 else
1179 { 1073 {
1180 book->name = old_name; 1074 book->name = old_name;
1181 } 1075 }
1182 } 1076 }
1183 else if (book->title && strlen (book->msg) > 5) 1077 else if (book->title && strlen (book->msg) > 5)
1184 { /* archive if long msg texts */ 1078 { /* archive if long msg texts */
1185 add_book_to_list (book, msgtype); 1079 add_book_to_list (book, msgtype);
1186 } 1080 }
1187 } 1081 }
1188 break; 1082 break;
1189 } 1083 }
1190 1084
1191 default: 1085 default:
1192 LOG (llevError, "change_book_name() called w/ illegal obj type.\n"); 1086 LOG (llevError, "change_book_name() called w/ illegal obj type.\n");
1193 return; 1087 return;
1194 } 1088 }
1195} 1089}
1196 1090
1197/***************************************************************************** 1091/*****************************************************************************
1198 * 1092 *
1209 * list of all monsters in the current game. If level is non-zero, 1103 * list of all monsters in the current game. If level is non-zero,
1210 * then only monsters greater than that level will be returned. 1104 * then only monsters greater than that level will be returned.
1211 * Changed 971225 to be greater than equal to level passed. Also 1105 * Changed 971225 to be greater than equal to level passed. Also
1212 * made choosing by level more random. 1106 * made choosing by level more random.
1213 */ 1107 */
1214
1215object * 1108object *
1216get_random_mon (int level) 1109get_random_mon (int level)
1217{ 1110{
1218 objectlink *mon = first_mon_info; 1111 objectlink *mon = first_mon_info;
1219 int i = 0, monnr; 1112 int i = 0, monnr;
1223 return (object *) NULL; 1116 return (object *) NULL;
1224 1117
1225 if (!level) 1118 if (!level)
1226 { 1119 {
1227 /* lets get a random monster from the mon_info linked list */ 1120 /* lets get a random monster from the mon_info linked list */
1228 monnr = RANDOM () % nrofmon; 1121 monnr = rndm (nrofmon);
1229 1122
1230 for (mon = first_mon_info, i = 0; mon; mon = mon->next) 1123 for (mon = first_mon_info, i = 0; mon; mon = mon->next)
1231 if (i++ == monnr) 1124 if (i++ == monnr)
1232 break; 1125 break;
1233 1126
1260 { 1153 {
1261 LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level); 1154 LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level);
1262 return NULL; 1155 return NULL;
1263 } 1156 }
1264 1157
1265 monnr = RANDOM () % i; 1158 monnr = rndm (i);
1266 for (mon = first_mon_info; mon; mon = mon->next) 1159 for (mon = first_mon_info; mon; mon = mon->next)
1267 if (mon->ob->level >= level && monnr-- == 0) 1160 if (mon->ob->level >= level && monnr-- == 0)
1268 return mon->ob; 1161 return mon->ob;
1269 1162
1270 if (!mon) 1163 if (!mon)
1277 1170
1278/* 1171/*
1279 * Returns a description of the monster. This really needs to be 1172 * Returns a description of the monster. This really needs to be
1280 * redone, as describe_item really gives a pretty internal description. 1173 * redone, as describe_item really gives a pretty internal description.
1281 */ 1174 */
1282 1175static const char *
1283char *
1284mon_desc (const object *mon) 1176mon_desc (const object *mon)
1285{ 1177{
1286 static char retbuf[HUGE_BUF]; 1178 static dynbuf_text buf; buf.clear ();
1287 1179
1288 sprintf (retbuf, " *** %s ***\n", &mon->name); 1180 buf.printf ("B<< %s >>\r", &mon->name);
1289 strcat (retbuf, describe_item (mon, NULL)); 1181 buf << describe_item (mon, 0);
1290 1182
1291 return retbuf; 1183 return buf;
1292} 1184}
1293 1185
1294 1186
1295/* This function returns the next monsters after 'tmp'. If no match is 1187/* This function returns the next monsters after 'tmp'. If no match is
1296 * found, it returns NULL (changed 0.94.3 to do this, since the 1188 * found, it returns NULL (changed 0.94.3 to do this, since the
1297 * calling function (mon_info_msg) seems to expect that. 1189 * calling function (mon_info_msg) seems to expect that.
1298 */ 1190 */
1299 1191static object *
1300object *
1301get_next_mon (object *tmp) 1192get_next_mon (object *tmp)
1302{ 1193{
1303 objectlink *mon; 1194 objectlink *mon;
1304 1195
1305 for (mon = first_mon_info; mon; mon = mon->next) 1196 for (mon = first_mon_info; mon; mon = mon->next)
1307 break; 1198 break;
1308 1199
1309 /* didn't find a match */ 1200 /* didn't find a match */
1310 if (!mon) 1201 if (!mon)
1311 return NULL; 1202 return NULL;
1203
1312 if (mon->next) 1204 if (mon->next)
1313 return mon->next->ob; 1205 return mon->next->ob;
1314 else 1206 else
1315 return first_mon_info->ob; 1207 return first_mon_info->ob;
1316 1208
1317} 1209}
1318 1210
1319
1320
1321/* mon_info_msg() - generate a message detailing the properties 1211/* mon_info_msg() - generate a message detailing the properties
1322 * of a randomly selected monster. 1212 * of a randomly selected monster.
1323 */ 1213 */
1324 1214static const char *
1325char *
1326mon_info_msg (int level, int booksize) 1215mon_info_msg (int level)
1327{ 1216{
1328 static char retbuf[BOOK_BUF]; 1217 static dynbuf_text buf; buf.clear ();
1329 char tmpbuf[HUGE_BUF];
1330 object *tmp;
1331 1218
1332 /*preamble */ 1219 /*preamble */
1333 strcpy (retbuf, "This beastiary contains:"); 1220 buf << "This beastiary contains:\n";
1334 1221
1335 /* lets print info on as many monsters as will fit in our 1222 /* lets print info on as many monsters as will fit in our
1336 * document. 1223 * document.
1337 * 8-96 Had to change this a bit, otherwise there would 1224 * 8-96 Had to change this a bit, otherwise there would
1338 * have been an impossibly large number of combinations 1225 * have been an impossibly large number of combinations
1339 * of text! (and flood out the available number of titles 1226 * of text! (and flood out the available number of titles
1340 * in the archive in a snap!) -b.t. 1227 * in the archive in a snap!) -b.t.
1341 */ 1228 */
1342 tmp = get_random_mon (level * 3); 1229 object *tmp = get_random_mon (level * 3);
1343 while (tmp) 1230 while (tmp && buf.size () < BOOK_BUF)
1344 { 1231 {
1345 /* monster description */ 1232 /* monster description */
1346 sprintf (tmpbuf, "\n---\n%s", mon_desc (tmp)); 1233 buf.printf ("\n%s\n", mon_desc (tmp));
1347
1348 if (!book_overflow (retbuf, tmpbuf, booksize))
1349 strcat (retbuf, tmpbuf);
1350 else
1351 break;
1352 1234
1353 /* Note that the value this returns is not based on level */ 1235 /* Note that the value this returns is not based on level */
1354 tmp = get_next_mon (tmp); 1236 tmp = get_next_mon (tmp);
1355 } 1237 }
1356 1238
1357#ifdef BOOK_MSG_DEBUG
1358 LOG (llevDebug, "\n mon_info_msg() created strng: %d\n", strlen (retbuf));
1359 fprintf (logfile, " MADE THIS:\n%s\n", retbuf);
1360#endif
1361
1362 return retbuf; 1239 return buf;
1363} 1240}
1364 1241
1365 1242
1366/***************************************************************************** 1243/*****************************************************************************
1367 * Artifact msg generation code. 1244 * Artifact msg generation code.
1368 ****************************************************************************/ 1245 ****************************************************************************/
1369 1246
1370/* artifact_msg() - generate a message detailing the properties 1247/* artifact_msg() - generate a message detailing the properties
1371 * of 1-6 artifacts drawn sequentially from the artifact list. 1248 * of 1-6 artifacts drawn sequentially from the artifact list.
1372 */ 1249 */
1373 1250static const char *
1374char *
1375artifact_msg (int level, int booksize) 1251artifact_msg (int level)
1376{ 1252{
1377 artifactlist *al = NULL; 1253 artifactlist *al = NULL;
1378 artifact *art; 1254 artifact *art;
1379 int chance, i, type, index; 1255 int chance, i, type, index;
1380 int book_entries = level > 5 ? RANDOM () % 3 + RANDOM () % 3 + 2 : RANDOM () % level + 1; 1256 int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1;
1381 char *ch, name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; 1257 const char *ch;
1382 static char retbuf[BOOK_BUF]; 1258 char name[MAX_BUF];
1383 object *tmp = NULL; 1259 object *tmp = NULL;
1260
1261 static dynbuf_text buf; buf.clear ();
1384 1262
1385 /* values greater than 5 create msg buffers that are too big! */ 1263 /* values greater than 5 create msg buffers that are too big! */
1386 if (book_entries > 5) 1264 if (book_entries > 5)
1387 book_entries = 5; 1265 book_entries = 5;
1388 1266
1392 * for that type exists! 1270 * for that type exists!
1393 */ 1271 */
1394 i = 0; 1272 i = 0;
1395 do 1273 do
1396 { 1274 {
1397 index = RANDOM () % (sizeof (art_name_array) / sizeof (arttypename)); 1275 index = rndm (sizeof (art_name_array) / sizeof (arttypename));
1398 type = art_name_array[index].type; 1276 type = art_name_array[index].type;
1399 al = find_artifactlist (type); 1277 al = find_artifactlist (type);
1400 i++; 1278 i++;
1401 } 1279 }
1402 while ((al == NULL) && (i < 10)); 1280 while ((al == NULL) && (i < 10));
1403 1281
1404 if (i == 10) /* Unable to find a message */ 1282 if (i == 10) /* Unable to find a message */
1405 return ("None"); 1283 return "None";
1406 1284
1407 /* There is no reason to start on the artifact list at the begining. Lets 1285 /* There is no reason to start on the artifact list at the begining. Lets
1408 * take our starting position randomly... */ 1286 * take our starting position randomly... */
1409 art = al->items; 1287 art = al->items;
1410 for (i = RANDOM () % level + RANDOM () % 2 + 1; i > 0; i--) 1288 for (i = rndm (level) + rndm (2) + 1; i > 0; i--)
1411 { 1289 {
1412 if (art == NULL) 1290 if (!art)
1413 art = al->items; /* hmm, out of stuff, loop back around */ 1291 art = al->items; /* hmm, out of stuff, loop back around */
1292
1414 art = art->next; 1293 art = art->next;
1415 } 1294 }
1416 1295
1417 /* the base 'generic' name for our artifact */ 1296 /* the base 'generic' name for our artifact */
1418 strcpy (name, art_name_array[index].name); 1297 assign (name, art_name_array[index].name);
1419 1298
1420 /* Ok, lets print out the contents */ 1299 /* Ok, lets print out the contents */
1421 sprintf (retbuf, "Herein %s detailed %s...\n", book_entries > 1 ? "are" : "is", book_entries > 1 ? "some artifacts" : "an artifact"); 1300 buf.printf ("Herein %s detailed %s...\n",
1301 book_entries > 1 ? "are" : "is",
1302 book_entries > 1 ? "some artifacts" : "an artifact");
1422 1303
1423 /* artifact msg attributes loop. Lets keep adding entries to the 'book' 1304 /* artifact msg attributes loop. Lets keep adding entries to the 'book'
1424 * as long as we have space up to the allowed max # (book_entires) 1305 * as long as we have space up to the allowed max # (book_entires)
1425 */ 1306 */
1426 while (book_entries > 0) 1307 while (book_entries > 0 && buf.size () < BOOK_BUF)
1427 { 1308 {
1428 1309
1429 if (art == NULL) 1310 if (!art)
1430 art = al->items; 1311 art = al->items;
1431 1312
1432 /* separator of items */ 1313 buf << '\n';
1433 strcpy (buf, "--- \n");
1434 1314
1435 /* Name */ 1315 /* Name */
1436 if (art->allowed != NULL && strcmp (art->allowed->name, "All")) 1316 if (art->allowed && art->allowed->name != shstr_All)
1437 { 1317 {
1438 linked_char *temp, *next = art->allowed; 1318 linked_char *temp, *next = art->allowed;
1439 1319
1440 do 1320 do
1441 { 1321 {
1442 temp = next; 1322 temp = next;
1443 next = next->next; 1323 next = next->next;
1444 } 1324 }
1445 while (next && !RANDOM () % 2); 1325 while (next && rndm (2));
1326
1446 sprintf (buf, "%s A %s of %s", buf, &temp->name, &art->item->name); 1327 buf.printf ("A B<< %s of %s >>", &temp->name, &art->item->name);
1447 } 1328 }
1448 else /* default name is used */ 1329 else /* default name is used */
1449 sprintf (buf, "%s The %s of %s", buf, name, &art->item->name); 1330 buf.printf ("The B<< %s of %s >>", name, &art->item->name);
1331
1332 buf << " is ";
1450 1333
1451 /* chance of finding */ 1334 /* chance of finding */
1452 chance = (int) (100 * ((float) art->chance / al->total_chance)); 1335 chance = (int) (100 * ((float) art->chance / al->total_chance));
1453 if (chance >= 20) 1336 if (chance >= 20)
1454 sprintf (sbuf, "an uncommon"); 1337 buf << "an uncommon";
1455 else if (chance >= 10) 1338 else if (chance >= 10)
1456 sprintf (sbuf, "an unusual"); 1339 buf << "an unusual";
1457 else if (chance >= 5) 1340 else if (chance >= 5)
1458 sprintf (sbuf, "a rare"); 1341 buf << "a rare";
1459 else 1342 else
1460 sprintf (sbuf, "a very rare"); 1343 buf << "a very rare";
1461 sprintf (buf, "%s is %s\n", buf, sbuf);
1462 1344
1463 /* value of artifact */ 1345 /* value of artifact */
1464 sprintf (buf, "%s item with a value that is %d times normal.\n", buf, art->item->value); 1346 buf << " item with a value that is " << art->item->value << " times normal.\n";
1465 1347
1466 /* include the message about the artifact, if exists, and book 1348 /* include the message about the artifact, if exists, and book
1467 * level is kinda high */ 1349 * level is kinda high */
1468 if (art->item->msg && (RANDOM () % 4 + 1) < level && !((strlen (art->item->msg) + strlen (buf)) > BOOK_BUF)) 1350 if (art->item->msg
1351 && rndm (4) + 1 < level)
1469 strcat (buf, art->item->msg); 1352 buf << art->item->msg;
1470 1353
1471 /* properties of the artifact */ 1354 /* properties of the artifact */
1472 tmp = object::create (); 1355 tmp = object::create ();
1473 add_abilities (tmp, art->item); 1356 add_abilities (tmp, art->item);
1474 tmp->type = type; 1357 tmp->type = type;
1475 SET_FLAG (tmp, FLAG_IDENTIFIED); 1358 SET_FLAG (tmp, FLAG_IDENTIFIED);
1476 if ((ch = describe_item (tmp, NULL)) != NULL && strlen (ch) > 1) 1359 if ((ch = describe_item (tmp, 0)) && strlen (ch) > 1)
1477 sprintf (buf, "%s Properties of this artifact include: \n %s \n", buf, ch); 1360 buf << "\rProperties of this artifact include:\r" << ch << "\n";
1361
1478 tmp->destroy (); 1362 tmp->destroy ();
1479 /* add the buf if it will fit */
1480 if (!book_overflow (retbuf, buf, booksize))
1481 strcat (retbuf, buf);
1482 else
1483 break;
1484 1363
1485 art = art->next; 1364 art = art->next;
1486 book_entries--; 1365 book_entries--;
1487 } 1366 }
1488 1367
1489#ifdef BOOK_MSG_DEBUG
1490 LOG (llevDebug, "artifact_msg() created strng: %d\n", strlen (retbuf));
1491 fprintf (logfile, " MADE THIS:\n%s", retbuf);
1492#endif
1493 return retbuf; 1368 return buf;
1494} 1369}
1495 1370
1496/***************************************************************************** 1371/*****************************************************************************
1497 * Spellpath message generation 1372 * Spellpath message generation
1498 *****************************************************************************/ 1373 *****************************************************************************/
1499 1374
1500/* spellpath_msg() - generate a message detailing the member 1375/* spellpath_msg() - generate a message detailing the member
1501 * incantations/prayers (and some of their properties) belonging to 1376 * incantations/prayers (and some of their properties) belonging to
1502 * a given spellpath. 1377 * a given spellpath.
1503 */ 1378 */
1504 1379static char *
1505char *
1506spellpath_msg (int level, int booksize) 1380spellpath_msg (int level)
1507{ 1381{
1382 static dynbuf_text buf; buf.clear ();
1383
1508 static char retbuf[BOOK_BUF]; 1384 static char retbuf[BOOK_BUF];
1509 char tmpbuf[BOOK_BUF]; 1385 char tmpbuf[BOOK_BUF];
1510 int path = RANDOM () % NRSPELLPATHS, prayers = RANDOM () % 2; 1386 int path = rndm (NRSPELLPATHS), prayers = rndm (2);
1511 int did_first_sp = 0;
1512 uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; 1387 uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path];
1513 archetype *at; 1388 archetype *at;
1514 1389
1515 /* Preamble */ 1390 /* Preamble */
1516 sprintf (retbuf, "Herein are detailed the names of %s\n", prayers ? "prayers" : "incantations"); 1391 buf << "Herein are detailed the names of "
1392 << (prayers ? "prayers" : "incantations");
1517 1393
1518 if (path == -1) 1394 if (path == -1)
1519 strcat (retbuf, "having no known spell path.\n"); 1395 buf << " having no known spell path.\n";
1520 else 1396 else
1521 sprintf (retbuf, "%sbelonging to the path of %s:\n", retbuf, spellpathnames[path]); 1397 buf << " belonging to the path of B<< " << spellpathnames[path] << " >>:\n\n";
1522 1398
1523 for (at = first_archetype; at != NULL; at = at->next) 1399 int seen = 0;
1524 { 1400
1401 for_all_archetypes (at)
1525 /* Determine if this is an appropriate spell. Must 1402 /* Determine if this is an appropriate spell. Must
1526 * be of matching path, must be of appropriate type (prayer 1403 * be of matching path, must be of appropriate type (prayer
1527 * or not), and must be within the valid level range. 1404 * or not), and must be within the valid level range.
1528 */ 1405 */
1529 if (at->clone.type == SPELL && at->clone.path_attuned & pnum && 1406 if (at->type == SPELL && at->path_attuned & pnum &&
1530 ((at->clone.stats.grace && prayers) || (at->clone.stats.sp && !prayers)) && (at->clone.level < (level * 8))) 1407 ((at->stats.grace && prayers) || (at->stats.sp && !prayers)) && (at->level < (level * 8)))
1531 { 1408 {
1532 strcpy (tmpbuf, at->clone.name); 1409 seen = 1;
1533 1410 buf << at->object::name << '\r';
1534 if (book_overflow (retbuf, tmpbuf, booksize))
1535 break;
1536 else
1537 {
1538 if (did_first_sp)
1539 strcat (retbuf, ",\n");
1540 did_first_sp = 1;
1541 strcat (retbuf, tmpbuf);
1542 }
1543 } 1411 }
1544 } 1412
1545 /* Geez, no spells were generated. */ 1413 /* Geez, no spells were generated. */
1546 if (!did_first_sp) 1414 if (!seen)
1547 {
1548 if (RANDOM () % 4) /* usually, lets make a recursive call... */ 1415 if (rndm (4)) /* usually, lets make a recursive call... */
1549 spellpath_msg (level, booksize); 1416 return spellpath_msg (level);
1550 else /* give up, cause knowing no spells exist for path is info too. */ 1417 else /* give up, cause knowing no spells exist for path is info too. */
1551 strcat (retbuf, "\n - no known spells exist -\n"); 1418 buf << "- no known spells exist.\n";
1552 } 1419
1553 else
1554 {
1555 strcat (retbuf, "\n");
1556 }
1557 return retbuf; 1420 return buf;
1558} 1421}
1559
1560
1561 1422
1562/* formula_msg() - generate a message detailing the properties 1423/* formula_msg() - generate a message detailing the properties
1563 * of a randomly selected alchemical formula. 1424 * of a randomly selected alchemical formula.
1564 */ 1425 */
1565 1426static void
1566void
1567make_formula_book (object *book, int level) 1427make_formula_book (object *book, int level)
1568{ 1428{
1569 char retbuf[BOOK_BUF], title[MAX_BUF]; 1429 char title[MAX_BUF];
1570 recipelist *fl; 1430 recipelist *fl;
1571 recipe *formula = NULL; 1431 recipe *formula = NULL;
1572 int chance; 1432 int chance;
1573 1433
1434 static dynbuf_text buf; buf.clear ();
1435
1574 /* the higher the book level, the more complex (ie number of 1436 /* the higher the book level, the more complex (ie number of
1575 * ingredients) the formula can be. 1437 * ingredients) the formula can be.
1576 */ 1438 */
1577 fl = get_formulalist (((RANDOM () % level) / 3) + 1); 1439 fl = get_formulalist (rndm (level) / 3 + 1);
1578 1440
1579 if (!fl) 1441 if (!fl)
1580 fl = get_formulalist (1); /* safety */ 1442 fl = get_formulalist (1); /* safety */
1581 1443
1582 if (fl->total_chance == 0) 1444 if (fl->total_chance == 0)
1586 add_author (book, 4); 1448 add_author (book, 4);
1587 return; 1449 return;
1588 } 1450 }
1589 1451
1590 /* get a random formula, weighted by its bookchance */ 1452 /* get a random formula, weighted by its bookchance */
1591 chance = RANDOM () % fl->total_chance; 1453 chance = rndm (fl->total_chance);
1592 for (formula = fl->items; formula != NULL; formula = formula->next) 1454 for (formula = fl->items; formula; formula = formula->next)
1593 { 1455 {
1594 chance -= formula->chance; 1456 chance -= formula->chance;
1457
1595 if (chance <= 0) 1458 if (chance <= 0)
1596 break; 1459 break;
1597 } 1460 }
1598 1461
1599 if (!formula || formula->arch_names <= 0) 1462 if (!formula || formula->arch_names <= 0)
1600 { 1463 {
1601 book->msg = "<indecipherable text>\n"; 1464 book->msg = "<indecipherable text>\n";
1602 new_text_name (book, 4); 1465 new_text_name (book, 4);
1603 add_author (book, 4); 1466 add_author (book, 4);
1604 1467 return;
1605 } 1468 }
1469
1470 /* looks like a formula was found. Base the amount
1471 * of information on the booklevel and the spellevel
1472 * of the formula. */
1473
1474 const char *op_name = formula->arch_name [rndm (formula->arch_names)];
1475 archetype *at;
1476
1477 /* preamble */
1478 buf << "Herein is described a project using B<< "
1479 << (formula->skill ? &formula->skill : "an unknown skill")
1480 << " >>:\n\n";
1481
1482 if ((at = archetype::find (op_name)))
1483 op_name = at->object::name;
1606 else 1484 else
1485 LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name);
1486
1487 /* item name */
1488 if (formula->title != shstr_NONE)
1489 {
1490 buf.printf ("The B<< %s of %s >>", op_name, &formula->title);
1491 /* This results in things like pile of philo. sulfur.
1492 * while philo. sulfur may look better, without this,
1493 * you get things like 'the wise' because its missing the
1494 * water of section.
1495 */
1496 sprintf (title, "%s: %s of %s",
1497 formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title);
1607 { 1498 }
1608 /* looks like a formula was found. Base the amount 1499 else
1609 * of information on the booklevel and the spellevel 1500 {
1610 * of the formula. */ 1501 buf << "The B<< " << op_name;
1611 1502
1612 const char *op_name = formula->arch_name[RANDOM () % formula->arch_names]; 1503 sprintf (title, "%s: %s", formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name);
1504 if (at->title)
1505 {
1506 buf << " " << at->title;
1507 strcat (title, " ");
1508 strcat (title, at->title);
1509 }
1510
1511 buf << " >>";
1512 }
1513
1514 /* Lets name the book something meaningful ! */
1515 book->name = title;
1516 book->title = NULL;
1517
1518 /* ingredients to make it */
1519 if (formula->ingred)
1520 {
1521 linked_char *next;
1613 archetype *at; 1522 archetype *at;
1614 1523
1615 /* preamble */
1616 sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill");
1617
1618 if ((at = archetype::find (op_name)) != (archetype *) NULL)
1619 op_name = at->clone.name;
1620 else
1621 LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name);
1622
1623 /* item name */
1624 if (strcmp (formula->title, "NONE"))
1625 {
1626 sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title);
1627 /* This results in things like pile of philo. sulfur.
1628 * while philo. sulfur may look better, without this,
1629 * you get things like 'the wise' because its missing the
1630 * water of section.
1631 */
1632 sprintf (title, "%s: %s of %s",
1633 formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title);
1634 }
1635 else
1636 {
1637 sprintf (retbuf, "%sThe %s", retbuf, op_name);
1638 sprintf (title, "%s: %s", formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name);
1639 if (at->clone.title)
1640 {
1641 strcat (retbuf, " ");
1642 strcat (retbuf, at->clone.title);
1643 strcat (title, " ");
1644 strcat (title, at->clone.title);
1645 }
1646 }
1647 /* Lets name the book something meaningful ! */
1648 book->name = title;
1649 book->title = NULL;
1650
1651 /* ingredients to make it */
1652 if (formula->ingred != NULL)
1653 {
1654 linked_char *next;
1655 archetype *at;
1656
1657 at = archetype::find (formula->cauldron); 1524 at = archetype::find (formula->cauldron);
1658 1525
1659 sprintf (retbuf + strlen (retbuf), 1526 buf.printf (" may be made at %s using the following ingredients:\n\n",
1660 " may be made at %s using the following ingredients:\n", at ? query_name (&at->clone) : "an unknown place"); 1527 at ? query_name (at) : "an appropriate place");
1661 1528
1662 for (next = formula->ingred; next != NULL; next = next->next) 1529 for (next = formula->ingred; next; next = next->next)
1663 { 1530 buf << next->name << '\r';
1664 strcat (retbuf, next->name);
1665 strcat (retbuf, "\n");
1666 }
1667 }
1668 else
1669 LOG (llevError, "formula_msg() no ingredient list for object %s of %s\n", op_name, &formula->title);
1670 if (retbuf[strlen (retbuf) - 1] != '\n')
1671 strcat (retbuf, "\n");
1672
1673 book->msg = retbuf;
1674 }
1675}
1676
1677
1678/* msgfile_msg() - generate a message drawn randomly from a
1679 * file in lib/. Level currently has no effect on the message
1680 * which is returned.
1681 */
1682
1683char *
1684msgfile_msg (int level, int booksize)
1685{
1686 static char retbuf[BOOK_BUF];
1687 int i, msgnum;
1688 linked_char *msg = NULL;
1689
1690 /* get a random message for the 'book' from linked list */
1691 if (nrofmsg > 1)
1692 { 1531 }
1693 msg = first_msg;
1694 msgnum = RANDOM () % nrofmsg;
1695 for (i = 0; msg && i < nrofmsg && i != msgnum; i++)
1696 msg = msg->next;
1697 }
1698
1699 if (msg && !book_overflow (retbuf, msg->name, booksize))
1700 strcpy (retbuf, msg->name);
1701 else 1532 else
1702 sprintf (retbuf, "\n <undecipherable text>"); 1533 LOG (llevError, "formula_msg() no ingredient list for object %s of %s\n", op_name, &formula->title);
1703 1534
1704#ifdef BOOK_MSG_DEBUG 1535 book->msg = buf;
1705 LOG (llevDebug, "\n info_list_msg() created strng: %d\n", strlen (retbuf));
1706 LOG (llevDebug, " MADE THIS:\n%s\n", retbuf);
1707#endif
1708
1709 return retbuf;
1710} 1536}
1711 1537
1538#define DESCRIBE_PATH(retbuf, variable, name) \
1539 if(variable) { \
1540 int i,j=0; \
1541 strcat(retbuf,"(" name ": "); \
1542 for(i=0; i<NRSPELLPATHS; i++) \
1543 if(variable & (1<<i)) { \
1544 if (j) \
1545 strcat(retbuf,", "); \
1546 else \
1547 j = 1; \
1548 strcat(retbuf, spellpathnames[i]); \
1549 } \
1550 strcat(retbuf,")"); \
1551 }
1712 1552
1713/* god_info_msg() - generate a message detailing the properties 1553/* god_info_msg() - generate a message detailing the properties
1714 * of a random god. Used by the book hack. b.t. 1554 * of a random god. Used by the book hack. b.t.
1715 */ 1555 */
1716
1717const char * 1556static const char *
1718god_info_msg (int level, int booksize) 1557god_info_msg (int level)
1719{ 1558{
1720 static char retbuf[BOOK_BUF];
1721 const char *name = NULL; 1559 const char *name = NULL;
1722 char buf[BOOK_BUF];
1723 int i;
1724 size_t introlen;
1725 object *god = pntr_to_god_obj (get_rand_god ()); 1560 object *god = pntr_to_god_obj (get_rand_god ());
1726 1561
1562 static dynbuf_text buf; buf.clear ();
1563
1727 if (!god) 1564 if (!god)
1728 return (char *) NULL; /* oops, problems... */ 1565 return 0; /* oops, problems... */
1566
1729 name = god->name; 1567 name = god->name;
1730 1568
1731 /* preamble.. */ 1569 /* preamble.. */
1732 sprintf (retbuf, "This document contains knowledge concerning\n"); 1570 buf << "This document contains knowledge concerning the diety B<< "
1733 sprintf (retbuf, "%sthe diety %s", retbuf, name); 1571 << name << " >>";
1734 1572
1735 /* Always have as default information the god's descriptive terms. */ 1573 /* Always have as default information the god's descriptive terms. */
1736 if (nstrtok (god->msg, ",") > 0) 1574 if (nstrtok (god->msg, ",") > 0)
1737 { 1575 buf << ", known as" << strtoktolin (god->msg, ",");
1738 strcat (retbuf, ", known as");
1739 strcat (retbuf, strtoktolin (god->msg, ","));
1740 }
1741 else 1576 else
1742 strcat (retbuf, "..."); 1577 buf << "...";
1743 1578
1744 strcat (retbuf, "\n ---\n"); 1579 buf << "\n\n";
1580
1745 introlen = strlen (retbuf); /* so we will know if no new info is added later */ 1581 int introlen = buf.size (); /* so we will know if no new info is added later */
1746 1582
1747 /* Information about the god is random, and based on the level of the 1583 /* Information about the god is random, and based on the level of the
1748 * 'book'. Probably there is a more intellegent way to implement 1584 * 'book'. Probably there is a more intellegent way to implement
1749 * this ... 1585 * this ...
1750 */ 1586 */
1751 1587 while (level > 0 && buf.size () < BOOK_BUF)
1752 while (level > 0)
1753 { 1588 {
1754 sprintf (buf, " ");
1755 if (level == 2 && RANDOM () % 2) 1589 if (level == 2 && rndm (2))
1756 { /* enemy god */ 1590 { /* enemy god */
1757 const char *enemy = god->title; 1591 const char *enemy = god->title;
1758 1592
1759 if (enemy) 1593 if (enemy)
1760 sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); 1594 buf.printf ("The gods %s and %s are enemies.\r", name, enemy);
1761 } 1595 }
1596
1762 if (level == 3 && RANDOM () % 2) 1597 if (level == 3 && rndm (2))
1763 { /* enemy race, what the god's holy word effects */ 1598 { /* enemy race, what the god's holy word effects */
1764 const char *enemy = god->slaying; 1599 const char *enemy = god->slaying;
1600 int i;
1765 1601
1766 if (enemy && !(god->path_denied & PATH_TURNING)) 1602 if (enemy && !(god->path_denied & PATH_TURNING))
1767 if ((i = nstrtok (enemy, ",")) > 0) 1603 if ((i = nstrtok (enemy, ",")) > 0)
1768 { 1604 {
1769 char tmpbuf[MAX_BUF]; 1605 char tmpbuf[MAX_BUF];
1770 1606
1771 sprintf (buf, "The holy words of %s have the power to\n", name); 1607 buf << "The holy words of " << name
1772 strcat (buf, "slay creatures belonging to the "); 1608 << " have the power to slay creatures belonging to the ";
1609
1773 if (i > 1) 1610 if (i > 1)
1774 sprintf (tmpbuf, "following \n races:%s", strtoktolin (enemy, ",")); 1611 buf << "following races:" << strtoktolin (enemy, ",");
1775 else 1612 else
1776 sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); 1613 buf << "race of" << strtoktolin (enemy, ",");
1777 sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); 1614
1615 buf << '\r';
1778 } 1616 }
1779 } 1617 }
1618
1780 if (level == 4 && RANDOM () % 2) 1619 if (level == 4 && rndm (2))
1781 { /* Priest of god gets these protect,vulnerable... */ 1620 { /* Priest of god gets these protect,vulnerable... */
1782 char tmpbuf[MAX_BUF], *cp;
1783
1784 cp = describe_resistance (god, 1); 1621 if (const char *cp = describe_resistance (god, 1))
1785
1786 if (*cp)
1787 { /* This god does have protections */ 1622 { /* This god does have protections */
1788 sprintf (tmpbuf, "%s has a potent aura which is extended\n", name); 1623 buf << name
1624 << " has a potent aura which is extended to"
1789 strcat (tmpbuf, "faithful priests. The effects of this aura include:\n"); 1625 " faithful priests. The effects of this aura include: "
1790 strcat (tmpbuf, cp); 1626 << cp
1791 strcat (buf, tmpbuf); 1627 << ".\r";
1792 strcat (buf, "\n ---\n");
1793 } 1628 }
1794 else
1795 sprintf (buf, " ");
1796 } 1629 }
1630
1797 if (level == 5 && RANDOM () % 2) 1631 if (level == 5 && rndm (2))
1798 { /* aligned race, summoning */ 1632 { /* aligned race, summoning */
1799 const char *race = god->race; /* aligned race */ 1633 const char *race = god->race; /* aligned race */
1634 int i;
1800 1635
1801 if (race && !(god->path_denied & PATH_SUMMON)) 1636 if (race && !(god->path_denied & PATH_SUMMON))
1802 if ((i = nstrtok (race, ",")) > 0) 1637 if ((i = nstrtok (race, ",")) > 0)
1803 { 1638 {
1804 char tmpbuf[MAX_BUF]; 1639 buf << "Creatures sacred to " << name << " include the ";
1805
1806 sprintf (buf, "Creatures sacred to %s include the \n", name);
1807 if (i > 1) 1640 if (i > 1)
1808 sprintf (tmpbuf, "following \n races:%s", strtoktolin (race, ",")); 1641 buf << "following races:" << strtoktolin (race, ",");
1809 else 1642 else
1810 sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); 1643 buf << "race of" << strtoktolin (race, ",");
1811 sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); 1644
1645 buf << '\r';
1812 } 1646 }
1813 } 1647 }
1648
1814 if (level == 6 && RANDOM () % 2) 1649 if (level == 6 && rndm (2))
1815 { /* blessing,curse properties of the god */ 1650 { /* blessing,curse properties of the god */
1816 char tmpbuf[MAX_BUF], *cp;
1817
1818 cp = describe_resistance (god, 1); 1651 if (const char *cp = describe_resistance (god, 1))
1819
1820 if (*cp)
1821 { /* This god does have protections */ 1652 { /* This god does have protections */
1822 sprintf (tmpbuf, "\nThe priests of %s are known to be able to \n", name); 1653 buf << "The priests of " << name
1654 << " are known to be able to "
1823 strcat (tmpbuf, "bestow a blessing which makes the recipient\n"); 1655 "bestow a blessing which makes the recipient "
1824 strcat (tmpbuf, cp); 1656 << cp
1825 strcat (buf, tmpbuf); 1657 << '\r';
1826 strcat (buf, "\n ---\n");
1827 } 1658 }
1828 else
1829 sprintf (buf, " ");
1830
1831 } 1659 }
1660
1832 if (level == 8 && RANDOM () % 2) 1661 if (level == 8 && rndm (2))
1833 { /* immunity, holy possession */ 1662 { /* immunity, holy possession */
1834 int has_effect = 0, tmpvar; 1663 buf << "The priests of " << name
1835 char tmpbuf[MAX_BUF]; 1664 << " are known to make cast a mighty"
1665 " prayer of possession";
1666
1667 int first = 1;
1836 1668
1837 sprintf (tmpbuf, "\n");
1838 sprintf (tmpbuf, "The priests of %s are known to make cast a mighty \n", name);
1839
1840 strcat (tmpbuf, "prayer of possession which gives the recipient\n");
1841
1842 for (tmpvar = 0; tmpvar < NROFATTACKS; tmpvar++) 1669 for (int i = 0; i < NROFATTACKS; i++)
1670 if (god->resist[i] == 100)
1843 { 1671 {
1844 if (god->resist[tmpvar] == 100) 1672 if (first)
1845 { 1673 {
1674 buf << " which gives the recipient";
1846 has_effect = 1; 1675 first = 0;
1847 sprintf (tmpbuf + strlen (tmpbuf), "Immunity to %s", attacktype_desc[tmpvar]);
1848 } 1676 }
1677 else
1678 buf << ", ";
1679
1680 buf << " immunity to " << attacktype_desc[i];
1849 } 1681 }
1850 if (has_effect) 1682
1851 { 1683 buf << ".\r";
1852 strcat (buf, tmpbuf);
1853 strcat (buf, "\n ---\n");
1854 }
1855 else
1856 sprintf (buf, " ");
1857 } 1684 }
1685
1858 if (level == 12 && RANDOM () % 2) 1686 if (level == 12 && rndm (2))
1859 { /* spell paths */ 1687 { /* spell paths */
1688 //TODO:
1860 int has_effect = 0, tmpvar; 1689 int has_effect = 0, tmpvar;
1861 char tmpbuf[MAX_BUF]; 1690 char tmpbuf[MAX_BUF];
1862 1691
1863 sprintf (tmpbuf, "\n"); 1692 sprintf (tmpbuf, "\n");
1864 sprintf (tmpbuf, "It is rarely known fact that the priests of %s\n", name); 1693 sprintf (tmpbuf, "It is rarely known fact that the priests of %s\n", name);
1865 strcat (tmpbuf, "are mystically transformed. Effects of this include:\n"); 1694 strcat (tmpbuf, "are mystically transformed. Effects of this include:\n");
1695
1866 if ((tmpvar = god->path_attuned)) 1696 if ((tmpvar = god->path_attuned))
1867 { 1697 {
1868 has_effect = 1; 1698 has_effect = 1;
1869 DESCRIBE_PATH (tmpbuf, tmpvar, "Attuned"); 1699 DESCRIBE_PATH (tmpbuf, tmpvar, "Attuned");
1870 } 1700 }
1701
1871 if ((tmpvar = god->path_repelled)) 1702 if ((tmpvar = god->path_repelled))
1872 { 1703 {
1873 has_effect = 1; 1704 has_effect = 1;
1874 DESCRIBE_PATH (tmpbuf, tmpvar, "Repelled"); 1705 DESCRIBE_PATH (tmpbuf, tmpvar, "Repelled");
1875 } 1706 }
1707
1876 if ((tmpvar = god->path_denied)) 1708 if ((tmpvar = god->path_denied))
1877 { 1709 {
1878 has_effect = 1; 1710 has_effect = 1;
1879 DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); 1711 DESCRIBE_PATH (tmpbuf, tmpvar, "Denied");
1880 } 1712 }
1713
1881 if (has_effect) 1714 if (has_effect)
1882 { 1715 buf << tmpbuf << '\r';
1883 strcat (buf, tmpbuf);
1884 strcat (buf, "\n ---\n");
1885 }
1886 else 1716 else
1887 sprintf (buf, " "); 1717 buf << '\r';
1888 } 1718 }
1889 1719
1890 /* check to be sure new buffer size dont exceed either
1891 * the maximum buffer size, or the 'natural' size of the
1892 * book...
1893 */
1894 if (book_overflow (retbuf, buf, booksize))
1895 break;
1896 else if (strlen (buf) > 1)
1897 strcat (retbuf, buf);
1898 level--; 1720 level--;
1899 } 1721 }
1900 if (strlen (retbuf) == introlen) 1722
1723 if (buf.size () == introlen)
1901 { /* we got no information beyond the preamble! */ 1724 /* we got no information beyond the preamble! */
1902 strcat (retbuf, " [Unfortunately the rest of the information is\n"); 1725 buf << "[Unfortunately the rest of the information is hopelessly garbled!]";
1903 strcat (retbuf, " hopelessly garbled!]\n ---\n"); 1726
1904 }
1905#ifdef BOOK_MSG_DEBUG
1906 LOG (llevDebug, "\n god_info_msg() created strng: %d\n", strlen (retbuf));
1907 fprintf (logfile, " MADE THIS:\n%s", retbuf);
1908#endif
1909 return retbuf; 1727 return buf;
1910} 1728}
1911 1729
1912/* tailor_readable_ob()- The main routine. This chooses a random 1730/* tailor_readable_ob()- The main routine. This chooses a random
1913 * message to put in given readable object (type==BOOK) which will 1731 * message to put in given readable object (type==BOOK) which will
1914 * be referred hereafter as a 'book'. We use the book level to de- 1732 * be referred hereafter as a 'book'. We use the book level to de-
1923 * book is the object we are creating into. 1741 * book is the object we are creating into.
1924 * If msg_type is a positive value, we use that to determine the 1742 * If msg_type is a positive value, we use that to determine the
1925 * message type - otherwise a random value is used. 1743 * message type - otherwise a random value is used.
1926 * 1744 *
1927 */ 1745 */
1928
1929void 1746void
1930tailor_readable_ob (object *book, int msg_type) 1747tailor_readable_ob (object *book, int msg_type)
1931{ 1748{
1932 char msgbuf[BOOK_BUF];
1933 int level = book->level ? (RANDOM () % book->level) + 1 : 1; 1749 int level = book->level ? rndm (book->level) + 1 : 1;
1934 int book_buf_size;
1935 1750
1936 /* safety */ 1751 /* safety */
1937 if (book->type != BOOK) 1752 if (book->type != BOOK)
1938 return; 1753 return;
1939 1754
1940 if (level <= 0) 1755 if (level <= 0)
1941 return; /* if no level no point in doing any more... */ 1756 return; /* if no level no point in doing any more... */
1942
1943 /* Max text length this book can have. */
1944 book_buf_size = BOOKSIZE (book);
1945 1757
1946 /* &&& The message switch &&& */ 1758 /* &&& The message switch &&& */
1947 /* Below all of the possible types of messages in the "book"s. 1759 /* Below all of the possible types of messages in the "book"s.
1948 */ 1760 */
1949 /* 1761 /*
1952 * 2) make sure there is an entry in max_titles[] array. 1764 * 2) make sure there is an entry in max_titles[] array.
1953 * 3) make sure there are entries for your case in new_text_title() 1765 * 3) make sure there are entries for your case in new_text_title()
1954 * and add_authour(). 1766 * and add_authour().
1955 * 4) you may want separate authour/book name arrays in read.h 1767 * 4) you may want separate authour/book name arrays in read.h
1956 */ 1768 */
1957 1769 const char *new_msg = "";
1958 msg_type = msg_type > 0 ? msg_type : (RANDOM () % 6); 1770 msg_type = msg_type > 0 ? msg_type : rndm (8);
1959 switch (msg_type) 1771 switch (msg_type)
1960 { 1772 {
1961 case 1: /* monster attrib */ 1773 case 1: /* monster attrib */
1962 strcpy (msgbuf, mon_info_msg (level, book_buf_size)); 1774 new_msg = mon_info_msg (level);
1963 break; 1775 break;
1964 case 2: /* artifact attrib */ 1776 case 2: /* artifact attrib */
1965 strcpy (msgbuf, artifact_msg (level, book_buf_size)); 1777 new_msg = artifact_msg (level);
1966 break; 1778 break;
1967 case 3: /* grouping incantations/prayers by path */ 1779 case 3: /* grouping incantations/prayers by path */
1968 strcpy (msgbuf, spellpath_msg (level, book_buf_size)); 1780 new_msg = spellpath_msg (level);
1969 break; 1781 break;
1970 case 4: /* describe an alchemy formula */ 1782 case 4: /* describe an alchemy formula */
1971 make_formula_book (book, level); 1783 make_formula_book (book, level);
1972 /* make_formula_book already gives title */ 1784 /* make_formula_book already gives title */
1973 return; 1785 return;
1974 break;
1975 case 5: /* bits of information about a god */ 1786 case 5: /* bits of information about a god */
1976 strcpy (msgbuf, god_info_msg (level, book_buf_size)); 1787 new_msg = god_info_msg (level);
1977 break; 1788 break;
1978 case 0: /* use info list in lib/ */ 1789 case 0: /* use info list in lib/ */
1979 default: 1790 default:
1980 strcpy (msgbuf, msgfile_msg (level, book_buf_size)); 1791 cfperl_make_book (book, level);
1981 break; 1792 /* already gives title */
1793 return;
1982 } 1794 }
1983 1795
1984 strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */
1985
1986 if (strlen (msgbuf) > 1) 1796 if (strlen (new_msg) > 1)
1987 { 1797 {
1988 book->msg = msgbuf; 1798 book->msg = new_msg;
1989 /* lets give the "book" a new name, which may be a compound word */ 1799 /* lets give the "book" a new name, which may be a compound word */
1990 change_book (book, msg_type); 1800 change_book (book, msg_type);
1991 } 1801 }
1992
1993} 1802}
1994
1995
1996/*****************************************************************************
1997 *
1998 * Cleanup routine for readble stuff.
1999 *
2000 *****************************************************************************/
2001
2002void
2003free_all_readable (void)
2004{
2005 titlelist *tlist, *tnext;
2006 title *title1, *titlenext;
2007 linked_char *lmsg, *nextmsg;
2008 objectlink *monlink, *nextmon;
2009
2010 LOG (llevDebug, "freeing all book information\n");
2011
2012 for (tlist = booklist; tlist != NULL; tlist = tnext)
2013 {
2014 tnext = tlist->next;
2015
2016 for (title1 = tlist->first_book; title1; title1 = titlenext)
2017 {
2018 titlenext = title1->next;
2019 delete title1;
2020 }
2021
2022 delete tlist;
2023 }
2024
2025 for (lmsg = first_msg; lmsg; lmsg = nextmsg)
2026 {
2027 nextmsg = lmsg->next;
2028 delete lmsg;
2029 }
2030
2031 for (monlink = first_mon_info; monlink; monlink = nextmon)
2032 {
2033 nextmon = monlink->next;
2034 delete monlink;
2035 }
2036}
2037
2038 1803
2039/***************************************************************************** 1804/*****************************************************************************
2040 * 1805 *
2041 * Writeback routine for updating the bookarchive. 1806 * Writeback routine for updating the bookarchive.
2042 * 1807 *
2043 ****************************************************************************/ 1808 ****************************************************************************/
2044
2045/* write_book_archive() - write out the updated book archive */ 1809/* write_book_archive() - write out the updated book archive */
2046
2047void 1810void
2048write_book_archive (void) 1811write_book_archive (void)
2049{ 1812{
2050 FILE *fp; 1813 FILE *fp;
2051 int index = 0; 1814 int index = 0;
2054 titlelist *bl = get_titlelist (0); 1817 titlelist *bl = get_titlelist (0);
2055 1818
2056 /* If nothing changed, don't write anything */ 1819 /* If nothing changed, don't write anything */
2057 if (!need_to_write_bookarchive) 1820 if (!need_to_write_bookarchive)
2058 return; 1821 return;
1822
2059 need_to_write_bookarchive = 0; 1823 need_to_write_bookarchive = 0;
2060 1824
2061 sprintf (fname, "%s/bookarch", settings.localdir); 1825 sprintf (fname, "%s/bookarch", settings.localdir);
2062 LOG (llevDebug, "Updating book archive: %s...\n", fname); 1826 LOG (llevDebug, "Updating book archive: %s...\n", fname);
2063 1827
2064 if ((fp = fopen (fname, "w")) == NULL) 1828 if ((fp = fopen (fname, "w")) == NULL)
2065 {
2066 LOG (llevDebug, "Can't open book archive file %s\n", fname); 1829 LOG (llevDebug, "Can't open book archive file %s\n", fname);
2067 }
2068 else 1830 else
2069 { 1831 {
2070 while (bl) 1832 while (bl)
2071 { 1833 {
2072 for (book = bl->first_book; book; book = book->next) 1834 for (book = bl->first_book; book; book = book->next)
2079 fprintf (fp, "type %d\n", index); 1841 fprintf (fp, "type %d\n", index);
2080 fprintf (fp, "size %d\n", book->size); 1842 fprintf (fp, "size %d\n", book->size);
2081 fprintf (fp, "index %d\n", book->msg_index); 1843 fprintf (fp, "index %d\n", book->msg_index);
2082 fprintf (fp, "end\n"); 1844 fprintf (fp, "end\n");
2083 } 1845 }
1846
2084 bl = bl->next; 1847 bl = bl->next;
2085 index++; 1848 index++;
2086 } 1849 }
1850
2087 fclose (fp); 1851 fclose (fp);
2088 chmod (fname, SAVE_MODE); 1852 chmod (fname, SAVE_MODE);
2089 } 1853 }
2090} 1854}
1855
2091readable_message_type * 1856readable_message_type *
2092get_readable_message_type (object *readable) 1857get_readable_message_type (object *readable)
2093{ 1858{
2094 uint8 subtype = readable->subtype; 1859 uint8 subtype = readable->subtype;
2095 1860
2096 if (subtype > last_readable_subtype) 1861 if (subtype > last_readable_subtype)
2097 return &(readable_message_types[0]); 1862 return &readable_message_types[0];
1863
2098 return &(readable_message_types[subtype]); 1864 return &readable_message_types[subtype];
2099} 1865}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines