| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| dom.go | 131 idom := make([]*Block, maxBlockID)
167 idom[v] = fromID[u]
169 idom[v] = fromID[parent[w]]
176 if idom[w].ID != vertex[semi[w]] {
177 idom[w] = idom[idom[w].ID]
181 return idom
249 idom := make([]*Block, f.NumBlocks())
261 idom[f.Entry.ID] = f.Entr
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| dom.go | 131 idom := make([]*Block, maxBlockID)
167 idom[v] = fromID[u]
169 idom[v] = fromID[parent[w]]
176 if idom[w].ID != vertex[semi[w]] {
177 idom[w] = idom[idom[w].ID]
181 return idom
249 idom := make([]*Block, f.NumBlocks())
261 idom[f.Entry.ID] = f.Entr
[all...] |
| /external/clang/test/Analysis/ |
| domtest.c | 27 // CHECK: Immediate dominance tree (Node#,IDom#):
57 // CHECK: Immediate dominance tree (Node#,IDom#):
85 // CHECK: Immediate dominance tree (Node#,IDom#):
111 // CHECK: Immediate dominance tree (Node#,IDom#):
154 // CHECK: Immediate dominance tree (Node#,IDom#):
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 71 DomTreeNodeBase<NodeT> *IDom;
89 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
94 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
95 : TheBB(BB), IDom(iDom), DFSNumIn(-1), DFSNumOut(-1) {}
126 assert(IDom && "No immediate dominator?");
127 if (IDom != NewIDom) {
129 std::find(IDom->Children.begin(), IDom->Children.end(), this);
130 assert(I != IDom->Children.end() &
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| DomFront.java | 50 public int idom = -1; field in class:DomFront.DomInfo
91 System.out.println("idom[" + i + "]: "
92 + info.idom);
153 if (info.idom == -1) continue;
155 SsaBasicBlock domParent = nodes.get(info.idom);
178 runnerIndex != nbInfo.idom; /* empty */) {
194 runnerIndex = runnerInfo.idom;
|
| Dominators.java | 176 domInfos[root.getIndex()].idom = root.getIndex();
222 // Implicity define idom for each vertex.
232 domInfos[last.getIndex()].idom = U.getIndex();
234 domInfos[last.getIndex()].idom = wInfo.parent.getIndex();
242 if (domInfos[w.getIndex()].idom
244 domInfos[w.getIndex()].idom
245 = domInfos[domInfos[w.getIndex()].idom].idom;
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTree.h | 62 DomTreeNodeBase *IDom;
69 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom)
70 : TheBB(BB), IDom(iDom), Level(IDom ? IDom->Level + 1 : 0) {}
82 DomTreeNodeBase *getIDom() const { return IDom; }
118 assert(IDom && "No immediate dominator?");
119 if (IDom == NewIDom) return;
121 auto I = find(IDom->Children, this)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Support/ |
| GenericDomTree.h | 62 DomTreeNodeBase *IDom;
69 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom)
70 : TheBB(BB), IDom(iDom), Level(IDom ? IDom->Level + 1 : 0) {}
82 DomTreeNodeBase *getIDom() const { return IDom; }
118 assert(IDom && "No immediate dominator?");
119 if (IDom == NewIDom) return;
121 auto I = find(IDom->Children, this)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTree.h | 62 DomTreeNodeBase *IDom;
69 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom)
70 : TheBB(BB), IDom(iDom), Level(IDom ? IDom->Level + 1 : 0) {}
82 DomTreeNodeBase *getIDom() const { return IDom; }
118 assert(IDom && "No immediate dominator?");
119 if (IDom == NewIDom) return;
121 auto I = find(IDom->Children, this)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTree.h | 62 DomTreeNodeBase *IDom;
69 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom)
70 : TheBB(BB), IDom(iDom), Level(IDom ? IDom->Level + 1 : 0) {}
82 DomTreeNodeBase *getIDom() const { return IDom; }
118 assert(IDom && "No immediate dominator?");
119 if (IDom == NewIDom) return;
121 auto I = find(IDom->Children, this)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTree.h | 62 DomTreeNodeBase *IDom;
69 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom)
70 : TheBB(BB), IDom(iDom), Level(IDom ? IDom->Level + 1 : 0) {}
82 DomTreeNodeBase *getIDom() const { return IDom; }
118 assert(IDom && "No immediate dominator?");
119 if (IDom == NewIDom) return;
121 auto I = find(IDom->Children, this)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/ |
| GenericDomTree.h | 62 DomTreeNodeBase *IDom;
69 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom)
70 : TheBB(BB), IDom(iDom), Level(IDom ? IDom->Level + 1 : 0) {}
82 DomTreeNodeBase *getIDom() const { return IDom; }
118 assert(IDom && "No immediate dominator?");
119 if (IDom == NewIDom) return;
121 auto I = find(IDom->Children, this)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTree.h | 62 DomTreeNodeBase *IDom;
69 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom)
70 : TheBB(BB), IDom(iDom), Level(IDom ? IDom->Level + 1 : 0) {}
82 DomTreeNodeBase *getIDom() const { return IDom; }
118 assert(IDom && "No immediate dominator?");
119 if (IDom == NewIDom) return;
121 auto I = find(IDom->Children, this)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTree.h | 62 DomTreeNodeBase *IDom;
69 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom)
70 : TheBB(BB), IDom(iDom), Level(IDom ? IDom->Level + 1 : 0) {}
82 DomTreeNodeBase *getIDom() const { return IDom; }
118 assert(IDom && "No immediate dominator?");
119 if (IDom == NewIDom) return;
121 auto I = find(IDom->Children, this)
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_cfg.cpp | 54 cfg(cfg), idom(NULL), start_ip(0), end_ip(0), num(0), cycle_count(0)
424 if (block->idom)
425 fprintf(stderr, "START B%d IDOM(B%d)", block->num, block->idom->num);
427 fprintf(stderr, "START B%d IDOM(none)", block->num);
457 block->idom = NULL;
459 blocks[0]->idom = blocks[0];
471 if (parent->block->idom) {
474 } else if (parent->block->idom != NULL) {
480 if (block->idom != new_idom)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| Dominators.h | 66 DomTreeNodeBase<NodeT> *IDom;
83 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
88 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
89 : TheBB(BB), IDom(iDom), DFSNumIn(-1), DFSNumOut(-1) { }
123 assert(IDom && "No immediate dominator?");
124 if (IDom != NewIDom) {
126 std::find(IDom->Children.begin(), IDom->Children.end(), this);
127 assert(I != IDom->Children.end() &
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
160 Info->IDom = PseudoEntry;
206 Blk1 = Blk1->IDom;
211 Blk2 = Blk2->IDom;
258 // Check if the IDom value has changed.
259 if (NewIDom && NewIDom != Info->IDom) {
260 Info->IDom = NewIDom;
267 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
271 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 41 BBInfo *IDom; // Immediate dominator.
47 : BB(ThisBB), AvailableVal(V), DefBB(V ? this : 0), BlkNum(0), IDom(0),
149 Info->IDom = PseudoEntry;
195 Blk1 = Blk1->IDom;
200 Blk2 = Blk2->IDom;
247 // Check if the IDom value has changed.
248 if (NewIDom && NewIDom != Info->IDom) {
249 Info->IDom = NewIDom;
256 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
260 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 102 DomTreeNodeBase<NodeT> *IDom;
108 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
109 : TheBB(BB), IDom(iDom) {}
121 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
156 assert(IDom && "No immediate dominator?");
157 if (IDom != NewIDom) {
159 find(IDom->Children, this);
160 assert(I != IDom->Children.end() &&
163 IDom->Children.erase(I)
[all...] |
