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

  /external/llvm/test/CodeGen/Generic/
APIntParam.ll 221 @i220_s = external global i220 ; <i220*> [#uses=1]
1354 define void @i220_ls(i220 %x) nounwind {
1355 store i220 %x, i220* @i220_s
    [all...]
APIntSextParam.ll 221 @i220_s = external global i220 ; <i220*> [#uses=1]
    [all...]
APIntZextParam.ll 221 @i220_s = external global i220 ; <i220*> [#uses=1]
    [all...]
APIntLoadStore.ll 440 @i220_l = external global i220 ; <i220*> [#uses=1]
441 @i220_s = external global i220 ; <i220*> [#uses=1]
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap.pass.cpp 362 int i220[] = {1, 1, 0, 0, 1, 0, 0}; local
489 assert(std::is_heap(i220, i220+7) == (std::is_heap_until(i220, i220+7) == i220+7));
is_heap_until.pass.cpp 362 int i220[] = {1, 1, 0, 0, 1, 0, 0}; local
489 assert(std::is_heap_until(i220, i220+7) == i220+7);
is_heap_until_comp.pass.cpp 363 int i220[] = {1, 1, 0, 0, 1, 0, 0}; local
490 assert(std::is_heap_until(i220, i220+7, std::greater<int>()) == i220+2);
is_heap_comp.pass.cpp 363 int i220[] = {1, 1, 0, 0, 1, 0, 0}; local
    [all...]

Completed in 291 milliseconds