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

1 2 3 4 5 6 7 8 91011>>

  /art/compiler/optimizing/
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.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...]
  /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-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-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...]
  /external/llvm/test/Transforms/JumpThreading/
degenerate-phi.ll 5 ; "%phi = phi i16" when it removes all edges leading to %unreachable.
16 %phi = phi i16 [ %add, %unreachable ], [ 0, %next ]
17 %add = add i16 0, %phi
18 %cmp = icmp slt i16 %phi, 0
  /external/clang/test/CodeGen/
2002-03-14-BrokenPHINode.c 3 /* GCC was generating PHI nodes with an arity < #pred of the basic block the
4 * PHI node lived in. This was breaking LLVM because the number of entries
5 * in a PHI node must equal the number of predecessors for a basic block.
  /external/llvm/test/Transforms/SimplifyCFG/
duplicate-phis.ll 1 ; RUN: opt < %s -instcombine -simplifycfg -S | grep " = phi " | count 1
3 ; instcombine should sort the PHI operands so that simplifycfg can see the
14 %a = phi i32 [ 2, %true ], [ 5, %entry ]
15 %b = phi i32 [ 5, %entry ], [ 2, %true ]
  /external/llvm/test/Verifier/
PhiGrouping.ll 2 ; CHECK: PHI nodes not grouped at top
12 %a = phi i32 [%i, %A], [%j, %B]
13 %x = add i32 %a, 0 ; Error, PHI's should be grouped!
14 %b = phi i32 [%i, %A], [%j, %B]
  /external/llvm/test/Transforms/GVN/
phi-translate-partial-alias.ll 7 ; if phi-translation is ignored.
11 ; CHECK: %l0 = load i8* %phi
13 ; CHECK: %l1 = load i8* %phi
19 %phi = phi i8* [ %begin, %entry ], [ %next, %loop ]
20 %l0 = load i8* %phi
22 %l1 = load i8* %phi
23 %next = getelementptr inbounds i8* %phi, i8 %l1
  /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);
  /external/chromium_org/v8/test/cctest/compiler/
test-phi-reducer.cc 10 #include "src/compiler/phi-reducer.h"
32 void CheckReduce(Node* expect, Node* phi) {
34 Reduction reduction = reducer.Reduce(phi);
35 if (expect == phi) {
55 Node* Phi(Node* a) {
56 return SetSelfReferences(graph.NewNode(common.Phi(kMachAnyTagged, 1), a));
59 Node* Phi(Node* a, Node* b) {
61 graph.NewNode(common.Phi(kMachAnyTagged, 2), a, b));
64 Node* Phi(Node* a, Node* b, Node* c) {
66 graph.NewNode(common.Phi(kMachAnyTagged, 3), a, b, c))
    [all...]
  /external/llvm/test/CodeGen/Hexagon/
postinc-load.ll 11 %lsr.iv = phi i32 [ %lsr.iv.next, %for.body ], [ 10, %entry ]
12 %arrayidx.phi = phi i32* [ %a, %entry ], [ %arrayidx.inc, %for.body ]
13 %arrayidx1.phi = phi i16* [ %b, %entry ], [ %arrayidx1.inc, %for.body ]
14 %sum.03 = phi i32 [ 0, %entry ], [ %add2, %for.body ]
15 %0 = load i32* %arrayidx.phi, align 4
16 %1 = load i16* %arrayidx1.phi, align 2
20 %arrayidx.inc = getelementptr i32* %arrayidx.phi, i32 1
21 %arrayidx1.inc = getelementptr i16* %arrayidx1.phi, i32
    [all...]
postinc-store.ll 11 %lsr.iv = phi i32 [ %lsr.iv.next, %for.body ], [ 10, %entry ]
12 %arrayidx.phi = phi i32* [ %a, %entry ], [ %arrayidx.inc, %for.body ]
13 %arrayidx1.phi = phi i16* [ %b, %entry ], [ %arrayidx1.inc, %for.body ]
14 %0 = load i32* %arrayidx.phi, align 4
15 %1 = load i16* %arrayidx1.phi, align 2
19 store i32 %add3, i32* %arrayidx.phi, align 4
21 %arrayidx.inc = getelementptr i32* %arrayidx.phi, i32 1
22 %arrayidx1.inc = getelementptr i16* %arrayidx1.phi, i32
    [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/llvm/test/ExecutionEngine/
2003-06-05-PHIBug.ll 12 %A = phi i32 [ %X, %entry ] ; <i32> [#uses=0]
13 %B = phi i32 [ %X, %entry ] ; <i32> [#uses=0]
14 %C = phi i32 [ %X, %entry ] ; <i32> [#uses=1]
2003-05-11-PHIRegAllocBug.ll 11 %x = phi i32 [ 4, %entry ], [ 27, %then ] ; <i32> [#uses=0]
12 %result = phi i32 [ 32, %then ], [ 0, %entry ] ; <i32> [#uses=0]
  /external/llvm/test/ExecutionEngine/MCJIT/
2003-06-05-PHIBug.ll 12 %A = phi i32 [ %X, %entry ] ; <i32> [#uses=0]
13 %B = phi i32 [ %X, %entry ] ; <i32> [#uses=0]
14 %C = phi i32 [ %X, %entry ] ; <i32> [#uses=1]
2003-05-11-PHIRegAllocBug.ll 11 %x = phi i32 [ 4, %entry ], [ 27, %then ] ; <i32> [#uses=0]
12 %result = phi i32 [ 32, %then ], [ 0, %entry ] ; <i32> [#uses=0]
  /external/llvm/test/Transforms/SCCP/
apint-basictest2.ll 2 ; and phi instruction should be eliminated.
4 ; RUN: opt < %s -sccp -S | not grep phi
15 %Ret = phi i128 [%Val, %BB1], [1, %BB2]
  /external/llvm/test/CodeGen/X86/
2009-04-27-CoalescerAssert.ll 104 store i32 %.SV194.phi, i32* %.SV196.phi, align 4
105 %26 = getelementptr %struct.Macroblock* %.load17.SV.phi, i64 %.load36.SV.phi, i32 29 ; <i32*> [#uses=1]
107 store i32 %27, i32* %.load67.SV.phi, align 4
119 store i32 %.SV198.phi, i32* %.SV200.phi, align 4
120 %31 = getelementptr %struct.Macroblock* %.load16.SV.phi, i64 %.load35.SV.phi, i32 26 ; <i32*> [#uses=2]
122 store i32 %32, i32* %.load66.SV.phi, align
    [all...]
  /external/chromium_org/android_webview/java/strings/translations/
android_webview_strings_vi.xtb 2 <translation id="8916631167640856213">Ch?c n?ng này không ???c h? tr? trong phiên b?n này c?a Android.</translation>
  /external/llvm/test/Transforms/LowerInvoke/
lowerinvoke.ll 12 %phi = phi i32 [ 99, %entry ]
14 ret i32 %phi
24 ; CHECK-NOT: phi
  /external/llvm/test/Transforms/SLPVectorizer/X86/
phi_landingpad.ll 17 %x1 = phi double [ undef, %entry ], [ undef, %inner ]
18 %y1 = phi double [ undef, %entry ], [ undef, %inner ]
24 phi double [ %x0, %inner ], [ %x1, %lpad ]
25 phi double [ %y0, %inner ], [ %y1, %lpad ]
  /external/llvm/test/Transforms/InstSimplify/
dead-code-removal.ll 7 ; CHECK-NOT: phi
9 %2 = phi i32 [ %3, %1 ], [ undef, %0 ]

Completed in 447 milliseconds

1 2 3 4 5 6 7 8 91011>>