Bug Summary

File:tools/llvm-objdump/llvm-objdump.cpp
Warning:line 2309, column 23
Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

clang -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name llvm-objdump.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -mrelocation-model pic -pic-level 2 -mthread-model posix -fmath-errno -masm-verbose -mconstructor-aliases -munwind-tables -fuse-init-array -target-cpu x86-64 -dwarf-column-info -debugger-tuning=gdb -momit-leaf-frame-pointer -ffunction-sections -fdata-sections -resource-dir /usr/lib/llvm-8/lib/clang/8.0.0 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-8~svn345461/build-llvm/tools/llvm-objdump -I /build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump -I /build/llvm-toolchain-snapshot-8~svn345461/build-llvm/include -I /build/llvm-toolchain-snapshot-8~svn345461/include -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/x86_64-linux-gnu/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/x86_64-linux-gnu/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/c++/6.3.0/backward -internal-isystem /usr/include/clang/8.0.0/include/ -internal-isystem /usr/local/include -internal-isystem /usr/lib/llvm-8/lib/clang/8.0.0/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-maybe-uninitialized -Wno-comment -std=c++11 -fdeprecated-macro -fdebug-compilation-dir /build/llvm-toolchain-snapshot-8~svn345461/build-llvm/tools/llvm-objdump -ferror-limit 19 -fmessage-length 0 -fvisibility-inlines-hidden -fobjc-runtime=gcc -fdiagnostics-show-option -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -o /tmp/scan-build-2018-10-27-211344-32123-1 -x c++ /build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp -faddrsig

