| /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
|
| compare.ll | 1 ; There should be no phi nodes left.
2 ; RUN: opt < %s -jump-threading -S | not grep {phi i32}
20 %B = phi i32 [%v1, %T1], [12, %F1]
|
| /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 ]
|
| 2002-06-24-PHINode.ll | 1 ; -simplifycfg is not folding blocks if there is a PHI node involved. This
10 %X = phi i32 [ 7, %0 ] ; <i32> [#uses=1]
|
| PhiEliminate3.ll | 4 ; RUN: opt < %s -simplifycfg -S -phi-node-folding-threshold=1 | grep N:
5 ; RUN: opt < %s -simplifycfg -S -phi-node-folding-threshold=2 | not grep N:
6 ; RUN: opt < %s -simplifycfg -S -phi-node-folding-threshold=2 | grep M:
7 ; RUN: opt < %s -simplifycfg -S -phi-node-folding-threshold=7 | not grep M:
24 ; This phi should be foldable if threshold >= 2
25 %Wp = phi i32 [ %iajak, %P ], [ %ixjxk, %Q ]
29 ; This phi should be foldable if threshold >= 7
30 %W = phi i32 [ %Wp2, %N ], [ 2, %entry ]
|
| PhiBlockMerge.ll | 1 ; Test merging of blocks that only have PHI nodes in them
12 ; CHECK-NOT: phi
18 %Wp = phi i32 [ 0, %O ], [ 1, %Q ] ; <i32> [#uses=1]
21 ; CHECK: %W = phi i32
22 %W = phi i32 [ %Wp, %N ], [ 2, %0 ] ; <i32> [#uses=1]
|
| PhiEliminate.ll | 2 ; be able to fold PHI nodes into computation in common cases. Folding the PHI
7 ; RUN: not grep phi %t.xform
21 %B1 = phi i1 [ true, %0 ], [ false, %T ] ; <i1> [#uses=1]
22 %I6 = phi i32 [ %V, %0 ], [ 0, %T ] ; <i32> [#uses=1]
|
| /external/llvm/test/Verifier/ |
| PhiGrouping.ll | 1 ; RUN: not llvm-as < %s |& grep {PHI nodes not grouped at top}
13 %a = phi i32 [%i, %A], [%j, %B]
14 %x = add i32 %a, 0 ; Error, PHI's should be grouped!
15 %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
|
| rle-nonlocal.ll | 16 ; CHECK-NOT: %existingPHI = phi
17 ; CHECK: %DEAD = phi
18 %existingPHI = phi i32* [ %a, %block2 ], [ %b, %block3 ]
|
| /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/FrontendC/ |
| 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/SCCP/ |
| 2003-08-26-InvokeHandling.ll | 1 ; The PHI cannot be eliminated from this testcase, SCCP is mishandling invoke's!
2 ; RUN: opt < %s -sccp -S | grep phi
15 %X = phi i32 [ 0, %Entry ], [ 1, %Ok ], [ 0, %Inv ] ; <i32> [#uses=1]
|
| 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...] |
| lsr-quadratic-expand.ll | 8 %z = phi i64 [ 0, %entry ], [ %z3, %bb ]
9 %z1 = phi i16 [ undef, %entry ], [ %z6, %bb ]
10 %z2 = phi i32 [ 0, %entry ], [ %z8, %bb ]
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| no-iv-rewrite.ll | 19 ; CHECK: phi
20 ; CHECK: phi
21 ; CHECK-NOT: phi
28 %i.02 = phi i32 [ 0, %ph ], [ %iinc, %loop ]
29 %s.01 = phi i32 [ 0, %ph ], [ %sinc, %loop ]
39 %s.lcssa = phi i32 [ %sinc, %loop ]
43 %s.0.lcssa = phi i32 [ %s.lcssa, %exit ], [ 0, %entry ]
58 ; CHECK: phi
59 ; CHECK: phi
60 ; CHECK-NOT: phi
[all...] |
| 2003-09-23-NotAtTop.ll | 3 ; The indvar simplification code should ensure that the first PHI in the block
13 %NonIndvar = phi i32 [ 200, %0 ], [ %NonIndvarNext, %Loop ] ; <i32> [#uses=1]
14 %Canonical = phi i32 [ 0, %0 ], [ %CanonicalNext, %Loop ] ; <i32> [#uses=2]
|
| /external/llvm/test/Analysis/BasicAA/ |
| dag.ll | 8 ; CHECK: MustAlias: i8* %base, i8* %phi
9 ; CHECK: MustAlias: i8* %phi, i8* %wwa
10 ; CHECK: MustAlias: i8* %phi, i8* %wwb
11 ; CHECK: MustAlias: i16* %bigbase, i8* %phi
22 %first = phi i8* [ %wwa, %wa ], [ %wwb, %wb ]
32 %phi = phi i8* [ %xxa, %xa ], [ %xxb, %xb ]
34 store i8 0, i8* %phi
39 %loaded = load i8* %phi
|
| /external/llvm/test/Transforms/ADCE/ |
| 2003-04-25-PHIPostDominateProblem.ll | 1 ; THis testcase caused an assertion failure because a PHI node did not have
3 ; PHI node is dead, so we just avoid patching up dead PHI nodes.
14 %k.1 = phi i32 [ %k.0, %endif ], [ 0, %entry ] ; <i32> [#uses=1]
28 %k.0 = phi i32 [ %dec, %else ], [ 0, %then ] ; <i32> [#uses=1]
|
| /packages/apps/Bluetooth/res/values-vi/ |
| strings_pbap.xml | 4 <string name="pbap_session_key_dialog_title" msgid="3580996574333882561">"Nh?p khoá phiên cho %1$s"</string>
5 <string name="pbap_session_key_dialog_header" msgid="2772472422782758981">"Yêu c?u khoá phiên c?a Bluetooth"</string>
7 <string name="pbap_authentication_timeout_message" msgid="4166979525521902687">"?ă h?t th?i gian ch? nh?p khoá phiên v?i %1$s"</string>
9 <string name="auth_notif_title" msgid="7599854855681573258">"Khoá Phiên"</string>
10 <string name="auth_notif_message" msgid="6667218116427605038">"Nh?p khoá phiên cho %1$s"</string>
|
| /external/llvm/test/Other/ |
| 2002-03-11-ConstPropCrash.ll | 4 ; destruction of PHI nodes, which invalidates the iterator!
15 %reg137 = phi i32 [ %reg140, %bb2 ], [ 12, %0 ] ; <i32> [#uses=1]
16 %reg138 = phi i32 [ %reg139, %bb2 ], [ 0, %0 ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| dead-phi.ll | 1 ; RUN: opt < %s -loop-reduce -S | grep phi | count 1
8 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ]
11 %j = phi i32 [ 0, %entry ], [ %j.y, %loop ]
|
