| /external/llvm/test/Transforms/SLPVectorizer/AArch64/ |
| commute.ll | 2 target datalayout = "e-m:e-i64:64-i128:128-n32:64-S128"
|
| nontemporal.ll | 2 target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"
|
| /external/llvm/utils/emacs/ |
| llvm-mode.el | 29 `(,(regexp-opt '("void" "i1" "i8" "i16" "i32" "i64" "i128" "float" "double" "type" "label" "opaque") 'symbols) . font-lock-type-face)
|
| /external/valgrind/lackey/docs/ |
| lk-manual.xml | 90 The IR types are identified by their IR name ("I1", "I8", ... "I128",
|
| /external/llvm/test/Transforms/InstCombine/ |
| getelementptr.ll | 229 define i1 @test13_i128(i128 %X, %S* %P) {
232 %A = getelementptr inbounds %S, %S* %P, i128 0, i32 1, i128 %X
233 %B = getelementptr inbounds %S, %S* %P, i128 0, i32 0
325 define i1 @test18_i128(i16* %P, i128 %I) {
328 %X = getelementptr inbounds i16, i16* %P, i128 %I
|
| cast-int-fcmp-eq-0.ll | 481 ; An i128 could round to an IEEE single-precision infinity.
486 define i1 @i128_cast_cmp_oeq_int_inf_uitofp(i128 %i) {
487 %f = uitofp i128 %i to float
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCCallingConv.td | 52 CCIfType<[i128], CCAssignToReg<[X3, X4, X5, X6]>>,
113 CCIfType<[i128], CCAssignToReg<[X3, X4, X5, X6]>>,
|
| /external/llvm/test/CodeGen/ARM/ |
| vector-DAGCombine.ll | 238 define <2 x i8> @test_truncate(<2 x i128> %in) {
252 %res = trunc <2 x i128> %in to <2 x i8>
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineShifts.cpp | 63 /// %C = shl i128 %A, 64
64 /// %D = shl i128 %B, 96
65 /// %E = or i128 %C, %D
66 /// %F = lshr i128 %E, 64
[all...] |
| /external/llvm/test/CodeGen/AArch64/ |
| concat_vector-scalar-combine.ll | 3 target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"
|
| PBQP-chain.ll | 5 target datalayout = "e-m:e-i64:64-i128:128-n32:64-S128"
|
| aarch64-gep-opt.ll | 4 target datalayout = "e-m:e-i64:64-i128:128-n32:64-S128"
|
| vector-fcopysign.ll | 3 target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"
|
| /external/llvm/test/DebugInfo/AArch64/ |
| cfi-eof-prologue.ll | 20 target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"
|
| /external/llvm/test/DebugInfo/Generic/ |
| gvn.ll | 16 target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"
|
| /external/llvm/lib/IR/ |
| ValueTypes.cpp | 129 case MVT::i128: return "i128";
210 case MVT::i128: return IntegerType::get(Context, 128);
|
| /external/llvm/test/CodeGen/X86/ |
| sse2.ll | 308 %bc = bitcast <4 x i32> %i to i128
309 %insert = and i128 %bc, -4294967296
310 %bc2 = bitcast i128 %insert to <4 x i32>
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 129 @i128_s = external global i128 ; <i128*> [#uses=1]
894 define void @i128_ls(i128 %x) nounwind {
895 store i128 %x, i128* @i128_s
[all...] |
| APIntSextParam.ll | 129 @i128_s = external global i128 ; <i128*> [#uses=1]
894 define void @i128_ls(i128 signext %x) nounwind {
895 store i128 %x, i128* @i128_s
[all...] |
| APIntZextParam.ll | 129 @i128_s = external global i128 ; <i128*> [#uses=1]
894 define void @i128_ls(i128 zeroext %x) nounwind {
895 store i128 %x, i128* @i128_s
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 270 int i128[] = {0, 0, 0, 1, 0, 0, 0}; local
397 assert(std::is_heap(i128, i128+7) == (std::is_heap_until(i128, i128+7) == i128+7));
|
| 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);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 270 int i128[] = {0, 0, 0, 1, 0, 0, 0}; local
397 assert(std::is_heap(i128, i128+7) == (std::is_heap_until(i128, i128+7) == i128+7));
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| switch_create.ll | 458 define void @test15(i128 %x) nounwind {
459 %cmp = icmp ugt i128 %x, 2
463 %cmp2 = icmp ne i128 %x, 100000000000000000000
|
