[llvm] b6f6501 - [CostModel][AArch64] Add tests for bitreverse. NFC.

[Sjoerd Meijer via llvm-commits]

Author: Sjoerd Meijer
Date: 2021-05-26T14:56:58+01:00
New Revision: b6f6501b2412ffaf5d7dce539de3c382b1cf9b64

URL: https://github.com/llvm/llvm-project/commit/b6f6501b2412ffaf5d7dce539de3c382b1cf9b64
DIFF: https://github.com/llvm/llvm-project/commit/b6f6501b2412ffaf5d7dce539de3c382b1cf9b64.diff

LOG: [CostModel][AArch64] Add tests for bitreverse. NFC.

Added: 
    llvm/test/Analysis/CostModel/AArch64/bitreverse.ll

Modified: 
    

Removed: 
    


################################################################################
diff  --git a/llvm/test/Analysis/CostModel/AArch64/bitreverse.ll b/llvm/test/Analysis/CostModel/AArch64/bitreverse.ll
new file mode 100644
index 0000000000000..9bbb89ae74e2b
--- /dev/null
+++ b/llvm/test/Analysis/CostModel/AArch64/bitreverse.ll
@@ -0,0 +1,129 @@
+; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
+; RUN: opt < %s -mtriple=aarch64-unknown-linux-gnu -cost-model -analyze | FileCheck %s
+
+; Verify the cost of scalar bitreverse instructions.
+
+declare  i8 @llvm.bitreverse.i8(i8)
+declare i16 @llvm.bitreverse.i16(i16)
+declare i32 @llvm.bitreverse.i32(i32)
+declare i64 @llvm.bitreverse.i64(i64)
+
+define i64 @var_bitreverse_i64(i64 %a) {
+; CHECK-LABEL: 'var_bitreverse_i64'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 1 for instruction: %bitreverse = call i64 @llvm.bitreverse.i64(i64 %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret i64 %bitreverse
+;
+  %bitreverse = call i64 @llvm.bitreverse.i64(i64 %a)
+  ret i64 %bitreverse
+}
+
+define i32 @var_bitreverse_i32(i32 %a) {
+; CHECK-LABEL: 'var_bitreverse_i32'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 1 for instruction: %bitreverse = call i32 @llvm.bitreverse.i32(i32 %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret i32 %bitreverse
+;
+  %bitreverse = call i32 @llvm.bitreverse.i32(i32 %a)
+  ret i32 %bitreverse
+}
+
+define i16 @var_bitreverse_i16(i16 %a) {
+; CHECK-LABEL: 'var_bitreverse_i16'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 1 for instruction: %bitreverse = call i16 @llvm.bitreverse.i16(i16 %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret i16 %bitreverse
+;
+  %bitreverse = call i16 @llvm.bitreverse.i16(i16 %a)
+  ret i16 %bitreverse
+}
+
+define i8 @var_bitreverse_i8(i8 %a) {
+; CHECK-LABEL: 'var_bitreverse_i8'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 1 for instruction: %bitreverse = call i8 @llvm.bitreverse.i8(i8 %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret i8 %bitreverse
+;
+  %bitreverse = call i8 @llvm.bitreverse.i8(i8 %a)
+  ret i8 %bitreverse
+}
+
+; Verify the cost of vector bitreverse instructions.
+
+declare <2 x i64> @llvm.bitreverse.v2i64(<2 x i64>)
+declare <4 x i32> @llvm.bitreverse.v4i32(<4 x i32>)
+declare <8 x i16> @llvm.bitreverse.v8i16(<8 x i16>)
+declare <16 x i8> @llvm.bitreverse.v16i8(<16 x i8>)
+
+declare <4 x i64> @llvm.bitreverse.v4i64(<4 x i64>)
+declare <8 x i32> @llvm.bitreverse.v8i32(<8 x i32>)
+declare <16 x i16> @llvm.bitreverse.v16i16(<16 x i16>)
+declare <32 x i8> @llvm.bitreverse.v32i8(<32 x i8>)
+
+define <2 x i64> @var_bitreverse_v2i64(<2 x i64> %a) {
+; CHECK-LABEL: 'var_bitreverse_v2i64'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 8 for instruction: %bitreverse = call <2 x i64> @llvm.bitreverse.v2i64(<2 x i64> %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret <2 x i64> %bitreverse
+;
+  %bitreverse = call <2 x i64> @llvm.bitreverse.v2i64(<2 x i64> %a)
+  ret <2 x i64> %bitreverse
+}
+
+define <4 x i64> @var_bitreverse_v4i64(<4 x i64> %a) {
+; CHECK-LABEL: 'var_bitreverse_v4i64'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 16 for instruction: %bitreverse = call <4 x i64> @llvm.bitreverse.v4i64(<4 x i64> %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret <4 x i64> %bitreverse
+;
+  %bitreverse = call <4 x i64> @llvm.bitreverse.v4i64(<4 x i64> %a)
+  ret <4 x i64> %bitreverse
+}
+
+define <4 x i32> @var_bitreverse_v4i32(<4 x i32> %a) {
+; CHECK-LABEL: 'var_bitreverse_v4i32'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 22 for instruction: %bitreverse = call <4 x i32> @llvm.bitreverse.v4i32(<4 x i32> %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret <4 x i32> %bitreverse
+;
+  %bitreverse = call <4 x i32> @llvm.bitreverse.v4i32(<4 x i32> %a)
+  ret <4 x i32> %bitreverse
+}
+
+define <8 x i32> @var_bitreverse_v8i32(<8 x i32> %a) {
+; CHECK-LABEL: 'var_bitreverse_v8i32'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 44 for instruction: %bitreverse = call <8 x i32> @llvm.bitreverse.v8i32(<8 x i32> %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret <8 x i32> %bitreverse
+;
+  %bitreverse = call <8 x i32> @llvm.bitreverse.v8i32(<8 x i32> %a)
+  ret <8 x i32> %bitreverse
+}
+
+define <8 x i16> @var_bitreverse_v8i16(<8 x i16> %a) {
+; CHECK-LABEL: 'var_bitreverse_v8i16'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 50 for instruction: %bitreverse = call <8 x i16> @llvm.bitreverse.v8i16(<8 x i16> %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret <8 x i16> %bitreverse
+;
+  %bitreverse = call <8 x i16> @llvm.bitreverse.v8i16(<8 x i16> %a)
+  ret <8 x i16> %bitreverse
+}
+
+define <16 x i16> @var_bitreverse_v16i16(<16 x i16> %a) {
+; CHECK-LABEL: 'var_bitreverse_v16i16'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 100 for instruction: %bitreverse = call <16 x i16> @llvm.bitreverse.v16i16(<16 x i16> %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret <16 x i16> %bitreverse
+;
+  %bitreverse = call <16 x i16> @llvm.bitreverse.v16i16(<16 x i16> %a)
+  ret <16 x i16> %bitreverse
+}
+
+define <16 x i8> @var_bitreverse_v16i8(<16 x i8> %a) {
+; CHECK-LABEL: 'var_bitreverse_v16i8'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 1 for instruction: %bitreverse = call <16 x i8> @llvm.bitreverse.v16i8(<16 x i8> %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret <16 x i8> %bitreverse
+;
+  %bitreverse = call <16 x i8> @llvm.bitreverse.v16i8(<16 x i8> %a)
+  ret <16 x i8> %bitreverse
+}
+
+define <32 x i8> @var_bitreverse_v32i8(<32 x i8> %a) {
+; CHECK-LABEL: 'var_bitreverse_v32i8'
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 4 for instruction: %bitreverse = call <32 x i8> @llvm.bitreverse.v32i8(<32 x i8> %a)
+; CHECK-NEXT:  Cost Model: Found an estimated cost of 0 for instruction: ret <32 x i8> %bitreverse
+;
+  %bitreverse = call <32 x i8> @llvm.bitreverse.v32i8(<32 x i8> %a)
+  ret <32 x i8> %bitreverse
+}