Skip to content

Commit c99a502

Browse files
committed
[flang][OpenMP] Basic mapping of do concurrent ... reduce to OpenMP
Now that we have changes introduced by #145837, mapping reductions from `do concurrent` to OpenMP is almost trivial. This PR adds such mapping.
1 parent 5f665c9 commit c99a502

File tree

3 files changed

+212
-27
lines changed

3 files changed

+212
-27
lines changed

flang/lib/Optimizer/OpenMP/DoConcurrentConversion.cpp

Lines changed: 56 additions & 27 deletions
Original file line numberDiff line numberDiff line change
@@ -312,6 +312,19 @@ class DoConcurrentConversion
312312
bool isComposite) const {
313313
mlir::omp::WsloopOperands wsloopClauseOps;
314314

315+
auto cloneFIRRegionToOMP = [&rewriter](mlir::Region &firRegion,
316+
mlir::Region &ompRegion) {
317+
if (!firRegion.empty()) {
318+
rewriter.cloneRegionBefore(firRegion, ompRegion, ompRegion.begin());
319+
auto firYield =
320+
mlir::cast<fir::YieldOp>(ompRegion.back().getTerminator());
321+
rewriter.setInsertionPoint(firYield);
322+
rewriter.create<mlir::omp::YieldOp>(firYield.getLoc(),
323+
firYield.getOperands());
324+
rewriter.eraseOp(firYield);
325+
}
326+
};
327+
315328
// For `local` (and `local_init`) opernads, emit corresponding `private`
316329
// clauses and attach these clauses to the workshare loop.
317330
if (!loop.getLocalVars().empty())
@@ -326,50 +339,65 @@ class DoConcurrentConversion
326339
TODO(localizer.getLoc(),
327340
"local_init conversion is not supported yet");
328341

329-
auto oldIP = rewriter.saveInsertionPoint();
342+
mlir::OpBuilder::InsertionGuard guard(rewriter);
330343
rewriter.setInsertionPointAfter(localizer);
344+
331345
auto privatizer = rewriter.create<mlir::omp::PrivateClauseOp>(
332346
localizer.getLoc(), sym.getLeafReference().str() + ".omp",
333347
localizer.getTypeAttr().getValue(),
334348
mlir::omp::DataSharingClauseType::Private);
335349

336-
if (!localizer.getInitRegion().empty()) {
337-
rewriter.cloneRegionBefore(localizer.getInitRegion(),
338-
privatizer.getInitRegion(),
339-
privatizer.getInitRegion().begin());
340-
auto firYield = mlir::cast<fir::YieldOp>(
341-
privatizer.getInitRegion().back().getTerminator());
342-
rewriter.setInsertionPoint(firYield);
343-
rewriter.create<mlir::omp::YieldOp>(firYield.getLoc(),
344-
firYield.getOperands());
345-
rewriter.eraseOp(firYield);
346-
}
347-
348-
if (!localizer.getDeallocRegion().empty()) {
349-
rewriter.cloneRegionBefore(localizer.getDeallocRegion(),
350-
privatizer.getDeallocRegion(),
351-
privatizer.getDeallocRegion().begin());
352-
auto firYield = mlir::cast<fir::YieldOp>(
353-
privatizer.getDeallocRegion().back().getTerminator());
354-
rewriter.setInsertionPoint(firYield);
355-
rewriter.create<mlir::omp::YieldOp>(firYield.getLoc(),
356-
firYield.getOperands());
357-
rewriter.eraseOp(firYield);
358-
}
359-
360-
rewriter.restoreInsertionPoint(oldIP);
350+
cloneFIRRegionToOMP(localizer.getInitRegion(),
351+
privatizer.getInitRegion());
352+
cloneFIRRegionToOMP(localizer.getDeallocRegion(),
353+
privatizer.getDeallocRegion());
361354

362355
wsloopClauseOps.privateVars.push_back(op);
363356
wsloopClauseOps.privateSyms.push_back(
364357
mlir::SymbolRefAttr::get(privatizer));
365358
}
366359

