1 #include "info-reader/dungeon-reader.h"
2 #include "dungeon/dungeon.h"
3 #include "grid/feature.h"
4 #include "info-reader/dungeon-info-tokens-table.h"
5 #include "info-reader/feature-reader.h"
6 #include "info-reader/info-reader-util.h"
7 #include "info-reader/parse-error-types.h"
8 #include "info-reader/race-info-tokens-table.h"
9 #include "io/tokenizer.h"
10 #include "main/angband-headers.h"
11 #include "util/string-processor.h"
12 #include "view/display-messages.h"
15 * @brief テキストトークンを走査してフラグを一つ得る(ダンジョン用) /
16 * Grab one flag for a dungeon type from a textual string
17 * @param d_ptr 保管先のダンジョン構造体参照ポインタ
18 * @param what 参照元の文字列ポインタ
21 static bool grab_one_dungeon_flag(dungeon_type *d_ptr, std::string_view what)
23 if (EnumClassFlagGroup<DF>::grab_one_flag(d_ptr->flags, d_info_flags, what))
26 msg_format(_("未知のダンジョン・フラグ '%s'。", "Unknown dungeon type flag '%s'."), what.data());
31 * @brief テキストトークンを走査してフラグを一つ得る(モンスターのダンジョン出現条件用1) /
32 * Grab one (basic) flag in a monster_race from a textual string
33 * @param d_ptr 保管先のダンジョン構造体参照ポインタ
34 * @param what 参照元の文字列ポインタ
37 static bool grab_one_basic_monster_flag(dungeon_type *d_ptr, std::string_view what)
39 if (info_grab_one_flag(d_ptr->mflags1, r_info_flags1, what))
42 if (info_grab_one_flag(d_ptr->mflags2, r_info_flags2, what))
45 if (info_grab_one_flag(d_ptr->mflags3, r_info_flags3, what))
48 if (info_grab_one_flag(d_ptr->mflags7, r_info_flags7, what))
51 if (info_grab_one_flag(d_ptr->mflags8, r_info_flags8, what))
54 if (info_grab_one_flag(d_ptr->mflags9, r_info_flags9, what))
57 if (info_grab_one_flag(d_ptr->mflagsr, r_info_flagsr, what))
60 msg_format(_("未知のモンスター・フラグ '%s'。", "Unknown monster flag '%s'."), what.data());
65 * @brief テキストトークンを走査してフラグを一つ得る(モンスターのダンジョン出現条件用2) /
66 * Grab one (spell) flag in a monster_race from a textual string
67 * @param d_ptr 保管先のダンジョン構造体参照ポインタ
68 * @param what 参照元の文字列ポインタ
71 static bool grab_one_spell_monster_flag(dungeon_type *d_ptr, std::string_view what)
73 if (EnumClassFlagGroup<RF_ABILITY>::grab_one_flag(d_ptr->m_ability_flags, r_info_ability_flags, what))
76 msg_format(_("未知のモンスター・フラグ '%s'。", "Unknown monster flag '%s'."), what.data());
81 * @brief ダンジョン情報(d_info)のパース関数 /
82 * Initialize the "d_info" array, by parsing an ascii "template" file
87 errr parse_d_info(std::string_view buf, angband_header *head)
89 static dungeon_type *d_ptr = NULL;
90 const auto &tokens = str_split(buf, ':', false);
92 if (tokens[0] == "N") {
94 if (tokens.size() < 3 || tokens[1].size() == 0)
95 return PARSE_ERROR_TOO_FEW_ARGUMENTS;
97 auto i = std::stoi(tokens[1]);
99 return PARSE_ERROR_NON_SEQUENTIAL_RECORDS;
100 if (i >= head->info_num)
101 return PARSE_ERROR_OUT_OF_BOUNDS;
106 d_ptr->name = tokens[2];
109 return PARSE_ERROR_MISSING_RECORD_HEADER;
110 else if (tokens[0] == "E") {
113 if (tokens.size() < 2 || tokens[1].size() == 0)
114 return PARSE_ERROR_TOO_FEW_ARGUMENTS;
115 d_ptr->name = tokens[1];
117 } else if (tokens[0] == "D") {
120 if (tokens.size() < 2 || tokens[1].size() == 0)
121 return PARSE_ERROR_TOO_FEW_ARGUMENTS;
123 if (tokens[1][0] == '$')
124 return PARSE_ERROR_NONE;
125 d_ptr->text.append(buf.substr(2));
127 if (tokens[1][0] != '$')
128 return PARSE_ERROR_NONE;
129 d_ptr->text.append(buf.substr(3));
131 } else if (tokens[0] == "W") {
132 // W:min_level:max_level:(1):mode:(2):(3):(4):(5):prob_pit:prob_nest
133 // (1)minimum player level (unused)
134 // (2)minimum level of allocating monster
135 // (3)maximum probability of level boost of allocation monster
136 // (4)maximum probability of dropping good objects
137 // (5)maximum probability of dropping great objects
138 if (tokens.size() < 11)
139 return PARSE_ERROR_TOO_FEW_ARGUMENTS;
141 info_set_value(d_ptr->mindepth, tokens[1]);
142 info_set_value(d_ptr->maxdepth, tokens[2]);
143 info_set_value(d_ptr->min_plev, tokens[3]);
144 info_set_value(d_ptr->mode, tokens[4]);
145 info_set_value(d_ptr->min_m_alloc_level, tokens[5]);
146 info_set_value(d_ptr->max_m_alloc_chance, tokens[6]);
147 info_set_value(d_ptr->obj_good, tokens[7]);
148 info_set_value(d_ptr->obj_great, tokens[8]);
149 info_set_value(d_ptr->pit, tokens[9], 16);
150 info_set_value(d_ptr->nest, tokens[10], 16);
151 } else if (tokens[0] == "P") {
153 if (tokens.size() < 3)
154 return PARSE_ERROR_TOO_FEW_ARGUMENTS;
156 info_set_value(d_ptr->dy, tokens[1]);
157 info_set_value(d_ptr->dx, tokens[2]);
158 } else if (tokens[0] == "L") {
159 // L:floor_1:prob_1:floor_2:prob_2:floor_3:prob_3:tunnel_prob
160 if (tokens.size() < DUNGEON_FEAT_PROB_NUM * 2 + 2)
161 return PARSE_ERROR_TOO_FEW_ARGUMENTS;
163 for (size_t i = 0; i < DUNGEON_FEAT_PROB_NUM; i++) {
164 auto feat_idx = i * 2 + 1;
165 auto per_idx = feat_idx + 1;
166 d_ptr->floor[i].feat = f_tag_to_index(tokens[feat_idx]);
167 if (d_ptr->floor[i].feat < 0)
168 return PARSE_ERROR_UNDEFINED_TERRAIN_TAG;
170 info_set_value(d_ptr->floor[i].percent, tokens[per_idx]);
173 auto tunnel_idx = DUNGEON_FEAT_PROB_NUM * 2 + 1;
174 info_set_value(d_ptr->tunnel_percent, tokens[tunnel_idx]);
175 } else if (tokens[0] == "A") {
176 // A:wall_1:prob_1:wall_2:prob_2:wall_3:prob_3:outer_wall:inner_wall:stream_1:stream_2
177 if (tokens.size() < DUNGEON_FEAT_PROB_NUM * 2 + 5)
178 return PARSE_ERROR_TOO_FEW_ARGUMENTS;
180 for (int i = 0; i < DUNGEON_FEAT_PROB_NUM; i++) {
181 auto feat_idx = i * 2 + 1;
182 auto prob_idx = feat_idx + 1;
183 d_ptr->fill[i].feat = f_tag_to_index(tokens[feat_idx]);
184 if (d_ptr->fill[i].feat < 0)
185 return PARSE_ERROR_UNDEFINED_TERRAIN_TAG;
187 info_set_value(d_ptr->fill[i].percent, tokens[prob_idx]);
190 auto idx = DUNGEON_FEAT_PROB_NUM * 2 + 1;
191 d_ptr->outer_wall = f_tag_to_index(tokens[idx++]);
192 if (d_ptr->outer_wall < 0)
193 return PARSE_ERROR_UNDEFINED_TERRAIN_TAG;
195 d_ptr->inner_wall = f_tag_to_index(tokens[idx++]);
196 if (d_ptr->inner_wall < 0)
197 return PARSE_ERROR_UNDEFINED_TERRAIN_TAG;
199 d_ptr->stream1 = f_tag_to_index(tokens[idx++]);
200 if (d_ptr->stream1 < 0)
201 return PARSE_ERROR_UNDEFINED_TERRAIN_TAG;
203 d_ptr->stream2 = f_tag_to_index(tokens[idx]);
204 if (d_ptr->stream2 < 0)
205 return PARSE_ERROR_UNDEFINED_TERRAIN_TAG;
206 } else if (tokens[0] == "F") {
208 if (tokens.size() < 2)
209 return PARSE_ERROR_TOO_FEW_ARGUMENTS;
211 const auto &flags = str_split(tokens[1], '|', true);
212 for (const auto &f : flags) {
216 const auto &f_tokens = str_split(f, '_');
217 if (f_tokens.size() == 3) {
218 if (f_tokens[0] == "FINAL" && f_tokens[1] == "ARTIFACT") {
219 info_set_value(d_ptr->final_artifact, f_tokens[2]);
222 if (f_tokens[0] == "FINAL" && f_tokens[1] == "OBJECT") {
223 info_set_value(d_ptr->final_object, f_tokens[2]);
226 if (f_tokens[0] == "FINAL" && f_tokens[1] == "GUARDIAN") {
227 info_set_value(d_ptr->final_guardian, f_tokens[2]);
230 if (f_tokens[0] == "MONSTER" && f_tokens[1] == "DIV") {
231 info_set_value(d_ptr->special_div, f_tokens[2]);
236 if (!grab_one_dungeon_flag(d_ptr, f))
237 return PARSE_ERROR_INVALID_FLAG;
239 } else if (tokens[0] == "M") {
241 if (tokens.size() < 2)
242 return PARSE_ERROR_TOO_FEW_ARGUMENTS;
244 const auto &flags = str_split(tokens[1], '|', true);
245 for (const auto &f : flags) {
249 const auto &m_tokens = str_split(f, '_');
250 if (m_tokens[0] == "R" && m_tokens[1] == "CHAR") {
251 if (m_tokens[2].size() > 4)
252 return PARSE_ERROR_GENERIC;
254 strcpy(d_ptr->r_char, m_tokens[2].c_str());
258 if (!grab_one_basic_monster_flag(d_ptr, f))
259 return PARSE_ERROR_INVALID_FLAG;
261 } else if (tokens[0] == "S") {
263 if (tokens.size() < 2)
264 return PARSE_ERROR_TOO_FEW_ARGUMENTS;
266 const auto &flags = str_split(tokens[1], '|', true);
267 for (const auto &f : flags) {
271 const auto &s_tokens = str_split(f, '_');
272 if (s_tokens.size() == 3 && s_tokens[1] == "IN") {
273 if (s_tokens[0] != "1")
274 return PARSE_ERROR_GENERIC;
275 continue; //!< r_info.txtからのコピペ対策
278 if (!grab_one_spell_monster_flag(d_ptr, f))
279 return PARSE_ERROR_INVALID_FLAG;
283 return PARSE_ERROR_UNDEFINED_DIRECTIVE;