Lines Matching refs:f32

27 // CHECK-SAME:              %[[TENSOR:.*]]: tensor<f32>,
29 // CHECK-SAME:              %[[STEP:.*]]: index) -> tensor<f32> {
30 // CHECK:           %[[MEMREF:.*]] = bufferization.to_memref %[[TENSOR]] : memref<f32>
31 …6:.*]] = %[[LB]] to %[[UB]] step %[[STEP]] iter_args(%[[ITER:.*]] = %[[MEMREF]]) -> (memref<f32>) {
32 // CHECK:             scf.yield %[[ITER]] : memref<f32>
34 // CHECK:           %[[VAL_8:.*]] = bufferization.to_tensor %[[VAL_9:.*]] : memref<f32>
35 // CHECK:           return %[[VAL_8]] : tensor<f32>
37 func.func @for(%arg0: tensor<f32>, %lb: index, %ub: index, %step: index) -> tensor<f32> {
38   %ret = scf.for %iv = %lb to %ub step %step iter_args(%iter = %arg0) -> tensor<f32> {
39     scf.yield %iter : tensor<f32>
41   return %ret : tensor<f32>
49 ….func @if_correct_recursive_legalization_behavior(%pred: i1, %tensor: tensor<f32>) -> tensor<f32> {
50   %0 = scf.if %pred -> (tensor<f32>) {
51     %1 = "test.munge_tensor"(%tensor) : (tensor<f32>) -> (tensor<f32>)
52     scf.yield %1: tensor<f32>
54     %1 = "test.munge_tensor"(%tensor) : (tensor<f32>) -> (tensor<f32>)
55     scf.yield %1 : tensor<f32>
57   return %0 : tensor<f32>
61 // CHECK-SAME:                                                      %[[TENSOR:.*]]: tensor<f32>,
62 …K-SAME:                                                      %[[INDEX:.*]]: index) -> tensor<f32> {
63 // CHECK:           %[[MEMREF:.*]] = bufferization.to_memref %[[TENSOR]] : memref<f32>
64 …DEX]] to %[[INDEX]] step %[[INDEX]] iter_args(%[[MEMREF_ITER:.*]] = %[[MEMREF]]) -> (memref<f32>) {
65 // CHECK:             %[[TENSOR_ITER:.*]] = bufferization.to_tensor %[[MEMREF_ITER]] : memref<f32>
66 …       %[[TENSOR_MUNGED:.*]] = "test.munge_tensor"(%[[TENSOR_ITER]]) : (tensor<f32>) -> tensor<f32>
67 …CHECK:             %[[MEMREF_MUNGED:.*]] = bufferization.to_memref %[[TENSOR_MUNGED]] : memref<f32>
68 // CHECK:             scf.yield %[[MEMREF_MUNGED]] : memref<f32>
70 // CHECK:           %[[TENSOR:.*]] = bufferization.to_tensor %[[RESULT:.*]] : memref<f32>
71 // CHECK:           return %[[TENSOR]] : tensor<f32>
73 …nc @for_correct_recursive_legalization_behavior(%arg0: tensor<f32>, %index: index) -> tensor<f32> {
74   %ret = scf.for %iv = %index to %index step %index iter_args(%iter = %arg0) -> tensor<f32> {
75     %0 = "test.munge_tensor"(%iter) : (tensor<f32>) -> (tensor<f32>)
76     scf.yield %0 : tensor<f32>
78   return %ret : tensor<f32>
82 // CHECK-SAME: %[[ARG0:.*]]: i64, %[[ARG1:.*]]: i64, %[[ARG2:.*]]: tensor<f32>
83 // CHECK: %[[M:.*]] = bufferization.to_memref %[[ARG2]] : memref<f32>
84 …= scf.while (%{{.*}} = %[[ARG0]], %{{.*}} = %[[M]]) : (i64, memref<f32>) -> (i64, i64, memref<f32>)
85 // CHECK: scf.condition(%{{.*}}) %{{.*}}, %{{.*}}, %{{.*}} : i64, i64, memref<f32>
86 // CHECK: ^bb0(%{{.*}}: i64, %{{.*}}: i64, %{{.*}}: memref<f32>):
87 // CHECK: scf.yield %{{.*}}, %{{.*}} : i64, memref<f32>
88 // CHECK:  %[[RES2:.*]] = bufferization.to_tensor %[[RES1]]#2 : memref<f32>
89 // CHECK:  return %[[RES1]]#1, %[[RES2]] : i64, tensor<f32>
90 func.func @bufferize_while(%arg0: i64, %arg1: i64, %arg2: tensor<f32>) -> (i64, tensor<f32>) {
92   %0:3 = scf.while (%arg3 = %arg0, %arg4 = %arg2) : (i64, tensor<f32>) -> (i64, i64, tensor<f32>) {
94     scf.condition(%1) %arg3, %arg3, %arg4 : i64, i64, tensor<f32>
96   ^bb0(%arg5: i64, %arg6: i64, %arg7: tensor<f32>):
98     scf.yield %1, %arg7 : i64, tensor<f32>
100   return %0#1, %0#2 : i64, tensor<f32>