/external/v8/src/crankshaft/ |
H A D | 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) { 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 D | 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 [all...] |
H A D | hydrogen-infer-types.cc | 32 HPhi* phi = block->phis()->at(j); local 33 worklist_.Add(phi, zone()); 34 in_worklist_.Add(phi->id());
|
H A D | hydrogen-redundant-phi.cc | 5 #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 D | 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 142 HPhi* phi = phis->at(j); local [all...] |
H A D | hydrogen-osr.cc | 96 HPhi* phi = phis->at(j); local 97 if (phi->HasMergedIndex()) { 98 osr_values_->at(phi->merged_index())->set_incoming_value(phi);
|
H A D | hydrogen-representation-changes.cc | 12 // 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 D | hydrogen-uint32-analysis.cc | 83 // 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 D | hydrogen-range-analysis.cc | 50 // Process phi instructions. 52 HPhi* phi = block->phis()->at(i); local 53 InferRange(phi); 219 HPhi* phi = HPhi::cast(value); local 220 for (int i = 0; i < phi->OperandCount(); ++i) { 221 AddToWorklist(phi->OperandAt(i));
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
H A D | 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) { 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 φ [all...] |
H A D | 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 [all...] |
/external/llvm/unittests/Transforms/Utils/ |
H A D | Local.cpp | 29 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/v8/test/unittests/compiler/ |
H A D | diamond-unittest.cc | 121 Node* phi = d.Phi(types[i], p1, p2); local 127 EXPECT_THAT(phi, IsPhi(types[i], p1, p2, d.merge));
|
H A D | js-intrinsic-lowering-unittest.cc | 120 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,
|
H A D | dead-code-elimination-unittest.cc | 193 Node* const phi = graph()->NewNode( local 197 EXPECT_CALL(editor, Replace(phi, v0)); 220 Node* const phi = graph()->NewNode( local 225 EXPECT_CALL(editor, Revisit(phi)); 230 EXPECT_THAT(phi, 278 Node* const phi = graph()->NewNode( local 283 EXPECT_CALL(editor, Replace(phi, v0)); 307 Node* const phi = graph()->NewNode( local 312 EXPECT_CALL(editor, Revisit(phi)); 317 EXPECT_THAT(phi, [all...] |
/external/libvncserver/test/ |
H A D | 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/dexmaker/src/dx/java/com/android/dx/ssa/ |
H A D | DeadCodeRemover.java | 257 public void visitPhiInsn (PhiInsn phi) { argument 259 if (!hasSideEffect(phi)) { 260 noSideEffectRegs.set(phi.getResult().getReg());
|
H A D | SsaRenamer.java | 475 public void visitPhiInsn(PhiInsn phi) { argument 476 /* don't process sources for phi's */ 477 processResultReg(phi); 583 * All insns that are not move or phi insns have their source registers 625 * Updates the phi insns in successor blocks with operands based 639 * Never add a version 0 register as a phi
|
/external/llvm/lib/CodeGen/ |
H A D | UnreachableBlockElim.cpp | 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) { 184 unsigned Input = phi->getOperand(1).getReg(); 185 unsigned Output = phi [all...] |
/external/v8/test/cctest/compiler/ |
H A D | test-graph-visualizer.cc | 36 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);
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
H A D | 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
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
H A D | 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
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
H A D | 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
|
/external/llvm/examples/BrainF/ |
H A D | BrainF.cpp | 180 void BrainF::readloop(PHINode *phi, BasicBlock *oldbb, BasicBlock *testbb, argument 415 if (!phi) { 427 //%head.%d = phi i8 *[%head.%d, %main.%d], [%head.%d, %main.%d] 428 //Finish phi made at beginning of loop 429 phi->addIncoming(curhead, builder->GetInsertBlock()); 430 Value *head_0 = phi; 446 //%head.%d = phi i8 *[%head.%d, %main.%d] 460 if (phi) {
|
/external/v8/src/compiler/ |
H A D | loop-peeling.cc | 66 // | Merge <------phi 249 if (input != inputs[0]) { // Non-redundant phi. 252 Node* phi = graph->NewNode(op, backedges + 1, &inputs[0]); local 253 node->ReplaceInput(0, phi); 314 Node* phi = local 317 for (Edge edge : value_edges) edge.UpdateTo(phi);
|