1 #include "load/quest-loader.h"
2 #include "dungeon/quest.h"
3 #include "floor/floor-town.h"
4 #include "load/angband-version-comparer.h"
5 #include "load/load-util.h"
6 #include "load/load-zangband.h"
7 #include "monster-race/monster-race.h"
8 #include "monster-race/race-flags1.h"
9 #include "monster-race/race-flags7.h"
10 #include "object-enchant/trg-types.h"
11 #include "system/artifact-type-definition.h"
12 #include "system/floor-type-definition.h"
13 #include "system/monster-race-definition.h"
14 #include "system/player-type-definition.h"
15 #include "util/enum-converter.h"
18 * @brief ランダムクエスト情報の読み込み
20 * @details MAX_TRIES: ランダムクエストのモンスターを確定するために試行する回数 /
21 * Maximum number of tries for selection of a proper quest monster
23 void rd_unique_info(void)
25 const int MAX_TRIES = 100;
26 for (auto &r_ref : r_info) {
27 r_ref.max_num = MAX_TRIES;
28 if (r_ref.flags1 & RF1_UNIQUE)
30 else if (r_ref.flags7 & RF7_NAZGUL)
31 r_ref.max_num = MAX_NAZGUL_NUM;
37 uint16_t max_towns_load;
38 rd_u16b(&max_towns_load);
39 if (max_towns_load <= max_towns)
42 load_note(format(_("町が多すぎる(%u)!", "Too many (%u) towns!"), max_towns_load));
46 errr load_quest_info(uint16_t *max_quests_load, byte *max_rquests_load)
48 rd_u16b(max_quests_load);
49 if (h_older_than(1, 0, 7))
50 *max_rquests_load = 10;
52 rd_byte(max_rquests_load);
54 if (*max_quests_load <= max_q_idx)
57 load_note(format(_("クエストが多すぎる(%u)!", "Too many (%u) quests!"), *max_quests_load));
61 static bool check_quest_index(int loading_quest_index)
63 if (loading_quest_index < max_q_idx)
71 static void load_quest_completion(quest_type *q_ptr)
75 q_ptr->status = i2enum<QuestStatusType>(tmp16s);
77 q_ptr->level = tmp16s;
79 if (h_older_than(1, 0, 6))
84 q_ptr->complev = tmp8u;
87 if (h_older_than(2, 1, 2, 2))
90 rd_u32b(&q_ptr->comptime);
93 static void load_quest_details(player_type *player_ptr, quest_type *q_ptr, int loading_quest_index)
97 q_ptr->cur_num = (MONSTER_NUMBER)tmp16s;
99 q_ptr->max_num = (MONSTER_NUMBER)tmp16s;
100 rd_s16b(&q_ptr->type);
102 rd_s16b(&q_ptr->r_idx);
103 if ((q_ptr->type == QUEST_TYPE_RANDOM) && (!q_ptr->r_idx))
104 determine_random_questor(player_ptr, &quest[loading_quest_index]);
106 rd_s16b(&q_ptr->k_idx);
108 a_info[q_ptr->k_idx].gen_flags.set(TRG::QUESTITEM);
112 q_ptr->flags = tmp8u;
115 void analyze_quests(player_type *player_ptr, const uint16_t max_quests_load, const byte max_rquests_load)
117 QUEST_IDX old_inside_quest = player_ptr->current_floor_ptr->inside_quest;
118 for (int i = 0; i < max_quests_load; i++) {
119 if (check_quest_index(i))
122 quest_type *const q_ptr = &quest[i];
123 load_quest_completion(q_ptr);
124 bool is_quest_running = (q_ptr->status == QuestStatusType::TAKEN);
125 is_quest_running |= (!h_older_than(0, 3, 14) && (q_ptr->status == QuestStatusType::COMPLETED));
126 is_quest_running |= (!h_older_than(1, 0, 7) && (i >= MIN_RANDOM_QUEST) && (i <= (MIN_RANDOM_QUEST + max_rquests_load)));
127 if (!is_quest_running)
130 load_quest_details(player_ptr, q_ptr, i);
131 if (h_older_than(0, 3, 11))
132 set_zangband_quest(player_ptr, q_ptr, i, old_inside_quest);
136 q_ptr->dungeon = tmp8u;
139 if (q_ptr->status == QuestStatusType::TAKEN || q_ptr->status == QuestStatusType::UNTAKEN)
140 if (r_info[q_ptr->r_idx].flags1 & RF1_UNIQUE)
141 r_info[q_ptr->r_idx].flags1 |= RF1_QUESTOR;