/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/chromium_org/v8/src/ |
hydrogen-mark-deoptimize.cc | 36 HPhi* phi = phi_list->at(i); local 37 if (phi->CheckFlag(HValue::kAllowUndefinedAsNaN) && 38 !phi->CheckUsesForFlag(HValue::kAllowUndefinedAsNaN)) { 39 ProcessPhi(phi); 45 void HMarkDeoptimizeOnUndefinedPhase::ProcessPhi(HPhi* phi) { 46 ASSERT(phi->CheckFlag(HValue::kAllowUndefinedAsNaN)); 49 // Push the phi onto the worklist 50 phi->ClearFlag(HValue::kAllowUndefinedAsNaN); 51 worklist_.Add(phi, zone()); 53 // Process all phis that can reach this phi [all...] |
hydrogen-uint32-analysis.cc | 74 // There is a phi use of this value from a phi that is not yet 92 // There is a phi use of this value from a phi that is not yet 105 // Check if all operands to the given phi are marked with kUint32 flag. 106 bool HUint32AnalysisPhase::CheckPhiOperands(HPhi* phi) { 107 if (!phi->CheckFlag(HInstruction::kUint32)) { 108 // This phi is not uint32 safe. No need to check operands. 112 for (int j = 0; j < phi->OperandCount(); j++) { 113 HValue* operand = phi->OperandAt(j) 167 HPhi* phi = phis_[i]; local 182 HPhi* phi = worklist.RemoveLast(); local 191 HPhi* phi = phis_[i]; local [all...] |
hydrogen-dce.cc | 68 HPhi* phi = block->phis()->at(j); local 69 if (phi->CannotBeEliminated() && MarkLive(NULL, phi)) { 70 worklist.Add(phi, zone()); 107 HPhi* phi = block->phis()->at(j); local 108 if (!phi->CheckFlag(HValue::kIsLive)) { 109 worklist.Add(phi, zone()); 111 phi->ClearFlag(HValue::kIsLive); 116 // Process phis separately to avoid simultaneously mutating the phi list. 118 HPhi* phi = worklist.RemoveLast() local [all...] |
hydrogen-uint32-analysis.h | 49 INLINE(bool CheckPhiOperands(HPhi* phi)); 50 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
|
hydrogen-redundant-phi.cc | 28 #include "hydrogen-redundant-phi.h" 47 HPhi* phi = block->phis()->at(j); local 48 HValue* replacement = phi->GetRedundantReplacement(); 50 // Remember phi to avoid concurrent modification of the block's phis. 51 redundant_phis.Add(phi, zone()); 52 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) {
|
hydrogen-representation-changes.cc | 35 // Insert the representation change right before its use. For phi-uses we 106 HPhi* phi = phi_list->at(i); local 107 if (phi->representation().IsInteger32()) { 108 phi->SetFlag(HValue::kTruncatingToInt32); 109 } else if (phi->representation().IsSmi()) { 110 phi->SetFlag(HValue::kTruncatingToSmi); 115 HPhi* phi = phi_list->at(i); local 116 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) { 117 // If a Phi is used as a non-truncating int32 or as a double, 122 if ((phi->representation().IsInteger32() & [all...] |
hydrogen-mark-deoptimize.h | 37 // Compute DeoptimizeOnUndefined flag for phis. Any phi that can reach a use 51 void ProcessPhi(HPhi* phi);
|
hydrogen-infer-types.cc | 55 HPhi* phi = block->phis()->at(j); local 56 worklist_.Add(phi, zone()); 57 in_worklist_.Add(phi->id());
|
hydrogen-minus-zero.cc | 65 HPhi* phi = HPhi::cast(current); local 66 for (int i = 0; i < phi->OperandCount(); ++i) { 67 PropagateMinusZeroChecks(phi->OperandAt(i));
|
hydrogen-infer-representation.cc | 43 // (1) Initialize bit vectors and count real uses. Each phi gets a 56 // phi is connected to another phi if its value is used either directly or 64 HPhi* phi = phi_list->at(i); local 65 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) { 107 // Simplify constant phi inputs where possible. 113 // Use the phi reachability information from step 2 to 114 // sum up the non-phi use counts of all connected phis. 116 HPhi* phi = phi_list->at(i); local 122 if (index != i) phi->AddNonPhiUsesFrom(it_use); // Don't count twice 153 HPhi* phi = phis->at(j); local [all...] |
hydrogen-bch.cc | 71 HLoopInformation* loop = data->phi()->block()->current_loop(); 122 loop_header_ = data->phi()->block()->current_loop()->loop_header(); 217 data->phi()->block()->current_loop()->loop_header(); 314 HPhi* phi = bb->phis()->at(i); local 315 phi->DetectInductionVariable(); 332 HPhi* phi = HPhi::cast(decomposition.base); local 334 if (!phi->IsInductionVariable()) continue; 335 InductionVariableData* data = phi->induction_variable_data(); 350 if (!phi->IsLimitedInductionVariable()) continue; 354 phi->induction_variable_data()->AddCheck(check, limit) 369 HPhi* phi = bb->phis()->at(i); local [all...] |
hydrogen-osr.cc | 119 HPhi* phi = phis->at(j); local 120 ASSERT(phi->HasMergedIndex()); 121 osr_values_->at(phi->merged_index())->set_incoming_value(phi);
|
hydrogen-escape-analysis.cc | 93 HPhi* phi = NewPhiAndInsert(block, operand, index); local 94 state->SetOperandAt(index, phi); 112 // Insert a newly created phi into the given block and fill all incoming 117 HPhi* phi = new(zone) HPhi(HPhi::kInvalidMergedIndex, zone); local 119 phi->AddInput(incoming_value); 121 block->AddPhi(phi); 122 return phi; 256 // Phi already exists, add operand. 257 HPhi* phi = HPhi::cast(succ_operand); local 258 phi->SetOperandAt(succ->PredecessorIndexOf(block), operand) 261 HPhi* phi = NewPhiAndInsert(succ, succ_operand, index); local [all...] |
/dalvik/dx/tests/083-ssa-phi-placement/ |
run | 18 dx --dump --ssa-blocks --ssa-step=phi-placement Blort.class
|
/frameworks/base/media/tests/audiotests/ |
shared_mem_test.h | 16 void Generate(short *buffer, long bufferSz, long amplitude, unsigned long &phi, long dPhi); 18 short ComputeSine(long amplitude, long phi);
|
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) 142 buffer[i0] = ComputeSine( amplitude, phi); 143 phi += dPhi; 153 short AudioTrackTest::ComputeSine(long amplitude, long phi) 159 sample = (amplitude*sin1024[(phi>>22) & 0x3ff]) >> 15; 161 l0 = (phi>>12) & 0x3ff; // 2^20 * x / (2*pi) 162 l1 = (amplitude*sin1024[((phi>>22) + 256) & 0x3ff]) >> 15; // 2^15*cosin 177 double phi = 0; local [all...] |
/external/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/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
RSAKeyPairGenerator.java | 30 BigInteger p, q, n, d, e, pSub1, qSub1, phi; local 120 phi = p; 122 q = phi; 127 phi = pSub1.multiply(qSub1); 132 d = e.modInverse(phi);
|
/external/qemu/distrib/sdl-1.2.15/Xcode/TemplatesForXcodeLeopard/SDL OpenGL Application/atlantis/ |
atlantis.h | 47 float x, y, z, phi, theta, psi, v; member in struct:_fishRec
|
/external/qemu/distrib/sdl-1.2.15/Xcode/TemplatesForXcodeSnowLeopard/SDL OpenGL Application/atlantis/ |
atlantis.h | 47 float x, y, z, phi, theta, psi, v; member in struct:_fishRec
|
/external/qemu/distrib/sdl-1.2.15/Xcode/TemplatesForXcodeTiger/SDL OpenGL Application/atlantis/ |
atlantis.h | 47 float x, y, z, phi, theta, psi, v; member in struct:_fishRec
|
/external/llvm/examples/BrainF/ |
BrainF.h | 73 void readloop(PHINode *phi, BasicBlock *oldbb,
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
nv50_ir_bb.cpp | 74 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...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
nv50_ir_bb.cpp | 74 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...] |