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.24 by root, Thu May 24 03:33:28 2007 UTC vs.
Revision 1.65 by root, Mon Oct 29 23:55:52 2012 UTC

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

Diff Legend

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