| /external/llvm/lib/CodeGen/ |
| 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
|
| LiveRangeCalc.h | 17 // propagate values down the dominator tree, and even insert PHI-defs where
82 // DomNode - Dominator tree node for the block.
|
| SplitKit.cpp | 710 // Least busy dominator seen so far.
719 // Leave loop by going to the immediate dominator of the loop header.
720 // This is a bigger stride than simply walking up the dominator tree.
723 // Too far up the dominator tree?
736 // Track the nearest common dominator for all back-copies for each ParentVNI,
741 // Find the nearest common dominator for parent values with multiple
789 // None dominate. Hoist to common dominator, need new def.
807 // Get a less loopy dominator than Dom.first.
[all...] |
| UnreachableBlockElim.cpp | 147 // Update dominator and loop info.
|
| /external/llvm/tools/opt/ |
| GraphPrinters.cpp | 47 DIP("print-dom-info", "Dominator Info Printer", true, true);
|
| /external/llvm/include/llvm/Analysis/ |
| 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
|
| /art/compiler/dex/ |
| ssa_transformation.cc | 281 /* Set all bits in the dominator vector */
306 /* Worker function to compute each block's immediate dominator */
368 /* Add bb to the i_dominated set of the immediate dominator block */
374 /* Compute dominators, immediate dominator, and dominance fronter */
405 /* Set the dominator for the root node */
679 /* Compute the dominator info */
|
| /external/chromium_org/v8/src/ |
| hydrogen-instructions.cc | [all...] |
| /external/llvm/docs/ |
| Passes.rst | 105 This pass is a simple dominator construction algorithm for finding forward
106 dominator frontiers.
108 ``-domtree``: Dominator Tree Construction
111 This pass is a simple dominator construction algorithm for finding forward
140 This pass, only available in ``opt``, prints the dominator tree into a ``.dot``
147 This pass, only available in ``opt``, prints the dominator tree into a ``.dot``
154 This pass, only available in ``opt``, prints the post dominator tree into a
161 This pass, only available in ``opt``, prints the post dominator tree into a
273 This pass is a simple post-dominator construction algorithm for finding
274 post-dominator frontiers
[all...] |
| WritingAnLLVMPass.rst | 179 an analysis pass, for example dominator tree pass, then ``true`` is supplied as
287 0.0000 ( 0.0%) 0.0100 (100.0%) 0.0100 ( 50.0%) 0.0031 ( 6.4%) Dominator Set Construction
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 12 // transformed by using iterated dominator frontiers to place PHI nodes, then
319 /// Maps DomTreeNodes to their level in the dominator tree.
644 // If we haven't computed dominator tree levels, do so now.
724 // unreachable basic blocks that were not processed by walking the dominator
[all...] |
| BreakCriticalEdges.cpp | 14 // dominator trees.
250 // The new block is not the immediate dominator for any other nodes, but
251 // TINode is the immediate dominator for the new node.
|
| LoopSimplify.cpp | 36 // dominator information.
292 // to preserve dominator information.
333 // update the dominator tree and delete it.
759 // Update dominator information
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 175 /// Assuming that this is a dominator of TBI, determine if it contains
177 /// trace head, and any dependencies from such a far away dominator are not
190 // flow, a dominator may share a trace head without actually being on the
|
| /art/compiler/sea_ir/ir/ |
| sea.h | 246 // Immediate dominator node.
273 // Returns the "lowest common ancestor" of @i and @j in the dominator tree.
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 59 /// In this formation, we don't require a dominator tree. The given basic
|
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 120 // The CodeExtractor needs a dominator tree.
|
| /external/v8/src/ |
| profile-generator.cc | [all...] |
| /dalvik/vm/compiler/ |
| Compiler.h | 175 kPostOrderDOMTraversal, // Dominator tree / Post-Order
|
| CompilerIR.h | 168 struct BasicBlock *iDom; // Immediate dominator
|
| /external/llvm/include/llvm/ADT/ |
| ScopedHashTable.h | 11 // things like dominator-based optimizations. This allows clients to do things
|
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| timevar.def | 141 DEFTIMEVAR (TV_TREE_SSA_DOMINATOR_OPTS , "dominator optimization")
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| timevar.def | 141 DEFTIMEVAR (TV_TREE_SSA_DOMINATOR_OPTS , "dominator optimization")
|
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| timevar.def | 141 DEFTIMEVAR (TV_TREE_SSA_DOMINATOR_OPTS , "dominator optimization")
|
