File: | include/llvm/Support/Error.h |
Warning: | line 201, column 5 Potential leak of memory pointed to by 'Payload._M_t._M_head_impl' |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
1 | //===-- Options.cpp ---------------------------------------------*- C++ -*-===// | |||
2 | // | |||
3 | // The LLVM Compiler Infrastructure | |||
4 | // | |||
5 | // This file is distributed under the University of Illinois Open Source | |||
6 | // License. See LICENSE.TXT for details. | |||
7 | // | |||
8 | //===----------------------------------------------------------------------===// | |||
9 | ||||
10 | #include "lldb/Interpreter/Options.h" | |||
11 | ||||
12 | // C Includes | |||
13 | // C++ Includes | |||
14 | #include <algorithm> | |||
15 | #include <bitset> | |||
16 | #include <map> | |||
17 | #include <set> | |||
18 | ||||
19 | // Other libraries and framework includes | |||
20 | // Project includes | |||
21 | #include "lldb/Host/OptionParser.h" | |||
22 | #include "lldb/Interpreter/CommandCompletions.h" | |||
23 | #include "lldb/Interpreter/CommandInterpreter.h" | |||
24 | #include "lldb/Interpreter/CommandObject.h" | |||
25 | #include "lldb/Interpreter/CommandReturnObject.h" | |||
26 | #include "lldb/Target/Target.h" | |||
27 | #include "lldb/Utility/StreamString.h" | |||
28 | ||||
29 | using namespace lldb; | |||
30 | using namespace lldb_private; | |||
31 | ||||
32 | //------------------------------------------------------------------------- | |||
33 | // Options | |||
34 | //------------------------------------------------------------------------- | |||
35 | Options::Options() : m_getopt_table() { BuildValidOptionSets(); } | |||
36 | ||||
37 | Options::~Options() {} | |||
38 | ||||
39 | void Options::NotifyOptionParsingStarting(ExecutionContext *execution_context) { | |||
40 | m_seen_options.clear(); | |||
41 | // Let the subclass reset its option values | |||
42 | OptionParsingStarting(execution_context); | |||
43 | } | |||
44 | ||||
45 | Status | |||
46 | Options::NotifyOptionParsingFinished(ExecutionContext *execution_context) { | |||
47 | return OptionParsingFinished(execution_context); | |||
48 | } | |||
49 | ||||
50 | void Options::OptionSeen(int option_idx) { m_seen_options.insert(option_idx); } | |||
51 | ||||
52 | // Returns true is set_a is a subset of set_b; Otherwise returns false. | |||
53 | ||||
54 | bool Options::IsASubset(const OptionSet &set_a, const OptionSet &set_b) { | |||
55 | bool is_a_subset = true; | |||
56 | OptionSet::const_iterator pos_a; | |||
57 | OptionSet::const_iterator pos_b; | |||
58 | ||||
59 | // set_a is a subset of set_b if every member of set_a is also a member of | |||
60 | // set_b | |||
61 | ||||
62 | for (pos_a = set_a.begin(); pos_a != set_a.end() && is_a_subset; ++pos_a) { | |||
63 | pos_b = set_b.find(*pos_a); | |||
64 | if (pos_b == set_b.end()) | |||
65 | is_a_subset = false; | |||
66 | } | |||
67 | ||||
68 | return is_a_subset; | |||
69 | } | |||
70 | ||||
71 | // Returns the set difference set_a - set_b, i.e. { x | ElementOf (x, set_a) && | |||
72 | // !ElementOf (x, set_b) } | |||
73 | ||||
74 | size_t Options::OptionsSetDiff(const OptionSet &set_a, const OptionSet &set_b, | |||
75 | OptionSet &diffs) { | |||
76 | size_t num_diffs = 0; | |||
77 | OptionSet::const_iterator pos_a; | |||
78 | OptionSet::const_iterator pos_b; | |||
79 | ||||
80 | for (pos_a = set_a.begin(); pos_a != set_a.end(); ++pos_a) { | |||
81 | pos_b = set_b.find(*pos_a); | |||
82 | if (pos_b == set_b.end()) { | |||
83 | ++num_diffs; | |||
84 | diffs.insert(*pos_a); | |||
85 | } | |||
86 | } | |||
87 | ||||
88 | return num_diffs; | |||
89 | } | |||
90 | ||||
91 | // Returns the union of set_a and set_b. Does not put duplicate members into | |||
92 | // the union. | |||
93 | ||||
94 | void Options::OptionsSetUnion(const OptionSet &set_a, const OptionSet &set_b, | |||
95 | OptionSet &union_set) { | |||
96 | OptionSet::const_iterator pos; | |||
97 | OptionSet::iterator pos_union; | |||
98 | ||||
99 | // Put all the elements of set_a into the union. | |||
100 | ||||
101 | for (pos = set_a.begin(); pos != set_a.end(); ++pos) | |||
102 | union_set.insert(*pos); | |||
103 | ||||
104 | // Put all the elements of set_b that are not already there into the union. | |||
105 | for (pos = set_b.begin(); pos != set_b.end(); ++pos) { | |||
106 | pos_union = union_set.find(*pos); | |||
107 | if (pos_union == union_set.end()) | |||
108 | union_set.insert(*pos); | |||
109 | } | |||
110 | } | |||
111 | ||||
112 | bool Options::VerifyOptions(CommandReturnObject &result) { | |||
113 | bool options_are_valid = false; | |||
114 | ||||
115 | int num_levels = GetRequiredOptions().size(); | |||
116 | if (num_levels) { | |||
117 | for (int i = 0; i < num_levels && !options_are_valid; ++i) { | |||
118 | // This is the correct set of options if: 1). m_seen_options contains | |||
119 | // all of m_required_options[i] (i.e. all the required options at this | |||
120 | // level are a subset of m_seen_options); AND 2). { m_seen_options - | |||
121 | // m_required_options[i] is a subset of m_options_options[i] (i.e. all | |||
122 | // the rest of m_seen_options are in the set of optional options at this | |||
123 | // level. | |||
124 | ||||
125 | // Check to see if all of m_required_options[i] are a subset of | |||
126 | // m_seen_options | |||
127 | if (IsASubset(GetRequiredOptions()[i], m_seen_options)) { | |||
128 | // Construct the set difference: remaining_options = {m_seen_options} - | |||
129 | // {m_required_options[i]} | |||
130 | OptionSet remaining_options; | |||
131 | OptionsSetDiff(m_seen_options, GetRequiredOptions()[i], | |||
132 | remaining_options); | |||
133 | // Check to see if remaining_options is a subset of | |||
134 | // m_optional_options[i] | |||
135 | if (IsASubset(remaining_options, GetOptionalOptions()[i])) | |||
136 | options_are_valid = true; | |||
137 | } | |||
138 | } | |||
139 | } else { | |||
140 | options_are_valid = true; | |||
141 | } | |||
142 | ||||
143 | if (options_are_valid) { | |||
144 | result.SetStatus(eReturnStatusSuccessFinishNoResult); | |||
145 | } else { | |||
146 | result.AppendError("invalid combination of options for the given command"); | |||
147 | result.SetStatus(eReturnStatusFailed); | |||
148 | } | |||
149 | ||||
150 | return options_are_valid; | |||
151 | } | |||
152 | ||||
153 | // This is called in the Options constructor, though we could call it lazily if | |||
154 | // that ends up being a performance problem. | |||
155 | ||||
156 | void Options::BuildValidOptionSets() { | |||
157 | // Check to see if we already did this. | |||
158 | if (m_required_options.size() != 0) | |||
159 | return; | |||
160 | ||||
161 | // Check to see if there are any options. | |||
162 | int num_options = NumCommandOptions(); | |||
163 | if (num_options == 0) | |||
164 | return; | |||
165 | ||||
166 | auto opt_defs = GetDefinitions(); | |||
167 | m_required_options.resize(1); | |||
168 | m_optional_options.resize(1); | |||
169 | ||||
170 | // First count the number of option sets we've got. Ignore | |||
171 | // LLDB_ALL_OPTION_SETS... | |||
172 | ||||
173 | uint32_t num_option_sets = 0; | |||
174 | ||||
175 | for (const auto &def : opt_defs) { | |||
176 | uint32_t this_usage_mask = def.usage_mask; | |||
177 | if (this_usage_mask == LLDB_OPT_SET_ALL0xFFFFFFFFU) { | |||
178 | if (num_option_sets == 0) | |||
179 | num_option_sets = 1; | |||
180 | } else { | |||
181 | for (uint32_t j = 0; j < LLDB_MAX_NUM_OPTION_SETS32; j++) { | |||
182 | if (this_usage_mask & (1 << j)) { | |||
183 | if (num_option_sets <= j) | |||
184 | num_option_sets = j + 1; | |||
185 | } | |||
186 | } | |||
187 | } | |||
188 | } | |||
189 | ||||
190 | if (num_option_sets > 0) { | |||
191 | m_required_options.resize(num_option_sets); | |||
192 | m_optional_options.resize(num_option_sets); | |||
193 | ||||
194 | for (const auto &def : opt_defs) { | |||
195 | for (uint32_t j = 0; j < num_option_sets; j++) { | |||
196 | if (def.usage_mask & 1 << j) { | |||
197 | if (def.required) | |||
198 | m_required_options[j].insert(def.short_option); | |||
199 | else | |||
200 | m_optional_options[j].insert(def.short_option); | |||
201 | } | |||
202 | } | |||
203 | } | |||
204 | } | |||
205 | } | |||
206 | ||||
207 | uint32_t Options::NumCommandOptions() { return GetDefinitions().size(); } | |||
208 | ||||
209 | Option *Options::GetLongOptions() { | |||
210 | // Check to see if this has already been done. | |||
211 | if (m_getopt_table.empty()) { | |||
212 | auto defs = GetDefinitions(); | |||
213 | if (defs.empty()) | |||
214 | return nullptr; | |||
215 | ||||
216 | std::map<int, uint32_t> option_seen; | |||
217 | ||||
218 | m_getopt_table.resize(defs.size() + 1); | |||
219 | for (size_t i = 0; i < defs.size(); ++i) { | |||
220 | const int short_opt = defs[i].short_option; | |||
221 | ||||
222 | m_getopt_table[i].definition = &defs[i]; | |||
223 | m_getopt_table[i].flag = nullptr; | |||
224 | m_getopt_table[i].val = short_opt; | |||
225 | ||||
226 | if (option_seen.find(short_opt) == option_seen.end()) { | |||
227 | option_seen[short_opt] = i; | |||
228 | } else if (short_opt) { | |||
229 | m_getopt_table[i].val = 0; | |||
230 | std::map<int, uint32_t>::const_iterator pos = | |||
231 | option_seen.find(short_opt); | |||
232 | StreamString strm; | |||
233 | if (isprint8(short_opt)) | |||
234 | Host::SystemLog(Host::eSystemLogError, | |||
235 | "option[%u] --%s has a short option -%c that " | |||
236 | "conflicts with option[%u] --%s, short option won't " | |||
237 | "be used for --%s\n", | |||
238 | (int)i, defs[i].long_option, short_opt, pos->second, | |||
239 | m_getopt_table[pos->second].definition->long_option, | |||
240 | defs[i].long_option); | |||
241 | else | |||
242 | Host::SystemLog(Host::eSystemLogError, | |||
243 | "option[%u] --%s has a short option 0x%x that " | |||
244 | "conflicts with option[%u] --%s, short option won't " | |||
245 | "be used for --%s\n", | |||
246 | (int)i, defs[i].long_option, short_opt, pos->second, | |||
247 | m_getopt_table[pos->second].definition->long_option, | |||
248 | defs[i].long_option); | |||
249 | } | |||
250 | } | |||
251 | ||||
252 | // getopt_long_only requires a NULL final entry in the table: | |||
253 | ||||
254 | m_getopt_table.back().definition = nullptr; | |||
255 | m_getopt_table.back().flag = nullptr; | |||
256 | m_getopt_table.back().val = 0; | |||
257 | } | |||
258 | ||||
259 | if (m_getopt_table.empty()) | |||
260 | return nullptr; | |||
261 | ||||
262 | return &m_getopt_table.front(); | |||
263 | } | |||
264 | ||||
265 | // This function takes INDENT, which tells how many spaces to output at the | |||
266 | // front of each line; SPACES, which is a string containing 80 spaces; and | |||
267 | // TEXT, which is the text that is to be output. It outputs the text, on | |||
268 | // multiple lines if necessary, to RESULT, with INDENT spaces at the front of | |||
269 | // each line. It breaks lines on spaces, tabs or newlines, shortening the line | |||
270 | // if necessary to not break in the middle of a word. It assumes that each | |||
271 | // output line should contain a maximum of OUTPUT_MAX_COLUMNS characters. | |||
272 | ||||
273 | void Options::OutputFormattedUsageText(Stream &strm, | |||
274 | const OptionDefinition &option_def, | |||
275 | uint32_t output_max_columns) { | |||
276 | std::string actual_text; | |||
277 | if (option_def.validator) { | |||
278 | const char *condition = option_def.validator->ShortConditionString(); | |||
279 | if (condition) { | |||
280 | actual_text = "["; | |||
281 | actual_text.append(condition); | |||
282 | actual_text.append("] "); | |||
283 | } | |||
284 | } | |||
285 | actual_text.append(option_def.usage_text); | |||
286 | ||||
287 | // Will it all fit on one line? | |||
288 | ||||
289 | if (static_cast<uint32_t>(actual_text.length() + strm.GetIndentLevel()) < | |||
290 | output_max_columns) { | |||
291 | // Output it as a single line. | |||
292 | strm.Indent(actual_text.c_str()); | |||
293 | strm.EOL(); | |||
294 | } else { | |||
295 | // We need to break it up into multiple lines. | |||
296 | ||||
297 | int text_width = output_max_columns - strm.GetIndentLevel() - 1; | |||
298 | int start = 0; | |||
299 | int end = start; | |||
300 | int final_end = actual_text.length(); | |||
301 | int sub_len; | |||
302 | ||||
303 | while (end < final_end) { | |||
304 | // Don't start the 'text' on a space, since we're already outputting the | |||
305 | // indentation. | |||
306 | while ((start < final_end) && (actual_text[start] == ' ')) | |||
307 | start++; | |||
308 | ||||
309 | end = start + text_width; | |||
310 | if (end > final_end) | |||
311 | end = final_end; | |||
312 | else { | |||
313 | // If we're not at the end of the text, make sure we break the line on | |||
314 | // white space. | |||
315 | while (end > start && actual_text[end] != ' ' && | |||
316 | actual_text[end] != '\t' && actual_text[end] != '\n') | |||
317 | end--; | |||
318 | } | |||
319 | ||||
320 | sub_len = end - start; | |||
321 | if (start != 0) | |||
322 | strm.EOL(); | |||
323 | strm.Indent(); | |||
324 | assert(start < final_end)((start < final_end) ? static_cast<void> (0) : __assert_fail ("start < final_end", "/build/llvm-toolchain-snapshot-8~svn345461/tools/lldb/source/Interpreter/Options.cpp" , 324, __PRETTY_FUNCTION__)); | |||
325 | assert(start + sub_len <= final_end)((start + sub_len <= final_end) ? static_cast<void> ( 0) : __assert_fail ("start + sub_len <= final_end", "/build/llvm-toolchain-snapshot-8~svn345461/tools/lldb/source/Interpreter/Options.cpp" , 325, __PRETTY_FUNCTION__)); | |||
326 | strm.Write(actual_text.c_str() + start, sub_len); | |||
327 | start = end + 1; | |||
328 | } | |||
329 | strm.EOL(); | |||
330 | } | |||
331 | } | |||
332 | ||||
333 | bool Options::SupportsLongOption(const char *long_option) { | |||
334 | if (!long_option || !long_option[0]) | |||
335 | return false; | |||
336 | ||||
337 | auto opt_defs = GetDefinitions(); | |||
338 | if (opt_defs.empty()) | |||
339 | return false; | |||
340 | ||||
341 | const char *long_option_name = long_option; | |||
342 | if (long_option[0] == '-' && long_option[1] == '-') | |||
343 | long_option_name += 2; | |||
344 | ||||
345 | for (auto &def : opt_defs) { | |||
346 | if (!def.long_option) | |||
347 | continue; | |||
348 | ||||
349 | if (strcmp(def.long_option, long_option_name) == 0) | |||
350 | return true; | |||
351 | } | |||
352 | ||||
353 | return false; | |||
354 | } | |||
355 | ||||
356 | enum OptionDisplayType { | |||
357 | eDisplayBestOption, | |||
358 | eDisplayShortOption, | |||
359 | eDisplayLongOption | |||
360 | }; | |||
361 | ||||
362 | static bool PrintOption(const OptionDefinition &opt_def, | |||
363 | OptionDisplayType display_type, const char *header, | |||
364 | const char *footer, bool show_optional, Stream &strm) { | |||
365 | const bool has_short_option = isprint8(opt_def.short_option) != 0; | |||
366 | ||||
367 | if (display_type == eDisplayShortOption && !has_short_option) | |||
368 | return false; | |||
369 | ||||
370 | if (header && header[0]) | |||
371 | strm.PutCString(header); | |||
372 | ||||
373 | if (show_optional && !opt_def.required) | |||
374 | strm.PutChar('['); | |||
375 | const bool show_short_option = | |||
376 | has_short_option && display_type != eDisplayLongOption; | |||
377 | if (show_short_option) | |||
378 | strm.Printf("-%c", opt_def.short_option); | |||
379 | else | |||
380 | strm.Printf("--%s", opt_def.long_option); | |||
381 | switch (opt_def.option_has_arg) { | |||
382 | case OptionParser::eNoArgument: | |||
383 | break; | |||
384 | case OptionParser::eRequiredArgument: | |||
385 | strm.Printf(" <%s>", CommandObject::GetArgumentName(opt_def.argument_type)); | |||
386 | break; | |||
387 | ||||
388 | case OptionParser::eOptionalArgument: | |||
389 | strm.Printf("%s[<%s>]", show_short_option ? "" : "=", | |||
390 | CommandObject::GetArgumentName(opt_def.argument_type)); | |||
391 | break; | |||
392 | } | |||
393 | if (show_optional && !opt_def.required) | |||
394 | strm.PutChar(']'); | |||
395 | if (footer && footer[0]) | |||
396 | strm.PutCString(footer); | |||
397 | return true; | |||
398 | } | |||
399 | ||||
400 | void Options::GenerateOptionUsage(Stream &strm, CommandObject *cmd, | |||
401 | uint32_t screen_width) { | |||
402 | const bool only_print_args = cmd->IsDashDashCommand(); | |||
403 | ||||
404 | auto opt_defs = GetDefinitions(); | |||
405 | const uint32_t save_indent_level = strm.GetIndentLevel(); | |||
406 | llvm::StringRef name; | |||
407 | ||||
408 | StreamString arguments_str; | |||
409 | ||||
410 | if (cmd) { | |||
411 | name = cmd->GetCommandName(); | |||
412 | cmd->GetFormattedCommandArguments(arguments_str); | |||
413 | } else | |||
414 | name = ""; | |||
415 | ||||
416 | strm.PutCString("\nCommand Options Usage:\n"); | |||
417 | ||||
418 | strm.IndentMore(2); | |||
419 | ||||
420 | // First, show each usage level set of options, e.g. <cmd> [options-for- | |||
421 | // level-0] | |||
422 | // <cmd> | |||
423 | // [options-for-level-1] | |||
424 | // etc. | |||
425 | ||||
426 | const uint32_t num_options = NumCommandOptions(); | |||
427 | if (num_options == 0) | |||
428 | return; | |||
429 | ||||
430 | uint32_t num_option_sets = GetRequiredOptions().size(); | |||
431 | ||||
432 | uint32_t i; | |||
433 | ||||
434 | if (!only_print_args) { | |||
435 | for (uint32_t opt_set = 0; opt_set < num_option_sets; ++opt_set) { | |||
436 | uint32_t opt_set_mask; | |||
437 | ||||
438 | opt_set_mask = 1 << opt_set; | |||
439 | if (opt_set > 0) | |||
440 | strm.Printf("\n"); | |||
441 | strm.Indent(name); | |||
442 | ||||
443 | // Different option sets may require different args. | |||
444 | StreamString args_str; | |||
445 | if (cmd) | |||
446 | cmd->GetFormattedCommandArguments(args_str, opt_set_mask); | |||
447 | ||||
448 | // First go through and print all options that take no arguments as a | |||
449 | // single string. If a command has "-a" "-b" and "-c", this will show up | |||
450 | // as [-abc] | |||
451 | ||||
452 | std::set<int> options; | |||
453 | std::set<int>::const_iterator options_pos, options_end; | |||
454 | for (auto &def : opt_defs) { | |||
455 | if (def.usage_mask & opt_set_mask && isprint8(def.short_option)) { | |||
456 | // Add current option to the end of out_stream. | |||
457 | ||||
458 | if (def.required && def.option_has_arg == OptionParser::eNoArgument) { | |||
459 | options.insert(def.short_option); | |||
460 | } | |||
461 | } | |||
462 | } | |||
463 | ||||
464 | if (options.empty() == false) { | |||
465 | // We have some required options with no arguments | |||
466 | strm.PutCString(" -"); | |||
467 | for (i = 0; i < 2; ++i) | |||
468 | for (options_pos = options.begin(), options_end = options.end(); | |||
469 | options_pos != options_end; ++options_pos) { | |||
470 | if (i == 0 && ::islower(*options_pos)) | |||
471 | continue; | |||
472 | if (i == 1 && ::isupper(*options_pos)) | |||
473 | continue; | |||
474 | strm << (char)*options_pos; | |||
475 | } | |||
476 | } | |||
477 | ||||
478 | options.clear(); | |||
479 | for (auto &def : opt_defs) { | |||
480 | if (def.usage_mask & opt_set_mask && isprint8(def.short_option)) { | |||
481 | // Add current option to the end of out_stream. | |||
482 | ||||
483 | if (def.required == false && | |||
484 | def.option_has_arg == OptionParser::eNoArgument) { | |||
485 | options.insert(def.short_option); | |||
486 | } | |||
487 | } | |||
488 | } | |||
489 | ||||
490 | if (options.empty() == false) { | |||
491 | // We have some required options with no arguments | |||
492 | strm.PutCString(" [-"); | |||
493 | for (i = 0; i < 2; ++i) | |||
494 | for (options_pos = options.begin(), options_end = options.end(); | |||
495 | options_pos != options_end; ++options_pos) { | |||
496 | if (i == 0 && ::islower(*options_pos)) | |||
497 | continue; | |||
498 | if (i == 1 && ::isupper(*options_pos)) | |||
499 | continue; | |||
500 | strm << (char)*options_pos; | |||
501 | } | |||
502 | strm.PutChar(']'); | |||
503 | } | |||
504 | ||||
505 | // First go through and print the required options (list them up front). | |||
506 | ||||
507 | for (auto &def : opt_defs) { | |||
508 | if (def.usage_mask & opt_set_mask && isprint8(def.short_option)) { | |||
509 | if (def.required && def.option_has_arg != OptionParser::eNoArgument) | |||
510 | PrintOption(def, eDisplayBestOption, " ", nullptr, true, strm); | |||
511 | } | |||
512 | } | |||
513 | ||||
514 | // Now go through again, and this time only print the optional options. | |||
515 | ||||
516 | for (auto &def : opt_defs) { | |||
517 | if (def.usage_mask & opt_set_mask) { | |||
518 | // Add current option to the end of out_stream. | |||
519 | ||||
520 | if (!def.required && def.option_has_arg != OptionParser::eNoArgument) | |||
521 | PrintOption(def, eDisplayBestOption, " ", nullptr, true, strm); | |||
522 | } | |||
523 | } | |||
524 | ||||
525 | if (args_str.GetSize() > 0) { | |||
526 | if (cmd->WantsRawCommandString() && !only_print_args) | |||
527 | strm.Printf(" --"); | |||
528 | ||||
529 | strm << " " << args_str.GetString(); | |||
530 | if (only_print_args) | |||
531 | break; | |||
532 | } | |||
533 | } | |||
534 | } | |||
535 | ||||
536 | if (cmd && (only_print_args || cmd->WantsRawCommandString()) && | |||
537 | arguments_str.GetSize() > 0) { | |||
538 | if (!only_print_args) | |||
539 | strm.PutChar('\n'); | |||
540 | strm.Indent(name); | |||
541 | strm << " " << arguments_str.GetString(); | |||
542 | } | |||
543 | ||||
544 | strm.Printf("\n\n"); | |||
545 | ||||
546 | if (!only_print_args) { | |||
547 | // Now print out all the detailed information about the various options: | |||
548 | // long form, short form and help text: | |||
549 | // -short <argument> ( --long_name <argument> ) | |||
550 | // help text | |||
551 | ||||
552 | // This variable is used to keep track of which options' info we've printed | |||
553 | // out, because some options can be in more than one usage level, but we | |||
554 | // only want to print the long form of its information once. | |||
555 | ||||
556 | std::multimap<int, uint32_t> options_seen; | |||
557 | strm.IndentMore(5); | |||
558 | ||||
559 | // Put the unique command options in a vector & sort it, so we can output | |||
560 | // them alphabetically (by short_option) when writing out detailed help for | |||
561 | // each option. | |||
562 | ||||
563 | i = 0; | |||
564 | for (auto &def : opt_defs) | |||
565 | options_seen.insert(std::make_pair(def.short_option, i++)); | |||
566 | ||||
567 | // Go through the unique'd and alphabetically sorted vector of options, | |||
568 | // find the table entry for each option and write out the detailed help | |||
569 | // information for that option. | |||
570 | ||||
571 | bool first_option_printed = false; | |||
572 | ||||
573 | for (auto pos : options_seen) { | |||
574 | i = pos.second; | |||
575 | // Print out the help information for this option. | |||
576 | ||||
577 | // Put a newline separation between arguments | |||
578 | if (first_option_printed) | |||
579 | strm.EOL(); | |||
580 | else | |||
581 | first_option_printed = true; | |||
582 | ||||
583 | CommandArgumentType arg_type = opt_defs[i].argument_type; | |||
584 | ||||
585 | StreamString arg_name_str; | |||
586 | arg_name_str.Printf("<%s>", CommandObject::GetArgumentName(arg_type)); | |||
587 | ||||
588 | strm.Indent(); | |||
589 | if (opt_defs[i].short_option && isprint8(opt_defs[i].short_option)) { | |||
590 | PrintOption(opt_defs[i], eDisplayShortOption, nullptr, nullptr, false, | |||
591 | strm); | |||
592 | PrintOption(opt_defs[i], eDisplayLongOption, " ( ", " )", false, strm); | |||
593 | } else { | |||
594 | // Short option is not printable, just print long option | |||
595 | PrintOption(opt_defs[i], eDisplayLongOption, nullptr, nullptr, false, | |||
596 | strm); | |||
597 | } | |||
598 | strm.EOL(); | |||
599 | ||||
600 | strm.IndentMore(5); | |||
601 | ||||
602 | if (opt_defs[i].usage_text) | |||
603 | OutputFormattedUsageText(strm, opt_defs[i], screen_width); | |||
604 | if (!opt_defs[i].enum_values.empty()) { | |||
605 | strm.Indent(); | |||
606 | strm.Printf("Values: "); | |||
607 | bool is_first = true; | |||
608 | for (const auto &enum_value : opt_defs[i].enum_values) { | |||
609 | if (is_first) { | |||
610 | strm.Printf("%s", enum_value.string_value); | |||
611 | is_first = false; | |||
612 | } | |||
613 | else | |||
614 | strm.Printf(" | %s", enum_value.string_value); | |||
615 | } | |||
616 | strm.EOL(); | |||
617 | } | |||
618 | strm.IndentLess(5); | |||
619 | } | |||
620 | } | |||
621 | ||||
622 | // Restore the indent level | |||
623 | strm.SetIndentLevel(save_indent_level); | |||
624 | } | |||
625 | ||||
626 | // This function is called when we have been given a potentially incomplete set | |||
627 | // of options, such as when an alias has been defined (more options might be | |||
628 | // added at at the time the alias is invoked). We need to verify that the | |||
629 | // options in the set m_seen_options are all part of a set that may be used | |||
630 | // together, but m_seen_options may be missing some of the "required" options. | |||
631 | ||||
632 | bool Options::VerifyPartialOptions(CommandReturnObject &result) { | |||
633 | bool options_are_valid = false; | |||
634 | ||||
635 | int num_levels = GetRequiredOptions().size(); | |||
636 | if (num_levels) { | |||
637 | for (int i = 0; i < num_levels && !options_are_valid; ++i) { | |||
638 | // In this case we are treating all options as optional rather than | |||
639 | // required. Therefore a set of options is correct if m_seen_options is a | |||
640 | // subset of the union of m_required_options and m_optional_options. | |||
641 | OptionSet union_set; | |||
642 | OptionsSetUnion(GetRequiredOptions()[i], GetOptionalOptions()[i], | |||
643 | union_set); | |||
644 | if (IsASubset(m_seen_options, union_set)) | |||
645 | options_are_valid = true; | |||
646 | } | |||
647 | } | |||
648 | ||||
649 | return options_are_valid; | |||
650 | } | |||
651 | ||||
652 | bool Options::HandleOptionCompletion(CompletionRequest &request, | |||
653 | OptionElementVector &opt_element_vector, | |||
654 | CommandInterpreter &interpreter) { | |||
655 | request.SetWordComplete(true); | |||
656 | ||||
657 | // For now we just scan the completions to see if the cursor position is in | |||
658 | // an option or its argument. Otherwise we'll call HandleArgumentCompletion. | |||
659 | // In the future we can use completion to validate options as well if we | |||
660 | // want. | |||
661 | ||||
662 | auto opt_defs = GetDefinitions(); | |||
663 | ||||
664 | std::string cur_opt_std_str = request.GetCursorArgumentPrefix().str(); | |||
665 | const char *cur_opt_str = cur_opt_std_str.c_str(); | |||
666 | ||||
667 | for (size_t i = 0; i < opt_element_vector.size(); i++) { | |||
668 | int opt_pos = opt_element_vector[i].opt_pos; | |||
669 | int opt_arg_pos = opt_element_vector[i].opt_arg_pos; | |||
670 | int opt_defs_index = opt_element_vector[i].opt_defs_index; | |||
671 | if (opt_pos == request.GetCursorIndex()) { | |||
672 | // We're completing the option itself. | |||
673 | ||||
674 | if (opt_defs_index == OptionArgElement::eBareDash) { | |||
675 | // We're completing a bare dash. That means all options are open. | |||
676 | // FIXME: We should scan the other options provided and only complete | |||
677 | // options | |||
678 | // within the option group they belong to. | |||
679 | char opt_str[3] = {'-', 'a', '\0'}; | |||
680 | ||||
681 | for (auto &def : opt_defs) { | |||
682 | if (!def.short_option) | |||
683 | continue; | |||
684 | opt_str[1] = def.short_option; | |||
685 | request.AddCompletion(opt_str); | |||
686 | } | |||
687 | ||||
688 | return true; | |||
689 | } else if (opt_defs_index == OptionArgElement::eBareDoubleDash) { | |||
690 | std::string full_name("--"); | |||
691 | for (auto &def : opt_defs) { | |||
692 | if (!def.short_option) | |||
693 | continue; | |||
694 | ||||
695 | full_name.erase(full_name.begin() + 2, full_name.end()); | |||
696 | full_name.append(def.long_option); | |||
697 | request.AddCompletion(full_name.c_str()); | |||
698 | } | |||
699 | return true; | |||
700 | } else if (opt_defs_index != OptionArgElement::eUnrecognizedArg) { | |||
701 | // We recognized it, if it an incomplete long option, complete it | |||
702 | // anyway (getopt_long_only is happy with shortest unique string, but | |||
703 | // it's still a nice thing to do.) Otherwise return The string so the | |||
704 | // upper level code will know this is a full match and add the " ". | |||
705 | if (cur_opt_str && strlen(cur_opt_str) > 2 && cur_opt_str[0] == '-' && | |||
706 | cur_opt_str[1] == '-' && | |||
707 | strcmp(opt_defs[opt_defs_index].long_option, cur_opt_str) != 0) { | |||
708 | std::string full_name("--"); | |||
709 | full_name.append(opt_defs[opt_defs_index].long_option); | |||
710 | request.AddCompletion(full_name.c_str()); | |||
711 | return true; | |||
712 | } else { | |||
713 | request.AddCompletion(request.GetCursorArgument()); | |||
714 | return true; | |||
715 | } | |||
716 | } else { | |||
717 | // FIXME - not handling wrong options yet: | |||
718 | // Check to see if they are writing a long option & complete it. | |||
719 | // I think we will only get in here if the long option table has two | |||
720 | // elements | |||
721 | // that are not unique up to this point. getopt_long_only does | |||
722 | // shortest unique match for long options already. | |||
723 | ||||
724 | if (cur_opt_str && strlen(cur_opt_str) > 2 && cur_opt_str[0] == '-' && | |||
725 | cur_opt_str[1] == '-') { | |||
726 | for (auto &def : opt_defs) { | |||
727 | if (!def.long_option) | |||
728 | continue; | |||
729 | ||||
730 | if (strstr(def.long_option, cur_opt_str + 2) == def.long_option) { | |||
731 | std::string full_name("--"); | |||
732 | full_name.append(def.long_option); | |||
733 | request.AddCompletion(full_name.c_str()); | |||
734 | } | |||
735 | } | |||
736 | } | |||
737 | return true; | |||
738 | } | |||
739 | ||||
740 | } else if (opt_arg_pos == request.GetCursorIndex()) { | |||
741 | // Okay the cursor is on the completion of an argument. See if it has a | |||
742 | // completion, otherwise return no matches. | |||
743 | ||||
744 | CompletionRequest subrequest = request; | |||
745 | subrequest.SetCursorCharPosition(subrequest.GetCursorArgument().size()); | |||
746 | if (opt_defs_index != -1) { | |||
747 | HandleOptionArgumentCompletion(subrequest, opt_element_vector, i, | |||
748 | interpreter); | |||
749 | request.SetWordComplete(subrequest.GetWordComplete()); | |||
750 | return true; | |||
751 | } else { | |||
752 | // No completion callback means no completions... | |||
753 | return true; | |||
754 | } | |||
755 | ||||
756 | } else { | |||
757 | // Not the last element, keep going. | |||
758 | continue; | |||
759 | } | |||
760 | } | |||
761 | return false; | |||
762 | } | |||
763 | ||||
764 | bool Options::HandleOptionArgumentCompletion( | |||
765 | CompletionRequest &request, OptionElementVector &opt_element_vector, | |||
766 | int opt_element_index, CommandInterpreter &interpreter) { | |||
767 | auto opt_defs = GetDefinitions(); | |||
768 | std::unique_ptr<SearchFilter> filter_ap; | |||
769 | ||||
770 | int opt_arg_pos = opt_element_vector[opt_element_index].opt_arg_pos; | |||
771 | int opt_defs_index = opt_element_vector[opt_element_index].opt_defs_index; | |||
772 | ||||
773 | // See if this is an enumeration type option, and if so complete it here: | |||
774 | ||||
775 | const auto &enum_values = opt_defs[opt_defs_index].enum_values; | |||
776 | if (!enum_values.empty()) { | |||
777 | bool return_value = false; | |||
778 | std::string match_string( | |||
779 | request.GetParsedLine().GetArgumentAtIndex(opt_arg_pos), | |||
780 | request.GetParsedLine().GetArgumentAtIndex(opt_arg_pos) + | |||
781 | request.GetCursorCharPosition()); | |||
782 | ||||
783 | for (const auto &enum_value : enum_values) { | |||
784 | if (strstr(enum_value.string_value, match_string.c_str()) == | |||
785 | enum_value.string_value) { | |||
786 | request.AddCompletion(enum_value.string_value); | |||
787 | return_value = true; | |||
788 | } | |||
789 | } | |||
790 | return return_value; | |||
791 | } | |||
792 | ||||
793 | // If this is a source file or symbol type completion, and there is a -shlib | |||
794 | // option somewhere in the supplied arguments, then make a search filter for | |||
795 | // that shared library. | |||
796 | // FIXME: Do we want to also have an "OptionType" so we don't have to match | |||
797 | // string names? | |||
798 | ||||
799 | uint32_t completion_mask = opt_defs[opt_defs_index].completion_type; | |||
800 | ||||
801 | if (completion_mask == 0) { | |||
802 | lldb::CommandArgumentType option_arg_type = | |||
803 | opt_defs[opt_defs_index].argument_type; | |||
804 | if (option_arg_type != eArgTypeNone) { | |||
805 | const CommandObject::ArgumentTableEntry *arg_entry = | |||
806 | CommandObject::FindArgumentDataByType( | |||
807 | opt_defs[opt_defs_index].argument_type); | |||
808 | if (arg_entry) | |||
809 | completion_mask = arg_entry->completion_type; | |||
810 | } | |||
811 | } | |||
812 | ||||
813 | if (completion_mask & CommandCompletions::eSourceFileCompletion || | |||
814 | completion_mask & CommandCompletions::eSymbolCompletion) { | |||
815 | for (size_t i = 0; i < opt_element_vector.size(); i++) { | |||
816 | int cur_defs_index = opt_element_vector[i].opt_defs_index; | |||
817 | ||||
818 | // trying to use <0 indices will definitely cause problems | |||
819 | if (cur_defs_index == OptionArgElement::eUnrecognizedArg || | |||
820 | cur_defs_index == OptionArgElement::eBareDash || | |||
821 | cur_defs_index == OptionArgElement::eBareDoubleDash) | |||
822 | continue; | |||
823 | ||||
824 | int cur_arg_pos = opt_element_vector[i].opt_arg_pos; | |||
825 | const char *cur_opt_name = opt_defs[cur_defs_index].long_option; | |||
826 | ||||
827 | // If this is the "shlib" option and there was an argument provided, | |||
828 | // restrict it to that shared library. | |||
829 | if (cur_opt_name && strcmp(cur_opt_name, "shlib") == 0 && | |||
830 | cur_arg_pos != -1) { | |||
831 | const char *module_name = | |||
832 | request.GetParsedLine().GetArgumentAtIndex(cur_arg_pos); | |||
833 | if (module_name) { | |||
834 | FileSpec module_spec(module_name, false); | |||
835 | lldb::TargetSP target_sp = | |||
836 | interpreter.GetDebugger().GetSelectedTarget(); | |||
837 | // Search filters require a target... | |||
838 | if (target_sp) | |||
839 | filter_ap.reset(new SearchFilterByModule(target_sp, module_spec)); | |||
840 | } | |||
841 | break; | |||
842 | } | |||
843 | } | |||
844 | } | |||
845 | ||||
846 | return CommandCompletions::InvokeCommonCompletionCallbacks( | |||
847 | interpreter, completion_mask, request, filter_ap.get()); | |||
848 | } | |||
849 | ||||
850 | void OptionGroupOptions::Append(OptionGroup *group) { | |||
851 | auto group_option_defs = group->GetDefinitions(); | |||
852 | for (uint32_t i = 0; i < group_option_defs.size(); ++i) { | |||
853 | m_option_infos.push_back(OptionInfo(group, i)); | |||
854 | m_option_defs.push_back(group_option_defs[i]); | |||
855 | } | |||
856 | } | |||
857 | ||||
858 | const OptionGroup *OptionGroupOptions::GetGroupWithOption(char short_opt) { | |||
859 | for (uint32_t i = 0; i < m_option_defs.size(); i++) { | |||
860 | OptionDefinition opt_def = m_option_defs[i]; | |||
861 | if (opt_def.short_option == short_opt) | |||
862 | return m_option_infos[i].option_group; | |||
863 | } | |||
864 | return nullptr; | |||
865 | } | |||
866 | ||||
867 | void OptionGroupOptions::Append(OptionGroup *group, uint32_t src_mask, | |||
868 | uint32_t dst_mask) { | |||
869 | auto group_option_defs = group->GetDefinitions(); | |||
870 | for (uint32_t i = 0; i < group_option_defs.size(); ++i) { | |||
871 | if (group_option_defs[i].usage_mask & src_mask) { | |||
872 | m_option_infos.push_back(OptionInfo(group, i)); | |||
873 | m_option_defs.push_back(group_option_defs[i]); | |||
874 | m_option_defs.back().usage_mask = dst_mask; | |||
875 | } | |||
876 | } | |||
877 | } | |||
878 | ||||
879 | void OptionGroupOptions::Finalize() { | |||
880 | m_did_finalize = true; | |||
881 | } | |||
882 | ||||
883 | Status OptionGroupOptions::SetOptionValue(uint32_t option_idx, | |||
884 | llvm::StringRef option_value, | |||
885 | ExecutionContext *execution_context) { | |||
886 | // After calling OptionGroupOptions::Append(...), you must finalize the | |||
887 | // groups by calling OptionGroupOptions::Finlize() | |||
888 | assert(m_did_finalize)((m_did_finalize) ? static_cast<void> (0) : __assert_fail ("m_did_finalize", "/build/llvm-toolchain-snapshot-8~svn345461/tools/lldb/source/Interpreter/Options.cpp" , 888, __PRETTY_FUNCTION__)); | |||
889 | Status error; | |||
890 | if (option_idx < m_option_infos.size()) { | |||
891 | error = m_option_infos[option_idx].option_group->SetOptionValue( | |||
892 | m_option_infos[option_idx].option_index, option_value, | |||
893 | execution_context); | |||
894 | ||||
895 | } else { | |||
896 | error.SetErrorString("invalid option index"); // Shouldn't happen... | |||
897 | } | |||
898 | return error; | |||
899 | } | |||
900 | ||||
901 | void OptionGroupOptions::OptionParsingStarting( | |||
902 | ExecutionContext *execution_context) { | |||
903 | std::set<OptionGroup *> group_set; | |||
904 | OptionInfos::iterator pos, end = m_option_infos.end(); | |||
905 | for (pos = m_option_infos.begin(); pos != end; ++pos) { | |||
906 | OptionGroup *group = pos->option_group; | |||
907 | if (group_set.find(group) == group_set.end()) { | |||
908 | group->OptionParsingStarting(execution_context); | |||
909 | group_set.insert(group); | |||
910 | } | |||
911 | } | |||
912 | } | |||
913 | Status | |||
914 | OptionGroupOptions::OptionParsingFinished(ExecutionContext *execution_context) { | |||
915 | std::set<OptionGroup *> group_set; | |||
916 | Status error; | |||
917 | OptionInfos::iterator pos, end = m_option_infos.end(); | |||
918 | for (pos = m_option_infos.begin(); pos != end; ++pos) { | |||
919 | OptionGroup *group = pos->option_group; | |||
920 | if (group_set.find(group) == group_set.end()) { | |||
921 | error = group->OptionParsingFinished(execution_context); | |||
922 | group_set.insert(group); | |||
923 | if (error.Fail()) | |||
924 | return error; | |||
925 | } | |||
926 | } | |||
927 | return error; | |||
928 | } | |||
929 | ||||
930 | // OptionParser permutes the arguments while processing them, so we create a | |||
931 | // temporary array holding to avoid modification of the input arguments. The | |||
932 | // options themselves are never modified, but the API expects a char * anyway, | |||
933 | // hence the const_cast. | |||
934 | static std::vector<char *> GetArgvForParsing(const Args &args) { | |||
935 | std::vector<char *> result; | |||
936 | // OptionParser always skips the first argument as it is based on getopt(). | |||
937 | result.push_back(const_cast<char *>("<FAKE-ARG0>")); | |||
938 | for (const Args::ArgEntry &entry : args) | |||
939 | result.push_back(const_cast<char *>(entry.c_str())); | |||
940 | return result; | |||
941 | } | |||
942 | ||||
943 | // Given a permuted argument, find it's position in the original Args vector. | |||
944 | static Args::const_iterator FindOriginalIter(const char *arg, | |||
945 | const Args &original) { | |||
946 | return llvm::find_if( | |||
947 | original, [arg](const Args::ArgEntry &D) { return D.c_str() == arg; }); | |||
948 | } | |||
949 | ||||
950 | // Given a permuted argument, find it's index in the original Args vector. | |||
951 | static size_t FindOriginalIndex(const char *arg, const Args &original) { | |||
952 | return std::distance(original.begin(), FindOriginalIter(arg, original)); | |||
953 | } | |||
954 | ||||
955 | // Construct a new Args object, consisting of the entries from the original | |||
956 | // arguments, but in the permuted order. | |||
957 | static Args ReconstituteArgsAfterParsing(llvm::ArrayRef<char *> parsed, | |||
958 | const Args &original) { | |||
959 | Args result; | |||
960 | for (const char *arg : parsed) { | |||
961 | auto pos = FindOriginalIter(arg, original); | |||
962 | assert(pos != original.end())((pos != original.end()) ? static_cast<void> (0) : __assert_fail ("pos != original.end()", "/build/llvm-toolchain-snapshot-8~svn345461/tools/lldb/source/Interpreter/Options.cpp" , 962, __PRETTY_FUNCTION__)); | |||
963 | result.AppendArgument(pos->ref, pos->quote); | |||
964 | } | |||
965 | return result; | |||
966 | } | |||
967 | ||||
968 | static size_t FindArgumentIndexForOption(const Args &args, | |||
969 | const Option &long_option) { | |||
970 | std::string short_opt = llvm::formatv("-{0}", char(long_option.val)).str(); | |||
971 | std::string long_opt = | |||
972 | llvm::formatv("--{0}", long_option.definition->long_option); | |||
973 | for (const auto &entry : llvm::enumerate(args)) { | |||
974 | if (entry.value().ref.startswith(short_opt) || | |||
975 | entry.value().ref.startswith(long_opt)) | |||
976 | return entry.index(); | |||
977 | } | |||
978 | ||||
979 | return size_t(-1); | |||
980 | } | |||
981 | ||||
982 | llvm::Expected<Args> Options::ParseAlias(const Args &args, | |||
983 | OptionArgVector *option_arg_vector, | |||
984 | std::string &input_line) { | |||
985 | StreamString sstr; | |||
986 | int i; | |||
987 | Option *long_options = GetLongOptions(); | |||
988 | ||||
989 | if (long_options == nullptr) { | |||
990 | return llvm::make_error<llvm::StringError>("Invalid long options", | |||
991 | llvm::inconvertibleErrorCode()); | |||
992 | } | |||
993 | ||||
994 | for (i = 0; long_options[i].definition != nullptr; ++i) { | |||
995 | if (long_options[i].flag == nullptr) { | |||
996 | sstr << (char)long_options[i].val; | |||
997 | switch (long_options[i].definition->option_has_arg) { | |||
998 | default: | |||
999 | case OptionParser::eNoArgument: | |||
1000 | break; | |||
1001 | case OptionParser::eRequiredArgument: | |||
1002 | sstr << ":"; | |||
1003 | break; | |||
1004 | case OptionParser::eOptionalArgument: | |||
1005 | sstr << "::"; | |||
1006 | break; | |||
1007 | } | |||
1008 | } | |||
1009 | } | |||
1010 | ||||
1011 | Args args_copy = args; | |||
1012 | std::vector<char *> argv = GetArgvForParsing(args); | |||
1013 | ||||
1014 | std::unique_lock<std::mutex> lock; | |||
1015 | OptionParser::Prepare(lock); | |||
1016 | int val; | |||
1017 | while (1) { | |||
1018 | int long_options_index = -1; | |||
1019 | val = OptionParser::Parse(argv.size(), &*argv.begin(), sstr.GetString(), | |||
1020 | long_options, &long_options_index); | |||
1021 | ||||
1022 | if (val == -1) | |||
1023 | break; | |||
1024 | ||||
1025 | if (val == '?') { | |||
1026 | return llvm::make_error<llvm::StringError>( | |||
1027 | "Unknown or ambiguous option", llvm::inconvertibleErrorCode()); | |||
1028 | } | |||
1029 | ||||
1030 | if (val == 0) | |||
1031 | continue; | |||
1032 | ||||
1033 | OptionSeen(val); | |||
1034 | ||||
1035 | // Look up the long option index | |||
1036 | if (long_options_index == -1) { | |||
1037 | for (int j = 0; long_options[j].definition || long_options[j].flag || | |||
1038 | long_options[j].val; | |||
1039 | ++j) { | |||
1040 | if (long_options[j].val == val) { | |||
1041 | long_options_index = j; | |||
1042 | break; | |||
1043 | } | |||
1044 | } | |||
1045 | } | |||
1046 | ||||
1047 | // See if the option takes an argument, and see if one was supplied. | |||
1048 | if (long_options_index == -1) { | |||
1049 | return llvm::make_error<llvm::StringError>( | |||
1050 | llvm::formatv("Invalid option with value '{0}'.", char(val)).str(), | |||
1051 | llvm::inconvertibleErrorCode()); | |||
1052 | } | |||
1053 | ||||
1054 | StreamString option_str; | |||
1055 | option_str.Printf("-%c", val); | |||
1056 | const OptionDefinition *def = long_options[long_options_index].definition; | |||
1057 | int has_arg = | |||
1058 | (def == nullptr) ? OptionParser::eNoArgument : def->option_has_arg; | |||
1059 | ||||
1060 | const char *option_arg = nullptr; | |||
1061 | switch (has_arg) { | |||
1062 | case OptionParser::eRequiredArgument: | |||
1063 | if (OptionParser::GetOptionArgument() == nullptr) { | |||
1064 | return llvm::make_error<llvm::StringError>( | |||
1065 | llvm::formatv("Option '{0}' is missing argument specifier.", | |||
1066 | option_str.GetString()) | |||
1067 | .str(), | |||
1068 | llvm::inconvertibleErrorCode()); | |||
1069 | } | |||
1070 | LLVM_FALLTHROUGH[[clang::fallthrough]]; | |||
1071 | case OptionParser::eOptionalArgument: | |||
1072 | option_arg = OptionParser::GetOptionArgument(); | |||
1073 | LLVM_FALLTHROUGH[[clang::fallthrough]]; | |||
1074 | case OptionParser::eNoArgument: | |||
1075 | break; | |||
1076 | default: | |||
1077 | return llvm::make_error<llvm::StringError>( | |||
1078 | llvm::formatv("error with options table; invalid value in has_arg " | |||
1079 | "field for option '{0}'.", | |||
1080 | char(val)) | |||
1081 | .str(), | |||
1082 | llvm::inconvertibleErrorCode()); | |||
1083 | } | |||
1084 | if (!option_arg) | |||
1085 | option_arg = "<no-argument>"; | |||
1086 | option_arg_vector->emplace_back(option_str.GetString(), has_arg, | |||
1087 | option_arg); | |||
1088 | ||||
1089 | // Find option in the argument list; also see if it was supposed to take an | |||
1090 | // argument and if one was supplied. Remove option (and argument, if | |||
1091 | // given) from the argument list. Also remove them from the | |||
1092 | // raw_input_string, if one was passed in. | |||
1093 | size_t idx = | |||
1094 | FindArgumentIndexForOption(args_copy, long_options[long_options_index]); | |||
1095 | if (idx == size_t(-1)) | |||
1096 | continue; | |||
1097 | ||||
1098 | if (!input_line.empty()) { | |||
1099 | auto tmp_arg = args_copy[idx].ref; | |||
1100 | size_t pos = input_line.find(tmp_arg); | |||
1101 | if (pos != std::string::npos) | |||
1102 | input_line.erase(pos, tmp_arg.size()); | |||
1103 | } | |||
1104 | args_copy.DeleteArgumentAtIndex(idx); | |||
1105 | if ((long_options[long_options_index].definition->option_has_arg != | |||
1106 | OptionParser::eNoArgument) && | |||
1107 | (OptionParser::GetOptionArgument() != nullptr) && | |||
1108 | (idx < args_copy.GetArgumentCount()) && | |||
1109 | (args_copy[idx].ref == OptionParser::GetOptionArgument())) { | |||
1110 | if (input_line.size() > 0) { | |||
1111 | auto tmp_arg = args_copy[idx].ref; | |||
1112 | size_t pos = input_line.find(tmp_arg); | |||
1113 | if (pos != std::string::npos) | |||
1114 | input_line.erase(pos, tmp_arg.size()); | |||
1115 | } | |||
1116 | args_copy.DeleteArgumentAtIndex(idx); | |||
1117 | } | |||
1118 | } | |||
1119 | ||||
1120 | return std::move(args_copy); | |||
1121 | } | |||
1122 | ||||
1123 | OptionElementVector Options::ParseForCompletion(const Args &args, | |||
1124 | uint32_t cursor_index) { | |||
1125 | OptionElementVector option_element_vector; | |||
1126 | StreamString sstr; | |||
1127 | Option *long_options = GetLongOptions(); | |||
1128 | option_element_vector.clear(); | |||
1129 | ||||
1130 | if (long_options == nullptr) | |||
1131 | return option_element_vector; | |||
1132 | ||||
1133 | // Leading : tells getopt to return a : for a missing option argument AND to | |||
1134 | // suppress error messages. | |||
1135 | ||||
1136 | sstr << ":"; | |||
1137 | for (int i = 0; long_options[i].definition != nullptr; ++i) { | |||
1138 | if (long_options[i].flag == nullptr) { | |||
1139 | sstr << (char)long_options[i].val; | |||
1140 | switch (long_options[i].definition->option_has_arg) { | |||
1141 | default: | |||
1142 | case OptionParser::eNoArgument: | |||
1143 | break; | |||
1144 | case OptionParser::eRequiredArgument: | |||
1145 | sstr << ":"; | |||
1146 | break; | |||
1147 | case OptionParser::eOptionalArgument: | |||
1148 | sstr << "::"; | |||
1149 | break; | |||
1150 | } | |||
1151 | } | |||
1152 | } | |||
1153 | ||||
1154 | std::unique_lock<std::mutex> lock; | |||
1155 | OptionParser::Prepare(lock); | |||
1156 | OptionParser::EnableError(false); | |||
1157 | ||||
1158 | int val; | |||
1159 | auto opt_defs = GetDefinitions(); | |||
1160 | ||||
1161 | std::vector<char *> dummy_vec = GetArgvForParsing(args); | |||
1162 | ||||
1163 | // I stick an element on the end of the input, because if the last element | |||
1164 | // is option that requires an argument, getopt_long_only will freak out. | |||
1165 | dummy_vec.push_back(const_cast<char *>("<FAKE-VALUE>")); | |||
1166 | ||||
1167 | bool failed_once = false; | |||
1168 | uint32_t dash_dash_pos = -1; | |||
1169 | ||||
1170 | while (1) { | |||
1171 | bool missing_argument = false; | |||
1172 | int long_options_index = -1; | |||
1173 | ||||
1174 | val = OptionParser::Parse(dummy_vec.size(), &dummy_vec[0], sstr.GetString(), | |||
1175 | long_options, &long_options_index); | |||
1176 | ||||
1177 | if (val == -1) { | |||
1178 | // When we're completing a "--" which is the last option on line, | |||
1179 | if (failed_once) | |||
1180 | break; | |||
1181 | ||||
1182 | failed_once = true; | |||
1183 | ||||
1184 | // If this is a bare "--" we mark it as such so we can complete it | |||
1185 | // successfully later. Handling the "--" is a little tricky, since that | |||
1186 | // may mean end of options or arguments, or the user might want to | |||
1187 | // complete options by long name. I make this work by checking whether | |||
1188 | // the cursor is in the "--" argument, and if so I assume we're | |||
1189 | // completing the long option, otherwise I let it pass to | |||
1190 | // OptionParser::Parse which will terminate the option parsing. Note, in | |||
1191 | // either case we continue parsing the line so we can figure out what | |||
1192 | // other options were passed. This will be useful when we come to | |||
1193 | // restricting completions based on what other options we've seen on the | |||
1194 | // line. | |||
1195 | ||||
1196 | if (static_cast<size_t>(OptionParser::GetOptionIndex()) < | |||
1197 | dummy_vec.size() && | |||
1198 | (strcmp(dummy_vec[OptionParser::GetOptionIndex() - 1], "--") == 0)) { | |||
1199 | dash_dash_pos = FindOriginalIndex( | |||
1200 | dummy_vec[OptionParser::GetOptionIndex() - 1], args); | |||
1201 | if (dash_dash_pos == cursor_index) { | |||
1202 | option_element_vector.push_back( | |||
1203 | OptionArgElement(OptionArgElement::eBareDoubleDash, dash_dash_pos, | |||
1204 | OptionArgElement::eBareDoubleDash)); | |||
1205 | continue; | |||
1206 | } else | |||
1207 | break; | |||
1208 | } else | |||
1209 | break; | |||
1210 | } else if (val == '?') { | |||
1211 | option_element_vector.push_back(OptionArgElement( | |||
1212 | OptionArgElement::eUnrecognizedArg, | |||
1213 | FindOriginalIndex(dummy_vec[OptionParser::GetOptionIndex() - 1], | |||
1214 | args), | |||
1215 | OptionArgElement::eUnrecognizedArg)); | |||
1216 | continue; | |||
1217 | } else if (val == 0) { | |||
1218 | continue; | |||
1219 | } else if (val == ':') { | |||
1220 | // This is a missing argument. | |||
1221 | val = OptionParser::GetOptionErrorCause(); | |||
1222 | missing_argument = true; | |||
1223 | } | |||
1224 | ||||
1225 | OptionSeen(val); | |||
1226 | ||||
1227 | // Look up the long option index | |||
1228 | if (long_options_index == -1) { | |||
1229 | for (int j = 0; long_options[j].definition || long_options[j].flag || | |||
1230 | long_options[j].val; | |||
1231 | ++j) { | |||
1232 | if (long_options[j].val == val) { | |||
1233 | long_options_index = j; | |||
1234 | break; | |||
1235 | } | |||
1236 | } | |||
1237 | } | |||
1238 | ||||
1239 | // See if the option takes an argument, and see if one was supplied. | |||
1240 | if (long_options_index >= 0) { | |||
1241 | int opt_defs_index = -1; | |||
1242 | for (size_t i = 0; i < opt_defs.size(); i++) { | |||
1243 | if (opt_defs[i].short_option != val) | |||
1244 | continue; | |||
1245 | opt_defs_index = i; | |||
1246 | break; | |||
1247 | } | |||
1248 | ||||
1249 | const OptionDefinition *def = long_options[long_options_index].definition; | |||
1250 | int has_arg = | |||
1251 | (def == nullptr) ? OptionParser::eNoArgument : def->option_has_arg; | |||
1252 | switch (has_arg) { | |||
1253 | case OptionParser::eNoArgument: | |||
1254 | option_element_vector.push_back(OptionArgElement( | |||
1255 | opt_defs_index, | |||
1256 | FindOriginalIndex(dummy_vec[OptionParser::GetOptionIndex() - 1], | |||
1257 | args), | |||
1258 | 0)); | |||
1259 | break; | |||
1260 | case OptionParser::eRequiredArgument: | |||
1261 | if (OptionParser::GetOptionArgument() != nullptr) { | |||
1262 | int arg_index; | |||
1263 | if (missing_argument) | |||
1264 | arg_index = -1; | |||
1265 | else | |||
1266 | arg_index = OptionParser::GetOptionIndex() - 2; | |||
1267 | ||||
1268 | option_element_vector.push_back(OptionArgElement( | |||
1269 | opt_defs_index, | |||
1270 | FindOriginalIndex(dummy_vec[OptionParser::GetOptionIndex() - 2], | |||
1271 | args), | |||
1272 | arg_index)); | |||
1273 | } else { | |||
1274 | option_element_vector.push_back(OptionArgElement( | |||
1275 | opt_defs_index, | |||
1276 | FindOriginalIndex(dummy_vec[OptionParser::GetOptionIndex() - 1], | |||
1277 | args), | |||
1278 | -1)); | |||
1279 | } | |||
1280 | break; | |||
1281 | case OptionParser::eOptionalArgument: | |||
1282 | if (OptionParser::GetOptionArgument() != nullptr) { | |||
1283 | option_element_vector.push_back(OptionArgElement( | |||
1284 | opt_defs_index, | |||
1285 | FindOriginalIndex(dummy_vec[OptionParser::GetOptionIndex() - 2], | |||
1286 | args), | |||
1287 | FindOriginalIndex(dummy_vec[OptionParser::GetOptionIndex() - 1], | |||
1288 | args))); | |||
1289 | } else { | |||
1290 | option_element_vector.push_back(OptionArgElement( | |||
1291 | opt_defs_index, | |||
1292 | FindOriginalIndex(dummy_vec[OptionParser::GetOptionIndex() - 2], | |||
1293 | args), | |||
1294 | FindOriginalIndex(dummy_vec[OptionParser::GetOptionIndex() - 1], | |||
1295 | args))); | |||
1296 | } | |||
1297 | break; | |||
1298 | default: | |||
1299 | // The options table is messed up. Here we'll just continue | |||
1300 | option_element_vector.push_back(OptionArgElement( | |||
1301 | OptionArgElement::eUnrecognizedArg, | |||
1302 | FindOriginalIndex(dummy_vec[OptionParser::GetOptionIndex() - 1], | |||
1303 | args), | |||
1304 | OptionArgElement::eUnrecognizedArg)); | |||
1305 | break; | |||
1306 | } | |||
1307 | } else { | |||
1308 | option_element_vector.push_back(OptionArgElement( | |||
1309 | OptionArgElement::eUnrecognizedArg, | |||
1310 | FindOriginalIndex(dummy_vec[OptionParser::GetOptionIndex() - 1], | |||
1311 | args), | |||
1312 | OptionArgElement::eUnrecognizedArg)); | |||
1313 | } | |||
1314 | } | |||
1315 | ||||
1316 | // Finally we have to handle the case where the cursor index points at a | |||
1317 | // single "-". We want to mark that in the option_element_vector, but only | |||
1318 | // if it is not after the "--". But it turns out that OptionParser::Parse | |||
1319 | // just ignores an isolated "-". So we have to look it up by hand here. We | |||
1320 | // only care if it is AT the cursor position. Note, a single quoted dash is | |||
1321 | // not the same as a single dash... | |||
1322 | ||||
1323 | const Args::ArgEntry &cursor = args[cursor_index]; | |||
1324 | if ((static_cast<int32_t>(dash_dash_pos) == -1 || | |||
1325 | cursor_index < dash_dash_pos) && | |||
1326 | !cursor.IsQuoted() && cursor.ref == "-") { | |||
1327 | option_element_vector.push_back( | |||
1328 | OptionArgElement(OptionArgElement::eBareDash, cursor_index, | |||
1329 | OptionArgElement::eBareDash)); | |||
1330 | } | |||
1331 | return option_element_vector; | |||
1332 | } | |||
1333 | ||||
1334 | llvm::Expected<Args> Options::Parse(const Args &args, | |||
1335 | ExecutionContext *execution_context, | |||
1336 | lldb::PlatformSP platform_sp, | |||
1337 | bool require_validation) { | |||
1338 | StreamString sstr; | |||
1339 | Status error; | |||
1340 | Option *long_options = GetLongOptions(); | |||
1341 | if (long_options == nullptr) { | |||
| ||||
1342 | return llvm::make_error<llvm::StringError>("Invalid long options.", | |||
1343 | llvm::inconvertibleErrorCode()); | |||
1344 | } | |||
1345 | ||||
1346 | for (int i = 0; long_options[i].definition != nullptr; ++i) { | |||
1347 | if (long_options[i].flag == nullptr) { | |||
1348 | if (isprint8(long_options[i].val)) { | |||
1349 | sstr << (char)long_options[i].val; | |||
1350 | switch (long_options[i].definition->option_has_arg) { | |||
1351 | default: | |||
1352 | case OptionParser::eNoArgument: | |||
1353 | break; | |||
1354 | case OptionParser::eRequiredArgument: | |||
1355 | sstr << ':'; | |||
1356 | break; | |||
1357 | case OptionParser::eOptionalArgument: | |||
1358 | sstr << "::"; | |||
1359 | break; | |||
1360 | } | |||
1361 | } | |||
1362 | } | |||
1363 | } | |||
1364 | std::vector<char *> argv = GetArgvForParsing(args); | |||
1365 | std::unique_lock<std::mutex> lock; | |||
1366 | OptionParser::Prepare(lock); | |||
1367 | int val; | |||
1368 | while (1) { | |||
1369 | int long_options_index = -1; | |||
1370 | val = OptionParser::Parse(argv.size(), &*argv.begin(), sstr.GetString(), | |||
1371 | long_options, &long_options_index); | |||
1372 | if (val == -1) | |||
1373 | break; | |||
1374 | ||||
1375 | // Did we get an error? | |||
1376 | if (val == '?') { | |||
1377 | error.SetErrorStringWithFormat("unknown or ambiguous option"); | |||
1378 | break; | |||
1379 | } | |||
1380 | // The option auto-set itself | |||
1381 | if (val == 0) | |||
1382 | continue; | |||
1383 | ||||
1384 | OptionSeen(val); | |||
1385 | ||||
1386 | // Lookup the long option index | |||
1387 | if (long_options_index == -1) { | |||
1388 | for (int i = 0; long_options[i].definition || long_options[i].flag || | |||
1389 | long_options[i].val; | |||
1390 | ++i) { | |||
1391 | if (long_options[i].val == val) { | |||
1392 | long_options_index = i; | |||
1393 | break; | |||
1394 | } | |||
1395 | } | |||
1396 | } | |||
1397 | // Call the callback with the option | |||
1398 | if (long_options_index >= 0 && | |||
1399 | long_options[long_options_index].definition) { | |||
1400 | const OptionDefinition *def = long_options[long_options_index].definition; | |||
1401 | ||||
1402 | if (!platform_sp) { | |||
1403 | // User did not pass in an explicit platform. Try to grab from the | |||
1404 | // execution context. | |||
1405 | TargetSP target_sp = | |||
1406 | execution_context ? execution_context->GetTargetSP() : TargetSP(); | |||
1407 | platform_sp = target_sp ? target_sp->GetPlatform() : PlatformSP(); | |||
1408 | } | |||
1409 | OptionValidator *validator = def->validator; | |||
1410 | ||||
1411 | if (!platform_sp && require_validation) { | |||
1412 | // Caller requires validation but we cannot validate as we don't have | |||
1413 | // the mandatory platform against which to validate. | |||
1414 | return llvm::make_error<llvm::StringError>( | |||
1415 | "cannot validate options: no platform available", | |||
1416 | llvm::inconvertibleErrorCode()); | |||
1417 | } | |||
1418 | ||||
1419 | bool validation_failed = false; | |||
1420 | if (platform_sp) { | |||
1421 | // Ensure we have an execution context, empty or not. | |||
1422 | ExecutionContext dummy_context; | |||
1423 | ExecutionContext *exe_ctx_p = | |||
1424 | execution_context ? execution_context : &dummy_context; | |||
1425 | if (validator && !validator->IsValid(*platform_sp, *exe_ctx_p)) { | |||
1426 | validation_failed = true; | |||
1427 | error.SetErrorStringWithFormat("Option \"%s\" invalid. %s", | |||
1428 | def->long_option, | |||
1429 | def->validator->LongConditionString()); | |||
1430 | } | |||
1431 | } | |||
1432 | ||||
1433 | // As long as validation didn't fail, we set the option value. | |||
1434 | if (!validation_failed) | |||
1435 | error = | |||
1436 | SetOptionValue(long_options_index, | |||
1437 | (def->option_has_arg == OptionParser::eNoArgument) | |||
1438 | ? nullptr | |||
1439 | : OptionParser::GetOptionArgument(), | |||
1440 | execution_context); | |||
1441 | } else { | |||
1442 | error.SetErrorStringWithFormat("invalid option with value '%i'", val); | |||
1443 | } | |||
1444 | if (error.Fail()) | |||
1445 | return error.ToError(); | |||
1446 | } | |||
1447 | ||||
1448 | argv.erase(argv.begin(), argv.begin() + OptionParser::GetOptionIndex()); | |||
1449 | return ReconstituteArgsAfterParsing(argv, args); | |||
1450 | } |
1 | //===- llvm/Support/Error.h - Recoverable error handling --------*- C++ -*-===// | |||
2 | // | |||
3 | // The LLVM Compiler Infrastructure | |||
4 | // | |||
5 | // This file is distributed under the University of Illinois Open Source | |||
6 | // License. See LICENSE.TXT for details. | |||
7 | // | |||
8 | //===----------------------------------------------------------------------===// | |||
9 | // | |||
10 | // This file defines an API used to report recoverable errors. | |||
11 | // | |||
12 | //===----------------------------------------------------------------------===// | |||
13 | ||||
14 | #ifndef LLVM_SUPPORT_ERROR_H | |||
15 | #define LLVM_SUPPORT_ERROR_H | |||
16 | ||||
17 | #include "llvm-c/Error.h" | |||
18 | #include "llvm/ADT/STLExtras.h" | |||
19 | #include "llvm/ADT/SmallVector.h" | |||
20 | #include "llvm/ADT/StringExtras.h" | |||
21 | #include "llvm/ADT/Twine.h" | |||
22 | #include "llvm/Config/abi-breaking.h" | |||
23 | #include "llvm/Support/AlignOf.h" | |||
24 | #include "llvm/Support/Compiler.h" | |||
25 | #include "llvm/Support/Debug.h" | |||
26 | #include "llvm/Support/ErrorHandling.h" | |||
27 | #include "llvm/Support/ErrorOr.h" | |||
28 | #include "llvm/Support/Format.h" | |||
29 | #include "llvm/Support/raw_ostream.h" | |||
30 | #include <algorithm> | |||
31 | #include <cassert> | |||
32 | #include <cstdint> | |||
33 | #include <cstdlib> | |||
34 | #include <functional> | |||
35 | #include <memory> | |||
36 | #include <new> | |||
37 | #include <string> | |||
38 | #include <system_error> | |||
39 | #include <type_traits> | |||
40 | #include <utility> | |||
41 | #include <vector> | |||
42 | ||||
43 | namespace llvm { | |||
44 | ||||
45 | class ErrorSuccess; | |||
46 | ||||
47 | /// Base class for error info classes. Do not extend this directly: Extend | |||
48 | /// the ErrorInfo template subclass instead. | |||
49 | class ErrorInfoBase { | |||
50 | public: | |||
51 | virtual ~ErrorInfoBase() = default; | |||
52 | ||||
53 | /// Print an error message to an output stream. | |||
54 | virtual void log(raw_ostream &OS) const = 0; | |||
55 | ||||
56 | /// Return the error message as a string. | |||
57 | virtual std::string message() const { | |||
58 | std::string Msg; | |||
59 | raw_string_ostream OS(Msg); | |||
60 | log(OS); | |||
61 | return OS.str(); | |||
62 | } | |||
63 | ||||
64 | /// Convert this error to a std::error_code. | |||
65 | /// | |||
66 | /// This is a temporary crutch to enable interaction with code still | |||
67 | /// using std::error_code. It will be removed in the future. | |||
68 | virtual std::error_code convertToErrorCode() const = 0; | |||
69 | ||||
70 | // Returns the class ID for this type. | |||
71 | static const void *classID() { return &ID; } | |||
72 | ||||
73 | // Returns the class ID for the dynamic type of this ErrorInfoBase instance. | |||
74 | virtual const void *dynamicClassID() const = 0; | |||
75 | ||||
76 | // Check whether this instance is a subclass of the class identified by | |||
77 | // ClassID. | |||
78 | virtual bool isA(const void *const ClassID) const { | |||
79 | return ClassID == classID(); | |||
80 | } | |||
81 | ||||
82 | // Check whether this instance is a subclass of ErrorInfoT. | |||
83 | template <typename ErrorInfoT> bool isA() const { | |||
84 | return isA(ErrorInfoT::classID()); | |||
85 | } | |||
86 | ||||
87 | private: | |||
88 | virtual void anchor(); | |||
89 | ||||
90 | static char ID; | |||
91 | }; | |||
92 | ||||
93 | /// Lightweight error class with error context and mandatory checking. | |||
94 | /// | |||
95 | /// Instances of this class wrap a ErrorInfoBase pointer. Failure states | |||
96 | /// are represented by setting the pointer to a ErrorInfoBase subclass | |||
97 | /// instance containing information describing the failure. Success is | |||
98 | /// represented by a null pointer value. | |||
99 | /// | |||
100 | /// Instances of Error also contains a 'Checked' flag, which must be set | |||
101 | /// before the destructor is called, otherwise the destructor will trigger a | |||
102 | /// runtime error. This enforces at runtime the requirement that all Error | |||
103 | /// instances be checked or returned to the caller. | |||
104 | /// | |||
105 | /// There are two ways to set the checked flag, depending on what state the | |||
106 | /// Error instance is in. For Error instances indicating success, it | |||
107 | /// is sufficient to invoke the boolean conversion operator. E.g.: | |||
108 | /// | |||
109 | /// @code{.cpp} | |||
110 | /// Error foo(<...>); | |||
111 | /// | |||
112 | /// if (auto E = foo(<...>)) | |||
113 | /// return E; // <- Return E if it is in the error state. | |||
114 | /// // We have verified that E was in the success state. It can now be safely | |||
115 | /// // destroyed. | |||
116 | /// @endcode | |||
117 | /// | |||
118 | /// A success value *can not* be dropped. For example, just calling 'foo(<...>)' | |||
119 | /// without testing the return value will raise a runtime error, even if foo | |||
120 | /// returns success. | |||
121 | /// | |||
122 | /// For Error instances representing failure, you must use either the | |||
123 | /// handleErrors or handleAllErrors function with a typed handler. E.g.: | |||
124 | /// | |||
125 | /// @code{.cpp} | |||
126 | /// class MyErrorInfo : public ErrorInfo<MyErrorInfo> { | |||
127 | /// // Custom error info. | |||
128 | /// }; | |||
129 | /// | |||
130 | /// Error foo(<...>) { return make_error<MyErrorInfo>(...); } | |||
131 | /// | |||
132 | /// auto E = foo(<...>); // <- foo returns failure with MyErrorInfo. | |||
133 | /// auto NewE = | |||
134 | /// handleErrors(E, | |||
135 | /// [](const MyErrorInfo &M) { | |||
136 | /// // Deal with the error. | |||
137 | /// }, | |||
138 | /// [](std::unique_ptr<OtherError> M) -> Error { | |||
139 | /// if (canHandle(*M)) { | |||
140 | /// // handle error. | |||
141 | /// return Error::success(); | |||
142 | /// } | |||
143 | /// // Couldn't handle this error instance. Pass it up the stack. | |||
144 | /// return Error(std::move(M)); | |||
145 | /// ); | |||
146 | /// // Note - we must check or return NewE in case any of the handlers | |||
147 | /// // returned a new error. | |||
148 | /// @endcode | |||
149 | /// | |||
150 | /// The handleAllErrors function is identical to handleErrors, except | |||
151 | /// that it has a void return type, and requires all errors to be handled and | |||
152 | /// no new errors be returned. It prevents errors (assuming they can all be | |||
153 | /// handled) from having to be bubbled all the way to the top-level. | |||
154 | /// | |||
155 | /// *All* Error instances must be checked before destruction, even if | |||
156 | /// they're moved-assigned or constructed from Success values that have already | |||
157 | /// been checked. This enforces checking through all levels of the call stack. | |||
158 | class LLVM_NODISCARD[[clang::warn_unused_result]] Error { | |||
159 | // Both ErrorList and FileError need to be able to yank ErrorInfoBase | |||
160 | // pointers out of this class to add to the error list. | |||
161 | friend class ErrorList; | |||
162 | friend class FileError; | |||
163 | ||||
164 | // handleErrors needs to be able to set the Checked flag. | |||
165 | template <typename... HandlerTs> | |||
166 | friend Error handleErrors(Error E, HandlerTs &&... Handlers); | |||
167 | ||||
168 | // Expected<T> needs to be able to steal the payload when constructed from an | |||
169 | // error. | |||
170 | template <typename T> friend class Expected; | |||
171 | ||||
172 | // wrap needs to be able to steal the payload. | |||
173 | friend LLVMErrorRef wrap(Error); | |||
174 | ||||
175 | protected: | |||
176 | /// Create a success value. Prefer using 'Error::success()' for readability | |||
177 | Error() { | |||
178 | setPtr(nullptr); | |||
179 | setChecked(false); | |||
180 | } | |||
181 | ||||
182 | public: | |||
183 | /// Create a success value. | |||
184 | static ErrorSuccess success(); | |||
185 | ||||
186 | // Errors are not copy-constructable. | |||
187 | Error(const Error &Other) = delete; | |||
188 | ||||
189 | /// Move-construct an error value. The newly constructed error is considered | |||
190 | /// unchecked, even if the source error had been checked. The original error | |||
191 | /// becomes a checked Success value, regardless of its original state. | |||
192 | Error(Error &&Other) { | |||
193 | setChecked(true); | |||
194 | *this = std::move(Other); | |||
195 | } | |||
196 | ||||
197 | /// Create an error value. Prefer using the 'make_error' function, but | |||
198 | /// this constructor can be useful when "re-throwing" errors from handlers. | |||
199 | Error(std::unique_ptr<ErrorInfoBase> Payload) { | |||
200 | setPtr(Payload.release()); | |||
201 | setChecked(false); | |||
| ||||
202 | } | |||
203 | ||||
204 | // Errors are not copy-assignable. | |||
205 | Error &operator=(const Error &Other) = delete; | |||
206 | ||||
207 | /// Move-assign an error value. The current error must represent success, you | |||
208 | /// you cannot overwrite an unhandled error. The current error is then | |||
209 | /// considered unchecked. The source error becomes a checked success value, | |||
210 | /// regardless of its original state. | |||
211 | Error &operator=(Error &&Other) { | |||
212 | // Don't allow overwriting of unchecked values. | |||
213 | assertIsChecked(); | |||
214 | setPtr(Other.getPtr()); | |||
215 | ||||
216 | // This Error is unchecked, even if the source error was checked. | |||
217 | setChecked(false); | |||
218 | ||||
219 | // Null out Other's payload and set its checked bit. | |||
220 | Other.setPtr(nullptr); | |||
221 | Other.setChecked(true); | |||
222 | ||||
223 | return *this; | |||
224 | } | |||
225 | ||||
226 | /// Destroy a Error. Fails with a call to abort() if the error is | |||
227 | /// unchecked. | |||
228 | ~Error() { | |||
229 | assertIsChecked(); | |||
230 | delete getPtr(); | |||
231 | } | |||
232 | ||||
233 | /// Bool conversion. Returns true if this Error is in a failure state, | |||
234 | /// and false if it is in an accept state. If the error is in a Success state | |||
235 | /// it will be considered checked. | |||
236 | explicit operator bool() { | |||
237 | setChecked(getPtr() == nullptr); | |||
238 | return getPtr() != nullptr; | |||
239 | } | |||
240 | ||||
241 | /// Check whether one error is a subclass of another. | |||
242 | template <typename ErrT> bool isA() const { | |||
243 | return getPtr() && getPtr()->isA(ErrT::classID()); | |||
244 | } | |||
245 | ||||
246 | /// Returns the dynamic class id of this error, or null if this is a success | |||
247 | /// value. | |||
248 | const void* dynamicClassID() const { | |||
249 | if (!getPtr()) | |||
250 | return nullptr; | |||
251 | return getPtr()->dynamicClassID(); | |||
252 | } | |||
253 | ||||
254 | private: | |||
255 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
256 | // assertIsChecked() happens very frequently, but under normal circumstances | |||
257 | // is supposed to be a no-op. So we want it to be inlined, but having a bunch | |||
258 | // of debug prints can cause the function to be too large for inlining. So | |||
259 | // it's important that we define this function out of line so that it can't be | |||
260 | // inlined. | |||
261 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) | |||
262 | void fatalUncheckedError() const; | |||
263 | #endif | |||
264 | ||||
265 | void assertIsChecked() { | |||
266 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
267 | if (LLVM_UNLIKELY(!getChecked() || getPtr())__builtin_expect((bool)(!getChecked() || getPtr()), false)) | |||
268 | fatalUncheckedError(); | |||
269 | #endif | |||
270 | } | |||
271 | ||||
272 | ErrorInfoBase *getPtr() const { | |||
273 | return reinterpret_cast<ErrorInfoBase*>( | |||
274 | reinterpret_cast<uintptr_t>(Payload) & | |||
275 | ~static_cast<uintptr_t>(0x1)); | |||
276 | } | |||
277 | ||||
278 | void setPtr(ErrorInfoBase *EI) { | |||
279 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
280 | Payload = reinterpret_cast<ErrorInfoBase*>( | |||
281 | (reinterpret_cast<uintptr_t>(EI) & | |||
282 | ~static_cast<uintptr_t>(0x1)) | | |||
283 | (reinterpret_cast<uintptr_t>(Payload) & 0x1)); | |||
284 | #else | |||
285 | Payload = EI; | |||
286 | #endif | |||
287 | } | |||
288 | ||||
289 | bool getChecked() const { | |||
290 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
291 | return (reinterpret_cast<uintptr_t>(Payload) & 0x1) == 0; | |||
292 | #else | |||
293 | return true; | |||
294 | #endif | |||
295 | } | |||
296 | ||||
297 | void setChecked(bool V) { | |||
298 | Payload = reinterpret_cast<ErrorInfoBase*>( | |||
299 | (reinterpret_cast<uintptr_t>(Payload) & | |||
300 | ~static_cast<uintptr_t>(0x1)) | | |||
301 | (V ? 0 : 1)); | |||
302 | } | |||
303 | ||||
304 | std::unique_ptr<ErrorInfoBase> takePayload() { | |||
305 | std::unique_ptr<ErrorInfoBase> Tmp(getPtr()); | |||
306 | setPtr(nullptr); | |||
307 | setChecked(true); | |||
308 | return Tmp; | |||
309 | } | |||
310 | ||||
311 | friend raw_ostream &operator<<(raw_ostream &OS, const Error &E) { | |||
312 | if (auto P = E.getPtr()) | |||
313 | P->log(OS); | |||
314 | else | |||
315 | OS << "success"; | |||
316 | return OS; | |||
317 | } | |||
318 | ||||
319 | ErrorInfoBase *Payload = nullptr; | |||
320 | }; | |||
321 | ||||
322 | /// Subclass of Error for the sole purpose of identifying the success path in | |||
323 | /// the type system. This allows to catch invalid conversion to Expected<T> at | |||
324 | /// compile time. | |||
325 | class ErrorSuccess final : public Error {}; | |||
326 | ||||
327 | inline ErrorSuccess Error::success() { return ErrorSuccess(); } | |||
328 | ||||
329 | /// Make a Error instance representing failure using the given error info | |||
330 | /// type. | |||
331 | template <typename ErrT, typename... ArgTs> Error make_error(ArgTs &&... Args) { | |||
332 | return Error(llvm::make_unique<ErrT>(std::forward<ArgTs>(Args)...)); | |||
333 | } | |||
334 | ||||
335 | /// Base class for user error types. Users should declare their error types | |||
336 | /// like: | |||
337 | /// | |||
338 | /// class MyError : public ErrorInfo<MyError> { | |||
339 | /// .... | |||
340 | /// }; | |||
341 | /// | |||
342 | /// This class provides an implementation of the ErrorInfoBase::kind | |||
343 | /// method, which is used by the Error RTTI system. | |||
344 | template <typename ThisErrT, typename ParentErrT = ErrorInfoBase> | |||
345 | class ErrorInfo : public ParentErrT { | |||
346 | public: | |||
347 | using ParentErrT::ParentErrT; // inherit constructors | |||
348 | ||||
349 | static const void *classID() { return &ThisErrT::ID; } | |||
350 | ||||
351 | const void *dynamicClassID() const override { return &ThisErrT::ID; } | |||
352 | ||||
353 | bool isA(const void *const ClassID) const override { | |||
354 | return ClassID == classID() || ParentErrT::isA(ClassID); | |||
355 | } | |||
356 | }; | |||
357 | ||||
358 | /// Special ErrorInfo subclass representing a list of ErrorInfos. | |||
359 | /// Instances of this class are constructed by joinError. | |||
360 | class ErrorList final : public ErrorInfo<ErrorList> { | |||
361 | // handleErrors needs to be able to iterate the payload list of an | |||
362 | // ErrorList. | |||
363 | template <typename... HandlerTs> | |||
364 | friend Error handleErrors(Error E, HandlerTs &&... Handlers); | |||
365 | ||||
366 | // joinErrors is implemented in terms of join. | |||
367 | friend Error joinErrors(Error, Error); | |||
368 | ||||
369 | public: | |||
370 | void log(raw_ostream &OS) const override { | |||
371 | OS << "Multiple errors:\n"; | |||
372 | for (auto &ErrPayload : Payloads) { | |||
373 | ErrPayload->log(OS); | |||
374 | OS << "\n"; | |||
375 | } | |||
376 | } | |||
377 | ||||
378 | std::error_code convertToErrorCode() const override; | |||
379 | ||||
380 | // Used by ErrorInfo::classID. | |||
381 | static char ID; | |||
382 | ||||
383 | private: | |||
384 | ErrorList(std::unique_ptr<ErrorInfoBase> Payload1, | |||
385 | std::unique_ptr<ErrorInfoBase> Payload2) { | |||
386 | assert(!Payload1->isA<ErrorList>() && !Payload2->isA<ErrorList>() &&((!Payload1->isA<ErrorList>() && !Payload2-> isA<ErrorList>() && "ErrorList constructor payloads should be singleton errors" ) ? static_cast<void> (0) : __assert_fail ("!Payload1->isA<ErrorList>() && !Payload2->isA<ErrorList>() && \"ErrorList constructor payloads should be singleton errors\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 387, __PRETTY_FUNCTION__)) | |||
387 | "ErrorList constructor payloads should be singleton errors")((!Payload1->isA<ErrorList>() && !Payload2-> isA<ErrorList>() && "ErrorList constructor payloads should be singleton errors" ) ? static_cast<void> (0) : __assert_fail ("!Payload1->isA<ErrorList>() && !Payload2->isA<ErrorList>() && \"ErrorList constructor payloads should be singleton errors\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 387, __PRETTY_FUNCTION__)); | |||
388 | Payloads.push_back(std::move(Payload1)); | |||
389 | Payloads.push_back(std::move(Payload2)); | |||
390 | } | |||
391 | ||||
392 | static Error join(Error E1, Error E2) { | |||
393 | if (!E1) | |||
394 | return E2; | |||
395 | if (!E2) | |||
396 | return E1; | |||
397 | if (E1.isA<ErrorList>()) { | |||
398 | auto &E1List = static_cast<ErrorList &>(*E1.getPtr()); | |||
399 | if (E2.isA<ErrorList>()) { | |||
400 | auto E2Payload = E2.takePayload(); | |||
401 | auto &E2List = static_cast<ErrorList &>(*E2Payload); | |||
402 | for (auto &Payload : E2List.Payloads) | |||
403 | E1List.Payloads.push_back(std::move(Payload)); | |||
404 | } else | |||
405 | E1List.Payloads.push_back(E2.takePayload()); | |||
406 | ||||
407 | return E1; | |||
408 | } | |||
409 | if (E2.isA<ErrorList>()) { | |||
410 | auto &E2List = static_cast<ErrorList &>(*E2.getPtr()); | |||
411 | E2List.Payloads.insert(E2List.Payloads.begin(), E1.takePayload()); | |||
412 | return E2; | |||
413 | } | |||
414 | return Error(std::unique_ptr<ErrorList>( | |||
415 | new ErrorList(E1.takePayload(), E2.takePayload()))); | |||
416 | } | |||
417 | ||||
418 | std::vector<std::unique_ptr<ErrorInfoBase>> Payloads; | |||
419 | }; | |||
420 | ||||
421 | /// Concatenate errors. The resulting Error is unchecked, and contains the | |||
422 | /// ErrorInfo(s), if any, contained in E1, followed by the | |||
423 | /// ErrorInfo(s), if any, contained in E2. | |||
424 | inline Error joinErrors(Error E1, Error E2) { | |||
425 | return ErrorList::join(std::move(E1), std::move(E2)); | |||
426 | } | |||
427 | ||||
428 | /// Tagged union holding either a T or a Error. | |||
429 | /// | |||
430 | /// This class parallels ErrorOr, but replaces error_code with Error. Since | |||
431 | /// Error cannot be copied, this class replaces getError() with | |||
432 | /// takeError(). It also adds an bool errorIsA<ErrT>() method for testing the | |||
433 | /// error class type. | |||
434 | template <class T> class LLVM_NODISCARD[[clang::warn_unused_result]] Expected { | |||
435 | template <class T1> friend class ExpectedAsOutParameter; | |||
436 | template <class OtherT> friend class Expected; | |||
437 | ||||
438 | static const bool isRef = std::is_reference<T>::value; | |||
439 | ||||
440 | using wrap = std::reference_wrapper<typename std::remove_reference<T>::type>; | |||
441 | ||||
442 | using error_type = std::unique_ptr<ErrorInfoBase>; | |||
443 | ||||
444 | public: | |||
445 | using storage_type = typename std::conditional<isRef, wrap, T>::type; | |||
446 | using value_type = T; | |||
447 | ||||
448 | private: | |||
449 | using reference = typename std::remove_reference<T>::type &; | |||
450 | using const_reference = const typename std::remove_reference<T>::type &; | |||
451 | using pointer = typename std::remove_reference<T>::type *; | |||
452 | using const_pointer = const typename std::remove_reference<T>::type *; | |||
453 | ||||
454 | public: | |||
455 | /// Create an Expected<T> error value from the given Error. | |||
456 | Expected(Error Err) | |||
457 | : HasError(true) | |||
458 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
459 | // Expected is unchecked upon construction in Debug builds. | |||
460 | , Unchecked(true) | |||
461 | #endif | |||
462 | { | |||
463 | assert(Err && "Cannot create Expected<T> from Error success value.")((Err && "Cannot create Expected<T> from Error success value." ) ? static_cast<void> (0) : __assert_fail ("Err && \"Cannot create Expected<T> from Error success value.\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 463, __PRETTY_FUNCTION__)); | |||
464 | new (getErrorStorage()) error_type(Err.takePayload()); | |||
465 | } | |||
466 | ||||
467 | /// Forbid to convert from Error::success() implicitly, this avoids having | |||
468 | /// Expected<T> foo() { return Error::success(); } which compiles otherwise | |||
469 | /// but triggers the assertion above. | |||
470 | Expected(ErrorSuccess) = delete; | |||
471 | ||||
472 | /// Create an Expected<T> success value from the given OtherT value, which | |||
473 | /// must be convertible to T. | |||
474 | template <typename OtherT> | |||
475 | Expected(OtherT &&Val, | |||
476 | typename std::enable_if<std::is_convertible<OtherT, T>::value>::type | |||
477 | * = nullptr) | |||
478 | : HasError(false) | |||
479 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
480 | // Expected is unchecked upon construction in Debug builds. | |||
481 | , Unchecked(true) | |||
482 | #endif | |||
483 | { | |||
484 | new (getStorage()) storage_type(std::forward<OtherT>(Val)); | |||
485 | } | |||
486 | ||||
487 | /// Move construct an Expected<T> value. | |||
488 | Expected(Expected &&Other) { moveConstruct(std::move(Other)); } | |||
489 | ||||
490 | /// Move construct an Expected<T> value from an Expected<OtherT>, where OtherT | |||
491 | /// must be convertible to T. | |||
492 | template <class OtherT> | |||
493 | Expected(Expected<OtherT> &&Other, | |||
494 | typename std::enable_if<std::is_convertible<OtherT, T>::value>::type | |||
495 | * = nullptr) { | |||
496 | moveConstruct(std::move(Other)); | |||
497 | } | |||
498 | ||||
499 | /// Move construct an Expected<T> value from an Expected<OtherT>, where OtherT | |||
500 | /// isn't convertible to T. | |||
501 | template <class OtherT> | |||
502 | explicit Expected( | |||
503 | Expected<OtherT> &&Other, | |||
504 | typename std::enable_if<!std::is_convertible<OtherT, T>::value>::type * = | |||
505 | nullptr) { | |||
506 | moveConstruct(std::move(Other)); | |||
507 | } | |||
508 | ||||
509 | /// Move-assign from another Expected<T>. | |||
510 | Expected &operator=(Expected &&Other) { | |||
511 | moveAssign(std::move(Other)); | |||
512 | return *this; | |||
513 | } | |||
514 | ||||
515 | /// Destroy an Expected<T>. | |||
516 | ~Expected() { | |||
517 | assertIsChecked(); | |||
518 | if (!HasError) | |||
519 | getStorage()->~storage_type(); | |||
520 | else | |||
521 | getErrorStorage()->~error_type(); | |||
522 | } | |||
523 | ||||
524 | /// Return false if there is an error. | |||
525 | explicit operator bool() { | |||
526 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
527 | Unchecked = HasError; | |||
528 | #endif | |||
529 | return !HasError; | |||
530 | } | |||
531 | ||||
532 | /// Returns a reference to the stored T value. | |||
533 | reference get() { | |||
534 | assertIsChecked(); | |||
535 | return *getStorage(); | |||
536 | } | |||
537 | ||||
538 | /// Returns a const reference to the stored T value. | |||
539 | const_reference get() const { | |||
540 | assertIsChecked(); | |||
541 | return const_cast<Expected<T> *>(this)->get(); | |||
542 | } | |||
543 | ||||
544 | /// Check that this Expected<T> is an error of type ErrT. | |||
545 | template <typename ErrT> bool errorIsA() const { | |||
546 | return HasError && (*getErrorStorage())->template isA<ErrT>(); | |||
547 | } | |||
548 | ||||
549 | /// Take ownership of the stored error. | |||
550 | /// After calling this the Expected<T> is in an indeterminate state that can | |||
551 | /// only be safely destructed. No further calls (beside the destructor) should | |||
552 | /// be made on the Expected<T> vaule. | |||
553 | Error takeError() { | |||
554 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
555 | Unchecked = false; | |||
556 | #endif | |||
557 | return HasError ? Error(std::move(*getErrorStorage())) : Error::success(); | |||
558 | } | |||
559 | ||||
560 | /// Returns a pointer to the stored T value. | |||
561 | pointer operator->() { | |||
562 | assertIsChecked(); | |||
563 | return toPointer(getStorage()); | |||
564 | } | |||
565 | ||||
566 | /// Returns a const pointer to the stored T value. | |||
567 | const_pointer operator->() const { | |||
568 | assertIsChecked(); | |||
569 | return toPointer(getStorage()); | |||
570 | } | |||
571 | ||||
572 | /// Returns a reference to the stored T value. | |||
573 | reference operator*() { | |||
574 | assertIsChecked(); | |||
575 | return *getStorage(); | |||
576 | } | |||
577 | ||||
578 | /// Returns a const reference to the stored T value. | |||
579 | const_reference operator*() const { | |||
580 | assertIsChecked(); | |||
581 | return *getStorage(); | |||
582 | } | |||
583 | ||||
584 | private: | |||
585 | template <class T1> | |||
586 | static bool compareThisIfSameType(const T1 &a, const T1 &b) { | |||
587 | return &a == &b; | |||
588 | } | |||
589 | ||||
590 | template <class T1, class T2> | |||
591 | static bool compareThisIfSameType(const T1 &a, const T2 &b) { | |||
592 | return false; | |||
593 | } | |||
594 | ||||
595 | template <class OtherT> void moveConstruct(Expected<OtherT> &&Other) { | |||
596 | HasError = Other.HasError; | |||
597 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
598 | Unchecked = true; | |||
599 | Other.Unchecked = false; | |||
600 | #endif | |||
601 | ||||
602 | if (!HasError) | |||
603 | new (getStorage()) storage_type(std::move(*Other.getStorage())); | |||
604 | else | |||
605 | new (getErrorStorage()) error_type(std::move(*Other.getErrorStorage())); | |||
606 | } | |||
607 | ||||
608 | template <class OtherT> void moveAssign(Expected<OtherT> &&Other) { | |||
609 | assertIsChecked(); | |||
610 | ||||
611 | if (compareThisIfSameType(*this, Other)) | |||
612 | return; | |||
613 | ||||
614 | this->~Expected(); | |||
615 | new (this) Expected(std::move(Other)); | |||
616 | } | |||
617 | ||||
618 | pointer toPointer(pointer Val) { return Val; } | |||
619 | ||||
620 | const_pointer toPointer(const_pointer Val) const { return Val; } | |||
621 | ||||
622 | pointer toPointer(wrap *Val) { return &Val->get(); } | |||
623 | ||||
624 | const_pointer toPointer(const wrap *Val) const { return &Val->get(); } | |||
625 | ||||
626 | storage_type *getStorage() { | |||
627 | assert(!HasError && "Cannot get value when an error exists!")((!HasError && "Cannot get value when an error exists!" ) ? static_cast<void> (0) : __assert_fail ("!HasError && \"Cannot get value when an error exists!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 627, __PRETTY_FUNCTION__)); | |||
628 | return reinterpret_cast<storage_type *>(TStorage.buffer); | |||
629 | } | |||
630 | ||||
631 | const storage_type *getStorage() const { | |||
632 | assert(!HasError && "Cannot get value when an error exists!")((!HasError && "Cannot get value when an error exists!" ) ? static_cast<void> (0) : __assert_fail ("!HasError && \"Cannot get value when an error exists!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 632, __PRETTY_FUNCTION__)); | |||
633 | return reinterpret_cast<const storage_type *>(TStorage.buffer); | |||
634 | } | |||
635 | ||||
636 | error_type *getErrorStorage() { | |||
637 | assert(HasError && "Cannot get error when a value exists!")((HasError && "Cannot get error when a value exists!" ) ? static_cast<void> (0) : __assert_fail ("HasError && \"Cannot get error when a value exists!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 637, __PRETTY_FUNCTION__)); | |||
638 | return reinterpret_cast<error_type *>(ErrorStorage.buffer); | |||
639 | } | |||
640 | ||||
641 | const error_type *getErrorStorage() const { | |||
642 | assert(HasError && "Cannot get error when a value exists!")((HasError && "Cannot get error when a value exists!" ) ? static_cast<void> (0) : __assert_fail ("HasError && \"Cannot get error when a value exists!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 642, __PRETTY_FUNCTION__)); | |||
643 | return reinterpret_cast<const error_type *>(ErrorStorage.buffer); | |||
644 | } | |||
645 | ||||
646 | // Used by ExpectedAsOutParameter to reset the checked flag. | |||
647 | void setUnchecked() { | |||
648 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
649 | Unchecked = true; | |||
650 | #endif | |||
651 | } | |||
652 | ||||
653 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
654 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) | |||
655 | LLVM_ATTRIBUTE_NOINLINE__attribute__((noinline)) | |||
656 | void fatalUncheckedExpected() const { | |||
657 | dbgs() << "Expected<T> must be checked before access or destruction.\n"; | |||
658 | if (HasError) { | |||
659 | dbgs() << "Unchecked Expected<T> contained error:\n"; | |||
660 | (*getErrorStorage())->log(dbgs()); | |||
661 | } else | |||
662 | dbgs() << "Expected<T> value was in success state. (Note: Expected<T> " | |||
663 | "values in success mode must still be checked prior to being " | |||
664 | "destroyed).\n"; | |||
665 | abort(); | |||
666 | } | |||
667 | #endif | |||
668 | ||||
669 | void assertIsChecked() { | |||
670 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
671 | if (LLVM_UNLIKELY(Unchecked)__builtin_expect((bool)(Unchecked), false)) | |||
672 | fatalUncheckedExpected(); | |||
673 | #endif | |||
674 | } | |||
675 | ||||
676 | union { | |||
677 | AlignedCharArrayUnion<storage_type> TStorage; | |||
678 | AlignedCharArrayUnion<error_type> ErrorStorage; | |||
679 | }; | |||
680 | bool HasError : 1; | |||
681 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
682 | bool Unchecked : 1; | |||
683 | #endif | |||
684 | }; | |||
685 | ||||
686 | /// Report a serious error, calling any installed error handler. See | |||
687 | /// ErrorHandling.h. | |||
688 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) void report_fatal_error(Error Err, | |||
689 | bool gen_crash_diag = true); | |||
690 | ||||
691 | /// Report a fatal error if Err is a failure value. | |||
692 | /// | |||
693 | /// This function can be used to wrap calls to fallible functions ONLY when it | |||
694 | /// is known that the Error will always be a success value. E.g. | |||
695 | /// | |||
696 | /// @code{.cpp} | |||
697 | /// // foo only attempts the fallible operation if DoFallibleOperation is | |||
698 | /// // true. If DoFallibleOperation is false then foo always returns | |||
699 | /// // Error::success(). | |||
700 | /// Error foo(bool DoFallibleOperation); | |||
701 | /// | |||
702 | /// cantFail(foo(false)); | |||
703 | /// @endcode | |||
704 | inline void cantFail(Error Err, const char *Msg = nullptr) { | |||
705 | if (Err) { | |||
706 | if (!Msg) | |||
707 | Msg = "Failure value returned from cantFail wrapped call"; | |||
708 | llvm_unreachable(Msg)::llvm::llvm_unreachable_internal(Msg, "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 708); | |||
709 | } | |||
710 | } | |||
711 | ||||
712 | /// Report a fatal error if ValOrErr is a failure value, otherwise unwraps and | |||
713 | /// returns the contained value. | |||
714 | /// | |||
715 | /// This function can be used to wrap calls to fallible functions ONLY when it | |||
716 | /// is known that the Error will always be a success value. E.g. | |||
717 | /// | |||
718 | /// @code{.cpp} | |||
719 | /// // foo only attempts the fallible operation if DoFallibleOperation is | |||
720 | /// // true. If DoFallibleOperation is false then foo always returns an int. | |||
721 | /// Expected<int> foo(bool DoFallibleOperation); | |||
722 | /// | |||
723 | /// int X = cantFail(foo(false)); | |||
724 | /// @endcode | |||
725 | template <typename T> | |||
726 | T cantFail(Expected<T> ValOrErr, const char *Msg = nullptr) { | |||
727 | if (ValOrErr) | |||
728 | return std::move(*ValOrErr); | |||
729 | else { | |||
730 | if (!Msg) | |||
731 | Msg = "Failure value returned from cantFail wrapped call"; | |||
732 | llvm_unreachable(Msg)::llvm::llvm_unreachable_internal(Msg, "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 732); | |||
733 | } | |||
734 | } | |||
735 | ||||
736 | /// Report a fatal error if ValOrErr is a failure value, otherwise unwraps and | |||
737 | /// returns the contained reference. | |||
738 | /// | |||
739 | /// This function can be used to wrap calls to fallible functions ONLY when it | |||
740 | /// is known that the Error will always be a success value. E.g. | |||
741 | /// | |||
742 | /// @code{.cpp} | |||
743 | /// // foo only attempts the fallible operation if DoFallibleOperation is | |||
744 | /// // true. If DoFallibleOperation is false then foo always returns a Bar&. | |||
745 | /// Expected<Bar&> foo(bool DoFallibleOperation); | |||
746 | /// | |||
747 | /// Bar &X = cantFail(foo(false)); | |||
748 | /// @endcode | |||
749 | template <typename T> | |||
750 | T& cantFail(Expected<T&> ValOrErr, const char *Msg = nullptr) { | |||
751 | if (ValOrErr) | |||
752 | return *ValOrErr; | |||
753 | else { | |||
754 | if (!Msg) | |||
755 | Msg = "Failure value returned from cantFail wrapped call"; | |||
756 | llvm_unreachable(Msg)::llvm::llvm_unreachable_internal(Msg, "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 756); | |||
757 | } | |||
758 | } | |||
759 | ||||
760 | /// Helper for testing applicability of, and applying, handlers for | |||
761 | /// ErrorInfo types. | |||
762 | template <typename HandlerT> | |||
763 | class ErrorHandlerTraits | |||
764 | : public ErrorHandlerTraits<decltype( | |||
765 | &std::remove_reference<HandlerT>::type::operator())> {}; | |||
766 | ||||
767 | // Specialization functions of the form 'Error (const ErrT&)'. | |||
768 | template <typename ErrT> class ErrorHandlerTraits<Error (&)(ErrT &)> { | |||
769 | public: | |||
770 | static bool appliesTo(const ErrorInfoBase &E) { | |||
771 | return E.template isA<ErrT>(); | |||
772 | } | |||
773 | ||||
774 | template <typename HandlerT> | |||
775 | static Error apply(HandlerT &&H, std::unique_ptr<ErrorInfoBase> E) { | |||
776 | assert(appliesTo(*E) && "Applying incorrect handler")((appliesTo(*E) && "Applying incorrect handler") ? static_cast <void> (0) : __assert_fail ("appliesTo(*E) && \"Applying incorrect handler\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 776, __PRETTY_FUNCTION__)); | |||
777 | return H(static_cast<ErrT &>(*E)); | |||
778 | } | |||
779 | }; | |||
780 | ||||
781 | // Specialization functions of the form 'void (const ErrT&)'. | |||
782 | template <typename ErrT> class ErrorHandlerTraits<void (&)(ErrT &)> { | |||
783 | public: | |||
784 | static bool appliesTo(const ErrorInfoBase &E) { | |||
785 | return E.template isA<ErrT>(); | |||
786 | } | |||
787 | ||||
788 | template <typename HandlerT> | |||
789 | static Error apply(HandlerT &&H, std::unique_ptr<ErrorInfoBase> E) { | |||
790 | assert(appliesTo(*E) && "Applying incorrect handler")((appliesTo(*E) && "Applying incorrect handler") ? static_cast <void> (0) : __assert_fail ("appliesTo(*E) && \"Applying incorrect handler\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 790, __PRETTY_FUNCTION__)); | |||
791 | H(static_cast<ErrT &>(*E)); | |||
792 | return Error::success(); | |||
793 | } | |||
794 | }; | |||
795 | ||||
796 | /// Specialization for functions of the form 'Error (std::unique_ptr<ErrT>)'. | |||
797 | template <typename ErrT> | |||
798 | class ErrorHandlerTraits<Error (&)(std::unique_ptr<ErrT>)> { | |||
799 | public: | |||
800 | static bool appliesTo(const ErrorInfoBase &E) { | |||
801 | return E.template isA<ErrT>(); | |||
802 | } | |||
803 | ||||
804 | template <typename HandlerT> | |||
805 | static Error apply(HandlerT &&H, std::unique_ptr<ErrorInfoBase> E) { | |||
806 | assert(appliesTo(*E) && "Applying incorrect handler")((appliesTo(*E) && "Applying incorrect handler") ? static_cast <void> (0) : __assert_fail ("appliesTo(*E) && \"Applying incorrect handler\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 806, __PRETTY_FUNCTION__)); | |||
807 | std::unique_ptr<ErrT> SubE(static_cast<ErrT *>(E.release())); | |||
808 | return H(std::move(SubE)); | |||
809 | } | |||
810 | }; | |||
811 | ||||
812 | /// Specialization for functions of the form 'void (std::unique_ptr<ErrT>)'. | |||
813 | template <typename ErrT> | |||
814 | class ErrorHandlerTraits<void (&)(std::unique_ptr<ErrT>)> { | |||
815 | public: | |||
816 | static bool appliesTo(const ErrorInfoBase &E) { | |||
817 | return E.template isA<ErrT>(); | |||
818 | } | |||
819 | ||||
820 | template <typename HandlerT> | |||
821 | static Error apply(HandlerT &&H, std::unique_ptr<ErrorInfoBase> E) { | |||
822 | assert(appliesTo(*E) && "Applying incorrect handler")((appliesTo(*E) && "Applying incorrect handler") ? static_cast <void> (0) : __assert_fail ("appliesTo(*E) && \"Applying incorrect handler\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 822, __PRETTY_FUNCTION__)); | |||
823 | std::unique_ptr<ErrT> SubE(static_cast<ErrT *>(E.release())); | |||
824 | H(std::move(SubE)); | |||
825 | return Error::success(); | |||
826 | } | |||
827 | }; | |||
828 | ||||
829 | // Specialization for member functions of the form 'RetT (const ErrT&)'. | |||
830 | template <typename C, typename RetT, typename ErrT> | |||
831 | class ErrorHandlerTraits<RetT (C::*)(ErrT &)> | |||
832 | : public ErrorHandlerTraits<RetT (&)(ErrT &)> {}; | |||
833 | ||||
834 | // Specialization for member functions of the form 'RetT (const ErrT&) const'. | |||
835 | template <typename C, typename RetT, typename ErrT> | |||
836 | class ErrorHandlerTraits<RetT (C::*)(ErrT &) const> | |||
837 | : public ErrorHandlerTraits<RetT (&)(ErrT &)> {}; | |||
838 | ||||
839 | // Specialization for member functions of the form 'RetT (const ErrT&)'. | |||
840 | template <typename C, typename RetT, typename ErrT> | |||
841 | class ErrorHandlerTraits<RetT (C::*)(const ErrT &)> | |||
842 | : public ErrorHandlerTraits<RetT (&)(ErrT &)> {}; | |||
843 | ||||
844 | // Specialization for member functions of the form 'RetT (const ErrT&) const'. | |||
845 | template <typename C, typename RetT, typename ErrT> | |||
846 | class ErrorHandlerTraits<RetT (C::*)(const ErrT &) const> | |||
847 | : public ErrorHandlerTraits<RetT (&)(ErrT &)> {}; | |||
848 | ||||
849 | /// Specialization for member functions of the form | |||
850 | /// 'RetT (std::unique_ptr<ErrT>)'. | |||
851 | template <typename C, typename RetT, typename ErrT> | |||
852 | class ErrorHandlerTraits<RetT (C::*)(std::unique_ptr<ErrT>)> | |||
853 | : public ErrorHandlerTraits<RetT (&)(std::unique_ptr<ErrT>)> {}; | |||
854 | ||||
855 | /// Specialization for member functions of the form | |||
856 | /// 'RetT (std::unique_ptr<ErrT>) const'. | |||
857 | template <typename C, typename RetT, typename ErrT> | |||
858 | class ErrorHandlerTraits<RetT (C::*)(std::unique_ptr<ErrT>) const> | |||
859 | : public ErrorHandlerTraits<RetT (&)(std::unique_ptr<ErrT>)> {}; | |||
860 | ||||
861 | inline Error handleErrorImpl(std::unique_ptr<ErrorInfoBase> Payload) { | |||
862 | return Error(std::move(Payload)); | |||
863 | } | |||
864 | ||||
865 | template <typename HandlerT, typename... HandlerTs> | |||
866 | Error handleErrorImpl(std::unique_ptr<ErrorInfoBase> Payload, | |||
867 | HandlerT &&Handler, HandlerTs &&... Handlers) { | |||
868 | if (ErrorHandlerTraits<HandlerT>::appliesTo(*Payload)) | |||
869 | return ErrorHandlerTraits<HandlerT>::apply(std::forward<HandlerT>(Handler), | |||
870 | std::move(Payload)); | |||
871 | return handleErrorImpl(std::move(Payload), | |||
872 | std::forward<HandlerTs>(Handlers)...); | |||
873 | } | |||
874 | ||||
875 | /// Pass the ErrorInfo(s) contained in E to their respective handlers. Any | |||
876 | /// unhandled errors (or Errors returned by handlers) are re-concatenated and | |||
877 | /// returned. | |||
878 | /// Because this function returns an error, its result must also be checked | |||
879 | /// or returned. If you intend to handle all errors use handleAllErrors | |||
880 | /// (which returns void, and will abort() on unhandled errors) instead. | |||
881 | template <typename... HandlerTs> | |||
882 | Error handleErrors(Error E, HandlerTs &&... Hs) { | |||
883 | if (!E) | |||
884 | return Error::success(); | |||
885 | ||||
886 | std::unique_ptr<ErrorInfoBase> Payload = E.takePayload(); | |||
887 | ||||
888 | if (Payload->isA<ErrorList>()) { | |||
889 | ErrorList &List = static_cast<ErrorList &>(*Payload); | |||
890 | Error R; | |||
891 | for (auto &P : List.Payloads) | |||
892 | R = ErrorList::join( | |||
893 | std::move(R), | |||
894 | handleErrorImpl(std::move(P), std::forward<HandlerTs>(Hs)...)); | |||
895 | return R; | |||
896 | } | |||
897 | ||||
898 | return handleErrorImpl(std::move(Payload), std::forward<HandlerTs>(Hs)...); | |||
899 | } | |||
900 | ||||
901 | /// Behaves the same as handleErrors, except that by contract all errors | |||
902 | /// *must* be handled by the given handlers (i.e. there must be no remaining | |||
903 | /// errors after running the handlers, or llvm_unreachable is called). | |||
904 | template <typename... HandlerTs> | |||
905 | void handleAllErrors(Error E, HandlerTs &&... Handlers) { | |||
906 | cantFail(handleErrors(std::move(E), std::forward<HandlerTs>(Handlers)...)); | |||
907 | } | |||
908 | ||||
909 | /// Check that E is a non-error, then drop it. | |||
910 | /// If E is an error, llvm_unreachable will be called. | |||
911 | inline void handleAllErrors(Error E) { | |||
912 | cantFail(std::move(E)); | |||
913 | } | |||
914 | ||||
915 | /// Handle any errors (if present) in an Expected<T>, then try a recovery path. | |||
916 | /// | |||
917 | /// If the incoming value is a success value it is returned unmodified. If it | |||
918 | /// is a failure value then it the contained error is passed to handleErrors. | |||
919 | /// If handleErrors is able to handle the error then the RecoveryPath functor | |||
920 | /// is called to supply the final result. If handleErrors is not able to | |||
921 | /// handle all errors then the unhandled errors are returned. | |||
922 | /// | |||
923 | /// This utility enables the follow pattern: | |||
924 | /// | |||
925 | /// @code{.cpp} | |||
926 | /// enum FooStrategy { Aggressive, Conservative }; | |||
927 | /// Expected<Foo> foo(FooStrategy S); | |||
928 | /// | |||
929 | /// auto ResultOrErr = | |||
930 | /// handleExpected( | |||
931 | /// foo(Aggressive), | |||
932 | /// []() { return foo(Conservative); }, | |||
933 | /// [](AggressiveStrategyError&) { | |||
934 | /// // Implicitly conusme this - we'll recover by using a conservative | |||
935 | /// // strategy. | |||
936 | /// }); | |||
937 | /// | |||
938 | /// @endcode | |||
939 | template <typename T, typename RecoveryFtor, typename... HandlerTs> | |||
940 | Expected<T> handleExpected(Expected<T> ValOrErr, RecoveryFtor &&RecoveryPath, | |||
941 | HandlerTs &&... Handlers) { | |||
942 | if (ValOrErr) | |||
943 | return ValOrErr; | |||
944 | ||||
945 | if (auto Err = handleErrors(ValOrErr.takeError(), | |||
946 | std::forward<HandlerTs>(Handlers)...)) | |||
947 | return std::move(Err); | |||
948 | ||||
949 | return RecoveryPath(); | |||
950 | } | |||
951 | ||||
952 | /// Log all errors (if any) in E to OS. If there are any errors, ErrorBanner | |||
953 | /// will be printed before the first one is logged. A newline will be printed | |||
954 | /// after each error. | |||
955 | /// | |||
956 | /// This is useful in the base level of your program to allow clean termination | |||
957 | /// (allowing clean deallocation of resources, etc.), while reporting error | |||
958 | /// information to the user. | |||
959 | void logAllUnhandledErrors(Error E, raw_ostream &OS, Twine ErrorBanner); | |||
960 | ||||
961 | /// Write all error messages (if any) in E to a string. The newline character | |||
962 | /// is used to separate error messages. | |||
963 | inline std::string toString(Error E) { | |||
964 | SmallVector<std::string, 2> Errors; | |||
965 | handleAllErrors(std::move(E), [&Errors](const ErrorInfoBase &EI) { | |||
966 | Errors.push_back(EI.message()); | |||
967 | }); | |||
968 | return join(Errors.begin(), Errors.end(), "\n"); | |||
969 | } | |||
970 | ||||
971 | /// Consume a Error without doing anything. This method should be used | |||
972 | /// only where an error can be considered a reasonable and expected return | |||
973 | /// value. | |||
974 | /// | |||
975 | /// Uses of this method are potentially indicative of design problems: If it's | |||
976 | /// legitimate to do nothing while processing an "error", the error-producer | |||
977 | /// might be more clearly refactored to return an Optional<T>. | |||
978 | inline void consumeError(Error Err) { | |||
979 | handleAllErrors(std::move(Err), [](const ErrorInfoBase &) {}); | |||
980 | } | |||
981 | ||||
982 | /// Helper for converting an Error to a bool. | |||
983 | /// | |||
984 | /// This method returns true if Err is in an error state, or false if it is | |||
985 | /// in a success state. Puts Err in a checked state in both cases (unlike | |||
986 | /// Error::operator bool(), which only does this for success states). | |||
987 | inline bool errorToBool(Error Err) { | |||
988 | bool IsError = static_cast<bool>(Err); | |||
989 | if (IsError) | |||
990 | consumeError(std::move(Err)); | |||
991 | return IsError; | |||
992 | } | |||
993 | ||||
994 | /// Helper for Errors used as out-parameters. | |||
995 | /// | |||
996 | /// This helper is for use with the Error-as-out-parameter idiom, where an error | |||
997 | /// is passed to a function or method by reference, rather than being returned. | |||
998 | /// In such cases it is helpful to set the checked bit on entry to the function | |||
999 | /// so that the error can be written to (unchecked Errors abort on assignment) | |||
1000 | /// and clear the checked bit on exit so that clients cannot accidentally forget | |||
1001 | /// to check the result. This helper performs these actions automatically using | |||
1002 | /// RAII: | |||
1003 | /// | |||
1004 | /// @code{.cpp} | |||
1005 | /// Result foo(Error &Err) { | |||
1006 | /// ErrorAsOutParameter ErrAsOutParam(&Err); // 'Checked' flag set | |||
1007 | /// // <body of foo> | |||
1008 | /// // <- 'Checked' flag auto-cleared when ErrAsOutParam is destructed. | |||
1009 | /// } | |||
1010 | /// @endcode | |||
1011 | /// | |||
1012 | /// ErrorAsOutParameter takes an Error* rather than Error& so that it can be | |||
1013 | /// used with optional Errors (Error pointers that are allowed to be null). If | |||
1014 | /// ErrorAsOutParameter took an Error reference, an instance would have to be | |||
1015 | /// created inside every condition that verified that Error was non-null. By | |||
1016 | /// taking an Error pointer we can just create one instance at the top of the | |||
1017 | /// function. | |||
1018 | class ErrorAsOutParameter { | |||
1019 | public: | |||
1020 | ErrorAsOutParameter(Error *Err) : Err(Err) { | |||
1021 | // Raise the checked bit if Err is success. | |||
1022 | if (Err) | |||
1023 | (void)!!*Err; | |||
1024 | } | |||
1025 | ||||
1026 | ~ErrorAsOutParameter() { | |||
1027 | // Clear the checked bit. | |||
1028 | if (Err && !*Err) | |||
1029 | *Err = Error::success(); | |||
1030 | } | |||
1031 | ||||
1032 | private: | |||
1033 | Error *Err; | |||
1034 | }; | |||
1035 | ||||
1036 | /// Helper for Expected<T>s used as out-parameters. | |||
1037 | /// | |||
1038 | /// See ErrorAsOutParameter. | |||
1039 | template <typename T> | |||
1040 | class ExpectedAsOutParameter { | |||
1041 | public: | |||
1042 | ExpectedAsOutParameter(Expected<T> *ValOrErr) | |||
1043 | : ValOrErr(ValOrErr) { | |||
1044 | if (ValOrErr) | |||
1045 | (void)!!*ValOrErr; | |||
1046 | } | |||
1047 | ||||
1048 | ~ExpectedAsOutParameter() { | |||
1049 | if (ValOrErr) | |||
1050 | ValOrErr->setUnchecked(); | |||
1051 | } | |||
1052 | ||||
1053 | private: | |||
1054 | Expected<T> *ValOrErr; | |||
1055 | }; | |||
1056 | ||||
1057 | /// This class wraps a std::error_code in a Error. | |||
1058 | /// | |||
1059 | /// This is useful if you're writing an interface that returns a Error | |||
1060 | /// (or Expected) and you want to call code that still returns | |||
1061 | /// std::error_codes. | |||
1062 | class ECError : public ErrorInfo<ECError> { | |||
1063 | friend Error errorCodeToError(std::error_code); | |||
1064 | ||||
1065 | public: | |||
1066 | void setErrorCode(std::error_code EC) { this->EC = EC; } | |||
1067 | std::error_code convertToErrorCode() const override { return EC; } | |||
1068 | void log(raw_ostream &OS) const override { OS << EC.message(); } | |||
1069 | ||||
1070 | // Used by ErrorInfo::classID. | |||
1071 | static char ID; | |||
1072 | ||||
1073 | protected: | |||
1074 | ECError() = default; | |||
1075 | ECError(std::error_code EC) : EC(EC) {} | |||
1076 | ||||
1077 | std::error_code EC; | |||
1078 | }; | |||
1079 | ||||
1080 | /// The value returned by this function can be returned from convertToErrorCode | |||
1081 | /// for Error values where no sensible translation to std::error_code exists. | |||
1082 | /// It should only be used in this situation, and should never be used where a | |||
1083 | /// sensible conversion to std::error_code is available, as attempts to convert | |||
1084 | /// to/from this error will result in a fatal error. (i.e. it is a programmatic | |||
1085 | ///error to try to convert such a value). | |||
1086 | std::error_code inconvertibleErrorCode(); | |||
1087 | ||||
1088 | /// Helper for converting an std::error_code to a Error. | |||
1089 | Error errorCodeToError(std::error_code EC); | |||
1090 | ||||
1091 | /// Helper for converting an ECError to a std::error_code. | |||
1092 | /// | |||
1093 | /// This method requires that Err be Error() or an ECError, otherwise it | |||
1094 | /// will trigger a call to abort(). | |||
1095 | std::error_code errorToErrorCode(Error Err); | |||
1096 | ||||
1097 | /// Convert an ErrorOr<T> to an Expected<T>. | |||
1098 | template <typename T> Expected<T> errorOrToExpected(ErrorOr<T> &&EO) { | |||
1099 | if (auto EC = EO.getError()) | |||
1100 | return errorCodeToError(EC); | |||
1101 | return std::move(*EO); | |||
1102 | } | |||
1103 | ||||
1104 | /// Convert an Expected<T> to an ErrorOr<T>. | |||
1105 | template <typename T> ErrorOr<T> expectedToErrorOr(Expected<T> &&E) { | |||
1106 | if (auto Err = E.takeError()) | |||
1107 | return errorToErrorCode(std::move(Err)); | |||
1108 | return std::move(*E); | |||
1109 | } | |||
1110 | ||||
1111 | /// This class wraps a string in an Error. | |||
1112 | /// | |||
1113 | /// StringError is useful in cases where the client is not expected to be able | |||
1114 | /// to consume the specific error message programmatically (for example, if the | |||
1115 | /// error message is to be presented to the user). | |||
1116 | /// | |||
1117 | /// StringError can also be used when additional information is to be printed | |||
1118 | /// along with a error_code message. Depending on the constructor called, this | |||
1119 | /// class can either display: | |||
1120 | /// 1. the error_code message (ECError behavior) | |||
1121 | /// 2. a string | |||
1122 | /// 3. the error_code message and a string | |||
1123 | /// | |||
1124 | /// These behaviors are useful when subtyping is required; for example, when a | |||
1125 | /// specific library needs an explicit error type. In the example below, | |||
1126 | /// PDBError is derived from StringError: | |||
1127 | /// | |||
1128 | /// @code{.cpp} | |||
1129 | /// Expected<int> foo() { | |||
1130 | /// return llvm::make_error<PDBError>(pdb_error_code::dia_failed_loading, | |||
1131 | /// "Additional information"); | |||
1132 | /// } | |||
1133 | /// @endcode | |||
1134 | /// | |||
1135 | class StringError : public ErrorInfo<StringError> { | |||
1136 | public: | |||
1137 | static char ID; | |||
1138 | ||||
1139 | // Prints EC + S and converts to EC | |||
1140 | StringError(std::error_code EC, const Twine &S = Twine()); | |||
1141 | ||||
1142 | // Prints S and converts to EC | |||
1143 | StringError(const Twine &S, std::error_code EC); | |||
1144 | ||||
1145 | void log(raw_ostream &OS) const override; | |||
1146 | std::error_code convertToErrorCode() const override; | |||
1147 | ||||
1148 | const std::string &getMessage() const { return Msg; } | |||
1149 | ||||
1150 | private: | |||
1151 | std::string Msg; | |||
1152 | std::error_code EC; | |||
1153 | const bool PrintMsgOnly = false; | |||
1154 | }; | |||
1155 | ||||
1156 | /// Create formatted StringError object. | |||
1157 | template <typename... Ts> | |||
1158 | Error createStringError(std::error_code EC, char const *Fmt, | |||
1159 | const Ts &... Vals) { | |||
1160 | std::string Buffer; | |||
1161 | raw_string_ostream Stream(Buffer); | |||
1162 | Stream << format(Fmt, Vals...); | |||
1163 | return make_error<StringError>(Stream.str(), EC); | |||
1164 | } | |||
1165 | ||||
1166 | Error createStringError(std::error_code EC, char const *Msg); | |||
1167 | ||||
1168 | /// This class wraps a filename and another Error. | |||
1169 | /// | |||
1170 | /// In some cases, an error needs to live along a 'source' name, in order to | |||
1171 | /// show more detailed information to the user. | |||
1172 | class FileError final : public ErrorInfo<FileError> { | |||
1173 | ||||
1174 | friend Error createFileError(std::string, Error); | |||
1175 | ||||
1176 | public: | |||
1177 | void log(raw_ostream &OS) const override { | |||
1178 | assert(Err && !FileName.empty() && "Trying to log after takeError().")((Err && !FileName.empty() && "Trying to log after takeError()." ) ? static_cast<void> (0) : __assert_fail ("Err && !FileName.empty() && \"Trying to log after takeError().\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 1178, __PRETTY_FUNCTION__)); | |||
1179 | OS << "'" << FileName << "': "; | |||
1180 | Err->log(OS); | |||
1181 | } | |||
1182 | ||||
1183 | Error takeError() { return Error(std::move(Err)); } | |||
1184 | ||||
1185 | std::error_code convertToErrorCode() const override; | |||
1186 | ||||
1187 | // Used by ErrorInfo::classID. | |||
1188 | static char ID; | |||
1189 | ||||
1190 | private: | |||
1191 | FileError(std::string F, std::unique_ptr<ErrorInfoBase> E) { | |||
1192 | assert(E && "Cannot create FileError from Error success value.")((E && "Cannot create FileError from Error success value." ) ? static_cast<void> (0) : __assert_fail ("E && \"Cannot create FileError from Error success value.\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 1192, __PRETTY_FUNCTION__)); | |||
1193 | assert(!F.empty() &&((!F.empty() && "The file name provided to FileError must not be empty." ) ? static_cast<void> (0) : __assert_fail ("!F.empty() && \"The file name provided to FileError must not be empty.\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 1194, __PRETTY_FUNCTION__)) | |||
1194 | "The file name provided to FileError must not be empty.")((!F.empty() && "The file name provided to FileError must not be empty." ) ? static_cast<void> (0) : __assert_fail ("!F.empty() && \"The file name provided to FileError must not be empty.\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 1194, __PRETTY_FUNCTION__)); | |||
1195 | FileName = F; | |||
1196 | Err = std::move(E); | |||
1197 | } | |||
1198 | ||||
1199 | static Error build(std::string F, Error E) { | |||
1200 | return Error(std::unique_ptr<FileError>(new FileError(F, E.takePayload()))); | |||
1201 | } | |||
1202 | ||||
1203 | std::string FileName; | |||
1204 | std::unique_ptr<ErrorInfoBase> Err; | |||
1205 | }; | |||
1206 | ||||
1207 | /// Concatenate a source file path and/or name with an Error. The resulting | |||
1208 | /// Error is unchecked. | |||
1209 | inline Error createFileError(std::string F, Error E) { | |||
1210 | return FileError::build(F, std::move(E)); | |||
1211 | } | |||
1212 | ||||
1213 | Error createFileError(std::string F, ErrorSuccess) = delete; | |||
1214 | ||||
1215 | /// Helper for check-and-exit error handling. | |||
1216 | /// | |||
1217 | /// For tool use only. NOT FOR USE IN LIBRARY CODE. | |||
1218 | /// | |||
1219 | class ExitOnError { | |||
1220 | public: | |||
1221 | /// Create an error on exit helper. | |||
1222 | ExitOnError(std::string Banner = "", int DefaultErrorExitCode = 1) | |||
1223 | : Banner(std::move(Banner)), | |||
1224 | GetExitCode([=](const Error &) { return DefaultErrorExitCode; }) {} | |||
1225 | ||||
1226 | /// Set the banner string for any errors caught by operator(). | |||
1227 | void setBanner(std::string Banner) { this->Banner = std::move(Banner); } | |||
1228 | ||||
1229 | /// Set the exit-code mapper function. | |||
1230 | void setExitCodeMapper(std::function<int(const Error &)> GetExitCode) { | |||
1231 | this->GetExitCode = std::move(GetExitCode); | |||
1232 | } | |||
1233 | ||||
1234 | /// Check Err. If it's in a failure state log the error(s) and exit. | |||
1235 | void operator()(Error Err) const { checkError(std::move(Err)); } | |||
1236 | ||||
1237 | /// Check E. If it's in a success state then return the contained value. If | |||
1238 | /// it's in a failure state log the error(s) and exit. | |||
1239 | template <typename T> T operator()(Expected<T> &&E) const { | |||
1240 | checkError(E.takeError()); | |||
1241 | return std::move(*E); | |||
1242 | } | |||
1243 | ||||
1244 | /// Check E. If it's in a success state then return the contained reference. If | |||
1245 | /// it's in a failure state log the error(s) and exit. | |||
1246 | template <typename T> T& operator()(Expected<T&> &&E) const { | |||
1247 | checkError(E.takeError()); | |||
1248 | return *E; | |||
1249 | } | |||
1250 | ||||
1251 | private: | |||
1252 | void checkError(Error Err) const { | |||
1253 | if (Err) { | |||
1254 | int ExitCode = GetExitCode(Err); | |||
1255 | logAllUnhandledErrors(std::move(Err), errs(), Banner); | |||
1256 | exit(ExitCode); | |||
1257 | } | |||
1258 | } | |||
1259 | ||||
1260 | std::string Banner; | |||
1261 | std::function<int(const Error &)> GetExitCode; | |||
1262 | }; | |||
1263 | ||||
1264 | /// Conversion from Error to LLVMErrorRef for C error bindings. | |||
1265 | inline LLVMErrorRef wrap(Error Err) { | |||
1266 | return reinterpret_cast<LLVMErrorRef>(Err.takePayload().release()); | |||
1267 | } | |||
1268 | ||||
1269 | /// Conversion from LLVMErrorRef to Error for C error bindings. | |||
1270 | inline Error unwrap(LLVMErrorRef ErrRef) { | |||
1271 | return Error(std::unique_ptr<ErrorInfoBase>( | |||
1272 | reinterpret_cast<ErrorInfoBase *>(ErrRef))); | |||
1273 | } | |||
1274 | ||||
1275 | } // end namespace llvm | |||
1276 | ||||
1277 | #endif // LLVM_SUPPORT_ERROR_H |
1 | //===- llvm/ADT/STLExtras.h - Useful STL related functions ------*- C++ -*-===// |
2 | // |
3 | // The LLVM Compiler Infrastructure |
4 | // |
5 | // This file is distributed under the University of Illinois Open Source |
6 | // License. See LICENSE.TXT for details. |
7 | // |
8 | //===----------------------------------------------------------------------===// |
9 | // |
10 | // This file contains some templates that are useful if you are working with the |
11 | // STL at all. |
12 | // |
13 | // No library is required when using these functions. |
14 | // |
15 | //===----------------------------------------------------------------------===// |
16 | |
17 | #ifndef LLVM_ADT_STLEXTRAS_H |
18 | #define LLVM_ADT_STLEXTRAS_H |
19 | |
20 | #include "llvm/ADT/Optional.h" |
21 | #include "llvm/ADT/SmallVector.h" |
22 | #include "llvm/ADT/iterator.h" |
23 | #include "llvm/ADT/iterator_range.h" |
24 | #include "llvm/Config/abi-breaking.h" |
25 | #include "llvm/Support/ErrorHandling.h" |
26 | #include <algorithm> |
27 | #include <cassert> |
28 | #include <cstddef> |
29 | #include <cstdint> |
30 | #include <cstdlib> |
31 | #include <functional> |
32 | #include <initializer_list> |
33 | #include <iterator> |
34 | #include <limits> |
35 | #include <memory> |
36 | #include <tuple> |
37 | #include <type_traits> |
38 | #include <utility> |
39 | |
40 | #ifdef EXPENSIVE_CHECKS |
41 | #include <random> // for std::mt19937 |
42 | #endif |
43 | |
44 | namespace llvm { |
45 | |
46 | // Only used by compiler if both template types are the same. Useful when |
47 | // using SFINAE to test for the existence of member functions. |
48 | template <typename T, T> struct SameType; |
49 | |
50 | namespace detail { |
51 | |
52 | template <typename RangeT> |
53 | using IterOfRange = decltype(std::begin(std::declval<RangeT &>())); |
54 | |
55 | template <typename RangeT> |
56 | using ValueOfRange = typename std::remove_reference<decltype( |
57 | *std::begin(std::declval<RangeT &>()))>::type; |
58 | |
59 | } // end namespace detail |
60 | |
61 | //===----------------------------------------------------------------------===// |
62 | // Extra additions to <type_traits> |
63 | //===----------------------------------------------------------------------===// |
64 | |
65 | template <typename T> |
66 | struct negation : std::integral_constant<bool, !bool(T::value)> {}; |
67 | |
68 | template <typename...> struct conjunction : std::true_type {}; |
69 | template <typename B1> struct conjunction<B1> : B1 {}; |
70 | template <typename B1, typename... Bn> |
71 | struct conjunction<B1, Bn...> |
72 | : std::conditional<bool(B1::value), conjunction<Bn...>, B1>::type {}; |
73 | |
74 | //===----------------------------------------------------------------------===// |
75 | // Extra additions to <functional> |
76 | //===----------------------------------------------------------------------===// |
77 | |
78 | template <class Ty> struct identity { |
79 | using argument_type = Ty; |
80 | |
81 | Ty &operator()(Ty &self) const { |
82 | return self; |
83 | } |
84 | const Ty &operator()(const Ty &self) const { |
85 | return self; |
86 | } |
87 | }; |
88 | |
89 | template <class Ty> struct less_ptr { |
90 | bool operator()(const Ty* left, const Ty* right) const { |
91 | return *left < *right; |
92 | } |
93 | }; |
94 | |
95 | template <class Ty> struct greater_ptr { |
96 | bool operator()(const Ty* left, const Ty* right) const { |
97 | return *right < *left; |
98 | } |
99 | }; |
100 | |
101 | /// An efficient, type-erasing, non-owning reference to a callable. This is |
102 | /// intended for use as the type of a function parameter that is not used |
103 | /// after the function in question returns. |
104 | /// |
105 | /// This class does not own the callable, so it is not in general safe to store |
106 | /// a function_ref. |
107 | template<typename Fn> class function_ref; |
108 | |
109 | template<typename Ret, typename ...Params> |
110 | class function_ref<Ret(Params...)> { |
111 | Ret (*callback)(intptr_t callable, Params ...params) = nullptr; |
112 | intptr_t callable; |
113 | |
114 | template<typename Callable> |
115 | static Ret callback_fn(intptr_t callable, Params ...params) { |
116 | return (*reinterpret_cast<Callable*>(callable))( |
117 | std::forward<Params>(params)...); |
118 | } |
119 | |
120 | public: |
121 | function_ref() = default; |
122 | function_ref(std::nullptr_t) {} |
123 | |
124 | template <typename Callable> |
125 | function_ref(Callable &&callable, |
126 | typename std::enable_if< |
127 | !std::is_same<typename std::remove_reference<Callable>::type, |
128 | function_ref>::value>::type * = nullptr) |
129 | : callback(callback_fn<typename std::remove_reference<Callable>::type>), |
130 | callable(reinterpret_cast<intptr_t>(&callable)) {} |
131 | |
132 | Ret operator()(Params ...params) const { |
133 | return callback(callable, std::forward<Params>(params)...); |
134 | } |
135 | |
136 | operator bool() const { return callback; } |
137 | }; |
138 | |
139 | // deleter - Very very very simple method that is used to invoke operator |
140 | // delete on something. It is used like this: |
141 | // |
142 | // for_each(V.begin(), B.end(), deleter<Interval>); |
143 | template <class T> |
144 | inline void deleter(T *Ptr) { |
145 | delete Ptr; |
146 | } |
147 | |
148 | //===----------------------------------------------------------------------===// |
149 | // Extra additions to <iterator> |
150 | //===----------------------------------------------------------------------===// |
151 | |
152 | namespace adl_detail { |
153 | |
154 | using std::begin; |
155 | |
156 | template <typename ContainerTy> |
157 | auto adl_begin(ContainerTy &&container) |
158 | -> decltype(begin(std::forward<ContainerTy>(container))) { |
159 | return begin(std::forward<ContainerTy>(container)); |
160 | } |
161 | |
162 | using std::end; |
163 | |
164 | template <typename ContainerTy> |
165 | auto adl_end(ContainerTy &&container) |
166 | -> decltype(end(std::forward<ContainerTy>(container))) { |
167 | return end(std::forward<ContainerTy>(container)); |
168 | } |
169 | |
170 | using std::swap; |
171 | |
172 | template <typename T> |
173 | void adl_swap(T &&lhs, T &&rhs) noexcept(noexcept(swap(std::declval<T>(), |
174 | std::declval<T>()))) { |
175 | swap(std::forward<T>(lhs), std::forward<T>(rhs)); |
176 | } |
177 | |
178 | } // end namespace adl_detail |
179 | |
180 | template <typename ContainerTy> |
181 | auto adl_begin(ContainerTy &&container) |
182 | -> decltype(adl_detail::adl_begin(std::forward<ContainerTy>(container))) { |
183 | return adl_detail::adl_begin(std::forward<ContainerTy>(container)); |
184 | } |
185 | |
186 | template <typename ContainerTy> |
187 | auto adl_end(ContainerTy &&container) |
188 | -> decltype(adl_detail::adl_end(std::forward<ContainerTy>(container))) { |
189 | return adl_detail::adl_end(std::forward<ContainerTy>(container)); |
190 | } |
191 | |
192 | template <typename T> |
193 | void adl_swap(T &&lhs, T &&rhs) noexcept( |
194 | noexcept(adl_detail::adl_swap(std::declval<T>(), std::declval<T>()))) { |
195 | adl_detail::adl_swap(std::forward<T>(lhs), std::forward<T>(rhs)); |
196 | } |
197 | |
198 | // mapped_iterator - This is a simple iterator adapter that causes a function to |
199 | // be applied whenever operator* is invoked on the iterator. |
200 | |
201 | template <typename ItTy, typename FuncTy, |
202 | typename FuncReturnTy = |
203 | decltype(std::declval<FuncTy>()(*std::declval<ItTy>()))> |
204 | class mapped_iterator |
205 | : public iterator_adaptor_base< |
206 | mapped_iterator<ItTy, FuncTy>, ItTy, |
207 | typename std::iterator_traits<ItTy>::iterator_category, |
208 | typename std::remove_reference<FuncReturnTy>::type> { |
209 | public: |
210 | mapped_iterator(ItTy U, FuncTy F) |
211 | : mapped_iterator::iterator_adaptor_base(std::move(U)), F(std::move(F)) {} |
212 | |
213 | ItTy getCurrent() { return this->I; } |
214 | |
215 | FuncReturnTy operator*() { return F(*this->I); } |
216 | |
217 | private: |
218 | FuncTy F; |
219 | }; |
220 | |
221 | // map_iterator - Provide a convenient way to create mapped_iterators, just like |
222 | // make_pair is useful for creating pairs... |
223 | template <class ItTy, class FuncTy> |
224 | inline mapped_iterator<ItTy, FuncTy> map_iterator(ItTy I, FuncTy F) { |
225 | return mapped_iterator<ItTy, FuncTy>(std::move(I), std::move(F)); |
226 | } |
227 | |
228 | /// Helper to determine if type T has a member called rbegin(). |
229 | template <typename Ty> class has_rbegin_impl { |
230 | using yes = char[1]; |
231 | using no = char[2]; |
232 | |
233 | template <typename Inner> |
234 | static yes& test(Inner *I, decltype(I->rbegin()) * = nullptr); |
235 | |
236 | template <typename> |
237 | static no& test(...); |
238 | |
239 | public: |
240 | static const bool value = sizeof(test<Ty>(nullptr)) == sizeof(yes); |
241 | }; |
242 | |
243 | /// Metafunction to determine if T& or T has a member called rbegin(). |
244 | template <typename Ty> |
245 | struct has_rbegin : has_rbegin_impl<typename std::remove_reference<Ty>::type> { |
246 | }; |
247 | |
248 | // Returns an iterator_range over the given container which iterates in reverse. |
249 | // Note that the container must have rbegin()/rend() methods for this to work. |
250 | template <typename ContainerTy> |
251 | auto reverse(ContainerTy &&C, |
252 | typename std::enable_if<has_rbegin<ContainerTy>::value>::type * = |
253 | nullptr) -> decltype(make_range(C.rbegin(), C.rend())) { |
254 | return make_range(C.rbegin(), C.rend()); |
255 | } |
256 | |
257 | // Returns a std::reverse_iterator wrapped around the given iterator. |
258 | template <typename IteratorTy> |
259 | std::reverse_iterator<IteratorTy> make_reverse_iterator(IteratorTy It) { |
260 | return std::reverse_iterator<IteratorTy>(It); |
261 | } |
262 | |
263 | // Returns an iterator_range over the given container which iterates in reverse. |
264 | // Note that the container must have begin()/end() methods which return |
265 | // bidirectional iterators for this to work. |
266 | template <typename ContainerTy> |
267 | auto reverse( |
268 | ContainerTy &&C, |
269 | typename std::enable_if<!has_rbegin<ContainerTy>::value>::type * = nullptr) |
270 | -> decltype(make_range(llvm::make_reverse_iterator(std::end(C)), |
271 | llvm::make_reverse_iterator(std::begin(C)))) { |
272 | return make_range(llvm::make_reverse_iterator(std::end(C)), |
273 | llvm::make_reverse_iterator(std::begin(C))); |
274 | } |
275 | |
276 | /// An iterator adaptor that filters the elements of given inner iterators. |
277 | /// |
278 | /// The predicate parameter should be a callable object that accepts the wrapped |
279 | /// iterator's reference type and returns a bool. When incrementing or |
280 | /// decrementing the iterator, it will call the predicate on each element and |
281 | /// skip any where it returns false. |
282 | /// |
283 | /// \code |
284 | /// int A[] = { 1, 2, 3, 4 }; |
285 | /// auto R = make_filter_range(A, [](int N) { return N % 2 == 1; }); |
286 | /// // R contains { 1, 3 }. |
287 | /// \endcode |
288 | /// |
289 | /// Note: filter_iterator_base implements support for forward iteration. |
290 | /// filter_iterator_impl exists to provide support for bidirectional iteration, |
291 | /// conditional on whether the wrapped iterator supports it. |
292 | template <typename WrappedIteratorT, typename PredicateT, typename IterTag> |
293 | class filter_iterator_base |
294 | : public iterator_adaptor_base< |
295 | filter_iterator_base<WrappedIteratorT, PredicateT, IterTag>, |
296 | WrappedIteratorT, |
297 | typename std::common_type< |
298 | IterTag, typename std::iterator_traits< |
299 | WrappedIteratorT>::iterator_category>::type> { |
300 | using BaseT = iterator_adaptor_base< |
301 | filter_iterator_base<WrappedIteratorT, PredicateT, IterTag>, |
302 | WrappedIteratorT, |
303 | typename std::common_type< |
304 | IterTag, typename std::iterator_traits< |
305 | WrappedIteratorT>::iterator_category>::type>; |
306 | |
307 | protected: |
308 | WrappedIteratorT End; |
309 | PredicateT Pred; |
310 | |
311 | void findNextValid() { |
312 | while (this->I != End && !Pred(*this->I)) |
313 | BaseT::operator++(); |
314 | } |
315 | |
316 | // Construct the iterator. The begin iterator needs to know where the end |
317 | // is, so that it can properly stop when it gets there. The end iterator only |
318 | // needs the predicate to support bidirectional iteration. |
319 | filter_iterator_base(WrappedIteratorT Begin, WrappedIteratorT End, |
320 | PredicateT Pred) |
321 | : BaseT(Begin), End(End), Pred(Pred) { |
322 | findNextValid(); |
323 | } |
324 | |
325 | public: |
326 | using BaseT::operator++; |
327 | |
328 | filter_iterator_base &operator++() { |
329 | BaseT::operator++(); |
330 | findNextValid(); |
331 | return *this; |
332 | } |
333 | }; |
334 | |
335 | /// Specialization of filter_iterator_base for forward iteration only. |
336 | template <typename WrappedIteratorT, typename PredicateT, |
337 | typename IterTag = std::forward_iterator_tag> |
338 | class filter_iterator_impl |
339 | : public filter_iterator_base<WrappedIteratorT, PredicateT, IterTag> { |
340 | using BaseT = filter_iterator_base<WrappedIteratorT, PredicateT, IterTag>; |
341 | |
342 | public: |
343 | filter_iterator_impl(WrappedIteratorT Begin, WrappedIteratorT End, |
344 | PredicateT Pred) |
345 | : BaseT(Begin, End, Pred) {} |
346 | }; |
347 | |
348 | /// Specialization of filter_iterator_base for bidirectional iteration. |
349 | template <typename WrappedIteratorT, typename PredicateT> |
350 | class filter_iterator_impl<WrappedIteratorT, PredicateT, |
351 | std::bidirectional_iterator_tag> |
352 | : public filter_iterator_base<WrappedIteratorT, PredicateT, |
353 | std::bidirectional_iterator_tag> { |
354 | using BaseT = filter_iterator_base<WrappedIteratorT, PredicateT, |
355 | std::bidirectional_iterator_tag>; |
356 | void findPrevValid() { |
357 | while (!this->Pred(*this->I)) |
358 | BaseT::operator--(); |
359 | } |
360 | |
361 | public: |
362 | using BaseT::operator--; |
363 | |
364 | filter_iterator_impl(WrappedIteratorT Begin, WrappedIteratorT End, |
365 | PredicateT Pred) |
366 | : BaseT(Begin, End, Pred) {} |
367 | |
368 | filter_iterator_impl &operator--() { |
369 | BaseT::operator--(); |
370 | findPrevValid(); |
371 | return *this; |
372 | } |
373 | }; |
374 | |
375 | namespace detail { |
376 | |
377 | template <bool is_bidirectional> struct fwd_or_bidi_tag_impl { |
378 | using type = std::forward_iterator_tag; |
379 | }; |
380 | |
381 | template <> struct fwd_or_bidi_tag_impl<true> { |
382 | using type = std::bidirectional_iterator_tag; |
383 | }; |
384 | |
385 | /// Helper which sets its type member to forward_iterator_tag if the category |
386 | /// of \p IterT does not derive from bidirectional_iterator_tag, and to |
387 | /// bidirectional_iterator_tag otherwise. |
388 | template <typename IterT> struct fwd_or_bidi_tag { |
389 | using type = typename fwd_or_bidi_tag_impl<std::is_base_of< |
390 | std::bidirectional_iterator_tag, |
391 | typename std::iterator_traits<IterT>::iterator_category>::value>::type; |
392 | }; |
393 | |
394 | } // namespace detail |
395 | |
396 | /// Defines filter_iterator to a suitable specialization of |
397 | /// filter_iterator_impl, based on the underlying iterator's category. |
398 | template <typename WrappedIteratorT, typename PredicateT> |
399 | using filter_iterator = filter_iterator_impl< |
400 | WrappedIteratorT, PredicateT, |
401 | typename detail::fwd_or_bidi_tag<WrappedIteratorT>::type>; |
402 | |
403 | /// Convenience function that takes a range of elements and a predicate, |
404 | /// and return a new filter_iterator range. |
405 | /// |
406 | /// FIXME: Currently if RangeT && is a rvalue reference to a temporary, the |
407 | /// lifetime of that temporary is not kept by the returned range object, and the |
408 | /// temporary is going to be dropped on the floor after the make_iterator_range |
409 | /// full expression that contains this function call. |
410 | template <typename RangeT, typename PredicateT> |
411 | iterator_range<filter_iterator<detail::IterOfRange<RangeT>, PredicateT>> |
412 | make_filter_range(RangeT &&Range, PredicateT Pred) { |
413 | using FilterIteratorT = |
414 | filter_iterator<detail::IterOfRange<RangeT>, PredicateT>; |
415 | return make_range( |
416 | FilterIteratorT(std::begin(std::forward<RangeT>(Range)), |
417 | std::end(std::forward<RangeT>(Range)), Pred), |
418 | FilterIteratorT(std::end(std::forward<RangeT>(Range)), |
419 | std::end(std::forward<RangeT>(Range)), Pred)); |
420 | } |
421 | |
422 | /// A pseudo-iterator adaptor that is designed to implement "early increment" |
423 | /// style loops. |
424 | /// |
425 | /// This is *not a normal iterator* and should almost never be used directly. It |
426 | /// is intended primarily to be used with range based for loops and some range |
427 | /// algorithms. |
428 | /// |
429 | /// The iterator isn't quite an `OutputIterator` or an `InputIterator` but |
430 | /// somewhere between them. The constraints of these iterators are: |
431 | /// |
432 | /// - On construction or after being incremented, it is comparable and |
433 | /// dereferencable. It is *not* incrementable. |
434 | /// - After being dereferenced, it is neither comparable nor dereferencable, it |
435 | /// is only incrementable. |
436 | /// |
437 | /// This means you can only dereference the iterator once, and you can only |
438 | /// increment it once between dereferences. |
439 | template <typename WrappedIteratorT> |
440 | class early_inc_iterator_impl |
441 | : public iterator_adaptor_base<early_inc_iterator_impl<WrappedIteratorT>, |
442 | WrappedIteratorT, std::input_iterator_tag> { |
443 | using BaseT = |
444 | iterator_adaptor_base<early_inc_iterator_impl<WrappedIteratorT>, |
445 | WrappedIteratorT, std::input_iterator_tag>; |
446 | |
447 | using PointerT = typename std::iterator_traits<WrappedIteratorT>::pointer; |
448 | |
449 | protected: |
450 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 |
451 | bool IsEarlyIncremented = false; |
452 | #endif |
453 | |
454 | public: |
455 | early_inc_iterator_impl(WrappedIteratorT I) : BaseT(I) {} |
456 | |
457 | using BaseT::operator*; |
458 | typename BaseT::reference operator*() { |
459 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 |
460 | assert(!IsEarlyIncremented && "Cannot dereference twice!")((!IsEarlyIncremented && "Cannot dereference twice!") ? static_cast<void> (0) : __assert_fail ("!IsEarlyIncremented && \"Cannot dereference twice!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/ADT/STLExtras.h" , 460, __PRETTY_FUNCTION__)); |
461 | IsEarlyIncremented = true; |
462 | #endif |
463 | return *(this->I)++; |
464 | } |
465 | |
466 | using BaseT::operator++; |
467 | early_inc_iterator_impl &operator++() { |
468 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 |
469 | assert(IsEarlyIncremented && "Cannot increment before dereferencing!")((IsEarlyIncremented && "Cannot increment before dereferencing!" ) ? static_cast<void> (0) : __assert_fail ("IsEarlyIncremented && \"Cannot increment before dereferencing!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/ADT/STLExtras.h" , 469, __PRETTY_FUNCTION__)); |
470 | IsEarlyIncremented = false; |
471 | #endif |
472 | return *this; |
473 | } |
474 | |
475 | using BaseT::operator==; |
476 | bool operator==(const early_inc_iterator_impl &RHS) const { |
477 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 |
478 | assert(!IsEarlyIncremented && "Cannot compare after dereferencing!")((!IsEarlyIncremented && "Cannot compare after dereferencing!" ) ? static_cast<void> (0) : __assert_fail ("!IsEarlyIncremented && \"Cannot compare after dereferencing!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/ADT/STLExtras.h" , 478, __PRETTY_FUNCTION__)); |
479 | #endif |
480 | return BaseT::operator==(RHS); |
481 | } |
482 | }; |
483 | |
484 | /// Make a range that does early increment to allow mutation of the underlying |
485 | /// range without disrupting iteration. |
486 | /// |
487 | /// The underlying iterator will be incremented immediately after it is |
488 | /// dereferenced, allowing deletion of the current node or insertion of nodes to |
489 | /// not disrupt iteration provided they do not invalidate the *next* iterator -- |
490 | /// the current iterator can be invalidated. |
491 | /// |
492 | /// This requires a very exact pattern of use that is only really suitable to |
493 | /// range based for loops and other range algorithms that explicitly guarantee |
494 | /// to dereference exactly once each element, and to increment exactly once each |
495 | /// element. |
496 | template <typename RangeT> |
497 | iterator_range<early_inc_iterator_impl<detail::IterOfRange<RangeT>>> |
498 | make_early_inc_range(RangeT &&Range) { |
499 | using EarlyIncIteratorT = |
500 | early_inc_iterator_impl<detail::IterOfRange<RangeT>>; |
501 | return make_range(EarlyIncIteratorT(std::begin(std::forward<RangeT>(Range))), |
502 | EarlyIncIteratorT(std::end(std::forward<RangeT>(Range)))); |
503 | } |
504 | |
505 | // forward declarations required by zip_shortest/zip_first |
506 | template <typename R, typename UnaryPredicate> |
507 | bool all_of(R &&range, UnaryPredicate P); |
508 | |
509 | template <size_t... I> struct index_sequence; |
510 | |
511 | template <class... Ts> struct index_sequence_for; |
512 | |
513 | namespace detail { |
514 | |
515 | using std::declval; |
516 | |
517 | // We have to alias this since inlining the actual type at the usage site |
518 | // in the parameter list of iterator_facade_base<> below ICEs MSVC 2017. |
519 | template<typename... Iters> struct ZipTupleType { |
520 | using type = std::tuple<decltype(*declval<Iters>())...>; |
521 | }; |
522 | |
523 | template <typename ZipType, typename... Iters> |
524 | using zip_traits = iterator_facade_base< |
525 | ZipType, typename std::common_type<std::bidirectional_iterator_tag, |
526 | typename std::iterator_traits< |
527 | Iters>::iterator_category...>::type, |
528 | // ^ TODO: Implement random access methods. |
529 | typename ZipTupleType<Iters...>::type, |
530 | typename std::iterator_traits<typename std::tuple_element< |
531 | 0, std::tuple<Iters...>>::type>::difference_type, |
532 | // ^ FIXME: This follows boost::make_zip_iterator's assumption that all |
533 | // inner iterators have the same difference_type. It would fail if, for |
534 | // instance, the second field's difference_type were non-numeric while the |
535 | // first is. |
536 | typename ZipTupleType<Iters...>::type *, |
537 | typename ZipTupleType<Iters...>::type>; |
538 | |
539 | template <typename ZipType, typename... Iters> |
540 | struct zip_common : public zip_traits<ZipType, Iters...> { |
541 | using Base = zip_traits<ZipType, Iters...>; |
542 | using value_type = typename Base::value_type; |
543 | |
544 | std::tuple<Iters...> iterators; |
545 | |
546 | protected: |
547 | template <size_t... Ns> value_type deref(index_sequence<Ns...>) const { |
548 | return value_type(*std::get<Ns>(iterators)...); |
549 | } |
550 | |
551 | template <size_t... Ns> |
552 | decltype(iterators) tup_inc(index_sequence<Ns...>) const { |
553 | return std::tuple<Iters...>(std::next(std::get<Ns>(iterators))...); |
554 | } |
555 | |
556 | template <size_t... Ns> |
557 | decltype(iterators) tup_dec(index_sequence<Ns...>) const { |
558 | return std::tuple<Iters...>(std::prev(std::get<Ns>(iterators))...); |
559 | } |
560 | |
561 | public: |
562 | zip_common(Iters &&... ts) : iterators(std::forward<Iters>(ts)...) {} |
563 | |
564 | value_type operator*() { return deref(index_sequence_for<Iters...>{}); } |
565 | |
566 | const value_type operator*() const { |
567 | return deref(index_sequence_for<Iters...>{}); |
568 | } |
569 | |
570 | ZipType &operator++() { |
571 | iterators = tup_inc(index_sequence_for<Iters...>{}); |
572 | return *reinterpret_cast<ZipType *>(this); |
573 | } |
574 | |
575 | ZipType &operator--() { |
576 | static_assert(Base::IsBidirectional, |
577 | "All inner iterators must be at least bidirectional."); |
578 | iterators = tup_dec(index_sequence_for<Iters...>{}); |
579 | return *reinterpret_cast<ZipType *>(this); |
580 | } |
581 | }; |
582 | |
583 | template <typename... Iters> |
584 | struct zip_first : public zip_common<zip_first<Iters...>, Iters...> { |
585 | using Base = zip_common<zip_first<Iters...>, Iters...>; |
586 | |
587 | bool operator==(const zip_first<Iters...> &other) const { |
588 | return std::get<0>(this->iterators) == std::get<0>(other.iterators); |
589 | } |
590 | |
591 | zip_first(Iters &&... ts) : Base(std::forward<Iters>(ts)...) {} |
592 | }; |
593 | |
594 | template <typename... Iters> |
595 | class zip_shortest : public zip_common<zip_shortest<Iters...>, Iters...> { |
596 | template <size_t... Ns> |
597 | bool test(const zip_shortest<Iters...> &other, index_sequence<Ns...>) const { |
598 | return all_of(std::initializer_list<bool>{std::get<Ns>(this->iterators) != |
599 | std::get<Ns>(other.iterators)...}, |
600 | identity<bool>{}); |
601 | } |
602 | |
603 | public: |
604 | using Base = zip_common<zip_shortest<Iters...>, Iters...>; |
605 | |
606 | zip_shortest(Iters &&... ts) : Base(std::forward<Iters>(ts)...) {} |
607 | |
608 | bool operator==(const zip_shortest<Iters...> &other) const { |
609 | return !test(other, index_sequence_for<Iters...>{}); |
610 | } |
611 | }; |
612 | |
613 | template <template <typename...> class ItType, typename... Args> class zippy { |
614 | public: |
615 | using iterator = ItType<decltype(std::begin(std::declval<Args>()))...>; |
616 | using iterator_category = typename iterator::iterator_category; |
617 | using value_type = typename iterator::value_type; |
618 | using difference_type = typename iterator::difference_type; |
619 | using pointer = typename iterator::pointer; |
620 | using reference = typename iterator::reference; |
621 | |
622 | private: |
623 | std::tuple<Args...> ts; |
624 | |
625 | template <size_t... Ns> iterator begin_impl(index_sequence<Ns...>) const { |
626 | return iterator(std::begin(std::get<Ns>(ts))...); |
627 | } |
628 | template <size_t... Ns> iterator end_impl(index_sequence<Ns...>) const { |
629 | return iterator(std::end(std::get<Ns>(ts))...); |
630 | } |
631 | |
632 | public: |
633 | zippy(Args &&... ts_) : ts(std::forward<Args>(ts_)...) {} |
634 | |
635 | iterator begin() const { return begin_impl(index_sequence_for<Args...>{}); } |
636 | iterator end() const { return end_impl(index_sequence_for<Args...>{}); } |
637 | }; |
638 | |
639 | } // end namespace detail |
640 | |
641 | /// zip iterator for two or more iteratable types. |
642 | template <typename T, typename U, typename... Args> |
643 | detail::zippy<detail::zip_shortest, T, U, Args...> zip(T &&t, U &&u, |
644 | Args &&... args) { |
645 | return detail::zippy<detail::zip_shortest, T, U, Args...>( |
646 | std::forward<T>(t), std::forward<U>(u), std::forward<Args>(args)...); |
647 | } |
648 | |
649 | /// zip iterator that, for the sake of efficiency, assumes the first iteratee to |
650 | /// be the shortest. |
651 | template <typename T, typename U, typename... Args> |
652 | detail::zippy<detail::zip_first, T, U, Args...> zip_first(T &&t, U &&u, |
653 | Args &&... args) { |
654 | return detail::zippy<detail::zip_first, T, U, Args...>( |
655 | std::forward<T>(t), std::forward<U>(u), std::forward<Args>(args)...); |
656 | } |
657 | |
658 | /// Iterator wrapper that concatenates sequences together. |
659 | /// |
660 | /// This can concatenate different iterators, even with different types, into |
661 | /// a single iterator provided the value types of all the concatenated |
662 | /// iterators expose `reference` and `pointer` types that can be converted to |
663 | /// `ValueT &` and `ValueT *` respectively. It doesn't support more |
664 | /// interesting/customized pointer or reference types. |
665 | /// |
666 | /// Currently this only supports forward or higher iterator categories as |
667 | /// inputs and always exposes a forward iterator interface. |
668 | template <typename ValueT, typename... IterTs> |
669 | class concat_iterator |
670 | : public iterator_facade_base<concat_iterator<ValueT, IterTs...>, |
671 | std::forward_iterator_tag, ValueT> { |
672 | using BaseT = typename concat_iterator::iterator_facade_base; |
673 | |
674 | /// We store both the current and end iterators for each concatenated |
675 | /// sequence in a tuple of pairs. |
676 | /// |
677 | /// Note that something like iterator_range seems nice at first here, but the |
678 | /// range properties are of little benefit and end up getting in the way |
679 | /// because we need to do mutation on the current iterators. |
680 | std::tuple<IterTs...> Begins; |
681 | std::tuple<IterTs...> Ends; |
682 | |
683 | /// Attempts to increment a specific iterator. |
684 | /// |
685 | /// Returns true if it was able to increment the iterator. Returns false if |
686 | /// the iterator is already at the end iterator. |
687 | template <size_t Index> bool incrementHelper() { |
688 | auto &Begin = std::get<Index>(Begins); |
689 | auto &End = std::get<Index>(Ends); |
690 | if (Begin == End) |
691 | return false; |
692 | |
693 | ++Begin; |
694 | return true; |
695 | } |
696 | |
697 | /// Increments the first non-end iterator. |
698 | /// |
699 | /// It is an error to call this with all iterators at the end. |
700 | template <size_t... Ns> void increment(index_sequence<Ns...>) { |
701 | // Build a sequence of functions to increment each iterator if possible. |
702 | bool (concat_iterator::*IncrementHelperFns[])() = { |
703 | &concat_iterator::incrementHelper<Ns>...}; |
704 | |
705 | // Loop over them, and stop as soon as we succeed at incrementing one. |
706 | for (auto &IncrementHelperFn : IncrementHelperFns) |
707 | if ((this->*IncrementHelperFn)()) |
708 | return; |
709 | |
710 | llvm_unreachable("Attempted to increment an end concat iterator!")::llvm::llvm_unreachable_internal("Attempted to increment an end concat iterator!" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/ADT/STLExtras.h" , 710); |
711 | } |
712 | |
713 | /// Returns null if the specified iterator is at the end. Otherwise, |
714 | /// dereferences the iterator and returns the address of the resulting |
715 | /// reference. |
716 | template <size_t Index> ValueT *getHelper() const { |
717 | auto &Begin = std::get<Index>(Begins); |
718 | auto &End = std::get<Index>(Ends); |
719 | if (Begin == End) |
720 | return nullptr; |
721 | |
722 | return &*Begin; |
723 | } |
724 | |
725 | /// Finds the first non-end iterator, dereferences, and returns the resulting |
726 | /// reference. |
727 | /// |
728 | /// It is an error to call this with all iterators at the end. |
729 | template <size_t... Ns> ValueT &get(index_sequence<Ns...>) const { |
730 | // Build a sequence of functions to get from iterator if possible. |
731 | ValueT *(concat_iterator::*GetHelperFns[])() const = { |
732 | &concat_iterator::getHelper<Ns>...}; |
733 | |
734 | // Loop over them, and return the first result we find. |
735 | for (auto &GetHelperFn : GetHelperFns) |
736 | if (ValueT *P = (this->*GetHelperFn)()) |
737 | return *P; |
738 | |
739 | llvm_unreachable("Attempted to get a pointer from an end concat iterator!")::llvm::llvm_unreachable_internal("Attempted to get a pointer from an end concat iterator!" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/ADT/STLExtras.h" , 739); |
740 | } |
741 | |
742 | public: |
743 | /// Constructs an iterator from a squence of ranges. |
744 | /// |
745 | /// We need the full range to know how to switch between each of the |
746 | /// iterators. |
747 | template <typename... RangeTs> |
748 | explicit concat_iterator(RangeTs &&... Ranges) |
749 | : Begins(std::begin(Ranges)...), Ends(std::end(Ranges)...) {} |
750 | |
751 | using BaseT::operator++; |
752 | |
753 | concat_iterator &operator++() { |
754 | increment(index_sequence_for<IterTs...>()); |
755 | return *this; |
756 | } |
757 | |
758 | ValueT &operator*() const { return get(index_sequence_for<IterTs...>()); } |
759 | |
760 | bool operator==(const concat_iterator &RHS) const { |
761 | return Begins == RHS.Begins && Ends == RHS.Ends; |
762 | } |
763 | }; |
764 | |
765 | namespace detail { |
766 | |
767 | /// Helper to store a sequence of ranges being concatenated and access them. |
768 | /// |
769 | /// This is designed to facilitate providing actual storage when temporaries |
770 | /// are passed into the constructor such that we can use it as part of range |
771 | /// based for loops. |
772 | template <typename ValueT, typename... RangeTs> class concat_range { |
773 | public: |
774 | using iterator = |
775 | concat_iterator<ValueT, |
776 | decltype(std::begin(std::declval<RangeTs &>()))...>; |
777 | |
778 | private: |
779 | std::tuple<RangeTs...> Ranges; |
780 | |
781 | template <size_t... Ns> iterator begin_impl(index_sequence<Ns...>) { |
782 | return iterator(std::get<Ns>(Ranges)...); |
783 | } |
784 | template <size_t... Ns> iterator end_impl(index_sequence<Ns...>) { |
785 | return iterator(make_range(std::end(std::get<Ns>(Ranges)), |
786 | std::end(std::get<Ns>(Ranges)))...); |
787 | } |
788 | |
789 | public: |
790 | concat_range(RangeTs &&... Ranges) |
791 | : Ranges(std::forward<RangeTs>(Ranges)...) {} |
792 | |
793 | iterator begin() { return begin_impl(index_sequence_for<RangeTs...>{}); } |
794 | iterator end() { return end_impl(index_sequence_for<RangeTs...>{}); } |
795 | }; |
796 | |
797 | } // end namespace detail |
798 | |
799 | /// Concatenated range across two or more ranges. |
800 | /// |
801 | /// The desired value type must be explicitly specified. |
802 | template <typename ValueT, typename... RangeTs> |
803 | detail::concat_range<ValueT, RangeTs...> concat(RangeTs &&... Ranges) { |
804 | static_assert(sizeof...(RangeTs) > 1, |
805 | "Need more than one range to concatenate!"); |
806 | return detail::concat_range<ValueT, RangeTs...>( |
807 | std::forward<RangeTs>(Ranges)...); |
808 | } |
809 | |
810 | //===----------------------------------------------------------------------===// |
811 | // Extra additions to <utility> |
812 | //===----------------------------------------------------------------------===// |
813 | |
814 | /// Function object to check whether the first component of a std::pair |
815 | /// compares less than the first component of another std::pair. |
816 | struct less_first { |
817 | template <typename T> bool operator()(const T &lhs, const T &rhs) const { |
818 | return lhs.first < rhs.first; |
819 | } |
820 | }; |
821 | |
822 | /// Function object to check whether the second component of a std::pair |
823 | /// compares less than the second component of another std::pair. |
824 | struct less_second { |
825 | template <typename T> bool operator()(const T &lhs, const T &rhs) const { |
826 | return lhs.second < rhs.second; |
827 | } |
828 | }; |
829 | |
830 | /// \brief Function object to apply a binary function to the first component of |
831 | /// a std::pair. |
832 | template<typename FuncTy> |
833 | struct on_first { |
834 | FuncTy func; |
835 | |
836 | template <typename T> |
837 | auto operator()(const T &lhs, const T &rhs) const |
838 | -> decltype(func(lhs.first, rhs.first)) { |
839 | return func(lhs.first, rhs.first); |
840 | } |
841 | }; |
842 | |
843 | // A subset of N3658. More stuff can be added as-needed. |
844 | |
845 | /// Represents a compile-time sequence of integers. |
846 | template <class T, T... I> struct integer_sequence { |
847 | using value_type = T; |
848 | |
849 | static constexpr size_t size() { return sizeof...(I); } |
850 | }; |
851 | |
852 | /// Alias for the common case of a sequence of size_ts. |
853 | template <size_t... I> |
854 | struct index_sequence : integer_sequence<std::size_t, I...> {}; |
855 | |
856 | template <std::size_t N, std::size_t... I> |
857 | struct build_index_impl : build_index_impl<N - 1, N - 1, I...> {}; |
858 | template <std::size_t... I> |
859 | struct build_index_impl<0, I...> : index_sequence<I...> {}; |
860 | |
861 | /// Creates a compile-time integer sequence for a parameter pack. |
862 | template <class... Ts> |
863 | struct index_sequence_for : build_index_impl<sizeof...(Ts)> {}; |
864 | |
865 | /// Utility type to build an inheritance chain that makes it easy to rank |
866 | /// overload candidates. |
867 | template <int N> struct rank : rank<N - 1> {}; |
868 | template <> struct rank<0> {}; |
869 | |
870 | /// traits class for checking whether type T is one of any of the given |
871 | /// types in the variadic list. |
872 | template <typename T, typename... Ts> struct is_one_of { |
873 | static const bool value = false; |
874 | }; |
875 | |
876 | template <typename T, typename U, typename... Ts> |
877 | struct is_one_of<T, U, Ts...> { |
878 | static const bool value = |
879 | std::is_same<T, U>::value || is_one_of<T, Ts...>::value; |
880 | }; |
881 | |
882 | /// traits class for checking whether type T is a base class for all |
883 | /// the given types in the variadic list. |
884 | template <typename T, typename... Ts> struct are_base_of { |
885 | static const bool value = true; |
886 | }; |
887 | |
888 | template <typename T, typename U, typename... Ts> |
889 | struct are_base_of<T, U, Ts...> { |
890 | static const bool value = |
891 | std::is_base_of<T, U>::value && are_base_of<T, Ts...>::value; |
892 | }; |
893 | |
894 | //===----------------------------------------------------------------------===// |
895 | // Extra additions for arrays |
896 | //===----------------------------------------------------------------------===// |
897 | |
898 | /// Find the length of an array. |
899 | template <class T, std::size_t N> |
900 | constexpr inline size_t array_lengthof(T (&)[N]) { |
901 | return N; |
902 | } |
903 | |
904 | /// Adapt std::less<T> for array_pod_sort. |
905 | template<typename T> |
906 | inline int array_pod_sort_comparator(const void *P1, const void *P2) { |
907 | if (std::less<T>()(*reinterpret_cast<const T*>(P1), |
908 | *reinterpret_cast<const T*>(P2))) |
909 | return -1; |
910 | if (std::less<T>()(*reinterpret_cast<const T*>(P2), |
911 | *reinterpret_cast<const T*>(P1))) |
912 | return 1; |
913 | return 0; |
914 | } |
915 | |
916 | /// get_array_pod_sort_comparator - This is an internal helper function used to |
917 | /// get type deduction of T right. |
918 | template<typename T> |
919 | inline int (*get_array_pod_sort_comparator(const T &)) |
920 | (const void*, const void*) { |
921 | return array_pod_sort_comparator<T>; |
922 | } |
923 | |
924 | /// array_pod_sort - This sorts an array with the specified start and end |
925 | /// extent. This is just like std::sort, except that it calls qsort instead of |
926 | /// using an inlined template. qsort is slightly slower than std::sort, but |
927 | /// most sorts are not performance critical in LLVM and std::sort has to be |
928 | /// template instantiated for each type, leading to significant measured code |
929 | /// bloat. This function should generally be used instead of std::sort where |
930 | /// possible. |
931 | /// |
932 | /// This function assumes that you have simple POD-like types that can be |
933 | /// compared with std::less and can be moved with memcpy. If this isn't true, |
934 | /// you should use std::sort. |
935 | /// |
936 | /// NOTE: If qsort_r were portable, we could allow a custom comparator and |
937 | /// default to std::less. |
938 | template<class IteratorTy> |
939 | inline void array_pod_sort(IteratorTy Start, IteratorTy End) { |
940 | // Don't inefficiently call qsort with one element or trigger undefined |
941 | // behavior with an empty sequence. |
942 | auto NElts = End - Start; |
943 | if (NElts <= 1) return; |
944 | #ifdef EXPENSIVE_CHECKS |
945 | std::mt19937 Generator(std::random_device{}()); |
946 | std::shuffle(Start, End, Generator); |
947 | #endif |
948 | qsort(&*Start, NElts, sizeof(*Start), get_array_pod_sort_comparator(*Start)); |
949 | } |
950 | |
951 | template <class IteratorTy> |
952 | inline void array_pod_sort( |
953 | IteratorTy Start, IteratorTy End, |
954 | int (*Compare)( |
955 | const typename std::iterator_traits<IteratorTy>::value_type *, |
956 | const typename std::iterator_traits<IteratorTy>::value_type *)) { |
957 | // Don't inefficiently call qsort with one element or trigger undefined |
958 | // behavior with an empty sequence. |
959 | auto NElts = End - Start; |
960 | if (NElts <= 1) return; |
961 | #ifdef EXPENSIVE_CHECKS |
962 | std::mt19937 Generator(std::random_device{}()); |
963 | std::shuffle(Start, End, Generator); |
964 | #endif |
965 | qsort(&*Start, NElts, sizeof(*Start), |
966 | reinterpret_cast<int (*)(const void *, const void *)>(Compare)); |
967 | } |
968 | |
969 | // Provide wrappers to std::sort which shuffle the elements before sorting |
970 | // to help uncover non-deterministic behavior (PR35135). |
971 | template <typename IteratorTy> |
972 | inline void sort(IteratorTy Start, IteratorTy End) { |
973 | #ifdef EXPENSIVE_CHECKS |
974 | std::mt19937 Generator(std::random_device{}()); |
975 | std::shuffle(Start, End, Generator); |
976 | #endif |
977 | std::sort(Start, End); |
978 | } |
979 | |
980 | template <typename Container> inline void sort(Container &&C) { |
981 | llvm::sort(adl_begin(C), adl_end(C)); |
982 | } |
983 | |
984 | template <typename IteratorTy, typename Compare> |
985 | inline void sort(IteratorTy Start, IteratorTy End, Compare Comp) { |
986 | #ifdef EXPENSIVE_CHECKS |
987 | std::mt19937 Generator(std::random_device{}()); |
988 | std::shuffle(Start, End, Generator); |
989 | #endif |
990 | std::sort(Start, End, Comp); |
991 | } |
992 | |
993 | template <typename Container, typename Compare> |
994 | inline void sort(Container &&C, Compare Comp) { |
995 | llvm::sort(adl_begin(C), adl_end(C), Comp); |
996 | } |
997 | |
998 | //===----------------------------------------------------------------------===// |
999 | // Extra additions to <algorithm> |
1000 | //===----------------------------------------------------------------------===// |
1001 | |
1002 | /// For a container of pointers, deletes the pointers and then clears the |
1003 | /// container. |
1004 | template<typename Container> |
1005 | void DeleteContainerPointers(Container &C) { |
1006 | for (auto V : C) |
1007 | delete V; |
1008 | C.clear(); |
1009 | } |
1010 | |
1011 | /// In a container of pairs (usually a map) whose second element is a pointer, |
1012 | /// deletes the second elements and then clears the container. |
1013 | template<typename Container> |
1014 | void DeleteContainerSeconds(Container &C) { |
1015 | for (auto &V : C) |
1016 | delete V.second; |
1017 | C.clear(); |
1018 | } |
1019 | |
1020 | /// Get the size of a range. This is a wrapper function around std::distance |
1021 | /// which is only enabled when the operation is O(1). |
1022 | template <typename R> |
1023 | auto size(R &&Range, typename std::enable_if< |
1024 | std::is_same<typename std::iterator_traits<decltype( |
1025 | Range.begin())>::iterator_category, |
1026 | std::random_access_iterator_tag>::value, |
1027 | void>::type * = nullptr) |
1028 | -> decltype(std::distance(Range.begin(), Range.end())) { |
1029 | return std::distance(Range.begin(), Range.end()); |
1030 | } |
1031 | |
1032 | /// Provide wrappers to std::for_each which take ranges instead of having to |
1033 | /// pass begin/end explicitly. |
1034 | template <typename R, typename UnaryPredicate> |
1035 | UnaryPredicate for_each(R &&Range, UnaryPredicate P) { |
1036 | return std::for_each(adl_begin(Range), adl_end(Range), P); |
1037 | } |
1038 | |
1039 | /// Provide wrappers to std::all_of which take ranges instead of having to pass |
1040 | /// begin/end explicitly. |
1041 | template <typename R, typename UnaryPredicate> |
1042 | bool all_of(R &&Range, UnaryPredicate P) { |
1043 | return std::all_of(adl_begin(Range), adl_end(Range), P); |
1044 | } |
1045 | |
1046 | /// Provide wrappers to std::any_of which take ranges instead of having to pass |
1047 | /// begin/end explicitly. |
1048 | template <typename R, typename UnaryPredicate> |
1049 | bool any_of(R &&Range, UnaryPredicate P) { |
1050 | return std::any_of(adl_begin(Range), adl_end(Range), P); |
1051 | } |
1052 | |
1053 | /// Provide wrappers to std::none_of which take ranges instead of having to pass |
1054 | /// begin/end explicitly. |
1055 | template <typename R, typename UnaryPredicate> |
1056 | bool none_of(R &&Range, UnaryPredicate P) { |
1057 | return std::none_of(adl_begin(Range), adl_end(Range), P); |
1058 | } |
1059 | |
1060 | /// Provide wrappers to std::find which take ranges instead of having to pass |
1061 | /// begin/end explicitly. |
1062 | template <typename R, typename T> |
1063 | auto find(R &&Range, const T &Val) -> decltype(adl_begin(Range)) { |
1064 | return std::find(adl_begin(Range), adl_end(Range), Val); |
1065 | } |
1066 | |
1067 | /// Provide wrappers to std::find_if which take ranges instead of having to pass |
1068 | /// begin/end explicitly. |
1069 | template <typename R, typename UnaryPredicate> |
1070 | auto find_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { |
1071 | return std::find_if(adl_begin(Range), adl_end(Range), P); |
1072 | } |
1073 | |
1074 | template <typename R, typename UnaryPredicate> |
1075 | auto find_if_not(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { |
1076 | return std::find_if_not(adl_begin(Range), adl_end(Range), P); |
1077 | } |
1078 | |
1079 | /// Provide wrappers to std::remove_if which take ranges instead of having to |
1080 | /// pass begin/end explicitly. |
1081 | template <typename R, typename UnaryPredicate> |
1082 | auto remove_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { |
1083 | return std::remove_if(adl_begin(Range), adl_end(Range), P); |
1084 | } |
1085 | |
1086 | /// Provide wrappers to std::copy_if which take ranges instead of having to |
1087 | /// pass begin/end explicitly. |
1088 | template <typename R, typename OutputIt, typename UnaryPredicate> |
1089 | OutputIt copy_if(R &&Range, OutputIt Out, UnaryPredicate P) { |
1090 | return std::copy_if(adl_begin(Range), adl_end(Range), Out, P); |
1091 | } |
1092 | |
1093 | template <typename R, typename OutputIt> |
1094 | OutputIt copy(R &&Range, OutputIt Out) { |
1095 | return std::copy(adl_begin(Range), adl_end(Range), Out); |
1096 | } |
1097 | |
1098 | /// Wrapper function around std::find to detect if an element exists |
1099 | /// in a container. |
1100 | template <typename R, typename E> |
1101 | bool is_contained(R &&Range, const E &Element) { |
1102 | return std::find(adl_begin(Range), adl_end(Range), Element) != adl_end(Range); |
1103 | } |
1104 | |
1105 | /// Wrapper function around std::count to count the number of times an element |
1106 | /// \p Element occurs in the given range \p Range. |
1107 | template <typename R, typename E> |
1108 | auto count(R &&Range, const E &Element) -> |
1109 | typename std::iterator_traits<decltype(adl_begin(Range))>::difference_type { |
1110 | return std::count(adl_begin(Range), adl_end(Range), Element); |
1111 | } |
1112 | |
1113 | /// Wrapper function around std::count_if to count the number of times an |
1114 | /// element satisfying a given predicate occurs in a range. |
1115 | template <typename R, typename UnaryPredicate> |
1116 | auto count_if(R &&Range, UnaryPredicate P) -> |
1117 | typename std::iterator_traits<decltype(adl_begin(Range))>::difference_type { |
1118 | return std::count_if(adl_begin(Range), adl_end(Range), P); |
1119 | } |
1120 | |
1121 | /// Wrapper function around std::transform to apply a function to a range and |
1122 | /// store the result elsewhere. |
1123 | template <typename R, typename OutputIt, typename UnaryPredicate> |
1124 | OutputIt transform(R &&Range, OutputIt d_first, UnaryPredicate P) { |
1125 | return std::transform(adl_begin(Range), adl_end(Range), d_first, P); |
1126 | } |
1127 | |
1128 | /// Provide wrappers to std::partition which take ranges instead of having to |
1129 | /// pass begin/end explicitly. |
1130 | template <typename R, typename UnaryPredicate> |
1131 | auto partition(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { |
1132 | return std::partition(adl_begin(Range), adl_end(Range), P); |
1133 | } |
1134 | |
1135 | /// Provide wrappers to std::lower_bound which take ranges instead of having to |
1136 | /// pass begin/end explicitly. |
1137 | template <typename R, typename ForwardIt> |
1138 | auto lower_bound(R &&Range, ForwardIt I) -> decltype(adl_begin(Range)) { |
1139 | return std::lower_bound(adl_begin(Range), adl_end(Range), I); |
1140 | } |
1141 | |
1142 | template <typename R, typename ForwardIt, typename Compare> |
1143 | auto lower_bound(R &&Range, ForwardIt I, Compare C) |
1144 | -> decltype(adl_begin(Range)) { |
1145 | return std::lower_bound(adl_begin(Range), adl_end(Range), I, C); |
1146 | } |
1147 | |
1148 | /// Provide wrappers to std::upper_bound which take ranges instead of having to |
1149 | /// pass begin/end explicitly. |
1150 | template <typename R, typename ForwardIt> |
1151 | auto upper_bound(R &&Range, ForwardIt I) -> decltype(adl_begin(Range)) { |
1152 | return std::upper_bound(adl_begin(Range), adl_end(Range), I); |
1153 | } |
1154 | |
1155 | template <typename R, typename ForwardIt, typename Compare> |
1156 | auto upper_bound(R &&Range, ForwardIt I, Compare C) |
1157 | -> decltype(adl_begin(Range)) { |
1158 | return std::upper_bound(adl_begin(Range), adl_end(Range), I, C); |
1159 | } |
1160 | /// Wrapper function around std::equal to detect if all elements |
1161 | /// in a container are same. |
1162 | template <typename R> |
1163 | bool is_splat(R &&Range) { |
1164 | size_t range_size = size(Range); |
1165 | return range_size != 0 && (range_size == 1 || |
1166 | std::equal(adl_begin(Range) + 1, adl_end(Range), adl_begin(Range))); |
1167 | } |
1168 | |
1169 | /// Given a range of type R, iterate the entire range and return a |
1170 | /// SmallVector with elements of the vector. This is useful, for example, |
1171 | /// when you want to iterate a range and then sort the results. |
1172 | template <unsigned Size, typename R> |
1173 | SmallVector<typename std::remove_const<detail::ValueOfRange<R>>::type, Size> |
1174 | to_vector(R &&Range) { |
1175 | return {adl_begin(Range), adl_end(Range)}; |
1176 | } |
1177 | |
1178 | /// Provide a container algorithm similar to C++ Library Fundamentals v2's |
1179 | /// `erase_if` which is equivalent to: |
1180 | /// |
1181 | /// C.erase(remove_if(C, pred), C.end()); |
1182 | /// |
1183 | /// This version works for any container with an erase method call accepting |
1184 | /// two iterators. |
1185 | template <typename Container, typename UnaryPredicate> |
1186 | void erase_if(Container &C, UnaryPredicate P) { |
1187 | C.erase(remove_if(C, P), C.end()); |
1188 | } |
1189 | |
1190 | //===----------------------------------------------------------------------===// |
1191 | // Extra additions to <memory> |
1192 | //===----------------------------------------------------------------------===// |
1193 | |
1194 | // Implement make_unique according to N3656. |
1195 | |
1196 | /// Constructs a `new T()` with the given args and returns a |
1197 | /// `unique_ptr<T>` which owns the object. |
1198 | /// |
1199 | /// Example: |
1200 | /// |
1201 | /// auto p = make_unique<int>(); |
1202 | /// auto p = make_unique<std::tuple<int, int>>(0, 1); |
1203 | template <class T, class... Args> |
1204 | typename std::enable_if<!std::is_array<T>::value, std::unique_ptr<T>>::type |
1205 | make_unique(Args &&... args) { |
1206 | return std::unique_ptr<T>(new T(std::forward<Args>(args)...)); |
1207 | } |
1208 | |
1209 | /// Constructs a `new T[n]` with the given args and returns a |
1210 | /// `unique_ptr<T[]>` which owns the object. |
1211 | /// |
1212 | /// \param n size of the new array. |
1213 | /// |
1214 | /// Example: |
1215 | /// |
1216 | /// auto p = make_unique<int[]>(2); // value-initializes the array with 0's. |
1217 | template <class T> |
1218 | typename std::enable_if<std::is_array<T>::value && std::extent<T>::value == 0, |
1219 | std::unique_ptr<T>>::type |
1220 | make_unique(size_t n) { |
1221 | return std::unique_ptr<T>(new typename std::remove_extent<T>::type[n]()); |
1222 | } |
1223 | |
1224 | /// This function isn't used and is only here to provide better compile errors. |
1225 | template <class T, class... Args> |
1226 | typename std::enable_if<std::extent<T>::value != 0>::type |
1227 | make_unique(Args &&...) = delete; |
1228 | |
1229 | struct FreeDeleter { |
1230 | void operator()(void* v) { |
1231 | ::free(v); |
1232 | } |
1233 | }; |
1234 | |
1235 | template<typename First, typename Second> |
1236 | struct pair_hash { |
1237 | size_t operator()(const std::pair<First, Second> &P) const { |
1238 | return std::hash<First>()(P.first) * 31 + std::hash<Second>()(P.second); |
1239 | } |
1240 | }; |
1241 | |
1242 | /// A functor like C++14's std::less<void> in its absence. |
1243 | struct less { |
1244 | template <typename A, typename B> bool operator()(A &&a, B &&b) const { |
1245 | return std::forward<A>(a) < std::forward<B>(b); |
1246 | } |
1247 | }; |
1248 | |
1249 | /// A functor like C++14's std::equal<void> in its absence. |
1250 | struct equal { |
1251 | template <typename A, typename B> bool operator()(A &&a, B &&b) const { |
1252 | return std::forward<A>(a) == std::forward<B>(b); |
1253 | } |
1254 | }; |
1255 | |
1256 | /// Binary functor that adapts to any other binary functor after dereferencing |
1257 | /// operands. |
1258 | template <typename T> struct deref { |
1259 | T func; |
1260 | |
1261 | // Could be further improved to cope with non-derivable functors and |
1262 | // non-binary functors (should be a variadic template member function |
1263 | // operator()). |
1264 | template <typename A, typename B> |
1265 | auto operator()(A &lhs, B &rhs) const -> decltype(func(*lhs, *rhs)) { |
1266 | assert(lhs)((lhs) ? static_cast<void> (0) : __assert_fail ("lhs", "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/ADT/STLExtras.h" , 1266, __PRETTY_FUNCTION__)); |
1267 | assert(rhs)((rhs) ? static_cast<void> (0) : __assert_fail ("rhs", "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/ADT/STLExtras.h" , 1267, __PRETTY_FUNCTION__)); |
1268 | return func(*lhs, *rhs); |
1269 | } |
1270 | }; |
1271 | |
1272 | namespace detail { |
1273 | |
1274 | template <typename R> class enumerator_iter; |
1275 | |
1276 | template <typename R> struct result_pair { |
1277 | friend class enumerator_iter<R>; |
1278 | |
1279 | result_pair() = default; |
1280 | result_pair(std::size_t Index, IterOfRange<R> Iter) |
1281 | : Index(Index), Iter(Iter) {} |
1282 | |
1283 | result_pair<R> &operator=(const result_pair<R> &Other) { |
1284 | Index = Other.Index; |
1285 | Iter = Other.Iter; |
1286 | return *this; |
1287 | } |
1288 | |
1289 | std::size_t index() const { return Index; } |
1290 | const ValueOfRange<R> &value() const { return *Iter; } |
1291 | ValueOfRange<R> &value() { return *Iter; } |
1292 | |
1293 | private: |
1294 | std::size_t Index = std::numeric_limits<std::size_t>::max(); |
1295 | IterOfRange<R> Iter; |
1296 | }; |
1297 | |
1298 | template <typename R> |
1299 | class enumerator_iter |
1300 | : public iterator_facade_base< |
1301 | enumerator_iter<R>, std::forward_iterator_tag, result_pair<R>, |
1302 | typename std::iterator_traits<IterOfRange<R>>::difference_type, |
1303 | typename std::iterator_traits<IterOfRange<R>>::pointer, |
1304 | typename std::iterator_traits<IterOfRange<R>>::reference> { |
1305 | using result_type = result_pair<R>; |
1306 | |
1307 | public: |
1308 | explicit enumerator_iter(IterOfRange<R> EndIter) |
1309 | : Result(std::numeric_limits<size_t>::max(), EndIter) {} |
1310 | |
1311 | enumerator_iter(std::size_t Index, IterOfRange<R> Iter) |
1312 | : Result(Index, Iter) {} |
1313 | |
1314 | result_type &operator*() { return Result; } |
1315 | const result_type &operator*() const { return Result; } |
1316 | |
1317 | enumerator_iter<R> &operator++() { |
1318 | assert(Result.Index != std::numeric_limits<size_t>::max())((Result.Index != std::numeric_limits<size_t>::max()) ? static_cast<void> (0) : __assert_fail ("Result.Index != std::numeric_limits<size_t>::max()" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/ADT/STLExtras.h" , 1318, __PRETTY_FUNCTION__)); |
1319 | ++Result.Iter; |
1320 | ++Result.Index; |
1321 | return *this; |
1322 | } |
1323 | |
1324 | bool operator==(const enumerator_iter<R> &RHS) const { |
1325 | // Don't compare indices here, only iterators. It's possible for an end |
1326 | // iterator to have different indices depending on whether it was created |
1327 | // by calling std::end() versus incrementing a valid iterator. |
1328 | return Result.Iter == RHS.Result.Iter; |
1329 | } |
1330 | |
1331 | enumerator_iter<R> &operator=(const enumerator_iter<R> &Other) { |
1332 | Result = Other.Result; |
1333 | return *this; |
1334 | } |
1335 | |
1336 | private: |
1337 | result_type Result; |
1338 | }; |
1339 | |
1340 | template <typename R> class enumerator { |
1341 | public: |
1342 | explicit enumerator(R &&Range) : TheRange(std::forward<R>(Range)) {} |
1343 | |
1344 | enumerator_iter<R> begin() { |
1345 | return enumerator_iter<R>(0, std::begin(TheRange)); |
1346 | } |
1347 | |
1348 | enumerator_iter<R> end() { |
1349 | return enumerator_iter<R>(std::end(TheRange)); |
1350 | } |
1351 | |
1352 | private: |
1353 | R TheRange; |
1354 | }; |
1355 | |
1356 | } // end namespace detail |
1357 | |
1358 | /// Given an input range, returns a new range whose values are are pair (A,B) |
1359 | /// such that A is the 0-based index of the item in the sequence, and B is |
1360 | /// the value from the original sequence. Example: |
1361 | /// |
1362 | /// std::vector<char> Items = {'A', 'B', 'C', 'D'}; |
1363 | /// for (auto X : enumerate(Items)) { |
1364 | /// printf("Item %d - %c\n", X.index(), X.value()); |
1365 | /// } |
1366 | /// |
1367 | /// Output: |
1368 | /// Item 0 - A |
1369 | /// Item 1 - B |
1370 | /// Item 2 - C |
1371 | /// Item 3 - D |
1372 | /// |
1373 | template <typename R> detail::enumerator<R> enumerate(R &&TheRange) { |
1374 | return detail::enumerator<R>(std::forward<R>(TheRange)); |
1375 | } |
1376 | |
1377 | namespace detail { |
1378 | |
1379 | template <typename F, typename Tuple, std::size_t... I> |
1380 | auto apply_tuple_impl(F &&f, Tuple &&t, index_sequence<I...>) |
1381 | -> decltype(std::forward<F>(f)(std::get<I>(std::forward<Tuple>(t))...)) { |
1382 | return std::forward<F>(f)(std::get<I>(std::forward<Tuple>(t))...); |
1383 | } |
1384 | |
1385 | } // end namespace detail |
1386 | |
1387 | /// Given an input tuple (a1, a2, ..., an), pass the arguments of the |
1388 | /// tuple variadically to f as if by calling f(a1, a2, ..., an) and |
1389 | /// return the result. |
1390 | template <typename F, typename Tuple> |
1391 | auto apply_tuple(F &&f, Tuple &&t) -> decltype(detail::apply_tuple_impl( |
1392 | std::forward<F>(f), std::forward<Tuple>(t), |
1393 | build_index_impl< |
1394 | std::tuple_size<typename std::decay<Tuple>::type>::value>{})) { |
1395 | using Indices = build_index_impl< |
1396 | std::tuple_size<typename std::decay<Tuple>::type>::value>; |
1397 | |
1398 | return detail::apply_tuple_impl(std::forward<F>(f), std::forward<Tuple>(t), |
1399 | Indices{}); |
1400 | } |
1401 | |
1402 | } // end namespace llvm |
1403 | |
1404 | #endif // LLVM_ADT_STLEXTRAS_H |