Searched defs:phi (Results 1 - 25 of 117) sorted by relevance

12345

/external/swiftshader/third_party/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/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 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/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/mesa3d/src/compiler/nir/
H A Dnir_opt_conditional_discard.c60 * make sure no subsequent phi nodes point at this if.
66 nir_phi_instr *phi = nir_instr_as_phi(instr); local
68 nir_foreach_phi_src(phi_src, phi) {
H A Dnir_opt_remove_phis.c52 * This is a pass for removing phi nodes that look like:
53 * a = phi(b, b, b, ...)
58 * phi node's predecessors, which means it must dominate the phi node as well
59 * as all of the phi node's uses. In essence, the phi node acts as a copy
60 * instruction. b can't be another phi node in the same block, since the only
61 * time when phi nodes can source other phi nodes defined in the same block is
62 * at the loop header, and in that case one of the sources of the phi ha
75 nir_phi_instr *phi = nir_instr_as_phi(instr); local
[all...]
H A Dnir_opt_peephole_select.c39 * phi
41 * phi
131 /* The only uses of this definition must be phi's in the successor */
179 * statement containing only moves to phi nodes in this block. We can
180 * just remove that entire CF node and replace all of the phi nodes with
206 nir_phi_instr *phi = nir_instr_as_phi(instr); local
212 assert(exec_list_length(&phi->srcs) == 2);
213 nir_foreach_phi_src(src, phi) {
222 phi->dest.ssa.num_components,
223 phi
[all...]
H A Dnir_propagate_invariant.c129 nir_phi_instr *phi = nir_instr_as_phi(instr); local
130 if (!dest_is_invariant(&phi->dest, invariants))
133 nir_foreach_phi_src(src, phi) {
H A Dnir_liveness.c34 * This liveness pass treats phi nodes as being melded to the space between
35 * blocks so that the destinations of a phi are in the livein of the block
40 * SSA value may not dominate a use is if the use is in a phi node and the
41 * uses in phi no are in the live-out of the corresponding predecessor
42 * block but not in the live-in of the block containing the phi node.
113 * Phi nodes exist "between" blocks and all the phi nodes at the start of a
130 nir_phi_instr *phi = nir_instr_as_phi(instr); local
132 assert(phi->dest.is_ssa);
133 set_ssa_def_dead(&phi->dest.ssa, live);
139 nir_phi_instr *phi local
[all...]
H A Dnir_lower_indirect_derefs.c74 /* We're a load. We need to insert a phi node */
75 nir_phi_instr *phi = nir_phi_instr_create(b->shader); local
77 nir_ssa_dest_init(&phi->instr, &phi->dest,
80 nir_phi_src *src0 = ralloc(phi, nir_phi_src);
83 exec_list_push_tail(&phi->srcs, &src0->node);
85 nir_phi_src *src1 = ralloc(phi, nir_phi_src);
88 exec_list_push_tail(&phi->srcs, &src1->node);
90 nir_builder_instr_insert(b, &phi->instr);
91 *dest = &phi
[all...]
H A Dnir_lower_phis_to_scalar.c31 * 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
131 should_lower_phi(nir_phi_instr *phi, struct lower_phis_to_scalar_state *state) argument
187 nir_phi_instr *phi = nir_instr_as_phi(instr); local
[all...]
/external/v8/src/crankshaft/
H A Dhydrogen-dce.cc58 HPhi* phi = block->phis()->at(j); local
59 if (phi->CannotBeEliminated()) MarkLive(phi, &worklist);
85 HPhi* phi = block->phis()->at(j); local
86 if (!phi->CheckFlag(HValue::kIsLive)) {
87 worklist.Add(phi, zone());
89 phi->ClearFlag(HValue::kIsLive);
94 // Process phis separately to avoid simultaneously mutating the phi list.
96 HPhi* phi = worklist.RemoveLast(); local
97 HBasicBlock* block = phi
[all...]
H A Dhydrogen-infer-types.cc33 HPhi* phi = block->phis()->at(j); local
34 worklist_.Add(phi, zone());
35 in_worklist_.Add(phi->id());
H A Dhydrogen-redundant-phi.cc5 #include "src/crankshaft/hydrogen-redundant-phi.h"
47 HPhi* phi = phis->at(i); local
48 if (phi->CheckFlag(HValue::kIsDead)) continue; // Already replaced.
50 HValue* replacement = phi->GetRedundantReplacement();
52 phi->SetFlag(HValue::kIsDead);
53 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) {
56 // Iterate again if used in another non-dead phi.
59 phi->block()->RemovePhi(phi);
H A Dhydrogen-infer-representation.cc21 // (1) Initialize bit vectors and count real uses. Each phi gets a
34 // phi is connected to another phi if its value is used either directly or
42 HPhi* phi = phi_list->at(i); local
43 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) {
97 // Simplify constant phi inputs where possible.
103 // Use the phi reachability information from step 2 to
104 // sum up the non-phi use counts of all connected phis.
106 HPhi* phi = phi_list->at(i); local
112 if (index != i) phi
143 HPhi* phi = phis->at(j); local
[all...]
H A Dhydrogen-osr.cc97 HPhi* phi = phis->at(j); local
98 if (phi->HasMergedIndex()) {
99 osr_values_->at(phi->merged_index())->set_incoming_value(phi);
H A Dhydrogen-representation-changes.cc13 // 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
[all...]
H A Dhydrogen-uint32-analysis.cc84 // There is a phi use of this value from a phi that is not yet
102 // There is a phi use of this value from a phi that is not yet
115 // Check if all operands to the given phi are marked with kUint32 flag.
116 bool HUint32AnalysisPhase::CheckPhiOperands(HPhi* phi) { argument
117 if (!phi->CheckFlag(HInstruction::kUint32)) {
118 // This phi is not uint32 safe. No need to check operands.
122 for (int j = 0; j < phi->OperandCount(); j++) {
123 HValue* operand = phi
144 UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist) argument
177 HPhi* phi = phis_[i]; local
192 HPhi* phi = worklist.RemoveLast(); local
201 HPhi* phi = phis_[i]; 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/lib/CodeGen/
H A DUnreachableBlockElim.cpp188 MachineBasicBlock::iterator phi = BB->begin(); local
189 while (phi != BB->end() && phi->isPHI()) {
190 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2)
191 if (!preds.count(phi->getOperand(i).getMBB())) {
192 phi->RemoveOperand(i);
193 phi->RemoveOperand(i-1);
197 if (phi->getNumOperands() == 3) {
198 unsigned Input = phi->getOperand(1).getReg();
199 unsigned Output = phi
[all...]
/external/ltp/testcases/open_posix_testsuite/functional/semaphores/
H A Dsem_philosopher.c119 pthread_t phi[PH_NUM]; local
144 pthread_create(&phi[i], NULL, (void *)philosopher, &PhID[i]);
148 pthread_join(phi[i], NULL);
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DUnreachableBlockElim.cpp181 MachineBasicBlock::iterator phi = BB->begin(); local
182 while (phi != BB->end() && phi->isPHI()) {
183 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2)
184 if (!preds.count(phi->getOperand(i).getMBB())) {
185 phi->RemoveOperand(i);
186 phi->RemoveOperand(i-1);
190 if (phi->getNumOperands() == 3) {
191 unsigned Input = phi->getOperand(1).getReg();
192 unsigned Output = phi
[all...]
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
H A Dcodegen.ml67 * 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
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
H A Dcodegen.ml85 * 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
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
H A Dcodegen.ml115 * 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

Completed in 425 milliseconds

12345