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.3 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.67 by root, Wed Nov 16 23:41:59 2016 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines