mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-01-31 12:41:49 +01:00
[Cost]Add tests for boolean and/or reductions, NFC.
Tests with the default costs for boolean and/or reductions. Differential Revision: https://reviews.llvm.org/D97793
This commit is contained in:
parent
db90a04542
commit
73ba017fcc
34
test/Analysis/CostModel/AArch64/reduce-and.ll
Normal file
34
test/Analysis/CostModel/AArch64/reduce-and.ll
Normal file
@ -0,0 +1,34 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=aarch64-unknown-linux-gnu -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 38 for instruction: %V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 129 for instruction: %V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 364 for instruction: %V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 455 for instruction: %V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 637 for instruction: %V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1001 for instruction: %V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.and.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v128i1(<128 x i1>)
|
34
test/Analysis/CostModel/AArch64/reduce-or.ll
Normal file
34
test/Analysis/CostModel/AArch64/reduce-or.ll
Normal file
@ -0,0 +1,34 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=aarch64-unknown-linux-gnu -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 2 for instruction: %V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 38 for instruction: %V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 129 for instruction: %V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 364 for instruction: %V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 455 for instruction: %V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 637 for instruction: %V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1001 for instruction: %V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.or.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v128i1(<128 x i1>)
|
34
test/Analysis/CostModel/AMDGPU/reduce-and.ll
Normal file
34
test/Analysis/CostModel/AMDGPU/reduce-and.ll
Normal file
@ -0,0 +1,34 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=amdgcn-unknown-amdhsa -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 4 for instruction: %V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 10 for instruction: %V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 22 for instruction: %V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 46 for instruction: %V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 94 for instruction: %V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 190 for instruction: %V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 382 for instruction: %V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 10 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.and.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v128i1(<128 x i1>)
|
34
test/Analysis/CostModel/AMDGPU/reduce-or.ll
Normal file
34
test/Analysis/CostModel/AMDGPU/reduce-or.ll
Normal file
@ -0,0 +1,34 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=amdgcn-unknown-amdhsa -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 4 for instruction: %V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 10 for instruction: %V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 22 for instruction: %V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 46 for instruction: %V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 94 for instruction: %V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 190 for instruction: %V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 382 for instruction: %V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 10 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.or.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v128i1(<128 x i1>)
|
34
test/Analysis/CostModel/ARM/reduce-and.ll
Normal file
34
test/Analysis/CostModel/ARM/reduce-and.ll
Normal file
@ -0,0 +1,34 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=armv8a-linux-gnueabihf -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 3 for instruction: %V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 16 for instruction: %V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 53 for instruction: %V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 150 for instruction: %V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 391 for instruction: %V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 488 for instruction: %V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 682 for instruction: %V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1070 for instruction: %V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.and.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v128i1(<128 x i1>)
|
34
test/Analysis/CostModel/ARM/reduce-or.ll
Normal file
34
test/Analysis/CostModel/ARM/reduce-or.ll
Normal file
@ -0,0 +1,34 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=armv8a-linux-gnueabihf -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 3 for instruction: %V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 16 for instruction: %V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 53 for instruction: %V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 150 for instruction: %V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 391 for instruction: %V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 488 for instruction: %V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 682 for instruction: %V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1070 for instruction: %V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.or.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v128i1(<128 x i1>)
|
34
test/Analysis/CostModel/PowerPC/reduce-and.ll
Normal file
34
test/Analysis/CostModel/PowerPC/reduce-and.ll
Normal file
@ -0,0 +1,34 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=powerpc64-unknown-linux-gnu -mcpu=pwr8 -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 3 for instruction: %V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 5 for instruction: %V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 7 for instruction: %V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 9 for instruction: %V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 11 for instruction: %V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 14 for instruction: %V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 20 for instruction: %V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 32 for instruction: %V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.and.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v128i1(<128 x i1>)
|
34
test/Analysis/CostModel/PowerPC/reduce-or.ll
Normal file
34
test/Analysis/CostModel/PowerPC/reduce-or.ll
Normal file
@ -0,0 +1,34 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=powerpc64-unknown-linux-gnu -mcpu=pwr8 -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 3 for instruction: %V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 5 for instruction: %V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 7 for instruction: %V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 9 for instruction: %V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 11 for instruction: %V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 14 for instruction: %V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 20 for instruction: %V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 32 for instruction: %V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 0 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.or.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v128i1(<128 x i1>)
|
35
test/Analysis/CostModel/RISCV/reduce-and.ll
Normal file
35
test/Analysis/CostModel/RISCV/reduce-and.ll
Normal file
@ -0,0 +1,35 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=riscv32 -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
; RUN: opt < %s -mtriple=riscv64 -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 4 for instruction: %V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 10 for instruction: %V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 22 for instruction: %V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 46 for instruction: %V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 94 for instruction: %V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 190 for instruction: %V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 382 for instruction: %V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.and.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v128i1(<128 x i1>)
|
35
test/Analysis/CostModel/RISCV/reduce-or.ll
Normal file
35
test/Analysis/CostModel/RISCV/reduce-or.ll
Normal file
@ -0,0 +1,35 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=riscv32 -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
; RUN: opt < %s -mtriple=riscv64 -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 4 for instruction: %V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 10 for instruction: %V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 22 for instruction: %V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 46 for instruction: %V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 94 for instruction: %V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 190 for instruction: %V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 382 for instruction: %V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.or.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v128i1(<128 x i1>)
|
34
test/Analysis/CostModel/SystemZ/reduce-and.ll
Normal file
34
test/Analysis/CostModel/SystemZ/reduce-and.ll
Normal file
@ -0,0 +1,34 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=systemz-unknown -mcpu=z13 -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 3 for instruction: %V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 5 for instruction: %V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 7 for instruction: %V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 9 for instruction: %V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 11 for instruction: %V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 13 for instruction: %V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 16 for instruction: %V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 21 for instruction: %V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.and.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.and.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.and.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.and.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.and.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.and.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.and.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.and.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.and.v128i1(<128 x i1>)
|
34
test/Analysis/CostModel/SystemZ/reduce-or.ll
Normal file
34
test/Analysis/CostModel/SystemZ/reduce-or.ll
Normal file
@ -0,0 +1,34 @@
|
||||
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||
; RUN: opt < %s -mtriple=systemz-unknown -mcpu=z13 -cost-model -cost-kind=throughput -analyze | FileCheck %s
|
||||
|
||||
define i32 @reduce_i1(i32 %arg) {
|
||||
; CHECK-LABEL: 'reduce_i1'
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 3 for instruction: %V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 5 for instruction: %V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 7 for instruction: %V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 9 for instruction: %V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 11 for instruction: %V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 13 for instruction: %V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 16 for instruction: %V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 21 for instruction: %V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
; CHECK-NEXT: Cost Model: Found an estimated cost of 1 for instruction: ret i32 undef
|
||||
;
|
||||
%V1 = call i1 @llvm.vector.reduce.or.v1i1(<1 x i1> undef)
|
||||
%V2 = call i1 @llvm.vector.reduce.or.v2i1(<2 x i1> undef)
|
||||
%V4 = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> undef)
|
||||
%V8 = call i1 @llvm.vector.reduce.or.v8i1(<8 x i1> undef)
|
||||
%V16 = call i1 @llvm.vector.reduce.or.v16i1(<16 x i1> undef)
|
||||
%V32 = call i1 @llvm.vector.reduce.or.v32i1(<32 x i1> undef)
|
||||
%V64 = call i1 @llvm.vector.reduce.or.v64i1(<64 x i1> undef)
|
||||
%V128 = call i1 @llvm.vector.reduce.or.v128i1(<128 x i1> undef)
|
||||
ret i32 undef
|
||||
}
|
||||
|
||||
declare i1 @llvm.vector.reduce.or.v1i1(<1 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v2i1(<2 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v4i1(<4 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v8i1(<8 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v16i1(<16 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v32i1(<32 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v64i1(<64 x i1>)
|
||||
declare i1 @llvm.vector.reduce.or.v128i1(<128 x i1>)
|
Loading…
x
Reference in New Issue
Block a user