/external/llvm-project/llvm/test/Transforms/InstCombine/ |
D | 2007-12-18-AddSelCmpSub.ll | 15 %t12 = add i32 %smax, %a 16 %t13 = add i32 %t12, 1 30 %t12 = add i32 %smax, %a 31 ret i32 %t12 43 %t12 = add i32 %smax, %a 44 ret i32 %t12
|
D | 2009-07-02-MaskedIntVector.ll | 7 …%t12 = shufflevector <16 x i8> %0, <16 x i8> zeroinitializer, <16 x i32> <i32 0, i32 16, i32 0, i3… 8 %t11 = bitcast <16 x i8> %t12 to <2 x i64> ; <<2 x i64>> [#uses=1]
|
/external/llvm/test/Transforms/Reassociate/ |
D | mightymul.ll | 17 %t12 = mul i32 %t11, %t11 18 %t13 = mul i32 %t12, %t12
|
D | fast-mightymul.ll | 17 %t12 = fmul fast float %t11, %t11 18 %t13 = fmul fast float %t12, %t12
|
D | 2012-05-08-UndefLeak.ll | 24 %t12 = add i64 %x0, 13 42 %t30 = add i64 %t29, %t12 59 %t47 = add i64 %t46, %t12
|
/external/compiler-rt/test/asan/TestCases/Posix/ |
D | stack-overflow.cc | 37 int t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13; in recursive_func() 50 t12 = z12; in recursive_func() 65 z12 = t12; in recursive_func()
|
/external/llvm-project/llvm/test/Transforms/Reassociate/ |
D | mightymul.ll | 17 %t12 = mul i32 %t11, %t11 18 %t13 = mul i32 %t12, %t12
|
D | fast-mightymul.ll | 17 %t12 = fmul fast float %t11, %t11 18 %t13 = fmul fast float %t12, %t12
|
D | 2012-05-08-UndefLeak.ll | 24 %t12 = add i64 %x0, 13 42 %t30 = add i64 %t29, %t12 59 %t47 = add i64 %t46, %t12
|
/external/llvm-project/compiler-rt/test/asan/TestCases/Posix/ |
D | stack-overflow.cpp | 39 int t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13; in recursive_func() 52 t12 = z12; in recursive_func() 67 z12 = t12; in recursive_func()
|
/external/openssh/regress/ |
D | Makefile | 5 REGRESS_TARGETS= t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 t11 t12 128 sshd_proxy_orig t10.out t10.out.pub t12.out t12.out.pub \ 206 $(OBJ)/t12.out: 209 t12: $(OBJ)/t12.out target 210 ${TEST_SSH_SSHKEYGEN} -lf $(OBJ)/t12.out.pub | grep test-comment-1234 >/dev/null
|
/external/clang/test/CodeGenCXX/ |
D | aarch64-aapcs-zerolength-bitfield.cpp | 114 struct t12 struct 122 static_assert(offsetof(struct t12, bar) == 8); argument 123 static_assert(sizeof(struct t12) == 16);
|
/external/clang/test/CodeGen/ |
D | arm-aapcs-zerolength-bitfield.c | 113 struct t12 struct 121 static int arr12_offset[(offsetof(struct t12, bar) == 8) ? 0 : -1]; argument 122 static int arr12_sizeof[(sizeof(struct t12) == 16) ? 0 : -1];
|
D | arm-apcs-zerolength-bitfield.c | 117 struct t12 struct 125 static int arr12_offset[(offsetof(struct t12, bar) == 4) ? 0 : -1]; argument 126 static int arr12_sizeof[(sizeof(struct t12) == 8) ? 0 : -1];
|
D | ms_struct-bitfield.c | 167 } ATTR t12; variable 168 int s12 = sizeof(t12);
|
/external/llvm-project/clang/test/CodeGen/ |
D | arm-aapcs-zerolength-bitfield.c | 113 struct t12 struct 121 static int arr12_offset[(offsetof(struct t12, bar) == 8) ? 0 : -1]; argument 122 static int arr12_sizeof[(sizeof(struct t12) == 16) ? 0 : -1];
|
D | arm-apcs-zerolength-bitfield.c | 117 struct t12 struct 125 static int arr12_offset[(offsetof(struct t12, bar) == 4) ? 0 : -1]; argument 126 static int arr12_sizeof[(sizeof(struct t12) == 8) ? 0 : -1];
|
D | ms_struct-bitfield.c | 167 } ATTR t12; variable 168 int s12 = sizeof(t12);
|
/external/llvm-project/clang/test/CodeGenCXX/ |
D | aarch64-aapcs-zerolength-bitfield.cpp | 114 struct t12 struct 122 static_assert(offsetof(struct t12, bar) == 8); argument 123 static_assert(sizeof(struct t12) == 16);
|
/external/llvm-project/llvm/test/Transforms/CodeGenPrepare/ARM/ |
D | dead-gep.ll | 13 %t12 = getelementptr inbounds %struct, %struct* %t0, i32 1, i32 500 14 %t13 = load i32, i32* %t12, align 4
|
/external/llvm/test/Transforms/InstCombine/ |
D | 2009-07-02-MaskedIntVector.ll | 7 …%t12 = shufflevector <16 x i8> %0, <16 x i8> zeroinitializer, <16 x i32> <i32 0, i32 16, i32 0, i3… 8 %t11 = bitcast <16 x i8> %t12 to <2 x i64> ; <<2 x i64>> [#uses=1]
|
/external/skqp/tests/ |
D | PathOpsQuadIntersectionTest.cpp | 469 double t12 = t1Seed + t1Step * 2; in intersectionFinder() local 480 test = quad1.ptAtT(t12); in intersectionFinder() 481 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder() 497 t10, t1Seed, t12, t20, t2Seed, t22); in intersectionFinder() 500 SkDPoint p12 = quad1.ptAtT(t12); in intersectionFinder()
|
/external/skia/tests/ |
D | PathOpsQuadIntersectionTest.cpp | 469 double t12 = t1Seed + t1Step * 2; in intersectionFinder() local 480 test = quad1.ptAtT(t12); in intersectionFinder() 481 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder() 497 t10, t1Seed, t12, t20, t2Seed, t22); in intersectionFinder() 500 SkDPoint p12 = quad1.ptAtT(t12); in intersectionFinder()
|
/external/llvm/test/Transforms/SLPVectorizer/X86/ |
D | unreachable.ll | 32 %t12 = getelementptr inbounds i32, i32* %x, i64 1 33 store i32 %t2.0, i32* %t12, align 4
|
/external/llvm-project/llvm/test/CodeGen/X86/ |
D | callbr-asm-bb-exports.ll | 11 ; CHECK-NEXT: t12: ch = CopyToReg t0, Register:i32 %0, t10 15 ; CHECK-NEXT: t17: ch = TokenFactor t12, t15
|