| /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/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...] |
| /art/compiler/optimizing/ |
| primitive_type_propagation.cc | 42 bool PrimitiveTypePropagation::UpdateType(HPhi* phi) {
43 DCHECK(phi->IsLive());
44 Primitive::Type existing = phi->GetType();
47 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) {
48 Primitive::Type input_type = phi->InputAt(i)->GetType();
51 phi->SetType(new_type);
56 // If the phi is of floating point type, we need to update its inputs to that
58 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) {
59 HInstruction* input = phi->InputAt(i);
63 : SsaBuilder::GetFloatOrDoubleEquivalent(phi, input, new_type)
90 HPhi* phi = it.Current()->AsPhi(); local
102 HPhi* phi = it.Current()->AsPhi(); local
126 HPhi* phi = it.Current()->GetUser()->AsPhi(); local
[all...] |
| ssa_phi_elimination.cc | 27 // Add to the worklist phis referenced by non-phi instructions.
31 HPhi* phi = inst_it.Current()->AsPhi(); local
32 // Set dead ahead of running through uses. The phi may have no use.
33 phi->SetDead();
34 for (HUseIterator<HInstruction*> use_it(phi->GetUses()); !use_it.Done(); use_it.Advance()) {
38 worklist_.Add(phi);
39 phi->SetLive();
46 // Process the worklist by propagating liveness to phi inputs.
48 HPhi* phi = worklist_.Pop(); local
49 for (HInputIterator it(phi); !it.Done(); it.Advance())
67 HPhi* phi; local
110 HPhi* phi = worklist_.Pop(); local
[all...] |
| primitive_type_propagation.h | 35 void AddToWorklist(HPhi* phi);
37 bool UpdateType(HPhi* phi);
|
| ssa_builder.cc | 45 void AddToWorklist(HPhi* phi);
46 void AddDependentInstructionsToWorklist(HPhi* phi);
47 bool UpdateType(HPhi* phi);
57 bool DeadPhiHandling::UpdateType(HPhi* phi) {
58 Primitive::Type existing = phi->GetType();
59 DCHECK(phi->IsLive());
63 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) {
64 HInstruction* input = phi->InputAt(i);
68 // input is a phi, and it is dead (because its input types are
69 // conflicting), this phi must be marked dead as well
122 HPhi* phi = it.Current()->AsPhi(); local
157 HPhi* phi = it.Current()->GetUser()->AsPhi(); local
213 HPhi* phi = it.Current()->AsPhi(); local
243 HPhi* phi = it.Current()->AsPhi(); local
301 HPhi* phi = it_phis.Current()->AsPhi(); local
361 HPhi* phi = new (GetGraph()->GetArena()) HPhi( local
395 HPhi* phi = new (GetGraph()->GetArena()) HPhi( local
[all...] |
| graph_checker.cc | 94 AddError(StringPrintf("Block %d has a non-phi in its phi list.",
98 AddError(StringPrintf("The recorded last phi of block %d does not match "
99 "the actual last phi %d.",
111 AddError(StringPrintf("Block %d has a phi in its non-phi list.",
147 instruction->IsPhi() ? "Phi" : "Instruction",
152 instruction->IsPhi() ? "Phi" : "Instruction",
297 // Check Phi uniqueness (no two Phis with the same type refer to the same register).
299 HPhi* phi = it.Current()->AsPhi() local
[all...] |
| reference_type_propagation.cc | 202 void ReferenceTypePropagation::VisitPhi(HPhi* phi) {
203 if (phi->GetType() != Primitive::kPrimNot) {
207 if (phi->GetBlock()->IsLoopHeader()) {
208 // Set the initial type for the phi. Use the non back edge input for reaching
210 AddToWorklist(phi);
211 phi->SetCanBeNull(phi->InputAt(0)->CanBeNull());
212 phi->SetReferenceTypeInfo(phi->InputAt(0)->GetReferenceTypeInfo());
214 // Eagerly compute the type of the phi, for quicker convergence. Not
305 HPhi* phi = instr->AsPhi(); local
[all...] |
| /external/v8/src/ |
| 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 | 87 // There is a phi use of this value from a phi that is not yet
105 // There is a phi use of this value from a phi that is not yet
118 // Check if all operands to the given phi are marked with kUint32 flag.
119 bool HUint32AnalysisPhase::CheckPhiOperands(HPhi* phi) {
120 if (!phi->CheckFlag(HInstruction::kUint32)) {
121 // This phi is not uint32 safe. No need to check operands.
125 for (int j = 0; j < phi->OperandCount(); j++) {
126 HValue* operand = phi->OperandAt(j)
180 HPhi* phi = phis_[i]; local
195 HPhi* phi = worklist.RemoveLast(); local
204 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/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
118 HPhi* phi = phi_list->at(i); local
119 if (phi->representation().IsInteger32()) {
120 phi->SetFlag(HValue::kTruncatingToInt32);
121 } else if (phi->representation().IsSmi()) {
122 phi->SetFlag(HValue::kTruncatingToSmi);
123 phi->SetFlag(HValue::kTruncatingToInt32);
128 HPhi* phi = phi_list->at(i); local
130 if (phi->representation().IsSmiOrInteger32() &&
131 !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();
285 HPhi* phi = bb->phis()->at(i); local
286 phi->DetectInductionVariable();
303 HPhi* phi = HPhi::cast(decomposition.base); local
305 if (!phi->IsInductionVariable()) continue;
306 InductionVariableData* data = phi->induction_variable_data();
320 if (!phi->IsLimitedInductionVariable()) continue;
324 phi->induction_variable_data()->AddCheck(check, limit)
339 HPhi* phi = bb->phis()->at(i); local
[all...] |
| /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;
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| RSAKeyPairGenerator.java | 35 BigInteger p, q, n, d, e, pSub1, qSub1, phi, lcm, dLowerBound; local
99 phi = p;
101 q = phi;
106 phi = pSub1.multiply(qSub1);
107 lcm = phi.divide(pSub1.gcd(qSub1));
116 // e.modInverse(phi), we need to start over
118 if (d.bitLength() <= qbitlength || !d.equals(e.modInverse(phi)))
|
| /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...] |
