| /external/v8/src/crankshaft/ |
| hydrogen-infer-types.cc | 32 HPhi* phi = block->phis()->at(j); local
33 worklist_.Add(phi, zone());
34 in_worklist_.Add(phi->id());
|
| hydrogen-mark-deoptimize.cc | 13 HPhi* phi = phi_list->at(i); local
14 if (phi->CheckFlag(HValue::kAllowUndefinedAsNaN) &&
15 !phi->CheckUsesForFlag(HValue::kAllowUndefinedAsNaN)) {
16 ProcessPhi(phi);
22 void HMarkDeoptimizeOnUndefinedPhase::ProcessPhi(HPhi* phi) {
23 DCHECK(phi->CheckFlag(HValue::kAllowUndefinedAsNaN));
26 // Push the phi onto the worklist
27 phi->ClearFlag(HValue::kAllowUndefinedAsNaN);
28 worklist_.Add(phi, zone());
30 // Process all phis that can reach this phi
[all...] |
| hydrogen-redundant-phi.cc | 5 #include "src/crankshaft/hydrogen-redundant-phi.h"
46 HPhi* phi = phis->at(i); local
47 if (phi->CheckFlag(HValue::kIsDead)) continue; // Already replaced.
49 HValue* replacement = phi->GetRedundantReplacement();
51 phi->SetFlag(HValue::kIsDead);
52 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) {
55 // Iterate again if used in another non-dead phi.
58 phi->block()->RemovePhi(phi);
|
| hydrogen-dce.cc | 57 HPhi* phi = block->phis()->at(j); local
58 if (phi->CannotBeEliminated()) MarkLive(phi, &worklist);
84 HPhi* phi = block->phis()->at(j); local
85 if (!phi->CheckFlag(HValue::kIsLive)) {
86 worklist.Add(phi, zone());
88 phi->ClearFlag(HValue::kIsLive);
93 // Process phis separately to avoid simultaneously mutating the phi list.
95 HPhi* phi = worklist.RemoveLast(); local
96 HBasicBlock* block = phi->block()
[all...] |
| hydrogen-infer-representation.cc | 20 // (1) Initialize bit vectors and count real uses. Each phi gets a
33 // phi is connected to another phi if its value is used either directly or
41 HPhi* phi = phi_list->at(i); local
42 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) {
96 // Simplify constant phi inputs where possible.
102 // Use the phi reachability information from step 2 to
103 // sum up the non-phi use counts of all connected phis.
105 HPhi* phi = phi_list->at(i); local
111 if (index != i) phi->AddNonPhiUsesFrom(it_use); // Don't count twice
142 HPhi* phi = phis->at(j); local
[all...] |
| hydrogen-osr.cc | 96 HPhi* phi = phis->at(j); local
97 if (phi->HasMergedIndex()) {
98 osr_values_->at(phi->merged_index())->set_incoming_value(phi);
|
| hydrogen-uint32-analysis.cc | 83 // There is a phi use of this value from a phi that is not yet
101 // There is a phi use of this value from a phi that is not yet
114 // Check if all operands to the given phi are marked with kUint32 flag.
115 bool HUint32AnalysisPhase::CheckPhiOperands(HPhi* phi) {
116 if (!phi->CheckFlag(HInstruction::kUint32)) {
117 // This phi is not uint32 safe. No need to check operands.
121 for (int j = 0; j < phi->OperandCount(); j++) {
122 HValue* operand = phi->OperandAt(j)
176 HPhi* phi = phis_[i]; local
191 HPhi* phi = worklist.RemoveLast(); local
200 HPhi* phi = phis_[i]; local
[all...] |
| hydrogen-representation-changes.cc | 12 // Insert the representation change right before its use. For phi-uses we
128 HPhi* phi = phi_list->at(i); local
129 if (phi->representation().IsInteger32()) {
130 phi->SetFlag(HValue::kTruncatingToInt32);
131 } else if (phi->representation().IsSmi()) {
132 phi->SetFlag(HValue::kTruncatingToSmi);
133 phi->SetFlag(HValue::kTruncatingToInt32);
138 HPhi* phi = phi_list->at(i); local
140 if (phi->representation().IsSmiOrInteger32() &&
141 !phi->CheckUsesForFlag(HValue::kTruncatingToInt32, &value))
[all...] |
| /art/compiler/optimizing/ |
| live_ranges_test.cc | 150 * 22: phi
174 // Last use is the phi at the return block so instruction is live until
190 // Last use is the phi at the return block.
194 // Test for the phi.
220 * 14: phi
253 // Last use is the loop phi so instruction is live until
274 // Test for the phi.
298 * 10: phi
309 * We want to make sure the phi at 10 has a lifetime hole after the add at 20.
333 // Last use is the loop phi so instruction is live unti
339 HPhi* phi = liveness.GetInstructionFromSsaIndex(1)->AsPhi(); local
443 HPhi* phi = liveness.GetInstructionFromSsaIndex(4)->AsPhi(); local
[all...] |
| ssa_phi_elimination.cc | 36 // Add to the worklist phis referenced by non-phi instructions.
40 HPhi* phi = inst_it.Current()->AsPhi(); local
41 if (phi->IsDead()) {
45 bool keep_alive = (graph_->IsDebuggable() && phi->HasEnvironmentUses());
47 for (const HUseListNode<HInstruction*>& use : phi->GetUses()) {
56 worklist_.push_back(phi);
58 phi->SetDead();
60 initially_live.insert(phi);
66 // Process the worklist by propagating liveness to phi inputs.
68 HPhi* phi = worklist_.back() local
91 HPhi* phi; local
138 HPhi* phi = worklist_.back(); local
[all...] |
| select_generator.cc | 54 // Returns nullptr if `block` has either no phis or there is more than one phi
55 // with different inputs at `index1` and `index2`. Otherwise returns that phi.
61 HPhi* phi = it.Current()->AsPhi(); local
62 if (phi->InputAt(index1) != phi->InputAt(index2)) {
64 // First phi with different inputs for the two indices found.
65 select_phi = phi;
112 HPhi* phi = GetSingleChangedPhi(merge_block, predecessor_index_true, predecessor_index_false); local
113 if (phi == nullptr) {
116 HInstruction* true_value = phi->InputAt(predecessor_index_true)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| HarmonicFunction.java | 23 /** Harmonic function of the form <code>f (t) = a cos (ω t + φ)</code>.
35 /** Phase φ. */
36 private final double phi; field in class:HarmonicFunction
41 * @param phi phase
43 public HarmonicFunction(double a, double omega, double phi) {
46 this.phi = phi;
51 return a * FastMath.cos(omega * x + phi);
56 return new HarmonicFunction(a * omega, omega, phi + FastMath.PI / 2);
73 /** Get the phase φ
[all...] |
| HarmonicFitter.java | 29 * the phase φ: <code>f (t) = a cos (ω t + φ)</code>. They are
40 /** Values for amplitude, pulsation ω and phase φ. */
56 * pulsation ω (index 1) and phase φ (index 2)
116 final double phi = parameters[2]; local
117 return a * FastMath.cos(omega * x + phi);
124 final double phi = parameters[2]; local
125 final double alpha = omega * x + phi;
|
| /external/libvncserver/test/ |
| copyrecttest.c | 22 double r,phi=0; local
38 phi=0;
41 phi+=0.02;
42 if(phi>2*M_PI)
43 phi-=2*M_PI;
45 x=width*(0.5+cos(phi)*r);
46 y=height*(0.5+sin(phi)*r);
48 unsigned int dx=width*0.5*(1-cos(phi)*r)-x,
49 dy=height*0.5*(1-sin(phi)*r)-y;
|
| /external/llvm/unittests/Transforms/Utils/ |
| Local.cpp | 29 PHINode *phi = builder.CreatePHI(Type::getInt32Ty(C), 2); local
35 phi->addIncoming(phi, bb0);
36 phi->addIncoming(phi, bb1);
38 // The PHI will be removed
39 EXPECT_TRUE(RecursivelyDeleteDeadPHINode(phi));
46 phi = builder.CreatePHI(Type::getInt32Ty(C), 0);
48 EXPECT_TRUE(RecursivelyDeleteDeadPHINode(phi));
51 phi = builder.CreatePHI(Type::getInt32Ty(C), 0)
[all...] |
| /external/v8/test/unittests/compiler/ |
| diamond-unittest.cc | 121 Node* phi = d.Phi(types[i], p1, p2); local
127 EXPECT_THAT(phi, IsPhi(types[i], p1, p2, d.merge));
|
| js-intrinsic-lowering-unittest.cc | 147 Node* phi = r.replacement(); local
150 phi,
178 Node* phi = r.replacement(); local
181 phi,
209 Node* phi = r.replacement(); local
212 phi,
240 Node* phi = r.replacement(); local
243 phi,
272 Node* phi = r.replacement(); local
275 phi,
303 Node* phi = r.replacement(); local
431 Node* phi = r.replacement(); local
[all...] |
| /external/llvm/lib/CodeGen/ |
| UnreachableBlockElim.cpp | 168 // Cleanup PHI nodes.
171 // Prune unneeded PHI entries.
174 MachineBasicBlock::iterator phi = BB->begin(); local
175 while (phi != BB->end() && phi->isPHI()) {
176 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2)
177 if (!preds.count(phi->getOperand(i).getMBB())) {
178 phi->RemoveOperand(i);
179 phi->RemoveOperand(i-1);
183 if (phi->getNumOperands() == 3)
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-graph-visualizer.cc | 36 Node* phi = local
37 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start);
38 phi->ReplaceInput(0, NULL);
39 graph.SetEnd(phi);
55 Node* phi = local
56 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start);
57 phi->ReplaceInput(1, NULL);
58 graph.SetEnd(phi);
74 Node* phi = local
75 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start)
[all...] |
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
| codegen.ml | 67 * phi. We create a new name because one is used for the phi node, and the
77 * phi. *)
84 let phi = build_phi incoming "iftmp" builder in var
98 phi
116 (* Start the PHI node with an entry for start. *)
119 (* Within the loop, the variable is defined equal to the PHI node. If it
159 (* Add a new entry to the PHI node for the backedge. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
| codegen.ml | 85 * phi. We create a new name because one is used for the phi node, and the
95 * phi. *)
102 let phi = build_phi incoming "iftmp" builder in var
116 phi
134 (* Start the PHI node with an entry for start. *)
137 (* Within the loop, the variable is defined equal to the PHI node. If it
177 (* Add a new entry to the PHI node for the backedge. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| codegen.ml | 115 * phi. We create a new name because one is used for the phi node, and the
125 * phi. *)
132 let phi = build_phi incoming "iftmp" builder in var
146 phi
190 (* Within the loop, the variable is defined equal to the PHI node. If it
|
| /external/v8/src/compiler/ |
| fast-accessor-assembler.cc | 89 Node* phi = assembler_->Phi(MachineRepresentation::kTagged, internal_field, local
91 return FromRaw(phi);
|
| loop-peeling.cc | 66 // | Merge <------phi
249 if (input != inputs[0]) { // Non-redundant phi.
252 Node* phi = graph->NewNode(op, backedges + 1, &inputs[0]); local
253 node->ReplaceInput(0, phi);
314 Node* phi = local
315 graph->NewNode(common->Phi(MachineRepresentation::kTagged, 2), node,
317 for (Edge edge : value_edges) edge.UpdateTo(phi);
|
| osr.cc | 197 // Create a phi that merges values at entry into the loop header.
201 Node* phi = input = graph->NewNode( local
204 copy->ReplaceInput(0, phi);
|