/build/llvm-toolchain-snapshot-8~svn345461/tools/llvm-objdump/llvm-objdump.cpp

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
70using namespace llvm;
71using namespace object;
72
73cl::opt<bool>
74 llvm::AllHeaders("all-headers",
75 cl::desc("Display all available header information"));
76static cl::alias AllHeadersShort("x", cl::desc("Alias for --all-headers"),
77 cl::aliasopt(AllHeaders));
78
79static cl::list<std::string>
80InputFilenames(cl::Positional, cl::desc("<input object files>"),cl::ZeroOrMore);
81
82cl::opt<bool>
83llvm::Disassemble("disassemble",
84 cl::desc("Display assembler mnemonics for the machine instructions"));
85static cl::alias
86Disassembled("d", cl::desc("Alias for --disassemble"),
87 cl::aliasopt(Disassemble));
88
89cl::opt<bool>
90llvm::DisassembleAll("disassemble-all",
91 cl::desc("Display assembler mnemonics for the machine instructions"));
92static cl::alias
93DisassembleAlld("D", cl::desc("Alias for --disassemble-all"),
94 cl::aliasopt(DisassembleAll));
95
96cl::opt<bool> llvm::Demangle("demangle", cl::desc("Demangle symbols names"),
97 cl::init(false));
98
99static cl::alias DemangleShort("C", cl::desc("Alias for --demangle"),
100 cl::aliasopt(llvm::Demangle));
101
102static cl::list<std::string>
103DisassembleFunctions("df",
104 cl::CommaSeparated,
105 cl::desc("List of functions to disassemble"));
106static StringSet<> DisasmFuncsSet;
107
108cl::opt<bool>
109llvm::Relocations("r", cl::desc("Display the relocation entries in the file"));
110
111cl::opt<bool>
112llvm::DynamicRelocations("dynamic-reloc",
113 cl::desc("Display the dynamic relocation entries in the file"));
114static cl::alias
115DynamicRelocationsd("R", cl::desc("Alias for --dynamic-reloc"),
116 cl::aliasopt(DynamicRelocations));
117
118cl::opt<bool>
119llvm::SectionContents("s", cl::desc("Display the content of each section"));
120
121cl::opt<bool>
122llvm::SymbolTable("t", cl::desc("Display the symbol table"));
123
124cl::opt<bool>
125llvm::ExportsTrie("exports-trie", cl::desc("Display mach-o exported symbols"));
126
127cl::opt<bool>
128llvm::Rebase("rebase", cl::desc("Display mach-o rebasing info"));
129
130cl::opt<bool>
131llvm::Bind("bind", cl::desc("Display mach-o binding info"));
132
133cl::opt<bool>
134llvm::LazyBind("lazy-bind", cl::desc("Display mach-o lazy binding info"));
135
136cl::opt<bool>
137llvm::WeakBind("weak-bind", cl::desc("Display mach-o weak binding info"));
138
139cl::opt<bool>
140llvm::RawClangAST("raw-clang-ast",
141 cl::desc("Dump the raw binary contents of the clang AST section"));
142
143static cl::opt<bool>
144MachOOpt("macho", cl::desc("Use MachO specific object file parser"));
145static cl::alias
146MachOm("m", cl::desc("Alias for --macho"), cl::aliasopt(MachOOpt));
147
148cl::opt<std::string>
149llvm::TripleName("triple", cl::desc("Target triple to disassemble for, "
150 "see -version for available targets"));
151
152cl::opt<std::string>
153llvm::MCPU("mcpu",
154 cl::desc("Target a specific cpu type (-mcpu=help for details)"),
155 cl::value_desc("cpu-name"),
156 cl::init(""));
157
158cl::opt<std::string>
159llvm::ArchName("arch-name", cl::desc("Target arch to disassemble for, "
160 "see -version for available targets"));
161
162cl::opt<bool>
163llvm::SectionHeaders("section-headers", cl::desc("Display summaries of the "
164 "headers for each section."));
165static cl::alias
166SectionHeadersShort("headers", cl::desc("Alias for --section-headers"),
167 cl::aliasopt(SectionHeaders));
168static cl::alias
169SectionHeadersShorter("h", cl::desc("Alias for --section-headers"),
170 cl::aliasopt(SectionHeaders));
171
172cl::list<std::string>
173llvm::FilterSections("section", cl::desc("Operate on the specified sections only. "
174 "With -macho dump segment,section"));
175cl::alias
176static FilterSectionsj("j", cl::desc("Alias for --section"),
177 cl::aliasopt(llvm::FilterSections));
178
179cl::list<std::string>
180llvm::MAttrs("mattr",
181 cl::CommaSeparated,
182 cl::desc("Target specific attributes"),
183 cl::value_desc("a1,+a2,-a3,..."));
184
185cl::opt<bool>
186llvm::NoShowRawInsn("no-show-raw-insn", cl::desc("When disassembling "
187 "instructions, do not print "
188 "the instruction bytes."));
189cl::opt<bool>
190llvm::NoLeadingAddr("no-leading-addr", cl::desc("Print no leading address"));
191
192cl::opt<bool>
193llvm::UnwindInfo("unwind-info", cl::desc("Display unwind information"));
194
195static cl::alias
196UnwindInfoShort("u", cl::desc("Alias for --unwind-info"),
197 cl::aliasopt(UnwindInfo));
198
199cl::opt<bool>
200llvm::PrivateHeaders("private-headers",
201 cl::desc("Display format specific file headers"));
202
203cl::opt<bool>
204llvm::FirstPrivateHeader("private-header",
205 cl::desc("Display only the first format specific file "
206 "header"));
207
208static cl::alias
209PrivateHeadersShort("p", cl::desc("Alias for --private-headers"),
210 cl::aliasopt(PrivateHeaders));
211
212cl::opt<bool> llvm::FileHeaders(
213 "file-headers",
214 cl::desc("Display the contents of the overall file header"));
215
216static cl::alias FileHeadersShort("f", cl::desc("Alias for --file-headers"),
217 cl::aliasopt(FileHeaders));
218
219cl::opt<bool>
220 llvm::ArchiveHeaders("archive-headers",
221 cl::desc("Display archive header information"));
222
223cl::alias
224ArchiveHeadersShort("a", cl::desc("Alias for --archive-headers"),
225 cl::aliasopt(ArchiveHeaders));
226
227cl::opt<bool>
228 llvm::PrintImmHex("print-imm-hex",
229 cl::desc("Use hex format for immediate values"));
230
231cl::opt<bool> PrintFaultMaps("fault-map-section",
232 cl::desc("Display contents of faultmap section"));
233
234cl::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
238cl::opt<bool> PrintSource(
239 "source",
240 cl::desc(
241 "Display source inlined with disassembly. Implies disassemble object"));
242
243cl::alias PrintSourceShort("S", cl::desc("Alias for -source"),
244 cl::aliasopt(PrintSource));
245
246cl::opt<bool> PrintLines("line-numbers",
247 cl::desc("Display source line numbers with "
248 "disassembly. Implies disassemble object"));
249
250cl::alias PrintLinesShort("l", cl::desc("Alias for -line-numbers"),
251 cl::aliasopt(PrintLines));
252
253cl::opt<unsigned long long>
254 StartAddress("start-address", cl::desc("Disassemble beginning at address"),
255 cl::value_desc("address"), cl::init(0));
256cl::opt<unsigned long long>
257 StopAddress("stop-address", cl::desc("Stop disassembly at address"),
258 cl::value_desc("address"), cl::init(UINT64_MAX(18446744073709551615UL)));
259static StringRef ToolName;
260
261typedef std::vector<std::tuple<uint64_t, StringRef, uint8_t>> SectionSymbolsTy;
262
263namespace {
264typedef std::function<bool(llvm::object::SectionRef const &)> FilterPredicate;
265
266class SectionFilterIterator {
267public:
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
284private:
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
295class SectionFilter {
296public:
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
308private:
309 FilterPredicate Predicate;
310 llvm::object::ObjectFile const &Object;
311};
312SectionFilter 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
327void 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
336LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) void llvm::error(Twine Message) {
337 errs() << ToolName << ": " << Message << ".\n";
338 errs().flush();
339 exit(1);
340}
341
342void llvm::warn(StringRef Message) {
343 errs() << ToolName << ": warning: " << Message << ".\n";
344 errs().flush();
345}
346
347LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) void llvm::report_error(StringRef File,
348 Twine Message) {
349 errs() << ToolName << ": '" << File << "': " << Message << ".\n";
350 exit(1);
351}
352
353LLVM_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
360LLVM_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
371LLVM_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
391LLVM_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
407static 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
442bool llvm::RelocAddressLess(RelocationRef a, RelocationRef b) {
443 return a.getOffset() < b.getOffset();
444}
445
446template <class ELFT>
447static 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
528static 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
541static 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
553static 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
633static 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
657static 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
835static 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.
852static 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
882namespace {
883class SourcePrinter {
884protected:
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
893private:
894 bool cacheSource(const DILineInfo& LineInfoFile);
895
896public:
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
909bool 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
935void 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
972static 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
981class PrettyPrinter {
982public:
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};
1003PrettyPrinter PrettyPrinterInst;
1004class HexagonPrettyPrinter : public PrettyPrinter {
1005public:
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};
1089HexagonPrettyPrinter HexagonPrettyPrinterInst;
1090
1091class AMDGCNPrettyPrinter : public PrettyPrinter {
1092public:
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};
1141AMDGCNPrettyPrinter AMDGCNPrettyPrinterInst;
1142
1143class BPFPrettyPrinter : public PrettyPrinter {
1144public:
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};
1163BPFPrettyPrinter BPFPrettyPrinterInst;
1164
1165PrettyPrinter &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
1180static 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
1193template <class ELFT> static void
1194addDynamicElfSymbols(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
1223static void
1224addDynamicElfSymbols(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
1239static 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
1270static 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
1822void 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
1852void 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
1887void 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
1906void 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
1953void 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
2053static 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
2068void 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
2079void 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
2090void 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
2101void 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
2112void 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.
2125void 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
2156static 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
2196static 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
2214static 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
2231static 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
2295static void DumpObject(ObjectFile *o, const Archive *a = nullptr,
2296 const Archive::Child *c = nullptr) {
2297 StringRef ArchiveName = a != nullptr ? a->getFileName() : "";
21
'?' condition is false
2298 // Avoid other output when using a raw option.
2299 if (!RawClangAST) {
22
Assuming the condition is false
23
Taking false branch
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)
24
Assuming the condition is true
25
Assuming the condition is true
26
Taking true branch
2309 printArchiveChild(a->getFileName(), *c);
27
Called C++ object pointer is null
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
2351static 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;
2369static 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.
2390static 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) {
14
Assuming the condition is false
15
Taking false branch
2396 ParseInputMachO(file);
2397 return;
2398 }
2399
2400 // Attempt to open the binary.
2401 Expected<OwningBinary<Binary>> BinaryOrErr = createBinary(file);
2402 if (!BinaryOrErr)
16
Taking false branch
2403 report_error(file, BinaryOrErr.takeError());
2404 Binary &Binary = *BinaryOrErr.get().getBinary();
2405
2406 if (Archive *a = dyn_cast<Archive>(&Binary))
17
Taking false branch
2407 DumpArchive(a);
2408 else if (ObjectFile *o = dyn_cast<ObjectFile>(&Binary))
18
Taking true branch
2409 DumpObject(o);
19
Passing null pointer value via 2nd parameter 'a'
20
Calling 'DumpObject'
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
2416int 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)
1
Assuming the condition is false
2
Taking false branch
2433 InputFilenames.push_back("a.out");
2434
2435 if (AllHeaders)
3
Assuming the condition is false
4
Taking false branch
2436 PrivateHeaders = Relocations = SectionHeaders = SymbolTable = true;
2437
2438 if (DisassembleAll || PrintSource || PrintLines)
5
Assuming the condition is false
6
Assuming the condition is false
7
Assuming the condition is false
8
Taking false branch
2439 Disassemble = true;
2440
2441 if (!Disassemble
9
Assuming the condition is false
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);
10
Calling 'for_each<llvm::cl::list<std::__cxx11::basic_string<char>, bool, llvm::cl::parser<std::string> > &, void (*)(llvm::StringRef)>'
2477
2478 return EXIT_SUCCESS0;
2479}

/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/ADT/STLExtras.h

1//===- llvm/ADT/STLExtras.h - Useful STL related functions ------*- C++ -*-===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file contains some templates that are useful if you are working with the
11// STL at all.
12//
13// No library is required when using these functions.
14//
15//===----------------------------------------------------------------------===//
16
17#ifndef LLVM_ADT_STLEXTRAS_H
18#define LLVM_ADT_STLEXTRAS_H
19
20#include "llvm/ADT/Optional.h"
21#include "llvm/ADT/SmallVector.h"
22#include "llvm/ADT/iterator.h"
23#include "llvm/ADT/iterator_range.h"
24#include "llvm/Config/abi-breaking.h"
25#include "llvm/Support/ErrorHandling.h"
26#include <algorithm>
27#include <cassert>
28#include <cstddef>
29#include <cstdint>
30#include <cstdlib>
31#include <functional>
32#include <initializer_list>
33#include <iterator>
34#include <limits>
35#include <memory>
36#include <tuple>
37#include <type_traits>
38#include <utility>
39
40#ifdef EXPENSIVE_CHECKS
41#include <random> // for std::mt19937
42#endif
43
44namespace 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.
48template <typename T, T> struct SameType;
49
50namespace detail {
51
52template <typename RangeT>
53using IterOfRange = decltype(std::begin(std::declval<RangeT &>()));
54
55template <typename RangeT>
56using 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
65template <typename T>
66struct negation : std::integral_constant<bool, !bool(T::value)> {};
67
68template <typename...> struct conjunction : std::true_type {};
69template <typename B1> struct conjunction<B1> : B1 {};
70template <typename B1, typename... Bn>
71struct conjunction<B1, Bn...>
72 : std::conditional<bool(B1::value), conjunction<Bn...>, B1>::type {};
73
74//===----------------------------------------------------------------------===//
75// Extra additions to <functional>
76//===----------------------------------------------------------------------===//
77
78template <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
89template <class Ty> struct less_ptr {
90 bool operator()(const Ty* left, const Ty* right) const {
91 return *left < *right;
92 }
93};
94
95template <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.
107template<typename Fn> class function_ref;
108
109template<typename Ret, typename ...Params>
110class 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
120public:
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>);
143template <class T>
144inline void deleter(T *Ptr) {
145 delete Ptr;
146}
147
148//===----------------------------------------------------------------------===//
149// Extra additions to <iterator>
150//===----------------------------------------------------------------------===//
151
152namespace adl_detail {
153
154using std::begin;
155
156template <typename ContainerTy>
157auto adl_begin(ContainerTy &&container)
158 -> decltype(begin(std::forward<ContainerTy>(container))) {
159 return begin(std::forward<ContainerTy>(container));
160}
161
162using std::end;
163
164template <typename ContainerTy>
165auto adl_end(ContainerTy &&container)
166 -> decltype(end(std::forward<ContainerTy>(container))) {
167 return end(std::forward<ContainerTy>(container));
168}
169
170using std::swap;
171
172template <typename T>
173void 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
180template <typename ContainerTy>
181auto 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
186template <typename ContainerTy>
187auto 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
192template <typename T>
193void 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
201template <typename ItTy, typename FuncTy,
202 typename FuncReturnTy =
203 decltype(std::declval<FuncTy>()(*std::declval<ItTy>()))>
204class 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> {
209public:
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
217private:
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...
223template <class ItTy, class FuncTy>
224inline 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().
229template <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
239public:
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().
244template <typename Ty>
245struct 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.
250template <typename ContainerTy>
251auto 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.
258template <typename IteratorTy>
259std::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.
266template <typename ContainerTy>
267auto 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.
292template <typename WrappedIteratorT, typename PredicateT, typename IterTag>
293class 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
307protected:
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
325public:
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.
336template <typename WrappedIteratorT, typename PredicateT,
337 typename IterTag = std::forward_iterator_tag>
338class filter_iterator_impl
339 : public filter_iterator_base<WrappedIteratorT, PredicateT, IterTag> {
340 using BaseT = filter_iterator_base<WrappedIteratorT, PredicateT, IterTag>;
341
342public:
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.
349template <typename WrappedIteratorT, typename PredicateT>
350class 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
361public:
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
375namespace detail {
376
377template <bool is_bidirectional> struct fwd_or_bidi_tag_impl {
378 using type = std::forward_iterator_tag;
379};
380
381template <> 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.
388template <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.
398template <typename WrappedIteratorT, typename PredicateT>
399using 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.
410template <typename RangeT, typename PredicateT>
411iterator_range<filter_iterator<detail::IterOfRange<RangeT>, PredicateT>>
412make_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.
439template <typename WrappedIteratorT>
440class 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
449protected:
450#if LLVM_ENABLE_ABI_BREAKING_CHECKS1
451 bool IsEarlyIncremented = false;
452#endif
453
454public:
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.
496template <typename RangeT>
497iterator_range<early_inc_iterator_impl<detail::IterOfRange<RangeT>>>
498make_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
506template <typename R, typename UnaryPredicate>
507bool all_of(R &&range, UnaryPredicate P);
508
509template <size_t... I> struct index_sequence;
510
511template <class... Ts> struct index_sequence_for;
512
513namespace detail {
514
515using 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.
519template<typename... Iters> struct ZipTupleType {
520 using type = std::tuple<decltype(*declval<Iters>())...>;
521};
522
523template <typename ZipType, typename... Iters>
524using 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
539template <typename ZipType, typename... Iters>
540struct 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
546protected:
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
561public:
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
583template <typename... Iters>
584struct 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
594template <typename... Iters>
595class 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
603public:
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
613template <template <typename...> class ItType, typename... Args> class zippy {
614public:
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
622private:
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
632public:
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.
642template <typename T, typename U, typename... Args>
643detail::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.
651template <typename T, typename U, typename... Args>
652detail::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.
668template <typename ValueT, typename... IterTs>
669class 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
742public:
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
765namespace 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.
772template <typename ValueT, typename... RangeTs> class concat_range {
773public:
774 using iterator =
775 concat_iterator<ValueT,
776 decltype(std::begin(std::declval<RangeTs &>()))...>;
777
778private:
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
789public:
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.
802template <typename ValueT, typename... RangeTs>
803detail::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.
816struct 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.
824struct 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.
832template<typename FuncTy>
833struct 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.
846template <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.
853template <size_t... I>
854struct index_sequence : integer_sequence<std::size_t, I...> {};
855
856template <std::size_t N, std::size_t... I>
857struct build_index_impl : build_index_impl<N - 1, N - 1, I...> {};
858template <std::size_t... I>
859struct build_index_impl<0, I...> : index_sequence<I...> {};
860
861/// Creates a compile-time integer sequence for a parameter pack.
862template <class... Ts>
863struct 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.
867template <int N> struct rank : rank<N - 1> {};
868template <> 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.
872template <typename T, typename... Ts> struct is_one_of {
873 static const bool value = false;
874};
875
876template <typename T, typename U, typename... Ts>
877struct 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.
884template <typename T, typename... Ts> struct are_base_of {
885 static const bool value = true;
886};
887
888template <typename T, typename U, typename... Ts>
889struct 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.
899template <class T, std::size_t N>
900constexpr inline size_t array_lengthof(T (&)[N]) {
901 return N;
902}
903
904/// Adapt std::less<T> for array_pod_sort.
905template<typename T>
906inline 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.
918template<typename T>
919inline 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.
938template<class IteratorTy>
939inline 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
951template <class IteratorTy>
952inline 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).
971template <typename IteratorTy>
972inline 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
980template <typename Container> inline void sort(Container &&C) {
981 llvm::sort(adl_begin(C), adl_end(C));
982}
983
984template <typename IteratorTy, typename Compare>
985inline 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
993template <typename Container, typename Compare>
994inline 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.
1004template<typename Container>
1005void 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.
1013template<typename Container>
1014void 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).
1022template <typename R>
1023auto 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.
1034template <typename R, typename UnaryPredicate>
1035UnaryPredicate for_each(R &&Range, UnaryPredicate P) {
1036 return std::for_each(adl_begin(Range), adl_end(Range), P);
11
Calling 'for_each<__gnu_cxx::__normal_iterator<std::__cxx11::basic_string<char> *, std::vector<std::__cxx11::basic_string<char>, std::allocator<std::__cxx11::basic_string<char> > > >, void (*)(llvm::StringRef)>'
1037}
1038
1039/// Provide wrappers to std::all_of which take ranges instead of having to pass
1040/// begin/end explicitly.
1041template <typename R, typename UnaryPredicate>
1042bool 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.
1048template <typename R, typename UnaryPredicate>
1049bool 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.
1055template <typename R, typename UnaryPredicate>
1056bool 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.
1062template <typename R, typename T>
1063auto 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.
1069template <typename R, typename UnaryPredicate>
1070auto find_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) {
1071 return std::find_if(adl_begin(Range), adl_end(Range), P);
1072}
1073
1074template <typename R, typename UnaryPredicate>
1075auto 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.
1081template <typename R, typename UnaryPredicate>
1082auto 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.
1088template <typename R, typename OutputIt, typename UnaryPredicate>
1089OutputIt copy_if(R &&Range, OutputIt Out, UnaryPredicate P) {
1090 return std::copy_if(adl_begin(Range), adl_end(Range), Out, P);
1091}
1092
1093template <typename R, typename OutputIt>
1094OutputIt 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.
1100template <typename R, typename E>
1101bool 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.
1107template <typename R, typename E>
1108auto 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.
1115template <typename R, typename UnaryPredicate>
1116auto 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.
1123template <typename R, typename OutputIt, typename UnaryPredicate>
1124OutputIt 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.
1130template <typename R, typename UnaryPredicate>
1131auto 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.
1137template <typename R, typename ForwardIt>
1138auto lower_bound(R &&Range, ForwardIt I) -> decltype(adl_begin(Range)) {
1139 return std::lower_bound(adl_begin(Range), adl_end(Range), I);
1140}
1141
1142template <typename R, typename ForwardIt, typename Compare>
1143auto 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.
1150template <typename R, typename ForwardIt>
1151auto upper_bound(R &&Range, ForwardIt I) -> decltype(adl_begin(Range)) {
1152 return std::upper_bound(adl_begin(Range), adl_end(Range), I);
1153}
1154
1155template <typename R, typename ForwardIt, typename Compare>
1156auto 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.
1162template <typename R>
1163bool 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.
1172template <unsigned Size, typename R>
1173SmallVector<typename std::remove_const<detail::ValueOfRange<R>>::type, Size>
1174to_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.
1185template <typename Container, typename UnaryPredicate>
1186void 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);
1203template <class T, class... Args>
1204typename std::enable_if<!std::is_array<T>::value, std::unique_ptr<T>>::type
1205make_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.
1217template <class T>
1218typename std::enable_if<std::is_array<T>::value && std::extent<T>::value == 0,
1219 std::unique_ptr<T>>::type
1220make_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.
1225template <class T, class... Args>
1226typename std::enable_if<std::extent<T>::value != 0>::type
1227make_unique(Args &&...) = delete;
1228
1229struct FreeDeleter {
1230 void operator()(void* v) {
1231 ::free(v);
1232 }
1233};
1234
1235template<typename First, typename Second>
1236struct 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.
1243struct 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.
1250struct 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.
1258template <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
1272namespace detail {
1273
1274template <typename R> class enumerator_iter;
1275
1276template <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
1293private:
1294 std::size_t Index = std::numeric_limits<std::size_t>::max();
1295 IterOfRange<R> Iter;
1296};
1297
1298template <typename R>
1299class 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
1307public:
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
1336private:
1337 result_type Result;
1338};
1339
1340template <typename R> class enumerator {
1341public:
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
1352private:
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///
1373template <typename R> detail::enumerator<R> enumerate(R &&TheRange) {
1374 return detail::enumerator<R>(std::forward<R>(TheRange));
1375}
1376
1377namespace detail {
1378
1379template <typename F, typename Tuple, std::size_t... I>
1380auto 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.
1390template <typename F, typename Tuple>
1391auto 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

/usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/c++/6.3.0/bits/stl_algo.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
71namespace 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<