1
- // RUN: mlir-opt -split-input-file -convert-arith-to-spirv=enable-fast-math -verify-diagnostics %s | FileCheck %s
1
+ // RUN: mlir-opt -split-input-file -convert-arith-to-spirv -verify-diagnostics %s | FileCheck %s
2
2
3
3
module attributes {
4
4
spirv.target_env = #spirv.target_env <#spirv.vce <v1.0 , [], []>, #spirv.resource_limits <>>
@@ -8,7 +8,7 @@ module attributes {
8
8
// CHECK-SAME: %[[LHS:.+]]: f32, %[[RHS:.+]]: f32
9
9
func.func @cmpf_ordered (%arg0 : f32 , %arg1 : f32 ) -> i1 {
10
10
// CHECK: %[[T:.+]] = spirv.Constant true
11
- %0 = arith.cmpf ord , %arg0 , %arg1 : f32
11
+ %0 = arith.cmpf ord , %arg0 , %arg1 fastmath < fast > : f32
12
12
// CHECK: return %[[T]]
13
13
return %0: i1
14
14
}
@@ -17,7 +17,7 @@ func.func @cmpf_ordered(%arg0 : f32, %arg1 : f32) -> i1 {
17
17
// CHECK-SAME: %[[LHS:.+]]: vector<4xf32>, %[[RHS:.+]]: vector<4xf32>
18
18
func.func @cmpf_unordered (%arg0 : vector <4 xf32 >, %arg1 : vector <4 xf32 >) -> vector <4 xi1 > {
19
19
// CHECK: %[[F:.+]] = spirv.Constant dense<false>
20
- %0 = arith.cmpf uno , %arg0 , %arg1 : vector <4 xf32 >
20
+ %0 = arith.cmpf uno , %arg0 , %arg1 fastmath < nnan > : vector <4 xf32 >
21
21
// CHECK: return %[[F]]
22
22
return %0: vector <4 xi1 >
23
23
}
@@ -34,7 +34,7 @@ module attributes {
34
34
// CHECK-SAME: %[[LHS:.+]]: f32, %[[RHS:.+]]: f32
35
35
func.func @minimumf (%arg0 : f32 , %arg1 : f32 ) -> f32 {
36
36
// CHECK: %[[F:.+]] = spirv.GL.FMin %[[LHS]], %[[RHS]]
37
- %0 = arith.minimumf %arg0 , %arg1 : f32
37
+ %0 = arith.minimumf %arg0 , %arg1 fastmath < fast > : f32
38
38
// CHECK: return %[[F]]
39
39
return %0: f32
40
40
}
@@ -43,7 +43,7 @@ func.func @minimumf(%arg0 : f32, %arg1 : f32) -> f32 {
43
43
// CHECK-SAME: %[[LHS:.+]]: vector<4xf32>, %[[RHS:.+]]: vector<4xf32>
44
44
func.func @maximumf (%arg0 : vector <4 xf32 >, %arg1 : vector <4 xf32 >) -> vector <4 xf32 > {
45
45
// CHECK: %[[F:.+]] = spirv.GL.FMax %[[LHS]], %[[RHS]]
46
- %0 = arith.maximumf %arg0 , %arg1 : vector <4 xf32 >
46
+ %0 = arith.maximumf %arg0 , %arg1 fastmath < fast > : vector <4 xf32 >
47
47
// CHECK: return %[[F]]
48
48
return %0: vector <4 xf32 >
49
49
}
@@ -52,7 +52,7 @@ func.func @maximumf(%arg0 : vector<4xf32>, %arg1 : vector<4xf32>) -> vector<4xf3
52
52
// CHECK-SAME: %[[LHS:.+]]: f32, %[[RHS:.+]]: f32
53
53
func.func @minnumf (%arg0 : f32 , %arg1 : f32 ) -> f32 {
54
54
// CHECK: %[[F:.+]] = spirv.GL.FMin %[[LHS]], %[[RHS]]
55
- %0 = arith.minnumf %arg0 , %arg1 : f32
55
+ %0 = arith.minnumf %arg0 , %arg1 fastmath < fast > : f32
56
56
// CHECK: return %[[F]]
57
57
return %0: f32
58
58
}
@@ -61,7 +61,7 @@ func.func @minnumf(%arg0 : f32, %arg1 : f32) -> f32 {
61
61
// CHECK-SAME: %[[LHS:.+]]: vector<4xf32>, %[[RHS:.+]]: vector<4xf32>
62
62
func.func @maxnumf (%arg0 : vector <4 xf32 >, %arg1 : vector <4 xf32 >) -> vector <4 xf32 > {
63
63
// CHECK: %[[F:.+]] = spirv.GL.FMax %[[LHS]], %[[RHS]]
64
- %0 = arith.maxnumf %arg0 , %arg1 : vector <4 xf32 >
64
+ %0 = arith.maxnumf %arg0 , %arg1 fastmath < fast > : vector <4 xf32 >
65
65
// CHECK: return %[[F]]
66
66
return %0: vector <4 xf32 >
67
67
}
0 commit comments