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"
17 * @brief ランダムクエスト情報の読み込み
19 * @details MAX_TRIES: ランダムクエストのモンスターを確定するために試行する回数 /
20 * Maximum number of tries for selection of a proper quest monster
22 void rd_unique_info(void)
24 const int MAX_TRIES = 100;
25 for (auto &r_ref : r_info) {
26 r_ref.max_num = MAX_TRIES;
27 if (r_ref.flags1 & RF1_UNIQUE)
29 else if (r_ref.flags7 & RF7_NAZGUL)
30 r_ref.max_num = MAX_NAZGUL_NUM;
36 uint16_t max_towns_load;
37 rd_u16b(&max_towns_load);
38 if (max_towns_load <= max_towns)
41 load_note(format(_("町が多すぎる(%u)!", "Too many (%u) towns!"), max_towns_load));
45 errr load_quest_info(uint16_t *max_quests_load, byte *max_rquests_load)
47 rd_u16b(max_quests_load);
48 if (h_older_than(1, 0, 7))
49 *max_rquests_load = 10;
51 rd_byte(max_rquests_load);
53 if (*max_quests_load <= max_q_idx)
56 load_note(format(_("クエストが多すぎる(%u)!", "Too many (%u) quests!"), *max_quests_load));
60 static bool check_quest_index(int loading_quest_index)
62 if (loading_quest_index < max_q_idx)
70 static void load_quest_completion(quest_type *q_ptr)
72 rd_s16b(&q_ptr->status);
75 q_ptr->level = tmp16s;
77 if (h_older_than(1, 0, 6))
82 q_ptr->complev = tmp8u;
85 if (h_older_than(2, 1, 2, 2))
88 rd_u32b(&q_ptr->comptime);
91 static void load_quest_details(player_type *player_ptr, quest_type *q_ptr, int loading_quest_index)
95 q_ptr->cur_num = (MONSTER_NUMBER)tmp16s;
97 q_ptr->max_num = (MONSTER_NUMBER)tmp16s;
98 rd_s16b(&q_ptr->type);
100 rd_s16b(&q_ptr->r_idx);
101 if ((q_ptr->type == QUEST_TYPE_RANDOM) && (!q_ptr->r_idx))
102 determine_random_questor(player_ptr, &quest[loading_quest_index]);
104 rd_s16b(&q_ptr->k_idx);
106 a_info[q_ptr->k_idx].gen_flags.set(TRG::QUESTITEM);
110 q_ptr->flags = tmp8u;
113 void analyze_quests(player_type *player_ptr, const uint16_t max_quests_load, const byte max_rquests_load)
115 QUEST_IDX old_inside_quest = player_ptr->current_floor_ptr->inside_quest;
116 for (int i = 0; i < max_quests_load; i++) {
117 if (check_quest_index(i))
120 quest_type *const q_ptr = &quest[i];
121 load_quest_completion(q_ptr);
122 bool is_quest_running = (q_ptr->status == QUEST_STATUS_TAKEN);
123 is_quest_running |= (!h_older_than(0, 3, 14) && (q_ptr->status == QUEST_STATUS_COMPLETED));
124 is_quest_running |= (!h_older_than(1, 0, 7) && (i >= MIN_RANDOM_QUEST) && (i <= (MIN_RANDOM_QUEST + max_rquests_load)));
125 if (!is_quest_running)
128 load_quest_details(player_ptr, q_ptr, i);
129 if (h_older_than(0, 3, 11))
130 set_zangband_quest(player_ptr, q_ptr, i, old_inside_quest);
134 q_ptr->dungeon = tmp8u;
137 if (q_ptr->status == QUEST_STATUS_TAKEN || q_ptr->status == QUEST_STATUS_UNTAKEN)
138 if (r_info[q_ptr->r_idx].flags1 & RF1_UNIQUE)
139 r_info[q_ptr->r_idx].flags1 |= RF1_QUESTOR;