| /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/src/ |
| 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/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 | 95 HPhi* phi = phis->at(j); local
96 if (phi->HasMergedIndex()) {
97 osr_values_->at(phi->merged_index())->set_incoming_value(phi);
|
| 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-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-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));
|
| /art/compiler/optimizing/ |
| live_ranges_test.cc | 154 * 22: phi
178 // Last use is the phi at the return block so instruction is live until
194 // Last use is the phi at the return block.
198 // Test for the phi.
224 * 14: phi
257 // Last use is the loop phi so instruction is live until
278 // Test for the phi.
302 * 10: phi
314 * We want to make sure the phi at 10 has a lifetime hole after the add at 20.
338 // Last use is the loop phi so instruction is live unti
344 HPhi* phi = liveness.GetInstructionFromSsaIndex(1)->AsPhi(); local
448 HPhi* phi = liveness.GetInstructionFromSsaIndex(4)->AsPhi(); local
[all...] |
| 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...] |
| boolean_simplifier.cc | 115 HPhi* phi = merge_block->GetFirstPhi()->AsPhi(); local
116 HInstruction* true_value = phi->InputAt(merge_block->GetPredecessorIndexOf(true_block));
117 HInstruction* false_value = phi->InputAt(merge_block->GetPredecessorIndexOf(false_block));
135 phi->ReplaceWith(replacement);
136 merge_block->RemovePhi(phi);
|
| /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/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/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/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/ |
| graph-builder.cc | 145 // Introduce Phi nodes for values that have differing input at merge points,
146 // potentially extending an existing Phi node if possible.
156 Node* phi = builder_->NewPhi(1, values()->at(i), control); local
157 values()->at(i) = phi;
165 const Operator* phi_op = common()->Phi(kMachAnyTagged, count);
210 // Phi already exists, add input.
214 // Phi does not exist yet, introduce one.
227 // Phi already exists, add input.
228 value->set_op(common()->Phi(kMachAnyTagged, inputs));
231 // Phi does not exist yet, introduce one
[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;
|
