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