65 lines · plain
1// Note: We run CSE here to make the pattern matching more direct.2 3// RUN: mlir-opt %s -test-lower-to-llvm -cse -canonicalize | FileCheck %s4 5// RUN: mlir-opt %s \6// RUN: -transform-preload-library=transform-library-paths=%p/../Transform/include/Library/lower-to-llvm.mlir \7// RUN: -transform-interpreter="entry-point=entry_point" \8// RUN: -test-transform-dialect-erase-schedule \9// RUN: -cse -canonicalize \10// RUN: | FileCheck %s11 12// Check that we properly lower to llvm memref operations that require to be13// expanded first, like `memref.subview`.14func.func @subview(%0 : memref<64x4xf32, strided<[4, 1], offset: 0>>, %arg0 : index, %arg1 : index, %arg2 : index)15-> memref<?x?xf32, strided<[?, ?], offset: ?>> {16 // CHECK-LABEL: @subview17 // CHECK-SAME: %[[BASE:[^:]*]]: !llvm.ptr18 // CHECK-SAME: %[[BASE_ALIGNED:[^:]*]]: !llvm.ptr,19 // CHECK-SAME: %[[BASE_OFFSET:[^:]*]]: i64,20 // CHECK-SAME: %[[BASE_STRIDE0:[^:]*]]: i64,21 // CHECK-SAME: %[[BASE_STRIDE1:[^:]*]]: i64,22 // CHECK-SAME: %[[BASE_SIZE0:[^:]*]]: i64,23 // CHECK-SAME: %[[BASE_SIZE1:[^:]*]]: i64,24 // CHECK-SAME: %[[ARG0:[^:]*]]: i64,25 // CHECK-SAME: %[[ARG1:[^:]*]]: i64,26 // CHECK-SAME: %[[ARG2:[^:]*]]: i64)27 // CHECK-SAME: -> !llvm.struct<(ptr, ptr, i64, array<2 x i64>, array<2 x i64>28 29 // CHECK-DAG: %[[STRIDE0:.*]] = llvm.mlir.constant(4 : index) : i6430 // CHECK-DAG: %[[DESCSTRIDE0:.*]] = llvm.mul %[[ARG0]], %[[STRIDE0]] overflow<nsw> : i6431 // CHECK-DAG: %[[OFF2:.*]] = llvm.add %[[DESCSTRIDE0]], %[[ARG1]] : i6432 // CHECK-DAG: %[[DESC:.*]] = llvm.mlir.poison : !llvm.struct<(ptr, ptr, i64, array<2 x i64>, array<2 x i64>)>33 34 // Base address and algined address.35 // CHECK-DAG: %[[DESC0:.*]] = llvm.insertvalue %[[BASE]], %[[DESC]][0] : !llvm.struct<(ptr, ptr, i64, array<2 x i64>, array<2 x i64>)>36 // CHECK-DAG: %[[DESC1:.*]] = llvm.insertvalue %[[BASE_ALIGNED]], %[[DESC0]][1] : !llvm.struct<(ptr, ptr, i64, array<2 x i64>, array<2 x i64>)>37 38 // Offset.39 // CHECK: %[[DESC2:.*]] = llvm.insertvalue %[[OFF2]], %[[DESC1]][2] : !llvm.struct<(ptr, ptr, i64, array<2 x i64>, array<2 x i64>)>40 // Size 0.41 // CHECK: %[[DESC3:.*]] = llvm.insertvalue %[[ARG0]], %[[DESC2]][3, 0] : !llvm.struct<(ptr, ptr, i64, array<2 x i64>, array<2 x i64>)>42 // Stride 0 == 4 * %arg0.43 // CHECK: %[[DESC4:.*]] = llvm.insertvalue %[[DESCSTRIDE0]], %[[DESC3]][4, 0] : !llvm.struct<(ptr, ptr, i64, array<2 x i64>, array<2 x i64>)>44 // Size 1.45 // CHECK: %[[DESC5:.*]] = llvm.insertvalue %[[ARG1]], %[[DESC4]][3, 1] : !llvm.struct<(ptr, ptr, i64, array<2 x i64>, array<2 x i64>)>46 // Stride 1 == 1 * %arg1.47 // CHECK: %[[DESC6:.*]] = llvm.insertvalue %[[ARG1]], %[[DESC5]][4, 1] : !llvm.struct<(ptr, ptr, i64, array<2 x i64>, array<2 x i64>)>48 49 %1 = memref.subview %0[%arg0, %arg1][%arg0, %arg1][%arg0, %arg1] :50 memref<64x4xf32, strided<[4, 1], offset: 0>>51 to memref<?x?xf32, strided<[?, ?], offset: ?>>52 return %1 : memref<?x?xf32, strided<[?, ?], offset: ?>>53}54 55module @named_inclusion_in_named attributes { transform.with_named_sequence } {56 transform.named_sequence private @lower_to_llvm(!transform.any_op {transform.readonly}) -> !transform.any_op57 58 transform.named_sequence @entry_point(59 %toplevel_module : !transform.any_op {transform.readonly}) {60 transform.include @lower_to_llvm failures(suppress) (%toplevel_module)61 : (!transform.any_op) -> (!transform.any_op)62 transform.yield63 }64}65