===================================================================
*************** gfc_trans_allocate (gfc_code * code)
tree pstat;
tree error_label;
tree memsz;
stmtblock_t block;
if (!code->ext.alloc.list)
return NULL_TREE;
pstat = stat = error_label = tmp = memsz = NULL_TREE;
! gfc_start_block (&block);
/* Either STAT= and/or ERRMSG is present. */
if (code->expr1 || code->expr2)
tree pstat;
tree error_label;
tree memsz;
+ tree expr3;
+ tree slen3;
stmtblock_t block;
+ stmtblock_t post;
+ gfc_expr *sz;
+ gfc_se se_sz;
+ gfc_ref *ref;
+ bool allocatable;
if (!code->ext.alloc.list)
return NULL_TREE;
pstat = stat = error_label = tmp = memsz = NULL_TREE;
! gfc_init_block (&block);
! gfc_init_block (&post);
/* Either STAT= and/or ERRMSG is present. */
if (code->expr1 || code->expr2)
*************** gfc_trans_allocate (gfc_code * code)
TREE_USED (error_label) = 1;
}
+ expr3 = NULL_TREE;
+ slen3 = NULL_TREE;
+
for (al = code->ext.alloc.list; al != NULL; al = al->next)
{
expr = gfc_copy_expr (al->expr);
*************** gfc_trans_allocate (gfc_code * code)
gfc_add_data_component (expr);
gfc_init_se (&se, NULL);
- gfc_start_block (&se.pre);
se.want_pointer = 1;
se.descriptor_only = 1;
*************** gfc_trans_allocate (gfc_code * code)
{
if (code->expr3->ts.type == BT_CLASS)
{
- gfc_expr *sz;
- gfc_se se_sz;
sz = gfc_copy_expr (code->expr3);
gfc_add_vptr_component (sz);
gfc_add_size_component (sz);
*************** gfc_trans_allocate (gfc_code * code)
if (!code->expr3->ts.u.cl->backend_decl)
{
/* Convert and use the length expression. */
- gfc_se se_sz;
gfc_init_se (&se_sz, NULL);
if (code->expr3->expr_type == EXPR_VARIABLE
|| code->expr3->expr_type == EXPR_CONSTANT)
*************** gfc_trans_allocate (gfc_code * code)
gfc_conv_expr (&se_sz, code->expr3);
memsz = se_sz.string_length;
}
! else if (code->expr3->ts.u.cl
&& code->expr3->ts.u.cl->length)
{
gfc_conv_expr (&se_sz, code->expr3->ts.u.cl->length);
gfc_conv_expr (&se_sz, code->expr3);
memsz = se_sz.string_length;
}
! else if (code->expr3->mold
! && code->expr3->ts.u.cl
&& code->expr3->ts.u.cl->length)
{
gfc_conv_expr (&se_sz, code->expr3->ts.u.cl->length);
*************** gfc_trans_allocate (gfc_code * code)
gfc_add_block_to_block (&se.pre, &se_sz.post);
memsz = se_sz.expr;
}
- else if (code->ext.alloc.ts.u.cl
- && code->ext.alloc.ts.u.cl->length)
- {
- gfc_conv_expr (&se_sz, code->ext.alloc.ts.u.cl->length);
- memsz = se_sz.expr;
- }
else
{
! /* This is likely to be inefficient. */
! gfc_conv_expr (&se_sz, code->expr3);
! gfc_add_block_to_block (&se.pre, &se_sz.pre);
! se_sz.expr = gfc_evaluate_now (se_sz.expr, &se.pre);
! gfc_add_block_to_block (&se.pre, &se_sz.post);
! memsz = se_sz.string_length;
}
}
else
gfc_add_block_to_block (&se.pre, &se_sz.post);
memsz = se_sz.expr;
}
else
{
! /* This is would be inefficient and possibly could
! generate wrong code if the result were not stored
! in expr3/slen3. */
! if (slen3 == NULL_TREE)
! {
! gfc_conv_expr (&se_sz, code->expr3);
! gfc_add_block_to_block (&se.pre, &se_sz.pre);
! expr3 = gfc_evaluate_now (se_sz.expr, &se.pre);
! gfc_add_block_to_block (&post, &se_sz.post);
! slen3 = gfc_evaluate_now (se_sz.string_length,
! &se.pre);
! }
! memsz = slen3;
}
}
else
*************** gfc_trans_allocate (gfc_code * code)
TREE_TYPE (tmp), tmp,
fold_convert (TREE_TYPE (tmp), memsz));
}
/* Allocate - for non-pointers with re-alloc checking. */
! {
! gfc_ref *ref;
! bool allocatable;
!
! ref = expr->ref;
!
! /* Find the last reference in the chain. */
! while (ref && ref->next != NULL)
! {
! gcc_assert (ref->type != REF_ARRAY || ref->u.ar.type == AR_ELEMENT);
! ref = ref->next;
! }
!
! if (!ref)
! allocatable = expr->symtree->n.sym->attr.allocatable;
! else
! allocatable = ref->u.c.component->attr.allocatable;
!
! if (allocatable)
! tmp = gfc_allocate_array_with_status (&se.pre, se.expr, memsz,
! pstat, expr);
! else
! tmp = gfc_allocate_with_status (&se.pre, memsz, pstat);
! }
tmp = fold_build2_loc (input_location, MODIFY_EXPR, void_type_node,
se.expr,
TREE_TYPE (tmp), tmp,
fold_convert (TREE_TYPE (tmp), memsz));
}
+
/* Allocate - for non-pointers with re-alloc checking. */
! ref = expr->ref;
! /* Find the last reference in the chain. */
! while (ref && ref->next != NULL)
! {
! gcc_assert (ref->type != REF_ARRAY || ref->u.ar.type == AR_ELEMENT);
! ref = ref->next;
! }
! if (!ref)
! allocatable = expr->symtree->n.sym->attr.allocatable;
! else
! allocatable = ref->u.c.component->attr.allocatable;
!
! if (allocatable)
! tmp = gfc_allocate_array_with_status (&se.pre, se.expr, memsz,
! pstat, expr);
! else
! tmp = gfc_allocate_with_status (&se.pre, memsz, pstat);
tmp = fold_build2_loc (input_location, MODIFY_EXPR, void_type_node,
se.expr,
*************** gfc_trans_allocate (gfc_code * code)
tmp = gfc_nullify_alloc_comp (expr->ts.u.derived, tmp, 0);
gfc_add_expr_to_block (&se.pre, tmp);
}
-
}
! tmp = gfc_finish_block (&se.pre);
! gfc_add_expr_to_block (&block, tmp);
if (code->expr3 && !code->expr3->mold)
{
tmp = gfc_nullify_alloc_comp (expr->ts.u.derived, tmp, 0);
gfc_add_expr_to_block (&se.pre, tmp);
}
}
! gfc_add_block_to_block (&block, &se.pre);
if (code->expr3 && !code->expr3->mold)
{
*************** gfc_trans_allocate (gfc_code * code)
gfc_add_block_to_block (&call.pre, &call.post);
tmp = gfc_finish_block (&call.pre);
}
+ else if (expr3 != NULL_TREE)
+ {
+ tmp = build_fold_indirect_ref_loc (input_location, se.expr);
+ gfc_trans_string_copy (&block, slen3, tmp, code->expr3->ts.kind,
+ slen3, expr3, code->expr3->ts.kind);
+ tmp = NULL_TREE;
+ }
else
{
/* Switch off automatic reallocation since we have just done
*************** gfc_trans_allocate (gfc_code * code)
gfc_add_expr_to_block (&block, tmp);
}
+ gfc_add_block_to_block (&block, &se.post);
+ gfc_add_block_to_block (&block, &post);
+
return gfc_finish_block (&block);
}
===================================================================
***************
+ ! { dg-do run }
+ ! Test the fix for PR47592, in which the SOURCE expression was
+ ! being called twice.
+ !
+ ! Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
+ !
+ module foo
+ implicit none
+ contains
+ function bar()
+ integer bar
+ integer :: i=9
+ i = i + 1
+ bar = i
+ end function bar
+ end module foo
+
+ program note7_35
+ use foo
+ implicit none
+ character(:), allocatable :: name
+ character(:), allocatable :: src
+ integer n
+ n = 10
+ allocate(name, SOURCE=repeat('x',bar()))
+ if (name .ne. 'xxxxxxxxxx') call abort
+ if (len (name) .ne. 10 ) call abort
+ end program note7_35
+ ! { dg-final { cleanup-modules "foo" } }