360+
if (!loop.getReduceVars().empty()) {
361+
for (auto [op, byRef, sym, arg] : llvm::zip_equal(
362+
loop.getReduceVars(), loop.getReduceByrefAttr().asArrayRef(),
363+
loop.getReduceSymsAttr().getAsRange<mlir::SymbolRefAttr>(),
364+
loop.getRegionReduceArgs())) {
365+
auto firReducer =
366+
mlir::SymbolTable::lookupNearestSymbolFrom<fir::DeclareReductionOp>(
367+
loop, sym);
368+
369+
mlir::OpBuilder::InsertionGuard guard(rewriter);
370+
rewriter.setInsertionPointAfter(firReducer);
371+
372+
auto ompReducer = rewriter.create<mlir::omp::DeclareReductionOp>(
373+
firReducer.getLoc(), sym.getLeafReference().str() + ".omp",
374+
firReducer.getTypeAttr().getValue());
375+
376+
cloneFIRRegionToOMP(firReducer.getAllocRegion(),
377+
ompReducer.getAllocRegion());
378+
cloneFIRRegionToOMP(firReducer.getInitializerRegion(),
379+
ompReducer.getInitializerRegion());
380+
cloneFIRRegionToOMP(firReducer.getReductionRegion(),
381+
ompReducer.getReductionRegion());
382+
cloneFIRRegionToOMP(firReducer.getAtomicReductionRegion(),
383+
ompReducer.getAtomicReductionRegion());
384+
cloneFIRRegionToOMP(firReducer.getCleanupRegion(),
385+
ompReducer.getCleanupRegion());
386+
387+
wsloopClauseOps.reductionVars.push_back(op);
388+
wsloopClauseOps.reductionByref.push_back(byRef);
389+
wsloopClauseOps.reductionSyms.push_back(
390+
mlir::SymbolRefAttr::get(ompReducer));
391+
}
392+
}
393+
367394
auto wsloopOp =
368395
rewriter.create<mlir::omp::WsloopOp>(loop.getLoc(), wsloopClauseOps);
369396
wsloopOp.setComposite(isComposite);
370397

371398
Fortran::common::openmp::EntryBlockArgs wsloopArgs;
372399
wsloopArgs.priv.vars = wsloopClauseOps.privateVars;
400+
wsloopArgs.reduction.vars = wsloopClauseOps.reductionVars;
373401
Fortran::common::openmp::genEntryBlock(rewriter, wsloopArgs,
374402
wsloopOp.getRegion());
375403

@@ -393,7 +421,8 @@ class DoConcurrentConversion
393421
clauseOps.loopLowerBounds.size())))
394422
rewriter.replaceAllUsesWith(loopNestArg, wsloopArg);
395423

396-
for (unsigned i = 0; i < loop.getLocalVars().size(); ++i)
424+
for (unsigned i = 0;
425+
i < loop.getLocalVars().size() + loop.getReduceVars().size(); ++i)
397426
loopNestOp.getRegion().eraseArgument(clauseOps.loopLowerBounds.size());
398427

