Skip to content
This repository was archived by the owner on Apr 26, 2024. It is now read-only.
This repository was archived by the owner on Apr 26, 2024. It is now read-only.

Assumed shaped arrays #19

Open
Open
@wadudmiah

Description

@wadudmiah

Hi, the code example that uses assumed-size arrays:

https://github.com/codee-com/check-examples/blob/master/PWD003/example-omp.f90

might as well use assumed-shaped arrays which stores the size of the arrays of the arguments:

SUBROUTINE example( a, b, result )
    IMPLICIT NONE
    INTEGER, INTENT(IN), contiguous :: a(:), b(:)
    INTEGER, INTENT(OUT), contiguous :: result(:)
    INTEGER :: i, lower, upper

    lower = lbound( a, 1 )
    upper = ubound( a, 1 )
    ! Array bounds should be specified
    !$omp target map(to: a, b) map(from: result)
    !$omp parallel do default(none) shared(a, b, result)
    DO i = lower, upper
        result(i) = a(i) + b(i)
    END DO
    !$omp end target
END SUBROUTINE example

Assumed-size arrays (the previous code) loses the lower bound, upper bound and size.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions