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

  /external/llvm/test/CodeGen/Generic/
APIntParam.ll 223 @i222_s = external global i222 ; <i222*> [#uses=1]
1364 define void @i222_ls(i222 %x) nounwind {
1365 store i222 %x, i222* @i222_s
    [all...]
APIntSextParam.ll 223 @i222_s = external global i222 ; <i222*> [#uses=1]
    [all...]
APIntZextParam.ll 223 @i222_s = external global i222 ; <i222*> [#uses=1]
    [all...]
APIntLoadStore.ll 444 @i222_l = external global i222 ; <i222*> [#uses=1]
445 @i222_s = external global i222 ; <i222*> [#uses=1]
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap.pass.cpp 364 int i222[] = {1, 1, 0, 0, 1, 1, 0}; local
491 assert(std::is_heap(i222, i222+7) == (std::is_heap_until(i222, i222+7) == i222+7));
is_heap_until.pass.cpp 364 int i222[] = {1, 1, 0, 0, 1, 1, 0}; local
491 assert(std::is_heap_until(i222, i222+7) == i222+5);
is_heap_until_comp.pass.cpp 365 int i222[] = {1, 1, 0, 0, 1, 1, 0}; local
492 assert(std::is_heap_until(i222, i222+7, std::greater<int>()) == i222+2);
is_heap_comp.pass.cpp 365 int i222[] = {1, 1, 0, 0, 1, 1, 0}; local
    [all...]

Completed in 180 milliseconds