/external/llvm/lib/Analysis/ |
Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode);
|
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
CFG.h | 103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 104 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 108 return pred_begin(BB) == pred_end(BB); 111 return pred_range(pred_begin(BB), pred_end(BB)); 114 return pred_const_range(pred_begin(BB), pred_end(BB)); 191 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 199 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
CFG.h | 103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 104 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 108 return pred_begin(BB) == pred_end(BB); 111 return pred_range(pred_begin(BB), pred_end(BB)); 114 return pred_const_range(pred_begin(BB), pred_end(BB)); 192 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 201 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
CFG.h | 103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 104 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 108 return pred_begin(BB) == pred_end(BB); 111 return pred_range(pred_begin(BB), pred_end(BB)); 114 return pred_const_range(pred_begin(BB), pred_end(BB)); 192 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 201 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
CFG.h | 103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 104 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 108 return pred_begin(BB) == pred_end(BB); 111 return pred_range(pred_begin(BB), pred_end(BB)); 114 return pred_const_range(pred_begin(BB), pred_end(BB)); 192 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 201 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
CFG.h | 103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 104 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 108 return pred_begin(BB) == pred_end(BB); 111 return pred_range(pred_begin(BB), pred_end(BB)); 114 return pred_const_range(pred_begin(BB), pred_end(BB)); 192 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 201 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
CFG.h | 103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 104 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 108 return pred_begin(BB) == pred_end(BB); 111 return pred_range(pred_begin(BB), pred_end(BB)); 114 return pred_const_range(pred_begin(BB), pred_end(BB)); 192 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 201 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
CFG.h | 103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 104 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 108 return pred_begin(BB) == pred_end(BB); 111 return pred_range(pred_begin(BB), pred_end(BB)); 114 return pred_const_range(pred_begin(BB), pred_end(BB)); 192 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 201 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
CFG.h | 103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 104 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 108 return pred_begin(BB) == pred_end(BB); 111 return pred_range(pred_begin(BB), pred_end(BB)); 114 return pred_const_range(pred_begin(BB), pred_end(BB)); 191 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 199 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
CFG.h | 103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 104 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 108 return pred_begin(BB) == pred_end(BB); 111 return pred_range(pred_begin(BB), pred_end(BB)); 114 return pred_const_range(pred_begin(BB), pred_end(BB)); 192 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); } 201 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
|
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/IR/ |
PredIteratorCache.h | 42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB)); 62 return BlockToPredCountMap[BB] = std::distance(pred_begin(BB), pred_end(BB));
|
/external/llvm/include/llvm/IR/ |
CFG.h | 95 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} function in namespace:llvm 96 inline const_pred_iterator pred_end(const BasicBlock *BB) { function in namespace:llvm 100 return pred_begin(BB) == pred_end(BB); 103 return pred_range(pred_begin(BB), pred_end(BB)); 106 return pred_const_range(pred_begin(BB), pred_end(BB)); 196 return pred_end(N); 210 return pred_end(N);
|