/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/include/llvm/ADT/StringMap.h
Line | Count | Source |
1 | | //===- StringMap.h - String Hash table map interface ------------*- C++ -*-===// |
2 | | // |
3 | | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
4 | | // See https://llvm.org/LICENSE.txt for license information. |
5 | | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
6 | | // |
7 | | //===----------------------------------------------------------------------===// |
8 | | // |
9 | | // This file defines the StringMap class. |
10 | | // |
11 | | //===----------------------------------------------------------------------===// |
12 | | |
13 | | #ifndef LLVM_ADT_STRINGMAP_H |
14 | | #define LLVM_ADT_STRINGMAP_H |
15 | | |
16 | | #include "llvm/ADT/StringRef.h" |
17 | | #include "llvm/ADT/iterator.h" |
18 | | #include "llvm/ADT/iterator_range.h" |
19 | | #include "llvm/Support/Allocator.h" |
20 | | #include "llvm/Support/PointerLikeTypeTraits.h" |
21 | | #include "llvm/Support/ErrorHandling.h" |
22 | | #include <algorithm> |
23 | | #include <cassert> |
24 | | #include <cstdint> |
25 | | #include <cstdlib> |
26 | | #include <cstring> |
27 | | #include <initializer_list> |
28 | | #include <iterator> |
29 | | #include <utility> |
30 | | |
31 | | namespace llvm { |
32 | | |
33 | | template<typename ValueTy> class StringMapConstIterator; |
34 | | template<typename ValueTy> class StringMapIterator; |
35 | | template<typename ValueTy> class StringMapKeyIterator; |
36 | | |
37 | | /// StringMapEntryBase - Shared base class of StringMapEntry instances. |
38 | | class StringMapEntryBase { |
39 | | size_t StrLen; |
40 | | |
41 | | public: |
42 | 446M | explicit StringMapEntryBase(size_t Len) : StrLen(Len) {} |
43 | | |
44 | 2.55G | size_t getKeyLength() const { return StrLen; } |
45 | | }; |
46 | | |
47 | | /// StringMapImpl - This is the base class of StringMap that is shared among |
48 | | /// all of its instantiations. |
49 | | class StringMapImpl { |
50 | | protected: |
51 | | // Array of NumBuckets pointers to entries, null pointers are holes. |
52 | | // TheTable[NumBuckets] contains a sentinel value for easy iteration. Followed |
53 | | // by an array of the actual hash values as unsigned integers. |
54 | | StringMapEntryBase **TheTable = nullptr; |
55 | | unsigned NumBuckets = 0; |
56 | | unsigned NumItems = 0; |
57 | | unsigned NumTombstones = 0; |
58 | | unsigned ItemSize; |
59 | | |
60 | | protected: |
61 | | explicit StringMapImpl(unsigned itemSize) |
62 | 17.9M | : ItemSize(itemSize) {} |
63 | | StringMapImpl(StringMapImpl &&RHS) |
64 | | : TheTable(RHS.TheTable), NumBuckets(RHS.NumBuckets), |
65 | | NumItems(RHS.NumItems), NumTombstones(RHS.NumTombstones), |
66 | 164k | ItemSize(RHS.ItemSize) { |
67 | 164k | RHS.TheTable = nullptr; |
68 | 164k | RHS.NumBuckets = 0; |
69 | 164k | RHS.NumItems = 0; |
70 | 164k | RHS.NumTombstones = 0; |
71 | 164k | } |
72 | | |
73 | | StringMapImpl(unsigned InitSize, unsigned ItemSize); |
74 | | unsigned RehashTable(unsigned BucketNo = 0); |
75 | | |
76 | | /// LookupBucketFor - Look up the bucket that the specified string should end |
77 | | /// up in. If it already exists as a key in the map, the Item pointer for the |
78 | | /// specified bucket will be non-null. Otherwise, it will be null. In either |
79 | | /// case, the FullHashValue field of the bucket will be set to the hash value |
80 | | /// of the string. |
81 | | unsigned LookupBucketFor(StringRef Key); |
82 | | |
83 | | /// FindKey - Look up the bucket that contains the specified key. If it exists |
84 | | /// in the map, return the bucket number of the key. Otherwise return -1. |
85 | | /// This does not modify the map. |
86 | | int FindKey(StringRef Key) const; |
87 | | |
88 | | /// RemoveKey - Remove the specified StringMapEntry from the table, but do not |
89 | | /// delete it. This aborts if the value isn't in the table. |
90 | | void RemoveKey(StringMapEntryBase *V); |
91 | | |
92 | | /// RemoveKey - Remove the StringMapEntry for the specified key from the |
93 | | /// table, returning it. If the key is not in the table, this returns null. |
94 | | StringMapEntryBase *RemoveKey(StringRef Key); |
95 | | |
96 | | /// Allocate the table with the specified number of buckets and otherwise |
97 | | /// setup the map as empty. |
98 | | void init(unsigned Size); |
99 | | |
100 | | public: |
101 | 4.68G | static StringMapEntryBase *getTombstoneVal() { |
102 | 4.68G | uintptr_t Val = static_cast<uintptr_t>(-1); |
103 | 4.68G | Val <<= PointerLikeTypeTraits<StringMapEntryBase *>::NumLowBitsAvailable; |
104 | 4.68G | return reinterpret_cast<StringMapEntryBase *>(Val); |
105 | 4.68G | } |
106 | | |
107 | 11 | unsigned getNumBuckets() const { return NumBuckets; } |
108 | 3 | unsigned getNumItems() const { return NumItems; } |
109 | | |
110 | 23.7M | bool empty() const { return NumItems == 0; } |
111 | 5.67M | unsigned size() const { return NumItems; } |
112 | | |
113 | 80.1k | void swap(StringMapImpl &Other) { |
114 | 80.1k | std::swap(TheTable, Other.TheTable); |
115 | 80.1k | std::swap(NumBuckets, Other.NumBuckets); |
116 | 80.1k | std::swap(NumItems, Other.NumItems); |
117 | 80.1k | std::swap(NumTombstones, Other.NumTombstones); |
118 | 80.1k | } |
119 | | }; |
120 | | |
121 | | /// StringMapEntry - This is used to represent one value that is inserted into |
122 | | /// a StringMap. It contains the Value itself and the key: the string length |
123 | | /// and data. |
124 | | template<typename ValueTy> |
125 | | class StringMapEntry : public StringMapEntryBase { |
126 | | public: |
127 | | ValueTy second; |
128 | | |
129 | | explicit StringMapEntry(size_t strLen) |
130 | 56.1M | : StringMapEntryBase(strLen), second() {} llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 85.8k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 85.8k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 9.10k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<unsigned int>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 3.15M | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 290 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 3.64k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 5.27k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 62 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 1.01k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 2.20k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::AsmToken>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 1 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 1.85k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 197 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::Function*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 320 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::RTLIB::Libcall>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 4.87k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 546 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 15.2k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 1.29k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::GCStrategy*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 26 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 614 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 155 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::MDString>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 439k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::NamedMDNode*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 59.7k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::PassInfo const*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 32.8M | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 657 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 521 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<bool>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 1.16M | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::MCSymbol*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 4.66M | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::MCSectionMachO*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 890k | : StringMapEntryBase(strLen), second() {} |
AsmParser.cpp:llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 2.96M | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 705k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<unsigned long>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 38.4k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 304 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::SpecialCaseList::Matcher>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 329 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 10 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 9 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::Timer>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 9 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 517k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<void*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 3 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 36 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::vfs::Status>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 19 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::OpenCLOptions::Info>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 4.44M | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 559 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::Constant*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 47 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::GlobalVariable*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 2.11k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 3.51k | : StringMapEntryBase(strLen), second() {} |
Unexecuted instantiation: llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::StringMapEntry(unsigned long) llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 127 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::ASTContext::SectionInfo>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 194 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 31.7k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<char const*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 105 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<int>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 787k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 2.26k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::SourceLocation>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 15 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::LayoutOverrideSource::Layout>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 37 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 157 | : StringMapEntryBase(strLen), second() {} |
VerifyDiagnosticConsumer.cpp:llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 11 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 3.95k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::SmallVector<unsigned int, 2u> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 89.9k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::InMemoryModuleCache::PCM>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 1.27k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 85 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::DIE const*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 70.3k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 9 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<unsigned short>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 47 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::SDNode*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 14.8k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::lto::LTO::GlobalResolution>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 1.06k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 431 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::Stmt*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 13.0k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<FoundationClass>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 91 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 20 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::ento::BugType*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 709 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 32 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::ASTUnit*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 57 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 3 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::SmallVector<clang::TypoCorrection, 1u> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 10.2k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::TimeRecord>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 1 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::StringLiteral*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 65 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::comments::TParamCommandComment*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 90 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::FrameworkCacheEntry>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 403 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::HeaderSearch::LookupFileCacheInfo>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 374k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::StringSet<llvm::MallocAllocator> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 14 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::Module*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 74.0k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<clang::PragmaHandler*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 2.25M | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 12.6k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<unsigned long long>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 607 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::sampleprof::FunctionSamples>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 340 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::RecordStreamer::State>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 264 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::GlobalValue const*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 255 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::TinyPtrVector<lld::elf::OutputSection*> >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 377k | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 43 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 22 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<lld::mach_o::MachODylibFile*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 233 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >::StringMapEntry(unsigned long) Line | Count | Source | 130 | 5 | : StringMapEntryBase(strLen), second() {} |
MachONormalizedFileFromAtoms.cpp:llvm::StringMapEntry<(anonymous namespace)::Util::DylibInfo>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 114 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<lld::Atom const*>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 396 | : StringMapEntryBase(strLen), second() {} |
llvm::StringMapEntry<llvm::FileInfo::LineData>::StringMapEntry(unsigned long) Line | Count | Source | 130 | 46 | : StringMapEntryBase(strLen), second() {} |
|
131 | | template <typename... InitTy> |
132 | | StringMapEntry(size_t strLen, InitTy &&... InitVals) |
133 | 378M | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} AArch64AsmParser.cpp:llvm::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >(unsigned long, std::__1::pair<(anonymous namespace)::RegKind, unsigned int>&&) Line | Count | Source | 133 | 17 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<int>::StringMapEntry<int>(unsigned long, int&&) Line | Count | Source | 133 | 2.43k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<char>::StringMapEntry<char>(unsigned long, char&&) Line | Count | Source | 133 | 934k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<unsigned int>::StringMapEntry<unsigned int>(unsigned long, unsigned int&&) Line | Count | Source | 133 | 30.9M | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<unsigned long long>::StringMapEntry<unsigned long long&>(unsigned long, unsigned long long&&&) Line | Count | Source | 133 | 201 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::ConstantDataSequential*>::StringMapEntry<llvm::ConstantDataSequential*>(unsigned long, llvm::ConstantDataSequential*&&) Line | Count | Source | 133 | 492k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<unsigned char>::StringMapEntry<unsigned char>(unsigned long, unsigned char&&) Line | Count | Source | 133 | 234k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::Comdat>::StringMapEntry<llvm::Comdat>(unsigned long, llvm::Comdat&&) Line | Count | Source | 133 | 32.2k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::StructType*>::StringMapEntry<llvm::StructType*>(unsigned long, llvm::StructType*&&) Line | Count | Source | 133 | 245k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::Value*>::StringMapEntry<llvm::Value*>(unsigned long, llvm::Value*&&) Line | Count | Source | 133 | 17.1M | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<char>::StringMapEntry<char&>(unsigned long, char&&&) Line | Count | Source | 133 | 7.47k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::Function*>::StringMapEntry<llvm::Function*>(unsigned long, llvm::Function*&&) Line | Count | Source | 133 | 26 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
GCOVProfiling.cpp:llvm::StringMapEntry<(anonymous namespace)::GCOVLines>::StringMapEntry<llvm::StringRef&, llvm::raw_ostream*&>(unsigned long, llvm::StringRef&&&, llvm::raw_ostream*&&&) Line | Count | Source | 133 | 84 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<bool>::StringMapEntry<bool>(unsigned long, bool&&) Line | Count | Source | 133 | 5.08M | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::MCAsmMacro>::StringMapEntry<llvm::MCAsmMacro>(unsigned long, llvm::MCAsmMacro&&) Line | Count | Source | 133 | 293 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::cl::Option*>::StringMapEntry<llvm::cl::Option*>(unsigned long, llvm::cl::Option*&&) Line | Count | Source | 133 | 154M | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >(unsigned long, std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >&&) Line | Count | Source | 133 | 140k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<clang::IdentifierInfo*>::StringMapEntry<clang::IdentifierInfo*>(unsigned long, clang::IdentifierInfo*&&) Line | Count | Source | 133 | 160M | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<clang::DirectoryEntry*>::StringMapEntry<clang::DirectoryEntry*>(unsigned long, clang::DirectoryEntry*&&) Line | Count | Source | 133 | 411k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<clang::FileEntry*>::StringMapEntry<clang::FileEntry*>(unsigned long, clang::FileEntry*&&) Line | Count | Source | 133 | 1.39M | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<unsigned int>::StringMapEntry<unsigned long>(unsigned long, unsigned long&&) Line | Count | Source | 133 | 117k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::GlobalVariable*>::StringMapEntry<llvm::GlobalVariable*>(unsigned long, llvm::GlobalVariable*&&) Line | Count | Source | 133 | 313 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::AssertingVH<llvm::Constant> >::StringMapEntry<std::nullptr_t>(unsigned long, std::nullptr_t&&) Line | Count | Source | 133 | 229 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::StringMapEntry<unsigned int&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&>(unsigned long, unsigned int&&&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&&&) Line | Count | Source | 133 | 66 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::StringMapEntry<unsigned int&, llvm::Constant*&, clang::CharUnits&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&, llvm::GlobalValue::LinkageTypes&>(unsigned long, unsigned int&&&, llvm::Constant*&&&, clang::CharUnits&&&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&&&, llvm::GlobalValue::LinkageTypes&&&) Line | Count | Source | 133 | 80 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::WeakTrackingVH>::StringMapEntry<llvm::Constant*&>(unsigned long, llvm::Constant*&&&) Line | Count | Source | 133 | 11 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<clang::GlobalDecl>::StringMapEntry<clang::GlobalDecl>(unsigned long, clang::GlobalDecl&&) Line | Count | Source | 133 | 2.34M | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<clang::OpenCLOptions::Info>::StringMapEntry<clang::OpenCLOptions::Info&>(unsigned long, clang::OpenCLOptions::Info&&&) Line | Count | Source | 133 | 547k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(unsigned long, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >&&) Line | Count | Source | 133 | 3.01M | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>(unsigned long, clang::VerifyDiagnosticConsumer::MarkerTracker::Marker&&) Line | Count | Source | 133 | 842 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<std::__1::shared_ptr<clang::ModuleFileExtension> >::StringMapEntry<std::__1::shared_ptr<clang::ModuleFileExtension> >(unsigned long, std::__1::shared_ptr<clang::ModuleFileExtension>&&) Line | Count | Source | 133 | 27 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<clang::InMemoryModuleCache::PCM>::StringMapEntry<clang::InMemoryModuleCache::PCM>(unsigned long, clang::InMemoryModuleCache::PCM&&) Line | Count | Source | 133 | 4.25k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<unsigned int const*>::StringMapEntry<unsigned int const*>(unsigned long, unsigned int const*&&) Line | Count | Source | 133 | 7.40k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::MachineMemOperand::Flags>::StringMapEntry<llvm::MachineMemOperand::Flags>(unsigned long, llvm::MachineMemOperand::Flags&&) Line | Count | Source | 133 | 6 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::TargetRegisterClass const*>::StringMapEntry<llvm::TargetRegisterClass const*>(unsigned long, llvm::TargetRegisterClass const*&&) Line | Count | Source | 133 | 232k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::RegisterBank const*>::StringMapEntry<llvm::RegisterBank const*>(unsigned long, llvm::RegisterBank const*&&) Line | Count | Source | 133 | 6.12k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::VRegInfo*>::StringMapEntry<llvm::VRegInfo*>(unsigned long, llvm::VRegInfo*&&) Line | Count | Source | 133 | 27 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::DIE const*>::StringMapEntry<llvm::DIE const*>(unsigned long, llvm::DIE const*&&) Line | Count | Source | 133 | 18 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::AccelTableBase::HashData>::StringMapEntry<llvm::DwarfStringPoolEntryRef&, unsigned int (*&)(llvm::StringRef)>(unsigned long, llvm::DwarfStringPoolEntryRef&&&, unsigned int (*&&&)(llvm::StringRef)) Line | Count | Source | 133 | 71.8k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::DwarfStringPoolEntry>::StringMapEntry<llvm::DwarfStringPoolEntry>(unsigned long, llvm::DwarfStringPoolEntry&&) Line | Count | Source | 133 | 85.0k | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<clang::Stmt*>::StringMapEntry<clang::Stmt*>(unsigned long, clang::Stmt*&&) Line | Count | Source | 133 | 2 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
StdLibraryFunctionsChecker.cpp:llvm::StringMapEntry<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >::StringMapEntry<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >(unsigned long, std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >&&) Line | Count | Source | 133 | 286 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >&>(unsigned long, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >&&&) Line | Count | Source | 133 | 119 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >::StringMapEntry<clang::OMPCriticalDirective const*&, llvm::APSInt&>(unsigned long, clang::OMPCriticalDirective const*&&&, llvm::APSInt&&&) Line | Count | Source | 133 | 38 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<char>::StringMapEntry<int>(unsigned long, int&&) Line | Count | Source | 133 | 3 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
Unexecuted instantiation: llvm::StringMapEntry<clang::FrameworkCacheEntry>::StringMapEntry<clang::FrameworkCacheEntry>(unsigned long, clang::FrameworkCacheEntry&&) llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >(unsigned long, std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >&&) Line | Count | Source | 133 | 923 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> >::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> >(unsigned long, std::__1::pair<llvm::Type*, llvm::SMLoc>&&) Line | Count | Source | 133 | 55 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<llvm::Type*>::StringMapEntry<llvm::Type*>(unsigned long, llvm::Type*&&) Line | Count | Source | 133 | 91 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<unsigned int>::StringMapEntry<llvm::support::detail::packed_endian_specific_integral<unsigned int, (llvm::support::endianness)1, 1ul> const&>(unsigned long, llvm::support::detail::packed_endian_specific_integral<unsigned int, (llvm::support::endianness)1, 1ul> const&&&) Line | Count | Source | 133 | 31 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<unsigned int>::StringMapEntry<unsigned int&>(unsigned long, unsigned int&&&) Line | Count | Source | 133 | 390 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
llvm::StringMapEntry<unsigned long long>::StringMapEntry<unsigned long long>(unsigned long, unsigned long long&&) Line | Count | Source | 133 | 414 | : StringMapEntryBase(strLen), second(std::forward<InitTy>(InitVals)...) {} |
|
134 | | StringMapEntry(StringMapEntry &E) = delete; |
135 | | |
136 | 508M | StringRef getKey() const { |
137 | 508M | return StringRef(getKeyData(), getKeyLength()); |
138 | 508M | } llvm::StringMapEntry<clang::OpenCLOptions::Info>::getKey() const Line | Count | Source | 136 | 587k | StringRef getKey() const { | 137 | 587k | return StringRef(getKeyData(), getKeyLength()); | 138 | 587k | } |
llvm::StringMapEntry<unsigned int>::getKey() const Line | Count | Source | 136 | 5.23M | StringRef getKey() const { | 137 | 5.23M | return StringRef(getKeyData(), getKeyLength()); | 138 | 5.23M | } |
llvm::StringMapEntry<unsigned long long>::getKey() const Line | Count | Source | 136 | 126 | StringRef getKey() const { | 137 | 126 | return StringRef(getKeyData(), getKeyLength()); | 138 | 126 | } |
llvm::StringMapEntry<char>::getKey() const Line | Count | Source | 136 | 6.48M | StringRef getKey() const { | 137 | 6.48M | return StringRef(getKeyData(), getKeyLength()); | 138 | 6.48M | } |
llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> >::getKey() const Line | Count | Source | 136 | 12 | StringRef getKey() const { | 137 | 12 | return StringRef(getKeyData(), getKeyLength()); | 138 | 12 | } |
llvm::StringMapEntry<llvm::StructType*>::getKey() const Line | Count | Source | 136 | 1.34M | StringRef getKey() const { | 137 | 1.34M | return StringRef(getKeyData(), getKeyLength()); | 138 | 1.34M | } |
llvm::StringMapEntry<llvm::Value*>::getKey() const Line | Count | Source | 136 | 481M | StringRef getKey() const { | 137 | 481M | return StringRef(getKeyData(), getKeyLength()); | 138 | 481M | } |
Unexecuted instantiation: GCOVProfiling.cpp:llvm::StringMapEntry<(anonymous namespace)::GCOVLines>::getKey() const llvm::StringMapEntry<bool>::getKey() const Line | Count | Source | 136 | 800k | StringRef getKey() const { | 137 | 800k | return StringRef(getKeyData(), getKeyLength()); | 138 | 800k | } |
llvm::StringMapEntry<llvm::cl::Option*>::getKey() const Line | Count | Source | 136 | 67.9k | StringRef getKey() const { | 137 | 67.9k | return StringRef(getKeyData(), getKeyLength()); | 138 | 67.9k | } |
llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >::getKey() const Line | Count | Source | 136 | 10 | StringRef getKey() const { | 137 | 10 | return StringRef(getKeyData(), getKeyLength()); | 138 | 10 | } |
llvm::StringMapEntry<llvm::TimeRecord>::getKey() const Line | Count | Source | 136 | 1 | StringRef getKey() const { | 137 | 1 | return StringRef(getKeyData(), getKeyLength()); | 138 | 1 | } |
llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::getKey() const Line | Count | Source | 136 | 143 | StringRef getKey() const { | 137 | 143 | return StringRef(getKeyData(), getKeyLength()); | 138 | 143 | } |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::getKey() const Line | Count | Source | 136 | 87.5k | StringRef getKey() const { | 137 | 87.5k | return StringRef(getKeyData(), getKeyLength()); | 138 | 87.5k | } |
llvm::StringMapEntry<clang::IdentifierInfo*>::getKey() const Line | Count | Source | 136 | 12.6M | StringRef getKey() const { | 137 | 12.6M | return StringRef(getKeyData(), getKeyLength()); | 138 | 12.6M | } |
llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::getKey() const Line | Count | Source | 136 | 384 | StringRef getKey() const { | 137 | 384 | return StringRef(getKeyData(), getKeyLength()); | 138 | 384 | } |
llvm::StringMapEntry<llvm::Type*>::getKey() const Line | Count | Source | 136 | 55 | StringRef getKey() const { | 137 | 55 | return StringRef(getKeyData(), getKeyLength()); | 138 | 55 | } |
llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> >::getKey() const Line | Count | Source | 136 | 93 | StringRef getKey() const { | 137 | 93 | return StringRef(getKeyData(), getKeyLength()); | 138 | 93 | } |
llvm::StringMapEntry<llvm::sampleprof::FunctionSamples>::getKey() const Line | Count | Source | 136 | 98 | StringRef getKey() const { | 137 | 98 | return StringRef(getKeyData(), getKeyLength()); | 138 | 98 | } |
|
139 | | |
140 | 3.78M | const ValueTy &getValue() const { return second; } llvm::StringMapEntry<clang::OpenCLOptions::Info>::getValue() const Line | Count | Source | 140 | 51.8k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<llvm::DwarfStringPoolEntry>::getValue() const Line | Count | Source | 140 | 1.43M | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<unsigned int>::getValue() const Line | Count | Source | 140 | 7.43k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<llvm::MCSymbol*>::getValue() const Line | Count | Source | 140 | 10.0k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<unsigned long long>::getValue() const Line | Count | Source | 140 | 44 | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<llvm::Comdat>::getValue() const Line | Count | Source | 140 | 28.1k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<llvm::Value*>::getValue() const Line | Count | Source | 140 | 215k | const ValueTy &getValue() const { return second; } |
AsmParser.cpp:llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind>::getValue() const Line | Count | Source | 140 | 381k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<llvm::cl::Option*>::getValue() const Line | Count | Source | 140 | 3.05k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<llvm::SpecialCaseList::Matcher>::getValue() const Line | Count | Source | 140 | 489 | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >::getValue() const Line | Count | Source | 140 | 10 | const ValueTy &getValue() const { return second; } |
Unexecuted instantiation: llvm::StringMapEntry<llvm::TimeRecord>::getValue() const llvm::StringMapEntry<clang::FileEntry*>::getValue() const Line | Count | Source | 140 | 215k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<bool>::getValue() const Line | Count | Source | 140 | 819k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<llvm::WeakTrackingVH>::getValue() const Line | Count | Source | 140 | 22 | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::getValue() const Line | Count | Source | 140 | 143 | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<clang::GlobalDecl>::getValue() const Line | Count | Source | 140 | 2.16k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<unsigned long>::getValue() const Line | Count | Source | 140 | 951 | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::getValue() const Line | Count | Source | 140 | 1.03k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<clang::IdentifierInfo*>::getValue() const Line | Count | Source | 140 | 558k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<clang::Module*>::getValue() const Line | Count | Source | 140 | 53.6k | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::getValue() const Line | Count | Source | 140 | 384 | const ValueTy &getValue() const { return second; } |
llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >::getValue() const Line | Count | Source | 140 | 11 | const ValueTy &getValue() const { return second; } |
|
141 | 1.97M | ValueTy &getValue() { return second; } llvm::StringMapEntry<clang::OpenCLOptions::Info>::getValue() Line | Count | Source | 141 | 547k | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<unsigned int>::getValue() Line | Count | Source | 141 | 200k | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<llvm::MCAsmMacro>::getValue() Line | Count | Source | 141 | 197k | ValueTy &getValue() { return second; } |
AArch64AsmParser.cpp:llvm::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >::getValue() Line | Count | Source | 141 | 825 | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<llvm::AsmToken>::getValue() Line | Count | Source | 141 | 1 | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<unsigned long long>::getValue() Line | Count | Source | 141 | 147 | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<llvm::GCStrategy*>::getValue() Line | Count | Source | 141 | 55 | ValueTy &getValue() { return second; } |
Unexecuted instantiation: llvm::StringMapEntry<llvm::ConstantDataSequential*>::getValue() llvm::StringMapEntry<llvm::MDString>::getValue() Line | Count | Source | 141 | 717k | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<char>::getValue() Line | Count | Source | 141 | 7.47k | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<llvm::Function*>::getValue() Line | Count | Source | 141 | 70 | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<llvm::Value*>::getValue() Line | Count | Source | 141 | 82 | ValueTy &getValue() { return second; } |
GCOVProfiling.cpp:llvm::StringMapEntry<(anonymous namespace)::GCOVLines>::getValue() Line | Count | Source | 141 | 84 | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<llvm::cl::Option*>::getValue() Line | Count | Source | 141 | 66.0k | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<bool>::getValue() Line | Count | Source | 141 | 121k | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<llvm::Constant*>::getValue() Line | Count | Source | 141 | 3 | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<int>::getValue() Line | Count | Source | 141 | 9.63k | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<clang::SourceLocation>::getValue() Line | Count | Source | 141 | 50 | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::getValue() Line | Count | Source | 141 | 566 | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<unsigned int const*>::getValue() Line | Count | Source | 141 | 338 | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<llvm::TargetRegisterClass const*>::getValue() Line | Count | Source | 141 | 11.1k | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<llvm::RegisterBank const*>::getValue() Line | Count | Source | 141 | 13.0k | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<llvm::DwarfStringPoolEntry>::getValue() Line | Count | Source | 141 | 2.25k | ValueTy &getValue() { return second; } |
llvm::StringMapEntry<clang::Module*>::getValue() Line | Count | Source | 141 | 73.5k | ValueTy &getValue() { return second; } |
|
142 | | |
143 | 2.70M | void setValue(const ValueTy &V) { second = V; } llvm::StringMapEntry<llvm::Value*>::setValue(llvm::Value* const&) Line | Count | Source | 143 | 2.70M | void setValue(const ValueTy &V) { second = V; } |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::setValue(std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&) Line | Count | Source | 143 | 10 | void setValue(const ValueTy &V) { second = V; } |
|
144 | | |
145 | | /// getKeyData - Return the start of the string data that is the key for this |
146 | | /// value. The string data is always stored immediately after the |
147 | | /// StringMapEntry object. |
148 | 1.78G | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} llvm::StringMapEntry<char>::getKeyData() const Line | Count | Source | 148 | 7.42M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > >::getKeyData() const Line | Count | Source | 148 | 85.8k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > >::getKeyData() const Line | Count | Source | 148 | 85.8k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::OpenCLOptions::Info>::getKeyData() const Line | Count | Source | 148 | 5.58M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<unsigned int>::getKeyData() const Line | Count | Source | 148 | 39.8M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::MCAsmMacro>::getKeyData() const Line | Count | Source | 148 | 293 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<bool>::getKeyData() const Line | Count | Source | 148 | 19.4M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::DwarfStringPoolEntry>::getKeyData() const Line | Count | Source | 148 | 633k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > >::getKeyData() const Line | Count | Source | 148 | 9.10k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
AArch64AsmParser.cpp:llvm::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >::getKeyData() const Line | Count | Source | 148 | 17 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<int>::getKeyData() const Line | Count | Source | 148 | 798k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > >::getKeyData() const Line | Count | Source | 148 | 290 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > >::getKeyData() const Line | Count | Source | 148 | 3.64k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > >::getKeyData() const Line | Count | Source | 148 | 5.27k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >::getKeyData() const Line | Count | Source | 148 | 62 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > >::getKeyData() const Line | Count | Source | 148 | 1.01k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > >::getKeyData() const Line | Count | Source | 148 | 2.20k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::AsmToken>::getKeyData() const Line | Count | Source | 148 | 1 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > >::getKeyData() const Line | Count | Source | 148 | 1.85k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > >::getKeyData() const Line | Count | Source | 148 | 197 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::Function*>::getKeyData() const Line | Count | Source | 148 | 346 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::RTLIB::Libcall>::getKeyData() const Line | Count | Source | 148 | 4.87k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > >::getKeyData() const Line | Count | Source | 148 | 546 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<unsigned long long>::getKeyData() const Line | Count | Source | 148 | 1.47k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > >::getKeyData() const Line | Count | Source | 148 | 15.2k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::getKeyData() const Line | Count | Source | 148 | 3.13k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > >::getKeyData() const Line | Count | Source | 148 | 1.29k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::GCStrategy*>::getKeyData() const Line | Count | Source | 148 | 26 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > >::getKeyData() const Line | Count | Source | 148 | 614 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::Comdat>::getKeyData() const Line | Count | Source | 148 | 125k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::ConstantDataSequential*>::getKeyData() const Line | Count | Source | 148 | 994k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<unsigned char>::getKeyData() const Line | Count | Source | 148 | 245k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> >::getKeyData() const Line | Count | Source | 148 | 167 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::MDString>::getKeyData() const Line | Count | Source | 148 | 63.6M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::NamedMDNode*>::getKeyData() const Line | Count | Source | 148 | 59.7k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::PassInfo const*>::getKeyData() const Line | Count | Source | 148 | 32.8M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::StructType*>::getKeyData() const Line | Count | Source | 148 | 1.59M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::Value*>::getKeyData() const Line | Count | Source | 148 | 498M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >::getKeyData() const Line | Count | Source | 148 | 1.11k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >::getKeyData() const Line | Count | Source | 148 | 1.58k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> >::getKeyData() const Line | Count | Source | 148 | 521 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
GCOVProfiling.cpp:llvm::StringMapEntry<(anonymous namespace)::GCOVLines>::getKeyData() const Line | Count | Source | 148 | 84 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::MCSymbol*>::getKeyData() const Line | Count | Source | 148 | 4.66M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::MCSectionMachO*>::getKeyData() const Line | Count | Source | 148 | 890k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
AsmParser.cpp:llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind>::getKeyData() const Line | Count | Source | 148 | 2.96M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >::getKeyData() const Line | Count | Source | 148 | 705k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::cl::Option*>::getKeyData() const Line | Count | Source | 148 | 154M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<unsigned long>::getKeyData() const Line | Count | Source | 148 | 38.4k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >::getKeyData() const Line | Count | Source | 148 | 304 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::SpecialCaseList::Matcher>::getKeyData() const Line | Count | Source | 148 | 329 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >::getKeyData() const Line | Count | Source | 148 | 20 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >::getKeyData() const Line | Count | Source | 148 | 9 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::Timer>::getKeyData() const Line | Count | Source | 148 | 9 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::TimeRecord>::getKeyData() const Line | Count | Source | 148 | 2 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >::getKeyData() const Line | Count | Source | 148 | 140k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >::getKeyData() const Line | Count | Source | 148 | 1.04M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<void*>::getKeyData() const Line | Count | Source | 148 | 3 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >::getKeyData() const Line | Count | Source | 148 | 98 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::IdentifierInfo*>::getKeyData() const Line | Count | Source | 148 | 935M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::DirectoryEntry*>::getKeyData() const Line | Count | Source | 148 | 823k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::FileEntry*>::getKeyData() const Line | Count | Source | 148 | 2.79M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::vfs::Status>::getKeyData() const Line | Count | Source | 148 | 19 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::Constant*>::getKeyData() const Line | Count | Source | 148 | 47 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::GlobalVariable*>::getKeyData() const Line | Count | Source | 148 | 2.75k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::AssertingVH<llvm::Constant> >::getKeyData() const Line | Count | Source | 148 | 458 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >::getKeyData() const Line | Count | Source | 148 | 9.59k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::getKeyData() const Line | Count | Source | 148 | 289 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::WeakTrackingVH>::getKeyData() const Line | Count | Source | 148 | 11 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> >::getKeyData() const Line | Count | Source | 148 | 254 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::GlobalDecl>::getKeyData() const Line | Count | Source | 148 | 4.69M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::ASTContext::SectionInfo>::getKeyData() const Line | Count | Source | 148 | 194 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::getKeyData() const Line | Count | Source | 148 | 3.11M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::FrameworkCacheEntry>::getKeyData() const Line | Count | Source | 148 | 407 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > >::getKeyData() const Line | Count | Source | 148 | 31.7k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<char const*>::getKeyData() const Line | Count | Source | 148 | 105 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::SourceLocation>::getKeyData() const Line | Count | Source | 148 | 15 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::LayoutOverrideSource::Layout>::getKeyData() const Line | Count | Source | 148 | 37 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash>::getKeyData() const Line | Count | Source | 148 | 1.07k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>::getKeyData() const Line | Count | Source | 148 | 1.68k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
VerifyDiagnosticConsumer.cpp:llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >::getKeyData() const Line | Count | Source | 148 | 12 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> >::getKeyData() const Line | Count | Source | 148 | 3.95k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::shared_ptr<clang::ModuleFileExtension> >::getKeyData() const Line | Count | Source | 148 | 27 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::SmallVector<unsigned int, 2u> >::getKeyData() const Line | Count | Source | 148 | 179k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::InMemoryModuleCache::PCM>::getKeyData() const Line | Count | Source | 148 | 5.53k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > >::getKeyData() const Line | Count | Source | 148 | 85 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<unsigned int const*>::getKeyData() const Line | Count | Source | 148 | 7.40k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::MachineMemOperand::Flags>::getKeyData() const Line | Count | Source | 148 | 6 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::TargetRegisterClass const*>::getKeyData() const Line | Count | Source | 148 | 232k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::RegisterBank const*>::getKeyData() const Line | Count | Source | 148 | 6.12k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::VRegInfo*>::getKeyData() const Line | Count | Source | 148 | 54 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::DIE const*>::getKeyData() const Line | Count | Source | 148 | 140k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::AccelTableBase::HashData>::getKeyData() const Line | Count | Source | 148 | 71.8k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> >::getKeyData() const Line | Count | Source | 148 | 9 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > >::getKeyData() const Line | Count | Source | 148 | 141 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<unsigned short>::getKeyData() const Line | Count | Source | 148 | 47 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::SDNode*>::getKeyData() const Line | Count | Source | 148 | 14.8k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::lto::LTO::GlobalResolution>::getKeyData() const Line | Count | Source | 148 | 1.06k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > >::getKeyData() const Line | Count | Source | 148 | 431 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::Stmt*>::getKeyData() const Line | Count | Source | 148 | 13.0k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<FoundationClass>::getKeyData() const Line | Count | Source | 148 | 91 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >::getKeyData() const Line | Count | Source | 148 | 20 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
StdLibraryFunctionsChecker.cpp:llvm::StringMapEntry<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >::getKeyData() const Line | Count | Source | 148 | 286 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::ento::BugType*>::getKeyData() const Line | Count | Source | 148 | 709 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >::getKeyData() const Line | Count | Source | 148 | 32 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::ASTUnit*>::getKeyData() const Line | Count | Source | 148 | 57 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::SmallVector<clang::TypoCorrection, 1u> >::getKeyData() const Line | Count | Source | 148 | 10.2k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >::getKeyData() const Line | Count | Source | 148 | 3 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >::getKeyData() const Line | Count | Source | 148 | 38 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::StringLiteral*>::getKeyData() const Line | Count | Source | 148 | 65 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::comments::TParamCommandComment*>::getKeyData() const Line | Count | Source | 148 | 90 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::HeaderSearch::LookupFileCacheInfo>::getKeyData() const Line | Count | Source | 148 | 374k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::StringSet<llvm::MallocAllocator> >::getKeyData() const Line | Count | Source | 148 | 14 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::Module*>::getKeyData() const Line | Count | Source | 148 | 74.0k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<clang::PragmaHandler*>::getKeyData() const Line | Count | Source | 148 | 2.25M | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::Type*>::getKeyData() const Line | Count | Source | 148 | 146 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> >::getKeyData() const Line | Count | Source | 148 | 12.8k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::sampleprof::FunctionSamples>::getKeyData() const Line | Count | Source | 148 | 481 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::RecordStreamer::State>::getKeyData() const Line | Count | Source | 148 | 528 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::GlobalValue const*>::getKeyData() const Line | Count | Source | 148 | 255 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::TinyPtrVector<lld::elf::OutputSection*> >::getKeyData() const Line | Count | Source | 148 | 377k | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >::getKeyData() const Line | Count | Source | 148 | 85 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >::getKeyData() const Line | Count | Source | 148 | 44 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<lld::Atom const*>::getKeyData() const Line | Count | Source | 148 | 396 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<lld::mach_o::MachODylibFile*>::getKeyData() const Line | Count | Source | 148 | 233 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >::getKeyData() const Line | Count | Source | 148 | 5 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
MachONormalizedFileFromAtoms.cpp:llvm::StringMapEntry<(anonymous namespace)::Util::DylibInfo>::getKeyData() const Line | Count | Source | 148 | 114 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
llvm::StringMapEntry<llvm::FileInfo::LineData>::getKeyData() const Line | Count | Source | 148 | 92 | const char *getKeyData() const {return reinterpret_cast<const char*>(this+1);} |
|
149 | | |
150 | 81.7M | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } llvm::StringMapEntry<bool>::first() const Line | Count | Source | 150 | 12.3M | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::DwarfStringPoolEntry>::first() const Line | Count | Source | 150 | 465k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<unsigned long long>::first() const Line | Count | Source | 150 | 122 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::first() const Line | Count | Source | 150 | 1.82k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::Comdat>::first() const Line | Count | Source | 150 | 93.5k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::ConstantDataSequential*>::first() const Line | Count | Source | 150 | 501k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<unsigned int>::first() const Line | Count | Source | 150 | 361k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<unsigned char>::first() const Line | Count | Source | 150 | 11.1k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::MDString>::first() const Line | Count | Source | 150 | 63.1M | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >::first() const Line | Count | Source | 150 | 1.02k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >::first() const Line | Count | Source | 150 | 459 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
Unexecuted instantiation: llvm::StringMapEntry<llvm::cl::Option*>::first() const llvm::StringMapEntry<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >::first() const Line | Count | Source | 150 | 523k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >::first() const Line | Count | Source | 150 | 62 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<clang::DirectoryEntry*>::first() const Line | Count | Source | 150 | 411k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<clang::FileEntry*>::first() const Line | Count | Source | 150 | 1.39M | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::GlobalVariable*>::first() const Line | Count | Source | 150 | 332 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::AssertingVH<llvm::Constant> >::first() const Line | Count | Source | 150 | 229 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >::first() const Line | Count | Source | 150 | 6.07k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> >::first() const Line | Count | Source | 150 | 127 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<clang::GlobalDecl>::first() const Line | Count | Source | 150 | 2.34M | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
Unexecuted instantiation: llvm::StringMapEntry<clang::LayoutOverrideSource::Layout>::first() const llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash>::first() const Line | Count | Source | 150 | 918 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>::first() const Line | Count | Source | 150 | 842 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
VerifyDiagnosticConsumer.cpp:llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >::first() const Line | Count | Source | 150 | 1 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::SmallVector<unsigned int, 2u> >::first() const Line | Count | Source | 150 | 89.8k | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > >::first() const Line | Count | Source | 150 | 80 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<char>::first() const Line | Count | Source | 150 | 215 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<clang::FrameworkCacheEntry>::first() const Line | Count | Source | 150 | 4 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::sampleprof::FunctionSamples>::first() const Line | Count | Source | 150 | 43 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::RecordStreamer::State>::first() const Line | Count | Source | 150 | 264 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::VRegInfo*>::first() const Line | Count | Source | 150 | 27 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >::first() const Line | Count | Source | 150 | 42 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >::first() const Line | Count | Source | 150 | 22 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
llvm::StringMapEntry<llvm::FileInfo::LineData>::first() const Line | Count | Source | 150 | 46 | StringRef first() const { return StringRef(getKeyData(), getKeyLength()); } |
|
151 | | |
152 | | /// Create a StringMapEntry for the specified key construct the value using |
153 | | /// \p InitiVals. |
154 | | template <typename AllocatorTy, typename... InitTy> |
155 | | static StringMapEntry *Create(StringRef Key, AllocatorTy &Allocator, |
156 | 434M | InitTy &&... InitVals) { |
157 | 434M | size_t KeyLength = Key.size(); |
158 | 434M | |
159 | 434M | // Allocate a new item with space for the string at the end and a null |
160 | 434M | // terminator. |
161 | 434M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; |
162 | 434M | size_t Alignment = alignof(StringMapEntry); |
163 | 434M | |
164 | 434M | StringMapEntry *NewItem = |
165 | 434M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); |
166 | 434M | assert(NewItem && "Unhandled out-of-memory"); |
167 | 434M | |
168 | 434M | // Construct the value. |
169 | 434M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); |
170 | 434M | |
171 | 434M | // Copy the string information. |
172 | 434M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); |
173 | 434M | if (KeyLength > 0) |
174 | 434M | memcpy(StrBuffer, Key.data(), KeyLength); |
175 | 434M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. |
176 | 434M | return NewItem; |
177 | 434M | } llvm::StringMapEntry<char>* llvm::StringMapEntry<char>::Create<llvm::MallocAllocator, char>(llvm::StringRef, llvm::MallocAllocator&, char&&) Line | Count | Source | 156 | 916k | InitTy &&... InitVals) { | 157 | 916k | size_t KeyLength = Key.size(); | 158 | 916k | | 159 | 916k | // Allocate a new item with space for the string at the end and a null | 160 | 916k | // terminator. | 161 | 916k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 916k | size_t Alignment = alignof(StringMapEntry); | 163 | 916k | | 164 | 916k | StringMapEntry *NewItem = | 165 | 916k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 916k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 916k | | 168 | 916k | // Construct the value. | 169 | 916k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 916k | | 171 | 916k | // Copy the string information. | 172 | 916k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 916k | if (KeyLength > 0) | 174 | 916k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 916k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 916k | return NewItem; | 177 | 916k | } |
llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > >* llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 85.8k | InitTy &&... InitVals) { | 157 | 85.8k | size_t KeyLength = Key.size(); | 158 | 85.8k | | 159 | 85.8k | // Allocate a new item with space for the string at the end and a null | 160 | 85.8k | // terminator. | 161 | 85.8k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 85.8k | size_t Alignment = alignof(StringMapEntry); | 163 | 85.8k | | 164 | 85.8k | StringMapEntry *NewItem = | 165 | 85.8k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 85.8k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 85.8k | | 168 | 85.8k | // Construct the value. | 169 | 85.8k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 85.8k | | 171 | 85.8k | // Copy the string information. | 172 | 85.8k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 85.8k | if (KeyLength > 0) | 174 | 85.8k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 85.8k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 85.8k | return NewItem; | 177 | 85.8k | } |
llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > >* llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 85.8k | InitTy &&... InitVals) { | 157 | 85.8k | size_t KeyLength = Key.size(); | 158 | 85.8k | | 159 | 85.8k | // Allocate a new item with space for the string at the end and a null | 160 | 85.8k | // terminator. | 161 | 85.8k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 85.8k | size_t Alignment = alignof(StringMapEntry); | 163 | 85.8k | | 164 | 85.8k | StringMapEntry *NewItem = | 165 | 85.8k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 85.8k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 85.8k | | 168 | 85.8k | // Construct the value. | 169 | 85.8k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 85.8k | | 171 | 85.8k | // Copy the string information. | 172 | 85.8k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 85.8k | if (KeyLength > 0) | 174 | 85.8k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 85.8k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 85.8k | return NewItem; | 177 | 85.8k | } |
llvm::StringMapEntry<clang::OpenCLOptions::Info>* llvm::StringMapEntry<clang::OpenCLOptions::Info>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 4.44M | InitTy &&... InitVals) { | 157 | 4.44M | size_t KeyLength = Key.size(); | 158 | 4.44M | | 159 | 4.44M | // Allocate a new item with space for the string at the end and a null | 160 | 4.44M | // terminator. | 161 | 4.44M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 4.44M | size_t Alignment = alignof(StringMapEntry); | 163 | 4.44M | | 164 | 4.44M | StringMapEntry *NewItem = | 165 | 4.44M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 4.44M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 4.44M | | 168 | 4.44M | // Construct the value. | 169 | 4.44M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 4.44M | | 171 | 4.44M | // Copy the string information. | 172 | 4.44M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 4.44M | if (KeyLength > 0) | 174 | 4.44M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 4.44M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 4.44M | return NewItem; | 177 | 4.44M | } |
llvm::StringMapEntry<clang::OpenCLOptions::Info>* llvm::StringMapEntry<clang::OpenCLOptions::Info>::Create<llvm::MallocAllocator, clang::OpenCLOptions::Info&>(llvm::StringRef, llvm::MallocAllocator&, clang::OpenCLOptions::Info&&&) Line | Count | Source | 156 | 547k | InitTy &&... InitVals) { | 157 | 547k | size_t KeyLength = Key.size(); | 158 | 547k | | 159 | 547k | // Allocate a new item with space for the string at the end and a null | 160 | 547k | // terminator. | 161 | 547k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 547k | size_t Alignment = alignof(StringMapEntry); | 163 | 547k | | 164 | 547k | StringMapEntry *NewItem = | 165 | 547k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 547k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 547k | | 168 | 547k | // Construct the value. | 169 | 547k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 547k | | 171 | 547k | // Copy the string information. | 172 | 547k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 547k | if (KeyLength > 0) | 174 | 547k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 547k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 547k | return NewItem; | 177 | 547k | } |
llvm::StringMapEntry<unsigned int>* llvm::StringMapEntry<unsigned int>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 3.15M | InitTy &&... InitVals) { | 157 | 3.15M | size_t KeyLength = Key.size(); | 158 | 3.15M | | 159 | 3.15M | // Allocate a new item with space for the string at the end and a null | 160 | 3.15M | // terminator. | 161 | 3.15M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 3.15M | size_t Alignment = alignof(StringMapEntry); | 163 | 3.15M | | 164 | 3.15M | StringMapEntry *NewItem = | 165 | 3.15M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 3.15M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 3.15M | | 168 | 3.15M | // Construct the value. | 169 | 3.15M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 3.15M | | 171 | 3.15M | // Copy the string information. | 172 | 3.15M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 3.15M | if (KeyLength > 0) | 174 | 3.15M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 3.15M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 3.15M | return NewItem; | 177 | 3.15M | } |
llvm::StringMapEntry<llvm::MCAsmMacro>* llvm::StringMapEntry<llvm::MCAsmMacro>::Create<llvm::MallocAllocator, llvm::MCAsmMacro>(llvm::StringRef, llvm::MallocAllocator&, llvm::MCAsmMacro&&) Line | Count | Source | 156 | 293 | InitTy &&... InitVals) { | 157 | 293 | size_t KeyLength = Key.size(); | 158 | 293 | | 159 | 293 | // Allocate a new item with space for the string at the end and a null | 160 | 293 | // terminator. | 161 | 293 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 293 | size_t Alignment = alignof(StringMapEntry); | 163 | 293 | | 164 | 293 | StringMapEntry *NewItem = | 165 | 293 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 293 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 293 | | 168 | 293 | // Construct the value. | 169 | 293 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 293 | | 171 | 293 | // Copy the string information. | 172 | 293 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 293 | if (KeyLength > 0) | 174 | 293 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 293 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 293 | return NewItem; | 177 | 293 | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 9.10k | InitTy &&... InitVals) { | 157 | 9.10k | size_t KeyLength = Key.size(); | 158 | 9.10k | | 159 | 9.10k | // Allocate a new item with space for the string at the end and a null | 160 | 9.10k | // terminator. | 161 | 9.10k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 9.10k | size_t Alignment = alignof(StringMapEntry); | 163 | 9.10k | | 164 | 9.10k | StringMapEntry *NewItem = | 165 | 9.10k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 9.10k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 9.10k | | 168 | 9.10k | // Construct the value. | 169 | 9.10k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 9.10k | | 171 | 9.10k | // Copy the string information. | 172 | 9.10k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 9.10k | if (KeyLength > 0) | 174 | 7.69k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 9.10k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 9.10k | return NewItem; | 177 | 9.10k | } |
AArch64AsmParser.cpp:llvm::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >* llvm::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >::Create<llvm::MallocAllocator, std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >(llvm::StringRef, llvm::MallocAllocator&, std::__1::pair<(anonymous namespace)::RegKind, unsigned int>&&) Line | Count | Source | 156 | 17 | InitTy &&... InitVals) { | 157 | 17 | size_t KeyLength = Key.size(); | 158 | 17 | | 159 | 17 | // Allocate a new item with space for the string at the end and a null | 160 | 17 | // terminator. | 161 | 17 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 17 | size_t Alignment = alignof(StringMapEntry); | 163 | 17 | | 164 | 17 | StringMapEntry *NewItem = | 165 | 17 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 17 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 17 | | 168 | 17 | // Construct the value. | 169 | 17 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 17 | | 171 | 17 | // Copy the string information. | 172 | 17 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 17 | if (KeyLength > 0) | 174 | 17 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 17 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 17 | return NewItem; | 177 | 17 | } |
llvm::StringMapEntry<int>* llvm::StringMapEntry<int>::Create<llvm::MallocAllocator, int>(llvm::StringRef, llvm::MallocAllocator&, int&&) Line | Count | Source | 156 | 2.43k | InitTy &&... InitVals) { | 157 | 2.43k | size_t KeyLength = Key.size(); | 158 | 2.43k | | 159 | 2.43k | // Allocate a new item with space for the string at the end and a null | 160 | 2.43k | // terminator. | 161 | 2.43k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 2.43k | size_t Alignment = alignof(StringMapEntry); | 163 | 2.43k | | 164 | 2.43k | StringMapEntry *NewItem = | 165 | 2.43k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 2.43k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 2.43k | | 168 | 2.43k | // Construct the value. | 169 | 2.43k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 2.43k | | 171 | 2.43k | // Copy the string information. | 172 | 2.43k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 2.43k | if (KeyLength > 0) | 174 | 2.41k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 2.43k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 2.43k | return NewItem; | 177 | 2.43k | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 290 | InitTy &&... InitVals) { | 157 | 290 | size_t KeyLength = Key.size(); | 158 | 290 | | 159 | 290 | // Allocate a new item with space for the string at the end and a null | 160 | 290 | // terminator. | 161 | 290 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 290 | size_t Alignment = alignof(StringMapEntry); | 163 | 290 | | 164 | 290 | StringMapEntry *NewItem = | 165 | 290 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 290 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 290 | | 168 | 290 | // Construct the value. | 169 | 290 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 290 | | 171 | 290 | // Copy the string information. | 172 | 290 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 290 | if (KeyLength > 0) | 174 | 290 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 290 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 290 | return NewItem; | 177 | 290 | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 3.64k | InitTy &&... InitVals) { | 157 | 3.64k | size_t KeyLength = Key.size(); | 158 | 3.64k | | 159 | 3.64k | // Allocate a new item with space for the string at the end and a null | 160 | 3.64k | // terminator. | 161 | 3.64k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 3.64k | size_t Alignment = alignof(StringMapEntry); | 163 | 3.64k | | 164 | 3.64k | StringMapEntry *NewItem = | 165 | 3.64k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 3.64k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 3.64k | | 168 | 3.64k | // Construct the value. | 169 | 3.64k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 3.64k | | 171 | 3.64k | // Copy the string information. | 172 | 3.64k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 3.64k | if (KeyLength > 0) | 174 | 3.64k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 3.64k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 3.64k | return NewItem; | 177 | 3.64k | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 5.27k | InitTy &&... InitVals) { | 157 | 5.27k | size_t KeyLength = Key.size(); | 158 | 5.27k | | 159 | 5.27k | // Allocate a new item with space for the string at the end and a null | 160 | 5.27k | // terminator. | 161 | 5.27k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 5.27k | size_t Alignment = alignof(StringMapEntry); | 163 | 5.27k | | 164 | 5.27k | StringMapEntry *NewItem = | 165 | 5.27k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 5.27k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 5.27k | | 168 | 5.27k | // Construct the value. | 169 | 5.27k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 5.27k | | 171 | 5.27k | // Copy the string information. | 172 | 5.27k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 5.27k | if (KeyLength > 0) | 174 | 3.54k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 5.27k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 5.27k | return NewItem; | 177 | 5.27k | } |
llvm::StringMapEntry<unsigned int>* llvm::StringMapEntry<unsigned int>::Create<llvm::MallocAllocator, unsigned int>(llvm::StringRef, llvm::MallocAllocator&, unsigned int&&) Line | Count | Source | 156 | 30.9M | InitTy &&... InitVals) { | 157 | 30.9M | size_t KeyLength = Key.size(); | 158 | 30.9M | | 159 | 30.9M | // Allocate a new item with space for the string at the end and a null | 160 | 30.9M | // terminator. | 161 | 30.9M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 30.9M | size_t Alignment = alignof(StringMapEntry); | 163 | 30.9M | | 164 | 30.9M | StringMapEntry *NewItem = | 165 | 30.9M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 30.9M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 30.9M | | 168 | 30.9M | // Construct the value. | 169 | 30.9M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 30.9M | | 171 | 30.9M | // Copy the string information. | 172 | 30.9M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 30.9M | if (KeyLength > 0) | 174 | 30.9M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 30.9M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 30.9M | return NewItem; | 177 | 30.9M | } |
llvm::StringMapEntry<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >* llvm::StringMapEntry<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 62 | InitTy &&... InitVals) { | 157 | 62 | size_t KeyLength = Key.size(); | 158 | 62 | | 159 | 62 | // Allocate a new item with space for the string at the end and a null | 160 | 62 | // terminator. | 161 | 62 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 62 | size_t Alignment = alignof(StringMapEntry); | 163 | 62 | | 164 | 62 | StringMapEntry *NewItem = | 165 | 62 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 62 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 62 | | 168 | 62 | // Construct the value. | 169 | 62 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 62 | | 171 | 62 | // Copy the string information. | 172 | 62 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 62 | if (KeyLength > 0) | 174 | 62 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 62 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 62 | return NewItem; | 177 | 62 | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 1.01k | InitTy &&... InitVals) { | 157 | 1.01k | size_t KeyLength = Key.size(); | 158 | 1.01k | | 159 | 1.01k | // Allocate a new item with space for the string at the end and a null | 160 | 1.01k | // terminator. | 161 | 1.01k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 1.01k | size_t Alignment = alignof(StringMapEntry); | 163 | 1.01k | | 164 | 1.01k | StringMapEntry *NewItem = | 165 | 1.01k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 1.01k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 1.01k | | 168 | 1.01k | // Construct the value. | 169 | 1.01k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 1.01k | | 171 | 1.01k | // Copy the string information. | 172 | 1.01k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 1.01k | if (KeyLength > 0) | 174 | 496 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 1.01k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 1.01k | return NewItem; | 177 | 1.01k | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 2.20k | InitTy &&... InitVals) { | 157 | 2.20k | size_t KeyLength = Key.size(); | 158 | 2.20k | | 159 | 2.20k | // Allocate a new item with space for the string at the end and a null | 160 | 2.20k | // terminator. | 161 | 2.20k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 2.20k | size_t Alignment = alignof(StringMapEntry); | 163 | 2.20k | | 164 | 2.20k | StringMapEntry *NewItem = | 165 | 2.20k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 2.20k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 2.20k | | 168 | 2.20k | // Construct the value. | 169 | 2.20k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 2.20k | | 171 | 2.20k | // Copy the string information. | 172 | 2.20k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 2.20k | if (KeyLength > 0) | 174 | 1.70k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 2.20k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 2.20k | return NewItem; | 177 | 2.20k | } |
llvm::StringMapEntry<llvm::AsmToken>* llvm::StringMapEntry<llvm::AsmToken>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 1 | InitTy &&... InitVals) { | 157 | 1 | size_t KeyLength = Key.size(); | 158 | 1 | | 159 | 1 | // Allocate a new item with space for the string at the end and a null | 160 | 1 | // terminator. | 161 | 1 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 1 | size_t Alignment = alignof(StringMapEntry); | 163 | 1 | | 164 | 1 | StringMapEntry *NewItem = | 165 | 1 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 1 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 1 | | 168 | 1 | // Construct the value. | 169 | 1 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 1 | | 171 | 1 | // Copy the string information. | 172 | 1 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 1 | if (KeyLength > 0) | 174 | 1 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 1 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 1 | return NewItem; | 177 | 1 | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 1.85k | InitTy &&... InitVals) { | 157 | 1.85k | size_t KeyLength = Key.size(); | 158 | 1.85k | | 159 | 1.85k | // Allocate a new item with space for the string at the end and a null | 160 | 1.85k | // terminator. | 161 | 1.85k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 1.85k | size_t Alignment = alignof(StringMapEntry); | 163 | 1.85k | | 164 | 1.85k | StringMapEntry *NewItem = | 165 | 1.85k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 1.85k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 1.85k | | 168 | 1.85k | // Construct the value. | 169 | 1.85k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 1.85k | | 171 | 1.85k | // Copy the string information. | 172 | 1.85k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 1.85k | if (KeyLength > 0) | 174 | 1.84k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 1.85k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 1.85k | return NewItem; | 177 | 1.85k | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 197 | InitTy &&... InitVals) { | 157 | 197 | size_t KeyLength = Key.size(); | 158 | 197 | | 159 | 197 | // Allocate a new item with space for the string at the end and a null | 160 | 197 | // terminator. | 161 | 197 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 197 | size_t Alignment = alignof(StringMapEntry); | 163 | 197 | | 164 | 197 | StringMapEntry *NewItem = | 165 | 197 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 197 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 197 | | 168 | 197 | // Construct the value. | 169 | 197 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 197 | | 171 | 197 | // Copy the string information. | 172 | 197 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 197 | if (KeyLength > 0) | 174 | 58 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 197 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 197 | return NewItem; | 177 | 197 | } |
llvm::StringMapEntry<llvm::Function*>* llvm::StringMapEntry<llvm::Function*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 320 | InitTy &&... InitVals) { | 157 | 320 | size_t KeyLength = Key.size(); | 158 | 320 | | 159 | 320 | // Allocate a new item with space for the string at the end and a null | 160 | 320 | // terminator. | 161 | 320 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 320 | size_t Alignment = alignof(StringMapEntry); | 163 | 320 | | 164 | 320 | StringMapEntry *NewItem = | 165 | 320 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 320 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 320 | | 168 | 320 | // Construct the value. | 169 | 320 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 320 | | 171 | 320 | // Copy the string information. | 172 | 320 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 320 | if (KeyLength > 0) | 174 | 320 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 320 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 320 | return NewItem; | 177 | 320 | } |
llvm::StringMapEntry<llvm::RTLIB::Libcall>* llvm::StringMapEntry<llvm::RTLIB::Libcall>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 4.87k | InitTy &&... InitVals) { | 157 | 4.87k | size_t KeyLength = Key.size(); | 158 | 4.87k | | 159 | 4.87k | // Allocate a new item with space for the string at the end and a null | 160 | 4.87k | // terminator. | 161 | 4.87k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 4.87k | size_t Alignment = alignof(StringMapEntry); | 163 | 4.87k | | 164 | 4.87k | StringMapEntry *NewItem = | 165 | 4.87k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 4.87k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 4.87k | | 168 | 4.87k | // Construct the value. | 169 | 4.87k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 4.87k | | 171 | 4.87k | // Copy the string information. | 172 | 4.87k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 4.87k | if (KeyLength > 0) | 174 | 4.87k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 4.87k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 4.87k | return NewItem; | 177 | 4.87k | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 546 | InitTy &&... InitVals) { | 157 | 546 | size_t KeyLength = Key.size(); | 158 | 546 | | 159 | 546 | // Allocate a new item with space for the string at the end and a null | 160 | 546 | // terminator. | 161 | 546 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 546 | size_t Alignment = alignof(StringMapEntry); | 163 | 546 | | 164 | 546 | StringMapEntry *NewItem = | 165 | 546 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 546 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 546 | | 168 | 546 | // Construct the value. | 169 | 546 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 546 | | 171 | 546 | // Copy the string information. | 172 | 546 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 546 | if (KeyLength > 0) | 174 | 198 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 546 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 546 | return NewItem; | 177 | 546 | } |
llvm::StringMapEntry<unsigned long long>* llvm::StringMapEntry<unsigned long long>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 607 | InitTy &&... InitVals) { | 157 | 607 | size_t KeyLength = Key.size(); | 158 | 607 | | 159 | 607 | // Allocate a new item with space for the string at the end and a null | 160 | 607 | // terminator. | 161 | 607 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 607 | size_t Alignment = alignof(StringMapEntry); | 163 | 607 | | 164 | 607 | StringMapEntry *NewItem = | 165 | 607 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 607 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 607 | | 168 | 607 | // Construct the value. | 169 | 607 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 607 | | 171 | 607 | // Copy the string information. | 172 | 607 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 607 | if (KeyLength > 0) | 174 | 607 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 607 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 607 | return NewItem; | 177 | 607 | } |
llvm::StringMapEntry<unsigned long long>* llvm::StringMapEntry<unsigned long long>::Create<llvm::MallocAllocator, unsigned long long&>(llvm::StringRef, llvm::MallocAllocator&, unsigned long long&&&) Line | Count | Source | 156 | 201 | InitTy &&... InitVals) { | 157 | 201 | size_t KeyLength = Key.size(); | 158 | 201 | | 159 | 201 | // Allocate a new item with space for the string at the end and a null | 160 | 201 | // terminator. | 161 | 201 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 201 | size_t Alignment = alignof(StringMapEntry); | 163 | 201 | | 164 | 201 | StringMapEntry *NewItem = | 165 | 201 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 201 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 201 | | 168 | 201 | // Construct the value. | 169 | 201 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 201 | | 171 | 201 | // Copy the string information. | 172 | 201 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 201 | if (KeyLength > 0) | 174 | 201 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 201 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 201 | return NewItem; | 177 | 201 | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 15.2k | InitTy &&... InitVals) { | 157 | 15.2k | size_t KeyLength = Key.size(); | 158 | 15.2k | | 159 | 15.2k | // Allocate a new item with space for the string at the end and a null | 160 | 15.2k | // terminator. | 161 | 15.2k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 15.2k | size_t Alignment = alignof(StringMapEntry); | 163 | 15.2k | | 164 | 15.2k | StringMapEntry *NewItem = | 165 | 15.2k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 15.2k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 15.2k | | 168 | 15.2k | // Construct the value. | 169 | 15.2k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 15.2k | | 171 | 15.2k | // Copy the string information. | 172 | 15.2k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 15.2k | if (KeyLength > 0) | 174 | 10.5k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 15.2k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 15.2k | return NewItem; | 177 | 15.2k | } |
llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >* llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::Create<llvm::MallocAllocator, std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >(llvm::StringRef, llvm::MallocAllocator&, std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >&&) Line | Count | Source | 156 | 923 | InitTy &&... InitVals) { | 157 | 923 | size_t KeyLength = Key.size(); | 158 | 923 | | 159 | 923 | // Allocate a new item with space for the string at the end and a null | 160 | 923 | // terminator. | 161 | 923 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 923 | size_t Alignment = alignof(StringMapEntry); | 163 | 923 | | 164 | 923 | StringMapEntry *NewItem = | 165 | 923 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 923 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 923 | | 168 | 923 | // Construct the value. | 169 | 923 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 923 | | 171 | 923 | // Copy the string information. | 172 | 923 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 923 | if (KeyLength > 0) | 174 | 896 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 923 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 923 | return NewItem; | 177 | 923 | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 1.29k | InitTy &&... InitVals) { | 157 | 1.29k | size_t KeyLength = Key.size(); | 158 | 1.29k | | 159 | 1.29k | // Allocate a new item with space for the string at the end and a null | 160 | 1.29k | // terminator. | 161 | 1.29k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 1.29k | size_t Alignment = alignof(StringMapEntry); | 163 | 1.29k | | 164 | 1.29k | StringMapEntry *NewItem = | 165 | 1.29k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 1.29k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 1.29k | | 168 | 1.29k | // Construct the value. | 169 | 1.29k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 1.29k | | 171 | 1.29k | // Copy the string information. | 172 | 1.29k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 1.29k | if (KeyLength > 0) | 174 | 1.29k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 1.29k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 1.29k | return NewItem; | 177 | 1.29k | } |
llvm::StringMapEntry<llvm::GCStrategy*>* llvm::StringMapEntry<llvm::GCStrategy*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 26 | InitTy &&... InitVals) { | 157 | 26 | size_t KeyLength = Key.size(); | 158 | 26 | | 159 | 26 | // Allocate a new item with space for the string at the end and a null | 160 | 26 | // terminator. | 161 | 26 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 26 | size_t Alignment = alignof(StringMapEntry); | 163 | 26 | | 164 | 26 | StringMapEntry *NewItem = | 165 | 26 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 26 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 26 | | 168 | 26 | // Construct the value. | 169 | 26 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 26 | | 171 | 26 | // Copy the string information. | 172 | 26 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 26 | if (KeyLength > 0) | 174 | 26 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 26 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 26 | return NewItem; | 177 | 26 | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 614 | InitTy &&... InitVals) { | 157 | 614 | size_t KeyLength = Key.size(); | 158 | 614 | | 159 | 614 | // Allocate a new item with space for the string at the end and a null | 160 | 614 | // terminator. | 161 | 614 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 614 | size_t Alignment = alignof(StringMapEntry); | 163 | 614 | | 164 | 614 | StringMapEntry *NewItem = | 165 | 614 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 614 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 614 | | 168 | 614 | // Construct the value. | 169 | 614 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 614 | | 171 | 614 | // Copy the string information. | 172 | 614 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 614 | if (KeyLength > 0) | 174 | 614 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 614 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 614 | return NewItem; | 177 | 614 | } |
llvm::StringMapEntry<llvm::ConstantDataSequential*>* llvm::StringMapEntry<llvm::ConstantDataSequential*>::Create<llvm::MallocAllocator, llvm::ConstantDataSequential*>(llvm::StringRef, llvm::MallocAllocator&, llvm::ConstantDataSequential*&&) Line | Count | Source | 156 | 492k | InitTy &&... InitVals) { | 157 | 492k | size_t KeyLength = Key.size(); | 158 | 492k | | 159 | 492k | // Allocate a new item with space for the string at the end and a null | 160 | 492k | // terminator. | 161 | 492k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 492k | size_t Alignment = alignof(StringMapEntry); | 163 | 492k | | 164 | 492k | StringMapEntry *NewItem = | 165 | 492k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 492k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 492k | | 168 | 492k | // Construct the value. | 169 | 492k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 492k | | 171 | 492k | // Copy the string information. | 172 | 492k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 492k | if (KeyLength > 0) | 174 | 492k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 492k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 492k | return NewItem; | 177 | 492k | } |
llvm::StringMapEntry<unsigned char>* llvm::StringMapEntry<unsigned char>::Create<llvm::MallocAllocator, unsigned char>(llvm::StringRef, llvm::MallocAllocator&, unsigned char&&) Line | Count | Source | 156 | 234k | InitTy &&... InitVals) { | 157 | 234k | size_t KeyLength = Key.size(); | 158 | 234k | | 159 | 234k | // Allocate a new item with space for the string at the end and a null | 160 | 234k | // terminator. | 161 | 234k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 234k | size_t Alignment = alignof(StringMapEntry); | 163 | 234k | | 164 | 234k | StringMapEntry *NewItem = | 165 | 234k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 234k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 234k | | 168 | 234k | // Construct the value. | 169 | 234k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 234k | | 171 | 234k | // Copy the string information. | 172 | 234k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 234k | if (KeyLength > 0) | 174 | 126k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 234k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 234k | return NewItem; | 177 | 234k | } |
llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> >* llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 155 | InitTy &&... InitVals) { | 157 | 155 | size_t KeyLength = Key.size(); | 158 | 155 | | 159 | 155 | // Allocate a new item with space for the string at the end and a null | 160 | 155 | // terminator. | 161 | 155 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 155 | size_t Alignment = alignof(StringMapEntry); | 163 | 155 | | 164 | 155 | StringMapEntry *NewItem = | 165 | 155 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 155 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 155 | | 168 | 155 | // Construct the value. | 169 | 155 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 155 | | 171 | 155 | // Copy the string information. | 172 | 155 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 155 | if (KeyLength > 0) | 174 | 155 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 155 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 155 | return NewItem; | 177 | 155 | } |
llvm::StringMapEntry<llvm::MDString>* llvm::StringMapEntry<llvm::MDString>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 156 | 439k | InitTy &&... InitVals) { | 157 | 439k | size_t KeyLength = Key.size(); | 158 | 439k | | 159 | 439k | // Allocate a new item with space for the string at the end and a null | 160 | 439k | // terminator. | 161 | 439k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 439k | size_t Alignment = alignof(StringMapEntry); | 163 | 439k | | 164 | 439k | StringMapEntry *NewItem = | 165 | 439k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 439k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 439k | | 168 | 439k | // Construct the value. | 169 | 439k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 439k | | 171 | 439k | // Copy the string information. | 172 | 439k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 439k | if (KeyLength > 0) | 174 | 434k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 439k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 439k | return NewItem; | 177 | 439k | } |
llvm::StringMapEntry<llvm::NamedMDNode*>* llvm::StringMapEntry<llvm::NamedMDNode*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 59.7k | InitTy &&... InitVals) { | 157 | 59.7k | size_t KeyLength = Key.size(); | 158 | 59.7k | | 159 | 59.7k | // Allocate a new item with space for the string at the end and a null | 160 | 59.7k | // terminator. | 161 | 59.7k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 59.7k | size_t Alignment = alignof(StringMapEntry); | 163 | 59.7k | | 164 | 59.7k | StringMapEntry *NewItem = | 165 | 59.7k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 59.7k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 59.7k | | 168 | 59.7k | // Construct the value. | 169 | 59.7k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 59.7k | | 171 | 59.7k | // Copy the string information. | 172 | 59.7k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 59.7k | if (KeyLength > 0) | 174 | 59.7k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 59.7k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 59.7k | return NewItem; | 177 | 59.7k | } |
llvm::StringMapEntry<llvm::Comdat>* llvm::StringMapEntry<llvm::Comdat>::Create<llvm::MallocAllocator, llvm::Comdat>(llvm::StringRef, llvm::MallocAllocator&, llvm::Comdat&&) Line | Count | Source | 156 | 32.2k | InitTy &&... InitVals) { | 157 | 32.2k | size_t KeyLength = Key.size(); | 158 | 32.2k | | 159 | 32.2k | // Allocate a new item with space for the string at the end and a null | 160 | 32.2k | // terminator. | 161 | 32.2k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 32.2k | size_t Alignment = alignof(StringMapEntry); | 163 | 32.2k | | 164 | 32.2k | StringMapEntry *NewItem = | 165 | 32.2k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 32.2k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 32.2k | | 168 | 32.2k | // Construct the value. | 169 | 32.2k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 32.2k | | 171 | 32.2k | // Copy the string information. | 172 | 32.2k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 32.2k | if (KeyLength > 0) | 174 | 32.2k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 32.2k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 32.2k | return NewItem; | 177 | 32.2k | } |
llvm::StringMapEntry<llvm::PassInfo const*>* llvm::StringMapEntry<llvm::PassInfo const*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 32.8M | InitTy &&... InitVals) { | 157 | 32.8M | size_t KeyLength = Key.size(); | 158 | 32.8M | | 159 | 32.8M | // Allocate a new item with space for the string at the end and a null | 160 | 32.8M | // terminator. | 161 | 32.8M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 32.8M | size_t Alignment = alignof(StringMapEntry); | 163 | 32.8M | | 164 | 32.8M | StringMapEntry *NewItem = | 165 | 32.8M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 32.8M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 32.8M | | 168 | 32.8M | // Construct the value. | 169 | 32.8M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 32.8M | | 171 | 32.8M | // Copy the string information. | 172 | 32.8M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 32.8M | if (KeyLength > 0) | 174 | 32.8M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 32.8M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 32.8M | return NewItem; | 177 | 32.8M | } |
llvm::StringMapEntry<llvm::StructType*>* llvm::StringMapEntry<llvm::StructType*>::Create<llvm::MallocAllocator, llvm::StructType*>(llvm::StringRef, llvm::MallocAllocator&, llvm::StructType*&&) Line | Count | Source | 156 | 245k | InitTy &&... InitVals) { | 157 | 245k | size_t KeyLength = Key.size(); | 158 | 245k | | 159 | 245k | // Allocate a new item with space for the string at the end and a null | 160 | 245k | // terminator. | 161 | 245k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 245k | size_t Alignment = alignof(StringMapEntry); | 163 | 245k | | 164 | 245k | StringMapEntry *NewItem = | 165 | 245k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 245k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 245k | | 168 | 245k | // Construct the value. | 169 | 245k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 245k | | 171 | 245k | // Copy the string information. | 172 | 245k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 245k | if (KeyLength > 0) | 174 | 245k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 245k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 245k | return NewItem; | 177 | 245k | } |
llvm::StringMapEntry<llvm::Value*>* llvm::StringMapEntry<llvm::Value*>::Create<llvm::MallocAllocator, llvm::Value*>(llvm::StringRef, llvm::MallocAllocator&, llvm::Value*&&) Line | Count | Source | 156 | 17.1M | InitTy &&... InitVals) { | 157 | 17.1M | size_t KeyLength = Key.size(); | 158 | 17.1M | | 159 | 17.1M | // Allocate a new item with space for the string at the end and a null | 160 | 17.1M | // terminator. | 161 | 17.1M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 17.1M | size_t Alignment = alignof(StringMapEntry); | 163 | 17.1M | | 164 | 17.1M | StringMapEntry *NewItem = | 165 | 17.1M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 17.1M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 17.1M | | 168 | 17.1M | // Construct the value. | 169 | 17.1M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 17.1M | | 171 | 17.1M | // Copy the string information. | 172 | 17.1M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 17.1M | if (KeyLength > 0) | 174 | 17.1M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 17.1M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 17.1M | return NewItem; | 177 | 17.1M | } |
llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >* llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 657 | InitTy &&... InitVals) { | 157 | 657 | size_t KeyLength = Key.size(); | 158 | 657 | | 159 | 657 | // Allocate a new item with space for the string at the end and a null | 160 | 657 | // terminator. | 161 | 657 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 657 | size_t Alignment = alignof(StringMapEntry); | 163 | 657 | | 164 | 657 | StringMapEntry *NewItem = | 165 | 657 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 657 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 657 | | 168 | 657 | // Construct the value. | 169 | 657 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 657 | | 171 | 657 | // Copy the string information. | 172 | 657 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 657 | if (KeyLength > 0) | 174 | 657 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 657 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 657 | return NewItem; | 177 | 657 | } |
llvm::StringMapEntry<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> >* llvm::StringMapEntry<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 521 | InitTy &&... InitVals) { | 157 | 521 | size_t KeyLength = Key.size(); | 158 | 521 | | 159 | 521 | // Allocate a new item with space for the string at the end and a null | 160 | 521 | // terminator. | 161 | 521 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 521 | size_t Alignment = alignof(StringMapEntry); | 163 | 521 | | 164 | 521 | StringMapEntry *NewItem = | 165 | 521 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 521 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 521 | | 168 | 521 | // Construct the value. | 169 | 521 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 521 | | 171 | 521 | // Copy the string information. | 172 | 521 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 521 | if (KeyLength > 0) | 174 | 505 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 521 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 521 | return NewItem; | 177 | 521 | } |
llvm::StringMapEntry<char>* llvm::StringMapEntry<char>::Create<llvm::MallocAllocator, char&>(llvm::StringRef, llvm::MallocAllocator&, char&&&) Line | Count | Source | 156 | 7.47k | InitTy &&... InitVals) { | 157 | 7.47k | size_t KeyLength = Key.size(); | 158 | 7.47k | | 159 | 7.47k | // Allocate a new item with space for the string at the end and a null | 160 | 7.47k | // terminator. | 161 | 7.47k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 7.47k | size_t Alignment = alignof(StringMapEntry); | 163 | 7.47k | | 164 | 7.47k | StringMapEntry *NewItem = | 165 | 7.47k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 7.47k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 7.47k | | 168 | 7.47k | // Construct the value. | 169 | 7.47k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 7.47k | | 171 | 7.47k | // Copy the string information. | 172 | 7.47k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 7.47k | if (KeyLength > 0) | 174 | 7.47k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 7.47k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 7.47k | return NewItem; | 177 | 7.47k | } |
llvm::StringMapEntry<llvm::Function*>* llvm::StringMapEntry<llvm::Function*>::Create<llvm::MallocAllocator, llvm::Function*>(llvm::StringRef, llvm::MallocAllocator&, llvm::Function*&&) Line | Count | Source | 156 | 26 | InitTy &&... InitVals) { | 157 | 26 | size_t KeyLength = Key.size(); | 158 | 26 | | 159 | 26 | // Allocate a new item with space for the string at the end and a null | 160 | 26 | // terminator. | 161 | 26 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 26 | size_t Alignment = alignof(StringMapEntry); | 163 | 26 | | 164 | 26 | StringMapEntry *NewItem = | 165 | 26 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 26 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 26 | | 168 | 26 | // Construct the value. | 169 | 26 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 26 | | 171 | 26 | // Copy the string information. | 172 | 26 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 26 | if (KeyLength > 0) | 174 | 26 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 26 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 26 | return NewItem; | 177 | 26 | } |
llvm::StringMapEntry<bool>* llvm::StringMapEntry<bool>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 1.16M | InitTy &&... InitVals) { | 157 | 1.16M | size_t KeyLength = Key.size(); | 158 | 1.16M | | 159 | 1.16M | // Allocate a new item with space for the string at the end and a null | 160 | 1.16M | // terminator. | 161 | 1.16M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 1.16M | size_t Alignment = alignof(StringMapEntry); | 163 | 1.16M | | 164 | 1.16M | StringMapEntry *NewItem = | 165 | 1.16M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 1.16M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 1.16M | | 168 | 1.16M | // Construct the value. | 169 | 1.16M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 1.16M | | 171 | 1.16M | // Copy the string information. | 172 | 1.16M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 1.16M | if (KeyLength > 0) | 174 | 1.16M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 1.16M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 1.16M | return NewItem; | 177 | 1.16M | } |
GCOVProfiling.cpp:llvm::StringMapEntry<(anonymous namespace)::GCOVLines>* llvm::StringMapEntry<(anonymous namespace)::GCOVLines>::Create<llvm::MallocAllocator, llvm::StringRef&, llvm::raw_ostream*&>(llvm::StringRef, llvm::MallocAllocator&, llvm::StringRef&&&, llvm::raw_ostream*&&&) Line | Count | Source | 156 | 84 | InitTy &&... InitVals) { | 157 | 84 | size_t KeyLength = Key.size(); | 158 | 84 | | 159 | 84 | // Allocate a new item with space for the string at the end and a null | 160 | 84 | // terminator. | 161 | 84 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 84 | size_t Alignment = alignof(StringMapEntry); | 163 | 84 | | 164 | 84 | StringMapEntry *NewItem = | 165 | 84 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 84 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 84 | | 168 | 84 | // Construct the value. | 169 | 84 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 84 | | 171 | 84 | // Copy the string information. | 172 | 84 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 84 | if (KeyLength > 0) | 174 | 84 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 84 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 84 | return NewItem; | 177 | 84 | } |
llvm::StringMapEntry<llvm::MCSymbol*>* llvm::StringMapEntry<llvm::MCSymbol*>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 156 | 4.66M | InitTy &&... InitVals) { | 157 | 4.66M | size_t KeyLength = Key.size(); | 158 | 4.66M | | 159 | 4.66M | // Allocate a new item with space for the string at the end and a null | 160 | 4.66M | // terminator. | 161 | 4.66M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 4.66M | size_t Alignment = alignof(StringMapEntry); | 163 | 4.66M | | 164 | 4.66M | StringMapEntry *NewItem = | 165 | 4.66M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 4.66M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 4.66M | | 168 | 4.66M | // Construct the value. | 169 | 4.66M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 4.66M | | 171 | 4.66M | // Copy the string information. | 172 | 4.66M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 4.66M | if (KeyLength > 0) | 174 | 4.66M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 4.66M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 4.66M | return NewItem; | 177 | 4.66M | } |
llvm::StringMapEntry<bool>* llvm::StringMapEntry<bool>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, bool>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, bool&&) Line | Count | Source | 156 | 5.07M | InitTy &&... InitVals) { | 157 | 5.07M | size_t KeyLength = Key.size(); | 158 | 5.07M | | 159 | 5.07M | // Allocate a new item with space for the string at the end and a null | 160 | 5.07M | // terminator. | 161 | 5.07M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 5.07M | size_t Alignment = alignof(StringMapEntry); | 163 | 5.07M | | 164 | 5.07M | StringMapEntry *NewItem = | 165 | 5.07M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 5.07M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 5.07M | | 168 | 5.07M | // Construct the value. | 169 | 5.07M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 5.07M | | 171 | 5.07M | // Copy the string information. | 172 | 5.07M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 5.07M | if (KeyLength > 0) | 174 | 5.07M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 5.07M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 5.07M | return NewItem; | 177 | 5.07M | } |
llvm::StringMapEntry<llvm::MCSectionMachO*>* llvm::StringMapEntry<llvm::MCSectionMachO*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 890k | InitTy &&... InitVals) { | 157 | 890k | size_t KeyLength = Key.size(); | 158 | 890k | | 159 | 890k | // Allocate a new item with space for the string at the end and a null | 160 | 890k | // terminator. | 161 | 890k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 890k | size_t Alignment = alignof(StringMapEntry); | 163 | 890k | | 164 | 890k | StringMapEntry *NewItem = | 165 | 890k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 890k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 890k | | 168 | 890k | // Construct the value. | 169 | 890k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 890k | | 171 | 890k | // Copy the string information. | 172 | 890k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 890k | if (KeyLength > 0) | 174 | 890k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 890k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 890k | return NewItem; | 177 | 890k | } |
llvm::StringMapEntry<bool>* llvm::StringMapEntry<bool>::Create<llvm::MallocAllocator, bool>(llvm::StringRef, llvm::MallocAllocator&, bool&&) Line | Count | Source | 156 | 4.93k | InitTy &&... InitVals) { | 157 | 4.93k | size_t KeyLength = Key.size(); | 158 | 4.93k | | 159 | 4.93k | // Allocate a new item with space for the string at the end and a null | 160 | 4.93k | // terminator. | 161 | 4.93k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 4.93k | size_t Alignment = alignof(StringMapEntry); | 163 | 4.93k | | 164 | 4.93k | StringMapEntry *NewItem = | 165 | 4.93k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 4.93k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 4.93k | | 168 | 4.93k | // Construct the value. | 169 | 4.93k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 4.93k | | 171 | 4.93k | // Copy the string information. | 172 | 4.93k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 4.93k | if (KeyLength > 0) | 174 | 4.93k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 4.93k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 4.93k | return NewItem; | 177 | 4.93k | } |
AsmParser.cpp:llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind>* llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 2.96M | InitTy &&... InitVals) { | 157 | 2.96M | size_t KeyLength = Key.size(); | 158 | 2.96M | | 159 | 2.96M | // Allocate a new item with space for the string at the end and a null | 160 | 2.96M | // terminator. | 161 | 2.96M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 2.96M | size_t Alignment = alignof(StringMapEntry); | 163 | 2.96M | | 164 | 2.96M | StringMapEntry *NewItem = | 165 | 2.96M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 2.96M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 2.96M | | 168 | 2.96M | // Construct the value. | 169 | 2.96M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 2.96M | | 171 | 2.96M | // Copy the string information. | 172 | 2.96M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 2.96M | if (KeyLength > 0) | 174 | 2.96M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 2.96M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 2.96M | return NewItem; | 177 | 2.96M | } |
llvm::StringMapEntry<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >* llvm::StringMapEntry<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 705k | InitTy &&... InitVals) { | 157 | 705k | size_t KeyLength = Key.size(); | 158 | 705k | | 159 | 705k | // Allocate a new item with space for the string at the end and a null | 160 | 705k | // terminator. | 161 | 705k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 705k | size_t Alignment = alignof(StringMapEntry); | 163 | 705k | | 164 | 705k | StringMapEntry *NewItem = | 165 | 705k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 705k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 705k | | 168 | 705k | // Construct the value. | 169 | 705k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 705k | | 171 | 705k | // Copy the string information. | 172 | 705k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 705k | if (KeyLength > 0) | 174 | 705k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 705k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 705k | return NewItem; | 177 | 705k | } |
llvm::StringMapEntry<llvm::cl::Option*>* llvm::StringMapEntry<llvm::cl::Option*>::Create<llvm::MallocAllocator, llvm::cl::Option*>(llvm::StringRef, llvm::MallocAllocator&, llvm::cl::Option*&&) Line | Count | Source | 156 | 154M | InitTy &&... InitVals) { | 157 | 154M | size_t KeyLength = Key.size(); | 158 | 154M | | 159 | 154M | // Allocate a new item with space for the string at the end and a null | 160 | 154M | // terminator. | 161 | 154M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 154M | size_t Alignment = alignof(StringMapEntry); | 163 | 154M | | 164 | 154M | StringMapEntry *NewItem = | 165 | 154M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 154M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 154M | | 168 | 154M | // Construct the value. | 169 | 154M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 154M | | 171 | 154M | // Copy the string information. | 172 | 154M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 154M | if (KeyLength > 0) | 174 | 154M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 154M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 154M | return NewItem; | 177 | 154M | } |
llvm::StringMapEntry<unsigned long>* llvm::StringMapEntry<unsigned long>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 38.4k | InitTy &&... InitVals) { | 157 | 38.4k | size_t KeyLength = Key.size(); | 158 | 38.4k | | 159 | 38.4k | // Allocate a new item with space for the string at the end and a null | 160 | 38.4k | // terminator. | 161 | 38.4k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 38.4k | size_t Alignment = alignof(StringMapEntry); | 163 | 38.4k | | 164 | 38.4k | StringMapEntry *NewItem = | 165 | 38.4k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 38.4k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 38.4k | | 168 | 38.4k | // Construct the value. | 169 | 38.4k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 38.4k | | 171 | 38.4k | // Copy the string information. | 172 | 38.4k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 38.4k | if (KeyLength > 0) | 174 | 38.4k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 38.4k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 38.4k | return NewItem; | 177 | 38.4k | } |
llvm::StringMapEntry<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >* llvm::StringMapEntry<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 304 | InitTy &&... InitVals) { | 157 | 304 | size_t KeyLength = Key.size(); | 158 | 304 | | 159 | 304 | // Allocate a new item with space for the string at the end and a null | 160 | 304 | // terminator. | 161 | 304 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 304 | size_t Alignment = alignof(StringMapEntry); | 163 | 304 | | 164 | 304 | StringMapEntry *NewItem = | 165 | 304 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 304 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 304 | | 168 | 304 | // Construct the value. | 169 | 304 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 304 | | 171 | 304 | // Copy the string information. | 172 | 304 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 304 | if (KeyLength > 0) | 174 | 304 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 304 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 304 | return NewItem; | 177 | 304 | } |
llvm::StringMapEntry<llvm::SpecialCaseList::Matcher>* llvm::StringMapEntry<llvm::SpecialCaseList::Matcher>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 329 | InitTy &&... InitVals) { | 157 | 329 | size_t KeyLength = Key.size(); | 158 | 329 | | 159 | 329 | // Allocate a new item with space for the string at the end and a null | 160 | 329 | // terminator. | 161 | 329 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 329 | size_t Alignment = alignof(StringMapEntry); | 163 | 329 | | 164 | 329 | StringMapEntry *NewItem = | 165 | 329 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 329 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 329 | | 168 | 329 | // Construct the value. | 169 | 329 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 329 | | 171 | 329 | // Copy the string information. | 172 | 329 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 329 | if (KeyLength > 0) | 174 | 44 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 329 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 329 | return NewItem; | 177 | 329 | } |
llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >* llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 10 | InitTy &&... InitVals) { | 157 | 10 | size_t KeyLength = Key.size(); | 158 | 10 | | 159 | 10 | // Allocate a new item with space for the string at the end and a null | 160 | 10 | // terminator. | 161 | 10 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 10 | size_t Alignment = alignof(StringMapEntry); | 163 | 10 | | 164 | 10 | StringMapEntry *NewItem = | 165 | 10 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 10 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 10 | | 168 | 10 | // Construct the value. | 169 | 10 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 10 | | 171 | 10 | // Copy the string information. | 172 | 10 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 10 | if (KeyLength > 0) | 174 | 10 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 10 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 10 | return NewItem; | 177 | 10 | } |
llvm::StringMapEntry<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >* llvm::StringMapEntry<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 9 | InitTy &&... InitVals) { | 157 | 9 | size_t KeyLength = Key.size(); | 158 | 9 | | 159 | 9 | // Allocate a new item with space for the string at the end and a null | 160 | 9 | // terminator. | 161 | 9 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 9 | size_t Alignment = alignof(StringMapEntry); | 163 | 9 | | 164 | 9 | StringMapEntry *NewItem = | 165 | 9 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 9 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 9 | | 168 | 9 | // Construct the value. | 169 | 9 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 9 | | 171 | 9 | // Copy the string information. | 172 | 9 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 9 | if (KeyLength > 0) | 174 | 9 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 9 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 9 | return NewItem; | 177 | 9 | } |
llvm::StringMapEntry<llvm::Timer>* llvm::StringMapEntry<llvm::Timer>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 9 | InitTy &&... InitVals) { | 157 | 9 | size_t KeyLength = Key.size(); | 158 | 9 | | 159 | 9 | // Allocate a new item with space for the string at the end and a null | 160 | 9 | // terminator. | 161 | 9 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 9 | size_t Alignment = alignof(StringMapEntry); | 163 | 9 | | 164 | 9 | StringMapEntry *NewItem = | 165 | 9 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 9 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 9 | | 168 | 9 | // Construct the value. | 169 | 9 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 9 | | 171 | 9 | // Copy the string information. | 172 | 9 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 9 | if (KeyLength > 0) | 174 | 9 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 9 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 9 | return NewItem; | 177 | 9 | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >::Create<llvm::MallocAllocator, std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >(llvm::StringRef, llvm::MallocAllocator&, std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >&&) Line | Count | Source | 156 | 140k | InitTy &&... InitVals) { | 157 | 140k | size_t KeyLength = Key.size(); | 158 | 140k | | 159 | 140k | // Allocate a new item with space for the string at the end and a null | 160 | 140k | // terminator. | 161 | 140k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 140k | size_t Alignment = alignof(StringMapEntry); | 163 | 140k | | 164 | 140k | StringMapEntry *NewItem = | 165 | 140k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 140k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 140k | | 168 | 140k | // Construct the value. | 169 | 140k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 140k | | 171 | 140k | // Copy the string information. | 172 | 140k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 140k | if (KeyLength > 0) | 174 | 140k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 140k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 140k | return NewItem; | 177 | 140k | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 517k | InitTy &&... InitVals) { | 157 | 517k | size_t KeyLength = Key.size(); | 158 | 517k | | 159 | 517k | // Allocate a new item with space for the string at the end and a null | 160 | 517k | // terminator. | 161 | 517k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 517k | size_t Alignment = alignof(StringMapEntry); | 163 | 517k | | 164 | 517k | StringMapEntry *NewItem = | 165 | 517k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 517k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 517k | | 168 | 517k | // Construct the value. | 169 | 517k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 517k | | 171 | 517k | // Copy the string information. | 172 | 517k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 517k | if (KeyLength > 0) | 174 | 517k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 517k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 517k | return NewItem; | 177 | 517k | } |
llvm::StringMapEntry<void*>* llvm::StringMapEntry<void*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 3 | InitTy &&... InitVals) { | 157 | 3 | size_t KeyLength = Key.size(); | 158 | 3 | | 159 | 3 | // Allocate a new item with space for the string at the end and a null | 160 | 3 | // terminator. | 161 | 3 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 3 | size_t Alignment = alignof(StringMapEntry); | 163 | 3 | | 164 | 3 | StringMapEntry *NewItem = | 165 | 3 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 3 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 3 | | 168 | 3 | // Construct the value. | 169 | 3 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 3 | | 171 | 3 | // Copy the string information. | 172 | 3 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 3 | if (KeyLength > 0) | 174 | 3 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 3 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 3 | return NewItem; | 177 | 3 | } |
llvm::StringMapEntry<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >* llvm::StringMapEntry<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 36 | InitTy &&... InitVals) { | 157 | 36 | size_t KeyLength = Key.size(); | 158 | 36 | | 159 | 36 | // Allocate a new item with space for the string at the end and a null | 160 | 36 | // terminator. | 161 | 36 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 36 | size_t Alignment = alignof(StringMapEntry); | 163 | 36 | | 164 | 36 | StringMapEntry *NewItem = | 165 | 36 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 36 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 36 | | 168 | 36 | // Construct the value. | 169 | 36 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 36 | | 171 | 36 | // Copy the string information. | 172 | 36 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 36 | if (KeyLength > 0) | 174 | 36 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 36 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 36 | return NewItem; | 177 | 36 | } |
llvm::StringMapEntry<clang::IdentifierInfo*>* llvm::StringMapEntry<clang::IdentifierInfo*>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, clang::IdentifierInfo*>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, clang::IdentifierInfo*&&) Line | Count | Source | 156 | 160M | InitTy &&... InitVals) { | 157 | 160M | size_t KeyLength = Key.size(); | 158 | 160M | | 159 | 160M | // Allocate a new item with space for the string at the end and a null | 160 | 160M | // terminator. | 161 | 160M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 160M | size_t Alignment = alignof(StringMapEntry); | 163 | 160M | | 164 | 160M | StringMapEntry *NewItem = | 165 | 160M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 160M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 160M | | 168 | 160M | // Construct the value. | 169 | 160M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 160M | | 171 | 160M | // Copy the string information. | 172 | 160M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 160M | if (KeyLength > 0) | 174 | 160M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 160M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 160M | return NewItem; | 177 | 160M | } |
llvm::StringMapEntry<clang::DirectoryEntry*>* llvm::StringMapEntry<clang::DirectoryEntry*>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, clang::DirectoryEntry*>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, clang::DirectoryEntry*&&) Line | Count | Source | 156 | 411k | InitTy &&... InitVals) { | 157 | 411k | size_t KeyLength = Key.size(); | 158 | 411k | | 159 | 411k | // Allocate a new item with space for the string at the end and a null | 160 | 411k | // terminator. | 161 | 411k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 411k | size_t Alignment = alignof(StringMapEntry); | 163 | 411k | | 164 | 411k | StringMapEntry *NewItem = | 165 | 411k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 411k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 411k | | 168 | 411k | // Construct the value. | 169 | 411k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 411k | | 171 | 411k | // Copy the string information. | 172 | 411k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 411k | if (KeyLength > 0) | 174 | 411k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 411k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 411k | return NewItem; | 177 | 411k | } |
llvm::StringMapEntry<clang::FileEntry*>* llvm::StringMapEntry<clang::FileEntry*>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, clang::FileEntry*>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, clang::FileEntry*&&) Line | Count | Source | 156 | 1.39M | InitTy &&... InitVals) { | 157 | 1.39M | size_t KeyLength = Key.size(); | 158 | 1.39M | | 159 | 1.39M | // Allocate a new item with space for the string at the end and a null | 160 | 1.39M | // terminator. | 161 | 1.39M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 1.39M | size_t Alignment = alignof(StringMapEntry); | 163 | 1.39M | | 164 | 1.39M | StringMapEntry *NewItem = | 165 | 1.39M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 1.39M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 1.39M | | 168 | 1.39M | // Construct the value. | 169 | 1.39M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 1.39M | | 171 | 1.39M | // Copy the string information. | 172 | 1.39M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 1.39M | if (KeyLength > 0) | 174 | 1.39M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 1.39M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 1.39M | return NewItem; | 177 | 1.39M | } |
llvm::StringMapEntry<llvm::vfs::Status>* llvm::StringMapEntry<llvm::vfs::Status>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 156 | 19 | InitTy &&... InitVals) { | 157 | 19 | size_t KeyLength = Key.size(); | 158 | 19 | | 159 | 19 | // Allocate a new item with space for the string at the end and a null | 160 | 19 | // terminator. | 161 | 19 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 19 | size_t Alignment = alignof(StringMapEntry); | 163 | 19 | | 164 | 19 | StringMapEntry *NewItem = | 165 | 19 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 19 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 19 | | 168 | 19 | // Construct the value. | 169 | 19 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 19 | | 171 | 19 | // Copy the string information. | 172 | 19 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 19 | if (KeyLength > 0) | 174 | 19 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 19 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 19 | return NewItem; | 177 | 19 | } |
llvm::StringMapEntry<unsigned int>* llvm::StringMapEntry<unsigned int>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, unsigned long>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, unsigned long&&) Line | Count | Source | 156 | 117k | InitTy &&... InitVals) { | 157 | 117k | size_t KeyLength = Key.size(); | 158 | 117k | | 159 | 117k | // Allocate a new item with space for the string at the end and a null | 160 | 117k | // terminator. | 161 | 117k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 117k | size_t Alignment = alignof(StringMapEntry); | 163 | 117k | | 164 | 117k | StringMapEntry *NewItem = | 165 | 117k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 117k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 117k | | 168 | 117k | // Construct the value. | 169 | 117k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 117k | | 171 | 117k | // Copy the string information. | 172 | 117k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 117k | if (KeyLength > 0) | 174 | 117k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 117k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 117k | return NewItem; | 177 | 117k | } |
llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >* llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 559 | InitTy &&... InitVals) { | 157 | 559 | size_t KeyLength = Key.size(); | 158 | 559 | | 159 | 559 | // Allocate a new item with space for the string at the end and a null | 160 | 559 | // terminator. | 161 | 559 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 559 | size_t Alignment = alignof(StringMapEntry); | 163 | 559 | | 164 | 559 | StringMapEntry *NewItem = | 165 | 559 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 559 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 559 | | 168 | 559 | // Construct the value. | 169 | 559 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 559 | | 171 | 559 | // Copy the string information. | 172 | 559 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 559 | if (KeyLength > 0) | 174 | 542 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 559 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 559 | return NewItem; | 177 | 559 | } |
llvm::StringMapEntry<llvm::Constant*>* llvm::StringMapEntry<llvm::Constant*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 47 | InitTy &&... InitVals) { | 157 | 47 | size_t KeyLength = Key.size(); | 158 | 47 | | 159 | 47 | // Allocate a new item with space for the string at the end and a null | 160 | 47 | // terminator. | 161 | 47 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 47 | size_t Alignment = alignof(StringMapEntry); | 163 | 47 | | 164 | 47 | StringMapEntry *NewItem = | 165 | 47 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 47 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 47 | | 168 | 47 | // Construct the value. | 169 | 47 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 47 | | 171 | 47 | // Copy the string information. | 172 | 47 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 47 | if (KeyLength > 0) | 174 | 47 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 47 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 47 | return NewItem; | 177 | 47 | } |
llvm::StringMapEntry<llvm::GlobalVariable*>* llvm::StringMapEntry<llvm::GlobalVariable*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 2.11k | InitTy &&... InitVals) { | 157 | 2.11k | size_t KeyLength = Key.size(); | 158 | 2.11k | | 159 | 2.11k | // Allocate a new item with space for the string at the end and a null | 160 | 2.11k | // terminator. | 161 | 2.11k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 2.11k | size_t Alignment = alignof(StringMapEntry); | 163 | 2.11k | | 164 | 2.11k | StringMapEntry *NewItem = | 165 | 2.11k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 2.11k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 2.11k | | 168 | 2.11k | // Construct the value. | 169 | 2.11k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 2.11k | | 171 | 2.11k | // Copy the string information. | 172 | 2.11k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 2.11k | if (KeyLength > 0) | 174 | 1.94k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 2.11k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 2.11k | return NewItem; | 177 | 2.11k | } |
llvm::StringMapEntry<llvm::GlobalVariable*>* llvm::StringMapEntry<llvm::GlobalVariable*>::Create<llvm::MallocAllocator, llvm::GlobalVariable*>(llvm::StringRef, llvm::MallocAllocator&, llvm::GlobalVariable*&&) Line | Count | Source | 156 | 313 | InitTy &&... InitVals) { | 157 | 313 | size_t KeyLength = Key.size(); | 158 | 313 | | 159 | 313 | // Allocate a new item with space for the string at the end and a null | 160 | 313 | // terminator. | 161 | 313 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 313 | size_t Alignment = alignof(StringMapEntry); | 163 | 313 | | 164 | 313 | StringMapEntry *NewItem = | 165 | 313 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 313 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 313 | | 168 | 313 | // Construct the value. | 169 | 313 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 313 | | 171 | 313 | // Copy the string information. | 172 | 313 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 313 | if (KeyLength > 0) | 174 | 279 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 313 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 313 | return NewItem; | 177 | 313 | } |
llvm::StringMapEntry<llvm::AssertingVH<llvm::Constant> >* llvm::StringMapEntry<llvm::AssertingVH<llvm::Constant> >::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, std::nullptr_t>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, std::nullptr_t&&) Line | Count | Source | 156 | 229 | InitTy &&... InitVals) { | 157 | 229 | size_t KeyLength = Key.size(); | 158 | 229 | | 159 | 229 | // Allocate a new item with space for the string at the end and a null | 160 | 229 | // terminator. | 161 | 229 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 229 | size_t Alignment = alignof(StringMapEntry); | 163 | 229 | | 164 | 229 | StringMapEntry *NewItem = | 165 | 229 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 229 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 229 | | 168 | 229 | // Construct the value. | 169 | 229 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 229 | | 171 | 229 | // Copy the string information. | 172 | 229 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 229 | if (KeyLength > 0) | 174 | 229 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 229 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 229 | return NewItem; | 177 | 229 | } |
llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >* llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 3.51k | InitTy &&... InitVals) { | 157 | 3.51k | size_t KeyLength = Key.size(); | 158 | 3.51k | | 159 | 3.51k | // Allocate a new item with space for the string at the end and a null | 160 | 3.51k | // terminator. | 161 | 3.51k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 3.51k | size_t Alignment = alignof(StringMapEntry); | 163 | 3.51k | | 164 | 3.51k | StringMapEntry *NewItem = | 165 | 3.51k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 3.51k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 3.51k | | 168 | 3.51k | // Construct the value. | 169 | 3.51k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 3.51k | | 171 | 3.51k | // Copy the string information. | 172 | 3.51k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 3.51k | if (KeyLength > 0) | 174 | 3.51k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 3.51k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 3.51k | return NewItem; | 177 | 3.51k | } |
llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>* llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::Create<llvm::MallocAllocator, unsigned int&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&>(llvm::StringRef, llvm::MallocAllocator&, unsigned int&&&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&&&) Line | Count | Source | 156 | 66 | InitTy &&... InitVals) { | 157 | 66 | size_t KeyLength = Key.size(); | 158 | 66 | | 159 | 66 | // Allocate a new item with space for the string at the end and a null | 160 | 66 | // terminator. | 161 | 66 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 66 | size_t Alignment = alignof(StringMapEntry); | 163 | 66 | | 164 | 66 | StringMapEntry *NewItem = | 165 | 66 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 66 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 66 | | 168 | 66 | // Construct the value. | 169 | 66 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 66 | | 171 | 66 | // Copy the string information. | 172 | 66 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 66 | if (KeyLength > 0) | 174 | 66 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 66 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 66 | return NewItem; | 177 | 66 | } |
Unexecuted instantiation: llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>* llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>* llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::Create<llvm::MallocAllocator, unsigned int&, llvm::Constant*&, clang::CharUnits&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&, llvm::GlobalValue::LinkageTypes&>(llvm::StringRef, llvm::MallocAllocator&, unsigned int&&&, llvm::Constant*&&&, clang::CharUnits&&&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&&&, llvm::GlobalValue::LinkageTypes&&&) Line | Count | Source | 156 | 80 | InitTy &&... InitVals) { | 157 | 80 | size_t KeyLength = Key.size(); | 158 | 80 | | 159 | 80 | // Allocate a new item with space for the string at the end and a null | 160 | 80 | // terminator. | 161 | 80 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 80 | size_t Alignment = alignof(StringMapEntry); | 163 | 80 | | 164 | 80 | StringMapEntry *NewItem = | 165 | 80 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 80 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 80 | | 168 | 80 | // Construct the value. | 169 | 80 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 80 | | 171 | 80 | // Copy the string information. | 172 | 80 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 80 | if (KeyLength > 0) | 174 | 80 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 80 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 80 | return NewItem; | 177 | 80 | } |
llvm::StringMapEntry<llvm::WeakTrackingVH>* llvm::StringMapEntry<llvm::WeakTrackingVH>::Create<llvm::MallocAllocator, llvm::Constant*&>(llvm::StringRef, llvm::MallocAllocator&, llvm::Constant*&&&) Line | Count | Source | 156 | 11 | InitTy &&... InitVals) { | 157 | 11 | size_t KeyLength = Key.size(); | 158 | 11 | | 159 | 11 | // Allocate a new item with space for the string at the end and a null | 160 | 11 | // terminator. | 161 | 11 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 11 | size_t Alignment = alignof(StringMapEntry); | 163 | 11 | | 164 | 11 | StringMapEntry *NewItem = | 165 | 11 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 11 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 11 | | 168 | 11 | // Construct the value. | 169 | 11 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 11 | | 171 | 11 | // Copy the string information. | 172 | 11 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 11 | if (KeyLength > 0) | 174 | 11 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 11 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 11 | return NewItem; | 177 | 11 | } |
llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> >* llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 127 | InitTy &&... InitVals) { | 157 | 127 | size_t KeyLength = Key.size(); | 158 | 127 | | 159 | 127 | // Allocate a new item with space for the string at the end and a null | 160 | 127 | // terminator. | 161 | 127 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 127 | size_t Alignment = alignof(StringMapEntry); | 163 | 127 | | 164 | 127 | StringMapEntry *NewItem = | 165 | 127 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 127 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 127 | | 168 | 127 | // Construct the value. | 169 | 127 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 127 | | 171 | 127 | // Copy the string information. | 172 | 127 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 127 | if (KeyLength > 0) | 174 | 127 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 127 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 127 | return NewItem; | 177 | 127 | } |
llvm::StringMapEntry<clang::GlobalDecl>* llvm::StringMapEntry<clang::GlobalDecl>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, clang::GlobalDecl>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, clang::GlobalDecl&&) Line | Count | Source | 156 | 2.34M | InitTy &&... InitVals) { | 157 | 2.34M | size_t KeyLength = Key.size(); | 158 | 2.34M | | 159 | 2.34M | // Allocate a new item with space for the string at the end and a null | 160 | 2.34M | // terminator. | 161 | 2.34M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 2.34M | size_t Alignment = alignof(StringMapEntry); | 163 | 2.34M | | 164 | 2.34M | StringMapEntry *NewItem = | 165 | 2.34M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 2.34M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 2.34M | | 168 | 2.34M | // Construct the value. | 169 | 2.34M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 2.34M | | 171 | 2.34M | // Copy the string information. | 172 | 2.34M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 2.34M | if (KeyLength > 0) | 174 | 2.34M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 2.34M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 2.34M | return NewItem; | 177 | 2.34M | } |
llvm::StringMapEntry<clang::ASTContext::SectionInfo>* llvm::StringMapEntry<clang::ASTContext::SectionInfo>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 194 | InitTy &&... InitVals) { | 157 | 194 | size_t KeyLength = Key.size(); | 158 | 194 | | 159 | 194 | // Allocate a new item with space for the string at the end and a null | 160 | 194 | // terminator. | 161 | 194 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 194 | size_t Alignment = alignof(StringMapEntry); | 163 | 194 | | 164 | 194 | StringMapEntry *NewItem = | 165 | 194 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 194 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 194 | | 168 | 194 | // Construct the value. | 169 | 194 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 194 | | 171 | 194 | // Copy the string information. | 172 | 194 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 194 | if (KeyLength > 0) | 174 | 194 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 194 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 194 | return NewItem; | 177 | 194 | } |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >* llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 156 | 14 | InitTy &&... InitVals) { | 157 | 14 | size_t KeyLength = Key.size(); | 158 | 14 | | 159 | 14 | // Allocate a new item with space for the string at the end and a null | 160 | 14 | // terminator. | 161 | 14 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 14 | size_t Alignment = alignof(StringMapEntry); | 163 | 14 | | 164 | 14 | StringMapEntry *NewItem = | 165 | 14 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 14 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 14 | | 168 | 14 | // Construct the value. | 169 | 14 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 14 | | 171 | 14 | // Copy the string information. | 172 | 14 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 14 | if (KeyLength > 0) | 174 | 14 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 14 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 14 | return NewItem; | 177 | 14 | } |
llvm::StringMapEntry<clang::FrameworkCacheEntry>* llvm::StringMapEntry<clang::FrameworkCacheEntry>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 156 | 403 | InitTy &&... InitVals) { | 157 | 403 | size_t KeyLength = Key.size(); | 158 | 403 | | 159 | 403 | // Allocate a new item with space for the string at the end and a null | 160 | 403 | // terminator. | 161 | 403 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 403 | size_t Alignment = alignof(StringMapEntry); | 163 | 403 | | 164 | 403 | StringMapEntry *NewItem = | 165 | 403 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 403 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 403 | | 168 | 403 | // Construct the value. | 169 | 403 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 403 | | 171 | 403 | // Copy the string information. | 172 | 403 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 403 | if (KeyLength > 0) | 174 | 403 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 403 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 403 | return NewItem; | 177 | 403 | } |
llvm::StringMapEntry<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > >* llvm::StringMapEntry<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 31.7k | InitTy &&... InitVals) { | 157 | 31.7k | size_t KeyLength = Key.size(); | 158 | 31.7k | | 159 | 31.7k | // Allocate a new item with space for the string at the end and a null | 160 | 31.7k | // terminator. | 161 | 31.7k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 31.7k | size_t Alignment = alignof(StringMapEntry); | 163 | 31.7k | | 164 | 31.7k | StringMapEntry *NewItem = | 165 | 31.7k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 31.7k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 31.7k | | 168 | 31.7k | // Construct the value. | 169 | 31.7k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 31.7k | | 171 | 31.7k | // Copy the string information. | 172 | 31.7k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 31.7k | if (KeyLength > 0) | 174 | 31.7k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 31.7k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 31.7k | return NewItem; | 177 | 31.7k | } |
llvm::StringMapEntry<char const*>* llvm::StringMapEntry<char const*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 105 | InitTy &&... InitVals) { | 157 | 105 | size_t KeyLength = Key.size(); | 158 | 105 | | 159 | 105 | // Allocate a new item with space for the string at the end and a null | 160 | 105 | // terminator. | 161 | 105 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 105 | size_t Alignment = alignof(StringMapEntry); | 163 | 105 | | 164 | 105 | StringMapEntry *NewItem = | 165 | 105 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 105 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 105 | | 168 | 105 | // Construct the value. | 169 | 105 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 105 | | 171 | 105 | // Copy the string information. | 172 | 105 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 105 | if (KeyLength > 0) | 174 | 105 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 105 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 105 | return NewItem; | 177 | 105 | } |
llvm::StringMapEntry<int>* llvm::StringMapEntry<int>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 787k | InitTy &&... InitVals) { | 157 | 787k | size_t KeyLength = Key.size(); | 158 | 787k | | 159 | 787k | // Allocate a new item with space for the string at the end and a null | 160 | 787k | // terminator. | 161 | 787k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 787k | size_t Alignment = alignof(StringMapEntry); | 163 | 787k | | 164 | 787k | StringMapEntry *NewItem = | 165 | 787k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 787k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 787k | | 168 | 787k | // Construct the value. | 169 | 787k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 787k | | 171 | 787k | // Copy the string information. | 172 | 787k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 787k | if (KeyLength > 0) | 174 | 787k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 787k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 787k | return NewItem; | 177 | 787k | } |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >* llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 2.24k | InitTy &&... InitVals) { | 157 | 2.24k | size_t KeyLength = Key.size(); | 158 | 2.24k | | 159 | 2.24k | // Allocate a new item with space for the string at the end and a null | 160 | 2.24k | // terminator. | 161 | 2.24k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 2.24k | size_t Alignment = alignof(StringMapEntry); | 163 | 2.24k | | 164 | 2.24k | StringMapEntry *NewItem = | 165 | 2.24k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 2.24k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 2.24k | | 168 | 2.24k | // Construct the value. | 169 | 2.24k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 2.24k | | 171 | 2.24k | // Copy the string information. | 172 | 2.24k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 2.24k | if (KeyLength > 0) | 174 | 2.24k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 2.24k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 2.24k | return NewItem; | 177 | 2.24k | } |
llvm::StringMapEntry<char>* llvm::StringMapEntry<char>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, char>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, char&&) Line | Count | Source | 156 | 18.3k | InitTy &&... InitVals) { | 157 | 18.3k | size_t KeyLength = Key.size(); | 158 | 18.3k | | 159 | 18.3k | // Allocate a new item with space for the string at the end and a null | 160 | 18.3k | // terminator. | 161 | 18.3k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 18.3k | size_t Alignment = alignof(StringMapEntry); | 163 | 18.3k | | 164 | 18.3k | StringMapEntry *NewItem = | 165 | 18.3k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 18.3k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 18.3k | | 168 | 18.3k | // Construct the value. | 169 | 18.3k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 18.3k | | 171 | 18.3k | // Copy the string information. | 172 | 18.3k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 18.3k | if (KeyLength > 0) | 174 | 18.3k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 18.3k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 18.3k | return NewItem; | 177 | 18.3k | } |
llvm::StringMapEntry<clang::SourceLocation>* llvm::StringMapEntry<clang::SourceLocation>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 15 | InitTy &&... InitVals) { | 157 | 15 | size_t KeyLength = Key.size(); | 158 | 15 | | 159 | 15 | // Allocate a new item with space for the string at the end and a null | 160 | 15 | // terminator. | 161 | 15 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 15 | size_t Alignment = alignof(StringMapEntry); | 163 | 15 | | 164 | 15 | StringMapEntry *NewItem = | 165 | 15 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 15 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 15 | | 168 | 15 | // Construct the value. | 169 | 15 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 15 | | 171 | 15 | // Copy the string information. | 172 | 15 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 15 | if (KeyLength > 0) | 174 | 15 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 15 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 15 | return NewItem; | 177 | 15 | } |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >* llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::Create<llvm::MallocAllocator, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(llvm::StringRef, llvm::MallocAllocator&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >&&) Line | Count | Source | 156 | 3.01M | InitTy &&... InitVals) { | 157 | 3.01M | size_t KeyLength = Key.size(); | 158 | 3.01M | | 159 | 3.01M | // Allocate a new item with space for the string at the end and a null | 160 | 3.01M | // terminator. | 161 | 3.01M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 3.01M | size_t Alignment = alignof(StringMapEntry); | 163 | 3.01M | | 164 | 3.01M | StringMapEntry *NewItem = | 165 | 3.01M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 3.01M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 3.01M | | 168 | 3.01M | // Construct the value. | 169 | 3.01M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 3.01M | | 171 | 3.01M | // Copy the string information. | 172 | 3.01M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 3.01M | if (KeyLength > 0) | 174 | 3.01M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 3.01M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 3.01M | return NewItem; | 177 | 3.01M | } |
llvm::StringMapEntry<clang::LayoutOverrideSource::Layout>* llvm::StringMapEntry<clang::LayoutOverrideSource::Layout>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 37 | InitTy &&... InitVals) { | 157 | 37 | size_t KeyLength = Key.size(); | 158 | 37 | | 159 | 37 | // Allocate a new item with space for the string at the end and a null | 160 | 37 | // terminator. | 161 | 37 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 37 | size_t Alignment = alignof(StringMapEntry); | 163 | 37 | | 164 | 37 | StringMapEntry *NewItem = | 165 | 37 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 37 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 37 | | 168 | 37 | // Construct the value. | 169 | 37 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 37 | | 171 | 37 | // Copy the string information. | 172 | 37 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 37 | if (KeyLength > 0) | 174 | 37 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 37 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 37 | return NewItem; | 177 | 37 | } |
llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash>* llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 157 | InitTy &&... InitVals) { | 157 | 157 | size_t KeyLength = Key.size(); | 158 | 157 | | 159 | 157 | // Allocate a new item with space for the string at the end and a null | 160 | 157 | // terminator. | 161 | 157 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 157 | size_t Alignment = alignof(StringMapEntry); | 163 | 157 | | 164 | 157 | StringMapEntry *NewItem = | 165 | 157 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 157 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 157 | | 168 | 157 | // Construct the value. | 169 | 157 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 157 | | 171 | 157 | // Copy the string information. | 172 | 157 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 157 | if (KeyLength > 0) | 174 | 157 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 157 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 157 | return NewItem; | 177 | 157 | } |
llvm::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>* llvm::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>::Create<llvm::MallocAllocator, clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>(llvm::StringRef, llvm::MallocAllocator&, clang::VerifyDiagnosticConsumer::MarkerTracker::Marker&&) Line | Count | Source | 156 | 842 | InitTy &&... InitVals) { | 157 | 842 | size_t KeyLength = Key.size(); | 158 | 842 | | 159 | 842 | // Allocate a new item with space for the string at the end and a null | 160 | 842 | // terminator. | 161 | 842 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 842 | size_t Alignment = alignof(StringMapEntry); | 163 | 842 | | 164 | 842 | StringMapEntry *NewItem = | 165 | 842 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 842 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 842 | | 168 | 842 | // Construct the value. | 169 | 842 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 842 | | 171 | 842 | // Copy the string information. | 172 | 842 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 842 | if (KeyLength > 0) | 174 | 842 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 842 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 842 | return NewItem; | 177 | 842 | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >* llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 11 | InitTy &&... InitVals) { | 157 | 11 | size_t KeyLength = Key.size(); | 158 | 11 | | 159 | 11 | // Allocate a new item with space for the string at the end and a null | 160 | 11 | // terminator. | 161 | 11 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 11 | size_t Alignment = alignof(StringMapEntry); | 163 | 11 | | 164 | 11 | StringMapEntry *NewItem = | 165 | 11 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 11 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 11 | | 168 | 11 | // Construct the value. | 169 | 11 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 11 | | 171 | 11 | // Copy the string information. | 172 | 11 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 11 | if (KeyLength > 0) | 174 | 11 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 11 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 11 | return NewItem; | 177 | 11 | } |
llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> >* llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 3.95k | InitTy &&... InitVals) { | 157 | 3.95k | size_t KeyLength = Key.size(); | 158 | 3.95k | | 159 | 3.95k | // Allocate a new item with space for the string at the end and a null | 160 | 3.95k | // terminator. | 161 | 3.95k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 3.95k | size_t Alignment = alignof(StringMapEntry); | 163 | 3.95k | | 164 | 3.95k | StringMapEntry *NewItem = | 165 | 3.95k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 3.95k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 3.95k | | 168 | 3.95k | // Construct the value. | 169 | 3.95k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 3.95k | | 171 | 3.95k | // Copy the string information. | 172 | 3.95k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 3.95k | if (KeyLength > 0) | 174 | 3.95k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 3.95k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 3.95k | return NewItem; | 177 | 3.95k | } |
llvm::StringMapEntry<std::__1::shared_ptr<clang::ModuleFileExtension> >* llvm::StringMapEntry<std::__1::shared_ptr<clang::ModuleFileExtension> >::Create<llvm::MallocAllocator, std::__1::shared_ptr<clang::ModuleFileExtension> >(llvm::StringRef, llvm::MallocAllocator&, std::__1::shared_ptr<clang::ModuleFileExtension>&&) Line | Count | Source | 156 | 27 | InitTy &&... InitVals) { | 157 | 27 | size_t KeyLength = Key.size(); | 158 | 27 | | 159 | 27 | // Allocate a new item with space for the string at the end and a null | 160 | 27 | // terminator. | 161 | 27 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 27 | size_t Alignment = alignof(StringMapEntry); | 163 | 27 | | 164 | 27 | StringMapEntry *NewItem = | 165 | 27 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 27 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 27 | | 168 | 27 | // Construct the value. | 169 | 27 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 27 | | 171 | 27 | // Copy the string information. | 172 | 27 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 27 | if (KeyLength > 0) | 174 | 27 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 27 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 27 | return NewItem; | 177 | 27 | } |
llvm::StringMapEntry<llvm::SmallVector<unsigned int, 2u> >* llvm::StringMapEntry<llvm::SmallVector<unsigned int, 2u> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 89.9k | InitTy &&... InitVals) { | 157 | 89.9k | size_t KeyLength = Key.size(); | 158 | 89.9k | | 159 | 89.9k | // Allocate a new item with space for the string at the end and a null | 160 | 89.9k | // terminator. | 161 | 89.9k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 89.9k | size_t Alignment = alignof(StringMapEntry); | 163 | 89.9k | | 164 | 89.9k | StringMapEntry *NewItem = | 165 | 89.9k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 89.9k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 89.9k | | 168 | 89.9k | // Construct the value. | 169 | 89.9k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 89.9k | | 171 | 89.9k | // Copy the string information. | 172 | 89.9k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 89.9k | if (KeyLength > 0) | 174 | 89.9k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 89.9k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 89.9k | return NewItem; | 177 | 89.9k | } |
llvm::StringMapEntry<clang::InMemoryModuleCache::PCM>* llvm::StringMapEntry<clang::InMemoryModuleCache::PCM>::Create<llvm::MallocAllocator, clang::InMemoryModuleCache::PCM>(llvm::StringRef, llvm::MallocAllocator&, clang::InMemoryModuleCache::PCM&&) Line | Count | Source | 156 | 4.25k | InitTy &&... InitVals) { | 157 | 4.25k | size_t KeyLength = Key.size(); | 158 | 4.25k | | 159 | 4.25k | // Allocate a new item with space for the string at the end and a null | 160 | 4.25k | // terminator. | 161 | 4.25k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 4.25k | size_t Alignment = alignof(StringMapEntry); | 163 | 4.25k | | 164 | 4.25k | StringMapEntry *NewItem = | 165 | 4.25k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 4.25k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 4.25k | | 168 | 4.25k | // Construct the value. | 169 | 4.25k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 4.25k | | 171 | 4.25k | // Copy the string information. | 172 | 4.25k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 4.25k | if (KeyLength > 0) | 174 | 4.25k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 4.25k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 4.25k | return NewItem; | 177 | 4.25k | } |
llvm::StringMapEntry<clang::InMemoryModuleCache::PCM>* llvm::StringMapEntry<clang::InMemoryModuleCache::PCM>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 1.27k | InitTy &&... InitVals) { | 157 | 1.27k | size_t KeyLength = Key.size(); | 158 | 1.27k | | 159 | 1.27k | // Allocate a new item with space for the string at the end and a null | 160 | 1.27k | // terminator. | 161 | 1.27k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 1.27k | size_t Alignment = alignof(StringMapEntry); | 163 | 1.27k | | 164 | 1.27k | StringMapEntry *NewItem = | 165 | 1.27k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 1.27k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 1.27k | | 168 | 1.27k | // Construct the value. | 169 | 1.27k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 1.27k | | 171 | 1.27k | // Copy the string information. | 172 | 1.27k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 1.27k | if (KeyLength > 0) | 174 | 1.27k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 1.27k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 1.27k | return NewItem; | 177 | 1.27k | } |
llvm::StringMapEntry<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > >* llvm::StringMapEntry<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 85 | InitTy &&... InitVals) { | 157 | 85 | size_t KeyLength = Key.size(); | 158 | 85 | | 159 | 85 | // Allocate a new item with space for the string at the end and a null | 160 | 85 | // terminator. | 161 | 85 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 85 | size_t Alignment = alignof(StringMapEntry); | 163 | 85 | | 164 | 85 | StringMapEntry *NewItem = | 165 | 85 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 85 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 85 | | 168 | 85 | // Construct the value. | 169 | 85 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 85 | | 171 | 85 | // Copy the string information. | 172 | 85 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 85 | if (KeyLength > 0) | 174 | 85 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 85 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 85 | return NewItem; | 177 | 85 | } |
llvm::StringMapEntry<unsigned int const*>* llvm::StringMapEntry<unsigned int const*>::Create<llvm::MallocAllocator, unsigned int const*>(llvm::StringRef, llvm::MallocAllocator&, unsigned int const*&&) Line | Count | Source | 156 | 7.40k | InitTy &&... InitVals) { | 157 | 7.40k | size_t KeyLength = Key.size(); | 158 | 7.40k | | 159 | 7.40k | // Allocate a new item with space for the string at the end and a null | 160 | 7.40k | // terminator. | 161 | 7.40k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 7.40k | size_t Alignment = alignof(StringMapEntry); | 163 | 7.40k | | 164 | 7.40k | StringMapEntry *NewItem = | 165 | 7.40k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 7.40k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 7.40k | | 168 | 7.40k | // Construct the value. | 169 | 7.40k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 7.40k | | 171 | 7.40k | // Copy the string information. | 172 | 7.40k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 7.40k | if (KeyLength > 0) | 174 | 7.40k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 7.40k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 7.40k | return NewItem; | 177 | 7.40k | } |
llvm::StringMapEntry<llvm::MachineMemOperand::Flags>* llvm::StringMapEntry<llvm::MachineMemOperand::Flags>::Create<llvm::MallocAllocator, llvm::MachineMemOperand::Flags>(llvm::StringRef, llvm::MallocAllocator&, llvm::MachineMemOperand::Flags&&) Line | Count | Source | 156 | 6 | InitTy &&... InitVals) { | 157 | 6 | size_t KeyLength = Key.size(); | 158 | 6 | | 159 | 6 | // Allocate a new item with space for the string at the end and a null | 160 | 6 | // terminator. | 161 | 6 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 6 | size_t Alignment = alignof(StringMapEntry); | 163 | 6 | | 164 | 6 | StringMapEntry *NewItem = | 165 | 6 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 6 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 6 | | 168 | 6 | // Construct the value. | 169 | 6 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 6 | | 171 | 6 | // Copy the string information. | 172 | 6 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 6 | if (KeyLength > 0) | 174 | 6 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 6 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 6 | return NewItem; | 177 | 6 | } |
llvm::StringMapEntry<llvm::TargetRegisterClass const*>* llvm::StringMapEntry<llvm::TargetRegisterClass const*>::Create<llvm::MallocAllocator, llvm::TargetRegisterClass const*>(llvm::StringRef, llvm::MallocAllocator&, llvm::TargetRegisterClass const*&&) Line | Count | Source | 156 | 232k | InitTy &&... InitVals) { | 157 | 232k | size_t KeyLength = Key.size(); | 158 | 232k | | 159 | 232k | // Allocate a new item with space for the string at the end and a null | 160 | 232k | // terminator. | 161 | 232k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 232k | size_t Alignment = alignof(StringMapEntry); | 163 | 232k | | 164 | 232k | StringMapEntry *NewItem = | 165 | 232k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 232k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 232k | | 168 | 232k | // Construct the value. | 169 | 232k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 232k | | 171 | 232k | // Copy the string information. | 172 | 232k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 232k | if (KeyLength > 0) | 174 | 232k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 232k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 232k | return NewItem; | 177 | 232k | } |
llvm::StringMapEntry<llvm::RegisterBank const*>* llvm::StringMapEntry<llvm::RegisterBank const*>::Create<llvm::MallocAllocator, llvm::RegisterBank const*>(llvm::StringRef, llvm::MallocAllocator&, llvm::RegisterBank const*&&) Line | Count | Source | 156 | 6.12k | InitTy &&... InitVals) { | 157 | 6.12k | size_t KeyLength = Key.size(); | 158 | 6.12k | | 159 | 6.12k | // Allocate a new item with space for the string at the end and a null | 160 | 6.12k | // terminator. | 161 | 6.12k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 6.12k | size_t Alignment = alignof(StringMapEntry); | 163 | 6.12k | | 164 | 6.12k | StringMapEntry *NewItem = | 165 | 6.12k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 6.12k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 6.12k | | 168 | 6.12k | // Construct the value. | 169 | 6.12k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 6.12k | | 171 | 6.12k | // Copy the string information. | 172 | 6.12k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 6.12k | if (KeyLength > 0) | 174 | 6.12k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 6.12k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 6.12k | return NewItem; | 177 | 6.12k | } |
llvm::StringMapEntry<llvm::VRegInfo*>* llvm::StringMapEntry<llvm::VRegInfo*>::Create<llvm::MallocAllocator, llvm::VRegInfo*>(llvm::StringRef, llvm::MallocAllocator&, llvm::VRegInfo*&&) Line | Count | Source | 156 | 27 | InitTy &&... InitVals) { | 157 | 27 | size_t KeyLength = Key.size(); | 158 | 27 | | 159 | 27 | // Allocate a new item with space for the string at the end and a null | 160 | 27 | // terminator. | 161 | 27 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 27 | size_t Alignment = alignof(StringMapEntry); | 163 | 27 | | 164 | 27 | StringMapEntry *NewItem = | 165 | 27 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 27 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 27 | | 168 | 27 | // Construct the value. | 169 | 27 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 27 | | 171 | 27 | // Copy the string information. | 172 | 27 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 27 | if (KeyLength > 0) | 174 | 27 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 27 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 27 | return NewItem; | 177 | 27 | } |
llvm::StringMapEntry<llvm::DIE const*>* llvm::StringMapEntry<llvm::DIE const*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 70.3k | InitTy &&... InitVals) { | 157 | 70.3k | size_t KeyLength = Key.size(); | 158 | 70.3k | | 159 | 70.3k | // Allocate a new item with space for the string at the end and a null | 160 | 70.3k | // terminator. | 161 | 70.3k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 70.3k | size_t Alignment = alignof(StringMapEntry); | 163 | 70.3k | | 164 | 70.3k | StringMapEntry *NewItem = | 165 | 70.3k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 70.3k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 70.3k | | 168 | 70.3k | // Construct the value. | 169 | 70.3k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 70.3k | | 171 | 70.3k | // Copy the string information. | 172 | 70.3k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 70.3k | if (KeyLength > 0) | 174 | 70.2k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 70.3k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 70.3k | return NewItem; | 177 | 70.3k | } |
llvm::StringMapEntry<llvm::DIE const*>* llvm::StringMapEntry<llvm::DIE const*>::Create<llvm::MallocAllocator, llvm::DIE const*>(llvm::StringRef, llvm::MallocAllocator&, llvm::DIE const*&&) Line | Count | Source | 156 | 18 | InitTy &&... InitVals) { | 157 | 18 | size_t KeyLength = Key.size(); | 158 | 18 | | 159 | 18 | // Allocate a new item with space for the string at the end and a null | 160 | 18 | // terminator. | 161 | 18 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 18 | size_t Alignment = alignof(StringMapEntry); | 163 | 18 | | 164 | 18 | StringMapEntry *NewItem = | 165 | 18 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 18 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 18 | | 168 | 18 | // Construct the value. | 169 | 18 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 18 | | 171 | 18 | // Copy the string information. | 172 | 18 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 18 | if (KeyLength > 0) | 174 | 18 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 18 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 18 | return NewItem; | 177 | 18 | } |
llvm::StringMapEntry<llvm::AccelTableBase::HashData>* llvm::StringMapEntry<llvm::AccelTableBase::HashData>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, llvm::DwarfStringPoolEntryRef&, unsigned int (*&)(llvm::StringRef)>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::DwarfStringPoolEntryRef&&&, unsigned int (*&&&)(llvm::StringRef)) Line | Count | Source | 156 | 71.8k | InitTy &&... InitVals) { | 157 | 71.8k | size_t KeyLength = Key.size(); | 158 | 71.8k | | 159 | 71.8k | // Allocate a new item with space for the string at the end and a null | 160 | 71.8k | // terminator. | 161 | 71.8k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 71.8k | size_t Alignment = alignof(StringMapEntry); | 163 | 71.8k | | 164 | 71.8k | StringMapEntry *NewItem = | 165 | 71.8k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 71.8k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 71.8k | | 168 | 71.8k | // Construct the value. | 169 | 71.8k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 71.8k | | 171 | 71.8k | // Copy the string information. | 172 | 71.8k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 71.8k | if (KeyLength > 0) | 174 | 71.8k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 71.8k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 71.8k | return NewItem; | 177 | 71.8k | } |
llvm::StringMapEntry<llvm::DwarfStringPoolEntry>* llvm::StringMapEntry<llvm::DwarfStringPoolEntry>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, llvm::DwarfStringPoolEntry>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, llvm::DwarfStringPoolEntry&&) Line | Count | Source | 156 | 85.0k | InitTy &&... InitVals) { | 157 | 85.0k | size_t KeyLength = Key.size(); | 158 | 85.0k | | 159 | 85.0k | // Allocate a new item with space for the string at the end and a null | 160 | 85.0k | // terminator. | 161 | 85.0k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 85.0k | size_t Alignment = alignof(StringMapEntry); | 163 | 85.0k | | 164 | 85.0k | StringMapEntry *NewItem = | 165 | 85.0k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 85.0k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 85.0k | | 168 | 85.0k | // Construct the value. | 169 | 85.0k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 85.0k | | 171 | 85.0k | // Copy the string information. | 172 | 85.0k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 85.0k | if (KeyLength > 0) | 174 | 84.6k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 85.0k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 85.0k | return NewItem; | 177 | 85.0k | } |
llvm::StringMapEntry<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> >* llvm::StringMapEntry<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 9 | InitTy &&... InitVals) { | 157 | 9 | size_t KeyLength = Key.size(); | 158 | 9 | | 159 | 9 | // Allocate a new item with space for the string at the end and a null | 160 | 9 | // terminator. | 161 | 9 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 9 | size_t Alignment = alignof(StringMapEntry); | 163 | 9 | | 164 | 9 | StringMapEntry *NewItem = | 165 | 9 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 9 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 9 | | 168 | 9 | // Construct the value. | 169 | 9 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 9 | | 171 | 9 | // Copy the string information. | 172 | 9 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 9 | if (KeyLength > 0) | 174 | 9 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 9 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 9 | return NewItem; | 177 | 9 | } |
llvm::StringMapEntry<unsigned short>* llvm::StringMapEntry<unsigned short>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 47 | InitTy &&... InitVals) { | 157 | 47 | size_t KeyLength = Key.size(); | 158 | 47 | | 159 | 47 | // Allocate a new item with space for the string at the end and a null | 160 | 47 | // terminator. | 161 | 47 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 47 | size_t Alignment = alignof(StringMapEntry); | 163 | 47 | | 164 | 47 | StringMapEntry *NewItem = | 165 | 47 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 47 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 47 | | 168 | 47 | // Construct the value. | 169 | 47 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 47 | | 171 | 47 | // Copy the string information. | 172 | 47 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 47 | if (KeyLength > 0) | 174 | 47 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 47 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 47 | return NewItem; | 177 | 47 | } |
llvm::StringMapEntry<llvm::SDNode*>* llvm::StringMapEntry<llvm::SDNode*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 14.8k | InitTy &&... InitVals) { | 157 | 14.8k | size_t KeyLength = Key.size(); | 158 | 14.8k | | 159 | 14.8k | // Allocate a new item with space for the string at the end and a null | 160 | 14.8k | // terminator. | 161 | 14.8k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 14.8k | size_t Alignment = alignof(StringMapEntry); | 163 | 14.8k | | 164 | 14.8k | StringMapEntry *NewItem = | 165 | 14.8k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 14.8k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 14.8k | | 168 | 14.8k | // Construct the value. | 169 | 14.8k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 14.8k | | 171 | 14.8k | // Copy the string information. | 172 | 14.8k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 14.8k | if (KeyLength > 0) | 174 | 14.8k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 14.8k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 14.8k | return NewItem; | 177 | 14.8k | } |
llvm::StringMapEntry<llvm::lto::LTO::GlobalResolution>* llvm::StringMapEntry<llvm::lto::LTO::GlobalResolution>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 1.06k | InitTy &&... InitVals) { | 157 | 1.06k | size_t KeyLength = Key.size(); | 158 | 1.06k | | 159 | 1.06k | // Allocate a new item with space for the string at the end and a null | 160 | 1.06k | // terminator. | 161 | 1.06k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 1.06k | size_t Alignment = alignof(StringMapEntry); | 163 | 1.06k | | 164 | 1.06k | StringMapEntry *NewItem = | 165 | 1.06k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 1.06k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 1.06k | | 168 | 1.06k | // Construct the value. | 169 | 1.06k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 1.06k | | 171 | 1.06k | // Copy the string information. | 172 | 1.06k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 1.06k | if (KeyLength > 0) | 174 | 1.06k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 1.06k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 1.06k | return NewItem; | 177 | 1.06k | } |
llvm::StringMapEntry<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > >* llvm::StringMapEntry<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 431 | InitTy &&... InitVals) { | 157 | 431 | size_t KeyLength = Key.size(); | 158 | 431 | | 159 | 431 | // Allocate a new item with space for the string at the end and a null | 160 | 431 | // terminator. | 161 | 431 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 431 | size_t Alignment = alignof(StringMapEntry); | 163 | 431 | | 164 | 431 | StringMapEntry *NewItem = | 165 | 431 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 431 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 431 | | 168 | 431 | // Construct the value. | 169 | 431 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 431 | | 171 | 431 | // Copy the string information. | 172 | 431 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 431 | if (KeyLength > 0) | 174 | 428 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 431 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 431 | return NewItem; | 177 | 431 | } |
llvm::StringMapEntry<clang::Stmt*>* llvm::StringMapEntry<clang::Stmt*>::Create<llvm::MallocAllocator, clang::Stmt*>(llvm::StringRef, llvm::MallocAllocator&, clang::Stmt*&&) Line | Count | Source | 156 | 2 | InitTy &&... InitVals) { | 157 | 2 | size_t KeyLength = Key.size(); | 158 | 2 | | 159 | 2 | // Allocate a new item with space for the string at the end and a null | 160 | 2 | // terminator. | 161 | 2 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 2 | size_t Alignment = alignof(StringMapEntry); | 163 | 2 | | 164 | 2 | StringMapEntry *NewItem = | 165 | 2 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 2 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 2 | | 168 | 2 | // Construct the value. | 169 | 2 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 2 | | 171 | 2 | // Copy the string information. | 172 | 2 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 2 | if (KeyLength > 0) | 174 | 2 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 2 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 2 | return NewItem; | 177 | 2 | } |
llvm::StringMapEntry<clang::Stmt*>* llvm::StringMapEntry<clang::Stmt*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 13.0k | InitTy &&... InitVals) { | 157 | 13.0k | size_t KeyLength = Key.size(); | 158 | 13.0k | | 159 | 13.0k | // Allocate a new item with space for the string at the end and a null | 160 | 13.0k | // terminator. | 161 | 13.0k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 13.0k | size_t Alignment = alignof(StringMapEntry); | 163 | 13.0k | | 164 | 13.0k | StringMapEntry *NewItem = | 165 | 13.0k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 13.0k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 13.0k | | 168 | 13.0k | // Construct the value. | 169 | 13.0k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 13.0k | | 171 | 13.0k | // Copy the string information. | 172 | 13.0k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 13.0k | if (KeyLength > 0) | 174 | 13.0k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 13.0k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 13.0k | return NewItem; | 177 | 13.0k | } |
llvm::StringMapEntry<FoundationClass>* llvm::StringMapEntry<FoundationClass>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 91 | InitTy &&... InitVals) { | 157 | 91 | size_t KeyLength = Key.size(); | 158 | 91 | | 159 | 91 | // Allocate a new item with space for the string at the end and a null | 160 | 91 | // terminator. | 161 | 91 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 91 | size_t Alignment = alignof(StringMapEntry); | 163 | 91 | | 164 | 91 | StringMapEntry *NewItem = | 165 | 91 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 91 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 91 | | 168 | 91 | // Construct the value. | 169 | 91 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 91 | | 171 | 91 | // Copy the string information. | 172 | 91 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 91 | if (KeyLength > 0) | 174 | 91 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 91 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 91 | return NewItem; | 177 | 91 | } |
llvm::StringMapEntry<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >* llvm::StringMapEntry<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 20 | InitTy &&... InitVals) { | 157 | 20 | size_t KeyLength = Key.size(); | 158 | 20 | | 159 | 20 | // Allocate a new item with space for the string at the end and a null | 160 | 20 | // terminator. | 161 | 20 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 20 | size_t Alignment = alignof(StringMapEntry); | 163 | 20 | | 164 | 20 | StringMapEntry *NewItem = | 165 | 20 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 20 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 20 | | 168 | 20 | // Construct the value. | 169 | 20 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 20 | | 171 | 20 | // Copy the string information. | 172 | 20 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 20 | if (KeyLength > 0) | 174 | 20 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 20 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 20 | return NewItem; | 177 | 20 | } |
StdLibraryFunctionsChecker.cpp:llvm::StringMapEntry<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >* llvm::StringMapEntry<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >::Create<llvm::MallocAllocator, std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >(llvm::StringRef, llvm::MallocAllocator&, std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >&&) Line | Count | Source | 156 | 286 | InitTy &&... InitVals) { | 157 | 286 | size_t KeyLength = Key.size(); | 158 | 286 | | 159 | 286 | // Allocate a new item with space for the string at the end and a null | 160 | 286 | // terminator. | 161 | 286 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 286 | size_t Alignment = alignof(StringMapEntry); | 163 | 286 | | 164 | 286 | StringMapEntry *NewItem = | 165 | 286 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 286 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 286 | | 168 | 286 | // Construct the value. | 169 | 286 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 286 | | 171 | 286 | // Copy the string information. | 172 | 286 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 286 | if (KeyLength > 0) | 174 | 286 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 286 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 286 | return NewItem; | 177 | 286 | } |
llvm::StringMapEntry<clang::ento::BugType*>* llvm::StringMapEntry<clang::ento::BugType*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 709 | InitTy &&... InitVals) { | 157 | 709 | size_t KeyLength = Key.size(); | 158 | 709 | | 159 | 709 | // Allocate a new item with space for the string at the end and a null | 160 | 709 | // terminator. | 161 | 709 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 709 | size_t Alignment = alignof(StringMapEntry); | 163 | 709 | | 164 | 709 | StringMapEntry *NewItem = | 165 | 709 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 709 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 709 | | 168 | 709 | // Construct the value. | 169 | 709 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 709 | | 171 | 709 | // Copy the string information. | 172 | 709 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 709 | if (KeyLength > 0) | 174 | 709 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 709 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 709 | return NewItem; | 177 | 709 | } |
llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >* llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::Create<llvm::MallocAllocator, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >&>(llvm::StringRef, llvm::MallocAllocator&, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >&&&) Line | Count | Source | 156 | 119 | InitTy &&... InitVals) { | 157 | 119 | size_t KeyLength = Key.size(); | 158 | 119 | | 159 | 119 | // Allocate a new item with space for the string at the end and a null | 160 | 119 | // terminator. | 161 | 119 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 119 | size_t Alignment = alignof(StringMapEntry); | 163 | 119 | | 164 | 119 | StringMapEntry *NewItem = | 165 | 119 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 119 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 119 | | 168 | 119 | // Construct the value. | 169 | 119 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 119 | | 171 | 119 | // Copy the string information. | 172 | 119 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 119 | if (KeyLength > 0) | 174 | 119 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 119 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 119 | return NewItem; | 177 | 119 | } |
llvm::StringMapEntry<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >* llvm::StringMapEntry<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 32 | InitTy &&... InitVals) { | 157 | 32 | size_t KeyLength = Key.size(); | 158 | 32 | | 159 | 32 | // Allocate a new item with space for the string at the end and a null | 160 | 32 | // terminator. | 161 | 32 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 32 | size_t Alignment = alignof(StringMapEntry); | 163 | 32 | | 164 | 32 | StringMapEntry *NewItem = | 165 | 32 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 32 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 32 | | 168 | 32 | // Construct the value. | 169 | 32 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 32 | | 171 | 32 | // Copy the string information. | 172 | 32 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 32 | if (KeyLength > 0) | 174 | 32 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 32 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 32 | return NewItem; | 177 | 32 | } |
llvm::StringMapEntry<clang::ASTUnit*>* llvm::StringMapEntry<clang::ASTUnit*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 57 | InitTy &&... InitVals) { | 157 | 57 | size_t KeyLength = Key.size(); | 158 | 57 | | 159 | 57 | // Allocate a new item with space for the string at the end and a null | 160 | 57 | // terminator. | 161 | 57 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 57 | size_t Alignment = alignof(StringMapEntry); | 163 | 57 | | 164 | 57 | StringMapEntry *NewItem = | 165 | 57 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 57 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 57 | | 168 | 57 | // Construct the value. | 169 | 57 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 57 | | 171 | 57 | // Copy the string information. | 172 | 57 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 57 | if (KeyLength > 0) | 174 | 57 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 57 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 57 | return NewItem; | 177 | 57 | } |
llvm::StringMapEntry<llvm::SmallVector<clang::TypoCorrection, 1u> >* llvm::StringMapEntry<llvm::SmallVector<clang::TypoCorrection, 1u> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 10.2k | InitTy &&... InitVals) { | 157 | 10.2k | size_t KeyLength = Key.size(); | 158 | 10.2k | | 159 | 10.2k | // Allocate a new item with space for the string at the end and a null | 160 | 10.2k | // terminator. | 161 | 10.2k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 10.2k | size_t Alignment = alignof(StringMapEntry); | 163 | 10.2k | | 164 | 10.2k | StringMapEntry *NewItem = | 165 | 10.2k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 10.2k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 10.2k | | 168 | 10.2k | // Construct the value. | 169 | 10.2k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 10.2k | | 171 | 10.2k | // Copy the string information. | 172 | 10.2k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 10.2k | if (KeyLength > 0) | 174 | 10.2k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 10.2k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 10.2k | return NewItem; | 177 | 10.2k | } |
llvm::StringMapEntry<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >* llvm::StringMapEntry<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 3 | InitTy &&... InitVals) { | 157 | 3 | size_t KeyLength = Key.size(); | 158 | 3 | | 159 | 3 | // Allocate a new item with space for the string at the end and a null | 160 | 3 | // terminator. | 161 | 3 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 3 | size_t Alignment = alignof(StringMapEntry); | 163 | 3 | | 164 | 3 | StringMapEntry *NewItem = | 165 | 3 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 3 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 3 | | 168 | 3 | // Construct the value. | 169 | 3 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 3 | | 171 | 3 | // Copy the string information. | 172 | 3 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 3 | if (KeyLength > 0) | 174 | 3 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 3 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 3 | return NewItem; | 177 | 3 | } |
llvm::StringMapEntry<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >* llvm::StringMapEntry<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >::Create<llvm::MallocAllocator, clang::OMPCriticalDirective const*&, llvm::APSInt&>(llvm::StringRef, llvm::MallocAllocator&, clang::OMPCriticalDirective const*&&&, llvm::APSInt&&&) Line | Count | Source | 156 | 38 | InitTy &&... InitVals) { | 157 | 38 | size_t KeyLength = Key.size(); | 158 | 38 | | 159 | 38 | // Allocate a new item with space for the string at the end and a null | 160 | 38 | // terminator. | 161 | 38 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 38 | size_t Alignment = alignof(StringMapEntry); | 163 | 38 | | 164 | 38 | StringMapEntry *NewItem = | 165 | 38 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 38 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 38 | | 168 | 38 | // Construct the value. | 169 | 38 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 38 | | 171 | 38 | // Copy the string information. | 172 | 38 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 38 | if (KeyLength > 0) | 174 | 38 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 38 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 38 | return NewItem; | 177 | 38 | } |
llvm::StringMapEntry<llvm::TimeRecord>* llvm::StringMapEntry<llvm::TimeRecord>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 1 | InitTy &&... InitVals) { | 157 | 1 | size_t KeyLength = Key.size(); | 158 | 1 | | 159 | 1 | // Allocate a new item with space for the string at the end and a null | 160 | 1 | // terminator. | 161 | 1 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 1 | size_t Alignment = alignof(StringMapEntry); | 163 | 1 | | 164 | 1 | StringMapEntry *NewItem = | 165 | 1 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 1 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 1 | | 168 | 1 | // Construct the value. | 169 | 1 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 1 | | 171 | 1 | // Copy the string information. | 172 | 1 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 1 | if (KeyLength > 0) | 174 | 1 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 1 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 1 | return NewItem; | 177 | 1 | } |
llvm::StringMapEntry<clang::StringLiteral*>* llvm::StringMapEntry<clang::StringLiteral*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 65 | InitTy &&... InitVals) { | 157 | 65 | size_t KeyLength = Key.size(); | 158 | 65 | | 159 | 65 | // Allocate a new item with space for the string at the end and a null | 160 | 65 | // terminator. | 161 | 65 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 65 | size_t Alignment = alignof(StringMapEntry); | 163 | 65 | | 164 | 65 | StringMapEntry *NewItem = | 165 | 65 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 65 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 65 | | 168 | 65 | // Construct the value. | 169 | 65 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 65 | | 171 | 65 | // Copy the string information. | 172 | 65 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 65 | if (KeyLength > 0) | 174 | 60 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 65 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 65 | return NewItem; | 177 | 65 | } |
llvm::StringMapEntry<clang::comments::TParamCommandComment*>* llvm::StringMapEntry<clang::comments::TParamCommandComment*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 90 | InitTy &&... InitVals) { | 157 | 90 | size_t KeyLength = Key.size(); | 158 | 90 | | 159 | 90 | // Allocate a new item with space for the string at the end and a null | 160 | 90 | // terminator. | 161 | 90 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 90 | size_t Alignment = alignof(StringMapEntry); | 163 | 90 | | 164 | 90 | StringMapEntry *NewItem = | 165 | 90 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 90 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 90 | | 168 | 90 | // Construct the value. | 169 | 90 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 90 | | 171 | 90 | // Copy the string information. | 172 | 90 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 90 | if (KeyLength > 0) | 174 | 90 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 90 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 90 | return NewItem; | 177 | 90 | } |
llvm::StringMapEntry<char>* llvm::StringMapEntry<char>::Create<llvm::MallocAllocator, int>(llvm::StringRef, llvm::MallocAllocator&, int&&) Line | Count | Source | 156 | 3 | InitTy &&... InitVals) { | 157 | 3 | size_t KeyLength = Key.size(); | 158 | 3 | | 159 | 3 | // Allocate a new item with space for the string at the end and a null | 160 | 3 | // terminator. | 161 | 3 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 3 | size_t Alignment = alignof(StringMapEntry); | 163 | 3 | | 164 | 3 | StringMapEntry *NewItem = | 165 | 3 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 3 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 3 | | 168 | 3 | // Construct the value. | 169 | 3 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 3 | | 171 | 3 | // Copy the string information. | 172 | 3 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 3 | if (KeyLength > 0) | 174 | 3 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 3 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 3 | return NewItem; | 177 | 3 | } |
llvm::StringMapEntry<clang::HeaderSearch::LookupFileCacheInfo>* llvm::StringMapEntry<clang::HeaderSearch::LookupFileCacheInfo>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 156 | 374k | InitTy &&... InitVals) { | 157 | 374k | size_t KeyLength = Key.size(); | 158 | 374k | | 159 | 374k | // Allocate a new item with space for the string at the end and a null | 160 | 374k | // terminator. | 161 | 374k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 374k | size_t Alignment = alignof(StringMapEntry); | 163 | 374k | | 164 | 374k | StringMapEntry *NewItem = | 165 | 374k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 374k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 374k | | 168 | 374k | // Construct the value. | 169 | 374k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 374k | | 171 | 374k | // Copy the string information. | 172 | 374k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 374k | if (KeyLength > 0) | 174 | 374k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 374k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 374k | return NewItem; | 177 | 374k | } |
Unexecuted instantiation: llvm::StringMapEntry<clang::FrameworkCacheEntry>* llvm::StringMapEntry<clang::FrameworkCacheEntry>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, clang::FrameworkCacheEntry>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, clang::FrameworkCacheEntry&&) llvm::StringMapEntry<llvm::StringSet<llvm::MallocAllocator> >* llvm::StringMapEntry<llvm::StringSet<llvm::MallocAllocator> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 14 | InitTy &&... InitVals) { | 157 | 14 | size_t KeyLength = Key.size(); | 158 | 14 | | 159 | 14 | // Allocate a new item with space for the string at the end and a null | 160 | 14 | // terminator. | 161 | 14 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 14 | size_t Alignment = alignof(StringMapEntry); | 163 | 14 | | 164 | 14 | StringMapEntry *NewItem = | 165 | 14 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 14 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 14 | | 168 | 14 | // Construct the value. | 169 | 14 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 14 | | 171 | 14 | // Copy the string information. | 172 | 14 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 14 | if (KeyLength > 0) | 174 | 14 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 14 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 14 | return NewItem; | 177 | 14 | } |
llvm::StringMapEntry<clang::Module*>* llvm::StringMapEntry<clang::Module*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 74.0k | InitTy &&... InitVals) { | 157 | 74.0k | size_t KeyLength = Key.size(); | 158 | 74.0k | | 159 | 74.0k | // Allocate a new item with space for the string at the end and a null | 160 | 74.0k | // terminator. | 161 | 74.0k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 74.0k | size_t Alignment = alignof(StringMapEntry); | 163 | 74.0k | | 164 | 74.0k | StringMapEntry *NewItem = | 165 | 74.0k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 74.0k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 74.0k | | 168 | 74.0k | // Construct the value. | 169 | 74.0k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 74.0k | | 171 | 74.0k | // Copy the string information. | 172 | 74.0k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 74.0k | if (KeyLength > 0) | 174 | 74.0k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 74.0k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 74.0k | return NewItem; | 177 | 74.0k | } |
llvm::StringMapEntry<clang::PragmaHandler*>* llvm::StringMapEntry<clang::PragmaHandler*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 2.25M | InitTy &&... InitVals) { | 157 | 2.25M | size_t KeyLength = Key.size(); | 158 | 2.25M | | 159 | 2.25M | // Allocate a new item with space for the string at the end and a null | 160 | 2.25M | // terminator. | 161 | 2.25M | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 2.25M | size_t Alignment = alignof(StringMapEntry); | 163 | 2.25M | | 164 | 2.25M | StringMapEntry *NewItem = | 165 | 2.25M | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 2.25M | assert(NewItem && "Unhandled out-of-memory"); | 167 | 2.25M | | 168 | 2.25M | // Construct the value. | 169 | 2.25M | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 2.25M | | 171 | 2.25M | // Copy the string information. | 172 | 2.25M | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 2.25M | if (KeyLength > 0) | 174 | 2.20M | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 2.25M | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 2.25M | return NewItem; | 177 | 2.25M | } |
llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> >* llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> >::Create<llvm::MallocAllocator, std::__1::pair<llvm::Type*, llvm::SMLoc> >(llvm::StringRef, llvm::MallocAllocator&, std::__1::pair<llvm::Type*, llvm::SMLoc>&&) Line | Count | Source | 156 | 55 | InitTy &&... InitVals) { | 157 | 55 | size_t KeyLength = Key.size(); | 158 | 55 | | 159 | 55 | // Allocate a new item with space for the string at the end and a null | 160 | 55 | // terminator. | 161 | 55 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 55 | size_t Alignment = alignof(StringMapEntry); | 163 | 55 | | 164 | 55 | StringMapEntry *NewItem = | 165 | 55 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 55 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 55 | | 168 | 55 | // Construct the value. | 169 | 55 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 55 | | 171 | 55 | // Copy the string information. | 172 | 55 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 55 | if (KeyLength > 0) | 174 | 55 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 55 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 55 | return NewItem; | 177 | 55 | } |
llvm::StringMapEntry<llvm::Type*>* llvm::StringMapEntry<llvm::Type*>::Create<llvm::MallocAllocator, llvm::Type*>(llvm::StringRef, llvm::MallocAllocator&, llvm::Type*&&) Line | Count | Source | 156 | 91 | InitTy &&... InitVals) { | 157 | 91 | size_t KeyLength = Key.size(); | 158 | 91 | | 159 | 91 | // Allocate a new item with space for the string at the end and a null | 160 | 91 | // terminator. | 161 | 91 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 91 | size_t Alignment = alignof(StringMapEntry); | 163 | 91 | | 164 | 91 | StringMapEntry *NewItem = | 165 | 91 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 91 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 91 | | 168 | 91 | // Construct the value. | 169 | 91 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 91 | | 171 | 91 | // Copy the string information. | 172 | 91 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 91 | if (KeyLength > 0) | 174 | 91 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 91 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 91 | return NewItem; | 177 | 91 | } |
llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> >* llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 12.6k | InitTy &&... InitVals) { | 157 | 12.6k | size_t KeyLength = Key.size(); | 158 | 12.6k | | 159 | 12.6k | // Allocate a new item with space for the string at the end and a null | 160 | 12.6k | // terminator. | 161 | 12.6k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 12.6k | size_t Alignment = alignof(StringMapEntry); | 163 | 12.6k | | 164 | 12.6k | StringMapEntry *NewItem = | 165 | 12.6k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 12.6k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 12.6k | | 168 | 12.6k | // Construct the value. | 169 | 12.6k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 12.6k | | 171 | 12.6k | // Copy the string information. | 172 | 12.6k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 12.6k | if (KeyLength > 0) | 174 | 12.6k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 12.6k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 12.6k | return NewItem; | 177 | 12.6k | } |
llvm::StringMapEntry<llvm::sampleprof::FunctionSamples>* llvm::StringMapEntry<llvm::sampleprof::FunctionSamples>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 340 | InitTy &&... InitVals) { | 157 | 340 | size_t KeyLength = Key.size(); | 158 | 340 | | 159 | 340 | // Allocate a new item with space for the string at the end and a null | 160 | 340 | // terminator. | 161 | 340 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 340 | size_t Alignment = alignof(StringMapEntry); | 163 | 340 | | 164 | 340 | StringMapEntry *NewItem = | 165 | 340 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 340 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 340 | | 168 | 340 | // Construct the value. | 169 | 340 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 340 | | 171 | 340 | // Copy the string information. | 172 | 340 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 340 | if (KeyLength > 0) | 174 | 340 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 340 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 340 | return NewItem; | 177 | 340 | } |
llvm::StringMapEntry<llvm::RecordStreamer::State>* llvm::StringMapEntry<llvm::RecordStreamer::State>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 264 | InitTy &&... InitVals) { | 157 | 264 | size_t KeyLength = Key.size(); | 158 | 264 | | 159 | 264 | // Allocate a new item with space for the string at the end and a null | 160 | 264 | // terminator. | 161 | 264 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 264 | size_t Alignment = alignof(StringMapEntry); | 163 | 264 | | 164 | 264 | StringMapEntry *NewItem = | 165 | 264 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 264 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 264 | | 168 | 264 | // Construct the value. | 169 | 264 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 264 | | 171 | 264 | // Copy the string information. | 172 | 264 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 264 | if (KeyLength > 0) | 174 | 264 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 264 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 264 | return NewItem; | 177 | 264 | } |
llvm::StringMapEntry<llvm::GlobalValue const*>* llvm::StringMapEntry<llvm::GlobalValue const*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 255 | InitTy &&... InitVals) { | 157 | 255 | size_t KeyLength = Key.size(); | 158 | 255 | | 159 | 255 | // Allocate a new item with space for the string at the end and a null | 160 | 255 | // terminator. | 161 | 255 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 255 | size_t Alignment = alignof(StringMapEntry); | 163 | 255 | | 164 | 255 | StringMapEntry *NewItem = | 165 | 255 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 255 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 255 | | 168 | 255 | // Construct the value. | 169 | 255 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 255 | | 171 | 255 | // Copy the string information. | 172 | 255 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 255 | if (KeyLength > 0) | 174 | 255 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 255 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 255 | return NewItem; | 177 | 255 | } |
llvm::StringMapEntry<unsigned int>* llvm::StringMapEntry<unsigned int>::Create<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>, unsigned int>(llvm::StringRef, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&, unsigned int&&) Line | Count | Source | 156 | 16 | InitTy &&... InitVals) { | 157 | 16 | size_t KeyLength = Key.size(); | 158 | 16 | | 159 | 16 | // Allocate a new item with space for the string at the end and a null | 160 | 16 | // terminator. | 161 | 16 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 16 | size_t Alignment = alignof(StringMapEntry); | 163 | 16 | | 164 | 16 | StringMapEntry *NewItem = | 165 | 16 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 16 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 16 | | 168 | 16 | // Construct the value. | 169 | 16 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 16 | | 171 | 16 | // Copy the string information. | 172 | 16 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 16 | if (KeyLength > 0) | 174 | 16 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 16 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 16 | return NewItem; | 177 | 16 | } |
llvm::StringMapEntry<llvm::TinyPtrVector<lld::elf::OutputSection*> >* llvm::StringMapEntry<llvm::TinyPtrVector<lld::elf::OutputSection*> >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 377k | InitTy &&... InitVals) { | 157 | 377k | size_t KeyLength = Key.size(); | 158 | 377k | | 159 | 377k | // Allocate a new item with space for the string at the end and a null | 160 | 377k | // terminator. | 161 | 377k | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 377k | size_t Alignment = alignof(StringMapEntry); | 163 | 377k | | 164 | 377k | StringMapEntry *NewItem = | 165 | 377k | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 377k | assert(NewItem && "Unhandled out-of-memory"); | 167 | 377k | | 168 | 377k | // Construct the value. | 169 | 377k | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 377k | | 171 | 377k | // Copy the string information. | 172 | 377k | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 377k | if (KeyLength > 0) | 174 | 377k | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 377k | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 377k | return NewItem; | 177 | 377k | } |
llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >* llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 43 | InitTy &&... InitVals) { | 157 | 43 | size_t KeyLength = Key.size(); | 158 | 43 | | 159 | 43 | // Allocate a new item with space for the string at the end and a null | 160 | 43 | // terminator. | 161 | 43 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 43 | size_t Alignment = alignof(StringMapEntry); | 163 | 43 | | 164 | 43 | StringMapEntry *NewItem = | 165 | 43 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 43 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 43 | | 168 | 43 | // Construct the value. | 169 | 43 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 43 | | 171 | 43 | // Copy the string information. | 172 | 43 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 43 | if (KeyLength > 0) | 174 | 43 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 43 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 43 | return NewItem; | 177 | 43 | } |
llvm::StringMapEntry<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >* llvm::StringMapEntry<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 22 | InitTy &&... InitVals) { | 157 | 22 | size_t KeyLength = Key.size(); | 158 | 22 | | 159 | 22 | // Allocate a new item with space for the string at the end and a null | 160 | 22 | // terminator. | 161 | 22 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 22 | size_t Alignment = alignof(StringMapEntry); | 163 | 22 | | 164 | 22 | StringMapEntry *NewItem = | 165 | 22 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 22 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 22 | | 168 | 22 | // Construct the value. | 169 | 22 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 22 | | 171 | 22 | // Copy the string information. | 172 | 22 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 22 | if (KeyLength > 0) | 174 | 22 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 22 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 22 | return NewItem; | 177 | 22 | } |
llvm::StringMapEntry<lld::Atom const*>* llvm::StringMapEntry<lld::Atom const*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 396 | InitTy &&... InitVals) { | 157 | 396 | size_t KeyLength = Key.size(); | 158 | 396 | | 159 | 396 | // Allocate a new item with space for the string at the end and a null | 160 | 396 | // terminator. | 161 | 396 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 396 | size_t Alignment = alignof(StringMapEntry); | 163 | 396 | | 164 | 396 | StringMapEntry *NewItem = | 165 | 396 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 396 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 396 | | 168 | 396 | // Construct the value. | 169 | 396 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 396 | | 171 | 396 | // Copy the string information. | 172 | 396 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 396 | if (KeyLength > 0) | 174 | 396 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 396 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 396 | return NewItem; | 177 | 396 | } |
llvm::StringMapEntry<lld::mach_o::MachODylibFile*>* llvm::StringMapEntry<lld::mach_o::MachODylibFile*>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 233 | InitTy &&... InitVals) { | 157 | 233 | size_t KeyLength = Key.size(); | 158 | 233 | | 159 | 233 | // Allocate a new item with space for the string at the end and a null | 160 | 233 | // terminator. | 161 | 233 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 233 | size_t Alignment = alignof(StringMapEntry); | 163 | 233 | | 164 | 233 | StringMapEntry *NewItem = | 165 | 233 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 233 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 233 | | 168 | 233 | // Construct the value. | 169 | 233 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 233 | | 171 | 233 | // Copy the string information. | 172 | 233 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 233 | if (KeyLength > 0) | 174 | 233 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 233 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 233 | return NewItem; | 177 | 233 | } |
llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >* llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 5 | InitTy &&... InitVals) { | 157 | 5 | size_t KeyLength = Key.size(); | 158 | 5 | | 159 | 5 | // Allocate a new item with space for the string at the end and a null | 160 | 5 | // terminator. | 161 | 5 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 5 | size_t Alignment = alignof(StringMapEntry); | 163 | 5 | | 164 | 5 | StringMapEntry *NewItem = | 165 | 5 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 5 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 5 | | 168 | 5 | // Construct the value. | 169 | 5 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 5 | | 171 | 5 | // Copy the string information. | 172 | 5 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 5 | if (KeyLength > 0) | 174 | 5 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 5 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 5 | return NewItem; | 177 | 5 | } |
MachONormalizedFileFromAtoms.cpp:llvm::StringMapEntry<(anonymous namespace)::Util::DylibInfo>* llvm::StringMapEntry<(anonymous namespace)::Util::DylibInfo>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 114 | InitTy &&... InitVals) { | 157 | 114 | size_t KeyLength = Key.size(); | 158 | 114 | | 159 | 114 | // Allocate a new item with space for the string at the end and a null | 160 | 114 | // terminator. | 161 | 114 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 114 | size_t Alignment = alignof(StringMapEntry); | 163 | 114 | | 164 | 114 | StringMapEntry *NewItem = | 165 | 114 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 114 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 114 | | 168 | 114 | // Construct the value. | 169 | 114 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 114 | | 171 | 114 | // Copy the string information. | 172 | 114 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 114 | if (KeyLength > 0) | 174 | 114 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 114 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 114 | return NewItem; | 177 | 114 | } |
llvm::StringMapEntry<unsigned int>* llvm::StringMapEntry<unsigned int>::Create<llvm::MallocAllocator, llvm::support::detail::packed_endian_specific_integral<unsigned int, (llvm::support::endianness)1, 1ul> const&>(llvm::StringRef, llvm::MallocAllocator&, llvm::support::detail::packed_endian_specific_integral<unsigned int, (llvm::support::endianness)1, 1ul> const&&&) Line | Count | Source | 156 | 31 | InitTy &&... InitVals) { | 157 | 31 | size_t KeyLength = Key.size(); | 158 | 31 | | 159 | 31 | // Allocate a new item with space for the string at the end and a null | 160 | 31 | // terminator. | 161 | 31 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 31 | size_t Alignment = alignof(StringMapEntry); | 163 | 31 | | 164 | 31 | StringMapEntry *NewItem = | 165 | 31 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 31 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 31 | | 168 | 31 | // Construct the value. | 169 | 31 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 31 | | 171 | 31 | // Copy the string information. | 172 | 31 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 31 | if (KeyLength > 0) | 174 | 31 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 31 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 31 | return NewItem; | 177 | 31 | } |
llvm::StringMapEntry<unsigned int>* llvm::StringMapEntry<unsigned int>::Create<llvm::MallocAllocator, unsigned int&>(llvm::StringRef, llvm::MallocAllocator&, unsigned int&&&) Line | Count | Source | 156 | 390 | InitTy &&... InitVals) { | 157 | 390 | size_t KeyLength = Key.size(); | 158 | 390 | | 159 | 390 | // Allocate a new item with space for the string at the end and a null | 160 | 390 | // terminator. | 161 | 390 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 390 | size_t Alignment = alignof(StringMapEntry); | 163 | 390 | | 164 | 390 | StringMapEntry *NewItem = | 165 | 390 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 390 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 390 | | 168 | 390 | // Construct the value. | 169 | 390 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 390 | | 171 | 390 | // Copy the string information. | 172 | 390 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 390 | if (KeyLength > 0) | 174 | 276 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 390 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 390 | return NewItem; | 177 | 390 | } |
llvm::StringMapEntry<unsigned long long>* llvm::StringMapEntry<unsigned long long>::Create<llvm::MallocAllocator, unsigned long long>(llvm::StringRef, llvm::MallocAllocator&, unsigned long long&&) Line | Count | Source | 156 | 414 | InitTy &&... InitVals) { | 157 | 414 | size_t KeyLength = Key.size(); | 158 | 414 | | 159 | 414 | // Allocate a new item with space for the string at the end and a null | 160 | 414 | // terminator. | 161 | 414 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 414 | size_t Alignment = alignof(StringMapEntry); | 163 | 414 | | 164 | 414 | StringMapEntry *NewItem = | 165 | 414 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 414 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 414 | | 168 | 414 | // Construct the value. | 169 | 414 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 414 | | 171 | 414 | // Copy the string information. | 172 | 414 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 414 | if (KeyLength > 0) | 174 | 414 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 414 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 414 | return NewItem; | 177 | 414 | } |
llvm::StringMapEntry<llvm::FileInfo::LineData>* llvm::StringMapEntry<llvm::FileInfo::LineData>::Create<llvm::MallocAllocator>(llvm::StringRef, llvm::MallocAllocator&) Line | Count | Source | 156 | 46 | InitTy &&... InitVals) { | 157 | 46 | size_t KeyLength = Key.size(); | 158 | 46 | | 159 | 46 | // Allocate a new item with space for the string at the end and a null | 160 | 46 | // terminator. | 161 | 46 | size_t AllocSize = sizeof(StringMapEntry) + KeyLength + 1; | 162 | 46 | size_t Alignment = alignof(StringMapEntry); | 163 | 46 | | 164 | 46 | StringMapEntry *NewItem = | 165 | 46 | static_cast<StringMapEntry*>(Allocator.Allocate(AllocSize,Alignment)); | 166 | 46 | assert(NewItem && "Unhandled out-of-memory"); | 167 | 46 | | 168 | 46 | // Construct the value. | 169 | 46 | new (NewItem) StringMapEntry(KeyLength, std::forward<InitTy>(InitVals)...); | 170 | 46 | | 171 | 46 | // Copy the string information. | 172 | 46 | char *StrBuffer = const_cast<char*>(NewItem->getKeyData()); | 173 | 46 | if (KeyLength > 0) | 174 | 46 | memcpy(StrBuffer, Key.data(), KeyLength); | 175 | 46 | StrBuffer[KeyLength] = 0; // Null terminate for convenience of clients. | 176 | 46 | return NewItem; | 177 | 46 | } |
|
178 | | |
179 | | /// Create - Create a StringMapEntry with normal malloc/free. |
180 | | template <typename... InitType> |
181 | 2.51M | static StringMapEntry *Create(StringRef Key, InitType &&... InitVal) { |
182 | 2.51M | MallocAllocator A; |
183 | 2.51M | return Create(Key, A, std::forward<InitType>(InitVal)...); |
184 | 2.51M | } |
185 | | |
186 | 2.51M | static StringMapEntry *Create(StringRef Key) { |
187 | 2.51M | return Create(Key, ValueTy()); |
188 | 2.51M | } |
189 | | |
190 | | /// GetStringMapEntryFromKeyData - Given key data that is known to be embedded |
191 | | /// into a StringMapEntry, return the StringMapEntry itself. |
192 | | static StringMapEntry &GetStringMapEntryFromKeyData(const char *KeyData) { |
193 | | char *Ptr = const_cast<char*>(KeyData) - sizeof(StringMapEntry<ValueTy>); |
194 | | return *reinterpret_cast<StringMapEntry*>(Ptr); |
195 | | } |
196 | | |
197 | | /// Destroy - Destroy this StringMapEntry, releasing memory back to the |
198 | | /// specified allocator. |
199 | | template<typename AllocatorTy> |
200 | 374M | void Destroy(AllocatorTy &Allocator) { |
201 | 374M | // Free memory referenced by the item. |
202 | 374M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; |
203 | 374M | this->~StringMapEntry(); |
204 | 374M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); |
205 | 374M | } void llvm::StringMapEntry<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 31.7k | void Destroy(AllocatorTy &Allocator) { | 201 | 31.7k | // Free memory referenced by the item. | 202 | 31.7k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 31.7k | this->~StringMapEntry(); | 204 | 31.7k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 31.7k | } |
void llvm::StringMapEntry<llvm::cl::Option*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 150M | void Destroy(AllocatorTy &Allocator) { | 201 | 150M | // Free memory referenced by the item. | 202 | 150M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 150M | this->~StringMapEntry(); | 204 | 150M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 150M | } |
void llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 2.24M | void Destroy(AllocatorTy &Allocator) { | 201 | 2.24M | // Free memory referenced by the item. | 202 | 2.24M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 2.24M | this->~StringMapEntry(); | 204 | 2.24M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 2.24M | } |
void llvm::StringMapEntry<char>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 475k | void Destroy(AllocatorTy &Allocator) { | 201 | 475k | // Free memory referenced by the item. | 202 | 475k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 475k | this->~StringMapEntry(); | 204 | 475k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 475k | } |
void llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 56.9k | void Destroy(AllocatorTy &Allocator) { | 201 | 56.9k | // Free memory referenced by the item. | 202 | 56.9k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 56.9k | this->~StringMapEntry(); | 204 | 56.9k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 56.9k | } |
void llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 56.9k | void Destroy(AllocatorTy &Allocator) { | 201 | 56.9k | // Free memory referenced by the item. | 202 | 56.9k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 56.9k | this->~StringMapEntry(); | 204 | 56.9k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 56.9k | } |
void llvm::StringMapEntry<clang::OpenCLOptions::Info>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 4.04M | void Destroy(AllocatorTy &Allocator) { | 201 | 4.04M | // Free memory referenced by the item. | 202 | 4.04M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 4.04M | this->~StringMapEntry(); | 204 | 4.04M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 4.04M | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 1.29k | void Destroy(AllocatorTy &Allocator) { | 201 | 1.29k | // Free memory referenced by the item. | 202 | 1.29k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 1.29k | this->~StringMapEntry(); | 204 | 1.29k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 1.29k | } |
void llvm::StringMapEntry<unsigned int>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 33.1M | void Destroy(AllocatorTy &Allocator) { | 201 | 33.1M | // Free memory referenced by the item. | 202 | 33.1M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 33.1M | this->~StringMapEntry(); | 204 | 33.1M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 33.1M | } |
void llvm::StringMapEntry<llvm::MCAsmMacro>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 293 | void Destroy(AllocatorTy &Allocator) { | 201 | 293 | // Free memory referenced by the item. | 202 | 293 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 293 | this->~StringMapEntry(); | 204 | 293 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 293 | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 514k | void Destroy(AllocatorTy &Allocator) { | 201 | 514k | // Free memory referenced by the item. | 202 | 514k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 514k | this->~StringMapEntry(); | 204 | 514k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 514k | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 1.96k | void Destroy(AllocatorTy &Allocator) { | 201 | 1.96k | // Free memory referenced by the item. | 202 | 1.96k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 1.96k | this->~StringMapEntry(); | 204 | 1.96k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 1.96k | } |
AArch64AsmParser.cpp:void llvm::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 17 | void Destroy(AllocatorTy &Allocator) { | 201 | 17 | // Free memory referenced by the item. | 202 | 17 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 17 | this->~StringMapEntry(); | 204 | 17 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 17 | } |
void llvm::StringMapEntry<llvm::Value*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 11.1M | void Destroy(AllocatorTy &Allocator) { | 201 | 11.1M | // Free memory referenced by the item. | 202 | 11.1M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 11.1M | this->~StringMapEntry(); | 204 | 11.1M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 11.1M | } |
void llvm::StringMapEntry<int>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 790k | void Destroy(AllocatorTy &Allocator) { | 201 | 790k | // Free memory referenced by the item. | 202 | 790k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 790k | this->~StringMapEntry(); | 204 | 790k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 790k | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 289 | void Destroy(AllocatorTy &Allocator) { | 201 | 289 | // Free memory referenced by the item. | 202 | 289 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 289 | this->~StringMapEntry(); | 204 | 289 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 289 | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 3.61k | void Destroy(AllocatorTy &Allocator) { | 201 | 3.61k | // Free memory referenced by the item. | 202 | 3.61k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 3.61k | this->~StringMapEntry(); | 204 | 3.61k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 3.61k | } |
void llvm::StringMapEntry<unsigned int const*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 7.11k | void Destroy(AllocatorTy &Allocator) { | 201 | 7.11k | // Free memory referenced by the item. | 202 | 7.11k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 7.11k | this->~StringMapEntry(); | 204 | 7.11k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 7.11k | } |
void llvm::StringMapEntry<llvm::MachineMemOperand::Flags>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 6 | void Destroy(AllocatorTy &Allocator) { | 201 | 6 | // Free memory referenced by the item. | 202 | 6 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 6 | this->~StringMapEntry(); | 204 | 6 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 6 | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 36 | void Destroy(AllocatorTy &Allocator) { | 201 | 36 | // Free memory referenced by the item. | 202 | 36 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 36 | this->~StringMapEntry(); | 204 | 36 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 36 | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 3.48k | void Destroy(AllocatorTy &Allocator) { | 201 | 3.48k | // Free memory referenced by the item. | 202 | 3.48k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 3.48k | this->~StringMapEntry(); | 204 | 3.48k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 3.48k | } |
void llvm::StringMapEntry<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 62 | void Destroy(AllocatorTy &Allocator) { | 201 | 62 | // Free memory referenced by the item. | 202 | 62 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 62 | this->~StringMapEntry(); | 204 | 62 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 62 | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 1.00k | void Destroy(AllocatorTy &Allocator) { | 201 | 1.00k | // Free memory referenced by the item. | 202 | 1.00k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 1.00k | this->~StringMapEntry(); | 204 | 1.00k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 1.00k | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 2.16k | void Destroy(AllocatorTy &Allocator) { | 201 | 2.16k | // Free memory referenced by the item. | 202 | 2.16k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 2.16k | this->~StringMapEntry(); | 204 | 2.16k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 2.16k | } |
void llvm::StringMapEntry<llvm::AsmToken>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 1 | void Destroy(AllocatorTy &Allocator) { | 201 | 1 | // Free memory referenced by the item. | 202 | 1 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 1 | this->~StringMapEntry(); | 204 | 1 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 1 | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 1.84k | void Destroy(AllocatorTy &Allocator) { | 201 | 1.84k | // Free memory referenced by the item. | 202 | 1.84k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 1.84k | this->~StringMapEntry(); | 204 | 1.84k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 1.84k | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 194 | void Destroy(AllocatorTy &Allocator) { | 201 | 194 | // Free memory referenced by the item. | 202 | 194 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 194 | this->~StringMapEntry(); | 204 | 194 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 194 | } |
void llvm::StringMapEntry<llvm::Function*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 346 | void Destroy(AllocatorTy &Allocator) { | 201 | 346 | // Free memory referenced by the item. | 202 | 346 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 346 | this->~StringMapEntry(); | 204 | 346 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 346 | } |
void llvm::StringMapEntry<llvm::RTLIB::Libcall>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 4.87k | void Destroy(AllocatorTy &Allocator) { | 201 | 4.87k | // Free memory referenced by the item. | 202 | 4.87k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 4.87k | this->~StringMapEntry(); | 204 | 4.87k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 4.87k | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 533 | void Destroy(AllocatorTy &Allocator) { | 201 | 533 | // Free memory referenced by the item. | 202 | 533 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 533 | this->~StringMapEntry(); | 204 | 533 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 533 | } |
void llvm::StringMapEntry<unsigned long long>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 1.14k | void Destroy(AllocatorTy &Allocator) { | 201 | 1.14k | // Free memory referenced by the item. | 202 | 1.14k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 1.14k | this->~StringMapEntry(); | 204 | 1.14k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 1.14k | } |
void llvm::StringMapEntry<llvm::sampleprof::FunctionSamples>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 332 | void Destroy(AllocatorTy &Allocator) { | 201 | 332 | // Free memory referenced by the item. | 202 | 332 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 332 | this->~StringMapEntry(); | 204 | 332 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 332 | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 11.6k | void Destroy(AllocatorTy &Allocator) { | 201 | 11.6k | // Free memory referenced by the item. | 202 | 11.6k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 11.6k | this->~StringMapEntry(); | 204 | 11.6k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 11.6k | } |
void llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 155 | void Destroy(AllocatorTy &Allocator) { | 201 | 155 | // Free memory referenced by the item. | 202 | 155 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 155 | this->~StringMapEntry(); | 204 | 155 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 155 | } |
void llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 917 | void Destroy(AllocatorTy &Allocator) { | 201 | 917 | // Free memory referenced by the item. | 202 | 917 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 917 | this->~StringMapEntry(); | 204 | 917 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 917 | } |
void llvm::StringMapEntry<llvm::GCStrategy*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 26 | void Destroy(AllocatorTy &Allocator) { | 201 | 26 | // Free memory referenced by the item. | 202 | 26 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 26 | this->~StringMapEntry(); | 204 | 26 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 26 | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 614 | void Destroy(AllocatorTy &Allocator) { | 201 | 614 | // Free memory referenced by the item. | 202 | 614 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 614 | this->~StringMapEntry(); | 204 | 614 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 614 | } |
void llvm::StringMapEntry<unsigned int>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 71.3k | void Destroy(AllocatorTy &Allocator) { | 201 | 71.3k | // Free memory referenced by the item. | 202 | 71.3k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 71.3k | this->~StringMapEntry(); | 204 | 71.3k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 71.3k | } |
void llvm::StringMapEntry<llvm::ConstantDataSequential*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 84.9k | void Destroy(AllocatorTy &Allocator) { | 201 | 84.9k | // Free memory referenced by the item. | 202 | 84.9k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 84.9k | this->~StringMapEntry(); | 204 | 84.9k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 84.9k | } |
void llvm::StringMapEntry<llvm::MDString>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 113k | void Destroy(AllocatorTy &Allocator) { | 201 | 113k | // Free memory referenced by the item. | 202 | 113k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 113k | this->~StringMapEntry(); | 204 | 113k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 113k | } |
void llvm::StringMapEntry<llvm::StructType*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 61.3k | void Destroy(AllocatorTy &Allocator) { | 201 | 61.3k | // Free memory referenced by the item. | 202 | 61.3k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 61.3k | this->~StringMapEntry(); | 204 | 61.3k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 61.3k | } |
void llvm::StringMapEntry<unsigned char>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 207k | void Destroy(AllocatorTy &Allocator) { | 201 | 207k | // Free memory referenced by the item. | 202 | 207k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 207k | this->~StringMapEntry(); | 204 | 207k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 207k | } |
void llvm::StringMapEntry<llvm::Comdat>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 30.7k | void Destroy(AllocatorTy &Allocator) { | 201 | 30.7k | // Free memory referenced by the item. | 202 | 30.7k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 30.7k | this->~StringMapEntry(); | 204 | 30.7k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 30.7k | } |
void llvm::StringMapEntry<llvm::NamedMDNode*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 32.5k | void Destroy(AllocatorTy &Allocator) { | 201 | 32.5k | // Free memory referenced by the item. | 202 | 32.5k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 32.5k | this->~StringMapEntry(); | 204 | 32.5k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 32.5k | } |
void llvm::StringMapEntry<llvm::PassInfo const*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 32.3M | void Destroy(AllocatorTy &Allocator) { | 201 | 32.3M | // Free memory referenced by the item. | 202 | 32.3M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 32.3M | this->~StringMapEntry(); | 204 | 32.3M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 32.3M | } |
void llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 657 | void Destroy(AllocatorTy &Allocator) { | 201 | 657 | // Free memory referenced by the item. | 202 | 657 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 657 | this->~StringMapEntry(); | 204 | 657 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 657 | } |
void llvm::StringMapEntry<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 297 | void Destroy(AllocatorTy &Allocator) { | 201 | 297 | // Free memory referenced by the item. | 202 | 297 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 297 | this->~StringMapEntry(); | 204 | 297 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 297 | } |
void llvm::StringMapEntry<llvm::SpecialCaseList::Matcher>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 322 | void Destroy(AllocatorTy &Allocator) { | 201 | 322 | // Free memory referenced by the item. | 202 | 322 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 322 | this->~StringMapEntry(); | 204 | 322 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 322 | } |
GCOVProfiling.cpp:void llvm::StringMapEntry<(anonymous namespace)::GCOVLines>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 84 | void Destroy(AllocatorTy &Allocator) { | 201 | 84 | // Free memory referenced by the item. | 202 | 84 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 84 | this->~StringMapEntry(); | 204 | 84 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 84 | } |
void llvm::StringMapEntry<bool>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 1.16M | void Destroy(AllocatorTy &Allocator) { | 201 | 1.16M | // Free memory referenced by the item. | 202 | 1.16M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 1.16M | this->~StringMapEntry(); | 204 | 1.16M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 1.16M | } |
void llvm::StringMapEntry<llvm::MCSymbol*>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 4.65M | void Destroy(AllocatorTy &Allocator) { | 201 | 4.65M | // Free memory referenced by the item. | 202 | 4.65M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 4.65M | this->~StringMapEntry(); | 204 | 4.65M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 4.65M | } |
void llvm::StringMapEntry<bool>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 5.06M | void Destroy(AllocatorTy &Allocator) { | 201 | 5.06M | // Free memory referenced by the item. | 202 | 5.06M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 5.06M | this->~StringMapEntry(); | 204 | 5.06M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 5.06M | } |
void llvm::StringMapEntry<llvm::MCSectionMachO*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 889k | void Destroy(AllocatorTy &Allocator) { | 201 | 889k | // Free memory referenced by the item. | 202 | 889k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 889k | this->~StringMapEntry(); | 204 | 889k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 889k | } |
AsmParser.cpp:void llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 2.95M | void Destroy(AllocatorTy &Allocator) { | 201 | 2.95M | // Free memory referenced by the item. | 202 | 2.95M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 2.95M | this->~StringMapEntry(); | 204 | 2.95M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 2.95M | } |
void llvm::StringMapEntry<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 704k | void Destroy(AllocatorTy &Allocator) { | 201 | 704k | // Free memory referenced by the item. | 202 | 704k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 704k | this->~StringMapEntry(); | 204 | 704k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 704k | } |
void llvm::StringMapEntry<unsigned long>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 38.4k | void Destroy(AllocatorTy &Allocator) { | 201 | 38.4k | // Free memory referenced by the item. | 202 | 38.4k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 38.4k | this->~StringMapEntry(); | 204 | 38.4k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 38.4k | } |
void llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 10 | void Destroy(AllocatorTy &Allocator) { | 201 | 10 | // Free memory referenced by the item. | 202 | 10 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 10 | this->~StringMapEntry(); | 204 | 10 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 10 | } |
void llvm::StringMapEntry<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 9 | void Destroy(AllocatorTy &Allocator) { | 201 | 9 | // Free memory referenced by the item. | 202 | 9 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 9 | this->~StringMapEntry(); | 204 | 9 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 9 | } |
void llvm::StringMapEntry<llvm::Timer>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 9 | void Destroy(AllocatorTy &Allocator) { | 201 | 9 | // Free memory referenced by the item. | 202 | 9 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 9 | this->~StringMapEntry(); | 204 | 9 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 9 | } |
void llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 140k | void Destroy(AllocatorTy &Allocator) { | 201 | 140k | // Free memory referenced by the item. | 202 | 140k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 140k | this->~StringMapEntry(); | 204 | 140k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 140k | } |
void llvm::StringMapEntry<void*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 3 | void Destroy(AllocatorTy &Allocator) { | 201 | 3 | // Free memory referenced by the item. | 202 | 3 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 3 | this->~StringMapEntry(); | 204 | 3 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 3 | } |
void llvm::StringMapEntry<clang::DirectoryEntry*>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 202k | void Destroy(AllocatorTy &Allocator) { | 201 | 202k | // Free memory referenced by the item. | 202 | 202k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 202k | this->~StringMapEntry(); | 204 | 202k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 202k | } |
void llvm::StringMapEntry<clang::FileEntry*>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 196k | void Destroy(AllocatorTy &Allocator) { | 201 | 196k | // Free memory referenced by the item. | 202 | 196k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 196k | this->~StringMapEntry(); | 204 | 196k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 196k | } |
void llvm::StringMapEntry<llvm::vfs::Status>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 19 | void Destroy(AllocatorTy &Allocator) { | 201 | 19 | // Free memory referenced by the item. | 202 | 19 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 19 | this->~StringMapEntry(); | 204 | 19 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 19 | } |
void llvm::StringMapEntry<clang::IdentifierInfo*>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 116M | void Destroy(AllocatorTy &Allocator) { | 201 | 116M | // Free memory referenced by the item. | 202 | 116M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 116M | this->~StringMapEntry(); | 204 | 116M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 116M | } |
void llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 559 | void Destroy(AllocatorTy &Allocator) { | 201 | 559 | // Free memory referenced by the item. | 202 | 559 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 559 | this->~StringMapEntry(); | 204 | 559 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 559 | } |
void llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 3.51k | void Destroy(AllocatorTy &Allocator) { | 201 | 3.51k | // Free memory referenced by the item. | 202 | 3.51k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 3.51k | this->~StringMapEntry(); | 204 | 3.51k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 3.51k | } |
void llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 146 | void Destroy(AllocatorTy &Allocator) { | 201 | 146 | // Free memory referenced by the item. | 202 | 146 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 146 | this->~StringMapEntry(); | 204 | 146 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 146 | } |
void llvm::StringMapEntry<llvm::AssertingVH<llvm::Constant> >::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 229 | void Destroy(AllocatorTy &Allocator) { | 201 | 229 | // Free memory referenced by the item. | 202 | 229 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 229 | this->~StringMapEntry(); | 204 | 229 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 229 | } |
void llvm::StringMapEntry<llvm::WeakTrackingVH>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 11 | void Destroy(AllocatorTy &Allocator) { | 201 | 11 | // Free memory referenced by the item. | 202 | 11 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 11 | this->~StringMapEntry(); | 204 | 11 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 11 | } |
void llvm::StringMapEntry<llvm::Constant*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 47 | void Destroy(AllocatorTy &Allocator) { | 201 | 47 | // Free memory referenced by the item. | 202 | 47 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 47 | this->~StringMapEntry(); | 204 | 47 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 47 | } |
void llvm::StringMapEntry<llvm::GlobalVariable*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 2.42k | void Destroy(AllocatorTy &Allocator) { | 201 | 2.42k | // Free memory referenced by the item. | 202 | 2.42k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 2.42k | this->~StringMapEntry(); | 204 | 2.42k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 2.42k | } |
void llvm::StringMapEntry<clang::PragmaHandler*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 1.96M | void Destroy(AllocatorTy &Allocator) { | 201 | 1.96M | // Free memory referenced by the item. | 202 | 1.96M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 1.96M | this->~StringMapEntry(); | 204 | 1.96M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 1.96M | } |
void llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 127 | void Destroy(AllocatorTy &Allocator) { | 201 | 127 | // Free memory referenced by the item. | 202 | 127 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 127 | this->~StringMapEntry(); | 204 | 127 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 127 | } |
void llvm::StringMapEntry<clang::GlobalDecl>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 2.34M | void Destroy(AllocatorTy &Allocator) { | 201 | 2.34M | // Free memory referenced by the item. | 202 | 2.34M | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 2.34M | this->~StringMapEntry(); | 204 | 2.34M | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 2.34M | } |
Unexecuted instantiation: void llvm::StringMapEntry<std::__1::pair<clang::GlobalDecl, unsigned int> >::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) void llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 14 | void Destroy(AllocatorTy &Allocator) { | 201 | 14 | // Free memory referenced by the item. | 202 | 14 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 14 | this->~StringMapEntry(); | 204 | 14 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 14 | } |
void llvm::StringMapEntry<char const*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 105 | void Destroy(AllocatorTy &Allocator) { | 201 | 105 | // Free memory referenced by the item. | 202 | 105 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 105 | this->~StringMapEntry(); | 204 | 105 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 105 | } |
void llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 157 | void Destroy(AllocatorTy &Allocator) { | 201 | 157 | // Free memory referenced by the item. | 202 | 157 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 157 | this->~StringMapEntry(); | 204 | 157 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 157 | } |
void llvm::StringMapEntry<char>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 18.3k | void Destroy(AllocatorTy &Allocator) { | 201 | 18.3k | // Free memory referenced by the item. | 202 | 18.3k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 18.3k | this->~StringMapEntry(); | 204 | 18.3k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 18.3k | } |
void llvm::StringMapEntry<clang::InMemoryModuleCache::PCM>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 5.46k | void Destroy(AllocatorTy &Allocator) { | 201 | 5.46k | // Free memory referenced by the item. | 202 | 5.46k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 5.46k | this->~StringMapEntry(); | 204 | 5.46k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 5.46k | } |
void llvm::StringMapEntry<clang::SourceLocation>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 14 | void Destroy(AllocatorTy &Allocator) { | 201 | 14 | // Free memory referenced by the item. | 202 | 14 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 14 | this->~StringMapEntry(); | 204 | 14 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 14 | } |
void llvm::StringMapEntry<clang::FrameworkCacheEntry>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 270 | void Destroy(AllocatorTy &Allocator) { | 201 | 270 | // Free memory referenced by the item. | 202 | 270 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 270 | this->~StringMapEntry(); | 204 | 270 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 270 | } |
void llvm::StringMapEntry<clang::HeaderSearch::LookupFileCacheInfo>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 16.6k | void Destroy(AllocatorTy &Allocator) { | 201 | 16.6k | // Free memory referenced by the item. | 202 | 16.6k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 16.6k | this->~StringMapEntry(); | 204 | 16.6k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 16.6k | } |
void llvm::StringMapEntry<clang::LayoutOverrideSource::Layout>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 37 | void Destroy(AllocatorTy &Allocator) { | 201 | 37 | // Free memory referenced by the item. | 202 | 37 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 37 | this->~StringMapEntry(); | 204 | 37 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 37 | } |
VerifyDiagnosticConsumer.cpp:void llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 11 | void Destroy(AllocatorTy &Allocator) { | 201 | 11 | // Free memory referenced by the item. | 202 | 11 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 11 | this->~StringMapEntry(); | 204 | 11 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 11 | } |
void llvm::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 836 | void Destroy(AllocatorTy &Allocator) { | 201 | 836 | // Free memory referenced by the item. | 202 | 836 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 836 | this->~StringMapEntry(); | 204 | 836 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 836 | } |
void llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 3.95k | void Destroy(AllocatorTy &Allocator) { | 201 | 3.95k | // Free memory referenced by the item. | 202 | 3.95k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 3.95k | this->~StringMapEntry(); | 204 | 3.95k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 3.95k | } |
void llvm::StringMapEntry<std::__1::shared_ptr<clang::ModuleFileExtension> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 27 | void Destroy(AllocatorTy &Allocator) { | 201 | 27 | // Free memory referenced by the item. | 202 | 27 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 27 | this->~StringMapEntry(); | 204 | 27 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 27 | } |
void llvm::StringMapEntry<llvm::SmallVector<unsigned int, 2u> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 89.9k | void Destroy(AllocatorTy &Allocator) { | 201 | 89.9k | // Free memory referenced by the item. | 202 | 89.9k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 89.9k | this->~StringMapEntry(); | 204 | 89.9k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 89.9k | } |
void llvm::StringMapEntry<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 85 | void Destroy(AllocatorTy &Allocator) { | 201 | 85 | // Free memory referenced by the item. | 202 | 85 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 85 | this->~StringMapEntry(); | 204 | 85 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 85 | } |
void llvm::StringMapEntry<llvm::AccelTableBase::HashData>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 71.8k | void Destroy(AllocatorTy &Allocator) { | 201 | 71.8k | // Free memory referenced by the item. | 202 | 71.8k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 71.8k | this->~StringMapEntry(); | 204 | 71.8k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 71.8k | } |
void llvm::StringMapEntry<llvm::DIE const*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 70.3k | void Destroy(AllocatorTy &Allocator) { | 201 | 70.3k | // Free memory referenced by the item. | 202 | 70.3k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 70.3k | this->~StringMapEntry(); | 204 | 70.3k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 70.3k | } |
void llvm::StringMapEntry<llvm::DwarfStringPoolEntry>::Destroy<llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 200 | 85.0k | void Destroy(AllocatorTy &Allocator) { | 201 | 85.0k | // Free memory referenced by the item. | 202 | 85.0k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 85.0k | this->~StringMapEntry(); | 204 | 85.0k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 85.0k | } |
void llvm::StringMapEntry<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 9 | void Destroy(AllocatorTy &Allocator) { | 201 | 9 | // Free memory referenced by the item. | 202 | 9 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 9 | this->~StringMapEntry(); | 204 | 9 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 9 | } |
void llvm::StringMapEntry<unsigned short>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 47 | void Destroy(AllocatorTy &Allocator) { | 201 | 47 | // Free memory referenced by the item. | 202 | 47 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 47 | this->~StringMapEntry(); | 204 | 47 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 47 | } |
void llvm::StringMapEntry<llvm::SDNode*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 14.8k | void Destroy(AllocatorTy &Allocator) { | 201 | 14.8k | // Free memory referenced by the item. | 202 | 14.8k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 14.8k | this->~StringMapEntry(); | 204 | 14.8k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 14.8k | } |
void llvm::StringMapEntry<llvm::lto::LTO::GlobalResolution>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 1.04k | void Destroy(AllocatorTy &Allocator) { | 201 | 1.04k | // Free memory referenced by the item. | 202 | 1.04k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 1.04k | this->~StringMapEntry(); | 204 | 1.04k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 1.04k | } |
void llvm::StringMapEntry<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 521 | void Destroy(AllocatorTy &Allocator) { | 201 | 521 | // Free memory referenced by the item. | 202 | 521 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 521 | this->~StringMapEntry(); | 204 | 521 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 521 | } |
void llvm::StringMapEntry<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 431 | void Destroy(AllocatorTy &Allocator) { | 201 | 431 | // Free memory referenced by the item. | 202 | 431 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 431 | this->~StringMapEntry(); | 204 | 431 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 431 | } |
void llvm::StringMapEntry<clang::ento::BugType*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 709 | void Destroy(AllocatorTy &Allocator) { | 201 | 709 | // Free memory referenced by the item. | 202 | 709 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 709 | this->~StringMapEntry(); | 204 | 709 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 709 | } |
void llvm::StringMapEntry<clang::Stmt*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 13.0k | void Destroy(AllocatorTy &Allocator) { | 201 | 13.0k | // Free memory referenced by the item. | 202 | 13.0k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 13.0k | this->~StringMapEntry(); | 204 | 13.0k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 13.0k | } |
void llvm::StringMapEntry<FoundationClass>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 91 | void Destroy(AllocatorTy &Allocator) { | 201 | 91 | // Free memory referenced by the item. | 202 | 91 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 91 | this->~StringMapEntry(); | 204 | 91 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 91 | } |
void llvm::StringMapEntry<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 20 | void Destroy(AllocatorTy &Allocator) { | 201 | 20 | // Free memory referenced by the item. | 202 | 20 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 20 | this->~StringMapEntry(); | 204 | 20 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 20 | } |
StdLibraryFunctionsChecker.cpp:void llvm::StringMapEntry<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 286 | void Destroy(AllocatorTy &Allocator) { | 201 | 286 | // Free memory referenced by the item. | 202 | 286 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 286 | this->~StringMapEntry(); | 204 | 286 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 286 | } |
void llvm::StringMapEntry<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 32 | void Destroy(AllocatorTy &Allocator) { | 201 | 32 | // Free memory referenced by the item. | 202 | 32 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 32 | this->~StringMapEntry(); | 204 | 32 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 32 | } |
void llvm::StringMapEntry<clang::ASTUnit*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 57 | void Destroy(AllocatorTy &Allocator) { | 201 | 57 | // Free memory referenced by the item. | 202 | 57 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 57 | this->~StringMapEntry(); | 204 | 57 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 57 | } |
void llvm::StringMapEntry<llvm::SmallVector<clang::TypoCorrection, 1u> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 10.2k | void Destroy(AllocatorTy &Allocator) { | 201 | 10.2k | // Free memory referenced by the item. | 202 | 10.2k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 10.2k | this->~StringMapEntry(); | 204 | 10.2k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 10.2k | } |
void llvm::StringMapEntry<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 3 | void Destroy(AllocatorTy &Allocator) { | 201 | 3 | // Free memory referenced by the item. | 202 | 3 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 3 | this->~StringMapEntry(); | 204 | 3 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 3 | } |
void llvm::StringMapEntry<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 38 | void Destroy(AllocatorTy &Allocator) { | 201 | 38 | // Free memory referenced by the item. | 202 | 38 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 38 | this->~StringMapEntry(); | 204 | 38 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 38 | } |
void llvm::StringMapEntry<llvm::TimeRecord>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 1 | void Destroy(AllocatorTy &Allocator) { | 201 | 1 | // Free memory referenced by the item. | 202 | 1 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 1 | this->~StringMapEntry(); | 204 | 1 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 1 | } |
void llvm::StringMapEntry<clang::StringLiteral*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 65 | void Destroy(AllocatorTy &Allocator) { | 201 | 65 | // Free memory referenced by the item. | 202 | 65 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 65 | this->~StringMapEntry(); | 204 | 65 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 65 | } |
void llvm::StringMapEntry<clang::ASTContext::SectionInfo>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 74 | void Destroy(AllocatorTy &Allocator) { | 201 | 74 | // Free memory referenced by the item. | 202 | 74 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 74 | this->~StringMapEntry(); | 204 | 74 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 74 | } |
void llvm::StringMapEntry<clang::comments::TParamCommandComment*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 90 | void Destroy(AllocatorTy &Allocator) { | 201 | 90 | // Free memory referenced by the item. | 202 | 90 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 90 | this->~StringMapEntry(); | 204 | 90 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 90 | } |
void llvm::StringMapEntry<clang::Module*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 73.5k | void Destroy(AllocatorTy &Allocator) { | 201 | 73.5k | // Free memory referenced by the item. | 202 | 73.5k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 73.5k | this->~StringMapEntry(); | 204 | 73.5k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 73.5k | } |
void llvm::StringMapEntry<llvm::StringSet<llvm::MallocAllocator> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 14 | void Destroy(AllocatorTy &Allocator) { | 201 | 14 | // Free memory referenced by the item. | 202 | 14 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 14 | this->~StringMapEntry(); | 204 | 14 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 14 | } |
void llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 12.7k | void Destroy(AllocatorTy &Allocator) { | 201 | 12.7k | // Free memory referenced by the item. | 202 | 12.7k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 12.7k | this->~StringMapEntry(); | 204 | 12.7k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 12.7k | } |
void llvm::StringMapEntry<llvm::RecordStreamer::State>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 264 | void Destroy(AllocatorTy &Allocator) { | 201 | 264 | // Free memory referenced by the item. | 202 | 264 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 264 | this->~StringMapEntry(); | 204 | 264 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 264 | } |
void llvm::StringMapEntry<llvm::GlobalValue const*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 255 | void Destroy(AllocatorTy &Allocator) { | 201 | 255 | // Free memory referenced by the item. | 202 | 255 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 255 | this->~StringMapEntry(); | 204 | 255 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 255 | } |
void llvm::StringMapEntry<llvm::TargetRegisterClass const*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 225k | void Destroy(AllocatorTy &Allocator) { | 201 | 225k | // Free memory referenced by the item. | 202 | 225k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 225k | this->~StringMapEntry(); | 204 | 225k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 225k | } |
void llvm::StringMapEntry<llvm::RegisterBank const*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 5.92k | void Destroy(AllocatorTy &Allocator) { | 201 | 5.92k | // Free memory referenced by the item. | 202 | 5.92k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 5.92k | this->~StringMapEntry(); | 204 | 5.92k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 5.92k | } |
void llvm::StringMapEntry<llvm::VRegInfo*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 14 | void Destroy(AllocatorTy &Allocator) { | 201 | 14 | // Free memory referenced by the item. | 202 | 14 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 14 | this->~StringMapEntry(); | 204 | 14 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 14 | } |
void llvm::StringMapEntry<llvm::Type*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 91 | void Destroy(AllocatorTy &Allocator) { | 201 | 91 | // Free memory referenced by the item. | 202 | 91 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 91 | this->~StringMapEntry(); | 204 | 91 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 91 | } |
void llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 43 | void Destroy(AllocatorTy &Allocator) { | 201 | 43 | // Free memory referenced by the item. | 202 | 43 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 43 | this->~StringMapEntry(); | 204 | 43 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 43 | } |
void llvm::StringMapEntry<llvm::TinyPtrVector<lld::elf::OutputSection*> >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 377k | void Destroy(AllocatorTy &Allocator) { | 201 | 377k | // Free memory referenced by the item. | 202 | 377k | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 377k | this->~StringMapEntry(); | 204 | 377k | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 377k | } |
void llvm::StringMapEntry<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 22 | void Destroy(AllocatorTy &Allocator) { | 201 | 22 | // Free memory referenced by the item. | 202 | 22 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 22 | this->~StringMapEntry(); | 204 | 22 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 22 | } |
void llvm::StringMapEntry<lld::Atom const*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 396 | void Destroy(AllocatorTy &Allocator) { | 201 | 396 | // Free memory referenced by the item. | 202 | 396 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 396 | this->~StringMapEntry(); | 204 | 396 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 396 | } |
void llvm::StringMapEntry<lld::mach_o::MachODylibFile*>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 233 | void Destroy(AllocatorTy &Allocator) { | 201 | 233 | // Free memory referenced by the item. | 202 | 233 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 233 | this->~StringMapEntry(); | 204 | 233 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 233 | } |
void llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 5 | void Destroy(AllocatorTy &Allocator) { | 201 | 5 | // Free memory referenced by the item. | 202 | 5 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 5 | this->~StringMapEntry(); | 204 | 5 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 5 | } |
MachONormalizedFileFromAtoms.cpp:void llvm::StringMapEntry<(anonymous namespace)::Util::DylibInfo>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 114 | void Destroy(AllocatorTy &Allocator) { | 201 | 114 | // Free memory referenced by the item. | 202 | 114 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 114 | this->~StringMapEntry(); | 204 | 114 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 114 | } |
void llvm::StringMapEntry<llvm::FileInfo::LineData>::Destroy<llvm::MallocAllocator>(llvm::MallocAllocator&) Line | Count | Source | 200 | 46 | void Destroy(AllocatorTy &Allocator) { | 201 | 46 | // Free memory referenced by the item. | 202 | 46 | size_t AllocSize = sizeof(StringMapEntry) + getKeyLength() + 1; | 203 | 46 | this->~StringMapEntry(); | 204 | 46 | Allocator.Deallocate(static_cast<void *>(this), AllocSize); | 205 | 46 | } |
|
206 | | |
207 | | /// Destroy this object, releasing memory back to the malloc allocator. |
208 | 11.1M | void Destroy() { |
209 | 11.1M | MallocAllocator A; |
210 | 11.1M | Destroy(A); |
211 | 11.1M | } |
212 | | }; |
213 | | |
214 | | /// StringMap - This is an unconventional map that is specialized for handling |
215 | | /// keys that are "strings", which are basically ranges of bytes. This does some |
216 | | /// funky memory allocation and hashing things to make it extremely efficient, |
217 | | /// storing the string data *after* the value in the map. |
218 | | template<typename ValueTy, typename AllocatorTy = MallocAllocator> |
219 | | class StringMap : public StringMapImpl { |
220 | | AllocatorTy Allocator; |
221 | | |
222 | | public: |
223 | | using MapEntryTy = StringMapEntry<ValueTy>; |
224 | | |
225 | 15.4M | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} llvm::StringMap<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 9.63k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
AArch64AsmParser.cpp:llvm::StringMap<std::__1::pair<(anonymous namespace)::RegKind, unsigned int>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 3.49k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 1.09M | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 295 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 3.63k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<char, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 1.13M | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<int, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 207k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 5.99k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 136 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 1.02k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 2.37k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::AsmToken, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 1.46k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 3.58k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 228 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::Function*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 114 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::RTLIB::Libcall, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 24 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 484 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 22.9k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::pair<unsigned int, unsigned int>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 9.36M | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 5.21k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::GCStrategy*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 36.2k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 527k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::MDString, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap() Line | Count | Source | 225 | 107k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::ConstantDataSequential*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 107k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::StructType*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 107k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<unsigned char, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 107k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 68.7k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 68.7k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::PassInfo const*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 120k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<unsigned int, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap() Line | Count | Source | 225 | 43.3k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 591 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 25.3k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<bool, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 157k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
GCOVProfiling.cpp:llvm::StringMap<(anonymous namespace)::GCOVLines, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 303 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::MCSectionMachO*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 54.0k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::MCAsmMacro, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 54.0k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 18.4k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
AsmParser.cpp:llvm::StringMap<(anonymous namespace)::AsmParser::DirectiveKind, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 18.4k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 281k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<unsigned long, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 198k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 256 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 304 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 1 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::Timer, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 9 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 15 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 128k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 61.7k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<void*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 2 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 45 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 2.89k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::Constant*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 17.8k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::GlobalVariable*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 19.9k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 3.46k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::AssertingVH<llvm::Constant>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap() Line | Count | Source | 225 | 3.46k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::WeakTrackingVH, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 3.46k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 1.44k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::TrackingVH<llvm::Constant>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 17.6k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::GlobalDecl, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap() Line | Count | Source | 225 | 17.6k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::pair<clang::GlobalDecl, unsigned int>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap() Line | Count | Source | 225 | 17.6k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 30.3k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<char const*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 86 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 89.6k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::InMemoryModuleCache::PCM, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 48.5k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<char, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap() Line | Count | Source | 225 | 44.9k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::SourceLocation, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 4.73k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 108k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::LayoutOverrideSource::Layout, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 6 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 333 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 12.0k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
VerifyDiagnosticConsumer.cpp:llvm::StringMap<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 12.0k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::pair<llvm::StringRef, bool>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 8.03k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::shared_ptr<clang::ModuleFileExtension>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 5.34k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::SmallVector<unsigned int, 2u>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 631 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 48.6k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 48.6k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 1.20k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::VRegInfo*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 11.2k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::DIE const*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 5.45k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::weak_ptr<llvm::DWARFContext::DWOFile>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 1.67k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<unsigned short, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 39 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::SDNode*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 38.1k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::lto::LTO::GlobalResolution, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 3.06k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 256 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::ento::BugType*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 38.6k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::Stmt*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 910 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<FoundationClass, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 13 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 24 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
StdLibraryFunctionsChecker.cpp:llvm::StringMap<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 21 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 928 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::ASTUnit*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 920 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 9 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::SmallVector<clang::TypoCorrection, 1u>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 6.72k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 41.5k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::TimeRecord, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 26.7k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::StringLiteral*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 41.7k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::ASTContext::SectionInfo, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 41.7k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::comments::TParamCommandComment*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 1.26k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::HeaderSearch::LookupFileCacheInfo, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap() Line | Count | Source | 225 | 44.2k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::Module*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 44.2k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::StringSet<llvm::MallocAllocator>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 44.2k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap() Line | Count | Source | 225 | 2 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 220k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::pair<llvm::Type*, llvm::SMLoc>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 40.2k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 8.50k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::RecordStreamer::State, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 76 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::GlobalValue const*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 164 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::Type*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 2.24k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<unsigned int const*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 2.23k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::MachineMemOperand::Flags, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 2.23k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::TargetRegisterClass const*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 2.23k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::RegisterBank const*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 2.23k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::TinyPtrVector<lld::elf::OutputSection*>, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 2.75k | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 22 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 193 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<lld::Atom const*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 636 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<lld::mach_o::MachODylibFile*, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 244 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> >, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 244 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
MachONormalizedFileFromAtoms.cpp:llvm::StringMap<(anonymous namespace)::Util::DylibInfo, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 169 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::FileInfo::LineData, llvm::MallocAllocator>::StringMap() Line | Count | Source | 225 | 28 | StringMap() : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))) {} |
|
226 | | |
227 | | explicit StringMap(unsigned InitialSize) |
228 | 2.17M | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} llvm::StringMap<int, llvm::MallocAllocator>::StringMap(unsigned int) Line | Count | Source | 228 | 7 | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::StringMap(unsigned int) Line | Count | Source | 228 | 1.87M | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::DirectoryEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap(unsigned int) Line | Count | Source | 228 | 90.3k | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap(unsigned int) Line | Count | Source | 228 | 90.3k | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::IdentifierInfo*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap(unsigned int) Line | Count | Source | 228 | 77.6k | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> >, llvm::MallocAllocator>::StringMap(unsigned int) Line | Count | Source | 228 | 267 | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>, llvm::MallocAllocator>::StringMap(unsigned int) Line | Count | Source | 228 | 282 | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::StringMap(unsigned int) Line | Count | Source | 228 | 282 | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<clang::FrameworkCacheEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::StringMap(unsigned int) Line | Count | Source | 228 | 44.2k | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} |
llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>::StringMap(unsigned int) Line | Count | Source | 228 | 167 | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))) {} |
|
229 | | |
230 | | explicit StringMap(AllocatorTy A) |
231 | 359k | : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))), Allocator(A) {} llvm::StringMap<llvm::MCSymbol*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::StringMap(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 231 | 54.0k | : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))), Allocator(A) {} |
llvm::StringMap<bool, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::StringMap(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 231 | 54.0k | : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))), Allocator(A) {} |
llvm::StringMap<llvm::AccelTableBase::HashData, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::StringMap(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 231 | 179k | : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))), Allocator(A) {} |
llvm::StringMap<llvm::DwarfStringPoolEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::StringMap(llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&) Line | Count | Source | 231 | 71.6k | : StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))), Allocator(A) {} |
|
232 | | |
233 | | StringMap(unsigned InitialSize, AllocatorTy A) |
234 | | : StringMapImpl(InitialSize, static_cast<unsigned>(sizeof(MapEntryTy))), |
235 | | Allocator(A) {} |
236 | | |
237 | | StringMap(std::initializer_list<std::pair<StringRef, ValueTy>> List) |
238 | 71.1k | : StringMapImpl(List.size(), static_cast<unsigned>(sizeof(MapEntryTy))) { |
239 | 569k | for (const auto &P : List) { |
240 | 569k | insert(P); |
241 | 569k | } |
242 | 71.1k | } llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::StringMap(std::initializer_list<std::__1::pair<llvm::StringRef, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >) Line | Count | Source | 238 | 71.1k | : StringMapImpl(List.size(), static_cast<unsigned>(sizeof(MapEntryTy))) { | 239 | 568k | for (const auto &P : List) { | 240 | 568k | insert(P); | 241 | 568k | } | 242 | 71.1k | } |
StdLibraryFunctionsChecker.cpp:llvm::StringMap<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >, llvm::MallocAllocator>::StringMap(std::initializer_list<std::__1::pair<llvm::StringRef, std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > > >) Line | Count | Source | 238 | 13 | : StringMapImpl(List.size(), static_cast<unsigned>(sizeof(MapEntryTy))) { | 239 | 286 | for (const auto &P : List) { | 240 | 286 | insert(P); | 241 | 286 | } | 242 | 13 | } |
|
243 | | |
244 | | StringMap(StringMap &&RHS) |
245 | 21.1k | : StringMapImpl(std::move(RHS)), Allocator(std::move(RHS.Allocator)) {} llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::StringMap(llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>&&) Line | Count | Source | 245 | 432 | : StringMapImpl(std::move(RHS)), Allocator(std::move(RHS.Allocator)) {} |
llvm::StringMap<char, llvm::MallocAllocator>::StringMap(llvm::StringMap<char, llvm::MallocAllocator>&&) Line | Count | Source | 245 | 17.4k | : StringMapImpl(std::move(RHS)), Allocator(std::move(RHS.Allocator)) {} |
llvm::StringMap<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>, llvm::MallocAllocator>::StringMap(llvm::StringMap<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>, llvm::MallocAllocator>&&) Line | Count | Source | 245 | 8 | : StringMapImpl(std::move(RHS)), Allocator(std::move(RHS.Allocator)) {} |
llvm::StringMap<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> >, llvm::MallocAllocator>::StringMap(llvm::StringMap<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> >, llvm::MallocAllocator>&&) Line | Count | Source | 245 | 2.89k | : StringMapImpl(std::move(RHS)), Allocator(std::move(RHS.Allocator)) {} |
Unexecuted instantiation: llvm::StringMap<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> >, llvm::MallocAllocator>::StringMap(llvm::StringMap<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> >, llvm::MallocAllocator>&&) llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>::StringMap(llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>&&) Line | Count | Source | 245 | 352 | : StringMapImpl(std::move(RHS)), Allocator(std::move(RHS.Allocator)) {} |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::StringMap(llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>&&) Line | Count | Source | 245 | 8 | : StringMapImpl(std::move(RHS)), Allocator(std::move(RHS.Allocator)) {} |
llvm::StringMap<llvm::TimeRecord, llvm::MallocAllocator>::StringMap(llvm::StringMap<llvm::TimeRecord, llvm::MallocAllocator>&&) Line | Count | Source | 245 | 1 | : StringMapImpl(std::move(RHS)), Allocator(std::move(RHS.Allocator)) {} |
llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>::StringMap(llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>&&) Line | Count | Source | 245 | 4 | : StringMapImpl(std::move(RHS)), Allocator(std::move(RHS.Allocator)) {} |
|
246 | | |
247 | | StringMap(const StringMap &RHS) : |
248 | | StringMapImpl(static_cast<unsigned>(sizeof(MapEntryTy))), |
249 | 47.9k | Allocator(RHS.Allocator) { |
250 | 47.9k | if (RHS.empty()) |
251 | 27.7k | return; |
252 | 20.1k | |
253 | 20.1k | // Allocate TheTable of the same size as RHS's TheTable, and set the |
254 | 20.1k | // sentinel appropriately (and NumBuckets). |
255 | 20.1k | init(RHS.NumBuckets); |
256 | 20.1k | unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1), |
257 | 20.1k | *RHSHashTable = (unsigned *)(RHS.TheTable + NumBuckets + 1); |
258 | 20.1k | |
259 | 20.1k | NumItems = RHS.NumItems; |
260 | 20.1k | NumTombstones = RHS.NumTombstones; |
261 | 983k | for (unsigned I = 0, E = NumBuckets; I != E; ++I963k ) { |
262 | 963k | StringMapEntryBase *Bucket = RHS.TheTable[I]; |
263 | 963k | if (!Bucket || Bucket == getTombstoneVal()555k ) { |
264 | 408k | TheTable[I] = Bucket; |
265 | 408k | continue; |
266 | 408k | } |
267 | 555k | |
268 | 555k | TheTable[I] = MapEntryTy::Create( |
269 | 555k | static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator, |
270 | 555k | static_cast<MapEntryTy *>(Bucket)->getValue()); |
271 | 555k | HashTable[I] = RHSHashTable[I]; |
272 | 555k | } |
273 | 20.1k | |
274 | 20.1k | // Note that here we've copied everything from the RHS into this object, |
275 | 20.1k | // tombstones included. We could, instead, have re-probed for each key to |
276 | 20.1k | // instantiate this new object without any tombstone buckets. The |
277 | 20.1k | // assumption here is that items are rarely deleted from most StringMaps, |
278 | 20.1k | // and so tombstones are rare, so the cost of re-probing for all inputs is |
279 | 20.1k | // not worthwhile. |
280 | 20.1k | } llvm::StringMap<unsigned long long, llvm::MallocAllocator>::StringMap(llvm::StringMap<unsigned long long, llvm::MallocAllocator> const&) Line | Count | Source | 249 | 65 | Allocator(RHS.Allocator) { | 250 | 65 | if (RHS.empty()) | 251 | 16 | return; | 252 | 49 | | 253 | 49 | // Allocate TheTable of the same size as RHS's TheTable, and set the | 254 | 49 | // sentinel appropriately (and NumBuckets). | 255 | 49 | init(RHS.NumBuckets); | 256 | 49 | unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1), | 257 | 49 | *RHSHashTable = (unsigned *)(RHS.TheTable + NumBuckets + 1); | 258 | 49 | | 259 | 49 | NumItems = RHS.NumItems; | 260 | 49 | NumTombstones = RHS.NumTombstones; | 261 | 833 | for (unsigned I = 0, E = NumBuckets; I != E; ++I784 ) { | 262 | 784 | StringMapEntryBase *Bucket = RHS.TheTable[I]; | 263 | 784 | if (!Bucket || Bucket == getTombstoneVal()71 ) { | 264 | 713 | TheTable[I] = Bucket; | 265 | 713 | continue; | 266 | 713 | } | 267 | 71 | | 268 | 71 | TheTable[I] = MapEntryTy::Create( | 269 | 71 | static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator, | 270 | 71 | static_cast<MapEntryTy *>(Bucket)->getValue()); | 271 | 71 | HashTable[I] = RHSHashTable[I]; | 272 | 71 | } | 273 | 49 | | 274 | 49 | // Note that here we've copied everything from the RHS into this object, | 275 | 49 | // tombstones included. We could, instead, have re-probed for each key to | 276 | 49 | // instantiate this new object without any tombstone buckets. The | 277 | 49 | // assumption here is that items are rarely deleted from most StringMaps, | 278 | 49 | // and so tombstones are rare, so the cost of re-probing for all inputs is | 279 | 49 | // not worthwhile. | 280 | 49 | } |
llvm::StringMap<char, llvm::MallocAllocator>::StringMap(llvm::StringMap<char, llvm::MallocAllocator> const&) Line | Count | Source | 249 | 34.4k | Allocator(RHS.Allocator) { | 250 | 34.4k | if (RHS.empty()) | 251 | 27.7k | return; | 252 | 6.67k | | 253 | 6.67k | // Allocate TheTable of the same size as RHS's TheTable, and set the | 254 | 6.67k | // sentinel appropriately (and NumBuckets). | 255 | 6.67k | init(RHS.NumBuckets); | 256 | 6.67k | unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1), | 257 | 6.67k | *RHSHashTable = (unsigned *)(RHS.TheTable + NumBuckets + 1); | 258 | 6.67k | | 259 | 6.67k | NumItems = RHS.NumItems; | 260 | 6.67k | NumTombstones = RHS.NumTombstones; | 261 | 113k | for (unsigned I = 0, E = NumBuckets; I != E; ++I106k ) { | 262 | 106k | StringMapEntryBase *Bucket = RHS.TheTable[I]; | 263 | 106k | if (!Bucket || Bucket == getTombstoneVal()7.47k ) { | 264 | 99.3k | TheTable[I] = Bucket; | 265 | 99.3k | continue; | 266 | 99.3k | } | 267 | 7.47k | | 268 | 7.47k | TheTable[I] = MapEntryTy::Create( | 269 | 7.47k | static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator, | 270 | 7.47k | static_cast<MapEntryTy *>(Bucket)->getValue()); | 271 | 7.47k | HashTable[I] = RHSHashTable[I]; | 272 | 7.47k | } | 273 | 6.67k | | 274 | 6.67k | // Note that here we've copied everything from the RHS into this object, | 275 | 6.67k | // tombstones included. We could, instead, have re-probed for each key to | 276 | 6.67k | // instantiate this new object without any tombstone buckets. The | 277 | 6.67k | // assumption here is that items are rarely deleted from most StringMaps, | 278 | 6.67k | // and so tombstones are rare, so the cost of re-probing for all inputs is | 279 | 6.67k | // not worthwhile. | 280 | 6.67k | } |
llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::StringMap(llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator> const&) Line | Count | Source | 249 | 13.3k | Allocator(RHS.Allocator) { | 250 | 13.3k | if (RHS.empty()) | 251 | 0 | return; | 252 | 13.3k | | 253 | 13.3k | // Allocate TheTable of the same size as RHS's TheTable, and set the | 254 | 13.3k | // sentinel appropriately (and NumBuckets). | 255 | 13.3k | init(RHS.NumBuckets); | 256 | 13.3k | unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1), | 257 | 13.3k | *RHSHashTable = (unsigned *)(RHS.TheTable + NumBuckets + 1); | 258 | 13.3k | | 259 | 13.3k | NumItems = RHS.NumItems; | 260 | 13.3k | NumTombstones = RHS.NumTombstones; | 261 | 867k | for (unsigned I = 0, E = NumBuckets; I != E; ++I854k ) { | 262 | 854k | StringMapEntryBase *Bucket = RHS.TheTable[I]; | 263 | 854k | if (!Bucket || Bucket == getTombstoneVal()547k ) { | 264 | 306k | TheTable[I] = Bucket; | 265 | 306k | continue; | 266 | 306k | } | 267 | 547k | | 268 | 547k | TheTable[I] = MapEntryTy::Create( | 269 | 547k | static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator, | 270 | 547k | static_cast<MapEntryTy *>(Bucket)->getValue()); | 271 | 547k | HashTable[I] = RHSHashTable[I]; | 272 | 547k | } | 273 | 13.3k | | 274 | 13.3k | // Note that here we've copied everything from the RHS into this object, | 275 | 13.3k | // tombstones included. We could, instead, have re-probed for each key to | 276 | 13.3k | // instantiate this new object without any tombstone buckets. The | 277 | 13.3k | // assumption here is that items are rarely deleted from most StringMaps, | 278 | 13.3k | // and so tombstones are rare, so the cost of re-probing for all inputs is | 279 | 13.3k | // not worthwhile. | 280 | 13.3k | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::StringMap(llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator> const&) Line | Count | Source | 249 | 8 | Allocator(RHS.Allocator) { | 250 | 8 | if (RHS.empty()) | 251 | 0 | return; | 252 | 8 | | 253 | 8 | // Allocate TheTable of the same size as RHS's TheTable, and set the | 254 | 8 | // sentinel appropriately (and NumBuckets). | 255 | 8 | init(RHS.NumBuckets); | 256 | 8 | unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1), | 257 | 8 | *RHSHashTable = (unsigned *)(RHS.TheTable + NumBuckets + 1); | 258 | 8 | | 259 | 8 | NumItems = RHS.NumItems; | 260 | 8 | NumTombstones = RHS.NumTombstones; | 261 | 328 | for (unsigned I = 0, E = NumBuckets; I != E; ++I320 ) { | 262 | 320 | StringMapEntryBase *Bucket = RHS.TheTable[I]; | 263 | 320 | if (!Bucket || Bucket == getTombstoneVal()119 ) { | 264 | 201 | TheTable[I] = Bucket; | 265 | 201 | continue; | 266 | 201 | } | 267 | 119 | | 268 | 119 | TheTable[I] = MapEntryTy::Create( | 269 | 119 | static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator, | 270 | 119 | static_cast<MapEntryTy *>(Bucket)->getValue()); | 271 | 119 | HashTable[I] = RHSHashTable[I]; | 272 | 119 | } | 273 | 8 | | 274 | 8 | // Note that here we've copied everything from the RHS into this object, | 275 | 8 | // tombstones included. We could, instead, have re-probed for each key to | 276 | 8 | // instantiate this new object without any tombstone buckets. The | 277 | 8 | // assumption here is that items are rarely deleted from most StringMaps, | 278 | 8 | // and so tombstones are rare, so the cost of re-probing for all inputs is | 279 | 8 | // not worthwhile. | 280 | 8 | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::StringMap(llvm::StringMap<unsigned int, llvm::MallocAllocator> const&) Line | Count | Source | 249 | 132 | Allocator(RHS.Allocator) { | 250 | 132 | if (RHS.empty()) | 251 | 20 | return; | 252 | 112 | | 253 | 112 | // Allocate TheTable of the same size as RHS's TheTable, and set the | 254 | 112 | // sentinel appropriately (and NumBuckets). | 255 | 112 | init(RHS.NumBuckets); | 256 | 112 | unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1), | 257 | 112 | *RHSHashTable = (unsigned *)(RHS.TheTable + NumBuckets + 1); | 258 | 112 | | 259 | 112 | NumItems = RHS.NumItems; | 260 | 112 | NumTombstones = RHS.NumTombstones; | 261 | 1.90k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.79k ) { | 262 | 1.79k | StringMapEntryBase *Bucket = RHS.TheTable[I]; | 263 | 1.79k | if (!Bucket || Bucket == getTombstoneVal()226 ) { | 264 | 1.56k | TheTable[I] = Bucket; | 265 | 1.56k | continue; | 266 | 1.56k | } | 267 | 226 | | 268 | 226 | TheTable[I] = MapEntryTy::Create( | 269 | 226 | static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator, | 270 | 226 | static_cast<MapEntryTy *>(Bucket)->getValue()); | 271 | 226 | HashTable[I] = RHSHashTable[I]; | 272 | 226 | } | 273 | 112 | | 274 | 112 | // Note that here we've copied everything from the RHS into this object, | 275 | 112 | // tombstones included. We could, instead, have re-probed for each key to | 276 | 112 | // instantiate this new object without any tombstone buckets. The | 277 | 112 | // assumption here is that items are rarely deleted from most StringMaps, | 278 | 112 | // and so tombstones are rare, so the cost of re-probing for all inputs is | 279 | 112 | // not worthwhile. | 280 | 112 | } |
|
281 | | |
282 | 25.9k | StringMap &operator=(StringMap RHS) { |
283 | 25.9k | StringMapImpl::swap(RHS); |
284 | 25.9k | std::swap(Allocator, RHS.Allocator); |
285 | 25.9k | return *this; |
286 | 25.9k | } llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::operator=(llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>) Line | Count | Source | 282 | 5.36k | StringMap &operator=(StringMap RHS) { | 283 | 5.36k | StringMapImpl::swap(RHS); | 284 | 5.36k | std::swap(Allocator, RHS.Allocator); | 285 | 5.36k | return *this; | 286 | 5.36k | } |
llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>::operator=(llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>) Line | Count | Source | 282 | 4 | StringMap &operator=(StringMap RHS) { | 283 | 4 | StringMapImpl::swap(RHS); | 284 | 4 | std::swap(Allocator, RHS.Allocator); | 285 | 4 | return *this; | 286 | 4 | } |
Unexecuted instantiation: llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>::operator=(llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>) llvm::StringMap<char, llvm::MallocAllocator>::operator=(llvm::StringMap<char, llvm::MallocAllocator>) Line | Count | Source | 282 | 17.4k | StringMap &operator=(StringMap RHS) { | 283 | 17.4k | StringMapImpl::swap(RHS); | 284 | 17.4k | std::swap(Allocator, RHS.Allocator); | 285 | 17.4k | return *this; | 286 | 17.4k | } |
StdLibraryFunctionsChecker.cpp:llvm::StringMap<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >, llvm::MallocAllocator>::operator=(llvm::StringMap<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >, llvm::MallocAllocator>) Line | Count | Source | 282 | 13 | StringMap &operator=(StringMap RHS) { | 283 | 13 | StringMapImpl::swap(RHS); | 284 | 13 | std::swap(Allocator, RHS.Allocator); | 285 | 13 | return *this; | 286 | 13 | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::operator=(llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>) Line | Count | Source | 282 | 6 | StringMap &operator=(StringMap RHS) { | 283 | 6 | StringMapImpl::swap(RHS); | 284 | 6 | std::swap(Allocator, RHS.Allocator); | 285 | 6 | return *this; | 286 | 6 | } |
llvm::StringMap<llvm::TimeRecord, llvm::MallocAllocator>::operator=(llvm::StringMap<llvm::TimeRecord, llvm::MallocAllocator>) Line | Count | Source | 282 | 1 | StringMap &operator=(StringMap RHS) { | 283 | 1 | StringMapImpl::swap(RHS); | 284 | 1 | std::swap(Allocator, RHS.Allocator); | 285 | 1 | return *this; | 286 | 1 | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::operator=(llvm::StringMap<unsigned long long, llvm::MallocAllocator>) Line | Count | Source | 282 | 3.02k | StringMap &operator=(StringMap RHS) { | 283 | 3.02k | StringMapImpl::swap(RHS); | 284 | 3.02k | std::swap(Allocator, RHS.Allocator); | 285 | 3.02k | return *this; | 286 | 3.02k | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::operator=(llvm::StringMap<unsigned int, llvm::MallocAllocator>) Line | Count | Source | 282 | 131 | StringMap &operator=(StringMap RHS) { | 283 | 131 | StringMapImpl::swap(RHS); | 284 | 131 | std::swap(Allocator, RHS.Allocator); | 285 | 131 | return *this; | 286 | 131 | } |
|
287 | | |
288 | 17.3M | ~StringMap() { |
289 | 17.3M | // Delete all the elements in the map, but don't reset the elements |
290 | 17.3M | // to default values. This is a copy of clear(), but avoids unnecessary |
291 | 17.3M | // work not required in the destructor. |
292 | 17.3M | if (!empty()) { |
293 | 1.54G | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.54G ) { |
294 | 1.54G | StringMapEntryBase *Bucket = TheTable[I]; |
295 | 1.54G | if (Bucket && Bucket != getTombstoneVal()346M ) { |
296 | 346M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); |
297 | 346M | } |
298 | 1.54G | } |
299 | 2.17M | } |
300 | 17.3M | free(TheTable); |
301 | 17.3M | } llvm::StringMap<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 30.3k | ~StringMap() { | 289 | 30.3k | // Delete all the elements in the map, but don't reset the elements | 290 | 30.3k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 30.3k | // work not required in the destructor. | 292 | 30.3k | if (!empty()30.3k ) { | 293 | 515k | for (unsigned I = 0, E = NumBuckets; I != E; ++I484k ) { | 294 | 484k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 484k | if (Bucket && Bucket != getTombstoneVal()31.7k ) { | 296 | 31.7k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 31.7k | } | 298 | 484k | } | 299 | 30.3k | } | 300 | 30.3k | free(TheTable); | 301 | 30.3k | } |
llvm::StringMap<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 34.2k | ~StringMap() { | 289 | 34.2k | // Delete all the elements in the map, but don't reset the elements | 290 | 34.2k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 34.2k | // work not required in the destructor. | 292 | 34.2k | if (!empty()) { | 293 | 581k | for (unsigned I = 0, E = NumBuckets; I != E; ++I547k ) { | 294 | 547k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 547k | if (Bucket && Bucket != getTombstoneVal()56.9k ) { | 296 | 56.9k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 56.9k | } | 298 | 547k | } | 299 | 34.2k | } | 300 | 34.2k | free(TheTable); | 301 | 34.2k | } |
llvm::StringMap<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 34.2k | ~StringMap() { | 289 | 34.2k | // Delete all the elements in the map, but don't reset the elements | 290 | 34.2k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 34.2k | // work not required in the destructor. | 292 | 34.2k | if (!empty()) { | 293 | 581k | for (unsigned I = 0, E = NumBuckets; I != E; ++I547k ) { | 294 | 547k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 547k | if (Bucket && Bucket != getTombstoneVal()56.9k ) { | 296 | 56.9k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 56.9k | } | 298 | 547k | } | 299 | 34.2k | } | 300 | 34.2k | free(TheTable); | 301 | 34.2k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 2.25k | ~StringMap() { | 289 | 2.25k | // Delete all the elements in the map, but don't reset the elements | 290 | 2.25k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 2.25k | // work not required in the destructor. | 292 | 2.25k | if (!empty()) { | 293 | 33.0k | for (unsigned I = 0, E = NumBuckets; I != E; ++I31.0k ) { | 294 | 31.0k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 31.0k | if (Bucket && Bucket != getTombstoneVal()1.96k ) { | 296 | 1.96k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1.96k | } | 298 | 31.0k | } | 299 | 1.94k | } | 300 | 2.25k | free(TheTable); | 301 | 2.25k | } |
AArch64AsmParser.cpp:llvm::StringMap<std::__1::pair<(anonymous namespace)::RegKind, unsigned int>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 3.49k | ~StringMap() { | 289 | 3.49k | // Delete all the elements in the map, but don't reset the elements | 290 | 3.49k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 3.49k | // work not required in the destructor. | 292 | 3.49k | if (!empty()) { | 293 | 51 | for (unsigned I = 0, E = NumBuckets; I != E; ++I48 ) { | 294 | 48 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 48 | if (Bucket && Bucket != getTombstoneVal()11 ) { | 296 | 9 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 9 | } | 298 | 48 | } | 299 | 3 | } | 300 | 3.49k | free(TheTable); | 301 | 3.49k | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 1.06M | ~StringMap() { | 289 | 1.06M | // Delete all the elements in the map, but don't reset the elements | 290 | 1.06M | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 1.06M | // work not required in the destructor. | 292 | 1.06M | if (!empty()) { | 293 | 64.1M | for (unsigned I = 0, E = NumBuckets; I != E; ++I63.8M ) { | 294 | 63.8M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 63.8M | if (Bucket && Bucket != getTombstoneVal()29.4M ) { | 296 | 29.4M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 29.4M | } | 298 | 63.8M | } | 299 | 343k | } | 300 | 1.06M | free(TheTable); | 301 | 1.06M | } |
llvm::StringMap<int, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 207k | ~StringMap() { | 289 | 207k | // Delete all the elements in the map, but don't reset the elements | 290 | 207k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 207k | // work not required in the destructor. | 292 | 207k | if (!empty()) { | 293 | 3.41M | for (unsigned I = 0, E = NumBuckets; I != E; ++I3.21M ) { | 294 | 3.21M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 3.21M | if (Bucket && Bucket != getTombstoneVal()790k ) { | 296 | 790k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 790k | } | 298 | 3.21M | } | 299 | 200k | } | 300 | 207k | free(TheTable); | 301 | 207k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 294 | ~StringMap() { | 289 | 294 | // Delete all the elements in the map, but don't reset the elements | 290 | 294 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 294 | // work not required in the destructor. | 292 | 294 | if (!empty()) { | 293 | 4.89k | for (unsigned I = 0, E = NumBuckets; I != E; ++I4.60k ) { | 294 | 4.60k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 4.60k | if (Bucket && Bucket != getTombstoneVal()289 ) { | 296 | 289 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 289 | } | 298 | 4.60k | } | 299 | 288 | } | 300 | 294 | free(TheTable); | 301 | 294 | } |
llvm::StringMap<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 3.60k | ~StringMap() { | 289 | 3.60k | // Delete all the elements in the map, but don't reset the elements | 290 | 3.60k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 3.60k | // work not required in the destructor. | 292 | 3.60k | if (!empty()) { | 293 | 59.4k | for (unsigned I = 0, E = NumBuckets; I != E; ++I55.9k ) { | 294 | 55.9k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 55.9k | if (Bucket && Bucket != getTombstoneVal()3.61k ) { | 296 | 3.61k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 3.61k | } | 298 | 55.9k | } | 299 | 3.49k | } | 300 | 3.60k | free(TheTable); | 301 | 3.60k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 25.2k | ~StringMap() { | 289 | 25.2k | // Delete all the elements in the map, but don't reset the elements | 290 | 25.2k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 25.2k | // work not required in the destructor. | 292 | 25.2k | if (!empty()) { | 293 | 68 | for (unsigned I = 0, E = NumBuckets; I != E; ++I64 ) { | 294 | 64 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 64 | if (Bucket && Bucket != getTombstoneVal()36 ) { | 296 | 36 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 36 | } | 298 | 64 | } | 299 | 4 | } | 300 | 25.2k | free(TheTable); | 301 | 25.2k | } |
llvm::StringMap<char, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 1.18M | ~StringMap() { | 289 | 1.18M | // Delete all the elements in the map, but don't reset the elements | 290 | 1.18M | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 1.18M | // work not required in the destructor. | 292 | 1.18M | if (!empty()) { | 293 | 2.87M | for (unsigned I = 0, E = NumBuckets; I != E; ++I2.71M ) { | 294 | 2.71M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 2.71M | if (Bucket && Bucket != getTombstoneVal()475k ) { | 296 | 475k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 475k | } | 298 | 2.71M | } | 299 | 165k | } | 300 | 1.18M | free(TheTable); | 301 | 1.18M | } |
llvm::StringMap<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 3.78k | ~StringMap() { | 289 | 3.78k | // Delete all the elements in the map, but don't reset the elements | 290 | 3.78k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 3.78k | // work not required in the destructor. | 292 | 3.78k | if (!empty()) { | 293 | 57.0k | for (unsigned I = 0, E = NumBuckets; I != E; ++I53.7k ) { | 294 | 53.7k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 53.7k | if (Bucket && Bucket != getTombstoneVal()3.48k ) { | 296 | 3.48k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 3.48k | } | 298 | 53.7k | } | 299 | 3.35k | } | 300 | 3.78k | free(TheTable); | 301 | 3.78k | } |
llvm::StringMap<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 132 | ~StringMap() { | 289 | 132 | // Delete all the elements in the map, but don't reset the elements | 290 | 132 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 132 | // work not required in the destructor. | 292 | 132 | if (!empty()) { | 293 | 1.05k | for (unsigned I = 0, E = NumBuckets; I != E; ++I992 ) { | 294 | 992 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 992 | if (Bucket && Bucket != getTombstoneVal()62 ) { | 296 | 62 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 62 | } | 298 | 992 | } | 299 | 62 | } | 300 | 132 | free(TheTable); | 301 | 132 | } |
llvm::StringMap<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 1.01k | ~StringMap() { | 289 | 1.01k | // Delete all the elements in the map, but don't reset the elements | 290 | 1.01k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 1.01k | // work not required in the destructor. | 292 | 1.01k | if (!empty()) { | 293 | 16.8k | for (unsigned I = 0, E = NumBuckets; I != E; ++I15.8k ) { | 294 | 15.8k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 15.8k | if (Bucket && Bucket != getTombstoneVal()1.00k ) { | 296 | 1.00k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1.00k | } | 298 | 15.8k | } | 299 | 993 | } | 300 | 1.01k | free(TheTable); | 301 | 1.01k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 2.31k | ~StringMap() { | 289 | 2.31k | // Delete all the elements in the map, but don't reset the elements | 290 | 2.31k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 2.31k | // work not required in the destructor. | 292 | 2.31k | if (!empty()) { | 293 | 36.1k | for (unsigned I = 0, E = NumBuckets; I != E; ++I33.9k ) { | 294 | 33.9k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 33.9k | if (Bucket && Bucket != getTombstoneVal()2.16k ) { | 296 | 2.16k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 2.16k | } | 298 | 33.9k | } | 299 | 2.12k | } | 300 | 2.31k | free(TheTable); | 301 | 2.31k | } |
llvm::StringMap<llvm::AsmToken, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 1.45k | ~StringMap() { | 289 | 1.45k | // Delete all the elements in the map, but don't reset the elements | 290 | 1.45k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 1.45k | // work not required in the destructor. | 292 | 1.45k | if (!empty()) { | 293 | 17 | for (unsigned I = 0, E = NumBuckets; I != E; ++I16 ) { | 294 | 16 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 16 | if (Bucket && Bucket != getTombstoneVal()1 ) { | 296 | 1 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1 | } | 298 | 16 | } | 299 | 1 | } | 300 | 1.45k | free(TheTable); | 301 | 1.45k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 3.55k | ~StringMap() { | 289 | 3.55k | // Delete all the elements in the map, but don't reset the elements | 290 | 3.55k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 3.55k | // work not required in the destructor. | 292 | 3.55k | if (!empty()) { | 293 | 31.0k | for (unsigned I = 0, E = NumBuckets; I != E; ++I29.2k ) { | 294 | 29.2k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 29.2k | if (Bucket && Bucket != getTombstoneVal()1.84k ) { | 296 | 1.84k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1.84k | } | 298 | 29.2k | } | 299 | 1.82k | } | 300 | 3.55k | free(TheTable); | 301 | 3.55k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 225 | ~StringMap() { | 289 | 225 | // Delete all the elements in the map, but don't reset the elements | 290 | 225 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 225 | // work not required in the destructor. | 292 | 225 | if (!empty()) { | 293 | 3.29k | for (unsigned I = 0, E = NumBuckets; I != E; ++I3.10k ) { | 294 | 3.10k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 3.10k | if (Bucket && Bucket != getTombstoneVal()194 ) { | 296 | 194 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 194 | } | 298 | 3.10k | } | 299 | 194 | } | 300 | 225 | free(TheTable); | 301 | 225 | } |
llvm::StringMap<llvm::Function*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 102 | ~StringMap() { | 289 | 102 | // Delete all the elements in the map, but don't reset the elements | 290 | 102 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 102 | // work not required in the destructor. | 292 | 102 | if (!empty()) { | 293 | 1.66k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.56k ) { | 294 | 1.56k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.56k | if (Bucket && Bucket != getTombstoneVal()346 ) { | 296 | 346 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 346 | } | 298 | 1.56k | } | 299 | 96 | } | 300 | 102 | free(TheTable); | 301 | 102 | } |
llvm::StringMap<llvm::RTLIB::Libcall, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 24 | ~StringMap() { | 289 | 24 | // Delete all the elements in the map, but don't reset the elements | 290 | 24 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 24 | // work not required in the destructor. | 292 | 24 | if (!empty()) { | 293 | 12.3k | for (unsigned I = 0, E = NumBuckets; I != E; ++I12.2k ) { | 294 | 12.2k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 12.2k | if (Bucket && Bucket != getTombstoneVal()4.87k ) { | 296 | 4.87k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 4.87k | } | 298 | 12.2k | } | 299 | 24 | } | 300 | 24 | free(TheTable); | 301 | 24 | } |
llvm::StringMap<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 471 | ~StringMap() { | 289 | 471 | // Delete all the elements in the map, but don't reset the elements | 290 | 471 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 471 | // work not required in the destructor. | 292 | 471 | if (!empty()) { | 293 | 7.42k | for (unsigned I = 0, E = NumBuckets; I != E; ++I6.99k ) { | 294 | 6.99k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 6.99k | if (Bucket && Bucket != getTombstoneVal()534 ) { | 296 | 533 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 533 | } | 298 | 6.99k | } | 299 | 436 | } | 300 | 471 | free(TheTable); | 301 | 471 | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 8.41k | ~StringMap() { | 289 | 8.41k | // Delete all the elements in the map, but don't reset the elements | 290 | 8.41k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 8.41k | // work not required in the destructor. | 292 | 8.41k | if (!empty()) { | 293 | 12.0k | for (unsigned I = 0, E = NumBuckets; I != E; ++I11.3k ) { | 294 | 11.3k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 11.3k | if (Bucket && Bucket != getTombstoneVal()1.10k ) { | 296 | 1.10k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1.10k | } | 298 | 11.3k | } | 299 | 707 | } | 300 | 8.41k | free(TheTable); | 301 | 8.41k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 19.8k | ~StringMap() { | 289 | 19.8k | // Delete all the elements in the map, but don't reset the elements | 290 | 19.8k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 19.8k | // work not required in the destructor. | 292 | 19.8k | if (!empty()) { | 293 | 195k | for (unsigned I = 0, E = NumBuckets; I != E; ++I184k ) { | 294 | 184k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 184k | if (Bucket && Bucket != getTombstoneVal()11.6k ) { | 296 | 11.6k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 11.6k | } | 298 | 184k | } | 299 | 11.5k | } | 300 | 19.8k | free(TheTable); | 301 | 19.8k | } |
llvm::StringMap<std::__1::pair<unsigned int, unsigned int>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 9.35M | ~StringMap() { | 289 | 9.35M | // Delete all the elements in the map, but don't reset the elements | 290 | 9.35M | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 9.35M | // work not required in the destructor. | 292 | 9.35M | if (!empty()) { | 293 | 731 | for (unsigned I = 0, E = NumBuckets; I != E; ++I688 ) { | 294 | 688 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 688 | if (Bucket && Bucket != getTombstoneVal()155 ) { | 296 | 155 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 155 | } | 298 | 688 | } | 299 | 43 | } | 300 | 9.35M | free(TheTable); | 301 | 9.35M | } |
llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 5.61k | ~StringMap() { | 289 | 5.61k | // Delete all the elements in the map, but don't reset the elements | 290 | 5.61k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 5.61k | // work not required in the destructor. | 292 | 5.61k | if (!empty()) { | 293 | 9.33k | for (unsigned I = 0, E = NumBuckets; I != E; ++I8.78k ) { | 294 | 8.78k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 8.78k | if (Bucket && Bucket != getTombstoneVal()917 ) { | 296 | 917 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 917 | } | 298 | 8.78k | } | 299 | 549 | } | 300 | 5.61k | free(TheTable); | 301 | 5.61k | } |
llvm::StringMap<llvm::GCStrategy*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 36.1k | ~StringMap() { | 289 | 36.1k | // Delete all the elements in the map, but don't reset the elements | 290 | 36.1k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 36.1k | // work not required in the destructor. | 292 | 36.1k | if (!empty()) { | 293 | 442 | for (unsigned I = 0, E = NumBuckets; I != E; ++I416 ) { | 294 | 416 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 416 | if (Bucket && Bucket != getTombstoneVal()26 ) { | 296 | 26 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 26 | } | 298 | 416 | } | 299 | 26 | } | 300 | 36.1k | free(TheTable); | 301 | 36.1k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 526k | ~StringMap() { | 289 | 526k | // Delete all the elements in the map, but don't reset the elements | 290 | 526k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 526k | // work not required in the destructor. | 292 | 526k | if (!empty()) { | 293 | 9.00k | for (unsigned I = 0, E = NumBuckets; I != E; ++I8.48k ) { | 294 | 8.48k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 8.48k | if (Bucket && Bucket != getTombstoneVal()614 ) { | 296 | 614 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 614 | } | 298 | 8.48k | } | 299 | 524 | } | 300 | 526k | free(TheTable); | 301 | 526k | } |
llvm::StringMap<llvm::MDString, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 94.3k | ~StringMap() { | 289 | 94.3k | // Delete all the elements in the map, but don't reset the elements | 290 | 94.3k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 94.3k | // work not required in the destructor. | 292 | 94.3k | if (!empty()) { | 293 | 343k | for (unsigned I = 0, E = NumBuckets; I != E; ++I327k ) { | 294 | 327k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 327k | if (Bucket && Bucket != getTombstoneVal()113k ) { | 296 | 113k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 113k | } | 298 | 327k | } | 299 | 15.9k | } | 300 | 94.3k | free(TheTable); | 301 | 94.3k | } |
llvm::StringMap<llvm::ConstantDataSequential*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 94.3k | ~StringMap() { | 289 | 94.3k | // Delete all the elements in the map, but don't reset the elements | 290 | 94.3k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 94.3k | // work not required in the destructor. | 292 | 94.3k | if (!empty()) { | 293 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 294 | 0 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 296 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 0 | } | 298 | 0 | } | 299 | 0 | } | 300 | 94.3k | free(TheTable); | 301 | 94.3k | } |
llvm::StringMap<llvm::StructType*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 94.3k | ~StringMap() { | 289 | 94.3k | // Delete all the elements in the map, but don't reset the elements | 290 | 94.3k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 94.3k | // work not required in the destructor. | 292 | 94.3k | if (!empty()) { | 293 | 219k | for (unsigned I = 0, E = NumBuckets; I != E; ++I208k ) { | 294 | 208k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 208k | if (Bucket && Bucket != getTombstoneVal()61.3k ) { | 296 | 61.2k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 61.2k | } | 298 | 208k | } | 299 | 10.4k | } | 300 | 94.3k | free(TheTable); | 301 | 94.3k | } |
llvm::StringMap<unsigned char, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 94.3k | ~StringMap() { | 289 | 94.3k | // Delete all the elements in the map, but don't reset the elements | 290 | 94.3k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 94.3k | // work not required in the destructor. | 292 | 94.3k | if (!empty()) { | 293 | 1.60M | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.51M ) { | 294 | 1.51M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.51M | if (Bucket && Bucket != getTombstoneVal()207k ) { | 296 | 207k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 207k | } | 298 | 1.51M | } | 299 | 94.3k | } | 300 | 94.3k | free(TheTable); | 301 | 94.3k | } |
llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 55.7k | ~StringMap() { | 289 | 55.7k | // Delete all the elements in the map, but don't reset the elements | 290 | 55.7k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 55.7k | // work not required in the destructor. | 292 | 55.7k | if (!empty()) { | 293 | 97.6k | for (unsigned I = 0, E = NumBuckets; I != E; ++I93.7k ) { | 294 | 93.7k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 93.7k | if (Bucket && Bucket != getTombstoneVal()30.7k ) { | 296 | 30.7k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 30.7k | } | 298 | 93.7k | } | 299 | 3.90k | } | 300 | 55.7k | free(TheTable); | 301 | 55.7k | } |
llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 55.7k | ~StringMap() { | 289 | 55.7k | // Delete all the elements in the map, but don't reset the elements | 290 | 55.7k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 55.7k | // work not required in the destructor. | 292 | 55.7k | if (!empty()) { | 293 | 238k | for (unsigned I = 0, E = NumBuckets; I != E; ++I224k ) { | 294 | 224k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 224k | if (Bucket && Bucket != getTombstoneVal()31.2k ) { | 296 | 31.1k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 31.1k | } | 298 | 224k | } | 299 | 14.0k | } | 300 | 55.7k | free(TheTable); | 301 | 55.7k | } |
llvm::StringMap<llvm::PassInfo const*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 114k | ~StringMap() { | 289 | 114k | // Delete all the elements in the map, but don't reset the elements | 290 | 114k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 114k | // work not required in the destructor. | 292 | 114k | if (!empty()) { | 293 | 75.7M | for (unsigned I = 0, E = NumBuckets; I != E; ++I75.6M ) { | 294 | 75.6M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 75.6M | if (Bucket && Bucket != getTombstoneVal()32.3M ) { | 296 | 32.3M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 32.3M | } | 298 | 75.6M | } | 299 | 100k | } | 300 | 114k | free(TheTable); | 301 | 114k | } |
llvm::StringMap<unsigned int, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 33.8k | ~StringMap() { | 289 | 33.8k | // Delete all the elements in the map, but don't reset the elements | 290 | 33.8k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 33.8k | // work not required in the destructor. | 292 | 33.8k | if (!empty()) { | 293 | 575k | for (unsigned I = 0, E = NumBuckets; I != E; ++I541k ) { | 294 | 541k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 541k | if (Bucket && Bucket != getTombstoneVal()71.2k ) { | 296 | 71.2k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 71.2k | } | 298 | 541k | } | 299 | 33.8k | } | 300 | 33.8k | free(TheTable); | 301 | 33.8k | } |
llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 1.56M | ~StringMap() { | 289 | 1.56M | // Delete all the elements in the map, but don't reset the elements | 290 | 1.56M | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 1.56M | // work not required in the destructor. | 292 | 1.56M | if (!empty()) { | 293 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 294 | 0 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 296 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 0 | } | 298 | 0 | } | 299 | 0 | } | 300 | 1.56M | free(TheTable); | 301 | 1.56M | } |
llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 873 | ~StringMap() { | 289 | 873 | // Delete all the elements in the map, but don't reset the elements | 290 | 873 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 873 | // work not required in the destructor. | 292 | 873 | if (!empty()) { | 293 | 4.74k | for (unsigned I = 0, E = NumBuckets; I != E; ++I4.28k ) { | 294 | 4.28k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 4.28k | if (Bucket && Bucket != getTombstoneVal()657 ) { | 296 | 657 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 657 | } | 298 | 4.28k | } | 299 | 464 | } | 300 | 873 | free(TheTable); | 301 | 873 | } |
GCOVProfiling.cpp:llvm::StringMap<(anonymous namespace)::GCOVLines, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 303 | ~StringMap() { | 289 | 303 | // Delete all the elements in the map, but don't reset the elements | 290 | 303 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 303 | // work not required in the destructor. | 292 | 303 | if (!empty()) { | 293 | 1.42k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.34k ) { | 294 | 1.34k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.34k | if (Bucket && Bucket != getTombstoneVal()84 ) { | 296 | 84 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 84 | } | 298 | 1.34k | } | 299 | 84 | } | 300 | 303 | free(TheTable); | 301 | 303 | } |
llvm::StringMap<bool, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 156k | ~StringMap() { | 289 | 156k | // Delete all the elements in the map, but don't reset the elements | 290 | 156k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 156k | // work not required in the destructor. | 292 | 156k | if (!empty()) { | 293 | 2.56M | for (unsigned I = 0, E = NumBuckets; I != E; ++I2.45M ) { | 294 | 2.45M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 2.45M | if (Bucket && Bucket != getTombstoneVal()1.16M ) { | 296 | 1.16M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1.16M | } | 298 | 2.45M | } | 299 | 104k | } | 300 | 156k | free(TheTable); | 301 | 156k | } |
llvm::StringMap<llvm::MCSymbol*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::~StringMap() Line | Count | Source | 288 | 53.7k | ~StringMap() { | 289 | 53.7k | // Delete all the elements in the map, but don't reset the elements | 290 | 53.7k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 53.7k | // work not required in the destructor. | 292 | 53.7k | if (!empty()) { | 293 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 294 | 0 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 296 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 0 | } | 298 | 0 | } | 299 | 0 | } | 300 | 53.7k | free(TheTable); | 301 | 53.7k | } |
llvm::StringMap<bool, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::~StringMap() Line | Count | Source | 288 | 53.7k | ~StringMap() { | 289 | 53.7k | // Delete all the elements in the map, but don't reset the elements | 290 | 53.7k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 53.7k | // work not required in the destructor. | 292 | 53.7k | if (!empty()) { | 293 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 294 | 0 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 296 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 0 | } | 298 | 0 | } | 299 | 0 | } | 300 | 53.7k | free(TheTable); | 301 | 53.7k | } |
llvm::StringMap<llvm::MCSectionMachO*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 53.7k | ~StringMap() { | 289 | 53.7k | // Delete all the elements in the map, but don't reset the elements | 290 | 53.7k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 53.7k | // work not required in the destructor. | 292 | 53.7k | if (!empty()) { | 293 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 294 | 0 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 296 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 0 | } | 298 | 0 | } | 299 | 0 | } | 300 | 53.7k | free(TheTable); | 301 | 53.7k | } |
llvm::StringMap<llvm::MCAsmMacro, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 53.7k | ~StringMap() { | 289 | 53.7k | // Delete all the elements in the map, but don't reset the elements | 290 | 53.7k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 53.7k | // work not required in the destructor. | 292 | 53.7k | if (!empty()) { | 293 | 1.50k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.42k ) { | 294 | 1.42k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.42k | if (Bucket && Bucket != getTombstoneVal()290 ) { | 296 | 289 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 289 | } | 298 | 1.42k | } | 299 | 83 | } | 300 | 53.7k | free(TheTable); | 301 | 53.7k | } |
AsmParser.cpp:llvm::StringMap<(anonymous namespace)::AsmParser::DirectiveKind, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 18.4k | ~StringMap() { | 289 | 18.4k | // Delete all the elements in the map, but don't reset the elements | 290 | 18.4k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 18.4k | // work not required in the destructor. | 292 | 18.4k | if (!empty()) { | 293 | 4.72M | for (unsigned I = 0, E = NumBuckets; I != E; ++I4.71M ) { | 294 | 4.71M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 4.71M | if (Bucket && Bucket != getTombstoneVal()2.95M ) { | 296 | 2.95M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 2.95M | } | 298 | 4.71M | } | 299 | 18.4k | } | 300 | 18.4k | free(TheTable); | 301 | 18.4k | } |
llvm::StringMap<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 18.4k | ~StringMap() { | 289 | 18.4k | // Delete all the elements in the map, but don't reset the elements | 290 | 18.4k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 18.4k | // work not required in the destructor. | 292 | 18.4k | if (!empty()) { | 293 | 1.53M | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.51M ) { | 294 | 1.51M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.51M | if (Bucket && Bucket != getTombstoneVal()704k ) { | 296 | 704k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 704k | } | 298 | 1.51M | } | 299 | 18.4k | } | 300 | 18.4k | free(TheTable); | 301 | 18.4k | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 256k | ~StringMap() { | 289 | 256k | // Delete all the elements in the map, but don't reset the elements | 290 | 256k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 256k | // work not required in the destructor. | 292 | 256k | if (!empty()) { | 293 | 235M | for (unsigned I = 0, E = NumBuckets; I != E; ++I234M ) { | 294 | 234M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 234M | if (Bucket && Bucket != getTombstoneVal()150M ) { | 296 | 150M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 150M | } | 298 | 234M | } | 299 | 256k | } | 300 | 256k | free(TheTable); | 301 | 256k | } |
llvm::StringMap<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 257 | ~StringMap() { | 289 | 257 | // Delete all the elements in the map, but don't reset the elements | 290 | 257 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 257 | // work not required in the destructor. | 292 | 257 | if (!empty()) { | 293 | 4.23k | for (unsigned I = 0, E = NumBuckets; I != E; ++I3.98k ) { | 294 | 3.98k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 3.98k | if (Bucket && Bucket != getTombstoneVal()297 ) { | 296 | 297 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 297 | } | 298 | 3.98k | } | 299 | 249 | } | 300 | 257 | free(TheTable); | 301 | 257 | } |
llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 297 | ~StringMap() { | 289 | 297 | // Delete all the elements in the map, but don't reset the elements | 290 | 297 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 297 | // work not required in the destructor. | 292 | 297 | if (!empty()) { | 293 | 5.04k | for (unsigned I = 0, E = NumBuckets; I != E; ++I4.75k ) { | 294 | 4.75k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 4.75k | if (Bucket && Bucket != getTombstoneVal()322 ) { | 296 | 322 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 322 | } | 298 | 4.75k | } | 299 | 297 | } | 300 | 297 | free(TheTable); | 301 | 297 | } |
llvm::StringMap<unsigned long, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 198k | ~StringMap() { | 289 | 198k | // Delete all the elements in the map, but don't reset the elements | 290 | 198k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 198k | // work not required in the destructor. | 292 | 198k | if (!empty()) { | 293 | 64.6k | for (unsigned I = 0, E = NumBuckets; I != E; ++I63.5k ) { | 294 | 63.5k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 63.5k | if (Bucket && Bucket != getTombstoneVal()38.4k ) { | 296 | 38.4k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 38.4k | } | 298 | 63.5k | } | 299 | 1.17k | } | 300 | 198k | free(TheTable); | 301 | 198k | } |
llvm::StringMap<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 1 | ~StringMap() { | 289 | 1 | // Delete all the elements in the map, but don't reset the elements | 290 | 1 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 1 | // work not required in the destructor. | 292 | 1 | if (!empty()) { | 293 | 17 | for (unsigned I = 0, E = NumBuckets; I != E; ++I16 ) { | 294 | 16 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 16 | if (Bucket && Bucket != getTombstoneVal()10 ) { | 296 | 10 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 10 | } | 298 | 16 | } | 299 | 1 | } | 300 | 1 | free(TheTable); | 301 | 1 | } |
llvm::StringMap<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 14 | ~StringMap() { | 289 | 14 | // Delete all the elements in the map, but don't reset the elements | 290 | 14 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 14 | // work not required in the destructor. | 292 | 14 | if (!empty()) { | 293 | 153 | for (unsigned I = 0, E = NumBuckets; I != E; ++I144 ) { | 294 | 144 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 144 | if (Bucket && Bucket != getTombstoneVal()9 ) { | 296 | 9 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 9 | } | 298 | 144 | } | 299 | 9 | } | 300 | 14 | free(TheTable); | 301 | 14 | } |
llvm::StringMap<llvm::Timer, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 9 | ~StringMap() { | 289 | 9 | // Delete all the elements in the map, but don't reset the elements | 290 | 9 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 9 | // work not required in the destructor. | 292 | 9 | if (!empty()) { | 293 | 153 | for (unsigned I = 0, E = NumBuckets; I != E; ++I144 ) { | 294 | 144 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 144 | if (Bucket && Bucket != getTombstoneVal()9 ) { | 296 | 9 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 9 | } | 298 | 144 | } | 299 | 9 | } | 300 | 9 | free(TheTable); | 301 | 9 | } |
llvm::StringMap<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 128k | ~StringMap() { | 289 | 128k | // Delete all the elements in the map, but don't reset the elements | 290 | 128k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 128k | // work not required in the destructor. | 292 | 128k | if (!empty()) { | 293 | 2.20M | for (unsigned I = 0, E = NumBuckets; I != E; ++I2.07M ) { | 294 | 2.07M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 2.07M | if (Bucket && Bucket != getTombstoneVal()140k ) { | 296 | 140k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 140k | } | 298 | 2.07M | } | 299 | 128k | } | 300 | 128k | free(TheTable); | 301 | 128k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 61.4k | ~StringMap() { | 289 | 61.4k | // Delete all the elements in the map, but don't reset the elements | 290 | 61.4k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 61.4k | // work not required in the destructor. | 292 | 61.4k | if (!empty()) { | 293 | 1.35M | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.29M ) { | 294 | 1.29M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.29M | if (Bucket && Bucket != getTombstoneVal()514k ) { | 296 | 514k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 514k | } | 298 | 1.29M | } | 299 | 61.0k | } | 300 | 61.4k | free(TheTable); | 301 | 61.4k | } |
llvm::StringMap<void*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 2 | ~StringMap() { | 289 | 2 | // Delete all the elements in the map, but don't reset the elements | 290 | 2 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 2 | // work not required in the destructor. | 292 | 2 | if (!empty()) { | 293 | 34 | for (unsigned I = 0, E = NumBuckets; I != E; ++I32 ) { | 294 | 32 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 32 | if (Bucket && Bucket != getTombstoneVal()3 ) { | 296 | 3 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 3 | } | 298 | 32 | } | 299 | 2 | } | 300 | 2 | free(TheTable); | 301 | 2 | } |
llvm::StringMap<clang::DirectoryEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 75.9k | ~StringMap() { | 289 | 75.9k | // Delete all the elements in the map, but don't reset the elements | 290 | 75.9k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 75.9k | // work not required in the destructor. | 292 | 75.9k | if (!empty()) { | 293 | 9.78M | for (unsigned I = 0, E = NumBuckets; I != E; ++I9.70M ) { | 294 | 9.70M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 9.70M | if (Bucket && Bucket != getTombstoneVal()201k ) { | 296 | 201k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 201k | } | 298 | 9.70M | } | 299 | 75.7k | } | 300 | 75.9k | free(TheTable); | 301 | 75.9k | } |
llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 75.9k | ~StringMap() { | 289 | 75.9k | // Delete all the elements in the map, but don't reset the elements | 290 | 75.9k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 75.9k | // work not required in the destructor. | 292 | 75.9k | if (!empty()) { | 293 | 9.82M | for (unsigned I = 0, E = NumBuckets; I != E; ++I9.75M ) { | 294 | 9.75M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 9.75M | if (Bucket && Bucket != getTombstoneVal()195k ) { | 296 | 195k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 195k | } | 298 | 9.75M | } | 299 | 75.7k | } | 300 | 75.9k | free(TheTable); | 301 | 75.9k | } |
llvm::StringMap<llvm::vfs::Status, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 11 | ~StringMap() { | 289 | 11 | // Delete all the elements in the map, but don't reset the elements | 290 | 11 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 11 | // work not required in the destructor. | 292 | 11 | if (!empty()) { | 293 | 136 | for (unsigned I = 0, E = NumBuckets; I != E; ++I128 ) { | 294 | 128 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 128 | if (Bucket && Bucket != getTombstoneVal()19 ) { | 296 | 19 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 19 | } | 298 | 128 | } | 299 | 8 | } | 300 | 11 | free(TheTable); | 301 | 11 | } |
llvm::StringMap<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 312 | ~StringMap() { | 289 | 312 | // Delete all the elements in the map, but don't reset the elements | 290 | 312 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 312 | // work not required in the destructor. | 292 | 312 | if (!empty()) { | 293 | 2.22k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.90k ) { | 294 | 1.90k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.90k | if (Bucket && Bucket != getTombstoneVal()559 ) { | 296 | 559 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 559 | } | 298 | 1.90k | } | 299 | 312 | } | 300 | 312 | free(TheTable); | 301 | 312 | } |
llvm::StringMap<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 5.76k | ~StringMap() { | 289 | 5.76k | // Delete all the elements in the map, but don't reset the elements | 290 | 5.76k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 5.76k | // work not required in the destructor. | 292 | 5.76k | if (!empty()) { | 293 | 21.9k | for (unsigned I = 0, E = NumBuckets; I != E; ++I20.6k ) { | 294 | 20.6k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 20.6k | if (Bucket && Bucket != getTombstoneVal()1.29k ) { | 296 | 1.29k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1.29k | } | 298 | 20.6k | } | 299 | 1.29k | } | 300 | 5.76k | free(TheTable); | 301 | 5.76k | } |
llvm::StringMap<llvm::Constant*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 17.8k | ~StringMap() { | 289 | 17.8k | // Delete all the elements in the map, but don't reset the elements | 290 | 17.8k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 17.8k | // work not required in the destructor. | 292 | 17.8k | if (!empty()) { | 293 | 272 | for (unsigned I = 0, E = NumBuckets; I != E; ++I256 ) { | 294 | 256 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 256 | if (Bucket && Bucket != getTombstoneVal()47 ) { | 296 | 47 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 47 | } | 298 | 256 | } | 299 | 16 | } | 300 | 17.8k | free(TheTable); | 301 | 17.8k | } |
llvm::StringMap<llvm::GlobalVariable*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 19.9k | ~StringMap() { | 289 | 19.9k | // Delete all the elements in the map, but don't reset the elements | 290 | 19.9k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 19.9k | // work not required in the destructor. | 292 | 19.9k | if (!empty()) { | 293 | 16.2k | for (unsigned I = 0, E = NumBuckets; I != E; ++I15.3k ) { | 294 | 15.3k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 15.3k | if (Bucket && Bucket != getTombstoneVal()2.42k ) { | 296 | 2.42k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 2.42k | } | 298 | 15.3k | } | 299 | 926 | } | 300 | 19.9k | free(TheTable); | 301 | 19.9k | } |
llvm::StringMap<llvm::WeakTrackingVH, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 3.46k | ~StringMap() { | 289 | 3.46k | // Delete all the elements in the map, but don't reset the elements | 290 | 3.46k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 3.46k | // work not required in the destructor. | 292 | 3.46k | if (!empty()) { | 293 | 187 | for (unsigned I = 0, E = NumBuckets; I != E; ++I176 ) { | 294 | 176 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 176 | if (Bucket && Bucket != getTombstoneVal()11 ) { | 296 | 11 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 11 | } | 298 | 176 | } | 299 | 11 | } | 300 | 3.46k | free(TheTable); | 301 | 3.46k | } |
llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 3.46k | ~StringMap() { | 289 | 3.46k | // Delete all the elements in the map, but don't reset the elements | 290 | 3.46k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 3.46k | // work not required in the destructor. | 292 | 3.46k | if (!empty()) { | 293 | 759 | for (unsigned I = 0, E = NumBuckets; I != E; ++I720 ) { | 294 | 720 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 720 | if (Bucket && Bucket != getTombstoneVal()146 ) { | 296 | 146 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 146 | } | 298 | 720 | } | 299 | 39 | } | 300 | 3.46k | free(TheTable); | 301 | 3.46k | } |
llvm::StringMap<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 1.44k | ~StringMap() { | 289 | 1.44k | // Delete all the elements in the map, but don't reset the elements | 290 | 1.44k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 1.44k | // work not required in the destructor. | 292 | 1.44k | if (!empty()) { | 293 | 24.6k | for (unsigned I = 0, E = NumBuckets; I != E; ++I23.1k ) { | 294 | 23.1k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 23.1k | if (Bucket && Bucket != getTombstoneVal()3.51k ) { | 296 | 3.51k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 3.51k | } | 298 | 23.1k | } | 299 | 1.44k | } | 300 | 1.44k | free(TheTable); | 301 | 1.44k | } |
llvm::StringMap<llvm::AssertingVH<llvm::Constant>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 3.46k | ~StringMap() { | 289 | 3.46k | // Delete all the elements in the map, but don't reset the elements | 290 | 3.46k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 3.46k | // work not required in the destructor. | 292 | 3.46k | if (!empty()) { | 293 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 294 | 0 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 296 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 0 | } | 298 | 0 | } | 299 | 0 | } | 300 | 3.46k | free(TheTable); | 301 | 3.46k | } |
llvm::StringMap<llvm::TrackingVH<llvm::Constant>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 17.6k | ~StringMap() { | 289 | 17.6k | // Delete all the elements in the map, but don't reset the elements | 290 | 17.6k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 17.6k | // work not required in the destructor. | 292 | 17.6k | if (!empty()) { | 293 | 504 | for (unsigned I = 0, E = NumBuckets; I != E; ++I480 ) { | 294 | 480 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 480 | if (Bucket && Bucket != getTombstoneVal()127 ) { | 296 | 127 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 127 | } | 298 | 480 | } | 299 | 24 | } | 300 | 17.6k | free(TheTable); | 301 | 17.6k | } |
llvm::StringMap<clang::GlobalDecl, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 17.6k | ~StringMap() { | 289 | 17.6k | // Delete all the elements in the map, but don't reset the elements | 290 | 17.6k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 17.6k | // work not required in the destructor. | 292 | 17.6k | if (!empty()) { | 293 | 4.68M | for (unsigned I = 0, E = NumBuckets; I != E; ++I4.66M ) { | 294 | 4.66M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 4.66M | if (Bucket && Bucket != getTombstoneVal()2.34M ) { | 296 | 2.34M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 2.34M | } | 298 | 4.66M | } | 299 | 16.3k | } | 300 | 17.6k | free(TheTable); | 301 | 17.6k | } |
llvm::StringMap<std::__1::pair<clang::GlobalDecl, unsigned int>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 17.6k | ~StringMap() { | 289 | 17.6k | // Delete all the elements in the map, but don't reset the elements | 290 | 17.6k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 17.6k | // work not required in the destructor. | 292 | 17.6k | if (!empty()) { | 293 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 294 | 0 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 296 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 0 | } | 298 | 0 | } | 299 | 0 | } | 300 | 17.6k | free(TheTable); | 301 | 17.6k | } |
llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 98.6k | ~StringMap() { | 289 | 98.6k | // Delete all the elements in the map, but don't reset the elements | 290 | 98.6k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 98.6k | // work not required in the destructor. | 292 | 98.6k | if (!empty()) { | 293 | 6.41M | for (unsigned I = 0, E = NumBuckets; I != E; ++I6.31M ) { | 294 | 6.31M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 6.31M | if (Bucket && Bucket != getTombstoneVal()4.04M ) { | 296 | 4.04M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 4.04M | } | 298 | 6.31M | } | 299 | 98.6k | } | 300 | 98.6k | free(TheTable); | 301 | 98.6k | } |
llvm::StringMap<char const*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 86 | ~StringMap() { | 289 | 86 | // Delete all the elements in the map, but don't reset the elements | 290 | 86 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 86 | // work not required in the destructor. | 292 | 86 | if (!empty()) { | 293 | 1.46k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.37k ) { | 294 | 1.37k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.37k | if (Bucket && Bucket != getTombstoneVal()105 ) { | 296 | 105 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 105 | } | 298 | 1.37k | } | 299 | 86 | } | 300 | 86 | free(TheTable); | 301 | 86 | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 146k | ~StringMap() { | 289 | 146k | // Delete all the elements in the map, but don't reset the elements | 290 | 146k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 146k | // work not required in the destructor. | 292 | 146k | if (!empty()) { | 293 | 5.21M | for (unsigned I = 0, E = NumBuckets; I != E; ++I5.11M ) { | 294 | 5.11M | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 5.11M | if (Bucket && Bucket != getTombstoneVal()2.24M ) { | 296 | 2.24M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 2.24M | } | 298 | 5.11M | } | 299 | 102k | } | 300 | 146k | free(TheTable); | 301 | 146k | } |
llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 684 | ~StringMap() { | 289 | 684 | // Delete all the elements in the map, but don't reset the elements | 290 | 684 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 684 | // work not required in the destructor. | 292 | 684 | if (!empty()) { | 293 | 1.12k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.05k ) { | 294 | 1.05k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.05k | if (Bucket && Bucket != getTombstoneVal()157 ) { | 296 | 157 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 157 | } | 298 | 1.05k | } | 299 | 66 | } | 300 | 684 | free(TheTable); | 301 | 684 | } |
llvm::StringMap<char, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 34.7k | ~StringMap() { | 289 | 34.7k | // Delete all the elements in the map, but don't reset the elements | 290 | 34.7k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 34.7k | // work not required in the destructor. | 292 | 34.7k | if (!empty()) { | 293 | 1.10k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.04k ) { | 294 | 1.04k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.04k | if (Bucket && Bucket != getTombstoneVal()145 ) { | 296 | 145 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 145 | } | 298 | 1.04k | } | 299 | 65 | } | 300 | 34.7k | free(TheTable); | 301 | 34.7k | } |
llvm::StringMap<clang::InMemoryModuleCache::PCM, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 34.0k | ~StringMap() { | 289 | 34.0k | // Delete all the elements in the map, but don't reset the elements | 290 | 34.0k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 34.0k | // work not required in the destructor. | 292 | 34.0k | if (!empty()) { | 293 | 61.5k | for (unsigned I = 0, E = NumBuckets; I != E; ++I57.9k ) { | 294 | 57.9k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 57.9k | if (Bucket && Bucket != getTombstoneVal()5.46k ) { | 296 | 5.46k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 5.46k | } | 298 | 57.9k | } | 299 | 3.56k | } | 300 | 34.0k | free(TheTable); | 301 | 34.0k | } |
llvm::StringMap<clang::SourceLocation, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 4.72k | ~StringMap() { | 289 | 4.72k | // Delete all the elements in the map, but don't reset the elements | 290 | 4.72k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 4.72k | // work not required in the destructor. | 292 | 4.72k | if (!empty()) { | 293 | 153 | for (unsigned I = 0, E = NumBuckets; I != E; ++I144 ) { | 294 | 144 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 144 | if (Bucket && Bucket != getTombstoneVal()12 ) { | 296 | 12 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 12 | } | 298 | 144 | } | 299 | 9 | } | 300 | 4.72k | free(TheTable); | 301 | 4.72k | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 2 | ~StringMap() { | 289 | 2 | // Delete all the elements in the map, but don't reset the elements | 290 | 2 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 2 | // work not required in the destructor. | 292 | 2 | if (!empty()) { | 293 | 34 | for (unsigned I = 0, E = NumBuckets; I != E; ++I32 ) { | 294 | 32 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 32 | if (Bucket && Bucket != getTombstoneVal()14 ) { | 296 | 14 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 14 | } | 298 | 32 | } | 299 | 2 | } | 300 | 2 | free(TheTable); | 301 | 2 | } |
llvm::StringMap<clang::FrameworkCacheEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 34.0k | ~StringMap() { | 289 | 34.0k | // Delete all the elements in the map, but don't reset the elements | 290 | 34.0k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 34.0k | // work not required in the destructor. | 292 | 34.0k | if (!empty()) { | 293 | 26.4k | for (unsigned I = 0, E = NumBuckets; I != E; ++I26.2k ) { | 294 | 26.2k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 26.2k | if (Bucket && Bucket != getTombstoneVal()270 ) { | 296 | 270 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 270 | } | 298 | 26.2k | } | 299 | 205 | } | 300 | 34.0k | free(TheTable); | 301 | 34.0k | } |
llvm::StringMap<clang::HeaderSearch::LookupFileCacheInfo, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 34.0k | ~StringMap() { | 289 | 34.0k | // Delete all the elements in the map, but don't reset the elements | 290 | 34.0k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 34.0k | // work not required in the destructor. | 292 | 34.0k | if (!empty()) { | 293 | 55.4k | for (unsigned I = 0, E = NumBuckets; I != E; ++I53.3k ) { | 294 | 53.3k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 53.3k | if (Bucket && Bucket != getTombstoneVal()16.6k ) { | 296 | 16.6k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 16.6k | } | 298 | 53.3k | } | 299 | 2.06k | } | 300 | 34.0k | free(TheTable); | 301 | 34.0k | } |
llvm::StringMap<clang::IdentifierInfo*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::~StringMap() Line | Count | Source | 288 | 67.5k | ~StringMap() { | 289 | 67.5k | // Delete all the elements in the map, but don't reset the elements | 290 | 67.5k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 67.5k | // work not required in the destructor. | 292 | 67.5k | if (!empty()) { | 293 | 1.10G | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.10G ) { | 294 | 1.10G | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.10G | if (Bucket && Bucket != getTombstoneVal()116M ) { | 296 | 116M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 116M | } | 298 | 1.10G | } | 299 | 67.5k | } | 300 | 67.5k | free(TheTable); | 301 | 67.5k | } |
llvm::StringMap<clang::LayoutOverrideSource::Layout, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 6 | ~StringMap() { | 289 | 6 | // Delete all the elements in the map, but don't reset the elements | 290 | 6 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 6 | // work not required in the destructor. | 292 | 6 | if (!empty()) { | 293 | 118 | for (unsigned I = 0, E = NumBuckets; I != E; ++I112 ) { | 294 | 112 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 112 | if (Bucket && Bucket != getTombstoneVal()37 ) { | 296 | 37 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 37 | } | 298 | 112 | } | 299 | 6 | } | 300 | 6 | free(TheTable); | 301 | 6 | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMap<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 11.9k | ~StringMap() { | 289 | 11.9k | // Delete all the elements in the map, but don't reset the elements | 290 | 11.9k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 11.9k | // work not required in the destructor. | 292 | 11.9k | if (!empty()) { | 293 | 17 | for (unsigned I = 0, E = NumBuckets; I != E; ++I16 ) { | 294 | 16 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 16 | if (Bucket && Bucket != getTombstoneVal()2 ) { | 296 | 1 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1 | } | 298 | 16 | } | 299 | 1 | } | 300 | 11.9k | free(TheTable); | 301 | 11.9k | } |
llvm::StringMap<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 11.9k | ~StringMap() { | 289 | 11.9k | // Delete all the elements in the map, but don't reset the elements | 290 | 11.9k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 11.9k | // work not required in the destructor. | 292 | 11.9k | if (!empty()) { | 293 | 11.6k | for (unsigned I = 0, E = NumBuckets; I != E; ++I10.9k ) { | 294 | 10.9k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 10.9k | if (Bucket && Bucket != getTombstoneVal()836 ) { | 296 | 836 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 836 | } | 298 | 10.9k | } | 299 | 685 | } | 300 | 11.9k | free(TheTable); | 301 | 11.9k | } |
llvm::StringMap<std::__1::pair<llvm::StringRef, bool>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 8.03k | ~StringMap() { | 289 | 8.03k | // Delete all the elements in the map, but don't reset the elements | 290 | 8.03k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 8.03k | // work not required in the destructor. | 292 | 8.03k | if (!empty()) { | 293 | 43.0k | for (unsigned I = 0, E = NumBuckets; I != E; ++I40.5k ) { | 294 | 40.5k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 40.5k | if (Bucket && Bucket != getTombstoneVal()3.95k ) { | 296 | 3.95k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 3.95k | } | 298 | 40.5k | } | 299 | 2.53k | } | 300 | 8.03k | free(TheTable); | 301 | 8.03k | } |
llvm::StringMap<std::__1::shared_ptr<clang::ModuleFileExtension>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 5.27k | ~StringMap() { | 289 | 5.27k | // Delete all the elements in the map, but don't reset the elements | 290 | 5.27k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 5.27k | // work not required in the destructor. | 292 | 5.27k | if (!empty()) { | 293 | 238 | for (unsigned I = 0, E = NumBuckets; I != E; ++I224 ) { | 294 | 224 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 224 | if (Bucket && Bucket != getTombstoneVal()27 ) { | 296 | 27 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 27 | } | 298 | 224 | } | 299 | 14 | } | 300 | 5.27k | free(TheTable); | 301 | 5.27k | } |
llvm::StringMap<llvm::SmallVector<unsigned int, 2u>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 631 | ~StringMap() { | 289 | 631 | // Delete all the elements in the map, but don't reset the elements | 290 | 631 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 631 | // work not required in the destructor. | 292 | 631 | if (!empty()) { | 293 | 169k | for (unsigned I = 0, E = NumBuckets; I != E; ++I169k ) { | 294 | 169k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 169k | if (Bucket && Bucket != getTombstoneVal()89.9k ) { | 296 | 89.9k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 89.9k | } | 298 | 169k | } | 299 | 625 | } | 300 | 631 | free(TheTable); | 301 | 631 | } |
llvm::StringMap<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 1.18k | ~StringMap() { | 289 | 1.18k | // Delete all the elements in the map, but don't reset the elements | 290 | 1.18k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 1.18k | // work not required in the destructor. | 292 | 1.18k | if (!empty()) { | 293 | 561 | for (unsigned I = 0, E = NumBuckets; I != E; ++I528 ) { | 294 | 528 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 528 | if (Bucket && Bucket != getTombstoneVal()85 ) { | 296 | 85 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 85 | } | 298 | 528 | } | 299 | 33 | } | 300 | 1.18k | free(TheTable); | 301 | 1.18k | } |
llvm::StringMap<llvm::DIE const*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 5.45k | ~StringMap() { | 289 | 5.45k | // Delete all the elements in the map, but don't reset the elements | 290 | 5.45k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 5.45k | // work not required in the destructor. | 292 | 5.45k | if (!empty()) { | 293 | 143k | for (unsigned I = 0, E = NumBuckets; I != E; ++I141k ) { | 294 | 141k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 141k | if (Bucket && Bucket != getTombstoneVal()70.3k ) { | 296 | 70.3k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 70.3k | } | 298 | 141k | } | 299 | 2.02k | } | 300 | 5.45k | free(TheTable); | 301 | 5.45k | } |
llvm::StringMap<llvm::AccelTableBase::HashData, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::~StringMap() Line | Count | Source | 288 | 178k | ~StringMap() { | 289 | 178k | // Delete all the elements in the map, but don't reset the elements | 290 | 178k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 178k | // work not required in the destructor. | 292 | 178k | if (!empty()) { | 293 | 149k | for (unsigned I = 0, E = NumBuckets; I != E; ++I146k ) { | 294 | 146k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 146k | if (Bucket && Bucket != getTombstoneVal()71.8k ) { | 296 | 71.8k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 71.8k | } | 298 | 146k | } | 299 | 2.27k | } | 300 | 178k | free(TheTable); | 301 | 178k | } |
llvm::StringMap<llvm::DwarfStringPoolEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::~StringMap() Line | Count | Source | 288 | 71.3k | ~StringMap() { | 289 | 71.3k | // Delete all the elements in the map, but don't reset the elements | 290 | 71.3k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 71.3k | // work not required in the destructor. | 292 | 71.3k | if (!empty()) { | 293 | 164k | for (unsigned I = 0, E = NumBuckets; I != E; ++I161k ) { | 294 | 161k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 161k | if (Bucket && Bucket != getTombstoneVal()82.8k ) { | 296 | 82.8k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 82.8k | } | 298 | 161k | } | 299 | 2.41k | } | 300 | 71.3k | free(TheTable); | 301 | 71.3k | } |
llvm::StringMap<std::__1::weak_ptr<llvm::DWARFContext::DWOFile>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 1.67k | ~StringMap() { | 289 | 1.67k | // Delete all the elements in the map, but don't reset the elements | 290 | 1.67k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 1.67k | // work not required in the destructor. | 292 | 1.67k | if (!empty()) { | 293 | 153 | for (unsigned I = 0, E = NumBuckets; I != E; ++I144 ) { | 294 | 144 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 144 | if (Bucket && Bucket != getTombstoneVal()9 ) { | 296 | 9 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 9 | } | 298 | 144 | } | 299 | 9 | } | 300 | 1.67k | free(TheTable); | 301 | 1.67k | } |
llvm::StringMap<unsigned short, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 39 | ~StringMap() { | 289 | 39 | // Delete all the elements in the map, but don't reset the elements | 290 | 39 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 39 | // work not required in the destructor. | 292 | 39 | if (!empty()) { | 293 | 663 | for (unsigned I = 0, E = NumBuckets; I != E; ++I624 ) { | 294 | 624 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 624 | if (Bucket && Bucket != getTombstoneVal()47 ) { | 296 | 47 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 47 | } | 298 | 624 | } | 299 | 39 | } | 300 | 39 | free(TheTable); | 301 | 39 | } |
llvm::StringMap<llvm::SDNode*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 37.9k | ~StringMap() { | 289 | 37.9k | // Delete all the elements in the map, but don't reset the elements | 290 | 37.9k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 37.9k | // work not required in the destructor. | 292 | 37.9k | if (!empty()) { | 293 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 294 | 0 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 296 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 0 | } | 298 | 0 | } | 299 | 0 | } | 300 | 37.9k | free(TheTable); | 301 | 37.9k | } |
llvm::StringMap<llvm::lto::LTO::GlobalResolution, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 3.05k | ~StringMap() { | 289 | 3.05k | // Delete all the elements in the map, but don't reset the elements | 290 | 3.05k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 3.05k | // work not required in the destructor. | 292 | 3.05k | if (!empty()) { | 293 | 7.44k | for (unsigned I = 0, E = NumBuckets; I != E; ++I7.00k ) { | 294 | 7.00k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 7.00k | if (Bucket && Bucket != getTombstoneVal()1.04k ) { | 296 | 1.04k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1.04k | } | 298 | 7.00k | } | 299 | 437 | } | 300 | 3.05k | free(TheTable); | 301 | 3.05k | } |
llvm::StringMap<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 282 | ~StringMap() { | 289 | 282 | // Delete all the elements in the map, but don't reset the elements | 290 | 282 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 282 | // work not required in the destructor. | 292 | 282 | if (!empty()) { | 293 | 1.54k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.26k ) { | 294 | 1.26k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.26k | if (Bucket && Bucket != getTombstoneVal()521 ) { | 296 | 521 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 521 | } | 298 | 1.26k | } | 299 | 282 | } | 300 | 282 | free(TheTable); | 301 | 282 | } |
llvm::StringMap<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 256 | ~StringMap() { | 289 | 256 | // Delete all the elements in the map, but don't reset the elements | 290 | 256 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 256 | // work not required in the destructor. | 292 | 256 | if (!empty()) { | 293 | 4.25k | for (unsigned I = 0, E = NumBuckets; I != E; ++I4.00k ) { | 294 | 4.00k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 4.00k | if (Bucket && Bucket != getTombstoneVal()431 ) { | 296 | 431 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 431 | } | 298 | 4.00k | } | 299 | 250 | } | 300 | 256 | free(TheTable); | 301 | 256 | } |
llvm::StringMap<clang::Stmt*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 910 | ~StringMap() { | 289 | 910 | // Delete all the elements in the map, but don't reset the elements | 290 | 910 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 910 | // work not required in the destructor. | 292 | 910 | if (!empty()) { | 293 | 30.5k | for (unsigned I = 0, E = NumBuckets; I != E; ++I29.6k ) { | 294 | 29.6k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 29.6k | if (Bucket && Bucket != getTombstoneVal()13.0k ) { | 296 | 13.0k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 13.0k | } | 298 | 29.6k | } | 299 | 847 | } | 300 | 910 | free(TheTable); | 301 | 910 | } |
llvm::StringMap<FoundationClass, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 13 | ~StringMap() { | 289 | 13 | // Delete all the elements in the map, but don't reset the elements | 290 | 13 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 13 | // work not required in the destructor. | 292 | 13 | if (!empty()) { | 293 | 221 | for (unsigned I = 0, E = NumBuckets; I != E; ++I208 ) { | 294 | 208 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 208 | if (Bucket && Bucket != getTombstoneVal()91 ) { | 296 | 91 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 91 | } | 298 | 208 | } | 299 | 13 | } | 300 | 13 | free(TheTable); | 301 | 13 | } |
llvm::StringMap<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 24 | ~StringMap() { | 289 | 24 | // Delete all the elements in the map, but don't reset the elements | 290 | 24 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 24 | // work not required in the destructor. | 292 | 24 | if (!empty()) { | 293 | 85 | for (unsigned I = 0, E = NumBuckets; I != E; ++I80 ) { | 294 | 80 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 80 | if (Bucket && Bucket != getTombstoneVal()20 ) { | 296 | 20 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 20 | } | 298 | 80 | } | 299 | 5 | } | 300 | 24 | free(TheTable); | 301 | 24 | } |
StdLibraryFunctionsChecker.cpp:llvm::StringMap<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 34 | ~StringMap() { | 289 | 34 | // Delete all the elements in the map, but don't reset the elements | 290 | 34 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 34 | // work not required in the destructor. | 292 | 34 | if (!empty()) { | 293 | 429 | for (unsigned I = 0, E = NumBuckets; I != E; ++I416 ) { | 294 | 416 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 416 | if (Bucket && Bucket != getTombstoneVal()286 ) { | 296 | 286 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 286 | } | 298 | 416 | } | 299 | 13 | } | 300 | 34 | free(TheTable); | 301 | 34 | } |
llvm::StringMap<clang::ento::BugType*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 38.6k | ~StringMap() { | 289 | 38.6k | // Delete all the elements in the map, but don't reset the elements | 290 | 38.6k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 38.6k | // work not required in the destructor. | 292 | 38.6k | if (!empty()) { | 293 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 294 | 0 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 296 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 0 | } | 298 | 0 | } | 299 | 0 | } | 300 | 38.6k | free(TheTable); | 301 | 38.6k | } |
llvm::StringMap<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 928 | ~StringMap() { | 289 | 928 | // Delete all the elements in the map, but don't reset the elements | 290 | 928 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 928 | // work not required in the destructor. | 292 | 928 | if (!empty()) { | 293 | 238 | for (unsigned I = 0, E = NumBuckets; I != E; ++I224 ) { | 294 | 224 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 224 | if (Bucket && Bucket != getTombstoneVal()32 ) { | 296 | 32 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 32 | } | 298 | 224 | } | 299 | 14 | } | 300 | 928 | free(TheTable); | 301 | 928 | } |
llvm::StringMap<clang::ASTUnit*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 920 | ~StringMap() { | 289 | 920 | // Delete all the elements in the map, but don't reset the elements | 290 | 920 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 920 | // work not required in the destructor. | 292 | 920 | if (!empty()) { | 293 | 134 | for (unsigned I = 0, E = NumBuckets; I != E; ++I128 ) { | 294 | 128 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 128 | if (Bucket && Bucket != getTombstoneVal()57 ) { | 296 | 57 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 57 | } | 298 | 128 | } | 299 | 6 | } | 300 | 920 | free(TheTable); | 301 | 920 | } |
llvm::StringMap<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 9 | ~StringMap() { | 289 | 9 | // Delete all the elements in the map, but don't reset the elements | 290 | 9 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 9 | // work not required in the destructor. | 292 | 9 | if (!empty()) { | 293 | 51 | for (unsigned I = 0, E = NumBuckets; I != E; ++I48 ) { | 294 | 48 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 48 | if (Bucket && Bucket != getTombstoneVal()3 ) { | 296 | 3 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 3 | } | 298 | 48 | } | 299 | 3 | } | 300 | 9 | free(TheTable); | 301 | 9 | } |
llvm::StringMap<llvm::SmallVector<clang::TypoCorrection, 1u>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 6.72k | ~StringMap() { | 289 | 6.72k | // Delete all the elements in the map, but don't reset the elements | 290 | 6.72k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 6.72k | // work not required in the destructor. | 292 | 6.72k | if (!empty()) { | 293 | 13.8k | for (unsigned I = 0, E = NumBuckets; I != E; ++I13.0k ) { | 294 | 13.0k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 13.0k | if (Bucket && Bucket != getTombstoneVal()2.00k ) { | 296 | 1.49k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1.49k | } | 298 | 13.0k | } | 299 | 781 | } | 300 | 6.72k | free(TheTable); | 301 | 6.72k | } |
llvm::StringMap<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 32.9k | ~StringMap() { | 289 | 32.9k | // Delete all the elements in the map, but don't reset the elements | 290 | 32.9k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 32.9k | // work not required in the destructor. | 292 | 32.9k | if (!empty()) { | 293 | 272 | for (unsigned I = 0, E = NumBuckets; I != E; ++I256 ) { | 294 | 256 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 256 | if (Bucket && Bucket != getTombstoneVal()38 ) { | 296 | 38 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 38 | } | 298 | 256 | } | 299 | 16 | } | 300 | 32.9k | free(TheTable); | 301 | 32.9k | } |
llvm::StringMap<llvm::TimeRecord, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 26.7k | ~StringMap() { | 289 | 26.7k | // Delete all the elements in the map, but don't reset the elements | 290 | 26.7k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 26.7k | // work not required in the destructor. | 292 | 26.7k | if (!empty()) { | 293 | 17 | for (unsigned I = 0, E = NumBuckets; I != E; ++I16 ) { | 294 | 16 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 16 | if (Bucket && Bucket != getTombstoneVal()1 ) { | 296 | 1 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 1 | } | 298 | 16 | } | 299 | 1 | } | 300 | 26.7k | free(TheTable); | 301 | 26.7k | } |
llvm::StringMap<clang::StringLiteral*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 33.1k | ~StringMap() { | 289 | 33.1k | // Delete all the elements in the map, but don't reset the elements | 290 | 33.1k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 33.1k | // work not required in the destructor. | 292 | 33.1k | if (!empty()) { | 293 | 181 | for (unsigned I = 0, E = NumBuckets; I != E; ++I176 ) { | 294 | 176 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 176 | if (Bucket && Bucket != getTombstoneVal()65 ) { | 296 | 65 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 65 | } | 298 | 176 | } | 299 | 5 | } | 300 | 33.1k | free(TheTable); | 301 | 33.1k | } |
llvm::StringMap<clang::ASTContext::SectionInfo, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 33.1k | ~StringMap() { | 289 | 33.1k | // Delete all the elements in the map, but don't reset the elements | 290 | 33.1k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 33.1k | // work not required in the destructor. | 292 | 33.1k | if (!empty()) { | 293 | 406 | for (unsigned I = 0, E = NumBuckets; I != E; ++I384 ) { | 294 | 384 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 384 | if (Bucket && Bucket != getTombstoneVal()74 ) { | 296 | 74 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 74 | } | 298 | 384 | } | 299 | 22 | } | 300 | 33.1k | free(TheTable); | 301 | 33.1k | } |
llvm::StringMap<clang::comments::TParamCommandComment*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 1.26k | ~StringMap() { | 289 | 1.26k | // Delete all the elements in the map, but don't reset the elements | 290 | 1.26k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 1.26k | // work not required in the destructor. | 292 | 1.26k | if (!empty()) { | 293 | 986 | for (unsigned I = 0, E = NumBuckets; I != E; ++I928 ) { | 294 | 928 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 928 | if (Bucket && Bucket != getTombstoneVal()90 ) { | 296 | 90 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 90 | } | 298 | 928 | } | 299 | 58 | } | 300 | 1.26k | free(TheTable); | 301 | 1.26k | } |
llvm::StringMap<clang::Module*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 34.0k | ~StringMap() { | 289 | 34.0k | // Delete all the elements in the map, but don't reset the elements | 290 | 34.0k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 34.0k | // work not required in the destructor. | 292 | 34.0k | if (!empty()) { | 293 | 192k | for (unsigned I = 0, E = NumBuckets; I != E; ++I190k ) { | 294 | 190k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 190k | if (Bucket && Bucket != getTombstoneVal()73.5k ) { | 296 | 73.5k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 73.5k | } | 298 | 190k | } | 299 | 2.64k | } | 300 | 34.0k | free(TheTable); | 301 | 34.0k | } |
llvm::StringMap<llvm::StringSet<llvm::MallocAllocator>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 34.0k | ~StringMap() { | 289 | 34.0k | // Delete all the elements in the map, but don't reset the elements | 290 | 34.0k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 34.0k | // work not required in the destructor. | 292 | 34.0k | if (!empty()) { | 293 | 221 | for (unsigned I = 0, E = NumBuckets; I != E; ++I208 ) { | 294 | 208 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 208 | if (Bucket && Bucket != getTombstoneVal()14 ) { | 296 | 14 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 14 | } | 298 | 208 | } | 299 | 13 | } | 300 | 34.0k | free(TheTable); | 301 | 34.0k | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 179k | ~StringMap() { | 289 | 179k | // Delete all the elements in the map, but don't reset the elements | 290 | 179k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 179k | // work not required in the destructor. | 292 | 179k | if (!empty()) { | 293 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 294 | 0 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 296 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 0 | } | 298 | 0 | } | 299 | 0 | } | 300 | 179k | free(TheTable); | 301 | 179k | } |
llvm::StringMap<std::__1::pair<llvm::Type*, llvm::SMLoc>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 40.1k | ~StringMap() { | 289 | 40.1k | // Delete all the elements in the map, but don't reset the elements | 290 | 40.1k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 40.1k | // work not required in the destructor. | 292 | 40.1k | if (!empty()) { | 293 | 66.1k | for (unsigned I = 0, E = NumBuckets; I != E; ++I62.7k ) { | 294 | 62.7k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 62.7k | if (Bucket && Bucket != getTombstoneVal()12.7k ) { | 296 | 12.7k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 12.7k | } | 298 | 62.7k | } | 299 | 3.40k | } | 300 | 40.1k | free(TheTable); | 301 | 40.1k | } |
llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 195 | ~StringMap() { | 289 | 195 | // Delete all the elements in the map, but don't reset the elements | 290 | 195 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 195 | // work not required in the destructor. | 292 | 195 | if (!empty()) { | 293 | 3.17k | for (unsigned I = 0, E = NumBuckets; I != E; ++I2.99k ) { | 294 | 2.99k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 2.99k | if (Bucket && Bucket != getTombstoneVal()332 ) { | 296 | 332 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 332 | } | 298 | 2.99k | } | 299 | 187 | } | 300 | 195 | free(TheTable); | 301 | 195 | } |
llvm::StringMap<llvm::RecordStreamer::State, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 76 | ~StringMap() { | 289 | 76 | // Delete all the elements in the map, but don't reset the elements | 290 | 76 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 76 | // work not required in the destructor. | 292 | 76 | if (!empty()) { | 293 | 1.13k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.07k ) { | 294 | 1.07k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.07k | if (Bucket && Bucket != getTombstoneVal()264 ) { | 296 | 264 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 264 | } | 298 | 1.07k | } | 299 | 67 | } | 300 | 76 | free(TheTable); | 301 | 76 | } |
llvm::StringMap<llvm::GlobalValue const*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 164 | ~StringMap() { | 289 | 164 | // Delete all the elements in the map, but don't reset the elements | 290 | 164 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 164 | // work not required in the destructor. | 292 | 164 | if (!empty()) { | 293 | 1.25k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.18k ) { | 294 | 1.18k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.18k | if (Bucket && Bucket != getTombstoneVal()255 ) { | 296 | 255 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 255 | } | 298 | 1.18k | } | 299 | 74 | } | 300 | 164 | free(TheTable); | 301 | 164 | } |
llvm::StringMap<llvm::VRegInfo*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 11.2k | ~StringMap() { | 289 | 11.2k | // Delete all the elements in the map, but don't reset the elements | 290 | 11.2k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 11.2k | // work not required in the destructor. | 292 | 11.2k | if (!empty()) { | 293 | 68 | for (unsigned I = 0, E = NumBuckets; I != E; ++I64 ) { | 294 | 64 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 64 | if (Bucket && Bucket != getTombstoneVal()14 ) { | 296 | 14 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 14 | } | 298 | 64 | } | 299 | 4 | } | 300 | 11.2k | free(TheTable); | 301 | 11.2k | } |
llvm::StringMap<llvm::RegisterBank const*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 2.15k | ~StringMap() { | 289 | 2.15k | // Delete all the elements in the map, but don't reset the elements | 290 | 2.15k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 2.15k | // work not required in the destructor. | 292 | 2.15k | if (!empty()) { | 293 | 33.8k | for (unsigned I = 0, E = NumBuckets; I != E; ++I31.8k ) { | 294 | 31.8k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 31.8k | if (Bucket && Bucket != getTombstoneVal()5.92k ) { | 296 | 5.92k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 5.92k | } | 298 | 31.8k | } | 299 | 1.99k | } | 300 | 2.15k | free(TheTable); | 301 | 2.15k | } |
llvm::StringMap<llvm::TargetRegisterClass const*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 2.15k | ~StringMap() { | 289 | 2.15k | // Delete all the elements in the map, but don't reset the elements | 290 | 2.15k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 2.15k | // work not required in the destructor. | 292 | 2.15k | if (!empty()) { | 293 | 499k | for (unsigned I = 0, E = NumBuckets; I != E; ++I497k ) { | 294 | 497k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 497k | if (Bucket && Bucket != getTombstoneVal()225k ) { | 296 | 225k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 225k | } | 298 | 497k | } | 299 | 2.15k | } | 300 | 2.15k | free(TheTable); | 301 | 2.15k | } |
llvm::StringMap<llvm::MachineMemOperand::Flags, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 2.15k | ~StringMap() { | 289 | 2.15k | // Delete all the elements in the map, but don't reset the elements | 290 | 2.15k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 2.15k | // work not required in the destructor. | 292 | 2.15k | if (!empty()) { | 293 | 51 | for (unsigned I = 0, E = NumBuckets; I != E; ++I48 ) { | 294 | 48 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 48 | if (Bucket && Bucket != getTombstoneVal()6 ) { | 296 | 6 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 6 | } | 298 | 48 | } | 299 | 3 | } | 300 | 2.15k | free(TheTable); | 301 | 2.15k | } |
llvm::StringMap<unsigned int const*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 2.15k | ~StringMap() { | 289 | 2.15k | // Delete all the elements in the map, but don't reset the elements | 290 | 2.15k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 2.15k | // work not required in the destructor. | 292 | 2.15k | if (!empty()) { | 293 | 12.7k | for (unsigned I = 0, E = NumBuckets; I != E; ++I12.3k ) { | 294 | 12.3k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 12.3k | if (Bucket && Bucket != getTombstoneVal()6.84k ) { | 296 | 6.84k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 6.84k | } | 298 | 12.3k | } | 299 | 370 | } | 300 | 2.15k | free(TheTable); | 301 | 2.15k | } |
llvm::StringMap<llvm::Type*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 2.16k | ~StringMap() { | 289 | 2.16k | // Delete all the elements in the map, but don't reset the elements | 290 | 2.16k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 2.16k | // work not required in the destructor. | 292 | 2.16k | if (!empty()) { | 293 | 612 | for (unsigned I = 0, E = NumBuckets; I != E; ++I576 ) { | 294 | 576 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 576 | if (Bucket && Bucket != getTombstoneVal()91 ) { | 296 | 91 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 91 | } | 298 | 576 | } | 299 | 36 | } | 300 | 2.16k | free(TheTable); | 301 | 2.16k | } |
llvm::StringMap<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 22 | ~StringMap() { | 289 | 22 | // Delete all the elements in the map, but don't reset the elements | 290 | 22 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 22 | // work not required in the destructor. | 292 | 22 | if (!empty()) { | 293 | 323 | for (unsigned I = 0, E = NumBuckets; I != E; ++I304 ) { | 294 | 304 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 304 | if (Bucket && Bucket != getTombstoneVal()43 ) { | 296 | 43 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 43 | } | 298 | 304 | } | 299 | 19 | } | 300 | 22 | free(TheTable); | 301 | 22 | } |
llvm::StringMap<llvm::TinyPtrVector<lld::elf::OutputSection*>, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 2.75k | ~StringMap() { | 289 | 2.75k | // Delete all the elements in the map, but don't reset the elements | 290 | 2.75k | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 2.75k | // work not required in the destructor. | 292 | 2.75k | if (!empty()) { | 293 | 748k | for (unsigned I = 0, E = NumBuckets; I != E; ++I746k ) { | 294 | 746k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 746k | if (Bucket && Bucket != getTombstoneVal()377k ) { | 296 | 377k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 377k | } | 298 | 746k | } | 299 | 2.75k | } | 300 | 2.75k | free(TheTable); | 301 | 2.75k | } |
llvm::StringMap<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 193 | ~StringMap() { | 289 | 193 | // Delete all the elements in the map, but don't reset the elements | 290 | 193 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 193 | // work not required in the destructor. | 292 | 193 | if (!empty()) { | 293 | 85 | for (unsigned I = 0, E = NumBuckets; I != E; ++I80 ) { | 294 | 80 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 80 | if (Bucket && Bucket != getTombstoneVal()22 ) { | 296 | 22 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 22 | } | 298 | 80 | } | 299 | 5 | } | 300 | 193 | free(TheTable); | 301 | 193 | } |
llvm::StringMap<lld::Atom const*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 635 | ~StringMap() { | 289 | 635 | // Delete all the elements in the map, but don't reset the elements | 290 | 635 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 635 | // work not required in the destructor. | 292 | 635 | if (!empty()) { | 293 | 2.32k | for (unsigned I = 0, E = NumBuckets; I != E; ++I2.19k ) { | 294 | 2.19k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 2.19k | if (Bucket && Bucket != getTombstoneVal()396 ) { | 296 | 396 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 396 | } | 298 | 2.19k | } | 299 | 137 | } | 300 | 635 | free(TheTable); | 301 | 635 | } |
llvm::StringMap<lld::mach_o::MachODylibFile*, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 244 | ~StringMap() { | 289 | 244 | // Delete all the elements in the map, but don't reset the elements | 290 | 244 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 244 | // work not required in the destructor. | 292 | 244 | if (!empty()) { | 293 | 1.78k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.68k ) { | 294 | 1.68k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.68k | if (Bucket && Bucket != getTombstoneVal()233 ) { | 296 | 233 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 233 | } | 298 | 1.68k | } | 299 | 105 | } | 300 | 244 | free(TheTable); | 301 | 244 | } |
llvm::StringMap<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> >, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 244 | ~StringMap() { | 289 | 244 | // Delete all the elements in the map, but don't reset the elements | 290 | 244 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 244 | // work not required in the destructor. | 292 | 244 | if (!empty()) { | 293 | 17 | for (unsigned I = 0, E = NumBuckets; I != E; ++I16 ) { | 294 | 16 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 16 | if (Bucket && Bucket != getTombstoneVal()5 ) { | 296 | 5 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 5 | } | 298 | 16 | } | 299 | 1 | } | 300 | 244 | free(TheTable); | 301 | 244 | } |
MachONormalizedFileFromAtoms.cpp:llvm::StringMap<(anonymous namespace)::Util::DylibInfo, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 169 | ~StringMap() { | 289 | 169 | // Delete all the elements in the map, but don't reset the elements | 290 | 169 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 169 | // work not required in the destructor. | 292 | 169 | if (!empty()) { | 293 | 1.70k | for (unsigned I = 0, E = NumBuckets; I != E; ++I1.60k ) { | 294 | 1.60k | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 1.60k | if (Bucket && Bucket != getTombstoneVal()114 ) { | 296 | 114 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 114 | } | 298 | 1.60k | } | 299 | 100 | } | 300 | 169 | free(TheTable); | 301 | 169 | } |
llvm::StringMap<llvm::FileInfo::LineData, llvm::MallocAllocator>::~StringMap() Line | Count | Source | 288 | 28 | ~StringMap() { | 289 | 28 | // Delete all the elements in the map, but don't reset the elements | 290 | 28 | // to default values. This is a copy of clear(), but avoids unnecessary | 291 | 28 | // work not required in the destructor. | 292 | 28 | if (!empty()) { | 293 | 476 | for (unsigned I = 0, E = NumBuckets; I != E; ++I448 ) { | 294 | 448 | StringMapEntryBase *Bucket = TheTable[I]; | 295 | 448 | if (Bucket && Bucket != getTombstoneVal()46 ) { | 296 | 46 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 297 | 46 | } | 298 | 448 | } | 299 | 28 | } | 300 | 28 | free(TheTable); | 301 | 28 | } |
|
302 | | |
303 | 160M | AllocatorTy &getAllocator() { return Allocator; } llvm::StringMap<llvm::StructType*, llvm::MallocAllocator>::getAllocator() Line | Count | Source | 303 | 90 | AllocatorTy &getAllocator() { return Allocator; } |
llvm::StringMap<clang::IdentifierInfo*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::getAllocator() Line | Count | Source | 303 | 160M | AllocatorTy &getAllocator() { return Allocator; } |
llvm::StringMap<clang::HeaderSearch::LookupFileCacheInfo, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::getAllocator() Line | Count | Source | 303 | 18 | AllocatorTy &getAllocator() { return Allocator; } |
|
304 | 5 | const AllocatorTy &getAllocator() const { return Allocator; } llvm::StringMap<clang::IdentifierInfo*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::getAllocator() const Line | Count | Source | 304 | 3 | const AllocatorTy &getAllocator() const { return Allocator; } |
llvm::StringMap<clang::HeaderSearch::LookupFileCacheInfo, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::getAllocator() const Line | Count | Source | 304 | 1 | const AllocatorTy &getAllocator() const { return Allocator; } |
llvm::StringMap<clang::FrameworkCacheEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::getAllocator() const Line | Count | Source | 304 | 1 | const AllocatorTy &getAllocator() const { return Allocator; } |
|
305 | | |
306 | | using key_type = const char*; |
307 | | using mapped_type = ValueTy; |
308 | | using value_type = StringMapEntry<ValueTy>; |
309 | | using size_type = size_t; |
310 | | |
311 | | using const_iterator = StringMapConstIterator<ValueTy>; |
312 | | using iterator = StringMapIterator<ValueTy>; |
313 | | |
314 | 1.01M | iterator begin() { |
315 | 1.01M | return iterator(TheTable, NumBuckets == 0); |
316 | 1.01M | } llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 33.9k | iterator begin() { | 315 | 33.9k | return iterator(TheTable, NumBuckets == 0); | 316 | 33.9k | } |
llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 138 | iterator begin() { | 315 | 138 | return iterator(TheTable, NumBuckets == 0); | 316 | 138 | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 12.6k | iterator begin() { | 315 | 12.6k | return iterator(TheTable, NumBuckets == 0); | 316 | 12.6k | } |
llvm::StringMap<llvm::ConstantDataSequential*, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 94.3k | iterator begin() { | 315 | 94.3k | return iterator(TheTable, NumBuckets == 0); | 316 | 94.3k | } |
llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 308 | iterator begin() { | 315 | 308 | return iterator(TheTable, NumBuckets == 0); | 316 | 308 | } |
llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 273 | iterator begin() { | 315 | 273 | return iterator(TheTable, NumBuckets == 0); | 316 | 273 | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 4.43k | iterator begin() { | 315 | 4.43k | return iterator(TheTable, NumBuckets == 0); | 316 | 4.43k | } |
GCOVProfiling.cpp:llvm::StringMap<(anonymous namespace)::GCOVLines, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 90 | iterator begin() { | 315 | 90 | return iterator(TheTable, NumBuckets == 0); | 316 | 90 | } |
llvm::StringMap<char, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 111k | iterator begin() { | 315 | 111k | return iterator(TheTable, NumBuckets == 0); | 316 | 111k | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 253k | iterator begin() { | 315 | 253k | return iterator(TheTable, NumBuckets == 0); | 316 | 253k | } |
llvm::StringMap<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > >, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 1 | iterator begin() { | 315 | 1 | return iterator(TheTable, NumBuckets == 0); | 316 | 1 | } |
llvm::StringMap<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> >, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 14 | iterator begin() { | 315 | 14 | return iterator(TheTable, NumBuckets == 0); | 316 | 14 | } |
llvm::StringMap<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> >, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 62.8k | iterator begin() { | 315 | 62.8k | return iterator(TheTable, NumBuckets == 0); | 316 | 62.8k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> >, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 4 | iterator begin() { | 315 | 4 | return iterator(TheTable, NumBuckets == 0); | 316 | 4 | } |
llvm::StringMap<bool, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 75.7k | iterator begin() { | 315 | 75.7k | return iterator(TheTable, NumBuckets == 0); | 316 | 75.7k | } |
llvm::StringMap<llvm::Constant*, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 47 | iterator begin() { | 315 | 47 | return iterator(TheTable, NumBuckets == 0); | 316 | 47 | } |
llvm::StringMap<llvm::WeakTrackingVH, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 3.46k | iterator begin() { | 315 | 3.46k | return iterator(TheTable, NumBuckets == 0); | 316 | 3.46k | } |
llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 1.44k | iterator begin() { | 315 | 1.44k | return iterator(TheTable, NumBuckets == 0); | 316 | 1.44k | } |
llvm::StringMap<llvm::TrackingVH<llvm::Constant>, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 17.4k | iterator begin() { | 315 | 17.4k | return iterator(TheTable, NumBuckets == 0); | 316 | 17.4k | } |
Unexecuted instantiation: llvm::StringMap<clang::LayoutOverrideSource::Layout, llvm::MallocAllocator>::begin() llvm::StringMap<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 12.0k | iterator begin() { | 315 | 12.0k | return iterator(TheTable, NumBuckets == 0); | 316 | 12.0k | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMap<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u>, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 12.0k | iterator begin() { | 315 | 12.0k | return iterator(TheTable, NumBuckets == 0); | 316 | 12.0k | } |
llvm::StringMap<llvm::SmallVector<unsigned int, 2u>, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 621 | iterator begin() { | 315 | 621 | return iterator(TheTable, NumBuckets == 0); | 316 | 621 | } |
llvm::StringMap<llvm::AccelTableBase::HashData, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::begin() Line | Count | Source | 314 | 32.0k | iterator begin() { | 315 | 32.0k | return iterator(TheTable, NumBuckets == 0); | 316 | 32.0k | } |
llvm::StringMap<llvm::DwarfStringPoolEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::begin() Line | Count | Source | 314 | 2.55k | iterator begin() { | 315 | 2.55k | return iterator(TheTable, NumBuckets == 0); | 316 | 2.55k | } |
llvm::StringMap<llvm::lto::LTO::GlobalResolution, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 1.10k | iterator begin() { | 315 | 1.10k | return iterator(TheTable, NumBuckets == 0); | 316 | 1.10k | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 1.10k | iterator begin() { | 315 | 1.10k | return iterator(TheTable, NumBuckets == 0); | 316 | 1.10k | } |
llvm::StringMap<clang::ento::BugType*, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 6.39k | iterator begin() { | 315 | 6.39k | return iterator(TheTable, NumBuckets == 0); | 316 | 6.39k | } |
llvm::StringMap<llvm::SmallVector<clang::TypoCorrection, 1u>, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 18.0k | iterator begin() { | 315 | 18.0k | return iterator(TheTable, NumBuckets == 0); | 316 | 18.0k | } |
llvm::StringMap<clang::Module*, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 34.0k | iterator begin() { | 315 | 34.0k | return iterator(TheTable, NumBuckets == 0); | 316 | 34.0k | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 179k | iterator begin() { | 315 | 179k | return iterator(TheTable, NumBuckets == 0); | 316 | 179k | } |
llvm::StringMap<std::__1::pair<llvm::Type*, llvm::SMLoc>, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 38.8k | iterator begin() { | 315 | 38.8k | return iterator(TheTable, NumBuckets == 0); | 316 | 38.8k | } |
llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 570 | iterator begin() { | 315 | 570 | return iterator(TheTable, NumBuckets == 0); | 316 | 570 | } |
llvm::StringMap<llvm::RecordStreamer::State, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 74 | iterator begin() { | 315 | 74 | return iterator(TheTable, NumBuckets == 0); | 316 | 74 | } |
llvm::StringMap<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> >, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 17 | iterator begin() { | 315 | 17 | return iterator(TheTable, NumBuckets == 0); | 316 | 17 | } |
llvm::StringMap<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> >, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 172 | iterator begin() { | 315 | 172 | return iterator(TheTable, NumBuckets == 0); | 316 | 172 | } |
llvm::StringMap<llvm::FileInfo::LineData, llvm::MallocAllocator>::begin() Line | Count | Source | 314 | 28 | iterator begin() { | 315 | 28 | return iterator(TheTable, NumBuckets == 0); | 316 | 28 | } |
|
317 | 13.6M | iterator end() { |
318 | 13.6M | return iterator(TheTable+NumBuckets, true); |
319 | 13.6M | } llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 33.9k | iterator end() { | 318 | 33.9k | return iterator(TheTable+NumBuckets, true); | 319 | 33.9k | } |
llvm::StringMap<llvm::MCAsmMacro, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 3.28M | iterator end() { | 318 | 3.28M | return iterator(TheTable+NumBuckets, true); | 319 | 3.28M | } |
AArch64AsmParser.cpp:llvm::StringMap<std::__1::pair<(anonymous namespace)::RegKind, unsigned int>, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 23.7k | iterator end() { | 318 | 23.7k | return iterator(TheTable+NumBuckets, true); | 319 | 23.7k | } |
llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 138 | iterator end() { | 318 | 138 | return iterator(TheTable+NumBuckets, true); | 319 | 138 | } |
llvm::StringMap<char, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 113k | iterator end() { | 318 | 113k | return iterator(TheTable+NumBuckets, true); | 319 | 113k | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 212k | iterator end() { | 318 | 212k | return iterator(TheTable+NumBuckets, true); | 319 | 212k | } |
llvm::StringMap<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 259 | iterator end() { | 318 | 259 | return iterator(TheTable+NumBuckets, true); | 319 | 259 | } |
llvm::StringMap<llvm::AsmToken, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 1.43k | iterator end() { | 318 | 1.43k | return iterator(TheTable+NumBuckets, true); | 319 | 1.43k | } |
llvm::StringMap<llvm::Function*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 52 | iterator end() { | 318 | 52 | return iterator(TheTable+NumBuckets, true); | 319 | 52 | } |
Unexecuted instantiation: llvm::StringMap<llvm::RTLIB::Libcall, llvm::MallocAllocator>::end() llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 589 | iterator end() { | 318 | 589 | return iterator(TheTable+NumBuckets, true); | 319 | 589 | } |
Unexecuted instantiation: llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::end() llvm::StringMap<llvm::GCStrategy*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 107 | iterator end() { | 318 | 107 | return iterator(TheTable+NumBuckets, true); | 319 | 107 | } |
llvm::StringMap<llvm::ConstantDataSequential*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 94.3k | iterator end() { | 318 | 94.3k | return iterator(TheTable+NumBuckets, true); | 319 | 94.3k | } |
llvm::StringMap<std::__1::pair<unsigned int, unsigned int>, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 22 | iterator end() { | 318 | 22 | return iterator(TheTable+NumBuckets, true); | 319 | 22 | } |
llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 1.43k | iterator end() { | 318 | 1.43k | return iterator(TheTable+NumBuckets, true); | 319 | 1.43k | } |
llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 1.17k | iterator end() { | 318 | 1.17k | return iterator(TheTable+NumBuckets, true); | 319 | 1.17k | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 711k | iterator end() { | 318 | 711k | return iterator(TheTable+NumBuckets, true); | 319 | 711k | } |
llvm::StringMap<bool, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 473k | iterator end() { | 318 | 473k | return iterator(TheTable+NumBuckets, true); | 319 | 473k | } |
GCOVProfiling.cpp:llvm::StringMap<(anonymous namespace)::GCOVLines, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 90 | iterator end() { | 318 | 90 | return iterator(TheTable+NumBuckets, true); | 319 | 90 | } |
AsmParser.cpp:llvm::StringMap<(anonymous namespace)::AsmParser::DirectiveKind, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 3.30M | iterator end() { | 318 | 3.30M | return iterator(TheTable+NumBuckets, true); | 319 | 3.30M | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 910k | iterator end() { | 318 | 910k | return iterator(TheTable+NumBuckets, true); | 319 | 910k | } |
llvm::StringMap<unsigned long, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 3.71k | iterator end() { | 318 | 3.71k | return iterator(TheTable+NumBuckets, true); | 319 | 3.71k | } |
llvm::StringMap<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 1 | iterator end() { | 318 | 1 | return iterator(TheTable+NumBuckets, true); | 319 | 1 | } |
llvm::StringMap<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 14 | iterator end() { | 318 | 14 | return iterator(TheTable+NumBuckets, true); | 319 | 14 | } |
llvm::StringMap<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 1.89M | iterator end() { | 318 | 1.89M | return iterator(TheTable+NumBuckets, true); | 319 | 1.89M | } |
llvm::StringMap<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 62.8k | iterator end() { | 318 | 62.8k | return iterator(TheTable+NumBuckets, true); | 319 | 62.8k | } |
llvm::StringMap<void*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 2 | iterator end() { | 318 | 2 | return iterator(TheTable+NumBuckets, true); | 319 | 2 | } |
llvm::StringMap<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 4 | iterator end() { | 318 | 4 | return iterator(TheTable+NumBuckets, true); | 319 | 4 | } |
llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 4.06k | iterator end() { | 318 | 4.06k | return iterator(TheTable+NumBuckets, true); | 319 | 4.06k | } |
llvm::StringMap<clang::DirectoryEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::end() Line | Count | Source | 317 | 564 | iterator end() { | 318 | 564 | return iterator(TheTable+NumBuckets, true); | 319 | 564 | } |
llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::end() Line | Count | Source | 317 | 1.17k | iterator end() { | 318 | 1.17k | return iterator(TheTable+NumBuckets, true); | 319 | 1.17k | } |
llvm::StringMap<llvm::Constant*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 74 | iterator end() { | 318 | 74 | return iterator(TheTable+NumBuckets, true); | 319 | 74 | } |
llvm::StringMap<llvm::WeakTrackingVH, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 3.46k | iterator end() { | 318 | 3.46k | return iterator(TheTable+NumBuckets, true); | 319 | 3.46k | } |
llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 1.44k | iterator end() { | 318 | 1.44k | return iterator(TheTable+NumBuckets, true); | 319 | 1.44k | } |
llvm::StringMap<llvm::TrackingVH<llvm::Constant>, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 17.4k | iterator end() { | 318 | 17.4k | return iterator(TheTable+NumBuckets, true); | 319 | 17.4k | } |
llvm::StringMap<clang::GlobalDecl, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::end() Line | Count | Source | 317 | 18 | iterator end() { | 318 | 18 | return iterator(TheTable+NumBuckets, true); | 319 | 18 | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::end() Line | Count | Source | 317 | 10 | iterator end() { | 318 | 10 | return iterator(TheTable+NumBuckets, true); | 319 | 10 | } |
llvm::StringMap<char const*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 211 | iterator end() { | 318 | 211 | return iterator(TheTable+NumBuckets, true); | 319 | 211 | } |
llvm::StringMap<int, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 1.08M | iterator end() { | 318 | 1.08M | return iterator(TheTable+NumBuckets, true); | 319 | 1.08M | } |
llvm::StringMap<clang::SourceLocation, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 80 | iterator end() { | 318 | 80 | return iterator(TheTable+NumBuckets, true); | 319 | 80 | } |
llvm::StringMap<clang::LayoutOverrideSource::Layout, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 44 | iterator end() { | 318 | 44 | return iterator(TheTable+NumBuckets, true); | 319 | 44 | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 2.07k | iterator end() { | 318 | 2.07k | return iterator(TheTable+NumBuckets, true); | 319 | 2.07k | } |
llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 918 | iterator end() { | 318 | 918 | return iterator(TheTable+NumBuckets, true); | 319 | 918 | } |
llvm::StringMap<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 12.0k | iterator end() { | 318 | 12.0k | return iterator(TheTable+NumBuckets, true); | 319 | 12.0k | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMap<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u>, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 13.7k | iterator end() { | 318 | 13.7k | return iterator(TheTable+NumBuckets, true); | 319 | 13.7k | } |
llvm::StringMap<std::__1::pair<llvm::StringRef, bool>, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 1.95k | iterator end() { | 318 | 1.95k | return iterator(TheTable+NumBuckets, true); | 319 | 1.95k | } |
llvm::StringMap<std::__1::shared_ptr<clang::ModuleFileExtension>, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 76 | iterator end() { | 318 | 76 | return iterator(TheTable+NumBuckets, true); | 319 | 76 | } |
llvm::StringMap<llvm::SmallVector<unsigned int, 2u>, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 621 | iterator end() { | 318 | 621 | return iterator(TheTable+NumBuckets, true); | 319 | 621 | } |
Unexecuted instantiation: llvm::StringMap<clang::InMemoryModuleCache::PCM, llvm::MallocAllocator>::end() llvm::StringMap<unsigned int const*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 3.24k | iterator end() { | 318 | 3.24k | return iterator(TheTable+NumBuckets, true); | 319 | 3.24k | } |
llvm::StringMap<llvm::MachineMemOperand::Flags, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 25 | iterator end() { | 318 | 25 | return iterator(TheTable+NumBuckets, true); | 319 | 25 | } |
llvm::StringMap<llvm::TargetRegisterClass const*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 70.0k | iterator end() { | 318 | 70.0k | return iterator(TheTable+NumBuckets, true); | 319 | 70.0k | } |
llvm::StringMap<llvm::RegisterBank const*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 13.0k | iterator end() { | 318 | 13.0k | return iterator(TheTable+NumBuckets, true); | 319 | 13.0k | } |
llvm::StringMap<llvm::AccelTableBase::HashData, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::end() Line | Count | Source | 317 | 32.0k | iterator end() { | 318 | 32.0k | return iterator(TheTable+NumBuckets, true); | 319 | 32.0k | } |
llvm::StringMap<llvm::DwarfStringPoolEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::end() Line | Count | Source | 317 | 2.55k | iterator end() { | 318 | 2.55k | return iterator(TheTable+NumBuckets, true); | 319 | 2.55k | } |
llvm::StringMap<unsigned short, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 95 | iterator end() { | 318 | 95 | return iterator(TheTable+NumBuckets, true); | 319 | 95 | } |
llvm::StringMap<llvm::SDNode*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 14.8k | iterator end() { | 318 | 14.8k | return iterator(TheTable+NumBuckets, true); | 319 | 14.8k | } |
llvm::StringMap<llvm::lto::LTO::GlobalResolution, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 1.10k | iterator end() { | 318 | 1.10k | return iterator(TheTable+NumBuckets, true); | 319 | 1.10k | } |
StdLibraryFunctionsChecker.cpp:llvm::StringMap<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 2.22k | iterator end() { | 318 | 2.22k | return iterator(TheTable+NumBuckets, true); | 319 | 2.22k | } |
llvm::StringMap<clang::ento::BugType*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 6.39k | iterator end() { | 318 | 6.39k | return iterator(TheTable+NumBuckets, true); | 319 | 6.39k | } |
llvm::StringMap<clang::ASTUnit*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 126 | iterator end() { | 318 | 126 | return iterator(TheTable+NumBuckets, true); | 319 | 126 | } |
llvm::StringMap<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 65 | iterator end() { | 318 | 65 | return iterator(TheTable+NumBuckets, true); | 319 | 65 | } |
llvm::StringMap<clang::ASTContext::SectionInfo, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 6.13k | iterator end() { | 318 | 6.13k | return iterator(TheTable+NumBuckets, true); | 319 | 6.13k | } |
llvm::StringMap<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 6 | iterator end() { | 318 | 6 | return iterator(TheTable+NumBuckets, true); | 319 | 6 | } |
llvm::StringMap<llvm::StringSet<llvm::MallocAllocator>, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 5.11k | iterator end() { | 318 | 5.11k | return iterator(TheTable+NumBuckets, true); | 319 | 5.11k | } |
llvm::StringMap<clang::Module*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 34.0k | iterator end() { | 318 | 34.0k | return iterator(TheTable+NumBuckets, true); | 319 | 34.0k | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 1.18M | iterator end() { | 318 | 1.18M | return iterator(TheTable+NumBuckets, true); | 319 | 1.18M | } |
llvm::StringMap<std::__1::pair<llvm::Type*, llvm::SMLoc>, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 38.8k | iterator end() { | 318 | 38.8k | return iterator(TheTable+NumBuckets, true); | 319 | 38.8k | } |
llvm::StringMap<llvm::RecordStreamer::State, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 172 | iterator end() { | 318 | 172 | return iterator(TheTable+NumBuckets, true); | 319 | 172 | } |
llvm::StringMap<llvm::GlobalValue const*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 27 | iterator end() { | 318 | 27 | return iterator(TheTable+NumBuckets, true); | 319 | 27 | } |
llvm::StringMap<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 17 | iterator end() { | 318 | 17 | return iterator(TheTable+NumBuckets, true); | 319 | 17 | } |
llvm::StringMap<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> >, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 172 | iterator end() { | 318 | 172 | return iterator(TheTable+NumBuckets, true); | 319 | 172 | } |
llvm::StringMap<lld::Atom const*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 645 | iterator end() { | 318 | 645 | return iterator(TheTable+NumBuckets, true); | 319 | 645 | } |
llvm::StringMap<lld::mach_o::MachODylibFile*, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 223 | iterator end() { | 318 | 223 | return iterator(TheTable+NumBuckets, true); | 319 | 223 | } |
MachONormalizedFileFromAtoms.cpp:llvm::StringMap<(anonymous namespace)::Util::DylibInfo, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 223 | iterator end() { | 318 | 223 | return iterator(TheTable+NumBuckets, true); | 319 | 223 | } |
llvm::StringMap<llvm::FileInfo::LineData, llvm::MallocAllocator>::end() Line | Count | Source | 317 | 28 | iterator end() { | 318 | 28 | return iterator(TheTable+NumBuckets, true); | 319 | 28 | } |
|
320 | 3.17M | const_iterator begin() const { |
321 | 3.17M | return const_iterator(TheTable, NumBuckets == 0); |
322 | 3.17M | } llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 546 | const_iterator begin() const { | 321 | 546 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 546 | } |
llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 14.5k | const_iterator begin() const { | 321 | 14.5k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 14.5k | } |
llvm::StringMap<llvm::MCSymbol*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::begin() const Line | Count | Source | 320 | 1.62k | const_iterator begin() const { | 321 | 1.62k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 1.62k | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 761 | const_iterator begin() const { | 321 | 761 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 761 | } |
llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 362 | const_iterator begin() const { | 321 | 362 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 362 | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 5.81k | const_iterator begin() const { | 321 | 5.81k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 5.81k | } |
llvm::StringMap<unsigned char, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 5.11k | const_iterator begin() const { | 321 | 5.11k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 5.11k | } |
llvm::StringMap<std::__1::pair<unsigned int, unsigned int>, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 6 | const_iterator begin() const { | 321 | 6 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 6 | } |
llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 110k | const_iterator begin() const { | 321 | 110k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 110k | } |
llvm::StringMap<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> >, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 278 | const_iterator begin() const { | 321 | 278 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 278 | } |
llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 693 | const_iterator begin() const { | 321 | 693 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 693 | } |
llvm::StringMap<char, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 2.99M | const_iterator begin() const { | 321 | 2.99M | return const_iterator(TheTable, NumBuckets == 0); | 322 | 2.99M | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 15 | const_iterator begin() const { | 321 | 15 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 15 | } |
Unexecuted instantiation: llvm::StringMap<llvm::TimeRecord, llvm::MallocAllocator>::begin() const llvm::StringMap<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 9 | const_iterator begin() const { | 321 | 9 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 9 | } |
llvm::StringMap<clang::IdentifierInfo*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::begin() const Line | Count | Source | 320 | 17.0k | const_iterator begin() const { | 321 | 17.0k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 17.0k | } |
llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::begin() const Line | Count | Source | 320 | 3.61k | const_iterator begin() const { | 321 | 3.61k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 3.61k | } |
Unexecuted instantiation: llvm::StringMap<llvm::vfs::Status, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::begin() const llvm::StringMap<clang::Module*, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 135 | const_iterator begin() const { | 321 | 135 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 135 | } |
llvm::StringMap<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> >, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 1.43k | const_iterator begin() const { | 321 | 1.43k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 1.43k | } |
llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 245 | const_iterator begin() const { | 321 | 245 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 245 | } |
llvm::StringMap<llvm::DIE const*, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 3.48k | const_iterator begin() const { | 321 | 3.48k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 3.48k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> >, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 19 | const_iterator begin() const { | 321 | 19 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 19 | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 672 | const_iterator begin() const { | 321 | 672 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 672 | } |
llvm::StringMap<llvm::Type*, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 2.17k | const_iterator begin() const { | 321 | 2.17k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 2.17k | } |
llvm::StringMap<unsigned int, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::begin() const Line | Count | Source | 320 | 2 | const_iterator begin() const { | 321 | 2 | return const_iterator(TheTable, NumBuckets == 0); | 322 | 2 | } |
llvm::StringMap<llvm::VRegInfo*, llvm::MallocAllocator>::begin() const Line | Count | Source | 320 | 11.1k | const_iterator begin() const { | 321 | 11.1k | return const_iterator(TheTable, NumBuckets == 0); | 322 | 11.1k | } |
|
323 | 182M | const_iterator end() const { |
324 | 182M | return const_iterator(TheTable+NumBuckets, true); |
325 | 182M | } llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 2.76k | const_iterator end() const { | 324 | 2.76k | return const_iterator(TheTable+NumBuckets, true); | 325 | 2.76k | } |
llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 149M | const_iterator end() const { | 324 | 149M | return const_iterator(TheTable+NumBuckets, true); | 325 | 149M | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 187k | const_iterator end() const { | 324 | 187k | return const_iterator(TheTable+NumBuckets, true); | 325 | 187k | } |
llvm::StringMap<int, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 874 | const_iterator end() const { | 324 | 874 | return const_iterator(TheTable+NumBuckets, true); | 325 | 874 | } |
llvm::StringMap<llvm::MCSymbol*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::end() const Line | Count | Source | 323 | 4.92k | const_iterator end() const { | 324 | 4.92k | return const_iterator(TheTable+NumBuckets, true); | 325 | 4.92k | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 574k | const_iterator end() const { | 324 | 574k | return const_iterator(TheTable+NumBuckets, true); | 325 | 574k | } |
llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 1.96k | const_iterator end() const { | 324 | 1.96k | return const_iterator(TheTable+NumBuckets, true); | 325 | 1.96k | } |
llvm::StringMap<unsigned char, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 5.11k | const_iterator end() const { | 324 | 5.11k | return const_iterator(TheTable+NumBuckets, true); | 325 | 5.11k | } |
llvm::StringMap<std::__1::pair<unsigned int, unsigned int>, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 6 | const_iterator end() const { | 324 | 6 | return const_iterator(TheTable+NumBuckets, true); | 325 | 6 | } |
llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 21.2M | const_iterator end() const { | 324 | 21.2M | return const_iterator(TheTable+NumBuckets, true); | 325 | 21.2M | } |
llvm::StringMap<llvm::PassInfo const*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 2.32k | const_iterator end() const { | 324 | 2.32k | return const_iterator(TheTable+NumBuckets, true); | 325 | 2.32k | } |
llvm::StringMap<llvm::StructType*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 176 | const_iterator end() const { | 324 | 176 | return const_iterator(TheTable+NumBuckets, true); | 325 | 176 | } |
llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 110k | const_iterator end() const { | 324 | 110k | return const_iterator(TheTable+NumBuckets, true); | 325 | 110k | } |
llvm::StringMap<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> >, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 887 | const_iterator end() const { | 324 | 887 | return const_iterator(TheTable+NumBuckets, true); | 325 | 887 | } |
llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 1.37k | const_iterator end() const { | 324 | 1.37k | return const_iterator(TheTable+NumBuckets, true); | 325 | 1.37k | } |
llvm::StringMap<char, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 7.07M | const_iterator end() const { | 324 | 7.07M | return const_iterator(TheTable+NumBuckets, true); | 325 | 7.07M | } |
llvm::StringMap<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)>, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 1.24M | const_iterator end() const { | 324 | 1.24M | return const_iterator(TheTable+NumBuckets, true); | 325 | 1.24M | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 25.8k | const_iterator end() const { | 324 | 25.8k | return const_iterator(TheTable+NumBuckets, true); | 325 | 25.8k | } |
llvm::StringMap<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 2.61k | const_iterator end() const { | 324 | 2.61k | return const_iterator(TheTable+NumBuckets, true); | 325 | 2.61k | } |
llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 901 | const_iterator end() const { | 324 | 901 | return const_iterator(TheTable+NumBuckets, true); | 325 | 901 | } |
Unexecuted instantiation: llvm::StringMap<llvm::TimeRecord, llvm::MallocAllocator>::end() const llvm::StringMap<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 9 | const_iterator end() const { | 324 | 9 | return const_iterator(TheTable+NumBuckets, true); | 325 | 9 | } |
llvm::StringMap<clang::IdentifierInfo*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::end() const Line | Count | Source | 323 | 17.0k | const_iterator end() const { | 324 | 17.0k | return const_iterator(TheTable+NumBuckets, true); | 325 | 17.0k | } |
llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::end() const Line | Count | Source | 323 | 3.61k | const_iterator end() const { | 324 | 3.61k | return const_iterator(TheTable+NumBuckets, true); | 325 | 3.61k | } |
llvm::StringMap<llvm::TrackingVH<llvm::Constant>, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 64 | const_iterator end() const { | 324 | 64 | return const_iterator(TheTable+NumBuckets, true); | 325 | 64 | } |
llvm::StringMap<clang::Module*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 390k | const_iterator end() const { | 324 | 390k | return const_iterator(TheTable+NumBuckets, true); | 325 | 390k | } |
llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 261 | const_iterator end() const { | 324 | 261 | return const_iterator(TheTable+NumBuckets, true); | 325 | 261 | } |
llvm::StringMap<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> >, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 5.84k | const_iterator end() const { | 324 | 5.84k | return const_iterator(TheTable+NumBuckets, true); | 325 | 5.84k | } |
llvm::StringMap<bool, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 229k | const_iterator end() const { | 324 | 229k | return const_iterator(TheTable+NumBuckets, true); | 325 | 229k | } |
llvm::StringMap<clang::GlobalDecl, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::end() const Line | Count | Source | 323 | 2.31k | const_iterator end() const { | 324 | 2.31k | return const_iterator(TheTable+NumBuckets, true); | 325 | 2.31k | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 4.79k | const_iterator end() const { | 324 | 4.79k | return const_iterator(TheTable+NumBuckets, true); | 325 | 4.79k | } |
llvm::StringMap<char, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::end() const Line | Count | Source | 323 | 1.46k | const_iterator end() const { | 324 | 1.46k | return const_iterator(TheTable+NumBuckets, true); | 325 | 1.46k | } |
llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 245 | const_iterator end() const { | 324 | 245 | return const_iterator(TheTable+NumBuckets, true); | 325 | 245 | } |
llvm::StringMap<std::__1::pair<llvm::StringRef, bool>, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 3.80k | const_iterator end() const { | 324 | 3.80k | return const_iterator(TheTable+NumBuckets, true); | 325 | 3.80k | } |
llvm::StringMap<clang::InMemoryModuleCache::PCM, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 19.0k | const_iterator end() const { | 324 | 19.0k | return const_iterator(TheTable+NumBuckets, true); | 325 | 19.0k | } |
llvm::StringMap<llvm::DIE const*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 3.48k | const_iterator end() const { | 324 | 3.48k | return const_iterator(TheTable+NumBuckets, true); | 325 | 3.48k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> >, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 19 | const_iterator end() const { | 324 | 19 | return const_iterator(TheTable+NumBuckets, true); | 325 | 19 | } |
llvm::StringMap<clang::Stmt*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 27.1k | const_iterator end() const { | 324 | 27.1k | return const_iterator(TheTable+NumBuckets, true); | 325 | 27.1k | } |
llvm::StringMap<FoundationClass, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 2.24k | const_iterator end() const { | 324 | 2.24k | return const_iterator(TheTable+NumBuckets, true); | 325 | 2.24k | } |
llvm::StringMap<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> >, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 28 | const_iterator end() const { | 324 | 28 | return const_iterator(TheTable+NumBuckets, true); | 325 | 28 | } |
llvm::StringMap<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt>, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 1.20k | const_iterator end() const { | 324 | 1.20k | return const_iterator(TheTable+NumBuckets, true); | 325 | 1.20k | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 1.90M | const_iterator end() const { | 324 | 1.90M | return const_iterator(TheTable+NumBuckets, true); | 325 | 1.90M | } |
llvm::StringMap<llvm::Type*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 2.17k | const_iterator end() const { | 324 | 2.17k | return const_iterator(TheTable+NumBuckets, true); | 325 | 2.17k | } |
llvm::StringMap<unsigned int, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::end() const Line | Count | Source | 323 | 2 | const_iterator end() const { | 324 | 2 | return const_iterator(TheTable+NumBuckets, true); | 325 | 2 | } |
llvm::StringMap<llvm::VRegInfo*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 11.1k | const_iterator end() const { | 324 | 11.1k | return const_iterator(TheTable+NumBuckets, true); | 325 | 11.1k | } |
llvm::StringMap<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> >, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 18 | const_iterator end() const { | 324 | 18 | return const_iterator(TheTable+NumBuckets, true); | 325 | 18 | } |
llvm::StringMap<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> >, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 33 | const_iterator end() const { | 324 | 33 | return const_iterator(TheTable+NumBuckets, true); | 325 | 33 | } |
llvm::StringMap<lld::Atom const*, llvm::MallocAllocator>::end() const Line | Count | Source | 323 | 124 | const_iterator end() const { | 324 | 124 | return const_iterator(TheTable+NumBuckets, true); | 325 | 124 | } |
|
326 | | |
327 | 3.07k | iterator_range<StringMapKeyIterator<ValueTy>> keys() const { |
328 | 3.07k | return make_range(StringMapKeyIterator<ValueTy>(begin()), |
329 | 3.07k | StringMapKeyIterator<ValueTy>(end())); |
330 | 3.07k | } llvm::StringMap<std::__1::pair<unsigned int, unsigned int>, llvm::MallocAllocator>::keys() const Line | Count | Source | 327 | 6 | iterator_range<StringMapKeyIterator<ValueTy>> keys() const { | 328 | 6 | return make_range(StringMapKeyIterator<ValueTy>(begin()), | 329 | 6 | StringMapKeyIterator<ValueTy>(end())); | 330 | 6 | } |
llvm::StringMap<char, llvm::MallocAllocator>::keys() const Line | Count | Source | 327 | 2.42k | iterator_range<StringMapKeyIterator<ValueTy>> keys() const { | 328 | 2.42k | return make_range(StringMapKeyIterator<ValueTy>(begin()), | 329 | 2.42k | StringMapKeyIterator<ValueTy>(end())); | 330 | 2.42k | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::keys() const Line | Count | Source | 327 | 651 | iterator_range<StringMapKeyIterator<ValueTy>> keys() const { | 328 | 651 | return make_range(StringMapKeyIterator<ValueTy>(begin()), | 329 | 651 | StringMapKeyIterator<ValueTy>(end())); | 330 | 651 | } |
|
331 | | |
332 | 8.05M | iterator find(StringRef Key) { |
333 | 8.05M | int Bucket = FindKey(Key); |
334 | 8.05M | if (Bucket == -1) return end()4.57M ; |
335 | 3.47M | return iterator(TheTable+Bucket, true); |
336 | 3.47M | } llvm::StringMap<llvm::MCAsmMacro, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.74M | iterator find(StringRef Key) { | 333 | 1.74M | int Bucket = FindKey(Key); | 334 | 1.74M | if (Bucket == -1) return end()1.54M ; | 335 | 197k | return iterator(TheTable+Bucket, true); | 336 | 197k | } |
AArch64AsmParser.cpp:llvm::StringMap<std::__1::pair<(anonymous namespace)::RegKind, unsigned int>, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 12.2k | iterator find(StringRef Key) { | 333 | 12.2k | int Bucket = FindKey(Key); | 334 | 12.2k | if (Bucket == -1) return end()11.4k ; | 335 | 813 | return iterator(TheTable+Bucket, true); | 336 | 813 | } |
llvm::StringMap<char, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.57k | iterator find(StringRef Key) { | 333 | 1.57k | int Bucket = FindKey(Key); | 334 | 1.57k | if (Bucket == -1) return end()660 ; | 335 | 919 | return iterator(TheTable+Bucket, true); | 336 | 919 | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 363k | iterator find(StringRef Key) { | 333 | 363k | int Bucket = FindKey(Key); | 334 | 363k | if (Bucket == -1) return end()3.44k ; | 335 | 360k | return iterator(TheTable+Bucket, true); | 336 | 360k | } |
llvm::StringMap<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 197 | iterator find(StringRef Key) { | 333 | 197 | int Bucket = FindKey(Key); | 334 | 197 | if (Bucket == -1) return end()62 ; | 335 | 135 | return iterator(TheTable+Bucket, true); | 336 | 135 | } |
llvm::StringMap<llvm::AsmToken, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 720 | iterator find(StringRef Key) { | 333 | 720 | int Bucket = FindKey(Key); | 334 | 720 | if (Bucket == -1) return end()719 ; | 335 | 1 | return iterator(TheTable+Bucket, true); | 336 | 1 | } |
llvm::StringMap<llvm::Function*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 40 | iterator find(StringRef Key) { | 333 | 40 | int Bucket = FindKey(Key); | 334 | 40 | if (Bucket == -1) return end()12 ; | 335 | 28 | return iterator(TheTable+Bucket, true); | 336 | 28 | } |
llvm::StringMap<llvm::RTLIB::Libcall, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 226 | iterator find(StringRef Key) { | 333 | 226 | int Bucket = FindKey(Key); | 334 | 226 | if (Bucket == -1) return end()0 ; | 335 | 226 | return iterator(TheTable+Bucket, true); | 336 | 226 | } |
llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 230 | iterator find(StringRef Key) { | 333 | 230 | int Bucket = FindKey(Key); | 334 | 230 | if (Bucket == -1) return end()86 ; | 335 | 144 | return iterator(TheTable+Bucket, true); | 336 | 144 | } |
llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.42k | iterator find(StringRef Key) { | 333 | 1.42k | int Bucket = FindKey(Key); | 334 | 1.42k | if (Bucket == -1) return end()0 ; | 335 | 1.42k | return iterator(TheTable+Bucket, true); | 336 | 1.42k | } |
llvm::StringMap<llvm::GCStrategy*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 81 | iterator find(StringRef Key) { | 333 | 81 | int Bucket = FindKey(Key); | 334 | 81 | if (Bucket == -1) return end()26 ; | 335 | 55 | return iterator(TheTable+Bucket, true); | 336 | 55 | } |
Unexecuted instantiation: llvm::StringMap<llvm::ConstantDataSequential*, llvm::MallocAllocator>::find(llvm::StringRef) llvm::StringMap<std::__1::pair<unsigned int, unsigned int>, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 19 | iterator find(StringRef Key) { | 333 | 19 | int Bucket = FindKey(Key); | 334 | 19 | if (Bucket == -1) return end()3 ; | 335 | 16 | return iterator(TheTable+Bucket, true); | 336 | 16 | } |
llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.43k | iterator find(StringRef Key) { | 333 | 1.43k | int Bucket = FindKey(Key); | 334 | 1.43k | if (Bucket == -1) return end()0 ; | 335 | 1.43k | return iterator(TheTable+Bucket, true); | 336 | 1.43k | } |
llvm::StringMap<bool, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 271k | iterator find(StringRef Key) { | 333 | 271k | int Bucket = FindKey(Key); | 334 | 271k | if (Bucket == -1) return end()126k ; | 335 | 145k | return iterator(TheTable+Bucket, true); | 336 | 145k | } |
AsmParser.cpp:llvm::StringMap<(anonymous namespace)::AsmParser::DirectiveKind, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.84M | iterator find(StringRef Key) { | 333 | 1.84M | int Bucket = FindKey(Key); | 334 | 1.84M | if (Bucket == -1) return end()1.46M ; | 335 | 381k | return iterator(TheTable+Bucket, true); | 336 | 381k | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 381k | iterator find(StringRef Key) { | 333 | 381k | int Bucket = FindKey(Key); | 334 | 381k | if (Bucket == -1) return end()186k ; | 335 | 195k | return iterator(TheTable+Bucket, true); | 336 | 195k | } |
llvm::StringMap<unsigned long, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 2.47k | iterator find(StringRef Key) { | 333 | 2.47k | int Bucket = FindKey(Key); | 334 | 2.47k | if (Bucket == -1) return end()1.24k ; | 335 | 1.23k | return iterator(TheTable+Bucket, true); | 336 | 1.23k | } |
llvm::StringMap<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.50M | iterator find(StringRef Key) { | 333 | 1.50M | int Bucket = FindKey(Key); | 334 | 1.50M | if (Bucket == -1) return end()388k ; | 335 | 1.12M | return iterator(TheTable+Bucket, true); | 336 | 1.12M | } |
llvm::StringMap<void*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 2 | iterator find(StringRef Key) { | 333 | 2 | int Bucket = FindKey(Key); | 334 | 2 | if (Bucket == -1) return end()0 ; | 335 | 2 | return iterator(TheTable+Bucket, true); | 336 | 2 | } |
llvm::StringMap<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> >, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 12 | iterator find(StringRef Key) { | 333 | 12 | int Bucket = FindKey(Key); | 334 | 12 | if (Bucket == -1) return end()0 ; | 335 | 12 | return iterator(TheTable+Bucket, true); | 336 | 12 | } |
llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.81k | iterator find(StringRef Key) { | 333 | 1.81k | int Bucket = FindKey(Key); | 334 | 1.81k | if (Bucket == -1) return end()880 ; | 335 | 935 | return iterator(TheTable+Bucket, true); | 336 | 935 | } |
llvm::StringMap<clang::DirectoryEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::find(llvm::StringRef) Line | Count | Source | 332 | 564 | iterator find(StringRef Key) { | 333 | 564 | int Bucket = FindKey(Key); | 334 | 564 | if (Bucket == -1) return end()0 ; | 335 | 564 | return iterator(TheTable+Bucket, true); | 336 | 564 | } |
llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::find(llvm::StringRef) Line | Count | Source | 332 | 1.17k | iterator find(StringRef Key) { | 333 | 1.17k | int Bucket = FindKey(Key); | 334 | 1.17k | if (Bucket == -1) return end()0 ; | 335 | 1.17k | return iterator(TheTable+Bucket, true); | 336 | 1.17k | } |
llvm::StringMap<llvm::Constant*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 14 | iterator find(StringRef Key) { | 333 | 14 | int Bucket = FindKey(Key); | 334 | 14 | if (Bucket == -1) return end()13 ; | 335 | 1 | return iterator(TheTable+Bucket, true); | 336 | 1 | } |
llvm::StringMap<clang::GlobalDecl, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::find(llvm::StringRef) Line | Count | Source | 332 | 18 | iterator find(StringRef Key) { | 333 | 18 | int Bucket = FindKey(Key); | 334 | 18 | if (Bucket == -1) return end()0 ; | 335 | 18 | return iterator(TheTable+Bucket, true); | 336 | 18 | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::find(llvm::StringRef) Line | Count | Source | 332 | 8 | iterator find(StringRef Key) { | 333 | 8 | int Bucket = FindKey(Key); | 334 | 8 | if (Bucket == -1) return end()2 ; | 335 | 6 | return iterator(TheTable+Bucket, true); | 336 | 6 | } |
llvm::StringMap<char const*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 106 | iterator find(StringRef Key) { | 333 | 106 | int Bucket = FindKey(Key); | 334 | 106 | if (Bucket == -1) return end()105 ; | 335 | 1 | return iterator(TheTable+Bucket, true); | 336 | 1 | } |
llvm::StringMap<int, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 471k | iterator find(StringRef Key) { | 333 | 471k | int Bucket = FindKey(Key); | 334 | 471k | if (Bucket == -1) return end()462k ; | 335 | 9.77k | return iterator(TheTable+Bucket, true); | 336 | 9.77k | } |
llvm::StringMap<clang::SourceLocation, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 65 | iterator find(StringRef Key) { | 333 | 65 | int Bucket = FindKey(Key); | 334 | 65 | if (Bucket == -1) return end()15 ; | 335 | 50 | return iterator(TheTable+Bucket, true); | 336 | 50 | } |
llvm::StringMap<clang::LayoutOverrideSource::Layout, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 41 | iterator find(StringRef Key) { | 333 | 41 | int Bucket = FindKey(Key); | 334 | 41 | if (Bucket == -1) return end()3 ; | 335 | 38 | return iterator(TheTable+Bucket, true); | 336 | 38 | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 904 | iterator find(StringRef Key) { | 333 | 904 | int Bucket = FindKey(Key); | 334 | 904 | if (Bucket == -1) return end()63 ; | 335 | 841 | return iterator(TheTable+Bucket, true); | 336 | 841 | } |
llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 460 | iterator find(StringRef Key) { | 333 | 460 | int Bucket = FindKey(Key); | 334 | 460 | if (Bucket == -1) return end()458 ; | 335 | 2 | return iterator(TheTable+Bucket, true); | 336 | 2 | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMap<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u>, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 842 | iterator find(StringRef Key) { | 333 | 842 | int Bucket = FindKey(Key); | 334 | 842 | if (Bucket == -1) return end()832 ; | 335 | 10 | return iterator(TheTable+Bucket, true); | 336 | 10 | } |
llvm::StringMap<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 26 | iterator find(StringRef Key) { | 333 | 26 | int Bucket = FindKey(Key); | 334 | 26 | if (Bucket == -1) return end()11 ; | 335 | 15 | return iterator(TheTable+Bucket, true); | 336 | 15 | } |
llvm::StringMap<std::__1::pair<llvm::StringRef, bool>, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.90k | iterator find(StringRef Key) { | 333 | 1.90k | int Bucket = FindKey(Key); | 334 | 1.90k | if (Bucket == -1) return end()59 ; | 335 | 1.84k | return iterator(TheTable+Bucket, true); | 336 | 1.84k | } |
llvm::StringMap<std::__1::shared_ptr<clang::ModuleFileExtension>, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 46 | iterator find(StringRef Key) { | 333 | 46 | int Bucket = FindKey(Key); | 334 | 46 | if (Bucket == -1) return end()30 ; | 335 | 16 | return iterator(TheTable+Bucket, true); | 336 | 16 | } |
llvm::StringMap<clang::InMemoryModuleCache::PCM, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 6.25k | iterator find(StringRef Key) { | 333 | 6.25k | int Bucket = FindKey(Key); | 334 | 6.25k | if (Bucket == -1) return end()0 ; | 335 | 6.25k | return iterator(TheTable+Bucket, true); | 336 | 6.25k | } |
llvm::StringMap<unsigned int const*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.79k | iterator find(StringRef Key) { | 333 | 1.79k | int Bucket = FindKey(Key); | 334 | 1.79k | if (Bucket == -1) return end()1.45k ; | 335 | 338 | return iterator(TheTable+Bucket, true); | 336 | 338 | } |
llvm::StringMap<llvm::MachineMemOperand::Flags, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 24 | iterator find(StringRef Key) { | 333 | 24 | int Bucket = FindKey(Key); | 334 | 24 | if (Bucket == -1) return end()1 ; | 335 | 23 | return iterator(TheTable+Bucket, true); | 336 | 23 | } |
llvm::StringMap<llvm::TargetRegisterClass const*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 40.5k | iterator find(StringRef Key) { | 333 | 40.5k | int Bucket = FindKey(Key); | 334 | 40.5k | if (Bucket == -1) return end()29.4k ; | 335 | 11.1k | return iterator(TheTable+Bucket, true); | 336 | 11.1k | } |
llvm::StringMap<llvm::RegisterBank const*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 13.0k | iterator find(StringRef Key) { | 333 | 13.0k | int Bucket = FindKey(Key); | 334 | 13.0k | if (Bucket == -1) return end()1 ; | 335 | 13.0k | return iterator(TheTable+Bucket, true); | 336 | 13.0k | } |
llvm::StringMap<unsigned short, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 48 | iterator find(StringRef Key) { | 333 | 48 | int Bucket = FindKey(Key); | 334 | 48 | if (Bucket == -1) return end()47 ; | 335 | 1 | return iterator(TheTable+Bucket, true); | 336 | 1 | } |
llvm::StringMap<llvm::SDNode*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 14.8k | iterator find(StringRef Key) { | 333 | 14.8k | int Bucket = FindKey(Key); | 334 | 14.8k | if (Bucket == -1) return end()0 ; | 335 | 14.8k | return iterator(TheTable+Bucket, true); | 336 | 14.8k | } |
llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 533 | iterator find(StringRef Key) { | 333 | 533 | int Bucket = FindKey(Key); | 334 | 533 | if (Bucket == -1) return end()331 ; | 335 | 202 | return iterator(TheTable+Bucket, true); | 336 | 202 | } |
StdLibraryFunctionsChecker.cpp:llvm::StringMap<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.45k | iterator find(StringRef Key) { | 333 | 1.45k | int Bucket = FindKey(Key); | 334 | 1.45k | if (Bucket == -1) return end()766 ; | 335 | 692 | return iterator(TheTable+Bucket, true); | 336 | 692 | } |
llvm::StringMap<clang::ASTUnit*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 63 | iterator find(StringRef Key) { | 333 | 63 | int Bucket = FindKey(Key); | 334 | 63 | if (Bucket == -1) return end(); | 335 | 0 | return iterator(TheTable+Bucket, true); | 336 | 0 | } |
llvm::StringMap<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> >, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 57 | iterator find(StringRef Key) { | 333 | 57 | int Bucket = FindKey(Key); | 334 | 57 | if (Bucket == -1) return end()8 ; | 335 | 49 | return iterator(TheTable+Bucket, true); | 336 | 49 | } |
llvm::StringMap<clang::ASTContext::SectionInfo, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 5.94k | iterator find(StringRef Key) { | 333 | 5.94k | int Bucket = FindKey(Key); | 334 | 5.94k | if (Bucket == -1) return end()194 ; | 335 | 5.75k | return iterator(TheTable+Bucket, true); | 336 | 5.75k | } |
llvm::StringMap<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> >, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 4 | iterator find(StringRef Key) { | 333 | 4 | int Bucket = FindKey(Key); | 334 | 4 | if (Bucket == -1) return end()2 ; | 335 | 2 | return iterator(TheTable+Bucket, true); | 336 | 2 | } |
llvm::StringMap<llvm::StringSet<llvm::MallocAllocator>, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 2.56k | iterator find(StringRef Key) { | 333 | 2.56k | int Bucket = FindKey(Key); | 334 | 2.56k | if (Bucket == -1) return end()2.55k ; | 335 | 5 | return iterator(TheTable+Bucket, true); | 336 | 5 | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 1.00M | iterator find(StringRef Key) { | 333 | 1.00M | int Bucket = FindKey(Key); | 334 | 1.00M | if (Bucket == -1) return end()0 ; | 335 | 1.00M | return iterator(TheTable+Bucket, true); | 336 | 1.00M | } |
llvm::StringMap<llvm::RecordStreamer::State, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 62 | iterator find(StringRef Key) { | 333 | 62 | int Bucket = FindKey(Key); | 334 | 62 | if (Bucket == -1) return end()36 ; | 335 | 26 | return iterator(TheTable+Bucket, true); | 336 | 26 | } |
llvm::StringMap<llvm::GlobalValue const*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 17 | iterator find(StringRef Key) { | 333 | 17 | int Bucket = FindKey(Key); | 334 | 17 | if (Bucket == -1) return end()10 ; | 335 | 7 | return iterator(TheTable+Bucket, true); | 336 | 7 | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 353k | iterator find(StringRef Key) { | 333 | 353k | int Bucket = FindKey(Key); | 334 | 353k | if (Bucket == -1) return end()353k ; | 335 | 259 | return iterator(TheTable+Bucket, true); | 336 | 259 | } |
llvm::StringMap<lld::Atom const*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 417 | iterator find(StringRef Key) { | 333 | 417 | int Bucket = FindKey(Key); | 334 | 417 | if (Bucket == -1) return end()228 ; | 335 | 189 | return iterator(TheTable+Bucket, true); | 336 | 189 | } |
llvm::StringMap<lld::mach_o::MachODylibFile*, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 223 | iterator find(StringRef Key) { | 333 | 223 | int Bucket = FindKey(Key); | 334 | 223 | if (Bucket == -1) return end()0 ; | 335 | 223 | return iterator(TheTable+Bucket, true); | 336 | 223 | } |
MachONormalizedFileFromAtoms.cpp:llvm::StringMap<(anonymous namespace)::Util::DylibInfo, llvm::MallocAllocator>::find(llvm::StringRef) Line | Count | Source | 332 | 112 | iterator find(StringRef Key) { | 333 | 112 | int Bucket = FindKey(Key); | 334 | 112 | if (Bucket == -1) return end()111 ; | 335 | 1 | return iterator(TheTable+Bucket, true); | 336 | 1 | } |
|
337 | | |
338 | 103M | const_iterator find(StringRef Key) const { |
339 | 103M | int Bucket = FindKey(Key); |
340 | 103M | if (Bucket == -1) return end()76.6M ; |
341 | 26.6M | return const_iterator(TheTable+Bucket, true); |
342 | 26.6M | } llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 146k | const_iterator find(StringRef Key) const { | 339 | 146k | int Bucket = FindKey(Key); | 340 | 146k | if (Bucket == -1) return end()35 ; | 341 | 146k | return const_iterator(TheTable+Bucket, true); | 342 | 146k | } |
llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 78.6M | const_iterator find(StringRef Key) const { | 339 | 78.6M | int Bucket = FindKey(Key); | 340 | 78.6M | if (Bucket == -1) return end()71.1M ; | 341 | 7.51M | return const_iterator(TheTable+Bucket, true); | 342 | 7.51M | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 97.3k | const_iterator find(StringRef Key) const { | 339 | 97.3k | int Bucket = FindKey(Key); | 340 | 97.3k | if (Bucket == -1) return end()85.0k ; | 341 | 12.3k | return const_iterator(TheTable+Bucket, true); | 342 | 12.3k | } |
llvm::StringMap<int, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 838 | const_iterator find(StringRef Key) const { | 339 | 838 | int Bucket = FindKey(Key); | 340 | 838 | if (Bucket == -1) return end()35 ; | 341 | 803 | return const_iterator(TheTable+Bucket, true); | 342 | 803 | } |
llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 2.02k | const_iterator find(StringRef Key) const { | 339 | 2.02k | int Bucket = FindKey(Key); | 340 | 2.02k | if (Bucket == -1) return end()4 ; | 341 | 2.01k | return const_iterator(TheTable+Bucket, true); | 342 | 2.01k | } |
llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 18.7M | const_iterator find(StringRef Key) const { | 339 | 18.7M | int Bucket = FindKey(Key); | 340 | 18.7M | if (Bucket == -1) return end()2.49M ; | 341 | 16.2M | return const_iterator(TheTable+Bucket, true); | 342 | 16.2M | } |
llvm::StringMap<llvm::PassInfo const*, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 2.31k | const_iterator find(StringRef Key) const { | 339 | 2.31k | int Bucket = FindKey(Key); | 340 | 2.31k | if (Bucket == -1) return end()5 ; | 341 | 2.31k | return const_iterator(TheTable+Bucket, true); | 342 | 2.31k | } |
llvm::StringMap<llvm::StructType*, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 146 | const_iterator find(StringRef Key) const { | 339 | 146 | int Bucket = FindKey(Key); | 340 | 146 | if (Bucket == -1) return end()30 ; | 341 | 116 | return const_iterator(TheTable+Bucket, true); | 342 | 116 | } |
llvm::StringMap<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> >, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 861 | const_iterator find(StringRef Key) const { | 339 | 861 | int Bucket = FindKey(Key); | 340 | 861 | if (Bucket == -1) return end()27 ; | 341 | 834 | return const_iterator(TheTable+Bucket, true); | 342 | 834 | } |
llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 581 | const_iterator find(StringRef Key) const { | 339 | 581 | int Bucket = FindKey(Key); | 340 | 581 | if (Bucket == -1) return end()258 ; | 341 | 323 | return const_iterator(TheTable+Bucket, true); | 342 | 323 | } |
llvm::StringMap<char, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 2.16M | const_iterator find(StringRef Key) const { | 339 | 2.16M | int Bucket = FindKey(Key); | 340 | 2.16M | if (Bucket == -1) return end()1.91M ; | 341 | 245k | return const_iterator(TheTable+Bucket, true); | 342 | 245k | } |
llvm::StringMap<llvm::MCSymbol*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::find(llvm::StringRef) const Line | Count | Source | 338 | 2.43k | const_iterator find(StringRef Key) const { | 339 | 2.43k | int Bucket = FindKey(Key); | 340 | 2.43k | if (Bucket == -1) return end()864 ; | 341 | 1.57k | return const_iterator(TheTable+Bucket, true); | 342 | 1.57k | } |
llvm::StringMap<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)>, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 869k | const_iterator find(StringRef Key) const { | 339 | 869k | int Bucket = FindKey(Key); | 340 | 869k | if (Bucket == -1) return end()379k ; | 341 | 490k | return const_iterator(TheTable+Bucket, true); | 342 | 490k | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 8.60k | const_iterator find(StringRef Key) const { | 339 | 8.60k | int Bucket = FindKey(Key); | 340 | 8.60k | if (Bucket == -1) return end()5.54k ; | 341 | 3.06k | return const_iterator(TheTable+Bucket, true); | 342 | 3.06k | } |
llvm::StringMap<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 1.65k | const_iterator find(StringRef Key) const { | 339 | 1.65k | int Bucket = FindKey(Key); | 340 | 1.65k | if (Bucket == -1) return end()960 ; | 341 | 695 | return const_iterator(TheTable+Bucket, true); | 342 | 695 | } |
llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 695 | const_iterator find(StringRef Key) const { | 339 | 695 | int Bucket = FindKey(Key); | 340 | 695 | if (Bucket == -1) return end()206 ; | 341 | 489 | return const_iterator(TheTable+Bucket, true); | 342 | 489 | } |
llvm::StringMap<llvm::TrackingVH<llvm::Constant>, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 32 | const_iterator find(StringRef Key) const { | 339 | 32 | int Bucket = FindKey(Key); | 340 | 32 | if (Bucket == -1) return end(); | 341 | 0 | return const_iterator(TheTable+Bucket, true); | 342 | 0 | } |
llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 181 | const_iterator find(StringRef Key) const { | 339 | 181 | int Bucket = FindKey(Key); | 340 | 181 | if (Bucket == -1) return end()80 ; | 341 | 101 | return const_iterator(TheTable+Bucket, true); | 342 | 101 | } |
llvm::StringMap<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> >, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 4.06k | const_iterator find(StringRef Key) const { | 339 | 4.06k | int Bucket = FindKey(Key); | 340 | 4.06k | if (Bucket == -1) return end()342 ; | 341 | 3.71k | return const_iterator(TheTable+Bucket, true); | 342 | 3.71k | } |
llvm::StringMap<bool, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 227k | const_iterator find(StringRef Key) const { | 339 | 227k | int Bucket = FindKey(Key); | 340 | 227k | if (Bucket == -1) return end()2.20k ; | 341 | 224k | return const_iterator(TheTable+Bucket, true); | 342 | 224k | } |
llvm::StringMap<clang::GlobalDecl, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::find(llvm::StringRef) const Line | Count | Source | 338 | 2.24k | const_iterator find(StringRef Key) const { | 339 | 2.24k | int Bucket = FindKey(Key); | 340 | 2.24k | if (Bucket == -1) return end()75 ; | 341 | 2.16k | return const_iterator(TheTable+Bucket, true); | 342 | 2.16k | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 3.01k | const_iterator find(StringRef Key) const { | 339 | 3.01k | int Bucket = FindKey(Key); | 340 | 3.01k | if (Bucket == -1) return end()1.17k ; | 341 | 1.84k | return const_iterator(TheTable+Bucket, true); | 342 | 1.84k | } |
llvm::StringMap<char, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::find(llvm::StringRef) const Line | Count | Source | 338 | 743 | const_iterator find(StringRef Key) const { | 339 | 743 | int Bucket = FindKey(Key); | 340 | 743 | if (Bucket == -1) return end()723 ; | 341 | 20 | return const_iterator(TheTable+Bucket, true); | 342 | 20 | } |
llvm::StringMap<std::__1::pair<llvm::StringRef, bool>, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 1.90k | const_iterator find(StringRef Key) const { | 339 | 1.90k | int Bucket = FindKey(Key); | 340 | 1.90k | if (Bucket == -1) return end(); | 341 | 0 | return const_iterator(TheTable+Bucket, true); | 342 | 0 | } |
llvm::StringMap<clang::InMemoryModuleCache::PCM, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 10.5k | const_iterator find(StringRef Key) const { | 339 | 10.5k | int Bucket = FindKey(Key); | 340 | 10.5k | if (Bucket == -1) return end()8.51k ; | 341 | 1.98k | return const_iterator(TheTable+Bucket, true); | 342 | 1.98k | } |
llvm::StringMap<clang::Stmt*, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 14.0k | const_iterator find(StringRef Key) const { | 339 | 14.0k | int Bucket = FindKey(Key); | 340 | 14.0k | if (Bucket == -1) return end()13.0k ; | 341 | 944 | return const_iterator(TheTable+Bucket, true); | 342 | 944 | } |
llvm::StringMap<FoundationClass, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 1.46k | const_iterator find(StringRef Key) const { | 339 | 1.46k | int Bucket = FindKey(Key); | 340 | 1.46k | if (Bucket == -1) return end()773 ; | 341 | 696 | return const_iterator(TheTable+Bucket, true); | 342 | 696 | } |
llvm::StringMap<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> >, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 18 | const_iterator find(StringRef Key) const { | 339 | 18 | int Bucket = FindKey(Key); | 340 | 18 | if (Bucket == -1) return end()10 ; | 341 | 8 | return const_iterator(TheTable+Bucket, true); | 342 | 8 | } |
llvm::StringMap<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt>, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 653 | const_iterator find(StringRef Key) const { | 339 | 653 | int Bucket = FindKey(Key); | 340 | 653 | if (Bucket == -1) return end()553 ; | 341 | 100 | return const_iterator(TheTable+Bucket, true); | 342 | 100 | } |
llvm::StringMap<clang::Module*, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 220k | const_iterator find(StringRef Key) const { | 339 | 220k | int Bucket = FindKey(Key); | 340 | 220k | if (Bucket == -1) return end()168k ; | 341 | 52.0k | return const_iterator(TheTable+Bucket, true); | 342 | 52.0k | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 1.77M | const_iterator find(StringRef Key) const { | 339 | 1.77M | int Bucket = FindKey(Key); | 340 | 1.77M | if (Bucket == -1) return end()133k ; | 341 | 1.63M | return const_iterator(TheTable+Bucket, true); | 342 | 1.63M | } |
llvm::StringMap<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> >, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 12 | const_iterator find(StringRef Key) const { | 339 | 12 | int Bucket = FindKey(Key); | 340 | 12 | if (Bucket == -1) return end()6 ; | 341 | 6 | return const_iterator(TheTable+Bucket, true); | 342 | 6 | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 286k | const_iterator find(StringRef Key) const { | 339 | 286k | int Bucket = FindKey(Key); | 340 | 286k | if (Bucket == -1) return end()286k ; | 341 | 103 | return const_iterator(TheTable+Bucket, true); | 342 | 103 | } |
llvm::StringMap<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> >, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 22 | const_iterator find(StringRef Key) const { | 339 | 22 | int Bucket = FindKey(Key); | 340 | 22 | if (Bucket == -1) return end()11 ; | 341 | 11 | return const_iterator(TheTable+Bucket, true); | 342 | 11 | } |
llvm::StringMap<lld::Atom const*, llvm::MallocAllocator>::find(llvm::StringRef) const Line | Count | Source | 338 | 71 | const_iterator find(StringRef Key) const { | 339 | 71 | int Bucket = FindKey(Key); | 340 | 71 | if (Bucket == -1) return end()53 ; | 341 | 18 | return const_iterator(TheTable+Bucket, true); | 342 | 18 | } |
|
343 | | |
344 | | /// lookup - Return the entry for the specified key, or a default |
345 | | /// constructed value if no such entry exists. |
346 | 100M | ValueTy lookup(StringRef Key) const { |
347 | 100M | const_iterator it = find(Key); |
348 | 100M | if (it != end()) |
349 | 26.1M | return it->second; |
350 | 74.1M | return ValueTy(); |
351 | 74.1M | } llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 78.6M | ValueTy lookup(StringRef Key) const { | 347 | 78.6M | const_iterator it = find(Key); | 348 | 78.6M | if (it != end()) | 349 | 7.51M | return it->second; | 350 | 71.1M | return ValueTy(); | 351 | 71.1M | } |
llvm::StringMap<int, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 836 | ValueTy lookup(StringRef Key) const { | 347 | 836 | const_iterator it = find(Key); | 348 | 836 | if (it != end()) | 349 | 803 | return it->second; | 350 | 33 | return ValueTy(); | 351 | 33 | } |
llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 1.00k | ValueTy lookup(StringRef Key) const { | 347 | 1.00k | const_iterator it = find(Key); | 348 | 1.00k | if (it != end()) | 349 | 999 | return it->second; | 350 | 2 | return ValueTy(); | 351 | 2 | } |
llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 18.7M | ValueTy lookup(StringRef Key) const { | 347 | 18.7M | const_iterator it = find(Key); | 348 | 18.7M | if (it != end()) | 349 | 16.2M | return it->second; | 350 | 2.49M | return ValueTy(); | 351 | 2.49M | } |
llvm::StringMap<llvm::StructType*, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 146 | ValueTy lookup(StringRef Key) const { | 347 | 146 | const_iterator it = find(Key); | 348 | 146 | if (it != end()) | 349 | 116 | return it->second; | 350 | 30 | return ValueTy(); | 351 | 30 | } |
llvm::StringMap<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> >, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 245 | ValueTy lookup(StringRef Key) const { | 347 | 245 | const_iterator it = find(Key); | 348 | 245 | if (it != end()) | 349 | 244 | return it->second; | 350 | 1 | return ValueTy(); | 351 | 1 | } |
llvm::StringMap<llvm::MCSymbol*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 2.43k | ValueTy lookup(StringRef Key) const { | 347 | 2.43k | const_iterator it = find(Key); | 348 | 2.43k | if (it != end()) | 349 | 1.57k | return it->second; | 350 | 864 | return ValueTy(); | 351 | 864 | } |
llvm::StringMap<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)>, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 869k | ValueTy lookup(StringRef Key) const { | 347 | 869k | const_iterator it = find(Key); | 348 | 869k | if (it != end()) | 349 | 490k | return it->second; | 350 | 379k | return ValueTy(); | 351 | 379k | } |
llvm::StringMap<bool, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 227k | ValueTy lookup(StringRef Key) const { | 347 | 227k | const_iterator it = find(Key); | 348 | 227k | if (it != end()) | 349 | 224k | return it->second; | 350 | 2.20k | return ValueTy(); | 351 | 2.20k | } |
llvm::StringMap<clang::GlobalDecl, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::lookup(llvm::StringRef) const Line | Count | Source | 346 | 50 | ValueTy lookup(StringRef Key) const { | 347 | 50 | const_iterator it = find(Key); | 348 | 50 | if (it != end()) | 349 | 2 | return it->second; | 350 | 48 | return ValueTy(); | 351 | 48 | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 366 | ValueTy lookup(StringRef Key) const { | 347 | 366 | const_iterator it = find(Key); | 348 | 366 | if (it != end()) | 349 | 67 | return it->second; | 350 | 299 | return ValueTy(); | 351 | 299 | } |
llvm::StringMap<FoundationClass, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 1.46k | ValueTy lookup(StringRef Key) const { | 347 | 1.46k | const_iterator it = find(Key); | 348 | 1.46k | if (it != end()) | 349 | 696 | return it->second; | 350 | 773 | return ValueTy(); | 351 | 773 | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 1.77M | ValueTy lookup(StringRef Key) const { | 347 | 1.77M | const_iterator it = find(Key); | 348 | 1.77M | if (it != end()) | 349 | 1.63M | return it->second; | 350 | 133k | return ValueTy(); | 351 | 133k | } |
llvm::StringMap<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> >, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 12 | ValueTy lookup(StringRef Key) const { | 347 | 12 | const_iterator it = find(Key); | 348 | 12 | if (it != end()) | 349 | 6 | return it->second; | 350 | 6 | return ValueTy(); | 351 | 6 | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::lookup(llvm::StringRef) const Line | Count | Source | 346 | 44 | ValueTy lookup(StringRef Key) const { | 347 | 44 | const_iterator it = find(Key); | 348 | 44 | if (it != end()) | 349 | 44 | return it->second; | 350 | 0 | return ValueTy(); | 351 | 0 | } |
|
352 | | |
353 | | /// Lookup the ValueTy for the \p Key, or create a default constructed value |
354 | | /// if the key is not in the map. |
355 | 93.3M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } llvm::StringMap<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 89.3k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 137k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 8.91M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 4.86M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 17.2M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 116k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 1.61M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 1.06M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 275 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 62.4k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 180k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::AsmToken, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 1 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 186k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 9.14k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::Function*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 332 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::RTLIB::Libcall, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 4.87k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 88.5k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 633 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 4.12M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 4.42k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::GCStrategy*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 26 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 650 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::pair<unsigned int, unsigned int>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 176 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 87.8k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::PassInfo const*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 32.8M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 1.17k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 1.07k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<bool, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 3.12M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::MCSymbol*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::operator[](llvm::StringRef) Line | Count | Source | 355 | 8.20M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::MCSectionMachO*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 899k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
AsmParser.cpp:llvm::StringMap<(anonymous namespace)::AsmParser::DirectiveKind, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 2.99M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 705k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<unsigned long, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 264k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 542 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 542 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 71 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 9 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::Timer, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 9 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 745k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<void*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 3 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 128 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::vfs::Status, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::operator[](llvm::StringRef) Line | Count | Source | 355 | 35 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 1.39k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::Constant*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 94 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::GlobalVariable*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 3.99k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 7.87k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 164 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::TrackingVH<llvm::Constant>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 139 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::ASTContext::SectionInfo, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 5.92k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::operator[](llvm::StringRef) Line | Count | Source | 355 | 14 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::FrameworkCacheEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::operator[](llvm::StringRef) Line | Count | Source | 355 | 10.1k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 53.6k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<char const*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 105 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<int, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 797k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 2.28k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::SourceLocation, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 15 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::LayoutOverrideSource::Layout, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 39 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 157 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
VerifyDiagnosticConsumer.cpp:llvm::StringMap<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 11 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::pair<llvm::StringRef, bool>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 5.86k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::SmallVector<unsigned int, 2u>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 107k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::InMemoryModuleCache::PCM, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 1.32k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 85 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::DIE const*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 89.8k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::weak_ptr<llvm::DWARFContext::DWOFile>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 10 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<unsigned short, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 47 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::SDNode*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 18.9k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::lto::LTO::GlobalResolution, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 1.36k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 621 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::Stmt*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 27.1k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<FoundationClass, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 91 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 53 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::ento::BugType*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 1.12k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 72 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::ASTUnit*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 57 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::SmallVector<clang::TypoCorrection, 1u>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 11.1k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 3 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::TimeRecord, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 9 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::StringLiteral*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 255 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::comments::TParamCommandComment*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 92 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::HeaderSearch::LookupFileCacheInfo, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::operator[](llvm::StringRef) Line | Count | Source | 355 | 884k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::StringSet<llvm::MallocAllocator>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 20 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::Module*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 74.0k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 2.25M | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::pair<llvm::Type*, llvm::SMLoc>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 105k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 649 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::RecordStreamer::State, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 434 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::GlobalValue const*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 255 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::TinyPtrVector<lld::elf::OutputSection*>, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 387k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 44 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 34 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<lld::Atom const*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 396 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<lld::mach_o::MachODylibFile*, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 234 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> >, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 5 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
MachONormalizedFileFromAtoms.cpp:llvm::StringMap<(anonymous namespace)::Util::DylibInfo, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 408 | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
llvm::StringMap<llvm::FileInfo::LineData, llvm::MallocAllocator>::operator[](llvm::StringRef) Line | Count | Source | 355 | 3.04k | ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; } |
|
356 | | |
357 | | /// count - Return 1 if the element is in the map, 0 otherwise. |
358 | 368k | size_type count(StringRef Key) const { |
359 | 368k | return find(Key) == end() ? 0364k : 13.90k ; |
360 | 368k | } llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 527 | size_type count(StringRef Key) const { | 359 | 527 | return find(Key) == end() ? 02 : 1525 ; | 360 | 527 | } |
llvm::StringMap<char, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 61.9k | size_type count(StringRef Key) const { | 359 | 61.9k | return find(Key) == end() ? 060.9k : 1979 ; | 360 | 61.9k | } |
llvm::StringMap<llvm::TrackingVH<llvm::Constant>, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 32 | size_type count(StringRef Key) const { | 359 | 32 | return find(Key) == end() ? 0 : 10 ; | 360 | 32 | } |
llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 181 | size_type count(StringRef Key) const { | 359 | 181 | return find(Key) == end() ? 080 : 1101 ; | 360 | 181 | } |
llvm::StringMap<char, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::count(llvm::StringRef) const Line | Count | Source | 358 | 743 | size_type count(StringRef Key) const { | 359 | 743 | return find(Key) == end() ? 0723 : 120 ; | 360 | 743 | } |
llvm::StringMap<std::__1::pair<llvm::StringRef, bool>, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 1.90k | size_type count(StringRef Key) const { | 359 | 1.90k | return find(Key) == end() ? 0 : 10 ; | 360 | 1.90k | } |
llvm::StringMap<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> >, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 337 | size_type count(StringRef Key) const { | 359 | 337 | return find(Key) == end() ? 026 : 1311 ; | 360 | 337 | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 1.66k | size_type count(StringRef Key) const { | 359 | 1.66k | return find(Key) == end() ? 0700 : 1961 ; | 360 | 1.66k | } |
llvm::StringMap<clang::Stmt*, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 14.0k | size_type count(StringRef Key) const { | 359 | 14.0k | return find(Key) == end() ? 013.0k : 1944 ; | 360 | 14.0k | } |
llvm::StringMap<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> >, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 18 | size_type count(StringRef Key) const { | 359 | 18 | return find(Key) == end() ? 010 : 18 ; | 360 | 18 | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 286k | size_type count(StringRef Key) const { | 359 | 286k | return find(Key) == end() ? 0286k : 159 ; | 360 | 286k | } |
llvm::StringMap<lld::Atom const*, llvm::MallocAllocator>::count(llvm::StringRef) const Line | Count | Source | 358 | 53 | size_type count(StringRef Key) const { | 359 | 53 | return find(Key) == end() ? 0 : 10 ; | 360 | 53 | } |
|
361 | | |
362 | | template <typename InputTy> |
363 | | size_type count(const StringMapEntry<InputTy> &MapEntry) const { |
364 | | return count(MapEntry.getKey()); |
365 | | } |
366 | | |
367 | | /// insert - Insert the specified key/value pair into the map. If the key |
368 | | /// already exists in the map, return false and ignore the request, otherwise |
369 | | /// insert it and return true. |
370 | 2.69M | bool insert(MapEntryTy *KeyValue) { |
371 | 2.69M | unsigned BucketNo = LookupBucketFor(KeyValue->getKey()); |
372 | 2.69M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; |
373 | 2.69M | if (Bucket && Bucket != getTombstoneVal()764k ) |
374 | 210k | return false; // Already exists in map. |
375 | 2.48M | |
376 | 2.48M | if (Bucket == getTombstoneVal()) |
377 | 553k | --NumTombstones; |
378 | 2.48M | Bucket = KeyValue; |
379 | 2.48M | ++NumItems; |
380 | 2.48M | assert(NumItems + NumTombstones <= NumBuckets); |
381 | 2.48M | |
382 | 2.48M | RehashTable(); |
383 | 2.48M | return true; |
384 | 2.48M | } |
385 | | |
386 | | /// insert - Inserts the specified key/value pair into the map if the key |
387 | | /// isn't already in the map. The bool component of the returned pair is true |
388 | | /// if and only if the insertion takes place, and the iterator component of |
389 | | /// the pair points to the element with key equivalent to the key of the pair. |
390 | 877M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { |
391 | 877M | return try_emplace(KV.first, std::move(KV.second)); |
392 | 877M | } llvm::StringMap<char, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, char>) Line | Count | Source | 390 | 292M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 292M | return try_emplace(KV.first, std::move(KV.second)); | 392 | 292M | } |
llvm::StringMap<llvm::MCAsmMacro, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::MCAsmMacro>) Line | Count | Source | 390 | 293 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 293 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 293 | } |
AArch64AsmParser.cpp:llvm::StringMap<std::__1::pair<(anonymous namespace)::RegKind, unsigned int>, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >) Line | Count | Source | 390 | 19 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 19 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 19 | } |
llvm::StringMap<int, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, int>) Line | Count | Source | 390 | 2.94k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 2.94k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 2.94k | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, unsigned int>) Line | Count | Source | 390 | 34.4M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 34.4M | return try_emplace(KV.first, std::move(KV.second)); | 392 | 34.4M | } |
llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >) Line | Count | Source | 390 | 929 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 929 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 929 | } |
llvm::StringMap<llvm::ConstantDataSequential*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::ConstantDataSequential*>) Line | Count | Source | 390 | 973k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 973k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 973k | } |
llvm::StringMap<unsigned char, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, unsigned char>) Line | Count | Source | 390 | 244k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 244k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 244k | } |
llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::Comdat>) Line | Count | Source | 390 | 32.3k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 32.3k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 32.3k | } |
llvm::StringMap<llvm::StructType*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::StructType*>) Line | Count | Source | 390 | 273k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 273k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 273k | } |
llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::Value*>) Line | Count | Source | 390 | 15.6M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 15.6M | return try_emplace(KV.first, std::move(KV.second)); | 392 | 15.6M | } |
llvm::StringMap<llvm::Function*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::Function*>) Line | Count | Source | 390 | 48 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 48 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 48 | } |
llvm::StringMap<bool, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::insert(std::__1::pair<llvm::StringRef, bool>) Line | Count | Source | 390 | 5.09M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 5.09M | return try_emplace(KV.first, std::move(KV.second)); | 392 | 5.09M | } |
llvm::StringMap<bool, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, bool>) Line | Count | Source | 390 | 5.61k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 5.61k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 5.61k | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::cl::Option*>) Line | Count | Source | 390 | 154M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 154M | return try_emplace(KV.first, std::move(KV.second)); | 392 | 154M | } |
llvm::StringMap<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >) Line | Count | Source | 390 | 140k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 140k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 140k | } |
llvm::StringMap<clang::IdentifierInfo*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::insert(std::__1::pair<llvm::StringRef, clang::IdentifierInfo*>) Line | Count | Source | 390 | 363M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 363M | return try_emplace(KV.first, std::move(KV.second)); | 392 | 363M | } |
llvm::StringMap<clang::DirectoryEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::insert(std::__1::pair<llvm::StringRef, clang::DirectoryEntry*>) Line | Count | Source | 390 | 1.77M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 1.77M | return try_emplace(KV.first, std::move(KV.second)); | 392 | 1.77M | } |
llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::insert(std::__1::pair<llvm::StringRef, clang::FileEntry*>) Line | Count | Source | 390 | 2.12M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 2.12M | return try_emplace(KV.first, std::move(KV.second)); | 392 | 2.12M | } |
llvm::StringMap<llvm::GlobalVariable*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::GlobalVariable*>) Line | Count | Source | 390 | 331 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 331 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 331 | } |
llvm::StringMap<clang::GlobalDecl, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::insert(std::__1::pair<llvm::StringRef, clang::GlobalDecl>) Line | Count | Source | 390 | 2.34M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 2.34M | return try_emplace(KV.first, std::move(KV.second)); | 392 | 2.34M | } |
llvm::StringMap<char, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::insert(std::__1::pair<llvm::StringRef, char>) Line | Count | Source | 390 | 145 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 145 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 145 | } |
llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >) Line | Count | Source | 390 | 3.01M | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 3.01M | return try_emplace(KV.first, std::move(KV.second)); | 392 | 3.01M | } |
llvm::StringMap<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>) Line | Count | Source | 390 | 4.46k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 4.46k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 4.46k | } |
llvm::StringMap<std::__1::shared_ptr<clang::ModuleFileExtension>, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, std::__1::shared_ptr<clang::ModuleFileExtension> >) Line | Count | Source | 390 | 27 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 27 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 27 | } |
llvm::StringMap<clang::InMemoryModuleCache::PCM, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, clang::InMemoryModuleCache::PCM>) Line | Count | Source | 390 | 4.25k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 4.25k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 4.25k | } |
llvm::StringMap<unsigned int const*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, unsigned int const*>) Line | Count | Source | 390 | 7.40k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 7.40k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 7.40k | } |
llvm::StringMap<llvm::MachineMemOperand::Flags, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::MachineMemOperand::Flags>) Line | Count | Source | 390 | 6 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 6 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 6 | } |
llvm::StringMap<llvm::TargetRegisterClass const*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::TargetRegisterClass const*>) Line | Count | Source | 390 | 232k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 232k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 232k | } |
llvm::StringMap<llvm::RegisterBank const*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::RegisterBank const*>) Line | Count | Source | 390 | 6.12k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 6.12k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 6.12k | } |
llvm::StringMap<llvm::VRegInfo*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::VRegInfo*>) Line | Count | Source | 390 | 57 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 57 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 57 | } |
llvm::StringMap<llvm::DIE const*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::DIE const*>) Line | Count | Source | 390 | 74 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 74 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 74 | } |
llvm::StringMap<llvm::DwarfStringPoolEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::insert(std::__1::pair<llvm::StringRef, llvm::DwarfStringPoolEntry>) Line | Count | Source | 390 | 419k | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 419k | return try_emplace(KV.first, std::move(KV.second)); | 392 | 419k | } |
llvm::StringMap<clang::Stmt*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, clang::Stmt*>) Line | Count | Source | 390 | 2 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 2 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 2 | } |
StdLibraryFunctionsChecker.cpp:llvm::StringMap<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >) Line | Count | Source | 390 | 286 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 286 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 286 | } |
llvm::StringMap<clang::FrameworkCacheEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::insert(std::__1::pair<llvm::StringRef, clang::FrameworkCacheEntry>) Line | Count | Source | 390 | 38 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 38 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 38 | } |
llvm::StringMap<std::__1::pair<llvm::Type*, llvm::SMLoc>, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, std::__1::pair<llvm::Type*, llvm::SMLoc> >) Line | Count | Source | 390 | 55 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 55 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 55 | } |
llvm::StringMap<llvm::Type*, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, llvm::Type*>) Line | Count | Source | 390 | 91 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 91 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 91 | } |
llvm::StringMap<unsigned int, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::insert(std::__1::pair<llvm::StringRef, unsigned int>) Line | Count | Source | 390 | 17 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 17 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 17 | } |
llvm::StringMap<unsigned long long, llvm::MallocAllocator>::insert(std::__1::pair<llvm::StringRef, unsigned long long>) Line | Count | Source | 390 | 918 | std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { | 391 | 918 | return try_emplace(KV.first, std::move(KV.second)); | 392 | 918 | } |
|
393 | | |
394 | | /// Emplace a new element for the specified key into the map if the key isn't |
395 | | /// already in the map. The bool component of the returned pair is true |
396 | | /// if and only if the insertion takes place, and the iterator component of |
397 | | /// the pair points to the element with key equivalent to the key of the pair. |
398 | | template <typename... ArgsTy> |
399 | 972M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { |
400 | 972M | unsigned BucketNo = LookupBucketFor(Key); |
401 | 972M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; |
402 | 972M | if (Bucket && Bucket != getTombstoneVal()541M ) |
403 | 540M | return std::make_pair(iterator(TheTable + BucketNo, false), |
404 | 540M | false); // Already exists in map. |
405 | 431M | |
406 | 431M | if (Bucket == getTombstoneVal()) |
407 | 1.33M | --NumTombstones; |
408 | 431M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); |
409 | 431M | ++NumItems; |
410 | 431M | assert(NumItems + NumTombstones <= NumBuckets); |
411 | 431M | |
412 | 431M | BucketNo = RehashTable(BucketNo); |
413 | 431M | return std::make_pair(iterator(TheTable + BucketNo, false), true); |
414 | 431M | } std::__1::pair<llvm::StringMapIterator<char>, bool> llvm::StringMap<char, llvm::MallocAllocator>::try_emplace<char>(llvm::StringRef, char&&) Line | Count | Source | 399 | 292M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 292M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 292M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 292M | if (Bucket && Bucket != getTombstoneVal()291M ) | 403 | 291M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 291M | false); // Already exists in map. | 405 | 914k | | 406 | 914k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 914k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 914k | ++NumItems; | 410 | 914k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 914k | | 412 | 914k | BucketNo = RehashTable(BucketNo); | 413 | 914k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 914k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > >, bool> llvm::StringMap<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 89.3k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 89.3k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 89.3k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 89.3k | if (Bucket && Bucket != getTombstoneVal()3.45k ) | 403 | 3.45k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 3.45k | false); // Already exists in map. | 405 | 85.8k | | 406 | 85.8k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 85.8k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 85.8k | ++NumItems; | 410 | 85.8k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 85.8k | | 412 | 85.8k | BucketNo = RehashTable(BucketNo); | 413 | 85.8k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 85.8k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > >, bool> llvm::StringMap<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 137k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 137k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 137k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 137k | if (Bucket && Bucket != getTombstoneVal()51.1k ) | 403 | 51.1k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 51.1k | false); // Already exists in map. | 405 | 85.8k | | 406 | 85.8k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 85.8k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 85.8k | ++NumItems; | 410 | 85.8k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 85.8k | | 412 | 85.8k | BucketNo = RehashTable(BucketNo); | 413 | 85.8k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 85.8k | } |
std::__1::pair<llvm::StringMapIterator<clang::OpenCLOptions::Info>, bool> llvm::StringMap<clang::OpenCLOptions::Info, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 8.91M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 8.91M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 8.91M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 8.91M | if (Bucket && Bucket != getTombstoneVal()4.47M ) | 403 | 4.47M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 4.47M | false); // Already exists in map. | 405 | 4.44M | | 406 | 4.44M | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 4.44M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 4.44M | ++NumItems; | 410 | 4.44M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 4.44M | | 412 | 4.44M | BucketNo = RehashTable(BucketNo); | 413 | 4.44M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 4.44M | } |
std::__1::pair<llvm::StringMapIterator<unsigned int>, bool> llvm::StringMap<unsigned int, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 4.86M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 4.86M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 4.86M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 4.86M | if (Bucket && Bucket != getTombstoneVal()1.71M ) | 403 | 1.71M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1.71M | false); // Already exists in map. | 405 | 3.15M | | 406 | 3.15M | if (Bucket == getTombstoneVal()) | 407 | 57 | --NumTombstones; | 408 | 3.15M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 3.15M | ++NumItems; | 410 | 3.15M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 3.15M | | 412 | 3.15M | BucketNo = RehashTable(BucketNo); | 413 | 3.15M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 3.15M | } |
std::__1::pair<llvm::StringMapIterator<llvm::MCAsmMacro>, bool> llvm::StringMap<llvm::MCAsmMacro, llvm::MallocAllocator>::try_emplace<llvm::MCAsmMacro>(llvm::StringRef, llvm::MCAsmMacro&&) Line | Count | Source | 399 | 293 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 293 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 293 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 293 | if (Bucket && Bucket != getTombstoneVal()2 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 293 | | 406 | 293 | if (Bucket == getTombstoneVal()) | 407 | 2 | --NumTombstones; | 408 | 293 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 293 | ++NumItems; | 410 | 293 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 293 | | 412 | 293 | BucketNo = RehashTable(BucketNo); | 413 | 293 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 293 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 17.2M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 17.2M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 17.2M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 17.2M | if (Bucket && Bucket != getTombstoneVal()17.2M ) | 403 | 17.2M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 17.2M | false); // Already exists in map. | 405 | 9.10k | | 406 | 9.10k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 9.10k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 9.10k | ++NumItems; | 410 | 9.10k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 9.10k | | 412 | 9.10k | BucketNo = RehashTable(BucketNo); | 413 | 9.10k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 9.10k | } |
AArch64AsmParser.cpp:std::__1::pair<llvm::StringMapIterator<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >, bool> llvm::StringMap<std::__1::pair<(anonymous namespace)::RegKind, unsigned int>, llvm::MallocAllocator>::try_emplace<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >(llvm::StringRef, std::__1::pair<(anonymous namespace)::RegKind, unsigned int>&&) Line | Count | Source | 399 | 19 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 19 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 19 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 19 | if (Bucket && Bucket != getTombstoneVal()7 ) | 403 | 2 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 2 | false); // Already exists in map. | 405 | 17 | | 406 | 17 | if (Bucket == getTombstoneVal()) | 407 | 5 | --NumTombstones; | 408 | 17 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 17 | ++NumItems; | 410 | 17 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 17 | | 412 | 17 | BucketNo = RehashTable(BucketNo); | 413 | 17 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 17 | } |
std::__1::pair<llvm::StringMapIterator<int>, bool> llvm::StringMap<int, llvm::MallocAllocator>::try_emplace<int>(llvm::StringRef, int&&) Line | Count | Source | 399 | 2.94k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 2.94k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 2.94k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 2.94k | if (Bucket && Bucket != getTombstoneVal()507 ) | 403 | 507 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 507 | false); // Already exists in map. | 405 | 2.43k | | 406 | 2.43k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 2.43k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 2.43k | ++NumItems; | 410 | 2.43k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 2.43k | | 412 | 2.43k | BucketNo = RehashTable(BucketNo); | 413 | 2.43k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 2.43k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 116k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 116k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 116k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 116k | if (Bucket && Bucket != getTombstoneVal()115k ) | 403 | 115k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 115k | false); // Already exists in map. | 405 | 290 | | 406 | 290 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 290 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 290 | ++NumItems; | 410 | 290 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 290 | | 412 | 290 | BucketNo = RehashTable(BucketNo); | 413 | 290 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 290 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 1.61M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 1.61M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 1.61M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 1.61M | if (Bucket && Bucket != getTombstoneVal()1.60M ) | 403 | 1.60M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1.60M | false); // Already exists in map. | 405 | 3.64k | | 406 | 3.64k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 3.64k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 3.64k | ++NumItems; | 410 | 3.64k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 3.64k | | 412 | 3.64k | BucketNo = RehashTable(BucketNo); | 413 | 3.64k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 3.64k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 1.06M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 1.06M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 1.06M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 1.06M | if (Bucket && Bucket != getTombstoneVal()1.06M ) | 403 | 1.06M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1.06M | false); // Already exists in map. | 405 | 5.27k | | 406 | 5.27k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 5.27k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 5.27k | ++NumItems; | 410 | 5.27k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 5.27k | | 412 | 5.27k | BucketNo = RehashTable(BucketNo); | 413 | 5.27k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 5.27k | } |
std::__1::pair<llvm::StringMapIterator<unsigned int>, bool> llvm::StringMap<unsigned int, llvm::MallocAllocator>::try_emplace<unsigned int>(llvm::StringRef, unsigned int&&) Line | Count | Source | 399 | 34.4M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 34.4M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 34.4M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 34.4M | if (Bucket && Bucket != getTombstoneVal()3.47M ) | 403 | 3.47M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 3.47M | false); // Already exists in map. | 405 | 30.9M | | 406 | 30.9M | if (Bucket == getTombstoneVal()) | 407 | 2 | --NumTombstones; | 408 | 30.9M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 30.9M | ++NumItems; | 410 | 30.9M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 30.9M | | 412 | 30.9M | BucketNo = RehashTable(BucketNo); | 413 | 30.9M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 30.9M | } |
std::__1::pair<llvm::StringMapIterator<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >, bool> llvm::StringMap<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 275 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 275 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 275 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 275 | if (Bucket && Bucket != getTombstoneVal()213 ) | 403 | 213 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 213 | false); // Already exists in map. | 405 | 62 | | 406 | 62 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 62 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 62 | ++NumItems; | 410 | 62 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 62 | | 412 | 62 | BucketNo = RehashTable(BucketNo); | 413 | 62 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 62 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 62.4k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 62.4k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 62.4k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 62.4k | if (Bucket && Bucket != getTombstoneVal()61.4k ) | 403 | 61.4k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 61.4k | false); // Already exists in map. | 405 | 1.01k | | 406 | 1.01k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 1.01k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 1.01k | ++NumItems; | 410 | 1.01k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 1.01k | | 412 | 1.01k | BucketNo = RehashTable(BucketNo); | 413 | 1.01k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 1.01k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 180k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 180k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 180k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 180k | if (Bucket && Bucket != getTombstoneVal()178k ) | 403 | 178k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 178k | false); // Already exists in map. | 405 | 2.20k | | 406 | 2.20k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 2.20k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 2.20k | ++NumItems; | 410 | 2.20k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 2.20k | | 412 | 2.20k | BucketNo = RehashTable(BucketNo); | 413 | 2.20k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 2.20k | } |
std::__1::pair<llvm::StringMapIterator<llvm::AsmToken>, bool> llvm::StringMap<llvm::AsmToken, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 1 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 1 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 1 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 1 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 1 | | 406 | 1 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 1 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 1 | ++NumItems; | 410 | 1 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 1 | | 412 | 1 | BucketNo = RehashTable(BucketNo); | 413 | 1 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 1 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 186k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 186k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 186k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 186k | if (Bucket && Bucket != getTombstoneVal()184k ) | 403 | 184k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 184k | false); // Already exists in map. | 405 | 1.85k | | 406 | 1.85k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 1.85k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 1.85k | ++NumItems; | 410 | 1.85k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 1.85k | | 412 | 1.85k | BucketNo = RehashTable(BucketNo); | 413 | 1.85k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 1.85k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 9.14k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 9.14k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 9.14k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 9.14k | if (Bucket && Bucket != getTombstoneVal()8.94k ) | 403 | 8.94k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 8.94k | false); // Already exists in map. | 405 | 197 | | 406 | 197 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 197 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 197 | ++NumItems; | 410 | 197 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 197 | | 412 | 197 | BucketNo = RehashTable(BucketNo); | 413 | 197 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 197 | } |
std::__1::pair<llvm::StringMapIterator<llvm::Function*>, bool> llvm::StringMap<llvm::Function*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 332 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 332 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 332 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 332 | if (Bucket && Bucket != getTombstoneVal()12 ) | 403 | 12 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 12 | false); // Already exists in map. | 405 | 320 | | 406 | 320 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 320 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 320 | ++NumItems; | 410 | 320 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 320 | | 412 | 320 | BucketNo = RehashTable(BucketNo); | 413 | 320 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 320 | } |
std::__1::pair<llvm::StringMapIterator<llvm::RTLIB::Libcall>, bool> llvm::StringMap<llvm::RTLIB::Libcall, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 4.87k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 4.87k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 4.87k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 4.87k | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 4.87k | | 406 | 4.87k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 4.87k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 4.87k | ++NumItems; | 410 | 4.87k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 4.87k | | 412 | 4.87k | BucketNo = RehashTable(BucketNo); | 413 | 4.87k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 4.87k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 88.5k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 88.5k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 88.5k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 88.5k | if (Bucket && Bucket != getTombstoneVal()88.0k ) | 403 | 88.0k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 88.0k | false); // Already exists in map. | 405 | 540 | | 406 | 540 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 540 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 540 | ++NumItems; | 410 | 540 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 540 | | 412 | 540 | BucketNo = RehashTable(BucketNo); | 413 | 540 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 540 | } |
std::__1::pair<llvm::StringMapIterator<unsigned long long>, bool> llvm::StringMap<unsigned long long, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 633 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 633 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 633 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 633 | if (Bucket && Bucket != getTombstoneVal()27 ) | 403 | 26 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 26 | false); // Already exists in map. | 405 | 607 | | 406 | 607 | if (Bucket == getTombstoneVal()) | 407 | 1 | --NumTombstones; | 408 | 607 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 607 | ++NumItems; | 410 | 607 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 607 | | 412 | 607 | BucketNo = RehashTable(BucketNo); | 413 | 607 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 607 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 4.12M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 4.12M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 4.12M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 4.12M | if (Bucket && Bucket != getTombstoneVal()4.10M ) | 403 | 4.10M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 4.10M | false); // Already exists in map. | 405 | 15.2k | | 406 | 15.2k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 15.2k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 15.2k | ++NumItems; | 410 | 15.2k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 15.2k | | 412 | 15.2k | BucketNo = RehashTable(BucketNo); | 413 | 15.2k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 15.2k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >, bool> llvm::StringMap<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >, llvm::MallocAllocator>::try_emplace<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >(llvm::StringRef, std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> >&&) Line | Count | Source | 399 | 929 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 929 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 929 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 929 | if (Bucket && Bucket != getTombstoneVal()6 ) | 403 | 6 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 6 | false); // Already exists in map. | 405 | 923 | | 406 | 923 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 923 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 923 | ++NumItems; | 410 | 923 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 923 | | 412 | 923 | BucketNo = RehashTable(BucketNo); | 413 | 923 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 923 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 4.42k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 4.42k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 4.42k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 4.42k | if (Bucket && Bucket != getTombstoneVal()3.12k ) | 403 | 3.12k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 3.12k | false); // Already exists in map. | 405 | 1.29k | | 406 | 1.29k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 1.29k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 1.29k | ++NumItems; | 410 | 1.29k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 1.29k | | 412 | 1.29k | BucketNo = RehashTable(BucketNo); | 413 | 1.29k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 1.29k | } |
std::__1::pair<llvm::StringMapIterator<llvm::GCStrategy*>, bool> llvm::StringMap<llvm::GCStrategy*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 26 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 26 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 26 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 26 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 26 | | 406 | 26 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 26 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 26 | ++NumItems; | 410 | 26 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 26 | | 412 | 26 | BucketNo = RehashTable(BucketNo); | 413 | 26 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 26 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 650 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 650 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 650 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 650 | if (Bucket && Bucket != getTombstoneVal()36 ) | 403 | 36 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 36 | false); // Already exists in map. | 405 | 614 | | 406 | 614 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 614 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 614 | ++NumItems; | 410 | 614 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 614 | | 412 | 614 | BucketNo = RehashTable(BucketNo); | 413 | 614 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 614 | } |
std::__1::pair<llvm::StringMapIterator<llvm::ConstantDataSequential*>, bool> llvm::StringMap<llvm::ConstantDataSequential*, llvm::MallocAllocator>::try_emplace<llvm::ConstantDataSequential*>(llvm::StringRef, llvm::ConstantDataSequential*&&) Line | Count | Source | 399 | 973k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 973k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 973k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 973k | if (Bucket && Bucket != getTombstoneVal()480k ) | 403 | 480k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 480k | false); // Already exists in map. | 405 | 492k | | 406 | 492k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 492k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 492k | ++NumItems; | 410 | 492k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 492k | | 412 | 492k | BucketNo = RehashTable(BucketNo); | 413 | 492k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 492k | } |
std::__1::pair<llvm::StringMapIterator<unsigned char>, bool> llvm::StringMap<unsigned char, llvm::MallocAllocator>::try_emplace<unsigned char>(llvm::StringRef, unsigned char&&) Line | Count | Source | 399 | 244k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 244k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 244k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 244k | if (Bucket && Bucket != getTombstoneVal()10.3k ) | 403 | 10.3k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 10.3k | false); // Already exists in map. | 405 | 234k | | 406 | 234k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 234k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 234k | ++NumItems; | 410 | 234k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 234k | | 412 | 234k | BucketNo = RehashTable(BucketNo); | 413 | 234k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 234k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::pair<unsigned int, unsigned int> >, bool> llvm::StringMap<std::__1::pair<unsigned int, unsigned int>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 176 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 176 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 176 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 176 | if (Bucket && Bucket != getTombstoneVal()21 ) | 403 | 21 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 21 | false); // Already exists in map. | 405 | 155 | | 406 | 155 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 155 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 155 | ++NumItems; | 410 | 155 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 155 | | 412 | 155 | BucketNo = RehashTable(BucketNo); | 413 | 155 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 155 | } |
std::__1::pair<llvm::StringMapIterator<llvm::MDString>, bool> llvm::StringMap<llvm::MDString, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 717k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 717k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 717k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 717k | if (Bucket && Bucket != getTombstoneVal()277k ) | 403 | 277k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 277k | false); // Already exists in map. | 405 | 439k | | 406 | 439k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 439k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 439k | ++NumItems; | 410 | 439k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 439k | | 412 | 439k | BucketNo = RehashTable(BucketNo); | 413 | 439k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 439k | } |
std::__1::pair<llvm::StringMapIterator<llvm::NamedMDNode*>, bool> llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 87.8k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 87.8k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 87.8k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 87.8k | if (Bucket && Bucket != getTombstoneVal()29.4k ) | 403 | 28.1k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 28.1k | false); // Already exists in map. | 405 | 59.7k | | 406 | 59.7k | if (Bucket == getTombstoneVal()) | 407 | 1.27k | --NumTombstones; | 408 | 59.7k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 59.7k | ++NumItems; | 410 | 59.7k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 59.7k | | 412 | 59.7k | BucketNo = RehashTable(BucketNo); | 413 | 59.7k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 59.7k | } |
std::__1::pair<llvm::StringMapIterator<llvm::Comdat>, bool> llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::try_emplace<llvm::Comdat>(llvm::StringRef, llvm::Comdat&&) Line | Count | Source | 399 | 32.3k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 32.3k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 32.3k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 32.3k | if (Bucket && Bucket != getTombstoneVal()170 ) | 403 | 168 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 168 | false); // Already exists in map. | 405 | 32.2k | | 406 | 32.2k | if (Bucket == getTombstoneVal()) | 407 | 2 | --NumTombstones; | 408 | 32.2k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 32.2k | ++NumItems; | 410 | 32.2k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 32.2k | | 412 | 32.2k | BucketNo = RehashTable(BucketNo); | 413 | 32.2k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 32.2k | } |
std::__1::pair<llvm::StringMapIterator<llvm::PassInfo const*>, bool> llvm::StringMap<llvm::PassInfo const*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 32.8M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 32.8M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 32.8M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 32.8M | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 32.8M | | 406 | 32.8M | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 32.8M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 32.8M | ++NumItems; | 410 | 32.8M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 32.8M | | 412 | 32.8M | BucketNo = RehashTable(BucketNo); | 413 | 32.8M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 32.8M | } |
std::__1::pair<llvm::StringMapIterator<llvm::StructType*>, bool> llvm::StringMap<llvm::StructType*, llvm::MallocAllocator>::try_emplace<llvm::StructType*>(llvm::StringRef, llvm::StructType*&&) Line | Count | Source | 399 | 273k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 273k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 273k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 273k | if (Bucket && Bucket != getTombstoneVal()28.3k ) | 403 | 28.2k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 28.2k | false); // Already exists in map. | 405 | 245k | | 406 | 245k | if (Bucket == getTombstoneVal()) | 407 | 18 | --NumTombstones; | 408 | 245k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 245k | ++NumItems; | 410 | 245k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 245k | | 412 | 245k | BucketNo = RehashTable(BucketNo); | 413 | 245k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 245k | } |
std::__1::pair<llvm::StringMapIterator<llvm::Value*>, bool> llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::try_emplace<llvm::Value*>(llvm::StringRef, llvm::Value*&&) Line | Count | Source | 399 | 15.6M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 15.6M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 15.6M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 15.6M | if (Bucket && Bucket != getTombstoneVal()2.36M ) | 403 | 1.04M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1.04M | false); // Already exists in map. | 405 | 14.6M | | 406 | 14.6M | if (Bucket == getTombstoneVal()) | 407 | 1.32M | --NumTombstones; | 408 | 14.6M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 14.6M | ++NumItems; | 410 | 14.6M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 14.6M | | 412 | 14.6M | BucketNo = RehashTable(BucketNo); | 413 | 14.6M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 14.6M | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >, bool> llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 1.17k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 1.17k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 1.17k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 1.17k | if (Bucket && Bucket != getTombstoneVal()520 ) | 403 | 520 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 520 | false); // Already exists in map. | 405 | 657 | | 406 | 657 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 657 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 657 | ++NumItems; | 410 | 657 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 657 | | 412 | 657 | BucketNo = RehashTable(BucketNo); | 413 | 657 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 657 | } |
std::__1::pair<llvm::StringMapIterator<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> >, bool> llvm::StringMap<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 1.07k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 1.07k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 1.07k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 1.07k | if (Bucket && Bucket != getTombstoneVal()552 ) | 403 | 552 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 552 | false); // Already exists in map. | 405 | 521 | | 406 | 521 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 521 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 521 | ++NumItems; | 410 | 521 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 521 | | 412 | 521 | BucketNo = RehashTable(BucketNo); | 413 | 521 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 521 | } |
std::__1::pair<llvm::StringMapIterator<llvm::Function*>, bool> llvm::StringMap<llvm::Function*, llvm::MallocAllocator>::try_emplace<llvm::Function*>(llvm::StringRef, llvm::Function*&&) Line | Count | Source | 399 | 48 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 48 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 48 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 48 | if (Bucket && Bucket != getTombstoneVal()22 ) | 403 | 22 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 22 | false); // Already exists in map. | 405 | 26 | | 406 | 26 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 26 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 26 | ++NumItems; | 410 | 26 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 26 | | 412 | 26 | BucketNo = RehashTable(BucketNo); | 413 | 26 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 26 | } |
std::__1::pair<llvm::StringMapIterator<bool>, bool> llvm::StringMap<bool, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 3.12M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 3.12M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 3.12M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 3.12M | if (Bucket && Bucket != getTombstoneVal()1.95M ) | 403 | 1.95M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1.95M | false); // Already exists in map. | 405 | 1.16M | | 406 | 1.16M | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 1.16M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 1.16M | ++NumItems; | 410 | 1.16M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 1.16M | | 412 | 1.16M | BucketNo = RehashTable(BucketNo); | 413 | 1.16M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 1.16M | } |
GCOVProfiling.cpp:std::__1::pair<llvm::StringMapIterator<(anonymous namespace)::GCOVLines>, bool> llvm::StringMap<(anonymous namespace)::GCOVLines, llvm::MallocAllocator>::try_emplace<llvm::StringRef&, llvm::raw_ostream*&>(llvm::StringRef, llvm::StringRef&&&, llvm::raw_ostream*&&&) Line | Count | Source | 399 | 110 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 110 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 110 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 110 | if (Bucket && Bucket != getTombstoneVal()26 ) | 403 | 26 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 26 | false); // Already exists in map. | 405 | 84 | | 406 | 84 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 84 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 84 | ++NumItems; | 410 | 84 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 84 | | 412 | 84 | BucketNo = RehashTable(BucketNo); | 413 | 84 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 84 | } |
std::__1::pair<llvm::StringMapIterator<llvm::MCSymbol*>, bool> llvm::StringMap<llvm::MCSymbol*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 8.20M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 8.20M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 8.20M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 8.20M | if (Bucket && Bucket != getTombstoneVal()3.53M ) | 403 | 3.53M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 3.53M | false); // Already exists in map. | 405 | 4.66M | | 406 | 4.66M | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 4.66M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 4.66M | ++NumItems; | 410 | 4.66M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 4.66M | | 412 | 4.66M | BucketNo = RehashTable(BucketNo); | 413 | 4.66M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 4.66M | } |
std::__1::pair<llvm::StringMapIterator<bool>, bool> llvm::StringMap<bool, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::try_emplace<bool>(llvm::StringRef, bool&&) Line | Count | Source | 399 | 5.09M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 5.09M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 5.09M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 5.09M | if (Bucket && Bucket != getTombstoneVal()14.2k ) | 403 | 14.2k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 14.2k | false); // Already exists in map. | 405 | 5.07M | | 406 | 5.07M | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 5.07M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 5.07M | ++NumItems; | 410 | 5.07M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 5.07M | | 412 | 5.07M | BucketNo = RehashTable(BucketNo); | 413 | 5.07M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 5.07M | } |
std::__1::pair<llvm::StringMapIterator<llvm::MCSectionMachO*>, bool> llvm::StringMap<llvm::MCSectionMachO*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 899k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 899k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 899k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 899k | if (Bucket && Bucket != getTombstoneVal()8.70k ) | 403 | 8.70k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 8.70k | false); // Already exists in map. | 405 | 890k | | 406 | 890k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 890k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 890k | ++NumItems; | 410 | 890k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 890k | | 412 | 890k | BucketNo = RehashTable(BucketNo); | 413 | 890k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 890k | } |
std::__1::pair<llvm::StringMapIterator<bool>, bool> llvm::StringMap<bool, llvm::MallocAllocator>::try_emplace<bool>(llvm::StringRef, bool&&) Line | Count | Source | 399 | 5.61k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 5.61k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 5.61k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 5.61k | if (Bucket && Bucket != getTombstoneVal()677 ) | 403 | 677 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 677 | false); // Already exists in map. | 405 | 4.93k | | 406 | 4.93k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 4.93k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 4.93k | ++NumItems; | 410 | 4.93k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 4.93k | | 412 | 4.93k | BucketNo = RehashTable(BucketNo); | 413 | 4.93k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 4.93k | } |
AsmParser.cpp:std::__1::pair<llvm::StringMapIterator<(anonymous namespace)::AsmParser::DirectiveKind>, bool> llvm::StringMap<(anonymous namespace)::AsmParser::DirectiveKind, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 2.99M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 2.99M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 2.99M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 2.99M | if (Bucket && Bucket != getTombstoneVal()31.8k ) | 403 | 31.8k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 31.8k | false); // Already exists in map. | 405 | 2.96M | | 406 | 2.96M | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 2.96M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 2.96M | ++NumItems; | 410 | 2.96M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 2.96M | | 412 | 2.96M | BucketNo = RehashTable(BucketNo); | 413 | 2.96M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 2.96M | } |
std::__1::pair<llvm::StringMapIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >, bool> llvm::StringMap<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 705k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 705k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 705k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 705k | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 705k | | 406 | 705k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 705k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 705k | ++NumItems; | 410 | 705k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 705k | | 412 | 705k | BucketNo = RehashTable(BucketNo); | 413 | 705k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 705k | } |
std::__1::pair<llvm::StringMapIterator<llvm::cl::Option*>, bool> llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::try_emplace<llvm::cl::Option*>(llvm::StringRef, llvm::cl::Option*&&) Line | Count | Source | 399 | 154M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 154M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 154M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 154M | if (Bucket && Bucket != getTombstoneVal()47 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 154M | | 406 | 154M | if (Bucket == getTombstoneVal()) | 407 | 47 | --NumTombstones; | 408 | 154M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 154M | ++NumItems; | 410 | 154M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 154M | | 412 | 154M | BucketNo = RehashTable(BucketNo); | 413 | 154M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 154M | } |
std::__1::pair<llvm::StringMapIterator<unsigned long>, bool> llvm::StringMap<unsigned long, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 264k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 264k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 264k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 264k | if (Bucket && Bucket != getTombstoneVal()226k ) | 403 | 226k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 226k | false); // Already exists in map. | 405 | 38.4k | | 406 | 38.4k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 38.4k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 38.4k | ++NumItems; | 410 | 38.4k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 38.4k | | 412 | 38.4k | BucketNo = RehashTable(BucketNo); | 413 | 38.4k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 38.4k | } |
std::__1::pair<llvm::StringMapIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >, bool> llvm::StringMap<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 542 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 542 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 542 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 542 | if (Bucket && Bucket != getTombstoneVal()238 ) | 403 | 238 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 238 | false); // Already exists in map. | 405 | 304 | | 406 | 304 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 304 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 304 | ++NumItems; | 410 | 304 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 304 | | 412 | 304 | BucketNo = RehashTable(BucketNo); | 413 | 304 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 304 | } |
std::__1::pair<llvm::StringMapIterator<llvm::SpecialCaseList::Matcher>, bool> llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 542 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 542 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 542 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 542 | if (Bucket && Bucket != getTombstoneVal()213 ) | 403 | 213 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 213 | false); // Already exists in map. | 405 | 329 | | 406 | 329 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 329 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 329 | ++NumItems; | 410 | 329 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 329 | | 412 | 329 | BucketNo = RehashTable(BucketNo); | 413 | 329 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 329 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >, bool> llvm::StringMap<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 71 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 71 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 71 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 71 | if (Bucket && Bucket != getTombstoneVal()61 ) | 403 | 61 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 61 | false); // Already exists in map. | 405 | 10 | | 406 | 10 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 10 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 10 | ++NumItems; | 410 | 10 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 10 | | 412 | 10 | BucketNo = RehashTable(BucketNo); | 413 | 10 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 10 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >, bool> llvm::StringMap<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 9 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 9 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 9 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 9 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 9 | | 406 | 9 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 9 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 9 | ++NumItems; | 410 | 9 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 9 | | 412 | 9 | BucketNo = RehashTable(BucketNo); | 413 | 9 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 9 | } |
std::__1::pair<llvm::StringMapIterator<llvm::Timer>, bool> llvm::StringMap<llvm::Timer, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 9 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 9 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 9 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 9 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 9 | | 406 | 9 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 9 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 9 | ++NumItems; | 410 | 9 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 9 | | 412 | 9 | BucketNo = RehashTable(BucketNo); | 413 | 9 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 9 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >, llvm::MallocAllocator>::try_emplace<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >(llvm::StringRef, std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> >&&) Line | Count | Source | 399 | 140k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 140k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 140k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 140k | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 140k | | 406 | 140k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 140k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 140k | ++NumItems; | 410 | 140k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 140k | | 412 | 140k | BucketNo = RehashTable(BucketNo); | 413 | 140k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 140k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 745k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 745k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 745k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 745k | if (Bucket && Bucket != getTombstoneVal()227k ) | 403 | 227k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 227k | false); // Already exists in map. | 405 | 517k | | 406 | 517k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 517k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 517k | ++NumItems; | 410 | 517k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 517k | | 412 | 517k | BucketNo = RehashTable(BucketNo); | 413 | 517k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 517k | } |
std::__1::pair<llvm::StringMapIterator<void*>, bool> llvm::StringMap<void*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 3 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 3 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 3 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 3 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 3 | | 406 | 3 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 3 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 3 | ++NumItems; | 410 | 3 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 3 | | 412 | 3 | BucketNo = RehashTable(BucketNo); | 413 | 3 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 3 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >, bool> llvm::StringMap<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 128 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 128 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 128 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 128 | if (Bucket && Bucket != getTombstoneVal()92 ) | 403 | 92 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 92 | false); // Already exists in map. | 405 | 36 | | 406 | 36 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 36 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 36 | ++NumItems; | 410 | 36 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 36 | | 412 | 36 | BucketNo = RehashTable(BucketNo); | 413 | 36 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 36 | } |
std::__1::pair<llvm::StringMapIterator<clang::IdentifierInfo*>, bool> llvm::StringMap<clang::IdentifierInfo*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<clang::IdentifierInfo*>(llvm::StringRef, clang::IdentifierInfo*&&) Line | Count | Source | 399 | 363M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 363M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 363M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 363M | if (Bucket && Bucket != getTombstoneVal()203M ) | 403 | 203M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 203M | false); // Already exists in map. | 405 | 160M | | 406 | 160M | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 160M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 160M | ++NumItems; | 410 | 160M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 160M | | 412 | 160M | BucketNo = RehashTable(BucketNo); | 413 | 160M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 160M | } |
std::__1::pair<llvm::StringMapIterator<clang::DirectoryEntry*>, bool> llvm::StringMap<clang::DirectoryEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<clang::DirectoryEntry*>(llvm::StringRef, clang::DirectoryEntry*&&) Line | Count | Source | 399 | 1.77M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 1.77M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 1.77M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 1.77M | if (Bucket && Bucket != getTombstoneVal()1.36M ) | 403 | 1.36M | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1.36M | false); // Already exists in map. | 405 | 411k | | 406 | 411k | if (Bucket == getTombstoneVal()) | 407 | 552 | --NumTombstones; | 408 | 411k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 411k | ++NumItems; | 410 | 411k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 411k | | 412 | 411k | BucketNo = RehashTable(BucketNo); | 413 | 411k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 411k | } |
std::__1::pair<llvm::StringMapIterator<clang::FileEntry*>, bool> llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<clang::FileEntry*>(llvm::StringRef, clang::FileEntry*&&) Line | Count | Source | 399 | 2.12M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 2.12M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 2.12M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 2.12M | if (Bucket && Bucket != getTombstoneVal()723k ) | 403 | 722k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 722k | false); // Already exists in map. | 405 | 1.39M | | 406 | 1.39M | if (Bucket == getTombstoneVal()) | 407 | 1.11k | --NumTombstones; | 408 | 1.39M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 1.39M | ++NumItems; | 410 | 1.39M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 1.39M | | 412 | 1.39M | BucketNo = RehashTable(BucketNo); | 413 | 1.39M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 1.39M | } |
std::__1::pair<llvm::StringMapIterator<llvm::vfs::Status>, bool> llvm::StringMap<llvm::vfs::Status, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 35 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 35 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 35 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 35 | if (Bucket && Bucket != getTombstoneVal()16 ) | 403 | 16 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 16 | false); // Already exists in map. | 405 | 19 | | 406 | 19 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 19 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 19 | ++NumItems; | 410 | 19 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 19 | | 412 | 19 | BucketNo = RehashTable(BucketNo); | 413 | 19 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 19 | } |
std::__1::pair<llvm::StringMapIterator<unsigned int>, bool> llvm::StringMap<unsigned int, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<unsigned long>(llvm::StringRef, unsigned long&&) Line | Count | Source | 399 | 164k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 164k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 164k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 164k | if (Bucket && Bucket != getTombstoneVal()46.7k ) | 403 | 46.7k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 46.7k | false); // Already exists in map. | 405 | 117k | | 406 | 117k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 117k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 117k | ++NumItems; | 410 | 117k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 117k | | 412 | 117k | BucketNo = RehashTable(BucketNo); | 413 | 117k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 117k | } |
std::__1::pair<llvm::StringMapIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >, bool> llvm::StringMap<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 1.42k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 1.42k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 1.42k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 1.42k | if (Bucket && Bucket != getTombstoneVal()865 ) | 403 | 865 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 865 | false); // Already exists in map. | 405 | 557 | | 406 | 557 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 557 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 557 | ++NumItems; | 410 | 557 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 557 | | 412 | 557 | BucketNo = RehashTable(BucketNo); | 413 | 557 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 557 | } |
std::__1::pair<llvm::StringMapIterator<llvm::Constant*>, bool> llvm::StringMap<llvm::Constant*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 94 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 94 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 94 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 94 | if (Bucket && Bucket != getTombstoneVal()47 ) | 403 | 47 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 47 | false); // Already exists in map. | 405 | 47 | | 406 | 47 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 47 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 47 | ++NumItems; | 410 | 47 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 47 | | 412 | 47 | BucketNo = RehashTable(BucketNo); | 413 | 47 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 47 | } |
std::__1::pair<llvm::StringMapIterator<llvm::GlobalVariable*>, bool> llvm::StringMap<llvm::GlobalVariable*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 3.99k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 3.99k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 3.99k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 3.99k | if (Bucket && Bucket != getTombstoneVal()1.88k ) | 403 | 1.88k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1.88k | false); // Already exists in map. | 405 | 2.11k | | 406 | 2.11k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 2.11k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 2.11k | ++NumItems; | 410 | 2.11k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 2.11k | | 412 | 2.11k | BucketNo = RehashTable(BucketNo); | 413 | 2.11k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 2.11k | } |
std::__1::pair<llvm::StringMapIterator<llvm::GlobalVariable*>, bool> llvm::StringMap<llvm::GlobalVariable*, llvm::MallocAllocator>::try_emplace<llvm::GlobalVariable*>(llvm::StringRef, llvm::GlobalVariable*&&) Line | Count | Source | 399 | 331 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 331 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 331 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 331 | if (Bucket && Bucket != getTombstoneVal()18 ) | 403 | 18 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 18 | false); // Already exists in map. | 405 | 313 | | 406 | 313 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 313 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 313 | ++NumItems; | 410 | 313 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 313 | | 412 | 313 | BucketNo = RehashTable(BucketNo); | 413 | 313 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 313 | } |
std::__1::pair<llvm::StringMapIterator<llvm::AssertingVH<llvm::Constant> >, bool> llvm::StringMap<llvm::AssertingVH<llvm::Constant>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<std::nullptr_t>(llvm::StringRef, std::nullptr_t&&) Line | Count | Source | 399 | 646 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 646 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 646 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 646 | if (Bucket && Bucket != getTombstoneVal()417 ) | 403 | 417 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 417 | false); // Already exists in map. | 405 | 229 | | 406 | 229 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 229 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 229 | ++NumItems; | 410 | 229 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 229 | | 412 | 229 | BucketNo = RehashTable(BucketNo); | 413 | 229 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 229 | } |
std::__1::pair<llvm::StringMapIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >, bool> llvm::StringMap<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 7.87k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 7.87k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 7.87k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 7.87k | if (Bucket && Bucket != getTombstoneVal()4.35k ) | 403 | 4.35k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 4.35k | false); // Already exists in map. | 405 | 3.51k | | 406 | 3.51k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 3.51k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 3.51k | ++NumItems; | 410 | 3.51k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 3.51k | | 412 | 3.51k | BucketNo = RehashTable(BucketNo); | 413 | 3.51k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 3.51k | } |
std::__1::pair<llvm::StringMapIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>, bool> llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::try_emplace<unsigned int&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&>(llvm::StringRef, unsigned int&&&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&&&) Line | Count | Source | 399 | 66 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 66 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 66 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 66 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 66 | | 406 | 66 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 66 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 66 | ++NumItems; | 410 | 66 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 66 | | 412 | 66 | BucketNo = RehashTable(BucketNo); | 413 | 66 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 66 | } |
std::__1::pair<llvm::StringMapIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>, bool> llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 164 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 164 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 164 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 164 | if (Bucket && Bucket != getTombstoneVal()) | 403 | 164 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 164 | false); // Already exists in map. | 405 | 0 | | 406 | 0 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 0 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 0 | ++NumItems; | 410 | 0 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 0 |
| 412 | 0 | BucketNo = RehashTable(BucketNo); | 413 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 0 | } |
std::__1::pair<llvm::StringMapIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>, bool> llvm::StringMap<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar, llvm::MallocAllocator>::try_emplace<unsigned int&, llvm::Constant*&, clang::CharUnits&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&, llvm::GlobalValue::LinkageTypes&>(llvm::StringRef, unsigned int&&&, llvm::Constant*&&&, clang::CharUnits&&&, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OMPTargetGlobalVarEntryKind&&&, llvm::GlobalValue::LinkageTypes&&&) Line | Count | Source | 399 | 80 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 80 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 80 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 80 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 80 | | 406 | 80 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 80 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 80 | ++NumItems; | 410 | 80 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 80 | | 412 | 80 | BucketNo = RehashTable(BucketNo); | 413 | 80 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 80 | } |
std::__1::pair<llvm::StringMapIterator<llvm::WeakTrackingVH>, bool> llvm::StringMap<llvm::WeakTrackingVH, llvm::MallocAllocator>::try_emplace<llvm::Constant*&>(llvm::StringRef, llvm::Constant*&&&) Line | Count | Source | 399 | 19 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 19 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 19 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 19 | if (Bucket && Bucket != getTombstoneVal()8 ) | 403 | 8 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 8 | false); // Already exists in map. | 405 | 11 | | 406 | 11 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 11 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 11 | ++NumItems; | 410 | 11 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 11 | | 412 | 11 | BucketNo = RehashTable(BucketNo); | 413 | 11 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 11 | } |
std::__1::pair<llvm::StringMapIterator<llvm::TrackingVH<llvm::Constant> >, bool> llvm::StringMap<llvm::TrackingVH<llvm::Constant>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 139 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 139 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 139 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 139 | if (Bucket && Bucket != getTombstoneVal()12 ) | 403 | 12 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 12 | false); // Already exists in map. | 405 | 127 | | 406 | 127 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 127 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 127 | ++NumItems; | 410 | 127 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 127 | | 412 | 127 | BucketNo = RehashTable(BucketNo); | 413 | 127 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 127 | } |
std::__1::pair<llvm::StringMapIterator<clang::GlobalDecl>, bool> llvm::StringMap<clang::GlobalDecl, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<clang::GlobalDecl>(llvm::StringRef, clang::GlobalDecl&&) Line | Count | Source | 399 | 2.34M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 2.34M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 2.34M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 2.34M | if (Bucket && Bucket != getTombstoneVal()116 ) | 403 | 109 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 109 | false); // Already exists in map. | 405 | 2.34M | | 406 | 2.34M | if (Bucket == getTombstoneVal()) | 407 | 7 | --NumTombstones; | 408 | 2.34M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 2.34M | ++NumItems; | 410 | 2.34M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 2.34M | | 412 | 2.34M | BucketNo = RehashTable(BucketNo); | 413 | 2.34M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 2.34M | } |
std::__1::pair<llvm::StringMapIterator<clang::ASTContext::SectionInfo>, bool> llvm::StringMap<clang::ASTContext::SectionInfo, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 5.92k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 5.92k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 5.92k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 5.92k | if (Bucket && Bucket != getTombstoneVal()5.73k ) | 403 | 5.73k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 5.73k | false); // Already exists in map. | 405 | 194 | | 406 | 194 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 194 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 194 | ++NumItems; | 410 | 194 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 194 | | 412 | 194 | BucketNo = RehashTable(BucketNo); | 413 | 194 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 194 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, bool> llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 14 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 14 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 14 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 14 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 14 | | 406 | 14 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 14 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 14 | ++NumItems; | 410 | 14 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 14 | | 412 | 14 | BucketNo = RehashTable(BucketNo); | 413 | 14 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 14 | } |
std::__1::pair<llvm::StringMapIterator<clang::FrameworkCacheEntry>, bool> llvm::StringMap<clang::FrameworkCacheEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 10.1k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 10.1k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 10.1k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 10.1k | if (Bucket && Bucket != getTombstoneVal()9.77k ) | 403 | 9.77k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 9.77k | false); // Already exists in map. | 405 | 403 | | 406 | 403 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 403 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 403 | ++NumItems; | 410 | 403 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 403 | | 412 | 403 | BucketNo = RehashTable(BucketNo); | 413 | 403 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 403 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > >, bool> llvm::StringMap<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 53.6k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 53.6k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 53.6k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 53.6k | if (Bucket && Bucket != getTombstoneVal()21.9k ) | 403 | 21.9k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 21.9k | false); // Already exists in map. | 405 | 31.7k | | 406 | 31.7k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 31.7k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 31.7k | ++NumItems; | 410 | 31.7k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 31.7k | | 412 | 31.7k | BucketNo = RehashTable(BucketNo); | 413 | 31.7k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 31.7k | } |
std::__1::pair<llvm::StringMapIterator<char const*>, bool> llvm::StringMap<char const*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 105 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 105 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 105 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 105 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 105 | | 406 | 105 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 105 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 105 | ++NumItems; | 410 | 105 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 105 | | 412 | 105 | BucketNo = RehashTable(BucketNo); | 413 | 105 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 105 | } |
std::__1::pair<llvm::StringMapIterator<int>, bool> llvm::StringMap<int, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 797k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 797k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 797k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 797k | if (Bucket && Bucket != getTombstoneVal()9.16k ) | 403 | 9.16k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 9.16k | false); // Already exists in map. | 405 | 787k | | 406 | 787k | if (Bucket == getTombstoneVal()) | 407 | 1 | --NumTombstones; | 408 | 787k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 787k | ++NumItems; | 410 | 787k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 787k | | 412 | 787k | BucketNo = RehashTable(BucketNo); | 413 | 787k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 787k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, bool> llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 2.28k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 2.28k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 2.28k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 2.28k | if (Bucket && Bucket != getTombstoneVal()34 ) | 403 | 34 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 34 | false); // Already exists in map. | 405 | 2.24k | | 406 | 2.24k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 2.24k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 2.24k | ++NumItems; | 410 | 2.24k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 2.24k | | 412 | 2.24k | BucketNo = RehashTable(BucketNo); | 413 | 2.24k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 2.24k | } |
std::__1::pair<llvm::StringMapIterator<char>, bool> llvm::StringMap<char, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<char>(llvm::StringRef, char&&) Line | Count | Source | 399 | 145 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 145 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 145 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 145 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 145 | | 406 | 145 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 145 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 145 | ++NumItems; | 410 | 145 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 145 | | 412 | 145 | BucketNo = RehashTable(BucketNo); | 413 | 145 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 145 | } |
std::__1::pair<llvm::StringMapIterator<clang::SourceLocation>, bool> llvm::StringMap<clang::SourceLocation, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 15 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 15 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 15 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 15 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 15 | | 406 | 15 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 15 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 15 | ++NumItems; | 410 | 15 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 15 | | 412 | 15 | BucketNo = RehashTable(BucketNo); | 413 | 15 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 15 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, bool> llvm::StringMap<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, llvm::MallocAllocator>::try_emplace<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >(llvm::StringRef, std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >&&) Line | Count | Source | 399 | 3.01M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 3.01M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 3.01M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 3.01M | if (Bucket && Bucket != getTombstoneVal()685 ) | 403 | 685 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 685 | false); // Already exists in map. | 405 | 3.01M | | 406 | 3.01M | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 3.01M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 3.01M | ++NumItems; | 410 | 3.01M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 3.01M | | 412 | 3.01M | BucketNo = RehashTable(BucketNo); | 413 | 3.01M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 3.01M | } |
std::__1::pair<llvm::StringMapIterator<clang::LayoutOverrideSource::Layout>, bool> llvm::StringMap<clang::LayoutOverrideSource::Layout, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 39 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 39 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 39 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 39 | if (Bucket && Bucket != getTombstoneVal()2 ) | 403 | 2 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 2 | false); // Already exists in map. | 405 | 37 | | 406 | 37 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 37 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 37 | ++NumItems; | 410 | 37 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 37 | | 412 | 37 | BucketNo = RehashTable(BucketNo); | 413 | 37 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 37 | } |
std::__1::pair<llvm::StringMapIterator<clang::PrecompiledPreamble::PreambleFileHash>, bool> llvm::StringMap<clang::PrecompiledPreamble::PreambleFileHash, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 157 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 157 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 157 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 157 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 157 | | 406 | 157 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 157 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 157 | ++NumItems; | 410 | 157 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 157 | | 412 | 157 | BucketNo = RehashTable(BucketNo); | 413 | 157 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 157 | } |
std::__1::pair<llvm::StringMapIterator<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>, bool> llvm::StringMap<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker, llvm::MallocAllocator>::try_emplace<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>(llvm::StringRef, clang::VerifyDiagnosticConsumer::MarkerTracker::Marker&&) Line | Count | Source | 399 | 4.46k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 4.46k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 4.46k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 4.46k | if (Bucket && Bucket != getTombstoneVal()3.62k ) | 403 | 3.62k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 3.62k | false); // Already exists in map. | 405 | 842 | | 406 | 842 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 842 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 842 | ++NumItems; | 410 | 842 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 842 | | 412 | 842 | BucketNo = RehashTable(BucketNo); | 413 | 842 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 842 | } |
VerifyDiagnosticConsumer.cpp:std::__1::pair<llvm::StringMapIterator<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >, bool> llvm::StringMap<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 11 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 11 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 11 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 11 | if (Bucket && Bucket != getTombstoneVal()1 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 11 | | 406 | 11 | if (Bucket == getTombstoneVal()) | 407 | 1 | --NumTombstones; | 408 | 11 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 11 | ++NumItems; | 410 | 11 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 11 | | 412 | 11 | BucketNo = RehashTable(BucketNo); | 413 | 11 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 11 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::pair<llvm::StringRef, bool> >, bool> llvm::StringMap<std::__1::pair<llvm::StringRef, bool>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 5.86k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 5.86k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 5.86k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 5.86k | if (Bucket && Bucket != getTombstoneVal()1.90k ) | 403 | 1.90k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1.90k | false); // Already exists in map. | 405 | 3.95k | | 406 | 3.95k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 3.95k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 3.95k | ++NumItems; | 410 | 3.95k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 3.95k | | 412 | 3.95k | BucketNo = RehashTable(BucketNo); | 413 | 3.95k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 3.95k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::shared_ptr<clang::ModuleFileExtension> >, bool> llvm::StringMap<std::__1::shared_ptr<clang::ModuleFileExtension>, llvm::MallocAllocator>::try_emplace<std::__1::shared_ptr<clang::ModuleFileExtension> >(llvm::StringRef, std::__1::shared_ptr<clang::ModuleFileExtension>&&) Line | Count | Source | 399 | 27 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 27 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 27 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 27 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 27 | | 406 | 27 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 27 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 27 | ++NumItems; | 410 | 27 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 27 | | 412 | 27 | BucketNo = RehashTable(BucketNo); | 413 | 27 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 27 | } |
std::__1::pair<llvm::StringMapIterator<llvm::SmallVector<unsigned int, 2u> >, bool> llvm::StringMap<llvm::SmallVector<unsigned int, 2u>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 107k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 107k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 107k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 107k | if (Bucket && Bucket != getTombstoneVal()17.1k ) | 403 | 17.1k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 17.1k | false); // Already exists in map. | 405 | 89.9k | | 406 | 89.9k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 89.9k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 89.9k | ++NumItems; | 410 | 89.9k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 89.9k | | 412 | 89.9k | BucketNo = RehashTable(BucketNo); | 413 | 89.9k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 89.9k | } |
std::__1::pair<llvm::StringMapIterator<clang::InMemoryModuleCache::PCM>, bool> llvm::StringMap<clang::InMemoryModuleCache::PCM, llvm::MallocAllocator>::try_emplace<clang::InMemoryModuleCache::PCM>(llvm::StringRef, clang::InMemoryModuleCache::PCM&&) Line | Count | Source | 399 | 4.25k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 4.25k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 4.25k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 4.25k | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 4.25k | | 406 | 4.25k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 4.25k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 4.25k | ++NumItems; | 410 | 4.25k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 4.25k | | 412 | 4.25k | BucketNo = RehashTable(BucketNo); | 413 | 4.25k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 4.25k | } |
std::__1::pair<llvm::StringMapIterator<clang::InMemoryModuleCache::PCM>, bool> llvm::StringMap<clang::InMemoryModuleCache::PCM, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 1.32k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 1.32k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 1.32k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 1.32k | if (Bucket && Bucket != getTombstoneVal()54 ) | 403 | 54 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 54 | false); // Already exists in map. | 405 | 1.27k | | 406 | 1.27k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 1.27k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 1.27k | ++NumItems; | 410 | 1.27k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 1.27k | | 412 | 1.27k | BucketNo = RehashTable(BucketNo); | 413 | 1.27k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 1.27k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > >, bool> llvm::StringMap<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 85 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 85 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 85 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 85 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 85 | | 406 | 85 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 85 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 85 | ++NumItems; | 410 | 85 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 85 | | 412 | 85 | BucketNo = RehashTable(BucketNo); | 413 | 85 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 85 | } |
std::__1::pair<llvm::StringMapIterator<unsigned int const*>, bool> llvm::StringMap<unsigned int const*, llvm::MallocAllocator>::try_emplace<unsigned int const*>(llvm::StringRef, unsigned int const*&&) Line | Count | Source | 399 | 7.40k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 7.40k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 7.40k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 7.40k | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 7.40k | | 406 | 7.40k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 7.40k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 7.40k | ++NumItems; | 410 | 7.40k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 7.40k | | 412 | 7.40k | BucketNo = RehashTable(BucketNo); | 413 | 7.40k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 7.40k | } |
std::__1::pair<llvm::StringMapIterator<llvm::MachineMemOperand::Flags>, bool> llvm::StringMap<llvm::MachineMemOperand::Flags, llvm::MallocAllocator>::try_emplace<llvm::MachineMemOperand::Flags>(llvm::StringRef, llvm::MachineMemOperand::Flags&&) Line | Count | Source | 399 | 6 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 6 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 6 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 6 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 6 | | 406 | 6 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 6 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 6 | ++NumItems; | 410 | 6 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 6 | | 412 | 6 | BucketNo = RehashTable(BucketNo); | 413 | 6 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 6 | } |
std::__1::pair<llvm::StringMapIterator<llvm::TargetRegisterClass const*>, bool> llvm::StringMap<llvm::TargetRegisterClass const*, llvm::MallocAllocator>::try_emplace<llvm::TargetRegisterClass const*>(llvm::StringRef, llvm::TargetRegisterClass const*&&) Line | Count | Source | 399 | 232k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 232k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 232k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 232k | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 232k | | 406 | 232k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 232k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 232k | ++NumItems; | 410 | 232k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 232k | | 412 | 232k | BucketNo = RehashTable(BucketNo); | 413 | 232k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 232k | } |
std::__1::pair<llvm::StringMapIterator<llvm::RegisterBank const*>, bool> llvm::StringMap<llvm::RegisterBank const*, llvm::MallocAllocator>::try_emplace<llvm::RegisterBank const*>(llvm::StringRef, llvm::RegisterBank const*&&) Line | Count | Source | 399 | 6.12k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 6.12k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 6.12k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 6.12k | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 6.12k | | 406 | 6.12k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 6.12k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 6.12k | ++NumItems; | 410 | 6.12k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 6.12k | | 412 | 6.12k | BucketNo = RehashTable(BucketNo); | 413 | 6.12k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 6.12k | } |
std::__1::pair<llvm::StringMapIterator<llvm::VRegInfo*>, bool> llvm::StringMap<llvm::VRegInfo*, llvm::MallocAllocator>::try_emplace<llvm::VRegInfo*>(llvm::StringRef, llvm::VRegInfo*&&) Line | Count | Source | 399 | 57 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 57 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 57 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 57 | if (Bucket && Bucket != getTombstoneVal()30 ) | 403 | 30 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 30 | false); // Already exists in map. | 405 | 27 | | 406 | 27 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 27 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 27 | ++NumItems; | 410 | 27 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 27 | | 412 | 27 | BucketNo = RehashTable(BucketNo); | 413 | 27 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 27 | } |
std::__1::pair<llvm::StringMapIterator<llvm::DIE const*>, bool> llvm::StringMap<llvm::DIE const*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 89.8k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 89.8k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 89.8k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 89.8k | if (Bucket && Bucket != getTombstoneVal()19.5k ) | 403 | 19.5k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 19.5k | false); // Already exists in map. | 405 | 70.3k | | 406 | 70.3k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 70.3k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 70.3k | ++NumItems; | 410 | 70.3k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 70.3k | | 412 | 70.3k | BucketNo = RehashTable(BucketNo); | 413 | 70.3k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 70.3k | } |
std::__1::pair<llvm::StringMapIterator<llvm::DIE const*>, bool> llvm::StringMap<llvm::DIE const*, llvm::MallocAllocator>::try_emplace<llvm::DIE const*>(llvm::StringRef, llvm::DIE const*&&) Line | Count | Source | 399 | 74 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 74 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 74 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 74 | if (Bucket && Bucket != getTombstoneVal()56 ) | 403 | 56 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 56 | false); // Already exists in map. | 405 | 18 | | 406 | 18 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 18 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 18 | ++NumItems; | 410 | 18 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 18 | | 412 | 18 | BucketNo = RehashTable(BucketNo); | 413 | 18 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 18 | } |
std::__1::pair<llvm::StringMapIterator<llvm::AccelTableBase::HashData>, bool> llvm::StringMap<llvm::AccelTableBase::HashData, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::try_emplace<llvm::DwarfStringPoolEntryRef&, unsigned int (*&)(llvm::StringRef)>(llvm::StringRef, llvm::DwarfStringPoolEntryRef&&&, unsigned int (*&&&)(llvm::StringRef)) Line | Count | Source | 399 | 316k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 316k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 316k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 316k | if (Bucket && Bucket != getTombstoneVal()244k ) | 403 | 244k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 244k | false); // Already exists in map. | 405 | 71.8k | | 406 | 71.8k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 71.8k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 71.8k | ++NumItems; | 410 | 71.8k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 71.8k | | 412 | 71.8k | BucketNo = RehashTable(BucketNo); | 413 | 71.8k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 71.8k | } |
std::__1::pair<llvm::StringMapIterator<llvm::DwarfStringPoolEntry>, bool> llvm::StringMap<llvm::DwarfStringPoolEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::try_emplace<llvm::DwarfStringPoolEntry>(llvm::StringRef, llvm::DwarfStringPoolEntry&&) Line | Count | Source | 399 | 419k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 419k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 419k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 419k | if (Bucket && Bucket != getTombstoneVal()336k ) | 403 | 336k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 336k | false); // Already exists in map. | 405 | 82.8k | | 406 | 82.8k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 82.8k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 82.8k | ++NumItems; | 410 | 82.8k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 82.8k | | 412 | 82.8k | BucketNo = RehashTable(BucketNo); | 413 | 82.8k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 82.8k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> >, bool> llvm::StringMap<std::__1::weak_ptr<llvm::DWARFContext::DWOFile>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 10 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 10 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 10 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 10 | if (Bucket && Bucket != getTombstoneVal()1 ) | 403 | 1 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1 | false); // Already exists in map. | 405 | 9 | | 406 | 9 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 9 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 9 | ++NumItems; | 410 | 9 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 9 | | 412 | 9 | BucketNo = RehashTable(BucketNo); | 413 | 9 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 9 | } |
std::__1::pair<llvm::StringMapIterator<unsigned short>, bool> llvm::StringMap<unsigned short, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 47 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 47 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 47 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 47 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 47 | | 406 | 47 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 47 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 47 | ++NumItems; | 410 | 47 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 47 | | 412 | 47 | BucketNo = RehashTable(BucketNo); | 413 | 47 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 47 | } |
std::__1::pair<llvm::StringMapIterator<llvm::SDNode*>, bool> llvm::StringMap<llvm::SDNode*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 18.9k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 18.9k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 18.9k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 18.9k | if (Bucket && Bucket != getTombstoneVal()12.5k ) | 403 | 4.11k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 4.11k | false); // Already exists in map. | 405 | 14.8k | | 406 | 14.8k | if (Bucket == getTombstoneVal()) | 407 | 8.45k | --NumTombstones; | 408 | 14.8k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 14.8k | ++NumItems; | 410 | 14.8k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 14.8k | | 412 | 14.8k | BucketNo = RehashTable(BucketNo); | 413 | 14.8k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 14.8k | } |
std::__1::pair<llvm::StringMapIterator<llvm::lto::LTO::GlobalResolution>, bool> llvm::StringMap<llvm::lto::LTO::GlobalResolution, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 1.36k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 1.36k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 1.36k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 1.36k | if (Bucket && Bucket != getTombstoneVal()305 ) | 403 | 305 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 305 | false); // Already exists in map. | 405 | 1.06k | | 406 | 1.06k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 1.06k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 1.06k | ++NumItems; | 410 | 1.06k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 1.06k | | 412 | 1.06k | BucketNo = RehashTable(BucketNo); | 413 | 1.06k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 1.06k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > >, bool> llvm::StringMap<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 621 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 621 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 621 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 621 | if (Bucket && Bucket != getTombstoneVal()190 ) | 403 | 190 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 190 | false); // Already exists in map. | 405 | 431 | | 406 | 431 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 431 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 431 | ++NumItems; | 410 | 431 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 431 | | 412 | 431 | BucketNo = RehashTable(BucketNo); | 413 | 431 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 431 | } |
std::__1::pair<llvm::StringMapIterator<clang::Stmt*>, bool> llvm::StringMap<clang::Stmt*, llvm::MallocAllocator>::try_emplace<clang::Stmt*>(llvm::StringRef, clang::Stmt*&&) Line | Count | Source | 399 | 2 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 2 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 2 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 2 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 2 | | 406 | 2 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 2 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 2 | ++NumItems; | 410 | 2 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 2 | | 412 | 2 | BucketNo = RehashTable(BucketNo); | 413 | 2 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 2 | } |
std::__1::pair<llvm::StringMapIterator<clang::Stmt*>, bool> llvm::StringMap<clang::Stmt*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 27.1k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 27.1k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 27.1k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 27.1k | if (Bucket && Bucket != getTombstoneVal()14.0k ) | 403 | 14.0k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 14.0k | false); // Already exists in map. | 405 | 13.0k | | 406 | 13.0k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 13.0k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 13.0k | ++NumItems; | 410 | 13.0k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 13.0k | | 412 | 13.0k | BucketNo = RehashTable(BucketNo); | 413 | 13.0k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 13.0k | } |
std::__1::pair<llvm::StringMapIterator<FoundationClass>, bool> llvm::StringMap<FoundationClass, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 91 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 91 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 91 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 91 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 91 | | 406 | 91 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 91 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 91 | ++NumItems; | 410 | 91 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 91 | | 412 | 91 | BucketNo = RehashTable(BucketNo); | 413 | 91 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 91 | } |
std::__1::pair<llvm::StringMapIterator<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >, bool> llvm::StringMap<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 53 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 53 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 53 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 53 | if (Bucket && Bucket != getTombstoneVal()33 ) | 403 | 33 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 33 | false); // Already exists in map. | 405 | 20 | | 406 | 20 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 20 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 20 | ++NumItems; | 410 | 20 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 20 | | 412 | 20 | BucketNo = RehashTable(BucketNo); | 413 | 20 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 20 | } |
StdLibraryFunctionsChecker.cpp:std::__1::pair<llvm::StringMapIterator<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >, bool> llvm::StringMap<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >, llvm::MallocAllocator>::try_emplace<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >(llvm::StringRef, std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> >&&) Line | Count | Source | 399 | 286 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 286 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 286 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 286 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 286 | | 406 | 286 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 286 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 286 | ++NumItems; | 410 | 286 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 286 | | 412 | 286 | BucketNo = RehashTable(BucketNo); | 413 | 286 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 286 | } |
std::__1::pair<llvm::StringMapIterator<clang::ento::BugType*>, bool> llvm::StringMap<clang::ento::BugType*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 1.12k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 1.12k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 1.12k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 1.12k | if (Bucket && Bucket != getTombstoneVal()412 ) | 403 | 412 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 412 | false); // Already exists in map. | 405 | 709 | | 406 | 709 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 709 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 709 | ++NumItems; | 410 | 709 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 709 | | 412 | 709 | BucketNo = RehashTable(BucketNo); | 413 | 709 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 709 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >, bool> llvm::StringMap<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 72 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 72 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 72 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 72 | if (Bucket && Bucket != getTombstoneVal()40 ) | 403 | 40 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 40 | false); // Already exists in map. | 405 | 32 | | 406 | 32 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 32 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 32 | ++NumItems; | 410 | 32 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 32 | | 412 | 32 | BucketNo = RehashTable(BucketNo); | 413 | 32 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 32 | } |
std::__1::pair<llvm::StringMapIterator<clang::ASTUnit*>, bool> llvm::StringMap<clang::ASTUnit*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 57 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 57 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 57 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 57 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 57 | | 406 | 57 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 57 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 57 | ++NumItems; | 410 | 57 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 57 | | 412 | 57 | BucketNo = RehashTable(BucketNo); | 413 | 57 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 57 | } |
std::__1::pair<llvm::StringMapIterator<llvm::SmallVector<clang::TypoCorrection, 1u> >, bool> llvm::StringMap<llvm::SmallVector<clang::TypoCorrection, 1u>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 11.1k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 11.1k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 11.1k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 11.1k | if (Bucket && Bucket != getTombstoneVal()902 ) | 403 | 892 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 892 | false); // Already exists in map. | 405 | 10.2k | | 406 | 10.2k | if (Bucket == getTombstoneVal()) | 407 | 10 | --NumTombstones; | 408 | 10.2k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 10.2k | ++NumItems; | 410 | 10.2k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 10.2k | | 412 | 10.2k | BucketNo = RehashTable(BucketNo); | 413 | 10.2k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 10.2k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >, bool> llvm::StringMap<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 3 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 3 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 3 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 3 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 3 | | 406 | 3 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 3 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 3 | ++NumItems; | 410 | 3 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 3 | | 412 | 3 | BucketNo = RehashTable(BucketNo); | 413 | 3 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 3 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >, bool> llvm::StringMap<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt>, llvm::MallocAllocator>::try_emplace<clang::OMPCriticalDirective const*&, llvm::APSInt&>(llvm::StringRef, clang::OMPCriticalDirective const*&&&, llvm::APSInt&&&) Line | Count | Source | 399 | 38 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 38 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 38 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 38 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 38 | | 406 | 38 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 38 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 38 | ++NumItems; | 410 | 38 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 38 | | 412 | 38 | BucketNo = RehashTable(BucketNo); | 413 | 38 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 38 | } |
std::__1::pair<llvm::StringMapIterator<llvm::TimeRecord>, bool> llvm::StringMap<llvm::TimeRecord, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 9 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 9 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 9 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 9 | if (Bucket && Bucket != getTombstoneVal()8 ) | 403 | 8 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 8 | false); // Already exists in map. | 405 | 1 | | 406 | 1 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 1 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 1 | ++NumItems; | 410 | 1 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 1 | | 412 | 1 | BucketNo = RehashTable(BucketNo); | 413 | 1 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 1 | } |
std::__1::pair<llvm::StringMapIterator<clang::StringLiteral*>, bool> llvm::StringMap<clang::StringLiteral*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 255 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 255 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 255 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 255 | if (Bucket && Bucket != getTombstoneVal()190 ) | 403 | 190 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 190 | false); // Already exists in map. | 405 | 65 | | 406 | 65 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 65 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 65 | ++NumItems; | 410 | 65 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 65 | | 412 | 65 | BucketNo = RehashTable(BucketNo); | 413 | 65 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 65 | } |
std::__1::pair<llvm::StringMapIterator<clang::comments::TParamCommandComment*>, bool> llvm::StringMap<clang::comments::TParamCommandComment*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 92 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 92 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 92 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 92 | if (Bucket && Bucket != getTombstoneVal()2 ) | 403 | 2 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 2 | false); // Already exists in map. | 405 | 90 | | 406 | 90 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 90 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 90 | ++NumItems; | 410 | 90 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 90 | | 412 | 90 | BucketNo = RehashTable(BucketNo); | 413 | 90 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 90 | } |
std::__1::pair<llvm::StringMapIterator<char>, bool> llvm::StringMap<char, llvm::MallocAllocator>::try_emplace<int>(llvm::StringRef, int&&) Line | Count | Source | 399 | 3 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 3 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 3 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 3 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 3 | | 406 | 3 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 3 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 3 | ++NumItems; | 410 | 3 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 3 | | 412 | 3 | BucketNo = RehashTable(BucketNo); | 413 | 3 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 3 | } |
std::__1::pair<llvm::StringMapIterator<clang::HeaderSearch::LookupFileCacheInfo>, bool> llvm::StringMap<clang::HeaderSearch::LookupFileCacheInfo, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 884k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 884k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 884k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 884k | if (Bucket && Bucket != getTombstoneVal()509k ) | 403 | 509k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 509k | false); // Already exists in map. | 405 | 374k | | 406 | 374k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 374k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 374k | ++NumItems; | 410 | 374k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 374k | | 412 | 374k | BucketNo = RehashTable(BucketNo); | 413 | 374k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 374k | } |
std::__1::pair<llvm::StringMapIterator<clang::FrameworkCacheEntry>, bool> llvm::StringMap<clang::FrameworkCacheEntry, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<clang::FrameworkCacheEntry>(llvm::StringRef, clang::FrameworkCacheEntry&&) Line | Count | Source | 399 | 38 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 38 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 38 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 38 | if (Bucket && Bucket != getTombstoneVal()) | 403 | 38 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 38 | false); // Already exists in map. | 405 | 0 | | 406 | 0 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 0 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 0 | ++NumItems; | 410 | 0 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 0 |
| 412 | 0 | BucketNo = RehashTable(BucketNo); | 413 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 0 | } |
std::__1::pair<llvm::StringMapIterator<llvm::StringSet<llvm::MallocAllocator> >, bool> llvm::StringMap<llvm::StringSet<llvm::MallocAllocator>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 20 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 20 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 20 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 20 | if (Bucket && Bucket != getTombstoneVal()6 ) | 403 | 6 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 6 | false); // Already exists in map. | 405 | 14 | | 406 | 14 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 14 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 14 | ++NumItems; | 410 | 14 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 14 | | 412 | 14 | BucketNo = RehashTable(BucketNo); | 413 | 14 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 14 | } |
std::__1::pair<llvm::StringMapIterator<clang::Module*>, bool> llvm::StringMap<clang::Module*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 74.0k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 74.0k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 74.0k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 74.0k | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 74.0k | | 406 | 74.0k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 74.0k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 74.0k | ++NumItems; | 410 | 74.0k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 74.0k | | 412 | 74.0k | BucketNo = RehashTable(BucketNo); | 413 | 74.0k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 74.0k | } |
std::__1::pair<llvm::StringMapIterator<clang::PragmaHandler*>, bool> llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 2.25M | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 2.25M | unsigned BucketNo = LookupBucketFor(Key); | 401 | 2.25M | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 2.25M | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 2.25M | | 406 | 2.25M | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 2.25M | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 2.25M | ++NumItems; | 410 | 2.25M | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 2.25M | | 412 | 2.25M | BucketNo = RehashTable(BucketNo); | 413 | 2.25M | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 2.25M | } |
std::__1::pair<llvm::StringMapIterator<std::__1::pair<llvm::Type*, llvm::SMLoc> >, bool> llvm::StringMap<std::__1::pair<llvm::Type*, llvm::SMLoc>, llvm::MallocAllocator>::try_emplace<std::__1::pair<llvm::Type*, llvm::SMLoc> >(llvm::StringRef, std::__1::pair<llvm::Type*, llvm::SMLoc>&&) Line | Count | Source | 399 | 55 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 55 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 55 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 55 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 55 | | 406 | 55 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 55 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 55 | ++NumItems; | 410 | 55 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 55 | | 412 | 55 | BucketNo = RehashTable(BucketNo); | 413 | 55 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 55 | } |
std::__1::pair<llvm::StringMapIterator<llvm::Type*>, bool> llvm::StringMap<llvm::Type*, llvm::MallocAllocator>::try_emplace<llvm::Type*>(llvm::StringRef, llvm::Type*&&) Line | Count | Source | 399 | 91 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 91 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 91 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 91 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 91 | | 406 | 91 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 91 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 91 | ++NumItems; | 410 | 91 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 91 | | 412 | 91 | BucketNo = RehashTable(BucketNo); | 413 | 91 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 91 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::pair<llvm::Type*, llvm::SMLoc> >, bool> llvm::StringMap<std::__1::pair<llvm::Type*, llvm::SMLoc>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 105k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 105k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 105k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 105k | if (Bucket && Bucket != getTombstoneVal()92.5k ) | 403 | 92.5k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 92.5k | false); // Already exists in map. | 405 | 12.6k | | 406 | 12.6k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 12.6k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 12.6k | ++NumItems; | 410 | 12.6k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 12.6k | | 412 | 12.6k | BucketNo = RehashTable(BucketNo); | 413 | 12.6k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 12.6k | } |
std::__1::pair<llvm::StringMapIterator<llvm::sampleprof::FunctionSamples>, bool> llvm::StringMap<llvm::sampleprof::FunctionSamples, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 649 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 649 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 649 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 649 | if (Bucket && Bucket != getTombstoneVal()309 ) | 403 | 309 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 309 | false); // Already exists in map. | 405 | 340 | | 406 | 340 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 340 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 340 | ++NumItems; | 410 | 340 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 340 | | 412 | 340 | BucketNo = RehashTable(BucketNo); | 413 | 340 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 340 | } |
std::__1::pair<llvm::StringMapIterator<llvm::RecordStreamer::State>, bool> llvm::StringMap<llvm::RecordStreamer::State, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 434 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 434 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 434 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 434 | if (Bucket && Bucket != getTombstoneVal()170 ) | 403 | 170 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 170 | false); // Already exists in map. | 405 | 264 | | 406 | 264 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 264 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 264 | ++NumItems; | 410 | 264 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 264 | | 412 | 264 | BucketNo = RehashTable(BucketNo); | 413 | 264 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 264 | } |
std::__1::pair<llvm::StringMapIterator<llvm::GlobalValue const*>, bool> llvm::StringMap<llvm::GlobalValue const*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 255 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 255 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 255 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 255 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 255 | | 406 | 255 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 255 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 255 | ++NumItems; | 410 | 255 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 255 | | 412 | 255 | BucketNo = RehashTable(BucketNo); | 413 | 255 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 255 | } |
std::__1::pair<llvm::StringMapIterator<unsigned int>, bool> llvm::StringMap<unsigned int, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::try_emplace<unsigned int>(llvm::StringRef, unsigned int&&) Line | Count | Source | 399 | 17 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 17 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 17 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 17 | if (Bucket && Bucket != getTombstoneVal()1 ) | 403 | 1 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1 | false); // Already exists in map. | 405 | 16 | | 406 | 16 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 16 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 16 | ++NumItems; | 410 | 16 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 16 | | 412 | 16 | BucketNo = RehashTable(BucketNo); | 413 | 16 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 16 | } |
std::__1::pair<llvm::StringMapIterator<llvm::TinyPtrVector<lld::elf::OutputSection*> >, bool> llvm::StringMap<llvm::TinyPtrVector<lld::elf::OutputSection*>, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 387k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 387k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 387k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 387k | if (Bucket && Bucket != getTombstoneVal()10.4k ) | 403 | 10.4k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 10.4k | false); // Already exists in map. | 405 | 377k | | 406 | 377k | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 377k | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 377k | ++NumItems; | 410 | 377k | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 377k | | 412 | 377k | BucketNo = RehashTable(BucketNo); | 413 | 377k | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 377k | } |
std::__1::pair<llvm::StringMapIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >, bool> llvm::StringMap<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 44 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 44 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 44 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 44 | if (Bucket && Bucket != getTombstoneVal()1 ) | 403 | 1 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1 | false); // Already exists in map. | 405 | 43 | | 406 | 43 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 43 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 43 | ++NumItems; | 410 | 43 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 43 | | 412 | 43 | BucketNo = RehashTable(BucketNo); | 413 | 43 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 43 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >, bool> llvm::StringMap<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 34 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 34 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 34 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 34 | if (Bucket && Bucket != getTombstoneVal()12 ) | 403 | 12 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 12 | false); // Already exists in map. | 405 | 22 | | 406 | 22 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 22 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 22 | ++NumItems; | 410 | 22 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 22 | | 412 | 22 | BucketNo = RehashTable(BucketNo); | 413 | 22 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 22 | } |
std::__1::pair<llvm::StringMapIterator<lld::Atom const*>, bool> llvm::StringMap<lld::Atom const*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 396 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 396 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 396 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 396 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 396 | | 406 | 396 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 396 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 396 | ++NumItems; | 410 | 396 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 396 | | 412 | 396 | BucketNo = RehashTable(BucketNo); | 413 | 396 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 396 | } |
std::__1::pair<llvm::StringMapIterator<lld::mach_o::MachODylibFile*>, bool> llvm::StringMap<lld::mach_o::MachODylibFile*, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 234 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 234 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 234 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 234 | if (Bucket && Bucket != getTombstoneVal()1 ) | 403 | 1 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 1 | false); // Already exists in map. | 405 | 233 | | 406 | 233 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 233 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 233 | ++NumItems; | 410 | 233 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 233 | | 412 | 233 | BucketNo = RehashTable(BucketNo); | 413 | 233 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 233 | } |
std::__1::pair<llvm::StringMapIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >, bool> llvm::StringMap<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> >, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 5 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 5 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 5 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 5 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 5 | | 406 | 5 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 5 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 5 | ++NumItems; | 410 | 5 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 5 | | 412 | 5 | BucketNo = RehashTable(BucketNo); | 413 | 5 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 5 | } |
MachONormalizedFileFromAtoms.cpp:std::__1::pair<llvm::StringMapIterator<(anonymous namespace)::Util::DylibInfo>, bool> llvm::StringMap<(anonymous namespace)::Util::DylibInfo, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 408 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 408 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 408 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 408 | if (Bucket && Bucket != getTombstoneVal()294 ) | 403 | 294 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 294 | false); // Already exists in map. | 405 | 114 | | 406 | 114 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 114 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 114 | ++NumItems; | 410 | 114 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 114 | | 412 | 114 | BucketNo = RehashTable(BucketNo); | 413 | 114 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 114 | } |
std::__1::pair<llvm::StringMapIterator<unsigned int>, bool> llvm::StringMap<unsigned int, llvm::MallocAllocator>::try_emplace<llvm::support::detail::packed_endian_specific_integral<unsigned int, (llvm::support::endianness)1, 1ul> const&>(llvm::StringRef, llvm::support::detail::packed_endian_specific_integral<unsigned int, (llvm::support::endianness)1, 1ul> const&&&) Line | Count | Source | 399 | 31 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 31 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 31 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 31 | if (Bucket && Bucket != getTombstoneVal()0 ) | 403 | 0 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 0 | false); // Already exists in map. | 405 | 31 | | 406 | 31 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 31 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 31 | ++NumItems; | 410 | 31 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 31 | | 412 | 31 | BucketNo = RehashTable(BucketNo); | 413 | 31 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 31 | } |
std::__1::pair<llvm::StringMapIterator<unsigned long long>, bool> llvm::StringMap<unsigned long long, llvm::MallocAllocator>::try_emplace<unsigned long long>(llvm::StringRef, unsigned long long&&) Line | Count | Source | 399 | 918 | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 918 | unsigned BucketNo = LookupBucketFor(Key); | 401 | 918 | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 918 | if (Bucket && Bucket != getTombstoneVal()504 ) | 403 | 504 | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 504 | false); // Already exists in map. | 405 | 414 | | 406 | 414 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 414 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 414 | ++NumItems; | 410 | 414 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 414 | | 412 | 414 | BucketNo = RehashTable(BucketNo); | 413 | 414 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 414 | } |
std::__1::pair<llvm::StringMapIterator<llvm::FileInfo::LineData>, bool> llvm::StringMap<llvm::FileInfo::LineData, llvm::MallocAllocator>::try_emplace<>(llvm::StringRef) Line | Count | Source | 399 | 3.04k | std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { | 400 | 3.04k | unsigned BucketNo = LookupBucketFor(Key); | 401 | 3.04k | StringMapEntryBase *&Bucket = TheTable[BucketNo]; | 402 | 3.04k | if (Bucket && Bucket != getTombstoneVal()3.00k ) | 403 | 3.00k | return std::make_pair(iterator(TheTable + BucketNo, false), | 404 | 3.00k | false); // Already exists in map. | 405 | 46 | | 406 | 46 | if (Bucket == getTombstoneVal()) | 407 | 0 | --NumTombstones; | 408 | 46 | Bucket = MapEntryTy::Create(Key, Allocator, std::forward<ArgsTy>(Args)...); | 409 | 46 | ++NumItems; | 410 | 46 | assert(NumItems + NumTombstones <= NumBuckets); | 411 | 46 | | 412 | 46 | BucketNo = RehashTable(BucketNo); | 413 | 46 | return std::make_pair(iterator(TheTable + BucketNo, false), true); | 414 | 46 | } |
|
415 | | |
416 | | // clear - Empties out the StringMap |
417 | 1.75M | void clear() { |
418 | 1.75M | if (empty()) return1.44M ; |
419 | 305k | |
420 | 305k | // Zap all values, resetting the keys back to non-present (not tombstone), |
421 | 305k | // which is safe because we're removing all elements. |
422 | 31.2M | for (unsigned I = 0, E = NumBuckets; 305k I != E; ++I30.9M ) { |
423 | 30.9M | StringMapEntryBase *&Bucket = TheTable[I]; |
424 | 30.9M | if (Bucket && Bucket != getTombstoneVal()15.9M ) { |
425 | 15.3M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); |
426 | 15.3M | } |
427 | 30.9M | Bucket = nullptr; |
428 | 30.9M | } |
429 | 305k | |
430 | 305k | NumItems = 0; |
431 | 305k | NumTombstones = 0; |
432 | 305k | } llvm::StringMap<llvm::ConstantDataSequential*, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 94.3k | void clear() { | 418 | 94.3k | if (empty()) return83.2k ; | 419 | 11.1k | | 420 | 11.1k | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 11.1k | // which is safe because we're removing all elements. | 422 | 258k | for (unsigned I = 0, E = NumBuckets; 11.1k I != E; ++I247k ) { | 423 | 247k | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 247k | if (Bucket && Bucket != getTombstoneVal()84.9k ) { | 425 | 84.9k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 84.9k | } | 427 | 247k | Bucket = nullptr; | 428 | 247k | } | 429 | 11.1k | | 430 | 11.1k | NumItems = 0; | 431 | 11.1k | NumTombstones = 0; | 432 | 11.1k | } |
llvm::StringMap<bool, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::clear() Line | Count | Source | 417 | 53.4k | void clear() { | 418 | 53.4k | if (empty()) return3.85k ; | 419 | 49.6k | | 420 | 49.6k | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 49.6k | // which is safe because we're removing all elements. | 422 | 9.64M | for (unsigned I = 0, E = NumBuckets; 49.6k I != E; ++I9.59M ) { | 423 | 9.59M | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 9.59M | if (Bucket && Bucket != getTombstoneVal()5.06M ) { | 425 | 5.06M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 5.06M | } | 427 | 9.59M | Bucket = nullptr; | 428 | 9.59M | } | 429 | 49.6k | | 430 | 49.6k | NumItems = 0; | 431 | 49.6k | NumTombstones = 0; | 432 | 49.6k | } |
llvm::StringMap<llvm::MCSymbol*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul>&>::clear() Line | Count | Source | 417 | 53.4k | void clear() { | 418 | 53.4k | if (empty()) return4.60k ; | 419 | 48.8k | | 420 | 48.8k | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 48.8k | // which is safe because we're removing all elements. | 422 | 9.02M | for (unsigned I = 0, E = NumBuckets; 48.8k I != E; ++I8.97M ) { | 423 | 8.97M | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 8.97M | if (Bucket && Bucket != getTombstoneVal()4.65M ) { | 425 | 4.65M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 4.65M | } | 427 | 8.97M | Bucket = nullptr; | 428 | 8.97M | } | 429 | 48.8k | | 430 | 48.8k | NumItems = 0; | 431 | 48.8k | NumTombstones = 0; | 432 | 48.8k | } |
llvm::StringMap<llvm::MCSectionMachO*, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 53.4k | void clear() { | 418 | 53.4k | if (empty()) return36.5k ; | 419 | 16.9k | | 420 | 16.9k | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 16.9k | // which is safe because we're removing all elements. | 422 | 2.18M | for (unsigned I = 0, E = NumBuckets; 16.9k I != E; ++I2.16M ) { | 423 | 2.16M | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 2.16M | if (Bucket && Bucket != getTombstoneVal()889k ) { | 425 | 889k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 889k | } | 427 | 2.16M | Bucket = nullptr; | 428 | 2.16M | } | 429 | 16.9k | | 430 | 16.9k | NumItems = 0; | 431 | 16.9k | NumTombstones = 0; | 432 | 16.9k | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 59.1k | void clear() { | 418 | 59.1k | if (empty()) return16.7k ; | 419 | 42.3k | | 420 | 42.3k | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 42.3k | // which is safe because we're removing all elements. | 422 | 6.71M | for (unsigned I = 0, E = NumBuckets; 42.3k I != E; ++I6.67M ) { | 423 | 6.67M | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 6.67M | if (Bucket && Bucket != getTombstoneVal()3.65M ) { | 425 | 3.65M | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 3.65M | } | 427 | 6.67M | Bucket = nullptr; | 428 | 6.67M | } | 429 | 42.3k | | 430 | 42.3k | NumItems = 0; | 431 | 42.3k | NumTombstones = 0; | 432 | 42.3k | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 32 | void clear() { | 418 | 32 | if (empty()) return2 ; | 419 | 30 | | 420 | 30 | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 30 | // which is safe because we're removing all elements. | 422 | 750 | for (unsigned I = 0, E = NumBuckets; 30 I != E; ++I720 ) { | 423 | 720 | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 720 | if (Bucket && Bucket != getTombstoneVal()330 ) { | 425 | 300 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 300 | } | 427 | 720 | Bucket = nullptr; | 428 | 720 | } | 429 | 30 | | 430 | 30 | NumItems = 0; | 431 | 30 | NumTombstones = 0; | 432 | 30 | } |
llvm::StringMap<unsigned int, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::clear() Line | Count | Source | 417 | 33 | void clear() { | 418 | 33 | if (empty()) return0 ; | 419 | 33 | | 420 | 33 | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 33 | // which is safe because we're removing all elements. | 422 | 561 | for (unsigned I = 0, E = NumBuckets; 33 I != E; ++I528 ) { | 423 | 528 | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 528 | if (Bucket && Bucket != getTombstoneVal()67 ) { | 425 | 67 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 67 | } | 427 | 528 | Bucket = nullptr; | 428 | 528 | } | 429 | 33 | | 430 | 33 | NumItems = 0; | 431 | 33 | NumTombstones = 0; | 432 | 33 | } |
llvm::StringMap<llvm::AssertingVH<llvm::Constant>, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::clear() Line | Count | Source | 417 | 3.46k | void clear() { | 418 | 3.46k | if (empty()) return3.31k ; | 419 | 146 | | 420 | 146 | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 146 | // which is safe because we're removing all elements. | 422 | 2.48k | for (unsigned I = 0, E = NumBuckets; 146 I != E; ++I2.33k ) { | 423 | 2.33k | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 2.33k | if (Bucket && Bucket != getTombstoneVal()229 ) { | 425 | 229 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 229 | } | 427 | 2.33k | Bucket = nullptr; | 428 | 2.33k | } | 429 | 146 | | 430 | 146 | NumItems = 0; | 431 | 146 | NumTombstones = 0; | 432 | 146 | } |
llvm::StringMap<clang::SourceLocation, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 4.99k | void clear() { | 418 | 4.99k | if (empty()) return4.99k ; | 419 | 2 | | 420 | 2 | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 2 | // which is safe because we're removing all elements. | 422 | 34 | for (unsigned I = 0, E = NumBuckets; 2 I != E; ++I32 ) { | 423 | 32 | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 32 | if (Bucket && Bucket != getTombstoneVal()2 ) { | 425 | 2 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 2 | } | 427 | 32 | Bucket = nullptr; | 428 | 32 | } | 429 | 2 | | 430 | 2 | NumItems = 0; | 431 | 2 | NumTombstones = 0; | 432 | 2 | } |
llvm::StringMap<unsigned int const*, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 172 | void clear() { | 418 | 172 | if (empty()) return157 ; | 419 | 15 | | 420 | 15 | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 15 | // which is safe because we're removing all elements. | 422 | 527 | for (unsigned I = 0, E = NumBuckets; 15 I != E; ++I512 ) { | 423 | 512 | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 512 | if (Bucket && Bucket != getTombstoneVal()265 ) { | 425 | 265 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 265 | } | 427 | 512 | Bucket = nullptr; | 428 | 512 | } | 429 | 15 | | 430 | 15 | NumItems = 0; | 431 | 15 | NumTombstones = 0; | 432 | 15 | } |
llvm::StringMap<int, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 172 | void clear() { | 418 | 172 | if (empty()) return; | 419 | 0 | | 420 | 0 | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 0 | // which is safe because we're removing all elements. | 422 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 423 | 0 | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 425 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 0 | } | 427 | 0 | Bucket = nullptr; | 428 | 0 | } | 429 | 0 |
| 430 | 0 | NumItems = 0; | 431 | 0 | NumTombstones = 0; | 432 | 0 | } |
llvm::StringMap<llvm::MachineMemOperand::Flags, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 172 | void clear() { | 418 | 172 | if (empty()) return; | 419 | 0 | | 420 | 0 | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 0 | // which is safe because we're removing all elements. | 422 | 0 | for (unsigned I = 0, E = NumBuckets; I != E; ++I) { | 423 | 0 | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 425 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 0 | } | 427 | 0 | Bucket = nullptr; | 428 | 0 | } | 429 | 0 |
| 430 | 0 | NumItems = 0; | 431 | 0 | NumTombstones = 0; | 432 | 0 | } |
llvm::StringMap<llvm::SDNode*, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 1.24M | void clear() { | 418 | 1.24M | if (empty()1.24M ) return; | 419 | 18.4E | | 420 | 18.4E | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 18.4E | // which is safe because we're removing all elements. | 422 | 18.4E | for (unsigned I = 0, E = NumBuckets; I != E; ++I0 ) { | 423 | 0 | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 0 | if (Bucket && Bucket != getTombstoneVal()) { | 425 | 0 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 0 | } | 427 | 0 | Bucket = nullptr; | 428 | 0 | } | 429 | 18.4E | | 430 | 18.4E | NumItems = 0; | 431 | 18.4E | NumTombstones = 0; | 432 | 18.4E | } |
llvm::StringMap<clang::ento::BugType*, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 6.39k | void clear() { | 418 | 6.39k | if (empty()) return5.94k ; | 419 | 451 | | 420 | 451 | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 451 | // which is safe because we're removing all elements. | 422 | 7.79k | for (unsigned I = 0, E = NumBuckets; 451 I != E; ++I7.34k ) { | 423 | 7.34k | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 7.34k | if (Bucket && Bucket != getTombstoneVal()709 ) { | 425 | 709 | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 709 | } | 427 | 7.34k | Bucket = nullptr; | 428 | 7.34k | } | 429 | 451 | | 430 | 451 | NumItems = 0; | 431 | 451 | NumTombstones = 0; | 432 | 451 | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::clear() Line | Count | Source | 417 | 179k | void clear() { | 418 | 179k | if (empty()) return43.1k ; | 419 | 136k | | 420 | 136k | // Zap all values, resetting the keys back to non-present (not tombstone), | 421 | 136k | // which is safe because we're removing all elements. | 422 | 3.43M | for (unsigned I = 0, E = NumBuckets; 136k I != E; ++I3.30M ) { | 423 | 3.30M | StringMapEntryBase *&Bucket = TheTable[I]; | 424 | 3.30M | if (Bucket && Bucket != getTombstoneVal()1.62M ) { | 425 | 963k | static_cast<MapEntryTy*>(Bucket)->Destroy(Allocator); | 426 | 963k | } | 427 | 3.30M | Bucket = nullptr; | 428 | 3.30M | } | 429 | 136k | | 430 | 136k | NumItems = 0; | 431 | 136k | NumTombstones = 0; | 432 | 136k | } |
|
433 | | |
434 | | /// remove - Remove the specified key/value pair from the map, but do not |
435 | | /// erase it. This aborts if the key is not in the map. |
436 | 12.1M | void remove(MapEntryTy *KeyValue) { |
437 | 12.1M | RemoveKey(KeyValue); |
438 | 12.1M | } llvm::StringMap<llvm::MCAsmMacro, llvm::MallocAllocator>::remove(llvm::StringMapEntry<llvm::MCAsmMacro>*) Line | Count | Source | 436 | 4 | void remove(MapEntryTy *KeyValue) { | 437 | 4 | RemoveKey(KeyValue); | 438 | 4 | } |
AArch64AsmParser.cpp:llvm::StringMap<std::__1::pair<(anonymous namespace)::RegKind, unsigned int>, llvm::MallocAllocator>::remove(llvm::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >*) Line | Count | Source | 436 | 8 | void remove(MapEntryTy *KeyValue) { | 437 | 8 | RemoveKey(KeyValue); | 438 | 8 | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::remove(llvm::StringMapEntry<unsigned int>*) Line | Count | Source | 436 | 391 | void remove(MapEntryTy *KeyValue) { | 437 | 391 | RemoveKey(KeyValue); | 438 | 391 | } |
Unexecuted instantiation: llvm::StringMap<llvm::ConstantDataSequential*, llvm::MallocAllocator>::remove(llvm::StringMapEntry<llvm::ConstantDataSequential*>*) llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::remove(llvm::StringMapEntry<llvm::NamedMDNode*>*) Line | Count | Source | 436 | 1.43k | void remove(MapEntryTy *KeyValue) { | 437 | 1.43k | RemoveKey(KeyValue); | 438 | 1.43k | } |
llvm::StringMap<llvm::StructType*, llvm::MallocAllocator>::remove(llvm::StringMapEntry<llvm::StructType*>*) Line | Count | Source | 436 | 90 | void remove(MapEntryTy *KeyValue) { | 437 | 90 | RemoveKey(KeyValue); | 438 | 90 | } |
llvm::StringMap<llvm::Value*, llvm::MallocAllocator>::remove(llvm::StringMapEntry<llvm::Value*>*) Line | Count | Source | 436 | 11.1M | void remove(MapEntryTy *KeyValue) { | 437 | 11.1M | RemoveKey(KeyValue); | 438 | 11.1M | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::remove(llvm::StringMapEntry<llvm::cl::Option*>*) Line | Count | Source | 436 | 165 | void remove(MapEntryTy *KeyValue) { | 437 | 165 | RemoveKey(KeyValue); | 438 | 165 | } |
llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::remove(llvm::StringMapEntry<llvm::Comdat>*) Line | Count | Source | 436 | 8 | void remove(MapEntryTy *KeyValue) { | 437 | 8 | RemoveKey(KeyValue); | 438 | 8 | } |
llvm::StringMap<clang::DirectoryEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::remove(llvm::StringMapEntry<clang::DirectoryEntry*>*) Line | Count | Source | 436 | 564 | void remove(MapEntryTy *KeyValue) { | 437 | 564 | RemoveKey(KeyValue); | 438 | 564 | } |
llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::remove(llvm::StringMapEntry<clang::FileEntry*>*) Line | Count | Source | 436 | 1.17k | void remove(MapEntryTy *KeyValue) { | 437 | 1.17k | RemoveKey(KeyValue); | 438 | 1.17k | } |
llvm::StringMap<clang::GlobalDecl, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::remove(llvm::StringMapEntry<clang::GlobalDecl>*) Line | Count | Source | 436 | 18 | void remove(MapEntryTy *KeyValue) { | 437 | 18 | RemoveKey(KeyValue); | 438 | 18 | } |
llvm::StringMap<char, llvm::MallocAllocator>::remove(llvm::StringMapEntry<char>*) Line | Count | Source | 436 | 88 | void remove(MapEntryTy *KeyValue) { | 437 | 88 | RemoveKey(KeyValue); | 438 | 88 | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMap<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u>, llvm::MallocAllocator>::remove(llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >*) Line | Count | Source | 436 | 10 | void remove(MapEntryTy *KeyValue) { | 437 | 10 | RemoveKey(KeyValue); | 438 | 10 | } |
llvm::StringMap<llvm::SDNode*, llvm::MallocAllocator>::remove(llvm::StringMapEntry<llvm::SDNode*>*) Line | Count | Source | 436 | 14.8k | void remove(MapEntryTy *KeyValue) { | 437 | 14.8k | RemoveKey(KeyValue); | 438 | 14.8k | } |
llvm::StringMap<llvm::SmallVector<clang::TypoCorrection, 1u>, llvm::MallocAllocator>::remove(llvm::StringMapEntry<llvm::SmallVector<clang::TypoCorrection, 1u> >*) Line | Count | Source | 436 | 8.78k | void remove(MapEntryTy *KeyValue) { | 437 | 8.78k | RemoveKey(KeyValue); | 438 | 8.78k | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::remove(llvm::StringMapEntry<clang::PragmaHandler*>*) Line | Count | Source | 436 | 1.00M | void remove(MapEntryTy *KeyValue) { | 437 | 1.00M | RemoveKey(KeyValue); | 438 | 1.00M | } |
|
439 | | |
440 | 1.02M | void erase(iterator I) { |
441 | 1.02M | MapEntryTy &V = *I; |
442 | 1.02M | remove(&V); |
443 | 1.02M | V.Destroy(Allocator); |
444 | 1.02M | } llvm::StringMap<llvm::MCAsmMacro, llvm::MallocAllocator>::erase(llvm::StringMapIterator<llvm::MCAsmMacro>) Line | Count | Source | 440 | 4 | void erase(iterator I) { | 441 | 4 | MapEntryTy &V = *I; | 442 | 4 | remove(&V); | 443 | 4 | V.Destroy(Allocator); | 444 | 4 | } |
AArch64AsmParser.cpp:llvm::StringMap<std::__1::pair<(anonymous namespace)::RegKind, unsigned int>, llvm::MallocAllocator>::erase(llvm::StringMapIterator<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >) Line | Count | Source | 440 | 8 | void erase(iterator I) { | 441 | 8 | MapEntryTy &V = *I; | 442 | 8 | remove(&V); | 443 | 8 | V.Destroy(Allocator); | 444 | 8 | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::erase(llvm::StringMapIterator<unsigned int>) Line | Count | Source | 440 | 391 | void erase(iterator I) { | 441 | 391 | MapEntryTy &V = *I; | 442 | 391 | remove(&V); | 443 | 391 | V.Destroy(Allocator); | 444 | 391 | } |
Unexecuted instantiation: llvm::StringMap<llvm::ConstantDataSequential*, llvm::MallocAllocator>::erase(llvm::StringMapIterator<llvm::ConstantDataSequential*>) llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::erase(llvm::StringMapIterator<llvm::NamedMDNode*>) Line | Count | Source | 440 | 1.43k | void erase(iterator I) { | 441 | 1.43k | MapEntryTy &V = *I; | 442 | 1.43k | remove(&V); | 443 | 1.43k | V.Destroy(Allocator); | 444 | 1.43k | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::erase(llvm::StringMapIterator<llvm::cl::Option*>) Line | Count | Source | 440 | 165 | void erase(iterator I) { | 441 | 165 | MapEntryTy &V = *I; | 442 | 165 | remove(&V); | 443 | 165 | V.Destroy(Allocator); | 444 | 165 | } |
llvm::StringMap<llvm::Comdat, llvm::MallocAllocator>::erase(llvm::StringMapIterator<llvm::Comdat>) Line | Count | Source | 440 | 8 | void erase(iterator I) { | 441 | 8 | MapEntryTy &V = *I; | 442 | 8 | remove(&V); | 443 | 8 | V.Destroy(Allocator); | 444 | 8 | } |
llvm::StringMap<clang::DirectoryEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::erase(llvm::StringMapIterator<clang::DirectoryEntry*>) Line | Count | Source | 440 | 564 | void erase(iterator I) { | 441 | 564 | MapEntryTy &V = *I; | 442 | 564 | remove(&V); | 443 | 564 | V.Destroy(Allocator); | 444 | 564 | } |
llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::erase(llvm::StringMapIterator<clang::FileEntry*>) Line | Count | Source | 440 | 1.17k | void erase(iterator I) { | 441 | 1.17k | MapEntryTy &V = *I; | 442 | 1.17k | remove(&V); | 443 | 1.17k | V.Destroy(Allocator); | 444 | 1.17k | } |
llvm::StringMap<char, llvm::MallocAllocator>::erase(llvm::StringMapIterator<char>) Line | Count | Source | 440 | 88 | void erase(iterator I) { | 441 | 88 | MapEntryTy &V = *I; | 442 | 88 | remove(&V); | 443 | 88 | V.Destroy(Allocator); | 444 | 88 | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMap<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u>, llvm::MallocAllocator>::erase(llvm::StringMapIterator<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >) Line | Count | Source | 440 | 10 | void erase(iterator I) { | 441 | 10 | MapEntryTy &V = *I; | 442 | 10 | remove(&V); | 443 | 10 | V.Destroy(Allocator); | 444 | 10 | } |
llvm::StringMap<llvm::SDNode*, llvm::MallocAllocator>::erase(llvm::StringMapIterator<llvm::SDNode*>) Line | Count | Source | 440 | 14.8k | void erase(iterator I) { | 441 | 14.8k | MapEntryTy &V = *I; | 442 | 14.8k | remove(&V); | 443 | 14.8k | V.Destroy(Allocator); | 444 | 14.8k | } |
llvm::StringMap<llvm::SmallVector<clang::TypoCorrection, 1u>, llvm::MallocAllocator>::erase(llvm::StringMapIterator<llvm::SmallVector<clang::TypoCorrection, 1u> >) Line | Count | Source | 440 | 8.78k | void erase(iterator I) { | 441 | 8.78k | MapEntryTy &V = *I; | 442 | 8.78k | remove(&V); | 443 | 8.78k | V.Destroy(Allocator); | 444 | 8.78k | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::erase(llvm::StringMapIterator<clang::PragmaHandler*>) Line | Count | Source | 440 | 1.00M | void erase(iterator I) { | 441 | 1.00M | MapEntryTy &V = *I; | 442 | 1.00M | remove(&V); | 443 | 1.00M | V.Destroy(Allocator); | 444 | 1.00M | } |
|
445 | | |
446 | 1.01M | bool erase(StringRef Key) { |
447 | 1.01M | iterator I = find(Key); |
448 | 1.01M | if (I == end()) return false2 ; |
449 | 1.01M | erase(I); |
450 | 1.01M | return true; |
451 | 1.01M | } llvm::StringMap<llvm::MCAsmMacro, llvm::MallocAllocator>::erase(llvm::StringRef) Line | Count | Source | 446 | 4 | bool erase(StringRef Key) { | 447 | 4 | iterator I = find(Key); | 448 | 4 | if (I == end()) return false0 ; | 449 | 4 | erase(I); | 450 | 4 | return true; | 451 | 4 | } |
AArch64AsmParser.cpp:llvm::StringMap<std::__1::pair<(anonymous namespace)::RegKind, unsigned int>, llvm::MallocAllocator>::erase(llvm::StringRef) Line | Count | Source | 446 | 8 | bool erase(StringRef Key) { | 447 | 8 | iterator I = find(Key); | 448 | 8 | if (I == end()) return false0 ; | 449 | 8 | erase(I); | 450 | 8 | return true; | 451 | 8 | } |
llvm::StringMap<unsigned int, llvm::MallocAllocator>::erase(llvm::StringRef) Line | Count | Source | 446 | 9 | bool erase(StringRef Key) { | 447 | 9 | iterator I = find(Key); | 448 | 9 | if (I == end()) return false2 ; | 449 | 7 | erase(I); | 450 | 7 | return true; | 451 | 7 | } |
llvm::StringMap<llvm::NamedMDNode*, llvm::MallocAllocator>::erase(llvm::StringRef) Line | Count | Source | 446 | 1.43k | bool erase(StringRef Key) { | 447 | 1.43k | iterator I = find(Key); | 448 | 1.43k | if (I == end()) return false0 ; | 449 | 1.43k | erase(I); | 450 | 1.43k | return true; | 451 | 1.43k | } |
llvm::StringMap<llvm::cl::Option*, llvm::MallocAllocator>::erase(llvm::StringRef) Line | Count | Source | 446 | 1 | bool erase(StringRef Key) { | 447 | 1 | iterator I = find(Key); | 448 | 1 | if (I == end()) return false0 ; | 449 | 1 | erase(I); | 450 | 1 | return true; | 451 | 1 | } |
llvm::StringMap<clang::DirectoryEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::erase(llvm::StringRef) Line | Count | Source | 446 | 564 | bool erase(StringRef Key) { | 447 | 564 | iterator I = find(Key); | 448 | 564 | if (I == end()) return false0 ; | 449 | 564 | erase(I); | 450 | 564 | return true; | 451 | 564 | } |
llvm::StringMap<clang::FileEntry*, llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator, 4096ul, 4096ul> >::erase(llvm::StringRef) Line | Count | Source | 446 | 1.17k | bool erase(StringRef Key) { | 447 | 1.17k | iterator I = find(Key); | 448 | 1.17k | if (I == end()) return false0 ; | 449 | 1.17k | erase(I); | 450 | 1.17k | return true; | 451 | 1.17k | } |
llvm::StringMap<char, llvm::MallocAllocator>::erase(llvm::StringRef) Line | Count | Source | 446 | 88 | bool erase(StringRef Key) { | 447 | 88 | iterator I = find(Key); | 448 | 88 | if (I == end()) return false0 ; | 449 | 88 | erase(I); | 450 | 88 | return true; | 451 | 88 | } |
llvm::StringMap<llvm::SDNode*, llvm::MallocAllocator>::erase(llvm::StringRef) Line | Count | Source | 446 | 14.8k | bool erase(StringRef Key) { | 447 | 14.8k | iterator I = find(Key); | 448 | 14.8k | if (I == end()) return false0 ; | 449 | 14.8k | erase(I); | 450 | 14.8k | return true; | 451 | 14.8k | } |
llvm::StringMap<clang::PragmaHandler*, llvm::MallocAllocator>::erase(llvm::StringRef) Line | Count | Source | 446 | 1.00M | bool erase(StringRef Key) { | 447 | 1.00M | iterator I = find(Key); | 448 | 1.00M | if (I == end()) return false0 ; | 449 | 1.00M | erase(I); | 450 | 1.00M | return true; | 451 | 1.00M | } |
|
452 | | }; |
453 | | |
454 | | template <typename DerivedTy, typename ValueTy> |
455 | | class StringMapIterBase |
456 | | : public iterator_facade_base<DerivedTy, std::forward_iterator_tag, |
457 | | ValueTy> { |
458 | | protected: |
459 | | StringMapEntryBase **Ptr = nullptr; |
460 | | |
461 | | public: |
462 | 4.69k | StringMapIterBase() = default; llvm::StringMapIterBase<llvm::StringMapIterator<bool>, llvm::StringMapEntry<bool> >::StringMapIterBase() Line | Count | Source | 462 | 4.60k | StringMapIterBase() = default; |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > > const>::StringMapIterBase() Line | Count | Source | 462 | 92 | StringMapIterBase() = default; |
|
463 | | |
464 | | explicit StringMapIterBase(StringMapEntryBase **Bucket, |
465 | | bool NoAdvance = false) |
466 | 1.20G | : Ptr(Bucket) { |
467 | 1.20G | if (!NoAdvance) AdvancePastEmptyBuckets()976M ; |
468 | 1.20G | } llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > >, llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 89.3k | : Ptr(Bucket) { | 467 | 89.3k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 89.3k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > >, llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 137k | : Ptr(Bucket) { | 467 | 137k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 137k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 17.2M | : Ptr(Bucket) { | 467 | 17.2M | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 17.2M | } |
AArch64AsmParser.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >, llvm::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 24.5k | : Ptr(Bucket) { | 467 | 24.5k | if (!NoAdvance) AdvancePastEmptyBuckets()19 ; | 468 | 24.5k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<int>, llvm::StringMapEntry<int> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 2.04M | : Ptr(Bucket) { | 467 | 2.04M | if (!NoAdvance) AdvancePastEmptyBuckets()947k ; | 468 | 2.04M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Value*>, llvm::StringMapEntry<llvm::Value*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 157M | : Ptr(Bucket) { | 467 | 157M | if (!NoAdvance) AdvancePastEmptyBuckets()13.9k ; | 468 | 157M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned int>, llvm::StringMapEntry<unsigned int> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 40.0M | : Ptr(Bucket) { | 467 | 40.0M | if (!NoAdvance) AdvancePastEmptyBuckets()39.4M ; | 468 | 40.0M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned int>, llvm::StringMapEntry<unsigned int> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 235k | : Ptr(Bucket) { | 467 | 235k | if (!NoAdvance) AdvancePastEmptyBuckets()5.56k ; | 468 | 235k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<int>, llvm::StringMapEntry<int> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.67k | : Ptr(Bucket) { | 467 | 1.67k | if (!NoAdvance) AdvancePastEmptyBuckets()1 ; | 468 | 1.67k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 116k | : Ptr(Bucket) { | 467 | 116k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 116k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.61M | : Ptr(Bucket) { | 467 | 1.61M | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 1.61M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<char>, llvm::StringMapEntry<char> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 292M | : Ptr(Bucket) { | 467 | 292M | if (!NoAdvance) AdvancePastEmptyBuckets()292M ; | 468 | 292M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.06M | : Ptr(Bucket) { | 467 | 1.06M | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 1.06M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >, llvm::StringMapEntry<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 669 | : Ptr(Bucket) { | 467 | 669 | if (!NoAdvance) AdvancePastEmptyBuckets()275 ; | 468 | 669 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 62.4k | : Ptr(Bucket) { | 467 | 62.4k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 62.4k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 180k | : Ptr(Bucket) { | 467 | 180k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 180k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::AsmToken>, llvm::StringMapEntry<llvm::AsmToken> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.44k | : Ptr(Bucket) { | 467 | 1.44k | if (!NoAdvance) AdvancePastEmptyBuckets()1 ; | 468 | 1.44k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 186k | : Ptr(Bucket) { | 467 | 186k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 186k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 9.14k | : Ptr(Bucket) { | 467 | 9.14k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 9.14k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::MCSymbol*>, llvm::StringMapEntry<llvm::MCSymbol*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 8.12k | : Ptr(Bucket) { | 467 | 8.12k | if (!NoAdvance) AdvancePastEmptyBuckets()1.46k ; | 468 | 8.12k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Function*>, llvm::StringMapEntry<llvm::Function*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 460 | : Ptr(Bucket) { | 467 | 460 | if (!NoAdvance) AdvancePastEmptyBuckets()380 ; | 468 | 460 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::RTLIB::Libcall>, llvm::StringMapEntry<llvm::RTLIB::Libcall> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 5.09k | : Ptr(Bucket) { | 467 | 5.09k | if (!NoAdvance) AdvancePastEmptyBuckets()4.87k ; | 468 | 5.09k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 88.5k | : Ptr(Bucket) { | 467 | 88.5k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 88.5k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned long long>, llvm::StringMapEntry<unsigned long long> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 575k | : Ptr(Bucket) { | 467 | 575k | if (!NoAdvance) AdvancePastEmptyBuckets()109 ; | 468 | 575k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 4.12M | : Ptr(Bucket) { | 467 | 4.12M | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 4.12M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 4.42k | : Ptr(Bucket) { | 467 | 4.42k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 4.42k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::GCStrategy*>, llvm::StringMapEntry<llvm::GCStrategy*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 188 | : Ptr(Bucket) { | 467 | 188 | if (!NoAdvance) AdvancePastEmptyBuckets()26 ; | 468 | 188 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 650 | : Ptr(Bucket) { | 467 | 650 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 650 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >, llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 4.35k | : Ptr(Bucket) { | 467 | 4.35k | if (!NoAdvance) AdvancePastEmptyBuckets()359 ; | 468 | 4.35k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::ConstantDataSequential*>, llvm::StringMapEntry<llvm::ConstantDataSequential*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.16M | : Ptr(Bucket) { | 467 | 1.16M | if (!NoAdvance) AdvancePastEmptyBuckets()984k ; | 468 | 1.16M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned char>, llvm::StringMapEntry<unsigned char> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 244k | : Ptr(Bucket) { | 467 | 244k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 244k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned char>, llvm::StringMapEntry<unsigned char> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 10.2k | : Ptr(Bucket) { | 467 | 10.2k | if (!NoAdvance) AdvancePastEmptyBuckets()5.11k ; | 468 | 10.2k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<unsigned int, unsigned int> >, llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 214 | : Ptr(Bucket) { | 467 | 214 | if (!NoAdvance) AdvancePastEmptyBuckets()176 ; | 468 | 214 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<unsigned int, unsigned int> >, llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 12 | : Ptr(Bucket) { | 467 | 12 | if (!NoAdvance) AdvancePastEmptyBuckets()6 ; | 468 | 12 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MDString>, llvm::StringMapEntry<llvm::MDString> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 717k | : Ptr(Bucket) { | 467 | 717k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 717k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::NamedMDNode*>, llvm::StringMapEntry<llvm::NamedMDNode*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 37.5M | : Ptr(Bucket) { | 467 | 37.5M | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 37.5M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::NamedMDNode*>, llvm::StringMapEntry<llvm::NamedMDNode*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 90.7k | : Ptr(Bucket) { | 467 | 90.7k | if (!NoAdvance) AdvancePastEmptyBuckets()87.8k ; | 468 | 90.7k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Comdat>, llvm::StringMapEntry<llvm::Comdat> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 37.9k | : Ptr(Bucket) { | 467 | 37.9k | if (!NoAdvance) AdvancePastEmptyBuckets()32.4k ; | 468 | 37.9k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::PassInfo const*>, llvm::StringMapEntry<llvm::PassInfo const*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 4.63k | : Ptr(Bucket) { | 467 | 4.63k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 4.63k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::PassInfo const*>, llvm::StringMapEntry<llvm::PassInfo const*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 32.8M | : Ptr(Bucket) { | 467 | 32.8M | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 32.8M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::StructType*>, llvm::StringMapEntry<llvm::StructType*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 273k | : Ptr(Bucket) { | 467 | 273k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 273k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::StructType*>, llvm::StringMapEntry<llvm::StructType*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 292 | : Ptr(Bucket) { | 467 | 292 | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 292 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Value*>, llvm::StringMapEntry<llvm::Value*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 15.6M | : Ptr(Bucket) { | 467 | 15.6M | if (!NoAdvance) AdvancePastEmptyBuckets()15.6M ; | 468 | 15.6M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Comdat>, llvm::StringMapEntry<llvm::Comdat> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 220k | : Ptr(Bucket) { | 467 | 220k | if (!NoAdvance) AdvancePastEmptyBuckets()3.74k ; | 468 | 220k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >, llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 2.85k | : Ptr(Bucket) { | 467 | 2.85k | if (!NoAdvance) AdvancePastEmptyBuckets()1.46k ; | 468 | 2.85k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.99k | : Ptr(Bucket) { | 467 | 1.99k | if (!NoAdvance) AdvancePastEmptyBuckets()278 ; | 468 | 1.99k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> >, llvm::StringMapEntry<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.07k | : Ptr(Bucket) { | 467 | 1.07k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 1.07k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >, llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 2.38k | : Ptr(Bucket) { | 467 | 2.38k | if (!NoAdvance) AdvancePastEmptyBuckets()228 ; | 468 | 2.38k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<char>, llvm::StringMapEntry<char> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 10.5M | : Ptr(Bucket) { | 467 | 10.5M | if (!NoAdvance) AdvancePastEmptyBuckets()2.99M ; | 468 | 10.5M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::sampleprof::FunctionSamples>, llvm::StringMapEntry<llvm::sampleprof::FunctionSamples> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.65k | : Ptr(Bucket) { | 467 | 1.65k | if (!NoAdvance) AdvancePastEmptyBuckets()922 ; | 468 | 1.65k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned long long>, llvm::StringMapEntry<unsigned long long> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 717k | : Ptr(Bucket) { | 467 | 717k | if (!NoAdvance) AdvancePastEmptyBuckets()1.77k ; | 468 | 717k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<bool>, llvm::StringMapEntry<bool> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 8.91M | : Ptr(Bucket) { | 467 | 8.91M | if (!NoAdvance) AdvancePastEmptyBuckets()8.29M ; | 468 | 8.91M | } |
GCOVProfiling.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<(anonymous namespace)::GCOVLines>, llvm::StringMapEntry<(anonymous namespace)::GCOVLines> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 290 | : Ptr(Bucket) { | 467 | 290 | if (!NoAdvance) AdvancePastEmptyBuckets()194 ; | 468 | 290 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MCSymbol*>, llvm::StringMapEntry<llvm::MCSymbol*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 8.20M | : Ptr(Bucket) { | 467 | 8.20M | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 8.20M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MCSectionMachO*>, llvm::StringMapEntry<llvm::MCSectionMachO*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 899k | : Ptr(Bucket) { | 467 | 899k | if (!NoAdvance899k ) AdvancePastEmptyBuckets(); | 468 | 899k | } |
AsmParser.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<(anonymous namespace)::AsmParser::DirectiveKind>, llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 6.67M | : Ptr(Bucket) { | 467 | 6.67M | if (!NoAdvance) AdvancePastEmptyBuckets()2.99M ; | 468 | 6.67M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >, llvm::StringMapEntry<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 705k | : Ptr(Bucket) { | 467 | 705k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 705k | } |
AsmParser.cpp:llvm::StringMapIterBase<llvm::StringMapConstIterator<(anonymous namespace)::AsmParser::DirectiveKind>, llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.68M | : Ptr(Bucket) { | 467 | 3.68M | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 3.68M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MCAsmMacro>, llvm::StringMapEntry<llvm::MCAsmMacro> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.48M | : Ptr(Bucket) { | 467 | 3.48M | if (!NoAdvance) AdvancePastEmptyBuckets()293 ; | 468 | 3.48M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >, llvm::StringMapEntry<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.73M | : Ptr(Bucket) { | 467 | 1.73M | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 1.73M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::cl::Option*>, llvm::StringMapEntry<llvm::cl::Option*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 156M | : Ptr(Bucket) { | 467 | 156M | if (!NoAdvance) AdvancePastEmptyBuckets()154M ; | 468 | 156M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::cl::Option*>, llvm::StringMapEntry<llvm::cl::Option*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 28.9k | : Ptr(Bucket) { | 467 | 28.9k | if (!NoAdvance) AdvancePastEmptyBuckets()15 ; | 468 | 28.9k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned long>, llvm::StringMapEntry<unsigned long> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 269k | : Ptr(Bucket) { | 467 | 269k | if (!NoAdvance) AdvancePastEmptyBuckets()264k ; | 468 | 269k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >, llvm::StringMapEntry<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 542 | : Ptr(Bucket) { | 467 | 542 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 542 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SpecialCaseList::Matcher>, llvm::StringMapEntry<llvm::SpecialCaseList::Matcher> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 542 | : Ptr(Bucket) { | 467 | 542 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 542 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >, llvm::StringMapEntry<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.31k | : Ptr(Bucket) { | 467 | 3.31k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 3.31k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::SpecialCaseList::Matcher>, llvm::StringMapEntry<llvm::SpecialCaseList::Matcher> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.39k | : Ptr(Bucket) { | 467 | 1.39k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 1.39k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >, llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 73 | : Ptr(Bucket) { | 467 | 73 | if (!NoAdvance) AdvancePastEmptyBuckets()72 ; | 468 | 73 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >, llvm::StringMapEntry<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 37 | : Ptr(Bucket) { | 467 | 37 | if (!NoAdvance) AdvancePastEmptyBuckets()18 ; | 468 | 37 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Timer>, llvm::StringMapEntry<llvm::Timer> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 9 | : Ptr(Bucket) { | 467 | 9 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 9 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::TimeRecord>, llvm::StringMapEntry<llvm::TimeRecord> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 18 | : Ptr(Bucket) { | 467 | 18 | if (!NoAdvance) AdvancePastEmptyBuckets()9 ; | 468 | 18 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.15M | : Ptr(Bucket) { | 467 | 3.15M | if (!NoAdvance) AdvancePastEmptyBuckets()140k ; | 468 | 3.15M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 870k | : Ptr(Bucket) { | 467 | 870k | if (!NoAdvance) AdvancePastEmptyBuckets()807k ; | 468 | 870k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<void*>, llvm::StringMapEntry<void*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 7 | : Ptr(Bucket) { | 467 | 7 | if (!NoAdvance) AdvancePastEmptyBuckets()3 ; | 468 | 7 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 148 | : Ptr(Bucket) { | 467 | 148 | if (!NoAdvance) AdvancePastEmptyBuckets()132 ; | 468 | 148 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::IdentifierInfo*>, llvm::StringMapEntry<clang::IdentifierInfo*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 363M | : Ptr(Bucket) { | 467 | 363M | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 363M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::DirectoryEntry*>, llvm::StringMapEntry<clang::DirectoryEntry*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.77M | : Ptr(Bucket) { | 467 | 1.77M | if (!NoAdvance) AdvancePastEmptyBuckets()1.77M ; | 468 | 1.77M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::FileEntry*>, llvm::StringMapEntry<clang::FileEntry*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 2.12M | : Ptr(Bucket) { | 467 | 2.12M | if (!NoAdvance) AdvancePastEmptyBuckets()2.12M ; | 468 | 2.12M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::FileEntry*>, llvm::StringMapEntry<clang::FileEntry*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 7.23k | : Ptr(Bucket) { | 467 | 7.23k | if (!NoAdvance) AdvancePastEmptyBuckets()3.61k ; | 468 | 7.23k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::vfs::Status>, llvm::StringMapEntry<llvm::vfs::Status> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 35 | : Ptr(Bucket) { | 467 | 35 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 35 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::IdentifierInfo*>, llvm::StringMapEntry<clang::IdentifierInfo*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 34.1k | : Ptr(Bucket) { | 467 | 34.1k | if (!NoAdvance) AdvancePastEmptyBuckets()17.0k ; | 468 | 34.1k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::OpenCLOptions::Info>, llvm::StringMapEntry<clang::OpenCLOptions::Info> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 8.98M | : Ptr(Bucket) { | 467 | 8.98M | if (!NoAdvance) AdvancePastEmptyBuckets()8.95M ; | 468 | 8.98M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.42k | : Ptr(Bucket) { | 467 | 1.42k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 1.42k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::TrackingVH<llvm::Constant> >, llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 64 | : Ptr(Bucket) { | 467 | 64 | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 64 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Constant*>, llvm::StringMapEntry<llvm::Constant*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 218 | : Ptr(Bucket) { | 467 | 218 | if (!NoAdvance) AdvancePastEmptyBuckets()98 ; | 468 | 218 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::GlobalVariable*>, llvm::StringMapEntry<llvm::GlobalVariable*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 4.33k | : Ptr(Bucket) { | 467 | 4.33k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 4.33k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>, llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 362 | : Ptr(Bucket) { | 467 | 362 | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 362 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::WeakTrackingVH>, llvm::StringMapEntry<llvm::WeakTrackingVH> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 6.94k | : Ptr(Bucket) { | 467 | 6.94k | if (!NoAdvance) AdvancePastEmptyBuckets()30 ; | 468 | 6.94k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::AssertingVH<llvm::Constant> >, llvm::StringMapEntry<llvm::AssertingVH<llvm::Constant> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 646 | : Ptr(Bucket) { | 467 | 646 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 646 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 7.87k | : Ptr(Bucket) { | 467 | 7.87k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 7.87k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 10.9k | : Ptr(Bucket) { | 467 | 10.9k | if (!NoAdvance) AdvancePastEmptyBuckets()1.43k ; | 468 | 10.9k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>, llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.19k | : Ptr(Bucket) { | 467 | 3.19k | if (!NoAdvance) AdvancePastEmptyBuckets()348 ; | 468 | 3.19k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<bool>, llvm::StringMapEntry<bool> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 500k | : Ptr(Bucket) { | 467 | 500k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 500k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TrackingVH<llvm::Constant> >, llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 35.1k | : Ptr(Bucket) { | 467 | 35.1k | if (!NoAdvance) AdvancePastEmptyBuckets()163 ; | 468 | 35.1k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::GlobalDecl>, llvm::StringMapEntry<clang::GlobalDecl> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 2.34M | : Ptr(Bucket) { | 467 | 2.34M | if (!NoAdvance) AdvancePastEmptyBuckets()2.34M ; | 468 | 2.34M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::ASTContext::SectionInfo>, llvm::StringMapEntry<clang::ASTContext::SectionInfo> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 17.8k | : Ptr(Bucket) { | 467 | 17.8k | if (!NoAdvance) AdvancePastEmptyBuckets()5.92k ; | 468 | 17.8k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::GlobalDecl>, llvm::StringMapEntry<clang::GlobalDecl> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 4.48k | : Ptr(Bucket) { | 467 | 4.48k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 4.48k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > >, llvm::StringMapEntry<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 53.6k | : Ptr(Bucket) { | 467 | 53.6k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 53.6k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<char const*>, llvm::StringMapEntry<char const*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 317 | : Ptr(Bucket) { | 467 | 317 | if (!NoAdvance) AdvancePastEmptyBuckets()105 ; | 468 | 317 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 7.32k | : Ptr(Bucket) { | 467 | 7.32k | if (!NoAdvance) AdvancePastEmptyBuckets()93 ; | 468 | 7.32k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.01M | : Ptr(Bucket) { | 467 | 3.01M | if (!NoAdvance) AdvancePastEmptyBuckets()3.01M ; | 468 | 3.01M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::SourceLocation>, llvm::StringMapEntry<clang::SourceLocation> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 145 | : Ptr(Bucket) { | 467 | 145 | if (!NoAdvance) AdvancePastEmptyBuckets()15 ; | 468 | 145 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::Module*>, llvm::StringMapEntry<clang::Module*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 442k | : Ptr(Bucket) { | 467 | 442k | if (!NoAdvance) AdvancePastEmptyBuckets()135 ; | 468 | 442k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::OpenCLOptions::Info>, llvm::StringMapEntry<clang::OpenCLOptions::Info> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 149k | : Ptr(Bucket) { | 467 | 149k | if (!NoAdvance) AdvancePastEmptyBuckets()546 ; | 468 | 149k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::LayoutOverrideSource::Layout>, llvm::StringMapEntry<clang::LayoutOverrideSource::Layout> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 121 | : Ptr(Bucket) { | 467 | 121 | if (!NoAdvance) AdvancePastEmptyBuckets()39 ; | 468 | 121 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::PrecompiledPreamble::PreambleFileHash>, llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.07k | : Ptr(Bucket) { | 467 | 1.07k | if (!NoAdvance) AdvancePastEmptyBuckets()157 ; | 468 | 1.07k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::PrecompiledPreamble::PreambleFileHash>, llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 490 | : Ptr(Bucket) { | 467 | 490 | if (!NoAdvance) AdvancePastEmptyBuckets()178 ; | 468 | 490 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>, llvm::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 28.6k | : Ptr(Bucket) { | 467 | 28.6k | if (!NoAdvance) AdvancePastEmptyBuckets()5.15k ; | 468 | 28.6k | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >, llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 25.8k | : Ptr(Bucket) { | 467 | 25.8k | if (!NoAdvance) AdvancePastEmptyBuckets()19 ; | 468 | 25.8k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<llvm::StringRef, bool> >, llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.80k | : Ptr(Bucket) { | 467 | 3.80k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 3.80k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::StringRef, bool> >, llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 9.66k | : Ptr(Bucket) { | 467 | 9.66k | if (!NoAdvance) AdvancePastEmptyBuckets()5.86k ; | 468 | 9.66k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::shared_ptr<clang::ModuleFileExtension> >, llvm::StringMapEntry<std::__1::shared_ptr<clang::ModuleFileExtension> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 119 | : Ptr(Bucket) { | 467 | 119 | if (!NoAdvance) AdvancePastEmptyBuckets()27 ; | 468 | 119 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallVector<unsigned int, 2u> >, llvm::StringMapEntry<llvm::SmallVector<unsigned int, 2u> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 108k | : Ptr(Bucket) { | 467 | 108k | if (!NoAdvance) AdvancePastEmptyBuckets()107k ; | 468 | 108k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::InMemoryModuleCache::PCM>, llvm::StringMapEntry<clang::InMemoryModuleCache::PCM> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 21.0k | : Ptr(Bucket) { | 467 | 21.0k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 21.0k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::InMemoryModuleCache::PCM>, llvm::StringMapEntry<clang::InMemoryModuleCache::PCM> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 11.8k | : Ptr(Bucket) { | 467 | 11.8k | if (!NoAdvance) AdvancePastEmptyBuckets()5.58k ; | 468 | 11.8k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > >, llvm::StringMapEntry<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 85 | : Ptr(Bucket) { | 467 | 85 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 85 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned int const*>, llvm::StringMapEntry<unsigned int const*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 10.9k | : Ptr(Bucket) { | 467 | 10.9k | if (!NoAdvance) AdvancePastEmptyBuckets()7.40k ; | 468 | 10.9k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MachineMemOperand::Flags>, llvm::StringMapEntry<llvm::MachineMemOperand::Flags> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 54 | : Ptr(Bucket) { | 467 | 54 | if (!NoAdvance) AdvancePastEmptyBuckets()6 ; | 468 | 54 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TargetRegisterClass const*>, llvm::StringMapEntry<llvm::TargetRegisterClass const*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 313k | : Ptr(Bucket) { | 467 | 313k | if (!NoAdvance) AdvancePastEmptyBuckets()232k ; | 468 | 313k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::RegisterBank const*>, llvm::StringMapEntry<llvm::RegisterBank const*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 32.1k | : Ptr(Bucket) { | 467 | 32.1k | if (!NoAdvance) AdvancePastEmptyBuckets()6.12k ; | 468 | 32.1k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::VRegInfo*>, llvm::StringMapEntry<llvm::VRegInfo*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 57 | : Ptr(Bucket) { | 467 | 57 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 57 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::AccelTableBase::HashData>, llvm::StringMapEntry<llvm::AccelTableBase::HashData> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 380k | : Ptr(Bucket) { | 467 | 380k | if (!NoAdvance) AdvancePastEmptyBuckets()323k ; | 468 | 380k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::DIE const*>, llvm::StringMapEntry<llvm::DIE const*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 89.9k | : Ptr(Bucket) { | 467 | 89.9k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 89.9k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DIE const*>, llvm::StringMapEntry<llvm::DIE const*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 6.97k | : Ptr(Bucket) { | 467 | 6.97k | if (!NoAdvance) AdvancePastEmptyBuckets()2.02k ; | 468 | 6.97k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::DwarfStringPoolEntry>, llvm::StringMapEntry<llvm::DwarfStringPoolEntry> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 428k | : Ptr(Bucket) { | 467 | 428k | if (!NoAdvance) AdvancePastEmptyBuckets()425k ; | 468 | 428k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> >, llvm::StringMapEntry<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 10 | : Ptr(Bucket) { | 467 | 10 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 10 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 38 | : Ptr(Bucket) { | 467 | 38 | if (!NoAdvance) AdvancePastEmptyBuckets()19 ; | 468 | 38 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned short>, llvm::StringMapEntry<unsigned short> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 143 | : Ptr(Bucket) { | 467 | 143 | if (!NoAdvance) AdvancePastEmptyBuckets()47 ; | 468 | 143 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SDNode*>, llvm::StringMapEntry<llvm::SDNode*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 48.7k | : Ptr(Bucket) { | 467 | 48.7k | if (!NoAdvance) AdvancePastEmptyBuckets()18.9k ; | 468 | 48.7k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::lto::LTO::GlobalResolution>, llvm::StringMapEntry<llvm::lto::LTO::GlobalResolution> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.57k | : Ptr(Bucket) { | 467 | 3.57k | if (!NoAdvance) AdvancePastEmptyBuckets()2.43k ; | 468 | 3.57k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > >, llvm::StringMapEntry<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 621 | : Ptr(Bucket) { | 467 | 621 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 621 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned long>, llvm::StringMapEntry<unsigned long> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.87k | : Ptr(Bucket) { | 467 | 3.87k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 3.87k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::Stmt*>, llvm::StringMapEntry<clang::Stmt*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 27.1k | : Ptr(Bucket) { | 467 | 27.1k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 27.1k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::Stmt*>, llvm::StringMapEntry<clang::Stmt*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 28.0k | : Ptr(Bucket) { | 467 | 28.0k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 28.0k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<FoundationClass>, llvm::StringMapEntry<FoundationClass> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 91 | : Ptr(Bucket) { | 467 | 91 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 91 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<FoundationClass>, llvm::StringMapEntry<FoundationClass> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 2.93k | : Ptr(Bucket) { | 467 | 2.93k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 2.93k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >, llvm::StringMapEntry<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 36 | : Ptr(Bucket) { | 467 | 36 | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 36 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >, llvm::StringMapEntry<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 53 | : Ptr(Bucket) { | 467 | 53 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 53 | } |
StdLibraryFunctionsChecker.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >, llvm::StringMapEntry<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.20k | : Ptr(Bucket) { | 467 | 3.20k | if (!NoAdvance) AdvancePastEmptyBuckets()286 ; | 468 | 3.20k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::ento::BugType*>, llvm::StringMapEntry<clang::ento::BugType*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 13.9k | : Ptr(Bucket) { | 467 | 13.9k | if (!NoAdvance) AdvancePastEmptyBuckets()1.57k ; | 468 | 13.9k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::ASTUnit*>, llvm::StringMapEntry<clang::ASTUnit*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 183 | : Ptr(Bucket) { | 467 | 183 | if (!NoAdvance) AdvancePastEmptyBuckets()57 ; | 468 | 183 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >, llvm::StringMapEntry<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 186 | : Ptr(Bucket) { | 467 | 186 | if (!NoAdvance) AdvancePastEmptyBuckets()72 ; | 468 | 186 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >, llvm::StringMapEntry<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 11 | : Ptr(Bucket) { | 467 | 11 | if (!NoAdvance) AdvancePastEmptyBuckets()3 ; | 468 | 11 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallVector<clang::TypoCorrection, 1u> >, llvm::StringMapEntry<llvm::SmallVector<clang::TypoCorrection, 1u> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 29.2k | : Ptr(Bucket) { | 467 | 29.2k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 29.2k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >, llvm::StringMapEntry<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.30k | : Ptr(Bucket) { | 467 | 1.30k | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 1.30k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >, llvm::StringMapEntry<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 38 | : Ptr(Bucket) { | 467 | 38 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 38 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TimeRecord>, llvm::StringMapEntry<llvm::TimeRecord> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 10 | : Ptr(Bucket) { | 467 | 10 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 10 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::StringLiteral*>, llvm::StringMapEntry<clang::StringLiteral*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 255 | : Ptr(Bucket) { | 467 | 255 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 255 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::comments::TParamCommandComment*>, llvm::StringMapEntry<clang::comments::TParamCommandComment*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 92 | : Ptr(Bucket) { | 467 | 92 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 92 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::FrameworkCacheEntry>, llvm::StringMapEntry<clang::FrameworkCacheEntry> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 10.2k | : Ptr(Bucket) { | 467 | 10.2k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 10.2k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::HeaderSearch::LookupFileCacheInfo>, llvm::StringMapEntry<clang::HeaderSearch::LookupFileCacheInfo> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 884k | : Ptr(Bucket) { | 467 | 884k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 884k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::StringSet<llvm::MallocAllocator> >, llvm::StringMapEntry<llvm::StringSet<llvm::MallocAllocator> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 5.14k | : Ptr(Bucket) { | 467 | 5.14k | if (!NoAdvance) AdvancePastEmptyBuckets()20 ; | 468 | 5.14k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::Module*>, llvm::StringMapEntry<clang::Module*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 142k | : Ptr(Bucket) { | 467 | 142k | if (!NoAdvance) AdvancePastEmptyBuckets()76.6k ; | 468 | 142k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::PragmaHandler*>, llvm::StringMapEntry<clang::PragmaHandler*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 4.61M | : Ptr(Bucket) { | 467 | 4.61M | if (!NoAdvance) AdvancePastEmptyBuckets()2.43M ; | 468 | 4.61M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::PragmaHandler*>, llvm::StringMapEntry<clang::PragmaHandler*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.54M | : Ptr(Bucket) { | 467 | 3.54M | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 3.54M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >, llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 2.35k | : Ptr(Bucket) { | 467 | 2.35k | if (!NoAdvance) AdvancePastEmptyBuckets()929 ; | 468 | 2.35k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Type*>, llvm::StringMapEntry<llvm::Type*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 4.34k | : Ptr(Bucket) { | 467 | 4.34k | if (!NoAdvance) AdvancePastEmptyBuckets()30 ; | 468 | 4.34k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::Type*, llvm::SMLoc> >, llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 183k | : Ptr(Bucket) { | 467 | 183k | if (!NoAdvance) AdvancePastEmptyBuckets()108k ; | 468 | 183k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Type*>, llvm::StringMapEntry<llvm::Type*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 91 | : Ptr(Bucket) { | 467 | 91 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 91 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::RecordStreamer::State>, llvm::StringMapEntry<llvm::RecordStreamer::State> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 706 | : Ptr(Bucket) { | 467 | 706 | if (!NoAdvance) AdvancePastEmptyBuckets()501 ; | 468 | 706 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::RecordStreamer::State>, llvm::StringMapEntry<llvm::RecordStreamer::State> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 148 | : Ptr(Bucket) { | 467 | 148 | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 148 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::GlobalValue const*>, llvm::StringMapEntry<llvm::GlobalValue const*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 289 | : Ptr(Bucket) { | 467 | 289 | if (!NoAdvance) AdvancePastEmptyBuckets()255 ; | 468 | 289 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::VRegInfo*>, llvm::StringMapEntry<llvm::VRegInfo*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 22.3k | : Ptr(Bucket) { | 467 | 22.3k | if (!NoAdvance) AdvancePastEmptyBuckets()32 ; | 468 | 22.3k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TinyPtrVector<lld::elf::OutputSection*> >, llvm::StringMapEntry<llvm::TinyPtrVector<lld::elf::OutputSection*> > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 387k | : Ptr(Bucket) { | 467 | 387k | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 387k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >, llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 78 | : Ptr(Bucket) { | 467 | 78 | if (!NoAdvance) AdvancePastEmptyBuckets()61 ; | 468 | 78 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >, llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 24 | : Ptr(Bucket) { | 467 | 24 | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 24 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >, llvm::StringMapEntry<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 378 | : Ptr(Bucket) { | 467 | 378 | if (!NoAdvance) AdvancePastEmptyBuckets()39 ; | 468 | 378 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<lld::mach_o::MachODylibFile*>, llvm::StringMapEntry<lld::mach_o::MachODylibFile*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 680 | : Ptr(Bucket) { | 467 | 680 | if (!NoAdvance) AdvancePastEmptyBuckets()234 ; | 468 | 680 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >, llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > > >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 5 | : Ptr(Bucket) { | 467 | 5 | if (!NoAdvance) AdvancePastEmptyBuckets(); | 468 | 5 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >, llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > > const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 44 | : Ptr(Bucket) { | 467 | 44 | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 44 | } |
MachONormalizedFileFromAtoms.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<(anonymous namespace)::Util::DylibInfo>, llvm::StringMapEntry<(anonymous namespace)::Util::DylibInfo> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 632 | : Ptr(Bucket) { | 467 | 632 | if (!NoAdvance) AdvancePastEmptyBuckets()408 ; | 468 | 632 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<lld::Atom const*>, llvm::StringMapEntry<lld::Atom const*> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 1.23k | : Ptr(Bucket) { | 467 | 1.23k | if (!NoAdvance) AdvancePastEmptyBuckets()396 ; | 468 | 1.23k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<lld::Atom const*>, llvm::StringMapEntry<lld::Atom const*> const>::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 142 | : Ptr(Bucket) { | 467 | 142 | if (!NoAdvance) AdvancePastEmptyBuckets()0 ; | 468 | 142 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::FileInfo::LineData>, llvm::StringMapEntry<llvm::FileInfo::LineData> >::StringMapIterBase(llvm::StringMapEntryBase**, bool) Line | Count | Source | 466 | 3.10k | : Ptr(Bucket) { | 467 | 3.10k | if (!NoAdvance) AdvancePastEmptyBuckets()3.07k ; | 468 | 3.10k | } |
|
469 | | |
470 | | DerivedTy &operator=(const DerivedTy &Other) { |
471 | | Ptr = Other.Ptr; |
472 | | return static_cast<DerivedTy &>(*this); |
473 | | } |
474 | | |
475 | 276M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::OpenCLOptions::Info>, llvm::StringMapEntry<clang::OpenCLOptions::Info> const>::operator==(llvm::StringMapConstIterator<clang::OpenCLOptions::Info> const&) const Line | Count | Source | 475 | 25.1k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::OpenCLOptions::Info>, llvm::StringMapEntry<clang::OpenCLOptions::Info> >::operator==(llvm::StringMapIterator<clang::OpenCLOptions::Info> const&) const Line | Count | Source | 475 | 1.42M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MCAsmMacro>, llvm::StringMapEntry<llvm::MCAsmMacro> >::operator==(llvm::StringMapIterator<llvm::MCAsmMacro> const&) const Line | Count | Source | 475 | 1.74M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
AArch64AsmParser.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >, llvm::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> > >::operator==(llvm::StringMapIterator<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> > const&) const Line | Count | Source | 475 | 12.2k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Value*>, llvm::StringMapEntry<llvm::Value*> const>::operator==(llvm::StringMapConstIterator<llvm::Value*> const&) const Line | Count | Source | 475 | 78.8M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned int>, llvm::StringMapEntry<unsigned int> const>::operator==(llvm::StringMapConstIterator<unsigned int> const&) const Line | Count | Source | 475 | 478k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<int>, llvm::StringMapEntry<int> const>::operator==(llvm::StringMapConstIterator<int> const&) const Line | Count | Source | 475 | 848 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<char>, llvm::StringMapEntry<char> >::operator==(llvm::StringMapIterator<char> const&) const Line | Count | Source | 475 | 1.69k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned int>, llvm::StringMapEntry<unsigned int> >::operator==(llvm::StringMapIterator<unsigned int> const&) const Line | Count | Source | 475 | 194k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >, llvm::StringMapEntry<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > > >::operator==(llvm::StringMapIterator<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > > const&) const Line | Count | Source | 475 | 197 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::AsmToken>, llvm::StringMapEntry<llvm::AsmToken> >::operator==(llvm::StringMapIterator<llvm::AsmToken> const&) const Line | Count | Source | 475 | 720 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::MCSymbol*>, llvm::StringMapEntry<llvm::MCSymbol*> const>::operator==(llvm::StringMapConstIterator<llvm::MCSymbol*> const&) const Line | Count | Source | 475 | 14.1k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Function*>, llvm::StringMapEntry<llvm::Function*> >::operator==(llvm::StringMapIterator<llvm::Function*> const&) const Line | Count | Source | 475 | 40 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned long long>, llvm::StringMapEntry<unsigned long long> const>::operator==(llvm::StringMapConstIterator<unsigned long long> const&) const Line | Count | Source | 475 | 287k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::sampleprof::FunctionSamples>, llvm::StringMapEntry<llvm::sampleprof::FunctionSamples> >::operator==(llvm::StringMapIterator<llvm::sampleprof::FunctionSamples> const&) const Line | Count | Source | 475 | 946 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >, llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > > const>::operator==(llvm::StringMapConstIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > > const&) const Line | Count | Source | 475 | 2.50k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::GCStrategy*>, llvm::StringMapEntry<llvm::GCStrategy*> >::operator==(llvm::StringMapIterator<llvm::GCStrategy*> const&) const Line | Count | Source | 475 | 81 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::ConstantDataSequential*>, llvm::StringMapEntry<llvm::ConstantDataSequential*> >::operator==(llvm::StringMapIterator<llvm::ConstantDataSequential*> const&) const Line | Count | Source | 475 | 179k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned char>, llvm::StringMapEntry<unsigned char> const>::operator==(llvm::StringMapConstIterator<unsigned char> const&) const Line | Count | Source | 475 | 16.2k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<unsigned int, unsigned int> >, llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> > >::operator==(llvm::StringMapIterator<std::__1::pair<unsigned int, unsigned int> > const&) const Line | Count | Source | 475 | 19 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<unsigned int, unsigned int> >, llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> > const>::operator==(llvm::StringMapConstIterator<std::__1::pair<unsigned int, unsigned int> > const&) const Line | Count | Source | 475 | 15 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::NamedMDNode*>, llvm::StringMapEntry<llvm::NamedMDNode*> const>::operator==(llvm::StringMapConstIterator<llvm::NamedMDNode*> const&) const Line | Count | Source | 475 | 18.7M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::NamedMDNode*>, llvm::StringMapEntry<llvm::NamedMDNode*> >::operator==(llvm::StringMapIterator<llvm::NamedMDNode*> const&) const Line | Count | Source | 475 | 1.43k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::PassInfo const*>, llvm::StringMapEntry<llvm::PassInfo const*> const>::operator==(llvm::StringMapConstIterator<llvm::PassInfo const*> const&) const Line | Count | Source | 475 | 2.31k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::StructType*>, llvm::StringMapEntry<llvm::StructType*> const>::operator==(llvm::StringMapConstIterator<llvm::StructType*> const&) const Line | Count | Source | 475 | 146 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Comdat>, llvm::StringMapEntry<llvm::Comdat> const>::operator==(llvm::StringMapConstIterator<llvm::Comdat> const&) const Line | Count | Source | 475 | 138k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > > const>::operator==(llvm::StringMapConstIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > > const&) const Line | Count | Source | 475 | 1.37k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >, llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > > >::operator==(llvm::StringMapIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > > const&) const Line | Count | Source | 475 | 1.00k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >, llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > > const>::operator==(llvm::StringMapConstIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > > const&) const Line | Count | Source | 475 | 1.36k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<char>, llvm::StringMapEntry<char> const>::operator==(llvm::StringMapConstIterator<char> const&) const Line | Count | Source | 475 | 8.78M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Value*>, llvm::StringMapEntry<llvm::Value*> >::operator==(llvm::StringMapIterator<llvm::Value*> const&) const Line | Count | Source | 475 | 564 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned long long>, llvm::StringMapEntry<unsigned long long> >::operator==(llvm::StringMapIterator<unsigned long long> const&) const Line | Count | Source | 475 | 358k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<bool>, llvm::StringMapEntry<bool> >::operator==(llvm::StringMapIterator<bool> const&) const Line | Count | Source | 475 | 1.12M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
GCOVProfiling.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<(anonymous namespace)::GCOVLines>, llvm::StringMapEntry<(anonymous namespace)::GCOVLines> >::operator==(llvm::StringMapIterator<(anonymous namespace)::GCOVLines> const&) const Line | Count | Source | 475 | 174 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
AsmParser.cpp:llvm::StringMapIterBase<llvm::StringMapConstIterator<(anonymous namespace)::AsmParser::DirectiveKind>, llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind> const>::operator==(llvm::StringMapConstIterator<(anonymous namespace)::AsmParser::DirectiveKind> const&) const Line | Count | Source | 475 | 1.84M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >, llvm::StringMapEntry<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> > const>::operator==(llvm::StringMapConstIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> > const&) const Line | Count | Source | 475 | 869k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::cl::Option*>, llvm::StringMapEntry<llvm::cl::Option*> >::operator==(llvm::StringMapIterator<llvm::cl::Option*> const&) const Line | Count | Source | 475 | 105M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::cl::Option*>, llvm::StringMapEntry<llvm::cl::Option*> const>::operator==(llvm::StringMapConstIterator<llvm::cl::Option*> const&) const Line | Count | Source | 475 | 31.0k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned long>, llvm::StringMapEntry<unsigned long> >::operator==(llvm::StringMapIterator<unsigned long> const&) const Line | Count | Source | 475 | 542 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >, llvm::StringMapEntry<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> > const>::operator==(llvm::StringMapConstIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> > const&) const Line | Count | Source | 475 | 1.65k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::SpecialCaseList::Matcher>, llvm::StringMapEntry<llvm::SpecialCaseList::Matcher> const>::operator==(llvm::StringMapConstIterator<llvm::SpecialCaseList::Matcher> const&) const Line | Count | Source | 475 | 695 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >, llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > > >::operator==(llvm::StringMapIterator<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > > const&) const Line | Count | Source | 475 | 11 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::TimeRecord>, llvm::StringMapEntry<llvm::TimeRecord> const>::operator==(llvm::StringMapConstIterator<llvm::TimeRecord> const&) const llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >, llvm::StringMapEntry<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > > >::operator==(llvm::StringMapIterator<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > > const&) const Line | Count | Source | 475 | 23 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > > const>::operator==(llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > > const&) const Line | Count | Source | 475 | 19 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > > >::operator==(llvm::StringMapIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > > const&) const Line | Count | Source | 475 | 1.50M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > > >::operator==(llvm::StringMapIterator<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > > const&) const Line | Count | Source | 475 | 586k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<void*>, llvm::StringMapEntry<void*> >::operator==(llvm::StringMapIterator<void*> const&) const Line | Count | Source | 475 | 2 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > > >::operator==(llvm::StringMapIterator<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > > const&) const Line | Count | Source | 475 | 40 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::DirectoryEntry*>, llvm::StringMapEntry<clang::DirectoryEntry*> >::operator==(llvm::StringMapIterator<clang::DirectoryEntry*> const&) const Line | Count | Source | 475 | 564 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::FileEntry*>, llvm::StringMapEntry<clang::FileEntry*> >::operator==(llvm::StringMapIterator<clang::FileEntry*> const&) const Line | Count | Source | 475 | 1.17k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::FileEntry*>, llvm::StringMapEntry<clang::FileEntry*> const>::operator==(llvm::StringMapConstIterator<clang::FileEntry*> const&) const Line | Count | Source | 475 | 81.0k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::IdentifierInfo*>, llvm::StringMapEntry<clang::IdentifierInfo*> const>::operator==(llvm::StringMapConstIterator<clang::IdentifierInfo*> const&) const Line | Count | Source | 475 | 46.8M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::TrackingVH<llvm::Constant> >, llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> > const>::operator==(llvm::StringMapConstIterator<llvm::TrackingVH<llvm::Constant> > const&) const Line | Count | Source | 475 | 32 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>, llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar> const>::operator==(llvm::StringMapConstIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar> const&) const Line | Count | Source | 475 | 181 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Constant*>, llvm::StringMapEntry<llvm::Constant*> >::operator==(llvm::StringMapIterator<llvm::Constant*> const&) const Line | Count | Source | 475 | 63 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::WeakTrackingVH>, llvm::StringMapEntry<llvm::WeakTrackingVH> >::operator==(llvm::StringMapIterator<llvm::WeakTrackingVH> const&) const Line | Count | Source | 475 | 3.47k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > > const>::operator==(llvm::StringMapConstIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > > const&) const Line | Count | Source | 475 | 8.98k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>, llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar> >::operator==(llvm::StringMapIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar> const&) const Line | Count | Source | 475 | 1.58k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<bool>, llvm::StringMapEntry<bool> const>::operator==(llvm::StringMapConstIterator<bool> const&) const Line | Count | Source | 475 | 250k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TrackingVH<llvm::Constant> >, llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> > >::operator==(llvm::StringMapIterator<llvm::TrackingVH<llvm::Constant> > const&) const Line | Count | Source | 475 | 17.6k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::GlobalDecl>, llvm::StringMapEntry<clang::GlobalDecl> >::operator==(llvm::StringMapIterator<clang::GlobalDecl> const&) const Line | Count | Source | 475 | 18 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::GlobalDecl>, llvm::StringMapEntry<clang::GlobalDecl> const>::operator==(llvm::StringMapConstIterator<clang::GlobalDecl> const&) const Line | Count | Source | 475 | 2.24k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > const>::operator==(llvm::StringMapConstIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > const&) const Line | Count | Source | 475 | 4.11k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<char const*>, llvm::StringMapEntry<char const*> >::operator==(llvm::StringMapIterator<char const*> const&) const Line | Count | Source | 475 | 106 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<int>, llvm::StringMapEntry<int> >::operator==(llvm::StringMapIterator<int> const&) const Line | Count | Source | 475 | 948k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::SourceLocation>, llvm::StringMapEntry<clang::SourceLocation> >::operator==(llvm::StringMapIterator<clang::SourceLocation> const&) const Line | Count | Source | 475 | 65 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::Module*>, llvm::StringMapEntry<clang::Module*> const>::operator==(llvm::StringMapConstIterator<clang::Module*> const&) const Line | Count | Source | 475 | 222k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::LayoutOverrideSource::Layout>, llvm::StringMapEntry<clang::LayoutOverrideSource::Layout> >::operator==(llvm::StringMapIterator<clang::LayoutOverrideSource::Layout> const&) const Line | Count | Source | 475 | 41 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >::operator==(llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > const&) const Line | Count | Source | 475 | 92.3k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::PrecompiledPreamble::PreambleFileHash>, llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash> const>::operator==(llvm::StringMapConstIterator<clang::PrecompiledPreamble::PreambleFileHash> const&) const Line | Count | Source | 475 | 701 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::PrecompiledPreamble::PreambleFileHash>, llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash> >::operator==(llvm::StringMapIterator<clang::PrecompiledPreamble::PreambleFileHash> const&) const Line | Count | Source | 475 | 460 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>, llvm::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker> >::operator==(llvm::StringMapIterator<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker> const&) const Line | Count | Source | 475 | 12.9k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
VerifyDiagnosticConsumer.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >, llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> > >::operator==(llvm::StringMapIterator<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> > const&) const Line | Count | Source | 475 | 12.9k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<llvm::StringRef, bool> >, llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> > const>::operator==(llvm::StringMapConstIterator<std::__1::pair<llvm::StringRef, bool> > const&) const Line | Count | Source | 475 | 1.90k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::StringRef, bool> >, llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> > >::operator==(llvm::StringMapIterator<std::__1::pair<llvm::StringRef, bool> > const&) const Line | Count | Source | 475 | 1.89k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::shared_ptr<clang::ModuleFileExtension> >, llvm::StringMapEntry<std::__1::shared_ptr<clang::ModuleFileExtension> > >::operator==(llvm::StringMapIterator<std::__1::shared_ptr<clang::ModuleFileExtension> > const&) const Line | Count | Source | 475 | 46 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallVector<unsigned int, 2u> >, llvm::StringMapEntry<llvm::SmallVector<unsigned int, 2u> > >::operator==(llvm::StringMapIterator<llvm::SmallVector<unsigned int, 2u> > const&) const Line | Count | Source | 475 | 90.4k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::InMemoryModuleCache::PCM>, llvm::StringMapEntry<clang::InMemoryModuleCache::PCM> const>::operator==(llvm::StringMapConstIterator<clang::InMemoryModuleCache::PCM> const&) const Line | Count | Source | 475 | 10.5k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned int const*>, llvm::StringMapEntry<unsigned int const*> >::operator==(llvm::StringMapIterator<unsigned int const*> const&) const Line | Count | Source | 475 | 1.79k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MachineMemOperand::Flags>, llvm::StringMapEntry<llvm::MachineMemOperand::Flags> >::operator==(llvm::StringMapIterator<llvm::MachineMemOperand::Flags> const&) const Line | Count | Source | 475 | 24 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TargetRegisterClass const*>, llvm::StringMapEntry<llvm::TargetRegisterClass const*> >::operator==(llvm::StringMapIterator<llvm::TargetRegisterClass const*> const&) const Line | Count | Source | 475 | 40.5k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::RegisterBank const*>, llvm::StringMapEntry<llvm::RegisterBank const*> >::operator==(llvm::StringMapIterator<llvm::RegisterBank const*> const&) const Line | Count | Source | 475 | 13.0k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::AccelTableBase::HashData>, llvm::StringMapEntry<llvm::AccelTableBase::HashData> >::operator==(llvm::StringMapIterator<llvm::AccelTableBase::HashData> const&) const Line | Count | Source | 475 | 247k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DIE const*>, llvm::StringMapEntry<llvm::DIE const*> const>::operator==(llvm::StringMapConstIterator<llvm::DIE const*> const&) const Line | Count | Source | 475 | 73.8k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::DwarfStringPoolEntry>, llvm::StringMapEntry<llvm::DwarfStringPoolEntry> >::operator==(llvm::StringMapIterator<llvm::DwarfStringPoolEntry> const&) const Line | Count | Source | 475 | 86.5k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > > const>::operator==(llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > > const&) const Line | Count | Source | 475 | 80 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned short>, llvm::StringMapEntry<unsigned short> >::operator==(llvm::StringMapIterator<unsigned short> const&) const Line | Count | Source | 475 | 48 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SDNode*>, llvm::StringMapEntry<llvm::SDNode*> >::operator==(llvm::StringMapIterator<llvm::SDNode*> const&) const Line | Count | Source | 475 | 14.8k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::lto::LTO::GlobalResolution>, llvm::StringMapEntry<llvm::lto::LTO::GlobalResolution> >::operator==(llvm::StringMapIterator<llvm::lto::LTO::GlobalResolution> const&) const Line | Count | Source | 475 | 3.75k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned long>, llvm::StringMapEntry<unsigned long> const>::operator==(llvm::StringMapConstIterator<unsigned long> const&) const Line | Count | Source | 475 | 1.93k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::Stmt*>, llvm::StringMapEntry<clang::Stmt*> const>::operator==(llvm::StringMapConstIterator<clang::Stmt*> const&) const Line | Count | Source | 475 | 14.0k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<FoundationClass>, llvm::StringMapEntry<FoundationClass> const>::operator==(llvm::StringMapConstIterator<FoundationClass> const&) const Line | Count | Source | 475 | 1.46k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >, llvm::StringMapEntry<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > > const>::operator==(llvm::StringMapConstIterator<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > > const&) const Line | Count | Source | 475 | 18 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
StdLibraryFunctionsChecker.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >, llvm::StringMapEntry<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > > >::operator==(llvm::StringMapIterator<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > > const&) const Line | Count | Source | 475 | 1.45k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::ento::BugType*>, llvm::StringMapEntry<clang::ento::BugType*> >::operator==(llvm::StringMapIterator<clang::ento::BugType*> const&) const Line | Count | Source | 475 | 7.10k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::ASTUnit*>, llvm::StringMapEntry<clang::ASTUnit*> >::operator==(llvm::StringMapIterator<clang::ASTUnit*> const&) const Line | Count | Source | 475 | 63 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >, llvm::StringMapEntry<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > > >::operator==(llvm::StringMapIterator<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > > const&) const Line | Count | Source | 475 | 57 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::ASTContext::SectionInfo>, llvm::StringMapEntry<clang::ASTContext::SectionInfo> >::operator==(llvm::StringMapIterator<clang::ASTContext::SectionInfo> const&) const Line | Count | Source | 475 | 5.94k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >, llvm::StringMapEntry<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > > >::operator==(llvm::StringMapIterator<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > > const&) const Line | Count | Source | 475 | 4 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >, llvm::StringMapEntry<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> > const>::operator==(llvm::StringMapConstIterator<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> > const&) const Line | Count | Source | 475 | 653 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::StringSet<llvm::MallocAllocator> >, llvm::StringMapEntry<llvm::StringSet<llvm::MallocAllocator> > >::operator==(llvm::StringMapIterator<llvm::StringSet<llvm::MallocAllocator> > const&) const Line | Count | Source | 475 | 2.56k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::Module*>, llvm::StringMapEntry<clang::Module*> >::operator==(llvm::StringMapIterator<clang::Module*> const&) const Line | Count | Source | 475 | 107k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::PragmaHandler*>, llvm::StringMapEntry<clang::PragmaHandler*> >::operator==(llvm::StringMapIterator<clang::PragmaHandler*> const&) const Line | Count | Source | 475 | 2.14M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::PragmaHandler*>, llvm::StringMapEntry<clang::PragmaHandler*> const>::operator==(llvm::StringMapConstIterator<clang::PragmaHandler*> const&) const Line | Count | Source | 475 | 1.77M | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Type*>, llvm::StringMapEntry<llvm::Type*> const>::operator==(llvm::StringMapConstIterator<llvm::Type*> const&) const Line | Count | Source | 475 | 2.22k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::Type*, llvm::SMLoc> >, llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> > >::operator==(llvm::StringMapIterator<std::__1::pair<llvm::Type*, llvm::SMLoc> > const&) const Line | Count | Source | 475 | 51.6k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Comdat>, llvm::StringMapEntry<llvm::Comdat> >::operator==(llvm::StringMapIterator<llvm::Comdat> const&) const Line | Count | Source | 475 | 3.23k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::RecordStreamer::State>, llvm::StringMapEntry<llvm::RecordStreamer::State> const>::operator==(llvm::StringMapConstIterator<llvm::RecordStreamer::State> const&) const Line | Count | Source | 475 | 338 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::RecordStreamer::State>, llvm::StringMapEntry<llvm::RecordStreamer::State> >::operator==(llvm::StringMapIterator<llvm::RecordStreamer::State> const&) const Line | Count | Source | 475 | 62 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::GlobalValue const*>, llvm::StringMapEntry<llvm::GlobalValue const*> >::operator==(llvm::StringMapIterator<llvm::GlobalValue const*> const&) const Line | Count | Source | 475 | 17 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::VRegInfo*>, llvm::StringMapEntry<llvm::VRegInfo*> const>::operator==(llvm::StringMapConstIterator<llvm::VRegInfo*> const&) const Line | Count | Source | 475 | 11.2k | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >, llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > > const>::operator==(llvm::StringMapConstIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > > const&) const Line | Count | Source | 475 | 12 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >, llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > > >::operator==(llvm::StringMapIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > > const&) const Line | Count | Source | 475 | 59 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >, llvm::StringMapEntry<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > > >::operator==(llvm::StringMapIterator<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > > const&) const Line | Count | Source | 475 | 194 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<lld::Atom const*>, llvm::StringMapEntry<lld::Atom const*> >::operator==(llvm::StringMapIterator<lld::Atom const*> const&) const Line | Count | Source | 475 | 417 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<lld::mach_o::MachODylibFile*>, llvm::StringMapEntry<lld::mach_o::MachODylibFile*> >::operator==(llvm::StringMapIterator<lld::mach_o::MachODylibFile*> const&) const Line | Count | Source | 475 | 223 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >, llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > > const>::operator==(llvm::StringMapConstIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > > const&) const Line | Count | Source | 475 | 22 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
MachONormalizedFileFromAtoms.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<(anonymous namespace)::Util::DylibInfo>, llvm::StringMapEntry<(anonymous namespace)::Util::DylibInfo> >::operator==(llvm::StringMapIterator<(anonymous namespace)::Util::DylibInfo> const&) const Line | Count | Source | 475 | 112 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<lld::Atom const*>, llvm::StringMapEntry<lld::Atom const*> const>::operator==(llvm::StringMapConstIterator<lld::Atom const*> const&) const Line | Count | Source | 475 | 71 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::FileInfo::LineData>, llvm::StringMapEntry<llvm::FileInfo::LineData> >::operator==(llvm::StringMapIterator<llvm::FileInfo::LineData> const&) const Line | Count | Source | 475 | 74 | bool operator==(const DerivedTy &RHS) const { return Ptr == RHS.Ptr; } |
|
476 | | |
477 | 160M | DerivedTy &operator++() { // Preincrement |
478 | 160M | ++Ptr; |
479 | 160M | AdvancePastEmptyBuckets(); |
480 | 160M | return static_cast<DerivedTy &>(*this); |
481 | 160M | } llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::OpenCLOptions::Info>, llvm::StringMapEntry<clang::OpenCLOptions::Info> const>::operator++() Line | Count | Source | 477 | 22.3k | DerivedTy &operator++() { // Preincrement | 478 | 22.3k | ++Ptr; | 479 | 22.3k | AdvancePastEmptyBuckets(); | 480 | 22.3k | return static_cast<DerivedTy &>(*this); | 481 | 22.3k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::OpenCLOptions::Info>, llvm::StringMapEntry<clang::OpenCLOptions::Info> >::operator++() Line | Count | Source | 477 | 1.39M | DerivedTy &operator++() { // Preincrement | 478 | 1.39M | ++Ptr; | 479 | 1.39M | AdvancePastEmptyBuckets(); | 480 | 1.39M | return static_cast<DerivedTy &>(*this); | 481 | 1.39M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::MCSymbol*>, llvm::StringMapEntry<llvm::MCSymbol*> const>::operator++() Line | Count | Source | 477 | 10.0k | DerivedTy &operator++() { // Preincrement | 478 | 10.0k | ++Ptr; | 479 | 10.0k | AdvancePastEmptyBuckets(); | 480 | 10.0k | return static_cast<DerivedTy &>(*this); | 481 | 10.0k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned long long>, llvm::StringMapEntry<unsigned long long> const>::operator++() Line | Count | Source | 477 | 167 | DerivedTy &operator++() { // Preincrement | 478 | 167 | ++Ptr; | 479 | 167 | AdvancePastEmptyBuckets(); | 480 | 167 | return static_cast<DerivedTy &>(*this); | 481 | 167 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >, llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > > const>::operator++() Line | Count | Source | 477 | 536 | DerivedTy &operator++() { // Preincrement | 478 | 536 | ++Ptr; | 479 | 536 | AdvancePastEmptyBuckets(); | 480 | 536 | return static_cast<DerivedTy &>(*this); | 481 | 536 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned int>, llvm::StringMapEntry<unsigned int> const>::operator++() Line | Count | Source | 477 | 361k | DerivedTy &operator++() { // Preincrement | 478 | 361k | ++Ptr; | 479 | 361k | AdvancePastEmptyBuckets(); | 480 | 361k | return static_cast<DerivedTy &>(*this); | 481 | 361k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::ConstantDataSequential*>, llvm::StringMapEntry<llvm::ConstantDataSequential*> >::operator++() Line | Count | Source | 477 | 84.9k | DerivedTy &operator++() { // Preincrement | 478 | 84.9k | ++Ptr; | 479 | 84.9k | AdvancePastEmptyBuckets(); | 480 | 84.9k | return static_cast<DerivedTy &>(*this); | 481 | 84.9k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned char>, llvm::StringMapEntry<unsigned char> const>::operator++() Line | Count | Source | 477 | 11.0k | DerivedTy &operator++() { // Preincrement | 478 | 11.0k | ++Ptr; | 479 | 11.0k | AdvancePastEmptyBuckets(); | 480 | 11.0k | return static_cast<DerivedTy &>(*this); | 481 | 11.0k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<unsigned int, unsigned int> >, llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> > const>::operator++() Line | Count | Source | 477 | 12 | DerivedTy &operator++() { // Preincrement | 478 | 12 | ++Ptr; | 479 | 12 | AdvancePastEmptyBuckets(); | 480 | 12 | return static_cast<DerivedTy &>(*this); | 481 | 12 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Comdat>, llvm::StringMapEntry<llvm::Comdat> const>::operator++() Line | Count | Source | 477 | 28.0k | DerivedTy &operator++() { // Preincrement | 478 | 28.0k | ++Ptr; | 479 | 28.0k | AdvancePastEmptyBuckets(); | 480 | 28.0k | return static_cast<DerivedTy &>(*this); | 481 | 28.0k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > > const>::operator++() Line | Count | Source | 477 | 512 | DerivedTy &operator++() { // Preincrement | 478 | 512 | ++Ptr; | 479 | 512 | AdvancePastEmptyBuckets(); | 480 | 512 | return static_cast<DerivedTy &>(*this); | 481 | 512 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >, llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > > >::operator++() Line | Count | Source | 477 | 166 | DerivedTy &operator++() { // Preincrement | 478 | 166 | ++Ptr; | 479 | 166 | AdvancePastEmptyBuckets(); | 480 | 166 | return static_cast<DerivedTy &>(*this); | 481 | 166 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >, llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > > const>::operator++() Line | Count | Source | 477 | 247 | DerivedTy &operator++() { // Preincrement | 478 | 247 | ++Ptr; | 479 | 247 | AdvancePastEmptyBuckets(); | 480 | 247 | return static_cast<DerivedTy &>(*this); | 481 | 247 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::sampleprof::FunctionSamples>, llvm::StringMapEntry<llvm::sampleprof::FunctionSamples> >::operator++() Line | Count | Source | 477 | 443 | DerivedTy &operator++() { // Preincrement | 478 | 443 | ++Ptr; | 479 | 443 | AdvancePastEmptyBuckets(); | 480 | 443 | return static_cast<DerivedTy &>(*this); | 481 | 443 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Value*>, llvm::StringMapEntry<llvm::Value*> >::operator++() Line | Count | Source | 477 | 426 | DerivedTy &operator++() { // Preincrement | 478 | 426 | ++Ptr; | 479 | 426 | AdvancePastEmptyBuckets(); | 480 | 426 | return static_cast<DerivedTy &>(*this); | 481 | 426 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned long long>, llvm::StringMapEntry<unsigned long long> >::operator++() Line | Count | Source | 477 | 145 | DerivedTy &operator++() { // Preincrement | 478 | 145 | ++Ptr; | 479 | 145 | AdvancePastEmptyBuckets(); | 480 | 145 | return static_cast<DerivedTy &>(*this); | 481 | 145 | } |
GCOVProfiling.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<(anonymous namespace)::GCOVLines>, llvm::StringMapEntry<(anonymous namespace)::GCOVLines> >::operator++() Line | Count | Source | 477 | 84 | DerivedTy &operator++() { // Preincrement | 478 | 84 | ++Ptr; | 479 | 84 | AdvancePastEmptyBuckets(); | 480 | 84 | return static_cast<DerivedTy &>(*this); | 481 | 84 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<char>, llvm::StringMapEntry<char> const>::operator++() Line | Count | Source | 477 | 3.51M | DerivedTy &operator++() { // Preincrement | 478 | 3.51M | ++Ptr; | 479 | 3.51M | AdvancePastEmptyBuckets(); | 480 | 3.51M | return static_cast<DerivedTy &>(*this); | 481 | 3.51M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::cl::Option*>, llvm::StringMapEntry<llvm::cl::Option*> const>::operator++() Line | Count | Source | 477 | 10.7k | DerivedTy &operator++() { // Preincrement | 478 | 10.7k | ++Ptr; | 479 | 10.7k | AdvancePastEmptyBuckets(); | 480 | 10.7k | return static_cast<DerivedTy &>(*this); | 481 | 10.7k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::cl::Option*>, llvm::StringMapEntry<llvm::cl::Option*> >::operator++() Line | Count | Source | 477 | 105M | DerivedTy &operator++() { // Preincrement | 478 | 105M | ++Ptr; | 479 | 105M | AdvancePastEmptyBuckets(); | 480 | 105M | return static_cast<DerivedTy &>(*this); | 481 | 105M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >, llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > > >::operator++() Line | Count | Source | 477 | 10 | DerivedTy &operator++() { // Preincrement | 478 | 10 | ++Ptr; | 479 | 10 | AdvancePastEmptyBuckets(); | 480 | 10 | return static_cast<DerivedTy &>(*this); | 481 | 10 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::TimeRecord>, llvm::StringMapEntry<llvm::TimeRecord> const>::operator++() llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >, llvm::StringMapEntry<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > > >::operator++() Line | Count | Source | 477 | 9 | DerivedTy &operator++() { // Preincrement | 478 | 9 | ++Ptr; | 479 | 9 | AdvancePastEmptyBuckets(); | 480 | 9 | return static_cast<DerivedTy &>(*this); | 481 | 9 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > > const>::operator++() Line | Count | Source | 477 | 10 | DerivedTy &operator++() { // Preincrement | 478 | 10 | ++Ptr; | 479 | 10 | AdvancePastEmptyBuckets(); | 480 | 10 | return static_cast<DerivedTy &>(*this); | 481 | 10 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > > >::operator++() Line | Count | Source | 477 | 523k | DerivedTy &operator++() { // Preincrement | 478 | 523k | ++Ptr; | 479 | 523k | AdvancePastEmptyBuckets(); | 480 | 523k | return static_cast<DerivedTy &>(*this); | 481 | 523k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > > >::operator++() Line | Count | Source | 477 | 36 | DerivedTy &operator++() { // Preincrement | 478 | 36 | ++Ptr; | 479 | 36 | AdvancePastEmptyBuckets(); | 480 | 36 | return static_cast<DerivedTy &>(*this); | 481 | 36 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::FileEntry*>, llvm::StringMapEntry<clang::FileEntry*> const>::operator++() Line | Count | Source | 477 | 77.4k | DerivedTy &operator++() { // Preincrement | 478 | 77.4k | ++Ptr; | 479 | 77.4k | AdvancePastEmptyBuckets(); | 480 | 77.4k | return static_cast<DerivedTy &>(*this); | 481 | 77.4k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::IdentifierInfo*>, llvm::StringMapEntry<clang::IdentifierInfo*> const>::operator++() Line | Count | Source | 477 | 46.8M | DerivedTy &operator++() { // Preincrement | 478 | 46.8M | ++Ptr; | 479 | 46.8M | AdvancePastEmptyBuckets(); | 480 | 46.8M | return static_cast<DerivedTy &>(*this); | 481 | 46.8M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<bool>, llvm::StringMapEntry<bool> >::operator++() Line | Count | Source | 477 | 796k | DerivedTy &operator++() { // Preincrement | 478 | 796k | ++Ptr; | 479 | 796k | AdvancePastEmptyBuckets(); | 480 | 796k | return static_cast<DerivedTy &>(*this); | 481 | 796k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Constant*>, llvm::StringMapEntry<llvm::Constant*> >::operator++() Line | Count | Source | 477 | 2 | DerivedTy &operator++() { // Preincrement | 478 | 2 | ++Ptr; | 479 | 2 | AdvancePastEmptyBuckets(); | 480 | 2 | return static_cast<DerivedTy &>(*this); | 481 | 2 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::WeakTrackingVH>, llvm::StringMapEntry<llvm::WeakTrackingVH> >::operator++() Line | Count | Source | 477 | 11 | DerivedTy &operator++() { // Preincrement | 478 | 11 | ++Ptr; | 479 | 11 | AdvancePastEmptyBuckets(); | 480 | 11 | return static_cast<DerivedTy &>(*this); | 481 | 11 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > > const>::operator++() Line | Count | Source | 477 | 3.48k | DerivedTy &operator++() { // Preincrement | 478 | 3.48k | ++Ptr; | 479 | 3.48k | AdvancePastEmptyBuckets(); | 480 | 3.48k | return static_cast<DerivedTy &>(*this); | 481 | 3.48k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>, llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar> >::operator++() Line | Count | Source | 477 | 143 | DerivedTy &operator++() { // Preincrement | 478 | 143 | ++Ptr; | 479 | 143 | AdvancePastEmptyBuckets(); | 480 | 143 | return static_cast<DerivedTy &>(*this); | 481 | 143 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TrackingVH<llvm::Constant> >, llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> > >::operator++() Line | Count | Source | 477 | 127 | DerivedTy &operator++() { // Preincrement | 478 | 127 | ++Ptr; | 479 | 127 | AdvancePastEmptyBuckets(); | 480 | 127 | return static_cast<DerivedTy &>(*this); | 481 | 127 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::Module*>, llvm::StringMapEntry<clang::Module*> const>::operator++() Line | Count | Source | 477 | 1.60k | DerivedTy &operator++() { // Preincrement | 478 | 1.60k | ++Ptr; | 479 | 1.60k | AdvancePastEmptyBuckets(); | 480 | 1.60k | return static_cast<DerivedTy &>(*this); | 481 | 1.60k | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapIterator<clang::LayoutOverrideSource::Layout>, llvm::StringMapEntry<clang::LayoutOverrideSource::Layout> >::operator++() llvm::StringMapIterBase<llvm::StringMapIterator<char>, llvm::StringMapEntry<char> >::operator++() Line | Count | Source | 477 | 20 | DerivedTy &operator++() { // Preincrement | 478 | 20 | ++Ptr; | 479 | 20 | AdvancePastEmptyBuckets(); | 480 | 20 | return static_cast<DerivedTy &>(*this); | 481 | 20 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::PrecompiledPreamble::PreambleFileHash>, llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash> const>::operator++() Line | Count | Source | 477 | 456 | DerivedTy &operator++() { // Preincrement | 478 | 456 | ++Ptr; | 479 | 456 | AdvancePastEmptyBuckets(); | 480 | 456 | return static_cast<DerivedTy &>(*this); | 481 | 456 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>, llvm::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker> >::operator++() Line | Count | Source | 477 | 842 | DerivedTy &operator++() { // Preincrement | 478 | 842 | ++Ptr; | 479 | 842 | AdvancePastEmptyBuckets(); | 480 | 842 | return static_cast<DerivedTy &>(*this); | 481 | 842 | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >, llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> > >::operator++() Line | Count | Source | 477 | 1 | DerivedTy &operator++() { // Preincrement | 478 | 1 | ++Ptr; | 479 | 1 | AdvancePastEmptyBuckets(); | 480 | 1 | return static_cast<DerivedTy &>(*this); | 481 | 1 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallVector<unsigned int, 2u> >, llvm::StringMapEntry<llvm::SmallVector<unsigned int, 2u> > >::operator++() Line | Count | Source | 477 | 89.8k | DerivedTy &operator++() { // Preincrement | 478 | 89.8k | ++Ptr; | 479 | 89.8k | AdvancePastEmptyBuckets(); | 480 | 89.8k | return static_cast<DerivedTy &>(*this); | 481 | 89.8k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::AccelTableBase::HashData>, llvm::StringMapEntry<llvm::AccelTableBase::HashData> >::operator++() Line | Count | Source | 477 | 215k | DerivedTy &operator++() { // Preincrement | 478 | 215k | ++Ptr; | 479 | 215k | AdvancePastEmptyBuckets(); | 480 | 215k | return static_cast<DerivedTy &>(*this); | 481 | 215k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DIE const*>, llvm::StringMapEntry<llvm::DIE const*> const>::operator++() Line | Count | Source | 477 | 70.3k | DerivedTy &operator++() { // Preincrement | 478 | 70.3k | ++Ptr; | 479 | 70.3k | AdvancePastEmptyBuckets(); | 480 | 70.3k | return static_cast<DerivedTy &>(*this); | 481 | 70.3k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::DwarfStringPoolEntry>, llvm::StringMapEntry<llvm::DwarfStringPoolEntry> >::operator++() Line | Count | Source | 477 | 84.0k | DerivedTy &operator++() { // Preincrement | 478 | 84.0k | ++Ptr; | 479 | 84.0k | AdvancePastEmptyBuckets(); | 480 | 84.0k | return static_cast<DerivedTy &>(*this); | 481 | 84.0k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > > const>::operator++() Line | Count | Source | 477 | 61 | DerivedTy &operator++() { // Preincrement | 478 | 61 | ++Ptr; | 479 | 61 | AdvancePastEmptyBuckets(); | 480 | 61 | return static_cast<DerivedTy &>(*this); | 481 | 61 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::lto::LTO::GlobalResolution>, llvm::StringMapEntry<llvm::lto::LTO::GlobalResolution> >::operator++() Line | Count | Source | 477 | 2.65k | DerivedTy &operator++() { // Preincrement | 478 | 2.65k | ++Ptr; | 479 | 2.65k | AdvancePastEmptyBuckets(); | 480 | 2.65k | return static_cast<DerivedTy &>(*this); | 481 | 2.65k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >::operator++() Line | Count | Source | 477 | 90.3k | DerivedTy &operator++() { // Preincrement | 478 | 90.3k | ++Ptr; | 479 | 90.3k | AdvancePastEmptyBuckets(); | 480 | 90.3k | return static_cast<DerivedTy &>(*this); | 481 | 90.3k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > const>::operator++() Line | Count | Source | 477 | 600 | DerivedTy &operator++() { // Preincrement | 478 | 600 | ++Ptr; | 479 | 600 | AdvancePastEmptyBuckets(); | 480 | 600 | return static_cast<DerivedTy &>(*this); | 481 | 600 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::ento::BugType*>, llvm::StringMapEntry<clang::ento::BugType*> >::operator++() Line | Count | Source | 477 | 709 | DerivedTy &operator++() { // Preincrement | 478 | 709 | ++Ptr; | 479 | 709 | AdvancePastEmptyBuckets(); | 480 | 709 | return static_cast<DerivedTy &>(*this); | 481 | 709 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::Module*>, llvm::StringMapEntry<clang::Module*> >::operator++() Line | Count | Source | 477 | 73.5k | DerivedTy &operator++() { // Preincrement | 478 | 73.5k | ++Ptr; | 479 | 73.5k | AdvancePastEmptyBuckets(); | 480 | 73.5k | return static_cast<DerivedTy &>(*this); | 481 | 73.5k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::PragmaHandler*>, llvm::StringMapEntry<clang::PragmaHandler*> >::operator++() Line | Count | Source | 477 | 963k | DerivedTy &operator++() { // Preincrement | 478 | 963k | ++Ptr; | 479 | 963k | AdvancePastEmptyBuckets(); | 480 | 963k | return static_cast<DerivedTy &>(*this); | 481 | 963k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Value*>, llvm::StringMapEntry<llvm::Value*> const>::operator++() Line | Count | Source | 477 | 122k | DerivedTy &operator++() { // Preincrement | 478 | 122k | ++Ptr; | 479 | 122k | AdvancePastEmptyBuckets(); | 480 | 122k | return static_cast<DerivedTy &>(*this); | 481 | 122k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Type*>, llvm::StringMapEntry<llvm::Type*> const>::operator++() Line | Count | Source | 477 | 55 | DerivedTy &operator++() { // Preincrement | 478 | 55 | ++Ptr; | 479 | 55 | AdvancePastEmptyBuckets(); | 480 | 55 | return static_cast<DerivedTy &>(*this); | 481 | 55 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::Type*, llvm::SMLoc> >, llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> > >::operator++() Line | Count | Source | 477 | 12.7k | DerivedTy &operator++() { // Preincrement | 478 | 12.7k | ++Ptr; | 479 | 12.7k | AdvancePastEmptyBuckets(); | 480 | 12.7k | return static_cast<DerivedTy &>(*this); | 481 | 12.7k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Comdat>, llvm::StringMapEntry<llvm::Comdat> >::operator++() Line | Count | Source | 477 | 48 | DerivedTy &operator++() { // Preincrement | 478 | 48 | ++Ptr; | 479 | 48 | AdvancePastEmptyBuckets(); | 480 | 48 | return static_cast<DerivedTy &>(*this); | 481 | 48 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::RecordStreamer::State>, llvm::StringMapEntry<llvm::RecordStreamer::State> const>::operator++() Line | Count | Source | 477 | 264 | DerivedTy &operator++() { // Preincrement | 478 | 264 | ++Ptr; | 479 | 264 | AdvancePastEmptyBuckets(); | 480 | 264 | return static_cast<DerivedTy &>(*this); | 481 | 264 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::VRegInfo*>, llvm::StringMapEntry<llvm::VRegInfo*> const>::operator++() Line | Count | Source | 477 | 27 | DerivedTy &operator++() { // Preincrement | 478 | 27 | ++Ptr; | 479 | 27 | AdvancePastEmptyBuckets(); | 480 | 27 | return static_cast<DerivedTy &>(*this); | 481 | 27 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >, llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > > >::operator++() Line | Count | Source | 477 | 42 | DerivedTy &operator++() { // Preincrement | 478 | 42 | ++Ptr; | 479 | 42 | AdvancePastEmptyBuckets(); | 480 | 42 | return static_cast<DerivedTy &>(*this); | 481 | 42 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >, llvm::StringMapEntry<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > > >::operator++() Line | Count | Source | 477 | 22 | DerivedTy &operator++() { // Preincrement | 478 | 22 | ++Ptr; | 479 | 22 | AdvancePastEmptyBuckets(); | 480 | 22 | return static_cast<DerivedTy &>(*this); | 481 | 22 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned int>, llvm::StringMapEntry<unsigned int> >::operator++() Line | Count | Source | 477 | 440 | DerivedTy &operator++() { // Preincrement | 478 | 440 | ++Ptr; | 479 | 440 | AdvancePastEmptyBuckets(); | 480 | 440 | return static_cast<DerivedTy &>(*this); | 481 | 440 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::FileInfo::LineData>, llvm::StringMapEntry<llvm::FileInfo::LineData> >::operator++() Line | Count | Source | 477 | 46 | DerivedTy &operator++() { // Preincrement | 478 | 46 | ++Ptr; | 479 | 46 | AdvancePastEmptyBuckets(); | 480 | 46 | return static_cast<DerivedTy &>(*this); | 481 | 46 | } |
|
482 | | |
483 | 29 | DerivedTy operator++(int) { // Post-increment |
484 | 29 | DerivedTy Tmp(Ptr); |
485 | 29 | ++*this; |
486 | 29 | return Tmp; |
487 | 29 | } llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Constant*>, llvm::StringMapEntry<llvm::Constant*> >::operator++(int) Line | Count | Source | 483 | 2 | DerivedTy operator++(int) { // Post-increment | 484 | 2 | DerivedTy Tmp(Ptr); | 485 | 2 | ++*this; | 486 | 2 | return Tmp; | 487 | 2 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::VRegInfo*>, llvm::StringMapEntry<llvm::VRegInfo*> const>::operator++(int) Line | Count | Source | 483 | 27 | DerivedTy operator++(int) { // Post-increment | 484 | 27 | DerivedTy Tmp(Ptr); | 485 | 27 | ++*this; | 486 | 27 | return Tmp; | 487 | 27 | } |
|
488 | | |
489 | | private: |
490 | 1.13G | void AdvancePastEmptyBuckets() { |
491 | 1.48G | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()1.13G ) |
492 | 347M | ++Ptr; |
493 | 1.13G | } llvm::StringMapIterBase<llvm::StringMapIterator<char>, llvm::StringMapEntry<char> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 292M | void AdvancePastEmptyBuckets() { | 491 | 293M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()292M ) | 492 | 1.10M | ++Ptr; | 493 | 292M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > >, llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 89.3k | void AdvancePastEmptyBuckets() { | 491 | 89.3k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 89.3k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > >, llvm::StringMapEntry<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 137k | void AdvancePastEmptyBuckets() { | 491 | 137k | while (*Ptr == nullptr137k || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 137k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::OpenCLOptions::Info>, llvm::StringMapEntry<clang::OpenCLOptions::Info> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 22.9k | void AdvancePastEmptyBuckets() { | 491 | 35.4k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()22.9k ) | 492 | 12.5k | ++Ptr; | 493 | 22.9k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::OpenCLOptions::Info>, llvm::StringMapEntry<clang::OpenCLOptions::Info> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 10.3M | void AdvancePastEmptyBuckets() { | 491 | 11.1M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()10.3M ) | 492 | 781k | ++Ptr; | 493 | 10.3M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned int>, llvm::StringMapEntry<unsigned int> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 39.4M | void AdvancePastEmptyBuckets() { | 491 | 39.5M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()39.4M ) | 492 | 3.45k | ++Ptr; | 493 | 39.4M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MCAsmMacro>, llvm::StringMapEntry<llvm::MCAsmMacro> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 293 | void AdvancePastEmptyBuckets() { | 491 | 293 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 293 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 17.2M | void AdvancePastEmptyBuckets() { | 491 | 17.2M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 17.2M | } |
AArch64AsmParser.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >, llvm::StringMapEntry<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 19 | void AdvancePastEmptyBuckets() { | 491 | 19 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 19 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Value*>, llvm::StringMapEntry<llvm::Value*> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 136k | void AdvancePastEmptyBuckets() { | 491 | 369k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()146k ) | 492 | 233k | ++Ptr; | 493 | 136k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Value*>, llvm::StringMapEntry<llvm::Value*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 15.6M | void AdvancePastEmptyBuckets() { | 491 | 15.6M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()15.6M ) | 492 | 1.44k | ++Ptr; | 493 | 15.6M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<int>, llvm::StringMapEntry<int> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.27M | void AdvancePastEmptyBuckets() { | 491 | 3.30M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()1.27M ) | 492 | 2.03M | ++Ptr; | 493 | 1.27M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned int>, llvm::StringMapEntry<unsigned int> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 366k | void AdvancePastEmptyBuckets() { | 491 | 878k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()366k ) | 492 | 512k | ++Ptr; | 493 | 366k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<int>, llvm::StringMapEntry<int> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 9 | void AdvancePastEmptyBuckets() { | 491 | 32 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()9 ) | 492 | 23 | ++Ptr; | 493 | 9 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 116k | void AdvancePastEmptyBuckets() { | 491 | 116k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 116k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.61M | void AdvancePastEmptyBuckets() { | 491 | 1.61M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 1.61M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.06M | void AdvancePastEmptyBuckets() { | 491 | 1.06M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 1.06M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >, llvm::StringMapEntry<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 275 | void AdvancePastEmptyBuckets() { | 491 | 275 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 275 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 62.4k | void AdvancePastEmptyBuckets() { | 491 | 62.4k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 62.4k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 180k | void AdvancePastEmptyBuckets() { | 491 | 180k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 180k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::AsmToken>, llvm::StringMapEntry<llvm::AsmToken> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1 | void AdvancePastEmptyBuckets() { | 491 | 1 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 1 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 186k | void AdvancePastEmptyBuckets() { | 491 | 186k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 186k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 9.14k | void AdvancePastEmptyBuckets() { | 491 | 9.14k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 9.14k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::MCSymbol*>, llvm::StringMapEntry<llvm::MCSymbol*> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 11.5k | void AdvancePastEmptyBuckets() { | 491 | 34.7k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()11.5k ) | 492 | 23.2k | ++Ptr; | 493 | 11.5k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Function*>, llvm::StringMapEntry<llvm::Function*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 380 | void AdvancePastEmptyBuckets() { | 491 | 380 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 380 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::RTLIB::Libcall>, llvm::StringMapEntry<llvm::RTLIB::Libcall> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 4.87k | void AdvancePastEmptyBuckets() { | 491 | 4.87k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 4.87k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 88.5k | void AdvancePastEmptyBuckets() { | 491 | 88.5k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 88.5k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned long long>, llvm::StringMapEntry<unsigned long long> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.92k | void AdvancePastEmptyBuckets() { | 491 | 3.27k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()1.92k ) | 492 | 1.35k | ++Ptr; | 493 | 1.92k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned long long>, llvm::StringMapEntry<unsigned long long> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 276 | void AdvancePastEmptyBuckets() { | 491 | 1.85k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()276 ) | 492 | 1.57k | ++Ptr; | 493 | 276 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::sampleprof::FunctionSamples>, llvm::StringMapEntry<llvm::sampleprof::FunctionSamples> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.36k | void AdvancePastEmptyBuckets() { | 491 | 5.29k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()1.36k ) | 492 | 3.92k | ++Ptr; | 493 | 1.36k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 4.12M | void AdvancePastEmptyBuckets() { | 491 | 4.12M | while (*Ptr == nullptr4.12M || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 4.12M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >, llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > > const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 895 | void AdvancePastEmptyBuckets() { | 491 | 6.10k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()895 ) | 492 | 5.20k | ++Ptr; | 493 | 895 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >, llvm::StringMapEntry<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 929 | void AdvancePastEmptyBuckets() { | 491 | 929 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 929 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 4.42k | void AdvancePastEmptyBuckets() { | 491 | 4.42k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 4.42k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::GCStrategy*>, llvm::StringMapEntry<llvm::GCStrategy*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 26 | void AdvancePastEmptyBuckets() { | 491 | 26 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 26 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 650 | void AdvancePastEmptyBuckets() { | 491 | 650 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 650 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::ConstantDataSequential*>, llvm::StringMapEntry<llvm::ConstantDataSequential*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.06M | void AdvancePastEmptyBuckets() { | 491 | 1.23M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()1.06M ) | 492 | 162k | ++Ptr; | 493 | 1.06M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned char>, llvm::StringMapEntry<unsigned char> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 244k | void AdvancePastEmptyBuckets() { | 491 | 244k | while (*Ptr == nullptr244k || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 244k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned char>, llvm::StringMapEntry<unsigned char> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 16.2k | void AdvancePastEmptyBuckets() { | 491 | 86.9k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()16.2k ) | 492 | 70.7k | ++Ptr; | 493 | 16.2k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<unsigned int, unsigned int> >, llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 176 | void AdvancePastEmptyBuckets() { | 491 | 176 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 176 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<unsigned int, unsigned int> >, llvm::StringMapEntry<std::__1::pair<unsigned int, unsigned int> > const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 18 | void AdvancePastEmptyBuckets() { | 491 | 58 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()18 ) | 492 | 40 | ++Ptr; | 493 | 18 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MDString>, llvm::StringMapEntry<llvm::MDString> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 717k | void AdvancePastEmptyBuckets() { | 491 | 717k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()717k ) | 492 | 0 | ++Ptr; | 493 | 717k | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::NamedMDNode*>, llvm::StringMapEntry<llvm::NamedMDNode*> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<llvm::NamedMDNode*>, llvm::StringMapEntry<llvm::NamedMDNode*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 87.8k | void AdvancePastEmptyBuckets() { | 491 | 87.8k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 87.8k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Comdat>, llvm::StringMapEntry<llvm::Comdat> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 32.4k | void AdvancePastEmptyBuckets() { | 491 | 33.1k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()32.4k ) | 492 | 628 | ++Ptr; | 493 | 32.4k | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::PassInfo const*>, llvm::StringMapEntry<llvm::PassInfo const*> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<llvm::PassInfo const*>, llvm::StringMapEntry<llvm::PassInfo const*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 32.8M | void AdvancePastEmptyBuckets() { | 491 | 32.8M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 32.8M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::StructType*>, llvm::StringMapEntry<llvm::StructType*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 273k | void AdvancePastEmptyBuckets() { | 491 | 273k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 273k | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::StructType*>, llvm::StringMapEntry<llvm::StructType*> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Comdat>, llvm::StringMapEntry<llvm::Comdat> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 31.7k | void AdvancePastEmptyBuckets() { | 491 | 91.7k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()31.8k ) | 492 | 59.9k | ++Ptr; | 493 | 31.7k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >, llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.62k | void AdvancePastEmptyBuckets() { | 491 | 2.80k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()1.62k ) | 492 | 1.17k | ++Ptr; | 493 | 1.62k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > > const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 790 | void AdvancePastEmptyBuckets() { | 491 | 1.69k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()790 ) | 492 | 900 | ++Ptr; | 493 | 790 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> >, llvm::StringMapEntry<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.07k | void AdvancePastEmptyBuckets() { | 491 | 1.07k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 1.07k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >, llvm::StringMapEntry<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > > const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 476 | void AdvancePastEmptyBuckets() { | 491 | 3.88k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()476 ) | 492 | 3.40k | ++Ptr; | 493 | 476 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<char>, llvm::StringMapEntry<char> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 6.50M | void AdvancePastEmptyBuckets() { | 491 | 42.8M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()6.50M ) | 492 | 36.3M | ++Ptr; | 493 | 6.50M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<bool>, llvm::StringMapEntry<bool> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 9.09M | void AdvancePastEmptyBuckets() { | 491 | 9.96M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()9.09M ) | 492 | 872k | ++Ptr; | 493 | 9.09M | } |
GCOVProfiling.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<(anonymous namespace)::GCOVLines>, llvm::StringMapEntry<(anonymous namespace)::GCOVLines> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 278 | void AdvancePastEmptyBuckets() { | 491 | 1.53k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()278 ) | 492 | 1.26k | ++Ptr; | 493 | 278 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MCSymbol*>, llvm::StringMapEntry<llvm::MCSymbol*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 8.20M | void AdvancePastEmptyBuckets() { | 491 | 8.20M | while (*Ptr == nullptr8.20M || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 8.20M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MCSectionMachO*>, llvm::StringMapEntry<llvm::MCSectionMachO*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 899k | void AdvancePastEmptyBuckets() { | 491 | 899k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 899k | } |
AsmParser.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<(anonymous namespace)::AsmParser::DirectiveKind>, llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 2.99M | void AdvancePastEmptyBuckets() { | 491 | 2.99M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 2.99M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >, llvm::StringMapEntry<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 705k | void AdvancePastEmptyBuckets() { | 491 | 705k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 705k | } |
Unexecuted instantiation: AsmParser.cpp:llvm::StringMapIterBase<llvm::StringMapConstIterator<(anonymous namespace)::AsmParser::DirectiveKind>, llvm::StringMapEntry<(anonymous namespace)::AsmParser::DirectiveKind> const>::AdvancePastEmptyBuckets() Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >, llvm::StringMapEntry<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> > const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<llvm::cl::Option*>, llvm::StringMapEntry<llvm::cl::Option*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 260M | void AdvancePastEmptyBuckets() { | 491 | 326M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()260M ) | 492 | 66.2M | ++Ptr; | 493 | 260M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::cl::Option*>, llvm::StringMapEntry<llvm::cl::Option*> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 10.7k | void AdvancePastEmptyBuckets() { | 491 | 18.8k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()10.7k ) | 492 | 8.08k | ++Ptr; | 493 | 10.7k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned long>, llvm::StringMapEntry<unsigned long> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 264k | void AdvancePastEmptyBuckets() { | 491 | 264k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 264k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >, llvm::StringMapEntry<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 542 | void AdvancePastEmptyBuckets() { | 491 | 542 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 542 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SpecialCaseList::Matcher>, llvm::StringMapEntry<llvm::SpecialCaseList::Matcher> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 542 | void AdvancePastEmptyBuckets() { | 491 | 542 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 542 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >, llvm::StringMapEntry<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> > const>::AdvancePastEmptyBuckets() Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::SpecialCaseList::Matcher>, llvm::StringMapEntry<llvm::SpecialCaseList::Matcher> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >, llvm::StringMapEntry<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 82 | void AdvancePastEmptyBuckets() { | 491 | 88 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()82 ) | 492 | 6 | ++Ptr; | 493 | 82 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >, llvm::StringMapEntry<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 27 | void AdvancePastEmptyBuckets() { | 491 | 162 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()27 ) | 492 | 135 | ++Ptr; | 493 | 27 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Timer>, llvm::StringMapEntry<llvm::Timer> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 9 | void AdvancePastEmptyBuckets() { | 491 | 9 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 9 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::TimeRecord>, llvm::StringMapEntry<llvm::TimeRecord> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > > const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 19 | void AdvancePastEmptyBuckets() { | 491 | 140 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()19 ) | 492 | 121 | ++Ptr; | 493 | 19 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 140k | void AdvancePastEmptyBuckets() { | 491 | 140k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()140k ) | 492 | 0 | ++Ptr; | 493 | 140k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.33M | void AdvancePastEmptyBuckets() { | 491 | 2.12M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()1.33M ) | 492 | 794k | ++Ptr; | 493 | 1.33M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<void*>, llvm::StringMapEntry<void*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 3 | void AdvancePastEmptyBuckets() { | 491 | 3 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 3 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 168 | void AdvancePastEmptyBuckets() { | 491 | 196 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()168 ) | 492 | 28 | ++Ptr; | 493 | 168 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::IdentifierInfo*>, llvm::StringMapEntry<clang::IdentifierInfo*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 363M | void AdvancePastEmptyBuckets() { | 491 | 363M | while (*Ptr == nullptr363M || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 363M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::IdentifierInfo*>, llvm::StringMapEntry<clang::IdentifierInfo*> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 46.8M | void AdvancePastEmptyBuckets() { | 491 | 280M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()46.8M ) | 492 | 233M | ++Ptr; | 493 | 46.8M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::DirectoryEntry*>, llvm::StringMapEntry<clang::DirectoryEntry*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.77M | void AdvancePastEmptyBuckets() { | 491 | 1.77M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 1.77M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::FileEntry*>, llvm::StringMapEntry<clang::FileEntry*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 2.12M | void AdvancePastEmptyBuckets() { | 491 | 2.12M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 2.12M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::FileEntry*>, llvm::StringMapEntry<clang::FileEntry*> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 81.0k | void AdvancePastEmptyBuckets() { | 491 | 521k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()82.3k ) | 492 | 440k | ++Ptr; | 493 | 81.0k | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::vfs::Status>, llvm::StringMapEntry<llvm::vfs::Status> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<llvm::vfs::Status>, llvm::StringMapEntry<llvm::vfs::Status> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 35 | void AdvancePastEmptyBuckets() { | 491 | 35 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 35 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.42k | void AdvancePastEmptyBuckets() { | 491 | 1.42k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 1.42k | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::TrackingVH<llvm::Constant> >, llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> > const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::Module*>, llvm::StringMapEntry<clang::Module*> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 1.74k | void AdvancePastEmptyBuckets() { | 491 | 4.93k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()1.74k ) | 492 | 3.19k | ++Ptr; | 493 | 1.74k | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>, llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Constant*>, llvm::StringMapEntry<llvm::Constant*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 100 | void AdvancePastEmptyBuckets() { | 491 | 130 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()100 ) | 492 | 30 | ++Ptr; | 493 | 100 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::GlobalVariable*>, llvm::StringMapEntry<llvm::GlobalVariable*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 4.33k | void AdvancePastEmptyBuckets() { | 491 | 4.33k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 4.33k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::WeakTrackingVH>, llvm::StringMapEntry<llvm::WeakTrackingVH> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 41 | void AdvancePastEmptyBuckets() { | 491 | 206 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()41 ) | 492 | 165 | ++Ptr; | 493 | 41 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::AssertingVH<llvm::Constant> >, llvm::StringMapEntry<llvm::AssertingVH<llvm::Constant> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 646 | void AdvancePastEmptyBuckets() { | 491 | 646 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 646 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 7.87k | void AdvancePastEmptyBuckets() { | 491 | 7.87k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 7.87k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >, llvm::StringMapEntry<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > > const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 4.92k | void AdvancePastEmptyBuckets() { | 491 | 24.4k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()4.92k ) | 492 | 19.5k | ++Ptr; | 493 | 4.92k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>, llvm::StringMapEntry<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 491 | void AdvancePastEmptyBuckets() { | 491 | 1.05k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()491 ) | 492 | 561 | ++Ptr; | 493 | 491 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<bool>, llvm::StringMapEntry<bool> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TrackingVH<llvm::Constant> >, llvm::StringMapEntry<llvm::TrackingVH<llvm::Constant> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 290 | void AdvancePastEmptyBuckets() { | 491 | 643 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()290 ) | 492 | 353 | ++Ptr; | 493 | 290 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::GlobalDecl>, llvm::StringMapEntry<clang::GlobalDecl> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 2.34M | void AdvancePastEmptyBuckets() { | 491 | 2.34M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 2.34M | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::ASTContext::SectionInfo>, llvm::StringMapEntry<clang::ASTContext::SectionInfo> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 5.92k | void AdvancePastEmptyBuckets() { | 491 | 5.92k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 5.92k | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::GlobalDecl>, llvm::StringMapEntry<clang::GlobalDecl> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 3.10M | void AdvancePastEmptyBuckets() { | 491 | 3.15M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()3.10M ) | 492 | 53.3k | ++Ptr; | 493 | 3.10M | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >, llvm::StringMapEntry<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 693 | void AdvancePastEmptyBuckets() { | 491 | 1.88k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()693 ) | 492 | 1.18k | ++Ptr; | 493 | 693 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::FrameworkCacheEntry>, llvm::StringMapEntry<clang::FrameworkCacheEntry> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 10.2k | void AdvancePastEmptyBuckets() { | 491 | 10.2k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 10.2k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > >, llvm::StringMapEntry<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 53.6k | void AdvancePastEmptyBuckets() { | 491 | 53.6k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 53.6k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<char const*>, llvm::StringMapEntry<char const*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 105 | void AdvancePastEmptyBuckets() { | 491 | 105 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 105 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::SourceLocation>, llvm::StringMapEntry<clang::SourceLocation> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 15 | void AdvancePastEmptyBuckets() { | 491 | 15 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 15 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::LayoutOverrideSource::Layout>, llvm::StringMapEntry<clang::LayoutOverrideSource::Layout> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 39 | void AdvancePastEmptyBuckets() { | 491 | 39 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 39 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::PrecompiledPreamble::PreambleFileHash>, llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 157 | void AdvancePastEmptyBuckets() { | 491 | 157 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 157 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::PrecompiledPreamble::PreambleFileHash>, llvm::StringMapEntry<clang::PrecompiledPreamble::PreambleFileHash> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 634 | void AdvancePastEmptyBuckets() { | 491 | 2.99k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()634 ) | 492 | 2.36k | ++Ptr; | 493 | 634 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>, llvm::StringMapEntry<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 5.99k | void AdvancePastEmptyBuckets() { | 491 | 16.2k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()5.99k ) | 492 | 10.2k | ++Ptr; | 493 | 5.99k | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >, llvm::StringMapEntry<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 20 | void AdvancePastEmptyBuckets() { | 491 | 147 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()29 ) | 492 | 127 | ++Ptr; | 493 | 20 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<llvm::StringRef, bool> >, llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> > const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::StringRef, bool> >, llvm::StringMapEntry<std::__1::pair<llvm::StringRef, bool> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 5.86k | void AdvancePastEmptyBuckets() { | 491 | 5.86k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 5.86k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::shared_ptr<clang::ModuleFileExtension> >, llvm::StringMapEntry<std::__1::shared_ptr<clang::ModuleFileExtension> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 27 | void AdvancePastEmptyBuckets() { | 491 | 27 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 27 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallVector<unsigned int, 2u> >, llvm::StringMapEntry<llvm::SmallVector<unsigned int, 2u> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 197k | void AdvancePastEmptyBuckets() { | 491 | 276k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()197k ) | 492 | 79.3k | ++Ptr; | 493 | 197k | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::InMemoryModuleCache::PCM>, llvm::StringMapEntry<clang::InMemoryModuleCache::PCM> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<clang::InMemoryModuleCache::PCM>, llvm::StringMapEntry<clang::InMemoryModuleCache::PCM> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 5.58k | void AdvancePastEmptyBuckets() { | 491 | 5.58k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 5.58k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > >, llvm::StringMapEntry<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 85 | void AdvancePastEmptyBuckets() { | 491 | 85 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 85 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned int const*>, llvm::StringMapEntry<unsigned int const*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 7.40k | void AdvancePastEmptyBuckets() { | 491 | 7.40k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 7.40k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::MachineMemOperand::Flags>, llvm::StringMapEntry<llvm::MachineMemOperand::Flags> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 6 | void AdvancePastEmptyBuckets() { | 491 | 6 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 6 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TargetRegisterClass const*>, llvm::StringMapEntry<llvm::TargetRegisterClass const*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 232k | void AdvancePastEmptyBuckets() { | 491 | 232k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 232k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::RegisterBank const*>, llvm::StringMapEntry<llvm::RegisterBank const*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 6.12k | void AdvancePastEmptyBuckets() { | 491 | 6.12k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 6.12k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::VRegInfo*>, llvm::StringMapEntry<llvm::VRegInfo*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 57 | void AdvancePastEmptyBuckets() { | 491 | 57 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 57 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::AccelTableBase::HashData>, llvm::StringMapEntry<llvm::AccelTableBase::HashData> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 539k | void AdvancePastEmptyBuckets() { | 491 | 764k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()539k ) | 492 | 225k | ++Ptr; | 493 | 539k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::DIE const*>, llvm::StringMapEntry<llvm::DIE const*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 89.9k | void AdvancePastEmptyBuckets() { | 491 | 89.9k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 89.9k | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::DIE const*>, llvm::StringMapEntry<llvm::DIE const*> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 72.3k | void AdvancePastEmptyBuckets() { | 491 | 143k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()72.3k ) | 492 | 71.3k | ++Ptr; | 493 | 72.3k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::DwarfStringPoolEntry>, llvm::StringMapEntry<llvm::DwarfStringPoolEntry> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 509k | void AdvancePastEmptyBuckets() { | 491 | 590k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()509k ) | 492 | 80.6k | ++Ptr; | 493 | 509k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> >, llvm::StringMapEntry<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 10 | void AdvancePastEmptyBuckets() { | 491 | 10 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 10 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > >, llvm::StringMapEntry<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > > const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 80 | void AdvancePastEmptyBuckets() { | 491 | 323 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()80 ) | 492 | 243 | ++Ptr; | 493 | 80 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<unsigned short>, llvm::StringMapEntry<unsigned short> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 47 | void AdvancePastEmptyBuckets() { | 491 | 47 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 47 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SDNode*>, llvm::StringMapEntry<llvm::SDNode*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 18.9k | void AdvancePastEmptyBuckets() { | 491 | 18.9k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 18.9k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::lto::LTO::GlobalResolution>, llvm::StringMapEntry<llvm::lto::LTO::GlobalResolution> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 5.09k | void AdvancePastEmptyBuckets() { | 491 | 19.5k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()5.09k ) | 492 | 14.4k | ++Ptr; | 493 | 5.09k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > >, llvm::StringMapEntry<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 621 | void AdvancePastEmptyBuckets() { | 491 | 621 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 621 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<unsigned long>, llvm::StringMapEntry<unsigned long> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<clang::Stmt*>, llvm::StringMapEntry<clang::Stmt*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 27.1k | void AdvancePastEmptyBuckets() { | 491 | 27.1k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 27.1k | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::Stmt*>, llvm::StringMapEntry<clang::Stmt*> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<FoundationClass>, llvm::StringMapEntry<FoundationClass> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 91 | void AdvancePastEmptyBuckets() { | 491 | 91 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 91 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<FoundationClass>, llvm::StringMapEntry<FoundationClass> const>::AdvancePastEmptyBuckets() Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >, llvm::StringMapEntry<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > > const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >, llvm::StringMapEntry<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 53 | void AdvancePastEmptyBuckets() { | 491 | 53 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 53 | } |
StdLibraryFunctionsChecker.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >, llvm::StringMapEntry<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 286 | void AdvancePastEmptyBuckets() { | 491 | 286 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 286 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::ento::BugType*>, llvm::StringMapEntry<clang::ento::BugType*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 2.28k | void AdvancePastEmptyBuckets() { | 491 | 8.91k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()2.28k ) | 492 | 6.63k | ++Ptr; | 493 | 2.28k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::ASTUnit*>, llvm::StringMapEntry<clang::ASTUnit*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 57 | void AdvancePastEmptyBuckets() { | 491 | 57 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 57 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >, llvm::StringMapEntry<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 72 | void AdvancePastEmptyBuckets() { | 491 | 72 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 72 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::SmallVector<clang::TypoCorrection, 1u> >, llvm::StringMapEntry<llvm::SmallVector<clang::TypoCorrection, 1u> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 29.2k | void AdvancePastEmptyBuckets() { | 491 | 387k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()169k ) | 492 | 358k | ++Ptr; | 493 | 29.2k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >, llvm::StringMapEntry<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 3 | void AdvancePastEmptyBuckets() { | 491 | 3 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 3 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >, llvm::StringMapEntry<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> > const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >, llvm::StringMapEntry<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 38 | void AdvancePastEmptyBuckets() { | 491 | 38 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 38 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TimeRecord>, llvm::StringMapEntry<llvm::TimeRecord> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 10 | void AdvancePastEmptyBuckets() { | 491 | 13 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()10 ) | 492 | 3 | ++Ptr; | 493 | 10 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::StringLiteral*>, llvm::StringMapEntry<clang::StringLiteral*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 255 | void AdvancePastEmptyBuckets() { | 491 | 255 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 255 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::comments::TParamCommandComment*>, llvm::StringMapEntry<clang::comments::TParamCommandComment*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 92 | void AdvancePastEmptyBuckets() { | 491 | 92 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 92 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::HeaderSearch::LookupFileCacheInfo>, llvm::StringMapEntry<clang::HeaderSearch::LookupFileCacheInfo> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 884k | void AdvancePastEmptyBuckets() { | 491 | 884k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 884k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::StringSet<llvm::MallocAllocator> >, llvm::StringMapEntry<llvm::StringSet<llvm::MallocAllocator> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 20 | void AdvancePastEmptyBuckets() { | 491 | 20 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 20 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::Module*>, llvm::StringMapEntry<clang::Module*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 150k | void AdvancePastEmptyBuckets() { | 491 | 266k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()150k ) | 492 | 116k | ++Ptr; | 493 | 150k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<clang::PragmaHandler*>, llvm::StringMapEntry<clang::PragmaHandler*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 3.39M | void AdvancePastEmptyBuckets() { | 491 | 6.42M | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()4.22M ) | 492 | 3.02M | ++Ptr; | 493 | 3.39M | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<clang::PragmaHandler*>, llvm::StringMapEntry<clang::PragmaHandler*> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::Type*>, llvm::StringMapEntry<llvm::Type*> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 85 | void AdvancePastEmptyBuckets() { | 491 | 510 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()85 ) | 492 | 425 | ++Ptr; | 493 | 85 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::pair<llvm::Type*, llvm::SMLoc> >, llvm::StringMapEntry<std::__1::pair<llvm::Type*, llvm::SMLoc> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 121k | void AdvancePastEmptyBuckets() { | 491 | 171k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()121k ) | 492 | 49.8k | ++Ptr; | 493 | 121k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::Type*>, llvm::StringMapEntry<llvm::Type*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 91 | void AdvancePastEmptyBuckets() { | 491 | 91 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 91 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::RecordStreamer::State>, llvm::StringMapEntry<llvm::RecordStreamer::State> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 264 | void AdvancePastEmptyBuckets() { | 491 | 869 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()264 ) | 492 | 605 | ++Ptr; | 493 | 264 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::RecordStreamer::State>, llvm::StringMapEntry<llvm::RecordStreamer::State> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 501 | void AdvancePastEmptyBuckets() { | 491 | 704 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()501 ) | 492 | 203 | ++Ptr; | 493 | 501 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::GlobalValue const*>, llvm::StringMapEntry<llvm::GlobalValue const*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 255 | void AdvancePastEmptyBuckets() { | 491 | 255 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 255 | } |
llvm::StringMapIterBase<llvm::StringMapConstIterator<llvm::VRegInfo*>, llvm::StringMapEntry<llvm::VRegInfo*> const>::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 59 | void AdvancePastEmptyBuckets() { | 491 | 128 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()59 ) | 492 | 69 | ++Ptr; | 493 | 59 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<llvm::TinyPtrVector<lld::elf::OutputSection*> >, llvm::StringMapEntry<llvm::TinyPtrVector<lld::elf::OutputSection*> > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 387k | void AdvancePastEmptyBuckets() { | 491 | 387k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 387k | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >, llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 103 | void AdvancePastEmptyBuckets() { | 491 | 333 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()103 ) | 492 | 230 | ++Ptr; | 493 | 103 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >, llvm::StringMapEntry<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > > const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >, llvm::StringMapEntry<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 61 | void AdvancePastEmptyBuckets() { | 491 | 119 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()61 ) | 492 | 58 | ++Ptr; | 493 | 61 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<lld::Atom const*>, llvm::StringMapEntry<lld::Atom const*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 396 | void AdvancePastEmptyBuckets() { | 491 | 396 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 396 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<lld::mach_o::MachODylibFile*>, llvm::StringMapEntry<lld::mach_o::MachODylibFile*> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 234 | void AdvancePastEmptyBuckets() { | 491 | 234 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 234 | } |
llvm::StringMapIterBase<llvm::StringMapIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >, llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > > >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 5 | void AdvancePastEmptyBuckets() { | 491 | 5 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 5 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >, llvm::StringMapEntry<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > > const>::AdvancePastEmptyBuckets() MachONormalizedFileFromAtoms.cpp:llvm::StringMapIterBase<llvm::StringMapIterator<(anonymous namespace)::Util::DylibInfo>, llvm::StringMapEntry<(anonymous namespace)::Util::DylibInfo> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 408 | void AdvancePastEmptyBuckets() { | 491 | 408 | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()) | 492 | 0 | ++Ptr; | 493 | 408 | } |
Unexecuted instantiation: llvm::StringMapIterBase<llvm::StringMapConstIterator<lld::Atom const*>, llvm::StringMapEntry<lld::Atom const*> const>::AdvancePastEmptyBuckets() llvm::StringMapIterBase<llvm::StringMapIterator<llvm::FileInfo::LineData>, llvm::StringMapEntry<llvm::FileInfo::LineData> >::AdvancePastEmptyBuckets() Line | Count | Source | 490 | 3.12k | void AdvancePastEmptyBuckets() { | 491 | 3.52k | while (*Ptr == nullptr || *Ptr == StringMapImpl::getTombstoneVal()3.12k ) | 492 | 402 | ++Ptr; | 493 | 3.12k | } |
|
494 | | }; |
495 | | |
496 | | template <typename ValueTy> |
497 | | class StringMapConstIterator |
498 | | : public StringMapIterBase<StringMapConstIterator<ValueTy>, |
499 | | const StringMapEntry<ValueTy>> { |
500 | | using base = StringMapIterBase<StringMapConstIterator<ValueTy>, |
501 | | const StringMapEntry<ValueTy>>; |
502 | | |
503 | | public: |
504 | 92 | StringMapConstIterator() = default; |
505 | | explicit StringMapConstIterator(StringMapEntryBase **Bucket, |
506 | | bool NoAdvance = false) |
507 | 216M | : base(Bucket, NoAdvance) {} llvm::StringMapConstIterator<llvm::Value*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 157M | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<unsigned int>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 235k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<int>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 1.67k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::MCSymbol*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 8.12k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<unsigned long long>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 575k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 4.35k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<unsigned char>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 10.2k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<std::__1::pair<unsigned int, unsigned int> >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 12 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::NamedMDNode*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 37.5M | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::PassInfo const*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 4.63k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::StructType*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 292 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::Comdat>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 220k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 1.99k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 2.38k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<char>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 10.5M | : base(Bucket, NoAdvance) {} |
AsmParser.cpp:llvm::StringMapConstIterator<(anonymous namespace)::AsmParser::DirectiveKind>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 3.68M | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 1.73M | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::cl::Option*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 28.9k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 3.31k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::SpecialCaseList::Matcher>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 1.39k | : base(Bucket, NoAdvance) {} |
Unexecuted instantiation: llvm::StringMapConstIterator<llvm::TimeRecord>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 18 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<clang::FileEntry*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 7.23k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<clang::IdentifierInfo*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 34.1k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::TrackingVH<llvm::Constant> >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 64 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 362 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 10.9k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<bool>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 500k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<clang::GlobalDecl>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 4.48k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 7.32k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<clang::Module*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 442k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<clang::OpenCLOptions::Info>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 149k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<clang::PrecompiledPreamble::PreambleFileHash>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 490 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<std::__1::pair<llvm::StringRef, bool> >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 3.80k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<clang::InMemoryModuleCache::PCM>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 21.0k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::DIE const*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 6.97k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 38 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<unsigned long>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 3.87k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<clang::Stmt*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 28.0k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<FoundationClass>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 2.93k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 36 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 1.30k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<clang::PragmaHandler*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 3.54M | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::Type*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 4.34k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::RecordStreamer::State>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 148 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<llvm::VRegInfo*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 22.3k | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 24 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 44 | : base(Bucket, NoAdvance) {} |
llvm::StringMapConstIterator<lld::Atom const*>::StringMapConstIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 507 | 142 | : base(Bucket, NoAdvance) {} |
|
508 | | |
509 | 81.2M | const StringMapEntry<ValueTy> &operator*() const { |
510 | 81.2M | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); |
511 | 81.2M | } llvm::StringMapConstIterator<clang::OpenCLOptions::Info>::operator*() const Line | Count | Source | 509 | 166k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 166k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 166k | } |
llvm::StringMapConstIterator<llvm::Value*>::operator*() const Line | Count | Source | 509 | 7.63M | const StringMapEntry<ValueTy> &operator*() const { | 510 | 7.63M | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 7.63M | } |
llvm::StringMapConstIterator<unsigned int>::operator*() const Line | Count | Source | 509 | 713k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 713k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 713k | } |
llvm::StringMapConstIterator<int>::operator*() const Line | Count | Source | 509 | 807 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 807 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 807 | } |
llvm::StringMapConstIterator<llvm::MCSymbol*>::operator*() const Line | Count | Source | 509 | 11.6k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 11.6k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 11.6k | } |
llvm::StringMapConstIterator<unsigned long long>::operator*() const Line | Count | Source | 509 | 253 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 253 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 253 | } |
llvm::StringMapConstIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::operator*() const Line | Count | Source | 509 | 2.03k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 2.03k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 2.03k | } |
llvm::StringMapConstIterator<unsigned char>::operator*() const Line | Count | Source | 509 | 11.1k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 11.1k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 11.1k | } |
llvm::StringMapConstIterator<std::__1::pair<unsigned int, unsigned int> >::operator*() const Line | Count | Source | 509 | 12 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 12 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 12 | } |
llvm::StringMapConstIterator<llvm::NamedMDNode*>::operator*() const Line | Count | Source | 509 | 16.2M | const StringMapEntry<ValueTy> &operator*() const { | 510 | 16.2M | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 16.2M | } |
llvm::StringMapConstIterator<llvm::PassInfo const*>::operator*() const Line | Count | Source | 509 | 2.31k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 2.31k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 2.31k | } |
llvm::StringMapConstIterator<llvm::StructType*>::operator*() const Line | Count | Source | 509 | 116 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 116 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 116 | } |
llvm::StringMapConstIterator<llvm::Comdat>::operator*() const Line | Count | Source | 509 | 28.0k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 28.0k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 28.0k | } |
llvm::StringMapConstIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >::operator*() const Line | Count | Source | 509 | 1.03k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 1.03k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 1.03k | } |
llvm::StringMapConstIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >::operator*() const Line | Count | Source | 509 | 569 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 569 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 569 | } |
AsmParser.cpp:llvm::StringMapConstIterator<(anonymous namespace)::AsmParser::DirectiveKind>::operator*() const Line | Count | Source | 509 | 381k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 381k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 381k | } |
llvm::StringMapConstIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >::operator*() const Line | Count | Source | 509 | 490k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 490k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 490k | } |
llvm::StringMapConstIterator<char>::operator*() const Line | Count | Source | 509 | 6.45M | const StringMapEntry<ValueTy> &operator*() const { | 510 | 6.45M | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 6.45M | } |
llvm::StringMapConstIterator<llvm::cl::Option*>::operator*() const Line | Count | Source | 509 | 19.9k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 19.9k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 19.9k | } |
llvm::StringMapConstIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >::operator*() const Line | Count | Source | 509 | 1.39k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 1.39k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 1.39k | } |
llvm::StringMapConstIterator<llvm::SpecialCaseList::Matcher>::operator*() const Line | Count | Source | 509 | 489 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 489 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 489 | } |
Unexecuted instantiation: llvm::StringMapConstIterator<llvm::TimeRecord>::operator*() const llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >::operator*() const Line | Count | Source | 509 | 22 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 22 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 22 | } |
llvm::StringMapConstIterator<clang::FileEntry*>::operator*() const Line | Count | Source | 509 | 215k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 215k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 215k | } |
llvm::StringMapConstIterator<clang::IdentifierInfo*>::operator*() const Line | Count | Source | 509 | 46.8M | const StringMapEntry<ValueTy> &operator*() const { | 510 | 46.8M | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 46.8M | } |
llvm::StringMapConstIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >::operator*() const Line | Count | Source | 509 | 10.9k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 10.9k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 10.9k | } |
llvm::StringMapConstIterator<bool>::operator*() const Line | Count | Source | 509 | 247k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 247k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 247k | } |
llvm::StringMapConstIterator<clang::GlobalDecl>::operator*() const Line | Count | Source | 509 | 2.16k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 2.16k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 2.16k | } |
llvm::StringMapConstIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::operator*() const Line | Count | Source | 509 | 1.48k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 1.48k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 1.48k | } |
llvm::StringMapConstIterator<clang::Module*>::operator*() const Line | Count | Source | 509 | 53.6k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 53.6k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 53.6k | } |
llvm::StringMapConstIterator<clang::PrecompiledPreamble::PreambleFileHash>::operator*() const Line | Count | Source | 509 | 460 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 460 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 460 | } |
llvm::StringMapConstIterator<clang::InMemoryModuleCache::PCM>::operator*() const Line | Count | Source | 509 | 2.01k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 2.01k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 2.01k | } |
llvm::StringMapConstIterator<llvm::DIE const*>::operator*() const Line | Count | Source | 509 | 70.3k | const StringMapEntry<ValueTy> &operator*() const { | 510 | 70.3k | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 70.3k | } |
llvm::StringMapConstIterator<std::__1::unique_ptr<llvm::MemoryBuffer, std::__1::default_delete<llvm::MemoryBuffer> > >::operator*() const Line | Count | Source | 509 | 61 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 61 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 61 | } |
llvm::StringMapConstIterator<unsigned long>::operator*() const Line | Count | Source | 509 | 951 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 951 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 951 | } |
llvm::StringMapConstIterator<FoundationClass>::operator*() const Line | Count | Source | 509 | 696 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 696 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 696 | } |
llvm::StringMapConstIterator<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >::operator*() const Line | Count | Source | 509 | 100 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 100 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 100 | } |
llvm::StringMapConstIterator<clang::PragmaHandler*>::operator*() const Line | Count | Source | 509 | 1.63M | const StringMapEntry<ValueTy> &operator*() const { | 510 | 1.63M | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 1.63M | } |
llvm::StringMapConstIterator<llvm::Type*>::operator*() const Line | Count | Source | 509 | 55 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 55 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 55 | } |
llvm::StringMapConstIterator<llvm::RecordStreamer::State>::operator*() const Line | Count | Source | 509 | 264 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 264 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 264 | } |
llvm::StringMapConstIterator<llvm::VRegInfo*>::operator*() const Line | Count | Source | 509 | 54 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 54 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 54 | } |
llvm::StringMapConstIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >::operator*() const Line | Count | Source | 509 | 6 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 6 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 6 | } |
llvm::StringMapConstIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >::operator*() const Line | Count | Source | 509 | 11 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 11 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 11 | } |
llvm::StringMapConstIterator<lld::Atom const*>::operator*() const Line | Count | Source | 509 | 18 | const StringMapEntry<ValueTy> &operator*() const { | 510 | 18 | return *static_cast<const StringMapEntry<ValueTy> *>(*this->Ptr); | 511 | 18 | } |
|
512 | | }; |
513 | | |
514 | | template <typename ValueTy> |
515 | | class StringMapIterator : public StringMapIterBase<StringMapIterator<ValueTy>, |
516 | | StringMapEntry<ValueTy>> { |
517 | | using base = |
518 | | StringMapIterBase<StringMapIterator<ValueTy>, StringMapEntry<ValueTy>>; |
519 | | |
520 | | public: |
521 | 4.60k | StringMapIterator() = default; |
522 | | explicit StringMapIterator(StringMapEntryBase **Bucket, |
523 | | bool NoAdvance = false) |
524 | 990M | : base(Bucket, NoAdvance) {} llvm::StringMapIterator<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 89.3k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 137k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 17.2M | : base(Bucket, NoAdvance) {} |
AArch64AsmParser.cpp:llvm::StringMapIterator<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 24.5k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<int>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 2.04M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<unsigned int>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 40.0M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 116k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 1.61M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<char>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 292M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 1.06M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 669 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 62.4k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 180k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::AsmToken>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 1.44k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 186k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 9.14k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::Function*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 460 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::RTLIB::Libcall>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 5.09k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 88.5k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 4.12M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 4.42k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::GCStrategy*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 188 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 650 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::ConstantDataSequential*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 1.16M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<unsigned char>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 244k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::pair<unsigned int, unsigned int> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 214 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::MDString>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 717k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::NamedMDNode*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 90.7k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::Comdat>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 37.9k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::PassInfo const*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 32.8M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::StructType*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 273k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::Value*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 15.6M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 2.85k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 1.07k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::sampleprof::FunctionSamples>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 1.65k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<unsigned long long>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 717k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<bool>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 8.91M | : base(Bucket, NoAdvance) {} |
GCOVProfiling.cpp:llvm::StringMapIterator<(anonymous namespace)::GCOVLines>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 290 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::MCSymbol*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 8.20M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::MCSectionMachO*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 899k | : base(Bucket, NoAdvance) {} |
AsmParser.cpp:llvm::StringMapIterator<(anonymous namespace)::AsmParser::DirectiveKind>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 6.67M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 705k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::MCAsmMacro>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 3.48M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::cl::Option*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 156M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<unsigned long>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 269k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 542 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::SpecialCaseList::Matcher>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 542 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 73 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 37 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::Timer>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 9 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 3.15M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 870k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<void*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 7 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 148 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::IdentifierInfo*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 363M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::DirectoryEntry*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 1.77M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::FileEntry*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 2.12M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::vfs::Status>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 35 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::OpenCLOptions::Info>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 8.98M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 1.42k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::Constant*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 218 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::GlobalVariable*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 4.33k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::WeakTrackingVH>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 6.94k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::AssertingVH<llvm::Constant> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 646 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 7.87k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 3.19k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::TrackingVH<llvm::Constant> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 35.1k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::GlobalDecl>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 2.34M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::ASTContext::SectionInfo>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 17.8k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 53.6k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<char const*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 317 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 3.01M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::SourceLocation>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 145 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::LayoutOverrideSource::Layout>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 121 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::PrecompiledPreamble::PreambleFileHash>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 1.07k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 28.6k | : base(Bucket, NoAdvance) {} |
VerifyDiagnosticConsumer.cpp:llvm::StringMapIterator<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 25.8k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::pair<llvm::StringRef, bool> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 9.66k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::shared_ptr<clang::ModuleFileExtension> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 119 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::SmallVector<unsigned int, 2u> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 108k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::InMemoryModuleCache::PCM>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 11.8k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 85 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<unsigned int const*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 10.9k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::MachineMemOperand::Flags>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 54 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::TargetRegisterClass const*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 313k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::RegisterBank const*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 32.1k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::VRegInfo*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 57 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::AccelTableBase::HashData>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 380k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::DIE const*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 89.9k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::DwarfStringPoolEntry>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 428k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 10 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<unsigned short>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 143 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::SDNode*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 48.7k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::lto::LTO::GlobalResolution>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 3.57k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 621 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::Stmt*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 27.1k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<FoundationClass>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 91 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 53 | : base(Bucket, NoAdvance) {} |
StdLibraryFunctionsChecker.cpp:llvm::StringMapIterator<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 3.20k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::ento::BugType*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 13.9k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::ASTUnit*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 183 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 186 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 11 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::SmallVector<clang::TypoCorrection, 1u> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 29.2k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::pair<clang::OMPCriticalDirective const*, llvm::APSInt> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 38 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::TimeRecord>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 10 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::StringLiteral*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 255 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::comments::TParamCommandComment*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 92 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::FrameworkCacheEntry>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 10.2k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::HeaderSearch::LookupFileCacheInfo>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 884k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::StringSet<llvm::MallocAllocator> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 5.14k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::Module*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 142k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<clang::PragmaHandler*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 4.61M | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 2.35k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::pair<llvm::Type*, llvm::SMLoc> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 183k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::Type*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 91 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::RecordStreamer::State>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 706 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::GlobalValue const*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 289 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::TinyPtrVector<lld::elf::OutputSection*> >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 387k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 78 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 378 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<lld::mach_o::MachODylibFile*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 680 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 5 | : base(Bucket, NoAdvance) {} |
MachONormalizedFileFromAtoms.cpp:llvm::StringMapIterator<(anonymous namespace)::Util::DylibInfo>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 632 | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<lld::Atom const*>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 1.23k | : base(Bucket, NoAdvance) {} |
llvm::StringMapIterator<llvm::FileInfo::LineData>::StringMapIterator(llvm::StringMapEntryBase**, bool) Line | Count | Source | 524 | 3.10k | : base(Bucket, NoAdvance) {} |
|
525 | | |
526 | 614M | StringMapEntry<ValueTy> &operator*() const { |
527 | 614M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); |
528 | 614M | } llvm::StringMapIterator<std::__1::unique_ptr<clang::PCHContainerWriter, std::__1::default_delete<clang::PCHContainerWriter> > >::operator*() const Line | Count | Source | 526 | 89.3k | StringMapEntry<ValueTy> &operator*() const { | 527 | 89.3k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 89.3k | } |
llvm::StringMapIterator<std::__1::unique_ptr<clang::PCHContainerReader, std::__1::default_delete<clang::PCHContainerReader> > >::operator*() const Line | Count | Source | 526 | 137k | StringMapEntry<ValueTy> &operator*() const { | 527 | 137k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 137k | } |
llvm::StringMapIterator<clang::OpenCLOptions::Info>::operator*() const Line | Count | Source | 526 | 10.3M | StringMapEntry<ValueTy> &operator*() const { | 527 | 10.3M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 10.3M | } |
llvm::StringMapIterator<unsigned int>::operator*() const Line | Count | Source | 526 | 12.3M | StringMapEntry<ValueTy> &operator*() const { | 527 | 12.3M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 12.3M | } |
llvm::StringMapIterator<llvm::MCAsmMacro>::operator*() const Line | Count | Source | 526 | 197k | StringMapEntry<ValueTy> &operator*() const { | 527 | 197k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 197k | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::AArch64Subtarget, std::__1::default_delete<llvm::AArch64Subtarget> > >::operator*() const Line | Count | Source | 526 | 17.2M | StringMapEntry<ValueTy> &operator*() const { | 527 | 17.2M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 17.2M | } |
AArch64AsmParser.cpp:llvm::StringMapIterator<std::__1::pair<(anonymous namespace)::RegKind, unsigned int> >::operator*() const Line | Count | Source | 526 | 852 | StringMapEntry<ValueTy> &operator*() const { | 527 | 852 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 852 | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::R600Subtarget, std::__1::default_delete<llvm::R600Subtarget> > >::operator*() const Line | Count | Source | 526 | 116k | StringMapEntry<ValueTy> &operator*() const { | 527 | 116k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 116k | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::GCNSubtarget, std::__1::default_delete<llvm::GCNSubtarget> > >::operator*() const Line | Count | Source | 526 | 1.61M | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.61M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.61M | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::ARMSubtarget, std::__1::default_delete<llvm::ARMSubtarget> > >::operator*() const Line | Count | Source | 526 | 1.06M | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.06M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.06M | } |
llvm::StringMapIterator<std::__1::vector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >, std::__1::allocator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > > > >::operator*() const Line | Count | Source | 526 | 275 | StringMapEntry<ValueTy> &operator*() const { | 527 | 275 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 275 | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::HexagonSubtarget, std::__1::default_delete<llvm::HexagonSubtarget> > >::operator*() const Line | Count | Source | 526 | 62.4k | StringMapEntry<ValueTy> &operator*() const { | 527 | 62.4k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 62.4k | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::MipsSubtarget, std::__1::default_delete<llvm::MipsSubtarget> > >::operator*() const Line | Count | Source | 526 | 180k | StringMapEntry<ValueTy> &operator*() const { | 527 | 180k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 180k | } |
llvm::StringMapIterator<llvm::AsmToken>::operator*() const Line | Count | Source | 526 | 2 | StringMapEntry<ValueTy> &operator*() const { | 527 | 2 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 2 | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::PPCSubtarget, std::__1::default_delete<llvm::PPCSubtarget> > >::operator*() const Line | Count | Source | 526 | 186k | StringMapEntry<ValueTy> &operator*() const { | 527 | 186k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 186k | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::SparcSubtarget, std::__1::default_delete<llvm::SparcSubtarget> > >::operator*() const Line | Count | Source | 526 | 9.14k | StringMapEntry<ValueTy> &operator*() const { | 527 | 9.14k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 9.14k | } |
llvm::StringMapIterator<llvm::Function*>::operator*() const Line | Count | Source | 526 | 424 | StringMapEntry<ValueTy> &operator*() const { | 527 | 424 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 424 | } |
llvm::StringMapIterator<llvm::RTLIB::Libcall>::operator*() const Line | Count | Source | 526 | 5.09k | StringMapEntry<ValueTy> &operator*() const { | 527 | 5.09k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 5.09k | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::WebAssemblySubtarget, std::__1::default_delete<llvm::WebAssemblySubtarget> > >::operator*() const Line | Count | Source | 526 | 88.5k | StringMapEntry<ValueTy> &operator*() const { | 527 | 88.5k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 88.5k | } |
llvm::StringMapIterator<unsigned long long>::operator*() const Line | Count | Source | 526 | 2.37k | StringMapEntry<ValueTy> &operator*() const { | 527 | 2.37k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 2.37k | } |
llvm::StringMapIterator<llvm::sampleprof::FunctionSamples>::operator*() const Line | Count | Source | 526 | 1.23k | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.23k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.23k | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::X86Subtarget, std::__1::default_delete<llvm::X86Subtarget> > >::operator*() const Line | Count | Source | 526 | 4.12M | StringMapEntry<ValueTy> &operator*() const { | 527 | 4.12M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 4.12M | } |
llvm::StringMapIterator<char>::operator*() const Line | Count | Source | 526 | 25.7k | StringMapEntry<ValueTy> &operator*() const { | 527 | 25.7k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 25.7k | } |
llvm::StringMapIterator<std::__1::pair<unsigned long long, std::__1::array<unsigned int, 5ul> > >::operator*() const Line | Count | Source | 526 | 2.35k | StringMapEntry<ValueTy> &operator*() const { | 527 | 2.35k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 2.35k | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::TargetLibraryInfoImpl, std::__1::default_delete<llvm::TargetLibraryInfoImpl> > >::operator*() const Line | Count | Source | 526 | 4.42k | StringMapEntry<ValueTy> &operator*() const { | 527 | 4.42k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 4.42k | } |
llvm::StringMapIterator<llvm::GCStrategy*>::operator*() const Line | Count | Source | 526 | 81 | StringMapEntry<ValueTy> &operator*() const { | 527 | 81 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 81 | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::ExternalSymbolPseudoSourceValue const, std::__1::default_delete<llvm::ExternalSymbolPseudoSourceValue const> > >::operator*() const Line | Count | Source | 526 | 650 | StringMapEntry<ValueTy> &operator*() const { | 527 | 650 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 650 | } |
llvm::StringMapIterator<llvm::ConstantDataSequential*>::operator*() const Line | Count | Source | 526 | 1.05M | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.05M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.05M | } |
llvm::StringMapIterator<unsigned char>::operator*() const Line | Count | Source | 526 | 244k | StringMapEntry<ValueTy> &operator*() const { | 527 | 244k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 244k | } |
llvm::StringMapIterator<std::__1::pair<unsigned int, unsigned int> >::operator*() const Line | Count | Source | 526 | 192 | StringMapEntry<ValueTy> &operator*() const { | 527 | 192 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 192 | } |
llvm::StringMapIterator<llvm::MDString>::operator*() const Line | Count | Source | 526 | 1.15M | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.15M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.15M | } |
llvm::StringMapIterator<llvm::NamedMDNode*>::operator*() const Line | Count | Source | 526 | 89.3k | StringMapEntry<ValueTy> &operator*() const { | 527 | 89.3k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 89.3k | } |
llvm::StringMapIterator<llvm::Comdat>::operator*() const Line | Count | Source | 526 | 33.3k | StringMapEntry<ValueTy> &operator*() const { | 527 | 33.3k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 33.3k | } |
llvm::StringMapIterator<llvm::PassInfo const*>::operator*() const Line | Count | Source | 526 | 32.8M | StringMapEntry<ValueTy> &operator*() const { | 527 | 32.8M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 32.8M | } |
llvm::StringMapIterator<llvm::StructType*>::operator*() const Line | Count | Source | 526 | 245k | StringMapEntry<ValueTy> &operator*() const { | 527 | 245k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 245k | } |
llvm::StringMapIterator<llvm::Value*>::operator*() const Line | Count | Source | 526 | 14.6M | StringMapEntry<ValueTy> &operator*() const { | 527 | 14.6M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 14.6M | } |
llvm::StringMapIterator<llvm::StringMap<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> >, llvm::MallocAllocator> >::operator*() const Line | Count | Source | 526 | 1.07k | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.07k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.07k | } |
llvm::StringMapIterator<std::__1::unordered_set<unsigned long long, std::__1::hash<unsigned long long>, std::__1::equal_to<unsigned long long>, std::__1::allocator<unsigned long long> > >::operator*() const Line | Count | Source | 526 | 1.54k | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.54k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.54k | } |
llvm::StringMapIterator<bool>::operator*() const Line | Count | Source | 526 | 14.2M | StringMapEntry<ValueTy> &operator*() const { | 527 | 14.2M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 14.2M | } |
GCOVProfiling.cpp:llvm::StringMapIterator<(anonymous namespace)::GCOVLines>::operator*() const Line | Count | Source | 526 | 194 | StringMapEntry<ValueTy> &operator*() const { | 527 | 194 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 194 | } |
llvm::StringMapIterator<llvm::MCSymbol*>::operator*() const Line | Count | Source | 526 | 8.20M | StringMapEntry<ValueTy> &operator*() const { | 527 | 8.20M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 8.20M | } |
llvm::StringMapIterator<llvm::MCSectionMachO*>::operator*() const Line | Count | Source | 526 | 899k | StringMapEntry<ValueTy> &operator*() const { | 527 | 899k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 899k | } |
AsmParser.cpp:llvm::StringMapIterator<(anonymous namespace)::AsmParser::DirectiveKind>::operator*() const Line | Count | Source | 526 | 2.99M | StringMapEntry<ValueTy> &operator*() const { | 527 | 2.99M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 2.99M | } |
llvm::StringMapIterator<std::__1::pair<llvm::MCAsmParserExtension*, bool (*)(llvm::MCAsmParserExtension*, llvm::StringRef, llvm::SMLoc)> >::operator*() const Line | Count | Source | 526 | 705k | StringMapEntry<ValueTy> &operator*() const { | 527 | 705k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 705k | } |
llvm::StringMapIterator<llvm::cl::Option*>::operator*() const Line | Count | Source | 526 | 105M | StringMapEntry<ValueTy> &operator*() const { | 527 | 105M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 105M | } |
llvm::StringMapIterator<unsigned long>::operator*() const Line | Count | Source | 526 | 264k | StringMapEntry<ValueTy> &operator*() const { | 527 | 264k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 264k | } |
llvm::StringMapIterator<llvm::StringMap<llvm::SpecialCaseList::Matcher, llvm::MallocAllocator> >::operator*() const Line | Count | Source | 526 | 542 | StringMapEntry<ValueTy> &operator*() const { | 527 | 542 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 542 | } |
llvm::StringMapIterator<llvm::SpecialCaseList::Matcher>::operator*() const Line | Count | Source | 526 | 542 | StringMapEntry<ValueTy> &operator*() const { | 527 | 542 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 542 | } |
llvm::StringMapIterator<std::__1::pair<unsigned long, std::__1::chrono::duration<long long, std::__1::ratio<1l, 1000000000l> > > >::operator*() const Line | Count | Source | 526 | 81 | StringMapEntry<ValueTy> &operator*() const { | 527 | 81 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 81 | } |
llvm::StringMapIterator<std::__1::pair<llvm::TimerGroup*, llvm::StringMap<llvm::Timer, llvm::MallocAllocator> > >::operator*() const Line | Count | Source | 526 | 18 | StringMapEntry<ValueTy> &operator*() const { | 527 | 18 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 18 | } |
llvm::StringMapIterator<llvm::Timer>::operator*() const Line | Count | Source | 526 | 9 | StringMapEntry<ValueTy> &operator*() const { | 527 | 9 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 9 | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::vfs::detail::InMemoryNode, std::__1::default_delete<llvm::vfs::detail::InMemoryNode> > >::operator*() const Line | Count | Source | 526 | 1.26M | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.26M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.26M | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::yaml::Input::HNode, std::__1::default_delete<llvm::yaml::Input::HNode> > >::operator*() const Line | Count | Source | 526 | 1.26M | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.26M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.26M | } |
llvm::StringMapIterator<void*>::operator*() const Line | Count | Source | 526 | 5 | StringMapEntry<ValueTy> &operator*() const { | 527 | 5 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 5 | } |
llvm::StringMapIterator<std::__1::unique_ptr<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode, std::__1::default_delete<llvm::ImportedFunctionsInliningStatistics::InlineGraphNode> > >::operator*() const Line | Count | Source | 526 | 176 | StringMapEntry<ValueTy> &operator*() const { | 527 | 176 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 176 | } |
llvm::StringMapIterator<clang::IdentifierInfo*>::operator*() const Line | Count | Source | 526 | 363M | StringMapEntry<ValueTy> &operator*() const { | 527 | 363M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 363M | } |
llvm::StringMapIterator<clang::DirectoryEntry*>::operator*() const Line | Count | Source | 526 | 1.77M | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.77M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.77M | } |
llvm::StringMapIterator<clang::FileEntry*>::operator*() const Line | Count | Source | 526 | 2.12M | StringMapEntry<ValueTy> &operator*() const { | 527 | 2.12M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 2.12M | } |
llvm::StringMapIterator<llvm::vfs::Status>::operator*() const Line | Count | Source | 526 | 35 | StringMapEntry<ValueTy> &operator*() const { | 527 | 35 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 35 | } |
llvm::StringMapIterator<llvm::DenseMap<unsigned long long, llvm::GlobalValueSummary*, llvm::DenseMapInfo<unsigned long long>, llvm::detail::DenseMapPair<unsigned long long, llvm::GlobalValueSummary*> > >::operator*() const Line | Count | Source | 526 | 1.39k | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.39k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.39k | } |
llvm::StringMapIterator<llvm::Constant*>::operator*() const Line | Count | Source | 526 | 97 | StringMapEntry<ValueTy> &operator*() const { | 527 | 97 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 97 | } |
llvm::StringMapIterator<llvm::GlobalVariable*>::operator*() const Line | Count | Source | 526 | 4.33k | StringMapEntry<ValueTy> &operator*() const { | 527 | 4.33k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 4.33k | } |
llvm::StringMapIterator<llvm::WeakTrackingVH>::operator*() const Line | Count | Source | 526 | 11 | StringMapEntry<ValueTy> &operator*() const { | 527 | 11 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 11 | } |
llvm::StringMapIterator<llvm::AssertingVH<llvm::Constant> >::operator*() const Line | Count | Source | 526 | 646 | StringMapEntry<ValueTy> &operator*() const { | 527 | 646 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 646 | } |
llvm::StringMapIterator<llvm::DenseMap<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion, llvm::DenseMapInfo<unsigned int>, llvm::detail::DenseMapPair<unsigned int, clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoTargetRegion> > >::operator*() const Line | Count | Source | 526 | 7.87k | StringMapEntry<ValueTy> &operator*() const { | 527 | 7.87k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 7.87k | } |
llvm::StringMapIterator<clang::CodeGen::CGOpenMPRuntime::OffloadEntriesInfoManagerTy::OffloadEntryInfoDeviceGlobalVar>::operator*() const Line | Count | Source | 526 | 307 | StringMapEntry<ValueTy> &operator*() const { | 527 | 307 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 307 | } |
llvm::StringMapIterator<llvm::TrackingVH<llvm::Constant> >::operator*() const Line | Count | Source | 526 | 266 | StringMapEntry<ValueTy> &operator*() const { | 527 | 266 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 266 | } |
llvm::StringMapIterator<clang::GlobalDecl>::operator*() const Line | Count | Source | 526 | 2.34M | StringMapEntry<ValueTy> &operator*() const { | 527 | 2.34M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 2.34M | } |
llvm::StringMapIterator<clang::ASTContext::SectionInfo>::operator*() const Line | Count | Source | 526 | 11.6k | StringMapEntry<ValueTy> &operator*() const { | 527 | 11.6k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 11.6k | } |
llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::operator*() const Line | Count | Source | 526 | 2.50M | StringMapEntry<ValueTy> &operator*() const { | 527 | 2.50M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 2.50M | } |
llvm::StringMapIterator<clang::FrameworkCacheEntry>::operator*() const Line | Count | Source | 526 | 10.2k | StringMapEntry<ValueTy> &operator*() const { | 527 | 10.2k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 10.2k | } |
llvm::StringMapIterator<std::__1::unique_ptr<clang::driver::ToolChain, std::__1::default_delete<clang::driver::ToolChain> > >::operator*() const Line | Count | Source | 526 | 53.6k | StringMapEntry<ValueTy> &operator*() const { | 527 | 53.6k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 53.6k | } |
llvm::StringMapIterator<char const*>::operator*() const Line | Count | Source | 526 | 106 | StringMapEntry<ValueTy> &operator*() const { | 527 | 106 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 106 | } |
llvm::StringMapIterator<int>::operator*() const Line | Count | Source | 526 | 1.13M | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.13M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.13M | } |
llvm::StringMapIterator<clang::SourceLocation>::operator*() const Line | Count | Source | 526 | 65 | StringMapEntry<ValueTy> &operator*() const { | 527 | 65 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 65 | } |
llvm::StringMapIterator<clang::LayoutOverrideSource::Layout>::operator*() const Line | Count | Source | 526 | 323 | StringMapEntry<ValueTy> &operator*() const { | 527 | 323 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 323 | } |
llvm::StringMapIterator<clang::PrecompiledPreamble::PreambleFileHash>::operator*() const Line | Count | Source | 526 | 159 | StringMapEntry<ValueTy> &operator*() const { | 527 | 159 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 159 | } |
llvm::StringMapIterator<clang::VerifyDiagnosticConsumer::MarkerTracker::Marker>::operator*() const Line | Count | Source | 526 | 5.32k | StringMapEntry<ValueTy> &operator*() const { | 527 | 5.32k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 5.32k | } |
VerifyDiagnosticConsumer.cpp:llvm::StringMapIterator<llvm::SmallVector<(anonymous namespace)::UnattachedDirective, 2u> >::operator*() const Line | Count | Source | 526 | 32 | StringMapEntry<ValueTy> &operator*() const { | 527 | 32 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 32 | } |
llvm::StringMapIterator<std::__1::pair<llvm::StringRef, bool> >::operator*() const Line | Count | Source | 526 | 9.54k | StringMapEntry<ValueTy> &operator*() const { | 527 | 9.54k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 9.54k | } |
llvm::StringMapIterator<std::__1::shared_ptr<clang::ModuleFileExtension> >::operator*() const Line | Count | Source | 526 | 15 | StringMapEntry<ValueTy> &operator*() const { | 527 | 15 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 15 | } |
llvm::StringMapIterator<llvm::SmallVector<unsigned int, 2u> >::operator*() const Line | Count | Source | 526 | 286k | StringMapEntry<ValueTy> &operator*() const { | 527 | 286k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 286k | } |
llvm::StringMapIterator<clang::InMemoryModuleCache::PCM>::operator*() const Line | Count | Source | 526 | 11.8k | StringMapEntry<ValueTy> &operator*() const { | 527 | 11.8k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 11.8k | } |
llvm::StringMapIterator<std::__1::unique_ptr<polly::ScopArrayInfo, std::__1::default_delete<polly::ScopArrayInfo> > >::operator*() const Line | Count | Source | 526 | 85 | StringMapEntry<ValueTy> &operator*() const { | 527 | 85 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 85 | } |
llvm::StringMapIterator<unsigned int const*>::operator*() const Line | Count | Source | 526 | 338 | StringMapEntry<ValueTy> &operator*() const { | 527 | 338 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 338 | } |
llvm::StringMapIterator<llvm::MachineMemOperand::Flags>::operator*() const Line | Count | Source | 526 | 23 | StringMapEntry<ValueTy> &operator*() const { | 527 | 23 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 23 | } |
llvm::StringMapIterator<llvm::TargetRegisterClass const*>::operator*() const Line | Count | Source | 526 | 11.1k | StringMapEntry<ValueTy> &operator*() const { | 527 | 11.1k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 11.1k | } |
llvm::StringMapIterator<llvm::RegisterBank const*>::operator*() const Line | Count | Source | 526 | 13.0k | StringMapEntry<ValueTy> &operator*() const { | 527 | 13.0k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 13.0k | } |
llvm::StringMapIterator<llvm::VRegInfo*>::operator*() const Line | Count | Source | 526 | 84 | StringMapEntry<ValueTy> &operator*() const { | 527 | 84 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 84 | } |
llvm::StringMapIterator<llvm::AccelTableBase::HashData>::operator*() const Line | Count | Source | 526 | 532k | StringMapEntry<ValueTy> &operator*() const { | 527 | 532k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 532k | } |
llvm::StringMapIterator<llvm::DIE const*>::operator*() const Line | Count | Source | 526 | 89.8k | StringMapEntry<ValueTy> &operator*() const { | 527 | 89.8k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 89.8k | } |
llvm::StringMapIterator<llvm::DwarfStringPoolEntry>::operator*() const Line | Count | Source | 526 | 930k | StringMapEntry<ValueTy> &operator*() const { | 527 | 930k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 930k | } |
llvm::StringMapIterator<std::__1::weak_ptr<llvm::DWARFContext::DWOFile> >::operator*() const Line | Count | Source | 526 | 10 | StringMapEntry<ValueTy> &operator*() const { | 527 | 10 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 10 | } |
llvm::StringMapIterator<unsigned short>::operator*() const Line | Count | Source | 526 | 49 | StringMapEntry<ValueTy> &operator*() const { | 527 | 49 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 49 | } |
llvm::StringMapIterator<llvm::SDNode*>::operator*() const Line | Count | Source | 526 | 33.8k | StringMapEntry<ValueTy> &operator*() const { | 527 | 33.8k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 33.8k | } |
llvm::StringMapIterator<llvm::lto::LTO::GlobalResolution>::operator*() const Line | Count | Source | 526 | 4.02k | StringMapEntry<ValueTy> &operator*() const { | 527 | 4.02k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 4.02k | } |
llvm::StringMapIterator<std::__1::map<unsigned long long, llvm::GlobalValue::LinkageTypes, std::__1::less<unsigned long long>, std::__1::allocator<std::__1::pair<unsigned long long const, llvm::GlobalValue::LinkageTypes> > > >::operator*() const Line | Count | Source | 526 | 621 | StringMapEntry<ValueTy> &operator*() const { | 527 | 621 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 621 | } |
llvm::StringMapIterator<clang::Stmt*>::operator*() const Line | Count | Source | 526 | 27.1k | StringMapEntry<ValueTy> &operator*() const { | 527 | 27.1k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 27.1k | } |
llvm::StringMapIterator<FoundationClass>::operator*() const Line | Count | Source | 526 | 91 | StringMapEntry<ValueTy> &operator*() const { | 527 | 91 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 91 | } |
llvm::StringMapIterator<llvm::SmallSet<clang::Selector, 16u, std::__1::less<clang::Selector> > >::operator*() const Line | Count | Source | 526 | 53 | StringMapEntry<ValueTy> &operator*() const { | 527 | 53 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 53 | } |
StdLibraryFunctionsChecker.cpp:llvm::StringMapIterator<std::__1::vector<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy, std::__1::allocator<(anonymous namespace)::StdLibraryFunctionsChecker::FunctionSummaryTy> > >::operator*() const Line | Count | Source | 526 | 692 | StringMapEntry<ValueTy> &operator*() const { | 527 | 692 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 692 | } |
llvm::StringMapIterator<clang::ento::BugType*>::operator*() const Line | Count | Source | 526 | 1.83k | StringMapEntry<ValueTy> &operator*() const { | 527 | 1.83k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 1.83k | } |
llvm::StringMapIterator<std::__1::unique_ptr<clang::ASTUnit, std::__1::default_delete<clang::ASTUnit> > >::operator*() const Line | Count | Source | 526 | 121 | StringMapEntry<ValueTy> &operator*() const { | 527 | 121 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 121 | } |
llvm::StringMapIterator<clang::ASTUnit*>::operator*() const Line | Count | Source | 526 | 57 | StringMapEntry<ValueTy> &operator*() const { | 527 | 57 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 57 | } |
llvm::StringMapIterator<llvm::SmallVector<clang::TypoCorrection, 1u> >::operator*() const Line | Count | Source | 526 | 47.3k | StringMapEntry<ValueTy> &operator*() const { | 527 | 47.3k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 47.3k | } |
llvm::StringMapIterator<std::__1::vector<clang::FunctionDecl*, std::__1::allocator<clang::FunctionDecl*> > >::operator*() const Line | Count | Source | 526 | 5 | StringMapEntry<ValueTy> &operator*() const { | 527 | 5 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 5 | } |
llvm::StringMapIterator<llvm::TimeRecord>::operator*() const Line | Count | Source | 526 | 10 | StringMapEntry<ValueTy> &operator*() const { | 527 | 10 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 10 | } |
llvm::StringMapIterator<clang::StringLiteral*>::operator*() const Line | Count | Source | 526 | 255 | StringMapEntry<ValueTy> &operator*() const { | 527 | 255 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 255 | } |
llvm::StringMapIterator<clang::comments::TParamCommandComment*>::operator*() const Line | Count | Source | 526 | 92 | StringMapEntry<ValueTy> &operator*() const { | 527 | 92 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 92 | } |
llvm::StringMapIterator<clang::HeaderSearch::LookupFileCacheInfo>::operator*() const Line | Count | Source | 526 | 884k | StringMapEntry<ValueTy> &operator*() const { | 527 | 884k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 884k | } |
llvm::StringMapIterator<llvm::StringSet<llvm::MallocAllocator> >::operator*() const Line | Count | Source | 526 | 25 | StringMapEntry<ValueTy> &operator*() const { | 527 | 25 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 25 | } |
llvm::StringMapIterator<clang::Module*>::operator*() const Line | Count | Source | 526 | 147k | StringMapEntry<ValueTy> &operator*() const { | 527 | 147k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 147k | } |
llvm::StringMapIterator<clang::PragmaHandler*>::operator*() const Line | Count | Source | 526 | 4.21M | StringMapEntry<ValueTy> &operator*() const { | 527 | 4.21M | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 4.21M | } |
llvm::StringMapIterator<std::__1::pair<llvm::Type*, llvm::SMLoc> >::operator*() const Line | Count | Source | 526 | 117k | StringMapEntry<ValueTy> &operator*() const { | 527 | 117k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 117k | } |
llvm::StringMapIterator<llvm::RecordStreamer::State>::operator*() const Line | Count | Source | 526 | 460 | StringMapEntry<ValueTy> &operator*() const { | 527 | 460 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 460 | } |
llvm::StringMapIterator<llvm::GlobalValue const*>::operator*() const Line | Count | Source | 526 | 262 | StringMapEntry<ValueTy> &operator*() const { | 527 | 262 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 262 | } |
llvm::StringMapIterator<llvm::TinyPtrVector<lld::elf::OutputSection*> >::operator*() const Line | Count | Source | 526 | 387k | StringMapEntry<ValueTy> &operator*() const { | 527 | 387k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 387k | } |
llvm::StringMapIterator<std::__1::vector<lld::elf::Symbol*, std::__1::allocator<lld::elf::Symbol*> > >::operator*() const Line | Count | Source | 526 | 86 | StringMapEntry<ValueTy> &operator*() const { | 527 | 86 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 86 | } |
llvm::StringMapIterator<std::__1::vector<lld::wasm::InputSection*, std::__1::allocator<lld::wasm::InputSection*> > >::operator*() const Line | Count | Source | 526 | 56 | StringMapEntry<ValueTy> &operator*() const { | 527 | 56 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 56 | } |
llvm::StringMapIterator<lld::Atom const*>::operator*() const Line | Count | Source | 526 | 585 | StringMapEntry<ValueTy> &operator*() const { | 527 | 585 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 585 | } |
llvm::StringMapIterator<lld::mach_o::MachODylibFile*>::operator*() const Line | Count | Source | 526 | 457 | StringMapEntry<ValueTy> &operator*() const { | 527 | 457 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 457 | } |
llvm::StringMapIterator<std::__1::vector<lld::MachOLinkingContext::OrderFileNode, std::__1::allocator<lld::MachOLinkingContext::OrderFileNode> > >::operator*() const Line | Count | Source | 526 | 5 | StringMapEntry<ValueTy> &operator*() const { | 527 | 5 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 5 | } |
MachONormalizedFileFromAtoms.cpp:llvm::StringMapIterator<(anonymous namespace)::Util::DylibInfo>::operator*() const Line | Count | Source | 526 | 411 | StringMapEntry<ValueTy> &operator*() const { | 527 | 411 | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 411 | } |
llvm::StringMapIterator<llvm::FileInfo::LineData>::operator*() const Line | Count | Source | 526 | 3.09k | StringMapEntry<ValueTy> &operator*() const { | 527 | 3.09k | return *static_cast<StringMapEntry<ValueTy> *>(*this->Ptr); | 528 | 3.09k | } |
|
529 | | |
530 | 3.98M | operator StringMapConstIterator<ValueTy>() const { |
531 | 3.98M | return StringMapConstIterator<ValueTy>(this->Ptr, true); |
532 | 3.98M | } llvm::StringMapIterator<unsigned int>::operator llvm::StringMapConstIterator<unsigned int>() const Line | Count | Source | 530 | 30.0k | operator StringMapConstIterator<ValueTy>() const { | 531 | 30.0k | return StringMapConstIterator<ValueTy>(this->Ptr, true); | 532 | 30.0k | } |
AsmParser.cpp:llvm::StringMapIterator<(anonymous namespace)::AsmParser::DirectiveKind>::operator llvm::StringMapConstIterator<(anonymous namespace)::AsmParser::DirectiveKind>() const Line | Count | Source | 530 | 3.68M | operator StringMapConstIterator<ValueTy>() const { | 531 | 3.68M | return StringMapConstIterator<ValueTy>(this->Ptr, true); | 532 | 3.68M | } |
llvm::StringMapIterator<char>::operator llvm::StringMapConstIterator<char>() const Line | Count | Source | 530 | 222k | operator StringMapConstIterator<ValueTy>() const { | 531 | 222k | return StringMapConstIterator<ValueTy>(this->Ptr, true); | 532 | 222k | } |
llvm::StringMapIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::operator llvm::StringMapConstIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >() const Line | Count | Source | 530 | 16 | operator StringMapConstIterator<ValueTy>() const { | 531 | 16 | return StringMapConstIterator<ValueTy>(this->Ptr, true); | 532 | 16 | } |
llvm::StringMapIterator<bool>::operator llvm::StringMapConstIterator<bool>() const Line | Count | Source | 530 | 46.0k | operator StringMapConstIterator<ValueTy>() const { | 531 | 46.0k | return StringMapConstIterator<ValueTy>(this->Ptr, true); | 532 | 46.0k | } |
llvm::StringMapIterator<unsigned long>::operator llvm::StringMapConstIterator<unsigned long>() const Line | Count | Source | 530 | 3.87k | operator StringMapConstIterator<ValueTy>() const { | 531 | 3.87k | return StringMapConstIterator<ValueTy>(this->Ptr, true); | 532 | 3.87k | } |
llvm::StringMapIterator<llvm::RecordStreamer::State>::operator llvm::StringMapConstIterator<llvm::RecordStreamer::State>() const Line | Count | Source | 530 | 148 | operator StringMapConstIterator<ValueTy>() const { | 531 | 148 | return StringMapConstIterator<ValueTy>(this->Ptr, true); | 532 | 148 | } |
|
533 | | }; |
534 | | |
535 | | template <typename ValueTy> |
536 | | class StringMapKeyIterator |
537 | | : public iterator_adaptor_base<StringMapKeyIterator<ValueTy>, |
538 | | StringMapConstIterator<ValueTy>, |
539 | | std::forward_iterator_tag, StringRef> { |
540 | | using base = iterator_adaptor_base<StringMapKeyIterator<ValueTy>, |
541 | | StringMapConstIterator<ValueTy>, |
542 | | std::forward_iterator_tag, StringRef>; |
543 | | |
544 | | public: |
545 | | StringMapKeyIterator() = default; |
546 | | explicit StringMapKeyIterator(StringMapConstIterator<ValueTy> Iter) |
547 | 6.15k | : base(std::move(Iter)) {} llvm::StringMapKeyIterator<std::__1::pair<unsigned int, unsigned int> >::StringMapKeyIterator(llvm::StringMapConstIterator<std::__1::pair<unsigned int, unsigned int> >) Line | Count | Source | 547 | 12 | : base(std::move(Iter)) {} |
llvm::StringMapKeyIterator<char>::StringMapKeyIterator(llvm::StringMapConstIterator<char>) Line | Count | Source | 547 | 4.84k | : base(std::move(Iter)) {} |
llvm::StringMapKeyIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::StringMapKeyIterator(llvm::StringMapConstIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >) Line | Count | Source | 547 | 1.30k | : base(std::move(Iter)) {} |
|
548 | | |
549 | 425 | StringRef &operator*() { |
550 | 425 | Key = this->wrapped()->getKey(); |
551 | 425 | return Key; |
552 | 425 | } llvm::StringMapKeyIterator<std::__1::pair<unsigned int, unsigned int> >::operator*() Line | Count | Source | 549 | 12 | StringRef &operator*() { | 550 | 12 | Key = this->wrapped()->getKey(); | 551 | 12 | return Key; | 552 | 12 | } |
llvm::StringMapKeyIterator<char>::operator*() Line | Count | Source | 549 | 365 | StringRef &operator*() { | 550 | 365 | Key = this->wrapped()->getKey(); | 551 | 365 | return Key; | 552 | 365 | } |
llvm::StringMapKeyIterator<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::operator*() Line | Count | Source | 549 | 48 | StringRef &operator*() { | 550 | 48 | Key = this->wrapped()->getKey(); | 551 | 48 | return Key; | 552 | 48 | } |
|
553 | | |
554 | | private: |
555 | | StringRef Key; |
556 | | }; |
557 | | |
558 | | } // end namespace llvm |
559 | | |
560 | | #endif // LLVM_ADT_STRINGMAP_H |