| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/IR/ |
| CFG.h | 11 // BasicBlock graphs to be treated as proper graphs for generic algorithms.
21 #include "llvm/IR/BasicBlock.h"
34 // BasicBlock pred_iterator definition
93 using pred_iterator = PredIterator<BasicBlock, Value::user_iterator>;
95 PredIterator<const BasicBlock, Value::const_user_iterator>;
99 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
100 inline const_pred_iterator pred_begin(const BasicBlock *BB) {
103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
104 inline const_pred_iterator pred_end(const BasicBlock *BB) {
107 inline bool pred_empty(const BasicBlock *BB)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| CFG.h | 11 // BasicBlock graphs to be treated as proper graphs for generic algorithms.
21 #include "llvm/IR/BasicBlock.h"
34 // BasicBlock pred_iterator definition
93 typedef PredIterator<BasicBlock, Value::user_iterator> pred_iterator;
94 typedef PredIterator<const BasicBlock,
99 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
100 inline const_pred_iterator pred_begin(const BasicBlock *BB) {
103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
104 inline const_pred_iterator pred_end(const BasicBlock *BB) {
107 inline bool pred_empty(const BasicBlock *BB)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/IR/ |
| CFG.h | 11 // BasicBlock graphs to be treated as proper graphs for generic algorithms.
21 #include "llvm/IR/BasicBlock.h"
34 // BasicBlock pred_iterator definition
93 using pred_iterator = PredIterator<BasicBlock, Value::user_iterator>;
95 PredIterator<const BasicBlock, Value::const_user_iterator>;
99 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
100 inline const_pred_iterator pred_begin(const BasicBlock *BB) {
103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
104 inline const_pred_iterator pred_end(const BasicBlock *BB) {
107 inline bool pred_empty(const BasicBlock *BB)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/IR/ |
| CFG.h | 11 // BasicBlock graphs to be treated as proper graphs for generic algorithms.
21 #include "llvm/IR/BasicBlock.h"
34 // BasicBlock pred_iterator definition
93 using pred_iterator = PredIterator<BasicBlock, Value::user_iterator>;
95 PredIterator<const BasicBlock, Value::const_user_iterator>;
99 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
100 inline const_pred_iterator pred_begin(const BasicBlock *BB) {
103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
104 inline const_pred_iterator pred_end(const BasicBlock *BB) {
107 inline bool pred_empty(const BasicBlock *BB)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/IR/ |
| CFG.h | 11 // BasicBlock graphs to be treated as proper graphs for generic algorithms.
21 #include "llvm/IR/BasicBlock.h"
34 // BasicBlock pred_iterator definition
93 using pred_iterator = PredIterator<BasicBlock, Value::user_iterator>;
95 PredIterator<const BasicBlock, Value::const_user_iterator>;
99 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
100 inline const_pred_iterator pred_begin(const BasicBlock *BB) {
103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
104 inline const_pred_iterator pred_end(const BasicBlock *BB) {
107 inline bool pred_empty(const BasicBlock *BB)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/IR/ |
| CFG.h | 11 // BasicBlock graphs to be treated as proper graphs for generic algorithms.
21 #include "llvm/IR/BasicBlock.h"
34 // BasicBlock pred_iterator definition
93 using pred_iterator = PredIterator<BasicBlock, Value::user_iterator>;
95 PredIterator<const BasicBlock, Value::const_user_iterator>;
99 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
100 inline const_pred_iterator pred_begin(const BasicBlock *BB) {
103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
104 inline const_pred_iterator pred_end(const BasicBlock *BB) {
107 inline bool pred_empty(const BasicBlock *BB)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/IR/ |
| CFG.h | 11 // BasicBlock graphs to be treated as proper graphs for generic algorithms.
21 #include "llvm/IR/BasicBlock.h"
34 // BasicBlock pred_iterator definition
93 using pred_iterator = PredIterator<BasicBlock, Value::user_iterator>;
95 PredIterator<const BasicBlock, Value::const_user_iterator>;
99 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
100 inline const_pred_iterator pred_begin(const BasicBlock *BB) {
103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
104 inline const_pred_iterator pred_end(const BasicBlock *BB) {
107 inline bool pred_empty(const BasicBlock *BB)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/IR/ |
| CFG.h | 11 // BasicBlock graphs to be treated as proper graphs for generic algorithms.
21 #include "llvm/IR/BasicBlock.h"
34 // BasicBlock pred_iterator definition
93 using pred_iterator = PredIterator<BasicBlock, Value::user_iterator>;
95 PredIterator<const BasicBlock, Value::const_user_iterator>;
99 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
100 inline const_pred_iterator pred_begin(const BasicBlock *BB) {
103 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
104 inline const_pred_iterator pred_end(const BasicBlock *BB) {
107 inline bool pred_empty(const BasicBlock *BB)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| FlattenCFG.cpp | 31 bool FlattenParallelAndOr(BasicBlock *BB, IRBuilder<> &Builder);
35 bool MergeIfRegion(BasicBlock *BB, IRBuilder<> &Builder);
41 bool CompareIfRegionBlock(BasicBlock *Head1, BasicBlock *Head2,
42 BasicBlock *Block1, BasicBlock *Block2);
46 bool run(BasicBlock *BB);
124 bool FlattenCFGOpt::FlattenParallelAndOr(BasicBlock *BB, IRBuilder<> &Builder) {
129 BasicBlock *LastCondBlock = nullptr;
130 BasicBlock *FirstCondBlock = nullptr
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| Loads.h | 17 #include "llvm/BasicBlock.h"
44 Value *FindAvailableLoadedValue(Value *Ptr, BasicBlock *ScanBB,
45 BasicBlock::iterator &ScanFrom,
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
| ProfilingUtils.h | 21 class BasicBlock;
30 void IncrementCounterInBlock(BasicBlock *BB, unsigned CounterNum,
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
46 void invalidateBlock(BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
46 void invalidateBlock(BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
49 void invalidateBlock(const BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
49 void invalidateBlock(const BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
49 void invalidateBlock(const BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
49 void invalidateBlock(const BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
46 void invalidateBlock(BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
46 void invalidateBlock(BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
49 void invalidateBlock(const BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
49 void invalidateBlock(const BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
49 void invalidateBlock(const BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| OrderedInstructions.h | 32 mutable DenseMap<const BasicBlock *, std::unique_ptr<OrderedBasicBlock>>
49 void invalidateBlock(const BasicBlock *BB) { OBBMap.erase(BB); }
|
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/opt/ |
| local_ssa_elim_pass.h | 38 using cbb_ptr = const ir::BasicBlock*;
42 std::function<std::vector<ir::BasicBlock*>*(const ir::BasicBlock*)>;
62 uint32_t MergeBlockIdIfAny(const ir::BasicBlock& blk, uint32_t* cbid);
78 std::list<ir::BasicBlock*>* order);
81 bool IsLoopHeader(ir::BasicBlock* block_ptr) const;
85 void SSABlockInitSinglePred(ir::BasicBlock* block_ptr);
98 void SSABlockInitLoopHeader(std::list<ir::BasicBlock*>::iterator block_itr);
106 void SSABlockInitMultiPred(ir::BasicBlock* block_ptr);
112 void SSABlockInit(std::list<ir::BasicBlock*>::iterator block_itr)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/IR/ |
| Dominators.h | 22 #include "llvm/IR/BasicBlock.h"
36 extern template class DomTreeNodeBase<BasicBlock>;
37 extern template class DominatorTreeBase<BasicBlock, false>; // DomTree
38 extern template class DominatorTreeBase<BasicBlock, true>; // PostDomTree
41 using BBDomTree = DomTreeBase<BasicBlock>;
42 using BBPostDomTree = PostDomTreeBase<BasicBlock>;
44 extern template struct Update<BasicBlock *>;
46 using BBUpdates = ArrayRef<Update<BasicBlock *>>;
51 extern template void InsertEdge<BBDomTree>(BBDomTree &DT, BasicBlock *From,
52 BasicBlock *To)
[all...] |
