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.26 by root, Mon Jun 4 12:19:08 2007 UTC vs.
Revision 1.69 by root, Sat Nov 17 23:40:00 2018 UTC

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

Diff Legend

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