| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 36 #include <iterator>
111 typedef typename std::vector<DomTreeNodeBase<NodeT> *>::iterator iterator; typedef in class:llvm::DomTreeNodeBase
115 iterator begin() { return Children.begin(); }
116 iterator end() { return Children.end(); }
158 typename std::vector<DomTreeNodeBase<NodeT> *>::iterator I =
651 typename std::vector<DomTreeNodeBase<NodeT> *>::iterator I =
|
| OnDiskHashTable.h | 320 class iterator { class in class:llvm::OnDiskChainedHashTable
327 iterator() : Key(), Data(nullptr), Len(0), InfoObj(nullptr) {} function in class:llvm::OnDiskChainedHashTable::iterator
328 iterator(const internal_key_type K, const unsigned char *D, offset_type L, function in class:llvm::OnDiskChainedHashTable::iterator
337 bool operator==(const iterator &X) const { return X.Data == Data; }
338 bool operator!=(const iterator &X) const { return X.Data != Data; }
342 iterator find(const external_key_type &EKey, Info *InfoPtr = nullptr) {
349 iterator find_hashed(const internal_key_type &IKey, hash_value_type KeyHash,
362 return iterator(); // Empty bucket.
396 return iterator(X, Items + L.first, L.second, InfoPtr);
399 return iterator();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/Basic/ |
| IdentifierTable.h | 412 /// \brief An iterator that walks over all of the known identifiers
415 /// Since this iterator uses an abstract interface via virtual
417 /// more standard C++ STL iterator interface. In this OO-style
420 /// operation. Subclasses of this iterator type will provide the
433 /// advances the iterator for the following string.
452 /// \brief Retrieve an iterator into the set of all identifiers
460 /// \returns A new iterator into the set of known identifiers. The
461 /// caller is responsible for deleting this iterator.
559 typedef HashTableTy::const_iterator iterator; typedef in class:clang::IdentifierTable
562 iterator begin() const { return HashTable.begin();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/Sema/ |
| CodeCompleteConsumer.h | 464 typedef const Chunk *iterator; typedef in class:clang::CodeCompletionString
465 iterator begin() const { return reinterpret_cast<const Chunk *>(this + 1); }
466 iterator end() const { return begin() + NumChunks; }
[all...] |
| Lookup.h | 127 typedef UnresolvedSetImpl::iterator iterator; typedef in class:clang::LookupResult
319 iterator begin() const { return iterator(Decls.begin()); }
320 iterator end() const { return iterator(Decls.end()); }
602 LookupResult::iterator I;
636 /// Erase the last element returned from this iterator.
696 for (iterator I = begin(), E = end(); I != E; ++I)
789 typedef llvm::mapped_iterator<decltype(Decls)::iterator, select_second
790 iterator; typedef in class:clang::ADLResult
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporter.h | 67 typedef VisitorList::iterator visitor_iterator;
376 typedef llvm::ilist<BugReport>::iterator iterator; typedef in class:clang::ento::BugReportEquivClass
379 iterator begin() { return Reports.begin(); }
380 iterator end() { return Reports.end(); }
451 /// \brief Iterator over the set of BugTypes tracked by the BugReporter.
452 typedef BugTypesTy::iterator iterator; typedef in class:clang::ento::BugReporter
453 iterator begin() { return BugTypes.begin(); }
454 iterator end() { return BugTypes.end();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| CoreEngine.h | 232 for (iterator I = Frontier.begin(), E = Frontier.end(); I != E; ++I) {
287 typedef ExplodedNodeSet::iterator iterator; typedef in class:clang::ento::NodeBuilder
289 inline iterator begin() {
294 inline iterator end() {
303 for (ExplodedNodeSet::iterator I = S.begin(), E = S.end(); I != E; ++I )
369 for (ExplodedNodeSet::iterator I = SrcSet.begin(),
460 class iterator { class in class:clang::ento::IndirectGotoNodeBuilder
464 iterator(CFGBlock::const_succ_iterator i) : I(i) {} function in class:clang::ento::IndirectGotoNodeBuilder::iterator
467 iterator &operator++() { ++I; return *this;
506 class iterator { class in class:clang::ento::SwitchNodeBuilder
510 iterator(CFGBlock::const_succ_reverse_iterator i) : I(i) {} function in class:clang::ento::SwitchNodeBuilder::iterator
[all...] |
| ExplodedGraph.h | 336 typedef NodeVector::iterator roots_iterator;
338 typedef NodeVector::iterator eop_iterator;
340 typedef AllNodesTy::iterator node_iterator;
422 typedef ImplTy::iterator iterator; typedef in class:clang::ento::ExplodedNodeSet
438 inline iterator begin() { return Impl.begin(); }
439 inline iterator end() { return Impl.end(); }
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| LazyCallGraph.h | 44 #include "llvm/ADT/iterator.h"
53 #include <iterator>
189 /// An iterator used for the edges to both entry nodes and child nodes.
190 class iterator class in class:llvm::LazyCallGraph::Edge::EdgeSequence
191 : public iterator_adaptor_base<iterator, VectorImplT::iterator,
196 VectorImplT::iterator E;
198 // Build the iterator for a specific position in the edge list.
199 iterator(VectorImplT::iterator BaseI, VectorImplT::iterator E function in class:llvm::LazyCallGraph::Edge::EdgeSequence::iterator
206 iterator() {} function in class:llvm::LazyCallGraph::Edge::EdgeSequence::iterator
464 typedef pointee_iterator<SmallVectorImpl<Node *>::const_iterator> iterator; typedef in class:llvm::LazyCallGraph::Edge::SCC
594 typedef pointee_iterator<SmallVectorImpl<SCC *>::const_iterator> iterator; typedef in class:llvm::LazyCallGraph::Edge::RefSCC
[all...] |
| LoopInfo.h | 129 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopBase
132 iterator begin() const { return SubLoops.begin(); }
133 iterator end() const { return SubLoops.end(); }
278 LoopT *removeChildLoop(iterator I) {
279 assert(I != SubLoops.end() && "Cannot remove end iterator!");
553 /// iterator/begin/end - The interface to the top-level loops in the current
556 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopInfoBase
559 iterator begin() const { return TopLevelLoops.begin(); }
560 iterator end() const { return TopLevelLoops.end(); }
607 LoopT *removeLoop(iterator I)
[all...] |
| RegionInfo.h | 544 /// These iterators iterator over all subregions of this Region.
546 typedef typename RegionSet::iterator iterator; typedef in class:llvm::RegionBase
549 iterator begin() { return children.begin(); }
550 iterator end() { return children.end(); }
559 /// Region. The iterator also iterates over BasicBlocks that are elements of
560 /// a subregion of this Region. It is therefore called a flat iterator.
573 // Construct the begin iterator.
582 // Construct the end iterator.
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/ |
| GenericDomTree.h | 36 #include <iterator>
111 typedef typename std::vector<DomTreeNodeBase<NodeT> *>::iterator iterator; typedef in class:llvm::DomTreeNodeBase
115 iterator begin() { return Children.begin(); }
116 iterator end() { return Children.end(); }
158 typename std::vector<DomTreeNodeBase<NodeT> *>::iterator I =
644 typename std::vector<DomTreeNodeBase<NodeT> *>::iterator I =
|
| OnDiskHashTable.h | 320 class iterator { class in class:llvm::OnDiskChainedHashTable
327 iterator() : Key(), Data(nullptr), Len(0), InfoObj(nullptr) {} function in class:llvm::OnDiskChainedHashTable::iterator
328 iterator(const internal_key_type K, const unsigned char *D, offset_type L, function in class:llvm::OnDiskChainedHashTable::iterator
337 bool operator==(const iterator &X) const { return X.Data == Data; }
338 bool operator!=(const iterator &X) const { return X.Data != Data; }
342 iterator find(const external_key_type &EKey, Info *InfoPtr = nullptr) {
349 iterator find_hashed(const internal_key_type &IKey, hash_value_type KeyHash,
362 return iterator(); // Empty bucket.
396 return iterator(X, Items + L.first, L.second, InfoPtr);
399 return iterator();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/clang/Basic/ |
| IdentifierTable.h | 412 /// \brief An iterator that walks over all of the known identifiers
415 /// Since this iterator uses an abstract interface via virtual
417 /// more standard C++ STL iterator interface. In this OO-style
420 /// operation. Subclasses of this iterator type will provide the
433 /// advances the iterator for the following string.
452 /// \brief Retrieve an iterator into the set of all identifiers
460 /// \returns A new iterator into the set of known identifiers. The
461 /// caller is responsible for deleting this iterator.
559 typedef HashTableTy::const_iterator iterator; typedef in class:clang::IdentifierTable
562 iterator begin() const { return HashTable.begin();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/clang/Sema/ |
| CodeCompleteConsumer.h | 464 typedef const Chunk *iterator; typedef in class:clang::CodeCompletionString
465 iterator begin() const { return reinterpret_cast<const Chunk *>(this + 1); }
466 iterator end() const { return begin() + NumChunks; }
[all...] |
| Lookup.h | 127 typedef UnresolvedSetImpl::iterator iterator; typedef in class:clang::LookupResult
319 iterator begin() const { return iterator(Decls.begin()); }
320 iterator end() const { return iterator(Decls.end()); }
602 LookupResult::iterator I;
636 /// Erase the last element returned from this iterator.
696 for (iterator I = begin(), E = end(); I != E; ++I)
789 typedef llvm::mapped_iterator<decltype(Decls)::iterator, select_second
790 iterator; typedef in class:clang::ADLResult
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporter.h | 67 typedef VisitorList::iterator visitor_iterator;
376 typedef llvm::ilist<BugReport>::iterator iterator; typedef in class:clang::ento::BugReportEquivClass
379 iterator begin() { return Reports.begin(); }
380 iterator end() { return Reports.end(); }
451 /// \brief Iterator over the set of BugTypes tracked by the BugReporter.
452 typedef BugTypesTy::iterator iterator; typedef in class:clang::ento::BugReporter
453 iterator begin() { return BugTypes.begin(); }
454 iterator end() { return BugTypes.end();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| CoreEngine.h | 232 for (iterator I = Frontier.begin(), E = Frontier.end(); I != E; ++I) {
287 typedef ExplodedNodeSet::iterator iterator; typedef in class:clang::ento::NodeBuilder
289 inline iterator begin() {
294 inline iterator end() {
303 for (ExplodedNodeSet::iterator I = S.begin(), E = S.end(); I != E; ++I )
369 for (ExplodedNodeSet::iterator I = SrcSet.begin(),
460 class iterator { class in class:clang::ento::IndirectGotoNodeBuilder
464 iterator(CFGBlock::const_succ_iterator i) : I(i) {} function in class:clang::ento::IndirectGotoNodeBuilder::iterator
467 iterator &operator++() { ++I; return *this;
506 class iterator { class in class:clang::ento::SwitchNodeBuilder
510 iterator(CFGBlock::const_succ_reverse_iterator i) : I(i) {} function in class:clang::ento::SwitchNodeBuilder::iterator
[all...] |
| ExplodedGraph.h | 336 typedef NodeVector::iterator roots_iterator;
338 typedef NodeVector::iterator eop_iterator;
340 typedef AllNodesTy::iterator node_iterator;
422 typedef ImplTy::iterator iterator; typedef in class:clang::ento::ExplodedNodeSet
438 inline iterator begin() { return Impl.begin(); }
439 inline iterator end() { return Impl.end(); }
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| LazyCallGraph.h | 44 #include "llvm/ADT/iterator.h"
53 #include <iterator>
189 /// An iterator used for the edges to both entry nodes and child nodes.
190 class iterator class in class:llvm::LazyCallGraph::Edge::EdgeSequence
191 : public iterator_adaptor_base<iterator, VectorImplT::iterator,
196 VectorImplT::iterator E;
198 // Build the iterator for a specific position in the edge list.
199 iterator(VectorImplT::iterator BaseI, VectorImplT::iterator E function in class:llvm::LazyCallGraph::Edge::EdgeSequence::iterator
206 iterator() {} function in class:llvm::LazyCallGraph::Edge::EdgeSequence::iterator
464 typedef pointee_iterator<SmallVectorImpl<Node *>::const_iterator> iterator; typedef in class:llvm::LazyCallGraph::Edge::SCC
594 typedef pointee_iterator<SmallVectorImpl<SCC *>::const_iterator> iterator; typedef in class:llvm::LazyCallGraph::Edge::RefSCC
[all...] |
| LoopInfo.h | 129 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopBase
132 iterator begin() const { return SubLoops.begin(); }
133 iterator end() const { return SubLoops.end(); }
278 LoopT *removeChildLoop(iterator I) {
279 assert(I != SubLoops.end() && "Cannot remove end iterator!");
553 /// iterator/begin/end - The interface to the top-level loops in the current
556 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopInfoBase
559 iterator begin() const { return TopLevelLoops.begin(); }
560 iterator end() const { return TopLevelLoops.end(); }
607 LoopT *removeLoop(iterator I)
[all...] |
| RegionInfo.h | 544 /// These iterators iterator over all subregions of this Region.
546 typedef typename RegionSet::iterator iterator; typedef in class:llvm::RegionBase
549 iterator begin() { return children.begin(); }
550 iterator end() { return children.end(); }
559 /// Region. The iterator also iterates over BasicBlocks that are elements of
560 /// a subregion of this Region. It is therefore called a flat iterator.
573 // Construct the begin iterator.
582 // Construct the end iterator.
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/ |
| GenericDomTree.h | 36 #include <iterator>
111 typedef typename std::vector<DomTreeNodeBase<NodeT> *>::iterator iterator; typedef in class:llvm::DomTreeNodeBase
115 iterator begin() { return Children.begin(); }
116 iterator end() { return Children.end(); }
158 typename std::vector<DomTreeNodeBase<NodeT> *>::iterator I =
644 typename std::vector<DomTreeNodeBase<NodeT> *>::iterator I =
|
| OnDiskHashTable.h | 320 class iterator { class in class:llvm::OnDiskChainedHashTable
327 iterator() : Key(), Data(nullptr), Len(0), InfoObj(nullptr) {} function in class:llvm::OnDiskChainedHashTable::iterator
328 iterator(const internal_key_type K, const unsigned char *D, offset_type L, function in class:llvm::OnDiskChainedHashTable::iterator
337 bool operator==(const iterator &X) const { return X.Data == Data; }
338 bool operator!=(const iterator &X) const { return X.Data != Data; }
342 iterator find(const external_key_type &EKey, Info *InfoPtr = nullptr) {
349 iterator find_hashed(const internal_key_type &IKey, hash_value_type KeyHash,
362 return iterator(); // Empty bucket.
396 return iterator(X, Items + L.first, L.second, InfoPtr);
399 return iterator();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/Basic/ |
| IdentifierTable.h | 407 /// \brief An iterator that walks over all of the known identifiers
410 /// Since this iterator uses an abstract interface via virtual
412 /// more standard C++ STL iterator interface. In this OO-style
415 /// operation. Subclasses of this iterator type will provide the
428 /// advances the iterator for the following string.
447 /// \brief Retrieve an iterator into the set of all identifiers
455 /// \returns A new iterator into the set of known identifiers. The
456 /// caller is responsible for deleting this iterator.
554 typedef HashTableTy::const_iterator iterator; typedef in class:clang::IdentifierTable
557 iterator begin() const { return HashTable.begin();
[all...] |
