| /external/llvm/test/Transforms/LoopStrengthReduce/X86/ |
| 2011-11-29-postincphi.ll | 3 ; PR11431: handle a phi operand that is replaced by a postinc user.
4 ; LSR first expands %t3 to %t2 in %phi
5 ; LSR then expands %t2 in %phi into two decrements, one on each loop exit.
24 %t0 = phi i64 [ 0, %bb ], [ %t3, %bb4 ]
25 %t2 = phi i64 [ 1, %bb ], [ %t5, %bb4 ]
34 %phi = phi i64 [ %t3, %bb1 ], [ %t2, %bb4 ]
35 ret i64 %phi
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| phi-hang.ll | 9 %tmp = phi i32 [ 1, %bb ], [ %tmp7, %bb5 ]
10 %tmp2 = phi i32 [ %arg, %bb ], [ %tmp9, %bb5 ]
20 %tmp6 = phi i32 [ 0, %bb4 ], [ %tmp, %bb1 ]
21 %tmp7 = phi i32 [ 0, %bb4 ], [ %tmp6, %bb1 ]
22 %tmp8 = phi i32 [ 0, %bb4 ], [ %tmp, %bb1 ]
37 %tmp = phi i32 [ 0, %bb ], [ %tmp5, %bb1 ]
38 %tmp2 = phi i32 [ 0, %bb ], [ 1, %bb1 ]
39 %tmp3 = phi i32 [ 0, %bb ], [ %tmp4, %bb1 ]
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| 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 ]
|
| SpeculativeExec.ll | 1 ; RUN: opt < %s -simplifycfg -phi-node-folding-threshold=2 -S | FileCheck %s
26 %tmp4 = phi i32 [ %b, %entry ], [ %a, %bb1 ], [ %tmp3, %bb2 ]
42 %c = phi i8 [%b, %bb_true], [%a, %bb_false]
64 %x1 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 1 to i8*), %then ]
65 %x2 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 2 to i8*), %then ]
66 %x3 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 3 to i8*), %then ]
67 %x4 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 4 to i8*), %then ]
68 %x5 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 5 to i8*), %then ]
69 %x6 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 6 to i8*), %then ]
70 %x7 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 7 to i8*), %then
[all...] |
| 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]
|
| PhiBlockMerge2.ll | 1 ; Test merging of blocks that only have PHI nodes in them. This tests the case
2 ; where the mergedinto block doesn't have any PHI nodes, and is in fact
19 %W = phi i32 [0, %0], [1, %Q], [2, %P]
|
| /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/chromium_org/v8/src/ |
| 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...] |
| /frameworks/base/media/tests/audiotests/ |
| 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/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]
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| 2011-10-14-IntPtr.ll | 3 ; Test SCEVExpander reusing a phi->gep->phi IV when SCEV "wrongly"
9 ; CHECK: phi
10 ; CHECK-NOT: phi
23 %ptr.0157 = phi i8* [ %add.ptr96, %for.body83 ], [ null, %for.end ]
|
| 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 ]
|
| /packages/apps/Bluetooth/res/values-vi/ |
| strings_map.xml | 4 <string name="map_session_key_dialog_title" msgid="4357431314165953502">"Nh?p khóa phiên cho %1$s"</string>
5 <string name="map_session_key_dialog_header" msgid="1858363785687455516">"Yêu c?u khóa phiên Bluetooth"</string>
7 <string name="map_authentication_timeout_message" msgid="2151423397615327066">"?ă h?t th?i gian ch? nh?p khóa phiên v?i %1$s"</string>
9 <string name="map_auth_notif_title" msgid="301767019364765129">"Khóa phiên"</string>
10 <string name="map_auth_notif_message" msgid="1510095655064214863">"Nh?p khóa phiên cho %1$s"</string>
|
| strings_pbap.xml | 4 <string name="pbap_session_key_dialog_title" msgid="3580996574333882561">"Nh?p khóa phiên cho %1$s"</string>
5 <string name="pbap_session_key_dialog_header" msgid="2772472422782758981">"Yêu c?u khóa phiên c?a Bluetooth"</string>
7 <string name="pbap_authentication_timeout_message" msgid="4166979525521902687">"?ă h?t th?i gian ch? nh?p khóa 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 khóa phiên cho %1$s"</string>
|
| /external/clang/test/CodeGen/ |
| pr19841.cpp | 25 // Make sure the PHI value is casted correctly to the PHI type
26 // CHECK: %{{.*}} = phi [0 x i8]* [ bitcast ([1 x i8]* [[Common_A_b]] to [0 x i8]*), %{{.*}} ], [ %{{.*}}, %{{.*}} ]
|
| /external/llvm/test/CodeGen/X86/ |
| 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/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/GVN/ |
| rle-nonlocal.ll | 17 ; CHECK-NOT: %existingPHI = phi
18 ; CHECK: %DEAD = phi
19 %existingPHI = phi i32* [ %a, %block2 ], [ %b, %block3 ]
|
| /external/llvm/test/Transforms/JumpThreading/ |
| 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/Mem2Reg/ |
| 2003-10-05-DeadPHIInsertion.ll | 1 ; Mem2reg should not insert dead PHI nodes! The naive algorithm inserts a PHI
4 ; RUN: opt < %s -mem2reg -S | not grep phi
|
| /external/llvm/test/Transforms/SCCP/ |
| 2002-05-20-MissedIncomingValue.ll | 1 ; This test shows a case where SCCP is incorrectly eliminating the PHI node
4 ; RUN: opt < %s -sccp -S | grep phi
10 %V = phi i32 [ 0, %bb1 ], [ %A, %BB4 ] ; <i32> [#uses=1]
|
| 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
19 %X = phi i32 [ 0, %Entry ], [ 1, %Ok ], [ 0, %LPad ] ; <i32> [#uses=1]
|
