| /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.
224 // NewBB is split and now it has one successor. Update dominator tree to
255 // 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 | 70 /// dominator tree DT is non-null, the translated value must dominate
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineDominators.h | 38 /// compute a normal dominator tree.
108 /// findNearestCommonDominator - Find nearest common dominator basic block
126 /// addNewBlock - Add a new node to the dominator tree information. This
127 /// creates a new node as a child of DomBB dominator node,linking it into
128 /// the children list of the immediate dominator.
134 /// changeImmediateDominator - This method is used to update the dominator
135 /// tree information when a node's immediate dominator changes.
147 /// eraseNode - Removes a node from the dominator tree. Block must not
148 /// dominate any other blocks. Removes node from its immediate dominator's
149 /// 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/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
|
| 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.
128 /// of the dominator tree.
260 // Perform a depth-first traversal of the dominator tree, splitting
492 /// of the dominator tree.
506 /// a depth-first traversal of the dominator tree. As we traverse down a branch
507 /// of the dominator tree, we keep track of the current dominating variable and
509 /// another branch of the dominator tree, the definition of the current dominating
[all...] |
| /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)
|
| /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
|
| Compiler.h | 168 kPostOrderDOMTraversal, // Dominator tree / Post-Order
|
| /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/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 41 BBInfo *IDom; // Immediate dominator.
189 /// finding dominators. Given two basic blocks, it walks up the dominator
190 /// tree until it finds a common dominator of both. It uses the postorder
208 /// FindDominators - Calculate the dominator tree for the subset of the CFG
213 /// blocks that define the value, the results are not the usual dominator
256 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
285 // 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
236 /// DomLevels - Maps DomTreeNodes to their level in the dominator tree.
483 // If we haven't computed dominator tree levels, do so now.
563 // unreachable basic blocks that were not processed by walking the dominator
750 // Use a priority queue keyed on dominator tree level so that inserted nodes
751 // are handled from the bottom of the dominator tree upwards.
771 // Walk all dominator tree children of Root, inspecting their CFG edges with
772 // targets elsewhere on the dominator tree. Only targets whose level is at
787 // Quickly skip all CFG edges that are also dominator tree edges instead
[all...] |
| /external/llvm/docs/ |
| WritingAnLLVMPass.html | 316 If a pass is an analysis pass, for example dominator tree pass, then true
431 0.0000 ( 0.0%) 0.0100 (100.0%) 0.0100 ( 50.0%) 0.0031 ( 6.4%) Dominator Set Construction
[all...] |
| Passes.html | 82 <tr><td><a href="#domtree">-domtree</a></td><td>Dominator Tree Construction</td></tr>
104 <tr><td><a href="#postdomtree">-postdomtree</a></td><td>Post-Dominator Tree Construction</td></tr>
110 <tr><td><a href="#print-dom-info">-print-dom-info</a></td><td>Dominator Info Printer</td></tr>
279 This pass is a simple dominator construction algorithm for finding forward
280 dominator frontiers.
286 <a name="domtree">-domtree: Dominator Tree Construction</a>
290 This pass is a simple dominator construction algorithm for finding forward
338 This pass, only available in <code>opt</code>, prints the dominator tree
350 This pass, only available in <code>opt</code>, prints the dominator tree
363 This pass, only available in <code>opt</code>, prints the post dominator tre
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| TailDuplication.cpp | 197 /// can find a predecessor of SrcBlock that is a dominator of both SrcBlock and
252 // See if we can avoid duplicating code by moving it up to a dominator of both
255 DEBUG(dbgs() << "Found shared dominator: " << DomBlock->getName() << "\n");
|
| /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);
|
| /external/v8/src/ |
| hydrogen.cc | 217 HBasicBlock* current = other->dominator();
220 current = current->dominator();
285 } else if (other->dominator() != NULL) {
291 first = first->dominator();
293 second = second->dominator();
471 // Check that entry block dominator is NULL.
472 ASSERT(entry_block_->dominator() == NULL);
477 if (block->dominator() == NULL) {
478 // Only start block may have no dominator assigned to.
481 // Assert that block is unreachable if dominator must not be visited
1217 HBasicBlock* dominator = back_edge; local
[all...] |
