Searched refs:phi (Results 1 - 25 of 123) sorted by relevance

12345

/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/
H A DHarmonicFunction.java23 /** Harmonic function of the form <code>f (t) = a cos (&omega; t + &phi;)</code>.
35 /** Phase &phi;. */
36 private final double phi; field in class:HarmonicFunction
41 * @param phi phase
43 public HarmonicFunction(double a, double omega, double phi) { argument
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 &phi;
[all...]
H A DHarmonicFitter.java29 * the phase &phi;: <code>f (t) = a cos (&omega; t + &phi;)</code>. They are
40 /** Values for amplitude, pulsation &omega; and phase &phi;. */
56 * pulsation &omega; (index 1) and phase &phi; (index 2)
116 final double phi = parameters[2];
117 return a * FastMath.cos(omega * x + phi);
124 final double phi = parameters[2];
125 final double alpha = omega * x + phi;
H A DHarmonicCoefficientsGuesser.java29 * &omega; and &phi; such that f (t) = a cos (&omega; t + &phi;).
36 * where S (t) = sin (2 (&omega; t + &phi;)) / (2 &omega;)
113 * <p>It appears that <code>fc = a &omega; cos (&phi;)</code> and
114 * <code>fs = -a &omega; sin (&phi;)</code>, so we can use these
115 * expressions to compute &phi;. The best estimate over the sample is
138 /** Guessed phase &phi;. */
139 private double phi; field in class:HarmonicCoefficientsGuesser
248 /** Estimate a first guess of the &phi; coefficient.
275 phi
[all...]
/external/v8/src/crankshaft/
H A Dhydrogen-mark-deoptimize.cc13 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) { argument
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...]
H A Dhydrogen-uint32-analysis.cc83 // 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) { argument
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
143 UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist) argument
176 HPhi* phi = phis_[i]; local
191 HPhi* phi = worklist.RemoveLast(); local
200 HPhi* phi = phis_[i]; local
[all...]
H A Dhydrogen-dce.cc57 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
[all...]
H A Dhydrogen-redundant-phi.cc5 #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);
H A Dhydrogen-uint32-analysis.h26 INLINE(bool CheckPhiOperands(HPhi* phi));
27 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
H A Dhydrogen-representation-changes.cc12 // 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
[all...]
H A Dhydrogen-infer-types.cc32 HPhi* phi = block->phis()->at(j); local
33 worklist_.Add(phi, zone());
34 in_worklist_.Add(phi->id());
H A Dhydrogen-mark-deoptimize.h14 // Compute DeoptimizeOnUndefined flag for phis. Any phi that can reach a use
28 void ProcessPhi(HPhi* phi);
H A Dhydrogen-osr.cc96 HPhi* phi = phis->at(j); local
97 if (phi->HasMergedIndex()) {
98 osr_values_->at(phi->merged_index())->set_incoming_value(phi);
H A Dhydrogen-infer-representation.cc20 // (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
142 HPhi* phi = phis->at(j); local
[all...]
H A Dhydrogen-escape-analysis.cc92 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;
276 HPhi* phi = HPhi::cast(succ_operand); local
277 phi->SetOperandAt(succ->PredecessorIndexOf(block), operand);
280 HPhi* phi local
[all...]
/external/libvncserver/test/
H A Dcopyrecttest.c22 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/
H A DLocal.cpp29 PHINode *phi = builder.CreatePHI(Type::getInt32Ty(C), 2); local
35 phi->addIncoming(phi, bb0);
36 phi->addIncoming(phi, bb1);
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);
52 builder.CreateAdd(phi, ph
[all...]
/external/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp174 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) {
184 unsigned Input = phi->getOperand(1).getReg();
185 unsigned Output = phi
[all...]
/external/opencv3/samples/python2/
H A Dasift.py34 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...]
/external/v8/test/unittests/compiler/
H A Dloop-peeling-unittest.cc47 Node* phi; member in struct:v8::internal::compiler::Counter
137 Node* phi = graph()->NewNode( local
139 Node* add = graph()->NewNode(machine()->Int32Add(), phi, inc);
140 phi->ReplaceInput(1, add);
141 return {base, inc, phi, add};
170 Node* r = InsertReturn(c.phi, start(), w.exit);
187 r, IsReturn(IsPhi(MachineRepresentation::kTagged, c.phi, c.base,
200 Node* r = InsertReturn(c.phi, start(), outer.exit);
226 IsReturn(IsPhi(MachineRepresentation::kTagged, c.phi, c.base,
239 Node* r = InsertReturn(c.phi, star
274 Node* phi = NewPhi(&outer, Int32Constant(11), c.phi); local
351 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 3), local
399 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 3), local
[all...]
H A Djs-intrinsic-lowering-unittest.cc120 Node* phi = r.replacement(); local
123 phi,
151 Node* phi = r.replacement(); local
154 phi,
182 Node* phi = r.replacement(); local
185 phi,
230 Node* phi = r.replacement(); local
233 phi,
/external/v8/test/cctest/compiler/
H A Dtest-graph-visualizer.cc36 Node* phi = local
38 phi->ReplaceInput(0, NULL);
39 graph.SetEnd(phi);
55 Node* phi = local
57 phi->ReplaceInput(1, NULL);
58 graph.SetEnd(phi);
74 Node* phi = local
76 phi->ReplaceInput(0, NULL);
H A Dtest-loop-analysis.cc212 Node* phi; member in struct:v8::internal::compiler::Counter
223 phi = w.t.graph.NewNode(w.t.op(2, false), base, base, w.loop);
224 add = w.t.graph.NewNode(&kIntAdd, phi, inc);
225 phi->ReplaceInput(1, add);
233 Node* phi; member in struct:v8::internal::compiler::StoreLoop
244 phi = w.t.graph.NewNode(w.t.op(2, true), base, base, w.loop);
245 store = w.t.graph.NewNode(&kStore, val, phi, w.loop);
246 phi->ReplaceInput(1, store);
267 // One loop with a simple phi.
270 Node* phi local
692 Node* phi = t.graph.NewNode( local
931 Node* phi = t.graph.NewNode(t.common.Phi(MachineRepresentation::kWord32, 2), local
967 Node* phi = t.graph.NewNode(t.common.Phi(MachineRepresentation::kWord32, 2), local
[all...]
/external/llvm/examples/BrainF/
H A DBrainF.h73 void readloop(PHINode *phi, BasicBlock *oldbb,
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_bb.cpp74 joinAt = phi = entry = exit = NULL;
123 if (phi) {
124 insertBefore(phi, inst);
130 phi = exit = inst;
139 if (phi) {
140 insertAfter(exit, inst); // after last phi
161 assert(phi);
164 assert(!phi);
165 phi = exit = inst;
173 assert(!phi);
[all...]
H A Dnv50_ir_ssa.cpp350 // 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
501 for (phi
[all...]

Completed in 1352 milliseconds

12345