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.5 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.68 by root, Sun Jan 29 02:47:04 2017 UTC

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

Diff Legend

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