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