399428
return loopNestOp;
Lines changed: 73 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,73 @@
1+
// Tests mapping reductions from fir to OpenMP.
2+
3+
// RUN: fir-opt --omp-do-concurrent-conversion="map-to=host" %s | FileCheck %s
4+
5+
fir.declare_reduction @add_reduction_i32 : i32 init {
6+
^bb0(%arg0: i32):
7+
%c0_i32 = arith.constant 0 : i32
8+
fir.yield(%c0_i32 : i32)
9+
} combiner {
10+
^bb0(%arg0: i32, %arg1: i32):
11+
%0 = arith.addi %arg0, %arg1 : i32
12+
fir.yield(%0 : i32)
13+
}
14+
15+
func.func @_QPdo_concurrent_reduce() {
16+
%3 = fir.alloca i32 {bindc_name = "s", uniq_name = "_QFdo_concurrent_reduceEs"}
17+
%4:2 = hlfir.declare %3 {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
18+
%c1 = arith.constant 1 : index
19+
fir.do_concurrent {
20+
%7 = fir.alloca i32 {bindc_name = "i"}
21+
%8:2 = hlfir.declare %7 {uniq_name = "_QFdo_concurrent_reduceEi"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
22+
fir.do_concurrent.loop (%arg0) = (%c1) to (%c1) step (%c1) reduce(@add_reduction_i32 #fir.reduce_attr<add> %4#0 -> %arg1 : !fir.ref<i32>) {
23+
%9 = fir.convert %arg0 : (index) -> i32
24+
fir.store %9 to %8#0 : !fir.ref<i32>
25+
%10:2 = hlfir.declare %arg1 {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
26+
%11 = fir.load %10#0 : !fir.ref<i32>
27+
%c1_i32_0 = arith.constant 1 : i32
28+
%12 = arith.addi %11, %c1_i32_0 : i32
29+
hlfir.assign %12 to %10#0 : i32, !fir.ref<i32>
30+
}
31+
}
32+
return
33+
}
34+
35+
// CHECK-LABEL: omp.declare_reduction @add_reduction_i32.omp : i32 init {
36+
// CHECK: ^bb0(%[[VAL_0:.*]]: i32):
37+
// CHECK: %[[VAL_1:.*]] = arith.constant 0 : i32
38+
// CHECK: omp.yield(%[[VAL_1]] : i32)
39+
40+
// CHECK-LABEL: } combiner {
41+
// CHECK: ^bb0(%[[VAL_0:.*]]: i32, %[[VAL_1:.*]]: i32):
42+
// CHECK: %[[VAL_2:.*]] = arith.addi %[[VAL_0]], %[[VAL_1]] : i32
43+
// CHECK: omp.yield(%[[VAL_2]] : i32)
44+
// CHECK: }
45+
46+
// CHECK-LABEL: func.func @_QPdo_concurrent_reduce() {
47+
// CHECK: %[[VAL_0:.*]] = fir.alloca i32 {bindc_name = "i"}
48+
// CHECK: %[[VAL_1:.*]]:2 = hlfir.declare %[[VAL_0]] {uniq_name = "_QFdo_concurrent_reduceEi"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
49+
// CHECK: %[[VAL_2:.*]] = fir.alloca i32 {bindc_name = "s", uniq_name = "_QFdo_concurrent_reduceEs"}
50+
// CHECK: %[[VAL_3:.*]]:2 = hlfir.declare %[[VAL_2]] {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
51+
// CHECK: %[[VAL_4:.*]] = arith.constant 1 : index
52+
// CHECK: omp.parallel {
53+
// CHECK: %[[VAL_5:.*]] = fir.alloca i32 {bindc_name = "i"}
54+
// CHECK: %[[VAL_6:.*]]:2 = hlfir.declare %[[VAL_5]] {uniq_name = "_QFdo_concurrent_reduceEi"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
55+
56+
// CHECK: omp.wsloop reduction(@add_reduction_i32.omp %[[VAL_3]]#0 -> %[[VAL_7:.*]] : !fir.ref<i32>) {
57+
// CHECK: omp.loop_nest (%[[VAL_8:.*]]) : index = (%[[VAL_4]]) to (%[[VAL_4]]) inclusive step (%[[VAL_4]]) {
58+
// CHECK: %[[VAL_9:.*]] = fir.convert %[[VAL_8]] : (index) -> i32
59+
// CHECK: fir.store %[[VAL_9]] to %[[VAL_6]]#0 : !fir.ref<i32>
60+
// CHECK: %[[VAL_10:.*]]:2 = hlfir.declare %[[VAL_7]] {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
61+
// CHECK: %[[VAL_11:.*]] = fir.load %[[VAL_10]]#0 : !fir.ref<i32>
62+
// CHECK: %[[VAL_12:.*]] = arith.constant 1 : i32
63+
// CHECK: %[[VAL_13:.*]] = arith.addi %[[VAL_11]], %[[VAL_12]] : i32
64+
// CHECK: hlfir.assign %[[VAL_13]] to %[[VAL_10]]#0 : i32, !fir.ref<i32>
65+
// CHECK: omp.yield
66+
// CHECK: }
67+
// CHECK: }
68+
// CHECK: omp.terminator
69+
// CHECK: }
70+
71+
// CHECK: return
72+
// CHECK: }
73+
Lines changed: 83 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,83 @@
1+
// Tests mapping reductions and local from fir to OpenMP.
2+
3+
// RUN: fir-opt --omp-do-concurrent-conversion="map-to=host" %s | FileCheck %s
4+
5+
fir.declare_reduction @add_reduction_i32 : i32 init {
6+
^bb0(%arg0: i32):
7+
%c0_i32 = arith.constant 0 : i32
8+
fir.yield(%c0_i32 : i32)
9+
} combiner {
10+
^bb0(%arg0: i32, %arg1: i32):
11+
%0 = arith.addi %arg0, %arg1 : i32
12+
fir.yield(%0 : i32)
13+
}
14+
fir.local {type = local} @_QFdo_concurrent_reduceEl_private_i32 : i32
15+
func.func @_QPdo_concurrent_reduce() {
16+
%3 = fir.alloca i32 {bindc_name = "l", uniq_name = "_QFdo_concurrent_reduceEl"}
17+
%4:2 = hlfir.declare %3 {uniq_name = "_QFdo_concurrent_reduceEl"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
18+
%5 = fir.alloca i32 {bindc_name = "s", uniq_name = "_QFdo_concurrent_reduceEs"}
19+
%6:2 = hlfir.declare %5 {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
20+
%c1 = arith.constant 1 : index
21+
fir.do_concurrent {
22+
%9 = fir.alloca i32 {bindc_name = "i"}
23+
%10:2 = hlfir.declare %9 {uniq_name = "_QFdo_concurrent_reduceEi"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
24+
fir.do_concurrent.loop (%arg0) = (%c1) to (%c1) step (%c1) local(@_QFdo_concurrent_reduceEl_private_i32 %4#0 -> %arg1 : !fir.ref<i32>) reduce(@add_reduction_i32 #fir.reduce_attr<add> %6#0 -> %arg2 : !fir.ref<i32>) {
25+
%11 = fir.convert %arg0 : (index) -> i32
26+
fir.store %11 to %10#0 : !fir.ref<i32>
27+
%12:2 = hlfir.declare %arg1 {uniq_name = "_QFdo_concurrent_reduceEl"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
28+
%13:2 = hlfir.declare %arg2 {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
29+
%c1_i32_0 = arith.constant 1 : i32
30+
hlfir.assign %c1_i32_0 to %12#0 : i32, !fir.ref<i32>
31+
%14 = fir.load %13#0 : !fir.ref<i32>
32+
%15 = fir.load %12#0 : !fir.ref<i32>
33+
%16 = arith.addi %14, %15 : i32
34+
hlfir.assign %16 to %13#0 : i32, !fir.ref<i32>
35+
}
36+
}
37+
return
38+
}
39+
40+
// CHECK-LABEL: omp.declare_reduction @add_reduction_i32.omp : i32 init {
41+
// CHECK: ^bb0(%[[VAL_0:.*]]: i32):
42+
// CHECK: %[[VAL_1:.*]] = arith.constant 0 : i32
43+
// CHECK: omp.yield(%[[VAL_1]] : i32)
44+
45+
// CHECK-LABEL: } combiner {
46+
// CHECK: ^bb0(%[[VAL_0:.*]]: i32, %[[VAL_1:.*]]: i32):
47+
// CHECK: %[[VAL_2:.*]] = arith.addi %[[VAL_0]], %[[VAL_1]] : i32
48+
// CHECK: omp.yield(%[[VAL_2]] : i32)
49+
// CHECK: }
50+
51+
// CHECK: omp.private {type = private} @_QFdo_concurrent_reduceEl_private_i32.omp : i32
52+
53+
// CHECK-LABEL: func.func @_QPdo_concurrent_reduce() {
54+
// CHECK: %[[VAL_0:.*]] = fir.alloca i32 {bindc_name = "i"}
55+
// CHECK: %[[VAL_1:.*]]:2 = hlfir.declare %[[VAL_0]] {uniq_name = "_QFdo_concurrent_reduceEi"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
56+
// CHECK: %[[VAL_2:.*]] = fir.alloca i32 {bindc_name = "l", uniq_name = "_QFdo_concurrent_reduceEl"}
57+
// CHECK: %[[VAL_3:.*]]:2 = hlfir.declare %[[VAL_2]] {uniq_name = "_QFdo_concurrent_reduceEl"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
58+
// CHECK: %[[VAL_4:.*]] = fir.alloca i32 {bindc_name = "s", uniq_name = "_QFdo_concurrent_reduceEs"}
59+
// CHECK: %[[VAL_5:.*]]:2 = hlfir.declare %[[VAL_4]] {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
60+
// CHECK: %[[VAL_6:.*]] = arith.constant 1 : index
61+
// CHECK: omp.parallel {
62+
// CHECK: %[[VAL_7:.*]] = fir.alloca i32 {bindc_name = "i"}
63+
// CHECK: %[[VAL_8:.*]]:2 = hlfir.declare %[[VAL_7]] {uniq_name = "_QFdo_concurrent_reduceEi"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
64+
// CHECK: omp.wsloop private(@_QFdo_concurrent_reduceEl_private_i32.omp %[[VAL_3]]#0 -> %[[VAL_9:.*]] : !fir.ref<i32>) reduction(@add_reduction_i32.omp %[[VAL_5]]#0 -> %[[VAL_10:.*]] : !fir.ref<i32>) {
65+
// CHECK: omp.loop_nest (%[[VAL_11:.*]]) : index = (%[[VAL_6]]) to (%[[VAL_6]]) inclusive step (%[[VAL_6]]) {
66+
// CHECK: %[[VAL_12:.*]] = fir.convert %[[VAL_11]] : (index) -> i32
67+
// CHECK: fir.store %[[VAL_12]] to %[[VAL_8]]#0 : !fir.ref<i32>
68+
// CHECK: %[[VAL_13:.*]]:2 = hlfir.declare %[[VAL_9]] {uniq_name = "_QFdo_concurrent_reduceEl"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
69+
// CHECK: %[[VAL_14:.*]]:2 = hlfir.declare %[[VAL_10]] {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
70+
// CHECK: %[[VAL_15:.*]] = arith.constant 1 : i32
71+
// CHECK: hlfir.assign %[[VAL_15]] to %[[VAL_13]]#0 : i32, !fir.ref<i32>
72+
// CHECK: %[[VAL_16:.*]] = fir.load %[[VAL_14]]#0 : !fir.ref<i32>
73+
// CHECK: %[[VAL_17:.*]] = fir.load %[[VAL_13]]#0 : !fir.ref<i32>
74+
// CHECK: %[[VAL_18:.*]] = arith.addi %[[VAL_16]], %[[VAL_17]] : i32
75+
// CHECK: hlfir.assign %[[VAL_18]] to %[[VAL_14]]#0 : i32, !fir.ref<i32>
76+
// CHECK: omp.yield
77+
// CHECK: }
78+
// CHECK: }
79+
// CHECK: omp.terminator
80+
// CHECK: }
81+
// CHECK: return
82+
// CHECK: }
83+

0 commit comments

Comments
 (0)