| /art/test/481-regression-phi-cond/src/ |
| Main.java | 26 boolean phi;
28 phi = x;
30 phi = y;
32 return phi;
40 // First create a Phi(x, y).
41 boolean phi = inlinePhi(x, y, z);
42 // Now use the phi as a condition which the boolean simplifier will try to
44 // the original condition (phi) and crash.
45 return dontUseParam(phi == false ? false : true);
|
| /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/v8/src/crankshaft/ |
| 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-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-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-uint32-analysis.h | 26 INLINE(bool CheckPhiOperands(HPhi* phi));
27 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
|
| 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-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...] |
| hydrogen-mark-deoptimize.h | 14 // Compute DeoptimizeOnUndefined flag for phis. Any phi that can reach a use
28 void ProcessPhi(HPhi* phi);
|
| hydrogen-infer-types.cc | 32 HPhi* phi = block->phis()->at(j); local
33 worklist_.Add(phi, zone());
34 in_worklist_.Add(phi->id());
|
| 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...] |
| 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);
|
| /dalvik/dx/tests/083-ssa-phi-placement/ |
| run | 18 dx --dump --ssa-blocks --ssa-step=phi-placement Blort.class
|
| /frameworks/base/media/tests/audiotests/ |
| shared_mem_test.h | 16 void Generate(short *buffer, long bufferSz, long amplitude, unsigned long &phi, long dPhi);
18 short ComputeSine(long amplitude, long phi);
|
| 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...] |
| /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;
|
| /art/compiler/optimizing/ |
| 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...] |
| 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...] |
| 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...] |
| graph_checker.cc | 123 AddError(StringPrintf("Block %d has a non-phi in its phi list.",
127 AddError(StringPrintf("The recorded last phi of block %d does not match "
128 "the actual last phi %d.",
140 AddError(StringPrintf("Block %d has a phi in its non-phi list.",
326 instruction->IsPhi() ? "Phi" : "Instruction",
331 instruction->IsPhi() ? "Phi" : "Instruction",
476 "with catch phi %d for vreg %d but its "
697 void GraphChecker::VisitPhi(HPhi* phi) {
[all...] |
| ssa_builder.h | 106 bool TypeInputsOfPhi(HPhi* phi, ArenaVector<HPhi*>* worklist);
107 bool UpdatePrimitiveType(HPhi* phi, ArenaVector<HPhi*>* worklist);
112 HPhi* GetFloatDoubleOrReferenceEquivalentOfPhi(HPhi* phi, Primitive::Type type);
|
| /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/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/opencv3/samples/python2/ |
| asift.py | 34 def affine_skew(tilt, phi, img, mask=None):
36 affine_skew(tilt, phi, img, mask=None) -> skew_img, skew_mask, Ai
45 if phi != 0.0:
46 phi = np.deg2rad(phi)
47 s, c = np.sin(phi), np.cos(phi)
59 if phi != 0.0 or tilt != 1.0:
78 for phi in np.arange(0, 180, 72.0 / t):
79 params.append((t, phi))
[all...] |
