Skip to content

Commit 668edb4

Browse files
davemgreendavemgreen
committed
[AArch64] Update more costmodel tests with -cost-kind=all. NFC
1 parent 980d66c commit 668edb4

File tree

11 files changed

+399
-397
lines changed

11 files changed

+399
-397
lines changed

‎llvm/test/Analysis/CostModel/AArch64/bitreverse.ll

Lines changed: 33 additions & 33 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
2-
; RUN: opt < %s -mtriple=aarch64-linux-gnu -passes="print<cost-model>" 2>&1 -disable-output | FileCheck %s
2+
; RUN: opt < %s -mtriple=aarch64-linux-gnu -passes="print<cost-model>" -cost-kind=all 2>&1 -disable-output | FileCheck %s
33

44
; Verify the cost of scalar bitreverse instructions.
55

@@ -12,35 +12,35 @@ declare i64 @llvm.bitreverse.i64(i64)
1212

1313
define i64 @var_bitreverse_i64(i64 %a) {
1414
; CHECK-LABEL: 'var_bitreverse_i64'
15-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %bitreverse = call i64 @llvm.bitreverse.i64(i64 %a)
16-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret i64 %bitreverse
15+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %bitreverse = call i64 @llvm.bitreverse.i64(i64 %a)
16+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret i64 %bitreverse
1717
;
1818
%bitreverse = call i64 @llvm.bitreverse.i64(i64 %a)
1919
ret i64 %bitreverse
2020
}
2121

2222
define i32 @var_bitreverse_i32(i32 %a) {
2323
; CHECK-LABEL: 'var_bitreverse_i32'
24-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %bitreverse = call i32 @llvm.bitreverse.i32(i32 %a)
25-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret i32 %bitreverse
24+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %bitreverse = call i32 @llvm.bitreverse.i32(i32 %a)
25+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret i32 %bitreverse
2626
;
2727
%bitreverse = call i32 @llvm.bitreverse.i32(i32 %a)
2828
ret i32 %bitreverse
2929
}
3030

3131
define i16 @var_bitreverse_i16(i16 %a) {
3232
; CHECK-LABEL: 'var_bitreverse_i16'
33-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %bitreverse = call i16 @llvm.bitreverse.i16(i16 %a)
34-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret i16 %bitreverse
33+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %bitreverse = call i16 @llvm.bitreverse.i16(i16 %a)
34+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret i16 %bitreverse
3535
;
3636
%bitreverse = call i16 @llvm.bitreverse.i16(i16 %a)
3737
ret i16 %bitreverse
3838
}
3939

