| /dalvik/dx/src/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/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...] |
| DominatorInternals.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
|
| /external/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...] |
| /dalvik/vm/compiler/ |
| SSATransformation.cpp | 153 if (succBB->iDom != domBB &&
264 /* Worker function to compute the idom */
270 BasicBlock *iDom;
281 iDom = (BasicBlock *) dvmGrowableListGetElement(
283 bb->iDom = iDom;
292 /* iDom dominates nextDom - set new iDom */
298 iDom = (BasicBlock *) dvmGrowableListGetElement(blockList, iDomIdx);
300 bb->iDom = iDom
[all...] |
| CompilerIR.h | 165 struct BasicBlock *iDom; // Immediate dominator
|
| Loop.cpp | 584 if (bodyBB->fallThrough->iDom == bodyBB) {
595 if (bodyBB->taken->iDom == bodyBB) {
|
| Frontend.cpp | 794 if (bb->iDom) {
795 dvmGetBlockName(bb->iDom, blockName2);
[all...] |
| /external/llvm/lib/CodeGen/ |
| SplitKit.cpp | 511 MachineDomTreeNode *IDom = Node->getIDom();
516 bool needPHI = !IDom || !LiveOutSeen.test(IDom->getBlock()->getNumber());
518 // IDom dominates all of our predecessors, but it may not be their
520 // properly dominated by IDom. If so, we need a phi-def here.
522 IDomValue = LiveOutCache[IDom->getBlock()];
531 if (MDT.dominates(IDom, Value.second)) {
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | [all...] |
