// RUN: mlir-opt %s -acc-recipe-materialization | FileCheck %s // Test that the reduction recipes are correctly inlined when attached to a // parallel construct without loop. Verify init and combine materialize in the region. // CHECK-LABEL: func.func @par_reduction_clause_ // CHECK: acc.parallel { // CHECK: [[PRIVATE:%.*]] = acc.reduction_init {{.*}} // CHECK-NEXT: [[ZERO:%.*]] = arith.constant 0.000000e+00 : f64 // CHECK-NEXT: [[ALLOCA:%.*]] = memref.alloca() : memref // CHECK-NEXT: memref.store [[ZERO]], [[ALLOCA]][] // CHECK-NEXT: acc.yield {{.*}} // CHECK: } {{.*}}acc.var_name = #acc.var_name<"tmp"> // CHECK: memref.load [[PRIVATE]][] // CHECK: memref.store {{.*}}, [[PRIVATE]][] // CHECK: acc.reduction_combine_region [[PRIVATE]] into [[REDUCVAR:%.*]] : // CHECK: [[LOADVAR:%.*]] = memref.load [[REDUCVAR]][] // CHECK-NEXT: [[LOADPRIV:%.*]] = memref.load [[PRIVATE]][] // CHECK-NEXT: [[COMBINE:%.*]] = arith.addf [[LOADVAR]], [[LOADPRIV]] // CHECK-NEXT: memref.store [[COMBINE]], [[REDUCVAR]][] // CHECK: acc.yield acc.reduction.recipe @reduction_add_memref_f64 : memref reduction_operator init { ^bb0(%arg0: memref): %cst = arith.constant 0.000000e+00 : f64 %0 = memref.alloca() : memref memref.store %cst, %0[] : memref acc.yield %0 : memref } combiner { ^bb0(%arg0: memref, %arg1: memref): %0 = memref.load %arg0[] : memref %1 = memref.load %arg1[] : memref %2 = arith.addf %0, %1 fastmath : f64 memref.store %2, %arg0[] : memref acc.yield %arg0 : memref } func.func @par_reduction_clause_(%arg0: memref) { %cst = arith.constant 1.000000e+00 : f64 %0 = acc.reduction varPtr(%arg0 : memref) recipe(@reduction_add_memref_f64) -> memref {name = "tmp"} acc.parallel reduction(%0 : memref) { %1 = memref.load %0[] : memref %2 = arith.addf %1, %cst fastmath : f64 memref.store %2, %0[] : memref acc.yield } return }