6bf043e743
This commit removes the deallocation capabilities of one-shot-bufferization. One-shot-bufferization should never deallocate any memrefs as this should be entirely handled by the ownership-based-buffer-deallocation pass going forward. This means the `allow-return-allocs` pass option will default to true now, `create-deallocs` defaults to false and they, as well as the escape attribute indicating whether a memref escapes the current region, will be removed. A new `allow-return-allocs-from-loops` option is added as a temporary workaround for some bufferization limitations.
79 lines
2.9 KiB
MLIR
79 lines
2.9 KiB
MLIR
// RUN: mlir-opt %s -test-tensor-copy-insertion -split-input-file | FileCheck %s
|
|
// RUN: mlir-opt %s -test-tensor-copy-insertion="bufferize-function-boundaries" -split-input-file | FileCheck %s --check-prefix=CHECK-FUNC
|
|
|
|
// CHECK-LABEL: func @read_after_write_conflict(
|
|
// CHECK-SAME: %[[t:.*]]: tensor<?xf32>
|
|
// CHECK-FUNC-LABEL: func @read_after_write_conflict(
|
|
func.func @read_after_write_conflict(%t: tensor<?xf32>, %idx: index, %f: f32)
|
|
-> (tensor<?xf32>, tensor<?xf32>)
|
|
{
|
|
// CHECK-FUNC: bufferization.alloc_tensor() copy(%{{.*}}) : tensor<?xf32>
|
|
// CHECK: %[[copy:.*]] = bufferization.alloc_tensor() copy(%{{.*}}) : tensor<?xf32>
|
|
// CHECK: %[[insert:.*]] = tensor.insert %{{.*}} into %[[copy]]
|
|
%0 = tensor.insert %f into %t[%idx] : tensor<?xf32>
|
|
// CHECK: return %[[insert]], %[[t]]
|
|
return %0, %t : tensor<?xf32>, tensor<?xf32>
|
|
}
|
|
|
|
// -----
|
|
|
|
// CHECK-LABEL: func @return_alloc_tensor
|
|
// CHECK-FUNC-LABEL: func @return_alloc_tensor
|
|
func.func @return_alloc_tensor() -> (tensor<5xf32>) {
|
|
// CHECK-FUNC: bufferization.alloc_tensor() : tensor<5xf32>
|
|
// CHECK: bufferization.alloc_tensor() : tensor<5xf32>
|
|
%0 = bufferization.alloc_tensor() : tensor<5xf32>
|
|
return %0 : tensor<5xf32>
|
|
}
|
|
|
|
// -----
|
|
|
|
// CHECK-LABEL: func @do_not_copy_undefined_tensor
|
|
func.func @do_not_copy_undefined_tensor(%f: f32, %idx: index)
|
|
-> (tensor<5xf32>, tensor<5xf32>)
|
|
{
|
|
// The second alloc_tensor should not have a copy operand.
|
|
// CHECK: bufferization.alloc_tensor() : tensor<5xf32>
|
|
// CHECK: bufferization.alloc_tensor() {memory_space = 0 : i64} : tensor<5xf32>
|
|
%0 = bufferization.alloc_tensor() : tensor<5xf32>
|
|
%1 = tensor.insert %f into %0[%idx] : tensor<5xf32>
|
|
return %0, %1 : tensor<5xf32>, tensor<5xf32>
|
|
}
|
|
|
|
// -----
|
|
|
|
// CHECK-LABEL: func @do_not_copy_when_overwritten
|
|
func.func @do_not_copy_when_overwritten(%t: tensor<5xf32>, %f: f32)
|
|
-> (tensor<5xf32>, tensor<5xf32>)
|
|
{
|
|
// CHECK: %[[alloc:.*]] = bufferization.alloc_tensor() {memory_space = 0 : i64} : tensor<5xf32>
|
|
// CHECK: linalg.generic {{.*}} outs(%[[alloc]] : tensor<5xf32>)
|
|
%r = linalg.generic {
|
|
indexing_maps = [affine_map<(d0) -> (d0)>],
|
|
iterator_types = ["parallel"]}
|
|
outs(%t : tensor<5xf32>) {
|
|
^bb0(%arg0 : f32) :
|
|
linalg.yield %f : f32
|
|
} -> tensor<5xf32>
|
|
return %t, %r : tensor<5xf32>, tensor<5xf32>
|
|
}
|
|
|
|
// -----
|
|
|
|
// CHECK-LABEL: func @do_not_copy_when_result_not_read
|
|
func.func @do_not_copy_when_result_not_read(%t: tensor<5xf32>, %f: f32)
|
|
-> (tensor<3xf32>)
|
|
{
|
|
%0 = tensor.extract_slice %t[0][3][1] : tensor<5xf32> to tensor<3xf32>
|
|
// CHECK: %[[alloc:.*]] = bufferization.alloc_tensor() {memory_space = 0 : i64} : tensor<3xf32>
|
|
// CHECK: linalg.generic {{.*}} outs(%[[alloc]] : tensor<3xf32>)
|
|
%r = linalg.generic {
|
|
indexing_maps = [affine_map<(d0) -> (d0)>],
|
|
iterator_types = ["parallel"]}
|
|
outs(%0 : tensor<3xf32>) {
|
|
^bb0(%arg0 : f32) :
|
|
linalg.yield %f : f32
|
|
} -> tensor<3xf32>
|
|
return %r : tensor<3xf32>
|
|
}
|