HomeSort by relevance Sort by last modified time
    Searched refs:pred_end (Results 1 - 25 of 233) sorted by null

1 2 3 4 5 6 7 8 910

  /external/llvm/lib/Analysis/
Interval.cpp 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode);
  /prebuilts/clang/host/darwin-x86/clang-3957855/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-3960126/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-3977809/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-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-3957855/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-3960126/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-3977809/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-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); }
  /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);
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));
  /external/swiftshader/third_party/LLVM/include/llvm/Support/
PredIteratorCache.h 41 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB));
  /external/swiftshader/third_party/LLVM/lib/Analysis/
Interval.cpp 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode);
  /external/llvm/include/llvm/Analysis/
Interval.h 113 /// pred_begin/pred_end - define methods so that Intervals may be used
119 inline Interval::pred_iterator pred_end(Interval *I) { function in namespace:llvm
146 return pred_end(N);
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/
Interval.h 113 /// pred_begin/pred_end - define methods so that Intervals may be used
119 inline Interval::pred_iterator pred_end(Interval *I) { function in namespace:llvm
139 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/
Interval.h 113 /// pred_begin/pred_end - define methods so that Intervals may be used
119 inline Interval::pred_iterator pred_end(Interval *I) { function in namespace:llvm
139 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/
Interval.h 113 /// pred_begin/pred_end - define methods so that Intervals may be used
119 inline Interval::pred_iterator pred_end(Interval *I) { function in namespace:llvm
139 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }

Completed in 552 milliseconds

1 2 3 4 5 6 7 8 910