| /external/v8/src/crankshaft/ |
| hydrogen-representation-changes.cc | 13 // Insert the representation change right before its use. For phi-uses we
131 HPhi* phi = phi_list->at(i); local
132 if (phi->representation().IsInteger32()) {
133 phi->SetFlag(HValue::kTruncatingToInt32);
134 } else if (phi->representation().IsSmi()) {
135 phi->SetFlag(HValue::kTruncatingToSmi);
136 phi->SetFlag(HValue::kTruncatingToInt32);
138 phi->SetFlag(HValue::kTruncatingToNumber);
142 HPhi* phi = phi_list->at(i); local
145 if (phi->CheckFlag(HValue::kTruncatingToNumber) &
[all...] |
| hydrogen-range-analysis.cc | 51 // Process phi instructions.
53 HPhi* phi = block->phis()->at(i); local
54 InferRange(phi);
220 HPhi* phi = HPhi::cast(value); local
221 for (int i = 0; i < phi->OperandCount(); ++i) {
222 AddToWorklist(phi->OperandAt(i));
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/classes/ |
| Complex.py | 18 # PolarToComplex([r [,phi [,fullcircle]]]) ->
19 # the complex number z for which r == z.radius() and phi == z.angle(fullcircle)
20 # (r and phi default to 0)
27 # z.phi([fullcircle]) == z.angle(fullcircle)
60 # add a class Polar(r, phi) and mixed-mode arithmetic which
82 def PolarToComplex(r = 0, phi = 0, fullcircle = twopi):
83 phi = phi * (twopi / fullcircle)
84 return Complex(math.cos(phi)*r, math.sin(phi)*r)
176 phi = angle variable in class:Complex
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| 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;
|
| 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/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/mesa3d/src/compiler/nir/ |
| nir_lower_phis_to_scalar.c | 31 * Implements a pass that lowers vector phi nodes to scalar phi nodes when
39 /* Hash table marking which phi nodes are scalarizable. The key is
40 * pointers to phi instructions and the entry is either NULL for not
47 should_lower_phi(nir_phi_instr *phi, struct lower_phis_to_scalar_state *state);
74 /* A phi is scalarizable if we're going to lower it */
110 * Determines if the given phi node should be lowered. The only phi nodes
114 * The reason for this comes down to coalescing. Since phi sources can't
116 * before the phi. The choice then becomes between movs to pick of
187 nir_phi_instr *phi = nir_instr_as_phi(instr); local
[all...] |
| nir_opt_dead_cf.c | 86 /* First, we need to remove any phi nodes after the if by rewriting uses to
97 nir_phi_instr *phi = nir_instr_as_phi(instr); local
99 nir_foreach_phi_src(phi_src, phi) {
108 assert(phi->dest.is_ssa);
109 nir_ssa_def_rewrite_uses(&phi->dest.ssa, nir_src_for_ssa(def));
180 * 2) It has no phi nodes after it, since those indicate values inside the
183 * 3) If there are no phi nodes after the loop, then the only way a value
|
| nir_opt_gcm.c | 250 * sources of phi nodes which can be back-edges.
286 /* Phi instructions are a bit special. SSA definitions don't have to
287 * dominate the sources of the phi nodes that use them; instead, they
288 * have to dominate the predecessor block corresponding to the phi
291 * of the one the phi lives in.
294 nir_phi_instr *phi = nir_instr_as_phi(use_instr); local
296 nir_foreach_phi_src(phi_src, phi) {
364 * anything. Also, bailing here keeps us from ever following phi nodes
408 /* Phi nodes are our once source of back-edges. Since right now we are
|
| /external/mesa3d/src/intel/vulkan/ |
| anv_nir_apply_dynamic_offsets.c | 104 /* It's a load, we need a phi node */
105 nir_phi_instr *phi = nir_phi_instr_create(b->shader); local
106 nir_ssa_dest_init(&phi->instr, &phi->dest,
110 nir_phi_src *src1 = ralloc(phi, nir_phi_src);
114 exec_list_push_tail(&phi->srcs, &src1->node);
121 nir_phi_src *src2 = ralloc(phi, nir_phi_src);
125 exec_list_push_tail(&phi->srcs, &src2->node);
129 nir_src_for_ssa(&phi->dest.ssa));
131 nir_instr_insert_after_cf(&if_stmt->cf_node, &phi->instr)
[all...] |
| /external/python/cpython2/Demo/classes/ |
| Complex.py | 18 # PolarToComplex([r [,phi [,fullcircle]]]) ->
19 # the complex number z for which r == z.radius() and phi == z.angle(fullcircle)
20 # (r and phi default to 0)
27 # z.phi([fullcircle]) == z.angle(fullcircle)
60 # add a class Polar(r, phi) and mixed-mode arithmetic which
82 def PolarToComplex(r = 0, phi = 0, fullcircle = twopi):
83 phi = phi * (twopi / fullcircle)
84 return Complex(math.cos(phi)*r, math.sin(phi)*r
176 phi = angle variable in class:Complex
[all...] |
| /external/swiftshader/third_party/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/v8/src/compiler/ |
| loop-peeling.cc | 66 // | Merge <------phi
253 if (input != inputs[0]) { // Non-redundant phi.
256 Node* phi = graph->NewNode(op, backedges + 1, &inputs[0]); local
257 node->ReplaceInput(0, phi);
274 // Change the exit and exit markers to merge/phi/effect-phi.
284 // Change exit marker to phi.
287 exit, common->Phi(MachineRepresentation::kTagged, 2));
290 // Change effect exit marker to effect phi.
|
| loop-variable-optimizer.h | 20 Node* phi() const { return phi_; } function in class:v8::internal::compiler::InductionVariable
42 InductionVariable(Node* phi, Node* arith, Node* increment, Node* init_value,
44 : phi_(phi),
99 InductionVariable* TryGetInductionVariable(Node* phi);
|
| osr.cc | 206 // Create a phi that merges values at entry into the loop header.
210 Node* phi = input = graph->NewNode( local
213 copy->ReplaceInput(0, phi);
|
| /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/ |
| dead_code_elimination.cc | 151 // i1 = phi(input, input)
172 // moment because the catch Phi's inputs do not correspond to the
203 HPhi* phi = block->GetFirstPhi()->AsPhi(); local
204 bool phi_input_is_left = (first->InputAt(0) == phi);
207 // predecessors feeding constants to the phi.
208 // Note that phi->InputCount() may change inside the loop.
209 for (size_t i = 0; i < phi->InputCount();) {
210 HInstruction* input = phi->InputAt(i);
238 phi->RemoveInputAt(i);
245 if (phi->InputCount() == 1)
[all...] |
| register_allocation_resolver.cc | 94 // [catch phi spill slots ]
178 // Resolve phi inputs. Order does not matter.
181 // Catch phi values are set at runtime by the exception delivery mechanism.
184 HInstruction* phi = inst_it.Current(); local
188 HInstruction* input = phi->InputAt(i);
191 Location destination = phi->GetLiveInterval()->ToLocation();
192 InsertParallelMoveAtExitOf(predecessor, phi, source, destination);
575 // We may insert moves for split siblings and phi spills at the beginning of the block.
634 // We insert moves at exit for phi predecessors and connecting blocks.
|
| ssa_builder.cc | 51 // Both type propagation and redundant phi elimination ensure `int_operand`
64 HPhi* phi = it.Current()->AsPhi(); local
65 HPhi* next = phi->GetNextEquivalentPhiWithSameType();
67 // Make sure we do not replace a live phi with a dead phi. A live phi
68 // has been handled by the type propagation phase, unlike a dead phi.
70 phi->ReplaceWith(next);
71 phi->SetDead();
73 next->ReplaceWith(phi);
86 HPhi* phi = it_phis.Current()->AsPhi(); local
235 HPhi* phi = phi_it.Current()->AsPhi(); local
247 HPhi* phi = phi_it.Current()->AsPhi(); local
262 HPhi* phi = worklist->back(); local
[all...] |
| ssa_liveness_analysis.cc | 40 // start and end position. Non-phi instructions have a distinct lifetime position than
41 // the block they are in. Phi instructions have the lifetime start of their block as
131 // Check that the inlined input is not a phi. Recursing on loop phis could
146 // Set phi inputs of successors of this block corresponding to this block
153 // catch phi spill slots when an exception is thrown.
162 HInstruction* phi = phi_it.Current(); local
163 HInstruction* input = phi->InputAt(phi_input_index);
164 input->GetLiveInterval()->AddPhiUse(phi, phi_input_index, block);
165 // 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/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
|
