OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:dominator
(Results
1 - 25
of
176
) sorted by null
1
2
3
4
5
6
7
8
/external/llvm/include/llvm/Analysis/
Dominators.h
1
//===- llvm/Analysis/Dominators.h -
Dominator
Info Calculation --*- C++ -*-===//
33
/// DominatorBase - Base class that other, more interesting
dominator
analyses
58
// DomTreeNode -
Dominator
Tree Node
123
assert(IDom && "No immediate
dominator
?");
128
"Not in immediate
dominator
children set!");
132
// Switch to new
dominator
179
/// DominatorTree - Calculate the immediate
dominator
tree for a function.
236
// NewBB is split and now it has one successor. Update
dominator
tree to
267
// Find NewBB's immediate
dominator
and create new
dominator
tree node fo
[
all
...]
PostDominators.h
1
//=- llvm/Analysis/PostDominators.h - Post
Dominator
Calculation-*- C++ -*-===//
22
/// compute the a post-
dominator
tree.
DominatorInternals.h
1
//=== llvm/Analysis/DominatorInternals.h -
Dominator
Calculation -*- C++ -*-==//
18
// DominatorTree construction - This pass constructs immediate
dominator
196
// Step #2: Implicitly define the immediate
dominator
of vertices
205
// initialize the semi
dominator
to point to the parent node
238
// Step #4: Explicitly define the immediate
dominator
of each vertex
268
// Get or calculate the node for the immediate
dominator
DominanceFrontier.h
1
//===- llvm/Analysis/DominanceFrontier.h -
Dominator
Frontiers --*- C++ -*-===//
154
/// used to compute a forward
dominator
frontiers.
PHITransAddr.h
74
///
dominator
tree DT is non-null, the translated value must dominate
/external/clang/include/clang/Analysis/Analyses/
Dominators.h
60
/// \brief This method compares two
dominator
trees.
61
/// The method returns false if the other
dominator
tree matches this
62
///
dominator
tree, otherwise returns true.
77
/// \brief This method builds the
dominator
tree for a given CFG
117
/// \brief This method finds the nearest common
dominator
CFG block
129
/// \brief This method is used to update the
dominator
130
/// tree information when a node's immediate
dominator
changes.
143
/// \brief This method releases the memory held by the
dominator
tree.
149
/// \brief This method converts the
dominator
tree to human readable form.
/external/llvm/include/llvm/CodeGen/
MachineDominators.h
38
/// compute a normal
dominator
tree.
109
/// findNearestCommonDominator - Find nearest common
dominator
basic block
127
/// addNewBlock - Add a new node to the
dominator
tree information. This
128
/// creates a new node as a child of DomBB
dominator
node,linking it into
129
/// the children list of the immediate
dominator
.
135
/// changeImmediateDominator - This method is used to update the
dominator
136
/// tree information when a node's immediate
dominator
changes.
148
/// eraseNode - Removes a node from the
dominator
tree. Block must not
149
/// dominate any other blocks. Removes node from its immediate
dominator
's
150
/// children list. Deletes
dominator
node associated with basic block BB
[
all
...]
/dalvik/dx/src/com/android/dx/ssa/
Dominators.java
24
* This class computes
dominator
and post-
dominator
information using the
58
/** {@code non-null;} the raw
dominator
info */
65
* @param domInfos {@code non-null;} the raw
dominator
info
83
* @param domInfos {@code non-null;} the raw
dominator
info
165
* Performs
dominator
/post-
dominator
calculation for the control
239
// Now explicitly define the immediate
dominator
of each vertex
DomFront.java
53
/** {@code >= 0 after run();} the index of the immediate
dominator
*/
147
* The dominators algorithm leaves us knowing who the immediate
dominator
/external/dexmaker/src/dx/java/com/android/dx/ssa/
Dominators.java
24
* This class computes
dominator
and post-
dominator
information using the
58
/** {@code non-null;} the raw
dominator
info */
65
* @param domInfos {@code non-null;} the raw
dominator
info
83
* @param domInfos {@code non-null;} the raw
dominator
info
165
* Performs
dominator
/post-
dominator
calculation for the control
239
// Now explicitly define the immediate
dominator
of each vertex
DomFront.java
53
/** {@code >= 0 after run();} the index of the immediate
dominator
*/
147
* The dominators algorithm leaves us knowing who the immediate
dominator
/external/llvm/lib/Analysis/
PostDominators.cpp
1
//===- PostDominators.cpp - Post-
Dominator
Calculation --------------------===//
10
// This file implements the post-
dominator
construction algorithms.
32
"Post-
Dominator
Tree Construction", true, true)
DomPrinter.cpp
58
return "
Dominator
tree";
74
return "Post
dominator
tree";
/external/llvm/lib/CodeGen/
MachineDominators.cpp
1
//===- MachineDominators.cpp - Machine
Dominator
Calculation --------------===//
10
// This file implements simple
dominator
construction algorithms for finding
LiveRangeCalc.cpp
65
assert(DomTree && "Missing
dominator
tree");
95
assert(DomTree && "Missing
dominator
tree");
170
// except we already have a
dominator
tree, so we don't have to recompute it.
175
assert(DomTree && "Missing
dominator
tree");
181
// Propagate live-out values down the
dominator
tree, inserting phi-defs
193
// We need a live-in value to a block with no immediate
dominator
?
198
// immediate
dominator
. Check if any of them have live-out values that are
StrongPHIElimination.cpp
26
// by directly using the
dominator
tree, rather than actually constructing the
35
// Careful implementation allows for all of the
dominator
forest interference
37
//
dominator
tree, which is what is implemented here.
129
/// of the
dominator
tree.
260
// Perform a depth-first traversal of the
dominator
tree, splitting
490
/// of the
dominator
tree.
504
/// a depth-first traversal of the
dominator
tree. As we traverse down a branch
505
/// of the
dominator
tree, we keep track of the current dominating variable and
507
/// another branch of the
dominator
tree, the definition of the current dominating
/dalvik/vm/compiler/
SSATransformation.cpp
224
/* Set all bits in the
dominator
vector */
239
* The
dominator
of the entry block has been preset to itself and we need
299
/* Set the immediate
dominator
block for bb */
302
/* Add bb to the iDominated set of the immediate
dominator
block */
307
/* Compute dominators, immediate
dominator
, and dominance fronter */
318
/* Set the
dominator
for the root node */
562
/* Compute the
dominator
info */
598
/* Compute the
dominator
info */
608
/* Re-compute the
dominator
info just for the loop */
CompilerIR.h
165
struct BasicBlock *iDom; // Immediate
dominator
/external/llvm/docs/HistoricalNotes/
2000-12-06-MeetingSummary.txt
38
1. Including
dominator
information in the LLVM bytecode
41
idea, we could include an immediate
dominator
number for each basic block
/external/llvm/lib/VMCore/
Dominators.cpp
1
//===- Dominators.cpp -
Dominator
Calculation -----------------------------===//
10
// This file implements simple
dominator
construction algorithms for finding
40
cl::desc("Verify
dominator
info (time consuming)"));
56
"
Dominator
Tree Construction", true, true)
234
// If the def and use are in different blocks, do a simple CFG
dominator
/external/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h
49
BBInfo *IDom; // Immediate
dominator
.
197
/// finding dominators. Given two basic blocks, it walks up the
dominator
198
/// tree until it finds a common
dominator
of both. It uses the postorder
216
/// FindDominators - Calculate the
dominator
tree for the subset of the CFG
221
/// blocks that define the value, the results are not the usual
dominator
264
/// IsDefInDomFrontier - Search up the
dominator
tree from Pred to IDom for
293
// Default to use the same def as the immediate
dominator
.
/external/llvm/lib/Transforms/Utils/
PromoteMemoryToRegister.cpp
12
// transformed by using iterated
dominator
frontiers to place PHI nodes, then
242
/// DomLevels - Maps DomTreeNodes to their level in the
dominator
tree.
490
// If we haven't computed
dominator
tree levels, do so now.
570
// unreachable basic blocks that were not processed by walking the
dominator
757
// Use a priority queue keyed on
dominator
tree level so that inserted nodes
758
// are handled from the bottom of the
dominator
tree upwards.
778
// Walk all
dominator
tree children of Root, inspecting their CFG edges with
779
// targets elsewhere on the
dominator
tree. Only targets whose level is at
794
// Quickly skip all CFG edges that are also
dominator
tree edges instead
[
all
...]
/external/llvm/docs/
WritingAnLLVMPass.html
333
is an analysis pass, for example
dominator
tree pass, then <tt>true</tt> is
451
0.0000 ( 0.0%) 0.0100 (100.0%) 0.0100 ( 50.0%) 0.0031 ( 6.4%)
Dominator
Set Construction
[
all
...]
/external/llvm/lib/Transforms/IPO/
PartialInlining.cpp
120
// The CodeExtractor needs a
dominator
tree.
/external/llvm/tools/opt/
GraphPrinters.cpp
118
DIP("print-dom-info", "
Dominator
Info Printer", true, true);
Completed in 870 milliseconds
1
2
3
4
5
6
7
8