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

Diff Legend

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