HomeSort by relevance Sort by last modified time
    Searched defs:phi (Results 1 - 25 of 122) sorted by null

1 2 3 4 5

  /external/swiftshader/third_party/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/
live_ranges_test.cc 143 * 22: phi
163 // Last use is the phi at the return block so instruction is live until
179 // Last use is the phi at the return block.
183 // Test for the phi.
209 * 14: phi
238 // Last use is the loop phi so instruction is live until
259 // Test for the phi.
283 * 10: phi
294 * We want to make sure the phi at 10 has a lifetime hole after the add at 20.
314 // Last use is the loop phi so instruction is live unti
320 HPhi* phi = liveness.GetInstructionFromSsaIndex(1)->AsPhi(); local
420 HPhi* phi = liveness.GetInstructionFromSsaIndex(4)->AsPhi(); local
    [all...]
select_generator_test.cc 59 HPhi* phi = new (GetAllocator()) HPhi(GetAllocator(), 0, 0, DataType::Type::kInt32); local
60 return_block_->AddPhi(phi);
61 phi->AddInput(instr);
62 phi->AddInput(const1);
ssa_phi_elimination.cc 45 // Add to the worklist phis referenced by non-phi instructions.
48 HPhi* phi = inst_it.Current()->AsPhi(); local
49 if (phi->IsDead()) {
53 bool keep_alive = (graph_->IsDebuggable() && phi->HasEnvironmentUses());
55 for (const HUseListNode<HInstruction*>& use : phi->GetUses()) {
64 worklist.push_back(phi);
66 phi->SetDead();
68 initially_live.insert(phi);
74 // Process the worklist by propagating liveness to phi inputs.
76 HPhi* phi = worklist.back() local
98 HPhi* phi; local
150 HPhi* phi = worklist.back(); local
    [all...]
select_generator.cc 74 // Returns nullptr if `block` has either no phis or there is more than one phi
75 // with different inputs at `index1` and `index2`. Otherwise returns that phi.
81 HPhi* phi = it.Current()->AsPhi(); local
82 if (phi->InputAt(index1) != phi->InputAt(index2)) {
84 // First phi with different inputs for the two indices found.
85 select_phi = phi;
142 HPhi* phi = GetSingleChangedPhi(merge_block, predecessor_index_true, predecessor_index_false); local
149 } else if (phi != nullptr) {
150 true_value = phi->InputAt(predecessor_index_true)
    [all...]
loop_optimization_test.cc 219 HPhi* phi = new (GetAllocator()) HPhi(GetAllocator(), 0, 0, DataType::Type::kInt32); local
220 HInstruction* add = new (GetAllocator()) HAdd(DataType::Type::kInt32, phi, parameter_);
221 header->AddPhi(phi);
224 phi->AddInput(add);
225 phi->AddInput(parameter_);
234 // Check that after optimizations in BuildDominatorTree()/SimplifyCFG() phi inputs
236 for (size_t i = 0, e = phi->InputCount(); i < e; i++) {
237 HInstruction* input = phi->InputAt(i);
  /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 (&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) {
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...]
HarmonicFitter.java 29 * 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]; local
117 return a * FastMath.cos(omega * x + phi);
124 final double phi = parameters[2]; local
125 final double alpha = omega * x + phi;
  /external/deqp-deps/SPIRV-Tools/test/opt/
value_table_test.cpp 458 // Test that a phi where the operands have the same value assigned that value
459 // to the result of the phi.
493 Instruction* phi = context->get_def_use_mgr()->GetDef(16); local
495 EXPECT_EQ(vtable.GetValueNumber(inst1), vtable.GetValueNumber(phi));
498 // When the values for the inputs to a phi do not match, then the phi should
534 Instruction* phi = context->get_def_use_mgr()->GetDef(17); local
536 EXPECT_NE(vtable.GetValueNumber(inst1), vtable.GetValueNumber(phi));
537 EXPECT_NE(vtable.GetValueNumber(inst2), vtable.GetValueNumber(phi));
540 // Test that a phi node in a loop header gets a new value because one of it
    [all...]
instruction_test.cpp 921 Instruction* phi = context->get_def_use_mgr()->GetDef(9); local
922 EXPECT_NE(phi, nullptr);
923 EXPECT_FALSE(phi->IsValidBasePointer());
949 Instruction* phi = context->get_def_use_mgr()->GetDef(9); local
950 EXPECT_NE(phi, nullptr);
951 EXPECT_FALSE(phi->IsValidBasePointer());
977 Instruction* phi = context->get_def_use_mgr()->GetDef(9); local
978 EXPECT_NE(phi, nullptr);
979 EXPECT_TRUE(phi->IsValidBasePointer());
1005 Instruction* phi = context->get_def_use_mgr()->GetDef(9); local
    [all...]
  /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/mesa3d/src/compiler/nir/
nir_opt_conditional_discard.c 60 * 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) {
nir_opt_remove_phis.c 52 * 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 has t
75 nir_phi_instr *phi = nir_instr_as_phi(instr); local
    [all...]
nir_opt_peephole_select.c 39 * phi
41 * phi
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->dest.ssa.bit_size, phi->dest.ssa.name)
    [all...]
nir_propagate_invariant.c 129 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) {
nir_liveness.c 34 * 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 = nir_instr_as_phi(instr); local
    [all...]
nir_opt_copy_propagate.c 284 nir_phi_instr *phi = nir_instr_as_phi(instr); local
285 assert(phi->dest.is_ssa);
286 unsigned num_components = phi->dest.ssa.num_components;
287 nir_foreach_phi_src(src, phi) {
  /external/swiftshader/third_party/SPIRV-Tools/test/opt/
value_table_test.cpp 458 // Test that a phi where the operands have the same value assigned that value
459 // to the result of the phi.
493 Instruction* phi = context->get_def_use_mgr()->GetDef(16); local
495 EXPECT_EQ(vtable.GetValueNumber(inst1), vtable.GetValueNumber(phi));
498 // When the values for the inputs to a phi do not match, then the phi should
534 Instruction* phi = context->get_def_use_mgr()->GetDef(17); local
536 EXPECT_NE(vtable.GetValueNumber(inst1), vtable.GetValueNumber(phi));
537 EXPECT_NE(vtable.GetValueNumber(inst2), vtable.GetValueNumber(phi));
540 // Test that a phi node in a loop header gets a new value because one of it
    [all...]
  /external/llvm/lib/CodeGen/
UnreachableBlockElim.cpp 182 // Cleanup PHI nodes.
185 // Prune unneeded PHI entries.
188 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)
    [all...]
  /external/ltp/testcases/open_posix_testsuite/functional/semaphores/
sem_philosopher.c 119 pthread_t phi[PH_NUM]; local
144 pthread_create(&phi[i], NULL, (void *)philosopher, &PhID[i]);
148 pthread_join(phi[i], NULL);
  /external/mesa3d/src/gallium/drivers/freedreno/ir3/
ir3_nir_lower_if_else.c 74 /* The only uses of this definition must be phi's in the
114 * the end of the block w/ a phi..
133 nir_phi_instr *phi = nir_instr_as_phi(instr); local
134 if (!valid_dest(block, &phi->dest))
212 /* If the block is empty, then it certainly doesn't have any phi nodes,
245 * statement containing only moves to phi nodes in this block. We can
246 * just remove that entire CF node and replace all of the phi nodes with
266 nir_phi_instr *phi = nir_instr_as_phi(instr); local
272 assert(exec_list_length(&phi->srcs) == 2);
273 nir_foreach_phi_src(src, phi) {
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
UnreachableBlockElim.cpp 175 // Cleanup PHI nodes.
178 // Prune unneeded PHI entries.
181 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)
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
UnreachableBlockElim.cpp 183 // Cleanup PHI nodes.
186 // Prune unneeded PHI entries.
189 MachineBasicBlock::iterator phi = BB->begin(); local
190 while (phi != BB->end() && phi->isPHI()) {
191 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2)
192 if (!preds.count(phi->getOperand(i).getMBB())) {
193 phi->RemoveOperand(i);
194 phi->RemoveOperand(i-1);
198 if (phi->getNumOperands() == 3)
    [all...]
  /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/aac/libSACdec/src/
sac_tsd.cpp 336 const FIXP_STP *phi = &phiTsd[pTsdData->bsTsdTrPhaseData[ts]]; local
343 cplxMult(&tempReal, &tempImag, pVdirectReal[k], pVdirectImag[k], *phi);

Completed in 1300 milliseconds

1 2 3 4 5