HomeSort by relevance Sort by last modified time
    Searched full:dominator (Results 1 - 25 of 199) sorted by null

1 2 3 4 5 6 7 8

  /external/chromium_org/v8/src/
hydrogen-sce.cc 35 // For each loop block walk the dominator tree from the backwards branch to
43 HBasicBlock* dominator = back_edge; local
45 for (HInstructionIterator it(dominator); !it.Done(); it.Advance()) {
53 if (dominator == block) break;
55 // Move up the dominator tree.
56 dominator = dominator->dominator();
hydrogen-gvn.h 58 HBasicBlock* dominator,
79 // Used when collecting side effects on paths from dominator to
hydrogen-gvn.cc 620 HBasicBlock* dominator, HBasicBlock* dominated) {
624 if (dominator->block_id() < block->block_id() &&
633 dominator, block));
641 // traversal of the dominator tree done during GVN (the stack is handled
644 // of the dominator tree but this forces us to initialize each frame calling
661 HBasicBlock** dominator) {
664 *dominator = block();
671 *dominator = dominator_state->block();
675 *dominator = NULL;
709 // No need to copy the map for the last child in the dominator tree
    [all...]
hydrogen-bce.cc 34 // dominator tree.
36 // If in the dominator tree we check "exp + v1" and later (dominated)
107 // We scan the code with a dominator tree traversal.
108 // Traversing the dominator tree we keep a stack (implemented as a singly
112 // use it to "clean up" the dictionary when backtracking in the dominator tree
236 cursor = cursor->block()->dominator()->end();
  /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
  /external/clang/include/clang/Analysis/Analyses/
Dominators.h 59 /// \brief This method compares two dominator trees.
60 /// The method returns false if the other dominator tree matches this
61 /// dominator tree, otherwise returns true.
76 /// \brief This method builds the dominator tree for a given CFG
116 /// \brief This method finds the nearest common dominator CFG block
128 /// \brief This method is used to update the dominator
129 /// tree information when a node's immediate dominator changes.
142 /// \brief This method releases the memory held by the dominator tree.
148 /// \brief This method converts the dominator tree to human readable form.
  /external/llvm/include/llvm/CodeGen/
MachineDominators.h 38 /// compute a normal dominator tree.
111 /// findNearestCommonDominator - Find nearest common dominator basic block
129 /// addNewBlock - Add a new node to the dominator tree information. This
130 /// creates a new node as a child of DomBB dominator node,linking it into
131 /// the children list of the immediate dominator.
137 /// changeImmediateDominator - This method is used to update the dominator
138 /// tree information when a node's immediate dominator changes.
150 /// eraseNode - Removes a node from the dominator tree. Block must not
151 /// dominate any other blocks. Removes node from its immediate dominator's
152 /// children list. Deletes dominator node associated with basic block BB
    [all...]
MachinePostDominators.h 26 /// to compute the a post-dominator tree.
  /external/llvm/lib/Transforms/Scalar/
StructurizeCFG.cpp 50 /// @brief Find the nearest common dominator for multiple BasicBlocks
70 /// \brief Add BB to the resulting dominator
90 assert(Node && "Dominator tree invalid!");
209 BasicBlock *getNextFlow(BasicBlock *Dominator);
466 NearestCommonDominator Dominator(DT);
467 Dominator.addBlock(Parent, false);
478 Dominator.addBlock(PI->first);
484 if (!Dominator.wasResultExplicitMentioned())
485 PhiInserter.AddAvailableValue(Dominator.getResult(), Default);
541 NearestCommonDominator Dominator(DT)
    [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 49 /** {@code >= 0 after run();} the index of the immediate dominator */
143 * 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/CodeGen/
MachinePostDominators.cpp 1 //===- MachinePostDominators.cpp -Machine Post Dominator Calculation ------===//
10 // This file implements simple dominator construction algorithms for finding
MachineDominators.cpp 1 //===- MachineDominators.cpp - Machine Dominator Calculation --------------===//
10 // This file implements simple dominator construction algorithms for finding
LiveRangeCalc.cpp 141 assert(DomTree && "Missing dominator tree");
167 assert(DomTree && "Missing dominator tree");
283 // except we already have a dominator tree, so we don't have to recompute it.
286 assert(DomTree && "Missing dominator tree");
292 // Propagate live-out values down the dominator tree, inserting phi-defs
304 // We need a live-in value to a block with no immediate dominator?
309 // immediate dominator. Check if any of them have live-out values that are
  /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";
  /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 */
  /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/test/Transforms/Sink/
basic.ll 40 ; Sink to the nearest post-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/IR/
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)"));
69 "Dominator Tree Construction", true, true)
270 // If the def and use are in different blocks, do a simple CFG dominator

Completed in 1422 milliseconds

1 2 3 4 5 6 7 8