brintos

brintos / llvm-project-archived public Read only

0
0
Text · 3.4 KiB · 8e54d28 Raw
51 lines · plain
1! Test forall lowering2 3! RUN: bbc --use-desc-for-alloc=false -emit-fir -hlfir=false %s -o - | FileCheck %s4 5subroutine forall_with_allocatable(a1)6  real :: a1(:)7  real, allocatable :: arr(:)8  forall (i=5:15)9     arr(i) = a1(i)10  end forall11end subroutine forall_with_allocatable12 13! CHECK-LABEL: func @_QPforall_with_allocatable(14! CHECK-SAME:                                   %[[VAL_0:.*]]: !fir.box<!fir.array<?xf32>>{{.*}}) {15! CHECK:         %[[VAL_1:.*]] = fir.alloca i32 {adapt.valuebyref, bindc_name = "i"}16! CHECK:         %[[VAL_2:.*]] = fir.alloca !fir.heap<!fir.array<?xf32>> {uniq_name = "_QFforall_with_allocatableEarr.addr"}17! CHECK:         %[[VAL_3:.*]] = fir.alloca index {uniq_name = "_QFforall_with_allocatableEarr.lb0"}18! CHECK:         %[[VAL_4:.*]] = fir.alloca index {uniq_name = "_QFforall_with_allocatableEarr.ext0"}19! CHECK:         %[[VAL_5:.*]] = fir.zero_bits !fir.heap<!fir.array<?xf32>>20! CHECK:         fir.store %[[VAL_5]] to %[[VAL_2]] : !fir.ref<!fir.heap<!fir.array<?xf32>>>21! CHECK:         %[[VAL_7:.*]] = arith.constant 5 : i3222! CHECK:         %[[VAL_8:.*]] = fir.convert %[[VAL_7]] : (i32) -> index23! CHECK:         %[[VAL_9:.*]] = arith.constant 15 : i3224! CHECK:         %[[VAL_10:.*]] = fir.convert %[[VAL_9]] : (i32) -> index25! CHECK:         %[[VAL_11:.*]] = arith.constant 1 : index26! CHECK:         %[[VAL_12:.*]] = fir.load %[[VAL_3]] : !fir.ref<index>27! CHECK:         %[[VAL_13:.*]] = fir.load %[[VAL_4]] : !fir.ref<index>28! CHECK:         %[[VAL_14:.*]] = fir.load %[[VAL_2]] : !fir.ref<!fir.heap<!fir.array<?xf32>>>29! CHECK:         %[[VAL_15:.*]] = fir.shape_shift %[[VAL_12]], %[[VAL_13]] : (index, index) -> !fir.shapeshift<1>30! CHECK:         %[[VAL_16:.*]] = fir.array_load %[[VAL_14]](%[[VAL_15]]) : (!fir.heap<!fir.array<?xf32>>, !fir.shapeshift<1>) -> !fir.array<?xf32>31! CHECK:         %[[VAL_17:.*]] = fir.array_load %[[VAL_0]] : (!fir.box<!fir.array<?xf32>>) -> !fir.array<?xf32>32! CHECK:         %[[VAL_18:.*]] = fir.do_loop %[[VAL_19:.*]] = %[[VAL_8]] to %[[VAL_10]] step %[[VAL_11]] unordered iter_args(%[[VAL_20:.*]] = %[[VAL_16]]) -> (!fir.array<?xf32>) {33! CHECK:           %[[VAL_21:.*]] = fir.convert %[[VAL_19]] : (index) -> i3234! CHECK:           fir.store %[[VAL_21]] to %[[VAL_1]] : !fir.ref<i32>35! CHECK:           %[[VAL_22:.*]] = arith.constant 1 : index36! CHECK:           %[[VAL_23:.*]] = fir.load %[[VAL_1]] : !fir.ref<i32>37! CHECK:           %[[VAL_24:.*]] = fir.convert %[[VAL_23]] : (i32) -> i6438! CHECK:           %[[VAL_25:.*]] = fir.convert %[[VAL_24]] : (i64) -> index39! CHECK:           %[[VAL_26:.*]] = arith.subi %[[VAL_25]], %[[VAL_22]] : index40! CHECK:           %[[VAL_27:.*]] = fir.array_fetch %[[VAL_17]], %[[VAL_26]] : (!fir.array<?xf32>, index) -> f3241! CHECK:           %[[VAL_29:.*]] = fir.load %[[VAL_1]] : !fir.ref<i32>42! CHECK:           %[[VAL_30:.*]] = fir.convert %[[VAL_29]] : (i32) -> i6443! CHECK:           %[[VAL_31:.*]] = fir.convert %[[VAL_30]] : (i64) -> index44! CHECK:           %[[VAL_32:.*]] = arith.subi %[[VAL_31]], %[[VAL_12]] : index45! CHECK:           %[[VAL_33:.*]] = fir.array_update %[[VAL_20]], %[[VAL_27]], %[[VAL_32]] : (!fir.array<?xf32>, f32, index) -> !fir.array<?xf32>46! CHECK:           fir.result %[[VAL_33]] : !fir.array<?xf32>47! CHECK:         }48! CHECK:         fir.array_merge_store %[[VAL_16]], %[[VAL_34:.*]] to %[[VAL_14]] : !fir.array<?xf32>, !fir.array<?xf32>, !fir.heap<!fir.array<?xf32>>49! CHECK:         return50! CHECK:       }51