HomeSort by relevance Sort by last modified time
    Searched full:i108 (Results 1 - 16 of 16) sorted by null

  /external/llvm/test/Transforms/InstCombine/
apint-sub.ll 25 define i108 @test4(i108 %A, i108 %x) {
26 %B = sub i108 0, %A ; <i108> [#uses=1]
27 %C = sub i108 %x, %B ; <i108> [#uses=1]
28 ret i108 %C
  /external/llvm/test/Transforms/LoopDeletion/
2011-06-21-phioperands.ll 120 br i1 undef, label %Retry.i108, label %if.end.i113
122 Retry.i108: ; preds = %if.end.i113, %if.else
125 new.notnull.i110: ; preds = %Retry.i108
129 br label %Retry.i108
131 _ZN4llvm15SmallVectorImplIPKcE9push_backERKS2_.exit114: ; preds = %new.notnull.i110, %Retry.i108
  /external/llvm/test/CodeGen/ARM/
2007-08-15-ReuseBug.ll 61 %tmp1.i108.i = getelementptr [100 x i8*]* @_C_cmds, i32 0, i32 0 ; <i8**> [#uses=1]
62 store i8* %tmp3.i.i.i.i105.i, i8** %tmp1.i108.i, align 4
  /external/llvm/test/CodeGen/Generic/
APIntParam.ll 109 @i108_s = external global i108 ; <i108*> [#uses=1]
794 define void @i108_ls(i108 %x) nounwind {
795 store i108 %x, i108* @i108_s
    [all...]
APIntSextParam.ll 109 @i108_s = external global i108 ; <i108*> [#uses=1]
794 define void @i108_ls(i108 signext %x) nounwind {
795 store i108 %x, i108* @i108_s
    [all...]
APIntZextParam.ll 109 @i108_s = external global i108 ; <i108*> [#uses=1]
794 define void @i108_ls(i108 zeroext %x) nounwind {
795 store i108 %x, i108* @i108_s
    [all...]
APIntLoadStore.ll 216 @i108_l = external global i108 ; <i108*> [#uses=1]
217 @i108_s = external global i108 ; <i108*> [#uses=1]
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap.pass.cpp 187 int i108[] = {1, 1, 0, 0, 1, 1}; local
250 assert(std::is_heap(i108, i108+6) == (std::is_heap_until(i108, i108+6) == i108+6));
is_heap_until.pass.cpp 187 int i108[] = {1, 1, 0, 0, 1, 1}; local
250 assert(std::is_heap_until(i108, i108+6) == i108+5);
is_heap_until_comp.pass.cpp 188 int i108[] = {1, 1, 0, 0, 1, 1}; local
251 assert(std::is_heap_until(i108, i108+6, std::greater<int>()) == i108+2);
is_heap_comp.pass.cpp 188 int i108[] = {1, 1, 0, 0, 1, 1}; local
251 assert(std::is_heap(i108, i108+6, std::greater<int>()) == (std::is_heap_until(i108, i108+6, std::greater<int>()) == i108+6));
    [all...]
  /external/llvm/test/Transforms/CodeGenPrepare/
2008-11-24-RAUW-Self.ll 219 br i1 false, label %bb6.i107.addflt.exit114_crit_edge, label %bb8.i108
224 bb8.i108: ; preds = %bb6.i107
227 bb9.i111: ; preds = %bb8.i108, %bb5.i106.bb9.i111_crit_edge
  /external/llvm/test/Transforms/JumpThreading/
2010-08-26-and.ll 120 %call.i108 = call i32 @memcmp(i8* getelementptr inbounds ([7 x i8]* @.str5, i64 0, i64 0), i8* %tmp6, i64 7) nounwind ; <i32> [#uses=1]
121 %cmp9.i109 = icmp eq i32 %call.i108, 0 ; <i1> [#uses=1]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_syntax.py 172 ... i100, i101, i102, i103, i104, i105, i106, i107, i108,
207 ... i100, i101, i102, i103, i104, i105, i106, i107, i108,
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_syntax.py 172 ... i100, i101, i102, i103, i104, i105, i106, i107, i108,
207 ... i100, i101, i102, i103, i104, i105, i106, i107, i108,
  /art/test/083-compiler-regressions/src/
Main.java 466 int i108 = 108; local
    [all...]

Completed in 3260 milliseconds