| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| DepthFirstIterator.h | 1 //===- llvm/ADT/DepthFirstIterator.h - Depth First iterator -----*- C++ -*-===//
11 // first graph iterator. This file exposes the following functions/types:
21 // This iterator stores the 'visited' set in an external set, which allows
27 // This iterator stores the 'visited' set in an external set, which allows
41 #include <iterator>
72 typedef typename BaseSet::iterator iterator; typedef in struct:llvm::df_iterator_default_set
73 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N) ; }
80 // Generic Depth First Iterator
86 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>
[all...] |
| EquivalenceClasses.h | 21 #include <iterator>
44 /// for (EquivalenceClasses<int>::iterator I = EC.begin(), E = EC.end();
129 for (iterator I = RHS.begin(), E = RHS.end(); I != E; ++I)
143 /// iterator* - Provides a way to iterate over all values in the set.
144 typedef typename std::set<ECValue>::const_iterator iterator; typedef in class:llvm::EquivalenceClasses
145 iterator begin() const { return TheMapping.begin(); }
146 iterator end() const { return TheMapping.end(); }
153 member_iterator member_begin(iterator I) const {
161 /// findValue - Return an iterator to the specified value. If it does not
163 iterator findValue(const ElemTy &V) const
[all...] |
| ImmutableList.h | 82 class iterator { class in class:llvm::ImmutableList
86 iterator() = default;
87 iterator(ImmutableList l) : L(l.getInternalPointer()) {} function in class:llvm::ImmutableList::iterator
89 iterator& operator++() { L = L->getTail(); return *this; }
90 bool operator==(const iterator& I) const { return L == I.L; }
91 bool operator!=(const iterator& I) const { return L != I.L; }
97 /// begin - Returns an iterator referring to the head of the list, or
98 /// an iterator denoting the end of the list if the list is empty.
99 iterator begin() const { return iterator(X);
[all...] |
| ImmutableMap.h | 207 class iterator : public ImutAVLValueIterator<ImmutableMap> { class in class:llvm::ImmutableMap
210 iterator() = default;
211 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} function in class:llvm::ImmutableMap::iterator
218 iterator begin() const { return iterator(Root); }
219 iterator end() const { return iterator(); }
367 class iterator : public ImutAVLValueIterator<ImmutableMapRef> { class in class:llvm::ImmutableMapRef
370 iterator() = default
371 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} function in class:llvm::ImmutableMapRef::iterator
[all...] |
| ScopedHashTable.h | 197 typedef ScopedHashTableIterator<K, V, KInfo> iterator; typedef in class:llvm::ScopedHashTable
199 iterator end() { return iterator(0); }
201 iterator begin(const K &Key) {
202 typename DenseMap<K, ValTy*, KInfo>::iterator I =
205 return iterator(I->second);
|
| SparseMultiSet.h | 30 #include <iterator>
131 /// erasure, iterator preservation, and dense size.
221 class iterator_base : public std::iterator<std::bidirectional_iterator_tag,
232 /// Whether our iterator has fallen outside our dense vector.
241 /// Whether our iterator is properly keyed, i.e. the SparseIdx is valid
251 typedef std::iterator<std::bidirectional_iterator_tag, ValueT> super;
259 "Dereferencing iterator of invalid key or index");
283 assert(isKeyed() && "Decrementing an invalid iterator");
296 assert(!isEnd() && isKeyed() && "Incrementing an invalid/end iterator");
311 typedef iterator_base<SparseMultiSet *> iterator; typedef in class:llvm::SparseMultiSet
[all...] |
| simple_ilist.h | 36 /// takes an iterator or iterator range and returns the next one, and \a
91 typedef ilist_iterator<OptionsT, false, false> iterator; typedef in class:llvm::simple_ilist
113 iterator begin() { return ++iterator(Sentinel); }
115 iterator end() { return iterator(Sentinel); }
155 iterator insert(iterator I, reference Node) {
157 return iterator(&Node)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraph.h | 116 typedef FunctionMapTy::iterator iterator; typedef in class:llvm::CallGraph
122 inline iterator begin() { return FunctionMap.begin(); }
123 inline iterator end() { return FunctionMap.end(); }
187 typedef std::vector<CallRecord>::iterator iterator; typedef in class:llvm::CallGraphNode
193 inline iterator begin() { return CalledFunctions.begin(); }
194 inline iterator end() { return CalledFunctions.end(); }
244 void removeCallEdge(iterator I) {
342 typedef CallGraph::iterator iterator typedef in class:CallGraphWrapperPass
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| GCMetadata.h | 76 typedef std::vector<GCPoint>::iterator iterator; typedef in class:llvm::GCFunctionInfo
77 typedef std::vector<GCRoot>::iterator roots_iterator;
135 iterator begin() { return SafePoints.begin(); }
136 iterator end() { return SafePoints.end(); }
147 live_iterator live_begin(const iterator &p) { return roots_begin(); }
148 live_iterator live_end(const iterator &p) { return roots_end(); }
149 size_t live_size(const iterator &p) const { return roots_size(); }
171 FuncInfoVec::iterator funcinfo_begin() { return Functions.begin(); }
172 FuncInfoVec::iterator funcinfo_end() { return Functions.end();
184 typedef SmallVector<std::unique_ptr<GCStrategy>,1>::const_iterator iterator; typedef in class:llvm::GCModuleInfo
[all...] |
| LiveRangeEdit.h | 145 /// Iterator for accessing the new registers added by this edit.
146 typedef SmallVectorImpl<unsigned>::const_iterator iterator; typedef in class:llvm::LiveRangeEdit
147 iterator begin() const { return NewRegs.begin()+FirstNew; }
148 iterator end() const { return NewRegs.end(); }
212 MachineBasicBlock::iterator MI,
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| Attributes.h | 247 typedef const Attribute *iterator; typedef in class:llvm::AttributeSet
248 iterator begin() const;
249 iterator end() const;
481 typedef ArrayRef<Attribute>::iterator iterator; typedef
483 iterator begin(unsigned Slot) const;
484 iterator end(unsigned Slot) const;
665 typedef std::map<std::string, std::string>::iterator td_iterator;
|
| BasicBlock.h | 83 typedef InstListType::iterator iterator; typedef in class:llvm::BasicBlock
167 /// \brief Returns an iterator to the first instruction in this block that is
172 iterator getFirstInsertionPt() {
182 // \returns an iterator pointing to the element after the erased one.
183 SymbolTableList<BasicBlock>::iterator eraseFromParent();
242 /// Instruction iterator methods
244 inline iterator begin() { return InstList.begin(); }
246 inline iterator end () { return InstList.end(); }
304 /// Note that all instructions BEFORE the specified iterator stay as part o
[all...] |
| LegacyPassManagers.h | 146 typedef std::vector<PMDataManager *>::const_reverse_iterator iterator; typedef in class:llvm::PMStack
147 iterator begin() const { return S.rbegin(); }
148 iterator end() const { return S.rend(); }
401 for (PMStack::iterator I = PMS.begin(), E = PMS.end();
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/MC/ |
| MCInst.h | 179 typedef SmallVectorImpl<MCOperand>::iterator iterator; typedef in class:llvm::MCInst
182 void erase(iterator I) { Operands.erase(I); }
184 iterator begin() { return Operands.begin(); }
186 iterator end() { return Operands.end(); }
189 iterator insert(iterator I, const MCOperand &Op) {
|
| MCSection.h | 53 typedef FragmentListType::iterator iterator; typedef in class:llvm::MCSection
156 iterator begin() { return Fragments.begin(); }
159 iterator end() { return Fragments.end(); }
168 MCSection::iterator getSubsectionInsertionPoint(unsigned Subsection);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Option/ |
| ArgList.h | 40 /// bother to factor this into two separate iterator implementations.
44 // iterator combinator which takes multiple iterators which can be
97 typedef arglist_type::iterator iterator; typedef in class:llvm::opt::ArgList
142 iterator begin() { return Args.begin(); }
143 iterator end() { return Args.end(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/AST/ |
| ASTVector.h | 80 typedef T* iterator; typedef in class:clang::ASTVector
84 typedef std::reverse_iterator<iterator> reverse_iterator;
91 // forward iterator creation methods.
92 iterator begin() { return Begin; }
94 iterator end() { return End; }
97 // reverse iterator creation methods.
192 // iterator to use the fast uninitialized_copy.
216 iterator insert(const ASTContext &C, iterator I, const T &Elt) {
237 iterator insert(const ASTContext &C, iterator I, size_type NumToInsert
[all...] |
| CXXInheritance.h | 172 typedef std::list<CXXBasePath>::iterator paths_iterator;
280 typedef MapType::iterator iterator; typedef in class:clang::OverridingMethods
282 iterator begin() { return Overrides.begin(); }
284 iterator end() { return Overrides.end(); }
290 typedef SmallVectorImpl<UniqueVirtualMethod>::iterator
|
| TemplateName.h | 107 typedef NamedDecl *const *iterator; typedef in class:clang::OverloadedTemplateStorage
109 iterator begin() const { return getStorage(); }
110 iterator end() const { return getStorage() + size(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/Analysis/ |
| CloneDetection.h | 74 typedef const Stmt *const *iterator; typedef in class:clang::StmtSequence
76 /// Returns an iterator pointing to the first statement in this sequence.
77 iterator begin() const;
79 /// Returns an iterator pointing behind the last statement in this sequence.
80 iterator end() const;
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/Analysis/Support/ |
| BumpVector.h | 27 #include <iterator>
77 typedef T* iterator; typedef in class:clang::BumpVector
81 typedef std::reverse_iterator<iterator> reverse_iterator;
88 // forward iterator creation methods.
89 iterator begin() { return Begin; }
91 iterator end() { return End; }
94 // reverse iterator creation methods.
166 /// iterator to position after last inserted copy.
167 iterator insert(iterator I, size_t Cnt, const_reference E
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/Sema/ |
| TemplateDeduction.h | 120 /// \brief Iterator over the set of suppressed diagnostics.
124 /// \brief Returns an iterator at the beginning of the sequence of suppressed
128 /// \brief Returns an iterator at the end of the sequence of suppressed
295 typedef SmallVector<TemplateSpecCandidate, 16>::iterator iterator; typedef in class:clang::TemplateSpecCandidateSet
296 iterator begin() { return Candidates.begin(); }
297 iterator end() { return Candidates.end(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| BasicValueFactory.h | 37 typedef llvm::ImmutableList<SVal>::iterator iterator; typedef in class:clang::ento::CompoundValData
38 iterator begin() const { return L.begin(); }
39 iterator end() const { return L.end(); }
75 typedef llvm::ImmutableList<const CXXBaseSpecifier *>::iterator iterator; typedef in class:clang::ento::PointerToMemberData
76 iterator begin() const { return L.begin(); }
77 iterator end() const { return L.end(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| ImmutableList.h | 82 class iterator { class in class:llvm::ImmutableList
86 iterator() = default;
87 iterator(ImmutableList l) : L(l.getInternalPointer()) {} function in class:llvm::ImmutableList::iterator
89 iterator& operator++() { L = L->getTail(); return *this; }
90 bool operator==(const iterator& I) const { return L == I.L; }
91 bool operator!=(const iterator& I) const { return L != I.L; }
97 /// begin - Returns an iterator referring to the head of the list, or
98 /// an iterator denoting the end of the list if the list is empty.
99 iterator begin() const { return iterator(X);
[all...] |
| ImmutableMap.h | 209 class iterator : public ImutAVLValueIterator<ImmutableMap> { class in class:llvm::ImmutableMap
212 iterator() = default;
213 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} function in class:llvm::ImmutableMap::iterator
220 iterator begin() const { return iterator(Root); }
221 iterator end() const { return iterator(); }
369 class iterator : public ImutAVLValueIterator<ImmutableMapRef> { class in class:llvm::ImmutableMapRef
372 iterator() = default
373 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} function in class:llvm::ImmutableMapRef::iterator
[all...] |
