/external/llvm/test/CodeGen/ARM/ |
2009-07-01-CommuteBug.ll | 57 br i1 undef, label %bb220.i, label %bb.nph.i98 59 bb.nph.i98: ; preds = %bb153.i 62 bb158.i: ; preds = %bb218.i, %bb.nph.i98 63 %c.1020.i = phi i32 [ 0, %bb.nph.i98 ], [ %c.14.i, %bb218.i ] ; <i32> [#uses=1] 64 %f.419.i = phi i32 [ undef, %bb.nph.i98 ], [ %f.5.i, %bb218.i ] ; <i32> [#uses=1] 65 %cflag.418.i = phi i16 [ 0, %bb.nph.i98 ], [ %cflag.3.i, %bb218.i ] ; <i16> [#uses=1] 66 %pj.317.i = phi i32 [ undef, %bb.nph.i98 ], [ %7, %bb218.i ] ; <i32> [#uses=1] 67 %pi.316.i = phi i32 [ undef, %bb.nph.i98 ], [ %6, %bb218.i ] ; <i32> [#uses=1] 68 %fj.515.i = phi i32 [ undef, %bb.nph.i98 ], [ %fj.4.i, %bb218.i ] ; <i32> [#uses=2] 69 %fi.614.i = phi i32 [ undef, %bb.nph.i98 ], [ %fi.5.i, %bb218.i ] ; <i32> [#uses=3 [all...] |
2009-06-30-RegScavengerAssert4.ll | 64 br i1 undef, label %bb220.i, label %bb.nph.i98 66 bb.nph.i98: ; preds = %bb153.i 69 bb158.i: ; preds = %bb218.i, %bb.nph.i98 70 %c.1020.i = phi i32 [ 0, %bb.nph.i98 ], [ %c.14.i, %bb218.i ] ; <i32> [#uses=1] 71 %f.419.i = phi i32 [ undef, %bb.nph.i98 ], [ %f.5.i, %bb218.i ] ; <i32> [#uses=1] 72 %pi.316.i = phi i32 [ undef, %bb.nph.i98 ], [ %10, %bb218.i ] ; <i32> [#uses=1] 73 %fj.515.i = phi i32 [ %6, %bb.nph.i98 ], [ %fj.4.i, %bb218.i ] ; <i32> [#uses=2] 74 %fi.614.i = phi i32 [ undef, %bb.nph.i98 ], [ %fi.5.i, %bb218.i ] ; <i32> [#uses=3] 75 %cj.811.i = phi i32 [ %6, %bb.nph.i98 ], [ %cj.11.i100, %bb218.i ] ; <i32> [#uses=3] 76 %ci.910.i = phi i32 [ undef, %bb.nph.i98 ], [ %ci.12.i, %bb218.i ] ; <i32> [#uses=2 [all...] |
2009-06-30-RegScavengerAssert3.ll | 53 br i1 undef, label %bb220.i, label %bb.nph.i98 55 bb.nph.i98: ; preds = %bb153.i 58 bb158.i: ; preds = %bb218.i, %bb.nph.i98 59 %c.1020.i = phi i32 [ 0, %bb.nph.i98 ], [ %c.14.i, %bb218.i ] ; <i32> [#uses=1] 60 %cflag.418.i = phi i16 [ 0, %bb.nph.i98 ], [ %cflag.3.i, %bb218.i ] ; <i16> [#uses=1] 61 %pj.317.i = phi i32 [ undef, %bb.nph.i98 ], [ %8, %bb218.i ] ; <i32> [#uses=1] 62 %pi.316.i = phi i32 [ undef, %bb.nph.i98 ], [ %7, %bb218.i ] ; <i32> [#uses=1] 63 %fj.515.i = phi i32 [ undef, %bb.nph.i98 ], [ %fj.4.i, %bb218.i ] ; <i32> [#uses=3] 64 %ci.910.i = phi i32 [ undef, %bb.nph.i98 ], [ %ci.12.i, %bb218.i ] ; <i32> [#uses=2]
|
2009-06-30-RegScavengerAssert2.ll | 70 br i1 undef, label %bb220.i, label %bb.nph.i98 72 bb.nph.i98: ; preds = %bb153.i 75 bb158.i: ; preds = %bb218.i, %bb.nph.i98
|
2009-06-30-RegScavengerAssert5.ll | 50 br i1 undef, label %bb220.i, label %bb.nph.i98 52 bb.nph.i98: ; preds = %bb153.i 55 bb158.i: ; preds = %bb218.i, %bb.nph.i98
|
2009-06-30-RegScavengerAssert.ll | 79 br i1 undef, label %bb220.i, label %bb.nph.i98 81 bb.nph.i98: ; preds = %bb153.i 84 bb158.i: ; preds = %bb218.i, %bb.nph.i98
|
2007-08-15-ReuseBug.ll | 66 %tmp1.i98.i = getelementptr [100 x i8*]* @_C_cmds, i32 0, i32 %tmp.i91.i ; <i8**> [#uses=1] 67 store i8* %tmp3.i.i.i.i95.i, i8** %tmp1.i98.i, align 4
|
/external/llvm/test/Transforms/InstCombine/ |
crash.ll | 21 %conv3.i98 = bitcast <4 x i32> %sub.i97 to <2 x i64> ; <<2 x i64>> [#uses=2] 22 %conv2.i86 = bitcast <2 x i64> %conv3.i98 to <4 x i32> ; <<4 x i32>> [#uses=1] 26 %and.i = and <2 x i64> %conv3.i89, %conv3.i98 ; <<2 x i64>> [#uses=1]
|
/external/llvm/test/CodeGen/X86/ |
fold-pcmpeqd-0.ll | 58 %bitcast190.i98 = bitcast <4 x float> %mul186.i96 to <4 x i32> ; <<4 x i32>> [#uses=1] 59 %andnps192.i100 = and <4 x i32> %bitcast190.i98, zeroinitializer ; <<4 x i32>> [#uses=1]
|
/external/llvm/test/CodeGen/Generic/ |
APIntParam.ll | 99 @i98_s = external global i98 ; <i98*> [#uses=1] 744 define void @i98_ls(i98 %x) nounwind { 745 store i98 %x, i98* @i98_s [all...] |
APIntSextParam.ll | 99 @i98_s = external global i98 ; <i98*> [#uses=1] 744 define void @i98_ls(i98 signext %x) nounwind { 745 store i98 %x, i98* @i98_s [all...] |
APIntZextParam.ll | 99 @i98_s = external global i98 ; <i98*> [#uses=1] 744 define void @i98_ls(i98 zeroext %x) nounwind { 745 store i98 %x, i98* @i98_s [all...] |
APIntLoadStore.ll | 196 @i98_l = external global i98 ; <i98*> [#uses=1] 197 @i98_s = external global i98 ; <i98*> [#uses=1] [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
is_heap.pass.cpp | 177 int i98[] = {1, 0, 1, 0, 0, 1}; local 240 assert(std::is_heap(i98, i98+6) == (std::is_heap_until(i98, i98+6) == i98+6));
|
is_heap_until.pass.cpp | 177 int i98[] = {1, 0, 1, 0, 0, 1}; local 240 assert(std::is_heap_until(i98, i98+6) == i98+6);
|
is_heap_until_comp.pass.cpp | 178 int i98[] = {1, 0, 1, 0, 0, 1}; local 241 assert(std::is_heap_until(i98, i98+6, std::greater<int>()) == i98+1);
|
is_heap_comp.pass.cpp | 178 int i98[] = {1, 0, 1, 0, 0, 1}; local 241 assert(std::is_heap(i98, i98+6, std::greater<int>()) == (std::is_heap_until(i98, i98+6, std::greater<int>()) == i98+6)); [all...] |
/external/llvm/test/Transforms/ArgumentPromotion/ |
pr3085.ll | [all...] |