OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:DomTree
(Results
1 - 9
of
9
) sorted by null
/external/llvm/lib/CodeGen/
LiveRangeCalc.cpp
28
DomTree
= MDT;
124
// Defer the
Domtree
lookup until it is needed.
141
assert(
DomTree
&& "Missing dominator tree");
167
assert(
DomTree
&& "Missing dominator tree");
273
addLiveInBlock(LI,
DomTree
->getNode(MBB));
286
assert(
DomTree
&& "Missing dominator tree");
314
// Cache the
DomTree
node that defined the value.
317
DomTree
->getNode(Indexes->getMBBFromIndex(IDomValue.first->def));
325
// Cache the
DomTree
node that defined the value.
328
DomTree
->getNode(Indexes->getMBBFromIndex(Value.first->def))
[
all
...]
LiveRangeCalc.h
40
MachineDominatorTree *
DomTree
;
49
/// LiveOutPair - A value and the block that defined it. The
domtree
node is
69
/// The
domtree
node may be null, it can be computed.
130
LiveRangeCalc() : MF(0), MRI(0), Indexes(0),
DomTree
(0), Alloc(0) {}
220
/// @param DomNode The
domtree
node for the block.
EarlyIfConversion.cpp
584
MachineDominatorTree *
DomTree
;
633
MachineDomTreeNode *HeadNode =
DomTree
->getNode(IfConv.Head);
635
MachineDomTreeNode *Node =
DomTree
->getNode(Removed[i]);
639
DomTree
->changeImmediateDominator(Node->getChildren().back(), HeadNode);
641
DomTree
->eraseNode(Removed[i]);
783
DomTree
= &getAnalysis<MachineDominatorTree>();
796
I = po_begin(
DomTree
), E = po_end(
DomTree
); I != E; ++I)
LiveIntervalAnalysis.cpp
72
DomTree
(0), LRCalc(0) {
107
DomTree
= &getAnalysis<MachineDominatorTree>();
168
LRCalc->reset(MF, getSlotIndexes(),
DomTree
, &getVNInfoAllocator());
224
LRCalc->reset(MF, getSlotIndexes(),
DomTree
, &getVNInfoAllocator());
437
LRCalc->reset(MF, getSlotIndexes(),
DomTree
, &getVNInfoAllocator());
[
all
...]
RegAllocGreedy.cpp
74
MachineDominatorTree *
DomTree
;
[
all
...]
/external/llvm/include/llvm/Analysis/
LoopInfoImpl.h
367
DominatorTreeBase<BlockT> &
DomTree
) {
381
if (!
DomTree
.isReachableFromEntry(PredBB))
519
Analyze(DominatorTreeBase<BlockT> &
DomTree
) {
522
DomTreeNodeBase<BlockT>* DomRoot =
DomTree
.getRootNode();
538
if (
DomTree
.dominates(Header, Backedge)
539
&&
DomTree
.isReachableFromEntry(Backedge)) {
546
discoverAndMapSubloop(L, ArrayRef<BlockT*>(Backedges), this,
DomTree
);
LoopInfo.h
546
void Analyze(DominatorTreeBase<BlockT> &
DomTree
);
/external/llvm/include/llvm/CodeGen/
LiveIntervalAnalysis.h
57
MachineDominatorTree *
DomTree
;
/external/llvm/lib/Target/R600/
AMDGPUStructurizeCFG.cpp
71
NearestCommonDominator(DominatorTree *
DomTree
) {
72
DT =
DomTree
;
Completed in 809 milliseconds