| /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...] |
| /art/compiler/optimizing/ |
| ssa_type_propagation.cc | 37 static bool UpdateType(HPhi* phi) {
38 Primitive::Type existing = phi->GetType();
41 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) {
42 Primitive::Type input_type = phi->InputAt(i)->GetType();
45 phi->SetType(new_type);
59 HPhi* phi = it.Current()->AsPhi(); local
60 // Set the initial type for the phi. Use the non back edge input for reaching
62 phi->SetType(phi->InputAt(0)->GetType());
63 AddToWorklist(phi);
67 HPhi* phi = it.Current()->AsPhi(); local
90 HPhi* phi = it.Current()->GetUser()->AsPhi(); local
[all...] |
| ssa_phi_elimination.cc | 22 // Add to the worklist phis referenced by non-phi instructions.
26 HPhi* phi = it.Current()->AsPhi(); local
27 if (phi->HasEnvironmentUses()) {
28 // TODO: Do we want to keep that phi alive?
31 for (HUseIterator<HInstruction> it(phi->GetUses()); !it.Done(); it.Advance()) {
35 worklist_.Add(phi);
36 phi->SetLive();
38 phi->SetDead();
44 // Process the worklist by propagating liveness to phi inputs.
46 HPhi* phi = worklist_.Pop() local
82 HPhi* phi = worklist_.Pop(); local
[all...] |
| ssa_type_propagation.h | 35 void AddToWorklist(HPhi* phi);
36 void AddDependentInstructionsToWorklist(HPhi* phi);
|
| ssa_builder.cc | 36 HPhi* phi = it.Current()->AsPhi(); local
38 HInstruction* input = ValueOfLocal(block->GetPredecessors().Get(pred), phi->GetRegNumber());
39 phi->AddInput(input);
75 HPhi* phi = new (GetGraph()->GetArena()) HPhi( local
77 block->AddPhi(phi);
78 current_locals_->Put(local, phi);
109 HPhi* phi = new (GetGraph()->GetArena()) HPhi( local
113 phi->SetRawInputAt(i, value);
115 block->AddPhi(phi);
116 value = phi;
[all...] |
| /external/chromium_org/v8/src/ |
| 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) {
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...] |
| hydrogen-uint32-analysis.cc | 87 // There is a phi use of this value from a phi that is not yet
105 // There is a phi use of this value from a phi that is not yet
118 // Check if all operands to the given phi are marked with kUint32 flag.
119 bool HUint32AnalysisPhase::CheckPhiOperands(HPhi* phi) {
120 if (!phi->CheckFlag(HInstruction::kUint32)) {
121 // This phi is not uint32 safe. No need to check operands.
125 for (int j = 0; j < phi->OperandCount(); j++) {
126 HValue* operand = phi->OperandAt(j)
180 HPhi* phi = phis_[i]; local
195 HPhi* phi = worklist.RemoveLast(); local
204 HPhi* phi = phis_[i]; local
[all...] |
| 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->block()
[all...] |
| hydrogen-uint32-analysis.h | 26 INLINE(bool CheckPhiOperands(HPhi* phi));
27 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
|
| hydrogen-redundant-phi.cc | 5 #include "src/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);
|
| hydrogen-representation-changes.cc | 12 // Insert the representation change right before its use. For phi-uses we
118 HPhi* phi = phi_list->at(i); local
119 if (phi->representation().IsInteger32()) {
120 phi->SetFlag(HValue::kTruncatingToInt32);
121 } else if (phi->representation().IsSmi()) {
122 phi->SetFlag(HValue::kTruncatingToSmi);
123 phi->SetFlag(HValue::kTruncatingToInt32);
128 HPhi* phi = phi_list->at(i); local
130 if (phi->representation().IsSmiOrInteger32() &&
131 !phi->CheckUsesForFlag(HValue::kTruncatingToInt32, &value))
[all...] |
| hydrogen-mark-deoptimize.h | 14 // Compute DeoptimizeOnUndefined flag for phis. Any phi that can reach a use
28 void ProcessPhi(HPhi* phi);
|
| hydrogen-infer-types.cc | 32 HPhi* phi = block->phis()->at(j); local
33 worklist_.Add(phi, zone());
34 in_worklist_.Add(phi->id());
|
| hydrogen-bch.cc | 48 HLoopInformation* loop = data->phi()->block()->current_loop();
100 loop_header_ = data->phi()->block()->current_loop()->loop_header();
195 data->phi()->block()->current_loop()->loop_header();
285 HPhi* phi = bb->phis()->at(i); local
286 phi->DetectInductionVariable();
303 HPhi* phi = HPhi::cast(decomposition.base); local
305 if (!phi->IsInductionVariable()) continue;
306 InductionVariableData* data = phi->induction_variable_data();
320 if (!phi->IsLimitedInductionVariable()) continue;
324 phi->induction_variable_data()->AddCheck(check, limit)
339 HPhi* phi = bb->phis()->at(i); local
[all...] |
| hydrogen-osr.cc | 95 HPhi* phi = phis->at(j); local
96 if (phi->HasMergedIndex()) {
97 osr_values_->at(phi->merged_index())->set_incoming_value(phi);
|
| /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 | 171 // Cleanup PHI nodes.
174 // Prune unneeded PHI entries.
177 MachineBasicBlock::iterator phi = BB->begin(); local
178 while (phi != BB->end() && phi->isPHI()) {
179 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2)
180 if (!preds.count(phi->getOperand(i).getMBB())) {
181 phi->RemoveOperand(i);
182 phi->RemoveOperand(i-1);
186 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/chromium_org/v8/test/mjsunit/regress/ |
| regress-parseint.js | 8 // Use a phi to force radix into heap number representation.
|
| /external/chromium_org/v8/src/compiler/ |
| change-lowering-unittest.cc | 131 Node* phi = reduction.replacement(); local
133 EXPECT_THAT(phi,
202 Node* phi = reduction.replacement(); local
205 phi,
232 Node* phi = reduction.replacement(); local
235 phi,
261 Node* phi = reduction.replacement(); local
264 phi,
287 Node* phi = reduction.replacement(); local
290 phi,
313 Node* phi = reduction.replacement(); local
369 Node* phi = reduction.replacement(); local
398 Node* phi = reduction.replacement(); local
425 Node* phi = reduction.replacement(); local
452 Node* phi = reduction.replacement(); local
[all...] |
