File: | tools/llvm-objdump/llvm-objdump.cpp |
Warning: | line 2309, column 23 Called C++ object pointer is null |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
1 | //===-- llvm-objdump.cpp - Object file dumping utility for llvm -----------===// | |||
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 program is a utility that works like binutils "objdump", that is, it | |||
11 | // dumps out a plethora of information about an object file depending on the | |||
12 | // flags. | |||
13 | // | |||
14 | // The flags and output of this program should be near identical to those of | |||
15 | // binutils objdump. | |||
16 | // | |||
17 | //===----------------------------------------------------------------------===// | |||
18 | ||||
19 | #include "llvm-objdump.h" | |||
20 | #include "llvm/ADT/Optional.h" | |||
21 | #include "llvm/ADT/STLExtras.h" | |||
22 | #include "llvm/ADT/StringExtras.h" | |||
23 | #include "llvm/ADT/StringSet.h" | |||
24 | #include "llvm/ADT/Triple.h" | |||
25 | #include "llvm/CodeGen/FaultMaps.h" | |||
26 | #include "llvm/DebugInfo/DWARF/DWARFContext.h" | |||
27 | #include "llvm/DebugInfo/Symbolize/Symbolize.h" | |||
28 | #include "llvm/Demangle/Demangle.h" | |||
29 | #include "llvm/MC/MCAsmInfo.h" | |||
30 | #include "llvm/MC/MCContext.h" | |||
31 | #include "llvm/MC/MCDisassembler/MCDisassembler.h" | |||
32 | #include "llvm/MC/MCDisassembler/MCRelocationInfo.h" | |||
33 | #include "llvm/MC/MCInst.h" | |||
34 | #include "llvm/MC/MCInstPrinter.h" | |||
35 | #include "llvm/MC/MCInstrAnalysis.h" | |||
36 | #include "llvm/MC/MCInstrInfo.h" | |||
37 | #include "llvm/MC/MCObjectFileInfo.h" | |||
38 | #include "llvm/MC/MCRegisterInfo.h" | |||
39 | #include "llvm/MC/MCSubtargetInfo.h" | |||
40 | #include "llvm/Object/Archive.h" | |||
41 | #include "llvm/Object/COFF.h" | |||
42 | #include "llvm/Object/COFFImportFile.h" | |||
43 | #include "llvm/Object/ELFObjectFile.h" | |||
44 | #include "llvm/Object/MachO.h" | |||
45 | #include "llvm/Object/MachOUniversal.h" | |||
46 | #include "llvm/Object/ObjectFile.h" | |||
47 | #include "llvm/Object/Wasm.h" | |||
48 | #include "llvm/Support/Casting.h" | |||
49 | #include "llvm/Support/CommandLine.h" | |||
50 | #include "llvm/Support/Debug.h" | |||
51 | #include "llvm/Support/Errc.h" | |||
52 | #include "llvm/Support/FileSystem.h" | |||
53 | #include "llvm/Support/Format.h" | |||
54 | #include "llvm/Support/GraphWriter.h" | |||
55 | #include "llvm/Support/Host.h" | |||
56 | #include "llvm/Support/InitLLVM.h" | |||
57 | #include "llvm/Support/MemoryBuffer.h" | |||
58 | #include "llvm/Support/SourceMgr.h" | |||
59 | #include "llvm/Support/StringSaver.h" | |||
60 | #include "llvm/Support/TargetRegistry.h" | |||
61 | #include "llvm/Support/TargetSelect.h" | |||
62 | #include "llvm/Support/raw_ostream.h" | |||
63 | #include <algorithm> | |||
64 | #include <cctype> | |||
65 | #include <cstring> | |||
66 | #include <system_error> | |||
67 | #include <unordered_map> | |||
68 | #include <utility> | |||
69 | ||||
70 | using namespace llvm; | |||
71 | using namespace object; | |||
72 | ||||
73 | cl::opt<bool> | |||
74 | llvm::AllHeaders("all-headers", | |||
75 | cl::desc("Display all available header information")); | |||
76 | static cl::alias AllHeadersShort("x", cl::desc("Alias for --all-headers"), | |||
77 | cl::aliasopt(AllHeaders)); | |||
78 | ||||
79 | static cl::list<std::string> | |||
80 | InputFilenames(cl::Positional, cl::desc("<input object files>"),cl::ZeroOrMore); | |||
81 | ||||
82 | cl::opt<bool> | |||
83 | llvm::Disassemble("disassemble", | |||
84 | cl::desc("Display assembler mnemonics for the machine instructions")); | |||
85 | static cl::alias | |||
86 | Disassembled("d", cl::desc("Alias for --disassemble"), | |||
87 | cl::aliasopt(Disassemble)); | |||
88 | ||||
89 | cl::opt<bool> | |||
90 | llvm::DisassembleAll("disassemble-all", | |||
91 | cl::desc("Display assembler mnemonics for the machine instructions")); | |||
92 | static cl::alias | |||
93 | DisassembleAlld("D", cl::desc("Alias for --disassemble-all"), | |||
94 | cl::aliasopt(DisassembleAll)); | |||
95 | ||||
96 | cl::opt<bool> llvm::Demangle("demangle", cl::desc("Demangle symbols names"), | |||
97 | cl::init(false)); | |||
98 | ||||
99 | static cl::alias DemangleShort("C", cl::desc("Alias for --demangle"), | |||
100 | cl::aliasopt(llvm::Demangle)); | |||
101 | ||||
102 | static cl::list<std::string> | |||
103 | DisassembleFunctions("df", | |||
104 | cl::CommaSeparated, | |||
105 | cl::desc("List of functions to disassemble")); | |||
106 | static StringSet<> DisasmFuncsSet; | |||
107 | ||||
108 | cl::opt<bool> | |||
109 | llvm::Relocations("r", cl::desc("Display the relocation entries in the file")); | |||
110 | ||||
111 | cl::opt<bool> | |||
112 | llvm::DynamicRelocations("dynamic-reloc", | |||
113 | cl::desc("Display the dynamic relocation entries in the file")); | |||
114 | static cl::alias | |||
115 | DynamicRelocationsd("R", cl::desc("Alias for --dynamic-reloc"), | |||
116 | cl::aliasopt(DynamicRelocations)); | |||
117 | ||||
118 | cl::opt<bool> | |||
119 | llvm::SectionContents("s", cl::desc("Display the content of each section")); | |||
120 | ||||
121 | cl::opt<bool> | |||
122 | llvm::SymbolTable("t", cl::desc("Display the symbol table")); | |||
123 | ||||
124 | cl::opt<bool> | |||
125 | llvm::ExportsTrie("exports-trie", cl::desc("Display mach-o exported symbols")); | |||
126 | ||||
127 | cl::opt<bool> | |||
128 | llvm::Rebase("rebase", cl::desc("Display mach-o rebasing info")); | |||
129 | ||||
130 | cl::opt<bool> | |||
131 | llvm::Bind("bind", cl::desc("Display mach-o binding info")); | |||
132 | ||||
133 | cl::opt<bool> | |||
134 | llvm::LazyBind("lazy-bind", cl::desc("Display mach-o lazy binding info")); | |||
135 | ||||
136 | cl::opt<bool> | |||
137 | llvm::WeakBind("weak-bind", cl::desc("Display mach-o weak binding info")); | |||
138 | ||||
139 | cl::opt<bool> | |||
140 | llvm::RawClangAST("raw-clang-ast", | |||
141 | cl::desc("Dump the raw binary contents of the clang AST section")); | |||
142 | ||||
143 | static cl::opt<bool> | |||
144 | MachOOpt("macho", cl::desc("Use MachO specific object file parser")); | |||
145 | static cl::alias | |||
146 | MachOm("m", cl::desc("Alias for --macho"), cl::aliasopt(MachOOpt)); | |||
147 | ||||
148 | cl::opt<std::string> | |||
149 | llvm::TripleName("triple", cl::desc("Target triple to disassemble for, " | |||
150 | "see -version for available targets")); | |||
151 | ||||
152 | cl::opt<std::string> | |||
153 | llvm::MCPU("mcpu", | |||
154 | cl::desc("Target a specific cpu type (-mcpu=help for details)"), | |||
155 | cl::value_desc("cpu-name"), | |||
156 | cl::init("")); | |||
157 | ||||
158 | cl::opt<std::string> | |||
159 | llvm::ArchName("arch-name", cl::desc("Target arch to disassemble for, " | |||
160 | "see -version for available targets")); | |||
161 | ||||
162 | cl::opt<bool> | |||
163 | llvm::SectionHeaders("section-headers", cl::desc("Display summaries of the " | |||
164 | "headers for each section.")); | |||
165 | static cl::alias | |||
166 | SectionHeadersShort("headers", cl::desc("Alias for --section-headers"), | |||
167 | cl::aliasopt(SectionHeaders)); | |||
168 | static cl::alias | |||
169 | SectionHeadersShorter("h", cl::desc("Alias for --section-headers"), | |||
170 | cl::aliasopt(SectionHeaders)); | |||
171 | ||||
172 | cl::list<std::string> | |||
173 | llvm::FilterSections("section", cl::desc("Operate on the specified sections only. " | |||
174 | "With -macho dump segment,section")); | |||
175 | cl::alias | |||
176 | static FilterSectionsj("j", cl::desc("Alias for --section"), | |||
177 | cl::aliasopt(llvm::FilterSections)); | |||
178 | ||||
179 | cl::list<std::string> | |||
180 | llvm::MAttrs("mattr", | |||
181 | cl::CommaSeparated, | |||
182 | cl::desc("Target specific attributes"), | |||
183 | cl::value_desc("a1,+a2,-a3,...")); | |||
184 | ||||
185 | cl::opt<bool> | |||
186 | llvm::NoShowRawInsn("no-show-raw-insn", cl::desc("When disassembling " | |||
187 | "instructions, do not print " | |||
188 | "the instruction bytes.")); | |||
189 | cl::opt<bool> | |||
190 | llvm::NoLeadingAddr("no-leading-addr", cl::desc("Print no leading address")); | |||
191 | ||||
192 | cl::opt<bool> | |||
193 | llvm::UnwindInfo("unwind-info", cl::desc("Display unwind information")); | |||
194 | ||||
195 | static cl::alias | |||
196 | UnwindInfoShort("u", cl::desc("Alias for --unwind-info"), | |||
197 | cl::aliasopt(UnwindInfo)); | |||
198 | ||||
199 | cl::opt<bool> | |||
200 | llvm::PrivateHeaders("private-headers", | |||
201 | cl::desc("Display format specific file headers")); | |||
202 | ||||
203 | cl::opt<bool> | |||
204 | llvm::FirstPrivateHeader("private-header", | |||
205 | cl::desc("Display only the first format specific file " | |||
206 | "header")); | |||
207 | ||||
208 | static cl::alias | |||
209 | PrivateHeadersShort("p", cl::desc("Alias for --private-headers"), | |||
210 | cl::aliasopt(PrivateHeaders)); | |||
211 | ||||
212 | cl::opt<bool> llvm::FileHeaders( | |||
213 | "file-headers", | |||
214 | cl::desc("Display the contents of the overall file header")); | |||
215 | ||||
216 | static cl::alias FileHeadersShort("f", cl::desc("Alias for --file-headers"), | |||
217 | cl::aliasopt(FileHeaders)); | |||
218 | ||||
219 | cl::opt<bool> | |||
220 | llvm::ArchiveHeaders("archive-headers", | |||
221 | cl::desc("Display archive header information")); | |||
222 | ||||
223 | cl::alias | |||
224 | ArchiveHeadersShort("a", cl::desc("Alias for --archive-headers"), | |||
225 | cl::aliasopt(ArchiveHeaders)); | |||
226 | ||||
227 | cl::opt<bool> | |||
228 | llvm::PrintImmHex("print-imm-hex", | |||
229 | cl::desc("Use hex format for immediate values")); | |||
230 | ||||
231 | cl::opt<bool> PrintFaultMaps("fault-map-section", | |||
232 | cl::desc("Display contents of faultmap section")); | |||
233 | ||||
234 | cl::opt<DIDumpType> llvm::DwarfDumpType( | |||
235 | "dwarf", cl::init(DIDT_Null), cl::desc("Dump of dwarf debug sections:"), | |||
236 | cl::values(clEnumValN(DIDT_DebugFrame, "frames", ".debug_frame")llvm::cl::OptionEnumValue { "frames", int(DIDT_DebugFrame), ".debug_frame" })); | |||
237 | ||||
238 | cl::opt<bool> PrintSource( | |||
239 | "source", | |||
240 | cl::desc( | |||
241 | "Display source inlined with disassembly. Implies disassemble object")); | |||
242 | ||||
243 | cl::alias PrintSourceShort("S", cl::desc("Alias for -source"), | |||
244 | cl::aliasopt(PrintSource)); | |||
245 | ||||
246 | cl::opt<bool> PrintLines("line-numbers", | |||
247 | cl::desc("Display source line numbers with " | |||
248 | "disassembly. Implies disassemble object")); | |||
249 | ||||
250 | cl::alias PrintLinesShort("l", cl::desc("Alias for -line-numbers"), | |||
251 | cl::aliasopt(PrintLines)); | |||
252 | ||||
253 | cl::opt<unsigned long long> | |||
254 | StartAddress("start-address", cl::desc("Disassemble beginning at address"), | |||
255 | cl::value_desc("address"), cl::init(0)); | |||
256 | cl::opt<unsigned long long> | |||
257 | StopAddress("stop-address", cl::desc("Stop disassembly at address"), | |||
258 | cl::value_desc("address"), cl::init(UINT64_MAX(18446744073709551615UL))); | |||
259 | static StringRef ToolName; | |||
260 | ||||
261 | typedef std::vector<std::tuple<uint64_t, StringRef, uint8_t>> SectionSymbolsTy; | |||
262 | ||||
263 | namespace { | |||
264 | typedef std::function<bool(llvm::object::SectionRef const &)> FilterPredicate; | |||
265 | ||||
266 | class SectionFilterIterator { | |||
267 | public: | |||
268 | SectionFilterIterator(FilterPredicate P, | |||
269 | llvm::object::section_iterator const &I, | |||
270 | llvm::object::section_iterator const &E) | |||
271 | : Predicate(std::move(P)), Iterator(I), End(E) { | |||
272 | ScanPredicate(); | |||
273 | } | |||
274 | const llvm::object::SectionRef &operator*() const { return *Iterator; } | |||
275 | SectionFilterIterator &operator++() { | |||
276 | ++Iterator; | |||
277 | ScanPredicate(); | |||
278 | return *this; | |||
279 | } | |||
280 | bool operator!=(SectionFilterIterator const &Other) const { | |||
281 | return Iterator != Other.Iterator; | |||
282 | } | |||
283 | ||||
284 | private: | |||
285 | void ScanPredicate() { | |||
286 | while (Iterator != End && !Predicate(*Iterator)) { | |||
287 | ++Iterator; | |||
288 | } | |||
289 | } | |||
290 | FilterPredicate Predicate; | |||
291 | llvm::object::section_iterator Iterator; | |||
292 | llvm::object::section_iterator End; | |||
293 | }; | |||
294 | ||||
295 | class SectionFilter { | |||
296 | public: | |||
297 | SectionFilter(FilterPredicate P, llvm::object::ObjectFile const &O) | |||
298 | : Predicate(std::move(P)), Object(O) {} | |||
299 | SectionFilterIterator begin() { | |||
300 | return SectionFilterIterator(Predicate, Object.section_begin(), | |||
301 | Object.section_end()); | |||
302 | } | |||
303 | SectionFilterIterator end() { | |||
304 | return SectionFilterIterator(Predicate, Object.section_end(), | |||
305 | Object.section_end()); | |||
306 | } | |||
307 | ||||
308 | private: | |||
309 | FilterPredicate Predicate; | |||
310 | llvm::object::ObjectFile const &Object; | |||
311 | }; | |||
312 | SectionFilter ToolSectionFilter(llvm::object::ObjectFile const &O) { | |||
313 | return SectionFilter( | |||
314 | [](llvm::object::SectionRef const &S) { | |||
315 | if (FilterSections.empty()) | |||
316 | return true; | |||
317 | llvm::StringRef String; | |||
318 | std::error_code error = S.getName(String); | |||
319 | if (error) | |||
320 | return false; | |||
321 | return is_contained(FilterSections, String); | |||
322 | }, | |||
323 | O); | |||
324 | } | |||
325 | } | |||
326 | ||||
327 | void llvm::error(std::error_code EC) { | |||
328 | if (!EC) | |||
329 | return; | |||
330 | ||||
331 | errs() << ToolName << ": error reading file: " << EC.message() << ".\n"; | |||
332 | errs().flush(); | |||
333 | exit(1); | |||
334 | } | |||
335 | ||||
336 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) void llvm::error(Twine Message) { | |||
337 | errs() << ToolName << ": " << Message << ".\n"; | |||
338 | errs().flush(); | |||
339 | exit(1); | |||
340 | } | |||
341 | ||||
342 | void llvm::warn(StringRef Message) { | |||
343 | errs() << ToolName << ": warning: " << Message << ".\n"; | |||
344 | errs().flush(); | |||
345 | } | |||
346 | ||||
347 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) void llvm::report_error(StringRef File, | |||
348 | Twine Message) { | |||
349 | errs() << ToolName << ": '" << File << "': " << Message << ".\n"; | |||
350 | exit(1); | |||
351 | } | |||
352 | ||||
353 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) void llvm::report_error(StringRef File, | |||
354 | std::error_code EC) { | |||
355 | assert(EC)((EC) ? static_cast<void> (0) : __assert_fail ("EC", "/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp" , 355, __PRETTY_FUNCTION__)); | |||
356 | errs() << ToolName << ": '" << File << "': " << EC.message() << ".\n"; | |||
357 | exit(1); | |||
358 | } | |||
359 | ||||
360 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) void llvm::report_error(StringRef File, | |||
361 | llvm::Error E) { | |||
362 | assert(E)((E) ? static_cast<void> (0) : __assert_fail ("E", "/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp" , 362, __PRETTY_FUNCTION__)); | |||
363 | std::string Buf; | |||
364 | raw_string_ostream OS(Buf); | |||
365 | logAllUnhandledErrors(std::move(E), OS, ""); | |||
366 | OS.flush(); | |||
367 | errs() << ToolName << ": '" << File << "': " << Buf; | |||
368 | exit(1); | |||
369 | } | |||
370 | ||||
371 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) void llvm::report_error(StringRef ArchiveName, | |||
372 | StringRef FileName, | |||
373 | llvm::Error E, | |||
374 | StringRef ArchitectureName) { | |||
375 | assert(E)((E) ? static_cast<void> (0) : __assert_fail ("E", "/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp" , 375, __PRETTY_FUNCTION__)); | |||
376 | errs() << ToolName << ": "; | |||
377 | if (ArchiveName != "") | |||
378 | errs() << ArchiveName << "(" << FileName << ")"; | |||
379 | else | |||
380 | errs() << "'" << FileName << "'"; | |||
381 | if (!ArchitectureName.empty()) | |||
382 | errs() << " (for architecture " << ArchitectureName << ")"; | |||
383 | std::string Buf; | |||
384 | raw_string_ostream OS(Buf); | |||
385 | logAllUnhandledErrors(std::move(E), OS, ""); | |||
386 | OS.flush(); | |||
387 | errs() << ": " << Buf; | |||
388 | exit(1); | |||
389 | } | |||
390 | ||||
391 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) void llvm::report_error(StringRef ArchiveName, | |||
392 | const object::Archive::Child &C, | |||
393 | llvm::Error E, | |||
394 | StringRef ArchitectureName) { | |||
395 | Expected<StringRef> NameOrErr = C.getName(); | |||
396 | // TODO: if we have a error getting the name then it would be nice to print | |||
397 | // the index of which archive member this is and or its offset in the | |||
398 | // archive instead of "???" as the name. | |||
399 | if (!NameOrErr) { | |||
400 | consumeError(NameOrErr.takeError()); | |||
401 | llvm::report_error(ArchiveName, "???", std::move(E), ArchitectureName); | |||
402 | } else | |||
403 | llvm::report_error(ArchiveName, NameOrErr.get(), std::move(E), | |||
404 | ArchitectureName); | |||
405 | } | |||
406 | ||||
407 | static const Target *getTarget(const ObjectFile *Obj = nullptr) { | |||
408 | // Figure out the target triple. | |||
409 | llvm::Triple TheTriple("unknown-unknown-unknown"); | |||
410 | if (TripleName.empty()) { | |||
411 | if (Obj) { | |||
412 | TheTriple = Obj->makeTriple(); | |||
413 | } | |||
414 | } else { | |||
415 | TheTriple.setTriple(Triple::normalize(TripleName)); | |||
416 | ||||
417 | // Use the triple, but also try to combine with ARM build attributes. | |||
418 | if (Obj) { | |||
419 | auto Arch = Obj->getArch(); | |||
420 | if (Arch == Triple::arm || Arch == Triple::armeb) { | |||
421 | Obj->setARMSubArch(TheTriple); | |||
422 | } | |||
423 | } | |||
424 | } | |||
425 | ||||
426 | // Get the target specific parser. | |||
427 | std::string Error; | |||
428 | const Target *TheTarget = TargetRegistry::lookupTarget(ArchName, TheTriple, | |||
429 | Error); | |||
430 | if (!TheTarget) { | |||
431 | if (Obj) | |||
432 | report_error(Obj->getFileName(), "can't find target: " + Error); | |||
433 | else | |||
434 | error("can't find target: " + Error); | |||
435 | } | |||
436 | ||||
437 | // Update the triple name and return the found target. | |||
438 | TripleName = TheTriple.getTriple(); | |||
439 | return TheTarget; | |||
440 | } | |||
441 | ||||
442 | bool llvm::RelocAddressLess(RelocationRef a, RelocationRef b) { | |||
443 | return a.getOffset() < b.getOffset(); | |||
444 | } | |||
445 | ||||
446 | template <class ELFT> | |||
447 | static std::error_code getRelocationValueString(const ELFObjectFile<ELFT> *Obj, | |||
448 | const RelocationRef &RelRef, | |||
449 | SmallVectorImpl<char> &Result) { | |||
450 | DataRefImpl Rel = RelRef.getRawDataRefImpl(); | |||
451 | ||||
452 | typedef typename ELFObjectFile<ELFT>::Elf_Sym Elf_Sym; | |||
453 | typedef typename ELFObjectFile<ELFT>::Elf_Shdr Elf_Shdr; | |||
454 | typedef typename ELFObjectFile<ELFT>::Elf_Rela Elf_Rela; | |||
455 | ||||
456 | const ELFFile<ELFT> &EF = *Obj->getELFFile(); | |||
457 | ||||
458 | auto SecOrErr = EF.getSection(Rel.d.a); | |||
459 | if (!SecOrErr) | |||
460 | return errorToErrorCode(SecOrErr.takeError()); | |||
461 | const Elf_Shdr *Sec = *SecOrErr; | |||
462 | auto SymTabOrErr = EF.getSection(Sec->sh_link); | |||
463 | if (!SymTabOrErr) | |||
464 | return errorToErrorCode(SymTabOrErr.takeError()); | |||
465 | const Elf_Shdr *SymTab = *SymTabOrErr; | |||
466 | assert(SymTab->sh_type == ELF::SHT_SYMTAB ||((SymTab->sh_type == ELF::SHT_SYMTAB || SymTab->sh_type == ELF::SHT_DYNSYM) ? static_cast<void> (0) : __assert_fail ("SymTab->sh_type == ELF::SHT_SYMTAB || SymTab->sh_type == ELF::SHT_DYNSYM" , "/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp" , 467, __PRETTY_FUNCTION__)) | |||
467 | SymTab->sh_type == ELF::SHT_DYNSYM)((SymTab->sh_type == ELF::SHT_SYMTAB || SymTab->sh_type == ELF::SHT_DYNSYM) ? static_cast<void> (0) : __assert_fail ("SymTab->sh_type == ELF::SHT_SYMTAB || SymTab->sh_type == ELF::SHT_DYNSYM" , "/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp" , 467, __PRETTY_FUNCTION__)); | |||
468 | auto StrTabSec = EF.getSection(SymTab->sh_link); | |||
469 | if (!StrTabSec) | |||
470 | return errorToErrorCode(StrTabSec.takeError()); | |||
471 | auto StrTabOrErr = EF.getStringTable(*StrTabSec); | |||
472 | if (!StrTabOrErr) | |||
473 | return errorToErrorCode(StrTabOrErr.takeError()); | |||
474 | StringRef StrTab = *StrTabOrErr; | |||
475 | int64_t addend = 0; | |||
476 | // If there is no Symbol associated with the relocation, we set the undef | |||
477 | // boolean value to 'true'. This will prevent us from calling functions that | |||
478 | // requires the relocation to be associated with a symbol. | |||
479 | bool undef = false; | |||
480 | switch (Sec->sh_type) { | |||
481 | default: | |||
482 | return object_error::parse_failed; | |||
483 | case ELF::SHT_REL: { | |||
484 | // TODO: Read implicit addend from section data. | |||
485 | break; | |||
486 | } | |||
487 | case ELF::SHT_RELA: { | |||
488 | const Elf_Rela *ERela = Obj->getRela(Rel); | |||
489 | addend = ERela->r_addend; | |||
490 | undef = ERela->getSymbol(false) == 0; | |||
491 | break; | |||
492 | } | |||
493 | } | |||
494 | StringRef Target; | |||
495 | if (!undef) { | |||
496 | symbol_iterator SI = RelRef.getSymbol(); | |||
497 | const Elf_Sym *symb = Obj->getSymbol(SI->getRawDataRefImpl()); | |||
498 | if (symb->getType() == ELF::STT_SECTION) { | |||
499 | Expected<section_iterator> SymSI = SI->getSection(); | |||
500 | if (!SymSI) | |||
501 | return errorToErrorCode(SymSI.takeError()); | |||
502 | const Elf_Shdr *SymSec = Obj->getSection((*SymSI)->getRawDataRefImpl()); | |||
503 | auto SecName = EF.getSectionName(SymSec); | |||
504 | if (!SecName) | |||
505 | return errorToErrorCode(SecName.takeError()); | |||
506 | Target = *SecName; | |||
507 | } else { | |||
508 | Expected<StringRef> SymName = symb->getName(StrTab); | |||
509 | if (!SymName) | |||
510 | return errorToErrorCode(SymName.takeError()); | |||
511 | Target = *SymName; | |||
512 | } | |||
513 | } else | |||
514 | Target = "*ABS*"; | |||
515 | ||||
516 | // Default scheme is to print Target, as well as "+ <addend>" for nonzero | |||
517 | // addend. Should be acceptable for all normal purposes. | |||
518 | std::string fmtbuf; | |||
519 | raw_string_ostream fmt(fmtbuf); | |||
520 | fmt << Target; | |||
521 | if (addend != 0) | |||
522 | fmt << (addend < 0 ? "" : "+") << addend; | |||
523 | fmt.flush(); | |||
524 | Result.append(fmtbuf.begin(), fmtbuf.end()); | |||
525 | return std::error_code(); | |||
526 | } | |||
527 | ||||
528 | static std::error_code getRelocationValueString(const ELFObjectFileBase *Obj, | |||
529 | const RelocationRef &Rel, | |||
530 | SmallVectorImpl<char> &Result) { | |||
531 | if (auto *ELF32LE = dyn_cast<ELF32LEObjectFile>(Obj)) | |||
532 | return getRelocationValueString(ELF32LE, Rel, Result); | |||
533 | if (auto *ELF64LE = dyn_cast<ELF64LEObjectFile>(Obj)) | |||
534 | return getRelocationValueString(ELF64LE, Rel, Result); | |||
535 | if (auto *ELF32BE = dyn_cast<ELF32BEObjectFile>(Obj)) | |||
536 | return getRelocationValueString(ELF32BE, Rel, Result); | |||
537 | auto *ELF64BE = cast<ELF64BEObjectFile>(Obj); | |||
538 | return getRelocationValueString(ELF64BE, Rel, Result); | |||
539 | } | |||
540 | ||||
541 | static std::error_code getRelocationValueString(const COFFObjectFile *Obj, | |||
542 | const RelocationRef &Rel, | |||
543 | SmallVectorImpl<char> &Result) { | |||
544 | symbol_iterator SymI = Rel.getSymbol(); | |||
545 | Expected<StringRef> SymNameOrErr = SymI->getName(); | |||
546 | if (!SymNameOrErr) | |||
547 | return errorToErrorCode(SymNameOrErr.takeError()); | |||
548 | StringRef SymName = *SymNameOrErr; | |||
549 | Result.append(SymName.begin(), SymName.end()); | |||
550 | return std::error_code(); | |||
551 | } | |||
552 | ||||
553 | static void printRelocationTargetName(const MachOObjectFile *O, | |||
554 | const MachO::any_relocation_info &RE, | |||
555 | raw_string_ostream &fmt) { | |||
556 | bool IsScattered = O->isRelocationScattered(RE); | |||
557 | ||||
558 | // Target of a scattered relocation is an address. In the interest of | |||
559 | // generating pretty output, scan through the symbol table looking for a | |||
560 | // symbol that aligns with that address. If we find one, print it. | |||
561 | // Otherwise, we just print the hex address of the target. | |||
562 | if (IsScattered) { | |||
563 | uint32_t Val = O->getPlainRelocationSymbolNum(RE); | |||
564 | ||||
565 | for (const SymbolRef &Symbol : O->symbols()) { | |||
566 | std::error_code ec; | |||
567 | Expected<uint64_t> Addr = Symbol.getAddress(); | |||
568 | if (!Addr) | |||
569 | report_error(O->getFileName(), Addr.takeError()); | |||
570 | if (*Addr != Val) | |||
571 | continue; | |||
572 | Expected<StringRef> Name = Symbol.getName(); | |||
573 | if (!Name) | |||
574 | report_error(O->getFileName(), Name.takeError()); | |||
575 | fmt << *Name; | |||
576 | return; | |||
577 | } | |||
578 | ||||
579 | // If we couldn't find a symbol that this relocation refers to, try | |||
580 | // to find a section beginning instead. | |||
581 | for (const SectionRef &Section : ToolSectionFilter(*O)) { | |||
582 | std::error_code ec; | |||
583 | ||||
584 | StringRef Name; | |||
585 | uint64_t Addr = Section.getAddress(); | |||
586 | if (Addr != Val) | |||
587 | continue; | |||
588 | if ((ec = Section.getName(Name))) | |||
589 | report_error(O->getFileName(), ec); | |||
590 | fmt << Name; | |||
591 | return; | |||
592 | } | |||
593 | ||||
594 | fmt << format("0x%x", Val); | |||
595 | return; | |||
596 | } | |||
597 | ||||
598 | StringRef S; | |||
599 | bool isExtern = O->getPlainRelocationExternal(RE); | |||
600 | uint64_t Val = O->getPlainRelocationSymbolNum(RE); | |||
601 | ||||
602 | if (O->getAnyRelocationType(RE) == MachO::ARM64_RELOC_ADDEND) { | |||
603 | fmt << format("0x%0" PRIx64"l" "x", Val); | |||
604 | return; | |||
605 | } else if (isExtern) { | |||
606 | symbol_iterator SI = O->symbol_begin(); | |||
607 | advance(SI, Val); | |||
608 | Expected<StringRef> SOrErr = SI->getName(); | |||
609 | if (!SOrErr) | |||
610 | report_error(O->getFileName(), SOrErr.takeError()); | |||
611 | S = *SOrErr; | |||
612 | } else { | |||
613 | section_iterator SI = O->section_begin(); | |||
614 | // Adjust for the fact that sections are 1-indexed. | |||
615 | if (Val == 0) { | |||
616 | fmt << "0 (?,?)"; | |||
617 | return; | |||
618 | } | |||
619 | uint32_t i = Val - 1; | |||
620 | while (i != 0 && SI != O->section_end()) { | |||
621 | i--; | |||
622 | advance(SI, 1); | |||
623 | } | |||
624 | if (SI == O->section_end()) | |||
625 | fmt << Val << " (?,?)"; | |||
626 | else | |||
627 | SI->getName(S); | |||
628 | } | |||
629 | ||||
630 | fmt << S; | |||
631 | } | |||
632 | ||||
633 | static std::error_code getRelocationValueString(const WasmObjectFile *Obj, | |||
634 | const RelocationRef &RelRef, | |||
635 | SmallVectorImpl<char> &Result) { | |||
636 | const wasm::WasmRelocation& Rel = Obj->getWasmRelocation(RelRef); | |||
637 | symbol_iterator SI = RelRef.getSymbol(); | |||
638 | std::string fmtbuf; | |||
639 | raw_string_ostream fmt(fmtbuf); | |||
640 | if (SI == Obj->symbol_end()) { | |||
641 | // Not all wasm relocations have symbols associated with them. | |||
642 | // In particular R_WEBASSEMBLY_TYPE_INDEX_LEB. | |||
643 | fmt << Rel.Index; | |||
644 | } else { | |||
645 | Expected<StringRef> SymNameOrErr = SI->getName(); | |||
646 | if (!SymNameOrErr) | |||
647 | return errorToErrorCode(SymNameOrErr.takeError()); | |||
648 | StringRef SymName = *SymNameOrErr; | |||
649 | Result.append(SymName.begin(), SymName.end()); | |||
650 | } | |||
651 | fmt << (Rel.Addend < 0 ? "" : "+") << Rel.Addend; | |||
652 | fmt.flush(); | |||
653 | Result.append(fmtbuf.begin(), fmtbuf.end()); | |||
654 | return std::error_code(); | |||
655 | } | |||
656 | ||||
657 | static std::error_code getRelocationValueString(const MachOObjectFile *Obj, | |||
658 | const RelocationRef &RelRef, | |||
659 | SmallVectorImpl<char> &Result) { | |||
660 | DataRefImpl Rel = RelRef.getRawDataRefImpl(); | |||
661 | MachO::any_relocation_info RE = Obj->getRelocation(Rel); | |||
662 | ||||
663 | unsigned Arch = Obj->getArch(); | |||
664 | ||||
665 | std::string fmtbuf; | |||
666 | raw_string_ostream fmt(fmtbuf); | |||
667 | unsigned Type = Obj->getAnyRelocationType(RE); | |||
668 | bool IsPCRel = Obj->getAnyRelocationPCRel(RE); | |||
669 | ||||
670 | // Determine any addends that should be displayed with the relocation. | |||
671 | // These require decoding the relocation type, which is triple-specific. | |||
672 | ||||
673 | // X86_64 has entirely custom relocation types. | |||
674 | if (Arch == Triple::x86_64) { | |||
675 | bool isPCRel = Obj->getAnyRelocationPCRel(RE); | |||
676 | ||||
677 | switch (Type) { | |||
678 | case MachO::X86_64_RELOC_GOT_LOAD: | |||
679 | case MachO::X86_64_RELOC_GOT: { | |||
680 | printRelocationTargetName(Obj, RE, fmt); | |||
681 | fmt << "@GOT"; | |||
682 | if (isPCRel) | |||
683 | fmt << "PCREL"; | |||
684 | break; | |||
685 | } | |||
686 | case MachO::X86_64_RELOC_SUBTRACTOR: { | |||
687 | DataRefImpl RelNext = Rel; | |||
688 | Obj->moveRelocationNext(RelNext); | |||
689 | MachO::any_relocation_info RENext = Obj->getRelocation(RelNext); | |||
690 | ||||
691 | // X86_64_RELOC_SUBTRACTOR must be followed by a relocation of type | |||
692 | // X86_64_RELOC_UNSIGNED. | |||
693 | // NOTE: Scattered relocations don't exist on x86_64. | |||
694 | unsigned RType = Obj->getAnyRelocationType(RENext); | |||
695 | if (RType != MachO::X86_64_RELOC_UNSIGNED) | |||
696 | report_error(Obj->getFileName(), "Expected X86_64_RELOC_UNSIGNED after " | |||
697 | "X86_64_RELOC_SUBTRACTOR."); | |||
698 | ||||
699 | // The X86_64_RELOC_UNSIGNED contains the minuend symbol; | |||
700 | // X86_64_RELOC_SUBTRACTOR contains the subtrahend. | |||
701 | printRelocationTargetName(Obj, RENext, fmt); | |||
702 | fmt << "-"; | |||
703 | printRelocationTargetName(Obj, RE, fmt); | |||
704 | break; | |||
705 | } | |||
706 | case MachO::X86_64_RELOC_TLV: | |||
707 | printRelocationTargetName(Obj, RE, fmt); | |||
708 | fmt << "@TLV"; | |||
709 | if (isPCRel) | |||
710 | fmt << "P"; | |||
711 | break; | |||
712 | case MachO::X86_64_RELOC_SIGNED_1: | |||
713 | printRelocationTargetName(Obj, RE, fmt); | |||
714 | fmt << "-1"; | |||
715 | break; | |||
716 | case MachO::X86_64_RELOC_SIGNED_2: | |||
717 | printRelocationTargetName(Obj, RE, fmt); | |||
718 | fmt << "-2"; | |||
719 | break; | |||
720 | case MachO::X86_64_RELOC_SIGNED_4: | |||
721 | printRelocationTargetName(Obj, RE, fmt); | |||
722 | fmt << "-4"; | |||
723 | break; | |||
724 | default: | |||
725 | printRelocationTargetName(Obj, RE, fmt); | |||
726 | break; | |||
727 | } | |||
728 | // X86 and ARM share some relocation types in common. | |||
729 | } else if (Arch == Triple::x86 || Arch == Triple::arm || | |||
730 | Arch == Triple::ppc) { | |||
731 | // Generic relocation types... | |||
732 | switch (Type) { | |||
733 | case MachO::GENERIC_RELOC_PAIR: // prints no info | |||
734 | return std::error_code(); | |||
735 | case MachO::GENERIC_RELOC_SECTDIFF: { | |||
736 | DataRefImpl RelNext = Rel; | |||
737 | Obj->moveRelocationNext(RelNext); | |||
738 | MachO::any_relocation_info RENext = Obj->getRelocation(RelNext); | |||
739 | ||||
740 | // X86 sect diff's must be followed by a relocation of type | |||
741 | // GENERIC_RELOC_PAIR. | |||
742 | unsigned RType = Obj->getAnyRelocationType(RENext); | |||
743 | ||||
744 | if (RType != MachO::GENERIC_RELOC_PAIR) | |||
745 | report_error(Obj->getFileName(), "Expected GENERIC_RELOC_PAIR after " | |||
746 | "GENERIC_RELOC_SECTDIFF."); | |||
747 | ||||
748 | printRelocationTargetName(Obj, RE, fmt); | |||
749 | fmt << "-"; | |||
750 | printRelocationTargetName(Obj, RENext, fmt); | |||
751 | break; | |||
752 | } | |||
753 | } | |||
754 | ||||
755 | if (Arch == Triple::x86 || Arch == Triple::ppc) { | |||
756 | switch (Type) { | |||
757 | case MachO::GENERIC_RELOC_LOCAL_SECTDIFF: { | |||
758 | DataRefImpl RelNext = Rel; | |||
759 | Obj->moveRelocationNext(RelNext); | |||
760 | MachO::any_relocation_info RENext = Obj->getRelocation(RelNext); | |||
761 | ||||
762 | // X86 sect diff's must be followed by a relocation of type | |||
763 | // GENERIC_RELOC_PAIR. | |||
764 | unsigned RType = Obj->getAnyRelocationType(RENext); | |||
765 | if (RType != MachO::GENERIC_RELOC_PAIR) | |||
766 | report_error(Obj->getFileName(), "Expected GENERIC_RELOC_PAIR after " | |||
767 | "GENERIC_RELOC_LOCAL_SECTDIFF."); | |||
768 | ||||
769 | printRelocationTargetName(Obj, RE, fmt); | |||
770 | fmt << "-"; | |||
771 | printRelocationTargetName(Obj, RENext, fmt); | |||
772 | break; | |||
773 | } | |||
774 | case MachO::GENERIC_RELOC_TLV: { | |||
775 | printRelocationTargetName(Obj, RE, fmt); | |||
776 | fmt << "@TLV"; | |||
777 | if (IsPCRel) | |||
778 | fmt << "P"; | |||
779 | break; | |||
780 | } | |||
781 | default: | |||
782 | printRelocationTargetName(Obj, RE, fmt); | |||
783 | } | |||
784 | } else { // ARM-specific relocations | |||
785 | switch (Type) { | |||
786 | case MachO::ARM_RELOC_HALF: | |||
787 | case MachO::ARM_RELOC_HALF_SECTDIFF: { | |||
788 | // Half relocations steal a bit from the length field to encode | |||
789 | // whether this is an upper16 or a lower16 relocation. | |||
790 | bool isUpper = (Obj->getAnyRelocationLength(RE) & 0x1) == 1; | |||
791 | ||||
792 | if (isUpper) | |||
793 | fmt << ":upper16:("; | |||
794 | else | |||
795 | fmt << ":lower16:("; | |||
796 | printRelocationTargetName(Obj, RE, fmt); | |||
797 | ||||
798 | DataRefImpl RelNext = Rel; | |||
799 | Obj->moveRelocationNext(RelNext); | |||
800 | MachO::any_relocation_info RENext = Obj->getRelocation(RelNext); | |||
801 | ||||
802 | // ARM half relocs must be followed by a relocation of type | |||
803 | // ARM_RELOC_PAIR. | |||
804 | unsigned RType = Obj->getAnyRelocationType(RENext); | |||
805 | if (RType != MachO::ARM_RELOC_PAIR) | |||
806 | report_error(Obj->getFileName(), "Expected ARM_RELOC_PAIR after " | |||
807 | "ARM_RELOC_HALF"); | |||
808 | ||||
809 | // NOTE: The half of the target virtual address is stashed in the | |||
810 | // address field of the secondary relocation, but we can't reverse | |||
811 | // engineer the constant offset from it without decoding the movw/movt | |||
812 | // instruction to find the other half in its immediate field. | |||
813 | ||||
814 | // ARM_RELOC_HALF_SECTDIFF encodes the second section in the | |||
815 | // symbol/section pointer of the follow-on relocation. | |||
816 | if (Type == MachO::ARM_RELOC_HALF_SECTDIFF) { | |||
817 | fmt << "-"; | |||
818 | printRelocationTargetName(Obj, RENext, fmt); | |||
819 | } | |||
820 | ||||
821 | fmt << ")"; | |||
822 | break; | |||
823 | } | |||
824 | default: { printRelocationTargetName(Obj, RE, fmt); } | |||
825 | } | |||
826 | } | |||
827 | } else | |||
828 | printRelocationTargetName(Obj, RE, fmt); | |||
829 | ||||
830 | fmt.flush(); | |||
831 | Result.append(fmtbuf.begin(), fmtbuf.end()); | |||
832 | return std::error_code(); | |||
833 | } | |||
834 | ||||
835 | static std::error_code getRelocationValueString(const RelocationRef &Rel, | |||
836 | SmallVectorImpl<char> &Result) { | |||
837 | const ObjectFile *Obj = Rel.getObject(); | |||
838 | if (auto *ELF = dyn_cast<ELFObjectFileBase>(Obj)) | |||
839 | return getRelocationValueString(ELF, Rel, Result); | |||
840 | if (auto *COFF = dyn_cast<COFFObjectFile>(Obj)) | |||
841 | return getRelocationValueString(COFF, Rel, Result); | |||
842 | if (auto *Wasm = dyn_cast<WasmObjectFile>(Obj)) | |||
843 | return getRelocationValueString(Wasm, Rel, Result); | |||
844 | if (auto *MachO = dyn_cast<MachOObjectFile>(Obj)) | |||
845 | return getRelocationValueString(MachO, Rel, Result); | |||
846 | llvm_unreachable("unknown object file format")::llvm::llvm_unreachable_internal("unknown object file format" , "/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp" , 846); | |||
847 | } | |||
848 | ||||
849 | /// Indicates whether this relocation should hidden when listing | |||
850 | /// relocations, usually because it is the trailing part of a multipart | |||
851 | /// relocation that will be printed as part of the leading relocation. | |||
852 | static bool getHidden(RelocationRef RelRef) { | |||
853 | const ObjectFile *Obj = RelRef.getObject(); | |||
854 | auto *MachO = dyn_cast<MachOObjectFile>(Obj); | |||
855 | if (!MachO) | |||
856 | return false; | |||
857 | ||||
858 | unsigned Arch = MachO->getArch(); | |||
859 | DataRefImpl Rel = RelRef.getRawDataRefImpl(); | |||
860 | uint64_t Type = MachO->getRelocationType(Rel); | |||
861 | ||||
862 | // On arches that use the generic relocations, GENERIC_RELOC_PAIR | |||
863 | // is always hidden. | |||
864 | if (Arch == Triple::x86 || Arch == Triple::arm || Arch == Triple::ppc) { | |||
865 | if (Type == MachO::GENERIC_RELOC_PAIR) | |||
866 | return true; | |||
867 | } else if (Arch == Triple::x86_64) { | |||
868 | // On x86_64, X86_64_RELOC_UNSIGNED is hidden only when it follows | |||
869 | // an X86_64_RELOC_SUBTRACTOR. | |||
870 | if (Type == MachO::X86_64_RELOC_UNSIGNED && Rel.d.a > 0) { | |||
871 | DataRefImpl RelPrev = Rel; | |||
872 | RelPrev.d.a--; | |||
873 | uint64_t PrevType = MachO->getRelocationType(RelPrev); | |||
874 | if (PrevType == MachO::X86_64_RELOC_SUBTRACTOR) | |||
875 | return true; | |||
876 | } | |||
877 | } | |||
878 | ||||
879 | return false; | |||
880 | } | |||
881 | ||||
882 | namespace { | |||
883 | class SourcePrinter { | |||
884 | protected: | |||
885 | DILineInfo OldLineInfo; | |||
886 | const ObjectFile *Obj = nullptr; | |||
887 | std::unique_ptr<symbolize::LLVMSymbolizer> Symbolizer; | |||
888 | // File name to file contents of source | |||
889 | std::unordered_map<std::string, std::unique_ptr<MemoryBuffer>> SourceCache; | |||
890 | // Mark the line endings of the cached source | |||
891 | std::unordered_map<std::string, std::vector<StringRef>> LineCache; | |||
892 | ||||
893 | private: | |||
894 | bool cacheSource(const DILineInfo& LineInfoFile); | |||
895 | ||||
896 | public: | |||
897 | SourcePrinter() = default; | |||
898 | SourcePrinter(const ObjectFile *Obj, StringRef DefaultArch) : Obj(Obj) { | |||
899 | symbolize::LLVMSymbolizer::Options SymbolizerOpts( | |||
900 | DILineInfoSpecifier::FunctionNameKind::None, true, false, false, | |||
901 | DefaultArch); | |||
902 | Symbolizer.reset(new symbolize::LLVMSymbolizer(SymbolizerOpts)); | |||
903 | } | |||
904 | virtual ~SourcePrinter() = default; | |||
905 | virtual void printSourceLine(raw_ostream &OS, uint64_t Address, | |||
906 | StringRef Delimiter = "; "); | |||
907 | }; | |||
908 | ||||
909 | bool SourcePrinter::cacheSource(const DILineInfo &LineInfo) { | |||
910 | std::unique_ptr<MemoryBuffer> Buffer; | |||
911 | if (LineInfo.Source) { | |||
912 | Buffer = MemoryBuffer::getMemBuffer(*LineInfo.Source); | |||
913 | } else { | |||
914 | auto BufferOrError = MemoryBuffer::getFile(LineInfo.FileName); | |||
915 | if (!BufferOrError) | |||
916 | return false; | |||
917 | Buffer = std::move(*BufferOrError); | |||
918 | } | |||
919 | // Chomp the file to get lines | |||
920 | size_t BufferSize = Buffer->getBufferSize(); | |||
921 | const char *BufferStart = Buffer->getBufferStart(); | |||
922 | for (const char *Start = BufferStart, *End = BufferStart; | |||
923 | End < BufferStart + BufferSize; End++) | |||
924 | if (*End == '\n' || End == BufferStart + BufferSize - 1 || | |||
925 | (*End == '\r' && *(End + 1) == '\n')) { | |||
926 | LineCache[LineInfo.FileName].push_back(StringRef(Start, End - Start)); | |||
927 | if (*End == '\r') | |||
928 | End++; | |||
929 | Start = End + 1; | |||
930 | } | |||
931 | SourceCache[LineInfo.FileName] = std::move(Buffer); | |||
932 | return true; | |||
933 | } | |||
934 | ||||
935 | void SourcePrinter::printSourceLine(raw_ostream &OS, uint64_t Address, | |||
936 | StringRef Delimiter) { | |||
937 | if (!Symbolizer) | |||
938 | return; | |||
939 | DILineInfo LineInfo = DILineInfo(); | |||
940 | auto ExpectecLineInfo = | |||
941 | Symbolizer->symbolizeCode(Obj->getFileName(), Address); | |||
942 | if (!ExpectecLineInfo) | |||
943 | consumeError(ExpectecLineInfo.takeError()); | |||
944 | else | |||
945 | LineInfo = *ExpectecLineInfo; | |||
946 | ||||
947 | if ((LineInfo.FileName == "<invalid>") || OldLineInfo.Line == LineInfo.Line || | |||
948 | LineInfo.Line == 0) | |||
949 | return; | |||
950 | ||||
951 | if (PrintLines) | |||
952 | OS << Delimiter << LineInfo.FileName << ":" << LineInfo.Line << "\n"; | |||
953 | if (PrintSource) { | |||
954 | if (SourceCache.find(LineInfo.FileName) == SourceCache.end()) | |||
955 | if (!cacheSource(LineInfo)) | |||
956 | return; | |||
957 | auto FileBuffer = SourceCache.find(LineInfo.FileName); | |||
958 | if (FileBuffer != SourceCache.end()) { | |||
959 | auto LineBuffer = LineCache.find(LineInfo.FileName); | |||
960 | if (LineBuffer != LineCache.end()) { | |||
961 | if (LineInfo.Line > LineBuffer->second.size()) | |||
962 | return; | |||
963 | // Vector begins at 0, line numbers are non-zero | |||
964 | OS << Delimiter << LineBuffer->second[LineInfo.Line - 1].ltrim() | |||
965 | << "\n"; | |||
966 | } | |||
967 | } | |||
968 | } | |||
969 | OldLineInfo = LineInfo; | |||
970 | } | |||
971 | ||||
972 | static bool isArmElf(const ObjectFile *Obj) { | |||
973 | return (Obj->isELF() && | |||
974 | (Obj->getArch() == Triple::aarch64 || | |||
975 | Obj->getArch() == Triple::aarch64_be || | |||
976 | Obj->getArch() == Triple::arm || Obj->getArch() == Triple::armeb || | |||
977 | Obj->getArch() == Triple::thumb || | |||
978 | Obj->getArch() == Triple::thumbeb)); | |||
979 | } | |||
980 | ||||
981 | class PrettyPrinter { | |||
982 | public: | |||
983 | virtual ~PrettyPrinter() = default; | |||
984 | virtual void printInst(MCInstPrinter &IP, const MCInst *MI, | |||
985 | ArrayRef<uint8_t> Bytes, uint64_t Address, | |||
986 | raw_ostream &OS, StringRef Annot, | |||
987 | MCSubtargetInfo const &STI, SourcePrinter *SP, | |||
988 | std::vector<RelocationRef> *Rels = nullptr) { | |||
989 | if (SP && (PrintSource || PrintLines)) | |||
990 | SP->printSourceLine(OS, Address); | |||
991 | if (!NoLeadingAddr) | |||
992 | OS << format("%8" PRIx64"l" "x" ":", Address); | |||
993 | if (!NoShowRawInsn) { | |||
994 | OS << "\t"; | |||
995 | dumpBytes(Bytes, OS); | |||
996 | } | |||
997 | if (MI) | |||
998 | IP.printInst(MI, OS, "", STI); | |||
999 | else | |||
1000 | OS << " <unknown>"; | |||
1001 | } | |||
1002 | }; | |||
1003 | PrettyPrinter PrettyPrinterInst; | |||
1004 | class HexagonPrettyPrinter : public PrettyPrinter { | |||
1005 | public: | |||
1006 | void printLead(ArrayRef<uint8_t> Bytes, uint64_t Address, | |||
1007 | raw_ostream &OS) { | |||
1008 | uint32_t opcode = | |||
1009 | (Bytes[3] << 24) | (Bytes[2] << 16) | (Bytes[1] << 8) | Bytes[0]; | |||
1010 | if (!NoLeadingAddr) | |||
1011 | OS << format("%8" PRIx64"l" "x" ":", Address); | |||
1012 | if (!NoShowRawInsn) { | |||
1013 | OS << "\t"; | |||
1014 | dumpBytes(Bytes.slice(0, 4), OS); | |||
1015 | OS << format("%08" PRIx32"x", opcode); | |||
1016 | } | |||
1017 | } | |||
1018 | void printInst(MCInstPrinter &IP, const MCInst *MI, ArrayRef<uint8_t> Bytes, | |||
1019 | uint64_t Address, raw_ostream &OS, StringRef Annot, | |||
1020 | MCSubtargetInfo const &STI, SourcePrinter *SP, | |||
1021 | std::vector<RelocationRef> *Rels) override { | |||
1022 | if (SP && (PrintSource || PrintLines)) | |||
1023 | SP->printSourceLine(OS, Address, ""); | |||
1024 | if (!MI) { | |||
1025 | printLead(Bytes, Address, OS); | |||
1026 | OS << " <unknown>"; | |||
1027 | return; | |||
1028 | } | |||
1029 | std::string Buffer; | |||
1030 | { | |||
1031 | raw_string_ostream TempStream(Buffer); | |||
1032 | IP.printInst(MI, TempStream, "", STI); | |||
1033 | } | |||
1034 | StringRef Contents(Buffer); | |||
1035 | // Split off bundle attributes | |||
1036 | auto PacketBundle = Contents.rsplit('\n'); | |||
1037 | // Split off first instruction from the rest | |||
1038 | auto HeadTail = PacketBundle.first.split('\n'); | |||
1039 | auto Preamble = " { "; | |||
1040 | auto Separator = ""; | |||
1041 | StringRef Fmt = "\t\t\t%08" PRIx64"l" "x" ": "; | |||
1042 | std::vector<RelocationRef>::const_iterator rel_cur = Rels->begin(); | |||
1043 | std::vector<RelocationRef>::const_iterator rel_end = Rels->end(); | |||
1044 | ||||
1045 | // Hexagon's packets require relocations to be inline rather than | |||
1046 | // clustered at the end of the packet. | |||
1047 | auto PrintReloc = [&]() -> void { | |||
1048 | while ((rel_cur != rel_end) && (rel_cur->getOffset() <= Address)) { | |||
1049 | if (rel_cur->getOffset() == Address) { | |||
1050 | SmallString<16> name; | |||
1051 | SmallString<32> val; | |||
1052 | rel_cur->getTypeName(name); | |||
1053 | error(getRelocationValueString(*rel_cur, val)); | |||
1054 | OS << Separator << format(Fmt.data(), Address) << name << "\t" << val | |||
1055 | << "\n"; | |||
1056 | return; | |||
1057 | } | |||
1058 | rel_cur++; | |||
1059 | } | |||
1060 | }; | |||
1061 | ||||
1062 | while(!HeadTail.first.empty()) { | |||
1063 | OS << Separator; | |||
1064 | Separator = "\n"; | |||
1065 | if (SP && (PrintSource || PrintLines)) | |||
1066 | SP->printSourceLine(OS, Address, ""); | |||
1067 | printLead(Bytes, Address, OS); | |||
1068 | OS << Preamble; | |||
1069 | Preamble = " "; | |||
1070 | StringRef Inst; | |||
1071 | auto Duplex = HeadTail.first.split('\v'); | |||
1072 | if(!Duplex.second.empty()){ | |||
1073 | OS << Duplex.first; | |||
1074 | OS << "; "; | |||
1075 | Inst = Duplex.second; | |||
1076 | } | |||
1077 | else | |||
1078 | Inst = HeadTail.first; | |||
1079 | OS << Inst; | |||
1080 | HeadTail = HeadTail.second.split('\n'); | |||
1081 | if (HeadTail.first.empty()) | |||
1082 | OS << " } " << PacketBundle.second; | |||
1083 | PrintReloc(); | |||
1084 | Bytes = Bytes.slice(4); | |||
1085 | Address += 4; | |||
1086 | } | |||
1087 | } | |||
1088 | }; | |||
1089 | HexagonPrettyPrinter HexagonPrettyPrinterInst; | |||
1090 | ||||
1091 | class AMDGCNPrettyPrinter : public PrettyPrinter { | |||
1092 | public: | |||
1093 | void printInst(MCInstPrinter &IP, const MCInst *MI, ArrayRef<uint8_t> Bytes, | |||
1094 | uint64_t Address, raw_ostream &OS, StringRef Annot, | |||
1095 | MCSubtargetInfo const &STI, SourcePrinter *SP, | |||
1096 | std::vector<RelocationRef> *Rels) override { | |||
1097 | if (SP && (PrintSource || PrintLines)) | |||
1098 | SP->printSourceLine(OS, Address); | |||
1099 | ||||
1100 | typedef support::ulittle32_t U32; | |||
1101 | ||||
1102 | if (MI) { | |||
1103 | SmallString<40> InstStr; | |||
1104 | raw_svector_ostream IS(InstStr); | |||
1105 | ||||
1106 | IP.printInst(MI, IS, "", STI); | |||
1107 | ||||
1108 | OS << left_justify(IS.str(), 60); | |||
1109 | } else { | |||
1110 | // an unrecognized encoding - this is probably data so represent it | |||
1111 | // using the .long directive, or .byte directive if fewer than 4 bytes | |||
1112 | // remaining | |||
1113 | if (Bytes.size() >= 4) { | |||
1114 | OS << format("\t.long 0x%08" PRIx32"x" " ", | |||
1115 | static_cast<uint32_t>(*reinterpret_cast<const U32*>(Bytes.data()))); | |||
1116 | OS.indent(42); | |||
1117 | } else { | |||
1118 | OS << format("\t.byte 0x%02" PRIx8"x", Bytes[0]); | |||
1119 | for (unsigned int i = 1; i < Bytes.size(); i++) | |||
1120 | OS << format(", 0x%02" PRIx8"x", Bytes[i]); | |||
1121 | OS.indent(55 - (6 * Bytes.size())); | |||
1122 | } | |||
1123 | } | |||
1124 | ||||
1125 | OS << format("// %012" PRIX64"l" "X" ": ", Address); | |||
1126 | if (Bytes.size() >=4) { | |||
1127 | for (auto D : makeArrayRef(reinterpret_cast<const U32*>(Bytes.data()), | |||
1128 | Bytes.size() / sizeof(U32))) | |||
1129 | // D should be explicitly casted to uint32_t here as it is passed | |||
1130 | // by format to snprintf as vararg. | |||
1131 | OS << format("%08" PRIX32"X" " ", static_cast<uint32_t>(D)); | |||
1132 | } else { | |||
1133 | for (unsigned int i = 0; i < Bytes.size(); i++) | |||
1134 | OS << format("%02" PRIX8"X" " ", Bytes[i]); | |||
1135 | } | |||
1136 | ||||
1137 | if (!Annot.empty()) | |||
1138 | OS << "// " << Annot; | |||
1139 | } | |||
1140 | }; | |||
1141 | AMDGCNPrettyPrinter AMDGCNPrettyPrinterInst; | |||
1142 | ||||
1143 | class BPFPrettyPrinter : public PrettyPrinter { | |||
1144 | public: | |||
1145 | void printInst(MCInstPrinter &IP, const MCInst *MI, ArrayRef<uint8_t> Bytes, | |||
1146 | uint64_t Address, raw_ostream &OS, StringRef Annot, | |||
1147 | MCSubtargetInfo const &STI, SourcePrinter *SP, | |||
1148 | std::vector<RelocationRef> *Rels) override { | |||
1149 | if (SP && (PrintSource || PrintLines)) | |||
1150 | SP->printSourceLine(OS, Address); | |||
1151 | if (!NoLeadingAddr) | |||
1152 | OS << format("%8" PRId64"l" "d" ":", Address / 8); | |||
1153 | if (!NoShowRawInsn) { | |||
1154 | OS << "\t"; | |||
1155 | dumpBytes(Bytes, OS); | |||
1156 | } | |||
1157 | if (MI) | |||
1158 | IP.printInst(MI, OS, "", STI); | |||
1159 | else | |||
1160 | OS << " <unknown>"; | |||
1161 | } | |||
1162 | }; | |||
1163 | BPFPrettyPrinter BPFPrettyPrinterInst; | |||
1164 | ||||
1165 | PrettyPrinter &selectPrettyPrinter(Triple const &Triple) { | |||
1166 | switch(Triple.getArch()) { | |||
1167 | default: | |||
1168 | return PrettyPrinterInst; | |||
1169 | case Triple::hexagon: | |||
1170 | return HexagonPrettyPrinterInst; | |||
1171 | case Triple::amdgcn: | |||
1172 | return AMDGCNPrettyPrinterInst; | |||
1173 | case Triple::bpfel: | |||
1174 | case Triple::bpfeb: | |||
1175 | return BPFPrettyPrinterInst; | |||
1176 | } | |||
1177 | } | |||
1178 | } | |||
1179 | ||||
1180 | static uint8_t getElfSymbolType(const ObjectFile *Obj, const SymbolRef &Sym) { | |||
1181 | assert(Obj->isELF())((Obj->isELF()) ? static_cast<void> (0) : __assert_fail ("Obj->isELF()", "/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp" , 1181, __PRETTY_FUNCTION__)); | |||
1182 | if (auto *Elf32LEObj = dyn_cast<ELF32LEObjectFile>(Obj)) | |||
1183 | return Elf32LEObj->getSymbol(Sym.getRawDataRefImpl())->getType(); | |||
1184 | if (auto *Elf64LEObj = dyn_cast<ELF64LEObjectFile>(Obj)) | |||
1185 | return Elf64LEObj->getSymbol(Sym.getRawDataRefImpl())->getType(); | |||
1186 | if (auto *Elf32BEObj = dyn_cast<ELF32BEObjectFile>(Obj)) | |||
1187 | return Elf32BEObj->getSymbol(Sym.getRawDataRefImpl())->getType(); | |||
1188 | if (auto *Elf64BEObj = cast<ELF64BEObjectFile>(Obj)) | |||
1189 | return Elf64BEObj->getSymbol(Sym.getRawDataRefImpl())->getType(); | |||
1190 | llvm_unreachable("Unsupported binary format")::llvm::llvm_unreachable_internal("Unsupported binary format" , "/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp" , 1190); | |||
1191 | } | |||
1192 | ||||
1193 | template <class ELFT> static void | |||
1194 | addDynamicElfSymbols(const ELFObjectFile<ELFT> *Obj, | |||
1195 | std::map<SectionRef, SectionSymbolsTy> &AllSymbols) { | |||
1196 | for (auto Symbol : Obj->getDynamicSymbolIterators()) { | |||
1197 | uint8_t SymbolType = Symbol.getELFType(); | |||
1198 | if (SymbolType != ELF::STT_FUNC || Symbol.getSize() == 0) | |||
1199 | continue; | |||
1200 | ||||
1201 | Expected<uint64_t> AddressOrErr = Symbol.getAddress(); | |||
1202 | if (!AddressOrErr) | |||
1203 | report_error(Obj->getFileName(), AddressOrErr.takeError()); | |||
1204 | uint64_t Address = *AddressOrErr; | |||
1205 | ||||
1206 | Expected<StringRef> Name = Symbol.getName(); | |||
1207 | if (!Name) | |||
1208 | report_error(Obj->getFileName(), Name.takeError()); | |||
1209 | if (Name->empty()) | |||
1210 | continue; | |||
1211 | ||||
1212 | Expected<section_iterator> SectionOrErr = Symbol.getSection(); | |||
1213 | if (!SectionOrErr) | |||
1214 | report_error(Obj->getFileName(), SectionOrErr.takeError()); | |||
1215 | section_iterator SecI = *SectionOrErr; | |||
1216 | if (SecI == Obj->section_end()) | |||
1217 | continue; | |||
1218 | ||||
1219 | AllSymbols[*SecI].emplace_back(Address, *Name, SymbolType); | |||
1220 | } | |||
1221 | } | |||
1222 | ||||
1223 | static void | |||
1224 | addDynamicElfSymbols(const ObjectFile *Obj, | |||
1225 | std::map<SectionRef, SectionSymbolsTy> &AllSymbols) { | |||
1226 | assert(Obj->isELF())((Obj->isELF()) ? static_cast<void> (0) : __assert_fail ("Obj->isELF()", "/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp" , 1226, __PRETTY_FUNCTION__)); | |||
1227 | if (auto *Elf32LEObj = dyn_cast<ELF32LEObjectFile>(Obj)) | |||
1228 | addDynamicElfSymbols(Elf32LEObj, AllSymbols); | |||
1229 | else if (auto *Elf64LEObj = dyn_cast<ELF64LEObjectFile>(Obj)) | |||
1230 | addDynamicElfSymbols(Elf64LEObj, AllSymbols); | |||
1231 | else if (auto *Elf32BEObj = dyn_cast<ELF32BEObjectFile>(Obj)) | |||
1232 | addDynamicElfSymbols(Elf32BEObj, AllSymbols); | |||
1233 | else if (auto *Elf64BEObj = cast<ELF64BEObjectFile>(Obj)) | |||
1234 | addDynamicElfSymbols(Elf64BEObj, AllSymbols); | |||
1235 | else | |||
1236 | llvm_unreachable("Unsupported binary format")::llvm::llvm_unreachable_internal("Unsupported binary format" , "/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp" , 1236); | |||
1237 | } | |||
1238 | ||||
1239 | static void addPltEntries(const ObjectFile *Obj, | |||
1240 | std::map<SectionRef, SectionSymbolsTy> &AllSymbols, | |||
1241 | StringSaver &Saver) { | |||
1242 | Optional<SectionRef> Plt = None; | |||
1243 | for (const SectionRef &Section : Obj->sections()) { | |||
1244 | StringRef Name; | |||
1245 | if (Section.getName(Name)) | |||
1246 | continue; | |||
1247 | if (Name == ".plt") | |||
1248 | Plt = Section; | |||
1249 | } | |||
1250 | if (!Plt) | |||
1251 | return; | |||
1252 | if (auto *ElfObj = dyn_cast<ELFObjectFileBase>(Obj)) { | |||
1253 | for (auto PltEntry : ElfObj->getPltAddresses()) { | |||
1254 | SymbolRef Symbol(PltEntry.first, ElfObj); | |||
1255 | ||||
1256 | uint8_t SymbolType = getElfSymbolType(Obj, Symbol); | |||
1257 | ||||
1258 | Expected<StringRef> NameOrErr = Symbol.getName(); | |||
1259 | if (!NameOrErr) | |||
1260 | report_error(Obj->getFileName(), NameOrErr.takeError()); | |||
1261 | if (NameOrErr->empty()) | |||
1262 | continue; | |||
1263 | StringRef Name = Saver.save((*NameOrErr + "@plt").str()); | |||
1264 | ||||
1265 | AllSymbols[*Plt].emplace_back(PltEntry.second, Name, SymbolType); | |||
1266 | } | |||
1267 | } | |||
1268 | } | |||
1269 | ||||
1270 | static void DisassembleObject(const ObjectFile *Obj, bool InlineRelocs) { | |||
1271 | if (StartAddress > StopAddress) | |||
1272 | error("Start address should be less than stop address"); | |||
1273 | ||||
1274 | const Target *TheTarget = getTarget(Obj); | |||
1275 | ||||
1276 | // Package up features to be passed to target/subtarget | |||
1277 | SubtargetFeatures Features = Obj->getFeatures(); | |||
1278 | if (MAttrs.size()) { | |||
1279 | for (unsigned i = 0; i != MAttrs.size(); ++i) | |||
1280 | Features.AddFeature(MAttrs[i]); | |||
1281 | } | |||
1282 | ||||
1283 | std::unique_ptr<const MCRegisterInfo> MRI( | |||
1284 | TheTarget->createMCRegInfo(TripleName)); | |||
1285 | if (!MRI) | |||
1286 | report_error(Obj->getFileName(), "no register info for target " + | |||
1287 | TripleName); | |||
1288 | ||||
1289 | // Set up disassembler. | |||
1290 | std::unique_ptr<const MCAsmInfo> AsmInfo( | |||
1291 | TheTarget->createMCAsmInfo(*MRI, TripleName)); | |||
1292 | if (!AsmInfo) | |||
1293 | report_error(Obj->getFileName(), "no assembly info for target " + | |||
1294 | TripleName); | |||
1295 | std::unique_ptr<const MCSubtargetInfo> STI( | |||
1296 | TheTarget->createMCSubtargetInfo(TripleName, MCPU, Features.getString())); | |||
1297 | if (!STI) | |||
1298 | report_error(Obj->getFileName(), "no subtarget info for target " + | |||
1299 | TripleName); | |||
1300 | std::unique_ptr<const MCInstrInfo> MII(TheTarget->createMCInstrInfo()); | |||
1301 | if (!MII) | |||
1302 | report_error(Obj->getFileName(), "no instruction info for target " + | |||
1303 | TripleName); | |||
1304 | MCObjectFileInfo MOFI; | |||
1305 | MCContext Ctx(AsmInfo.get(), MRI.get(), &MOFI); | |||
1306 | // FIXME: for now initialize MCObjectFileInfo with default values | |||
1307 | MOFI.InitMCObjectFileInfo(Triple(TripleName), false, Ctx); | |||
1308 | ||||
1309 | std::unique_ptr<MCDisassembler> DisAsm( | |||
1310 | TheTarget->createMCDisassembler(*STI, Ctx)); | |||
1311 | if (!DisAsm) | |||
1312 | report_error(Obj->getFileName(), "no disassembler for target " + | |||
1313 | TripleName); | |||
1314 | ||||
1315 | std::unique_ptr<const MCInstrAnalysis> MIA( | |||
1316 | TheTarget->createMCInstrAnalysis(MII.get())); | |||
1317 | ||||
1318 | int AsmPrinterVariant = AsmInfo->getAssemblerDialect(); | |||
1319 | std::unique_ptr<MCInstPrinter> IP(TheTarget->createMCInstPrinter( | |||
1320 | Triple(TripleName), AsmPrinterVariant, *AsmInfo, *MII, *MRI)); | |||
1321 | if (!IP) | |||
1322 | report_error(Obj->getFileName(), "no instruction printer for target " + | |||
1323 | TripleName); | |||
1324 | IP->setPrintImmHex(PrintImmHex); | |||
1325 | PrettyPrinter &PIP = selectPrettyPrinter(Triple(TripleName)); | |||
1326 | ||||
1327 | StringRef Fmt = Obj->getBytesInAddress() > 4 ? "\t\t%016" PRIx64"l" "x" ": " : | |||
1328 | "\t\t\t%08" PRIx64"l" "x" ": "; | |||
1329 | ||||
1330 | SourcePrinter SP(Obj, TheTarget->getName()); | |||
1331 | ||||
1332 | // Create a mapping, RelocSecs = SectionRelocMap[S], where sections | |||
1333 | // in RelocSecs contain the relocations for section S. | |||
1334 | std::error_code EC; | |||
1335 | std::map<SectionRef, SmallVector<SectionRef, 1>> SectionRelocMap; | |||
1336 | for (const SectionRef &Section : ToolSectionFilter(*Obj)) { | |||
1337 | section_iterator Sec2 = Section.getRelocatedSection(); | |||
1338 | if (Sec2 != Obj->section_end()) | |||
1339 | SectionRelocMap[*Sec2].push_back(Section); | |||
1340 | } | |||
1341 | ||||
1342 | // Create a mapping from virtual address to symbol name. This is used to | |||
1343 | // pretty print the symbols while disassembling. | |||
1344 | std::map<SectionRef, SectionSymbolsTy> AllSymbols; | |||
1345 | SectionSymbolsTy AbsoluteSymbols; | |||
1346 | for (const SymbolRef &Symbol : Obj->symbols()) { | |||
1347 | Expected<uint64_t> AddressOrErr = Symbol.getAddress(); | |||
1348 | if (!AddressOrErr) | |||
1349 | report_error(Obj->getFileName(), AddressOrErr.takeError()); | |||
1350 | uint64_t Address = *AddressOrErr; | |||
1351 | ||||
1352 | Expected<StringRef> Name = Symbol.getName(); | |||
1353 | if (!Name) | |||
1354 | report_error(Obj->getFileName(), Name.takeError()); | |||
1355 | if (Name->empty()) | |||
1356 | continue; | |||
1357 | ||||
1358 | Expected<section_iterator> SectionOrErr = Symbol.getSection(); | |||
1359 | if (!SectionOrErr) | |||
1360 | report_error(Obj->getFileName(), SectionOrErr.takeError()); | |||
1361 | ||||
1362 | uint8_t SymbolType = ELF::STT_NOTYPE; | |||
1363 | if (Obj->isELF()) | |||
1364 | SymbolType = getElfSymbolType(Obj, Symbol); | |||
1365 | ||||
1366 | section_iterator SecI = *SectionOrErr; | |||
1367 | if (SecI != Obj->section_end()) | |||
1368 | AllSymbols[*SecI].emplace_back(Address, *Name, SymbolType); | |||
1369 | else | |||
1370 | AbsoluteSymbols.emplace_back(Address, *Name, SymbolType); | |||
1371 | ||||
1372 | ||||
1373 | } | |||
1374 | if (AllSymbols.empty() && Obj->isELF()) | |||
1375 | addDynamicElfSymbols(Obj, AllSymbols); | |||
1376 | ||||
1377 | BumpPtrAllocator A; | |||
1378 | StringSaver Saver(A); | |||
1379 | addPltEntries(Obj, AllSymbols, Saver); | |||
1380 | ||||
1381 | // Create a mapping from virtual address to section. | |||
1382 | std::vector<std::pair<uint64_t, SectionRef>> SectionAddresses; | |||
1383 | for (SectionRef Sec : Obj->sections()) | |||
1384 | SectionAddresses.emplace_back(Sec.getAddress(), Sec); | |||
1385 | array_pod_sort(SectionAddresses.begin(), SectionAddresses.end()); | |||
1386 | ||||
1387 | // Linked executables (.exe and .dll files) typically don't include a real | |||
1388 | // symbol table but they might contain an export table. | |||
1389 | if (const auto *COFFObj = dyn_cast<COFFObjectFile>(Obj)) { | |||
1390 | for (const auto &ExportEntry : COFFObj->export_directories()) { | |||
1391 | StringRef Name; | |||
1392 | error(ExportEntry.getSymbolName(Name)); | |||
1393 | if (Name.empty()) | |||
1394 | continue; | |||
1395 | uint32_t RVA; | |||
1396 | error(ExportEntry.getExportRVA(RVA)); | |||
1397 | ||||
1398 | uint64_t VA = COFFObj->getImageBase() + RVA; | |||
1399 | auto Sec = std::upper_bound( | |||
1400 | SectionAddresses.begin(), SectionAddresses.end(), VA, | |||
1401 | [](uint64_t LHS, const std::pair<uint64_t, SectionRef> &RHS) { | |||
1402 | return LHS < RHS.first; | |||
1403 | }); | |||
1404 | if (Sec != SectionAddresses.begin()) | |||
1405 | --Sec; | |||
1406 | else | |||
1407 | Sec = SectionAddresses.end(); | |||
1408 | ||||
1409 | if (Sec != SectionAddresses.end()) | |||
1410 | AllSymbols[Sec->second].emplace_back(VA, Name, ELF::STT_NOTYPE); | |||
1411 | else | |||
1412 | AbsoluteSymbols.emplace_back(VA, Name, ELF::STT_NOTYPE); | |||
1413 | } | |||
1414 | } | |||
1415 | ||||
1416 | // Sort all the symbols, this allows us to use a simple binary search to find | |||
1417 | // a symbol near an address. | |||
1418 | for (std::pair<const SectionRef, SectionSymbolsTy> &SecSyms : AllSymbols) | |||
1419 | array_pod_sort(SecSyms.second.begin(), SecSyms.second.end()); | |||
1420 | array_pod_sort(AbsoluteSymbols.begin(), AbsoluteSymbols.end()); | |||
1421 | ||||
1422 | for (const SectionRef &Section : ToolSectionFilter(*Obj)) { | |||
1423 | if (!DisassembleAll && (!Section.isText() || Section.isVirtual())) | |||
1424 | continue; | |||
1425 | ||||
1426 | uint64_t SectionAddr = Section.getAddress(); | |||
1427 | uint64_t SectSize = Section.getSize(); | |||
1428 | if (!SectSize) | |||
1429 | continue; | |||
1430 | ||||
1431 | // Get the list of all the symbols in this section. | |||
1432 | SectionSymbolsTy &Symbols = AllSymbols[Section]; | |||
1433 | std::vector<uint64_t> DataMappingSymsAddr; | |||
1434 | std::vector<uint64_t> TextMappingSymsAddr; | |||
1435 | if (isArmElf(Obj)) { | |||
1436 | for (const auto &Symb : Symbols) { | |||
1437 | uint64_t Address = std::get<0>(Symb); | |||
1438 | StringRef Name = std::get<1>(Symb); | |||
1439 | if (Name.startswith("$d")) | |||
1440 | DataMappingSymsAddr.push_back(Address - SectionAddr); | |||
1441 | if (Name.startswith("$x")) | |||
1442 | TextMappingSymsAddr.push_back(Address - SectionAddr); | |||
1443 | if (Name.startswith("$a")) | |||
1444 | TextMappingSymsAddr.push_back(Address - SectionAddr); | |||
1445 | if (Name.startswith("$t")) | |||
1446 | TextMappingSymsAddr.push_back(Address - SectionAddr); | |||
1447 | } | |||
1448 | } | |||
1449 | ||||
1450 | llvm::sort(DataMappingSymsAddr); | |||
1451 | llvm::sort(TextMappingSymsAddr); | |||
1452 | ||||
1453 | if (Obj->isELF() && Obj->getArch() == Triple::amdgcn) { | |||
1454 | // AMDGPU disassembler uses symbolizer for printing labels | |||
1455 | std::unique_ptr<MCRelocationInfo> RelInfo( | |||
1456 | TheTarget->createMCRelocationInfo(TripleName, Ctx)); | |||
1457 | if (RelInfo) { | |||
1458 | std::unique_ptr<MCSymbolizer> Symbolizer( | |||
1459 | TheTarget->createMCSymbolizer( | |||
1460 | TripleName, nullptr, nullptr, &Symbols, &Ctx, std::move(RelInfo))); | |||
1461 | DisAsm->setSymbolizer(std::move(Symbolizer)); | |||
1462 | } | |||
1463 | } | |||
1464 | ||||
1465 | // Make a list of all the relocations for this section. | |||
1466 | std::vector<RelocationRef> Rels; | |||
1467 | if (InlineRelocs) { | |||
1468 | for (const SectionRef &RelocSec : SectionRelocMap[Section]) { | |||
1469 | for (const RelocationRef &Reloc : RelocSec.relocations()) { | |||
1470 | Rels.push_back(Reloc); | |||
1471 | } | |||
1472 | } | |||
1473 | } | |||
1474 | ||||
1475 | // Sort relocations by address. | |||
1476 | llvm::sort(Rels, RelocAddressLess); | |||
1477 | ||||
1478 | StringRef SegmentName = ""; | |||
1479 | if (const MachOObjectFile *MachO = dyn_cast<const MachOObjectFile>(Obj)) { | |||
1480 | DataRefImpl DR = Section.getRawDataRefImpl(); | |||
1481 | SegmentName = MachO->getSectionFinalSegmentName(DR); | |||
1482 | } | |||
1483 | StringRef SectionName; | |||
1484 | error(Section.getName(SectionName)); | |||
1485 | ||||
1486 | // If the section has no symbol at the start, just insert a dummy one. | |||
1487 | if (Symbols.empty() || std::get<0>(Symbols[0]) != 0) { | |||
1488 | Symbols.insert( | |||
1489 | Symbols.begin(), | |||
1490 | std::make_tuple(SectionAddr, SectionName, | |||
1491 | Section.isText() ? ELF::STT_FUNC : ELF::STT_OBJECT)); | |||
1492 | } | |||
1493 | ||||
1494 | SmallString<40> Comments; | |||
1495 | raw_svector_ostream CommentStream(Comments); | |||
1496 | ||||
1497 | StringRef BytesStr; | |||
1498 | error(Section.getContents(BytesStr)); | |||
1499 | ArrayRef<uint8_t> Bytes(reinterpret_cast<const uint8_t *>(BytesStr.data()), | |||
1500 | BytesStr.size()); | |||
1501 | ||||
1502 | uint64_t Size; | |||
1503 | uint64_t Index; | |||
1504 | bool PrintedSection = false; | |||
1505 | ||||
1506 | std::vector<RelocationRef>::const_iterator rel_cur = Rels.begin(); | |||
1507 | std::vector<RelocationRef>::const_iterator rel_end = Rels.end(); | |||
1508 | // Disassemble symbol by symbol. | |||
1509 | for (unsigned si = 0, se = Symbols.size(); si != se; ++si) { | |||
1510 | uint64_t Start = std::get<0>(Symbols[si]) - SectionAddr; | |||
1511 | // The end is either the section end or the beginning of the next | |||
1512 | // symbol. | |||
1513 | uint64_t End = | |||
1514 | (si == se - 1) ? SectSize : std::get<0>(Symbols[si + 1]) - SectionAddr; | |||
1515 | // Don't try to disassemble beyond the end of section contents. | |||
1516 | if (End > SectSize) | |||
1517 | End = SectSize; | |||
1518 | // If this symbol has the same address as the next symbol, then skip it. | |||
1519 | if (Start >= End) | |||
1520 | continue; | |||
1521 | ||||
1522 | // Check if we need to skip symbol | |||
1523 | // Skip if the symbol's data is not between StartAddress and StopAddress | |||
1524 | if (End + SectionAddr < StartAddress || | |||
1525 | Start + SectionAddr > StopAddress) { | |||
1526 | continue; | |||
1527 | } | |||
1528 | ||||
1529 | /// Skip if user requested specific symbols and this is not in the list | |||
1530 | if (!DisasmFuncsSet.empty() && | |||
1531 | !DisasmFuncsSet.count(std::get<1>(Symbols[si]))) | |||
1532 | continue; | |||
1533 | ||||
1534 | if (!PrintedSection) { | |||
1535 | PrintedSection = true; | |||
1536 | outs() << "Disassembly of section "; | |||
1537 | if (!SegmentName.empty()) | |||
1538 | outs() << SegmentName << ","; | |||
1539 | outs() << SectionName << ':'; | |||
1540 | } | |||
1541 | ||||
1542 | // Stop disassembly at the stop address specified | |||
1543 | if (End + SectionAddr > StopAddress) | |||
1544 | End = StopAddress - SectionAddr; | |||
1545 | ||||
1546 | if (Obj->isELF() && Obj->getArch() == Triple::amdgcn) { | |||
1547 | if (std::get<2>(Symbols[si]) == ELF::STT_AMDGPU_HSA_KERNEL) { | |||
1548 | // skip amd_kernel_code_t at the begining of kernel symbol (256 bytes) | |||
1549 | Start += 256; | |||
1550 | } | |||
1551 | if (si == se - 1 || | |||
1552 | std::get<2>(Symbols[si + 1]) == ELF::STT_AMDGPU_HSA_KERNEL) { | |||
1553 | // cut trailing zeroes at the end of kernel | |||
1554 | // cut up to 256 bytes | |||
1555 | const uint64_t EndAlign = 256; | |||
1556 | const auto Limit = End - (std::min)(EndAlign, End - Start); | |||
1557 | while (End > Limit && | |||
1558 | *reinterpret_cast<const support::ulittle32_t*>(&Bytes[End - 4]) == 0) | |||
1559 | End -= 4; | |||
1560 | } | |||
1561 | } | |||
1562 | ||||
1563 | auto PrintSymbol = [](StringRef Name) { | |||
1564 | outs() << '\n' << Name << ":\n"; | |||
1565 | }; | |||
1566 | StringRef SymbolName = std::get<1>(Symbols[si]); | |||
1567 | if (Demangle) { | |||
1568 | char *DemangledSymbol = nullptr; | |||
1569 | size_t Size = 0; | |||
1570 | int Status = -1; | |||
1571 | if (SymbolName.startswith("_Z")) | |||
1572 | DemangledSymbol = itaniumDemangle(SymbolName.data(), DemangledSymbol, | |||
1573 | &Size, &Status); | |||
1574 | else if (SymbolName.startswith("?")) | |||
1575 | DemangledSymbol = microsoftDemangle(SymbolName.data(), | |||
1576 | DemangledSymbol, &Size, &Status); | |||
1577 | ||||
1578 | if (Status == 0 && DemangledSymbol) | |||
1579 | PrintSymbol(StringRef(DemangledSymbol)); | |||
1580 | else | |||
1581 | PrintSymbol(SymbolName); | |||
1582 | ||||
1583 | if (DemangledSymbol) | |||
1584 | free(DemangledSymbol); | |||
1585 | } else | |||
1586 | PrintSymbol(SymbolName); | |||
1587 | ||||
1588 | // Don't print raw contents of a virtual section. A virtual section | |||
1589 | // doesn't have any contents in the file. | |||
1590 | if (Section.isVirtual()) { | |||
1591 | outs() << "...\n"; | |||
1592 | continue; | |||
1593 | } | |||
1594 | ||||
1595 | #ifndef NDEBUG | |||
1596 | raw_ostream &DebugOut = DebugFlag ? dbgs() : nulls(); | |||
1597 | #else | |||
1598 | raw_ostream &DebugOut = nulls(); | |||
1599 | #endif | |||
1600 | ||||
1601 | for (Index = Start; Index < End; Index += Size) { | |||
1602 | MCInst Inst; | |||
1603 | ||||
1604 | if (Index + SectionAddr < StartAddress || | |||
1605 | Index + SectionAddr > StopAddress) { | |||
1606 | // skip byte by byte till StartAddress is reached | |||
1607 | Size = 1; | |||
1608 | continue; | |||
1609 | } | |||
1610 | // AArch64 ELF binaries can interleave data and text in the | |||
1611 | // same section. We rely on the markers introduced to | |||
1612 | // understand what we need to dump. If the data marker is within a | |||
1613 | // function, it is denoted as a word/short etc | |||
1614 | if (isArmElf(Obj) && std::get<2>(Symbols[si]) != ELF::STT_OBJECT && | |||
1615 | !DisassembleAll) { | |||
1616 | uint64_t Stride = 0; | |||
1617 | ||||
1618 | auto DAI = std::lower_bound(DataMappingSymsAddr.begin(), | |||
1619 | DataMappingSymsAddr.end(), Index); | |||
1620 | if (DAI != DataMappingSymsAddr.end() && *DAI == Index) { | |||
1621 | // Switch to data. | |||
1622 | while (Index < End) { | |||
1623 | outs() << format("%8" PRIx64"l" "x" ":", SectionAddr + Index); | |||
1624 | outs() << "\t"; | |||
1625 | if (Index + 4 <= End) { | |||
1626 | Stride = 4; | |||
1627 | dumpBytes(Bytes.slice(Index, 4), outs()); | |||
1628 | outs() << "\t.word\t"; | |||
1629 | uint32_t Data = 0; | |||
1630 | if (Obj->isLittleEndian()) { | |||
1631 | const auto Word = | |||
1632 | reinterpret_cast<const support::ulittle32_t *>( | |||
1633 | Bytes.data() + Index); | |||
1634 | Data = *Word; | |||
1635 | } else { | |||
1636 | const auto Word = reinterpret_cast<const support::ubig32_t *>( | |||
1637 | Bytes.data() + Index); | |||
1638 | Data = *Word; | |||
1639 | } | |||
1640 | outs() << "0x" << format("%08" PRIx32"x", Data); | |||
1641 | } else if (Index + 2 <= End) { | |||
1642 | Stride = 2; | |||
1643 | dumpBytes(Bytes.slice(Index, 2), outs()); | |||
1644 | outs() << "\t\t.short\t"; | |||
1645 | uint16_t Data = 0; | |||
1646 | if (Obj->isLittleEndian()) { | |||
1647 | const auto Short = | |||
1648 | reinterpret_cast<const support::ulittle16_t *>( | |||
1649 | Bytes.data() + Index); | |||
1650 | Data = *Short; | |||
1651 | } else { | |||
1652 | const auto Short = | |||
1653 | reinterpret_cast<const support::ubig16_t *>(Bytes.data() + | |||
1654 | Index); | |||
1655 | Data = *Short; | |||
1656 | } | |||
1657 | outs() << "0x" << format("%04" PRIx16"x", Data); | |||
1658 | } else { | |||
1659 | Stride = 1; | |||
1660 | dumpBytes(Bytes.slice(Index, 1), outs()); | |||
1661 | outs() << "\t\t.byte\t"; | |||
1662 | outs() << "0x" << format("%02" PRIx8"x", Bytes.slice(Index, 1)[0]); | |||
1663 | } | |||
1664 | Index += Stride; | |||
1665 | outs() << "\n"; | |||
1666 | auto TAI = std::lower_bound(TextMappingSymsAddr.begin(), | |||
1667 | TextMappingSymsAddr.end(), Index); | |||
1668 | if (TAI != TextMappingSymsAddr.end() && *TAI == Index) | |||
1669 | break; | |||
1670 | } | |||
1671 | } | |||
1672 | } | |||
1673 | ||||
1674 | // If there is a data symbol inside an ELF text section and we are only | |||
1675 | // disassembling text (applicable all architectures), | |||
1676 | // we are in a situation where we must print the data and not | |||
1677 | // disassemble it. | |||
1678 | if (Obj->isELF() && std::get<2>(Symbols[si]) == ELF::STT_OBJECT && | |||
1679 | !DisassembleAll && Section.isText()) { | |||
1680 | // print out data up to 8 bytes at a time in hex and ascii | |||
1681 | uint8_t AsciiData[9] = {'\0'}; | |||
1682 | uint8_t Byte; | |||
1683 | int NumBytes = 0; | |||
1684 | ||||
1685 | for (Index = Start; Index < End; Index += 1) { | |||
1686 | if (((SectionAddr + Index) < StartAddress) || | |||
1687 | ((SectionAddr + Index) > StopAddress)) | |||
1688 | continue; | |||
1689 | if (NumBytes == 0) { | |||
1690 | outs() << format("%8" PRIx64"l" "x" ":", SectionAddr + Index); | |||
1691 | outs() << "\t"; | |||
1692 | } | |||
1693 | Byte = Bytes.slice(Index)[0]; | |||
1694 | outs() << format(" %02x", Byte); | |||
1695 | AsciiData[NumBytes] = isPrint(Byte) ? Byte : '.'; | |||
1696 | ||||
1697 | uint8_t IndentOffset = 0; | |||
1698 | NumBytes++; | |||
1699 | if (Index == End - 1 || NumBytes > 8) { | |||
1700 | // Indent the space for less than 8 bytes data. | |||
1701 | // 2 spaces for byte and one for space between bytes | |||
1702 | IndentOffset = 3 * (8 - NumBytes); | |||
1703 | for (int Excess = 8 - NumBytes; Excess < 8; Excess++) | |||
1704 | AsciiData[Excess] = '\0'; | |||
1705 | NumBytes = 8; | |||
1706 | } | |||
1707 | if (NumBytes == 8) { | |||
1708 | AsciiData[8] = '\0'; | |||
1709 | outs() << std::string(IndentOffset, ' ') << " "; | |||
1710 | outs() << reinterpret_cast<char *>(AsciiData); | |||
1711 | outs() << '\n'; | |||
1712 | NumBytes = 0; | |||
1713 | } | |||
1714 | } | |||
1715 | } | |||
1716 | if (Index >= End) | |||
1717 | break; | |||
1718 | ||||
1719 | // Disassemble a real instruction or a data when disassemble all is | |||
1720 | // provided | |||
1721 | bool Disassembled = DisAsm->getInstruction(Inst, Size, Bytes.slice(Index), | |||
1722 | SectionAddr + Index, DebugOut, | |||
1723 | CommentStream); | |||
1724 | if (Size == 0) | |||
1725 | Size = 1; | |||
1726 | ||||
1727 | PIP.printInst(*IP, Disassembled ? &Inst : nullptr, | |||
1728 | Bytes.slice(Index, Size), SectionAddr + Index, outs(), "", | |||
1729 | *STI, &SP, &Rels); | |||
1730 | outs() << CommentStream.str(); | |||
1731 | Comments.clear(); | |||
1732 | ||||
1733 | // Try to resolve the target of a call, tail call, etc. to a specific | |||
1734 | // symbol. | |||
1735 | if (MIA && (MIA->isCall(Inst) || MIA->isUnconditionalBranch(Inst) || | |||
1736 | MIA->isConditionalBranch(Inst))) { | |||
1737 | uint64_t Target; | |||
1738 | if (MIA->evaluateBranch(Inst, SectionAddr + Index, Size, Target)) { | |||
1739 | // In a relocatable object, the target's section must reside in | |||
1740 | // the same section as the call instruction or it is accessed | |||
1741 | // through a relocation. | |||
1742 | // | |||
1743 | // In a non-relocatable object, the target may be in any section. | |||
1744 | // | |||
1745 | // N.B. We don't walk the relocations in the relocatable case yet. | |||
1746 | auto *TargetSectionSymbols = &Symbols; | |||
1747 | if (!Obj->isRelocatableObject()) { | |||
1748 | auto SectionAddress = std::upper_bound( | |||
1749 | SectionAddresses.begin(), SectionAddresses.end(), Target, | |||
1750 | [](uint64_t LHS, | |||
1751 | const std::pair<uint64_t, SectionRef> &RHS) { | |||
1752 | return LHS < RHS.first; | |||
1753 | }); | |||
1754 | if (SectionAddress != SectionAddresses.begin()) { | |||
1755 | --SectionAddress; | |||
1756 | TargetSectionSymbols = &AllSymbols[SectionAddress->second]; | |||
1757 | } else { | |||
1758 | TargetSectionSymbols = &AbsoluteSymbols; | |||
1759 | } | |||
1760 | } | |||
1761 | ||||
1762 | // Find the first symbol in the section whose offset is less than | |||
1763 | // or equal to the target. If there isn't a section that contains | |||
1764 | // the target, find the nearest preceding absolute symbol. | |||
1765 | auto TargetSym = std::upper_bound( | |||
1766 | TargetSectionSymbols->begin(), TargetSectionSymbols->end(), | |||
1767 | Target, [](uint64_t LHS, | |||
1768 | const std::tuple<uint64_t, StringRef, uint8_t> &RHS) { | |||
1769 | return LHS < std::get<0>(RHS); | |||
1770 | }); | |||
1771 | if (TargetSym == TargetSectionSymbols->begin()) { | |||
1772 | TargetSectionSymbols = &AbsoluteSymbols; | |||
1773 | TargetSym = std::upper_bound( | |||
1774 | AbsoluteSymbols.begin(), AbsoluteSymbols.end(), | |||
1775 | Target, [](uint64_t LHS, | |||
1776 | const std::tuple<uint64_t, StringRef, uint8_t> &RHS) { | |||
1777 | return LHS < std::get<0>(RHS); | |||
1778 | }); | |||
1779 | } | |||
1780 | if (TargetSym != TargetSectionSymbols->begin()) { | |||
1781 | --TargetSym; | |||
1782 | uint64_t TargetAddress = std::get<0>(*TargetSym); | |||
1783 | StringRef TargetName = std::get<1>(*TargetSym); | |||
1784 | outs() << " <" << TargetName; | |||
1785 | uint64_t Disp = Target - TargetAddress; | |||
1786 | if (Disp) | |||
1787 | outs() << "+0x" << Twine::utohexstr(Disp); | |||
1788 | outs() << '>'; | |||
1789 | } | |||
1790 | } | |||
1791 | } | |||
1792 | outs() << "\n"; | |||
1793 | ||||
1794 | // Hexagon does this in pretty printer | |||
1795 | if (Obj->getArch() != Triple::hexagon) | |||
1796 | // Print relocation for instruction. | |||
1797 | while (rel_cur != rel_end) { | |||
1798 | bool hidden = getHidden(*rel_cur); | |||
1799 | uint64_t addr = rel_cur->getOffset(); | |||
1800 | SmallString<16> name; | |||
1801 | SmallString<32> val; | |||
1802 | ||||
1803 | // If this relocation is hidden, skip it. | |||
1804 | if (hidden || ((SectionAddr + addr) < StartAddress)) { | |||
1805 | ++rel_cur; | |||
1806 | continue; | |||
1807 | } | |||
1808 | ||||
1809 | // Stop when rel_cur's address is past the current instruction. | |||
1810 | if (addr >= Index + Size) break; | |||
1811 | rel_cur->getTypeName(name); | |||
1812 | error(getRelocationValueString(*rel_cur, val)); | |||
1813 | outs() << format(Fmt.data(), SectionAddr + addr) << name | |||
1814 | << "\t" << val << "\n"; | |||
1815 | ++rel_cur; | |||
1816 | } | |||
1817 | } | |||
1818 | } | |||
1819 | } | |||
1820 | } | |||
1821 | ||||
1822 | void llvm::PrintRelocations(const ObjectFile *Obj) { | |||
1823 | StringRef Fmt = Obj->getBytesInAddress() > 4 ? "%016" PRIx64"l" "x" : | |||
1824 | "%08" PRIx64"l" "x"; | |||
1825 | // Regular objdump doesn't print relocations in non-relocatable object | |||
1826 | // files. | |||
1827 | if (!Obj->isRelocatableObject()) | |||
1828 | return; | |||
1829 | ||||
1830 | for (const SectionRef &Section : ToolSectionFilter(*Obj)) { | |||
1831 | if (Section.relocation_begin() == Section.relocation_end()) | |||
1832 | continue; | |||
1833 | StringRef secname; | |||
1834 | error(Section.getName(secname)); | |||
1835 | outs() << "RELOCATION RECORDS FOR [" << secname << "]:\n"; | |||
1836 | for (const RelocationRef &Reloc : Section.relocations()) { | |||
1837 | bool hidden = getHidden(Reloc); | |||
1838 | uint64_t address = Reloc.getOffset(); | |||
1839 | SmallString<32> relocname; | |||
1840 | SmallString<32> valuestr; | |||
1841 | if (address < StartAddress || address > StopAddress || hidden) | |||
1842 | continue; | |||
1843 | Reloc.getTypeName(relocname); | |||
1844 | error(getRelocationValueString(Reloc, valuestr)); | |||
1845 | outs() << format(Fmt.data(), address) << " " << relocname << " " | |||
1846 | << valuestr << "\n"; | |||
1847 | } | |||
1848 | outs() << "\n"; | |||
1849 | } | |||
1850 | } | |||
1851 | ||||
1852 | void llvm::PrintDynamicRelocations(const ObjectFile *Obj) { | |||
1853 | ||||
1854 | // For the moment, this option is for ELF only | |||
1855 | if (!Obj->isELF()) | |||
1856 | return; | |||
1857 | ||||
1858 | const auto *Elf = dyn_cast<ELFObjectFileBase>(Obj); | |||
1859 | ||||
1860 | if (!Elf || Elf->getEType() != ELF::ET_DYN) { | |||
1861 | error("not a dynamic object"); | |||
1862 | return; | |||
1863 | } | |||
1864 | ||||
1865 | StringRef Fmt = Obj->getBytesInAddress() > 4 ? "%016" PRIx64"l" "x" : "%08" PRIx64"l" "x"; | |||
1866 | ||||
1867 | std::vector<SectionRef> DynRelSec = Obj->dynamic_relocation_sections(); | |||
1868 | if (DynRelSec.empty()) | |||
1869 | return; | |||
1870 | ||||
1871 | outs() << "DYNAMIC RELOCATION RECORDS\n"; | |||
1872 | for (const SectionRef &Section : DynRelSec) { | |||
1873 | if (Section.relocation_begin() == Section.relocation_end()) | |||
1874 | continue; | |||
1875 | for (const RelocationRef &Reloc : Section.relocations()) { | |||
1876 | uint64_t address = Reloc.getOffset(); | |||
1877 | SmallString<32> relocname; | |||
1878 | SmallString<32> valuestr; | |||
1879 | Reloc.getTypeName(relocname); | |||
1880 | error(getRelocationValueString(Reloc, valuestr)); | |||
1881 | outs() << format(Fmt.data(), address) << " " << relocname << " " | |||
1882 | << valuestr << "\n"; | |||
1883 | } | |||
1884 | } | |||
1885 | } | |||
1886 | ||||
1887 | void llvm::PrintSectionHeaders(const ObjectFile *Obj) { | |||
1888 | outs() << "Sections:\n" | |||
1889 | "Idx Name Size Address Type\n"; | |||
1890 | for (const SectionRef &Section : ToolSectionFilter(*Obj)) { | |||
1891 | StringRef Name; | |||
1892 | error(Section.getName(Name)); | |||
1893 | uint64_t Address = Section.getAddress(); | |||
1894 | uint64_t Size = Section.getSize(); | |||
1895 | bool Text = Section.isText(); | |||
1896 | bool Data = Section.isData(); | |||
1897 | bool BSS = Section.isBSS(); | |||
1898 | std::string Type = (std::string(Text ? "TEXT " : "") + | |||
1899 | (Data ? "DATA " : "") + (BSS ? "BSS" : "")); | |||
1900 | outs() << format("%3d %-13s %08" PRIx64"l" "x" " %016" PRIx64"l" "x" " %s\n", | |||
1901 | (unsigned)Section.getIndex(), Name.str().c_str(), Size, | |||
1902 | Address, Type.c_str()); | |||
1903 | } | |||
1904 | } | |||
1905 | ||||
1906 | void llvm::PrintSectionContents(const ObjectFile *Obj) { | |||
1907 | std::error_code EC; | |||
1908 | for (const SectionRef &Section : ToolSectionFilter(*Obj)) { | |||
1909 | StringRef Name; | |||
1910 | StringRef Contents; | |||
1911 | error(Section.getName(Name)); | |||
1912 | uint64_t BaseAddr = Section.getAddress(); | |||
1913 | uint64_t Size = Section.getSize(); | |||
1914 | if (!Size) | |||
1915 | continue; | |||
1916 | ||||
1917 | outs() << "Contents of section " << Name << ":\n"; | |||
1918 | if (Section.isBSS()) { | |||
1919 | outs() << format("<skipping contents of bss section at [%04" PRIx64"l" "x" | |||
1920 | ", %04" PRIx64"l" "x" ")>\n", | |||
1921 | BaseAddr, BaseAddr + Size); | |||
1922 | continue; | |||
1923 | } | |||
1924 | ||||
1925 | error(Section.getContents(Contents)); | |||
1926 | ||||
1927 | // Dump out the content as hex and printable ascii characters. | |||
1928 | for (std::size_t addr = 0, end = Contents.size(); addr < end; addr += 16) { | |||
1929 | outs() << format(" %04" PRIx64"l" "x" " ", BaseAddr + addr); | |||
1930 | // Dump line of hex. | |||
1931 | for (std::size_t i = 0; i < 16; ++i) { | |||
1932 | if (i != 0 && i % 4 == 0) | |||
1933 | outs() << ' '; | |||
1934 | if (addr + i < end) | |||
1935 | outs() << hexdigit((Contents[addr + i] >> 4) & 0xF, true) | |||
1936 | << hexdigit(Contents[addr + i] & 0xF, true); | |||
1937 | else | |||
1938 | outs() << " "; | |||
1939 | } | |||
1940 | // Print ascii. | |||
1941 | outs() << " "; | |||
1942 | for (std::size_t i = 0; i < 16 && addr + i < end; ++i) { | |||
1943 | if (isPrint(static_cast<unsigned char>(Contents[addr + i]) & 0xFF)) | |||
1944 | outs() << Contents[addr + i]; | |||
1945 | else | |||
1946 | outs() << "."; | |||
1947 | } | |||
1948 | outs() << "\n"; | |||
1949 | } | |||
1950 | } | |||
1951 | } | |||
1952 | ||||
1953 | void llvm::PrintSymbolTable(const ObjectFile *o, StringRef ArchiveName, | |||
1954 | StringRef ArchitectureName) { | |||
1955 | outs() << "SYMBOL TABLE:\n"; | |||
1956 | ||||
1957 | if (const COFFObjectFile *coff = dyn_cast<const COFFObjectFile>(o)) { | |||
1958 | printCOFFSymbolTable(coff); | |||
1959 | return; | |||
1960 | } | |||
1961 | for (const SymbolRef &Symbol : o->symbols()) { | |||
1962 | Expected<uint64_t> AddressOrError = Symbol.getAddress(); | |||
1963 | if (!AddressOrError) | |||
1964 | report_error(ArchiveName, o->getFileName(), AddressOrError.takeError(), | |||
1965 | ArchitectureName); | |||
1966 | uint64_t Address = *AddressOrError; | |||
1967 | if ((Address < StartAddress) || (Address > StopAddress)) | |||
1968 | continue; | |||
1969 | Expected<SymbolRef::Type> TypeOrError = Symbol.getType(); | |||
1970 | if (!TypeOrError) | |||
1971 | report_error(ArchiveName, o->getFileName(), TypeOrError.takeError(), | |||
1972 | ArchitectureName); | |||
1973 | SymbolRef::Type Type = *TypeOrError; | |||
1974 | uint32_t Flags = Symbol.getFlags(); | |||
1975 | Expected<section_iterator> SectionOrErr = Symbol.getSection(); | |||
1976 | if (!SectionOrErr) | |||
1977 | report_error(ArchiveName, o->getFileName(), SectionOrErr.takeError(), | |||
1978 | ArchitectureName); | |||
1979 | section_iterator Section = *SectionOrErr; | |||
1980 | StringRef Name; | |||
1981 | if (Type == SymbolRef::ST_Debug && Section != o->section_end()) { | |||
1982 | Section->getName(Name); | |||
1983 | } else { | |||
1984 | Expected<StringRef> NameOrErr = Symbol.getName(); | |||
1985 | if (!NameOrErr) | |||
1986 | report_error(ArchiveName, o->getFileName(), NameOrErr.takeError(), | |||
1987 | ArchitectureName); | |||
1988 | Name = *NameOrErr; | |||
1989 | } | |||
1990 | ||||
1991 | bool Global = Flags & SymbolRef::SF_Global; | |||
1992 | bool Weak = Flags & SymbolRef::SF_Weak; | |||
1993 | bool Absolute = Flags & SymbolRef::SF_Absolute; | |||
1994 | bool Common = Flags & SymbolRef::SF_Common; | |||
1995 | bool Hidden = Flags & SymbolRef::SF_Hidden; | |||
1996 | ||||
1997 | char GlobLoc = ' '; | |||
1998 | if (Type != SymbolRef::ST_Unknown) | |||
1999 | GlobLoc = Global ? 'g' : 'l'; | |||
2000 | char Debug = (Type == SymbolRef::ST_Debug || Type == SymbolRef::ST_File) | |||
2001 | ? 'd' : ' '; | |||
2002 | char FileFunc = ' '; | |||
2003 | if (Type == SymbolRef::ST_File) | |||
2004 | FileFunc = 'f'; | |||
2005 | else if (Type == SymbolRef::ST_Function) | |||
2006 | FileFunc = 'F'; | |||
2007 | ||||
2008 | const char *Fmt = o->getBytesInAddress() > 4 ? "%016" PRIx64"l" "x" : | |||
2009 | "%08" PRIx64"l" "x"; | |||
2010 | ||||
2011 | outs() << format(Fmt, Address) << " " | |||
2012 | << GlobLoc // Local -> 'l', Global -> 'g', Neither -> ' ' | |||
2013 | << (Weak ? 'w' : ' ') // Weak? | |||
2014 | << ' ' // Constructor. Not supported yet. | |||
2015 | << ' ' // Warning. Not supported yet. | |||
2016 | << ' ' // Indirect reference to another symbol. | |||
2017 | << Debug // Debugging (d) or dynamic (D) symbol. | |||
2018 | << FileFunc // Name of function (F), file (f) or object (O). | |||
2019 | << ' '; | |||
2020 | if (Absolute) { | |||
2021 | outs() << "*ABS*"; | |||
2022 | } else if (Common) { | |||
2023 | outs() << "*COM*"; | |||
2024 | } else if (Section == o->section_end()) { | |||
2025 | outs() << "*UND*"; | |||
2026 | } else { | |||
2027 | if (const MachOObjectFile *MachO = | |||
2028 | dyn_cast<const MachOObjectFile>(o)) { | |||
2029 | DataRefImpl DR = Section->getRawDataRefImpl(); | |||
2030 | StringRef SegmentName = MachO->getSectionFinalSegmentName(DR); | |||
2031 | outs() << SegmentName << ","; | |||
2032 | } | |||
2033 | StringRef SectionName; | |||
2034 | error(Section->getName(SectionName)); | |||
2035 | outs() << SectionName; | |||
2036 | } | |||
2037 | ||||
2038 | outs() << '\t'; | |||
2039 | if (Common || isa<ELFObjectFileBase>(o)) { | |||
2040 | uint64_t Val = | |||
2041 | Common ? Symbol.getAlignment() : ELFSymbolRef(Symbol).getSize(); | |||
2042 | outs() << format("\t %08" PRIx64"l" "x" " ", Val); | |||
2043 | } | |||
2044 | ||||
2045 | if (Hidden) { | |||
2046 | outs() << ".hidden "; | |||
2047 | } | |||
2048 | outs() << Name | |||
2049 | << '\n'; | |||
2050 | } | |||
2051 | } | |||
2052 | ||||
2053 | static void PrintUnwindInfo(const ObjectFile *o) { | |||
2054 | outs() << "Unwind info:\n\n"; | |||
2055 | ||||
2056 | if (const COFFObjectFile *coff = dyn_cast<COFFObjectFile>(o)) { | |||
2057 | printCOFFUnwindInfo(coff); | |||
2058 | } else if (const MachOObjectFile *MachO = dyn_cast<MachOObjectFile>(o)) | |||
2059 | printMachOUnwindInfo(MachO); | |||
2060 | else { | |||
2061 | // TODO: Extract DWARF dump tool to objdump. | |||
2062 | errs() << "This operation is only currently supported " | |||
2063 | "for COFF and MachO object files.\n"; | |||
2064 | return; | |||
2065 | } | |||
2066 | } | |||
2067 | ||||
2068 | void llvm::printExportsTrie(const ObjectFile *o) { | |||
2069 | outs() << "Exports trie:\n"; | |||
2070 | if (const MachOObjectFile *MachO = dyn_cast<MachOObjectFile>(o)) | |||
2071 | printMachOExportsTrie(MachO); | |||
2072 | else { | |||
2073 | errs() << "This operation is only currently supported " | |||
2074 | "for Mach-O executable files.\n"; | |||
2075 | return; | |||
2076 | } | |||
2077 | } | |||
2078 | ||||
2079 | void llvm::printRebaseTable(ObjectFile *o) { | |||
2080 | outs() << "Rebase table:\n"; | |||
2081 | if (MachOObjectFile *MachO = dyn_cast<MachOObjectFile>(o)) | |||
2082 | printMachORebaseTable(MachO); | |||
2083 | else { | |||
2084 | errs() << "This operation is only currently supported " | |||
2085 | "for Mach-O executable files.\n"; | |||
2086 | return; | |||
2087 | } | |||
2088 | } | |||
2089 | ||||
2090 | void llvm::printBindTable(ObjectFile *o) { | |||
2091 | outs() << "Bind table:\n"; | |||
2092 | if (MachOObjectFile *MachO = dyn_cast<MachOObjectFile>(o)) | |||
2093 | printMachOBindTable(MachO); | |||
2094 | else { | |||
2095 | errs() << "This operation is only currently supported " | |||
2096 | "for Mach-O executable files.\n"; | |||
2097 | return; | |||
2098 | } | |||
2099 | } | |||
2100 | ||||
2101 | void llvm::printLazyBindTable(ObjectFile *o) { | |||
2102 | outs() << "Lazy bind table:\n"; | |||
2103 | if (MachOObjectFile *MachO = dyn_cast<MachOObjectFile>(o)) | |||
2104 | printMachOLazyBindTable(MachO); | |||
2105 | else { | |||
2106 | errs() << "This operation is only currently supported " | |||
2107 | "for Mach-O executable files.\n"; | |||
2108 | return; | |||
2109 | } | |||
2110 | } | |||
2111 | ||||
2112 | void llvm::printWeakBindTable(ObjectFile *o) { | |||
2113 | outs() << "Weak bind table:\n"; | |||
2114 | if (MachOObjectFile *MachO = dyn_cast<MachOObjectFile>(o)) | |||
2115 | printMachOWeakBindTable(MachO); | |||
2116 | else { | |||
2117 | errs() << "This operation is only currently supported " | |||
2118 | "for Mach-O executable files.\n"; | |||
2119 | return; | |||
2120 | } | |||
2121 | } | |||
2122 | ||||
2123 | /// Dump the raw contents of the __clangast section so the output can be piped | |||
2124 | /// into llvm-bcanalyzer. | |||
2125 | void llvm::printRawClangAST(const ObjectFile *Obj) { | |||
2126 | if (outs().is_displayed()) { | |||
2127 | errs() << "The -raw-clang-ast option will dump the raw binary contents of " | |||
2128 | "the clang ast section.\n" | |||
2129 | "Please redirect the output to a file or another program such as " | |||
2130 | "llvm-bcanalyzer.\n"; | |||
2131 | return; | |||
2132 | } | |||
2133 | ||||
2134 | StringRef ClangASTSectionName("__clangast"); | |||
2135 | if (isa<COFFObjectFile>(Obj)) { | |||
2136 | ClangASTSectionName = "clangast"; | |||
2137 | } | |||
2138 | ||||
2139 | Optional<object::SectionRef> ClangASTSection; | |||
2140 | for (auto Sec : ToolSectionFilter(*Obj)) { | |||
2141 | StringRef Name; | |||
2142 | Sec.getName(Name); | |||
2143 | if (Name == ClangASTSectionName) { | |||
2144 | ClangASTSection = Sec; | |||
2145 | break; | |||
2146 | } | |||
2147 | } | |||
2148 | if (!ClangASTSection) | |||
2149 | return; | |||
2150 | ||||
2151 | StringRef ClangASTContents; | |||
2152 | error(ClangASTSection.getValue().getContents(ClangASTContents)); | |||
2153 | outs().write(ClangASTContents.data(), ClangASTContents.size()); | |||
2154 | } | |||
2155 | ||||
2156 | static void printFaultMaps(const ObjectFile *Obj) { | |||
2157 | const char *FaultMapSectionName = nullptr; | |||
2158 | ||||
2159 | if (isa<ELFObjectFileBase>(Obj)) { | |||
2160 | FaultMapSectionName = ".llvm_faultmaps"; | |||
2161 | } else if (isa<MachOObjectFile>(Obj)) { | |||
2162 | FaultMapSectionName = "__llvm_faultmaps"; | |||
2163 | } else { | |||
2164 | errs() << "This operation is only currently supported " | |||
2165 | "for ELF and Mach-O executable files.\n"; | |||
2166 | return; | |||
2167 | } | |||
2168 | ||||
2169 | Optional<object::SectionRef> FaultMapSection; | |||
2170 | ||||
2171 | for (auto Sec : ToolSectionFilter(*Obj)) { | |||
2172 | StringRef Name; | |||
2173 | Sec.getName(Name); | |||
2174 | if (Name == FaultMapSectionName) { | |||
2175 | FaultMapSection = Sec; | |||
2176 | break; | |||
2177 | } | |||
2178 | } | |||
2179 | ||||
2180 | outs() << "FaultMap table:\n"; | |||
2181 | ||||
2182 | if (!FaultMapSection.hasValue()) { | |||
2183 | outs() << "<not found>\n"; | |||
2184 | return; | |||
2185 | } | |||
2186 | ||||
2187 | StringRef FaultMapContents; | |||
2188 | error(FaultMapSection.getValue().getContents(FaultMapContents)); | |||
2189 | ||||
2190 | FaultMapParser FMP(FaultMapContents.bytes_begin(), | |||
2191 | FaultMapContents.bytes_end()); | |||
2192 | ||||
2193 | outs() << FMP; | |||
2194 | } | |||
2195 | ||||
2196 | static void printPrivateFileHeaders(const ObjectFile *o, bool onlyFirst) { | |||
2197 | if (o->isELF()) { | |||
2198 | printELFFileHeader(o); | |||
2199 | return printELFDynamicSection(o); | |||
2200 | } | |||
2201 | if (o->isCOFF()) | |||
2202 | return printCOFFFileHeader(o); | |||
2203 | if (o->isWasm()) | |||
2204 | return printWasmFileHeader(o); | |||
2205 | if (o->isMachO()) { | |||
2206 | printMachOFileHeader(o); | |||
2207 | if (!onlyFirst) | |||
2208 | printMachOLoadCommands(o); | |||
2209 | return; | |||
2210 | } | |||
2211 | report_error(o->getFileName(), "Invalid/Unsupported object file format"); | |||
2212 | } | |||
2213 | ||||
2214 | static void printFileHeaders(const ObjectFile *o) { | |||
2215 | if (!o->isELF() && !o->isCOFF()) | |||
2216 | report_error(o->getFileName(), "Invalid/Unsupported object file format"); | |||
2217 | ||||
2218 | Triple::ArchType AT = o->getArch(); | |||
2219 | outs() << "architecture: " << Triple::getArchTypeName(AT) << "\n"; | |||
2220 | Expected<uint64_t> StartAddrOrErr = o->getStartAddress(); | |||
2221 | if (!StartAddrOrErr) | |||
2222 | report_error(o->getFileName(), StartAddrOrErr.takeError()); | |||
2223 | ||||
2224 | StringRef Fmt = o->getBytesInAddress() > 4 ? "%016" PRIx64"l" "x" : "%08" PRIx64"l" "x"; | |||
2225 | uint64_t Address = StartAddrOrErr.get(); | |||
2226 | outs() << "start address: " | |||
2227 | << "0x" << format(Fmt.data(), Address) | |||
2228 | << "\n"; | |||
2229 | } | |||
2230 | ||||
2231 | static void printArchiveChild(StringRef Filename, const Archive::Child &C) { | |||
2232 | Expected<sys::fs::perms> ModeOrErr = C.getAccessMode(); | |||
2233 | if (!ModeOrErr) { | |||
2234 | errs() << "ill-formed archive entry.\n"; | |||
2235 | consumeError(ModeOrErr.takeError()); | |||
2236 | return; | |||
2237 | } | |||
2238 | sys::fs::perms Mode = ModeOrErr.get(); | |||
2239 | outs() << ((Mode & sys::fs::owner_read) ? "r" : "-"); | |||
2240 | outs() << ((Mode & sys::fs::owner_write) ? "w" : "-"); | |||
2241 | outs() << ((Mode & sys::fs::owner_exe) ? "x" : "-"); | |||
2242 | outs() << ((Mode & sys::fs::group_read) ? "r" : "-"); | |||
2243 | outs() << ((Mode & sys::fs::group_write) ? "w" : "-"); | |||
2244 | outs() << ((Mode & sys::fs::group_exe) ? "x" : "-"); | |||
2245 | outs() << ((Mode & sys::fs::others_read) ? "r" : "-"); | |||
2246 | outs() << ((Mode & sys::fs::others_write) ? "w" : "-"); | |||
2247 | outs() << ((Mode & sys::fs::others_exe) ? "x" : "-"); | |||
2248 | ||||
2249 | outs() << " "; | |||
2250 | ||||
2251 | Expected<unsigned> UIDOrErr = C.getUID(); | |||
2252 | if (!UIDOrErr) | |||
2253 | report_error(Filename, UIDOrErr.takeError()); | |||
2254 | unsigned UID = UIDOrErr.get(); | |||
2255 | outs() << format("%d/", UID); | |||
2256 | ||||
2257 | Expected<unsigned> GIDOrErr = C.getGID(); | |||
2258 | if (!GIDOrErr) | |||
2259 | report_error(Filename, GIDOrErr.takeError()); | |||
2260 | unsigned GID = GIDOrErr.get(); | |||
2261 | outs() << format("%-d ", GID); | |||
2262 | ||||
2263 | Expected<uint64_t> Size = C.getRawSize(); | |||
2264 | if (!Size) | |||
2265 | report_error(Filename, Size.takeError()); | |||
2266 | outs() << format("%6" PRId64"l" "d", Size.get()) << " "; | |||
2267 | ||||
2268 | StringRef RawLastModified = C.getRawLastModified(); | |||
2269 | unsigned Seconds; | |||
2270 | if (RawLastModified.getAsInteger(10, Seconds)) | |||
2271 | outs() << "(date: \"" << RawLastModified | |||
2272 | << "\" contains non-decimal chars) "; | |||
2273 | else { | |||
2274 | // Since ctime(3) returns a 26 character string of the form: | |||
2275 | // "Sun Sep 16 01:03:52 1973\n\0" | |||
2276 | // just print 24 characters. | |||
2277 | time_t t = Seconds; | |||
2278 | outs() << format("%.24s ", ctime(&t)); | |||
2279 | } | |||
2280 | ||||
2281 | StringRef Name = ""; | |||
2282 | Expected<StringRef> NameOrErr = C.getName(); | |||
2283 | if (!NameOrErr) { | |||
2284 | consumeError(NameOrErr.takeError()); | |||
2285 | Expected<StringRef> RawNameOrErr = C.getRawName(); | |||
2286 | if (!RawNameOrErr) | |||
2287 | report_error(Filename, NameOrErr.takeError()); | |||
2288 | Name = RawNameOrErr.get(); | |||
2289 | } else { | |||
2290 | Name = NameOrErr.get(); | |||
2291 | } | |||
2292 | outs() << Name << "\n"; | |||
2293 | } | |||
2294 | ||||
2295 | static void DumpObject(ObjectFile *o, const Archive *a = nullptr, | |||
2296 | const Archive::Child *c = nullptr) { | |||
2297 | StringRef ArchiveName = a != nullptr ? a->getFileName() : ""; | |||
2298 | // Avoid other output when using a raw option. | |||
2299 | if (!RawClangAST) { | |||
2300 | outs() << '\n'; | |||
2301 | if (a) | |||
2302 | outs() << a->getFileName() << "(" << o->getFileName() << ")"; | |||
2303 | else | |||
2304 | outs() << o->getFileName(); | |||
2305 | outs() << ":\tfile format " << o->getFileFormatName() << "\n\n"; | |||
2306 | } | |||
2307 | ||||
2308 | if (ArchiveHeaders && !MachOOpt) | |||
2309 | printArchiveChild(a->getFileName(), *c); | |||
| ||||
2310 | if (Disassemble) | |||
2311 | DisassembleObject(o, Relocations); | |||
2312 | if (Relocations && !Disassemble) | |||
2313 | PrintRelocations(o); | |||
2314 | if (DynamicRelocations) | |||
2315 | PrintDynamicRelocations(o); | |||
2316 | if (SectionHeaders) | |||
2317 | PrintSectionHeaders(o); | |||
2318 | if (SectionContents) | |||
2319 | PrintSectionContents(o); | |||
2320 | if (SymbolTable) | |||
2321 | PrintSymbolTable(o, ArchiveName); | |||
2322 | if (UnwindInfo) | |||
2323 | PrintUnwindInfo(o); | |||
2324 | if (PrivateHeaders || FirstPrivateHeader) | |||
2325 | printPrivateFileHeaders(o, FirstPrivateHeader); | |||
2326 | if (FileHeaders) | |||
2327 | printFileHeaders(o); | |||
2328 | if (ExportsTrie) | |||
2329 | printExportsTrie(o); | |||
2330 | if (Rebase) | |||
2331 | printRebaseTable(o); | |||
2332 | if (Bind) | |||
2333 | printBindTable(o); | |||
2334 | if (LazyBind) | |||
2335 | printLazyBindTable(o); | |||
2336 | if (WeakBind) | |||
2337 | printWeakBindTable(o); | |||
2338 | if (RawClangAST) | |||
2339 | printRawClangAST(o); | |||
2340 | if (PrintFaultMaps) | |||
2341 | printFaultMaps(o); | |||
2342 | if (DwarfDumpType != DIDT_Null) { | |||
2343 | std::unique_ptr<DIContext> DICtx = DWARFContext::create(*o); | |||
2344 | // Dump the complete DWARF structure. | |||
2345 | DIDumpOptions DumpOpts; | |||
2346 | DumpOpts.DumpType = DwarfDumpType; | |||
2347 | DICtx->dump(outs(), DumpOpts); | |||
2348 | } | |||
2349 | } | |||
2350 | ||||
2351 | static void DumpObject(const COFFImportFile *I, const Archive *A, | |||
2352 | const Archive::Child *C = nullptr) { | |||
2353 | StringRef ArchiveName = A ? A->getFileName() : ""; | |||
2354 | ||||
2355 | // Avoid other output when using a raw option. | |||
2356 | if (!RawClangAST) | |||
2357 | outs() << '\n' | |||
2358 | << ArchiveName << "(" << I->getFileName() << ")" | |||
2359 | << ":\tfile format COFF-import-file" | |||
2360 | << "\n\n"; | |||
2361 | ||||
2362 | if (ArchiveHeaders && !MachOOpt) | |||
2363 | printArchiveChild(A->getFileName(), *C); | |||
2364 | if (SymbolTable) | |||
2365 | printCOFFSymbolTable(I); | |||
2366 | } | |||
2367 | ||||
2368 | /// Dump each object file in \a a; | |||
2369 | static void DumpArchive(const Archive *a) { | |||
2370 | Error Err = Error::success(); | |||
2371 | for (auto &C : a->children(Err)) { | |||
2372 | Expected<std::unique_ptr<Binary>> ChildOrErr = C.getAsBinary(); | |||
2373 | if (!ChildOrErr) { | |||
2374 | if (auto E = isNotObjectErrorInvalidFileType(ChildOrErr.takeError())) | |||
2375 | report_error(a->getFileName(), C, std::move(E)); | |||
2376 | continue; | |||
2377 | } | |||
2378 | if (ObjectFile *o = dyn_cast<ObjectFile>(&*ChildOrErr.get())) | |||
2379 | DumpObject(o, a, &C); | |||
2380 | else if (COFFImportFile *I = dyn_cast<COFFImportFile>(&*ChildOrErr.get())) | |||
2381 | DumpObject(I, a, &C); | |||
2382 | else | |||
2383 | report_error(a->getFileName(), object_error::invalid_file_type); | |||
2384 | } | |||
2385 | if (Err) | |||
2386 | report_error(a->getFileName(), std::move(Err)); | |||
2387 | } | |||
2388 | ||||
2389 | /// Open file and figure out how to dump it. | |||
2390 | static void DumpInput(StringRef file) { | |||
2391 | ||||
2392 | // If we are using the Mach-O specific object file parser, then let it parse | |||
2393 | // the file and process the command line options. So the -arch flags can | |||
2394 | // be used to select specific slices, etc. | |||
2395 | if (MachOOpt) { | |||
2396 | ParseInputMachO(file); | |||
2397 | return; | |||
2398 | } | |||
2399 | ||||
2400 | // Attempt to open the binary. | |||
2401 | Expected<OwningBinary<Binary>> BinaryOrErr = createBinary(file); | |||
2402 | if (!BinaryOrErr) | |||
2403 | report_error(file, BinaryOrErr.takeError()); | |||
2404 | Binary &Binary = *BinaryOrErr.get().getBinary(); | |||
2405 | ||||
2406 | if (Archive *a = dyn_cast<Archive>(&Binary)) | |||
2407 | DumpArchive(a); | |||
2408 | else if (ObjectFile *o = dyn_cast<ObjectFile>(&Binary)) | |||
2409 | DumpObject(o); | |||
2410 | else if (MachOUniversalBinary *UB = dyn_cast<MachOUniversalBinary>(&Binary)) | |||
2411 | ParseInputMachO(UB); | |||
2412 | else | |||
2413 | report_error(file, object_error::invalid_file_type); | |||
2414 | } | |||
2415 | ||||
2416 | int main(int argc, char **argv) { | |||
2417 | InitLLVM X(argc, argv); | |||
2418 | ||||
2419 | // Initialize targets and assembly printers/parsers. | |||
2420 | llvm::InitializeAllTargetInfos(); | |||
2421 | llvm::InitializeAllTargetMCs(); | |||
2422 | llvm::InitializeAllDisassemblers(); | |||
2423 | ||||
2424 | // Register the target printer for --version. | |||
2425 | cl::AddExtraVersionPrinter(TargetRegistry::printRegisteredTargetsForVersion); | |||
2426 | ||||
2427 | cl::ParseCommandLineOptions(argc, argv, "llvm object file dumper\n"); | |||
2428 | ||||
2429 | ToolName = argv[0]; | |||
2430 | ||||
2431 | // Defaults to a.out if no filenames specified. | |||
2432 | if (InputFilenames.size() == 0) | |||
| ||||
2433 | InputFilenames.push_back("a.out"); | |||
2434 | ||||
2435 | if (AllHeaders) | |||
2436 | PrivateHeaders = Relocations = SectionHeaders = SymbolTable = true; | |||
2437 | ||||
2438 | if (DisassembleAll || PrintSource || PrintLines) | |||
2439 | Disassemble = true; | |||
2440 | ||||
2441 | if (!Disassemble | |||
2442 | && !Relocations | |||
2443 | && !DynamicRelocations | |||
2444 | && !SectionHeaders | |||
2445 | && !SectionContents | |||
2446 | && !SymbolTable | |||
2447 | && !UnwindInfo | |||
2448 | && !PrivateHeaders | |||
2449 | && !FileHeaders | |||
2450 | && !FirstPrivateHeader | |||
2451 | && !ExportsTrie | |||
2452 | && !Rebase | |||
2453 | && !Bind | |||
2454 | && !LazyBind | |||
2455 | && !WeakBind | |||
2456 | && !RawClangAST | |||
2457 | && !(UniversalHeaders && MachOOpt) | |||
2458 | && !ArchiveHeaders | |||
2459 | && !(IndirectSymbols && MachOOpt) | |||
2460 | && !(DataInCode && MachOOpt) | |||
2461 | && !(LinkOptHints && MachOOpt) | |||
2462 | && !(InfoPlist && MachOOpt) | |||
2463 | && !(DylibsUsed && MachOOpt) | |||
2464 | && !(DylibId && MachOOpt) | |||
2465 | && !(ObjcMetaData && MachOOpt) | |||
2466 | && !(FilterSections.size() != 0 && MachOOpt) | |||
2467 | && !PrintFaultMaps | |||
2468 | && DwarfDumpType == DIDT_Null) { | |||
2469 | cl::PrintHelpMessage(); | |||
2470 | return 2; | |||
2471 | } | |||
2472 | ||||
2473 | DisasmFuncsSet.insert(DisassembleFunctions.begin(), | |||
2474 | DisassembleFunctions.end()); | |||
2475 | ||||
2476 | llvm::for_each(InputFilenames, DumpInput); | |||
2477 | ||||
2478 | return EXIT_SUCCESS0; | |||
2479 | } |
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 |
1 | // Algorithm implementation -*- C++ -*- |
2 | |
3 | // Copyright (C) 2001-2016 Free Software Foundation, Inc. |
4 | // |
5 | // This file is part of the GNU ISO C++ Library. This library is free |
6 | // software; you can redistribute it and/or modify it under the |
7 | // terms of the GNU General Public License as published by the |
8 | // Free Software Foundation; either version 3, or (at your option) |
9 | // any later version. |
10 | |
11 | // This library is distributed in the hope that it will be useful, |
12 | // but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | // GNU General Public License for more details. |
15 | |
16 | // Under Section 7 of GPL version 3, you are granted additional |
17 | // permissions described in the GCC Runtime Library Exception, version |
18 | // 3.1, as published by the Free Software Foundation. |
19 | |
20 | // You should have received a copy of the GNU General Public License and |
21 | // a copy of the GCC Runtime Library Exception along with this program; |
22 | // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see |
23 | // <http://www.gnu.org/licenses/>. |
24 | |
25 | /* |
26 | * |
27 | * Copyright (c) 1994 |
28 | * Hewlett-Packard Company |
29 | * |
30 | * Permission to use, copy, modify, distribute and sell this software |
31 | * and its documentation for any purpose is hereby granted without fee, |
32 | * provided that the above copyright notice appear in all copies and |
33 | * that both that copyright notice and this permission notice appear |
34 | * in supporting documentation. Hewlett-Packard Company makes no |
35 | * representations about the suitability of this software for any |
36 | * purpose. It is provided "as is" without express or implied warranty. |
37 | * |
38 | * |
39 | * Copyright (c) 1996 |
40 | * Silicon Graphics Computer Systems, Inc. |
41 | * |
42 | * Permission to use, copy, modify, distribute and sell this software |
43 | * and its documentation for any purpose is hereby granted without fee, |
44 | * provided that the above copyright notice appear in all copies and |
45 | * that both that copyright notice and this permission notice appear |
46 | * in supporting documentation. Silicon Graphics makes no |
47 | * representations about the suitability of this software for any |
48 | * purpose. It is provided "as is" without express or implied warranty. |
49 | */ |
50 | |
51 | /** @file bits/stl_algo.h |
52 | * This is an internal header file, included by other library headers. |
53 | * Do not attempt to use it directly. @headername{algorithm} |
54 | */ |
55 | |
56 | #ifndef _STL_ALGO_H1 |
57 | #define _STL_ALGO_H1 1 |
58 | |
59 | #include <cstdlib> // for rand |
60 | #include <bits/algorithmfwd.h> |
61 | #include <bits/stl_heap.h> |
62 | #include <bits/stl_tempbuf.h> // for _Temporary_buffer |
63 | #include <bits/predefined_ops.h> |
64 | |
65 | #if __cplusplus201103L >= 201103L |
66 | #include <bits/uniform_int_dist.h> |
67 | #endif |
68 | |
69 | // See concept_check.h for the __glibcxx_*_requires macros. |
70 | |
71 | namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default"))) |
72 | { |
73 | _GLIBCXX_BEGIN_NAMESPACE_VERSION |
74 | |
75 | /// Swaps the median value of *__a, *__b and *__c under __comp to *__result |
76 | template<typename _Iterator, typename _Compare> |
77 | void |
78 | __move_median_to_first(_Iterator __result,_Iterator __a, _Iterator __b, |
79 | _Iterator __c, _Compare __comp) |
80 | { |
81 | if (__comp(__a, __b)) |
82 | { |
83 | if (__comp(__b, __c)) |
84 | std::iter_swap(__result, __b); |
85 | else if (__comp(__a, __c)) |
86 | std::iter_swap(__result, __c); |
87 | else |
88 | std::iter_swap(__result, __a); |
89 | } |
90 | else if (__comp(__a, __c)) |
91 | std::iter_swap(__result, __a); |
92 | else if (__comp(__b, __c)) |
93 | std::iter_swap(__result, __c); |
94 | else |
95 | std::iter_swap(__result, __b); |
96 | } |
97 | |
98 | /// This is an overload used by find algos for the Input Iterator case. |
99 | template<typename _InputIterator, typename _Predicate> |
100 | inline _InputIterator |
101 | __find_if(_InputIterator __first, _InputIterator __last, |
102 | _Predicate __pred, input_iterator_tag) |
103 | { |
104 | while (__first != __last && !__pred(__first)) |
105 | ++__first; |
106 | return __first; |
107 | } |
108 | |
109 | /// This is an overload used by find algos for the RAI case. |
110 | template<typename _RandomAccessIterator, typename _Predicate> |
111 | _RandomAccessIterator |
112 | __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, |
113 | _Predicate __pred, random_access_iterator_tag) |
114 | { |
115 | typename iterator_traits<_RandomAccessIterator>::difference_type |
116 | __trip_count = (__last - __first) >> 2; |
117 | |
118 | for (; __trip_count > 0; --__trip_count) |
119 | { |
120 | if (__pred(__first)) |
121 | return __first; |
122 | ++__first; |
123 | |
124 | if (__pred(__first)) |
125 | return __first; |
126 | ++__first; |
127 | |
128 | if (__pred(__first)) |
129 | return __first; |
130 | ++__first; |
131 | |
132 | if (__pred(__first)) |
133 | return __first; |
134 | ++__first; |
135 | } |
136 | |
137 | switch (__last - __first) |
138 | { |
139 | case 3: |
140 | if (__pred(__first)) |
141 | return __first; |
142 | ++__first; |
143 | case 2: |
144 | if (__pred(__first)) |
145 | return __first; |
146 | ++__first; |
147 | case 1: |
148 | if (__pred(__first)) |
149 | return __first; |
150 | ++__first; |
151 | case 0: |
152 | default: |
153 | return __last; |
154 | } |
155 | } |
156 | |
157 | template<typename _Iterator, typename _Predicate> |
158 | inline _Iterator |
159 | __find_if(_Iterator __first, _Iterator __last, _Predicate __pred) |
160 | { |
161 | return __find_if(__first, __last, __pred, |
162 | std::__iterator_category(__first)); |
163 | } |
164 | |
165 | /// Provided for stable_partition to use. |
166 | template<typename _InputIterator, typename _Predicate> |
167 | inline _InputIterator |
168 | __find_if_not(_InputIterator __first, _InputIterator __last, |
169 | _Predicate __pred) |
170 | { |
171 | return std::__find_if(__first, __last, |
172 | __gnu_cxx::__ops::__negate(__pred), |
173 | std::__iterator_category(__first)); |
174 | } |
175 | |
176 | /// Like find_if_not(), but uses and updates a count of the |
177 | /// remaining range length instead of comparing against an end |
178 | /// iterator. |
179 | template<typename _InputIterator, typename _Predicate, typename _Distance> |
180 | _InputIterator |
181 | __find_if_not_n(_InputIterator __first, _Distance& __len, _Predicate __pred) |
182 | { |
183 | for (; __len; --__len, ++__first) |
184 | if (!__pred(__first)) |
185 | break; |
186 | return __first; |
187 | } |
188 | |
189 | // set_difference |
190 | // set_intersection |
191 | // set_symmetric_difference |
192 | // set_union |
193 | // for_each |
194 | // find |
195 | // find_if |
196 | // find_first_of |
197 | // adjacent_find |
198 | // count |
199 | // count_if |
200 | // search |
201 | |
202 | template<typename _ForwardIterator1, typename _ForwardIterator2, |
203 | typename _BinaryPredicate> |
204 | _ForwardIterator1 |
205 | __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
206 | _ForwardIterator2 __first2, _ForwardIterator2 __last2, |
207 | _BinaryPredicate __predicate) |
208 | { |
209 | // Test for empty ranges |
210 | if (__first1 == __last1 || __first2 == __last2) |
211 | return __first1; |
212 | |
213 | // Test for a pattern of length 1. |
214 | _ForwardIterator2 __p1(__first2); |
215 | if (++__p1 == __last2) |
216 | return std::__find_if(__first1, __last1, |
217 | __gnu_cxx::__ops::__iter_comp_iter(__predicate, __first2)); |
218 | |
219 | // General case. |
220 | _ForwardIterator2 __p; |
221 | _ForwardIterator1 __current = __first1; |
222 | |
223 | for (;;) |
224 | { |
225 | __first1 = |
226 | std::__find_if(__first1, __last1, |
227 | __gnu_cxx::__ops::__iter_comp_iter(__predicate, __first2)); |
228 | |
229 | if (__first1 == __last1) |
230 | return __last1; |
231 | |
232 | __p = __p1; |
233 | __current = __first1; |
234 | if (++__current == __last1) |
235 | return __last1; |
236 | |
237 | while (__predicate(__current, __p)) |
238 | { |
239 | if (++__p == __last2) |
240 | return __first1; |
241 | if (++__current == __last1) |
242 | return __last1; |
243 | } |
244 | ++__first1; |
245 | } |
246 | return __first1; |
247 | } |
248 | |
249 | // search_n |
250 | |
251 | /** |
252 | * This is an helper function for search_n overloaded for forward iterators. |
253 | */ |
254 | template<typename _ForwardIterator, typename _Integer, |
255 | typename _UnaryPredicate> |
256 | _ForwardIterator |
257 | __search_n_aux(_ForwardIterator __first, _ForwardIterator __last, |
258 | _Integer __count, _UnaryPredicate __unary_pred, |
259 | std::forward_iterator_tag) |
260 | { |
261 | __first = std::__find_if(__first, __last, __unary_pred); |
262 | while (__first != __last) |
263 | { |
264 | typename iterator_traits<_ForwardIterator>::difference_type |
265 | __n = __count; |
266 | _ForwardIterator __i = __first; |
267 | ++__i; |
268 | while (__i != __last && __n != 1 && __unary_pred(__i)) |
269 | { |
270 | ++__i; |
271 | --__n; |
272 | } |
273 | if (__n == 1) |
274 | return __first; |
275 | if (__i == __last) |
276 | return __last; |
277 | __first = std::__find_if(++__i, __last, __unary_pred); |
278 | } |
279 | return __last; |
280 | } |
281 | |
282 | /** |
283 | * This is an helper function for search_n overloaded for random access |
284 | * iterators. |
285 | */ |
286 | template<typename _RandomAccessIter, typename _Integer, |
287 | typename _UnaryPredicate> |
288 | _RandomAccessIter |
289 | __search_n_aux(_RandomAccessIter __first, _RandomAccessIter __last, |
290 | _Integer __count, _UnaryPredicate __unary_pred, |
291 | std::random_access_iterator_tag) |
292 | { |
293 | typedef typename std::iterator_traits<_RandomAccessIter>::difference_type |
294 | _DistanceType; |
295 | |
296 | _DistanceType __tailSize = __last - __first; |
297 | _DistanceType __remainder = __count; |
298 | |
299 | while (__remainder <= __tailSize) // the main loop... |
300 | { |
301 | __first += __remainder; |
302 | __tailSize -= __remainder; |
303 | // __first here is always pointing to one past the last element of |
304 | // next possible match. |
305 | _RandomAccessIter __backTrack = __first; |
306 | while (__unary_pred(--__backTrack)) |
307 | { |
308 | if (--__remainder == 0) |
309 | return (__first - __count); // Success |
310 | } |
311 | __remainder = __count + 1 - (__first - __backTrack); |
312 | } |
313 | return __last; // Failure |
314 | } |
315 | |
316 | template<typename _ForwardIterator, typename _Integer, |
317 | typename _UnaryPredicate> |
318 | _ForwardIterator |
319 | __search_n(_ForwardIterator __first, _ForwardIterator __last, |
320 | _Integer __count, |
321 | _UnaryPredicate __unary_pred) |
322 | { |
323 | if (__count <= 0) |
324 | return __first; |
325 | |
326 | if (__count == 1) |
327 | return std::__find_if(__first, __last, __unary_pred); |
328 | |
329 | return std::__search_n_aux(__first, __last, __count, __unary_pred, |
330 | std::__iterator_category(__first)); |
331 | } |
332 | |
333 | // find_end for forward iterators. |
334 | template<typename _ForwardIterator1, typename _ForwardIterator2, |
335 | typename _BinaryPredicate> |
336 | _ForwardIterator1 |
337 | __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
338 | _ForwardIterator2 __first2, _ForwardIterator2 __last2, |
339 | forward_iterator_tag, forward_iterator_tag, |
340 | _BinaryPredicate __comp) |
341 | { |
342 | if (__first2 == __last2) |
343 | return __last1; |
344 | |
345 | _ForwardIterator1 __result = __last1; |
346 | while (1) |
347 | { |
348 | _ForwardIterator1 __new_result |
349 | = std::__search(__first1, __last1, __first2, __last2, __comp); |
350 | if (__new_result == __last1) |
351 | return __result; |
352 | else |
353 | { |
354 | __result = __new_result; |
355 | __first1 = __new_result; |
356 | ++__first1; |
357 | } |
358 | } |
359 | } |
360 | |
361 | // find_end for bidirectional iterators (much faster). |
362 | template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, |
363 | typename _BinaryPredicate> |
364 | _BidirectionalIterator1 |
365 | __find_end(_BidirectionalIterator1 __first1, |
366 | _BidirectionalIterator1 __last1, |
367 | _BidirectionalIterator2 __first2, |
368 | _BidirectionalIterator2 __last2, |
369 | bidirectional_iterator_tag, bidirectional_iterator_tag, |
370 | _BinaryPredicate __comp) |
371 | { |
372 | // concept requirements |
373 | __glibcxx_function_requires(_BidirectionalIteratorConcept< |
374 | _BidirectionalIterator1>) |
375 | __glibcxx_function_requires(_BidirectionalIteratorConcept< |
376 | _BidirectionalIterator2>) |
377 | |
378 | typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; |
379 | typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; |
380 | |
381 | _RevIterator1 __rlast1(__first1); |
382 | _RevIterator2 __rlast2(__first2); |
383 | _RevIterator1 __rresult = std::__search(_RevIterator1(__last1), __rlast1, |
384 | _RevIterator2(__last2), __rlast2, |
385 | __comp); |
386 | |
387 | if (__rresult == __rlast1) |
388 | return __last1; |
389 | else |
390 | { |
391 | _BidirectionalIterator1 __result = __rresult.base(); |
392 | std::advance(__result, -std::distance(__first2, __last2)); |
393 | return __result; |
394 | } |
395 | } |
396 | |
397 | /** |
398 | * @brief Find last matching subsequence in a sequence. |
399 | * @ingroup non_mutating_algorithms |
400 | * @param __first1 Start of range to search. |
401 | * @param __last1 End of range to search. |
402 | * @param __first2 Start of sequence to match. |
403 | * @param __last2 End of sequence to match. |
404 | * @return The last iterator @c i in the range |
405 | * @p [__first1,__last1-(__last2-__first2)) such that @c *(i+N) == |
406 | * @p *(__first2+N) for each @c N in the range @p |
407 | * [0,__last2-__first2), or @p __last1 if no such iterator exists. |
408 | * |
409 | * Searches the range @p [__first1,__last1) for a sub-sequence that |
410 | * compares equal value-by-value with the sequence given by @p |
411 | * [__first2,__last2) and returns an iterator to the __first |
412 | * element of the sub-sequence, or @p __last1 if the sub-sequence |
413 | * is not found. The sub-sequence will be the last such |
414 | * subsequence contained in [__first1,__last1). |
415 | * |
416 | * Because the sub-sequence must lie completely within the range @p |
417 | * [__first1,__last1) it must start at a position less than @p |
418 | * __last1-(__last2-__first2) where @p __last2-__first2 is the |
419 | * length of the sub-sequence. This means that the returned |
420 | * iterator @c i will be in the range @p |
421 | * [__first1,__last1-(__last2-__first2)) |
422 | */ |
423 | template<typename _ForwardIterator1, typename _ForwardIterator2> |
424 | inline _ForwardIterator1 |
425 | find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
426 | _ForwardIterator2 __first2, _ForwardIterator2 __last2) |
427 | { |
428 | // concept requirements |
429 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) |
430 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) |
431 | __glibcxx_function_requires(_EqualOpConcept< |
432 | typename iterator_traits<_ForwardIterator1>::value_type, |
433 | typename iterator_traits<_ForwardIterator2>::value_type>) |
434 | __glibcxx_requires_valid_range(__first1, __last1); |
435 | __glibcxx_requires_valid_range(__first2, __last2); |
436 | |
437 | return std::__find_end(__first1, __last1, __first2, __last2, |
438 | std::__iterator_category(__first1), |
439 | std::__iterator_category(__first2), |
440 | __gnu_cxx::__ops::__iter_equal_to_iter()); |
441 | } |
442 | |
443 | /** |
444 | * @brief Find last matching subsequence in a sequence using a predicate. |
445 | * @ingroup non_mutating_algorithms |
446 | * @param __first1 Start of range to search. |
447 | * @param __last1 End of range to search. |
448 | * @param __first2 Start of sequence to match. |
449 | * @param __last2 End of sequence to match. |
450 | * @param __comp The predicate to use. |
451 | * @return The last iterator @c i in the range @p |
452 | * [__first1,__last1-(__last2-__first2)) such that @c |
453 | * predicate(*(i+N), @p (__first2+N)) is true for each @c N in the |
454 | * range @p [0,__last2-__first2), or @p __last1 if no such iterator |
455 | * exists. |
456 | * |
457 | * Searches the range @p [__first1,__last1) for a sub-sequence that |
458 | * compares equal value-by-value with the sequence given by @p |
459 | * [__first2,__last2) using comp as a predicate and returns an |
460 | * iterator to the first element of the sub-sequence, or @p __last1 |
461 | * if the sub-sequence is not found. The sub-sequence will be the |
462 | * last such subsequence contained in [__first,__last1). |
463 | * |
464 | * Because the sub-sequence must lie completely within the range @p |
465 | * [__first1,__last1) it must start at a position less than @p |
466 | * __last1-(__last2-__first2) where @p __last2-__first2 is the |
467 | * length of the sub-sequence. This means that the returned |
468 | * iterator @c i will be in the range @p |
469 | * [__first1,__last1-(__last2-__first2)) |
470 | */ |
471 | template<typename _ForwardIterator1, typename _ForwardIterator2, |
472 | typename _BinaryPredicate> |
473 | inline _ForwardIterator1 |
474 | find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
475 | _ForwardIterator2 __first2, _ForwardIterator2 __last2, |
476 | _BinaryPredicate __comp) |
477 | { |
478 | // concept requirements |
479 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) |
480 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) |
481 | __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, |
482 | typename iterator_traits<_ForwardIterator1>::value_type, |
483 | typename iterator_traits<_ForwardIterator2>::value_type>) |
484 | __glibcxx_requires_valid_range(__first1, __last1); |
485 | __glibcxx_requires_valid_range(__first2, __last2); |
486 | |
487 | return std::__find_end(__first1, __last1, __first2, __last2, |
488 | std::__iterator_category(__first1), |
489 | std::__iterator_category(__first2), |
490 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
491 | } |
492 | |
493 | #if __cplusplus201103L >= 201103L |
494 | /** |
495 | * @brief Checks that a predicate is true for all the elements |
496 | * of a sequence. |
497 | * @ingroup non_mutating_algorithms |
498 | * @param __first An input iterator. |
499 | * @param __last An input iterator. |
500 | * @param __pred A predicate. |
501 | * @return True if the check is true, false otherwise. |
502 | * |
503 | * Returns true if @p __pred is true for each element in the range |
504 | * @p [__first,__last), and false otherwise. |
505 | */ |
506 | template<typename _InputIterator, typename _Predicate> |
507 | inline bool |
508 | all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) |
509 | { return __last == std::find_if_not(__first, __last, __pred); } |
510 | |
511 | /** |
512 | * @brief Checks that a predicate is false for all the elements |
513 | * of a sequence. |
514 | * @ingroup non_mutating_algorithms |
515 | * @param __first An input iterator. |
516 | * @param __last An input iterator. |
517 | * @param __pred A predicate. |
518 | * @return True if the check is true, false otherwise. |
519 | * |
520 | * Returns true if @p __pred is false for each element in the range |
521 | * @p [__first,__last), and false otherwise. |
522 | */ |
523 | template<typename _InputIterator, typename _Predicate> |
524 | inline bool |
525 | none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) |
526 | { return __last == _GLIBCXX_STD_Astd::find_if(__first, __last, __pred); } |
527 | |
528 | /** |
529 | * @brief Checks that a predicate is false for at least an element |
530 | * of a sequence. |
531 | * @ingroup non_mutating_algorithms |
532 | * @param __first An input iterator. |
533 | * @param __last An input iterator. |
534 | * @param __pred A predicate. |
535 | * @return True if the check is true, false otherwise. |
536 | * |
537 | * Returns true if an element exists in the range @p |
538 | * [__first,__last) such that @p __pred is true, and false |
539 | * otherwise. |
540 | */ |
541 | template<typename _InputIterator, typename _Predicate> |
542 | inline bool |
543 | any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) |
544 | { return !std::none_of(__first, __last, __pred); } |
545 | |
546 | /** |
547 | * @brief Find the first element in a sequence for which a |
548 | * predicate is false. |
549 | * @ingroup non_mutating_algorithms |
550 | * @param __first An input iterator. |
551 | * @param __last An input iterator. |
552 | * @param __pred A predicate. |
553 | * @return The first iterator @c i in the range @p [__first,__last) |
554 | * such that @p __pred(*i) is false, or @p __last if no such iterator exists. |
555 | */ |
556 | template<typename _InputIterator, typename _Predicate> |
557 | inline _InputIterator |
558 | find_if_not(_InputIterator __first, _InputIterator __last, |
559 | _Predicate __pred) |
560 | { |
561 | // concept requirements |
562 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
563 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
564 | typename iterator_traits<_InputIterator>::value_type>) |
565 | __glibcxx_requires_valid_range(__first, __last); |
566 | return std::__find_if_not(__first, __last, |
567 | __gnu_cxx::__ops::__pred_iter(__pred)); |
568 | } |
569 | |
570 | /** |
571 | * @brief Checks whether the sequence is partitioned. |
572 | * @ingroup mutating_algorithms |
573 | * @param __first An input iterator. |
574 | * @param __last An input iterator. |
575 | * @param __pred A predicate. |
576 | * @return True if the range @p [__first,__last) is partioned by @p __pred, |
577 | * i.e. if all elements that satisfy @p __pred appear before those that |
578 | * do not. |
579 | */ |
580 | template<typename _InputIterator, typename _Predicate> |
581 | inline bool |
582 | is_partitioned(_InputIterator __first, _InputIterator __last, |
583 | _Predicate __pred) |
584 | { |
585 | __first = std::find_if_not(__first, __last, __pred); |
586 | return std::none_of(__first, __last, __pred); |
587 | } |
588 | |
589 | /** |
590 | * @brief Find the partition point of a partitioned range. |
591 | * @ingroup mutating_algorithms |
592 | * @param __first An iterator. |
593 | * @param __last Another iterator. |
594 | * @param __pred A predicate. |
595 | * @return An iterator @p mid such that @p all_of(__first, mid, __pred) |
596 | * and @p none_of(mid, __last, __pred) are both true. |
597 | */ |
598 | template<typename _ForwardIterator, typename _Predicate> |
599 | _ForwardIterator |
600 | partition_point(_ForwardIterator __first, _ForwardIterator __last, |
601 | _Predicate __pred) |
602 | { |
603 | // concept requirements |
604 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
605 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
606 | typename iterator_traits<_ForwardIterator>::value_type>) |
607 | |
608 | // A specific debug-mode test will be necessary... |
609 | __glibcxx_requires_valid_range(__first, __last); |
610 | |
611 | typedef typename iterator_traits<_ForwardIterator>::difference_type |
612 | _DistanceType; |
613 | |
614 | _DistanceType __len = std::distance(__first, __last); |
615 | _DistanceType __half; |
616 | _ForwardIterator __middle; |
617 | |
618 | while (__len > 0) |
619 | { |
620 | __half = __len >> 1; |
621 | __middle = __first; |
622 | std::advance(__middle, __half); |
623 | if (__pred(*__middle)) |
624 | { |
625 | __first = __middle; |
626 | ++__first; |
627 | __len = __len - __half - 1; |
628 | } |
629 | else |
630 | __len = __half; |
631 | } |
632 | return __first; |
633 | } |
634 | #endif |
635 | |
636 | template<typename _InputIterator, typename _OutputIterator, |
637 | typename _Predicate> |
638 | _OutputIterator |
639 | __remove_copy_if(_InputIterator __first, _InputIterator __last, |
640 | _OutputIterator __result, _Predicate __pred) |
641 | { |
642 | for (; __first != __last; ++__first) |
643 | if (!__pred(__first)) |
644 | { |
645 | *__result = *__first; |
646 | ++__result; |
647 | } |
648 | return __result; |
649 | } |
650 | |
651 | /** |
652 | * @brief Copy a sequence, removing elements of a given value. |
653 | * @ingroup mutating_algorithms |
654 | * @param __first An input iterator. |
655 | * @param __last An input iterator. |
656 | * @param __result An output iterator. |
657 | * @param __value The value to be removed. |
658 | * @return An iterator designating the end of the resulting sequence. |
659 | * |
660 | * Copies each element in the range @p [__first,__last) not equal |
661 | * to @p __value to the range beginning at @p __result. |
662 | * remove_copy() is stable, so the relative order of elements that |
663 | * are copied is unchanged. |
664 | */ |
665 | template<typename _InputIterator, typename _OutputIterator, typename _Tp> |
666 | inline _OutputIterator |
667 | remove_copy(_InputIterator __first, _InputIterator __last, |
668 | _OutputIterator __result, const _Tp& __value) |
669 | { |
670 | // concept requirements |
671 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
672 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
673 | typename iterator_traits<_InputIterator>::value_type>) |
674 | __glibcxx_function_requires(_EqualOpConcept< |
675 | typename iterator_traits<_InputIterator>::value_type, _Tp>) |
676 | __glibcxx_requires_valid_range(__first, __last); |
677 | |
678 | return std::__remove_copy_if(__first, __last, __result, |
679 | __gnu_cxx::__ops::__iter_equals_val(__value)); |
680 | } |
681 | |
682 | /** |
683 | * @brief Copy a sequence, removing elements for which a predicate is true. |
684 | * @ingroup mutating_algorithms |
685 | * @param __first An input iterator. |
686 | * @param __last An input iterator. |
687 | * @param __result An output iterator. |
688 | * @param __pred A predicate. |
689 | * @return An iterator designating the end of the resulting sequence. |
690 | * |
691 | * Copies each element in the range @p [__first,__last) for which |
692 | * @p __pred returns false to the range beginning at @p __result. |
693 | * |
694 | * remove_copy_if() is stable, so the relative order of elements that are |
695 | * copied is unchanged. |
696 | */ |
697 | template<typename _InputIterator, typename _OutputIterator, |
698 | typename _Predicate> |
699 | inline _OutputIterator |
700 | remove_copy_if(_InputIterator __first, _InputIterator __last, |
701 | _OutputIterator __result, _Predicate __pred) |
702 | { |
703 | // concept requirements |
704 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
705 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
706 | typename iterator_traits<_InputIterator>::value_type>) |
707 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
708 | typename iterator_traits<_InputIterator>::value_type>) |
709 | __glibcxx_requires_valid_range(__first, __last); |
710 | |
711 | return std::__remove_copy_if(__first, __last, __result, |
712 | __gnu_cxx::__ops::__pred_iter(__pred)); |
713 | } |
714 | |
715 | #if __cplusplus201103L >= 201103L |
716 | /** |
717 | * @brief Copy the elements of a sequence for which a predicate is true. |
718 | * @ingroup mutating_algorithms |
719 | * @param __first An input iterator. |
720 | * @param __last An input iterator. |
721 | * @param __result An output iterator. |
722 | * @param __pred A predicate. |
723 | * @return An iterator designating the end of the resulting sequence. |
724 | * |
725 | * Copies each element in the range @p [__first,__last) for which |
726 | * @p __pred returns true to the range beginning at @p __result. |
727 | * |
728 | * copy_if() is stable, so the relative order of elements that are |
729 | * copied is unchanged. |
730 | */ |
731 | template<typename _InputIterator, typename _OutputIterator, |
732 | typename _Predicate> |
733 | _OutputIterator |
734 | copy_if(_InputIterator __first, _InputIterator __last, |
735 | _OutputIterator __result, _Predicate __pred) |
736 | { |
737 | // concept requirements |
738 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
739 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
740 | typename iterator_traits<_InputIterator>::value_type>) |
741 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
742 | typename iterator_traits<_InputIterator>::value_type>) |
743 | __glibcxx_requires_valid_range(__first, __last); |
744 | |
745 | for (; __first != __last; ++__first) |
746 | if (__pred(*__first)) |
747 | { |
748 | *__result = *__first; |
749 | ++__result; |
750 | } |
751 | return __result; |
752 | } |
753 | |
754 | template<typename _InputIterator, typename _Size, typename _OutputIterator> |
755 | _OutputIterator |
756 | __copy_n(_InputIterator __first, _Size __n, |
757 | _OutputIterator __result, input_iterator_tag) |
758 | { |
759 | if (__n > 0) |
760 | { |
761 | while (true) |
762 | { |
763 | *__result = *__first; |
764 | ++__result; |
765 | if (--__n > 0) |
766 | ++__first; |
767 | else |
768 | break; |
769 | } |
770 | } |
771 | return __result; |
772 | } |
773 | |
774 | template<typename _RandomAccessIterator, typename _Size, |
775 | typename _OutputIterator> |
776 | inline _OutputIterator |
777 | __copy_n(_RandomAccessIterator __first, _Size __n, |
778 | _OutputIterator __result, random_access_iterator_tag) |
779 | { return std::copy(__first, __first + __n, __result); } |
780 | |
781 | /** |
782 | * @brief Copies the range [first,first+n) into [result,result+n). |
783 | * @ingroup mutating_algorithms |
784 | * @param __first An input iterator. |
785 | * @param __n The number of elements to copy. |
786 | * @param __result An output iterator. |
787 | * @return result+n. |
788 | * |
789 | * This inline function will boil down to a call to @c memmove whenever |
790 | * possible. Failing that, if random access iterators are passed, then the |
791 | * loop count will be known (and therefore a candidate for compiler |
792 | * optimizations such as unrolling). |
793 | */ |
794 | template<typename _InputIterator, typename _Size, typename _OutputIterator> |
795 | inline _OutputIterator |
796 | copy_n(_InputIterator __first, _Size __n, _OutputIterator __result) |
797 | { |
798 | // concept requirements |
799 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
800 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
801 | typename iterator_traits<_InputIterator>::value_type>) |
802 | |
803 | return std::__copy_n(__first, __n, __result, |
804 | std::__iterator_category(__first)); |
805 | } |
806 | |
807 | /** |
808 | * @brief Copy the elements of a sequence to separate output sequences |
809 | * depending on the truth value of a predicate. |
810 | * @ingroup mutating_algorithms |
811 | * @param __first An input iterator. |
812 | * @param __last An input iterator. |
813 | * @param __out_true An output iterator. |
814 | * @param __out_false An output iterator. |
815 | * @param __pred A predicate. |
816 | * @return A pair designating the ends of the resulting sequences. |
817 | * |
818 | * Copies each element in the range @p [__first,__last) for which |
819 | * @p __pred returns true to the range beginning at @p out_true |
820 | * and each element for which @p __pred returns false to @p __out_false. |
821 | */ |
822 | template<typename _InputIterator, typename _OutputIterator1, |
823 | typename _OutputIterator2, typename _Predicate> |
824 | pair<_OutputIterator1, _OutputIterator2> |
825 | partition_copy(_InputIterator __first, _InputIterator __last, |
826 | _OutputIterator1 __out_true, _OutputIterator2 __out_false, |
827 | _Predicate __pred) |
828 | { |
829 | // concept requirements |
830 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
831 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator1, |
832 | typename iterator_traits<_InputIterator>::value_type>) |
833 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator2, |
834 | typename iterator_traits<_InputIterator>::value_type>) |
835 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
836 | typename iterator_traits<_InputIterator>::value_type>) |
837 | __glibcxx_requires_valid_range(__first, __last); |
838 | |
839 | for (; __first != __last; ++__first) |
840 | if (__pred(*__first)) |
841 | { |
842 | *__out_true = *__first; |
843 | ++__out_true; |
844 | } |
845 | else |
846 | { |
847 | *__out_false = *__first; |
848 | ++__out_false; |
849 | } |
850 | |
851 | return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); |
852 | } |
853 | #endif |
854 | |
855 | template<typename _ForwardIterator, typename _Predicate> |
856 | _ForwardIterator |
857 | __remove_if(_ForwardIterator __first, _ForwardIterator __last, |
858 | _Predicate __pred) |
859 | { |
860 | __first = std::__find_if(__first, __last, __pred); |
861 | if (__first == __last) |
862 | return __first; |
863 | _ForwardIterator __result = __first; |
864 | ++__first; |
865 | for (; __first != __last; ++__first) |
866 | if (!__pred(__first)) |
867 | { |
868 | *__result = _GLIBCXX_MOVE(*__first)std::move(*__first); |
869 | ++__result; |
870 | } |
871 | return __result; |
872 | } |
873 | |
874 | /** |
875 | * @brief Remove elements from a sequence. |
876 | * @ingroup mutating_algorithms |
877 | * @param __first An input iterator. |
878 | * @param __last An input iterator. |
879 | * @param __value The value to be removed. |
880 | * @return An iterator designating the end of the resulting sequence. |
881 | * |
882 | * All elements equal to @p __value are removed from the range |
883 | * @p [__first,__last). |
884 | * |
885 | * remove() is stable, so the relative order of elements that are |
886 | * not removed is unchanged. |
887 | * |
888 | * Elements between the end of the resulting sequence and @p __last |
889 | * are still present, but their value is unspecified. |
890 | */ |
891 | template<typename _ForwardIterator, typename _Tp> |
892 | inline _ForwardIterator |
893 | remove(_ForwardIterator __first, _ForwardIterator __last, |
894 | const _Tp& __value) |
895 | { |
896 | // concept requirements |
897 | __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< |
898 | _ForwardIterator>) |
899 | __glibcxx_function_requires(_EqualOpConcept< |
900 | typename iterator_traits<_ForwardIterator>::value_type, _Tp>) |
901 | __glibcxx_requires_valid_range(__first, __last); |
902 | |
903 | return std::__remove_if(__first, __last, |
904 | __gnu_cxx::__ops::__iter_equals_val(__value)); |
905 | } |
906 | |
907 | /** |
908 | * @brief Remove elements from a sequence using a predicate. |
909 | * @ingroup mutating_algorithms |
910 | * @param __first A forward iterator. |
911 | * @param __last A forward iterator. |
912 | * @param __pred A predicate. |
913 | * @return An iterator designating the end of the resulting sequence. |
914 | * |
915 | * All elements for which @p __pred returns true are removed from the range |
916 | * @p [__first,__last). |
917 | * |
918 | * remove_if() is stable, so the relative order of elements that are |
919 | * not removed is unchanged. |
920 | * |
921 | * Elements between the end of the resulting sequence and @p __last |
922 | * are still present, but their value is unspecified. |
923 | */ |
924 | template<typename _ForwardIterator, typename _Predicate> |
925 | inline _ForwardIterator |
926 | remove_if(_ForwardIterator __first, _ForwardIterator __last, |
927 | _Predicate __pred) |
928 | { |
929 | // concept requirements |
930 | __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< |
931 | _ForwardIterator>) |
932 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
933 | typename iterator_traits<_ForwardIterator>::value_type>) |
934 | __glibcxx_requires_valid_range(__first, __last); |
935 | |
936 | return std::__remove_if(__first, __last, |
937 | __gnu_cxx::__ops::__pred_iter(__pred)); |
938 | } |
939 | |
940 | template<typename _ForwardIterator, typename _BinaryPredicate> |
941 | _ForwardIterator |
942 | __adjacent_find(_ForwardIterator __first, _ForwardIterator __last, |
943 | _BinaryPredicate __binary_pred) |
944 | { |
945 | if (__first == __last) |
946 | return __last; |
947 | _ForwardIterator __next = __first; |
948 | while (++__next != __last) |
949 | { |
950 | if (__binary_pred(__first, __next)) |
951 | return __first; |
952 | __first = __next; |
953 | } |
954 | return __last; |
955 | } |
956 | |
957 | template<typename _ForwardIterator, typename _BinaryPredicate> |
958 | _ForwardIterator |
959 | __unique(_ForwardIterator __first, _ForwardIterator __last, |
960 | _BinaryPredicate __binary_pred) |
961 | { |
962 | // Skip the beginning, if already unique. |
963 | __first = std::__adjacent_find(__first, __last, __binary_pred); |
964 | if (__first == __last) |
965 | return __last; |
966 | |
967 | // Do the real copy work. |
968 | _ForwardIterator __dest = __first; |
969 | ++__first; |
970 | while (++__first != __last) |
971 | if (!__binary_pred(__dest, __first)) |
972 | *++__dest = _GLIBCXX_MOVE(*__first)std::move(*__first); |
973 | return ++__dest; |
974 | } |
975 | |
976 | /** |
977 | * @brief Remove consecutive duplicate values from a sequence. |
978 | * @ingroup mutating_algorithms |
979 | * @param __first A forward iterator. |
980 | * @param __last A forward iterator. |
981 | * @return An iterator designating the end of the resulting sequence. |
982 | * |
983 | * Removes all but the first element from each group of consecutive |
984 | * values that compare equal. |
985 | * unique() is stable, so the relative order of elements that are |
986 | * not removed is unchanged. |
987 | * Elements between the end of the resulting sequence and @p __last |
988 | * are still present, but their value is unspecified. |
989 | */ |
990 | template<typename _ForwardIterator> |
991 | inline _ForwardIterator |
992 | unique(_ForwardIterator __first, _ForwardIterator __last) |
993 | { |
994 | // concept requirements |
995 | __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< |
996 | _ForwardIterator>) |
997 | __glibcxx_function_requires(_EqualityComparableConcept< |
998 | typename iterator_traits<_ForwardIterator>::value_type>) |
999 | __glibcxx_requires_valid_range(__first, __last); |
1000 | |
1001 | return std::__unique(__first, __last, |
1002 | __gnu_cxx::__ops::__iter_equal_to_iter()); |
1003 | } |
1004 | |
1005 | /** |
1006 | * @brief Remove consecutive values from a sequence using a predicate. |
1007 | * @ingroup mutating_algorithms |
1008 | * @param __first A forward iterator. |
1009 | * @param __last A forward iterator. |
1010 | * @param __binary_pred A binary predicate. |
1011 | * @return An iterator designating the end of the resulting sequence. |
1012 | * |
1013 | * Removes all but the first element from each group of consecutive |
1014 | * values for which @p __binary_pred returns true. |
1015 | * unique() is stable, so the relative order of elements that are |
1016 | * not removed is unchanged. |
1017 | * Elements between the end of the resulting sequence and @p __last |
1018 | * are still present, but their value is unspecified. |
1019 | */ |
1020 | template<typename _ForwardIterator, typename _BinaryPredicate> |
1021 | inline _ForwardIterator |
1022 | unique(_ForwardIterator __first, _ForwardIterator __last, |
1023 | _BinaryPredicate __binary_pred) |
1024 | { |
1025 | // concept requirements |
1026 | __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< |
1027 | _ForwardIterator>) |
1028 | __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, |
1029 | typename iterator_traits<_ForwardIterator>::value_type, |
1030 | typename iterator_traits<_ForwardIterator>::value_type>) |
1031 | __glibcxx_requires_valid_range(__first, __last); |
1032 | |
1033 | return std::__unique(__first, __last, |
1034 | __gnu_cxx::__ops::__iter_comp_iter(__binary_pred)); |
1035 | } |
1036 | |
1037 | /** |
1038 | * This is an uglified |
1039 | * unique_copy(_InputIterator, _InputIterator, _OutputIterator, |
1040 | * _BinaryPredicate) |
1041 | * overloaded for forward iterators and output iterator as result. |
1042 | */ |
1043 | template<typename _ForwardIterator, typename _OutputIterator, |
1044 | typename _BinaryPredicate> |
1045 | _OutputIterator |
1046 | __unique_copy(_ForwardIterator __first, _ForwardIterator __last, |
1047 | _OutputIterator __result, _BinaryPredicate __binary_pred, |
1048 | forward_iterator_tag, output_iterator_tag) |
1049 | { |
1050 | // concept requirements -- iterators already checked |
1051 | __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, |
1052 | typename iterator_traits<_ForwardIterator>::value_type, |
1053 | typename iterator_traits<_ForwardIterator>::value_type>) |
1054 | |
1055 | _ForwardIterator __next = __first; |
1056 | *__result = *__first; |
1057 | while (++__next != __last) |
1058 | if (!__binary_pred(__first, __next)) |
1059 | { |
1060 | __first = __next; |
1061 | *++__result = *__first; |
1062 | } |
1063 | return ++__result; |
1064 | } |
1065 | |
1066 | /** |
1067 | * This is an uglified |
1068 | * unique_copy(_InputIterator, _InputIterator, _OutputIterator, |
1069 | * _BinaryPredicate) |
1070 | * overloaded for input iterators and output iterator as result. |
1071 | */ |
1072 | template<typename _InputIterator, typename _OutputIterator, |
1073 | typename _BinaryPredicate> |
1074 | _OutputIterator |
1075 | __unique_copy(_InputIterator __first, _InputIterator __last, |
1076 | _OutputIterator __result, _BinaryPredicate __binary_pred, |
1077 | input_iterator_tag, output_iterator_tag) |
1078 | { |
1079 | // concept requirements -- iterators already checked |
1080 | __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, |
1081 | typename iterator_traits<_InputIterator>::value_type, |
1082 | typename iterator_traits<_InputIterator>::value_type>) |
1083 | |
1084 | typename iterator_traits<_InputIterator>::value_type __value = *__first; |
1085 | __decltype(__gnu_cxx::__ops::__iter_comp_val(__binary_pred)) |
1086 | __rebound_pred |
1087 | = __gnu_cxx::__ops::__iter_comp_val(__binary_pred); |
1088 | *__result = __value; |
1089 | while (++__first != __last) |
1090 | if (!__rebound_pred(__first, __value)) |
1091 | { |
1092 | __value = *__first; |
1093 | *++__result = __value; |
1094 | } |
1095 | return ++__result; |
1096 | } |
1097 | |
1098 | /** |
1099 | * This is an uglified |
1100 | * unique_copy(_InputIterator, _InputIterator, _OutputIterator, |
1101 | * _BinaryPredicate) |
1102 | * overloaded for input iterators and forward iterator as result. |
1103 | */ |
1104 | template<typename _InputIterator, typename _ForwardIterator, |
1105 | typename _BinaryPredicate> |
1106 | _ForwardIterator |
1107 | __unique_copy(_InputIterator __first, _InputIterator __last, |
1108 | _ForwardIterator __result, _BinaryPredicate __binary_pred, |
1109 | input_iterator_tag, forward_iterator_tag) |
1110 | { |
1111 | // concept requirements -- iterators already checked |
1112 | __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, |
1113 | typename iterator_traits<_ForwardIterator>::value_type, |
1114 | typename iterator_traits<_InputIterator>::value_type>) |
1115 | *__result = *__first; |
1116 | while (++__first != __last) |
1117 | if (!__binary_pred(__result, __first)) |
1118 | *++__result = *__first; |
1119 | return ++__result; |
1120 | } |
1121 | |
1122 | /** |
1123 | * This is an uglified reverse(_BidirectionalIterator, |
1124 | * _BidirectionalIterator) |
1125 | * overloaded for bidirectional iterators. |
1126 | */ |
1127 | template<typename _BidirectionalIterator> |
1128 | void |
1129 | __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, |
1130 | bidirectional_iterator_tag) |
1131 | { |
1132 | while (true) |
1133 | if (__first == __last || __first == --__last) |
1134 | return; |
1135 | else |
1136 | { |
1137 | std::iter_swap(__first, __last); |
1138 | ++__first; |
1139 | } |
1140 | } |
1141 | |
1142 | /** |
1143 | * This is an uglified reverse(_BidirectionalIterator, |
1144 | * _BidirectionalIterator) |
1145 | * overloaded for random access iterators. |
1146 | */ |
1147 | template<typename _RandomAccessIterator> |
1148 | void |
1149 | __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, |
1150 | random_access_iterator_tag) |
1151 | { |
1152 | if (__first == __last) |
1153 | return; |
1154 | --__last; |
1155 | while (__first < __last) |
1156 | { |
1157 | std::iter_swap(__first, __last); |
1158 | ++__first; |
1159 | --__last; |
1160 | } |
1161 | } |
1162 | |
1163 | /** |
1164 | * @brief Reverse a sequence. |
1165 | * @ingroup mutating_algorithms |
1166 | * @param __first A bidirectional iterator. |
1167 | * @param __last A bidirectional iterator. |
1168 | * @return reverse() returns no value. |
1169 | * |
1170 | * Reverses the order of the elements in the range @p [__first,__last), |
1171 | * so that the first element becomes the last etc. |
1172 | * For every @c i such that @p 0<=i<=(__last-__first)/2), @p reverse() |
1173 | * swaps @p *(__first+i) and @p *(__last-(i+1)) |
1174 | */ |
1175 | template<typename _BidirectionalIterator> |
1176 | inline void |
1177 | reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) |
1178 | { |
1179 | // concept requirements |
1180 | __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< |
1181 | _BidirectionalIterator>) |
1182 | __glibcxx_requires_valid_range(__first, __last); |
1183 | std::__reverse(__first, __last, std::__iterator_category(__first)); |
1184 | } |
1185 | |
1186 | /** |
1187 | * @brief Copy a sequence, reversing its elements. |
1188 | * @ingroup mutating_algorithms |
1189 | * @param __first A bidirectional iterator. |
1190 | * @param __last A bidirectional iterator. |
1191 | * @param __result An output iterator. |
1192 | * @return An iterator designating the end of the resulting sequence. |
1193 | * |
1194 | * Copies the elements in the range @p [__first,__last) to the |
1195 | * range @p [__result,__result+(__last-__first)) such that the |
1196 | * order of the elements is reversed. For every @c i such that @p |
1197 | * 0<=i<=(__last-__first), @p reverse_copy() performs the |
1198 | * assignment @p *(__result+(__last-__first)-1-i) = *(__first+i). |
1199 | * The ranges @p [__first,__last) and @p |
1200 | * [__result,__result+(__last-__first)) must not overlap. |
1201 | */ |
1202 | template<typename _BidirectionalIterator, typename _OutputIterator> |
1203 | _OutputIterator |
1204 | reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, |
1205 | _OutputIterator __result) |
1206 | { |
1207 | // concept requirements |
1208 | __glibcxx_function_requires(_BidirectionalIteratorConcept< |
1209 | _BidirectionalIterator>) |
1210 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
1211 | typename iterator_traits<_BidirectionalIterator>::value_type>) |
1212 | __glibcxx_requires_valid_range(__first, __last); |
1213 | |
1214 | while (__first != __last) |
1215 | { |
1216 | --__last; |
1217 | *__result = *__last; |
1218 | ++__result; |
1219 | } |
1220 | return __result; |
1221 | } |
1222 | |
1223 | /** |
1224 | * This is a helper function for the rotate algorithm specialized on RAIs. |
1225 | * It returns the greatest common divisor of two integer values. |
1226 | */ |
1227 | template<typename _EuclideanRingElement> |
1228 | _EuclideanRingElement |
1229 | __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) |
1230 | { |
1231 | while (__n != 0) |
1232 | { |
1233 | _EuclideanRingElement __t = __m % __n; |
1234 | __m = __n; |
1235 | __n = __t; |
1236 | } |
1237 | return __m; |
1238 | } |
1239 | |
1240 | inline namespace _V2 |
1241 | { |
1242 | |
1243 | /// This is a helper function for the rotate algorithm. |
1244 | template<typename _ForwardIterator> |
1245 | _ForwardIterator |
1246 | __rotate(_ForwardIterator __first, |
1247 | _ForwardIterator __middle, |
1248 | _ForwardIterator __last, |
1249 | forward_iterator_tag) |
1250 | { |
1251 | if (__first == __middle) |
1252 | return __last; |
1253 | else if (__last == __middle) |
1254 | return __first; |
1255 | |
1256 | _ForwardIterator __first2 = __middle; |
1257 | do |
1258 | { |
1259 | std::iter_swap(__first, __first2); |
1260 | ++__first; |
1261 | ++__first2; |
1262 | if (__first == __middle) |
1263 | __middle = __first2; |
1264 | } |
1265 | while (__first2 != __last); |
1266 | |
1267 | _ForwardIterator __ret = __first; |
1268 | |
1269 | __first2 = __middle; |
1270 | |
1271 | while (__first2 != __last) |
1272 | { |
1273 | std::iter_swap(__first, __first2); |
1274 | ++__first; |
1275 | ++__first2; |
1276 | if (__first == __middle) |
1277 | __middle = __first2; |
1278 | else if (__first2 == __last) |
1279 | __first2 = __middle; |
1280 | } |
1281 | return __ret; |
1282 | } |
1283 | |
1284 | /// This is a helper function for the rotate algorithm. |
1285 | template<typename _BidirectionalIterator> |
1286 | _BidirectionalIterator |
1287 | __rotate(_BidirectionalIterator __first, |
1288 | _BidirectionalIterator __middle, |
1289 | _BidirectionalIterator __last, |
1290 | bidirectional_iterator_tag) |
1291 | { |
1292 | // concept requirements |
1293 | __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< |
1294 | _BidirectionalIterator>) |
1295 | |
1296 | if (__first == __middle) |
1297 | return __last; |
1298 | else if (__last == __middle) |
1299 | return __first; |
1300 | |
1301 | std::__reverse(__first, __middle, bidirectional_iterator_tag()); |
1302 | std::__reverse(__middle, __last, bidirectional_iterator_tag()); |
1303 | |
1304 | while (__first != __middle && __middle != __last) |
1305 | { |
1306 | std::iter_swap(__first, --__last); |
1307 | ++__first; |
1308 | } |
1309 | |
1310 | if (__first == __middle) |
1311 | { |
1312 | std::__reverse(__middle, __last, bidirectional_iterator_tag()); |
1313 | return __last; |
1314 | } |
1315 | else |
1316 | { |
1317 | std::__reverse(__first, __middle, bidirectional_iterator_tag()); |
1318 | return __first; |
1319 | } |
1320 | } |
1321 | |
1322 | /// This is a helper function for the rotate algorithm. |
1323 | template<typename _RandomAccessIterator> |
1324 | _RandomAccessIterator |
1325 | __rotate(_RandomAccessIterator __first, |
1326 | _RandomAccessIterator __middle, |
1327 | _RandomAccessIterator __last, |
1328 | random_access_iterator_tag) |
1329 | { |
1330 | // concept requirements |
1331 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
1332 | _RandomAccessIterator>) |
1333 | |
1334 | if (__first == __middle) |
1335 | return __last; |
1336 | else if (__last == __middle) |
1337 | return __first; |
1338 | |
1339 | typedef typename iterator_traits<_RandomAccessIterator>::difference_type |
1340 | _Distance; |
1341 | typedef typename iterator_traits<_RandomAccessIterator>::value_type |
1342 | _ValueType; |
1343 | |
1344 | _Distance __n = __last - __first; |
1345 | _Distance __k = __middle - __first; |
1346 | |
1347 | if (__k == __n - __k) |
1348 | { |
1349 | std::swap_ranges(__first, __middle, __middle); |
1350 | return __middle; |
1351 | } |
1352 | |
1353 | _RandomAccessIterator __p = __first; |
1354 | _RandomAccessIterator __ret = __first + (__last - __middle); |
1355 | |
1356 | for (;;) |
1357 | { |
1358 | if (__k < __n - __k) |
1359 | { |
1360 | if (__is_pod(_ValueType) && __k == 1) |
1361 | { |
1362 | _ValueType __t = _GLIBCXX_MOVE(*__p)std::move(*__p); |
1363 | _GLIBCXX_MOVE3(__p + 1, __p + __n, __p)std::move(__p + 1, __p + __n, __p); |
1364 | *(__p + __n - 1) = _GLIBCXX_MOVE(__t)std::move(__t); |
1365 | return __ret; |
1366 | } |
1367 | _RandomAccessIterator __q = __p + __k; |
1368 | for (_Distance __i = 0; __i < __n - __k; ++ __i) |
1369 | { |
1370 | std::iter_swap(__p, __q); |
1371 | ++__p; |
1372 | ++__q; |
1373 | } |
1374 | __n %= __k; |
1375 | if (__n == 0) |
1376 | return __ret; |
1377 | std::swap(__n, __k); |
1378 | __k = __n - __k; |
1379 | } |
1380 | else |
1381 | { |
1382 | __k = __n - __k; |
1383 | if (__is_pod(_ValueType) && __k == 1) |
1384 | { |
1385 | _ValueType __t = _GLIBCXX_MOVE(*(__p + __n - 1))std::move(*(__p + __n - 1)); |
1386 | _GLIBCXX_MOVE_BACKWARD3(__p, __p + __n - 1, __p + __n)std::move_backward(__p, __p + __n - 1, __p + __n); |
1387 | *__p = _GLIBCXX_MOVE(__t)std::move(__t); |
1388 | return __ret; |
1389 | } |
1390 | _RandomAccessIterator __q = __p + __n; |
1391 | __p = __q - __k; |
1392 | for (_Distance __i = 0; __i < __n - __k; ++ __i) |
1393 | { |
1394 | --__p; |
1395 | --__q; |
1396 | std::iter_swap(__p, __q); |
1397 | } |
1398 | __n %= __k; |
1399 | if (__n == 0) |
1400 | return __ret; |
1401 | std::swap(__n, __k); |
1402 | } |
1403 | } |
1404 | } |
1405 | |
1406 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
1407 | // DR 488. rotate throws away useful information |
1408 | /** |
1409 | * @brief Rotate the elements of a sequence. |
1410 | * @ingroup mutating_algorithms |
1411 | * @param __first A forward iterator. |
1412 | * @param __middle A forward iterator. |
1413 | * @param __last A forward iterator. |
1414 | * @return first + (last - middle). |
1415 | * |
1416 | * Rotates the elements of the range @p [__first,__last) by |
1417 | * @p (__middle - __first) positions so that the element at @p __middle |
1418 | * is moved to @p __first, the element at @p __middle+1 is moved to |
1419 | * @p __first+1 and so on for each element in the range |
1420 | * @p [__first,__last). |
1421 | * |
1422 | * This effectively swaps the ranges @p [__first,__middle) and |
1423 | * @p [__middle,__last). |
1424 | * |
1425 | * Performs |
1426 | * @p *(__first+(n+(__last-__middle))%(__last-__first))=*(__first+n) |
1427 | * for each @p n in the range @p [0,__last-__first). |
1428 | */ |
1429 | template<typename _ForwardIterator> |
1430 | inline _ForwardIterator |
1431 | rotate(_ForwardIterator __first, _ForwardIterator __middle, |
1432 | _ForwardIterator __last) |
1433 | { |
1434 | // concept requirements |
1435 | __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< |
1436 | _ForwardIterator>) |
1437 | __glibcxx_requires_valid_range(__first, __middle); |
1438 | __glibcxx_requires_valid_range(__middle, __last); |
1439 | |
1440 | return std::__rotate(__first, __middle, __last, |
1441 | std::__iterator_category(__first)); |
1442 | } |
1443 | |
1444 | } // namespace _V2 |
1445 | |
1446 | /** |
1447 | * @brief Copy a sequence, rotating its elements. |
1448 | * @ingroup mutating_algorithms |
1449 | * @param __first A forward iterator. |
1450 | * @param __middle A forward iterator. |
1451 | * @param __last A forward iterator. |
1452 | * @param __result An output iterator. |
1453 | * @return An iterator designating the end of the resulting sequence. |
1454 | * |
1455 | * Copies the elements of the range @p [__first,__last) to the |
1456 | * range beginning at @result, rotating the copied elements by |
1457 | * @p (__middle-__first) positions so that the element at @p __middle |
1458 | * is moved to @p __result, the element at @p __middle+1 is moved |
1459 | * to @p __result+1 and so on for each element in the range @p |
1460 | * [__first,__last). |
1461 | * |
1462 | * Performs |
1463 | * @p *(__result+(n+(__last-__middle))%(__last-__first))=*(__first+n) |
1464 | * for each @p n in the range @p [0,__last-__first). |
1465 | */ |
1466 | template<typename _ForwardIterator, typename _OutputIterator> |
1467 | inline _OutputIterator |
1468 | rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, |
1469 | _ForwardIterator __last, _OutputIterator __result) |
1470 | { |
1471 | // concept requirements |
1472 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
1473 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
1474 | typename iterator_traits<_ForwardIterator>::value_type>) |
1475 | __glibcxx_requires_valid_range(__first, __middle); |
1476 | __glibcxx_requires_valid_range(__middle, __last); |
1477 | |
1478 | return std::copy(__first, __middle, |
1479 | std::copy(__middle, __last, __result)); |
1480 | } |
1481 | |
1482 | /// This is a helper function... |
1483 | template<typename _ForwardIterator, typename _Predicate> |
1484 | _ForwardIterator |
1485 | __partition(_ForwardIterator __first, _ForwardIterator __last, |
1486 | _Predicate __pred, forward_iterator_tag) |
1487 | { |
1488 | if (__first == __last) |
1489 | return __first; |
1490 | |
1491 | while (__pred(*__first)) |
1492 | if (++__first == __last) |
1493 | return __first; |
1494 | |
1495 | _ForwardIterator __next = __first; |
1496 | |
1497 | while (++__next != __last) |
1498 | if (__pred(*__next)) |
1499 | { |
1500 | std::iter_swap(__first, __next); |
1501 | ++__first; |
1502 | } |
1503 | |
1504 | return __first; |
1505 | } |
1506 | |
1507 | /// This is a helper function... |
1508 | template<typename _BidirectionalIterator, typename _Predicate> |
1509 | _BidirectionalIterator |
1510 | __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, |
1511 | _Predicate __pred, bidirectional_iterator_tag) |
1512 | { |
1513 | while (true) |
1514 | { |
1515 | while (true) |
1516 | if (__first == __last) |
1517 | return __first; |
1518 | else if (__pred(*__first)) |
1519 | ++__first; |
1520 | else |
1521 | break; |
1522 | --__last; |
1523 | while (true) |
1524 | if (__first == __last) |
1525 | return __first; |
1526 | else if (!bool(__pred(*__last))) |
1527 | --__last; |
1528 | else |
1529 | break; |
1530 | std::iter_swap(__first, __last); |
1531 | ++__first; |
1532 | } |
1533 | } |
1534 | |
1535 | // partition |
1536 | |
1537 | /// This is a helper function... |
1538 | /// Requires __first != __last and !__pred(__first) |
1539 | /// and __len == distance(__first, __last). |
1540 | /// |
1541 | /// !__pred(__first) allows us to guarantee that we don't |
1542 | /// move-assign an element onto itself. |
1543 | template<typename _ForwardIterator, typename _Pointer, typename _Predicate, |
1544 | typename _Distance> |
1545 | _ForwardIterator |
1546 | __stable_partition_adaptive(_ForwardIterator __first, |
1547 | _ForwardIterator __last, |
1548 | _Predicate __pred, _Distance __len, |
1549 | _Pointer __buffer, |
1550 | _Distance __buffer_size) |
1551 | { |
1552 | if (__len == 1) |
1553 | return __first; |
1554 | |
1555 | if (__len <= __buffer_size) |
1556 | { |
1557 | _ForwardIterator __result1 = __first; |
1558 | _Pointer __result2 = __buffer; |
1559 | |
1560 | // The precondition guarantees that !__pred(__first), so |
1561 | // move that element to the buffer before starting the loop. |
1562 | // This ensures that we only call __pred once per element. |
1563 | *__result2 = _GLIBCXX_MOVE(*__first)std::move(*__first); |
1564 | ++__result2; |
1565 | ++__first; |
1566 | for (; __first != __last; ++__first) |
1567 | if (__pred(__first)) |
1568 | { |
1569 | *__result1 = _GLIBCXX_MOVE(*__first)std::move(*__first); |
1570 | ++__result1; |
1571 | } |
1572 | else |
1573 | { |
1574 | *__result2 = _GLIBCXX_MOVE(*__first)std::move(*__first); |
1575 | ++__result2; |
1576 | } |
1577 | |
1578 | _GLIBCXX_MOVE3(__buffer, __result2, __result1)std::move(__buffer, __result2, __result1); |
1579 | return __result1; |
1580 | } |
1581 | |
1582 | _ForwardIterator __middle = __first; |
1583 | std::advance(__middle, __len / 2); |
1584 | _ForwardIterator __left_split = |
1585 | std::__stable_partition_adaptive(__first, __middle, __pred, |
1586 | __len / 2, __buffer, |
1587 | __buffer_size); |
1588 | |
1589 | // Advance past true-predicate values to satisfy this |
1590 | // function's preconditions. |
1591 | _Distance __right_len = __len - __len / 2; |
1592 | _ForwardIterator __right_split = |
1593 | std::__find_if_not_n(__middle, __right_len, __pred); |
1594 | |
1595 | if (__right_len) |
1596 | __right_split = |
1597 | std::__stable_partition_adaptive(__right_split, __last, __pred, |
1598 | __right_len, |
1599 | __buffer, __buffer_size); |
1600 | |
1601 | std::rotate(__left_split, __middle, __right_split); |
1602 | std::advance(__left_split, std::distance(__middle, __right_split)); |
1603 | return __left_split; |
1604 | } |
1605 | |
1606 | template<typename _ForwardIterator, typename _Predicate> |
1607 | _ForwardIterator |
1608 | __stable_partition(_ForwardIterator __first, _ForwardIterator __last, |
1609 | _Predicate __pred) |
1610 | { |
1611 | __first = std::__find_if_not(__first, __last, __pred); |
1612 | |
1613 | if (__first == __last) |
1614 | return __first; |
1615 | |
1616 | typedef typename iterator_traits<_ForwardIterator>::value_type |
1617 | _ValueType; |
1618 | typedef typename iterator_traits<_ForwardIterator>::difference_type |
1619 | _DistanceType; |
1620 | |
1621 | _Temporary_buffer<_ForwardIterator, _ValueType> __buf(__first, __last); |
1622 | return |
1623 | std::__stable_partition_adaptive(__first, __last, __pred, |
1624 | _DistanceType(__buf.requested_size()), |
1625 | __buf.begin(), |
1626 | _DistanceType(__buf.size())); |
1627 | } |
1628 | |
1629 | /** |
1630 | * @brief Move elements for which a predicate is true to the beginning |
1631 | * of a sequence, preserving relative ordering. |
1632 | * @ingroup mutating_algorithms |
1633 | * @param __first A forward iterator. |
1634 | * @param __last A forward iterator. |
1635 | * @param __pred A predicate functor. |
1636 | * @return An iterator @p middle such that @p __pred(i) is true for each |
1637 | * iterator @p i in the range @p [first,middle) and false for each @p i |
1638 | * in the range @p [middle,last). |
1639 | * |
1640 | * Performs the same function as @p partition() with the additional |
1641 | * guarantee that the relative ordering of elements in each group is |
1642 | * preserved, so any two elements @p x and @p y in the range |
1643 | * @p [__first,__last) such that @p __pred(x)==__pred(y) will have the same |
1644 | * relative ordering after calling @p stable_partition(). |
1645 | */ |
1646 | template<typename _ForwardIterator, typename _Predicate> |
1647 | inline _ForwardIterator |
1648 | stable_partition(_ForwardIterator __first, _ForwardIterator __last, |
1649 | _Predicate __pred) |
1650 | { |
1651 | // concept requirements |
1652 | __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< |
1653 | _ForwardIterator>) |
1654 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
1655 | typename iterator_traits<_ForwardIterator>::value_type>) |
1656 | __glibcxx_requires_valid_range(__first, __last); |
1657 | |
1658 | return std::__stable_partition(__first, __last, |
1659 | __gnu_cxx::__ops::__pred_iter(__pred)); |
1660 | } |
1661 | |
1662 | /// This is a helper function for the sort routines. |
1663 | template<typename _RandomAccessIterator, typename _Compare> |
1664 | void |
1665 | __heap_select(_RandomAccessIterator __first, |
1666 | _RandomAccessIterator __middle, |
1667 | _RandomAccessIterator __last, _Compare __comp) |
1668 | { |
1669 | std::__make_heap(__first, __middle, __comp); |
1670 | for (_RandomAccessIterator __i = __middle; __i < __last; ++__i) |
1671 | if (__comp(__i, __first)) |
1672 | std::__pop_heap(__first, __middle, __i, __comp); |
1673 | } |
1674 | |
1675 | // partial_sort |
1676 | |
1677 | template<typename _InputIterator, typename _RandomAccessIterator, |
1678 | typename _Compare> |
1679 | _RandomAccessIterator |
1680 | __partial_sort_copy(_InputIterator __first, _InputIterator __last, |
1681 | _RandomAccessIterator __result_first, |
1682 | _RandomAccessIterator __result_last, |
1683 | _Compare __comp) |
1684 | { |
1685 | typedef typename iterator_traits<_InputIterator>::value_type |
1686 | _InputValueType; |
1687 | typedef iterator_traits<_RandomAccessIterator> _RItTraits; |
1688 | typedef typename _RItTraits::difference_type _DistanceType; |
1689 | |
1690 | if (__result_first == __result_last) |
1691 | return __result_last; |
1692 | _RandomAccessIterator __result_real_last = __result_first; |
1693 | while (__first != __last && __result_real_last != __result_last) |
1694 | { |
1695 | *__result_real_last = *__first; |
1696 | ++__result_real_last; |
1697 | ++__first; |
1698 | } |
1699 | |
1700 | std::__make_heap(__result_first, __result_real_last, __comp); |
1701 | while (__first != __last) |
1702 | { |
1703 | if (__comp(__first, __result_first)) |
1704 | std::__adjust_heap(__result_first, _DistanceType(0), |
1705 | _DistanceType(__result_real_last |
1706 | - __result_first), |
1707 | _InputValueType(*__first), __comp); |
1708 | ++__first; |
1709 | } |
1710 | std::__sort_heap(__result_first, __result_real_last, __comp); |
1711 | return __result_real_last; |
1712 | } |
1713 | |
1714 | /** |
1715 | * @brief Copy the smallest elements of a sequence. |
1716 | * @ingroup sorting_algorithms |
1717 | * @param __first An iterator. |
1718 | * @param __last Another iterator. |
1719 | * @param __result_first A random-access iterator. |
1720 | * @param __result_last Another random-access iterator. |
1721 | * @return An iterator indicating the end of the resulting sequence. |
1722 | * |
1723 | * Copies and sorts the smallest N values from the range @p [__first,__last) |
1724 | * to the range beginning at @p __result_first, where the number of |
1725 | * elements to be copied, @p N, is the smaller of @p (__last-__first) and |
1726 | * @p (__result_last-__result_first). |
1727 | * After the sort if @e i and @e j are iterators in the range |
1728 | * @p [__result_first,__result_first+N) such that i precedes j then |
1729 | * *j<*i is false. |
1730 | * The value returned is @p __result_first+N. |
1731 | */ |
1732 | template<typename _InputIterator, typename _RandomAccessIterator> |
1733 | inline _RandomAccessIterator |
1734 | partial_sort_copy(_InputIterator __first, _InputIterator __last, |
1735 | _RandomAccessIterator __result_first, |
1736 | _RandomAccessIterator __result_last) |
1737 | { |
1738 | #ifdef _GLIBCXX_CONCEPT_CHECKS |
1739 | typedef typename iterator_traits<_InputIterator>::value_type |
1740 | _InputValueType; |
1741 | typedef typename iterator_traits<_RandomAccessIterator>::value_type |
1742 | _OutputValueType; |
1743 | #endif |
1744 | |
1745 | // concept requirements |
1746 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
1747 | __glibcxx_function_requires(_ConvertibleConcept<_InputValueType, |
1748 | _OutputValueType>) |
1749 | __glibcxx_function_requires(_LessThanOpConcept<_InputValueType, |
1750 | _OutputValueType>) |
1751 | __glibcxx_function_requires(_LessThanComparableConcept<_OutputValueType>) |
1752 | __glibcxx_requires_valid_range(__first, __last); |
1753 | __glibcxx_requires_irreflexive(__first, __last); |
1754 | __glibcxx_requires_valid_range(__result_first, __result_last); |
1755 | |
1756 | return std::__partial_sort_copy(__first, __last, |
1757 | __result_first, __result_last, |
1758 | __gnu_cxx::__ops::__iter_less_iter()); |
1759 | } |
1760 | |
1761 | /** |
1762 | * @brief Copy the smallest elements of a sequence using a predicate for |
1763 | * comparison. |
1764 | * @ingroup sorting_algorithms |
1765 | * @param __first An input iterator. |
1766 | * @param __last Another input iterator. |
1767 | * @param __result_first A random-access iterator. |
1768 | * @param __result_last Another random-access iterator. |
1769 | * @param __comp A comparison functor. |
1770 | * @return An iterator indicating the end of the resulting sequence. |
1771 | * |
1772 | * Copies and sorts the smallest N values from the range @p [__first,__last) |
1773 | * to the range beginning at @p result_first, where the number of |
1774 | * elements to be copied, @p N, is the smaller of @p (__last-__first) and |
1775 | * @p (__result_last-__result_first). |
1776 | * After the sort if @e i and @e j are iterators in the range |
1777 | * @p [__result_first,__result_first+N) such that i precedes j then |
1778 | * @p __comp(*j,*i) is false. |
1779 | * The value returned is @p __result_first+N. |
1780 | */ |
1781 | template<typename _InputIterator, typename _RandomAccessIterator, |
1782 | typename _Compare> |
1783 | inline _RandomAccessIterator |
1784 | partial_sort_copy(_InputIterator __first, _InputIterator __last, |
1785 | _RandomAccessIterator __result_first, |
1786 | _RandomAccessIterator __result_last, |
1787 | _Compare __comp) |
1788 | { |
1789 | #ifdef _GLIBCXX_CONCEPT_CHECKS |
1790 | typedef typename iterator_traits<_InputIterator>::value_type |
1791 | _InputValueType; |
1792 | typedef typename iterator_traits<_RandomAccessIterator>::value_type |
1793 | _OutputValueType; |
1794 | #endif |
1795 | |
1796 | // concept requirements |
1797 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
1798 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
1799 | _RandomAccessIterator>) |
1800 | __glibcxx_function_requires(_ConvertibleConcept<_InputValueType, |
1801 | _OutputValueType>) |
1802 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
1803 | _InputValueType, _OutputValueType>) |
1804 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
1805 | _OutputValueType, _OutputValueType>) |
1806 | __glibcxx_requires_valid_range(__first, __last); |
1807 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
1808 | __glibcxx_requires_valid_range(__result_first, __result_last); |
1809 | |
1810 | return std::__partial_sort_copy(__first, __last, |
1811 | __result_first, __result_last, |
1812 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
1813 | } |
1814 | |
1815 | /// This is a helper function for the sort routine. |
1816 | template<typename _RandomAccessIterator, typename _Compare> |
1817 | void |
1818 | __unguarded_linear_insert(_RandomAccessIterator __last, |
1819 | _Compare __comp) |
1820 | { |
1821 | typename iterator_traits<_RandomAccessIterator>::value_type |
1822 | __val = _GLIBCXX_MOVE(*__last)std::move(*__last); |
1823 | _RandomAccessIterator __next = __last; |
1824 | --__next; |
1825 | while (__comp(__val, __next)) |
1826 | { |
1827 | *__last = _GLIBCXX_MOVE(*__next)std::move(*__next); |
1828 | __last = __next; |
1829 | --__next; |
1830 | } |
1831 | *__last = _GLIBCXX_MOVE(__val)std::move(__val); |
1832 | } |
1833 | |
1834 | /// This is a helper function for the sort routine. |
1835 | template<typename _RandomAccessIterator, typename _Compare> |
1836 | void |
1837 | __insertion_sort(_RandomAccessIterator __first, |
1838 | _RandomAccessIterator __last, _Compare __comp) |
1839 | { |
1840 | if (__first == __last) return; |
1841 | |
1842 | for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) |
1843 | { |
1844 | if (__comp(__i, __first)) |
1845 | { |
1846 | typename iterator_traits<_RandomAccessIterator>::value_type |
1847 | __val = _GLIBCXX_MOVE(*__i)std::move(*__i); |
1848 | _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1)std::move_backward(__first, __i, __i + 1); |
1849 | *__first = _GLIBCXX_MOVE(__val)std::move(__val); |
1850 | } |
1851 | else |
1852 | std::__unguarded_linear_insert(__i, |
1853 | __gnu_cxx::__ops::__val_comp_iter(__comp)); |
1854 | } |
1855 | } |
1856 | |
1857 | /// This is a helper function for the sort routine. |
1858 | template<typename _RandomAccessIterator, typename _Compare> |
1859 | inline void |
1860 | __unguarded_insertion_sort(_RandomAccessIterator __first, |
1861 | _RandomAccessIterator __last, _Compare __comp) |
1862 | { |
1863 | for (_RandomAccessIterator __i = __first; __i != __last; ++__i) |
1864 | std::__unguarded_linear_insert(__i, |
1865 | __gnu_cxx::__ops::__val_comp_iter(__comp)); |
1866 | } |
1867 | |
1868 | /** |
1869 | * @doctodo |
1870 | * This controls some aspect of the sort routines. |
1871 | */ |
1872 | enum { _S_threshold = 16 }; |
1873 | |
1874 | /// This is a helper function for the sort routine. |
1875 | template<typename _RandomAccessIterator, typename _Compare> |
1876 | void |
1877 | __final_insertion_sort(_RandomAccessIterator __first, |
1878 | _RandomAccessIterator __last, _Compare __comp) |
1879 | { |
1880 | if (__last - __first > int(_S_threshold)) |
1881 | { |
1882 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); |
1883 | std::__unguarded_insertion_sort(__first + int(_S_threshold), __last, |
1884 | __comp); |
1885 | } |
1886 | else |
1887 | std::__insertion_sort(__first, __last, __comp); |
1888 | } |
1889 | |
1890 | /// This is a helper function... |
1891 | template<typename _RandomAccessIterator, typename _Compare> |
1892 | _RandomAccessIterator |
1893 | __unguarded_partition(_RandomAccessIterator __first, |
1894 | _RandomAccessIterator __last, |
1895 | _RandomAccessIterator __pivot, _Compare __comp) |
1896 | { |
1897 | while (true) |
1898 | { |
1899 | while (__comp(__first, __pivot)) |
1900 | ++__first; |
1901 | --__last; |
1902 | while (__comp(__pivot, __last)) |
1903 | --__last; |
1904 | if (!(__first < __last)) |
1905 | return __first; |
1906 | std::iter_swap(__first, __last); |
1907 | ++__first; |
1908 | } |
1909 | } |
1910 | |
1911 | /// This is a helper function... |
1912 | template<typename _RandomAccessIterator, typename _Compare> |
1913 | inline _RandomAccessIterator |
1914 | __unguarded_partition_pivot(_RandomAccessIterator __first, |
1915 | _RandomAccessIterator __last, _Compare __comp) |
1916 | { |
1917 | _RandomAccessIterator __mid = __first + (__last - __first) / 2; |
1918 | std::__move_median_to_first(__first, __first + 1, __mid, __last - 1, |
1919 | __comp); |
1920 | return std::__unguarded_partition(__first + 1, __last, __first, __comp); |
1921 | } |
1922 | |
1923 | template<typename _RandomAccessIterator, typename _Compare> |
1924 | inline void |
1925 | __partial_sort(_RandomAccessIterator __first, |
1926 | _RandomAccessIterator __middle, |
1927 | _RandomAccessIterator __last, |
1928 | _Compare __comp) |
1929 | { |
1930 | std::__heap_select(__first, __middle, __last, __comp); |
1931 | std::__sort_heap(__first, __middle, __comp); |
1932 | } |
1933 | |
1934 | /// This is a helper function for the sort routine. |
1935 | template<typename _RandomAccessIterator, typename _Size, typename _Compare> |
1936 | void |
1937 | __introsort_loop(_RandomAccessIterator __first, |
1938 | _RandomAccessIterator __last, |
1939 | _Size __depth_limit, _Compare __comp) |
1940 | { |
1941 | while (__last - __first > int(_S_threshold)) |
1942 | { |
1943 | if (__depth_limit == 0) |
1944 | { |
1945 | std::__partial_sort(__first, __last, __last, __comp); |
1946 | return; |
1947 | } |
1948 | --__depth_limit; |
1949 | _RandomAccessIterator __cut = |
1950 | std::__unguarded_partition_pivot(__first, __last, __comp); |
1951 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); |
1952 | __last = __cut; |
1953 | } |
1954 | } |
1955 | |
1956 | // sort |
1957 | |
1958 | template<typename _RandomAccessIterator, typename _Compare> |
1959 | inline void |
1960 | __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, |
1961 | _Compare __comp) |
1962 | { |
1963 | if (__first != __last) |
1964 | { |
1965 | std::__introsort_loop(__first, __last, |
1966 | std::__lg(__last - __first) * 2, |
1967 | __comp); |
1968 | std::__final_insertion_sort(__first, __last, __comp); |
1969 | } |
1970 | } |
1971 | |
1972 | template<typename _RandomAccessIterator, typename _Size, typename _Compare> |
1973 | void |
1974 | __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, |
1975 | _RandomAccessIterator __last, _Size __depth_limit, |
1976 | _Compare __comp) |
1977 | { |
1978 | while (__last - __first > 3) |
1979 | { |
1980 | if (__depth_limit == 0) |
1981 | { |
1982 | std::__heap_select(__first, __nth + 1, __last, __comp); |
1983 | // Place the nth largest element in its final position. |
1984 | std::iter_swap(__first, __nth); |
1985 | return; |
1986 | } |
1987 | --__depth_limit; |
1988 | _RandomAccessIterator __cut = |
1989 | std::__unguarded_partition_pivot(__first, __last, __comp); |
1990 | if (__cut <= __nth) |
1991 | __first = __cut; |
1992 | else |
1993 | __last = __cut; |
1994 | } |
1995 | std::__insertion_sort(__first, __last, __comp); |
1996 | } |
1997 | |
1998 | // nth_element |
1999 | |
2000 | // lower_bound moved to stl_algobase.h |
2001 | |
2002 | /** |
2003 | * @brief Finds the first position in which @p __val could be inserted |
2004 | * without changing the ordering. |
2005 | * @ingroup binary_search_algorithms |
2006 | * @param __first An iterator. |
2007 | * @param __last Another iterator. |
2008 | * @param __val The search term. |
2009 | * @param __comp A functor to use for comparisons. |
2010 | * @return An iterator pointing to the first element <em>not less |
2011 | * than</em> @p __val, or end() if every element is less |
2012 | * than @p __val. |
2013 | * @ingroup binary_search_algorithms |
2014 | * |
2015 | * The comparison function should have the same effects on ordering as |
2016 | * the function used for the initial sort. |
2017 | */ |
2018 | template<typename _ForwardIterator, typename _Tp, typename _Compare> |
2019 | inline _ForwardIterator |
2020 | lower_bound(_ForwardIterator __first, _ForwardIterator __last, |
2021 | const _Tp& __val, _Compare __comp) |
2022 | { |
2023 | // concept requirements |
2024 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
2025 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
2026 | typename iterator_traits<_ForwardIterator>::value_type, _Tp>) |
2027 | __glibcxx_requires_partitioned_lower_pred(__first, __last, |
2028 | __val, __comp); |
2029 | |
2030 | return std::__lower_bound(__first, __last, __val, |
2031 | __gnu_cxx::__ops::__iter_comp_val(__comp)); |
2032 | } |
2033 | |
2034 | template<typename _ForwardIterator, typename _Tp, typename _Compare> |
2035 | _ForwardIterator |
2036 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, |
2037 | const _Tp& __val, _Compare __comp) |
2038 | { |
2039 | typedef typename iterator_traits<_ForwardIterator>::difference_type |
2040 | _DistanceType; |
2041 | |
2042 | _DistanceType __len = std::distance(__first, __last); |
2043 | |
2044 | while (__len > 0) |
2045 | { |
2046 | _DistanceType __half = __len >> 1; |
2047 | _ForwardIterator __middle = __first; |
2048 | std::advance(__middle, __half); |
2049 | if (__comp(__val, __middle)) |
2050 | __len = __half; |
2051 | else |
2052 | { |
2053 | __first = __middle; |
2054 | ++__first; |
2055 | __len = __len - __half - 1; |
2056 | } |
2057 | } |
2058 | return __first; |
2059 | } |
2060 | |
2061 | /** |
2062 | * @brief Finds the last position in which @p __val could be inserted |
2063 | * without changing the ordering. |
2064 | * @ingroup binary_search_algorithms |
2065 | * @param __first An iterator. |
2066 | * @param __last Another iterator. |
2067 | * @param __val The search term. |
2068 | * @return An iterator pointing to the first element greater than @p __val, |
2069 | * or end() if no elements are greater than @p __val. |
2070 | * @ingroup binary_search_algorithms |
2071 | */ |
2072 | template<typename _ForwardIterator, typename _Tp> |
2073 | inline _ForwardIterator |
2074 | upper_bound(_ForwardIterator __first, _ForwardIterator __last, |
2075 | const _Tp& __val) |
2076 | { |
2077 | // concept requirements |
2078 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
2079 | __glibcxx_function_requires(_LessThanOpConcept< |
2080 | _Tp, typename iterator_traits<_ForwardIterator>::value_type>) |
2081 | __glibcxx_requires_partitioned_upper(__first, __last, __val); |
2082 | |
2083 | return std::__upper_bound(__first, __last, __val, |
2084 | __gnu_cxx::__ops::__val_less_iter()); |
2085 | } |
2086 | |
2087 | /** |
2088 | * @brief Finds the last position in which @p __val could be inserted |
2089 | * without changing the ordering. |
2090 | * @ingroup binary_search_algorithms |
2091 | * @param __first An iterator. |
2092 | * @param __last Another iterator. |
2093 | * @param __val The search term. |
2094 | * @param __comp A functor to use for comparisons. |
2095 | * @return An iterator pointing to the first element greater than @p __val, |
2096 | * or end() if no elements are greater than @p __val. |
2097 | * @ingroup binary_search_algorithms |
2098 | * |
2099 | * The comparison function should have the same effects on ordering as |
2100 | * the function used for the initial sort. |
2101 | */ |
2102 | template<typename _ForwardIterator, typename _Tp, typename _Compare> |
2103 | inline _ForwardIterator |
2104 | upper_bound(_ForwardIterator __first, _ForwardIterator __last, |
2105 | const _Tp& __val, _Compare __comp) |
2106 | { |
2107 | // concept requirements |
2108 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
2109 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
2110 | _Tp, typename iterator_traits<_ForwardIterator>::value_type>) |
2111 | __glibcxx_requires_partitioned_upper_pred(__first, __last, |
2112 | __val, __comp); |
2113 | |
2114 | return std::__upper_bound(__first, __last, __val, |
2115 | __gnu_cxx::__ops::__val_comp_iter(__comp)); |
2116 | } |
2117 | |
2118 | template<typename _ForwardIterator, typename _Tp, |
2119 | typename _CompareItTp, typename _CompareTpIt> |
2120 | pair<_ForwardIterator, _ForwardIterator> |
2121 | __equal_range(_ForwardIterator __first, _ForwardIterator __last, |
2122 | const _Tp& __val, |
2123 | _CompareItTp __comp_it_val, _CompareTpIt __comp_val_it) |
2124 | { |
2125 | typedef typename iterator_traits<_ForwardIterator>::difference_type |
2126 | _DistanceType; |
2127 | |
2128 | _DistanceType __len = std::distance(__first, __last); |
2129 | |
2130 | while (__len > 0) |
2131 | { |
2132 | _DistanceType __half = __len >> 1; |
2133 | _ForwardIterator __middle = __first; |
2134 | std::advance(__middle, __half); |
2135 | if (__comp_it_val(__middle, __val)) |
2136 | { |
2137 | __first = __middle; |
2138 | ++__first; |
2139 | __len = __len - __half - 1; |
2140 | } |
2141 | else if (__comp_val_it(__val, __middle)) |
2142 | __len = __half; |
2143 | else |
2144 | { |
2145 | _ForwardIterator __left |
2146 | = std::__lower_bound(__first, __middle, __val, __comp_it_val); |
2147 | std::advance(__first, __len); |
2148 | _ForwardIterator __right |
2149 | = std::__upper_bound(++__middle, __first, __val, __comp_val_it); |
2150 | return pair<_ForwardIterator, _ForwardIterator>(__left, __right); |
2151 | } |
2152 | } |
2153 | return pair<_ForwardIterator, _ForwardIterator>(__first, __first); |
2154 | } |
2155 | |
2156 | /** |
2157 | * @brief Finds the largest subrange in which @p __val could be inserted |
2158 | * at any place in it without changing the ordering. |
2159 | * @ingroup binary_search_algorithms |
2160 | * @param __first An iterator. |
2161 | * @param __last Another iterator. |
2162 | * @param __val The search term. |
2163 | * @return An pair of iterators defining the subrange. |
2164 | * @ingroup binary_search_algorithms |
2165 | * |
2166 | * This is equivalent to |
2167 | * @code |
2168 | * std::make_pair(lower_bound(__first, __last, __val), |
2169 | * upper_bound(__first, __last, __val)) |
2170 | * @endcode |
2171 | * but does not actually call those functions. |
2172 | */ |
2173 | template<typename _ForwardIterator, typename _Tp> |
2174 | inline pair<_ForwardIterator, _ForwardIterator> |
2175 | equal_range(_ForwardIterator __first, _ForwardIterator __last, |
2176 | const _Tp& __val) |
2177 | { |
2178 | // concept requirements |
2179 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
2180 | __glibcxx_function_requires(_LessThanOpConcept< |
2181 | typename iterator_traits<_ForwardIterator>::value_type, _Tp>) |
2182 | __glibcxx_function_requires(_LessThanOpConcept< |
2183 | _Tp, typename iterator_traits<_ForwardIterator>::value_type>) |
2184 | __glibcxx_requires_partitioned_lower(__first, __last, __val); |
2185 | __glibcxx_requires_partitioned_upper(__first, __last, __val); |
2186 | |
2187 | return std::__equal_range(__first, __last, __val, |
2188 | __gnu_cxx::__ops::__iter_less_val(), |
2189 | __gnu_cxx::__ops::__val_less_iter()); |
2190 | } |
2191 | |
2192 | /** |
2193 | * @brief Finds the largest subrange in which @p __val could be inserted |
2194 | * at any place in it without changing the ordering. |
2195 | * @param __first An iterator. |
2196 | * @param __last Another iterator. |
2197 | * @param __val The search term. |
2198 | * @param __comp A functor to use for comparisons. |
2199 | * @return An pair of iterators defining the subrange. |
2200 | * @ingroup binary_search_algorithms |
2201 | * |
2202 | * This is equivalent to |
2203 | * @code |
2204 | * std::make_pair(lower_bound(__first, __last, __val, __comp), |
2205 | * upper_bound(__first, __last, __val, __comp)) |
2206 | * @endcode |
2207 | * but does not actually call those functions. |
2208 | */ |
2209 | template<typename _ForwardIterator, typename _Tp, typename _Compare> |
2210 | inline pair<_ForwardIterator, _ForwardIterator> |
2211 | equal_range(_ForwardIterator __first, _ForwardIterator __last, |
2212 | const _Tp& __val, _Compare __comp) |
2213 | { |
2214 | // concept requirements |
2215 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
2216 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
2217 | typename iterator_traits<_ForwardIterator>::value_type, _Tp>) |
2218 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
2219 | _Tp, typename iterator_traits<_ForwardIterator>::value_type>) |
2220 | __glibcxx_requires_partitioned_lower_pred(__first, __last, |
2221 | __val, __comp); |
2222 | __glibcxx_requires_partitioned_upper_pred(__first, __last, |
2223 | __val, __comp); |
2224 | |
2225 | return std::__equal_range(__first, __last, __val, |
2226 | __gnu_cxx::__ops::__iter_comp_val(__comp), |
2227 | __gnu_cxx::__ops::__val_comp_iter(__comp)); |
2228 | } |
2229 | |
2230 | /** |
2231 | * @brief Determines whether an element exists in a range. |
2232 | * @ingroup binary_search_algorithms |
2233 | * @param __first An iterator. |
2234 | * @param __last Another iterator. |
2235 | * @param __val The search term. |
2236 | * @return True if @p __val (or its equivalent) is in [@p |
2237 | * __first,@p __last ]. |
2238 | * |
2239 | * Note that this does not actually return an iterator to @p __val. For |
2240 | * that, use std::find or a container's specialized find member functions. |
2241 | */ |
2242 | template<typename _ForwardIterator, typename _Tp> |
2243 | bool |
2244 | binary_search(_ForwardIterator __first, _ForwardIterator __last, |
2245 | const _Tp& __val) |
2246 | { |
2247 | // concept requirements |
2248 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
2249 | __glibcxx_function_requires(_LessThanOpConcept< |
2250 | _Tp, typename iterator_traits<_ForwardIterator>::value_type>) |
2251 | __glibcxx_requires_partitioned_lower(__first, __last, __val); |
2252 | __glibcxx_requires_partitioned_upper(__first, __last, __val); |
2253 | |
2254 | _ForwardIterator __i |
2255 | = std::__lower_bound(__first, __last, __val, |
2256 | __gnu_cxx::__ops::__iter_less_val()); |
2257 | return __i != __last && !(__val < *__i); |
2258 | } |
2259 | |
2260 | /** |
2261 | * @brief Determines whether an element exists in a range. |
2262 | * @ingroup binary_search_algorithms |
2263 | * @param __first An iterator. |
2264 | * @param __last Another iterator. |
2265 | * @param __val The search term. |
2266 | * @param __comp A functor to use for comparisons. |
2267 | * @return True if @p __val (or its equivalent) is in @p [__first,__last]. |
2268 | * |
2269 | * Note that this does not actually return an iterator to @p __val. For |
2270 | * that, use std::find or a container's specialized find member functions. |
2271 | * |
2272 | * The comparison function should have the same effects on ordering as |
2273 | * the function used for the initial sort. |
2274 | */ |
2275 | template<typename _ForwardIterator, typename _Tp, typename _Compare> |
2276 | bool |
2277 | binary_search(_ForwardIterator __first, _ForwardIterator __last, |
2278 | const _Tp& __val, _Compare __comp) |
2279 | { |
2280 | // concept requirements |
2281 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
2282 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
2283 | _Tp, typename iterator_traits<_ForwardIterator>::value_type>) |
2284 | __glibcxx_requires_partitioned_lower_pred(__first, __last, |
2285 | __val, __comp); |
2286 | __glibcxx_requires_partitioned_upper_pred(__first, __last, |
2287 | __val, __comp); |
2288 | |
2289 | _ForwardIterator __i |
2290 | = std::__lower_bound(__first, __last, __val, |
2291 | __gnu_cxx::__ops::__iter_comp_val(__comp)); |
2292 | return __i != __last && !bool(__comp(__val, *__i)); |
2293 | } |
2294 | |
2295 | // merge |
2296 | |
2297 | /// This is a helper function for the __merge_adaptive routines. |
2298 | template<typename _InputIterator1, typename _InputIterator2, |
2299 | typename _OutputIterator, typename _Compare> |
2300 | void |
2301 | __move_merge_adaptive(_InputIterator1 __first1, _InputIterator1 __last1, |
2302 | _InputIterator2 __first2, _InputIterator2 __last2, |
2303 | _OutputIterator __result, _Compare __comp) |
2304 | { |
2305 | while (__first1 != __last1 && __first2 != __last2) |
2306 | { |
2307 | if (__comp(__first2, __first1)) |
2308 | { |
2309 | *__result = _GLIBCXX_MOVE(*__first2)std::move(*__first2); |
2310 | ++__first2; |
2311 | } |
2312 | else |
2313 | { |
2314 | *__result = _GLIBCXX_MOVE(*__first1)std::move(*__first1); |
2315 | ++__first1; |
2316 | } |
2317 | ++__result; |
2318 | } |
2319 | if (__first1 != __last1) |
2320 | _GLIBCXX_MOVE3(__first1, __last1, __result)std::move(__first1, __last1, __result); |
2321 | } |
2322 | |
2323 | /// This is a helper function for the __merge_adaptive routines. |
2324 | template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, |
2325 | typename _BidirectionalIterator3, typename _Compare> |
2326 | void |
2327 | __move_merge_adaptive_backward(_BidirectionalIterator1 __first1, |
2328 | _BidirectionalIterator1 __last1, |
2329 | _BidirectionalIterator2 __first2, |
2330 | _BidirectionalIterator2 __last2, |
2331 | _BidirectionalIterator3 __result, |
2332 | _Compare __comp) |
2333 | { |
2334 | if (__first1 == __last1) |
2335 | { |
2336 | _GLIBCXX_MOVE_BACKWARD3(__first2, __last2, __result)std::move_backward(__first2, __last2, __result); |
2337 | return; |
2338 | } |
2339 | else if (__first2 == __last2) |
2340 | return; |
2341 | |
2342 | --__last1; |
2343 | --__last2; |
2344 | while (true) |
2345 | { |
2346 | if (__comp(__last2, __last1)) |
2347 | { |
2348 | *--__result = _GLIBCXX_MOVE(*__last1)std::move(*__last1); |
2349 | if (__first1 == __last1) |
2350 | { |
2351 | _GLIBCXX_MOVE_BACKWARD3(__first2, ++__last2, __result)std::move_backward(__first2, ++__last2, __result); |
2352 | return; |
2353 | } |
2354 | --__last1; |
2355 | } |
2356 | else |
2357 | { |
2358 | *--__result = _GLIBCXX_MOVE(*__last2)std::move(*__last2); |
2359 | if (__first2 == __last2) |
2360 | return; |
2361 | --__last2; |
2362 | } |
2363 | } |
2364 | } |
2365 | |
2366 | /// This is a helper function for the merge routines. |
2367 | template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, |
2368 | typename _Distance> |
2369 | _BidirectionalIterator1 |
2370 | __rotate_adaptive(_BidirectionalIterator1 __first, |
2371 | _BidirectionalIterator1 __middle, |
2372 | _BidirectionalIterator1 __last, |
2373 | _Distance __len1, _Distance __len2, |
2374 | _BidirectionalIterator2 __buffer, |
2375 | _Distance __buffer_size) |
2376 | { |
2377 | _BidirectionalIterator2 __buffer_end; |
2378 | if (__len1 > __len2 && __len2 <= __buffer_size) |
2379 | { |
2380 | if (__len2) |
2381 | { |
2382 | __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer)std::move(__middle, __last, __buffer); |
2383 | _GLIBCXX_MOVE_BACKWARD3(__first, __middle, __last)std::move_backward(__first, __middle, __last); |
2384 | return _GLIBCXX_MOVE3(__buffer, __buffer_end, __first)std::move(__buffer, __buffer_end, __first); |
2385 | } |
2386 | else |
2387 | return __first; |
2388 | } |
2389 | else if (__len1 <= __buffer_size) |
2390 | { |
2391 | if (__len1) |
2392 | { |
2393 | __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer)std::move(__first, __middle, __buffer); |
2394 | _GLIBCXX_MOVE3(__middle, __last, __first)std::move(__middle, __last, __first); |
2395 | return _GLIBCXX_MOVE_BACKWARD3(__buffer, __buffer_end, __last)std::move_backward(__buffer, __buffer_end, __last); |
2396 | } |
2397 | else |
2398 | return __last; |
2399 | } |
2400 | else |
2401 | { |
2402 | std::rotate(__first, __middle, __last); |
2403 | std::advance(__first, std::distance(__middle, __last)); |
2404 | return __first; |
2405 | } |
2406 | } |
2407 | |
2408 | /// This is a helper function for the merge routines. |
2409 | template<typename _BidirectionalIterator, typename _Distance, |
2410 | typename _Pointer, typename _Compare> |
2411 | void |
2412 | __merge_adaptive(_BidirectionalIterator __first, |
2413 | _BidirectionalIterator __middle, |
2414 | _BidirectionalIterator __last, |
2415 | _Distance __len1, _Distance __len2, |
2416 | _Pointer __buffer, _Distance __buffer_size, |
2417 | _Compare __comp) |
2418 | { |
2419 | if (__len1 <= __len2 && __len1 <= __buffer_size) |
2420 | { |
2421 | _Pointer __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer)std::move(__first, __middle, __buffer); |
2422 | std::__move_merge_adaptive(__buffer, __buffer_end, __middle, __last, |
2423 | __first, __comp); |
2424 | } |
2425 | else if (__len2 <= __buffer_size) |
2426 | { |
2427 | _Pointer __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer)std::move(__middle, __last, __buffer); |
2428 | std::__move_merge_adaptive_backward(__first, __middle, __buffer, |
2429 | __buffer_end, __last, __comp); |
2430 | } |
2431 | else |
2432 | { |
2433 | _BidirectionalIterator __first_cut = __first; |
2434 | _BidirectionalIterator __second_cut = __middle; |
2435 | _Distance __len11 = 0; |
2436 | _Distance __len22 = 0; |
2437 | if (__len1 > __len2) |
2438 | { |
2439 | __len11 = __len1 / 2; |
2440 | std::advance(__first_cut, __len11); |
2441 | __second_cut |
2442 | = std::__lower_bound(__middle, __last, *__first_cut, |
2443 | __gnu_cxx::__ops::__iter_comp_val(__comp)); |
2444 | __len22 = std::distance(__middle, __second_cut); |
2445 | } |
2446 | else |
2447 | { |
2448 | __len22 = __len2 / 2; |
2449 | std::advance(__second_cut, __len22); |
2450 | __first_cut |
2451 | = std::__upper_bound(__first, __middle, *__second_cut, |
2452 | __gnu_cxx::__ops::__val_comp_iter(__comp)); |
2453 | __len11 = std::distance(__first, __first_cut); |
2454 | } |
2455 | |
2456 | _BidirectionalIterator __new_middle |
2457 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, |
2458 | __len1 - __len11, __len22, __buffer, |
2459 | __buffer_size); |
2460 | std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, |
2461 | __len22, __buffer, __buffer_size, __comp); |
2462 | std::__merge_adaptive(__new_middle, __second_cut, __last, |
2463 | __len1 - __len11, |
2464 | __len2 - __len22, __buffer, |
2465 | __buffer_size, __comp); |
2466 | } |
2467 | } |
2468 | |
2469 | /// This is a helper function for the merge routines. |
2470 | template<typename _BidirectionalIterator, typename _Distance, |
2471 | typename _Compare> |
2472 | void |
2473 | __merge_without_buffer(_BidirectionalIterator __first, |
2474 | _BidirectionalIterator __middle, |
2475 | _BidirectionalIterator __last, |
2476 | _Distance __len1, _Distance __len2, |
2477 | _Compare __comp) |
2478 | { |
2479 | if (__len1 == 0 || __len2 == 0) |
2480 | return; |
2481 | |
2482 | if (__len1 + __len2 == 2) |
2483 | { |
2484 | if (__comp(__middle, __first)) |
2485 | std::iter_swap(__first, __middle); |
2486 | return; |
2487 | } |
2488 | |
2489 | _BidirectionalIterator __first_cut = __first; |
2490 | _BidirectionalIterator __second_cut = __middle; |
2491 | _Distance __len11 = 0; |
2492 | _Distance __len22 = 0; |
2493 | if (__len1 > __len2) |
2494 | { |
2495 | __len11 = __len1 / 2; |
2496 | std::advance(__first_cut, __len11); |
2497 | __second_cut |
2498 | = std::__lower_bound(__middle, __last, *__first_cut, |
2499 | __gnu_cxx::__ops::__iter_comp_val(__comp)); |
2500 | __len22 = std::distance(__middle, __second_cut); |
2501 | } |
2502 | else |
2503 | { |
2504 | __len22 = __len2 / 2; |
2505 | std::advance(__second_cut, __len22); |
2506 | __first_cut |
2507 | = std::__upper_bound(__first, __middle, *__second_cut, |
2508 | __gnu_cxx::__ops::__val_comp_iter(__comp)); |
2509 | __len11 = std::distance(__first, __first_cut); |
2510 | } |
2511 | |
2512 | std::rotate(__first_cut, __middle, __second_cut); |
2513 | _BidirectionalIterator __new_middle = __first_cut; |
2514 | std::advance(__new_middle, std::distance(__middle, __second_cut)); |
2515 | std::__merge_without_buffer(__first, __first_cut, __new_middle, |
2516 | __len11, __len22, __comp); |
2517 | std::__merge_without_buffer(__new_middle, __second_cut, __last, |
2518 | __len1 - __len11, __len2 - __len22, __comp); |
2519 | } |
2520 | |
2521 | template<typename _BidirectionalIterator, typename _Compare> |
2522 | void |
2523 | __inplace_merge(_BidirectionalIterator __first, |
2524 | _BidirectionalIterator __middle, |
2525 | _BidirectionalIterator __last, |
2526 | _Compare __comp) |
2527 | { |
2528 | typedef typename iterator_traits<_BidirectionalIterator>::value_type |
2529 | _ValueType; |
2530 | typedef typename iterator_traits<_BidirectionalIterator>::difference_type |
2531 | _DistanceType; |
2532 | |
2533 | if (__first == __middle || __middle == __last) |
2534 | return; |
2535 | |
2536 | const _DistanceType __len1 = std::distance(__first, __middle); |
2537 | const _DistanceType __len2 = std::distance(__middle, __last); |
2538 | |
2539 | typedef _Temporary_buffer<_BidirectionalIterator, _ValueType> _TmpBuf; |
2540 | _TmpBuf __buf(__first, __last); |
2541 | |
2542 | if (__buf.begin() == 0) |
2543 | std::__merge_without_buffer |
2544 | (__first, __middle, __last, __len1, __len2, __comp); |
2545 | else |
2546 | std::__merge_adaptive |
2547 | (__first, __middle, __last, __len1, __len2, __buf.begin(), |
2548 | _DistanceType(__buf.size()), __comp); |
2549 | } |
2550 | |
2551 | /** |
2552 | * @brief Merges two sorted ranges in place. |
2553 | * @ingroup sorting_algorithms |
2554 | * @param __first An iterator. |
2555 | * @param __middle Another iterator. |
2556 | * @param __last Another iterator. |
2557 | * @return Nothing. |
2558 | * |
2559 | * Merges two sorted and consecutive ranges, [__first,__middle) and |
2560 | * [__middle,__last), and puts the result in [__first,__last). The |
2561 | * output will be sorted. The sort is @e stable, that is, for |
2562 | * equivalent elements in the two ranges, elements from the first |
2563 | * range will always come before elements from the second. |
2564 | * |
2565 | * If enough additional memory is available, this takes (__last-__first)-1 |
2566 | * comparisons. Otherwise an NlogN algorithm is used, where N is |
2567 | * distance(__first,__last). |
2568 | */ |
2569 | template<typename _BidirectionalIterator> |
2570 | inline void |
2571 | inplace_merge(_BidirectionalIterator __first, |
2572 | _BidirectionalIterator __middle, |
2573 | _BidirectionalIterator __last) |
2574 | { |
2575 | // concept requirements |
2576 | __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< |
2577 | _BidirectionalIterator>) |
2578 | __glibcxx_function_requires(_LessThanComparableConcept< |
2579 | typename iterator_traits<_BidirectionalIterator>::value_type>) |
2580 | __glibcxx_requires_sorted(__first, __middle); |
2581 | __glibcxx_requires_sorted(__middle, __last); |
2582 | __glibcxx_requires_irreflexive(__first, __last); |
2583 | |
2584 | std::__inplace_merge(__first, __middle, __last, |
2585 | __gnu_cxx::__ops::__iter_less_iter()); |
2586 | } |
2587 | |
2588 | /** |
2589 | * @brief Merges two sorted ranges in place. |
2590 | * @ingroup sorting_algorithms |
2591 | * @param __first An iterator. |
2592 | * @param __middle Another iterator. |
2593 | * @param __last Another iterator. |
2594 | * @param __comp A functor to use for comparisons. |
2595 | * @return Nothing. |
2596 | * |
2597 | * Merges two sorted and consecutive ranges, [__first,__middle) and |
2598 | * [middle,last), and puts the result in [__first,__last). The output will |
2599 | * be sorted. The sort is @e stable, that is, for equivalent |
2600 | * elements in the two ranges, elements from the first range will always |
2601 | * come before elements from the second. |
2602 | * |
2603 | * If enough additional memory is available, this takes (__last-__first)-1 |
2604 | * comparisons. Otherwise an NlogN algorithm is used, where N is |
2605 | * distance(__first,__last). |
2606 | * |
2607 | * The comparison function should have the same effects on ordering as |
2608 | * the function used for the initial sort. |
2609 | */ |
2610 | template<typename _BidirectionalIterator, typename _Compare> |
2611 | inline void |
2612 | inplace_merge(_BidirectionalIterator __first, |
2613 | _BidirectionalIterator __middle, |
2614 | _BidirectionalIterator __last, |
2615 | _Compare __comp) |
2616 | { |
2617 | // concept requirements |
2618 | __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< |
2619 | _BidirectionalIterator>) |
2620 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
2621 | typename iterator_traits<_BidirectionalIterator>::value_type, |
2622 | typename iterator_traits<_BidirectionalIterator>::value_type>) |
2623 | __glibcxx_requires_sorted_pred(__first, __middle, __comp); |
2624 | __glibcxx_requires_sorted_pred(__middle, __last, __comp); |
2625 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
2626 | |
2627 | std::__inplace_merge(__first, __middle, __last, |
2628 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
2629 | } |
2630 | |
2631 | |
2632 | /// This is a helper function for the __merge_sort_loop routines. |
2633 | template<typename _InputIterator, typename _OutputIterator, |
2634 | typename _Compare> |
2635 | _OutputIterator |
2636 | __move_merge(_InputIterator __first1, _InputIterator __last1, |
2637 | _InputIterator __first2, _InputIterator __last2, |
2638 | _OutputIterator __result, _Compare __comp) |
2639 | { |
2640 | while (__first1 != __last1 && __first2 != __last2) |
2641 | { |
2642 | if (__comp(__first2, __first1)) |
2643 | { |
2644 | *__result = _GLIBCXX_MOVE(*__first2)std::move(*__first2); |
2645 | ++__first2; |
2646 | } |
2647 | else |
2648 | { |
2649 | *__result = _GLIBCXX_MOVE(*__first1)std::move(*__first1); |
2650 | ++__first1; |
2651 | } |
2652 | ++__result; |
2653 | } |
2654 | return _GLIBCXX_MOVE3(__first2, __last2,std::move(__first2, __last2, std::move(__first1, __last1, __result )) |
2655 | _GLIBCXX_MOVE3(__first1, __last1,std::move(__first2, __last2, std::move(__first1, __last1, __result )) |
2656 | __result))std::move(__first2, __last2, std::move(__first1, __last1, __result )); |
2657 | } |
2658 | |
2659 | template<typename _RandomAccessIterator1, typename _RandomAccessIterator2, |
2660 | typename _Distance, typename _Compare> |
2661 | void |
2662 | __merge_sort_loop(_RandomAccessIterator1 __first, |
2663 | _RandomAccessIterator1 __last, |
2664 | _RandomAccessIterator2 __result, _Distance __step_size, |
2665 | _Compare __comp) |
2666 | { |
2667 | const _Distance __two_step = 2 * __step_size; |
2668 | |
2669 | while (__last - __first >= __two_step) |
2670 | { |
2671 | __result = std::__move_merge(__first, __first + __step_size, |
2672 | __first + __step_size, |
2673 | __first + __two_step, |
2674 | __result, __comp); |
2675 | __first += __two_step; |
2676 | } |
2677 | __step_size = std::min(_Distance(__last - __first), __step_size); |
2678 | |
2679 | std::__move_merge(__first, __first + __step_size, |
2680 | __first + __step_size, __last, __result, __comp); |
2681 | } |
2682 | |
2683 | template<typename _RandomAccessIterator, typename _Distance, |
2684 | typename _Compare> |
2685 | void |
2686 | __chunk_insertion_sort(_RandomAccessIterator __first, |
2687 | _RandomAccessIterator __last, |
2688 | _Distance __chunk_size, _Compare __comp) |
2689 | { |
2690 | while (__last - __first >= __chunk_size) |
2691 | { |
2692 | std::__insertion_sort(__first, __first + __chunk_size, __comp); |
2693 | __first += __chunk_size; |
2694 | } |
2695 | std::__insertion_sort(__first, __last, __comp); |
2696 | } |
2697 | |
2698 | enum { _S_chunk_size = 7 }; |
2699 | |
2700 | template<typename _RandomAccessIterator, typename _Pointer, typename _Compare> |
2701 | void |
2702 | __merge_sort_with_buffer(_RandomAccessIterator __first, |
2703 | _RandomAccessIterator __last, |
2704 | _Pointer __buffer, _Compare __comp) |
2705 | { |
2706 | typedef typename iterator_traits<_RandomAccessIterator>::difference_type |
2707 | _Distance; |
2708 | |
2709 | const _Distance __len = __last - __first; |
2710 | const _Pointer __buffer_last = __buffer + __len; |
2711 | |
2712 | _Distance __step_size = _S_chunk_size; |
2713 | std::__chunk_insertion_sort(__first, __last, __step_size, __comp); |
2714 | |
2715 | while (__step_size < __len) |
2716 | { |
2717 | std::__merge_sort_loop(__first, __last, __buffer, |
2718 | __step_size, __comp); |
2719 | __step_size *= 2; |
2720 | std::__merge_sort_loop(__buffer, __buffer_last, __first, |
2721 | __step_size, __comp); |
2722 | __step_size *= 2; |
2723 | } |
2724 | } |
2725 | |
2726 | template<typename _RandomAccessIterator, typename _Pointer, |
2727 | typename _Distance, typename _Compare> |
2728 | void |
2729 | __stable_sort_adaptive(_RandomAccessIterator __first, |
2730 | _RandomAccessIterator __last, |
2731 | _Pointer __buffer, _Distance __buffer_size, |
2732 | _Compare __comp) |
2733 | { |
2734 | const _Distance __len = (__last - __first + 1) / 2; |
2735 | const _RandomAccessIterator __middle = __first + __len; |
2736 | if (__len > __buffer_size) |
2737 | { |
2738 | std::__stable_sort_adaptive(__first, __middle, __buffer, |
2739 | __buffer_size, __comp); |
2740 | std::__stable_sort_adaptive(__middle, __last, __buffer, |
2741 | __buffer_size, __comp); |
2742 | } |
2743 | else |
2744 | { |
2745 | std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp); |
2746 | std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp); |
2747 | } |
2748 | std::__merge_adaptive(__first, __middle, __last, |
2749 | _Distance(__middle - __first), |
2750 | _Distance(__last - __middle), |
2751 | __buffer, __buffer_size, |
2752 | __comp); |
2753 | } |
2754 | |
2755 | /// This is a helper function for the stable sorting routines. |
2756 | template<typename _RandomAccessIterator, typename _Compare> |
2757 | void |
2758 | __inplace_stable_sort(_RandomAccessIterator __first, |
2759 | _RandomAccessIterator __last, _Compare __comp) |
2760 | { |
2761 | if (__last - __first < 15) |
2762 | { |
2763 | std::__insertion_sort(__first, __last, __comp); |
2764 | return; |
2765 | } |
2766 | _RandomAccessIterator __middle = __first + (__last - __first) / 2; |
2767 | std::__inplace_stable_sort(__first, __middle, __comp); |
2768 | std::__inplace_stable_sort(__middle, __last, __comp); |
2769 | std::__merge_without_buffer(__first, __middle, __last, |
2770 | __middle - __first, |
2771 | __last - __middle, |
2772 | __comp); |
2773 | } |
2774 | |
2775 | // stable_sort |
2776 | |
2777 | // Set algorithms: includes, set_union, set_intersection, set_difference, |
2778 | // set_symmetric_difference. All of these algorithms have the precondition |
2779 | // that their input ranges are sorted and the postcondition that their output |
2780 | // ranges are sorted. |
2781 | |
2782 | template<typename _InputIterator1, typename _InputIterator2, |
2783 | typename _Compare> |
2784 | bool |
2785 | __includes(_InputIterator1 __first1, _InputIterator1 __last1, |
2786 | _InputIterator2 __first2, _InputIterator2 __last2, |
2787 | _Compare __comp) |
2788 | { |
2789 | while (__first1 != __last1 && __first2 != __last2) |
2790 | if (__comp(__first2, __first1)) |
2791 | return false; |
2792 | else if (__comp(__first1, __first2)) |
2793 | ++__first1; |
2794 | else |
2795 | { |
2796 | ++__first1; |
2797 | ++__first2; |
2798 | } |
2799 | |
2800 | return __first2 == __last2; |
2801 | } |
2802 | |
2803 | /** |
2804 | * @brief Determines whether all elements of a sequence exists in a range. |
2805 | * @param __first1 Start of search range. |
2806 | * @param __last1 End of search range. |
2807 | * @param __first2 Start of sequence |
2808 | * @param __last2 End of sequence. |
2809 | * @return True if each element in [__first2,__last2) is contained in order |
2810 | * within [__first1,__last1). False otherwise. |
2811 | * @ingroup set_algorithms |
2812 | * |
2813 | * This operation expects both [__first1,__last1) and |
2814 | * [__first2,__last2) to be sorted. Searches for the presence of |
2815 | * each element in [__first2,__last2) within [__first1,__last1). |
2816 | * The iterators over each range only move forward, so this is a |
2817 | * linear algorithm. If an element in [__first2,__last2) is not |
2818 | * found before the search iterator reaches @p __last2, false is |
2819 | * returned. |
2820 | */ |
2821 | template<typename _InputIterator1, typename _InputIterator2> |
2822 | inline bool |
2823 | includes(_InputIterator1 __first1, _InputIterator1 __last1, |
2824 | _InputIterator2 __first2, _InputIterator2 __last2) |
2825 | { |
2826 | // concept requirements |
2827 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
2828 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
2829 | __glibcxx_function_requires(_LessThanOpConcept< |
2830 | typename iterator_traits<_InputIterator1>::value_type, |
2831 | typename iterator_traits<_InputIterator2>::value_type>) |
2832 | __glibcxx_function_requires(_LessThanOpConcept< |
2833 | typename iterator_traits<_InputIterator2>::value_type, |
2834 | typename iterator_traits<_InputIterator1>::value_type>) |
2835 | __glibcxx_requires_sorted_set(__first1, __last1, __first2); |
2836 | __glibcxx_requires_sorted_set(__first2, __last2, __first1); |
2837 | __glibcxx_requires_irreflexive2(__first1, __last1); |
2838 | __glibcxx_requires_irreflexive2(__first2, __last2); |
2839 | |
2840 | return std::__includes(__first1, __last1, __first2, __last2, |
2841 | __gnu_cxx::__ops::__iter_less_iter()); |
2842 | } |
2843 | |
2844 | /** |
2845 | * @brief Determines whether all elements of a sequence exists in a range |
2846 | * using comparison. |
2847 | * @ingroup set_algorithms |
2848 | * @param __first1 Start of search range. |
2849 | * @param __last1 End of search range. |
2850 | * @param __first2 Start of sequence |
2851 | * @param __last2 End of sequence. |
2852 | * @param __comp Comparison function to use. |
2853 | * @return True if each element in [__first2,__last2) is contained |
2854 | * in order within [__first1,__last1) according to comp. False |
2855 | * otherwise. @ingroup set_algorithms |
2856 | * |
2857 | * This operation expects both [__first1,__last1) and |
2858 | * [__first2,__last2) to be sorted. Searches for the presence of |
2859 | * each element in [__first2,__last2) within [__first1,__last1), |
2860 | * using comp to decide. The iterators over each range only move |
2861 | * forward, so this is a linear algorithm. If an element in |
2862 | * [__first2,__last2) is not found before the search iterator |
2863 | * reaches @p __last2, false is returned. |
2864 | */ |
2865 | template<typename _InputIterator1, typename _InputIterator2, |
2866 | typename _Compare> |
2867 | inline bool |
2868 | includes(_InputIterator1 __first1, _InputIterator1 __last1, |
2869 | _InputIterator2 __first2, _InputIterator2 __last2, |
2870 | _Compare __comp) |
2871 | { |
2872 | // concept requirements |
2873 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
2874 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
2875 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
2876 | typename iterator_traits<_InputIterator1>::value_type, |
2877 | typename iterator_traits<_InputIterator2>::value_type>) |
2878 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
2879 | typename iterator_traits<_InputIterator2>::value_type, |
2880 | typename iterator_traits<_InputIterator1>::value_type>) |
2881 | __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); |
2882 | __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); |
2883 | __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp); |
2884 | __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp); |
2885 | |
2886 | return std::__includes(__first1, __last1, __first2, __last2, |
2887 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
2888 | } |
2889 | |
2890 | // nth_element |
2891 | // merge |
2892 | // set_difference |
2893 | // set_intersection |
2894 | // set_union |
2895 | // stable_sort |
2896 | // set_symmetric_difference |
2897 | // min_element |
2898 | // max_element |
2899 | |
2900 | template<typename _BidirectionalIterator, typename _Compare> |
2901 | bool |
2902 | __next_permutation(_BidirectionalIterator __first, |
2903 | _BidirectionalIterator __last, _Compare __comp) |
2904 | { |
2905 | if (__first == __last) |
2906 | return false; |
2907 | _BidirectionalIterator __i = __first; |
2908 | ++__i; |
2909 | if (__i == __last) |
2910 | return false; |
2911 | __i = __last; |
2912 | --__i; |
2913 | |
2914 | for(;;) |
2915 | { |
2916 | _BidirectionalIterator __ii = __i; |
2917 | --__i; |
2918 | if (__comp(__i, __ii)) |
2919 | { |
2920 | _BidirectionalIterator __j = __last; |
2921 | while (!__comp(__i, --__j)) |
2922 | {} |
2923 | std::iter_swap(__i, __j); |
2924 | std::__reverse(__ii, __last, |
2925 | std::__iterator_category(__first)); |
2926 | return true; |
2927 | } |
2928 | if (__i == __first) |
2929 | { |
2930 | std::__reverse(__first, __last, |
2931 | std::__iterator_category(__first)); |
2932 | return false; |
2933 | } |
2934 | } |
2935 | } |
2936 | |
2937 | /** |
2938 | * @brief Permute range into the next @e dictionary ordering. |
2939 | * @ingroup sorting_algorithms |
2940 | * @param __first Start of range. |
2941 | * @param __last End of range. |
2942 | * @return False if wrapped to first permutation, true otherwise. |
2943 | * |
2944 | * Treats all permutations of the range as a set of @e dictionary sorted |
2945 | * sequences. Permutes the current sequence into the next one of this set. |
2946 | * Returns true if there are more sequences to generate. If the sequence |
2947 | * is the largest of the set, the smallest is generated and false returned. |
2948 | */ |
2949 | template<typename _BidirectionalIterator> |
2950 | inline bool |
2951 | next_permutation(_BidirectionalIterator __first, |
2952 | _BidirectionalIterator __last) |
2953 | { |
2954 | // concept requirements |
2955 | __glibcxx_function_requires(_BidirectionalIteratorConcept< |
2956 | _BidirectionalIterator>) |
2957 | __glibcxx_function_requires(_LessThanComparableConcept< |
2958 | typename iterator_traits<_BidirectionalIterator>::value_type>) |
2959 | __glibcxx_requires_valid_range(__first, __last); |
2960 | __glibcxx_requires_irreflexive(__first, __last); |
2961 | |
2962 | return std::__next_permutation |
2963 | (__first, __last, __gnu_cxx::__ops::__iter_less_iter()); |
2964 | } |
2965 | |
2966 | /** |
2967 | * @brief Permute range into the next @e dictionary ordering using |
2968 | * comparison functor. |
2969 | * @ingroup sorting_algorithms |
2970 | * @param __first Start of range. |
2971 | * @param __last End of range. |
2972 | * @param __comp A comparison functor. |
2973 | * @return False if wrapped to first permutation, true otherwise. |
2974 | * |
2975 | * Treats all permutations of the range [__first,__last) as a set of |
2976 | * @e dictionary sorted sequences ordered by @p __comp. Permutes the current |
2977 | * sequence into the next one of this set. Returns true if there are more |
2978 | * sequences to generate. If the sequence is the largest of the set, the |
2979 | * smallest is generated and false returned. |
2980 | */ |
2981 | template<typename _BidirectionalIterator, typename _Compare> |
2982 | inline bool |
2983 | next_permutation(_BidirectionalIterator __first, |
2984 | _BidirectionalIterator __last, _Compare __comp) |
2985 | { |
2986 | // concept requirements |
2987 | __glibcxx_function_requires(_BidirectionalIteratorConcept< |
2988 | _BidirectionalIterator>) |
2989 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
2990 | typename iterator_traits<_BidirectionalIterator>::value_type, |
2991 | typename iterator_traits<_BidirectionalIterator>::value_type>) |
2992 | __glibcxx_requires_valid_range(__first, __last); |
2993 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
2994 | |
2995 | return std::__next_permutation |
2996 | (__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
2997 | } |
2998 | |
2999 | template<typename _BidirectionalIterator, typename _Compare> |
3000 | bool |
3001 | __prev_permutation(_BidirectionalIterator __first, |
3002 | _BidirectionalIterator __last, _Compare __comp) |
3003 | { |
3004 | if (__first == __last) |
3005 | return false; |
3006 | _BidirectionalIterator __i = __first; |
3007 | ++__i; |
3008 | if (__i == __last) |
3009 | return false; |
3010 | __i = __last; |
3011 | --__i; |
3012 | |
3013 | for(;;) |
3014 | { |
3015 | _BidirectionalIterator __ii = __i; |
3016 | --__i; |
3017 | if (__comp(__ii, __i)) |
3018 | { |
3019 | _BidirectionalIterator __j = __last; |
3020 | while (!__comp(--__j, __i)) |
3021 | {} |
3022 | std::iter_swap(__i, __j); |
3023 | std::__reverse(__ii, __last, |
3024 | std::__iterator_category(__first)); |
3025 | return true; |
3026 | } |
3027 | if (__i == __first) |
3028 | { |
3029 | std::__reverse(__first, __last, |
3030 | std::__iterator_category(__first)); |
3031 | return false; |
3032 | } |
3033 | } |
3034 | } |
3035 | |
3036 | /** |
3037 | * @brief Permute range into the previous @e dictionary ordering. |
3038 | * @ingroup sorting_algorithms |
3039 | * @param __first Start of range. |
3040 | * @param __last End of range. |
3041 | * @return False if wrapped to last permutation, true otherwise. |
3042 | * |
3043 | * Treats all permutations of the range as a set of @e dictionary sorted |
3044 | * sequences. Permutes the current sequence into the previous one of this |
3045 | * set. Returns true if there are more sequences to generate. If the |
3046 | * sequence is the smallest of the set, the largest is generated and false |
3047 | * returned. |
3048 | */ |
3049 | template<typename _BidirectionalIterator> |
3050 | inline bool |
3051 | prev_permutation(_BidirectionalIterator __first, |
3052 | _BidirectionalIterator __last) |
3053 | { |
3054 | // concept requirements |
3055 | __glibcxx_function_requires(_BidirectionalIteratorConcept< |
3056 | _BidirectionalIterator>) |
3057 | __glibcxx_function_requires(_LessThanComparableConcept< |
3058 | typename iterator_traits<_BidirectionalIterator>::value_type>) |
3059 | __glibcxx_requires_valid_range(__first, __last); |
3060 | __glibcxx_requires_irreflexive(__first, __last); |
3061 | |
3062 | return std::__prev_permutation(__first, __last, |
3063 | __gnu_cxx::__ops::__iter_less_iter()); |
3064 | } |
3065 | |
3066 | /** |
3067 | * @brief Permute range into the previous @e dictionary ordering using |
3068 | * comparison functor. |
3069 | * @ingroup sorting_algorithms |
3070 | * @param __first Start of range. |
3071 | * @param __last End of range. |
3072 | * @param __comp A comparison functor. |
3073 | * @return False if wrapped to last permutation, true otherwise. |
3074 | * |
3075 | * Treats all permutations of the range [__first,__last) as a set of |
3076 | * @e dictionary sorted sequences ordered by @p __comp. Permutes the current |
3077 | * sequence into the previous one of this set. Returns true if there are |
3078 | * more sequences to generate. If the sequence is the smallest of the set, |
3079 | * the largest is generated and false returned. |
3080 | */ |
3081 | template<typename _BidirectionalIterator, typename _Compare> |
3082 | inline bool |
3083 | prev_permutation(_BidirectionalIterator __first, |
3084 | _BidirectionalIterator __last, _Compare __comp) |
3085 | { |
3086 | // concept requirements |
3087 | __glibcxx_function_requires(_BidirectionalIteratorConcept< |
3088 | _BidirectionalIterator>) |
3089 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
3090 | typename iterator_traits<_BidirectionalIterator>::value_type, |
3091 | typename iterator_traits<_BidirectionalIterator>::value_type>) |
3092 | __glibcxx_requires_valid_range(__first, __last); |
3093 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
3094 | |
3095 | return std::__prev_permutation(__first, __last, |
3096 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
3097 | } |
3098 | |
3099 | // replace |
3100 | // replace_if |
3101 | |
3102 | template<typename _InputIterator, typename _OutputIterator, |
3103 | typename _Predicate, typename _Tp> |
3104 | _OutputIterator |
3105 | __replace_copy_if(_InputIterator __first, _InputIterator __last, |
3106 | _OutputIterator __result, |
3107 | _Predicate __pred, const _Tp& __new_value) |
3108 | { |
3109 | for (; __first != __last; ++__first, (void)++__result) |
3110 | if (__pred(__first)) |
3111 | *__result = __new_value; |
3112 | else |
3113 | *__result = *__first; |
3114 | return __result; |
3115 | } |
3116 | |
3117 | /** |
3118 | * @brief Copy a sequence, replacing each element of one value with another |
3119 | * value. |
3120 | * @param __first An input iterator. |
3121 | * @param __last An input iterator. |
3122 | * @param __result An output iterator. |
3123 | * @param __old_value The value to be replaced. |
3124 | * @param __new_value The replacement value. |
3125 | * @return The end of the output sequence, @p result+(last-first). |
3126 | * |
3127 | * Copies each element in the input range @p [__first,__last) to the |
3128 | * output range @p [__result,__result+(__last-__first)) replacing elements |
3129 | * equal to @p __old_value with @p __new_value. |
3130 | */ |
3131 | template<typename _InputIterator, typename _OutputIterator, typename _Tp> |
3132 | inline _OutputIterator |
3133 | replace_copy(_InputIterator __first, _InputIterator __last, |
3134 | _OutputIterator __result, |
3135 | const _Tp& __old_value, const _Tp& __new_value) |
3136 | { |
3137 | // concept requirements |
3138 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
3139 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
3140 | typename iterator_traits<_InputIterator>::value_type>) |
3141 | __glibcxx_function_requires(_EqualOpConcept< |
3142 | typename iterator_traits<_InputIterator>::value_type, _Tp>) |
3143 | __glibcxx_requires_valid_range(__first, __last); |
3144 | |
3145 | return std::__replace_copy_if(__first, __last, __result, |
3146 | __gnu_cxx::__ops::__iter_equals_val(__old_value), |
3147 | __new_value); |
3148 | } |
3149 | |
3150 | /** |
3151 | * @brief Copy a sequence, replacing each value for which a predicate |
3152 | * returns true with another value. |
3153 | * @ingroup mutating_algorithms |
3154 | * @param __first An input iterator. |
3155 | * @param __last An input iterator. |
3156 | * @param __result An output iterator. |
3157 | * @param __pred A predicate. |
3158 | * @param __new_value The replacement value. |
3159 | * @return The end of the output sequence, @p __result+(__last-__first). |
3160 | * |
3161 | * Copies each element in the range @p [__first,__last) to the range |
3162 | * @p [__result,__result+(__last-__first)) replacing elements for which |
3163 | * @p __pred returns true with @p __new_value. |
3164 | */ |
3165 | template<typename _InputIterator, typename _OutputIterator, |
3166 | typename _Predicate, typename _Tp> |
3167 | inline _OutputIterator |
3168 | replace_copy_if(_InputIterator __first, _InputIterator __last, |
3169 | _OutputIterator __result, |
3170 | _Predicate __pred, const _Tp& __new_value) |
3171 | { |
3172 | // concept requirements |
3173 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
3174 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
3175 | typename iterator_traits<_InputIterator>::value_type>) |
3176 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
3177 | typename iterator_traits<_InputIterator>::value_type>) |
3178 | __glibcxx_requires_valid_range(__first, __last); |
3179 | |
3180 | return std::__replace_copy_if(__first, __last, __result, |
3181 | __gnu_cxx::__ops::__pred_iter(__pred), |
3182 | __new_value); |
3183 | } |
3184 | |
3185 | template<typename _InputIterator, typename _Predicate> |
3186 | typename iterator_traits<_InputIterator>::difference_type |
3187 | __count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) |
3188 | { |
3189 | typename iterator_traits<_InputIterator>::difference_type __n = 0; |
3190 | for (; __first != __last; ++__first) |
3191 | if (__pred(__first)) |
3192 | ++__n; |
3193 | return __n; |
3194 | } |
3195 | |
3196 | #if __cplusplus201103L >= 201103L |
3197 | /** |
3198 | * @brief Determines whether the elements of a sequence are sorted. |
3199 | * @ingroup sorting_algorithms |
3200 | * @param __first An iterator. |
3201 | * @param __last Another iterator. |
3202 | * @return True if the elements are sorted, false otherwise. |
3203 | */ |
3204 | template<typename _ForwardIterator> |
3205 | inline bool |
3206 | is_sorted(_ForwardIterator __first, _ForwardIterator __last) |
3207 | { return std::is_sorted_until(__first, __last) == __last; } |
3208 | |
3209 | /** |
3210 | * @brief Determines whether the elements of a sequence are sorted |
3211 | * according to a comparison functor. |
3212 | * @ingroup sorting_algorithms |
3213 | * @param __first An iterator. |
3214 | * @param __last Another iterator. |
3215 | * @param __comp A comparison functor. |
3216 | * @return True if the elements are sorted, false otherwise. |
3217 | */ |
3218 | template<typename _ForwardIterator, typename _Compare> |
3219 | inline bool |
3220 | is_sorted(_ForwardIterator __first, _ForwardIterator __last, |
3221 | _Compare __comp) |
3222 | { return std::is_sorted_until(__first, __last, __comp) == __last; } |
3223 | |
3224 | template<typename _ForwardIterator, typename _Compare> |
3225 | _ForwardIterator |
3226 | __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, |
3227 | _Compare __comp) |
3228 | { |
3229 | if (__first == __last) |
3230 | return __last; |
3231 | |
3232 | _ForwardIterator __next = __first; |
3233 | for (++__next; __next != __last; __first = __next, (void)++__next) |
3234 | if (__comp(__next, __first)) |
3235 | return __next; |
3236 | return __next; |
3237 | } |
3238 | |
3239 | /** |
3240 | * @brief Determines the end of a sorted sequence. |
3241 | * @ingroup sorting_algorithms |
3242 | * @param __first An iterator. |
3243 | * @param __last Another iterator. |
3244 | * @return An iterator pointing to the last iterator i in [__first, __last) |
3245 | * for which the range [__first, i) is sorted. |
3246 | */ |
3247 | template<typename _ForwardIterator> |
3248 | inline _ForwardIterator |
3249 | is_sorted_until(_ForwardIterator __first, _ForwardIterator __last) |
3250 | { |
3251 | // concept requirements |
3252 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
3253 | __glibcxx_function_requires(_LessThanComparableConcept< |
3254 | typename iterator_traits<_ForwardIterator>::value_type>) |
3255 | __glibcxx_requires_valid_range(__first, __last); |
3256 | __glibcxx_requires_irreflexive(__first, __last); |
3257 | |
3258 | return std::__is_sorted_until(__first, __last, |
3259 | __gnu_cxx::__ops::__iter_less_iter()); |
3260 | } |
3261 | |
3262 | /** |
3263 | * @brief Determines the end of a sorted sequence using comparison functor. |
3264 | * @ingroup sorting_algorithms |
3265 | * @param __first An iterator. |
3266 | * @param __last Another iterator. |
3267 | * @param __comp A comparison functor. |
3268 | * @return An iterator pointing to the last iterator i in [__first, __last) |
3269 | * for which the range [__first, i) is sorted. |
3270 | */ |
3271 | template<typename _ForwardIterator, typename _Compare> |
3272 | inline _ForwardIterator |
3273 | is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, |
3274 | _Compare __comp) |
3275 | { |
3276 | // concept requirements |
3277 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
3278 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
3279 | typename iterator_traits<_ForwardIterator>::value_type, |
3280 | typename iterator_traits<_ForwardIterator>::value_type>) |
3281 | __glibcxx_requires_valid_range(__first, __last); |
3282 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
3283 | |
3284 | return std::__is_sorted_until(__first, __last, |
3285 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
3286 | } |
3287 | |
3288 | /** |
3289 | * @brief Determines min and max at once as an ordered pair. |
3290 | * @ingroup sorting_algorithms |
3291 | * @param __a A thing of arbitrary type. |
3292 | * @param __b Another thing of arbitrary type. |
3293 | * @return A pair(__b, __a) if __b is smaller than __a, pair(__a, |
3294 | * __b) otherwise. |
3295 | */ |
3296 | template<typename _Tp> |
3297 | _GLIBCXX14_CONSTEXPR |
3298 | inline pair<const _Tp&, const _Tp&> |
3299 | minmax(const _Tp& __a, const _Tp& __b) |
3300 | { |
3301 | // concept requirements |
3302 | __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) |
3303 | |
3304 | return __b < __a ? pair<const _Tp&, const _Tp&>(__b, __a) |
3305 | : pair<const _Tp&, const _Tp&>(__a, __b); |
3306 | } |
3307 | |
3308 | /** |
3309 | * @brief Determines min and max at once as an ordered pair. |
3310 | * @ingroup sorting_algorithms |
3311 | * @param __a A thing of arbitrary type. |
3312 | * @param __b Another thing of arbitrary type. |
3313 | * @param __comp A @link comparison_functors comparison functor @endlink. |
3314 | * @return A pair(__b, __a) if __b is smaller than __a, pair(__a, |
3315 | * __b) otherwise. |
3316 | */ |
3317 | template<typename _Tp, typename _Compare> |
3318 | _GLIBCXX14_CONSTEXPR |
3319 | inline pair<const _Tp&, const _Tp&> |
3320 | minmax(const _Tp& __a, const _Tp& __b, _Compare __comp) |
3321 | { |
3322 | return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) |
3323 | : pair<const _Tp&, const _Tp&>(__a, __b); |
3324 | } |
3325 | |
3326 | template<typename _ForwardIterator, typename _Compare> |
3327 | _GLIBCXX14_CONSTEXPR |
3328 | pair<_ForwardIterator, _ForwardIterator> |
3329 | __minmax_element(_ForwardIterator __first, _ForwardIterator __last, |
3330 | _Compare __comp) |
3331 | { |
3332 | _ForwardIterator __next = __first; |
3333 | if (__first == __last |
3334 | || ++__next == __last) |
3335 | return std::make_pair(__first, __first); |
3336 | |
3337 | _ForwardIterator __min{}, __max{}; |
3338 | if (__comp(__next, __first)) |
3339 | { |
3340 | __min = __next; |
3341 | __max = __first; |
3342 | } |
3343 | else |
3344 | { |
3345 | __min = __first; |
3346 | __max = __next; |
3347 | } |
3348 | |
3349 | __first = __next; |
3350 | ++__first; |
3351 | |
3352 | while (__first != __last) |
3353 | { |
3354 | __next = __first; |
3355 | if (++__next == __last) |
3356 | { |
3357 | if (__comp(__first, __min)) |
3358 | __min = __first; |
3359 | else if (!__comp(__first, __max)) |
3360 | __max = __first; |
3361 | break; |
3362 | } |
3363 | |
3364 | if (__comp(__next, __first)) |
3365 | { |
3366 | if (__comp(__next, __min)) |
3367 | __min = __next; |
3368 | if (!__comp(__first, __max)) |
3369 | __max = __first; |
3370 | } |
3371 | else |
3372 | { |
3373 | if (__comp(__first, __min)) |
3374 | __min = __first; |
3375 | if (!__comp(__next, __max)) |
3376 | __max = __next; |
3377 | } |
3378 | |
3379 | __first = __next; |
3380 | ++__first; |
3381 | } |
3382 | |
3383 | return std::make_pair(__min, __max); |
3384 | } |
3385 | |
3386 | /** |
3387 | * @brief Return a pair of iterators pointing to the minimum and maximum |
3388 | * elements in a range. |
3389 | * @ingroup sorting_algorithms |
3390 | * @param __first Start of range. |
3391 | * @param __last End of range. |
3392 | * @return make_pair(m, M), where m is the first iterator i in |
3393 | * [__first, __last) such that no other element in the range is |
3394 | * smaller, and where M is the last iterator i in [__first, __last) |
3395 | * such that no other element in the range is larger. |
3396 | */ |
3397 | template<typename _ForwardIterator> |
3398 | _GLIBCXX14_CONSTEXPR |
3399 | inline pair<_ForwardIterator, _ForwardIterator> |
3400 | minmax_element(_ForwardIterator __first, _ForwardIterator __last) |
3401 | { |
3402 | // concept requirements |
3403 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
3404 | __glibcxx_function_requires(_LessThanComparableConcept< |
3405 | typename iterator_traits<_ForwardIterator>::value_type>) |
3406 | __glibcxx_requires_valid_range(__first, __last); |
3407 | __glibcxx_requires_irreflexive(__first, __last); |
3408 | |
3409 | return std::__minmax_element(__first, __last, |
3410 | __gnu_cxx::__ops::__iter_less_iter()); |
3411 | } |
3412 | |
3413 | /** |
3414 | * @brief Return a pair of iterators pointing to the minimum and maximum |
3415 | * elements in a range. |
3416 | * @ingroup sorting_algorithms |
3417 | * @param __first Start of range. |
3418 | * @param __last End of range. |
3419 | * @param __comp Comparison functor. |
3420 | * @return make_pair(m, M), where m is the first iterator i in |
3421 | * [__first, __last) such that no other element in the range is |
3422 | * smaller, and where M is the last iterator i in [__first, __last) |
3423 | * such that no other element in the range is larger. |
3424 | */ |
3425 | template<typename _ForwardIterator, typename _Compare> |
3426 | _GLIBCXX14_CONSTEXPR |
3427 | inline pair<_ForwardIterator, _ForwardIterator> |
3428 | minmax_element(_ForwardIterator __first, _ForwardIterator __last, |
3429 | _Compare __comp) |
3430 | { |
3431 | // concept requirements |
3432 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
3433 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
3434 | typename iterator_traits<_ForwardIterator>::value_type, |
3435 | typename iterator_traits<_ForwardIterator>::value_type>) |
3436 | __glibcxx_requires_valid_range(__first, __last); |
3437 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
3438 | |
3439 | return std::__minmax_element(__first, __last, |
3440 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
3441 | } |
3442 | |
3443 | // N2722 + DR 915. |
3444 | template<typename _Tp> |
3445 | _GLIBCXX14_CONSTEXPR |
3446 | inline _Tp |
3447 | min(initializer_list<_Tp> __l) |
3448 | { return *std::min_element(__l.begin(), __l.end()); } |
3449 | |
3450 | template<typename _Tp, typename _Compare> |
3451 | _GLIBCXX14_CONSTEXPR |
3452 | inline _Tp |
3453 | min(initializer_list<_Tp> __l, _Compare __comp) |
3454 | { return *std::min_element(__l.begin(), __l.end(), __comp); } |
3455 | |
3456 | template<typename _Tp> |
3457 | _GLIBCXX14_CONSTEXPR |
3458 | inline _Tp |
3459 | max(initializer_list<_Tp> __l) |
3460 | { return *std::max_element(__l.begin(), __l.end()); } |
3461 | |
3462 | template<typename _Tp, typename _Compare> |
3463 | _GLIBCXX14_CONSTEXPR |
3464 | inline _Tp |
3465 | max(initializer_list<_Tp> __l, _Compare __comp) |
3466 | { return *std::max_element(__l.begin(), __l.end(), __comp); } |
3467 | |
3468 | template<typename _Tp> |
3469 | _GLIBCXX14_CONSTEXPR |
3470 | inline pair<_Tp, _Tp> |
3471 | minmax(initializer_list<_Tp> __l) |
3472 | { |
3473 | pair<const _Tp*, const _Tp*> __p = |
3474 | std::minmax_element(__l.begin(), __l.end()); |
3475 | return std::make_pair(*__p.first, *__p.second); |
3476 | } |
3477 | |
3478 | template<typename _Tp, typename _Compare> |
3479 | _GLIBCXX14_CONSTEXPR |
3480 | inline pair<_Tp, _Tp> |
3481 | minmax(initializer_list<_Tp> __l, _Compare __comp) |
3482 | { |
3483 | pair<const _Tp*, const _Tp*> __p = |
3484 | std::minmax_element(__l.begin(), __l.end(), __comp); |
3485 | return std::make_pair(*__p.first, *__p.second); |
3486 | } |
3487 | |
3488 | template<typename _ForwardIterator1, typename _ForwardIterator2, |
3489 | typename _BinaryPredicate> |
3490 | bool |
3491 | __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
3492 | _ForwardIterator2 __first2, _BinaryPredicate __pred) |
3493 | { |
3494 | // Efficiently compare identical prefixes: O(N) if sequences |
3495 | // have the same elements in the same order. |
3496 | for (; __first1 != __last1; ++__first1, (void)++__first2) |
3497 | if (!__pred(__first1, __first2)) |
3498 | break; |
3499 | |
3500 | if (__first1 == __last1) |
3501 | return true; |
3502 | |
3503 | // Establish __last2 assuming equal ranges by iterating over the |
3504 | // rest of the list. |
3505 | _ForwardIterator2 __last2 = __first2; |
3506 | std::advance(__last2, std::distance(__first1, __last1)); |
3507 | for (_ForwardIterator1 __scan = __first1; __scan != __last1; ++__scan) |
3508 | { |
3509 | if (__scan != std::__find_if(__first1, __scan, |
3510 | __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan))) |
3511 | continue; // We've seen this one before. |
3512 | |
3513 | auto __matches |
3514 | = std::__count_if(__first2, __last2, |
3515 | __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)); |
3516 | if (0 == __matches || |
3517 | std::__count_if(__scan, __last1, |
3518 | __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)) |
3519 | != __matches) |
3520 | return false; |
3521 | } |
3522 | return true; |
3523 | } |
3524 | |
3525 | /** |
3526 | * @brief Checks whether a permutation of the second sequence is equal |
3527 | * to the first sequence. |
3528 | * @ingroup non_mutating_algorithms |
3529 | * @param __first1 Start of first range. |
3530 | * @param __last1 End of first range. |
3531 | * @param __first2 Start of second range. |
3532 | * @return true if there exists a permutation of the elements in the range |
3533 | * [__first2, __first2 + (__last1 - __first1)), beginning with |
3534 | * ForwardIterator2 begin, such that equal(__first1, __last1, begin) |
3535 | * returns true; otherwise, returns false. |
3536 | */ |
3537 | template<typename _ForwardIterator1, typename _ForwardIterator2> |
3538 | inline bool |
3539 | is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
3540 | _ForwardIterator2 __first2) |
3541 | { |
3542 | // concept requirements |
3543 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) |
3544 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) |
3545 | __glibcxx_function_requires(_EqualOpConcept< |
3546 | typename iterator_traits<_ForwardIterator1>::value_type, |
3547 | typename iterator_traits<_ForwardIterator2>::value_type>) |
3548 | __glibcxx_requires_valid_range(__first1, __last1); |
3549 | |
3550 | return std::__is_permutation(__first1, __last1, __first2, |
3551 | __gnu_cxx::__ops::__iter_equal_to_iter()); |
3552 | } |
3553 | |
3554 | /** |
3555 | * @brief Checks whether a permutation of the second sequence is equal |
3556 | * to the first sequence. |
3557 | * @ingroup non_mutating_algorithms |
3558 | * @param __first1 Start of first range. |
3559 | * @param __last1 End of first range. |
3560 | * @param __first2 Start of second range. |
3561 | * @param __pred A binary predicate. |
3562 | * @return true if there exists a permutation of the elements in |
3563 | * the range [__first2, __first2 + (__last1 - __first1)), |
3564 | * beginning with ForwardIterator2 begin, such that |
3565 | * equal(__first1, __last1, __begin, __pred) returns true; |
3566 | * otherwise, returns false. |
3567 | */ |
3568 | template<typename _ForwardIterator1, typename _ForwardIterator2, |
3569 | typename _BinaryPredicate> |
3570 | inline bool |
3571 | is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
3572 | _ForwardIterator2 __first2, _BinaryPredicate __pred) |
3573 | { |
3574 | // concept requirements |
3575 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) |
3576 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) |
3577 | __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, |
3578 | typename iterator_traits<_ForwardIterator1>::value_type, |
3579 | typename iterator_traits<_ForwardIterator2>::value_type>) |
3580 | __glibcxx_requires_valid_range(__first1, __last1); |
3581 | |
3582 | return std::__is_permutation(__first1, __last1, __first2, |
3583 | __gnu_cxx::__ops::__iter_comp_iter(__pred)); |
3584 | } |
3585 | |
3586 | #if __cplusplus201103L > 201103L |
3587 | template<typename _ForwardIterator1, typename _ForwardIterator2, |
3588 | typename _BinaryPredicate> |
3589 | bool |
3590 | __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
3591 | _ForwardIterator2 __first2, _ForwardIterator2 __last2, |
3592 | _BinaryPredicate __pred) |
3593 | { |
3594 | using _Cat1 |
3595 | = typename iterator_traits<_ForwardIterator1>::iterator_category; |
3596 | using _Cat2 |
3597 | = typename iterator_traits<_ForwardIterator2>::iterator_category; |
3598 | using _It1_is_RA = is_same<_Cat1, random_access_iterator_tag>; |
3599 | using _It2_is_RA = is_same<_Cat2, random_access_iterator_tag>; |
3600 | constexpr bool __ra_iters = _It1_is_RA() && _It2_is_RA(); |
3601 | if (__ra_iters) |
3602 | { |
3603 | auto __d1 = std::distance(__first1, __last1); |
3604 | auto __d2 = std::distance(__first2, __last2); |
3605 | if (__d1 != __d2) |
3606 | return false; |
3607 | } |
3608 | |
3609 | // Efficiently compare identical prefixes: O(N) if sequences |
3610 | // have the same elements in the same order. |
3611 | for (; __first1 != __last1 && __first2 != __last2; |
3612 | ++__first1, (void)++__first2) |
3613 | if (!__pred(__first1, __first2)) |
3614 | break; |
3615 | |
3616 | if (__ra_iters) |
3617 | { |
3618 | if (__first1 == __last1) |
3619 | return true; |
3620 | } |
3621 | else |
3622 | { |
3623 | auto __d1 = std::distance(__first1, __last1); |
3624 | auto __d2 = std::distance(__first2, __last2); |
3625 | if (__d1 == 0 && __d2 == 0) |
3626 | return true; |
3627 | if (__d1 != __d2) |
3628 | return false; |
3629 | } |
3630 | |
3631 | for (_ForwardIterator1 __scan = __first1; __scan != __last1; ++__scan) |
3632 | { |
3633 | if (__scan != std::__find_if(__first1, __scan, |
3634 | __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan))) |
3635 | continue; // We've seen this one before. |
3636 | |
3637 | auto __matches = std::__count_if(__first2, __last2, |
3638 | __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)); |
3639 | if (0 == __matches |
3640 | || std::__count_if(__scan, __last1, |
3641 | __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)) |
3642 | != __matches) |
3643 | return false; |
3644 | } |
3645 | return true; |
3646 | } |
3647 | |
3648 | /** |
3649 | * @brief Checks whether a permutaion of the second sequence is equal |
3650 | * to the first sequence. |
3651 | * @ingroup non_mutating_algorithms |
3652 | * @param __first1 Start of first range. |
3653 | * @param __last1 End of first range. |
3654 | * @param __first2 Start of second range. |
3655 | * @param __last2 End of first range. |
3656 | * @return true if there exists a permutation of the elements in the range |
3657 | * [__first2, __last2), beginning with ForwardIterator2 begin, |
3658 | * such that equal(__first1, __last1, begin) returns true; |
3659 | * otherwise, returns false. |
3660 | */ |
3661 | template<typename _ForwardIterator1, typename _ForwardIterator2> |
3662 | inline bool |
3663 | is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
3664 | _ForwardIterator2 __first2, _ForwardIterator2 __last2) |
3665 | { |
3666 | __glibcxx_requires_valid_range(__first1, __last1); |
3667 | __glibcxx_requires_valid_range(__first2, __last2); |
3668 | |
3669 | return |
3670 | std::__is_permutation(__first1, __last1, __first2, __last2, |
3671 | __gnu_cxx::__ops::__iter_equal_to_iter()); |
3672 | } |
3673 | |
3674 | /** |
3675 | * @brief Checks whether a permutation of the second sequence is equal |
3676 | * to the first sequence. |
3677 | * @ingroup non_mutating_algorithms |
3678 | * @param __first1 Start of first range. |
3679 | * @param __last1 End of first range. |
3680 | * @param __first2 Start of second range. |
3681 | * @param __last2 End of first range. |
3682 | * @param __pred A binary predicate. |
3683 | * @return true if there exists a permutation of the elements in the range |
3684 | * [__first2, __last2), beginning with ForwardIterator2 begin, |
3685 | * such that equal(__first1, __last1, __begin, __pred) returns true; |
3686 | * otherwise, returns false. |
3687 | */ |
3688 | template<typename _ForwardIterator1, typename _ForwardIterator2, |
3689 | typename _BinaryPredicate> |
3690 | inline bool |
3691 | is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
3692 | _ForwardIterator2 __first2, _ForwardIterator2 __last2, |
3693 | _BinaryPredicate __pred) |
3694 | { |
3695 | __glibcxx_requires_valid_range(__first1, __last1); |
3696 | __glibcxx_requires_valid_range(__first2, __last2); |
3697 | |
3698 | return std::__is_permutation(__first1, __last1, __first2, __last2, |
3699 | __gnu_cxx::__ops::__iter_comp_iter(__pred)); |
3700 | } |
3701 | #endif |
3702 | |
3703 | #ifdef _GLIBCXX_USE_C99_STDINT_TR11 |
3704 | /** |
3705 | * @brief Shuffle the elements of a sequence using a uniform random |
3706 | * number generator. |
3707 | * @ingroup mutating_algorithms |
3708 | * @param __first A forward iterator. |
3709 | * @param __last A forward iterator. |
3710 | * @param __g A UniformRandomNumberGenerator (26.5.1.3). |
3711 | * @return Nothing. |
3712 | * |
3713 | * Reorders the elements in the range @p [__first,__last) using @p __g to |
3714 | * provide random numbers. |
3715 | */ |
3716 | template<typename _RandomAccessIterator, |
3717 | typename _UniformRandomNumberGenerator> |
3718 | void |
3719 | shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, |
3720 | _UniformRandomNumberGenerator&& __g) |
3721 | { |
3722 | // concept requirements |
3723 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
3724 | _RandomAccessIterator>) |
3725 | __glibcxx_requires_valid_range(__first, __last); |
3726 | |
3727 | if (__first == __last) |
3728 | return; |
3729 | |
3730 | typedef typename iterator_traits<_RandomAccessIterator>::difference_type |
3731 | _DistanceType; |
3732 | |
3733 | typedef typename std::make_unsigned<_DistanceType>::type __ud_type; |
3734 | typedef typename std::uniform_int_distribution<__ud_type> __distr_type; |
3735 | typedef typename __distr_type::param_type __p_type; |
3736 | __distr_type __d; |
3737 | |
3738 | for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) |
3739 | std::iter_swap(__i, __first + __d(__g, __p_type(0, __i - __first))); |
3740 | } |
3741 | #endif |
3742 | |
3743 | #endif // C++11 |
3744 | |
3745 | _GLIBCXX_END_NAMESPACE_VERSION |
3746 | |
3747 | _GLIBCXX_BEGIN_NAMESPACE_ALGO |
3748 | |
3749 | /** |
3750 | * @brief Apply a function to every element of a sequence. |
3751 | * @ingroup non_mutating_algorithms |
3752 | * @param __first An input iterator. |
3753 | * @param __last An input iterator. |
3754 | * @param __f A unary function object. |
3755 | * @return @p __f (std::move(@p __f) in C++0x). |
3756 | * |
3757 | * Applies the function object @p __f to each element in the range |
3758 | * @p [first,last). @p __f must not modify the order of the sequence. |
3759 | * If @p __f has a return value it is ignored. |
3760 | */ |
3761 | template<typename _InputIterator, typename _Function> |
3762 | _Function |
3763 | for_each(_InputIterator __first, _InputIterator __last, _Function __f) |
3764 | { |
3765 | // concept requirements |
3766 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
3767 | __glibcxx_requires_valid_range(__first, __last); |
3768 | for (; __first != __last; ++__first) |
3769 | __f(*__first); |
3770 | return _GLIBCXX_MOVE(__f)std::move(__f); |
3771 | } |
3772 | |
3773 | /** |
3774 | * @brief Find the first occurrence of a value in a sequence. |
3775 | * @ingroup non_mutating_algorithms |
3776 | * @param __first An input iterator. |
3777 | * @param __last An input iterator. |
3778 | * @param __val The value to find. |
3779 | * @return The first iterator @c i in the range @p [__first,__last) |
3780 | * such that @c *i == @p __val, or @p __last if no such iterator exists. |
3781 | */ |
3782 | template<typename _InputIterator, typename _Tp> |
3783 | inline _InputIterator |
3784 | find(_InputIterator __first, _InputIterator __last, |
3785 | const _Tp& __val) |
3786 | { |
3787 | // concept requirements |
3788 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
3789 | __glibcxx_function_requires(_EqualOpConcept< |
3790 | typename iterator_traits<_InputIterator>::value_type, _Tp>) |
3791 | __glibcxx_requires_valid_range(__first, __last); |
3792 | return std::__find_if(__first, __last, |
3793 | __gnu_cxx::__ops::__iter_equals_val(__val)); |
3794 | } |
3795 | |
3796 | /** |
3797 | * @brief Find the first element in a sequence for which a |
3798 | * predicate is true. |
3799 | * @ingroup non_mutating_algorithms |
3800 | * @param __first An input iterator. |
3801 | * @param __last An input iterator. |
3802 | * @param __pred A predicate. |
3803 | * @return The first iterator @c i in the range @p [__first,__last) |
3804 | * such that @p __pred(*i) is true, or @p __last if no such iterator exists. |
3805 | */ |
3806 | template<typename _InputIterator, typename _Predicate> |
3807 | inline _InputIterator |
3808 | find_if(_InputIterator __first, _InputIterator __last, |
3809 | _Predicate __pred) |
3810 | { |
3811 | // concept requirements |
3812 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
3813 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
3814 | typename iterator_traits<_InputIterator>::value_type>) |
3815 | __glibcxx_requires_valid_range(__first, __last); |
3816 | |
3817 | return std::__find_if(__first, __last, |
3818 | __gnu_cxx::__ops::__pred_iter(__pred)); |
3819 | } |
3820 | |
3821 | /** |
3822 | * @brief Find element from a set in a sequence. |
3823 | * @ingroup non_mutating_algorithms |
3824 | * @param __first1 Start of range to search. |
3825 | * @param __last1 End of range to search. |
3826 | * @param __first2 Start of match candidates. |
3827 | * @param __last2 End of match candidates. |
3828 | * @return The first iterator @c i in the range |
3829 | * @p [__first1,__last1) such that @c *i == @p *(i2) such that i2 is an |
3830 | * iterator in [__first2,__last2), or @p __last1 if no such iterator exists. |
3831 | * |
3832 | * Searches the range @p [__first1,__last1) for an element that is |
3833 | * equal to some element in the range [__first2,__last2). If |
3834 | * found, returns an iterator in the range [__first1,__last1), |
3835 | * otherwise returns @p __last1. |
3836 | */ |
3837 | template<typename _InputIterator, typename _ForwardIterator> |
3838 | _InputIterator |
3839 | find_first_of(_InputIterator __first1, _InputIterator __last1, |
3840 | _ForwardIterator __first2, _ForwardIterator __last2) |
3841 | { |
3842 | // concept requirements |
3843 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
3844 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
3845 | __glibcxx_function_requires(_EqualOpConcept< |
3846 | typename iterator_traits<_InputIterator>::value_type, |
3847 | typename iterator_traits<_ForwardIterator>::value_type>) |
3848 | __glibcxx_requires_valid_range(__first1, __last1); |
3849 | __glibcxx_requires_valid_range(__first2, __last2); |
3850 | |
3851 | for (; __first1 != __last1; ++__first1) |
3852 | for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) |
3853 | if (*__first1 == *__iter) |
3854 | return __first1; |
3855 | return __last1; |
3856 | } |
3857 | |
3858 | /** |
3859 | * @brief Find element from a set in a sequence using a predicate. |
3860 | * @ingroup non_mutating_algorithms |
3861 | * @param __first1 Start of range to search. |
3862 | * @param __last1 End of range to search. |
3863 | * @param __first2 Start of match candidates. |
3864 | * @param __last2 End of match candidates. |
3865 | * @param __comp Predicate to use. |
3866 | * @return The first iterator @c i in the range |
3867 | * @p [__first1,__last1) such that @c comp(*i, @p *(i2)) is true |
3868 | * and i2 is an iterator in [__first2,__last2), or @p __last1 if no |
3869 | * such iterator exists. |
3870 | * |
3871 | |
3872 | * Searches the range @p [__first1,__last1) for an element that is |
3873 | * equal to some element in the range [__first2,__last2). If |
3874 | * found, returns an iterator in the range [__first1,__last1), |
3875 | * otherwise returns @p __last1. |
3876 | */ |
3877 | template<typename _InputIterator, typename _ForwardIterator, |
3878 | typename _BinaryPredicate> |
3879 | _InputIterator |
3880 | find_first_of(_InputIterator __first1, _InputIterator __last1, |
3881 | _ForwardIterator __first2, _ForwardIterator __last2, |
3882 | _BinaryPredicate __comp) |
3883 | { |
3884 | // concept requirements |
3885 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
3886 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
3887 | __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, |
3888 | typename iterator_traits<_InputIterator>::value_type, |
3889 | typename iterator_traits<_ForwardIterator>::value_type>) |
3890 | __glibcxx_requires_valid_range(__first1, __last1); |
3891 | __glibcxx_requires_valid_range(__first2, __last2); |
3892 | |
3893 | for (; __first1 != __last1; ++__first1) |
3894 | for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) |
3895 | if (__comp(*__first1, *__iter)) |
3896 | return __first1; |
3897 | return __last1; |
3898 | } |
3899 | |
3900 | /** |
3901 | * @brief Find two adjacent values in a sequence that are equal. |
3902 | * @ingroup non_mutating_algorithms |
3903 | * @param __first A forward iterator. |
3904 | * @param __last A forward iterator. |
3905 | * @return The first iterator @c i such that @c i and @c i+1 are both |
3906 | * valid iterators in @p [__first,__last) and such that @c *i == @c *(i+1), |
3907 | * or @p __last if no such iterator exists. |
3908 | */ |
3909 | template<typename _ForwardIterator> |
3910 | inline _ForwardIterator |
3911 | adjacent_find(_ForwardIterator __first, _ForwardIterator __last) |
3912 | { |
3913 | // concept requirements |
3914 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
3915 | __glibcxx_function_requires(_EqualityComparableConcept< |
3916 | typename iterator_traits<_ForwardIterator>::value_type>) |
3917 | __glibcxx_requires_valid_range(__first, __last); |
3918 | |
3919 | return std::__adjacent_find(__first, __last, |
3920 | __gnu_cxx::__ops::__iter_equal_to_iter()); |
3921 | } |
3922 | |
3923 | /** |
3924 | * @brief Find two adjacent values in a sequence using a predicate. |
3925 | * @ingroup non_mutating_algorithms |
3926 | * @param __first A forward iterator. |
3927 | * @param __last A forward iterator. |
3928 | * @param __binary_pred A binary predicate. |
3929 | * @return The first iterator @c i such that @c i and @c i+1 are both |
3930 | * valid iterators in @p [__first,__last) and such that |
3931 | * @p __binary_pred(*i,*(i+1)) is true, or @p __last if no such iterator |
3932 | * exists. |
3933 | */ |
3934 | template<typename _ForwardIterator, typename _BinaryPredicate> |
3935 | inline _ForwardIterator |
3936 | adjacent_find(_ForwardIterator __first, _ForwardIterator __last, |
3937 | _BinaryPredicate __binary_pred) |
3938 | { |
3939 | // concept requirements |
3940 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
3941 | __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, |
3942 | typename iterator_traits<_ForwardIterator>::value_type, |
3943 | typename iterator_traits<_ForwardIterator>::value_type>) |
3944 | __glibcxx_requires_valid_range(__first, __last); |
3945 | |
3946 | return std::__adjacent_find(__first, __last, |
3947 | __gnu_cxx::__ops::__iter_comp_iter(__binary_pred)); |
3948 | } |
3949 | |
3950 | /** |
3951 | * @brief Count the number of copies of a value in a sequence. |
3952 | * @ingroup non_mutating_algorithms |
3953 | * @param __first An input iterator. |
3954 | * @param __last An input iterator. |
3955 | * @param __value The value to be counted. |
3956 | * @return The number of iterators @c i in the range @p [__first,__last) |
3957 | * for which @c *i == @p __value |
3958 | */ |
3959 | template<typename _InputIterator, typename _Tp> |
3960 | inline typename iterator_traits<_InputIterator>::difference_type |
3961 | count(_InputIterator __first, _InputIterator __last, const _Tp& __value) |
3962 | { |
3963 | // concept requirements |
3964 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
3965 | __glibcxx_function_requires(_EqualOpConcept< |
3966 | typename iterator_traits<_InputIterator>::value_type, _Tp>) |
3967 | __glibcxx_requires_valid_range(__first, __last); |
3968 | |
3969 | return std::__count_if(__first, __last, |
3970 | __gnu_cxx::__ops::__iter_equals_val(__value)); |
3971 | } |
3972 | |
3973 | /** |
3974 | * @brief Count the elements of a sequence for which a predicate is true. |
3975 | * @ingroup non_mutating_algorithms |
3976 | * @param __first An input iterator. |
3977 | * @param __last An input iterator. |
3978 | * @param __pred A predicate. |
3979 | * @return The number of iterators @c i in the range @p [__first,__last) |
3980 | * for which @p __pred(*i) is true. |
3981 | */ |
3982 | template<typename _InputIterator, typename _Predicate> |
3983 | inline typename iterator_traits<_InputIterator>::difference_type |
3984 | count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) |
3985 | { |
3986 | // concept requirements |
3987 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
3988 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
3989 | typename iterator_traits<_InputIterator>::value_type>) |
3990 | __glibcxx_requires_valid_range(__first, __last); |
3991 | |
3992 | return std::__count_if(__first, __last, |
3993 | __gnu_cxx::__ops::__pred_iter(__pred)); |
3994 | } |
3995 | |
3996 | /** |
3997 | * @brief Search a sequence for a matching sub-sequence. |
3998 | * @ingroup non_mutating_algorithms |
3999 | * @param __first1 A forward iterator. |
4000 | * @param __last1 A forward iterator. |
4001 | * @param __first2 A forward iterator. |
4002 | * @param __last2 A forward iterator. |
4003 | * @return The first iterator @c i in the range @p |
4004 | * [__first1,__last1-(__last2-__first2)) such that @c *(i+N) == @p |
4005 | * *(__first2+N) for each @c N in the range @p |
4006 | * [0,__last2-__first2), or @p __last1 if no such iterator exists. |
4007 | * |
4008 | * Searches the range @p [__first1,__last1) for a sub-sequence that |
4009 | * compares equal value-by-value with the sequence given by @p |
4010 | * [__first2,__last2) and returns an iterator to the first element |
4011 | * of the sub-sequence, or @p __last1 if the sub-sequence is not |
4012 | * found. |
4013 | * |
4014 | * Because the sub-sequence must lie completely within the range @p |
4015 | * [__first1,__last1) it must start at a position less than @p |
4016 | * __last1-(__last2-__first2) where @p __last2-__first2 is the |
4017 | * length of the sub-sequence. |
4018 | * |
4019 | * This means that the returned iterator @c i will be in the range |
4020 | * @p [__first1,__last1-(__last2-__first2)) |
4021 | */ |
4022 | template<typename _ForwardIterator1, typename _ForwardIterator2> |
4023 | inline _ForwardIterator1 |
4024 | search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
4025 | _ForwardIterator2 __first2, _ForwardIterator2 __last2) |
4026 | { |
4027 | // concept requirements |
4028 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) |
4029 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) |
4030 | __glibcxx_function_requires(_EqualOpConcept< |
4031 | typename iterator_traits<_ForwardIterator1>::value_type, |
4032 | typename iterator_traits<_ForwardIterator2>::value_type>) |
4033 | __glibcxx_requires_valid_range(__first1, __last1); |
4034 | __glibcxx_requires_valid_range(__first2, __last2); |
4035 | |
4036 | return std::__search(__first1, __last1, __first2, __last2, |
4037 | __gnu_cxx::__ops::__iter_equal_to_iter()); |
4038 | } |
4039 | |
4040 | /** |
4041 | * @brief Search a sequence for a matching sub-sequence using a predicate. |
4042 | * @ingroup non_mutating_algorithms |
4043 | * @param __first1 A forward iterator. |
4044 | * @param __last1 A forward iterator. |
4045 | * @param __first2 A forward iterator. |
4046 | * @param __last2 A forward iterator. |
4047 | * @param __predicate A binary predicate. |
4048 | * @return The first iterator @c i in the range |
4049 | * @p [__first1,__last1-(__last2-__first2)) such that |
4050 | * @p __predicate(*(i+N),*(__first2+N)) is true for each @c N in the range |
4051 | * @p [0,__last2-__first2), or @p __last1 if no such iterator exists. |
4052 | * |
4053 | * Searches the range @p [__first1,__last1) for a sub-sequence that |
4054 | * compares equal value-by-value with the sequence given by @p |
4055 | * [__first2,__last2), using @p __predicate to determine equality, |
4056 | * and returns an iterator to the first element of the |
4057 | * sub-sequence, or @p __last1 if no such iterator exists. |
4058 | * |
4059 | * @see search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2) |
4060 | */ |
4061 | template<typename _ForwardIterator1, typename _ForwardIterator2, |
4062 | typename _BinaryPredicate> |
4063 | inline _ForwardIterator1 |
4064 | search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, |
4065 | _ForwardIterator2 __first2, _ForwardIterator2 __last2, |
4066 | _BinaryPredicate __predicate) |
4067 | { |
4068 | // concept requirements |
4069 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) |
4070 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) |
4071 | __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, |
4072 | typename iterator_traits<_ForwardIterator1>::value_type, |
4073 | typename iterator_traits<_ForwardIterator2>::value_type>) |
4074 | __glibcxx_requires_valid_range(__first1, __last1); |
4075 | __glibcxx_requires_valid_range(__first2, __last2); |
4076 | |
4077 | return std::__search(__first1, __last1, __first2, __last2, |
4078 | __gnu_cxx::__ops::__iter_comp_iter(__predicate)); |
4079 | } |
4080 | |
4081 | /** |
4082 | * @brief Search a sequence for a number of consecutive values. |
4083 | * @ingroup non_mutating_algorithms |
4084 | * @param __first A forward iterator. |
4085 | * @param __last A forward iterator. |
4086 | * @param __count The number of consecutive values. |
4087 | * @param __val The value to find. |
4088 | * @return The first iterator @c i in the range @p |
4089 | * [__first,__last-__count) such that @c *(i+N) == @p __val for |
4090 | * each @c N in the range @p [0,__count), or @p __last if no such |
4091 | * iterator exists. |
4092 | * |
4093 | * Searches the range @p [__first,__last) for @p count consecutive elements |
4094 | * equal to @p __val. |
4095 | */ |
4096 | template<typename _ForwardIterator, typename _Integer, typename _Tp> |
4097 | inline _ForwardIterator |
4098 | search_n(_ForwardIterator __first, _ForwardIterator __last, |
4099 | _Integer __count, const _Tp& __val) |
4100 | { |
4101 | // concept requirements |
4102 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
4103 | __glibcxx_function_requires(_EqualOpConcept< |
4104 | typename iterator_traits<_ForwardIterator>::value_type, _Tp>) |
4105 | __glibcxx_requires_valid_range(__first, __last); |
4106 | |
4107 | return std::__search_n(__first, __last, __count, |
4108 | __gnu_cxx::__ops::__iter_equals_val(__val)); |
4109 | } |
4110 | |
4111 | |
4112 | /** |
4113 | * @brief Search a sequence for a number of consecutive values using a |
4114 | * predicate. |
4115 | * @ingroup non_mutating_algorithms |
4116 | * @param __first A forward iterator. |
4117 | * @param __last A forward iterator. |
4118 | * @param __count The number of consecutive values. |
4119 | * @param __val The value to find. |
4120 | * @param __binary_pred A binary predicate. |
4121 | * @return The first iterator @c i in the range @p |
4122 | * [__first,__last-__count) such that @p |
4123 | * __binary_pred(*(i+N),__val) is true for each @c N in the range |
4124 | * @p [0,__count), or @p __last if no such iterator exists. |
4125 | * |
4126 | * Searches the range @p [__first,__last) for @p __count |
4127 | * consecutive elements for which the predicate returns true. |
4128 | */ |
4129 | template<typename _ForwardIterator, typename _Integer, typename _Tp, |
4130 | typename _BinaryPredicate> |
4131 | inline _ForwardIterator |
4132 | search_n(_ForwardIterator __first, _ForwardIterator __last, |
4133 | _Integer __count, const _Tp& __val, |
4134 | _BinaryPredicate __binary_pred) |
4135 | { |
4136 | // concept requirements |
4137 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
4138 | __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, |
4139 | typename iterator_traits<_ForwardIterator>::value_type, _Tp>) |
4140 | __glibcxx_requires_valid_range(__first, __last); |
4141 | |
4142 | return std::__search_n(__first, __last, __count, |
4143 | __gnu_cxx::__ops::__iter_comp_val(__binary_pred, __val)); |
4144 | } |
4145 | |
4146 | |
4147 | /** |
4148 | * @brief Perform an operation on a sequence. |
4149 | * @ingroup mutating_algorithms |
4150 | * @param __first An input iterator. |
4151 | * @param __last An input iterator. |
4152 | * @param __result An output iterator. |
4153 | * @param __unary_op A unary operator. |
4154 | * @return An output iterator equal to @p __result+(__last-__first). |
4155 | * |
4156 | * Applies the operator to each element in the input range and assigns |
4157 | * the results to successive elements of the output sequence. |
4158 | * Evaluates @p *(__result+N)=unary_op(*(__first+N)) for each @c N in the |
4159 | * range @p [0,__last-__first). |
4160 | * |
4161 | * @p unary_op must not alter its argument. |
4162 | */ |
4163 | template<typename _InputIterator, typename _OutputIterator, |
4164 | typename _UnaryOperation> |
4165 | _OutputIterator |
4166 | transform(_InputIterator __first, _InputIterator __last, |
4167 | _OutputIterator __result, _UnaryOperation __unary_op) |
4168 | { |
4169 | // concept requirements |
4170 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
4171 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
4172 | // "the type returned by a _UnaryOperation" |
4173 | __typeof__(__unary_op(*__first))>) |
4174 | __glibcxx_requires_valid_range(__first, __last); |
4175 | |
4176 | for (; __first != __last; ++__first, (void)++__result) |
4177 | *__result = __unary_op(*__first); |
4178 | return __result; |
4179 | } |
4180 | |
4181 | /** |
4182 | * @brief Perform an operation on corresponding elements of two sequences. |
4183 | * @ingroup mutating_algorithms |
4184 | * @param __first1 An input iterator. |
4185 | * @param __last1 An input iterator. |
4186 | * @param __first2 An input iterator. |
4187 | * @param __result An output iterator. |
4188 | * @param __binary_op A binary operator. |
4189 | * @return An output iterator equal to @p result+(last-first). |
4190 | * |
4191 | * Applies the operator to the corresponding elements in the two |
4192 | * input ranges and assigns the results to successive elements of the |
4193 | * output sequence. |
4194 | * Evaluates @p |
4195 | * *(__result+N)=__binary_op(*(__first1+N),*(__first2+N)) for each |
4196 | * @c N in the range @p [0,__last1-__first1). |
4197 | * |
4198 | * @p binary_op must not alter either of its arguments. |
4199 | */ |
4200 | template<typename _InputIterator1, typename _InputIterator2, |
4201 | typename _OutputIterator, typename _BinaryOperation> |
4202 | _OutputIterator |
4203 | transform(_InputIterator1 __first1, _InputIterator1 __last1, |
4204 | _InputIterator2 __first2, _OutputIterator __result, |
4205 | _BinaryOperation __binary_op) |
4206 | { |
4207 | // concept requirements |
4208 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
4209 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
4210 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
4211 | // "the type returned by a _BinaryOperation" |
4212 | __typeof__(__binary_op(*__first1,*__first2))>) |
4213 | __glibcxx_requires_valid_range(__first1, __last1); |
4214 | |
4215 | for (; __first1 != __last1; ++__first1, (void)++__first2, ++__result) |
4216 | *__result = __binary_op(*__first1, *__first2); |
4217 | return __result; |
4218 | } |
4219 | |
4220 | /** |
4221 | * @brief Replace each occurrence of one value in a sequence with another |
4222 | * value. |
4223 | * @ingroup mutating_algorithms |
4224 | * @param __first A forward iterator. |
4225 | * @param __last A forward iterator. |
4226 | * @param __old_value The value to be replaced. |
4227 | * @param __new_value The replacement value. |
4228 | * @return replace() returns no value. |
4229 | * |
4230 | * For each iterator @c i in the range @p [__first,__last) if @c *i == |
4231 | * @p __old_value then the assignment @c *i = @p __new_value is performed. |
4232 | */ |
4233 | template<typename _ForwardIterator, typename _Tp> |
4234 | void |
4235 | replace(_ForwardIterator __first, _ForwardIterator __last, |
4236 | const _Tp& __old_value, const _Tp& __new_value) |
4237 | { |
4238 | // concept requirements |
4239 | __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< |
4240 | _ForwardIterator>) |
4241 | __glibcxx_function_requires(_EqualOpConcept< |
4242 | typename iterator_traits<_ForwardIterator>::value_type, _Tp>) |
4243 | __glibcxx_function_requires(_ConvertibleConcept<_Tp, |
4244 | typename iterator_traits<_ForwardIterator>::value_type>) |
4245 | __glibcxx_requires_valid_range(__first, __last); |
4246 | |
4247 | for (; __first != __last; ++__first) |
4248 | if (*__first == __old_value) |
4249 | *__first = __new_value; |
4250 | } |
4251 | |
4252 | /** |
4253 | * @brief Replace each value in a sequence for which a predicate returns |
4254 | * true with another value. |
4255 | * @ingroup mutating_algorithms |
4256 | * @param __first A forward iterator. |
4257 | * @param __last A forward iterator. |
4258 | * @param __pred A predicate. |
4259 | * @param __new_value The replacement value. |
4260 | * @return replace_if() returns no value. |
4261 | * |
4262 | * For each iterator @c i in the range @p [__first,__last) if @p __pred(*i) |
4263 | * is true then the assignment @c *i = @p __new_value is performed. |
4264 | */ |
4265 | template<typename _ForwardIterator, typename _Predicate, typename _Tp> |
4266 | void |
4267 | replace_if(_ForwardIterator __first, _ForwardIterator __last, |
4268 | _Predicate __pred, const _Tp& __new_value) |
4269 | { |
4270 | // concept requirements |
4271 | __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< |
4272 | _ForwardIterator>) |
4273 | __glibcxx_function_requires(_ConvertibleConcept<_Tp, |
4274 | typename iterator_traits<_ForwardIterator>::value_type>) |
4275 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
4276 | typename iterator_traits<_ForwardIterator>::value_type>) |
4277 | __glibcxx_requires_valid_range(__first, __last); |
4278 | |
4279 | for (; __first != __last; ++__first) |
4280 | if (__pred(*__first)) |
4281 | *__first = __new_value; |
4282 | } |
4283 | |
4284 | /** |
4285 | * @brief Assign the result of a function object to each value in a |
4286 | * sequence. |
4287 | * @ingroup mutating_algorithms |
4288 | * @param __first A forward iterator. |
4289 | * @param __last A forward iterator. |
4290 | * @param __gen A function object taking no arguments and returning |
4291 | * std::iterator_traits<_ForwardIterator>::value_type |
4292 | * @return generate() returns no value. |
4293 | * |
4294 | * Performs the assignment @c *i = @p __gen() for each @c i in the range |
4295 | * @p [__first,__last). |
4296 | */ |
4297 | template<typename _ForwardIterator, typename _Generator> |
4298 | void |
4299 | generate(_ForwardIterator __first, _ForwardIterator __last, |
4300 | _Generator __gen) |
4301 | { |
4302 | // concept requirements |
4303 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
4304 | __glibcxx_function_requires(_GeneratorConcept<_Generator, |
4305 | typename iterator_traits<_ForwardIterator>::value_type>) |
4306 | __glibcxx_requires_valid_range(__first, __last); |
4307 | |
4308 | for (; __first != __last; ++__first) |
4309 | *__first = __gen(); |
4310 | } |
4311 | |
4312 | /** |
4313 | * @brief Assign the result of a function object to each value in a |
4314 | * sequence. |
4315 | * @ingroup mutating_algorithms |
4316 | * @param __first A forward iterator. |
4317 | * @param __n The length of the sequence. |
4318 | * @param __gen A function object taking no arguments and returning |
4319 | * std::iterator_traits<_ForwardIterator>::value_type |
4320 | * @return The end of the sequence, @p __first+__n |
4321 | * |
4322 | * Performs the assignment @c *i = @p __gen() for each @c i in the range |
4323 | * @p [__first,__first+__n). |
4324 | * |
4325 | * _GLIBCXX_RESOLVE_LIB_DEFECTS |
4326 | * DR 865. More algorithms that throw away information |
4327 | */ |
4328 | template<typename _OutputIterator, typename _Size, typename _Generator> |
4329 | _OutputIterator |
4330 | generate_n(_OutputIterator __first, _Size __n, _Generator __gen) |
4331 | { |
4332 | // concept requirements |
4333 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
4334 | // "the type returned by a _Generator" |
4335 | __typeof__(__gen())>) |
4336 | |
4337 | for (__decltype(__n + 0) __niter = __n; |
4338 | __niter > 0; --__niter, ++__first) |
4339 | *__first = __gen(); |
4340 | return __first; |
4341 | } |
4342 | |
4343 | /** |
4344 | * @brief Copy a sequence, removing consecutive duplicate values. |
4345 | * @ingroup mutating_algorithms |
4346 | * @param __first An input iterator. |
4347 | * @param __last An input iterator. |
4348 | * @param __result An output iterator. |
4349 | * @return An iterator designating the end of the resulting sequence. |
4350 | * |
4351 | * Copies each element in the range @p [__first,__last) to the range |
4352 | * beginning at @p __result, except that only the first element is copied |
4353 | * from groups of consecutive elements that compare equal. |
4354 | * unique_copy() is stable, so the relative order of elements that are |
4355 | * copied is unchanged. |
4356 | * |
4357 | * _GLIBCXX_RESOLVE_LIB_DEFECTS |
4358 | * DR 241. Does unique_copy() require CopyConstructible and Assignable? |
4359 | * |
4360 | * _GLIBCXX_RESOLVE_LIB_DEFECTS |
4361 | * DR 538. 241 again: Does unique_copy() require CopyConstructible and |
4362 | * Assignable? |
4363 | */ |
4364 | template<typename _InputIterator, typename _OutputIterator> |
4365 | inline _OutputIterator |
4366 | unique_copy(_InputIterator __first, _InputIterator __last, |
4367 | _OutputIterator __result) |
4368 | { |
4369 | // concept requirements |
4370 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
4371 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
4372 | typename iterator_traits<_InputIterator>::value_type>) |
4373 | __glibcxx_function_requires(_EqualityComparableConcept< |
4374 | typename iterator_traits<_InputIterator>::value_type>) |
4375 | __glibcxx_requires_valid_range(__first, __last); |
4376 | |
4377 | if (__first == __last) |
4378 | return __result; |
4379 | return std::__unique_copy(__first, __last, __result, |
4380 | __gnu_cxx::__ops::__iter_equal_to_iter(), |
4381 | std::__iterator_category(__first), |
4382 | std::__iterator_category(__result)); |
4383 | } |
4384 | |
4385 | /** |
4386 | * @brief Copy a sequence, removing consecutive values using a predicate. |
4387 | * @ingroup mutating_algorithms |
4388 | * @param __first An input iterator. |
4389 | * @param __last An input iterator. |
4390 | * @param __result An output iterator. |
4391 | * @param __binary_pred A binary predicate. |
4392 | * @return An iterator designating the end of the resulting sequence. |
4393 | * |
4394 | * Copies each element in the range @p [__first,__last) to the range |
4395 | * beginning at @p __result, except that only the first element is copied |
4396 | * from groups of consecutive elements for which @p __binary_pred returns |
4397 | * true. |
4398 | * unique_copy() is stable, so the relative order of elements that are |
4399 | * copied is unchanged. |
4400 | * |
4401 | * _GLIBCXX_RESOLVE_LIB_DEFECTS |
4402 | * DR 241. Does unique_copy() require CopyConstructible and Assignable? |
4403 | */ |
4404 | template<typename _InputIterator, typename _OutputIterator, |
4405 | typename _BinaryPredicate> |
4406 | inline _OutputIterator |
4407 | unique_copy(_InputIterator __first, _InputIterator __last, |
4408 | _OutputIterator __result, |
4409 | _BinaryPredicate __binary_pred) |
4410 | { |
4411 | // concept requirements -- predicates checked later |
4412 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) |
4413 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
4414 | typename iterator_traits<_InputIterator>::value_type>) |
4415 | __glibcxx_requires_valid_range(__first, __last); |
4416 | |
4417 | if (__first == __last) |
4418 | return __result; |
4419 | return std::__unique_copy(__first, __last, __result, |
4420 | __gnu_cxx::__ops::__iter_comp_iter(__binary_pred), |
4421 | std::__iterator_category(__first), |
4422 | std::__iterator_category(__result)); |
4423 | } |
4424 | |
4425 | #if _GLIBCXX_HOSTED1 |
4426 | /** |
4427 | * @brief Randomly shuffle the elements of a sequence. |
4428 | * @ingroup mutating_algorithms |
4429 | * @param __first A forward iterator. |
4430 | * @param __last A forward iterator. |
4431 | * @return Nothing. |
4432 | * |
4433 | * Reorder the elements in the range @p [__first,__last) using a random |
4434 | * distribution, so that every possible ordering of the sequence is |
4435 | * equally likely. |
4436 | */ |
4437 | template<typename _RandomAccessIterator> |
4438 | inline void |
4439 | random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) |
4440 | { |
4441 | // concept requirements |
4442 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
4443 | _RandomAccessIterator>) |
4444 | __glibcxx_requires_valid_range(__first, __last); |
4445 | |
4446 | if (__first != __last) |
4447 | for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) |
4448 | { |
4449 | // XXX rand() % N is not uniformly distributed |
4450 | _RandomAccessIterator __j = __first |
4451 | + std::rand() % ((__i - __first) + 1); |
4452 | if (__i != __j) |
4453 | std::iter_swap(__i, __j); |
4454 | } |
4455 | } |
4456 | #endif |
4457 | |
4458 | /** |
4459 | * @brief Shuffle the elements of a sequence using a random number |
4460 | * generator. |
4461 | * @ingroup mutating_algorithms |
4462 | * @param __first A forward iterator. |
4463 | * @param __last A forward iterator. |
4464 | * @param __rand The RNG functor or function. |
4465 | * @return Nothing. |
4466 | * |
4467 | * Reorders the elements in the range @p [__first,__last) using @p __rand to |
4468 | * provide a random distribution. Calling @p __rand(N) for a positive |
4469 | * integer @p N should return a randomly chosen integer from the |
4470 | * range [0,N). |
4471 | */ |
4472 | template<typename _RandomAccessIterator, typename _RandomNumberGenerator> |
4473 | void |
4474 | random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, |
4475 | #if __cplusplus201103L >= 201103L |
4476 | _RandomNumberGenerator&& __rand) |
4477 | #else |
4478 | _RandomNumberGenerator& __rand) |
4479 | #endif |
4480 | { |
4481 | // concept requirements |
4482 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
4483 | _RandomAccessIterator>) |
4484 | __glibcxx_requires_valid_range(__first, __last); |
4485 | |
4486 | if (__first == __last) |
4487 | return; |
4488 | for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) |
4489 | { |
4490 | _RandomAccessIterator __j = __first + __rand((__i - __first) + 1); |
4491 | if (__i != __j) |
4492 | std::iter_swap(__i, __j); |
4493 | } |
4494 | } |
4495 | |
4496 | |
4497 | /** |
4498 | * @brief Move elements for which a predicate is true to the beginning |
4499 | * of a sequence. |
4500 | * @ingroup mutating_algorithms |
4501 | * @param __first A forward iterator. |
4502 | * @param __last A forward iterator. |
4503 | * @param __pred A predicate functor. |
4504 | * @return An iterator @p middle such that @p __pred(i) is true for each |
4505 | * iterator @p i in the range @p [__first,middle) and false for each @p i |
4506 | * in the range @p [middle,__last). |
4507 | * |
4508 | * @p __pred must not modify its operand. @p partition() does not preserve |
4509 | * the relative ordering of elements in each group, use |
4510 | * @p stable_partition() if this is needed. |
4511 | */ |
4512 | template<typename _ForwardIterator, typename _Predicate> |
4513 | inline _ForwardIterator |
4514 | partition(_ForwardIterator __first, _ForwardIterator __last, |
4515 | _Predicate __pred) |
4516 | { |
4517 | // concept requirements |
4518 | __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< |
4519 | _ForwardIterator>) |
4520 | __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, |
4521 | typename iterator_traits<_ForwardIterator>::value_type>) |
4522 | __glibcxx_requires_valid_range(__first, __last); |
4523 | |
4524 | return std::__partition(__first, __last, __pred, |
4525 | std::__iterator_category(__first)); |
4526 | } |
4527 | |
4528 | |
4529 | /** |
4530 | * @brief Sort the smallest elements of a sequence. |
4531 | * @ingroup sorting_algorithms |
4532 | * @param __first An iterator. |
4533 | * @param __middle Another iterator. |
4534 | * @param __last Another iterator. |
4535 | * @return Nothing. |
4536 | * |
4537 | * Sorts the smallest @p (__middle-__first) elements in the range |
4538 | * @p [first,last) and moves them to the range @p [__first,__middle). The |
4539 | * order of the remaining elements in the range @p [__middle,__last) is |
4540 | * undefined. |
4541 | * After the sort if @e i and @e j are iterators in the range |
4542 | * @p [__first,__middle) such that i precedes j and @e k is an iterator in |
4543 | * the range @p [__middle,__last) then *j<*i and *k<*i are both false. |
4544 | */ |
4545 | template<typename _RandomAccessIterator> |
4546 | inline void |
4547 | partial_sort(_RandomAccessIterator __first, |
4548 | _RandomAccessIterator __middle, |
4549 | _RandomAccessIterator __last) |
4550 | { |
4551 | // concept requirements |
4552 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
4553 | _RandomAccessIterator>) |
4554 | __glibcxx_function_requires(_LessThanComparableConcept< |
4555 | typename iterator_traits<_RandomAccessIterator>::value_type>) |
4556 | __glibcxx_requires_valid_range(__first, __middle); |
4557 | __glibcxx_requires_valid_range(__middle, __last); |
4558 | __glibcxx_requires_irreflexive(__first, __last); |
4559 | |
4560 | std::__partial_sort(__first, __middle, __last, |
4561 | __gnu_cxx::__ops::__iter_less_iter()); |
4562 | } |
4563 | |
4564 | /** |
4565 | * @brief Sort the smallest elements of a sequence using a predicate |
4566 | * for comparison. |
4567 | * @ingroup sorting_algorithms |
4568 | * @param __first An iterator. |
4569 | * @param __middle Another iterator. |
4570 | * @param __last Another iterator. |
4571 | * @param __comp A comparison functor. |
4572 | * @return Nothing. |
4573 | * |
4574 | * Sorts the smallest @p (__middle-__first) elements in the range |
4575 | * @p [__first,__last) and moves them to the range @p [__first,__middle). The |
4576 | * order of the remaining elements in the range @p [__middle,__last) is |
4577 | * undefined. |
4578 | * After the sort if @e i and @e j are iterators in the range |
4579 | * @p [__first,__middle) such that i precedes j and @e k is an iterator in |
4580 | * the range @p [__middle,__last) then @p *__comp(j,*i) and @p __comp(*k,*i) |
4581 | * are both false. |
4582 | */ |
4583 | template<typename _RandomAccessIterator, typename _Compare> |
4584 | inline void |
4585 | partial_sort(_RandomAccessIterator __first, |
4586 | _RandomAccessIterator __middle, |
4587 | _RandomAccessIterator __last, |
4588 | _Compare __comp) |
4589 | { |
4590 | // concept requirements |
4591 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
4592 | _RandomAccessIterator>) |
4593 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
4594 | typename iterator_traits<_RandomAccessIterator>::value_type, |
4595 | typename iterator_traits<_RandomAccessIterator>::value_type>) |
4596 | __glibcxx_requires_valid_range(__first, __middle); |
4597 | __glibcxx_requires_valid_range(__middle, __last); |
4598 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
4599 | |
4600 | std::__partial_sort(__first, __middle, __last, |
4601 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
4602 | } |
4603 | |
4604 | /** |
4605 | * @brief Sort a sequence just enough to find a particular position. |
4606 | * @ingroup sorting_algorithms |
4607 | * @param __first An iterator. |
4608 | * @param __nth Another iterator. |
4609 | * @param __last Another iterator. |
4610 | * @return Nothing. |
4611 | * |
4612 | * Rearranges the elements in the range @p [__first,__last) so that @p *__nth |
4613 | * is the same element that would have been in that position had the |
4614 | * whole sequence been sorted. The elements either side of @p *__nth are |
4615 | * not completely sorted, but for any iterator @e i in the range |
4616 | * @p [__first,__nth) and any iterator @e j in the range @p [__nth,__last) it |
4617 | * holds that *j < *i is false. |
4618 | */ |
4619 | template<typename _RandomAccessIterator> |
4620 | inline void |
4621 | nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, |
4622 | _RandomAccessIterator __last) |
4623 | { |
4624 | // concept requirements |
4625 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
4626 | _RandomAccessIterator>) |
4627 | __glibcxx_function_requires(_LessThanComparableConcept< |
4628 | typename iterator_traits<_RandomAccessIterator>::value_type>) |
4629 | __glibcxx_requires_valid_range(__first, __nth); |
4630 | __glibcxx_requires_valid_range(__nth, __last); |
4631 | __glibcxx_requires_irreflexive(__first, __last); |
4632 | |
4633 | if (__first == __last || __nth == __last) |
4634 | return; |
4635 | |
4636 | std::__introselect(__first, __nth, __last, |
4637 | std::__lg(__last - __first) * 2, |
4638 | __gnu_cxx::__ops::__iter_less_iter()); |
4639 | } |
4640 | |
4641 | /** |
4642 | * @brief Sort a sequence just enough to find a particular position |
4643 | * using a predicate for comparison. |
4644 | * @ingroup sorting_algorithms |
4645 | * @param __first An iterator. |
4646 | * @param __nth Another iterator. |
4647 | * @param __last Another iterator. |
4648 | * @param __comp A comparison functor. |
4649 | * @return Nothing. |
4650 | * |
4651 | * Rearranges the elements in the range @p [__first,__last) so that @p *__nth |
4652 | * is the same element that would have been in that position had the |
4653 | * whole sequence been sorted. The elements either side of @p *__nth are |
4654 | * not completely sorted, but for any iterator @e i in the range |
4655 | * @p [__first,__nth) and any iterator @e j in the range @p [__nth,__last) it |
4656 | * holds that @p __comp(*j,*i) is false. |
4657 | */ |
4658 | template<typename _RandomAccessIterator, typename _Compare> |
4659 | inline void |
4660 | nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, |
4661 | _RandomAccessIterator __last, _Compare __comp) |
4662 | { |
4663 | // concept requirements |
4664 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
4665 | _RandomAccessIterator>) |
4666 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
4667 | typename iterator_traits<_RandomAccessIterator>::value_type, |
4668 | typename iterator_traits<_RandomAccessIterator>::value_type>) |
4669 | __glibcxx_requires_valid_range(__first, __nth); |
4670 | __glibcxx_requires_valid_range(__nth, __last); |
4671 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
4672 | |
4673 | if (__first == __last || __nth == __last) |
4674 | return; |
4675 | |
4676 | std::__introselect(__first, __nth, __last, |
4677 | std::__lg(__last - __first) * 2, |
4678 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
4679 | } |
4680 | |
4681 | /** |
4682 | * @brief Sort the elements of a sequence. |
4683 | * @ingroup sorting_algorithms |
4684 | * @param __first An iterator. |
4685 | * @param __last Another iterator. |
4686 | * @return Nothing. |
4687 | * |
4688 | * Sorts the elements in the range @p [__first,__last) in ascending order, |
4689 | * such that for each iterator @e i in the range @p [__first,__last-1), |
4690 | * *(i+1)<*i is false. |
4691 | * |
4692 | * The relative ordering of equivalent elements is not preserved, use |
4693 | * @p stable_sort() if this is needed. |
4694 | */ |
4695 | template<typename _RandomAccessIterator> |
4696 | inline void |
4697 | sort(_RandomAccessIterator __first, _RandomAccessIterator __last) |
4698 | { |
4699 | // concept requirements |
4700 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
4701 | _RandomAccessIterator>) |
4702 | __glibcxx_function_requires(_LessThanComparableConcept< |
4703 | typename iterator_traits<_RandomAccessIterator>::value_type>) |
4704 | __glibcxx_requires_valid_range(__first, __last); |
4705 | __glibcxx_requires_irreflexive(__first, __last); |
4706 | |
4707 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter()); |
4708 | } |
4709 | |
4710 | /** |
4711 | * @brief Sort the elements of a sequence using a predicate for comparison. |
4712 | * @ingroup sorting_algorithms |
4713 | * @param __first An iterator. |
4714 | * @param __last Another iterator. |
4715 | * @param __comp A comparison functor. |
4716 | * @return Nothing. |
4717 | * |
4718 | * Sorts the elements in the range @p [__first,__last) in ascending order, |
4719 | * such that @p __comp(*(i+1),*i) is false for every iterator @e i in the |
4720 | * range @p [__first,__last-1). |
4721 | * |
4722 | * The relative ordering of equivalent elements is not preserved, use |
4723 | * @p stable_sort() if this is needed. |
4724 | */ |
4725 | template<typename _RandomAccessIterator, typename _Compare> |
4726 | inline void |
4727 | sort(_RandomAccessIterator __first, _RandomAccessIterator __last, |
4728 | _Compare __comp) |
4729 | { |
4730 | // concept requirements |
4731 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
4732 | _RandomAccessIterator>) |
4733 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
4734 | typename iterator_traits<_RandomAccessIterator>::value_type, |
4735 | typename iterator_traits<_RandomAccessIterator>::value_type>) |
4736 | __glibcxx_requires_valid_range(__first, __last); |
4737 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
4738 | |
4739 | std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
4740 | } |
4741 | |
4742 | template<typename _InputIterator1, typename _InputIterator2, |
4743 | typename _OutputIterator, typename _Compare> |
4744 | _OutputIterator |
4745 | __merge(_InputIterator1 __first1, _InputIterator1 __last1, |
4746 | _InputIterator2 __first2, _InputIterator2 __last2, |
4747 | _OutputIterator __result, _Compare __comp) |
4748 | { |
4749 | while (__first1 != __last1 && __first2 != __last2) |
4750 | { |
4751 | if (__comp(__first2, __first1)) |
4752 | { |
4753 | *__result = *__first2; |
4754 | ++__first2; |
4755 | } |
4756 | else |
4757 | { |
4758 | *__result = *__first1; |
4759 | ++__first1; |
4760 | } |
4761 | ++__result; |
4762 | } |
4763 | return std::copy(__first2, __last2, |
4764 | std::copy(__first1, __last1, __result)); |
4765 | } |
4766 | |
4767 | /** |
4768 | * @brief Merges two sorted ranges. |
4769 | * @ingroup sorting_algorithms |
4770 | * @param __first1 An iterator. |
4771 | * @param __first2 Another iterator. |
4772 | * @param __last1 Another iterator. |
4773 | * @param __last2 Another iterator. |
4774 | * @param __result An iterator pointing to the end of the merged range. |
4775 | * @return An iterator pointing to the first element <em>not less |
4776 | * than</em> @e val. |
4777 | * |
4778 | * Merges the ranges @p [__first1,__last1) and @p [__first2,__last2) into |
4779 | * the sorted range @p [__result, __result + (__last1-__first1) + |
4780 | * (__last2-__first2)). Both input ranges must be sorted, and the |
4781 | * output range must not overlap with either of the input ranges. |
4782 | * The sort is @e stable, that is, for equivalent elements in the |
4783 | * two ranges, elements from the first range will always come |
4784 | * before elements from the second. |
4785 | */ |
4786 | template<typename _InputIterator1, typename _InputIterator2, |
4787 | typename _OutputIterator> |
4788 | inline _OutputIterator |
4789 | merge(_InputIterator1 __first1, _InputIterator1 __last1, |
4790 | _InputIterator2 __first2, _InputIterator2 __last2, |
4791 | _OutputIterator __result) |
4792 | { |
4793 | // concept requirements |
4794 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
4795 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
4796 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
4797 | typename iterator_traits<_InputIterator1>::value_type>) |
4798 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
4799 | typename iterator_traits<_InputIterator2>::value_type>) |
4800 | __glibcxx_function_requires(_LessThanOpConcept< |
4801 | typename iterator_traits<_InputIterator2>::value_type, |
4802 | typename iterator_traits<_InputIterator1>::value_type>) |
4803 | __glibcxx_requires_sorted_set(__first1, __last1, __first2); |
4804 | __glibcxx_requires_sorted_set(__first2, __last2, __first1); |
4805 | __glibcxx_requires_irreflexive2(__first1, __last1); |
4806 | __glibcxx_requires_irreflexive2(__first2, __last2); |
4807 | |
4808 | return _GLIBCXX_STD_Astd::__merge(__first1, __last1, |
4809 | __first2, __last2, __result, |
4810 | __gnu_cxx::__ops::__iter_less_iter()); |
4811 | } |
4812 | |
4813 | /** |
4814 | * @brief Merges two sorted ranges. |
4815 | * @ingroup sorting_algorithms |
4816 | * @param __first1 An iterator. |
4817 | * @param __first2 Another iterator. |
4818 | * @param __last1 Another iterator. |
4819 | * @param __last2 Another iterator. |
4820 | * @param __result An iterator pointing to the end of the merged range. |
4821 | * @param __comp A functor to use for comparisons. |
4822 | * @return An iterator pointing to the first element "not less |
4823 | * than" @e val. |
4824 | * |
4825 | * Merges the ranges @p [__first1,__last1) and @p [__first2,__last2) into |
4826 | * the sorted range @p [__result, __result + (__last1-__first1) + |
4827 | * (__last2-__first2)). Both input ranges must be sorted, and the |
4828 | * output range must not overlap with either of the input ranges. |
4829 | * The sort is @e stable, that is, for equivalent elements in the |
4830 | * two ranges, elements from the first range will always come |
4831 | * before elements from the second. |
4832 | * |
4833 | * The comparison function should have the same effects on ordering as |
4834 | * the function used for the initial sort. |
4835 | */ |
4836 | template<typename _InputIterator1, typename _InputIterator2, |
4837 | typename _OutputIterator, typename _Compare> |
4838 | inline _OutputIterator |
4839 | merge(_InputIterator1 __first1, _InputIterator1 __last1, |
4840 | _InputIterator2 __first2, _InputIterator2 __last2, |
4841 | _OutputIterator __result, _Compare __comp) |
4842 | { |
4843 | // concept requirements |
4844 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
4845 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
4846 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
4847 | typename iterator_traits<_InputIterator1>::value_type>) |
4848 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
4849 | typename iterator_traits<_InputIterator2>::value_type>) |
4850 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
4851 | typename iterator_traits<_InputIterator2>::value_type, |
4852 | typename iterator_traits<_InputIterator1>::value_type>) |
4853 | __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); |
4854 | __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); |
4855 | __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp); |
4856 | __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp); |
4857 | |
4858 | return _GLIBCXX_STD_Astd::__merge(__first1, __last1, |
4859 | __first2, __last2, __result, |
4860 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
4861 | } |
4862 | |
4863 | template<typename _RandomAccessIterator, typename _Compare> |
4864 | inline void |
4865 | __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, |
4866 | _Compare __comp) |
4867 | { |
4868 | typedef typename iterator_traits<_RandomAccessIterator>::value_type |
4869 | _ValueType; |
4870 | typedef typename iterator_traits<_RandomAccessIterator>::difference_type |
4871 | _DistanceType; |
4872 | |
4873 | typedef _Temporary_buffer<_RandomAccessIterator, _ValueType> _TmpBuf; |
4874 | _TmpBuf __buf(__first, __last); |
4875 | |
4876 | if (__buf.begin() == 0) |
4877 | std::__inplace_stable_sort(__first, __last, __comp); |
4878 | else |
4879 | std::__stable_sort_adaptive(__first, __last, __buf.begin(), |
4880 | _DistanceType(__buf.size()), __comp); |
4881 | } |
4882 | |
4883 | /** |
4884 | * @brief Sort the elements of a sequence, preserving the relative order |
4885 | * of equivalent elements. |
4886 | * @ingroup sorting_algorithms |
4887 | * @param __first An iterator. |
4888 | * @param __last Another iterator. |
4889 | * @return Nothing. |
4890 | * |
4891 | * Sorts the elements in the range @p [__first,__last) in ascending order, |
4892 | * such that for each iterator @p i in the range @p [__first,__last-1), |
4893 | * @p *(i+1)<*i is false. |
4894 | * |
4895 | * The relative ordering of equivalent elements is preserved, so any two |
4896 | * elements @p x and @p y in the range @p [__first,__last) such that |
4897 | * @p x<y is false and @p y<x is false will have the same relative |
4898 | * ordering after calling @p stable_sort(). |
4899 | */ |
4900 | template<typename _RandomAccessIterator> |
4901 | inline void |
4902 | stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) |
4903 | { |
4904 | // concept requirements |
4905 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
4906 | _RandomAccessIterator>) |
4907 | __glibcxx_function_requires(_LessThanComparableConcept< |
4908 | typename iterator_traits<_RandomAccessIterator>::value_type>) |
4909 | __glibcxx_requires_valid_range(__first, __last); |
4910 | __glibcxx_requires_irreflexive(__first, __last); |
4911 | |
4912 | _GLIBCXX_STD_Astd::__stable_sort(__first, __last, |
4913 | __gnu_cxx::__ops::__iter_less_iter()); |
4914 | } |
4915 | |
4916 | /** |
4917 | * @brief Sort the elements of a sequence using a predicate for comparison, |
4918 | * preserving the relative order of equivalent elements. |
4919 | * @ingroup sorting_algorithms |
4920 | * @param __first An iterator. |
4921 | * @param __last Another iterator. |
4922 | * @param __comp A comparison functor. |
4923 | * @return Nothing. |
4924 | * |
4925 | * Sorts the elements in the range @p [__first,__last) in ascending order, |
4926 | * such that for each iterator @p i in the range @p [__first,__last-1), |
4927 | * @p __comp(*(i+1),*i) is false. |
4928 | * |
4929 | * The relative ordering of equivalent elements is preserved, so any two |
4930 | * elements @p x and @p y in the range @p [__first,__last) such that |
4931 | * @p __comp(x,y) is false and @p __comp(y,x) is false will have the same |
4932 | * relative ordering after calling @p stable_sort(). |
4933 | */ |
4934 | template<typename _RandomAccessIterator, typename _Compare> |
4935 | inline void |
4936 | stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, |
4937 | _Compare __comp) |
4938 | { |
4939 | // concept requirements |
4940 | __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< |
4941 | _RandomAccessIterator>) |
4942 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
4943 | typename iterator_traits<_RandomAccessIterator>::value_type, |
4944 | typename iterator_traits<_RandomAccessIterator>::value_type>) |
4945 | __glibcxx_requires_valid_range(__first, __last); |
4946 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
4947 | |
4948 | _GLIBCXX_STD_Astd::__stable_sort(__first, __last, |
4949 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
4950 | } |
4951 | |
4952 | template<typename _InputIterator1, typename _InputIterator2, |
4953 | typename _OutputIterator, |
4954 | typename _Compare> |
4955 | _OutputIterator |
4956 | __set_union(_InputIterator1 __first1, _InputIterator1 __last1, |
4957 | _InputIterator2 __first2, _InputIterator2 __last2, |
4958 | _OutputIterator __result, _Compare __comp) |
4959 | { |
4960 | while (__first1 != __last1 && __first2 != __last2) |
4961 | { |
4962 | if (__comp(__first1, __first2)) |
4963 | { |
4964 | *__result = *__first1; |
4965 | ++__first1; |
4966 | } |
4967 | else if (__comp(__first2, __first1)) |
4968 | { |
4969 | *__result = *__first2; |
4970 | ++__first2; |
4971 | } |
4972 | else |
4973 | { |
4974 | *__result = *__first1; |
4975 | ++__first1; |
4976 | ++__first2; |
4977 | } |
4978 | ++__result; |
4979 | } |
4980 | return std::copy(__first2, __last2, |
4981 | std::copy(__first1, __last1, __result)); |
4982 | } |
4983 | |
4984 | /** |
4985 | * @brief Return the union of two sorted ranges. |
4986 | * @ingroup set_algorithms |
4987 | * @param __first1 Start of first range. |
4988 | * @param __last1 End of first range. |
4989 | * @param __first2 Start of second range. |
4990 | * @param __last2 End of second range. |
4991 | * @return End of the output range. |
4992 | * @ingroup set_algorithms |
4993 | * |
4994 | * This operation iterates over both ranges, copying elements present in |
4995 | * each range in order to the output range. Iterators increment for each |
4996 | * range. When the current element of one range is less than the other, |
4997 | * that element is copied and the iterator advanced. If an element is |
4998 | * contained in both ranges, the element from the first range is copied and |
4999 | * both ranges advance. The output range may not overlap either input |
5000 | * range. |
5001 | */ |
5002 | template<typename _InputIterator1, typename _InputIterator2, |
5003 | typename _OutputIterator> |
5004 | inline _OutputIterator |
5005 | set_union(_InputIterator1 __first1, _InputIterator1 __last1, |
5006 | _InputIterator2 __first2, _InputIterator2 __last2, |
5007 | _OutputIterator __result) |
5008 | { |
5009 | // concept requirements |
5010 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
5011 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
5012 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5013 | typename iterator_traits<_InputIterator1>::value_type>) |
5014 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5015 | typename iterator_traits<_InputIterator2>::value_type>) |
5016 | __glibcxx_function_requires(_LessThanOpConcept< |
5017 | typename iterator_traits<_InputIterator1>::value_type, |
5018 | typename iterator_traits<_InputIterator2>::value_type>) |
5019 | __glibcxx_function_requires(_LessThanOpConcept< |
5020 | typename iterator_traits<_InputIterator2>::value_type, |
5021 | typename iterator_traits<_InputIterator1>::value_type>) |
5022 | __glibcxx_requires_sorted_set(__first1, __last1, __first2); |
5023 | __glibcxx_requires_sorted_set(__first2, __last2, __first1); |
5024 | __glibcxx_requires_irreflexive2(__first1, __last1); |
5025 | __glibcxx_requires_irreflexive2(__first2, __last2); |
5026 | |
5027 | return _GLIBCXX_STD_Astd::__set_union(__first1, __last1, |
5028 | __first2, __last2, __result, |
5029 | __gnu_cxx::__ops::__iter_less_iter()); |
5030 | } |
5031 | |
5032 | /** |
5033 | * @brief Return the union of two sorted ranges using a comparison functor. |
5034 | * @ingroup set_algorithms |
5035 | * @param __first1 Start of first range. |
5036 | * @param __last1 End of first range. |
5037 | * @param __first2 Start of second range. |
5038 | * @param __last2 End of second range. |
5039 | * @param __comp The comparison functor. |
5040 | * @return End of the output range. |
5041 | * @ingroup set_algorithms |
5042 | * |
5043 | * This operation iterates over both ranges, copying elements present in |
5044 | * each range in order to the output range. Iterators increment for each |
5045 | * range. When the current element of one range is less than the other |
5046 | * according to @p __comp, that element is copied and the iterator advanced. |
5047 | * If an equivalent element according to @p __comp is contained in both |
5048 | * ranges, the element from the first range is copied and both ranges |
5049 | * advance. The output range may not overlap either input range. |
5050 | */ |
5051 | template<typename _InputIterator1, typename _InputIterator2, |
5052 | typename _OutputIterator, typename _Compare> |
5053 | inline _OutputIterator |
5054 | set_union(_InputIterator1 __first1, _InputIterator1 __last1, |
5055 | _InputIterator2 __first2, _InputIterator2 __last2, |
5056 | _OutputIterator __result, _Compare __comp) |
5057 | { |
5058 | // concept requirements |
5059 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
5060 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
5061 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5062 | typename iterator_traits<_InputIterator1>::value_type>) |
5063 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5064 | typename iterator_traits<_InputIterator2>::value_type>) |
5065 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
5066 | typename iterator_traits<_InputIterator1>::value_type, |
5067 | typename iterator_traits<_InputIterator2>::value_type>) |
5068 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
5069 | typename iterator_traits<_InputIterator2>::value_type, |
5070 | typename iterator_traits<_InputIterator1>::value_type>) |
5071 | __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); |
5072 | __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); |
5073 | __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp); |
5074 | __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp); |
5075 | |
5076 | return _GLIBCXX_STD_Astd::__set_union(__first1, __last1, |
5077 | __first2, __last2, __result, |
5078 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
5079 | } |
5080 | |
5081 | template<typename _InputIterator1, typename _InputIterator2, |
5082 | typename _OutputIterator, |
5083 | typename _Compare> |
5084 | _OutputIterator |
5085 | __set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, |
5086 | _InputIterator2 __first2, _InputIterator2 __last2, |
5087 | _OutputIterator __result, _Compare __comp) |
5088 | { |
5089 | while (__first1 != __last1 && __first2 != __last2) |
5090 | if (__comp(__first1, __first2)) |
5091 | ++__first1; |
5092 | else if (__comp(__first2, __first1)) |
5093 | ++__first2; |
5094 | else |
5095 | { |
5096 | *__result = *__first1; |
5097 | ++__first1; |
5098 | ++__first2; |
5099 | ++__result; |
5100 | } |
5101 | return __result; |
5102 | } |
5103 | |
5104 | /** |
5105 | * @brief Return the intersection of two sorted ranges. |
5106 | * @ingroup set_algorithms |
5107 | * @param __first1 Start of first range. |
5108 | * @param __last1 End of first range. |
5109 | * @param __first2 Start of second range. |
5110 | * @param __last2 End of second range. |
5111 | * @return End of the output range. |
5112 | * @ingroup set_algorithms |
5113 | * |
5114 | * This operation iterates over both ranges, copying elements present in |
5115 | * both ranges in order to the output range. Iterators increment for each |
5116 | * range. When the current element of one range is less than the other, |
5117 | * that iterator advances. If an element is contained in both ranges, the |
5118 | * element from the first range is copied and both ranges advance. The |
5119 | * output range may not overlap either input range. |
5120 | */ |
5121 | template<typename _InputIterator1, typename _InputIterator2, |
5122 | typename _OutputIterator> |
5123 | inline _OutputIterator |
5124 | set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, |
5125 | _InputIterator2 __first2, _InputIterator2 __last2, |
5126 | _OutputIterator __result) |
5127 | { |
5128 | // concept requirements |
5129 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
5130 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
5131 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5132 | typename iterator_traits<_InputIterator1>::value_type>) |
5133 | __glibcxx_function_requires(_LessThanOpConcept< |
5134 | typename iterator_traits<_InputIterator1>::value_type, |
5135 | typename iterator_traits<_InputIterator2>::value_type>) |
5136 | __glibcxx_function_requires(_LessThanOpConcept< |
5137 | typename iterator_traits<_InputIterator2>::value_type, |
5138 | typename iterator_traits<_InputIterator1>::value_type>) |
5139 | __glibcxx_requires_sorted_set(__first1, __last1, __first2); |
5140 | __glibcxx_requires_sorted_set(__first2, __last2, __first1); |
5141 | __glibcxx_requires_irreflexive2(__first1, __last1); |
5142 | __glibcxx_requires_irreflexive2(__first2, __last2); |
5143 | |
5144 | return _GLIBCXX_STD_Astd::__set_intersection(__first1, __last1, |
5145 | __first2, __last2, __result, |
5146 | __gnu_cxx::__ops::__iter_less_iter()); |
5147 | } |
5148 | |
5149 | /** |
5150 | * @brief Return the intersection of two sorted ranges using comparison |
5151 | * functor. |
5152 | * @ingroup set_algorithms |
5153 | * @param __first1 Start of first range. |
5154 | * @param __last1 End of first range. |
5155 | * @param __first2 Start of second range. |
5156 | * @param __last2 End of second range. |
5157 | * @param __comp The comparison functor. |
5158 | * @return End of the output range. |
5159 | * @ingroup set_algorithms |
5160 | * |
5161 | * This operation iterates over both ranges, copying elements present in |
5162 | * both ranges in order to the output range. Iterators increment for each |
5163 | * range. When the current element of one range is less than the other |
5164 | * according to @p __comp, that iterator advances. If an element is |
5165 | * contained in both ranges according to @p __comp, the element from the |
5166 | * first range is copied and both ranges advance. The output range may not |
5167 | * overlap either input range. |
5168 | */ |
5169 | template<typename _InputIterator1, typename _InputIterator2, |
5170 | typename _OutputIterator, typename _Compare> |
5171 | inline _OutputIterator |
5172 | set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, |
5173 | _InputIterator2 __first2, _InputIterator2 __last2, |
5174 | _OutputIterator __result, _Compare __comp) |
5175 | { |
5176 | // concept requirements |
5177 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
5178 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
5179 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5180 | typename iterator_traits<_InputIterator1>::value_type>) |
5181 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
5182 | typename iterator_traits<_InputIterator1>::value_type, |
5183 | typename iterator_traits<_InputIterator2>::value_type>) |
5184 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
5185 | typename iterator_traits<_InputIterator2>::value_type, |
5186 | typename iterator_traits<_InputIterator1>::value_type>) |
5187 | __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); |
5188 | __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); |
5189 | __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp); |
5190 | __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp); |
5191 | |
5192 | return _GLIBCXX_STD_Astd::__set_intersection(__first1, __last1, |
5193 | __first2, __last2, __result, |
5194 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
5195 | } |
5196 | |
5197 | template<typename _InputIterator1, typename _InputIterator2, |
5198 | typename _OutputIterator, |
5199 | typename _Compare> |
5200 | _OutputIterator |
5201 | __set_difference(_InputIterator1 __first1, _InputIterator1 __last1, |
5202 | _InputIterator2 __first2, _InputIterator2 __last2, |
5203 | _OutputIterator __result, _Compare __comp) |
5204 | { |
5205 | while (__first1 != __last1 && __first2 != __last2) |
5206 | if (__comp(__first1, __first2)) |
5207 | { |
5208 | *__result = *__first1; |
5209 | ++__first1; |
5210 | ++__result; |
5211 | } |
5212 | else if (__comp(__first2, __first1)) |
5213 | ++__first2; |
5214 | else |
5215 | { |
5216 | ++__first1; |
5217 | ++__first2; |
5218 | } |
5219 | return std::copy(__first1, __last1, __result); |
5220 | } |
5221 | |
5222 | /** |
5223 | * @brief Return the difference of two sorted ranges. |
5224 | * @ingroup set_algorithms |
5225 | * @param __first1 Start of first range. |
5226 | * @param __last1 End of first range. |
5227 | * @param __first2 Start of second range. |
5228 | * @param __last2 End of second range. |
5229 | * @return End of the output range. |
5230 | * @ingroup set_algorithms |
5231 | * |
5232 | * This operation iterates over both ranges, copying elements present in |
5233 | * the first range but not the second in order to the output range. |
5234 | * Iterators increment for each range. When the current element of the |
5235 | * first range is less than the second, that element is copied and the |
5236 | * iterator advances. If the current element of the second range is less, |
5237 | * the iterator advances, but no element is copied. If an element is |
5238 | * contained in both ranges, no elements are copied and both ranges |
5239 | * advance. The output range may not overlap either input range. |
5240 | */ |
5241 | template<typename _InputIterator1, typename _InputIterator2, |
5242 | typename _OutputIterator> |
5243 | inline _OutputIterator |
5244 | set_difference(_InputIterator1 __first1, _InputIterator1 __last1, |
5245 | _InputIterator2 __first2, _InputIterator2 __last2, |
5246 | _OutputIterator __result) |
5247 | { |
5248 | // concept requirements |
5249 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
5250 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
5251 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5252 | typename iterator_traits<_InputIterator1>::value_type>) |
5253 | __glibcxx_function_requires(_LessThanOpConcept< |
5254 | typename iterator_traits<_InputIterator1>::value_type, |
5255 | typename iterator_traits<_InputIterator2>::value_type>) |
5256 | __glibcxx_function_requires(_LessThanOpConcept< |
5257 | typename iterator_traits<_InputIterator2>::value_type, |
5258 | typename iterator_traits<_InputIterator1>::value_type>) |
5259 | __glibcxx_requires_sorted_set(__first1, __last1, __first2); |
5260 | __glibcxx_requires_sorted_set(__first2, __last2, __first1); |
5261 | __glibcxx_requires_irreflexive2(__first1, __last1); |
5262 | __glibcxx_requires_irreflexive2(__first2, __last2); |
5263 | |
5264 | return _GLIBCXX_STD_Astd::__set_difference(__first1, __last1, |
5265 | __first2, __last2, __result, |
5266 | __gnu_cxx::__ops::__iter_less_iter()); |
5267 | } |
5268 | |
5269 | /** |
5270 | * @brief Return the difference of two sorted ranges using comparison |
5271 | * functor. |
5272 | * @ingroup set_algorithms |
5273 | * @param __first1 Start of first range. |
5274 | * @param __last1 End of first range. |
5275 | * @param __first2 Start of second range. |
5276 | * @param __last2 End of second range. |
5277 | * @param __comp The comparison functor. |
5278 | * @return End of the output range. |
5279 | * @ingroup set_algorithms |
5280 | * |
5281 | * This operation iterates over both ranges, copying elements present in |
5282 | * the first range but not the second in order to the output range. |
5283 | * Iterators increment for each range. When the current element of the |
5284 | * first range is less than the second according to @p __comp, that element |
5285 | * is copied and the iterator advances. If the current element of the |
5286 | * second range is less, no element is copied and the iterator advances. |
5287 | * If an element is contained in both ranges according to @p __comp, no |
5288 | * elements are copied and both ranges advance. The output range may not |
5289 | * overlap either input range. |
5290 | */ |
5291 | template<typename _InputIterator1, typename _InputIterator2, |
5292 | typename _OutputIterator, typename _Compare> |
5293 | inline _OutputIterator |
5294 | set_difference(_InputIterator1 __first1, _InputIterator1 __last1, |
5295 | _InputIterator2 __first2, _InputIterator2 __last2, |
5296 | _OutputIterator __result, _Compare __comp) |
5297 | { |
5298 | // concept requirements |
5299 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
5300 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
5301 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5302 | typename iterator_traits<_InputIterator1>::value_type>) |
5303 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
5304 | typename iterator_traits<_InputIterator1>::value_type, |
5305 | typename iterator_traits<_InputIterator2>::value_type>) |
5306 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
5307 | typename iterator_traits<_InputIterator2>::value_type, |
5308 | typename iterator_traits<_InputIterator1>::value_type>) |
5309 | __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); |
5310 | __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); |
5311 | __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp); |
5312 | __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp); |
5313 | |
5314 | return _GLIBCXX_STD_Astd::__set_difference(__first1, __last1, |
5315 | __first2, __last2, __result, |
5316 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
5317 | } |
5318 | |
5319 | template<typename _InputIterator1, typename _InputIterator2, |
5320 | typename _OutputIterator, |
5321 | typename _Compare> |
5322 | _OutputIterator |
5323 | __set_symmetric_difference(_InputIterator1 __first1, |
5324 | _InputIterator1 __last1, |
5325 | _InputIterator2 __first2, |
5326 | _InputIterator2 __last2, |
5327 | _OutputIterator __result, |
5328 | _Compare __comp) |
5329 | { |
5330 | while (__first1 != __last1 && __first2 != __last2) |
5331 | if (__comp(__first1, __first2)) |
5332 | { |
5333 | *__result = *__first1; |
5334 | ++__first1; |
5335 | ++__result; |
5336 | } |
5337 | else if (__comp(__first2, __first1)) |
5338 | { |
5339 | *__result = *__first2; |
5340 | ++__first2; |
5341 | ++__result; |
5342 | } |
5343 | else |
5344 | { |
5345 | ++__first1; |
5346 | ++__first2; |
5347 | } |
5348 | return std::copy(__first2, __last2, |
5349 | std::copy(__first1, __last1, __result)); |
5350 | } |
5351 | |
5352 | /** |
5353 | * @brief Return the symmetric difference of two sorted ranges. |
5354 | * @ingroup set_algorithms |
5355 | * @param __first1 Start of first range. |
5356 | * @param __last1 End of first range. |
5357 | * @param __first2 Start of second range. |
5358 | * @param __last2 End of second range. |
5359 | * @return End of the output range. |
5360 | * @ingroup set_algorithms |
5361 | * |
5362 | * This operation iterates over both ranges, copying elements present in |
5363 | * one range but not the other in order to the output range. Iterators |
5364 | * increment for each range. When the current element of one range is less |
5365 | * than the other, that element is copied and the iterator advances. If an |
5366 | * element is contained in both ranges, no elements are copied and both |
5367 | * ranges advance. The output range may not overlap either input range. |
5368 | */ |
5369 | template<typename _InputIterator1, typename _InputIterator2, |
5370 | typename _OutputIterator> |
5371 | inline _OutputIterator |
5372 | set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, |
5373 | _InputIterator2 __first2, _InputIterator2 __last2, |
5374 | _OutputIterator __result) |
5375 | { |
5376 | // concept requirements |
5377 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
5378 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
5379 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5380 | typename iterator_traits<_InputIterator1>::value_type>) |
5381 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5382 | typename iterator_traits<_InputIterator2>::value_type>) |
5383 | __glibcxx_function_requires(_LessThanOpConcept< |
5384 | typename iterator_traits<_InputIterator1>::value_type, |
5385 | typename iterator_traits<_InputIterator2>::value_type>) |
5386 | __glibcxx_function_requires(_LessThanOpConcept< |
5387 | typename iterator_traits<_InputIterator2>::value_type, |
5388 | typename iterator_traits<_InputIterator1>::value_type>) |
5389 | __glibcxx_requires_sorted_set(__first1, __last1, __first2); |
5390 | __glibcxx_requires_sorted_set(__first2, __last2, __first1); |
5391 | __glibcxx_requires_irreflexive2(__first1, __last1); |
5392 | __glibcxx_requires_irreflexive2(__first2, __last2); |
5393 | |
5394 | return _GLIBCXX_STD_Astd::__set_symmetric_difference(__first1, __last1, |
5395 | __first2, __last2, __result, |
5396 | __gnu_cxx::__ops::__iter_less_iter()); |
5397 | } |
5398 | |
5399 | /** |
5400 | * @brief Return the symmetric difference of two sorted ranges using |
5401 | * comparison functor. |
5402 | * @ingroup set_algorithms |
5403 | * @param __first1 Start of first range. |
5404 | * @param __last1 End of first range. |
5405 | * @param __first2 Start of second range. |
5406 | * @param __last2 End of second range. |
5407 | * @param __comp The comparison functor. |
5408 | * @return End of the output range. |
5409 | * @ingroup set_algorithms |
5410 | * |
5411 | * This operation iterates over both ranges, copying elements present in |
5412 | * one range but not the other in order to the output range. Iterators |
5413 | * increment for each range. When the current element of one range is less |
5414 | * than the other according to @p comp, that element is copied and the |
5415 | * iterator advances. If an element is contained in both ranges according |
5416 | * to @p __comp, no elements are copied and both ranges advance. The output |
5417 | * range may not overlap either input range. |
5418 | */ |
5419 | template<typename _InputIterator1, typename _InputIterator2, |
5420 | typename _OutputIterator, typename _Compare> |
5421 | inline _OutputIterator |
5422 | set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, |
5423 | _InputIterator2 __first2, _InputIterator2 __last2, |
5424 | _OutputIterator __result, |
5425 | _Compare __comp) |
5426 | { |
5427 | // concept requirements |
5428 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) |
5429 | __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) |
5430 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5431 | typename iterator_traits<_InputIterator1>::value_type>) |
5432 | __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, |
5433 | typename iterator_traits<_InputIterator2>::value_type>) |
5434 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
5435 | typename iterator_traits<_InputIterator1>::value_type, |
5436 | typename iterator_traits<_InputIterator2>::value_type>) |
5437 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
5438 | typename iterator_traits<_InputIterator2>::value_type, |
5439 | typename iterator_traits<_InputIterator1>::value_type>) |
5440 | __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); |
5441 | __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); |
5442 | __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp); |
5443 | __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp); |
5444 | |
5445 | return _GLIBCXX_STD_Astd::__set_symmetric_difference(__first1, __last1, |
5446 | __first2, __last2, __result, |
5447 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
5448 | } |
5449 | |
5450 | template<typename _ForwardIterator, typename _Compare> |
5451 | _GLIBCXX14_CONSTEXPR |
5452 | _ForwardIterator |
5453 | __min_element(_ForwardIterator __first, _ForwardIterator __last, |
5454 | _Compare __comp) |
5455 | { |
5456 | if (__first == __last) |
5457 | return __first; |
5458 | _ForwardIterator __result = __first; |
5459 | while (++__first != __last) |
5460 | if (__comp(__first, __result)) |
5461 | __result = __first; |
5462 | return __result; |
5463 | } |
5464 | |
5465 | /** |
5466 | * @brief Return the minimum element in a range. |
5467 | * @ingroup sorting_algorithms |
5468 | * @param __first Start of range. |
5469 | * @param __last End of range. |
5470 | * @return Iterator referencing the first instance of the smallest value. |
5471 | */ |
5472 | template<typename _ForwardIterator> |
5473 | _GLIBCXX14_CONSTEXPR |
5474 | _ForwardIterator |
5475 | inline min_element(_ForwardIterator __first, _ForwardIterator __last) |
5476 | { |
5477 | // concept requirements |
5478 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
5479 | __glibcxx_function_requires(_LessThanComparableConcept< |
5480 | typename iterator_traits<_ForwardIterator>::value_type>) |
5481 | __glibcxx_requires_valid_range(__first, __last); |
5482 | __glibcxx_requires_irreflexive(__first, __last); |
5483 | |
5484 | return _GLIBCXX_STD_Astd::__min_element(__first, __last, |
5485 | __gnu_cxx::__ops::__iter_less_iter()); |
5486 | } |
5487 | |
5488 | /** |
5489 | * @brief Return the minimum element in a range using comparison functor. |
5490 | * @ingroup sorting_algorithms |
5491 | * @param __first Start of range. |
5492 | * @param __last End of range. |
5493 | * @param __comp Comparison functor. |
5494 | * @return Iterator referencing the first instance of the smallest value |
5495 | * according to __comp. |
5496 | */ |
5497 | template<typename _ForwardIterator, typename _Compare> |
5498 | _GLIBCXX14_CONSTEXPR |
5499 | inline _ForwardIterator |
5500 | min_element(_ForwardIterator __first, _ForwardIterator __last, |
5501 | _Compare __comp) |
5502 | { |
5503 | // concept requirements |
5504 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
5505 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
5506 | typename iterator_traits<_ForwardIterator>::value_type, |
5507 | typename iterator_traits<_ForwardIterator>::value_type>) |
5508 | __glibcxx_requires_valid_range(__first, __last); |
5509 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
5510 | |
5511 | return _GLIBCXX_STD_Astd::__min_element(__first, __last, |
5512 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
5513 | } |
5514 | |
5515 | template<typename _ForwardIterator, typename _Compare> |
5516 | _GLIBCXX14_CONSTEXPR |
5517 | _ForwardIterator |
5518 | __max_element(_ForwardIterator __first, _ForwardIterator __last, |
5519 | _Compare __comp) |
5520 | { |
5521 | if (__first == __last) return __first; |
5522 | _ForwardIterator __result = __first; |
5523 | while (++__first != __last) |
5524 | if (__comp(__result, __first)) |
5525 | __result = __first; |
5526 | return __result; |
5527 | } |
5528 | |
5529 | /** |
5530 | * @brief Return the maximum element in a range. |
5531 | * @ingroup sorting_algorithms |
5532 | * @param __first Start of range. |
5533 | * @param __last End of range. |
5534 | * @return Iterator referencing the first instance of the largest value. |
5535 | */ |
5536 | template<typename _ForwardIterator> |
5537 | _GLIBCXX14_CONSTEXPR |
5538 | inline _ForwardIterator |
5539 | max_element(_ForwardIterator __first, _ForwardIterator __last) |
5540 | { |
5541 | // concept requirements |
5542 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
5543 | __glibcxx_function_requires(_LessThanComparableConcept< |
5544 | typename iterator_traits<_ForwardIterator>::value_type>) |
5545 | __glibcxx_requires_valid_range(__first, __last); |
5546 | __glibcxx_requires_irreflexive(__first, __last); |
5547 | |
5548 | return _GLIBCXX_STD_Astd::__max_element(__first, __last, |
5549 | __gnu_cxx::__ops::__iter_less_iter()); |
5550 | } |
5551 | |
5552 | /** |
5553 | * @brief Return the maximum element in a range using comparison functor. |
5554 | * @ingroup sorting_algorithms |
5555 | * @param __first Start of range. |
5556 | * @param __last End of range. |
5557 | * @param __comp Comparison functor. |
5558 | * @return Iterator referencing the first instance of the largest value |
5559 | * according to __comp. |
5560 | */ |
5561 | template<typename _ForwardIterator, typename _Compare> |
5562 | _GLIBCXX14_CONSTEXPR |
5563 | inline _ForwardIterator |
5564 | max_element(_ForwardIterator __first, _ForwardIterator __last, |
5565 | _Compare __comp) |
5566 | { |
5567 | // concept requirements |
5568 | __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) |
5569 | __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, |
5570 | typename iterator_traits<_ForwardIterator>::value_type, |
5571 | typename iterator_traits<_ForwardIterator>::value_type>) |
5572 | __glibcxx_requires_valid_range(__first, __last); |
5573 | __glibcxx_requires_irreflexive_pred(__first, __last, __comp); |
5574 | |
5575 | return _GLIBCXX_STD_Astd::__max_element(__first, __last, |
5576 | __gnu_cxx::__ops::__iter_comp_iter(__comp)); |
5577 | } |
5578 | |
5579 | _GLIBCXX_END_NAMESPACE_ALGO |
5580 | } // namespace std |
5581 | |
5582 | #endif /* _STL_ALGO_H */ |