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.28 by root, Sun Jun 24 04:09:28 2007 UTC vs.
Revision 1.68 by root, Sun Jan 29 02:47:04 2017 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines