| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
43 typedef std::vector<BasicBlock*>::iterator succ_iterator;
44 typedef std::vector<BasicBlock*>::iterator pred_iterator;
45 typedef std::vector<BasicBlock*>::iterator node_iterator;
47 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
51 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
61 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 22 class BasicBlock;
58 SetVector<BasicBlock *> Blocks;
67 static bool isBlockValidForExtraction(const BasicBlock &BB);
75 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
124 BasicBlock *&ExitBlock) const;
134 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
137 void severSplitPHINodes(BasicBlock *&Header);
142 BasicBlock *header,
143 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
44 using succ_iterator = std::vector<BasicBlock*>::iterator;
45 using pred_iterator = std::vector<BasicBlock*>::iterator;
46 using node_iterator = std::vector<BasicBlock*>::iterator;
48 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
52 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
60 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 25 class BasicBlock;
60 SetVector<BasicBlock *> Blocks;
71 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
86 static bool isBlockValidForExtraction(const BasicBlock &BB);
126 BasicBlock *&ExitBlock) const;
136 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
139 void severSplitPHINodes(BasicBlock *&Header);
144 BasicBlock *header,
145 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
44 using succ_iterator = std::vector<BasicBlock*>::iterator;
45 using pred_iterator = std::vector<BasicBlock*>::iterator;
46 using node_iterator = std::vector<BasicBlock*>::iterator;
48 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
52 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
60 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 25 class BasicBlock;
60 SetVector<BasicBlock *> Blocks;
71 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
86 static bool isBlockValidForExtraction(const BasicBlock &BB);
126 BasicBlock *&ExitBlock) const;
136 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
139 void severSplitPHINodes(BasicBlock *&Header);
144 BasicBlock *header,
145 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
44 using succ_iterator = std::vector<BasicBlock*>::iterator;
45 using pred_iterator = std::vector<BasicBlock*>::iterator;
46 using node_iterator = std::vector<BasicBlock*>::iterator;
48 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
52 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
60 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 25 class BasicBlock;
60 SetVector<BasicBlock *> Blocks;
71 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
86 static bool isBlockValidForExtraction(const BasicBlock &BB);
126 BasicBlock *&ExitBlock) const;
136 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
139 void severSplitPHINodes(BasicBlock *&Header);
144 BasicBlock *header,
145 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
44 using succ_iterator = std::vector<BasicBlock*>::iterator;
45 using pred_iterator = std::vector<BasicBlock*>::iterator;
46 using node_iterator = std::vector<BasicBlock*>::iterator;
48 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
52 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
60 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 25 class BasicBlock;
60 SetVector<BasicBlock *> Blocks;
71 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
86 static bool isBlockValidForExtraction(const BasicBlock &BB);
126 BasicBlock *&ExitBlock) const;
136 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
139 void severSplitPHINodes(BasicBlock *&Header);
144 BasicBlock *header,
145 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
43 typedef std::vector<BasicBlock*>::iterator succ_iterator;
44 typedef std::vector<BasicBlock*>::iterator pred_iterator;
45 typedef std::vector<BasicBlock*>::iterator node_iterator;
47 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
51 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
61 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
43 typedef std::vector<BasicBlock*>::iterator succ_iterator;
44 typedef std::vector<BasicBlock*>::iterator pred_iterator;
45 typedef std::vector<BasicBlock*>::iterator node_iterator;
47 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
51 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
61 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 22 class BasicBlock;
58 SetVector<BasicBlock *> Blocks;
67 static bool isBlockValidForExtraction(const BasicBlock &BB);
75 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
124 BasicBlock *&ExitBlock) const;
134 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
137 void severSplitPHINodes(BasicBlock *&Header);
142 BasicBlock *header,
143 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
43 typedef std::vector<BasicBlock*>::iterator succ_iterator;
44 typedef std::vector<BasicBlock*>::iterator pred_iterator;
45 typedef std::vector<BasicBlock*>::iterator node_iterator;
47 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
51 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
61 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 22 class BasicBlock;
58 SetVector<BasicBlock *> Blocks;
67 static bool isBlockValidForExtraction(const BasicBlock &BB);
75 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
124 BasicBlock *&ExitBlock) const;
134 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
137 void severSplitPHINodes(BasicBlock *&Header);
142 BasicBlock *header,
143 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
44 using succ_iterator = std::vector<BasicBlock*>::iterator;
45 using pred_iterator = std::vector<BasicBlock*>::iterator;
46 using node_iterator = std::vector<BasicBlock*>::iterator;
48 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
52 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
60 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 25 class BasicBlock;
60 SetVector<BasicBlock *> Blocks;
71 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
86 static bool isBlockValidForExtraction(const BasicBlock &BB);
126 BasicBlock *&ExitBlock) const;
136 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
139 void severSplitPHINodes(BasicBlock *&Header);
144 BasicBlock *header,
145 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
44 using succ_iterator = std::vector<BasicBlock*>::iterator;
45 using pred_iterator = std::vector<BasicBlock*>::iterator;
46 using node_iterator = std::vector<BasicBlock*>::iterator;
48 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
52 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
60 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 25 class BasicBlock;
60 SetVector<BasicBlock *> Blocks;
71 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
86 static bool isBlockValidForExtraction(const BasicBlock &BB);
126 BasicBlock *&ExitBlock) const;
136 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
139 void severSplitPHINodes(BasicBlock *&Header);
144 BasicBlock *header,
145 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
44 using succ_iterator = std::vector<BasicBlock*>::iterator;
45 using pred_iterator = std::vector<BasicBlock*>::iterator;
46 using node_iterator = std::vector<BasicBlock*>::iterator;
48 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
52 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
60 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 25 class BasicBlock;
60 SetVector<BasicBlock *> Blocks;
71 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
86 static bool isBlockValidForExtraction(const BasicBlock &BB);
126 BasicBlock *&ExitBlock) const;
136 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
139 void severSplitPHINodes(BasicBlock *&Header);
144 BasicBlock *header,
145 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
44 using succ_iterator = std::vector<BasicBlock*>::iterator;
45 using pred_iterator = std::vector<BasicBlock*>::iterator;
46 using node_iterator = std::vector<BasicBlock*>::iterator;
48 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
52 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
55 std::vector<BasicBlock*> Nodes;
60 std::vector<BasicBlock*> Successors
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 25 class BasicBlock;
60 SetVector<BasicBlock *> Blocks;
71 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
86 static bool isBlockValidForExtraction(const BasicBlock &BB);
126 BasicBlock *&ExitBlock) const;
136 BasicBlock *findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock);
139 void severSplitPHINodes(BasicBlock *&Header);
144 BasicBlock *header,
145 BasicBlock *newRootNode, BasicBlock *newHeader
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/opt/ |
| local_single_store_elim_pass.h | 38 using cbb_ptr = const ir::BasicBlock*;
59 std::function<const std::vector<ir::BasicBlock*>*(const ir::BasicBlock*)>;
73 bool Dominates(ir::BasicBlock* blk0, uint32_t idx0,
74 ir::BasicBlock* blk1, uint32_t idx1);
113 std::unordered_map<uint32_t, ir::BasicBlock*> label2block_;
122 std::unordered_map<ir::Instruction*, ir::BasicBlock*> store2blk_;
132 ir::BasicBlock pseudo_entry_block_;
135 ir::BasicBlock pseudo_exit_block_;
138 std::unordered_map<const ir::BasicBlock*, std::vector<ir::BasicBlock*>
[all...] |
| /external/llvm/include/llvm/Transforms/Scalar/ |
| JumpThreading.h | 35 typedef SmallVectorImpl<std::pair<Constant *, BasicBlock *>> PredValueInfo;
36 typedef SmallVector<std::pair<Constant *, BasicBlock *>, 8> PredValueInfoTy;
66 SmallPtrSet<const BasicBlock *, 16> LoopHeaders;
68 SmallSet<AssertingVH<const BasicBlock>, 16> LoopHeaders;
70 DenseSet<std::pair<Value *, BasicBlock *>> RecursionSet;
76 DenseSet<std::pair<Value *, BasicBlock *>> &TheSet;
77 std::pair<Value *, BasicBlock *> ThePair;
79 RecursionSetRemover(DenseSet<std::pair<Value *, BasicBlock *>> &S,
80 std::pair<Value *, BasicBlock *> P)
109 bool ProcessBlock(BasicBlock *BB)
[all...] |
