|
| 1 | +// RUN: fir-opt --bufferize-hlfir %s | FileCheck %s |
| 2 | + |
| 3 | +// CHECK-LABEL: func.func @simple( |
| 4 | +// CHECK-SAME: %[[VAL_0:.*]]: !fir.ref<!fir.array<42xi32>>) { |
| 5 | +// CHECK: omp.parallel { |
| 6 | +// CHECK: omp.workshare { |
| 7 | +// CHECK: %[[VAL_1:.*]] = arith.constant 42 : index |
| 8 | +// CHECK: %[[VAL_2:.*]] = arith.constant 1 : i32 |
| 9 | +// CHECK: %[[VAL_3:.*]] = fir.shape %[[VAL_1]] : (index) -> !fir.shape<1> |
| 10 | +// CHECK: %[[VAL_4:.*]]:2 = hlfir.declare %[[VAL_0]](%[[VAL_3]]) {uniq_name = "array"} : (!fir.ref<!fir.array<42xi32>>, !fir.shape<1>) -> (!fir.ref<!fir.array<42xi32>>, !fir.ref<!fir.array<42xi32>>) |
| 11 | +// CHECK: %[[VAL_5:.*]] = fir.allocmem !fir.array<42xi32> {bindc_name = ".tmp.array", uniq_name = ""} |
| 12 | +// CHECK: %[[VAL_6:.*]]:2 = hlfir.declare %[[VAL_5]](%[[VAL_3]]) {uniq_name = ".tmp.array"} : (!fir.heap<!fir.array<42xi32>>, !fir.shape<1>) -> (!fir.heap<!fir.array<42xi32>>, !fir.heap<!fir.array<42xi32>>) |
| 13 | +// CHECK: %[[VAL_7:.*]] = arith.constant true |
| 14 | +// CHECK: %[[VAL_8:.*]] = arith.constant 1 : index |
| 15 | +// CHECK: omp.wsloop { |
| 16 | +// CHECK: omp.loop_nest (%[[VAL_9:.*]]) : index = (%[[VAL_8]]) to (%[[VAL_1]]) inclusive step (%[[VAL_8]]) { |
| 17 | +// CHECK: %[[VAL_10:.*]] = hlfir.designate %[[VAL_4]]#0 (%[[VAL_9]]) : (!fir.ref<!fir.array<42xi32>>, index) -> !fir.ref<i32> |
| 18 | +// CHECK: %[[VAL_11:.*]] = fir.load %[[VAL_10]] : !fir.ref<i32> |
| 19 | +// CHECK: %[[VAL_12:.*]] = arith.subi %[[VAL_11]], %[[VAL_2]] : i32 |
| 20 | +// CHECK: %[[VAL_13:.*]] = hlfir.designate %[[VAL_6]]#0 (%[[VAL_9]]) : (!fir.heap<!fir.array<42xi32>>, index) -> !fir.ref<i32> |
| 21 | +// CHECK: hlfir.assign %[[VAL_12]] to %[[VAL_13]] temporary_lhs : i32, !fir.ref<i32> |
| 22 | +// CHECK: omp.yield |
| 23 | +// CHECK: } |
| 24 | +// CHECK: omp.terminator |
| 25 | +// CHECK: } |
| 26 | +// CHECK: %[[VAL_14:.*]] = fir.undefined tuple<!fir.heap<!fir.array<42xi32>>, i1> |
| 27 | +// CHECK: %[[VAL_15:.*]] = fir.insert_value %[[VAL_14]], %[[VAL_7]], [1 : index] : (tuple<!fir.heap<!fir.array<42xi32>>, i1>, i1) -> tuple<!fir.heap<!fir.array<42xi32>>, i1> |
| 28 | +// CHECK: %[[VAL_16:.*]] = fir.insert_value %[[VAL_15]], %[[VAL_6]]#0, [0 : index] : (tuple<!fir.heap<!fir.array<42xi32>>, i1>, !fir.heap<!fir.array<42xi32>>) -> tuple<!fir.heap<!fir.array<42xi32>>, i1> |
| 29 | +// CHECK: hlfir.assign %[[VAL_6]]#0 to %[[VAL_4]]#0 : !fir.heap<!fir.array<42xi32>>, !fir.ref<!fir.array<42xi32>> |
| 30 | +// CHECK: fir.freemem %[[VAL_6]]#0 : !fir.heap<!fir.array<42xi32>> |
| 31 | +// CHECK: omp.terminator |
| 32 | +// CHECK: } |
| 33 | +// CHECK: omp.terminator |
| 34 | +// CHECK: } |
| 35 | +// CHECK: return |
| 36 | +// CHECK: } |
| 37 | +func.func @simple(%arg: !fir.ref<!fir.array<42xi32>>) { |
| 38 | + omp.parallel { |
| 39 | + omp.workshare { |
| 40 | + %c42 = arith.constant 42 : index |
| 41 | + %c1_i32 = arith.constant 1 : i32 |
| 42 | + %shape = fir.shape %c42 : (index) -> !fir.shape<1> |
| 43 | + %array:2 = hlfir.declare %arg(%shape) {uniq_name = "array"} : (!fir.ref<!fir.array<42xi32>>, !fir.shape<1>) -> (!fir.ref<!fir.array<42xi32>>, !fir.ref<!fir.array<42xi32>>) |
| 44 | + %elemental = hlfir.elemental %shape unordered : (!fir.shape<1>) -> !hlfir.expr<42xi32> { |
| 45 | + ^bb0(%i: index): |
| 46 | + %ref = hlfir.designate %array#0 (%i) : (!fir.ref<!fir.array<42xi32>>, index) -> !fir.ref<i32> |
| 47 | + %val = fir.load %ref : !fir.ref<i32> |
| 48 | + %sub = arith.subi %val, %c1_i32 : i32 |
| 49 | + hlfir.yield_element %sub : i32 |
| 50 | + } |
| 51 | + hlfir.assign %elemental to %array#0 : !hlfir.expr<42xi32>, !fir.ref<!fir.array<42xi32>> |
| 52 | + hlfir.destroy %elemental : !hlfir.expr<42xi32> |
| 53 | + omp.terminator |
| 54 | + } |
| 55 | + omp.terminator |
| 56 | + } |
| 57 | + return |
| 58 | +} |
0 commit comments