/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
H A D | RegionIterator.h | 33 template <class NodeRef, class BlockT, class RegionT> 88 return getNode()->template getNodeAs<RegionT>()->getExit(); 96 typedef RNSuccIterator<NodeRef, BlockT, RegionT> Self; 163 template <class NodeRef, class BlockT, class RegionT> 164 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 174 typedef RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> Self; 213 RegionT *Parent = Node->getParent(); 239 template <class NodeRef, class BlockT, class RegionT> 240 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 241 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 36 RegionT *Parent) 59 std::vector<RegionT *> RegionQueue; 62 RegionQueue.push_back(static_cast<RegionT *>(this)); 64 RegionT *R = RegionQueue.back(); 68 for (std::unique_ptr<RegionT> &Child : *R) { 77 std::vector<RegionT *> RegionQueue; 80 RegionQueue.push_back(static_cast<RegionT *>(this)); 82 RegionT *R = RegionQueue.back(); 86 for (std::unique_ptr<RegionT> &Child : *R) { 274 for (const std::unique_ptr<RegionT> 306 typedef typename Tr::RegionT RegionT; typedef [all...] |
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
H A D | RegionIterator.h | 33 template <class NodeRef, class BlockT, class RegionT> 88 return getNode()->template getNodeAs<RegionT>()->getExit(); 96 typedef RNSuccIterator<NodeRef, BlockT, RegionT> Self; 163 template <class NodeRef, class BlockT, class RegionT> 164 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 174 typedef RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> Self; 213 RegionT *Parent = Node->getParent(); 239 template <class NodeRef, class BlockT, class RegionT> 240 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 241 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 36 RegionT *Parent) 59 std::vector<RegionT *> RegionQueue; 62 RegionQueue.push_back(static_cast<RegionT *>(this)); 64 RegionT *R = RegionQueue.back(); 68 for (std::unique_ptr<RegionT> &Child : *R) { 77 std::vector<RegionT *> RegionQueue; 80 RegionQueue.push_back(static_cast<RegionT *>(this)); 82 RegionT *R = RegionQueue.back(); 86 for (std::unique_ptr<RegionT> &Child : *R) { 274 for (const std::unique_ptr<RegionT> 306 typedef typename Tr::RegionT RegionT; typedef [all...] |
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
H A D | RegionIterator.h | 33 template <class NodeRef, class BlockT, class RegionT> 88 return getNode()->template getNodeAs<RegionT>()->getExit(); 96 typedef RNSuccIterator<NodeRef, BlockT, RegionT> Self; 163 template <class NodeRef, class BlockT, class RegionT> 164 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 174 typedef RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> Self; 213 RegionT *Parent = Node->getParent(); 239 template <class NodeRef, class BlockT, class RegionT> 240 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 241 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 36 RegionT *Parent) 59 std::vector<RegionT *> RegionQueue; 62 RegionQueue.push_back(static_cast<RegionT *>(this)); 64 RegionT *R = RegionQueue.back(); 68 for (std::unique_ptr<RegionT> &Child : *R) { 77 std::vector<RegionT *> RegionQueue; 80 RegionQueue.push_back(static_cast<RegionT *>(this)); 82 RegionT *R = RegionQueue.back(); 86 for (std::unique_ptr<RegionT> &Child : *R) { 274 for (const std::unique_ptr<RegionT> 306 typedef typename Tr::RegionT RegionT; typedef [all...] |
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
H A D | RegionIterator.h | 39 template <class NodeRef, class BlockT, class RegionT> 93 return getNode()->template getNodeAs<RegionT>()->getExit(); 102 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>; 166 template <class NodeRef, class BlockT, class RegionT> 167 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 177 using Self = RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT>; 216 RegionT *Parent = Node->getParent(); 242 template <class NodeRef, class BlockT, class RegionT> 243 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 244 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 46 RegionT *Parent) 69 std::vector<RegionT *> RegionQueue; 72 RegionQueue.push_back(static_cast<RegionT *>(this)); 74 RegionT *R = RegionQueue.back(); 78 for (std::unique_ptr<RegionT> &Child : *R) { 87 std::vector<RegionT *> RegionQueue; 90 RegionQueue.push_back(static_cast<RegionT *>(this)); 92 RegionT *R = RegionQueue.back(); 96 for (std::unique_ptr<RegionT> &Child : *R) { 307 for (const std::unique_ptr<RegionT> [all...] |
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
H A D | RegionIterator.h | 39 template <class NodeRef, class BlockT, class RegionT> 93 return getNode()->template getNodeAs<RegionT>()->getExit(); 102 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>; 166 template <class NodeRef, class BlockT, class RegionT> 167 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 177 using Self = RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT>; 216 RegionT *Parent = Node->getParent(); 242 template <class NodeRef, class BlockT, class RegionT> 243 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 244 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 46 RegionT *Parent) 69 std::vector<RegionT *> RegionQueue; 72 RegionQueue.push_back(static_cast<RegionT *>(this)); 74 RegionT *R = RegionQueue.back(); 78 for (std::unique_ptr<RegionT> &Child : *R) { 87 std::vector<RegionT *> RegionQueue; 90 RegionQueue.push_back(static_cast<RegionT *>(this)); 92 RegionT *R = RegionQueue.back(); 96 for (std::unique_ptr<RegionT> &Child : *R) { 307 for (const std::unique_ptr<RegionT> [all...] |
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
H A D | RegionIterator.h | 39 template <class NodeRef, class BlockT, class RegionT> 93 return getNode()->template getNodeAs<RegionT>()->getExit(); 102 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>; 166 template <class NodeRef, class BlockT, class RegionT> 167 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 177 using Self = RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT>; 216 RegionT *Parent = Node->getParent(); 242 template <class NodeRef, class BlockT, class RegionT> 243 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 244 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 46 RegionT *Parent) 69 std::vector<RegionT *> RegionQueue; 72 RegionQueue.push_back(static_cast<RegionT *>(this)); 74 RegionT *R = RegionQueue.back(); 78 for (std::unique_ptr<RegionT> &Child : *R) { 87 std::vector<RegionT *> RegionQueue; 90 RegionQueue.push_back(static_cast<RegionT *>(this)); 92 RegionT *R = RegionQueue.back(); 96 for (std::unique_ptr<RegionT> &Child : *R) { 307 for (const std::unique_ptr<RegionT> [all...] |
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
H A D | RegionIterator.h | 39 template <class NodeRef, class BlockT, class RegionT> 93 return getNode()->template getNodeAs<RegionT>()->getExit(); 102 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>; 166 template <class NodeRef, class BlockT, class RegionT> 167 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 177 using Self = RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT>; 216 RegionT *Parent = Node->getParent(); 242 template <class NodeRef, class BlockT, class RegionT> 243 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 244 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 46 RegionT *Parent) 69 std::vector<RegionT *> RegionQueue; 72 RegionQueue.push_back(static_cast<RegionT *>(this)); 74 RegionT *R = RegionQueue.back(); 78 for (std::unique_ptr<RegionT> &Child : *R) { 87 std::vector<RegionT *> RegionQueue; 90 RegionQueue.push_back(static_cast<RegionT *>(this)); 92 RegionT *R = RegionQueue.back(); 96 for (std::unique_ptr<RegionT> &Child : *R) { 307 for (const std::unique_ptr<RegionT> [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
H A D | RegionIterator.h | 33 template <class NodeRef, class BlockT, class RegionT> 88 return getNode()->template getNodeAs<RegionT>()->getExit(); 96 typedef RNSuccIterator<NodeRef, BlockT, RegionT> Self; 163 template <class NodeRef, class BlockT, class RegionT> 164 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 174 typedef RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> Self; 213 RegionT *Parent = Node->getParent(); 239 template <class NodeRef, class BlockT, class RegionT> 240 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 241 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 36 RegionT *Parent) 59 std::vector<RegionT *> RegionQueue; 62 RegionQueue.push_back(static_cast<RegionT *>(this)); 64 RegionT *R = RegionQueue.back(); 68 for (std::unique_ptr<RegionT> &Child : *R) { 77 std::vector<RegionT *> RegionQueue; 80 RegionQueue.push_back(static_cast<RegionT *>(this)); 82 RegionT *R = RegionQueue.back(); 86 for (std::unique_ptr<RegionT> &Child : *R) { 274 for (const std::unique_ptr<RegionT> 306 typedef typename Tr::RegionT RegionT; typedef [all...] |
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
H A D | RegionIterator.h | 33 template <class NodeRef, class BlockT, class RegionT> 88 return getNode()->template getNodeAs<RegionT>()->getExit(); 96 typedef RNSuccIterator<NodeRef, BlockT, RegionT> Self; 163 template <class NodeRef, class BlockT, class RegionT> 164 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 174 typedef RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> Self; 213 RegionT *Parent = Node->getParent(); 239 template <class NodeRef, class BlockT, class RegionT> 240 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 241 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 36 RegionT *Parent) 59 std::vector<RegionT *> RegionQueue; 62 RegionQueue.push_back(static_cast<RegionT *>(this)); 64 RegionT *R = RegionQueue.back(); 68 for (std::unique_ptr<RegionT> &Child : *R) { 77 std::vector<RegionT *> RegionQueue; 80 RegionQueue.push_back(static_cast<RegionT *>(this)); 82 RegionT *R = RegionQueue.back(); 86 for (std::unique_ptr<RegionT> &Child : *R) { 274 for (const std::unique_ptr<RegionT> 306 typedef typename Tr::RegionT RegionT; typedef [all...] |
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
H A D | RegionIterator.h | 33 template <class NodeRef, class BlockT, class RegionT> 88 return getNode()->template getNodeAs<RegionT>()->getExit(); 96 typedef RNSuccIterator<NodeRef, BlockT, RegionT> Self; 163 template <class NodeRef, class BlockT, class RegionT> 164 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 174 typedef RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> Self; 213 RegionT *Parent = Node->getParent(); 239 template <class NodeRef, class BlockT, class RegionT> 240 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 241 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 36 RegionT *Parent) 59 std::vector<RegionT *> RegionQueue; 62 RegionQueue.push_back(static_cast<RegionT *>(this)); 64 RegionT *R = RegionQueue.back(); 68 for (std::unique_ptr<RegionT> &Child : *R) { 77 std::vector<RegionT *> RegionQueue; 80 RegionQueue.push_back(static_cast<RegionT *>(this)); 82 RegionT *R = RegionQueue.back(); 86 for (std::unique_ptr<RegionT> &Child : *R) { 274 for (const std::unique_ptr<RegionT> 306 typedef typename Tr::RegionT RegionT; typedef [all...] |
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
H A D | RegionIterator.h | 39 template <class NodeRef, class BlockT, class RegionT> 93 return getNode()->template getNodeAs<RegionT>()->getExit(); 102 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>; 166 template <class NodeRef, class BlockT, class RegionT> 167 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 177 using Self = RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT>; 216 RegionT *Parent = Node->getParent(); 242 template <class NodeRef, class BlockT, class RegionT> 243 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 244 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
H A D | RegionInfoImpl.h | 46 RegionT *Parent) 69 std::vector<RegionT *> RegionQueue; 72 RegionQueue.push_back(static_cast<RegionT *>(this)); 74 RegionT *R = RegionQueue.back(); 78 for (std::unique_ptr<RegionT> &Child : *R) { 87 std::vector<RegionT *> RegionQueue; 90 RegionQueue.push_back(static_cast<RegionT *>(this)); 92 RegionT *R = RegionQueue.back(); 96 for (std::unique_ptr<RegionT> &Child : *R) { 307 for (const std::unique_ptr<RegionT> [all...] |
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
H A D | RegionIterator.h | 39 template <class NodeRef, class BlockT, class RegionT> 93 return getNode()->template getNodeAs<RegionT>()->getExit(); 102 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>; 166 template <class NodeRef, class BlockT, class RegionT> 167 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 177 using Self = RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT>; 216 RegionT *Parent = Node->getParent(); 242 template <class NodeRef, class BlockT, class RegionT> 243 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 244 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
H A D | RegionIterator.h | 39 template <class NodeRef, class BlockT, class RegionT> 93 return getNode()->template getNodeAs<RegionT>()->getExit(); 102 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>; 166 template <class NodeRef, class BlockT, class RegionT> 167 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 177 using Self = RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT>; 216 RegionT *Parent = Node->getParent(); 242 template <class NodeRef, class BlockT, class RegionT> 243 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 244 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
H A D | RegionIterator.h | 39 template <class NodeRef, class BlockT, class RegionT> 93 return getNode()->template getNodeAs<RegionT>()->getExit(); 102 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>; 166 template <class NodeRef, class BlockT, class RegionT> 167 class RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT> 177 using Self = RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT>; 216 RegionT *Parent = Node->getParent(); 242 template <class NodeRef, class BlockT, class RegionT> 243 inline RNSuccIterator<NodeRef, BlockT, RegionT> succ_begin(NodeRef Node) { 244 return RNSuccIterator<NodeRef, BlockT, RegionT>(Nod [all...] |