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

  /external/llvm/test/CodeGen/Generic/
APIntParam.ll 110 @i109_s = external global i109 ; <i109*> [#uses=1]
799 define void @i109_ls(i109 %x) nounwind {
800 store i109 %x, i109* @i109_s
    [all...]
APIntSextParam.ll 110 @i109_s = external global i109 ; <i109*> [#uses=1]
799 define void @i109_ls(i109 signext %x) nounwind {
800 store i109 %x, i109* @i109_s
    [all...]
APIntZextParam.ll 110 @i109_s = external global i109 ; <i109*> [#uses=1]
799 define void @i109_ls(i109 zeroext %x) nounwind {
800 store i109 %x, i109* @i109_s
    [all...]
APIntLoadStore.ll 218 @i109_l = external global i109 ; <i109*> [#uses=1]
219 @i109_s = external global i109 ; <i109*> [#uses=1]
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap.pass.cpp 188 int i109[] = {1, 1, 0, 1, 0, 0}; local
251 assert(std::is_heap(i109, i109+6) == (std::is_heap_until(i109, i109+6) == i109+6));
is_heap_until.pass.cpp 188 int i109[] = {1, 1, 0, 1, 0, 0}; local
251 assert(std::is_heap_until(i109, i109+6) == i109+6);
is_heap_until_comp.pass.cpp 189 int i109[] = {1, 1, 0, 1, 0, 0}; local
252 assert(std::is_heap_until(i109, i109+6, std::greater<int>()) == i109+2);
is_heap_comp.pass.cpp 189 int i109[] = {1, 1, 0, 1, 0, 0}; local
252 assert(std::is_heap(i109, i109+6, std::greater<int>()) == (std::is_heap_until(i109, i109+6, std::greater<int>()) == i109+6));
    [all...]
  /external/llvm/test/Transforms/JumpThreading/
2010-08-26-and.ll 121 %cmp9.i109 = icmp eq i32 %call.i108, 0 ; <i1> [#uses=1]
122 br i1 %cmp9.i109, label %if.then.i113, label %_ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit115
  /external/llvm/test/Transforms/ArgumentPromotion/
pr3085.ll     [all...]

Completed in 28 milliseconds