static gfc_expr *
simplify_bound_dim (gfc_expr *array, gfc_expr *kind, int d, int upper,
- gfc_array_spec *as)
+ gfc_array_spec *as, gfc_ref *ref)
{
gfc_expr *l, *u, *result;
int k;
return NULL;
}
- /* Then, we need to know the extent of the given dimension. */
- l = as->lower[d-1];
- u = as->upper[d-1];
-
- if (l->expr_type != EXPR_CONSTANT || u->expr_type != EXPR_CONSTANT)
- return NULL;
-
k = get_kind (BT_INTEGER, kind, upper ? "UBOUND" : "LBOUND",
gfc_default_integer_kind);
if (k == -1)
result = gfc_constant_result (BT_INTEGER, k, &array->where);
- if (mpz_cmp (l->value.integer, u->value.integer) > 0)
+
+ /* Then, we need to know the extent of the given dimension. */
+ if (ref->u.ar.type == AR_FULL)
{
- /* Zero extent. */
- if (upper)
- mpz_set_si (result->value.integer, 0);
+ l = as->lower[d-1];
+ u = as->upper[d-1];
+
+ if (l->expr_type != EXPR_CONSTANT || u->expr_type != EXPR_CONSTANT)
+ return NULL;
+
+ if (mpz_cmp (l->value.integer, u->value.integer) > 0)
+ {
+ /* Zero extent. */
+ if (upper)
+ mpz_set_si (result->value.integer, 0);
+ else
+ mpz_set_si (result->value.integer, 1);
+ }
else
- mpz_set_si (result->value.integer, 1);
+ {
+ /* Nonzero extent. */
+ if (upper)
+ mpz_set (result->value.integer, u->value.integer);
+ else
+ mpz_set (result->value.integer, l->value.integer);
+ }
}
else
{
- /* Nonzero extent. */
if (upper)
- mpz_set (result->value.integer, u->value.integer);
+ {
+ if (gfc_ref_dimen_size (&ref->u.ar, d-1, &result->value.integer)
+ != SUCCESS)
+ return NULL;
+ }
else
- mpz_set (result->value.integer, l->value.integer);
+ mpz_set_si (result->value.integer, (long int) 1);
}
return range_check (result, upper ? "UBOUND" : "LBOUND");
/* Fall through. */
- case AR_SECTION:
case AR_UNKNOWN:
return NULL;
+
+ case AR_SECTION:
+ as = ref->u.ar.as;
+ goto done;
}
gcc_unreachable ();
/* Simplify the bounds for each dimension. */
for (d = 0; d < array->rank; d++)
{
- bounds[d] = simplify_bound_dim (array, kind, d + 1, upper, as);
+ bounds[d] = simplify_bound_dim (array, kind, d + 1, upper, as, ref);
if (bounds[d] == NULL || bounds[d] == &gfc_bad_expr)
{
int j;
return &gfc_bad_expr;
}
- return simplify_bound_dim (array, kind, d, upper, as);
+ return simplify_bound_dim (array, kind, d, upper, as, ref);
}
}
--- /dev/null
+! { dg-do run }
+! { dg-options "-std=gnu" }
+! PR fortran/29391
+! This file is here to check that LBOUND and UBOUND return correct values
+!
+! Contributed by Francois-Xavier Coudert (coudert@clipper.ens.fr)
+ implicit none
+ integer, allocatable :: i(:,:), j(:), u(:,:,:,:)
+
+ allocate (i(-1:1,-1:1))
+ i = 0
+ allocate (j(-1:2))
+ j = 0
+ allocate (u(7,4,2,9))
+
+ call foo(u,4)
+ call jackal(-1,-8)
+ call jackal(-1,8)
+
+ if (any(lbound(i(-1:1,-1:1)) /= 1)) call abort
+ if (lbound(i(-1:1,-1:1), 1) /= 1) call abort
+ if (lbound(i(-1:1,-1:1), 2) /= 1) call abort
+
+ if (any(ubound(i(-1:1,-1:1)) /= 3)) call abort
+ if (ubound(i(-1:1,-1:1), 1) /= 3) call abort
+ if (ubound(i(-1:1,-1:1), 2) /= 3) call abort
+
+ if (any(lbound(i(:,:)) /= 1)) call abort
+ if (lbound(i(:,:), 1) /= 1) call abort
+ if (lbound(i(:,:), 2) /= 1) call abort
+
+ if (any(ubound(i(:,:)) /= 3)) call abort
+ if (ubound(i(:,:), 1) /= 3) call abort
+ if (ubound(i(:,:), 2) /= 3) call abort
+
+ if (any(lbound(i(0:,-1:)) /= 1)) call abort
+ if (lbound(i(0:,-1:), 1) /= 1) call abort
+ if (lbound(i(0:,-1:), 2) /= 1) call abort
+
+ if (any(ubound(i(0:,-1:)) /= [2,3])) call abort
+ if (ubound(i(0:,-1:), 1) /= 2) call abort
+ if (ubound(i(0:,-1:), 2) /= 3) call abort
+
+ if (any(lbound(i(:0,:0)) /= 1)) call abort
+ if (lbound(i(:0,:0), 1) /= 1) call abort
+ if (lbound(i(:0,:0), 2) /= 1) call abort
+
+ if (any(ubound(i(:0,:0)) /= 2)) call abort
+ if (ubound(i(:0,:0), 1) /= 2) call abort
+ if (ubound(i(:0,:0), 2) /= 2) call abort
+
+ if (any(lbound(transpose(i)) /= 1)) call abort
+ if (lbound(transpose(i), 1) /= 1) call abort
+ if (lbound(transpose(i), 2) /= 1) call abort
+
+ if (any(ubound(transpose(i)) /= 3)) call abort
+ if (ubound(transpose(i), 1) /= 3) call abort
+ if (ubound(transpose(i), 2) /= 3) call abort
+
+ if (any(lbound(reshape(i,[2,2])) /= 1)) call abort
+ if (lbound(reshape(i,[2,2]), 1) /= 1) call abort
+ if (lbound(reshape(i,[2,2]), 2) /= 1) call abort
+
+ if (any(ubound(reshape(i,[2,2])) /= 2)) call abort
+ if (ubound(reshape(i,[2,2]), 1) /= 2) call abort
+ if (ubound(reshape(i,[2,2]), 2) /= 2) call abort
+
+ if (any(lbound(cshift(i,-1)) /= 1)) call abort
+ if (lbound(cshift(i,-1), 1) /= 1) call abort
+ if (lbound(cshift(i,-1), 2) /= 1) call abort
+
+ if (any(ubound(cshift(i,-1)) /= 3)) call abort
+ if (ubound(cshift(i,-1), 1) /= 3) call abort
+ if (ubound(cshift(i,-1), 2) /= 3) call abort
+
+ if (any(lbound(eoshift(i,-1)) /= 1)) call abort
+ if (lbound(eoshift(i,-1), 1) /= 1) call abort
+ if (lbound(eoshift(i,-1), 2) /= 1) call abort
+
+ if (any(ubound(eoshift(i,-1)) /= 3)) call abort
+ if (ubound(eoshift(i,-1), 1) /= 3) call abort
+ if (ubound(eoshift(i,-1), 2) /= 3) call abort
+
+ if (any(lbound(spread(i,1,2)) /= 1)) call abort
+ if (lbound(spread(i,1,2), 1) /= 1) call abort
+ if (lbound(spread(i,1,2), 2) /= 1) call abort
+
+ if (any(ubound(spread(i,1,2)) /= [2,3,3])) call abort
+ if (ubound(spread(i,1,2), 1) /= 2) call abort
+ if (ubound(spread(i,1,2), 2) /= 3) call abort
+ if (ubound(spread(i,1,2), 3) /= 3) call abort
+
+ if (any(lbound(maxloc(i)) /= 1)) call abort
+ if (lbound(maxloc(i), 1) /= 1) call abort
+
+ if (any(ubound(maxloc(i)) /= 2)) call abort
+ if (ubound(maxloc(i), 1) /= 2) call abort
+
+ if (any(lbound(minloc(i)) /= 1)) call abort
+ if (lbound(minloc(i), 1) /= 1) call abort
+
+ if (any(ubound(minloc(i)) /= 2)) call abort
+ if (ubound(minloc(i), 1) /= 2) call abort
+
+ if (any(lbound(maxval(i,2)) /= 1)) call abort
+ if (lbound(maxval(i,2), 1) /= 1) call abort
+
+ if (any(ubound(maxval(i,2)) /= 3)) call abort
+ if (ubound(maxval(i,2), 1) /= 3) call abort
+
+ if (any(lbound(minval(i,2)) /= 1)) call abort
+ if (lbound(minval(i,2), 1) /= 1) call abort
+
+ if (any(ubound(minval(i,2)) /= 3)) call abort
+ if (ubound(minval(i,2), 1) /= 3) call abort
+
+ if (any(lbound(any(i==1,2)) /= 1)) call abort
+ if (lbound(any(i==1,2), 1) /= 1) call abort
+
+ if (any(ubound(any(i==1,2)) /= 3)) call abort
+ if (ubound(any(i==1,2), 1) /= 3) call abort
+
+ if (any(lbound(count(i==1,2)) /= 1)) call abort
+ if (lbound(count(i==1,2), 1) /= 1) call abort
+
+ if (any(ubound(count(i==1,2)) /= 3)) call abort
+ if (ubound(count(i==1,2), 1) /= 3) call abort
+
+ if (any(lbound(merge(i,i,.true.)) /= 1)) call abort
+ if (lbound(merge(i,i,.true.), 1) /= 1) call abort
+ if (lbound(merge(i,i,.true.), 2) /= 1) call abort
+
+ if (any(ubound(merge(i,i,.true.)) /= 3)) call abort
+ if (ubound(merge(i,i,.true.), 1) /= 3) call abort
+ if (ubound(merge(i,i,.true.), 2) /= 3) call abort
+
+ if (any(lbound(lbound(i)) /= 1)) call abort
+ if (lbound(lbound(i), 1) /= 1) call abort
+
+ if (any(ubound(lbound(i)) /= 2)) call abort
+ if (ubound(lbound(i), 1) /= 2) call abort
+
+ if (any(lbound(ubound(i)) /= 1)) call abort
+ if (lbound(ubound(i), 1) /= 1) call abort
+
+ if (any(ubound(ubound(i)) /= 2)) call abort
+ if (ubound(ubound(i), 1) /= 2) call abort
+
+ if (any(lbound(shape(i)) /= 1)) call abort
+ if (lbound(shape(i), 1) /= 1) call abort
+
+ if (any(ubound(shape(i)) /= 2)) call abort
+ if (ubound(shape(i), 1) /= 2) call abort
+
+ if (any(lbound(product(i,2)) /= 1)) call abort
+ if (any(ubound(product(i,2)) /= 3)) call abort
+ if (any(lbound(sum(i,2)) /= 1)) call abort
+ if (any(ubound(sum(i,2)) /= 3)) call abort
+ if (any(lbound(matmul(i,i)) /= 1)) call abort
+ if (any(ubound(matmul(i,i)) /= 3)) call abort
+ if (any(lbound(pack(i,.true.)) /= 1)) call abort
+ if (any(ubound(pack(i,.true.)) /= 9)) call abort
+ if (any(lbound(unpack(j,[.true.],[2])) /= 1)) call abort
+ if (any(ubound(unpack(j,[.true.],[2])) /= 1)) call abort
+
+ call sub1(i,3)
+ call sub1(reshape([7,9,4,6,7,9],[3,2]),3)
+ call sub2
+
+contains
+
+ subroutine sub1(a,n)
+ integer :: n, a(2:n+1,4:*)
+
+ if (any([lbound(a,1), lbound(a,2)] /= [2, 4])) call abort
+ if (any(lbound(a) /= [2, 4])) call abort
+ end subroutine sub1
+
+ subroutine sub2
+ integer :: x(3:2, 1:2)
+
+ if (size(x) /= 0) call abort
+ if (lbound (x, 1) /= 1 .or. lbound(x, 2) /= 1) call abort
+ if (any (lbound (x) /= [1, 1])) call abort
+ if (ubound (x, 1) /= 0 .or. ubound(x, 2) /= 2) call abort
+ if (any (ubound (x) /= [0, 2])) call abort
+ end subroutine sub2
+
+ subroutine sub3
+ integer :: x(4:5, 1:2)
+
+ if (size(x) /= 0) call abort
+ if (lbound (x, 1) /= 4 .or. lbound(x, 2) /= 1) call abort
+ if (any (lbound (x) /= [4, 1])) call abort
+ if (ubound (x, 1) /= 4 .or. ubound(x, 2) /= 2) call abort
+ if (any (ubound (x) /= [4, 2])) call abort
+ end subroutine sub3
+
+ subroutine foo (x,n)
+ integer :: x(7,n,2,*), n
+
+ if (ubound(x,1) /= 7 .or. ubound(x,2) /= 4 .or. ubound(x,3) /= 2) call abort
+ end subroutine foo
+
+ subroutine jackal (b, c)
+ integer :: b, c
+ integer :: soda(b:c, 3:4)
+
+ if (b > c) then
+ if (size(soda) /= 0) call abort
+ if (lbound (soda, 1) /= 1 .or. ubound (soda, 1) /= 0) call abort
+ else
+ if (size(soda) /= 2*(c-b+1)) call abort
+ if (lbound (soda, 1) /= b .or. ubound (soda, 1) /= c) call abort
+ end if
+
+ if (lbound (soda, 2) /= 3 .or. ubound (soda, 2) /= 4) call abort
+ if (any (lbound (soda) /= [lbound(soda,1), lbound(soda,2)])) call abort
+ if (any (ubound (soda) /= [ubound(soda,1), ubound(soda,2)])) call abort
+
+ end subroutine jackal
+
+end