| /external/llvm/test/CodeGen/ARM/ |
| vldlane.ll | 510 %tmp64 = zext i64 %tmp63 to i128
511 %tmp65 = shl i128 %tmp64, 64
512 %ins67 = or i128 %tmp65, 0
513 %tmp78 = bitcast i128 %ins67 to <8 x i16>
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntLoadStore.ll | 256 @i128_l = external global i128 ; <i128*> [#uses=1]
257 @i128_s = external global i128 ; <i128*> [#uses=1]
[all...] |
| /external/llvm/test/Transforms/Inline/ |
| alloca-dbgdeclare.ll | 19 target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"
|
| /external/llvm/test/Transforms/InstCombine/ |
| constant-fold-address-space-pointer.ll | 82 ret i64 ptrtoint (i32 addrspace(1)* inttoptr (i128 -1 to i32 addrspace(1)*) to i64)
|
| /external/llvm/test/Transforms/LoopVectorize/AArch64/ |
| arbitrary-induction-step.ll | 4 target datalayout = "e-m:e-i64:64-i128:128-n32:64-S128"
|
| reduction-small-size.ll | 3 target datalayout = "e-m:e-i64:64-i128:128-n32:64-S128"
|
| loop-vectorization-factors.ll | 3 target datalayout = "e-m:e-i64:64-i128:128-n32:64-S128"
|
| /external/llvm/test/Transforms/MemCpyOpt/ |
| memcpy.ll | 83 %struct.S = type { i128, [4 x i8]}
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_until.pass.cpp | 270 int i128[] = {0, 0, 0, 1, 0, 0, 0}; local
397 assert(std::is_heap_until(i128, i128+7) == i128+3);
|
| is_heap_until_comp.pass.cpp | 271 int i128[] = {0, 0, 0, 1, 0, 0, 0}; local
398 assert(std::is_heap_until(i128, i128+7, std::greater<int>()) == i128+7);
|
| /external/clang/test/CodeGen/ |
| builtins-ppc-p8vector.c | [all...] |
| systemz-abi-vector.c | 103 // CHECK-LABEL: define void @pass_v1i128(<1 x i128>* noalias sret %{{.*}}, <1 x i128>*)
104 // CHECK-VECTOR-LABEL: define <1 x i128> @pass_v1i128(<1 x i128> %{{.*}})
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsCallingConv.td | 184 // legal and is lowered to i128 which is further lowered to a pair of i64's.
365 // f128 is not legal and is lowered to i128 which is further lowered to a pair
|
| /external/llvm/test/Transforms/JumpThreading/ |
| 2010-08-26-and.ll | 138 %cmp9.i128 = icmp eq i32 %call.i127, 0 ; <i1> [#uses=1]
139 br i1 %cmp9.i128, label %if.then.i132, label %_ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit134
|
| /external/llvm/utils/TableGen/ |
| CodeGenTarget.cpp | 59 case MVT::i128: return "MVT::i128";
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_syntax.py | 175 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
210 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_syntax.py | 175 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
210 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 175 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
210 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 175 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
210 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
|
| /external/llvm/lib/Target/X86/ |
| README-SSE.txt | 790 %tmp20 = zext i64 %tmp19 to i128 ; <i128> [#uses=1]
791 %tmp10 = lshr i128 %tmp20, 32 ; <i128> [#uses=1]
792 %tmp11 = trunc i128 %tmp10 to i32 ; <i32> [#uses=1]
|
| /external/llvm/test/CodeGen/X86/ |
| codegen-prepare-addrmode-sext.ll | 180 ; CHECK: [[ARG1TRUNC:%[a-zA-Z_0-9-]+]] = trunc i128 %arg1 to i8
185 define i8 @oneArgPromotionLargerType(i128 %arg1, i8* %base) {
186 %trunc = trunc i128 %arg1 to i8
|
| hhvm-cc.ll | 3 target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZRegisterInfo.td | 110 // The architecture doesn't really have any i128 support, so model the
|
| /external/llvm/test/Analysis/LoopAccessAnalysis/ |
| number-of-memchecks.ll | 3 target datalayout = "e-m:e-i64:64-i128:128-n32:64-S128"
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_comp.pass.cpp | 271 int i128[] = {0, 0, 0, 1, 0, 0, 0}; local
398 assert(std::is_heap(i128, i128+7, std::greater<int>()) == (std::is_heap_until(i128, i128+7, std::greater<int>()) == i128+7));
[all...] |
