HomeSort by relevance Sort by last modified time
    Searched full:idom (Results 1 - 25 of 29) sorted by null

1 2

  /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 65 DomTreeNodeBase<NodeT> *IDom;
82 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
87 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
88 : TheBB(BB), IDom(iDom), DFSNumIn(-1), DFSNumOut(-1) { }
122 assert(IDom && "No immediate dominator?");
123 if (IDom != NewIDom) {
125 std::find(IDom->Children.begin(), IDom->Children.end(), this);
126 assert(I != IDom->Children.end() &
    [all...]
GenericDomTreeConstruction.h 219 // If V is a non-root vertex and sdom(V) = parent(V), then idom(V) is
220 // necessarily parent(V). In this case, set idom(V) here and avoid placing
279 // Free temporary memory used to construct idom's
  /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;
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
DomFront.java 54 public int idom = -1; field in class:DomFront.DomInfo
95 System.out.println("idom[" + i + "]: "
96 + info.idom);
157 if (info.idom == -1) continue;
159 SsaBasicBlock domParent = nodes.get(info.idom);
182 runnerIndex != nbInfo.idom; /* empty */) {
198 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;
  /external/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 51 BBInfo *IDom; // Immediate dominator.
58 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...]
  /external/llvm/lib/CodeGen/
LiveRangeCalc.cpp 295 MachineDomTreeNode *IDom = Node->getIDom();
300 bool needPHI = !IDom || !Seen.test(IDom->getBlock()->getNumber());
302 // IDom dominates all of our predecessors, but it may not be their
304 // properly dominated by IDom. If so, we need a phi-def here.
306 IDomValue = LiveOut[IDom->getBlock()];
310 LiveOut[IDom->getBlock()].second = IDomValue.second =
327 if (DomTree->dominates(IDom, Value.second)) {
SplitKit.cpp 721 MachineDomTreeNode *IDom = MDT[Loop->getHeader()]->getIDom();
724 if (!IDom || !MDT.dominates(DefDomNode, IDom))
727 MBB = IDom->getBlock();
    [all...]
  /art/compiler/dex/
ssa_transformation.cc 323 int idom = -1; local
328 idom = pred_bb->dfs_id;
342 idom = FindCommonParent(pred_bb->dfs_id, idom);
346 DCHECK_NE(idom, NOTVISITED);
349 if (i_dom_list_[bb->dfs_id] != idom) {
350 i_dom_list_[bb->dfs_id] = idom;
  /external/llvm/lib/Target/R600/
SIAnnotateControlFlow.cpp 169 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
171 if (Phi->getIncomingBlock(i) == IDom) {
226 BasicBlock *IDom = DT->getNode(Parent)->getIDom()->getBlock();
235 if (From == IDom) {
  /art/compiler/sea_ir/ir/
sea.cc 77 // Entry node has itself as IDOM.
104 // For all other predecessors p of b, if idom is not set,
127 Region* idom = (*region_it)->GetIDominator(); local
128 if (idom != *region_it) {
129 idom->AddToIDominatedSet(*region_it);
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_print.cpp 598 if (bb->idom())
599 INFO("idom = BB:%i, ", bb->idom()->getId());
nv50_ir_ssa.cpp 201 if (dfLocal->idom() != bb)
211 if (dfUp->idom() != bb)
nv50_ir_bb.cpp 111 BasicBlock::idom() const function in class:nv50_ir::BasicBlock
nv50_ir.h 889 BasicBlock *idom() const;
  /external/mesa3d/src/gallium/drivers/nv50/codegen/
nv50_ir_print.cpp 598 if (bb->idom())
599 INFO("idom = BB:%i, ", bb->idom()->getId());
nv50_ir_ssa.cpp 201 if (dfLocal->idom() != bb)
211 if (dfUp->idom() != bb)
nv50_ir_bb.cpp 111 BasicBlock::idom() const function in class:nv50_ir::BasicBlock