OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:IDom
(Results
1 - 7
of
7
) sorted by null
/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
388
MachineDomTreeNode *
IDom
= Node->getIDom();
393
bool needPHI = !
IDom
|| !Seen.test(
IDom
->getBlock()->getNumber());
395
//
IDom
dominates all of our predecessors, but it may not be their
397
// properly dominated by
IDom
. If so, we need a phi-def here.
399
IDomValue = Map[
IDom
->getBlock()];
403
Map[
IDom
->getBlock()].second = IDomValue.second =
420
if (DomTree->dominates(
IDom
, Value.second)) {
ShrinkWrap.cpp
260
MachineBasicBlock *
IDom
= &Block;
262
IDom
= Dom.findNearestCommonDominator(
IDom
, BB);
263
if (!
IDom
)
266
return
IDom
;
355
MachineBasicBlock *
IDom
= FindIDom<>(*Save, Save->predecessors(), *MDT);
356
if (
IDom
!= Save)
357
Save =
IDom
;
SplitKit.cpp
708
MachineDomTreeNode *
IDom
= MDT[Loop->getHeader()]->getIDom();
711
if (!
IDom
|| !MDT.dominates(DefDomNode,
IDom
))
714
MBB =
IDom
->getBlock();
[
all
...]
/external/llvm/lib/Target/AMDGPU/
SIAnnotateControlFlow.cpp
173
BasicBlock *
IDom
= DT->getNode(Phi->getParent())->getIDom()->getBlock();
175
if (Phi->getIncomingBlock(i) ==
IDom
) {
239
BasicBlock *
IDom
= DT->getNode(Parent)->getIDom()->getBlock();
248
if (From ==
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
...]
/external/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp
[
all
...]
Completed in 70 milliseconds