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.9 by root, Thu Sep 14 22:34:00 2006 UTC vs.
Revision 1.70 by root, Sat Dec 1 20:22:12 2018 UTC

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

Diff Legend

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