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 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 |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * 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> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* This file contains code relevant to the BOOKS hack -- designed |
25 | /* This file contains code relevant to the BOOKS hack -- designed |
25 | * to allow randomly occuring messages in non-magical texts. |
26 | * to allow randomly occuring messages in non-magical texts. |
… | |
… | |
30 | #include <global.h> |
31 | #include <global.h> |
31 | #include <book.h> |
32 | #include <book.h> |
32 | #include <living.h> |
33 | #include <living.h> |
33 | #include <spells.h> |
34 | #include <spells.h> |
34 | |
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 | |
111 | static int nrofmon = 0, need_to_write_bookarchive = 0; |
111 | static 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 */ |
|
|
116 | static int nrofmsg = 0; |
|
|
117 | |
|
|
118 | /* first_msg is the started of the linked list of messages as read from |
|
|
119 | * the messages file |
|
|
120 | */ |
|
|
121 | static linked_char *first_msg = NULL; |
|
|
122 | |
|
|
123 | /* |
113 | /* |
124 | * Spellpath information |
114 | * Spellpath information |
125 | */ |
115 | */ |
126 | |
|
|
127 | static uint32 spellpathdef[NRSPELLPATHS] = { |
116 | static 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, |
… | |
… | |
412 | static const char *const book_descrpt[] = { |
401 | static 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 | }; |
502 | int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); |
491 | static int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); |
503 | |
492 | |
504 | static int max_titles[6] = { |
493 | static 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 | |
519 | static titlelist * |
508 | static titlelist * |
520 | get_empty_booklist (void) |
509 | get_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 | |
530 | static title * |
519 | static title * |
531 | get_empty_book (void) |
520 | get_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 | |
547 | static titlelist * |
536 | static titlelist * |
548 | get_titlelist (int i) |
537 | get_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 | */ |
574 | |
566 | static int |
575 | int |
|
|
576 | nstrtok (const char *buf1, const char *buf2) |
567 | nstrtok (const char *buf1, const char *buf2) |
577 | { |
568 | { |
578 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
569 | char *tbuf, sbuf[12], buf[MAX_BUF]; |
579 | int number = 0; |
570 | int number = 0; |
580 | |
571 | |
581 | if (!buf1 || !buf2) |
572 | if (!buf1 || !buf2) |
582 | return 0; |
573 | return 0; |
583 | sprintf (buf, "%s", buf1); |
574 | |
584 | sprintf (sbuf, "%s", buf2); |
575 | strcpy (buf, buf1); |
|
|
576 | strcpy (sbuf, buf2); |
|
|
577 | |
585 | tbuf = strtok (buf, sbuf); |
578 | tbuf = strtok (buf, sbuf); |
586 | while (tbuf) |
579 | while (tbuf) |
587 | { |
580 | { |
588 | number++; |
581 | number++; |
589 | tbuf = strtok (NULL, sbuf); |
582 | tbuf = strtok (NULL, sbuf); |
… | |
… | |
593 | |
586 | |
594 | /* strtoktolin() - takes a string in buf1 and separates it into |
587 | /* strtoktolin() - takes a string in buf1 and separates it into |
595 | * a list of strings delimited by buf2. Then returns a comma |
588 | * a list of strings delimited by buf2. Then returns a comma |
596 | * separated string w/ decent punctuation. |
589 | * separated string w/ decent punctuation. |
597 | */ |
590 | */ |
598 | |
591 | static char * |
599 | char * |
|
|
600 | strtoktolin (const char *buf1, const char *buf2) |
592 | strtoktolin (const char *buf1, const char *buf2) |
601 | { |
593 | { |
602 | int maxi, i = nstrtok (buf1, buf2); |
594 | int maxi, i = nstrtok (buf1, buf2); |
603 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
595 | char *tbuf, buf[MAX_BUF], sbuf[12]; |
604 | static char rbuf[BOOK_BUF]; |
596 | static char rbuf[BOOK_BUF]; |
… | |
… | |
609 | strcpy (rbuf, " "); |
601 | strcpy (rbuf, " "); |
610 | tbuf = strtok (buf, sbuf); |
602 | tbuf = strtok (buf, sbuf); |
611 | while (tbuf && i > 0) |
603 | while (tbuf && i > 0) |
612 | { |
604 | { |
613 | strcat (rbuf, tbuf); |
605 | strcat (rbuf, tbuf); |
|
|
606 | |
614 | i--; |
607 | i--; |
615 | if (i == 1 && maxi > 1) |
608 | if (i == 1 && maxi > 1) |
616 | strcat (rbuf, " and "); |
609 | strcat (rbuf, " and "); |
617 | else if (i > 0 && maxi > 1) |
610 | else if (i > 0 && maxi > 1) |
618 | strcat (rbuf, ", "); |
611 | strcat (rbuf, ", "); |
619 | else |
612 | else |
620 | strcat (rbuf, "."); |
613 | strcat (rbuf, "."); |
|
|
614 | |
621 | tbuf = strtok (NULL, sbuf); |
615 | tbuf = strtok (NULL, sbuf); |
622 | } |
616 | } |
623 | return (char *) rbuf; |
|
|
624 | } |
|
|
625 | |
617 | |
626 | int |
|
|
627 | book_overflow (const char *buf1, const char *buf2, int booksize) |
|
|
628 | { |
|
|
629 | |
|
|
630 | if (buf_overflow (buf1, buf2, BOOK_BUF - 2) /* 2 less so always room for trailing \n */ |
|
|
631 | || buf_overflow (buf1, buf2, booksize)) |
|
|
632 | return 1; |
|
|
633 | return 0; |
618 | return rbuf; |
634 | |
|
|
635 | |
|
|
636 | } |
619 | } |
637 | |
620 | |
638 | /***************************************************************************** |
621 | /***************************************************************************** |
639 | * |
622 | * |
640 | * Start of initialisation related functions. |
623 | * Start of initialisation related functions. |
… | |
… | |
644 | /* init_book_archive() - if not called before, initialise the info list |
627 | /* init_book_archive() - if not called before, initialise the info list |
645 | * 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 |
646 | * created and updated across multiple runs of the program. |
629 | * created and updated across multiple runs of the program. |
647 | */ |
630 | */ |
648 | static void |
631 | static void |
649 | init_book_archive (void) |
632 | init_book_archive () |
650 | { |
633 | { |
651 | FILE *fp; |
|
|
652 | int comp, nroftitle = 0; |
634 | int nroftitle = 0; |
653 | char buf[MAX_BUF], fname[MAX_BUF], *cp; |
|
|
654 | title *book = NULL; |
|
|
655 | titlelist *bl = get_empty_booklist (); |
635 | titlelist *bl = get_empty_booklist (); |
656 | static int did_init_barch; |
|
|
657 | |
636 | |
658 | 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"); |
659 | return; |
642 | return; |
660 | |
|
|
661 | did_init_barch = 1; |
|
|
662 | |
|
|
663 | if (!booklist) |
|
|
664 | booklist = bl; |
|
|
665 | |
|
|
666 | sprintf (fname, "%s/bookarch", settings.localdir); |
|
|
667 | LOG (llevDebug, " Reading bookarch from %s...\n", fname); |
|
|
668 | |
|
|
669 | if ((fp = open_and_uncompress (fname, 0, &comp)) != NULL) |
|
|
670 | { |
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 | |
671 | int value, type = 0; |
654 | int type = -1; |
672 | size_t i; |
|
|
673 | |
655 | |
674 | while (fgets (buf, MAX_BUF, fp) != NULL) |
656 | for (;;) |
675 | { |
657 | { |
676 | if (*buf == '#') |
658 | thawer.next (); |
677 | continue; |
659 | |
678 | if ((cp = strchr (buf, '\n')) != NULL) |
660 | switch (thawer.kw) |
679 | *cp = '\0'; |
|
|
680 | cp = buf; |
|
|
681 | while (*cp == ' ') /* Skip blanks */ |
|
|
682 | cp++; |
|
|
683 | if (!strncmp (cp, "title", 4)) |
|
|
684 | { |
661 | { |
685 | book = get_empty_book (); /* init new book entry */ |
662 | case KW_type: thawer.get (type ); break; |
686 | book->name = strchr (cp, ' ') + 1; |
663 | case KW_authour: thawer.get (book->authour ); break; |
687 | type = -1; |
664 | case KW_arch: thawer.get (book->archname ); break; |
688 | nroftitle++; |
665 | case KW_level: thawer.get (book->level ); break; |
689 | continue; |
666 | case KW_size: thawer.get (book->size ); break; |
690 | } |
667 | case KW_index: thawer.get (book->msg_index); break; |
691 | if (!strncmp (cp, "authour", 4)) |
668 | |
692 | { |
669 | case KW_end: |
693 | book->authour = strchr (cp, ' ') + 1; |
|
|
694 | } |
|
|
695 | if (!strncmp (cp, "arch", 4)) |
|
|
696 | { |
|
|
697 | book->archname = strchr (cp, ' ') + 1; |
|
|
698 | } |
|
|
699 | else if (sscanf (cp, "level %d", &value)) |
|
|
700 | { |
|
|
701 | book->level = (uint16) value; |
|
|
702 | } |
|
|
703 | else if (sscanf (cp, "type %d", &value)) |
|
|
704 | { |
|
|
705 | type = (uint16) value; |
|
|
706 | } |
|
|
707 | else if (sscanf (cp, "size %d", &value)) |
|
|
708 | { |
|
|
709 | book->size = (uint16) value; |
|
|
710 | } |
|
|
711 | else if (sscanf (cp, "index %d", &value)) |
|
|
712 | { |
|
|
713 | book->msg_index = (uint16) value; |
|
|
714 | } |
|
|
715 | else if (!strncmp (cp, "end", 3)) |
|
|
716 | { /* link it */ |
670 | /* link it */ |
717 | bl = get_titlelist (type); |
671 | bl = get_titlelist (type); |
718 | book->next = bl->first_book; |
672 | book->next = bl->first_book; |
719 | bl->first_book = book; |
673 | bl->first_book = book; |
720 | bl->number++; |
674 | bl->number++; |
|
|
675 | ++nroftitle; |
|
|
676 | goto book_done; |
|
|
677 | |
|
|
678 | default: |
|
|
679 | delete book; |
|
|
680 | goto book_done; |
721 | } |
681 | } |
722 | } |
682 | } |
|
|
683 | |
|
|
684 | book_done: |
|
|
685 | thawer.next (); |
|
|
686 | } |
|
|
687 | |
723 | LOG (llevDebug, "book archives(used/avail): \n"); |
688 | LOG (llevDebug, "book archives(used/avail): \n"); |
|
|
689 | int i; |
724 | 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++) |
725 | { |
|
|
726 | LOG (llevDebug, " (%d/%d)\n", bl->number, max_titles[i]); |
691 | LOG (llevDebug, " (%d/%d)\n", bl->number, max_titles[i]); |
727 | } |
|
|
728 | close_and_delete (fp, comp); |
|
|
729 | } |
|
|
730 | |
692 | |
731 | #ifdef BOOK_MSG_DEBUG |
|
|
732 | LOG (llevDebug, "init_book_archive() got %d titles.\n", nroftitle); |
693 | LOG (llevDebug, "init_book_archive() got %d titles.\n", nroftitle); |
733 | #endif |
|
|
734 | LOG (llevDebug, " done.\n"); |
|
|
735 | } |
694 | } |
736 | |
695 | |
737 | /* init_mon_info() - creates the linked list of pointers to |
696 | /* init_mon_info() - creates the linked list of pointers to |
738 | * monster archetype objects if not called previously |
697 | * monster archetype objects if not called previously |
739 | */ |
698 | */ |
740 | |
|
|
741 | static void |
699 | static void |
742 | init_mon_info (void) |
700 | init_mon_info () |
743 | { |
701 | { |
744 | archetype *at; |
702 | archetype *at; |
745 | static int did_init_mon_info = 0; |
703 | static int did_init_mon_info = 0; |
746 | |
704 | |
747 | if (did_init_mon_info) |
705 | if (did_init_mon_info) |
748 | return; |
706 | return; |
749 | |
707 | |
750 | did_init_mon_info = 1; |
708 | did_init_mon_info = 1; |
751 | |
709 | |
752 | for_all_archetypes (at) |
710 | for_all_archetypes (at) |
753 | { |
711 | if (at->flag [FLAG_MONSTER] |
754 | 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])) |
755 | { |
714 | { |
756 | objectlink *mon = new objectlink; |
715 | objectlink *mon = new objectlink; |
757 | |
716 | |
758 | mon->ob = at; |
717 | mon->ob = at; |
759 | mon->next = first_mon_info; |
718 | mon->next = first_mon_info; |
760 | first_mon_info = mon; |
719 | first_mon_info = mon; |
761 | nrofmon++; |
720 | nrofmon++; |
762 | } |
721 | } |
763 | } |
|
|
764 | |
722 | |
765 | LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); |
723 | LOG (llevDebug, "init_mon_info() got %d monsters\n", nrofmon); |
766 | } |
724 | } |
767 | |
725 | |
768 | /* init_readable() - initialise linked lists utilized by |
726 | /* init_readable() - initialise linked lists utilized by |
769 | * message functions in tailor_readable_ob() |
727 | * message functions in tailor_readable_ob() |
770 | * |
728 | * |
771 | * This is the function called by the main routine to initialise |
729 | * This is the function called by the main routine to initialise |
772 | * all the readable information. |
730 | * all the readable information. |
773 | */ |
731 | */ |
774 | void |
732 | void |
775 | init_readable (void) |
733 | init_readable () |
776 | { |
734 | { |
777 | static int did_this; |
735 | static int did_this; |
778 | |
736 | |
779 | if (did_this) |
737 | if (did_this) |
780 | return; |
738 | return; |
… | |
… | |
817 | else |
775 | else |
818 | t = t->next; |
776 | t = t->next; |
819 | |
777 | |
820 | #ifdef ARCHIVE_DEBUG |
778 | #ifdef ARCHIVE_DEBUG |
821 | if (t) |
779 | if (t) |
822 | 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); |
823 | #endif |
781 | #endif |
824 | |
782 | |
825 | return t; |
783 | return t; |
826 | } |
784 | } |
827 | |
785 | |
828 | /* 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 |
829 | * handled directly in change_book_name(). Names are based on text |
787 | * handled directly in change_book_name(). Names are based on text |
830 | * msgtype |
788 | * msgtype |
831 | * this sets book book->name based on msgtype given. What name |
789 | * this sets book book->name based on msgtype given. What name |
832 | * is given is based on various criteria |
790 | * is given is based on various criteria |
833 | */ |
791 | */ |
834 | |
|
|
835 | static void |
792 | static void |
836 | new_text_name (object *book, int msgtype) |
793 | new_text_name (object *book, int msgtype) |
837 | { |
794 | { |
838 | int nbr; |
795 | const char *name; |
839 | char name[MAX_BUF]; |
|
|
840 | |
796 | |
841 | if (book->type != BOOK) |
797 | if (book->type != BOOK) |
842 | return; |
798 | return; |
843 | |
799 | |
844 | switch (msgtype) |
800 | switch (msgtype) |
845 | { |
801 | { |
846 | case 1: /*monster */ |
802 | case 1: /*monster */ |
847 | nbr = sizeof (mon_book_name) / sizeof (char *); |
803 | name = mon_book_name[rndm (array_length (mon_book_name))]; |
848 | assign (name, mon_book_name[rndm (nbr)]); |
|
|
849 | break; |
804 | break; |
850 | case 2: /*artifact */ |
805 | case 2: /*artifact */ |
851 | nbr = sizeof (art_book_name) / sizeof (char *); |
806 | name = art_book_name[rndm (array_length (art_book_name))]; |
852 | assign (name, art_book_name[rndm (nbr)]); |
|
|
853 | break; |
807 | break; |
854 | case 3: /*spellpath */ |
808 | case 3: /*spellpath */ |
855 | nbr = sizeof (path_book_name) / sizeof (char *); |
809 | name = path_book_name[rndm (array_length (path_book_name))]; |
856 | assign (name, path_book_name[rndm (nbr)]); |
|
|
857 | break; |
810 | break; |
858 | case 4: /*alchemy */ |
811 | case 4: /*alchemy */ |
859 | nbr = sizeof (formula_book_name) / sizeof (char *); |
812 | name = formula_book_name[rndm (array_length (formula_book_name))]; |
860 | assign (name, formula_book_name[rndm (nbr)]); |
|
|
861 | break; |
813 | break; |
862 | case 5: /*gods */ |
814 | case 5: /*gods */ |
863 | nbr = sizeof (gods_book_name) / sizeof (char *); |
815 | name = gods_book_name[rndm (array_length (gods_book_name))]; |
864 | assign (name, gods_book_name[rndm (nbr)]); |
|
|
865 | break; |
816 | break; |
866 | case 6: /*msg file */ |
817 | case 6: /*msg file */ |
867 | default: |
818 | default: |
868 | if (book->weight > 2000) |
819 | name = book->weight > 2000 /* based on weight */ |
869 | { /* based on weight */ |
820 | ? heavy_book_name [rndm (array_length (heavy_book_name))] |
870 | nbr = sizeof (heavy_book_name) / sizeof (char *); |
821 | : light_book_name [rndm (array_length (light_book_name))]; |
871 | assign (name, heavy_book_name[rndm (nbr)]); |
|
|
872 | } |
|
|
873 | else if (book->weight < 2001) |
|
|
874 | { |
|
|
875 | nbr = sizeof (light_book_name) / sizeof (char *); |
|
|
876 | assign (name, light_book_name[rndm (nbr)]); |
|
|
877 | } |
|
|
878 | break; |
822 | break; |
879 | } |
823 | } |
880 | |
824 | |
881 | book->name = name; |
825 | book->name = name; |
882 | } |
826 | } |
883 | |
827 | |
884 | /* add_book_author() |
828 | /* add_book_author() |
885 | * 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 |
886 | * and sets op->title to that value |
830 | * and sets op->title to that value |
887 | */ |
831 | */ |
888 | |
832 | |
889 | static void |
833 | static void |
890 | add_author (object *op, int msgtype) |
834 | add_author (object *op, int msgtype) |
891 | { |
835 | { |
892 | char title[MAX_BUF], name[MAX_BUF]; |
836 | const char *name; |
893 | int nbr = sizeof (book_author) / sizeof (char *); |
|
|
894 | |
837 | |
895 | if (msgtype < 0 || strlen (op->msg) < 5) |
838 | if (msgtype < 0 || strlen (op->msg) < 5) |
896 | return; |
839 | return; |
897 | |
840 | |
898 | switch (msgtype) |
841 | switch (msgtype) |
899 | { |
842 | { |
900 | case 1: /* monster */ |
843 | case 1: /* monster */ |
901 | nbr = sizeof (mon_author) / sizeof (char *); |
844 | name = mon_author[rndm (array_length (mon_author))]; |
902 | assign (name, mon_author[rndm (nbr)]); |
|
|
903 | break; |
845 | break; |
904 | case 2: /* artifacts */ |
846 | case 2: /* artifacts */ |
905 | nbr = sizeof (art_author) / sizeof (char *); |
847 | name = art_author[rndm (array_length (art_author))]; |
906 | assign (name, art_author[rndm (nbr)]); |
|
|
907 | break; |
848 | break; |
908 | case 3: /* spellpath */ |
849 | case 3: /* spellpath */ |
909 | nbr = sizeof (path_author) / sizeof (char *); |
850 | name = path_author[rndm (array_length (path_author))]; |
910 | assign (name, path_author[rndm (nbr)]); |
|
|
911 | break; |
851 | break; |
912 | case 4: /* alchemy */ |
852 | case 4: /* alchemy */ |
913 | nbr = sizeof (formula_author) / sizeof (char *); |
853 | name = formula_author[rndm (array_length (formula_author))]; |
914 | assign (name, formula_author[rndm (nbr)]); |
|
|
915 | break; |
854 | break; |
916 | case 5: /* gods */ |
855 | case 5: /* gods */ |
917 | nbr = sizeof (gods_author) / sizeof (char *); |
856 | name = gods_author[rndm (array_length (gods_author))]; |
918 | assign (name, gods_author[rndm (nbr)]); |
|
|
919 | break; |
857 | break; |
920 | case 6: /* msg file */ |
858 | case 6: /* msg file */ |
921 | default: |
859 | default: |
922 | assign (name, book_author[rndm (nbr)]); |
860 | name = book_author[rndm (array_length (book_author))]; |
923 | } |
861 | } |
924 | |
862 | |
925 | sprintf (title, "of %s", name); |
863 | op->title = format ("of %s", name); |
926 | op->title = title; |
|
|
927 | } |
864 | } |
928 | |
865 | |
929 | /* 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 |
930 | * 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 |
931 | * a match, then unique_book returns true (because inst unique). |
868 | * a match, then unique_book returns true (because inst unique). |
932 | */ |
869 | */ |
933 | |
870 | |
934 | static int |
871 | static int |
935 | unique_book (const object *book, int msgtype) |
872 | unique_book (const object *book, int msgtype) |
936 | { |
873 | { |
937 | title *test; |
|
|
938 | |
|
|
939 | if (!booklist) |
874 | if (!booklist) |
940 | return 1; /* No archival entries! Must be unique! */ |
875 | return 1; /* No archival entries! Must be unique! */ |
941 | |
876 | |
942 | /* 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 |
943 | * return 0. |
878 | * return 0. |
944 | */ |
879 | */ |
945 | for (test = get_titlelist (msgtype)->first_book; test; test = test->next) |
880 | for (title *test = get_titlelist (msgtype)->first_book; test; test = test->next) |
946 | { |
|
|
947 | if (!strcmp (test->name, book->name) && !strcmp (book->title, test->authour)) |
881 | if (test->name == book->name && book->title == test->authour) |
948 | return 0; |
882 | return 0; |
949 | } |
883 | |
950 | return 1; |
884 | return 1; |
951 | } |
885 | } |
952 | |
886 | |
953 | /* add_book_to_list() */ |
887 | /* add_book_to_list() */ |
954 | |
888 | |
… | |
… | |
978 | |
912 | |
979 | /* We have stuff we need to write now */ |
913 | /* We have stuff we need to write now */ |
980 | need_to_write_bookarchive = 1; |
914 | need_to_write_bookarchive = 1; |
981 | |
915 | |
982 | #ifdef ARCHIVE_DEBUG |
916 | #ifdef ARCHIVE_DEBUG |
983 | 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); |
984 | #endif |
918 | #endif |
985 | |
919 | |
986 | } |
920 | } |
987 | |
921 | |
988 | |
922 | |
989 | /* change_book() - give a new, fancier name to generated |
923 | /* change_book() - give a new, fancier name to generated |
990 | * objects of type BOOK and SPELLBOOK. |
924 | * objects of type BOOK and SPELLBOOK. |
991 | * 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 |
992 | * authour/title and message content for BOOKs. Also, we will |
926 | * authour/title and message content for BOOKs. Also, we will |
993 | * alter books that match archive entries to the archival |
927 | * alter books that match archive entries to the archival |
994 | * levels and architypes. -b.t. |
928 | * levels and architypes. -b.t. |
995 | */ |
929 | */ |
996 | |
930 | |
997 | #define MAX_TITLE_CHECK 20 |
931 | #define MAX_TITLE_CHECK 20 |
998 | |
932 | |
999 | void |
933 | static void |
1000 | change_book (object *book, int msgtype) |
934 | change_book (object *book, int msgtype) |
1001 | { |
935 | { |
1002 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
936 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1003 | |
937 | |
1004 | switch (book->type) |
938 | switch (book->type) |
… | |
… | |
1009 | title *t = NULL; |
943 | title *t = NULL; |
1010 | int tries = 0; |
944 | int tries = 0; |
1011 | |
945 | |
1012 | /* 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 |
1013 | * 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, |
1014 | * 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 |
1015 | * room on the titlelist. |
949 | * room on the titlelist. |
1016 | */ |
950 | */ |
1017 | |
951 | |
1018 | if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) |
952 | if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) |
1019 | { |
953 | { |
1020 | /* alter book properties */ |
954 | /* alter book properties */ |
1021 | if (object *tmpbook = get_archetype (t->archname)) |
955 | if (object *tmpbook = archetype::get (t->archname)) |
1022 | { |
956 | { |
1023 | tmpbook->msg = book->msg; |
957 | tmpbook->msg = book->msg; |
1024 | tmpbook->copy_to (book); |
958 | tmpbook->copy_to (book); |
1025 | tmpbook->destroy (); |
959 | tmpbook->destroy (); |
1026 | } |
960 | } |
… | |
… | |
1054 | if (numb == maxnames) |
988 | if (numb == maxnames) |
1055 | { |
989 | { |
1056 | #ifdef ARCHIVE_DEBUG |
990 | #ifdef ARCHIVE_DEBUG |
1057 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
991 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
1058 | #endif |
992 | #endif |
1059 | break; |
|
|
1060 | } |
993 | } |
1061 | /* shouldnt change map-maker books */ |
994 | /* shouldnt change map-maker books */ |
1062 | else if (!book->title) |
995 | else if (!book->title) |
1063 | do |
996 | do |
1064 | { |
997 | { |
… | |
… | |
1071 | |
1004 | |
1072 | /* Now deal with 2 cases. |
1005 | /* Now deal with 2 cases. |
1073 | * 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 |
1074 | * the old book properties. Remember, if the book had |
1007 | * the old book properties. Remember, if the book had |
1075 | * matchd an older entry on the titlelist, we shouldnt |
1008 | * matchd an older entry on the titlelist, we shouldnt |
1076 | * have called this routine in the first place! |
1009 | * have called this routine in the first place! |
1077 | * 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 |
1078 | * the list. |
1011 | * the list. |
1079 | */ |
1012 | */ |
1080 | |
1013 | |
1081 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1014 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1082 | { /* got to check maxnames again */ |
1015 | { /* got to check maxnames again */ |
1083 | #ifdef ARCHIVE_DEBUG |
1016 | #ifdef ARCHIVE_DEBUG |
1084 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames); |
1017 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", &book->name, &book->title, numb, maxnames); |
1085 | #endif |
1018 | #endif |
1086 | /* restore old book properties here */ |
1019 | /* restore old book properties here */ |
1087 | book->title = old_title; |
1020 | book->title = old_title; |
1088 | |
1021 | |
1089 | if (rndm (4)) |
1022 | if (rndm (4)) |
1090 | { |
|
|
1091 | /* Lets give the book a description to individualize it some */ |
1023 | /* Lets give the book a description to individualize it some */ |
1092 | char new_name[MAX_BUF]; |
|
|
1093 | |
|
|
1094 | 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); |
1095 | |
|
|
1096 | book->name = new_name; |
|
|
1097 | } |
|
|
1098 | else |
1025 | else |
1099 | { |
|
|
1100 | book->name = old_name; |
1026 | book->name = old_name; |
1101 | } |
|
|
1102 | } |
1027 | } |
1103 | else if (book->title && strlen (book->msg) > 5) |
1028 | else if (book->title && strlen (book->msg) > 5) |
1104 | { /* archive if long msg texts */ |
1029 | { /* archive if long msg texts */ |
1105 | add_book_to_list (book, msgtype); |
1030 | add_book_to_list (book, msgtype); |
1106 | } |
1031 | } |
… | |
… | |
1123 | |
1048 | |
1124 | /***************************************************************************** |
1049 | /***************************************************************************** |
1125 | * Monster msg generation code. |
1050 | * Monster msg generation code. |
1126 | ****************************************************************************/ |
1051 | ****************************************************************************/ |
1127 | |
1052 | |
1128 | /* get_random_mon() - returns a random monster slected from linked |
1053 | /* get_random_mon() - returns a random monster slected from linked |
1129 | * 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, |
1130 | * then only monsters greater than that level will be returned. |
1055 | * then only monsters greater than that level will be returned. |
1131 | * Changed 971225 to be greater than equal to level passed. Also |
1056 | * Changed 971225 to be greater than equal to level passed. Also |
1132 | * made choosing by level more random. |
1057 | * made choosing by level more random. |
1133 | */ |
1058 | */ |
1134 | |
|
|
1135 | object * |
1059 | object * |
1136 | get_random_mon (int level) |
1060 | get_random_mon (int level) |
1137 | { |
1061 | { |
1138 | objectlink *mon = first_mon_info; |
1062 | objectlink *mon = first_mon_info; |
1139 | int i = 0, monnr; |
1063 | int i = 0, monnr; |
… | |
… | |
1160 | } |
1084 | } |
1161 | |
1085 | |
1162 | /* 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 |
1163 | * 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 |
1164 | * 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 |
1165 | * 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 |
1166 | * 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 |
1167 | * 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 |
1168 | * high level one and return that. Thus, monsters that immediatly followed |
1092 | * high level one and return that. Thus, monsters that immediatly followed |
1169 | * 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 |
1170 | * means some of the dragons would be poorly represented, since they |
1094 | * means some of the dragons would be poorly represented, since they |
… | |
… | |
1197 | |
1121 | |
1198 | /* |
1122 | /* |
1199 | * Returns a description of the monster. This really needs to be |
1123 | * Returns a description of the monster. This really needs to be |
1200 | * redone, as describe_item really gives a pretty internal description. |
1124 | * redone, as describe_item really gives a pretty internal description. |
1201 | */ |
1125 | */ |
1202 | |
1126 | static const char * |
1203 | char * |
|
|
1204 | mon_desc (const object *mon) |
1127 | mon_desc (const object *mon) |
1205 | { |
1128 | { |
1206 | static char retbuf[HUGE_BUF]; |
1129 | static dynbuf_text buf; buf.clear (); |
1207 | |
1130 | |
1208 | sprintf (retbuf, " *** %s ***\n", &mon->name); |
1131 | buf.printf ("B<< %s >>\r", &mon->name); |
1209 | strcat (retbuf, describe_item (mon, NULL)); |
1132 | buf << describe_item (mon, 0); |
1210 | |
1133 | |
1211 | return retbuf; |
1134 | return buf; |
1212 | } |
1135 | } |
1213 | |
1136 | |
1214 | |
1137 | |
1215 | /* 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 |
1216 | * 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 |
1217 | * calling function (mon_info_msg) seems to expect that. |
1140 | * calling function (mon_info_msg) seems to expect that. |
1218 | */ |
1141 | */ |
1219 | |
1142 | static object * |
1220 | object * |
|
|
1221 | get_next_mon (object *tmp) |
1143 | get_next_mon (object *tmp) |
1222 | { |
1144 | { |
1223 | objectlink *mon; |
1145 | objectlink *mon; |
1224 | |
1146 | |
1225 | for (mon = first_mon_info; mon; mon = mon->next) |
1147 | for (mon = first_mon_info; mon; mon = mon->next) |
… | |
… | |
1227 | break; |
1149 | break; |
1228 | |
1150 | |
1229 | /* didn't find a match */ |
1151 | /* didn't find a match */ |
1230 | if (!mon) |
1152 | if (!mon) |
1231 | return NULL; |
1153 | return NULL; |
|
|
1154 | |
1232 | if (mon->next) |
1155 | if (mon->next) |
1233 | return mon->next->ob; |
1156 | return mon->next->ob; |
1234 | else |
1157 | else |
1235 | return first_mon_info->ob; |
1158 | return first_mon_info->ob; |
1236 | |
1159 | |
1237 | } |
1160 | } |
1238 | |
1161 | |
1239 | |
|
|
1240 | |
|
|
1241 | /* mon_info_msg() - generate a message detailing the properties |
1162 | /* mon_info_msg() - generate a message detailing the properties |
1242 | * of a randomly selected monster. |
1163 | * of a randomly selected monster. |
1243 | */ |
1164 | */ |
1244 | |
1165 | static const char * |
1245 | char * |
|
|
1246 | mon_info_msg (int level, int booksize) |
1166 | mon_info_msg (int level) |
1247 | { |
1167 | { |
1248 | static char retbuf[BOOK_BUF]; |
1168 | static dynbuf_text buf; buf.clear (); |
1249 | char tmpbuf[HUGE_BUF]; |
|
|
1250 | object *tmp; |
|
|
1251 | |
1169 | |
1252 | /*preamble */ |
1170 | /*preamble */ |
1253 | strcpy (retbuf, "This beastiary contains:"); |
1171 | buf << "This beastiary contains:\n"; |
1254 | |
1172 | |
1255 | /* 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 |
1256 | * document. |
1174 | * document. |
1257 | * 8-96 Had to change this a bit, otherwise there would |
1175 | * 8-96 Had to change this a bit, otherwise there would |
1258 | * have been an impossibly large number of combinations |
1176 | * have been an impossibly large number of combinations |
1259 | * of text! (and flood out the available number of titles |
1177 | * of text! (and flood out the available number of titles |
1260 | * in the archive in a snap!) -b.t. |
1178 | * in the archive in a snap!) -b.t. |
1261 | */ |
1179 | */ |
1262 | tmp = get_random_mon (level * 3); |
1180 | object *tmp = get_random_mon (level * 3); |
1263 | while (tmp) |
1181 | while (tmp && buf.size () < BOOK_BUF) |
1264 | { |
1182 | { |
1265 | /* monster description */ |
1183 | /* monster description */ |
1266 | sprintf (tmpbuf, "\n---\n%s", mon_desc (tmp)); |
1184 | buf.printf ("\n%s\n", mon_desc (tmp)); |
1267 | |
|
|
1268 | if (!book_overflow (retbuf, tmpbuf, booksize)) |
|
|
1269 | strcat (retbuf, tmpbuf); |
|
|
1270 | else |
|
|
1271 | break; |
|
|
1272 | |
1185 | |
1273 | /* Note that the value this returns is not based on level */ |
1186 | /* Note that the value this returns is not based on level */ |
1274 | tmp = get_next_mon (tmp); |
1187 | tmp = get_next_mon (tmp); |
1275 | } |
1188 | } |
1276 | |
1189 | |
1277 | #ifdef BOOK_MSG_DEBUG |
|
|
1278 | LOG (llevDebug, "\n mon_info_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1279 | fprintf (logfile, " MADE THIS:\n%s\n", retbuf); |
|
|
1280 | #endif |
|
|
1281 | |
|
|
1282 | return retbuf; |
1190 | return buf; |
1283 | } |
1191 | } |
1284 | |
1192 | |
1285 | |
1193 | |
1286 | /***************************************************************************** |
1194 | /***************************************************************************** |
1287 | * Artifact msg generation code. |
1195 | * Artifact msg generation code. |
1288 | ****************************************************************************/ |
1196 | ****************************************************************************/ |
1289 | |
1197 | |
1290 | /* artifact_msg() - generate a message detailing the properties |
1198 | /* artifact_msg() - generate a message detailing the properties |
1291 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1199 | * of 1-6 artifacts drawn sequentially from the artifact list. |
1292 | */ |
1200 | */ |
1293 | const char * |
1201 | static const char * |
1294 | artifact_msg (int level, int booksize) |
1202 | artifact_msg (int level) |
1295 | { |
1203 | { |
1296 | artifactlist *al = NULL; |
1204 | artifactlist *al = NULL; |
1297 | artifact *art; |
1205 | artifact *art; |
1298 | int chance, i, type, index; |
1206 | int chance, i, type, index; |
1299 | 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; |
1300 | const char *ch; |
1208 | const char *ch; |
1301 | char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1209 | char name[MAX_BUF]; |
1302 | static char retbuf[BOOK_BUF]; |
|
|
1303 | object *tmp = NULL; |
1210 | object *tmp = NULL; |
|
|
1211 | |
|
|
1212 | static dynbuf_text buf; buf.clear (); |
1304 | |
1213 | |
1305 | /* values greater than 5 create msg buffers that are too big! */ |
1214 | /* values greater than 5 create msg buffers that are too big! */ |
1306 | if (book_entries > 5) |
1215 | if (book_entries > 5) |
1307 | book_entries = 5; |
1216 | book_entries = 5; |
1308 | |
1217 | |
… | |
… | |
1312 | * for that type exists! |
1221 | * for that type exists! |
1313 | */ |
1222 | */ |
1314 | i = 0; |
1223 | i = 0; |
1315 | do |
1224 | do |
1316 | { |
1225 | { |
1317 | index = rndm (sizeof (art_name_array) / sizeof (arttypename)); |
1226 | index = rndm (array_length (art_name_array)); |
1318 | type = art_name_array[index].type; |
1227 | type = art_name_array[index].type; |
1319 | al = find_artifactlist (type); |
1228 | al = find_artifactlist (type); |
1320 | i++; |
1229 | i++; |
1321 | } |
1230 | } |
1322 | while ((al == NULL) && (i < 10)); |
1231 | while ((al == NULL) && (i < 10)); |
… | |
… | |
1337 | |
1246 | |
1338 | /* the base 'generic' name for our artifact */ |
1247 | /* the base 'generic' name for our artifact */ |
1339 | assign (name, art_name_array[index].name); |
1248 | assign (name, art_name_array[index].name); |
1340 | |
1249 | |
1341 | /* Ok, lets print out the contents */ |
1250 | /* Ok, lets print out the contents */ |
1342 | 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"); |
1343 | |
1254 | |
1344 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1255 | /* artifact msg attributes loop. Lets keep adding entries to the 'book' |
1345 | * 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) |
1346 | */ |
1257 | */ |
1347 | while (book_entries > 0) |
1258 | while (book_entries > 0 && buf.size () < BOOK_BUF) |
1348 | { |
1259 | { |
1349 | |
1260 | |
1350 | if (art == NULL) |
1261 | if (!art) |
1351 | art = al->items; |
1262 | art = al->items; |
1352 | |
1263 | |
1353 | /* separator of items */ |
1264 | buf << '\n'; |
1354 | strcpy (buf, "--- \n"); |
|
|
1355 | |
1265 | |
1356 | /* Name */ |
1266 | /* Name */ |
1357 | if (art->allowed != NULL && strcmp (art->allowed->name, "All")) |
1267 | if (art->allowed && art->allowed->name != shstr_All) |
1358 | { |
1268 | { |
1359 | linked_char *temp, *next = art->allowed; |
1269 | linked_char *temp, *next = art->allowed; |
1360 | |
1270 | |
1361 | do |
1271 | do |
1362 | { |
1272 | { |
1363 | temp = next; |
1273 | temp = next; |
1364 | next = next->next; |
1274 | next = next->next; |
1365 | } |
1275 | } |
1366 | while (next && rndm (2)); |
1276 | while (next && rndm (2)); |
|
|
1277 | |
1367 | 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); |
1368 | } |
1279 | } |
1369 | else /* default name is used */ |
1280 | else /* default name is used */ |
1370 | 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 "; |
1371 | |
1284 | |
1372 | /* chance of finding */ |
1285 | /* chance of finding */ |
1373 | chance = (int) (100 * ((float) art->chance / al->total_chance)); |
1286 | chance = (int) (100 * ((float) art->chance / al->total_chance)); |
1374 | if (chance >= 20) |
1287 | if (chance >= 20) |
1375 | sprintf (sbuf, "an uncommon"); |
1288 | buf << "an uncommon"; |
1376 | else if (chance >= 10) |
1289 | else if (chance >= 10) |
1377 | sprintf (sbuf, "an unusual"); |
1290 | buf << "an unusual"; |
1378 | else if (chance >= 5) |
1291 | else if (chance >= 5) |
1379 | sprintf (sbuf, "a rare"); |
1292 | buf << "a rare"; |
1380 | else |
1293 | else |
1381 | sprintf (sbuf, "a very rare"); |
1294 | buf << "a very rare"; |
1382 | sprintf (buf, "%s is %s\n", buf, sbuf); |
|
|
1383 | |
1295 | |
1384 | /* value of artifact */ |
1296 | /* value of artifact */ |
1385 | 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"; |
1386 | |
1298 | |
1387 | /* include the message about the artifact, if exists, and book |
1299 | /* include the message about the artifact, if exists, and book |
1388 | * level is kinda high */ |
1300 | * level is kinda high */ |
1389 | if (art->item->msg |
1301 | if (art->item->msg |
1390 | && rndm (4) + 1 < level |
1302 | && rndm (4) + 1 < level) |
1391 | && !(strlen (art->item->msg) + strlen (buf) > BOOK_BUF)) |
|
|
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 | |
1330 | static char * |
1428 | char * |
|
|
1429 | spellpath_msg (int level, int booksize) |
1331 | spellpath_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 = rndm (NRSPELLPATHS), prayers = rndm (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 (rndm (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 | */ |
1486 | void |
1375 | static void |
1487 | make_formula_book (object *book, int level) |
1376 | make_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 (rndm (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 */ |
… | |
… | |
1510 | /* get a random formula, weighted by its bookchance */ |
1401 | /* get a random formula, weighted by its bookchance */ |
1511 | chance = rndm (fl->total_chance); |
1402 | chance = rndm (fl->total_chance); |
1512 | for (formula = fl->items; formula; 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 [rndm (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 [rndm (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 [rndm (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') |
|
|
1591 | strcat (retbuf, "\n"); |
|
|
1592 | |
1483 | |
1593 | book->msg = retbuf; |
1484 | book->msg = buf; |
1594 | } |
|
|
1595 | } |
1485 | } |
1596 | |
1486 | |
1597 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
1487 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
1598 | if(variable) { \ |
1488 | if(variable) { \ |
1599 | int i,j=0; \ |
1489 | int i,j=0; \ |
… | |
… | |
1610 | } |
1500 | } |
1611 | |
1501 | |
1612 | /* god_info_msg() - generate a message detailing the properties |
1502 | /* god_info_msg() - generate a message detailing the properties |
1613 | * of a random god. Used by the book hack. b.t. |
1503 | * of a random god. Used by the book hack. b.t. |
1614 | */ |
1504 | */ |
1615 | const char * |
1505 | static const char * |
1616 | god_info_msg (int level, int booksize) |
1506 | god_info_msg (int level) |
1617 | { |
1507 | { |
1618 | static char retbuf[BOOK_BUF]; |
|
|
1619 | const char *name = NULL; |
1508 | const char *name = NULL; |
1620 | char buf[BOOK_BUF]; |
|
|
1621 | int i; |
|
|
1622 | size_t introlen; |
|
|
1623 | object *god = pntr_to_god_obj (get_rand_god ()); |
1509 | object *god = pntr_to_god_obj (get_rand_god ()); |
1624 | |
1510 | |
|
|
1511 | static dynbuf_text buf; buf.clear (); |
|
|
1512 | |
1625 | if (!god) |
1513 | if (!god) |
1626 | return (char *) NULL; /* oops, problems... */ |
1514 | return 0; /* oops, problems... */ |
|
|
1515 | |
1627 | name = god->name; |
1516 | name = god->name; |
1628 | |
1517 | |
1629 | /* preamble.. */ |
1518 | /* preamble.. */ |
1630 | sprintf (retbuf, "This document contains knowledge concerning\n"); |
1519 | buf << "This document contains knowledge concerning the diety B<< " |
1631 | sprintf (retbuf, "%sthe diety %s", retbuf, name); |
1520 | << name << " >>"; |
1632 | |
1521 | |
1633 | /* Always have as default information the god's descriptive terms. */ |
1522 | /* Always have as default information the god's descriptive terms. */ |
1634 | if (nstrtok (god->msg, ",") > 0) |
1523 | if (nstrtok (god->msg, ",") > 0) |
1635 | { |
1524 | buf << ", known as" << strtoktolin (god->msg, ","); |
1636 | strcat (retbuf, ", known as"); |
|
|
1637 | strcat (retbuf, strtoktolin (god->msg, ",")); |
|
|
1638 | } |
|
|
1639 | else |
1525 | else |
1640 | strcat (retbuf, "..."); |
1526 | buf << "..."; |
1641 | |
1527 | |
1642 | strcat (retbuf, "\n ---\n"); |
1528 | buf << "\n\n"; |
|
|
1529 | |
1643 | 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 */ |
1644 | |
1531 | |
1645 | /* 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 |
1646 | * 'book'. Probably there is a more intellegent way to implement |
1533 | * 'book'. Probably there is a more intellegent way to implement |
1647 | * this ... |
1534 | * this ... |
1648 | */ |
1535 | */ |
1649 | while (level > 0) |
1536 | while (level > 0 && buf.size () < BOOK_BUF) |
1650 | { |
1537 | { |
1651 | sprintf (buf, " "); |
|
|
1652 | if (level == 2 && rndm (2)) |
1538 | if (level == 2 && rndm (2)) |
1653 | { /* enemy god */ |
1539 | { /* enemy god */ |
1654 | const char *enemy = god->title; |
1540 | const char *enemy = god->title; |
1655 | |
1541 | |
1656 | if (enemy) |
1542 | if (enemy) |
1657 | 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); |
1658 | } |
1544 | } |
1659 | |
1545 | |
1660 | if (level == 3 && rndm (2)) |
1546 | if (level == 3 && rndm (2)) |
1661 | { /* enemy race, what the god's holy word effects */ |
1547 | { /* enemy race, what the god's holy word effects */ |
1662 | const char *enemy = god->slaying; |
1548 | const char *enemy = god->slaying; |
|
|
1549 | int i; |
1663 | |
1550 | |
1664 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1551 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1665 | if ((i = nstrtok (enemy, ",")) > 0) |
1552 | if ((i = nstrtok (enemy, ",")) > 0) |
1666 | { |
1553 | { |
1667 | char tmpbuf[MAX_BUF]; |
1554 | buf << "The holy words of " << name |
|
|
1555 | << " have the power to slay creatures belonging to the "; |
1668 | |
1556 | |
1669 | sprintf (buf, "The holy words of %s have the power to\n", name); |
|
|
1670 | strcat (buf, "slay creatures belonging to the "); |
|
|
1671 | if (i > 1) |
1557 | if (i > 1) |
1672 | sprintf (tmpbuf, "following \n races:%s", strtoktolin (enemy, ",")); |
1558 | buf << "following races:" << strtoktolin (enemy, ","); |
1673 | else |
1559 | else |
1674 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1560 | buf << "race of" << strtoktolin (enemy, ","); |
1675 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1561 | |
|
|
1562 | buf << '\r'; |
1676 | } |
1563 | } |
1677 | } |
1564 | } |
1678 | |
1565 | |
1679 | if (level == 4 && rndm (2)) |
1566 | if (level == 4 && rndm (2)) |
1680 | { /* Priest of god gets these protect,vulnerable... */ |
1567 | { /* Priest of god gets these protect,vulnerable... */ |
1681 | char tmpbuf[MAX_BUF]; |
|
|
1682 | |
|
|
1683 | if (const char *cp = describe_resistance (god, 1)) |
1568 | if (const char *cp = describe_resistance (god, 1)) |
1684 | { /* This god does have protections */ |
1569 | { /* This god does have protections */ |
1685 | sprintf (tmpbuf, "%s has a potent aura which is extended\n", name); |
1570 | buf << name |
|
|
1571 | << " has a potent aura which is extended to" |
1686 | strcat (tmpbuf, "faithful priests. The effects of this aura include:\n"); |
1572 | " faithful priests. The effects of this aura include: " |
1687 | strcat (tmpbuf, cp); |
1573 | << cp |
1688 | strcat (buf, tmpbuf); |
1574 | << ".\r"; |
1689 | strcat (buf, "\n ---\n"); |
|
|
1690 | } |
1575 | } |
1691 | else |
|
|
1692 | sprintf (buf, " "); |
|
|
1693 | } |
1576 | } |
1694 | |
1577 | |
1695 | if (level == 5 && rndm (2)) |
1578 | if (level == 5 && rndm (2)) |
1696 | { /* aligned race, summoning */ |
1579 | { /* aligned race, summoning */ |
1697 | const char *race = god->race; /* aligned race */ |
1580 | const char *race = god->race; /* aligned race */ |
|
|
1581 | int i; |
1698 | |
1582 | |
1699 | if (race && !(god->path_denied & PATH_SUMMON)) |
1583 | if (race && !(god->path_denied & PATH_SUMMON)) |
1700 | if ((i = nstrtok (race, ",")) > 0) |
1584 | if ((i = nstrtok (race, ",")) > 0) |
1701 | { |
1585 | { |
1702 | char tmpbuf[MAX_BUF]; |
1586 | buf << "Creatures sacred to " << name << " include the "; |
1703 | |
|
|
1704 | sprintf (buf, "Creatures sacred to %s include the \n", name); |
|
|
1705 | if (i > 1) |
1587 | if (i > 1) |
1706 | sprintf (tmpbuf, "following \n races:%s", strtoktolin (race, ",")); |
1588 | buf << "following races:" << strtoktolin (race, ","); |
1707 | else |
1589 | else |
1708 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1590 | buf << "race of" << strtoktolin (race, ","); |
1709 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1591 | |
|
|
1592 | buf << '\r'; |
1710 | } |
1593 | } |
1711 | } |
1594 | } |
1712 | |
1595 | |
1713 | if (level == 6 && rndm (2)) |
1596 | if (level == 6 && rndm (2)) |
1714 | { /* blessing,curse properties of the god */ |
1597 | { /* blessing,curse properties of the god */ |
1715 | char tmpbuf[MAX_BUF]; |
|
|
1716 | |
|
|
1717 | if (const char *cp = describe_resistance (god, 1)) |
1598 | if (const char *cp = describe_resistance (god, 1)) |
1718 | { /* This god does have protections */ |
1599 | { /* This god does have protections */ |
1719 | 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 " |
1720 | strcat (tmpbuf, "bestow a blessing which makes the recipient\n"); |
1602 | "bestow a blessing which makes the recipient " |
1721 | strcat (tmpbuf, cp); |
1603 | << cp |
1722 | strcat (buf, tmpbuf); |
1604 | << '\r'; |
1723 | strcat (buf, "\n ---\n"); |
|
|
1724 | } |
1605 | } |
1725 | else |
|
|
1726 | sprintf (buf, " "); |
|
|
1727 | |
|
|
1728 | } |
1606 | } |
1729 | |
1607 | |
1730 | if (level == 8 && rndm (2)) |
1608 | if (level == 8 && rndm (2)) |
1731 | { /* 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: |
1732 | int has_effect = 0, tmpvar; |
1636 | int has_effect = 0, tmpvar; |
1733 | char tmpbuf[MAX_BUF]; |
1637 | char tmpbuf[MAX_BUF]; |
1734 | |
1638 | |
1735 | sprintf (tmpbuf, "\n"); |
|
|
1736 | sprintf (tmpbuf, "The priests of %s are known to make cast a mighty \n", name); |
|
|
1737 | |
|
|
1738 | strcat (tmpbuf, "prayer of possession which gives the recipient\n"); |
|
|
1739 | |
|
|
1740 | for (tmpvar = 0; tmpvar < NROFATTACKS; tmpvar++) |
|
|
1741 | { |
|
|
1742 | if (god->resist[tmpvar] == 100) |
|
|
1743 | { |
|
|
1744 | has_effect = 1; |
|
|
1745 | sprintf (tmpbuf + strlen (tmpbuf), "Immunity to %s", attacktype_desc[tmpvar]); |
|
|
1746 | } |
|
|
1747 | } |
|
|
1748 | |
|
|
1749 | if (has_effect) |
|
|
1750 | { |
|
|
1751 | strcat (buf, tmpbuf); |
|
|
1752 | strcat (buf, "\n ---\n"); |
|
|
1753 | } |
|
|
1754 | else |
|
|
1755 | sprintf (buf, " "); |
|
|
1756 | } |
|
|
1757 | |
|
|
1758 | if (level == 12 && rndm (2)) |
|
|
1759 | { /* spell paths */ |
|
|
1760 | int has_effect = 0, tmpvar; |
|
|
1761 | char tmpbuf[MAX_BUF]; |
|
|
1762 | |
|
|
1763 | sprintf (tmpbuf, "\n"); |
|
|
1764 | 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); |
1765 | strcat (tmpbuf, "are mystically transformed. Effects of this include:\n"); |
1640 | strcat (tmpbuf, "are mystically transformed. Effects of this include:\n"); |
1766 | |
1641 | |
1767 | if ((tmpvar = god->path_attuned)) |
1642 | if ((tmpvar = god->path_attuned)) |
1768 | { |
1643 | { |
… | |
… | |
1781 | has_effect = 1; |
1656 | has_effect = 1; |
1782 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1657 | DESCRIBE_PATH (tmpbuf, tmpvar, "Denied"); |
1783 | } |
1658 | } |
1784 | |
1659 | |
1785 | if (has_effect) |
1660 | if (has_effect) |
1786 | { |
1661 | buf << tmpbuf << '\r'; |
1787 | strcat (buf, tmpbuf); |
|
|
1788 | strcat (buf, "\n ---\n"); |
|
|
1789 | } |
|
|
1790 | else |
1662 | else |
1791 | sprintf (buf, " "); |
1663 | buf << '\r'; |
1792 | } |
1664 | } |
1793 | |
1665 | |
1794 | /* check to be sure new buffer size dont exceed either |
|
|
1795 | * the maximum buffer size, or the 'natural' size of the |
|
|
1796 | * book... |
|
|
1797 | */ |
|
|
1798 | if (book_overflow (retbuf, buf, booksize)) |
|
|
1799 | break; |
|
|
1800 | else if (strlen (buf) > 1) |
|
|
1801 | strcat (retbuf, buf); |
|
|
1802 | |
|
|
1803 | level--; |
1666 | level--; |
1804 | } |
1667 | } |
1805 | |
1668 | |
1806 | if (strlen (retbuf) == introlen) |
1669 | if (buf.size () == introlen) |
1807 | { /* we got no information beyond the preamble! */ |
1670 | /* we got no information beyond the preamble! */ |
1808 | strcat (retbuf, " [Unfortunately the rest of the information is\n"); |
1671 | buf << "[Unfortunately the rest of the information is hopelessly garbled!]"; |
1809 | strcat (retbuf, " hopelessly garbled!]\n ---\n"); |
1672 | |
1810 | } |
|
|
1811 | #ifdef BOOK_MSG_DEBUG |
|
|
1812 | LOG (llevDebug, "\n god_info_msg() created strng: %d\n", strlen (retbuf)); |
|
|
1813 | fprintf (logfile, " MADE THIS:\n%s", retbuf); |
|
|
1814 | #endif |
|
|
1815 | return retbuf; |
1673 | return buf; |
1816 | } |
1674 | } |
1817 | |
1675 | |
1818 | /* tailor_readable_ob()- The main routine. This chooses a random |
1676 | /* tailor_readable_ob()- The main routine. This chooses a random |
1819 | * message to put in given readable object (type==BOOK) which will |
1677 | * message to put in given readable object (type==BOOK) which will |
1820 | * 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- |
1821 | * termine the value of the information we will insert. Higher |
1679 | * termine the value of the information we will insert. Higher |
1822 | * values mean the book will (generally) have better/more info. |
1680 | * values mean the book will (generally) have better/more info. |
1823 | * See individual cases as to how this will be utilized. |
1681 | * See individual cases as to how this will be utilized. |
1824 | * "Book" name/content length are based on the weight of the |
1682 | * "Book" name/content length are based on the weight of the |
1825 | * 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 |
1826 | * choose the kind of message to generate. |
1684 | * choose the kind of message to generate. |
1827 | * -b.t. thomas@astro.psu.edu |
1685 | * -b.t. thomas@astro.psu.edu |
1828 | * |
1686 | * |
1829 | * book is the object we are creating into. |
1687 | * book is the object we are creating into. |
1830 | * 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 |
1831 | * message type - otherwise a random value is used. |
1689 | * message type - otherwise a random value is used. |
1832 | * |
1690 | * |
1833 | */ |
1691 | */ |
1834 | void |
1692 | void |
1835 | tailor_readable_ob (object *book, int msg_type) |
1693 | tailor_readable_ob (object *book, int msg_type) |
1836 | { |
1694 | { |
1837 | char msgbuf[BOOK_BUF]; |
|
|
1838 | int level = book->level ? rndm (book->level) + 1 : 1; |
1695 | int level = book->level ? rndm (book->level) + 1 : 1; |
1839 | int book_buf_size; |
|
|
1840 | |
1696 | |
1841 | /* safety */ |
1697 | /* safety */ |
1842 | if (book->type != BOOK) |
1698 | if (book->type != BOOK) |
1843 | return; |
1699 | return; |
1844 | |
1700 | |
1845 | if (level <= 0) |
1701 | if (level <= 0) |
1846 | return; /* if no level no point in doing any more... */ |
1702 | return; /* if no level no point in doing any more... */ |
1847 | |
|
|
1848 | /* Max text length this book can have. */ |
|
|
1849 | book_buf_size = BOOKSIZE (book); |
|
|
1850 | |
1703 | |
1851 | /* &&& The message switch &&& */ |
1704 | /* &&& The message switch &&& */ |
1852 | /* 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. |
1853 | */ |
1706 | */ |
1854 | /* |
1707 | /* |
… | |
… | |
1857 | * 2) make sure there is an entry in max_titles[] array. |
1710 | * 2) make sure there is an entry in max_titles[] array. |
1858 | * 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() |
1859 | * and add_authour(). |
1712 | * and add_authour(). |
1860 | * 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 |
1861 | */ |
1714 | */ |
|
|
1715 | const char *new_msg = ""; |
1862 | msg_type = msg_type > 0 ? msg_type : rndm (8); |
1716 | msg_type = msg_type > 0 ? msg_type : rndm (8); |
1863 | switch (msg_type) |
1717 | switch (msg_type) |
1864 | { |
1718 | { |
1865 | case 1: /* monster attrib */ |
1719 | case 1: /* monster attrib */ |
1866 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1720 | new_msg = mon_info_msg (level); |
1867 | break; |
1721 | break; |
1868 | case 2: /* artifact attrib */ |
1722 | case 2: /* artifact attrib */ |
1869 | strcpy (msgbuf, artifact_msg (level, book_buf_size)); |
1723 | new_msg = artifact_msg (level); |
1870 | break; |
1724 | break; |
1871 | case 3: /* grouping incantations/prayers by path */ |
1725 | case 3: /* grouping incantations/prayers by path */ |
1872 | strcpy (msgbuf, spellpath_msg (level, book_buf_size)); |
1726 | new_msg = spellpath_msg (level); |
1873 | break; |
1727 | break; |
1874 | case 4: /* describe an alchemy formula */ |
1728 | case 4: /* describe an alchemy formula */ |
1875 | make_formula_book (book, level); |
1729 | make_formula_book (book, level); |
1876 | /* make_formula_book already gives title */ |
1730 | /* make_formula_book already gives title */ |
1877 | return; |
1731 | return; |
1878 | break; |
|
|
1879 | case 5: /* bits of information about a god */ |
1732 | case 5: /* bits of information about a god */ |
1880 | strcpy (msgbuf, god_info_msg (level, book_buf_size)); |
1733 | new_msg = god_info_msg (level); |
1881 | break; |
1734 | break; |
1882 | case 0: /* use info list in lib/ */ |
1735 | case 0: /* use info list in lib/ */ |
1883 | default: |
1736 | default: |
1884 | cfperl_make_book (book, level); |
1737 | cfperl_make_book (book, level); |
|
|
1738 | /* already gives title */ |
1885 | return; |
1739 | return; |
1886 | } |
1740 | } |
1887 | |
1741 | |
1888 | strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */ |
|
|
1889 | |
|
|
1890 | if (strlen (msgbuf) > 1) |
1742 | if (strlen (new_msg) > 1) |
1891 | { |
1743 | { |
1892 | book->msg = msgbuf; |
1744 | book->msg = new_msg; |
1893 | /* 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 */ |
1894 | change_book (book, msg_type); |
1746 | change_book (book, msg_type); |
1895 | } |
1747 | } |
1896 | } |
1748 | } |
1897 | |
|
|
1898 | |
|
|
1899 | /***************************************************************************** |
|
|
1900 | * |
|
|
1901 | * Cleanup routine for readble stuff. |
|
|
1902 | * |
|
|
1903 | *****************************************************************************/ |
|
|
1904 | |
|
|
1905 | void |
|
|
1906 | free_all_readable (void) |
|
|
1907 | { |
|
|
1908 | titlelist *tlist, *tnext; |
|
|
1909 | title *title1, *titlenext; |
|
|
1910 | linked_char *lmsg, *nextmsg; |
|
|
1911 | objectlink *monlink, *nextmon; |
|
|
1912 | |
|
|
1913 | LOG (llevDebug, "freeing all book information\n"); |
|
|
1914 | |
|
|
1915 | for (tlist = booklist; tlist != NULL; tlist = tnext) |
|
|
1916 | { |
|
|
1917 | tnext = tlist->next; |
|
|
1918 | |
|
|
1919 | for (title1 = tlist->first_book; title1; title1 = titlenext) |
|
|
1920 | { |
|
|
1921 | titlenext = title1->next; |
|
|
1922 | delete title1; |
|
|
1923 | } |
|
|
1924 | |
|
|
1925 | delete tlist; |
|
|
1926 | } |
|
|
1927 | |
|
|
1928 | for (lmsg = first_msg; lmsg; lmsg = nextmsg) |
|
|
1929 | { |
|
|
1930 | nextmsg = lmsg->next; |
|
|
1931 | delete lmsg; |
|
|
1932 | } |
|
|
1933 | |
|
|
1934 | for (monlink = first_mon_info; monlink; monlink = nextmon) |
|
|
1935 | { |
|
|
1936 | nextmon = monlink->next; |
|
|
1937 | delete monlink; |
|
|
1938 | } |
|
|
1939 | } |
|
|
1940 | |
|
|
1941 | |
1749 | |
1942 | /***************************************************************************** |
1750 | /***************************************************************************** |
1943 | * |
1751 | * |
1944 | * Writeback routine for updating the bookarchive. |
1752 | * Writeback routine for updating the bookarchive. |
1945 | * |
1753 | * |
1946 | ****************************************************************************/ |
1754 | ****************************************************************************/ |
1947 | |
|
|
1948 | /* write_book_archive() - write out the updated book archive */ |
1755 | /* write_book_archive() - write out the updated book archive */ |
1949 | |
|
|
1950 | void |
1756 | void |
1951 | write_book_archive (void) |
1757 | write_book_archive () |
1952 | { |
1758 | { |
1953 | FILE *fp; |
1759 | FILE *fp; |
1954 | int index = 0; |
1760 | int index = 0; |
1955 | char fname[MAX_BUF]; |
1761 | char fname[MAX_BUF]; |
1956 | title *book = NULL; |
1762 | title *book = NULL; |
1957 | titlelist *bl = get_titlelist (0); |
1763 | titlelist *bl = get_titlelist (0); |
1958 | |
1764 | |
1959 | /* If nothing changed, don't write anything */ |
1765 | /* If nothing changed, don't write anything */ |
1960 | if (!need_to_write_bookarchive) |
1766 | if (!need_to_write_bookarchive) |
1961 | return; |
1767 | return; |
|
|
1768 | |
1962 | need_to_write_bookarchive = 0; |
1769 | need_to_write_bookarchive = 0; |
1963 | |
1770 | |
1964 | sprintf (fname, "%s/bookarch", settings.localdir); |
1771 | sprintf (fname, "%s/bookarch", settings.localdir); |
1965 | LOG (llevDebug, "Updating book archive: %s...\n", fname); |
1772 | LOG (llevDebug, "Updating book archive: %s...\n", fname); |
1966 | |
1773 | |
1967 | if ((fp = fopen (fname, "w")) == NULL) |
1774 | if ((fp = fopen (fname, "w")) == NULL) |
1968 | { |
|
|
1969 | LOG (llevDebug, "Can't open book archive file %s\n", fname); |
1775 | LOG (llevDebug, "Can't open book archive file %s\n", fname); |
1970 | } |
|
|
1971 | else |
1776 | else |
1972 | { |
1777 | { |
1973 | while (bl) |
1778 | while (bl) |
1974 | { |
1779 | { |
1975 | for (book = bl->first_book; book; book = book->next) |
1780 | for (book = bl->first_book; book; book = book->next) |
… | |
… | |
1982 | fprintf (fp, "type %d\n", index); |
1787 | fprintf (fp, "type %d\n", index); |
1983 | fprintf (fp, "size %d\n", book->size); |
1788 | fprintf (fp, "size %d\n", book->size); |
1984 | fprintf (fp, "index %d\n", book->msg_index); |
1789 | fprintf (fp, "index %d\n", book->msg_index); |
1985 | fprintf (fp, "end\n"); |
1790 | fprintf (fp, "end\n"); |
1986 | } |
1791 | } |
|
|
1792 | |
1987 | bl = bl->next; |
1793 | bl = bl->next; |
1988 | index++; |
1794 | index++; |
1989 | } |
1795 | } |
|
|
1796 | |
1990 | fclose (fp); |
1797 | fclose (fp); |
1991 | chmod (fname, SAVE_MODE); |
1798 | chmod (fname, SAVE_MODE); |
1992 | } |
1799 | } |
1993 | } |
1800 | } |
|
|
1801 | |
1994 | readable_message_type * |
1802 | readable_message_type * |
1995 | get_readable_message_type (object *readable) |
1803 | get_readable_message_type (object *readable) |
1996 | { |
1804 | { |
1997 | uint8 subtype = readable->subtype; |
1805 | uint8 subtype = readable->subtype; |
1998 | |
1806 | |