HomeSort by relevance Sort by last modified time
    Searched refs:IDom (Results 1 - 4 of 4) sorted by null

  /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...]
  /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...]
  /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...]

Completed in 89 milliseconds