| /external/chromium_org/v8/src/ |
| hydrogen-redundant-phi.cc | 11 // Gather all phis from all blocks first.
16 for (int j = 0; j < block->phis()->length(); j++) {
17 all_phis.Add(block->phis()->at(j), zone());
21 // Iteratively reduce all phis in the list.
25 // Make sure that we *really* removed all redundant phis.
27 for (int j = 0; j < blocks->at(i)->phis()->length(); j++) {
28 DCHECK(blocks->at(i)->phis()->at(j)->GetRedundantReplacement() == NULL);
36 ProcessPhis(block->phis());
40 void HRedundantPhiEliminationPhase::ProcessPhis(const ZoneList<HPhi*>* phis) {
43 // Iterately replace all redundant phis in the given list
[all...] |
| hydrogen-infer-types.cc | 14 const ZoneList<HPhi*>* phis = block->phis(); local
15 for (int j = 0; j < phis->length(); j++) {
16 phis->at(j)->UpdateInferredType();
29 // Update phis of the loop header now after the whole loop body is
31 for (int j = 0; j < block->phis()->length(); ++j) {
32 HPhi* phi = block->phis()->at(j);
|
| hydrogen-redundant-phi.h | 14 // Replace all phis consisting of a single non-loop operand plus any number of
25 void ProcessPhis(const ZoneList<HPhi*>* phis);
|
| hydrogen-infer-representation.cc | 21 // bit-vector of length <number of phis>.
32 // (2) Do a fixed point iteration to find the set of connected phis. A
53 // Set truncation flags for groups of connected phis. This is a conservative
61 // Check if all uses of all connected phis in this group are truncating.
76 // Clear truncation flag of this group of connected phis.
85 // Clear truncation flag of this group of connected phis.
97 // This step uses kTruncatingToInt32 flags of phis.
103 // sum up the non-phi use counts of all connected phis.
118 const ZoneList<HPhi*>* phis = block->phis(); local
140 const ZoneList<HPhi*>* phis = block->phis(); local
[all...] |
| hydrogen-uint32-analysis.cc | 76 // Encountered phis are optimistically treated as safe uint32 uses,
79 // phis that are not actually uint32-safe (it requires fix point iteration).
92 // Optimistically treat phis as uint32 safe.
162 // No phis were collected. Nothing to do.
165 // Worklist used to transitively clear kUint32 from phis that
166 // are used as arguments to other phis.
173 // Iterate over collected phis and unmark those that
176 // Phis that are still marked as safe are shifted down
177 // so that all safe phis form a prefix of the phis_ array.
189 // Now phis array contains only those phis that have saf
[all...] |
| hydrogen-dce.cc | 56 for (int j = 0; j < block->phis()->length(); j++) {
57 HPhi* phi = block->phis()->at(j);
82 // Collect phis that are dead and remove them in the next pass.
83 for (int j = 0; j < block->phis()->length(); j++) {
84 HPhi* phi = block->phis()->at(j);
93 // Process phis separately to avoid simultaneously mutating the phi list.
|
| hydrogen-osr.cc | 93 const ZoneList<HPhi*>* phis = osr_loop_entry_->phis(); local
94 for (int j = 0; j < phis->length(); j++) {
95 HPhi* phi = phis->at(j);
|
| hydrogen-representation-changes.cc | 109 // Compute truncation flag for phis: Initially assume that all
110 // int32-phis allow truncation and iteratively remove the ones that
189 const ZoneList<HPhi*>* phis = block->phis(); local
190 for (int j = 0; j < phis->length(); j++) {
191 InsertRepresentationChangesForValue(phis->at(j));
|
| hydrogen-mark-deoptimize.h | 14 // Compute DeoptimizeOnUndefined flag for phis. Any phi that can reach a use
|
| hydrogen-osr.h | 34 // Process the OSR values and phis after initial graph optimization.
|
| /art/compiler/optimizing/ |
| ssa_phi_elimination.h | 25 * Optimization phase that removes dead phis from the graph. Dead phis are unused
26 * phis, or phis only used by other phis.
45 * Removes redundant phis that may have been introduced when doing SSA conversion.
46 * For example, when entering a loop, we create phis for all live registers. These
|
| ssa_phi_elimination.cc | 22 // Add to the worklist phis referenced by non-phi instructions.
56 // Remove phis that are not live. Visit in post order to ensure
57 // we only remove phis with no users (dead phis might use dead phis).
73 // Add all phis in the worklist.
111 // phis candidate for elimination if this phi is in a loop. Add phis that
|
| ssa_builder.cc | 27 // block. For loops, we create phis whose inputs will be set in 2).
32 // 2) Set inputs of loop phis.
44 // 3) Propagate types of phis.
69 // because we are visiting in reverse post order. We create phis for all initialized
86 // We merge the values of all locals, creating phis if those values differ.
|
| ssa_type_propagation.h | 24 // Compute and propagate types of phis in the graph.
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-crbug-173907.js | 56 // All registers are blocked and phis for phi1 and phi2 are spilled because
58 // and phis themselves have only ANY-policy uses.
67 // Now swap values of phi1 and phi2 to create cycle between phis.
75 // a register beneficial policy. How? We just hide these uses behind phis.
|
| regress-crbug-173907b.js | 56 // All registers are blocked and phis for phi1 and phi2 are spilled because
58 // and phis themselves have only ANY-policy uses.
67 // Now swap values of phi1 and phi2 to create cycle between phis.
75 // a register beneficial policy. How? We just hide these uses behind phis.
|
| /external/llvm/lib/CodeGen/ |
| OptimizePHIs.cpp | 1 //===-- OptimizePHIs.cpp - Optimize machine instruction PHIs --------------===//
10 // This pass optimizes machine instruction PHIs to take advantage of
61 INITIALIZE_PASS(OptimizePHIs, "opt-phis",
62 "Optimize machine instruction PHIs", false, false)
83 /// are copies of SingleValReg, possibly via copies through other PHIs. If
85 /// non-copy value. PHIsInCycle is a set used to keep track of the PHIs that
131 /// other PHIs in a cycle.
|
| /external/llvm/test/Analysis/BasicAA/ |
| phi-and-select.ll | 3 ; BasicAA should detect NoAliases in PHIs and Selects.
15 ; Two PHIs in the same block.
44 ; Two PHIs with disjoint sets of inputs.
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| LivenessAnalyzer.java | 246 * Ensures that all the phi result registers for all the phis in the
248 * the dead code remover has allowed through "dead-end phis" whose
260 List<SsaInsn> phis = b.getPhiInsns(); local
262 int szPhis = phis.size();
270 interference.add(phis.get(i).getResult().getReg(),
271 phis.get(j).getResult().getReg());
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/back/ |
| LivenessAnalyzer.java | 247 * Ensures that all the phi result registers for all the phis in the
249 * the dead code remover has allowed through "dead-end phis" whose
261 List<SsaInsn> phis = b.getPhiInsns(); local
263 int szPhis = phis.size();
271 interference.add(phis.get(i).getResult().getReg(),
272 phis.get(j).getResult().getReg());
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| PhiTypeResolver.java | 35 * Phi operands may be themselves be the result of unresolved phis,
41 * circular-only phis that may have been inserted.
46 /** indexed by register; all registers still defined by unresolved phis */
90 * If the result type has changed, re-resolve all phis
|
| /external/chromium_org/v8/src/compiler/ |
| phi-reducer.h | 14 // Replaces redundant phis if all the inputs are the same or the phi itself.
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| PhiTypeResolver.java | 36 * Phi operands may be themselves be the result of unresolved phis,
42 * circular-only phis that may have been inserted.
47 /** indexed by register; all registers still defined by unresolved phis */
91 * If the result type has changed, re-resolve all phis
|
| /external/llvm/docs/HistoricalNotes/ |
| 2003-06-26-Reoptimizer2.txt | 30 It does copy insertions for PHIs, which it infers from the machine
32 the PHIs.
102 along with the PHIs that are inserted.
103 PHIs are followed by the copies that implement them.
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| 2011-11-17-selfphi.ll | 2 ; PR11350: Check that SimplifyIndvar handles a cycle of useless self-phis.
|
