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