| /external/v8/src/crankshaft/ |
| hydrogen-range-analysis.cc | 50 // Process phi instructions.
52 HPhi* phi = block->phis()->at(i); local
53 InferRange(phi);
225 HPhi* phi = HPhi::cast(value); local
226 for (int i = 0; i < phi->OperandCount(); ++i) {
227 AddToWorklist(phi->OperandAt(i));
|
| hydrogen-escape-analysis.cc | 92 HPhi* phi = NewPhiAndInsert(block, operand, index); local
93 state->SetOperandAt(index, phi);
112 // Insert a newly created phi into the given block and fill all incoming
118 HPhi* phi = new(zone) HPhi(HPhi::kInvalidMergedIndex, zone); local
120 phi->AddInput(incoming_value);
122 block->AddPhi(phi);
123 return phi;
275 // Phi already exists, add operand.
276 HPhi* phi = HPhi::cast(succ_operand); local
277 phi->SetOperandAt(succ->PredecessorIndexOf(block), operand)
280 HPhi* phi = NewPhiAndInsert(succ, succ_operand, index); local
[all...] |
| hydrogen-bch.cc | 48 HLoopInformation* loop = data->phi()->block()->current_loop();
100 loop_header_ = data->phi()->block()->current_loop()->loop_header();
195 data->phi()->block()->current_loop()->loop_header();
284 HPhi* phi = bb->phis()->at(i); local
285 phi->DetectInductionVariable();
302 HPhi* phi = HPhi::cast(decomposition.base); local
304 if (!phi->IsInductionVariable()) continue;
305 InductionVariableData* data = phi->induction_variable_data();
319 if (!phi->IsLimitedInductionVariable()) continue;
323 phi->induction_variable_data()->AddCheck(check, limit)
338 HPhi* phi = bb->phis()->at(i); local
[all...] |
| /external/v8/test/unittests/compiler/ |
| dead-code-elimination-unittest.cc | 193 Node* const phi = graph()->NewNode( local
194 common()->Phi(MachineRepresentation::kTagged, 2), v0, v1, merge);
197 EXPECT_CALL(editor, Replace(phi, v0));
220 Node* const phi = graph()->NewNode( local
221 common()->Phi(MachineRepresentation::kTagged, 4), v0, v1, v2, v3, merge);
225 EXPECT_CALL(editor, Revisit(phi));
230 EXPECT_THAT(phi,
278 Node* const phi = graph()->NewNode( local
279 common()->Phi(MachineRepresentation::kTagged, 2), v0, v1, loop);
283 EXPECT_CALL(editor, Replace(phi, v0))
307 Node* const phi = graph()->NewNode( local
[all...] |
| common-operator-reducer-unittest.cc | 274 // Phi
296 &editor, graph()->NewNode(common()->Phi(rep, value_input_count),
310 Node* const phi = graph()->NewNode( local
311 common()->Phi(MachineRepresentation::kTagged, 2), p0, p0, loop);
312 phi->ReplaceInput(1, phi);
315 Reduction const r = Reduce(&editor, phi);
331 Node* phi = graph()->NewNode( local
332 common()->Phi(MachineRepresentation::kFloat32, 2), vtrue, vfalse, merge);
335 Reduction r = Reduce(&editor, phi);
351 Node* phi = graph()->NewNode( local
369 Node* phi = graph()->NewNode( local
387 Node* phi = graph()->NewNode( local
405 Node* phi = graph()->NewNode( local
423 Node* phi = graph()->NewNode( local
448 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), local
[all...] |
| escape-analysis-unittest.cc | 268 Node* phi = graph()->NewNode(common()->EffectPhi(2), effect1, effect2, merge); local
269 Node* load = Load(AccessAtIndex(0), finish, phi, merge);
270 Node* result = Return(load, phi);
|
| instruction-sequence-unittest.cc | 162 PhiInstruction* InstructionSequenceTest::Phi(VReg incoming_vreg_0,
173 auto phi = new (zone()) PhiInstruction(zone(), NewReg().value_, input_count); local
175 SetInput(phi, i, inputs[i]);
177 current_block_->AddPhi(phi);
178 return phi;
182 PhiInstruction* InstructionSequenceTest::Phi(VReg incoming_vreg_0,
184 auto phi = new (zone()) PhiInstruction(zone(), NewReg().value_, input_count); local
185 SetInput(phi, 0, incoming_vreg_0);
186 current_block_->AddPhi(phi);
187 return phi;
[all...] |
| /frameworks/base/media/tests/audiotests/ |
| shared_mem_test.cpp | 78 unsigned long phi; local
87 phi = 0;
88 Generate(smpBuf, BUF_SZ, amplitude, phi, dPhi); // fill buffer
134 void AudioTrackTest::Generate(short *buffer, long bufferSz, long amplitude, unsigned long &phi, long dPhi)
138 buffer[i0] = ComputeSine( amplitude, phi);
139 phi += dPhi;
149 short AudioTrackTest::ComputeSine(long amplitude, long phi)
155 sample = (amplitude*sin1024[(phi>>22) & 0x3ff]) >> 15;
157 l0 = (phi>>12) & 0x3ff; // 2^20 * x / (2*pi)
158 l1 = (amplitude*sin1024[((phi>>22) + 256) & 0x3ff]) >> 15; // 2^15*cosin
173 double phi = 0; local
[all...] |
| /packages/apps/Camera2/jni/ |
| tinyplanet.cc | 115 float phi = 2 * atan(1 / r); local
120 float py = (phi / PI_F) * input_height;
|
| /packages/apps/Gallery2/jni/filters/ |
| tinyplanet.cc | 114 float phi = 2 * atan(1 / r); local
119 float py = (phi / PI_F) * input_height;
|
| /art/compiler/optimizing/ |
| induction_var_analysis_test.cc | 138 // Inserts a phi to loop header at depth d and returns it.
140 HPhi* phi = new (&allocator_) HPhi(&allocator_, vreg, 0, Primitive::kPrimInt); local
141 loop_header_[d]->AddPhi(phi);
142 return phi;
327 // Merge over a phi.
359 // Merge over a phi.
570 // Avoid exact phi number, since that depends on the SSA building phase.
572 "\\(\\(1\\) \\+ \\(\\d+:Phi\\)\\)\\):PrimInt");
|
| induction_var_range_test.cc | 90 HPhi* phi = new (&allocator_) HPhi(&allocator_, 0, 0, Primitive::kPrimInt); local
91 loop_header->AddPhi(phi);
92 phi->AddInput(graph_->GetIntConstant(lower)); // i = l
94 condition_ = new (&allocator_) HLessThan(phi, upper); // i < u
96 condition_ = new (&allocator_) HGreaterThan(phi, upper); // i > u
100 increment_ = new (&allocator_) HAdd(Primitive::kPrimInt, phi, graph_->GetIntConstant(stride));
102 phi->AddInput(increment_);
[all...] |
| register_allocator_test.cc | 182 * phi
224 * phi
271 * phi +
303 HPhi* phi = loop_header->GetFirstPhi()->AsPhi(); local
305 LiveInterval* phi_interval = phi->GetLiveInterval();
306 LiveInterval* loop_update = phi->InputAt(1)->GetLiveInterval();
357 /* Test for a dead loop phi taking as back-edge input a phi that also has
358 * this loop phi as input. Walking backwards in SsaDeadPhiElimination
359 * does not solve the problem because the loop phi will be visited last
532 HPhi *phi; local
[all...] |
| ssa_builder.cc | 49 // Both type propagation and redundant phi elimination ensure `int_operand`
62 HPhi* phi = it.Current()->AsPhi(); local
63 HPhi* next = phi->GetNextEquivalentPhiWithSameType();
65 // Make sure we do not replace a live phi with a dead phi. A live phi
66 // has been handled by the type propagation phase, unlike a dead phi.
68 phi->ReplaceWith(next);
69 phi->SetDead();
71 next->ReplaceWith(phi);
85 HPhi* phi = it_phis.Current()->AsPhi(); local
242 HPhi* phi = phi_it.Current()->AsPhi(); local
254 HPhi* phi = phi_it.Current()->AsPhi(); local
269 HPhi* phi = worklist->back(); local
[all...] |
| bounds_check_elimination_test.cc | 391 HPhi* phi = new (allocator) HPhi(allocator, 0, 0, Primitive::kPrimInt); local
396 cmp = new (allocator) HGreaterThanOrEqual(phi, array_length);
399 cmp = new (allocator) HGreaterThan(phi, array_length);
402 loop_header->AddPhi(phi);
407 phi->AddInput(constant_initial);
411 HInstruction* bounds_check = new (allocator) HBoundsCheck(phi, array_length, 0);
415 HInstruction* add = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_increment);
422 phi->AddInput(add);
511 HPhi* phi = new (allocator) HPhi(allocator, 0, 0, Primitive::kPrimInt); local
514 cmp = new (allocator) HLessThanOrEqual(phi, constant_initial)
621 HPhi* phi = new (allocator) HPhi(allocator, 0, 0, Primitive::kPrimInt); local
720 HPhi* phi = new (allocator) HPhi(allocator, 0, 0, Primitive::kPrimInt); local
[all...] |
| ssa_liveness_analysis.cc | 109 // start and end position. Non-phi instructions have a distinct lifetime position than
110 // the block they are in. Phi instructions have the lifetime start of their block as
201 // Check that the inlined input is not a phi. Recursing on loop phis could
218 // Set phi inputs of successors of this block corresponding to this block
225 // catch phi spill slots when an exception is thrown.
234 HInstruction* phi = phi_it.Current(); local
235 HInstruction* input = phi->InputAt(phi_input_index);
236 input->GetLiveInterval()->AddPhiUse(phi, phi_input_index, block);
237 // A phi input whose last user is the phi dies at the end of the predecessor block
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| LivenessAnalyzer.java | 159 // If s is a phi-function with V as it's ith argument.
160 PhiInsn phi = (PhiInsn) insn; local
163 phi.predBlocksForReg(regV, ssaMeth)) {
246 * Ensures that all the phi result registers for all the phis in the
250 * a the result of a dead-end phi might be assigned the same register
251 * as the result of another phi, and the phi removal move scheduler may
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| HarmonicCoefficientsGuesser.java | 29 * ω and φ such that f (t) = a cos (ω t + φ).
36 * where S (t) = sin (2 (ω t + φ)) / (2 ω)
113 * <p>It appears that <code>fc = a ω cos (φ)</code> and
114 * <code>fs = -a ω sin (φ)</code>, so we can use these
115 * expressions to compute φ. The best estimate over the sample is
138 /** Guessed phase φ. */
139 private double phi; field in class:HarmonicCoefficientsGuesser
248 /** Estimate a first guess of the φ coefficient.
275 phi = FastMath.atan2(-fsMean, fcMean)
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/back/ |
| LivenessAnalyzer.java | 160 // If s is a phi-function with V as it's ith argument.
161 PhiInsn phi = (PhiInsn) insn; local
164 phi.predBlocksForReg(regV, ssaMeth)) {
247 * Ensures that all the phi result registers for all the phis in the
251 * a the result of a dead-end phi might be assigned the same register
252 * as the result of another phi, and the phi removal move scheduler may
|
| /external/v8/src/compiler/ |
| machine-operator-reducer.cc | 653 Node* const phi = m.node(); local
654 DCHECK_EQ(MachineRepresentation::kFloat64, PhiRepresentationOf(phi->op()));
655 if (phi->OwnedBy(node)) {
656 // TruncateFloat64ToInt32[mode](Phi[Float64](x1,...,xn))
657 // => Phi[Int32](TruncateFloat64ToInt32[mode](x1),
660 const int value_input_count = phi->InputCount() - 1;
662 Node* input = graph()->NewNode(node->op(), phi->InputAt(i));
667 phi->ReplaceInput(i, input);
670 phi,
671 common()->Phi(MachineRepresentation::kWord32, value_input_count))
[all...] |
| verifier.cc | 386 // Phi input count matches parent control node.
1172 Node* phi = *i; local
[all...] |
| /frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
| BaseCluster.java | 82 double phi = Math.toRadians(latitude); local
84 vector[0] = Math.cos(lambda) * Math.cos(phi);
85 vector[1] = Math.sin(lambda) * Math.cos(phi);
86 vector[2] = Math.sin(phi);
|
| /external/eigen/unsupported/Eigen/src/SVD/ |
| BDCSVD.h | 375 RealScalar lambda, phi, c0, s0; local
407 phi = m_naiveU(firstCol + k + 1, lastCol + 1);
412 phi = m_naiveU(0, lastCol + 1);
415 + abs(betaK * phi) * abs(betaK * phi));
435 s0 = betaK * phi / r0;
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 330 // 2. insert PHI functions
350 // TODO: don't add phi functions for values that aren't used outside
366 // for each block in workList, insert a phi for lval in the block's
373 Instruction *phi; local
380 // pruned SSA: don't need a phi if the value is not live-in
384 phi = new_Instruction(this, OP_PHI, typeOfSize(lval->reg.size));
385 dfBB->insertTail(phi);
387 phi->setDef(0, lval);
389 phi->setSrc(s, lval);
489 Instruction *phi; local
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-osr.cc | 94 return graph.NewNode(common.Phi(MachineRepresentation::kTagged, count),
316 Node* Phi(Node* i1, Node* i2, Node* i3) {
318 return t.graph.NewNode(t.common.Phi(MachineRepresentation::kTagged, 2),
321 return t.graph.NewNode(t.common.Phi(MachineRepresentation::kTagged, 3),
344 Node* outer_phi = outer.Phi(T.p0, T.p0, nullptr);
347 Node* osr_phi = inner.Phi(T.jsgraph.TrueConstant(), T.osr_values[0],
403 Node* outer_phi = outer.Phi(T.p0, T.p0, T.p0);
406 Node* osr_phi = inner.Phi(T.jsgraph.TrueConstant(), T.osr_values[0],
478 Node* phi = jsgraph->graph()->NewNode( local
479 jsgraph->common()->Phi(MachineRepresentation::kWord32, count), count + 1
[all...] |
