1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License along |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /* This file contains code relevant to the BOOKS hack -- designed |
25 | /* This file contains code relevant to the BOOKS hack -- designed |
26 | * to allow randomly occuring messages in non-magical texts. |
26 | * to allow randomly occuring messages in non-magical texts. |
27 | */ |
27 | */ |
… | |
… | |
435 | * Be careful to keep the order. If you add readable subtype, add them |
435 | * Be careful to keep the order. If you add readable subtype, add them |
436 | * at the bottom of the list. Never delete a subtype because index is used as |
436 | * at the bottom of the list. Never delete a subtype because index is used as |
437 | * subtype paramater in arch files! |
437 | * subtype paramater in arch files! |
438 | */ |
438 | */ |
439 | static readable_message_type readable_message_types[] = { |
439 | static readable_message_type readable_message_types[] = { |
440 | /*subtype 0 */ {0, 0}, |
440 | /*subtype 0 */ {0, 0, "info"}, |
441 | /* book messages subtypes */ |
441 | /* book messages subtypes */ |
442 | /*subtype 1 */ {MSG_TYPE_BOOK, MSG_TYPE_BOOK_CLASP_1}, |
442 | /*subtype 1 */ {MSG_TYPE_BOOK, MSG_TYPE_BOOK_CLASP_1, "readable-book-clasp-1"}, |
443 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_CLASP_2}, |
443 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_CLASP_2, "readable-book-clasp-2"}, |
444 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_ELEGANT_1}, |
444 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_ELEGANT_1, "readable-book-elegant-1"}, |
445 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_ELEGANT_2}, |
445 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_ELEGANT_2, "readable-book-elegant-2"}, |
446 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_QUARTO_1}, |
446 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_QUARTO_1, "readable-book-quarto-1"}, |
447 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_QUARTO_2}, |
447 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_QUARTO_2, "readable-book-quarto-2"}, |
448 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_EVOKER}, |
448 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_EVOKER, "readable-book-spell-evocation"}, |
449 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_PRAYER}, |
449 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_PRAYER, "readable-book-spell-praying"}, |
450 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_PYRO}, |
450 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_PYRO, "readable-book-spell-pyromancy"}, |
451 | /*subtype 10 */ {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_SORCERER}, |
451 | /*subtype 10 */ {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_SORCERER, "readable-book-spell-sorcery"}, |
452 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_SUMMONER}, |
452 | {MSG_TYPE_BOOK, MSG_TYPE_BOOK_SPELL_SUMMONER, "readable-book-spell-summoning"}, |
453 | /* card messages subtypes */ |
453 | /* card messages subtypes */ |
454 | {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_1}, |
454 | {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_1, "readable-card-simple-1"}, |
455 | {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_2}, |
455 | {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_2, "readable-card-simple-2"}, |
456 | {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_3}, |
456 | {MSG_TYPE_CARD, MSG_TYPE_CARD_SIMPLE_3, "readable-card-simple-3"}, |
457 | {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_1}, |
457 | {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_1, "readable-card-elegant-1"}, |
458 | {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_2}, |
458 | {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_2, "readable-card-elegant-2"}, |
459 | {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_3}, |
459 | {MSG_TYPE_CARD, MSG_TYPE_CARD_ELEGANT_3, "readable-card-elegant-3"}, |
460 | {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_1}, |
460 | {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_1, "readable-card-strange-1"}, |
461 | {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_2}, |
461 | {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_2, "readable-card-strange-2"}, |
462 | /*subtype 20 */ {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_3}, |
462 | /*subtype 20 */ {MSG_TYPE_CARD, MSG_TYPE_CARD_STRANGE_3, "readable-card-strange-3"}, |
463 | {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_1}, |
463 | {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_1, "readable-card-money-1"}, |
464 | {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_2}, |
464 | {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_2, "readable-card-money-2"}, |
465 | {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_3}, |
465 | {MSG_TYPE_CARD, MSG_TYPE_CARD_MONEY_3, "readable-card-money-3"}, |
466 | |
466 | |
467 | /* Paper messages subtypes */ |
467 | /* Paper messages subtypes */ |
468 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_1}, |
468 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_1, "readable-paper-note-1"}, |
469 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_2}, |
469 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_2, "readable-paper-note-2"}, |
470 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_3}, |
470 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_NOTE_3, "readable-paper-note-3"}, |
471 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_OLD_1}, |
471 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_OLD_1, "readable-paper-letter-old-1"}, |
472 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_OLD_2}, |
472 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_OLD_2, "readable-paper-letter-old-2"}, |
473 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_NEW_1}, |
473 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_NEW_1, "readable-paper-letter-new-1"}, |
474 | /*subtype 30 */ {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_NEW_2}, |
474 | /*subtype 30 */ {MSG_TYPE_PAPER, MSG_TYPE_PAPER_LETTER_NEW_2, "readable-paper-letter-new-2"}, |
475 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_ENVELOPE_1}, |
475 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_ENVELOPE_1, "readable-paper-envelope-1"}, |
476 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_ENVELOPE_2}, |
476 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_ENVELOPE_2, "readable-paper-envelope-2"}, |
477 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_OLD_1}, |
477 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_OLD_1, "readable-paper-scroll-old-1"}, |
478 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_OLD_2}, |
478 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_OLD_2, "readable-paper-scroll-old-2"}, |
479 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_NEW_1}, |
479 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_NEW_1, "readable-paper-scroll-new-1"}, |
480 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_NEW_2}, |
480 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_NEW_2, "readable-paper-scroll-new-2"}, |
481 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_MAGIC}, |
481 | {MSG_TYPE_PAPER, MSG_TYPE_PAPER_SCROLL_MAGIC, "readable-paper-scroll-magic"}, |
482 | |
482 | |
483 | /* road signs messages subtypes */ |
483 | /* road signs messages subtypes */ |
484 | {MSG_TYPE_SIGN, MSG_TYPE_SIGN_BASIC}, |
484 | {MSG_TYPE_SIGN, MSG_TYPE_SIGN_BASIC, "readable-sign-basic"}, |
485 | {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_LEFT}, |
485 | {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_LEFT, "readable-sign-dir-left"}, |
486 | /*subtype 40 */ {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_RIGHT}, |
486 | /*subtype 40 */ {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_RIGHT, "readable-sign-dir-right"}, |
487 | {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_BOTH}, |
487 | {MSG_TYPE_SIGN, MSG_TYPE_SIGN_DIR_BOTH, "readable-sign-dir-both"}, |
488 | |
488 | |
489 | /* stones and monument messages */ |
489 | /* stones and monument messages */ |
490 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_1}, |
490 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_1, "readable-monument-stone-1"}, |
491 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_2}, |
491 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_2, "readable-monument-stone-2"}, |
492 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_3}, |
492 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STONE_3, "readable-monument-stone-3"}, |
493 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_1}, |
493 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_1, "readable-monument-statue-1"}, |
494 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_2}, |
494 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_2, "readable-monument-statue-2"}, |
495 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_3}, |
495 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_STATUE_3, "readable-monument-statue-3"}, |
496 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_1}, |
496 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_1, "readable-monument-gravestone-1"}, |
497 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_2}, |
497 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_2, "readable-monument-gravestone-2"}, |
498 | /*subtype 50 */ {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_3}, |
498 | /*subtype 50 */ {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_GRAVESTONE_3, "readable-monument-gravestone-3"}, |
499 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_1}, |
499 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_1, "readable-monument-wall-1"}, |
500 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_2}, |
500 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_2, "readable-monument-wall-2"}, |
501 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_3} |
501 | {MSG_TYPE_MONUMENT, MSG_TYPE_MONUMENT_WALL_3, "readable-monument-wall-3"} |
502 | }; |
502 | }; |
503 | int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); |
503 | int last_readable_subtype = sizeof (readable_message_types) / sizeof (readable_message_type); |
504 | |
504 | |
505 | static int max_titles[6] = { |
505 | static int max_titles[6] = { |
506 | ((sizeof (light_book_name) / sizeof (char *)) + (sizeof (heavy_book_name) / sizeof (char *))) * (sizeof (book_author) / sizeof (char *)), |
506 | ((sizeof (light_book_name) / sizeof (char *)) + (sizeof (heavy_book_name) / sizeof (char *))) * (sizeof (book_author) / sizeof (char *)), |
… | |
… | |
748 | if (did_init_mon_info) |
748 | if (did_init_mon_info) |
749 | return; |
749 | return; |
750 | |
750 | |
751 | did_init_mon_info = 1; |
751 | did_init_mon_info = 1; |
752 | |
752 | |
753 | |
753 | for_all_archetypes (at) |
754 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
755 | { |
754 | { |
756 | if (QUERY_FLAG (&at->clone, FLAG_MONSTER) && (!QUERY_FLAG (&at->clone, FLAG_CHANGING) || QUERY_FLAG (&at->clone, FLAG_UNAGGRESSIVE))) |
755 | if (QUERY_FLAG (at, FLAG_MONSTER) && (!QUERY_FLAG (at, FLAG_CHANGING) || QUERY_FLAG (at, FLAG_UNAGGRESSIVE))) |
757 | { |
756 | { |
758 | objectlink *mon = new objectlink; |
757 | objectlink *mon = new objectlink; |
759 | |
758 | |
760 | mon->ob = &at->clone; |
759 | mon->ob = at; |
761 | mon->next = first_mon_info; |
760 | mon->next = first_mon_info; |
762 | first_mon_info = mon; |
761 | first_mon_info = mon; |
763 | nrofmon++; |
762 | nrofmon++; |
764 | } |
763 | } |
765 | } |
764 | } |
… | |
… | |
934 | */ |
933 | */ |
935 | |
934 | |
936 | static int |
935 | static int |
937 | unique_book (const object *book, int msgtype) |
936 | unique_book (const object *book, int msgtype) |
938 | { |
937 | { |
939 | title *test; |
|
|
940 | |
|
|
941 | if (!booklist) |
938 | if (!booklist) |
942 | return 1; /* No archival entries! Must be unique! */ |
939 | return 1; /* No archival entries! Must be unique! */ |
943 | |
940 | |
944 | /* Go through the booklist. If the author and name match, not unique so |
941 | /* Go through the booklist. If the author and name match, not unique so |
945 | * return 0. |
942 | * return 0. |
946 | */ |
943 | */ |
947 | for (test = get_titlelist (msgtype)->first_book; test; test = test->next) |
944 | for (title *test = get_titlelist (msgtype)->first_book; test; test = test->next) |
948 | { |
|
|
949 | if (!strcmp (test->name, book->name) && !strcmp (book->title, test->authour)) |
945 | if (test->name == book->name && book->title == test->authour) |
950 | return 0; |
946 | return 0; |
951 | } |
947 | |
952 | return 1; |
948 | return 1; |
953 | } |
949 | } |
954 | |
950 | |
955 | /* add_book_to_list() */ |
951 | /* add_book_to_list() */ |
956 | |
952 | |
… | |
… | |
1003 | { |
999 | { |
1004 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1000 | int nbr = sizeof (book_descrpt) / sizeof (char *); |
1005 | |
1001 | |
1006 | switch (book->type) |
1002 | switch (book->type) |
1007 | { |
1003 | { |
1008 | case BOOK: |
1004 | case BOOK: |
1009 | { |
1005 | { |
1010 | titlelist *tl = get_titlelist (msgtype); |
1006 | titlelist *tl = get_titlelist (msgtype); |
1011 | title *t = NULL; |
1007 | title *t = NULL; |
1012 | int tries = 0; |
1008 | int tries = 0; |
1013 | |
1009 | |
1014 | /* look to see if our msg already been archived. If so, alter |
1010 | /* look to see if our msg already been archived. If so, alter |
1015 | * the book to match the archival text. If we fail to match, |
1011 | * the book to match the archival text. If we fail to match, |
1016 | * then we archive the new title/name/msg combo if there is |
1012 | * then we archive the new title/name/msg combo if there is |
1017 | * room on the titlelist. |
1013 | * room on the titlelist. |
1018 | */ |
1014 | */ |
1019 | |
1015 | |
1020 | if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) |
1016 | if ((strlen (book->msg) > 5) && (t = find_title (book, msgtype))) |
1021 | { |
1017 | { |
1022 | object *tmpbook; |
|
|
1023 | |
|
|
1024 | /* alter book properties */ |
1018 | /* alter book properties */ |
1025 | if ((tmpbook = get_archetype (t->archname)) != NULL) |
1019 | if (object *tmpbook = get_archetype (t->archname)) |
|
|
1020 | { |
|
|
1021 | tmpbook->msg = book->msg; |
|
|
1022 | tmpbook->copy_to (book); |
|
|
1023 | tmpbook->destroy (); |
|
|
1024 | } |
|
|
1025 | |
|
|
1026 | book->title = t->authour; |
|
|
1027 | book->name = t->name; |
|
|
1028 | book->level = t->level; |
|
|
1029 | } |
|
|
1030 | /* Don't have any default title, so lets make up a new one */ |
|
|
1031 | else |
|
|
1032 | { |
|
|
1033 | int numb, maxnames = max_titles[msgtype]; |
|
|
1034 | const char *old_title; |
|
|
1035 | const char *old_name; |
|
|
1036 | |
|
|
1037 | old_title = book->title; |
|
|
1038 | old_name = book->name; |
|
|
1039 | |
|
|
1040 | /* some pre-generated books have title already set (from |
|
|
1041 | * maps), also don't bother looking for unique title if |
|
|
1042 | * we already used up all the available names! */ |
|
|
1043 | |
|
|
1044 | if (!tl) |
|
|
1045 | { |
|
|
1046 | LOG (llevError, "change_book_name(): can't find title list\n"); |
|
|
1047 | numb = 0; |
|
|
1048 | } |
|
|
1049 | else |
|
|
1050 | numb = tl->number; |
|
|
1051 | |
|
|
1052 | if (numb == maxnames) |
|
|
1053 | { |
|
|
1054 | #ifdef ARCHIVE_DEBUG |
|
|
1055 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
|
|
1056 | #endif |
|
|
1057 | break; |
|
|
1058 | } |
|
|
1059 | /* shouldnt change map-maker books */ |
|
|
1060 | else if (!book->title) |
|
|
1061 | do |
1026 | { |
1062 | { |
1027 | tmpbook->msg = book->msg; |
1063 | /* random book name */ |
1028 | tmpbook->copy_to (book); |
1064 | new_text_name (book, msgtype); |
1029 | tmpbook->destroy (); |
1065 | add_author (book, msgtype); /* random author */ |
|
|
1066 | tries++; |
1030 | } |
1067 | } |
|
|
1068 | while (!unique_book (book, msgtype) && tries < MAX_TITLE_CHECK); |
1031 | |
1069 | |
1032 | book->title = t->authour; |
1070 | /* Now deal with 2 cases. |
1033 | book->name = t->name; |
1071 | * 1)If no space for a new title exists lets just restore |
1034 | book->level = t->level; |
1072 | * the old book properties. Remember, if the book had |
|
|
1073 | * matchd an older entry on the titlelist, we shouldnt |
|
|
1074 | * have called this routine in the first place! |
|
|
1075 | * 2) If we got a unique title, we need to add it to |
|
|
1076 | * the list. |
1035 | } |
1077 | */ |
1036 | /* Don't have any default title, so lets make up a new one */ |
|
|
1037 | else |
|
|
1038 | { |
|
|
1039 | int numb, maxnames = max_titles[msgtype]; |
|
|
1040 | const char *old_title; |
|
|
1041 | const char *old_name; |
|
|
1042 | |
1078 | |
1043 | old_title = book->title; |
1079 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
1044 | old_name = book->name; |
1080 | { /* got to check maxnames again */ |
1045 | |
|
|
1046 | /* some pre-generated books have title already set (from |
|
|
1047 | * maps), also don't bother looking for unique title if |
|
|
1048 | * we already used up all the available names! */ |
|
|
1049 | |
|
|
1050 | if (!tl) |
|
|
1051 | { |
|
|
1052 | LOG (llevError, "change_book_name(): can't find title list\n"); |
|
|
1053 | numb = 0; |
|
|
1054 | } |
|
|
1055 | else |
|
|
1056 | numb = tl->number; |
|
|
1057 | |
|
|
1058 | if (numb == maxnames) |
|
|
1059 | { |
|
|
1060 | #ifdef ARCHIVE_DEBUG |
1081 | #ifdef ARCHIVE_DEBUG |
1061 | LOG (llevDebug, "titles for list %d full (%d possible).\n", msgtype, maxnames); |
1082 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames); |
1062 | #endif |
1083 | #endif |
1063 | break; |
1084 | /* restore old book properties here */ |
1064 | } |
1085 | book->title = old_title; |
1065 | /* shouldnt change map-maker books */ |
1086 | |
1066 | else if (!book->title) |
1087 | if (rndm (4)) |
1067 | do |
|
|
1068 | { |
1088 | { |
1069 | /* random book name */ |
1089 | /* Lets give the book a description to individualize it some */ |
1070 | new_text_name (book, msgtype); |
1090 | char new_name[MAX_BUF]; |
1071 | add_author (book, msgtype); /* random author */ |
1091 | |
1072 | tries++; |
1092 | snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name); |
|
|
1093 | |
|
|
1094 | book->name = new_name; |
1073 | } |
1095 | } |
1074 | while (!unique_book (book, msgtype) && tries < MAX_TITLE_CHECK); |
|
|
1075 | |
|
|
1076 | /* Now deal with 2 cases. |
|
|
1077 | * 1)If no space for a new title exists lets just restore |
|
|
1078 | * the old book properties. Remember, if the book had |
|
|
1079 | * matchd an older entry on the titlelist, we shouldnt |
|
|
1080 | * have called this routine in the first place! |
|
|
1081 | * 2) If we got a unique title, we need to add it to |
|
|
1082 | * the list. |
|
|
1083 | */ |
|
|
1084 | |
|
|
1085 | if (tries == MAX_TITLE_CHECK || numb == maxnames) |
|
|
1086 | { /* got to check maxnames again */ |
|
|
1087 | #ifdef ARCHIVE_DEBUG |
|
|
1088 | LOG (llevDebug, "Failed to obtain unique title for %s %s (names:%d/%d)\n", book->name, book->title, numb, maxnames); |
|
|
1089 | #endif |
|
|
1090 | /* restore old book properties here */ |
|
|
1091 | book->title = old_title; |
|
|
1092 | |
|
|
1093 | if (RANDOM () % 4) |
|
|
1094 | { |
|
|
1095 | /* Lets give the book a description to individualize it some */ |
|
|
1096 | char new_name[MAX_BUF]; |
|
|
1097 | |
|
|
1098 | snprintf (new_name, MAX_BUF, "%s %s", book_descrpt[rndm (nbr)], old_name); |
|
|
1099 | |
|
|
1100 | book->name = new_name; |
|
|
1101 | } |
|
|
1102 | else |
1096 | else |
1103 | { |
1097 | { |
1104 | book->name = old_name; |
1098 | book->name = old_name; |
1105 | } |
1099 | } |
1106 | } |
1100 | } |
1107 | else if (book->title && strlen (book->msg) > 5) |
1101 | else if (book->title && strlen (book->msg) > 5) |
1108 | { /* archive if long msg texts */ |
1102 | { /* archive if long msg texts */ |
1109 | add_book_to_list (book, msgtype); |
1103 | add_book_to_list (book, msgtype); |
1110 | } |
1104 | } |
1111 | } |
1105 | } |
1112 | break; |
1106 | break; |
1113 | } |
1107 | } |
1114 | |
1108 | |
1115 | default: |
1109 | default: |
1116 | LOG (llevError, "change_book_name() called w/ illegal obj type.\n"); |
1110 | LOG (llevError, "change_book_name() called w/ illegal obj type.\n"); |
1117 | return; |
1111 | return; |
1118 | } |
1112 | } |
1119 | } |
1113 | } |
1120 | |
1114 | |
1121 | /***************************************************************************** |
1115 | /***************************************************************************** |
1122 | * |
1116 | * |
… | |
… | |
1147 | return (object *) NULL; |
1141 | return (object *) NULL; |
1148 | |
1142 | |
1149 | if (!level) |
1143 | if (!level) |
1150 | { |
1144 | { |
1151 | /* lets get a random monster from the mon_info linked list */ |
1145 | /* lets get a random monster from the mon_info linked list */ |
1152 | monnr = RANDOM () % nrofmon; |
1146 | monnr = rndm (nrofmon); |
1153 | |
1147 | |
1154 | for (mon = first_mon_info, i = 0; mon; mon = mon->next) |
1148 | for (mon = first_mon_info, i = 0; mon; mon = mon->next) |
1155 | if (i++ == monnr) |
1149 | if (i++ == monnr) |
1156 | break; |
1150 | break; |
1157 | |
1151 | |
… | |
… | |
1184 | { |
1178 | { |
1185 | LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level); |
1179 | LOG (llevError, "get_random_mon() couldn't return monster for level %d\n", level); |
1186 | return NULL; |
1180 | return NULL; |
1187 | } |
1181 | } |
1188 | |
1182 | |
1189 | monnr = RANDOM () % i; |
1183 | monnr = rndm (i); |
1190 | for (mon = first_mon_info; mon; mon = mon->next) |
1184 | for (mon = first_mon_info; mon; mon = mon->next) |
1191 | if (mon->ob->level >= level && monnr-- == 0) |
1185 | if (mon->ob->level >= level && monnr-- == 0) |
1192 | return mon->ob; |
1186 | return mon->ob; |
1193 | |
1187 | |
1194 | if (!mon) |
1188 | if (!mon) |
… | |
… | |
1298 | artifact_msg (int level, int booksize) |
1292 | artifact_msg (int level, int booksize) |
1299 | { |
1293 | { |
1300 | artifactlist *al = NULL; |
1294 | artifactlist *al = NULL; |
1301 | artifact *art; |
1295 | artifact *art; |
1302 | int chance, i, type, index; |
1296 | int chance, i, type, index; |
1303 | int book_entries = level > 5 ? RANDOM () % 3 + RANDOM () % 3 + 2 : RANDOM () % level + 1; |
1297 | int book_entries = level > 5 ? rndm (3) + rndm (3) + 2 : rndm (level) + 1; |
1304 | const char *ch; |
1298 | const char *ch; |
1305 | char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1299 | char name[MAX_BUF], buf[BOOK_BUF], sbuf[MAX_BUF]; |
1306 | static char retbuf[BOOK_BUF]; |
1300 | static char retbuf[BOOK_BUF]; |
1307 | object *tmp = NULL; |
1301 | object *tmp = NULL; |
1308 | |
1302 | |
… | |
… | |
1316 | * for that type exists! |
1310 | * for that type exists! |
1317 | */ |
1311 | */ |
1318 | i = 0; |
1312 | i = 0; |
1319 | do |
1313 | do |
1320 | { |
1314 | { |
1321 | index = RANDOM () % (sizeof (art_name_array) / sizeof (arttypename)); |
1315 | index = rndm (sizeof (art_name_array) / sizeof (arttypename)); |
1322 | type = art_name_array[index].type; |
1316 | type = art_name_array[index].type; |
1323 | al = find_artifactlist (type); |
1317 | al = find_artifactlist (type); |
1324 | i++; |
1318 | i++; |
1325 | } |
1319 | } |
1326 | while ((al == NULL) && (i < 10)); |
1320 | while ((al == NULL) && (i < 10)); |
… | |
… | |
1329 | return "None"; |
1323 | return "None"; |
1330 | |
1324 | |
1331 | /* There is no reason to start on the artifact list at the begining. Lets |
1325 | /* There is no reason to start on the artifact list at the begining. Lets |
1332 | * take our starting position randomly... */ |
1326 | * take our starting position randomly... */ |
1333 | art = al->items; |
1327 | art = al->items; |
1334 | for (i = RANDOM () % level + RANDOM () % 2 + 1; i > 0; i--) |
1328 | for (i = rndm (level) + rndm (2) + 1; i > 0; i--) |
1335 | { |
1329 | { |
1336 | if (art == NULL) |
1330 | if (!art) |
1337 | art = al->items; /* hmm, out of stuff, loop back around */ |
1331 | art = al->items; /* hmm, out of stuff, loop back around */ |
|
|
1332 | |
1338 | art = art->next; |
1333 | art = art->next; |
1339 | } |
1334 | } |
1340 | |
1335 | |
1341 | /* the base 'generic' name for our artifact */ |
1336 | /* the base 'generic' name for our artifact */ |
1342 | assign (name, art_name_array[index].name); |
1337 | assign (name, art_name_array[index].name); |
… | |
… | |
1355 | |
1350 | |
1356 | /* separator of items */ |
1351 | /* separator of items */ |
1357 | strcpy (buf, "--- \n"); |
1352 | strcpy (buf, "--- \n"); |
1358 | |
1353 | |
1359 | /* Name */ |
1354 | /* Name */ |
1360 | if (art->allowed != NULL && strcmp (art->allowed->name, "All")) |
1355 | if (art->allowed && art->allowed->name != shstr_All) |
1361 | { |
1356 | { |
1362 | linked_char *temp, *next = art->allowed; |
1357 | linked_char *temp, *next = art->allowed; |
1363 | |
1358 | |
1364 | do |
1359 | do |
1365 | { |
1360 | { |
1366 | temp = next; |
1361 | temp = next; |
1367 | next = next->next; |
1362 | next = next->next; |
1368 | } |
1363 | } |
1369 | while (next && !RANDOM () % 2); |
1364 | while (next && rndm (2)); |
1370 | sprintf (buf, "%s A %s of %s", buf, &temp->name, &art->item->name); |
1365 | sprintf (buf, "%s A %s of %s", buf, &temp->name, &art->item->name); |
1371 | } |
1366 | } |
1372 | else /* default name is used */ |
1367 | else /* default name is used */ |
1373 | sprintf (buf, "%s The %s of %s", buf, name, &art->item->name); |
1368 | sprintf (buf, "%s The %s of %s", buf, name, &art->item->name); |
1374 | |
1369 | |
… | |
… | |
1387 | /* value of artifact */ |
1382 | /* value of artifact */ |
1388 | sprintf (buf, "%s item with a value that is %d times normal.\n", buf, art->item->value); |
1383 | sprintf (buf, "%s item with a value that is %d times normal.\n", buf, art->item->value); |
1389 | |
1384 | |
1390 | /* include the message about the artifact, if exists, and book |
1385 | /* include the message about the artifact, if exists, and book |
1391 | * level is kinda high */ |
1386 | * level is kinda high */ |
1392 | if (art->item->msg && (RANDOM () % 4 + 1) < level && !((strlen (art->item->msg) + strlen (buf)) > BOOK_BUF)) |
1387 | if (art->item->msg |
|
|
1388 | && rndm (4) + 1 < level |
|
|
1389 | && !(strlen (art->item->msg) + strlen (buf) > BOOK_BUF)) |
1393 | strcat (buf, art->item->msg); |
1390 | strcat (buf, art->item->msg); |
1394 | |
1391 | |
1395 | /* properties of the artifact */ |
1392 | /* properties of the artifact */ |
1396 | tmp = object::create (); |
1393 | tmp = object::create (); |
1397 | add_abilities (tmp, art->item); |
1394 | add_abilities (tmp, art->item); |
… | |
… | |
1429 | char * |
1426 | char * |
1430 | spellpath_msg (int level, int booksize) |
1427 | spellpath_msg (int level, int booksize) |
1431 | { |
1428 | { |
1432 | static char retbuf[BOOK_BUF]; |
1429 | static char retbuf[BOOK_BUF]; |
1433 | char tmpbuf[BOOK_BUF]; |
1430 | char tmpbuf[BOOK_BUF]; |
1434 | int path = RANDOM () % NRSPELLPATHS, prayers = RANDOM () % 2; |
1431 | int path = rndm (NRSPELLPATHS), prayers = rndm (2); |
1435 | int did_first_sp = 0; |
1432 | int did_first_sp = 0; |
1436 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1433 | uint32 pnum = (path == -1) ? PATH_NULL : spellpathdef[path]; |
1437 | archetype *at; |
1434 | archetype *at; |
1438 | |
1435 | |
1439 | /* Preamble */ |
1436 | /* Preamble */ |
… | |
… | |
1442 | if (path == -1) |
1439 | if (path == -1) |
1443 | strcat (retbuf, "having no known spell path.\n"); |
1440 | strcat (retbuf, "having no known spell path.\n"); |
1444 | else |
1441 | else |
1445 | sprintf (retbuf, "%sbelonging to the path of %s:\n", retbuf, spellpathnames[path]); |
1442 | sprintf (retbuf, "%sbelonging to the path of %s:\n", retbuf, spellpathnames[path]); |
1446 | |
1443 | |
1447 | for (at = first_archetype; at != NULL; at = at->next) |
1444 | for_all_archetypes (at) |
1448 | { |
1445 | { |
1449 | /* Determine if this is an appropriate spell. Must |
1446 | /* Determine if this is an appropriate spell. Must |
1450 | * be of matching path, must be of appropriate type (prayer |
1447 | * be of matching path, must be of appropriate type (prayer |
1451 | * or not), and must be within the valid level range. |
1448 | * or not), and must be within the valid level range. |
1452 | */ |
1449 | */ |
1453 | if (at->clone.type == SPELL && at->clone.path_attuned & pnum && |
1450 | if (at->type == SPELL && at->path_attuned & pnum && |
1454 | ((at->clone.stats.grace && prayers) || (at->clone.stats.sp && !prayers)) && (at->clone.level < (level * 8))) |
1451 | ((at->stats.grace && prayers) || (at->stats.sp && !prayers)) && (at->level < (level * 8))) |
1455 | { |
1452 | { |
1456 | assign (tmpbuf, at->clone.name); |
1453 | assign (tmpbuf, at->object::name); |
1457 | |
1454 | |
1458 | if (book_overflow (retbuf, tmpbuf, booksize)) |
1455 | if (book_overflow (retbuf, tmpbuf, booksize)) |
1459 | break; |
1456 | break; |
1460 | else |
1457 | else |
1461 | { |
1458 | { |
… | |
… | |
1467 | } |
1464 | } |
1468 | } |
1465 | } |
1469 | /* Geez, no spells were generated. */ |
1466 | /* Geez, no spells were generated. */ |
1470 | if (!did_first_sp) |
1467 | if (!did_first_sp) |
1471 | { |
1468 | { |
1472 | if (RANDOM () % 4) /* usually, lets make a recursive call... */ |
1469 | if (rndm (4)) /* usually, lets make a recursive call... */ |
1473 | spellpath_msg (level, booksize); |
1470 | spellpath_msg (level, booksize); |
1474 | else /* give up, cause knowing no spells exist for path is info too. */ |
1471 | else /* give up, cause knowing no spells exist for path is info too. */ |
1475 | strcat (retbuf, "\n - no known spells exist -\n"); |
1472 | strcat (retbuf, "\n - no known spells exist -\n"); |
1476 | } |
1473 | } |
1477 | else |
1474 | else |
… | |
… | |
1493 | int chance; |
1490 | int chance; |
1494 | |
1491 | |
1495 | /* the higher the book level, the more complex (ie number of |
1492 | /* the higher the book level, the more complex (ie number of |
1496 | * ingredients) the formula can be. |
1493 | * ingredients) the formula can be. |
1497 | */ |
1494 | */ |
1498 | fl = get_formulalist (((RANDOM () % level) / 3) + 1); |
1495 | fl = get_formulalist (rndm (level) / 3 + 1); |
1499 | |
1496 | |
1500 | if (!fl) |
1497 | if (!fl) |
1501 | fl = get_formulalist (1); /* safety */ |
1498 | fl = get_formulalist (1); /* safety */ |
1502 | |
1499 | |
1503 | if (fl->total_chance == 0) |
1500 | if (fl->total_chance == 0) |
… | |
… | |
1507 | add_author (book, 4); |
1504 | add_author (book, 4); |
1508 | return; |
1505 | return; |
1509 | } |
1506 | } |
1510 | |
1507 | |
1511 | /* get a random formula, weighted by its bookchance */ |
1508 | /* get a random formula, weighted by its bookchance */ |
1512 | chance = RANDOM () % fl->total_chance; |
1509 | chance = rndm (fl->total_chance); |
1513 | for (formula = fl->items; formula != NULL; formula = formula->next) |
1510 | for (formula = fl->items; formula; formula = formula->next) |
1514 | { |
1511 | { |
1515 | chance -= formula->chance; |
1512 | chance -= formula->chance; |
1516 | if (chance <= 0) |
1513 | if (chance <= 0) |
1517 | break; |
1514 | break; |
1518 | } |
1515 | } |
… | |
… | |
1528 | { |
1525 | { |
1529 | /* looks like a formula was found. Base the amount |
1526 | /* looks like a formula was found. Base the amount |
1530 | * of information on the booklevel and the spellevel |
1527 | * of information on the booklevel and the spellevel |
1531 | * of the formula. */ |
1528 | * of the formula. */ |
1532 | |
1529 | |
1533 | const char *op_name = formula->arch_name[RANDOM () % formula->arch_names]; |
1530 | const char *op_name = formula->arch_name [rndm (formula->arch_names)]; |
1534 | archetype *at; |
1531 | archetype *at; |
1535 | |
1532 | |
1536 | /* preamble */ |
1533 | /* preamble */ |
1537 | sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill"); |
1534 | sprintf (retbuf, "Herein is described a project using %s: \n", formula->skill ? &formula->skill : "an unknown skill"); |
1538 | |
1535 | |
1539 | if ((at = archetype::find (op_name)) != (archetype *) NULL) |
1536 | if ((at = archetype::find (op_name)) != (archetype *) NULL) |
1540 | op_name = at->clone.name; |
1537 | op_name = at->object::name; |
1541 | else |
1538 | else |
1542 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
1539 | LOG (llevError, "formula_msg() can't find arch %s for formula.\n", op_name); |
1543 | |
1540 | |
1544 | /* item name */ |
1541 | /* item name */ |
1545 | if (strcmp (formula->title, "NONE")) |
1542 | if (formula->title != shstr_NONE) |
1546 | { |
1543 | { |
1547 | sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title); |
1544 | sprintf (retbuf, "%sThe %s of %s", retbuf, op_name, &formula->title); |
1548 | /* This results in things like pile of philo. sulfur. |
1545 | /* This results in things like pile of philo. sulfur. |
1549 | * while philo. sulfur may look better, without this, |
1546 | * while philo. sulfur may look better, without this, |
1550 | * you get things like 'the wise' because its missing the |
1547 | * you get things like 'the wise' because its missing the |
1551 | * water of section. |
1548 | * water of section. |
1552 | */ |
1549 | */ |
1553 | sprintf (title, "%s: %s of %s", |
1550 | sprintf (title, "%s: %s of %s", |
1554 | formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); |
1551 | formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name, &formula->title); |
1555 | } |
1552 | } |
1556 | else |
1553 | else |
1557 | { |
1554 | { |
1558 | sprintf (retbuf, "%sThe %s", retbuf, op_name); |
1555 | sprintf (retbuf, "%sThe %s", retbuf, op_name); |
1559 | sprintf (title, "%s: %s", formula_book_name[RANDOM () % (sizeof (formula_book_name) / sizeof (char *))], op_name); |
1556 | sprintf (title, "%s: %s", formula_book_name [rndm (sizeof (formula_book_name) / sizeof (char *))], op_name); |
1560 | if (at->clone.title) |
1557 | if (at->title) |
1561 | { |
1558 | { |
1562 | strcat (retbuf, " "); |
1559 | strcat (retbuf, " "); |
1563 | strcat (retbuf, at->clone.title); |
1560 | strcat (retbuf, at->title); |
1564 | strcat (title, " "); |
1561 | strcat (title, " "); |
1565 | strcat (title, at->clone.title); |
1562 | strcat (title, at->title); |
1566 | } |
1563 | } |
1567 | } |
1564 | } |
|
|
1565 | |
1568 | /* Lets name the book something meaningful ! */ |
1566 | /* Lets name the book something meaningful ! */ |
1569 | book->name = title; |
1567 | book->name = title; |
1570 | book->title = NULL; |
1568 | book->title = NULL; |
1571 | |
1569 | |
1572 | /* ingredients to make it */ |
1570 | /* ingredients to make it */ |
… | |
… | |
1576 | archetype *at; |
1574 | archetype *at; |
1577 | |
1575 | |
1578 | at = archetype::find (formula->cauldron); |
1576 | at = archetype::find (formula->cauldron); |
1579 | |
1577 | |
1580 | sprintf (retbuf + strlen (retbuf), |
1578 | sprintf (retbuf + strlen (retbuf), |
1581 | " may be made at %s using the following ingredients:\n", at ? query_name (&at->clone) : "an unknown place"); |
1579 | " may be made at %s using the following ingredients:\n", at ? query_name (at) : "an unknown place"); |
1582 | |
1580 | |
1583 | for (next = formula->ingred; next != NULL; next = next->next) |
1581 | for (next = formula->ingred; next != NULL; next = next->next) |
1584 | { |
1582 | { |
1585 | strcat (retbuf, next->name); |
1583 | strcat (retbuf, next->name); |
1586 | strcat (retbuf, "\n"); |
1584 | strcat (retbuf, "\n"); |
… | |
… | |
1592 | strcat (retbuf, "\n"); |
1590 | strcat (retbuf, "\n"); |
1593 | |
1591 | |
1594 | book->msg = retbuf; |
1592 | book->msg = retbuf; |
1595 | } |
1593 | } |
1596 | } |
1594 | } |
|
|
1595 | |
|
|
1596 | #define DESCRIBE_PATH(retbuf, variable, name) \ |
|
|
1597 | if(variable) { \ |
|
|
1598 | int i,j=0; \ |
|
|
1599 | strcat(retbuf,"(" name ": "); \ |
|
|
1600 | for(i=0; i<NRSPELLPATHS; i++) \ |
|
|
1601 | if(variable & (1<<i)) { \ |
|
|
1602 | if (j) \ |
|
|
1603 | strcat(retbuf,", "); \ |
|
|
1604 | else \ |
|
|
1605 | j = 1; \ |
|
|
1606 | strcat(retbuf, spellpathnames[i]); \ |
|
|
1607 | } \ |
|
|
1608 | strcat(retbuf,")"); \ |
|
|
1609 | } |
1597 | |
1610 | |
1598 | /* god_info_msg() - generate a message detailing the properties |
1611 | /* god_info_msg() - generate a message detailing the properties |
1599 | * of a random god. Used by the book hack. b.t. |
1612 | * of a random god. Used by the book hack. b.t. |
1600 | */ |
1613 | */ |
1601 | const char * |
1614 | const char * |
… | |
… | |
1630 | |
1643 | |
1631 | /* Information about the god is random, and based on the level of the |
1644 | /* Information about the god is random, and based on the level of the |
1632 | * 'book'. Probably there is a more intellegent way to implement |
1645 | * 'book'. Probably there is a more intellegent way to implement |
1633 | * this ... |
1646 | * this ... |
1634 | */ |
1647 | */ |
1635 | |
|
|
1636 | while (level > 0) |
1648 | while (level > 0) |
1637 | { |
1649 | { |
1638 | sprintf (buf, " "); |
1650 | sprintf (buf, " "); |
1639 | if (level == 2 && RANDOM () % 2) |
1651 | if (level == 2 && rndm (2)) |
1640 | { /* enemy god */ |
1652 | { /* enemy god */ |
1641 | const char *enemy = god->title; |
1653 | const char *enemy = god->title; |
1642 | |
1654 | |
1643 | if (enemy) |
1655 | if (enemy) |
1644 | sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); |
1656 | sprintf (buf, "The gods %s and %s are enemies.\n ---\n", name, enemy); |
1645 | } |
1657 | } |
1646 | |
1658 | |
1647 | if (level == 3 && RANDOM () % 2) |
1659 | if (level == 3 && rndm (2)) |
1648 | { /* enemy race, what the god's holy word effects */ |
1660 | { /* enemy race, what the god's holy word effects */ |
1649 | const char *enemy = god->slaying; |
1661 | const char *enemy = god->slaying; |
1650 | |
1662 | |
1651 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1663 | if (enemy && !(god->path_denied & PATH_TURNING)) |
1652 | if ((i = nstrtok (enemy, ",")) > 0) |
1664 | if ((i = nstrtok (enemy, ",")) > 0) |
… | |
… | |
1661 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1673 | sprintf (tmpbuf, "race of%s", strtoktolin (enemy, ",")); |
1662 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1674 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1663 | } |
1675 | } |
1664 | } |
1676 | } |
1665 | |
1677 | |
1666 | if (level == 4 && RANDOM () % 2) |
1678 | if (level == 4 && rndm (2)) |
1667 | { /* Priest of god gets these protect,vulnerable... */ |
1679 | { /* Priest of god gets these protect,vulnerable... */ |
1668 | char tmpbuf[MAX_BUF]; |
1680 | char tmpbuf[MAX_BUF]; |
1669 | |
1681 | |
1670 | if (const char *cp = describe_resistance (god, 1)) |
1682 | if (const char *cp = describe_resistance (god, 1)) |
1671 | { /* This god does have protections */ |
1683 | { /* This god does have protections */ |
… | |
… | |
1677 | } |
1689 | } |
1678 | else |
1690 | else |
1679 | sprintf (buf, " "); |
1691 | sprintf (buf, " "); |
1680 | } |
1692 | } |
1681 | |
1693 | |
1682 | if (level == 5 && RANDOM () % 2) |
1694 | if (level == 5 && rndm (2)) |
1683 | { /* aligned race, summoning */ |
1695 | { /* aligned race, summoning */ |
1684 | const char *race = god->race; /* aligned race */ |
1696 | const char *race = god->race; /* aligned race */ |
1685 | |
1697 | |
1686 | if (race && !(god->path_denied & PATH_SUMMON)) |
1698 | if (race && !(god->path_denied & PATH_SUMMON)) |
1687 | if ((i = nstrtok (race, ",")) > 0) |
1699 | if ((i = nstrtok (race, ",")) > 0) |
… | |
… | |
1695 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1707 | sprintf (tmpbuf, "race of%s", strtoktolin (race, ",")); |
1696 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1708 | sprintf (buf, "%s%s\n ---\n", buf, tmpbuf); |
1697 | } |
1709 | } |
1698 | } |
1710 | } |
1699 | |
1711 | |
1700 | if (level == 6 && RANDOM () % 2) |
1712 | if (level == 6 && rndm (2)) |
1701 | { /* blessing,curse properties of the god */ |
1713 | { /* blessing,curse properties of the god */ |
1702 | char tmpbuf[MAX_BUF]; |
1714 | char tmpbuf[MAX_BUF]; |
1703 | |
1715 | |
1704 | if (const char *cp = describe_resistance (god, 1)) |
1716 | if (const char *cp = describe_resistance (god, 1)) |
1705 | { /* This god does have protections */ |
1717 | { /* This god does have protections */ |
… | |
… | |
1712 | else |
1724 | else |
1713 | sprintf (buf, " "); |
1725 | sprintf (buf, " "); |
1714 | |
1726 | |
1715 | } |
1727 | } |
1716 | |
1728 | |
1717 | if (level == 8 && RANDOM () % 2) |
1729 | if (level == 8 && rndm (2)) |
1718 | { /* immunity, holy possession */ |
1730 | { /* immunity, holy possession */ |
1719 | int has_effect = 0, tmpvar; |
1731 | int has_effect = 0, tmpvar; |
1720 | char tmpbuf[MAX_BUF]; |
1732 | char tmpbuf[MAX_BUF]; |
1721 | |
1733 | |
1722 | sprintf (tmpbuf, "\n"); |
1734 | sprintf (tmpbuf, "\n"); |
… | |
… | |
1740 | } |
1752 | } |
1741 | else |
1753 | else |
1742 | sprintf (buf, " "); |
1754 | sprintf (buf, " "); |
1743 | } |
1755 | } |
1744 | |
1756 | |
1745 | if (level == 12 && RANDOM () % 2) |
1757 | if (level == 12 && rndm (2)) |
1746 | { /* spell paths */ |
1758 | { /* spell paths */ |
1747 | int has_effect = 0, tmpvar; |
1759 | int has_effect = 0, tmpvar; |
1748 | char tmpbuf[MAX_BUF]; |
1760 | char tmpbuf[MAX_BUF]; |
1749 | |
1761 | |
1750 | sprintf (tmpbuf, "\n"); |
1762 | sprintf (tmpbuf, "\n"); |
… | |
… | |
1820 | */ |
1832 | */ |
1821 | void |
1833 | void |
1822 | tailor_readable_ob (object *book, int msg_type) |
1834 | tailor_readable_ob (object *book, int msg_type) |
1823 | { |
1835 | { |
1824 | char msgbuf[BOOK_BUF]; |
1836 | char msgbuf[BOOK_BUF]; |
1825 | int level = book->level ? (RANDOM () % book->level) + 1 : 1; |
1837 | int level = book->level ? rndm (book->level) + 1 : 1; |
1826 | int book_buf_size; |
1838 | int book_buf_size; |
1827 | |
1839 | |
1828 | /* safety */ |
1840 | /* safety */ |
1829 | if (book->type != BOOK) |
1841 | if (book->type != BOOK) |
1830 | return; |
1842 | return; |
… | |
… | |
1844 | * 2) make sure there is an entry in max_titles[] array. |
1856 | * 2) make sure there is an entry in max_titles[] array. |
1845 | * 3) make sure there are entries for your case in new_text_title() |
1857 | * 3) make sure there are entries for your case in new_text_title() |
1846 | * and add_authour(). |
1858 | * and add_authour(). |
1847 | * 4) you may want separate authour/book name arrays in read.h |
1859 | * 4) you may want separate authour/book name arrays in read.h |
1848 | */ |
1860 | */ |
1849 | |
|
|
1850 | msg_type = msg_type > 0 ? msg_type : (RANDOM () % 6); |
1861 | msg_type = msg_type > 0 ? msg_type : rndm (8); |
1851 | switch (msg_type) |
1862 | switch (msg_type) |
1852 | { |
1863 | { |
1853 | case 1: /* monster attrib */ |
1864 | case 1: /* monster attrib */ |
1854 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1865 | strcpy (msgbuf, mon_info_msg (level, book_buf_size)); |
1855 | break; |
1866 | break; |
… | |
… | |
1879 | { |
1890 | { |
1880 | book->msg = msgbuf; |
1891 | book->msg = msgbuf; |
1881 | /* lets give the "book" a new name, which may be a compound word */ |
1892 | /* lets give the "book" a new name, which may be a compound word */ |
1882 | change_book (book, msg_type); |
1893 | change_book (book, msg_type); |
1883 | } |
1894 | } |
1884 | |
|
|
1885 | } |
1895 | } |
1886 | |
1896 | |
1887 | |
1897 | |
1888 | /***************************************************************************** |
1898 | /***************************************************************************** |
1889 | * |
1899 | * |
… | |
… | |
1984 | get_readable_message_type (object *readable) |
1994 | get_readable_message_type (object *readable) |
1985 | { |
1995 | { |
1986 | uint8 subtype = readable->subtype; |
1996 | uint8 subtype = readable->subtype; |
1987 | |
1997 | |
1988 | if (subtype > last_readable_subtype) |
1998 | if (subtype > last_readable_subtype) |
1989 | return &(readable_message_types[0]); |
1999 | return &readable_message_types[0]; |
|
|
2000 | |
1990 | return &(readable_message_types[subtype]); |
2001 | return &readable_message_types[subtype]; |
1991 | } |
2002 | } |