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

1234

/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/chromium_org/v8/src/
H A Dhydrogen-mark-deoptimize.cc13 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 Dhydrogen-dce.cc57 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 Dhydrogen-infer-types.cc32 HPhi* phi = block->phis()->at(j); local
33 worklist_.Add(phi, zone());
34 in_worklist_.Add(phi->id());
H A Dhydrogen-redundant-phi.cc5 #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);
H A Dhydrogen-infer-representation.cc20 // (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 Dhydrogen-osr.cc95 HPhi* phi = phis->at(j); local
96 if (phi->HasMergedIndex()) {
97 osr_values_->at(phi->merged_index())->set_incoming_value(phi);
H A Dhydrogen-representation-changes.cc12 // 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
[all...]
H A Dhydrogen-uint32-analysis.cc87 // 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) { argument
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
147 UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist) argument
180 HPhi* phi = phis_[i]; local
195 HPhi* phi = worklist.RemoveLast(); local
204 HPhi* phi = phis_[i]; local
[all...]
H A Dhydrogen-range-analysis.cc50 // Process phi instructions.
52 HPhi* phi = block->phis()->at(i); local
53 InferRange(phi);
225 HPhi* phi = HPhi::cast(value); local
226 for (int i = 0; i < phi->OperandCount(); ++i) {
227 AddToWorklist(phi->OperandAt(i));
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DDeadCodeRemover.java257 public void visitPhiInsn (PhiInsn phi) { argument
259 if (!hasSideEffect(phi)) {
260 noSideEffectRegs.set(phi.getResult().getReg());
/external/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp177 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) {
187 unsigned Input = phi->getOperand(1).getReg();
188 unsigned Output = phi
[all...]
/external/qemu/distrib/sdl-1.2.15/Xcode/TemplatesForXcodeLeopard/SDL OpenGL Application/atlantis/
H A Datlantis.h47 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/
H A Datlantis.h47 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/
H A Datlantis.h47 float x, y, z, phi, theta, psi, v; member in struct:_fishRec
/external/chromium_org/third_party/WebKit/Source/wtf/text/
H A DWTFStringTest.cpp107 const double phi = 1.6180339887498948482; local
108 testNumberToStringECMAScript(phi, "1.618033988749895");
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-phi-reducer.cc10 #include "src/compiler/phi-reducer.h"
32 void CheckReduce(Node* expect, Node* phi) { argument
34 Reduction reduction = reducer.Reduce(phi);
35 if (expect == phi) {
/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
/external/chromium_org/third_party/WebKit/Source/platform/transforms/
H A DTransformOperations.cpp116 double phi = atan2(px, py); local
119 candidates[0] = phi; // The element at 0deg (maximum x)
/external/chromium_org/v8/src/compiler/
H A Dchange-lowering-unittest.cc131 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...]
H A Dchange-lowering.cc114 Node* phi = graph()->NewNode( local
118 return Replace(phi);
154 Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), heap_number, local
157 return Replace(phi);
180 Node* phi = graph()->NewNode( local
184 return Replace(phi);
204 Node* phi = local
207 return Replace(phi);
232 Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), smi, local
235 return Replace(phi);
[all...]
H A Dgraph-builder.cc156 Node* phi = builder_->NewPhi(1, values()->at(i), control); local
157 values()->at(i) = phi;
H A Dinstruction-selector-unittest.cc228 Node* phi = m.Phi(type, param0, param1); local
229 m.Return(phi);
231 EXPECT_EQ(s.IsDouble(phi->id()), s.IsDouble(param0->id()));
232 EXPECT_EQ(s.IsDouble(phi->id()), s.IsDouble(param1->id()));
248 Node* phi = m.Phi(type, param0, param1); local
249 m.Return(phi);
251 EXPECT_EQ(s.IsReference(phi->id()), s.IsReference(param0->id()));
252 EXPECT_EQ(s.IsReference(phi->id()), s.IsReference(param1->id()));

Completed in 390 milliseconds

1234