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.15 by pippijn, Wed Jan 3 00:08:17 2007 UTC vs.
Revision 1.67 by root, Wed Nov 16 23:41:59 2016 UTC

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

Diff Legend

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