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.48 by root, Thu Oct 15 23:25:53 2009 UTC vs.
Revision 1.68 by root, Sun Jan 29 02:47:04 2017 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 * Deliantra is free software: you can redistribute it and/or modify it under 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 9 * the terms of the Affero GNU General Public License as published by the
10 * Free Software Foundation, either version 3 of the License, or (at your 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * 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 Affero GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * and the GNU General Public License along with this program. If not, see 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
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.
… …
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/* Define this if you want to archive book titles by contents. 36/* Define this if you want to archive book titles by contents.
37 * This option should enforce UNIQUE combinations of titles,authors and 37 * This option should enforce UNIQUE combinations of titles,authors and
38 * msg contents during and *between* game sessions. 38 * msg contents during and *between* game sessions.
39 * Note: a slight degeneracy exists since books are archived based on an integer 39 * Note: a slight degeneracy exists since books are archived based on an integer
40 * index value calculated from the message text (similar to alchemy formulae). 40 * index value calculated from the message text (similar to alchemy formulae).
41 * 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
42 * 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
43 * 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
44 * should keeps player on their toes ;). 44 * should keeps player on their toes ;).
45 * 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.
46 * 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
47 * under the current regime, since there are generally fewer possible (random) 47 * under the current regime, since there are generally fewer possible (random)
48 * messages than space available on the titlelists. 48 * messages than space available on the titlelists.
49 * 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
50 * 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)
51 * 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
52 * 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
53 * (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
54 * 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
55 * 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
56 * 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
57 * 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
58 * sessions for this to happen). 58 * sessions for this to happen).
59 * 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
60 * 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
61 * 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.
62 * -b.t. 62 * -b.t.
63 */ 63 */
64 64
65/* 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 */
66 66
… …
108/* these are needed for creation of a linked list of 108/* these are needed for creation of a linked list of
109 * pointers to all (hostile) monster objects */ 109 * pointers to all (hostile) monster objects */
110 110
111static int nrofmon = 0, need_to_write_bookarchive = 0; 111static int nrofmon = 0, need_to_write_bookarchive = 0;
112 112
113
114/* this is needed to keep track of status of initialisation
115 * of the message file */
116static int nrofmsg = 0;
117
118/* first_msg is the started of the linked list of messages as read from
119 * the messages file
120 */
121static linked_char *first_msg = NULL;
122
123/* 113/*
124 * Spellpath information 114 * Spellpath information
125 */ 115 */
126
127static uint32 spellpathdef[NRSPELLPATHS] = { 116static uint32 spellpathdef[NRSPELLPATHS] = {
128 PATH_PROT, 117 PATH_PROT,
129 PATH_FIRE, 118 PATH_FIRE,
130 PATH_FROST, 119 PATH_FROST,
131 PATH_ELEC, 120 PATH_ELEC,
… …
412static const char *const book_descrpt[] = { 401static const char *const book_descrpt[] = {
413 "ancient", 402 "ancient",
414 "cryptic", 403 "cryptic",
415 "cryptical", 404 "cryptical",
416 "dusty", 405 "dusty",
417 "hiearchical", 406 "hierarchical",
418 "grizzled", 407 "grizzled",
419 "gold-guilt", 408 "gold-guilt",
420 "great", 409 "great",
421 "lost", 410 "lost",
422 "magnificent", 411 "magnificent",
… …
497 /*subtype 50 */ {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_3, "readable-monument-gravestone-3"}, 486 /*subtype 50 */ {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_3, "readable-monument-gravestone-3"},
498 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_1, "readable-monument-wall-1"}, 487 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_1, "readable-monument-wall-1"},
499 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_2, "readable-monument-wall-2"}, 488 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_2, "readable-monument-wall-2"},
500 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_3, "readable-monument-wall-3"} 489 {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_3, "readable-monument-wall-3"}
501}; 490};
502int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); 491static int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type);
503 492
504static int max_titles[6] = { 493static int max_titles[6] = {
505 ((sizeof (light_book_name) / sizeof (char *)) + (sizeof (heavy_book_name) / sizeof (char *))) * (sizeof (book_author) / sizeof (char *)), 494 ((sizeof (light_book_name) / sizeof (char *)) + (sizeof (heavy_book_name) / sizeof (char *))) * (sizeof (book_author) / sizeof (char *)),
506 (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)), 495 (sizeof (mon_book_name) / sizeof (char *)) * (sizeof (mon_author) / sizeof (char *)),
507 (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)), 496 (sizeof (art_book_name) / sizeof (char *)) * (sizeof (art_author) / sizeof (char *)),
… …
515 * Start of misc. readable functions used by others functions in this file 504 * Start of misc. readable functions used by others functions in this file
516 * 505 *
517 *****************************************************************************/ 506 *****************************************************************************/
518 507
519static titlelist * 508static titlelist *
520get_empty_booklist (void) 509get_empty_booklist ()
521{ 510{
522 titlelist *bl = new titlelist; 511 titlelist *bl = new titlelist;
523 512
524 bl->number = 0; 513 bl->number = 0;
525 bl->first_book = NULL; 514 bl->first_book = NULL;
526 bl->next = NULL; 515 bl->next = NULL;
527 return bl; 516 return bl;
528} 517}
529 518
530static title * 519static title *
531get_empty_book (void) 520get_empty_book ()
532{ 521{
533 title *t = new title; 522 title *t = new title;
534 523
535 t->name = NULL; 524 t->name = NULL;
536 t->archname = NULL; 525 t->archname = NULL;
… …
545/* get_titlelist() - returns pointer to the title list referanced by i */ 534/* get_titlelist() - returns pointer to the title list referanced by i */
546 535
547static titlelist * 536static titlelist *
548get_titlelist (int i) 537get_titlelist (int i)
549{ 538{
539 if (!booklist)
540 booklist = get_empty_booklist ();
541
550 titlelist *tl = booklist; 542 titlelist *tl = booklist;
551 int number = i; 543 int number = i;
552 544
553 if (number < 0) 545 if (number < 0)
554 return tl; 546 return tl;
… …
557 { 549 {
558 if (!tl->next) 550 if (!tl->next)
559 tl->next = get_empty_booklist (); 551 tl->next = get_empty_booklist ();
560 552
561 tl = tl->next; 553 tl = tl->next;
562 number--; 554 --number;
563 } 555 }
564 556
565 return tl; 557 return tl;
566} 558}
567 559
568/* HANDMADE STRING FUNCTIONS.., perhaps these belong in another file 560/* HANDMADE STRING FUNCTIONS.., perhaps these belong in another file
569 * (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. */
570 562
571/* nstrtok() - simple routine to return the number of list 563/* nstrtok() - simple routine to return the number of list
572 * items in buf1 as separated by the value of buf2 564 * items in buf1 as separated by the value of buf2
573 */ 565 */
… …
577 char *tbuf, sbuf[12], buf[MAX_BUF]; 569 char *tbuf, sbuf[12], buf[MAX_BUF];
578 int number = 0; 570 int number = 0;
579 571
580 if (!buf1 || !buf2) 572 if (!buf1 || !buf2)
581 return 0; 573 return 0;
582 sprintf (buf, "%s", buf1); 574
583 sprintf (sbuf, "%s", buf2); 575 strcpy (buf, buf1);
576 strcpy (sbuf, buf2);
577
584 tbuf = strtok (buf, sbuf); 578 tbuf = strtok (buf, sbuf);
585 while (tbuf) 579 while (tbuf)
586 { 580 {
587 number++; 581 number++;
588 tbuf = strtok (NULL, sbuf); 582 tbuf = strtok (NULL, sbuf);
… …
607 strcpy (rbuf, " "); 601 strcpy (rbuf, " ");
608 tbuf = strtok (buf, sbuf); 602 tbuf = strtok (buf, sbuf);
609 while (tbuf && i > 0) 603 while (tbuf && i > 0)
610 { 604 {
611 strcat (rbuf, tbuf); 605 strcat (rbuf, tbuf);
606
612 i--; 607 i--;
613 if (i == 1 && maxi > 1) 608 if (i == 1 && maxi > 1)
614 strcat (rbuf, " and "); 609 strcat (rbuf, " and ");
615 else if (i > 0 && maxi > 1) 610 else if (i > 0 && maxi > 1)
616 strcat (rbuf, ", "); 611 strcat (rbuf, ", ");
617 else 612 else
618 strcat (rbuf, "."); 613 strcat (rbuf, ".");
614
619 tbuf = strtok (NULL, sbuf); 615 tbuf = strtok (NULL, sbuf);
620 } 616 }
621 return (char *) rbuf;
622}
623 617
624static int
625book_overflow (const char *buf1, const char *buf2, int booksize)
626{
627 if (buf_overflow (buf1, buf2, BOOK_BUF - 2) /* 2 less so always room for trailing \n */
628 || buf_overflow (buf1, buf2, booksize))
629 return 1;
630
631 return 0; 618 return rbuf;
632} 619}
633 620
634/***************************************************************************** 621/*****************************************************************************
635 * 622 *
636 * Start of initialisation related functions. 623 * Start of initialisation related functions.
… …
640/* init_book_archive() - if not called before, initialise the info list 627/* init_book_archive() - if not called before, initialise the info list
641 * 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
642 * created and updated across multiple runs of the program. 629 * created and updated across multiple runs of the program.
643 */ 630 */
644static void 631static void
645init_book_archive (void) 632init_book_archive ()
646{ 633{
647 FILE *fp;
648 int comp, nroftitle = 0; 634 int nroftitle = 0;
649 char buf[MAX_BUF], fname[MAX_BUF], *cp;
650 title *book = NULL;
651 titlelist *bl = get_empty_booklist (); 635 titlelist *bl = get_empty_booklist ();
652 static int did_init_barch;
653 636
654 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");
655 return; 642 return;
656
657 did_init_barch = 1;
658
659 if (!booklist)
660 booklist = bl;
661
662 sprintf (fname, "%s/bookarch", settings.localdir);
663 LOG (llevDebug, " Reading bookarch from %s...\n", fname);
664
665 if ((fp = open_and_uncompress (fname, 0, &comp)) != NULL)
666 { 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
667 int value, type = 0; 654 int type = -1;
668 size_t i;
669 655
670 while (fgets (buf, MAX_BUF, fp) != NULL) 656 for (;;)
671 { 657 {
672 if (*buf == '#') 658 thawer.next ();
673 continue; 659
674 if ((cp = strchr (buf, '\n')) != NULL) 660 switch (thawer.kw)
675 *cp = '\0';
676 cp = buf;
677 while (*cp == ' ') /* Skip blanks */
678 cp++;
679 if (!strncmp (cp, "title", 4))
680 { 661 {
681 book = get_empty_book (); /* init new book entry */ 662 case KW_type: thawer.get (type ); break;
682 book->name = strchr (cp, ' ') + 1; 663 case KW_authour: thawer.get (book->authour ); break;
683 type = -1; 664 case KW_arch: thawer.get (book->archname ); break;
684 nroftitle++; 665 case KW_level: thawer.get (book->level ); break;
685 continue; 666 case KW_size: thawer.get (book->size ); break;
686 } 667 case KW_index: thawer.get (book->msg_index); break;
687 if (!strncmp (cp, "authour", 4)) 668
688 { 669 case KW_end:
689 book->authour = strchr (cp, ' ') + 1;
690 }
691 if (!strncmp (cp, "arch", 4))
692 {
693 book->archname = strchr (cp, ' ') + 1;
694 }
695 else if (sscanf (cp, "level %d", &value))
696 {
697 book->level = (uint16) value;
698 }
699 else if (sscanf (cp, "type %d", &value))
700 {
701 type = (uint16) value;
702 }
703 else if (sscanf (cp, "size %d", &value))
704 {
705 book->size = (uint16) value;
706 }
707 else if (sscanf (cp, "index %d", &value))
708 {
709 book->msg_index = (uint16) value;
710 }
711 else if (!strncmp (cp, "end", 3))
712 { /* link it */ 670 /* link it */
713 bl = get_titlelist (type); 671 bl = get_titlelist (type);
714 book->next = bl->first_book; 672 book->next = bl->first_book;
715 bl->first_book = book; 673 bl->first_book = book;
716 bl->number++; 674 bl->number++;
675 ++nroftitle;
676 goto book_done;
677
678 default:
679 delete book;
680 goto book_done;
717 } 681 }
718 } 682 }
683
684book_done:
685 thawer.next ();
686 }
687
719 LOG (llevDebug, "book archives(used/avail): \n"); 688 LOG (llevDebug, "book archives(used/avail): \n");
689 int i;
720 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++)
721 {
722 LOG (llevDebug, " (%d/%d)\n", bl->number, max_titles[i]); 691 LOG (llevDebug, " (%d/%d)\n", bl->number, max_titles[i]);
723 }
724 close_and_delete (fp, comp);
725 }
726 692
727#ifdef BOOK_MSG_DEBUG
728 LOG (llevDebug, "init_book_archive() got %d titles.\n", nroftitle); 693 LOG (llevDebug, "init_book_archive() got %d titles.\n", nroftitle);
729#endif
730 LOG (llevDebug, " done.\n");
731} 694}
732 695
733/* init_mon_info() - creates the linked list of pointers to 696/* init_mon_info() - creates the linked list of pointers to
734 * monster archetype objects if not called previously 697 * monster archetype objects if not called previously
735 */ 698 */
736
737static void 699static void
738init_mon_info (void) 700init_mon_info ()
739{ 701{
740 archetype *at; 702 archetype *at;
741 static int did_init_mon_info = 0; 703 static int did_init_mon_info = 0;
742 704
743 if (did_init_mon_info) 705 if (did_init_mon_info)
744 return; 706 return;
745 707
746 did_init_mon_info = 1; 708 did_init_mon_info = 1;
747 709
748 for_all_archetypes (at) 710 for_all_archetypes (at)
749 { 711 if (at->flag [FLAG_MONSTER]
750 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]))
751 { 714 {
752 objectlink *mon = new objectlink; 715 objectlink *mon = new objectlink;
753 716
754 mon->ob = at; 717 mon->ob = at;
755 mon->next = first_mon_info; 718 mon->next = first_mon_info;
756 first_mon_info = mon; 719 first_mon_info = mon;
757 nrofmon++; 720 nrofmon++;
758 } 721 }
759 }
760 722
761 LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); 723 LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon);
762} 724}
763 725
764/* init_readable() - initialise linked lists utilized by 726/* init_readable() - initialise linked lists utilized by
765 * message functions in tailor_readable_ob() 727 * message functions in tailor_readable_ob()
766 * 728 *
767 * This is the function called by the main routine to initialise 729 * This is the function called by the main routine to initialise
768 * all the readable information. 730 * all the readable information.
769 */ 731 */
770void 732void
771init_readable (void) 733init_readable ()
772{ 734{
773 static int did_this; 735 static int did_this;
774 736
775 if (did_this) 737 if (did_this)
776 return; 738 return;
… …
820 782
821 return t; 783 return t;
822} 784}
823 785
824/* 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
825 * handled directly in change_book_name(). Names are based on text 787 * handled directly in change_book_name(). Names are based on text
826 * msgtype 788 * msgtype
827 * this sets book book->name based on msgtype given. What name 789 * this sets book book->name based on msgtype given. What name
828 * is given is based on various criteria 790 * is given is based on various criteria
829 */ 791 */
830static void 792static void
831new_text_name (object *book, int msgtype) 793new_text_name (object *book, int msgtype)
832{ 794{
833 int nbr; 795 const char *name;
834 char name[MAX_BUF];
835 796
836 if (book->type != BOOK) 797 if (book->type != BOOK)
837 return; 798 return;
838 799
839 switch (msgtype) 800 switch (msgtype)
840 { 801 {
841 case 1: /*monster */ 802 case 1: /*monster */
842 nbr = sizeof (mon_book_name) / sizeof (char *); 803 name = mon_book_name[rndm (array_length (mon_book_name))];
843 assign (name, mon_book_name[rndm (nbr)]);
844 break; 804 break;
845 case 2: /*artifact */ 805 case 2: /*artifact */
846 nbr = sizeof (art_book_name) / sizeof (char *); 806 name = art_book_name[rndm (array_length (art_book_name))];
847 assign (name, art_book_name[rndm (nbr)]);
848 break; 807 break;
849 case 3: /*spellpath */ 808 case 3: /*spellpath */
850 nbr = sizeof (path_book_name) / sizeof (char *); 809 name = path_book_name[rndm (array_length (path_book_name))];
851 assign (name, path_book_name[rndm (nbr)]);
852 break; 810 break;
853 case 4: /*alchemy */ 811 case 4: /*alchemy */
854 nbr = sizeof (formula_book_name) / sizeof (char *); 812 name = formula_book_name[rndm (array_length (formula_book_name))];
855 assign (name, formula_book_name[rndm (nbr)]);
856 break; 813 break;
857 case 5: /*gods */ 814 case 5: /*gods */
858 nbr = sizeof (gods_book_name) / sizeof (char *); 815 name = gods_book_name[rndm (array_length (gods_book_name))];
859 assign (name, gods_book_name[rndm (nbr)]);
860 break; 816 break;
861 case 6: /*msg file */ 817 case 6: /*msg file */
862 default: 818 default:
863 if (book->weight > 2000) 819 name = book->weight > 2000 /* based on weight */
864 { /* based on weight */ 820 ? heavy_book_name [rndm (array_length (heavy_book_name))]
865 nbr = sizeof (heavy_book_name) / sizeof (char *); 821 : light_book_name [rndm (array_length (light_book_name))];
866 assign (name, heavy_book_name[rndm (nbr)]);
867 }
868 else if (book->weight < 2001)
869 {
870 nbr = sizeof (light_book_name) / sizeof (char *);
871 assign (name, light_book_name[rndm (nbr)]);
872 }
873 break; 822 break;
874 } 823 }
875 824
876 book->name = name; 825 book->name = name;
877} 826}
878 827
879/* add_book_author() 828/* add_book_author()
880 * 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
881 * and sets op->title to that value 830 * and sets op->title to that value
882 */ 831 */
883 832
884static void 833static void
885add_author (object *op, int msgtype) 834add_author (object *op, int msgtype)
886{ 835{
887 char title[MAX_BUF], name[MAX_BUF]; 836 const char *name;
888 int nbr = sizeof (book_author) / sizeof (char *);
889 837
890 if (msgtype < 0 || strlen (op->msg) < 5) 838 if (msgtype < 0 || strlen (op->msg) < 5)
891 return; 839 return;
892 840
893 switch (msgtype) 841 switch (msgtype)
894 { 842 {
895 case 1: /* monster */ 843 case 1: /* monster */
896 nbr = sizeof (mon_author) / sizeof (char *); 844 name = mon_author[rndm (array_length (mon_author))];
897 assign (name, mon_author[rndm (nbr)]);
898 break; 845 break;
899 case 2: /* artifacts */ 846 case 2: /* artifacts */
900 nbr = sizeof (art_author) / sizeof (char *); 847 name = art_author[rndm (array_length (art_author))];
901 assign (name, art_author[rndm (nbr)]);
902 break; 848 break;
903 case 3: /* spellpath */ 849 case 3: /* spellpath */
904 nbr = sizeof (path_author) / sizeof (char *); 850 name = path_author[rndm (array_length (path_author))];
905 assign (name, path_author[rndm (nbr)]);
906 break; 851 break;
907 case 4: /* alchemy */ 852 case 4: /* alchemy */
908 nbr = sizeof (formula_author) / sizeof (char *); 853 name = formula_author[rndm (array_length (formula_author))];
909 assign (name, formula_author[rndm (nbr)]);
910 break; 854 break;
911 case 5: /* gods */ 855 case 5: /* gods */
912 nbr = sizeof (gods_author) / sizeof (char *); 856 name = gods_author[rndm (array_length (gods_author))];
913 assign (name, gods_author[rndm (nbr)]);
914 break; 857 break;
915 case 6: /* msg file */ 858 case 6: /* msg file */
916 default: 859 default:
917 assign (name, book_author[rndm (nbr)]); 860 name = book_author[rndm (array_length (book_author))];
918 } 861 }
919 862
920 sprintf (title, "of %s", name); 863 op->title = format ("of %s", name);
921 op->title = title;
922} 864}
923 865
924/* 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
925 * 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
926 * a match, then unique_book returns true (because inst unique). 868 * a match, then unique_book returns true (because inst unique).
927 */ 869 */
928 870
929static int 871static int
… …
976#endif 918#endif
977 919
978} 920}
979 921
980 922
981/* change_book() - give a new, fancier name to generated 923/* change_book() - give a new, fancier name to generated
982 * objects of type BOOK and SPELLBOOK. 924 * objects of type BOOK and SPELLBOOK.
983 * 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
984 * authour/title and message content for BOOKs. Also, we will 926 * authour/title and message content for BOOKs. Also, we will
985 * alter books that match archive entries to the archival 927 * alter books that match archive entries to the archival
986 * levels and architypes. -b.t. 928 * levels and architypes. -b.t.
987 */ 929 */
988 930
989#define MAX_TITLE_CHECK 20 931#define MAX_TITLE_CHECK 20
990 932
991static void 933static void
… …
1001 title *t = NULL; 943 title *t = NULL;
1002 int tries = 0; 944 int tries = 0;
1003 945
1004 /* 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
1005 * 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,
1006 * 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
1007 * room on the titlelist. 949 * room on the titlelist.
1008 */ 950 */
1009 951
1010 if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) 952 if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype)))
1011 { 953 {
1012 /* alter book properties */ 954 /* alter book properties */
1013 if (object *tmpbook = get_archetype (t->archname)) 955 if (object *tmpbook = archetype::get (t->archname))
1014 { 956 {
1015 tmpbook->msg = book->msg; 957 tmpbook->msg = book->msg;
1016 tmpbook->copy_to (book); 958 tmpbook->copy_to (book);
1017 tmpbook->destroy (); 959 tmpbook->destroy ();
1018 } 960 }
… …
1062 1004
1063 /* Now deal with 2 cases. 1005 /* Now deal with 2 cases.
1064 * 1)If no space for a new title exists lets just restore 1006 * 1)If no space for a new title exists lets just restore
1065 * the old book properties. Remember, if the book had 1007 * the old book properties. Remember, if the book had
1066 * matchd an older entry on the titlelist, we shouldnt 1008 * matchd an older entry on the titlelist, we shouldnt
1067 * have called this routine in the first place! 1009 * have called this routine in the first place!
1068 * 2) If we got a unique title, we need to add it to 1010 * 2) If we got a unique title, we need to add it to
1069 * the list. 1011 * the list.
1070 */ 1012 */
1071 1013
1072 if (tries == MAX_TITLE_CHECK || numb == maxnames) 1014 if (tries == MAX_TITLE_CHECK || numb == maxnames)
… …
1076#endif 1018#endif
1077 /* restore old book properties here */ 1019 /* restore old book properties here */
1078 book->title = old_title; 1020 book->title = old_title;
1079 1021
1080 if (rndm (4)) 1022 if (rndm (4))
1081 {
1082 /* Lets give the book a description to individualize it some */ 1023 /* Lets give the book a description to individualize it some */
1083 char new_name[MAX_BUF];
1084
1085 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);
1086
1087 book->name = new_name;
1088 }
1089 else 1025 else
1090 {
1091 book->name = old_name; 1026 book->name = old_name;
1092 }
1093 } 1027 }
1094 else if (book->title && strlen (book->msg) > 5) 1028 else if (book->title && strlen (book->msg) > 5)
1095 { /* archive if long msg texts */ 1029 { /* archive if long msg texts */
1096 add_book_to_list (book, msgtype); 1030 add_book_to_list (book, msgtype);
1097 } 1031 }
… …
1114 1048
1115/***************************************************************************** 1049/*****************************************************************************
1116 * Monster msg generation code. 1050 * Monster msg generation code.
1117 ****************************************************************************/ 1051 ****************************************************************************/
1118 1052
1119/* get_random_mon() - returns a random monster slected from linked 1053/* get_random_mon() - returns a random monster slected from linked
1120 * 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,
1121 * then only monsters greater than that level will be returned. 1055 * then only monsters greater than that level will be returned.
1122 * Changed 971225 to be greater than equal to level passed. Also 1056 * Changed 971225 to be greater than equal to level passed. Also
1123 * made choosing by level more random. 1057 * made choosing by level more random.
1124 */ 1058 */
… …
1150 } 1084 }
1151 1085
1152 /* 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
1153 * 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
1154 * 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
1155 * 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
1156 * 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
1157 * 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
1158 * high level one and return that. Thus, monsters that immediatly followed 1092 * high level one and return that. Thus, monsters that immediatly followed
1159 * 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
1160 * means some of the dragons would be poorly represented, since they 1094 * means some of the dragons would be poorly represented, since they
… …
1215 break; 1149 break;
1216 1150
1217 /* didn't find a match */ 1151 /* didn't find a match */
1218 if (!mon) 1152 if (!mon)
1219 return NULL; 1153 return NULL;
1154
1220 if (mon->next) 1155 if (mon->next)
1221 return mon->next->ob; 1156 return mon->next->ob;
1222 else 1157 else
1223 return first_mon_info->ob; 1158 return first_mon_info->ob;
1224 1159
1225} 1160}
1226 1161
1227/* mon_info_msg() - generate a message detailing the properties 1162/* mon_info_msg() - generate a message detailing the properties
1228 * of a randomly selected monster. 1163 * of a randomly selected monster.
1229 */ 1164 */
1230static const char * 1165static const char *
1231mon_info_msg (int level, int booksize) 1166mon_info_msg (int level)
1232{ 1167{
1233 static dynbuf_text buf; buf.clear (); 1168 static dynbuf_text buf; buf.clear ();
1234 1169
1235 /*preamble */ 1170 /*preamble */
1236 buf << "This beastiary contains:\n"; 1171 buf << "This beastiary contains:\n";
1237 1172
1238 /* 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
1239 * document. 1174 * document.
1240 * 8-96 Had to change this a bit, otherwise there would 1175 * 8-96 Had to change this a bit, otherwise there would
1241 * have been an impossibly large number of combinations 1176 * have been an impossibly large number of combinations
1242 * of text! (and flood out the available number of titles 1177 * of text! (and flood out the available number of titles
1243 * in the archive in a snap!) -b.t. 1178 * in the archive in a snap!) -b.t.
1244 */ 1179 */
1245 object *tmp = get_random_mon (level * 3); 1180 object *tmp = get_random_mon (level * 3);
1246 while (tmp && buf.size () < BOOK_BUF) 1181 while (tmp && buf.size () < BOOK_BUF)
1247 { 1182 {
1248 /* monster description */ 1183 /* monster description */
… …
1262 1197
1263/* artifact_msg() - generate a message detailing the properties 1198/* artifact_msg() - generate a message detailing the properties
1264 * of 1-6 artifacts drawn sequentially from the artifact list. 1199 * of 1-6 artifacts drawn sequentially from the artifact list.
1265 */ 1200 */
1266static const char * 1201static const char *
1267artifact_msg (int level, int booksize) 1202artifact_msg (int level)
1268{ 1203{
1269 artifactlist *al = NULL; 1204 artifactlist *al = NULL;
1270 artifact *art; 1205 artifact *art;
1271 int chance, i, type, index; 1206 int chance, i, type, index;
1272 int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1; 1207 int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1;
… …
1286 * for that type exists! 1221 * for that type exists!
1287 */ 1222 */
1288 i = 0; 1223 i = 0;
1289 do 1224 do
1290 { 1225 {
1291 index = rndm (sizeof (art_name_array) / sizeof (arttypename)); 1226 index = rndm (array_length (art_name_array));
1292 type = art_name_array[index].type; 1227 type = art_name_array[index].type;
1293 al = find_artifactlist (type); 1228 al = find_artifactlist (type);
1294 i++; 1229 i++;
1295 } 1230 }
1296 while ((al == NULL) && (i < 10)); 1231 while ((al == NULL) && (i < 10));
… …
1316 buf.printf ("Herein %s detailed %s...\n", 1251 buf.printf ("Herein %s detailed %s...\n",
1317 book_entries > 1 ? "are" : "is", 1252 book_entries > 1 ? "are" : "is",
1318 book_entries > 1 ? "some artifacts" : "an artifact"); 1253 book_entries > 1 ? "some artifacts" : "an artifact");
1319 1254
1320 /* artifact msg attributes loop. Lets keep adding entries to the 'book' 1255 /* artifact msg attributes loop. Lets keep adding entries to the 'book'
1321 * 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)
1322 */ 1257 */
1323 while (book_entries > 0 && buf.size () < BOOK_BUF) 1258 while (book_entries > 0 && buf.size () < BOOK_BUF)
1324 { 1259 {
1325 1260
1326 if (!art) 1261 if (!art)
… …
1369 1304
1370 /* properties of the artifact */ 1305 /* properties of the artifact */
1371 tmp = object::create (); 1306 tmp = object::create ();
1372 add_abilities (tmp, art->item); 1307 add_abilities (tmp, art->item);
1373 tmp->type = type; 1308 tmp->type = type;
1374 SET_FLAG (tmp, FLAG_IDENTIFIED); 1309 tmp->set_flag (FLAG_IDENTIFIED);
1375 if ((ch = describe_item (tmp, 0)) && strlen (ch) > 1) 1310 if ((ch = describe_item (tmp, 0)) && strlen (ch) > 1)
1376 buf << "\rProperties of this artifact include:\r" << ch << "\n"; 1311 buf << "\rProperties of this artifact include:\r" << ch << "\n";
1377 1312
1378 tmp->destroy (); 1313 tmp->destroy ();
1379 1314
… …
1387/***************************************************************************** 1322/*****************************************************************************
1388 * Spellpath message generation 1323 * Spellpath message generation
1389 *****************************************************************************/ 1324 *****************************************************************************/
1390 1325
1391/* spellpath_msg() - generate a message detailing the member 1326/* spellpath_msg() - generate a message detailing the member
1392 * incantations/prayers (and some of their properties) belonging to 1327 * incantations/prayers (and some of their properties) belonging to
1393 * a given spellpath. 1328 * a given spellpath.
1394 */ 1329 */
1395static char * 1330static char *
1396spellpath_msg (int level, int booksize) 1331spellpath_msg (int level)
1397{ 1332{
1398 static dynbuf_text buf; buf.clear (); 1333 static dynbuf_text buf; buf.clear ();
1399 1334
1400 static char retbuf[BOOK_BUF];
1401 char tmpbuf[BOOK_BUF];
1402 int path = rndm (NRSPELLPATHS), prayers = rndm (2); 1335 int path = rndm (NRSPELLPATHS), prayers = rndm (2);
1403 uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; 1336 uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path];
1404 archetype *at; 1337 archetype *at;
1405 1338
1406 /* Preamble */ 1339 /* Preamble */
… …
1427 } 1360 }
1428 1361
1429 /* Geez, no spells were generated. */ 1362 /* Geez, no spells were generated. */
1430 if (!seen) 1363 if (!seen)
1431 if (rndm (4)) /* usually, lets make a recursive call... */ 1364 if (rndm (4)) /* usually, lets make a recursive call... */
1432 return spellpath_msg (level, booksize); 1365 return spellpath_msg (level);
1433 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. */
1434 buf << "- no known spells exist.\n"; 1367 buf << "- no known spells exist.\n";
1435 1368
1436 return buf; 1369 return buf;
1437} 1370}
… …
1448 int chance; 1381 int chance;
1449 1382
1450 static dynbuf_text buf; buf.clear (); 1383 static dynbuf_text buf; buf.clear ();
1451 1384
1452 /* the higher the book level, the more complex (ie number of 1385 /* the higher the book level, the more complex (ie number of
1453 * ingredients) the formula can be. 1386 * ingredients) the formula can be.
1454 */ 1387 */
1455 fl = get_formulalist (rndm (level) / 3 + 1); 1388 fl = get_formulalist (rndm (level) / 3 + 1);
1456 1389
1457 if (!fl) 1390 if (!fl)
1458 fl = get_formulalist (1); /* safety */ 1391 fl = get_formulalist (1); /* safety */
… …
1568 1501
1569/* god_info_msg() - generate a message detailing the properties 1502/* god_info_msg() - generate a message detailing the properties
1570 * of a random god. Used by the book hack. b.t. 1503 * of a random god. Used by the book hack. b.t.
1571 */ 1504 */
1572static const char * 1505static const char *
1573god_info_msg (int level, int booksize) 1506god_info_msg (int level)
1574{ 1507{
1575 const char *name = NULL; 1508 const char *name = NULL;
1576 object *god = pntr_to_god_obj (get_rand_god ()); 1509 object *god = pntr_to_god_obj (get_rand_god ());
1577 1510
1578 static dynbuf_text buf; buf.clear (); 1511 static dynbuf_text buf; buf.clear ();
… …
1616 int i; 1549 int i;
1617 1550
1618 if (enemy && !(god->path_denied & PATH_TURNING)) 1551 if (enemy && !(god->path_denied & PATH_TURNING))
1619 if ((i = nstrtok (enemy, ",")) > 0) 1552 if ((i = nstrtok (enemy, ",")) > 0)
1620 { 1553 {
1621 char tmpbuf[MAX_BUF];
1622
1623 buf << "The holy words of " << name 1554 buf << "The holy words of " << name
1624 << " have the power to slay creatures belonging to the "; 1555 << " have the power to slay creatures belonging to the ";
1625 1556
1626 if (i > 1) 1557 if (i > 1)
1627 buf << "following races:" << strtoktolin (enemy, ","); 1558 buf << "following races:" << strtoktolin (enemy, ",");
… …
1703 { /* spell paths */ 1634 { /* spell paths */
1704 //TODO: 1635 //TODO:
1705 int has_effect = 0, tmpvar; 1636 int has_effect = 0, tmpvar;
1706 char tmpbuf[MAX_BUF]; 1637 char tmpbuf[MAX_BUF];
1707 1638
1708 sprintf (tmpbuf, "\n");
1709 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);
1710 strcat (tmpbuf, "are mystically transformed. Effects of this include:\n"); 1640 strcat (tmpbuf, "are mystically transformed. Effects of this include:\n");
1711 1641
1712 if ((tmpvar = god->path_attuned)) 1642 if ((tmpvar = god->path_attuned))
1713 { 1643 {
… …
1741 buf << "[Unfortunately the rest of the information is hopelessly garbled!]"; 1671 buf << "[Unfortunately the rest of the information is hopelessly garbled!]";
1742 1672
1743 return buf; 1673 return buf;
1744} 1674}
1745 1675
1746/* tailor_readable_ob()- The main routine. This chooses a random 1676/* tailor_readable_ob()- The main routine. This chooses a random
1747 * message to put in given readable object (type==BOOK) which will 1677 * message to put in given readable object (type==BOOK) which will
1748 * 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-
1749 * termine the value of the information we will insert. Higher 1679 * termine the value of the information we will insert. Higher
1750 * values mean the book will (generally) have better/more info. 1680 * values mean the book will (generally) have better/more info.
1751 * See individual cases as to how this will be utilized. 1681 * See individual cases as to how this will be utilized.
1752 * "Book" name/content length are based on the weight of the 1682 * "Book" name/content length are based on the weight of the
1753 * 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
1754 * choose the kind of message to generate. 1684 * choose the kind of message to generate.
1755 * -b.t. thomas@astro.psu.edu 1685 * -b.t. thomas@astro.psu.edu
1756 * 1686 *
1757 * book is the object we are creating into. 1687 * book is the object we are creating into.
1758 * 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
1759 * message type - otherwise a random value is used. 1689 * message type - otherwise a random value is used.
1760 * 1690 *
1761 */ 1691 */
1762void 1692void
1763tailor_readable_ob (object *book, int msg_type) 1693tailor_readable_ob (object *book, int msg_type)
1764{ 1694{
1765 char msgbuf[BOOK_BUF];
1766 int level = book->level ? rndm (book->level) + 1 : 1; 1695 int level = book->level ? rndm (book->level) + 1 : 1;
1767 int book_buf_size;
1768 1696
1769 /* safety */ 1697 /* safety */
1770 if (book->type != BOOK) 1698 if (book->type != BOOK)
1771 return; 1699 return;
1772 1700
1773 if (level <= 0) 1701 if (level <= 0)
1774 return; /* if no level no point in doing any more... */ 1702 return; /* if no level no point in doing any more... */
1775
1776 /* Max text length this book can have. */
1777 book_buf_size = BOOKSIZE (book);
1778 1703
1779 /* &&& The message switch &&& */ 1704 /* &&& The message switch &&& */
1780 /* 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.
1781 */ 1706 */
1782 /* 1707 /*
… …
1785 * 2) make sure there is an entry in max_titles[] array. 1710 * 2) make sure there is an entry in max_titles[] array.
1786 * 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()
1787 * and add_authour(). 1712 * and add_authour().
1788 * 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
1789 */ 1714 */
1715 const char *new_msg = "";
1790 msg_type = msg_type > 0 ? msg_type : rndm (8); 1716 msg_type = msg_type > 0 ? msg_type : rndm (8);
1791 switch (msg_type) 1717 switch (msg_type)
1792 { 1718 {
1793 case 1: /* monster attrib */ 1719 case 1: /* monster attrib */
1794 strcpy (msgbuf, mon_info_msg (level, book_buf_size)); 1720 new_msg = mon_info_msg (level);
1795 break; 1721 break;
1796 case 2: /* artifact attrib */ 1722 case 2: /* artifact attrib */
1797 strcpy (msgbuf, artifact_msg (level, book_buf_size)); 1723 new_msg = artifact_msg (level);
1798 break; 1724 break;
1799 case 3: /* grouping incantations/prayers by path */ 1725 case 3: /* grouping incantations/prayers by path */
1800 strcpy (msgbuf, spellpath_msg (level, book_buf_size)); 1726 new_msg = spellpath_msg (level);
1801 break; 1727 break;
1802 case 4: /* describe an alchemy formula */ 1728 case 4: /* describe an alchemy formula */
1803 make_formula_book (book, level); 1729 make_formula_book (book, level);
1804 /* make_formula_book already gives title */ 1730 /* make_formula_book already gives title */
1805 return; 1731 return;
1806 case 5: /* bits of information about a god */ 1732 case 5: /* bits of information about a god */
1807 strcpy (msgbuf, god_info_msg (level, book_buf_size)); 1733 new_msg = god_info_msg (level);
1808 break; 1734 break;
1809 case 0: /* use info list in lib/ */ 1735 case 0: /* use info list in lib/ */
1810 default: 1736 default:
1811 cfperl_make_book (book, level); 1737 cfperl_make_book (book, level);
1812 /* already gives title */ 1738 /* already gives title */
1813 return; 1739 return;
1814 } 1740 }
1815 1741
1816 if (strlen (msgbuf) > 1) 1742 if (strlen (new_msg) > 1)
1817 { 1743 {
1818 book->msg = msgbuf; 1744 book->msg = new_msg;
1819 /* 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 */
1820 change_book (book, msg_type); 1746 change_book (book, msg_type);
1821 } 1747 }
1822} 1748}
1823
1824
1825/*****************************************************************************
1826 *
1827 * Cleanup routine for readble stuff.
1828 *
1829 *****************************************************************************/
1830
1831void
1832free_all_readable (void)
1833{
1834 titlelist *tlist, *tnext;
1835 title *title1, *titlenext;
1836 linked_char *lmsg, *nextmsg;
1837 objectlink *monlink, *nextmon;
1838
1839 LOG (llevDebug, "freeing all book information\n");
1840
1841 for (tlist = booklist; tlist; tlist = tnext)
1842 {
1843 tnext = tlist->next;
1844
1845 for (title1 = tlist->first_book; title1; title1 = titlenext)
1846 {
1847 titlenext = title1->next;
1848 delete title1;
1849 }
1850
1851 delete tlist;
1852 }
1853
1854 for (lmsg = first_msg; lmsg; lmsg = nextmsg)
1855 {
1856 nextmsg = lmsg->next;
1857 delete lmsg;
1858 }
1859
1860 for (monlink = first_mon_info; monlink; monlink = nextmon)
1861 {
1862 nextmon = monlink->next;
1863 delete monlink;
1864 }
1865}
1866
1867 1749
1868/***************************************************************************** 1750/*****************************************************************************
1869 * 1751 *
1870 * Writeback routine for updating the bookarchive. 1752 * Writeback routine for updating the bookarchive.
1871 * 1753 *
1872 ****************************************************************************/ 1754 ****************************************************************************/
1873
1874/* write_book_archive() - write out the updated book archive */ 1755/* write_book_archive() - write out the updated book archive */
1875
1876void 1756void
1877write_book_archive (void) 1757write_book_archive ()
1878{ 1758{
1879 FILE *fp; 1759 FILE *fp;
1880 int index = 0; 1760 int index = 0;
1881 char fname[MAX_BUF]; 1761 char fname[MAX_BUF];
1882 title *book = NULL; 1762 title *book = NULL;
1883 titlelist *bl = get_titlelist (0); 1763 titlelist *bl = get_titlelist (0);
1884 1764
1885 /* If nothing changed, don't write anything */ 1765 /* If nothing changed, don't write anything */
1886 if (!need_to_write_bookarchive) 1766 if (!need_to_write_bookarchive)
1887 return; 1767 return;
1768
1888 need_to_write_bookarchive = 0; 1769 need_to_write_bookarchive = 0;
1889 1770
1890 sprintf (fname, "%s/bookarch", settings.localdir); 1771 sprintf (fname, "%s/bookarch", settings.localdir);
1891 LOG (llevDebug, "Updating book archive: %s...\n", fname); 1772 LOG (llevDebug, "Updating book archive: %s...\n", fname);
1892 1773
1893 if ((fp = fopen (fname, "w")) == NULL) 1774 if ((fp = fopen (fname, "w")) == NULL)
1894 {
1895 LOG (llevDebug, "Can't open book archive file %s\n", fname); 1775 LOG (llevDebug, "Can't open book archive file %s\n", fname);
1896 }
1897 else 1776 else
1898 { 1777 {
1899 while (bl) 1778 while (bl)
1900 { 1779 {
1901 for (book = bl->first_book; book; book = book->next) 1780 for (book = bl->first_book; book; book = book->next)
… …
1908 fprintf (fp, "type %d\n", index); 1787 fprintf (fp, "type %d\n", index);
1909 fprintf (fp, "size %d\n", book->size); 1788 fprintf (fp, "size %d\n", book->size);
1910 fprintf (fp, "index %d\n", book->msg_index); 1789 fprintf (fp, "index %d\n", book->msg_index);
1911 fprintf (fp, "end\n"); 1790 fprintf (fp, "end\n");
1912 } 1791 }
1792
1913 bl = bl->next; 1793 bl = bl->next;
1914 index++; 1794 index++;
1915 } 1795 }
1796
1916 fclose (fp); 1797 fclose (fp);
1917 chmod (fname, SAVE_MODE); 1798 chmod (fname, SAVE_MODE);
1918 } 1799 }
1919} 1800}
1801
1920readable_message_type * 1802readable_message_type *
1921get_readable_message_type (object *readable) 1803get_readable_message_type (object *readable)
1922{ 1804{
1923 uint8 subtype = readable->subtype; 1805 uint8 subtype = readable->subtype;
1924 1806

Diff Legend

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