4040
define i8 @var_bitreverse_i8(i8 %a) {
4141
; CHECK-LABEL: 'var_bitreverse_i8'
42-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %bitreverse = call i8 @llvm.bitreverse.i8(i8 %a)
43-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret i8 %bitreverse
42+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %bitreverse = call i8 @llvm.bitreverse.i8(i8 %a)
43+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret i8 %bitreverse
4444
;
4545
%bitreverse = call i8 @llvm.bitreverse.i8(i8 %a)
4646
ret i8 %bitreverse
@@ -65,107 +65,107 @@ declare <32 x i8> @llvm.bitreverse.v32i8(<32 x i8>)
6565

6666
define <1 x i64> @var_bitreverse_v1i64(<1 x i64> %a) {
6767
; CHECK-LABEL: 'var_bitreverse_v1i64'
68-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %bitreverse = call <1 x i64> @llvm.bitreverse.v1i64(<1 x i64> %a)
69-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <1 x i64> %bitreverse
68+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %bitreverse = call <1 x i64> @llvm.bitreverse.v1i64(<1 x i64> %a)
69+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <1 x i64> %bitreverse
7070
;
7171
%bitreverse = call <1 x i64> @llvm.bitreverse.v1i64(<1 x i64> %a)
7272
ret <1 x i64> %bitreverse
7373
}
7474

7575
define <2 x i64> @var_bitreverse_v2i64(<2 x i64> %a) {
7676
; CHECK-LABEL: 'var_bitreverse_v2i64'
77-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %bitreverse = call <2 x i64> @llvm.bitreverse.v2i64(<2 x i64> %a)
78-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <2 x i64> %bitreverse
77+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %bitreverse = call <2 x i64> @llvm.bitreverse.v2i64(<2 x i64> %a)
78+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <2 x i64> %bitreverse
7979
;
8080
%bitreverse = call <2 x i64> @llvm.bitreverse.v2i64(<2 x i64> %a)
8181
ret <2 x i64> %bitreverse
8282
}
8383

8484
define <4 x i64> @var_bitreverse_v4i64(<4 x i64> %a) {
8585
; CHECK-LABEL: 'var_bitreverse_v4i64'
86-
; CHECK-NEXT: Cost Model: Found an estimated cost of 4 for instruction: %bitreverse = call <4 x i64> @llvm.bitreverse.v4i64(<4 x i64> %a)
87-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <4 x i64> %bitreverse
86+
; CHECK-NEXT: Cost Model: Found costs of 4 for: %bitreverse = call <4 x i64> @llvm.bitreverse.v4i64(<4 x i64> %a)
87+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <4 x i64> %bitreverse
8888
;
8989
%bitreverse = call <4 x i64> @llvm.bitreverse.v4i64(<4 x i64> %a)
9090
ret <4 x i64> %bitreverse
9191
}
9292

9393
define <2 x i32> @var_bitreverse_v2i32(<2 x i32> %a) {
9494
; CHECK-LABEL: 'var_bitreverse_v2i32'
95-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %bitreverse = call <2 x i32> @llvm.bitreverse.v2i32(<2 x i32> %a)
96-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <2 x i32> %bitreverse
95+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %bitreverse = call <2 x i32> @llvm.bitreverse.v2i32(<2 x i32> %a)
96+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <2 x i32> %bitreverse
9797
;
9898
%bitreverse = call <2 x i32> @llvm.bitreverse.v2i32(<2 x i32> %a)
9999
ret <2 x i32> %bitreverse
100100
}
101101

102102
define <4 x i32> @var_bitreverse_v4i32(<4 x i32> %a) {
103103
; CHECK-LABEL: 'var_bitreverse_v4i32'
104-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %bitreverse = call <4 x i32> @llvm.bitreverse.v4i32(<4 x i32> %a)
105-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <4 x i32> %bitreverse
104+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %bitreverse = call <4 x i32> @llvm.bitreverse.v4i32(<4 x i32> %a)
105+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <4 x i32> %bitreverse
106106
;
107107
%bitreverse = call <4 x i32> @llvm.bitreverse.v4i32(<4 x i32> %a)
108108
ret <4 x i32> %bitreverse
109109
}
110110

111111
define <8 x i32> @var_bitreverse_v8i32(<8 x i32> %a) {
112112
; CHECK-LABEL: 'var_bitreverse_v8i32'
113-
; CHECK-NEXT: Cost Model: Found an estimated cost of 4 for instruction: %bitreverse = call <8 x i32> @llvm.bitreverse.v8i32(<8 x i32> %a)
114-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <8 x i32> %bitreverse
113+
; CHECK-NEXT: Cost Model: Found costs of 4 for: %bitreverse = call <8 x i32> @llvm.bitreverse.v8i32(<8 x i32> %a)
114+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <8 x i32> %bitreverse
115115
;
116116
%bitreverse = call <8 x i32> @llvm.bitreverse.v8i32(<8 x i32> %a)
117117
ret <8 x i32> %bitreverse
118118
}
119119

120120
define <4 x i16> @var_bitreverse_v4i16(<4 x i16> %a) {
121121
; CHECK-LABEL: 'var_bitreverse_v4i16'
122-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %bitreverse = call <4 x i16> @llvm.bitreverse.v4i16(<4 x i16> %a)
123-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <4 x i16> %bitreverse
122+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %bitreverse = call <4 x i16> @llvm.bitreverse.v4i16(<4 x i16> %a)
123+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <4 x i16> %bitreverse
124124
;
125125
%bitreverse = call <4 x i16> @llvm.bitreverse.v4i16(<4 x i16> %a)
126126
ret <4 x i16> %bitreverse
127127
}
128128

129129
define <8 x i16> @var_bitreverse_v8i16(<8 x i16> %a) {
130130
; CHECK-LABEL: 'var_bitreverse_v8i16'
131-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %bitreverse = call <8 x i16> @llvm.bitreverse.v8i16(<8 x i16> %a)
132-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <8 x i16> %bitreverse
131+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %bitreverse = call <8 x i16> @llvm.bitreverse.v8i16(<8 x i16> %a)
132+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <8 x i16> %bitreverse
133133
;
134134
%bitreverse = call <8 x i16> @llvm.bitreverse.v8i16(<8 x i16> %a)
135135
ret <8 x i16> %bitreverse
136136
}
137137

138138
define <16 x i16> @var_bitreverse_v16i16(<16 x i16> %a) {
139139
; CHECK-LABEL: 'var_bitreverse_v16i16'
140-
; CHECK-NEXT: Cost Model: Found an estimated cost of 4 for instruction: %bitreverse = call <16 x i16> @llvm.bitreverse.v16i16(<16 x i16> %a)
141-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <16 x i16> %bitreverse
140+
; CHECK-NEXT: Cost Model: Found costs of 4 for: %bitreverse = call <16 x i16> @llvm.bitreverse.v16i16(<16 x i16> %a)
141+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <16 x i16> %bitreverse
142142
;
143143
%bitreverse = call <16 x i16> @llvm.bitreverse.v16i16(<16 x i16> %a)
144144
ret <16 x i16> %bitreverse
145145
}
146146

147147
define <8 x i8> @var_bitreverse_v8i8(<8 x i8> %a) {
148148
; CHECK-LABEL: 'var_bitreverse_v8i8'
149-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %bitreverse = call <8 x i8> @llvm.bitreverse.v8i8(<8 x i8> %a)
150-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <8 x i8> %bitreverse
149+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %bitreverse = call <8 x i8> @llvm.bitreverse.v8i8(<8 x i8> %a)
150+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <8 x i8> %bitreverse
151151
;
152152
%bitreverse = call <8 x i8> @llvm.bitreverse.v8i8(<8 x i8> %a)
153153
ret <8 x i8> %bitreverse
154154
}
155155

156156
define <16 x i8> @var_bitreverse_v16i8(<16 x i8> %a) {
157157
; CHECK-LABEL: 'var_bitreverse_v16i8'
158-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %bitreverse = call <16 x i8> @llvm.bitreverse.v16i8(<16 x i8> %a)
159-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <16 x i8> %bitreverse
158+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %bitreverse = call <16 x i8> @llvm.bitreverse.v16i8(<16 x i8> %a)
159+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <16 x i8> %bitreverse
160160
;
161161
%bitreverse = call <16 x i8> @llvm.bitreverse.v16i8(<16 x i8> %a)
162162
ret <16 x i8> %bitreverse
163163
}
164164

165165
define <32 x i8> @var_bitreverse_v32i8(<32 x i8> %a) {
166166
; CHECK-LABEL: 'var_bitreverse_v32i8'
167-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %bitreverse = call <32 x i8> @llvm.bitreverse.v32i8(<32 x i8> %a)
168-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret <32 x i8> %bitreverse
167+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %bitreverse = call <32 x i8> @llvm.bitreverse.v32i8(<32 x i8> %a)
168+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret <32 x i8> %bitreverse
169169
;
170170
%bitreverse = call <32 x i8> @llvm.bitreverse.v32i8(<32 x i8> %a)
171171
ret <32 x i8> %bitreverse

‎llvm/test/Analysis/CostModel/AArch64/bswap.ll

Lines changed: 16 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 2
2-
; RUN: opt -passes="print<cost-model>" 2>&1 -disable-output -mtriple=aarch64--linux-gnu < %s | FileCheck %s
2+
; RUN: opt -passes="print<cost-model>" -cost-kind=all 2>&1 -disable-output -mtriple=aarch64--linux-gnu < %s | FileCheck %s
33

44
; Verify the cost of bswap instructions.
55

@@ -22,10 +22,10 @@ declare <4 x i48> @llvm.bswap.v4i48(<4 x i48>)
2222

2323
define void @scalar() {
2424
; CHECK-LABEL: 'scalar'
25-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %b16 = call i16 @llvm.bswap.i16(i16 undef)
26-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %b32 = call i32 @llvm.bswap.i32(i32 undef)
27-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %b64 = call i64 @llvm.bswap.i64(i64 undef)
28-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret void
25+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %b16 = call i16 @llvm.bswap.i16(i16 undef)
26+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %b32 = call i32 @llvm.bswap.i32(i32 undef)
27+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %b64 = call i64 @llvm.bswap.i64(i64 undef)
28+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret void
2929
;
3030
%b16 = call i16 @llvm.bswap.i16(i16 undef)
3131
%b32 = call i32 @llvm.bswap.i32(i32 undef)
@@ -35,17 +35,17 @@ define void @scalar() {
3535

3636
define void @neon() {
3737
; CHECK-LABEL: 'neon'
38-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %v4i16 = call <4 x i16> @llvm.bswap.v4i16(<4 x i16> undef)
39-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %v8i16 = call <8 x i16> @llvm.bswap.v8i16(<8 x i16> undef)
40-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %v16i16 = call <16 x i16> @llvm.bswap.v16i16(<16 x i16> undef)
41-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %v2i32 = call <2 x i32> @llvm.bswap.v2i32(<2 x i32> undef)
42-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %v4i32 = call <4 x i32> @llvm.bswap.v4i32(<4 x i32> undef)
43-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %v8i32 = call <8 x i32> @llvm.bswap.v8i32(<8 x i32> undef)
44-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %v2i64 = call <2 x i64> @llvm.bswap.v2i64(<2 x i64> undef)
45-
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %v4i64 = call <4 x i64> @llvm.bswap.v4i64(<4 x i64> undef)
46-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %v3i32 = call <3 x i32> @llvm.bswap.v3i32(<3 x i32> undef)
47-
; CHECK-NEXT: Cost Model: Found an estimated cost of 12 for instruction: %v4i48 = call <4 x i48> @llvm.bswap.v4i48(<4 x i48> undef)
48-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret void
38+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %v4i16 = call <4 x i16> @llvm.bswap.v4i16(<4 x i16> undef)
39+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %v8i16 = call <8 x i16> @llvm.bswap.v8i16(<8 x i16> undef)
40+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %v16i16 = call <16 x i16> @llvm.bswap.v16i16(<16 x i16> undef)
41+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %v2i32 = call <2 x i32> @llvm.bswap.v2i32(<2 x i32> undef)
42+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %v4i32 = call <4 x i32> @llvm.bswap.v4i32(<4 x i32> undef)
43+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %v8i32 = call <8 x i32> @llvm.bswap.v8i32(<8 x i32> undef)
44+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %v2i64 = call <2 x i64> @llvm.bswap.v2i64(<2 x i64> undef)
45+
; CHECK-NEXT: Cost Model: Found costs of 2 for: %v4i64 = call <4 x i64> @llvm.bswap.v4i64(<4 x i64> undef)
46+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %v3i32 = call <3 x i32> @llvm.bswap.v3i32(<3 x i32> undef)
47+
; CHECK-NEXT: Cost Model: Found costs of 12 for: %v4i48 = call <4 x i48> @llvm.bswap.v4i48(<4 x i48> undef)
48+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret void
4949
;
5050
%v4i16 = call <4 x i16> @llvm.bswap.v4i16(<4 x i16> undef)
5151
%v8i16 = call <8 x i16> @llvm.bswap.v8i16(<8 x i16> undef)

‎llvm/test/Analysis/CostModel/AArch64/cost-scalable-vector-gep.ll

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 2
2-
; RUN: opt -passes="print<cost-model>" 2>&1 -disable-output -mtriple=aarch64--linux-gnu -mattr=+sve < %s | FileCheck %s
2+
; RUN: opt -passes="print<cost-model>" -cost-kind=all 2>&1 -disable-output -mtriple=aarch64--linux-gnu -mattr=+sve < %s | FileCheck %s
33

44
; This regression test is verifying that a GEP instruction performed on a
55
; scalable vector does not produce a 'assumption that TypeSize is not scalable'
@@ -9,11 +9,11 @@ target datalayout = "e-m:e-i8:8:32-i16:16:32-i64:64-i128:128-n32:64-S128"
99

1010
define void @gep_scalable_types(ptr %ptr) {
1111
; CHECK-LABEL: 'gep_scalable_types'
12-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %gep1 = getelementptr <vscale x 16 x i8>, ptr %ptr, i32 2
13-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %gep2 = getelementptr [2 x <vscale x 16 x i8>], ptr %ptr, i32 2
14-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %gep3 = getelementptr target("aarch64.svcount"), ptr %ptr, i32 2
15-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %gep4 = getelementptr [2 x target("aarch64.svcount")], ptr %ptr, i32 2
16-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret void
12+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %gep1 = getelementptr <vscale x 16 x i8>, ptr %ptr, i32 2
13+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %gep2 = getelementptr [2 x <vscale x 16 x i8>], ptr %ptr, i32 2
14+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %gep3 = getelementptr target("aarch64.svcount"), ptr %ptr, i32 2
15+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %gep4 = getelementptr [2 x target("aarch64.svcount")], ptr %ptr, i32 2
16+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret void
1717
;
1818
%gep1 = getelementptr <vscale x 16 x i8>, ptr %ptr, i32 2
1919
%gep2 = getelementptr [2 x <vscale x 16 x i8>], ptr %ptr, i32 2
@@ -24,9 +24,9 @@ define void @gep_scalable_types(ptr %ptr) {
2424

2525
define ptr @sext_gep(ptr %p, i32 %a) {
2626
; CHECK-LABEL: 'sext_gep'
27-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %b = sext i32 %a to i64
28-
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %r = getelementptr <vscale x 8 x half>, ptr %p, i64 %b
29-
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret ptr %r
27+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %b = sext i32 %a to i64
28+
; CHECK-NEXT: Cost Model: Found costs of 1 for: %r = getelementptr <vscale x 8 x half>, ptr %p, i64 %b
29+
; CHECK-NEXT: Cost Model: Found costs of RThru:0 CodeSize:1 Lat:1 SizeLat:1 for: ret ptr %r
3030
;
3131
%b = sext i32 %a to i64
3232
%r = getelementptr <vscale x 8 x half>, ptr %p, i64 %b

0 commit comments

Comments
 (0)