| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | select-min-max.ll | 4 declare i5 @llvm.smin.i5(i5, i5) 6 declare i5 @llvm.umin.i5(i5, i5) 15 %m1 = call i5 @llvm.smin.i5(i5 %z, i5 %x) 16 %m2 = call i5 @llvm.smin.i5(i5 %z, i5 %y) 41 %m1 = call i5 @llvm.umin.i5(i5 %x, i5 %z) 43 %m2 = call i5 @llvm.umin.i5(i5 %z, i5 %y) 72 %m1 = call i5 @llvm.smin.i5(i5 %x, i5 %z) 73 %m2 = call i5 @llvm.umin.i5(i5 %y, i5 %z) 87 %m1 = call i5 @llvm.smin.i5(i5 %z, i5 %x) 118 %c = call i5 @llvm.smin.i5(i5 %s, i5 5) [all …]
|
| H A D | icmp-fsh.ll | 6 declare <2 x i5> @llvm.fshl.v2i5(<2 x i5>, <2 x i5>, <2 x i5>) 51 %rot = tail call <2 x i5> @llvm.fshl.v2i5(<2 x i5>%x, <2 x i5> %x, <2 x i5> %y) 52 %r = icmp ne <2 x i5> %rot, <i5 -1, i5 -1> 61 %rot = tail call <2 x i5> @llvm.fshl.v2i5(<2 x i5>%x, <2 x i5> %x, <2 x i5> %y) 62 %r = icmp ne <2 x i5> %rot, <i5 -1, i5 undef> 71 %rot = tail call <2 x i5> @llvm.fshl.v2i5(<2 x i5>%x, <2 x i5> %x, <2 x i5> %y) 72 %r = icmp eq <2 x i5> %rot, <i5 0, i5 undef> 84 %rot = tail call <2 x i5> @llvm.fshl.v2i5(<2 x i5>%x, <2 x i5> %x, <2 x i5> %y) 85 %r = icmp eq <2 x i5> %rot, <i5 undef, i5 1> 97 %rot = tail call <2 x i5> @llvm.fshl.v2i5(<2 x i5>%x, <2 x i5> %x, <2 x i5> %y) [all …]
|
| H A D | commutative-intrinsics.ll | 13 define i5 @smin(i5 %x) { 15 ; CHECK-NEXT: [[R:%.*]] = call i5 @llvm.smin.i5(i5 [[X:%.*]], i5 10) 16 ; CHECK-NEXT: ret i5 [[R]] 18 %r = call i5 @llvm.smin.i5(i5 42, i5 %x) 19 ret i5 %r 49 define i5 @umul_fix(i5 %x) { 51 ; CHECK-NEXT: [[R:%.*]] = call i5 @llvm.umul.fix.i5(i5 [[X:%.*]], i5 10, i32 3) 54 %r = call i5 @llvm.umul.fix.i5(i5 42, i5 %x, i32 3) 55 ret i5 %r 77 declare i5 @llvm.smin.i5(i5, i5) [all …]
|
| H A D | icmp-rotate.ll | 6 declare <2 x i5> @llvm.fshl.v2i5(<2 x i5>, <2 x i5>, <2 x i5>) 7 declare <2 x i5> @llvm.fshr.v2i5(<2 x i5>, <2 x i5>, <2 x i5>) 91 %f = tail call <2 x i5> @llvm.fshl.v2i5(<2 x i5> %x, <2 x i5> %x, <2 x i5> %z) 92 %f2 = tail call <2 x i5> @llvm.fshl.v2i5(<2 x i5> %y, <2 x i5> %y, <2 x i5> %z) 102 %f = tail call <2 x i5> @llvm.fshr.v2i5(<2 x i5> %x, <2 x i5> %x, <2 x i5> %z) 103 %f2 = tail call <2 x i5> @llvm.fshr.v2i5(<2 x i5> %y, <2 x i5> %y, <2 x i5> %z) 167 %f = tail call <2 x i5> @llvm.fshl.v2i5(<2 x i5> %x, <2 x i5> %x, <2 x i5> <i5 3, i5 3>) 168 %r = icmp eq <2 x i5> %f, <i5 2, i5 2> 174 …CK-NEXT: [[F:%.*]] = tail call <2 x i5> @llvm.fshl.v2i5(<2 x i5> [[X:%.*]], <2 x i5> [[X]], <2 … 178 %f = tail call <2 x i5> @llvm.fshl.v2i5(<2 x i5> %x, <2 x i5> %x, <2 x i5> <i5 3, i5 3>) [all …]
|
| H A D | assoc-cast-assoc.ll | 4 define i5 @XorZextXor(i3 %a) { 8 ; CHECK-NEXT: ret i5 [[OP2]] 11 %cast = zext i3 %op1 to i5 12 %op2 = xor i5 %cast, 12 13 ret i5 %op2 28 define i5 @OrZextOr(i3 %a) { 35 %cast = zext i3 %op1 to i5 36 %op2 = or i5 %cast, 8 37 ret i5 %op2 62 %op2 = and i5 %cast, 14 [all …]
|
| H A D | intrinsic-select.ll | 10 declare <3 x i5> @llvm.cttz.v3i5(<3 x i5>, i1) 81 define <3 x i5> @cttz_sel_const_false(<3 x i1> %b, <3 x i5> %x) { 83 ; CHECK-NEXT: [[TMP1:%.*]] = call <3 x i5> @llvm.cttz.v3i5(<3 x i5> [[X:%.*]], i1 false) 84 ; CHECK-NEXT: [[C:%.*]] = select <3 x i1> [[B:%.*]], <3 x i5> [[TMP1]], <3 x i5> <i5 0, i5 0, i5… 85 ; CHECK-NEXT: ret <3 x i5> [[C]] 87 %s = select <3 x i1> %b, <3 x i5> %x, <3 x i5> <i5 7, i5 -1, i5 0> 88 %c = call <3 x i5> @llvm.cttz.v3i5(<3 x i5> %s, i1 false) 89 ret <3 x i5> %c
|
| H A D | sub-xor.ll | 74 define <2 x i5> @arbitrary_mask_sub_v2i5(<2 x i5> %x) { 76 ; CHECK-NEXT: [[A:%.*]] = and <2 x i5> [[X:%.*]], <i5 -8, i5 -8> 77 ; CHECK-NEXT: [[M:%.*]] = sub nuw nsw <2 x i5> <i5 -6, i5 -6>, [[A]] 78 ; CHECK-NEXT: ret <2 x i5> [[M]] 80 %a = and <2 x i5> %x, <i5 24, i5 24> ; 0b11000 81 %m = sub <2 x i5> <i5 26, i5 26>, %a ; 0b11010 82 ret <2 x i5> %m
|
| /llvm-project-15.0.7/llvm/test/MC/Sparc/ |
| H A D | sparc-v9-traps.s | 7 ta %icc, %i5 10 ta %icc, %i5 + 41 16 tn %icc, %i5 27 tne %icc, %i5 28 tnz %icc, %i5 39 te %icc, %i5 40 tz %icc, %i5 49 tg %icc, %i5 58 tle %icc, %i5 67 tge %icc, %i5 [all …]
|
| H A D | sparc-traps.s | 7 ta %i5 10 ta %i5 + 41 16 tn %i5 27 tne %i5 28 tnz %i5 39 te %i5 40 tz %i5 49 tg %i5 58 tle %i5 67 tge %i5 [all …]
|
| H A D | sparcv9-instructions.s | 239 rdpr %tpc,%i5 243 rdpr %tnpc,%i5 247 rdpr %tstate,%i5 251 rdpr %tt,%i5 255 rdpr %tick,%i5 259 rdpr %tba,%i5 263 rdpr %pstate,%i5 267 rdpr %tl,%i5 271 rdpr %pil,%i5 275 rdpr %cwp,%i5 [all …]
|
| H A D | sparc-nop-data.s | 8 xor %i5, %i5, %i5 10 xor %i5, %i5, %i5
|
| /llvm-project-15.0.7/clang/test/Analysis/ |
| H A D | stl-algorithm-modeling-aggressive-std-find-modeling.cpp | 155 if (i5 != i2) { in test_find_first_of1() 179 if (i5 != i2) { in test_find_first_of2() 202 if (i5 != i2) { in test_find_first_of3() 226 if (i5 != i2) { in test_find_first_of4() 249 if (i5 != i2) { in test_find_end1() 273 if (i5 != i2) { in test_find_end2() 296 if (i5 != i2) { in test_find_end3() 320 if (i5 != i2) { in test_find_end4() 429 if (i5 != i2) { in test_search1() 453 if (i5 != i2) { in test_search2() [all …]
|
| H A D | stl-algorithm-modeling.cpp | 138 const auto i5 = std::find_first_of(i1, i2, i3, i4); in test_find_first_of1() local 144 clang_analyzer_eval(clang_analyzer_iterator_position(i5) < in test_find_first_of1() 147 clang_analyzer_eval(clang_analyzer_iterator_position(i5) < in test_find_first_of1() 166 clang_analyzer_eval(clang_analyzer_iterator_position(i5) < in test_find_first_of2() 169 clang_analyzer_eval(clang_analyzer_iterator_position(i5) < in test_find_first_of2() 181 const auto i5 = std::find_first_of(i1, i2, i3, i4, odd); in test_find_first_of3() local 187 clang_analyzer_eval(clang_analyzer_iterator_position(i5) < in test_find_first_of3() 224 const auto i5 = std::find_end(i1, i2, i3, i4); in test_find_end1() local 267 const auto i5 = std::find_end(i1, i2, i3, i4, odd); in test_find_end3() local 388 const auto i5 = std::search(i1, i2, i3, i4); in test_search1() local [all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/ |
| H A D | load-local-v4i5.ll | 3 @0 = internal unnamed_addr constant [4 x i5] [i5 2, i5 0, i5 2, i5 -1], align 1 39 %z = alloca i5, align 1 41 %0 = load i5, ptr %x 42 %1 = insertelement <4 x i5> undef, i5 %0, i32 0 44 %3 = load i5, ptr %2 45 %4 = insertelement <4 x i5> %1, i5 %3, i32 1 47 %6 = load i5, ptr %5 48 %7 = insertelement <4 x i5> %4, i5 %6, i32 2 50 %9 = load i5, ptr %8 51 %10 = insertelement <4 x i5> %7, i5 %9, i32 3 [all …]
|
| /llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/cloog/ |
| H A D | classen.st | 5 …i5, i6, i7] -> [(1 + i0)]; S4[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i0)]; S8[i0, i1] -> [(i0)]; S3[… 9 …i5, i6, i7]; S6[i0, i1, i2, i3, i4, i5, i6, i7]; S4[i0, i1, i2, i3, i4, i5, i6, i7]; S1[i0, i1, i2… 11 …i5, i6, i7] -> [(i3)]; S4[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i1)]; S3[i0, i1, i2, i3, i4, i5, i6… 15 …lter: "[m] -> { S6[i0, i1, i2, i3, i4, i5, i6, i7]; S5[i0, i1, i2, i3, i4, i5, i6, i7]; S7[i0, i1,… 17 …i5, i6, i7] -> [(i4)]; S5[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i4)]; S6[i0, i1, i2, i3, i4, i5, i6… 20 …lter: "[m] -> { S2[i0, i1, i2, i3, i4, i5, i6, i7]; S4[i0, i1, i2, i3, i4, i5, i6, i7]; S3[i0, i1,… 22 …i5, i6, i7] -> [(i4)]; S3[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i4)]; S2[i0, i1, i2, i3, i4, i5, i6…
|
| H A D | equality2.st | 1 domain: "{ S1[i0, i1, 1, 2, i0, i5, -999 + i1, i0, -999 + i1, i9, i10] : 2i5 = 2 + i1 and 2i9 = -99… 5 …i5, i6, i7, i8, i9, i10] -> [(i0)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13,… 9 - filter: "{ S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] }" 10 - filter: "{ S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] }"
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_op==/ |
| H A D | equal.pass.cpp | 39 assert(!(i1 == i5)); in main() 45 assert(!(i2 == i5)); in main() 51 assert( (i3 == i5)); in main() 57 assert( (i4 == i5)); in main() 59 assert(!(i5 == i1)); in main() 60 assert(!(i5 == i2)); in main() 61 assert( (i5 == i3)); in main() 62 assert( (i5 == i4)); in main() 63 assert( (i5 == i5)); in main() 99 assert(!(i1 == i5)); in main() [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_op!=/ |
| H A D | not_equal.pass.cpp | 37 assert( (i1 != i5)); in main() 43 assert( (i2 != i5)); in main() 49 assert(!(i3 != i5)); in main() 55 assert(!(i4 != i5)); in main() 57 assert( (i5 != i1)); in main() 58 assert( (i5 != i2)); in main() 59 assert(!(i5 != i3)); in main() 60 assert(!(i5 != i4)); in main() 61 assert(!(i5 != i5)); in main() 97 assert( (i1 != i5)); in main() [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_equal/ |
| H A D | equal.pass.cpp | 36 assert(!i1.equal(i5)); in main() 42 assert(!i2.equal(i5)); in main() 48 assert( i3.equal(i5)); in main() 54 assert( i4.equal(i5)); in main() 56 assert(!i5.equal(i1)); in main() 57 assert(!i5.equal(i2)); in main() 58 assert( i5.equal(i3)); in main() 59 assert( i5.equal(i4)); in main() 60 assert( i5.equal(i5)); in main() 76 assert(!i1.equal(i5)); in main() [all …]
|
| /llvm-project-15.0.7/llvm/test/MC/Disassembler/Sparc/ |
| H A D | sparc-v9.txt | 6 # CHECK: ta %icc, %i5 15 # CHECK: ta %icc, %i5 + 41 18 # CHECK: tn %icc, %i5 27 # CHECK: tg %icc, %i5 + 41 30 # CHECK: tle %icc, %i5 39 # CHECK: tgu %icc, %i5 + 41 42 # CHECK: tleu %icc, %i5 51 # CHECK: tpos %icc, %i5 + 41 54 # CHECK: tneg %icc, %i5 63 # CHECK: ta %xcc, %i5 [all …]
|
| /llvm-project-15.0.7/polly/lib/External/isl/test_inputs/schedule/ |
| H A D | niewang.st | 1 …_3[i0, i1, i2, i3, i4, i5, i6] : 0 <= i0 <= 223 and 0 <= i1 <= 223 and 0 <= i2 <= 15 and 0 <= i3 <… 9 - filter: "{ S_3[i0, i1, i2, i3, i4, i5, i6] }" 11 … i4, i5, i6] -> [(i0)] }, { S_3[i0, i1, i2, i3, i4, i5, i6] -> [(i1)] }, { S_3[i0, i1, i2, i3, i4,… 15 schedule: "[{ S_3[i0, i1, i2, i3, i4, i5, i6] -> [(i4)] }]" 19 schedule: "[{ S_3[i0, i1, i2, i3, i4, i5, i6] -> [(i5)] }]" 23 schedule: "[{ S_3[i0, i1, i2, i3, i4, i5, i6] -> [(i6)] }]"
|
| /llvm-project-15.0.7/mlir/test/Transforms/ |
| H A D | decompose-call-graph-types.mlir | 95 // CHECK-LABEL: func private @callee(i1, i2, i3, i4, i5, i6) -> (i1, i2, i3, i4, i5, i6) 96 …ate @callee(tuple<>, i1, tuple<i2>, i3, tuple<i4, i5>, i6) -> (tuple<>, i1, tuple<i2>, i3, tuple<i… 103 // CHECK-SAME: %[[I5:.*]]: i5, 104 // CHECK-SAME: %[[I6:.*]]: i6) -> (i1, i2, i3, i4, i5, i6) { 105 …HECK: %[[ARG_TUPLE:.*]] = "test.make_tuple"(%[[I4]], %[[I5]]) : (i4, i5) -> tuple<i4, i5> 107 …G_TUPLE_1:.*]] = "test.get_tuple_element"(%[[ARG_TUPLE]]) {index = 1 : i32} : (tuple<i4, i5>) -> i5 108 …%[[ARG_TUPLE_0]], %[[ARG_TUPLE_1]], %[[I6]]) : (i1, i2, i3, i4, i5, i6) -> (i1, i2, i3, i4, i5, i6) 109 … %[[RET_TUPLE:.*]] = "test.make_tuple"(%[[CALL]]#3, %[[CALL]]#4) : (i4, i5) -> tuple<i4, i5> 111 …T_TUPLE_1:.*]] = "test.get_tuple_element"(%[[RET_TUPLE]]) {index = 1 : i32} : (tuple<i4, i5>) -> i5 113 …%arg2: tuple<i2>, %arg3: i3, %arg4: tuple<i4, i5>, %arg5: i6) -> (tuple<>, i1, tuple<i2>, i3, tupl… [all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/SPARC/ |
| H A D | smulo-128-legalisation-lowering.ll | 23 ; SPARC-NEXT: mov %i5, %o1 32 ; SPARC-NEXT: st %i5, [%sp+96] 86 ; SPARC-NEXT: addxcc %o2, %i5, %i5 122 ; SPARC-NEXT: xor %i5, %g2, %i5 157 ; SPARC64-NEXT: mov %o1, %i5 167 ; SPARC64-NEXT: addcc %o1, %i5, %i5 172 ; SPARC64-NEXT: mov 0, %i5 173 ; SPARC64-NEXT: mov %i5, %o0 175 ; SPARC64-NEXT: mov %i5, %o2 222 ; SPARC64-NEXT: addxcc %i5, %l3, %i5 [all …]
|
| /llvm-project-15.0.7/mlir/test/Dialect/Affine/ |
| H A D | slicing-utils.mlir | 23 // FWD-NEXT: %[[v5:.*]] {{.*}} -> i5 36 // FWDBWD-NEXT: %[[v5:.*]] = "slicing-test-op"(%[[v1]], %[[v2]]) : (i1, i2) -> i5 37 // FWDBWD-DAG: %[[v8:.*]] = "slicing-test-op"(%[[v5]], %[[v6]]) : (i5, i6) -> i8 38 // FWDBWD-DAG: %[[v7:.*]] = "slicing-test-op"(%[[v1]], %[[v5]]) : (i1, i5) -> i7 44 // FWD-NEXT: %[[v5:.*]] {{.*}} -> i5 58 // FWDBWD-DAG: %[[v8:.*]] = "slicing-test-op"(%[[v5]], %[[v6]]) : (i5, i6) -> i8 59 // FWDBWD-DAG: %[[v7:.*]] = "slicing-test-op"(%[[v1]], %[[v5]]) : (i1, i5) -> i7 124 %5 = "slicing-test-op" (%1, %2) : (i1, i2) -> i5 161 // FWDBWD: %[[v5:.*]] = "slicing-test-op"(%[[v1]], %[[v2]]) : (i1, i2) -> i5 166 %7 = "slicing-test-op" (%1, %5) : (i1, i5) -> i7 [all …]
|
| /llvm-project-15.0.7/llvm/test/Transforms/IndVarSimplify/ |
| H A D | loop_evaluate_5.ll | 7 define i32 @testcase(i5 zeroext %k) nounwind readnone { 18 %k_01 = phi i5 [ %indvar_next1, %bb2 ], [ 0, %bb.nph ] ; <i5> [#uses=2] 19 %tmp2 = zext i5 %k_01 to i32 ; <i32> [#uses=1] 21 %indvar_next1 = add i5 %k_01, 1 ; <i5> [#uses=2] 25 %phitmp = icmp eq i5 %indvar_next1, -16 ; <i1> [#uses=1]
|