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

  /external/llvm/test/CodeGen/Generic/
APIntParam.ll 141 @i140_s = external global i140 ; <i140*> [#uses=1]
954 define void @i140_ls(i140 %x) nounwind {
955 store i140 %x, i140* @i140_s
    [all...]
APIntSextParam.ll 141 @i140_s = external global i140 ; <i140*> [#uses=1]
954 define void @i140_ls(i140 signext %x) nounwind {
955 store i140 %x, i140* @i140_s
    [all...]
APIntZextParam.ll 141 @i140_s = external global i140 ; <i140*> [#uses=1]
954 define void @i140_ls(i140 zeroext %x) nounwind {
955 store i140 %x, i140* @i140_s
    [all...]
APIntLoadStore.ll 280 @i140_l = external global i140 ; <i140*> [#uses=1]
281 @i140_s = external global i140 ; <i140*> [#uses=1]
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap.pass.cpp 282 int i140[] = {0, 0, 1, 0, 1, 0, 0}; local
409 assert(std::is_heap(i140, i140+7) == (std::is_heap_until(i140, i140+7) == i140+7));
is_heap_until.pass.cpp 282 int i140[] = {0, 0, 1, 0, 1, 0, 0}; local
409 assert(std::is_heap_until(i140, i140+7) == i140+2);
is_heap_until_comp.pass.cpp 283 int i140[] = {0, 0, 1, 0, 1, 0, 0}; local
410 assert(std::is_heap_until(i140, i140+7, std::greater<int>()) == i140+5);
is_heap_comp.pass.cpp 283 int i140[] = {0, 0, 1, 0, 1, 0, 0}; local
410 assert(std::is_heap(i140, i140+7, std::greater<int>()) == (std::is_heap_until(i140, i140+7, std::greater<int>()) == i140+7));
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_syntax.py 176 ... i136, i137, i138, i139, i140, i141, i142, i143, i144,
211 ... i136, i137, i138, i139, i140, i141, i142, i143, i144,
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_syntax.py 176 ... i136, i137, i138, i139, i140, i141, i142, i143, i144,
211 ... i136, i137, i138, i139, i140, i141, i142, i143, i144,
  /external/llvm/include/llvm/Target/
TargetLowering.h 626 /// like i140, which are first promoted then expanded, it is the number of
627 /// registers needed to hold all the bits of the original type. For an i140
    [all...]
  /art/test/083-compiler-regressions/src/
Main.java 530 int i140 = 140; local
    [all...]

Completed in 57 milliseconds