ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/readable.C
(Generate patch)

Comparing deliantra/server/common/readable.C (file contents):
Revision 1.25 by root, Mon May 28 21:21:40 2007 UTC vs.
Revision 1.65 by root, Mon Oct 29 23:55:52 2012 UTC

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

Diff Legend

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