1 /* Expression translation
2 Copyright (C) 2002-2018 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
4 and Steven Bosscher <s.bosscher@student.tudelft.nl>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* trans-expr.c-- generate GENERIC trees for gfc_expr. */
26 #include "coretypes.h"
31 #include "stringpool.h"
32 #include "diagnostic-core.h" /* For fatal_error. */
33 #include "fold-const.h"
34 #include "langhooks.h"
36 #include "constructor.h"
37 #include "trans-const.h"
38 #include "trans-types.h"
39 #include "trans-array.h"
40 /* Only for gfc_trans_assign and gfc_trans_pointer_assign. */
41 #include "trans-stmt.h"
42 #include "dependency.h"
45 /* Convert a scalar to an array descriptor. To be used for assumed-rank
49 get_scalar_to_descriptor_type (tree scalar
, symbol_attribute attr
)
51 enum gfc_array_kind akind
;
54 akind
= GFC_ARRAY_POINTER_CONT
;
55 else if (attr
.allocatable
)
56 akind
= GFC_ARRAY_ALLOCATABLE
;
58 akind
= GFC_ARRAY_ASSUMED_SHAPE_CONT
;
60 if (POINTER_TYPE_P (TREE_TYPE (scalar
)))
61 scalar
= TREE_TYPE (scalar
);
62 return gfc_get_array_type_bounds (TREE_TYPE (scalar
), 0, 0, NULL
, NULL
, 1,
63 akind
, !(attr
.pointer
|| attr
.target
));
67 gfc_conv_scalar_to_descriptor (gfc_se
*se
, tree scalar
, symbol_attribute attr
)
69 tree desc
, type
, etype
;
71 type
= get_scalar_to_descriptor_type (scalar
, attr
);
72 etype
= TREE_TYPE (scalar
);
73 desc
= gfc_create_var (type
, "desc");
74 DECL_ARTIFICIAL (desc
) = 1;
76 if (CONSTANT_CLASS_P (scalar
))
79 tmp
= gfc_create_var (TREE_TYPE (scalar
), "scalar");
80 gfc_add_modify (&se
->pre
, tmp
, scalar
);
83 if (!POINTER_TYPE_P (TREE_TYPE (scalar
)))
84 scalar
= gfc_build_addr_expr (NULL_TREE
, scalar
);
85 else if (TREE_TYPE (etype
) && TREE_CODE (TREE_TYPE (etype
)) == ARRAY_TYPE
)
86 etype
= TREE_TYPE (etype
);
87 gfc_add_modify (&se
->pre
, gfc_conv_descriptor_dtype (desc
),
88 gfc_get_dtype_rank_type (0, etype
));
89 gfc_conv_descriptor_data_set (&se
->pre
, desc
, scalar
);
91 /* Copy pointer address back - but only if it could have changed and
92 if the actual argument is a pointer and not, e.g., NULL(). */
93 if ((attr
.pointer
|| attr
.allocatable
) && attr
.intent
!= INTENT_IN
)
94 gfc_add_modify (&se
->post
, scalar
,
95 fold_convert (TREE_TYPE (scalar
),
96 gfc_conv_descriptor_data_get (desc
)));
101 /* Get the coarray token from the ultimate array or component ref.
102 Returns a NULL_TREE, when the ref object is not allocatable or pointer. */
105 gfc_get_ultimate_alloc_ptr_comps_caf_token (gfc_se
*outerse
, gfc_expr
*expr
)
107 gfc_symbol
*sym
= expr
->symtree
->n
.sym
;
108 bool is_coarray
= sym
->attr
.codimension
;
109 gfc_expr
*caf_expr
= gfc_copy_expr (expr
);
110 gfc_ref
*ref
= caf_expr
->ref
, *last_caf_ref
= NULL
;
114 if (ref
->type
== REF_COMPONENT
115 && (ref
->u
.c
.component
->attr
.allocatable
116 || ref
->u
.c
.component
->attr
.pointer
)
117 && (is_coarray
|| ref
->u
.c
.component
->attr
.codimension
))
122 if (last_caf_ref
== NULL
)
125 tree comp
= last_caf_ref
->u
.c
.component
->caf_token
, caf
;
127 bool comp_ref
= !last_caf_ref
->u
.c
.component
->attr
.dimension
;
128 if (comp
== NULL_TREE
&& comp_ref
)
130 gfc_init_se (&se
, outerse
);
131 gfc_free_ref_list (last_caf_ref
->next
);
132 last_caf_ref
->next
= NULL
;
133 caf_expr
->rank
= comp_ref
? 0 : last_caf_ref
->u
.c
.component
->as
->rank
;
134 se
.want_pointer
= comp_ref
;
135 gfc_conv_expr (&se
, caf_expr
);
136 gfc_add_block_to_block (&outerse
->pre
, &se
.pre
);
138 if (TREE_CODE (se
.expr
) == COMPONENT_REF
&& comp_ref
)
139 se
.expr
= TREE_OPERAND (se
.expr
, 0);
140 gfc_free_expr (caf_expr
);
143 caf
= fold_build3_loc (input_location
, COMPONENT_REF
,
144 TREE_TYPE (comp
), se
.expr
, comp
, NULL_TREE
);
146 caf
= gfc_conv_descriptor_token (se
.expr
);
147 return gfc_build_addr_expr (NULL_TREE
, caf
);
151 /* This is the seed for an eventual trans-class.c
153 The following parameters should not be used directly since they might
154 in future implementations. Use the corresponding APIs. */
155 #define CLASS_DATA_FIELD 0
156 #define CLASS_VPTR_FIELD 1
157 #define CLASS_LEN_FIELD 2
158 #define VTABLE_HASH_FIELD 0
159 #define VTABLE_SIZE_FIELD 1
160 #define VTABLE_EXTENDS_FIELD 2
161 #define VTABLE_DEF_INIT_FIELD 3
162 #define VTABLE_COPY_FIELD 4
163 #define VTABLE_FINAL_FIELD 5
164 #define VTABLE_DEALLOCATE_FIELD 6
168 gfc_class_set_static_fields (tree decl
, tree vptr
, tree data
)
172 vec
<constructor_elt
, va_gc
> *init
= NULL
;
174 field
= TYPE_FIELDS (TREE_TYPE (decl
));
175 tmp
= gfc_advance_chain (field
, CLASS_DATA_FIELD
);
176 CONSTRUCTOR_APPEND_ELT (init
, tmp
, data
);
178 tmp
= gfc_advance_chain (field
, CLASS_VPTR_FIELD
);
179 CONSTRUCTOR_APPEND_ELT (init
, tmp
, vptr
);
181 return build_constructor (TREE_TYPE (decl
), init
);
186 gfc_class_data_get (tree decl
)
189 if (POINTER_TYPE_P (TREE_TYPE (decl
)))
190 decl
= build_fold_indirect_ref_loc (input_location
, decl
);
191 data
= gfc_advance_chain (TYPE_FIELDS (TREE_TYPE (decl
)),
193 return fold_build3_loc (input_location
, COMPONENT_REF
,
194 TREE_TYPE (data
), decl
, data
,
200 gfc_class_vptr_get (tree decl
)
203 /* For class arrays decl may be a temporary descriptor handle, the vptr is
204 then available through the saved descriptor. */
205 if (VAR_P (decl
) && DECL_LANG_SPECIFIC (decl
)
206 && GFC_DECL_SAVED_DESCRIPTOR (decl
))
207 decl
= GFC_DECL_SAVED_DESCRIPTOR (decl
);
208 if (POINTER_TYPE_P (TREE_TYPE (decl
)))
209 decl
= build_fold_indirect_ref_loc (input_location
, decl
);
210 vptr
= gfc_advance_chain (TYPE_FIELDS (TREE_TYPE (decl
)),
212 return fold_build3_loc (input_location
, COMPONENT_REF
,
213 TREE_TYPE (vptr
), decl
, vptr
,
219 gfc_class_len_get (tree decl
)
222 /* For class arrays decl may be a temporary descriptor handle, the len is
223 then available through the saved descriptor. */
224 if (VAR_P (decl
) && DECL_LANG_SPECIFIC (decl
)
225 && GFC_DECL_SAVED_DESCRIPTOR (decl
))
226 decl
= GFC_DECL_SAVED_DESCRIPTOR (decl
);
227 if (POINTER_TYPE_P (TREE_TYPE (decl
)))
228 decl
= build_fold_indirect_ref_loc (input_location
, decl
);
229 len
= gfc_advance_chain (TYPE_FIELDS (TREE_TYPE (decl
)),
231 return fold_build3_loc (input_location
, COMPONENT_REF
,
232 TREE_TYPE (len
), decl
, len
,
237 /* Try to get the _len component of a class. When the class is not unlimited
238 poly, i.e. no _len field exists, then return a zero node. */
241 gfc_class_len_or_zero_get (tree decl
)
244 /* For class arrays decl may be a temporary descriptor handle, the vptr is
245 then available through the saved descriptor. */
246 if (VAR_P (decl
) && DECL_LANG_SPECIFIC (decl
)
247 && GFC_DECL_SAVED_DESCRIPTOR (decl
))
248 decl
= GFC_DECL_SAVED_DESCRIPTOR (decl
);
249 if (POINTER_TYPE_P (TREE_TYPE (decl
)))
250 decl
= build_fold_indirect_ref_loc (input_location
, decl
);
251 len
= gfc_advance_chain (TYPE_FIELDS (TREE_TYPE (decl
)),
253 return len
!= NULL_TREE
? fold_build3_loc (input_location
, COMPONENT_REF
,
254 TREE_TYPE (len
), decl
, len
,
256 : build_zero_cst (gfc_charlen_type_node
);
260 /* Get the specified FIELD from the VPTR. */
263 vptr_field_get (tree vptr
, int fieldno
)
266 vptr
= build_fold_indirect_ref_loc (input_location
, vptr
);
267 field
= gfc_advance_chain (TYPE_FIELDS (TREE_TYPE (vptr
)),
269 field
= fold_build3_loc (input_location
, COMPONENT_REF
,
270 TREE_TYPE (field
), vptr
, field
,
277 /* Get the field from the class' vptr. */
280 class_vtab_field_get (tree decl
, int fieldno
)
283 vptr
= gfc_class_vptr_get (decl
);
284 return vptr_field_get (vptr
, fieldno
);
288 /* Define a macro for creating the class_vtab_* and vptr_* accessors in
290 #define VTAB_GET_FIELD_GEN(name, field) tree \
291 gfc_class_vtab_## name ##_get (tree cl) \
293 return class_vtab_field_get (cl, field); \
297 gfc_vptr_## name ##_get (tree vptr) \
299 return vptr_field_get (vptr, field); \
302 VTAB_GET_FIELD_GEN (hash
, VTABLE_HASH_FIELD
)
303 VTAB_GET_FIELD_GEN (extends
, VTABLE_EXTENDS_FIELD
)
304 VTAB_GET_FIELD_GEN (def_init
, VTABLE_DEF_INIT_FIELD
)
305 VTAB_GET_FIELD_GEN (copy
, VTABLE_COPY_FIELD
)
306 VTAB_GET_FIELD_GEN (final
, VTABLE_FINAL_FIELD
)
307 VTAB_GET_FIELD_GEN (deallocate
, VTABLE_DEALLOCATE_FIELD
)
310 /* The size field is returned as an array index type. Therefore treat
311 it and only it specially. */
314 gfc_class_vtab_size_get (tree cl
)
317 size
= class_vtab_field_get (cl
, VTABLE_SIZE_FIELD
);
318 /* Always return size as an array index type. */
319 size
= fold_convert (gfc_array_index_type
, size
);
325 gfc_vptr_size_get (tree vptr
)
328 size
= vptr_field_get (vptr
, VTABLE_SIZE_FIELD
);
329 /* Always return size as an array index type. */
330 size
= fold_convert (gfc_array_index_type
, size
);
336 #undef CLASS_DATA_FIELD
337 #undef CLASS_VPTR_FIELD
338 #undef CLASS_LEN_FIELD
339 #undef VTABLE_HASH_FIELD
340 #undef VTABLE_SIZE_FIELD
341 #undef VTABLE_EXTENDS_FIELD
342 #undef VTABLE_DEF_INIT_FIELD
343 #undef VTABLE_COPY_FIELD
344 #undef VTABLE_FINAL_FIELD
347 /* Search for the last _class ref in the chain of references of this
348 expression and cut the chain there. Albeit this routine is similiar
349 to class.c::gfc_add_component_ref (), is there a significant
350 difference: gfc_add_component_ref () concentrates on an array ref to
351 be the last ref in the chain. This routine is oblivious to the kind
352 of refs following. */
355 gfc_find_and_cut_at_last_class_ref (gfc_expr
*e
)
358 gfc_ref
*ref
, *class_ref
, *tail
= NULL
, *array_ref
;
360 /* Find the last class reference. */
363 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
365 if (ref
->type
== REF_ARRAY
&& ref
->u
.ar
.type
!= AR_ELEMENT
)
368 if (ref
->type
== REF_COMPONENT
369 && ref
->u
.c
.component
->ts
.type
== BT_CLASS
)
371 /* Component to the right of a part reference with nonzero rank
372 must not have the ALLOCATABLE attribute. If attempts are
373 made to reference such a component reference, an error results
374 followed by an ICE. */
375 if (array_ref
&& CLASS_DATA (ref
->u
.c
.component
)->attr
.allocatable
)
380 if (ref
->next
== NULL
)
384 /* Remove and store all subsequent references after the
388 tail
= class_ref
->next
;
389 class_ref
->next
= NULL
;
391 else if (e
->symtree
&& e
->symtree
->n
.sym
->ts
.type
== BT_CLASS
)
397 base_expr
= gfc_expr_to_initialize (e
);
399 /* Restore the original tail expression. */
402 gfc_free_ref_list (class_ref
->next
);
403 class_ref
->next
= tail
;
405 else if (e
->symtree
&& e
->symtree
->n
.sym
->ts
.type
== BT_CLASS
)
407 gfc_free_ref_list (e
->ref
);
414 /* Reset the vptr to the declared type, e.g. after deallocation. */
417 gfc_reset_vptr (stmtblock_t
*block
, gfc_expr
*e
)
424 /* Evaluate the expression and obtain the vptr from it. */
425 gfc_init_se (&se
, NULL
);
427 gfc_conv_expr_descriptor (&se
, e
);
429 gfc_conv_expr (&se
, e
);
430 gfc_add_block_to_block (block
, &se
.pre
);
431 vptr
= gfc_get_vptr_from_expr (se
.expr
);
433 /* If a vptr is not found, we can do nothing more. */
434 if (vptr
== NULL_TREE
)
437 if (UNLIMITED_POLY (e
))
438 gfc_add_modify (block
, vptr
, build_int_cst (TREE_TYPE (vptr
), 0));
441 /* Return the vptr to the address of the declared type. */
442 vtab
= gfc_find_derived_vtab (e
->ts
.u
.derived
);
443 vtable
= vtab
->backend_decl
;
444 if (vtable
== NULL_TREE
)
445 vtable
= gfc_get_symbol_decl (vtab
);
446 vtable
= gfc_build_addr_expr (NULL
, vtable
);
447 vtable
= fold_convert (TREE_TYPE (vptr
), vtable
);
448 gfc_add_modify (block
, vptr
, vtable
);
453 /* Reset the len for unlimited polymorphic objects. */
456 gfc_reset_len (stmtblock_t
*block
, gfc_expr
*expr
)
460 e
= gfc_find_and_cut_at_last_class_ref (expr
);
463 gfc_add_len_component (e
);
464 gfc_init_se (&se_len
, NULL
);
465 gfc_conv_expr (&se_len
, e
);
466 gfc_add_modify (block
, se_len
.expr
,
467 fold_convert (TREE_TYPE (se_len
.expr
), integer_zero_node
));
472 /* Obtain the vptr of the last class reference in an expression.
473 Return NULL_TREE if no class reference is found. */
476 gfc_get_vptr_from_expr (tree expr
)
481 for (tmp
= expr
; tmp
; tmp
= TREE_OPERAND (tmp
, 0))
483 type
= TREE_TYPE (tmp
);
486 if (GFC_CLASS_TYPE_P (type
))
487 return gfc_class_vptr_get (tmp
);
488 if (type
!= TYPE_CANONICAL (type
))
489 type
= TYPE_CANONICAL (type
);
493 if (VAR_P (tmp
) || TREE_CODE (tmp
) == PARM_DECL
)
497 if (POINTER_TYPE_P (TREE_TYPE (tmp
)))
498 tmp
= build_fold_indirect_ref_loc (input_location
, tmp
);
500 if (GFC_CLASS_TYPE_P (TREE_TYPE (tmp
)))
501 return gfc_class_vptr_get (tmp
);
508 class_array_data_assign (stmtblock_t
*block
, tree lhs_desc
, tree rhs_desc
,
511 tree tmp
, tmp2
, type
;
513 gfc_conv_descriptor_data_set (block
, lhs_desc
,
514 gfc_conv_descriptor_data_get (rhs_desc
));
515 gfc_conv_descriptor_offset_set (block
, lhs_desc
,
516 gfc_conv_descriptor_offset_get (rhs_desc
));
518 gfc_add_modify (block
, gfc_conv_descriptor_dtype (lhs_desc
),
519 gfc_conv_descriptor_dtype (rhs_desc
));
521 /* Assign the dimension as range-ref. */
522 tmp
= gfc_get_descriptor_dimension (lhs_desc
);
523 tmp2
= gfc_get_descriptor_dimension (rhs_desc
);
525 type
= lhs_type
? TREE_TYPE (tmp
) : TREE_TYPE (tmp2
);
526 tmp
= build4_loc (input_location
, ARRAY_RANGE_REF
, type
, tmp
,
527 gfc_index_zero_node
, NULL_TREE
, NULL_TREE
);
528 tmp2
= build4_loc (input_location
, ARRAY_RANGE_REF
, type
, tmp2
,
529 gfc_index_zero_node
, NULL_TREE
, NULL_TREE
);
530 gfc_add_modify (block
, tmp
, tmp2
);
534 /* Takes a derived type expression and returns the address of a temporary
535 class object of the 'declared' type. If vptr is not NULL, this is
536 used for the temporary class object.
537 optional_alloc_ptr is false when the dummy is neither allocatable
538 nor a pointer; that's only relevant for the optional handling. */
540 gfc_conv_derived_to_class (gfc_se
*parmse
, gfc_expr
*e
,
541 gfc_typespec class_ts
, tree vptr
, bool optional
,
542 bool optional_alloc_ptr
)
545 tree cond_optional
= NULL_TREE
;
552 /* The derived type needs to be converted to a temporary
554 tmp
= gfc_typenode_for_spec (&class_ts
);
555 var
= gfc_create_var (tmp
, "class");
558 ctree
= gfc_class_vptr_get (var
);
560 if (vptr
!= NULL_TREE
)
562 /* Use the dynamic vptr. */
567 /* In this case the vtab corresponds to the derived type and the
568 vptr must point to it. */
569 vtab
= gfc_find_derived_vtab (e
->ts
.u
.derived
);
571 tmp
= gfc_build_addr_expr (NULL_TREE
, gfc_get_symbol_decl (vtab
));
573 gfc_add_modify (&parmse
->pre
, ctree
,
574 fold_convert (TREE_TYPE (ctree
), tmp
));
576 /* Now set the data field. */
577 ctree
= gfc_class_data_get (var
);
580 cond_optional
= gfc_conv_expr_present (e
->symtree
->n
.sym
);
582 if (parmse
->expr
&& POINTER_TYPE_P (TREE_TYPE (parmse
->expr
)))
584 /* If there is a ready made pointer to a derived type, use it
585 rather than evaluating the expression again. */
586 tmp
= fold_convert (TREE_TYPE (ctree
), parmse
->expr
);
587 gfc_add_modify (&parmse
->pre
, ctree
, tmp
);
589 else if (parmse
->ss
&& parmse
->ss
->info
&& parmse
->ss
->info
->useflags
)
591 /* For an array reference in an elemental procedure call we need
592 to retain the ss to provide the scalarized array reference. */
593 gfc_conv_expr_reference (parmse
, e
);
594 tmp
= fold_convert (TREE_TYPE (ctree
), parmse
->expr
);
596 tmp
= build3_loc (input_location
, COND_EXPR
, TREE_TYPE (tmp
),
598 fold_convert (TREE_TYPE (tmp
), null_pointer_node
));
599 gfc_add_modify (&parmse
->pre
, ctree
, tmp
);
603 ss
= gfc_walk_expr (e
);
604 if (ss
== gfc_ss_terminator
)
607 gfc_conv_expr_reference (parmse
, e
);
609 /* Scalar to an assumed-rank array. */
610 if (class_ts
.u
.derived
->components
->as
)
613 type
= get_scalar_to_descriptor_type (parmse
->expr
,
615 gfc_add_modify (&parmse
->pre
, gfc_conv_descriptor_dtype (ctree
),
616 gfc_get_dtype (type
));
618 parmse
->expr
= build3_loc (input_location
, COND_EXPR
,
619 TREE_TYPE (parmse
->expr
),
620 cond_optional
, parmse
->expr
,
621 fold_convert (TREE_TYPE (parmse
->expr
),
623 gfc_conv_descriptor_data_set (&parmse
->pre
, ctree
, parmse
->expr
);
627 tmp
= fold_convert (TREE_TYPE (ctree
), parmse
->expr
);
629 tmp
= build3_loc (input_location
, COND_EXPR
, TREE_TYPE (tmp
),
631 fold_convert (TREE_TYPE (tmp
),
633 gfc_add_modify (&parmse
->pre
, ctree
, tmp
);
639 gfc_init_block (&block
);
643 parmse
->use_offset
= 1;
644 gfc_conv_expr_descriptor (parmse
, e
);
646 /* Detect any array references with vector subscripts. */
647 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
648 if (ref
->type
== REF_ARRAY
649 && ref
->u
.ar
.type
!= AR_ELEMENT
650 && ref
->u
.ar
.type
!= AR_FULL
)
652 for (dim
= 0; dim
< ref
->u
.ar
.dimen
; dim
++)
653 if (ref
->u
.ar
.dimen_type
[dim
] == DIMEN_VECTOR
)
655 if (dim
< ref
->u
.ar
.dimen
)
659 /* Array references with vector subscripts and non-variable expressions
660 need be converted to a one-based descriptor. */
661 if (ref
|| e
->expr_type
!= EXPR_VARIABLE
)
663 for (dim
= 0; dim
< e
->rank
; ++dim
)
664 gfc_conv_shift_descriptor_lbound (&block
, parmse
->expr
, dim
,
668 if (e
->rank
!= class_ts
.u
.derived
->components
->as
->rank
)
670 gcc_assert (class_ts
.u
.derived
->components
->as
->type
672 class_array_data_assign (&block
, ctree
, parmse
->expr
, false);
676 if (gfc_expr_attr (e
).codimension
)
677 parmse
->expr
= fold_build1_loc (input_location
,
681 gfc_add_modify (&block
, ctree
, parmse
->expr
);
686 tmp
= gfc_finish_block (&block
);
688 gfc_init_block (&block
);
689 gfc_conv_descriptor_data_set (&block
, ctree
, null_pointer_node
);
691 tmp
= build3_v (COND_EXPR
, cond_optional
, tmp
,
692 gfc_finish_block (&block
));
693 gfc_add_expr_to_block (&parmse
->pre
, tmp
);
696 gfc_add_block_to_block (&parmse
->pre
, &block
);
700 if (class_ts
.u
.derived
->components
->ts
.type
== BT_DERIVED
701 && class_ts
.u
.derived
->components
->ts
.u
.derived
702 ->attr
.unlimited_polymorphic
)
704 /* Take care about initializing the _len component correctly. */
705 ctree
= gfc_class_len_get (var
);
706 if (UNLIMITED_POLY (e
))
711 len
= gfc_copy_expr (e
);
712 gfc_add_len_component (len
);
713 gfc_init_se (&se
, NULL
);
714 gfc_conv_expr (&se
, len
);
716 tmp
= build3_loc (input_location
, COND_EXPR
, TREE_TYPE (se
.expr
),
717 cond_optional
, se
.expr
,
718 fold_convert (TREE_TYPE (se
.expr
),
724 tmp
= integer_zero_node
;
725 gfc_add_modify (&parmse
->pre
, ctree
, fold_convert (TREE_TYPE (ctree
),
728 /* Pass the address of the class object. */
729 parmse
->expr
= gfc_build_addr_expr (NULL_TREE
, var
);
731 if (optional
&& optional_alloc_ptr
)
732 parmse
->expr
= build3_loc (input_location
, COND_EXPR
,
733 TREE_TYPE (parmse
->expr
),
734 cond_optional
, parmse
->expr
,
735 fold_convert (TREE_TYPE (parmse
->expr
),
740 /* Create a new class container, which is required as scalar coarrays
741 have an array descriptor while normal scalars haven't. Optionally,
742 NULL pointer checks are added if the argument is OPTIONAL. */
745 class_scalar_coarray_to_class (gfc_se
*parmse
, gfc_expr
*e
,
746 gfc_typespec class_ts
, bool optional
)
748 tree var
, ctree
, tmp
;
753 gfc_init_block (&block
);
756 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
758 if (ref
->type
== REF_COMPONENT
759 && ref
->u
.c
.component
->ts
.type
== BT_CLASS
)
763 if (class_ref
== NULL
764 && e
->symtree
&& e
->symtree
->n
.sym
->ts
.type
== BT_CLASS
)
765 tmp
= e
->symtree
->n
.sym
->backend_decl
;
768 /* Remove everything after the last class reference, convert the
769 expression and then recover its tailend once more. */
771 ref
= class_ref
->next
;
772 class_ref
->next
= NULL
;
773 gfc_init_se (&tmpse
, NULL
);
774 gfc_conv_expr (&tmpse
, e
);
775 class_ref
->next
= ref
;
779 var
= gfc_typenode_for_spec (&class_ts
);
780 var
= gfc_create_var (var
, "class");
782 ctree
= gfc_class_vptr_get (var
);
783 gfc_add_modify (&block
, ctree
,
784 fold_convert (TREE_TYPE (ctree
), gfc_class_vptr_get (tmp
)));
786 ctree
= gfc_class_data_get (var
);
787 tmp
= gfc_conv_descriptor_data_get (gfc_class_data_get (tmp
));
788 gfc_add_modify (&block
, ctree
, fold_convert (TREE_TYPE (ctree
), tmp
));
790 /* Pass the address of the class object. */
791 parmse
->expr
= gfc_build_addr_expr (NULL_TREE
, var
);
795 tree cond
= gfc_conv_expr_present (e
->symtree
->n
.sym
);
798 tmp
= gfc_finish_block (&block
);
800 gfc_init_block (&block
);
801 tmp2
= gfc_class_data_get (var
);
802 gfc_add_modify (&block
, tmp2
, fold_convert (TREE_TYPE (tmp2
),
804 tmp2
= gfc_finish_block (&block
);
806 tmp
= build3_loc (input_location
, COND_EXPR
, void_type_node
,
808 gfc_add_expr_to_block (&parmse
->pre
, tmp
);
811 gfc_add_block_to_block (&parmse
->pre
, &block
);
815 /* Takes an intrinsic type expression and returns the address of a temporary
816 class object of the 'declared' type. */
818 gfc_conv_intrinsic_to_class (gfc_se
*parmse
, gfc_expr
*e
,
819 gfc_typespec class_ts
)
827 /* The intrinsic type needs to be converted to a temporary
829 tmp
= gfc_typenode_for_spec (&class_ts
);
830 var
= gfc_create_var (tmp
, "class");
833 ctree
= gfc_class_vptr_get (var
);
835 vtab
= gfc_find_vtab (&e
->ts
);
837 tmp
= gfc_build_addr_expr (NULL_TREE
, gfc_get_symbol_decl (vtab
));
838 gfc_add_modify (&parmse
->pre
, ctree
,
839 fold_convert (TREE_TYPE (ctree
), tmp
));
841 /* Now set the data field. */
842 ctree
= gfc_class_data_get (var
);
843 if (parmse
->ss
&& parmse
->ss
->info
->useflags
)
845 /* For an array reference in an elemental procedure call we need
846 to retain the ss to provide the scalarized array reference. */
847 gfc_conv_expr_reference (parmse
, e
);
848 tmp
= fold_convert (TREE_TYPE (ctree
), parmse
->expr
);
849 gfc_add_modify (&parmse
->pre
, ctree
, tmp
);
853 ss
= gfc_walk_expr (e
);
854 if (ss
== gfc_ss_terminator
)
857 gfc_conv_expr_reference (parmse
, e
);
858 if (class_ts
.u
.derived
->components
->as
859 && class_ts
.u
.derived
->components
->as
->type
== AS_ASSUMED_RANK
)
861 tmp
= gfc_conv_scalar_to_descriptor (parmse
, parmse
->expr
,
863 tmp
= fold_build1_loc (input_location
, VIEW_CONVERT_EXPR
,
864 TREE_TYPE (ctree
), tmp
);
867 tmp
= fold_convert (TREE_TYPE (ctree
), parmse
->expr
);
868 gfc_add_modify (&parmse
->pre
, ctree
, tmp
);
873 parmse
->use_offset
= 1;
874 gfc_conv_expr_descriptor (parmse
, e
);
875 if (class_ts
.u
.derived
->components
->as
->rank
!= e
->rank
)
877 tmp
= fold_build1_loc (input_location
, VIEW_CONVERT_EXPR
,
878 TREE_TYPE (ctree
), parmse
->expr
);
879 gfc_add_modify (&parmse
->pre
, ctree
, tmp
);
882 gfc_add_modify (&parmse
->pre
, ctree
, parmse
->expr
);
886 gcc_assert (class_ts
.type
== BT_CLASS
);
887 if (class_ts
.u
.derived
->components
->ts
.type
== BT_DERIVED
888 && class_ts
.u
.derived
->components
->ts
.u
.derived
889 ->attr
.unlimited_polymorphic
)
891 ctree
= gfc_class_len_get (var
);
892 /* When the actual arg is a char array, then set the _len component of the
893 unlimited polymorphic entity to the length of the string. */
894 if (e
->ts
.type
== BT_CHARACTER
)
896 /* Start with parmse->string_length because this seems to be set to a
897 correct value more often. */
898 if (parmse
->string_length
)
899 tmp
= parmse
->string_length
;
900 /* When the string_length is not yet set, then try the backend_decl of
902 else if (e
->ts
.u
.cl
->backend_decl
)
903 tmp
= e
->ts
.u
.cl
->backend_decl
;
904 /* If both of the above approaches fail, then try to generate an
905 expression from the input, which is only feasible currently, when the
906 expression can be evaluated to a constant one. */
909 /* Try to simplify the expression. */
910 gfc_simplify_expr (e
, 0);
911 if (e
->expr_type
== EXPR_CONSTANT
&& !e
->ts
.u
.cl
->resolved
)
913 /* Amazingly all data is present to compute the length of a
914 constant string, but the expression is not yet there. */
915 e
->ts
.u
.cl
->length
= gfc_get_constant_expr (BT_INTEGER
,
916 gfc_charlen_int_kind
,
918 mpz_set_ui (e
->ts
.u
.cl
->length
->value
.integer
,
919 e
->value
.character
.length
);
920 gfc_conv_const_charlen (e
->ts
.u
.cl
);
921 e
->ts
.u
.cl
->resolved
= 1;
922 tmp
= e
->ts
.u
.cl
->backend_decl
;
926 gfc_error ("Can't compute the length of the char array at %L.",
932 tmp
= integer_zero_node
;
934 gfc_add_modify (&parmse
->pre
, ctree
, fold_convert (TREE_TYPE (ctree
), tmp
));
936 else if (class_ts
.type
== BT_CLASS
937 && class_ts
.u
.derived
->components
938 && class_ts
.u
.derived
->components
->ts
.u
939 .derived
->attr
.unlimited_polymorphic
)
941 ctree
= gfc_class_len_get (var
);
942 gfc_add_modify (&parmse
->pre
, ctree
,
943 fold_convert (TREE_TYPE (ctree
),
946 /* Pass the address of the class object. */
947 parmse
->expr
= gfc_build_addr_expr (NULL_TREE
, var
);
951 /* Takes a scalarized class array expression and returns the
952 address of a temporary scalar class object of the 'declared'
954 OOP-TODO: This could be improved by adding code that branched on
955 the dynamic type being the same as the declared type. In this case
956 the original class expression can be passed directly.
957 optional_alloc_ptr is false when the dummy is neither allocatable
958 nor a pointer; that's relevant for the optional handling.
959 Set copyback to true if class container's _data and _vtab pointers
960 might get modified. */
963 gfc_conv_class_to_class (gfc_se
*parmse
, gfc_expr
*e
, gfc_typespec class_ts
,
964 bool elemental
, bool copyback
, bool optional
,
965 bool optional_alloc_ptr
)
971 tree cond
= NULL_TREE
;
972 tree slen
= NULL_TREE
;
976 bool full_array
= false;
978 gfc_init_block (&block
);
981 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
983 if (ref
->type
== REF_COMPONENT
984 && ref
->u
.c
.component
->ts
.type
== BT_CLASS
)
987 if (ref
->next
== NULL
)
991 if ((ref
== NULL
|| class_ref
== ref
)
992 && !(gfc_is_class_array_function (e
) && parmse
->class_vptr
!= NULL_TREE
)
993 && (!class_ts
.u
.derived
->components
->as
994 || class_ts
.u
.derived
->components
->as
->rank
!= -1))
997 /* Test for FULL_ARRAY. */
998 if (e
->rank
== 0 && gfc_expr_attr (e
).codimension
999 && gfc_expr_attr (e
).dimension
)
1002 gfc_is_class_array_ref (e
, &full_array
);
1004 /* The derived type needs to be converted to a temporary
1006 tmp
= gfc_typenode_for_spec (&class_ts
);
1007 var
= gfc_create_var (tmp
, "class");
1010 ctree
= gfc_class_data_get (var
);
1011 if (class_ts
.u
.derived
->components
->as
1012 && e
->rank
!= class_ts
.u
.derived
->components
->as
->rank
)
1016 tree type
= get_scalar_to_descriptor_type (parmse
->expr
,
1018 gfc_add_modify (&block
, gfc_conv_descriptor_dtype (ctree
),
1019 gfc_get_dtype (type
));
1021 tmp
= gfc_class_data_get (parmse
->expr
);
1022 if (!POINTER_TYPE_P (TREE_TYPE (tmp
)))
1023 tmp
= gfc_build_addr_expr (NULL_TREE
, tmp
);
1025 gfc_conv_descriptor_data_set (&block
, ctree
, tmp
);
1028 class_array_data_assign (&block
, ctree
, parmse
->expr
, false);
1032 if (TREE_TYPE (parmse
->expr
) != TREE_TYPE (ctree
))
1033 parmse
->expr
= fold_build1_loc (input_location
, VIEW_CONVERT_EXPR
,
1034 TREE_TYPE (ctree
), parmse
->expr
);
1035 gfc_add_modify (&block
, ctree
, parmse
->expr
);
1038 /* Return the data component, except in the case of scalarized array
1039 references, where nullification of the cannot occur and so there
1041 if (!elemental
&& full_array
&& copyback
)
1043 if (class_ts
.u
.derived
->components
->as
1044 && e
->rank
!= class_ts
.u
.derived
->components
->as
->rank
)
1047 gfc_add_modify (&parmse
->post
, gfc_class_data_get (parmse
->expr
),
1048 gfc_conv_descriptor_data_get (ctree
));
1050 class_array_data_assign (&parmse
->post
, parmse
->expr
, ctree
, true);
1053 gfc_add_modify (&parmse
->post
, parmse
->expr
, ctree
);
1057 ctree
= gfc_class_vptr_get (var
);
1059 /* The vptr is the second field of the actual argument.
1060 First we have to find the corresponding class reference. */
1063 if (gfc_is_class_array_function (e
)
1064 && parmse
->class_vptr
!= NULL_TREE
)
1065 tmp
= parmse
->class_vptr
;
1066 else if (class_ref
== NULL
1067 && e
->symtree
&& e
->symtree
->n
.sym
->ts
.type
== BT_CLASS
)
1069 tmp
= e
->symtree
->n
.sym
->backend_decl
;
1071 if (TREE_CODE (tmp
) == FUNCTION_DECL
)
1072 tmp
= gfc_get_fake_result_decl (e
->symtree
->n
.sym
, 0);
1074 if (DECL_LANG_SPECIFIC (tmp
) && GFC_DECL_SAVED_DESCRIPTOR (tmp
))
1075 tmp
= GFC_DECL_SAVED_DESCRIPTOR (tmp
);
1077 slen
= build_zero_cst (size_type_node
);
1081 /* Remove everything after the last class reference, convert the
1082 expression and then recover its tailend once more. */
1084 ref
= class_ref
->next
;
1085 class_ref
->next
= NULL
;
1086 gfc_init_se (&tmpse
, NULL
);
1087 gfc_conv_expr (&tmpse
, e
);
1088 class_ref
->next
= ref
;
1090 slen
= tmpse
.string_length
;
1093 gcc_assert (tmp
!= NULL_TREE
);
1095 /* Dereference if needs be. */
1096 if (TREE_CODE (TREE_TYPE (tmp
)) == REFERENCE_TYPE
)
1097 tmp
= build_fold_indirect_ref_loc (input_location
, tmp
);
1099 if (!(gfc_is_class_array_function (e
) && parmse
->class_vptr
))
1100 vptr
= gfc_class_vptr_get (tmp
);
1104 gfc_add_modify (&block
, ctree
,
1105 fold_convert (TREE_TYPE (ctree
), vptr
));
1107 /* Return the vptr component, except in the case of scalarized array
1108 references, where the dynamic type cannot change. */
1109 if (!elemental
&& full_array
&& copyback
)
1110 gfc_add_modify (&parmse
->post
, vptr
,
1111 fold_convert (TREE_TYPE (vptr
), ctree
));
1113 /* For unlimited polymorphic objects also set the _len component. */
1114 if (class_ts
.type
== BT_CLASS
1115 && class_ts
.u
.derived
->components
1116 && class_ts
.u
.derived
->components
->ts
.u
1117 .derived
->attr
.unlimited_polymorphic
)
1119 ctree
= gfc_class_len_get (var
);
1120 if (UNLIMITED_POLY (e
))
1121 tmp
= gfc_class_len_get (tmp
);
1122 else if (e
->ts
.type
== BT_CHARACTER
)
1124 gcc_assert (slen
!= NULL_TREE
);
1128 tmp
= build_zero_cst (size_type_node
);
1129 gfc_add_modify (&parmse
->pre
, ctree
,
1130 fold_convert (TREE_TYPE (ctree
), tmp
));
1132 /* Return the len component, except in the case of scalarized array
1133 references, where the dynamic type cannot change. */
1134 if (!elemental
&& full_array
&& copyback
)
1135 gfc_add_modify (&parmse
->post
, tmp
,
1136 fold_convert (TREE_TYPE (tmp
), ctree
));
1143 cond
= gfc_conv_expr_present (e
->symtree
->n
.sym
);
1144 /* parmse->pre may contain some preparatory instructions for the
1145 temporary array descriptor. Those may only be executed when the
1146 optional argument is set, therefore add parmse->pre's instructions
1147 to block, which is later guarded by an if (optional_arg_given). */
1148 gfc_add_block_to_block (&parmse
->pre
, &block
);
1149 block
.head
= parmse
->pre
.head
;
1150 parmse
->pre
.head
= NULL_TREE
;
1151 tmp
= gfc_finish_block (&block
);
1153 if (optional_alloc_ptr
)
1154 tmp2
= build_empty_stmt (input_location
);
1157 gfc_init_block (&block
);
1159 tmp2
= gfc_conv_descriptor_data_get (gfc_class_data_get (var
));
1160 gfc_add_modify (&block
, tmp2
, fold_convert (TREE_TYPE (tmp2
),
1161 null_pointer_node
));
1162 tmp2
= gfc_finish_block (&block
);
1165 tmp
= build3_loc (input_location
, COND_EXPR
, void_type_node
,
1167 gfc_add_expr_to_block (&parmse
->pre
, tmp
);
1170 gfc_add_block_to_block (&parmse
->pre
, &block
);
1172 /* Pass the address of the class object. */
1173 parmse
->expr
= gfc_build_addr_expr (NULL_TREE
, var
);
1175 if (optional
&& optional_alloc_ptr
)
1176 parmse
->expr
= build3_loc (input_location
, COND_EXPR
,
1177 TREE_TYPE (parmse
->expr
),
1179 fold_convert (TREE_TYPE (parmse
->expr
),
1180 null_pointer_node
));
1184 /* Given a class array declaration and an index, returns the address
1185 of the referenced element. */
1188 gfc_get_class_array_ref (tree index
, tree class_decl
, tree data_comp
,
1191 tree data
, size
, tmp
, ctmp
, offset
, ptr
;
1193 data
= data_comp
!= NULL_TREE
? data_comp
:
1194 gfc_class_data_get (class_decl
);
1195 size
= gfc_class_vtab_size_get (class_decl
);
1199 tmp
= fold_convert (gfc_array_index_type
,
1200 gfc_class_len_get (class_decl
));
1201 ctmp
= fold_build2_loc (input_location
, MULT_EXPR
,
1202 gfc_array_index_type
, size
, tmp
);
1203 tmp
= fold_build2_loc (input_location
, GT_EXPR
,
1204 logical_type_node
, tmp
,
1205 build_zero_cst (TREE_TYPE (tmp
)));
1206 size
= fold_build3_loc (input_location
, COND_EXPR
,
1207 gfc_array_index_type
, tmp
, ctmp
, size
);
1210 offset
= fold_build2_loc (input_location
, MULT_EXPR
,
1211 gfc_array_index_type
,
1214 data
= gfc_conv_descriptor_data_get (data
);
1215 ptr
= fold_convert (pvoid_type_node
, data
);
1216 ptr
= fold_build_pointer_plus_loc (input_location
, ptr
, offset
);
1217 return fold_convert (TREE_TYPE (data
), ptr
);
1221 /* Copies one class expression to another, assuming that if either
1222 'to' or 'from' are arrays they are packed. Should 'from' be
1223 NULL_TREE, the initialization expression for 'to' is used, assuming
1224 that the _vptr is set. */
1227 gfc_copy_class_to_class (tree from
, tree to
, tree nelems
, bool unlimited
)
1237 vec
<tree
, va_gc
> *args
;
1242 bool is_from_desc
= false, is_to_class
= false;
1245 /* To prevent warnings on uninitialized variables. */
1246 from_len
= to_len
= NULL_TREE
;
1248 if (from
!= NULL_TREE
)
1249 fcn
= gfc_class_vtab_copy_get (from
);
1251 fcn
= gfc_class_vtab_copy_get (to
);
1253 fcn_type
= TREE_TYPE (TREE_TYPE (fcn
));
1255 if (from
!= NULL_TREE
)
1257 is_from_desc
= GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (from
));
1261 from
= GFC_DECL_SAVED_DESCRIPTOR (from
);
1265 /* Check that from is a class. When the class is part of a coarray,
1266 then from is a common pointer and is to be used as is. */
1267 tmp
= POINTER_TYPE_P (TREE_TYPE (from
))
1268 ? build_fold_indirect_ref (from
) : from
;
1270 (GFC_CLASS_TYPE_P (TREE_TYPE (tmp
))
1271 || (DECL_P (tmp
) && GFC_DECL_CLASS (tmp
)))
1272 ? gfc_class_data_get (from
) : from
;
1273 is_from_desc
= GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (from_data
));
1277 from_data
= gfc_class_vtab_def_init_get (to
);
1281 if (from
!= NULL_TREE
&& unlimited
)
1282 from_len
= gfc_class_len_or_zero_get (from
);
1284 from_len
= build_zero_cst (size_type_node
);
1287 if (GFC_CLASS_TYPE_P (TREE_TYPE (to
)))
1290 to_data
= gfc_class_data_get (to
);
1292 to_len
= gfc_class_len_get (to
);
1295 /* When to is a BT_DERIVED and not a BT_CLASS, then to_data == to. */
1298 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (to_data
)))
1300 stmtblock_t loopbody
;
1304 tree orig_nelems
= nelems
; /* Needed for bounds check. */
1306 gfc_init_block (&body
);
1307 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
1308 gfc_array_index_type
, nelems
,
1309 gfc_index_one_node
);
1310 nelems
= gfc_evaluate_now (tmp
, &body
);
1311 index
= gfc_create_var (gfc_array_index_type
, "S");
1315 from_ref
= gfc_get_class_array_ref (index
, from
, from_data
,
1317 vec_safe_push (args
, from_ref
);
1320 vec_safe_push (args
, from_data
);
1323 to_ref
= gfc_get_class_array_ref (index
, to
, to_data
, unlimited
);
1326 tmp
= gfc_conv_array_data (to
);
1327 tmp
= build_fold_indirect_ref_loc (input_location
, tmp
);
1328 to_ref
= gfc_build_addr_expr (NULL_TREE
,
1329 gfc_build_array_ref (tmp
, index
, to
));
1331 vec_safe_push (args
, to_ref
);
1333 /* Add bounds check. */
1334 if ((gfc_option
.rtcheck
& GFC_RTCHECK_BOUNDS
) > 0 && is_from_desc
)
1337 const char *name
= "<<unknown>>";
1341 name
= (const char *)(DECL_NAME (to
)->identifier
.id
.str
);
1343 from_len
= gfc_conv_descriptor_size (from_data
, 1);
1344 tmp
= fold_build2_loc (input_location
, NE_EXPR
,
1345 logical_type_node
, from_len
, orig_nelems
);
1346 msg
= xasprintf ("Array bound mismatch for dimension %d "
1347 "of array '%s' (%%ld/%%ld)",
1350 gfc_trans_runtime_check (true, false, tmp
, &body
,
1351 &gfc_current_locus
, msg
,
1352 fold_convert (long_integer_type_node
, orig_nelems
),
1353 fold_convert (long_integer_type_node
, from_len
));
1358 tmp
= build_call_vec (fcn_type
, fcn
, args
);
1360 /* Build the body of the loop. */
1361 gfc_init_block (&loopbody
);
1362 gfc_add_expr_to_block (&loopbody
, tmp
);
1364 /* Build the loop and return. */
1365 gfc_init_loopinfo (&loop
);
1367 loop
.from
[0] = gfc_index_zero_node
;
1368 loop
.loopvar
[0] = index
;
1369 loop
.to
[0] = nelems
;
1370 gfc_trans_scalarizing_loops (&loop
, &loopbody
);
1371 gfc_init_block (&ifbody
);
1372 gfc_add_block_to_block (&ifbody
, &loop
.pre
);
1373 stdcopy
= gfc_finish_block (&ifbody
);
1374 /* In initialization mode from_len is a constant zero. */
1375 if (unlimited
&& !integer_zerop (from_len
))
1377 vec_safe_push (args
, from_len
);
1378 vec_safe_push (args
, to_len
);
1379 tmp
= build_call_vec (fcn_type
, fcn
, args
);
1380 /* Build the body of the loop. */
1381 gfc_init_block (&loopbody
);
1382 gfc_add_expr_to_block (&loopbody
, tmp
);
1384 /* Build the loop and return. */
1385 gfc_init_loopinfo (&loop
);
1387 loop
.from
[0] = gfc_index_zero_node
;
1388 loop
.loopvar
[0] = index
;
1389 loop
.to
[0] = nelems
;
1390 gfc_trans_scalarizing_loops (&loop
, &loopbody
);
1391 gfc_init_block (&ifbody
);
1392 gfc_add_block_to_block (&ifbody
, &loop
.pre
);
1393 extcopy
= gfc_finish_block (&ifbody
);
1395 tmp
= fold_build2_loc (input_location
, GT_EXPR
,
1396 logical_type_node
, from_len
,
1397 build_zero_cst (TREE_TYPE (from_len
)));
1398 tmp
= fold_build3_loc (input_location
, COND_EXPR
,
1399 void_type_node
, tmp
, extcopy
, stdcopy
);
1400 gfc_add_expr_to_block (&body
, tmp
);
1401 tmp
= gfc_finish_block (&body
);
1405 gfc_add_expr_to_block (&body
, stdcopy
);
1406 tmp
= gfc_finish_block (&body
);
1408 gfc_cleanup_loop (&loop
);
1412 gcc_assert (!is_from_desc
);
1413 vec_safe_push (args
, from_data
);
1414 vec_safe_push (args
, to_data
);
1415 stdcopy
= build_call_vec (fcn_type
, fcn
, args
);
1417 /* In initialization mode from_len is a constant zero. */
1418 if (unlimited
&& !integer_zerop (from_len
))
1420 vec_safe_push (args
, from_len
);
1421 vec_safe_push (args
, to_len
);
1422 extcopy
= build_call_vec (fcn_type
, fcn
, args
);
1423 tmp
= fold_build2_loc (input_location
, GT_EXPR
,
1424 logical_type_node
, from_len
,
1425 build_zero_cst (TREE_TYPE (from_len
)));
1426 tmp
= fold_build3_loc (input_location
, COND_EXPR
,
1427 void_type_node
, tmp
, extcopy
, stdcopy
);
1433 /* Only copy _def_init to to_data, when it is not a NULL-pointer. */
1434 if (from
== NULL_TREE
)
1437 cond
= fold_build2_loc (input_location
, NE_EXPR
,
1439 from_data
, null_pointer_node
);
1440 tmp
= fold_build3_loc (input_location
, COND_EXPR
,
1441 void_type_node
, cond
,
1442 tmp
, build_empty_stmt (input_location
));
1450 gfc_trans_class_array_init_assign (gfc_expr
*rhs
, gfc_expr
*lhs
, gfc_expr
*obj
)
1452 gfc_actual_arglist
*actual
;
1457 actual
= gfc_get_actual_arglist ();
1458 actual
->expr
= gfc_copy_expr (rhs
);
1459 actual
->next
= gfc_get_actual_arglist ();
1460 actual
->next
->expr
= gfc_copy_expr (lhs
);
1461 ppc
= gfc_copy_expr (obj
);
1462 gfc_add_vptr_component (ppc
);
1463 gfc_add_component_ref (ppc
, "_copy");
1464 ppc_code
= gfc_get_code (EXEC_CALL
);
1465 ppc_code
->resolved_sym
= ppc
->symtree
->n
.sym
;
1466 /* Although '_copy' is set to be elemental in class.c, it is
1467 not staying that way. Find out why, sometime.... */
1468 ppc_code
->resolved_sym
->attr
.elemental
= 1;
1469 ppc_code
->ext
.actual
= actual
;
1470 ppc_code
->expr1
= ppc
;
1471 /* Since '_copy' is elemental, the scalarizer will take care
1472 of arrays in gfc_trans_call. */
1473 res
= gfc_trans_call (ppc_code
, false, NULL
, NULL
, false);
1474 gfc_free_statements (ppc_code
);
1476 if (UNLIMITED_POLY(obj
))
1478 /* Check if rhs is non-NULL. */
1480 gfc_init_se (&src
, NULL
);
1481 gfc_conv_expr (&src
, rhs
);
1482 src
.expr
= gfc_build_addr_expr (NULL_TREE
, src
.expr
);
1483 tree cond
= fold_build2_loc (input_location
, NE_EXPR
, logical_type_node
,
1484 src
.expr
, fold_convert (TREE_TYPE (src
.expr
),
1485 null_pointer_node
));
1486 res
= build3_loc (input_location
, COND_EXPR
, TREE_TYPE (res
), cond
, res
,
1487 build_empty_stmt (input_location
));
1493 /* Special case for initializing a polymorphic dummy with INTENT(OUT).
1494 A MEMCPY is needed to copy the full data from the default initializer
1495 of the dynamic type. */
1498 gfc_trans_class_init_assign (gfc_code
*code
)
1502 gfc_se dst
,src
,memsz
;
1503 gfc_expr
*lhs
, *rhs
, *sz
;
1505 gfc_start_block (&block
);
1507 lhs
= gfc_copy_expr (code
->expr1
);
1508 gfc_add_data_component (lhs
);
1510 rhs
= gfc_copy_expr (code
->expr1
);
1511 gfc_add_vptr_component (rhs
);
1513 /* Make sure that the component backend_decls have been built, which
1514 will not have happened if the derived types concerned have not
1516 gfc_get_derived_type (rhs
->ts
.u
.derived
);
1517 gfc_add_def_init_component (rhs
);
1518 /* The _def_init is always scalar. */
1521 if (code
->expr1
->ts
.type
== BT_CLASS
1522 && CLASS_DATA (code
->expr1
)->attr
.dimension
)
1524 gfc_array_spec
*tmparr
= gfc_get_array_spec ();
1525 *tmparr
= *CLASS_DATA (code
->expr1
)->as
;
1526 gfc_add_full_array_ref (lhs
, tmparr
);
1527 tmp
= gfc_trans_class_array_init_assign (rhs
, lhs
, code
->expr1
);
1531 sz
= gfc_copy_expr (code
->expr1
);
1532 gfc_add_vptr_component (sz
);
1533 gfc_add_size_component (sz
);
1535 gfc_init_se (&dst
, NULL
);
1536 gfc_init_se (&src
, NULL
);
1537 gfc_init_se (&memsz
, NULL
);
1538 gfc_conv_expr (&dst
, lhs
);
1539 gfc_conv_expr (&src
, rhs
);
1540 gfc_conv_expr (&memsz
, sz
);
1541 gfc_add_block_to_block (&block
, &src
.pre
);
1542 src
.expr
= gfc_build_addr_expr (NULL_TREE
, src
.expr
);
1544 tmp
= gfc_build_memcpy_call (dst
.expr
, src
.expr
, memsz
.expr
);
1546 if (UNLIMITED_POLY(code
->expr1
))
1548 /* Check if _def_init is non-NULL. */
1549 tree cond
= fold_build2_loc (input_location
, NE_EXPR
,
1550 logical_type_node
, src
.expr
,
1551 fold_convert (TREE_TYPE (src
.expr
),
1552 null_pointer_node
));
1553 tmp
= build3_loc (input_location
, COND_EXPR
, TREE_TYPE (tmp
), cond
,
1554 tmp
, build_empty_stmt (input_location
));
1558 if (code
->expr1
->symtree
->n
.sym
->attr
.optional
1559 || code
->expr1
->symtree
->n
.sym
->ns
->proc_name
->attr
.entry_master
)
1561 tree present
= gfc_conv_expr_present (code
->expr1
->symtree
->n
.sym
);
1562 tmp
= build3_loc (input_location
, COND_EXPR
, TREE_TYPE (tmp
),
1564 build_empty_stmt (input_location
));
1567 gfc_add_expr_to_block (&block
, tmp
);
1569 return gfc_finish_block (&block
);
1573 /* End of prototype trans-class.c */
1577 realloc_lhs_warning (bt type
, bool array
, locus
*where
)
1579 if (array
&& type
!= BT_CLASS
&& type
!= BT_DERIVED
&& warn_realloc_lhs
)
1580 gfc_warning (OPT_Wrealloc_lhs
,
1581 "Code for reallocating the allocatable array at %L will "
1583 else if (warn_realloc_lhs_all
)
1584 gfc_warning (OPT_Wrealloc_lhs_all
,
1585 "Code for reallocating the allocatable variable at %L "
1586 "will be added", where
);
1590 static void gfc_apply_interface_mapping_to_expr (gfc_interface_mapping
*,
1593 /* Copy the scalarization loop variables. */
1596 gfc_copy_se_loopvars (gfc_se
* dest
, gfc_se
* src
)
1599 dest
->loop
= src
->loop
;
1603 /* Initialize a simple expression holder.
1605 Care must be taken when multiple se are created with the same parent.
1606 The child se must be kept in sync. The easiest way is to delay creation
1607 of a child se until after after the previous se has been translated. */
1610 gfc_init_se (gfc_se
* se
, gfc_se
* parent
)
1612 memset (se
, 0, sizeof (gfc_se
));
1613 gfc_init_block (&se
->pre
);
1614 gfc_init_block (&se
->post
);
1616 se
->parent
= parent
;
1619 gfc_copy_se_loopvars (se
, parent
);
1623 /* Advances to the next SS in the chain. Use this rather than setting
1624 se->ss = se->ss->next because all the parents needs to be kept in sync.
1628 gfc_advance_se_ss_chain (gfc_se
* se
)
1633 gcc_assert (se
!= NULL
&& se
->ss
!= NULL
&& se
->ss
!= gfc_ss_terminator
);
1636 /* Walk down the parent chain. */
1639 /* Simple consistency check. */
1640 gcc_assert (p
->parent
== NULL
|| p
->parent
->ss
== p
->ss
1641 || p
->parent
->ss
->nested_ss
== p
->ss
);
1643 /* If we were in a nested loop, the next scalarized expression can be
1644 on the parent ss' next pointer. Thus we should not take the next
1645 pointer blindly, but rather go up one nest level as long as next
1646 is the end of chain. */
1648 while (ss
->next
== gfc_ss_terminator
&& ss
->parent
!= NULL
)
1658 /* Ensures the result of the expression as either a temporary variable
1659 or a constant so that it can be used repeatedly. */
1662 gfc_make_safe_expr (gfc_se
* se
)
1666 if (CONSTANT_CLASS_P (se
->expr
))
1669 /* We need a temporary for this result. */
1670 var
= gfc_create_var (TREE_TYPE (se
->expr
), NULL
);
1671 gfc_add_modify (&se
->pre
, var
, se
->expr
);
1676 /* Return an expression which determines if a dummy parameter is present.
1677 Also used for arguments to procedures with multiple entry points. */
1680 gfc_conv_expr_present (gfc_symbol
* sym
)
1684 gcc_assert (sym
->attr
.dummy
);
1685 decl
= gfc_get_symbol_decl (sym
);
1687 /* Intrinsic scalars with VALUE attribute which are passed by value
1688 use a hidden argument to denote the present status. */
1689 if (sym
->attr
.value
&& sym
->ts
.type
!= BT_CHARACTER
1690 && sym
->ts
.type
!= BT_CLASS
&& sym
->ts
.type
!= BT_DERIVED
1691 && !sym
->attr
.dimension
)
1693 char name
[GFC_MAX_SYMBOL_LEN
+ 2];
1696 gcc_assert (TREE_CODE (decl
) == PARM_DECL
);
1698 strcpy (&name
[1], sym
->name
);
1699 tree_name
= get_identifier (name
);
1701 /* Walk function argument list to find hidden arg. */
1702 cond
= DECL_ARGUMENTS (DECL_CONTEXT (decl
));
1703 for ( ; cond
!= NULL_TREE
; cond
= TREE_CHAIN (cond
))
1704 if (DECL_NAME (cond
) == tree_name
)
1711 if (TREE_CODE (decl
) != PARM_DECL
)
1713 /* Array parameters use a temporary descriptor, we want the real
1715 gcc_assert (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl
))
1716 || GFC_ARRAY_TYPE_P (TREE_TYPE (decl
)));
1717 decl
= GFC_DECL_SAVED_DESCRIPTOR (decl
);
1720 cond
= fold_build2_loc (input_location
, NE_EXPR
, logical_type_node
, decl
,
1721 fold_convert (TREE_TYPE (decl
), null_pointer_node
));
1723 /* Fortran 2008 allows to pass null pointers and non-associated pointers
1724 as actual argument to denote absent dummies. For array descriptors,
1725 we thus also need to check the array descriptor. For BT_CLASS, it
1726 can also occur for scalars and F2003 due to type->class wrapping and
1727 class->class wrapping. Note further that BT_CLASS always uses an
1728 array descriptor for arrays, also for explicit-shape/assumed-size. */
1730 if (!sym
->attr
.allocatable
1731 && ((sym
->ts
.type
!= BT_CLASS
&& !sym
->attr
.pointer
)
1732 || (sym
->ts
.type
== BT_CLASS
1733 && !CLASS_DATA (sym
)->attr
.allocatable
1734 && !CLASS_DATA (sym
)->attr
.class_pointer
))
1735 && ((gfc_option
.allow_std
& GFC_STD_F2008
) != 0
1736 || sym
->ts
.type
== BT_CLASS
))
1740 if ((sym
->as
&& (sym
->as
->type
== AS_ASSUMED_SHAPE
1741 || sym
->as
->type
== AS_ASSUMED_RANK
1742 || sym
->attr
.codimension
))
1743 || (sym
->ts
.type
== BT_CLASS
&& CLASS_DATA (sym
)->as
))
1745 tmp
= build_fold_indirect_ref_loc (input_location
, decl
);
1746 if (sym
->ts
.type
== BT_CLASS
)
1747 tmp
= gfc_class_data_get (tmp
);
1748 tmp
= gfc_conv_array_data (tmp
);
1750 else if (sym
->ts
.type
== BT_CLASS
)
1751 tmp
= gfc_class_data_get (decl
);
1755 if (tmp
!= NULL_TREE
)
1757 tmp
= fold_build2_loc (input_location
, NE_EXPR
, logical_type_node
, tmp
,
1758 fold_convert (TREE_TYPE (tmp
), null_pointer_node
));
1759 cond
= fold_build2_loc (input_location
, TRUTH_ANDIF_EXPR
,
1760 logical_type_node
, cond
, tmp
);
1768 /* Converts a missing, dummy argument into a null or zero. */
1771 gfc_conv_missing_dummy (gfc_se
* se
, gfc_expr
* arg
, gfc_typespec ts
, int kind
)
1776 present
= gfc_conv_expr_present (arg
->symtree
->n
.sym
);
1780 /* Create a temporary and convert it to the correct type. */
1781 tmp
= gfc_get_int_type (kind
);
1782 tmp
= fold_convert (tmp
, build_fold_indirect_ref_loc (input_location
,
1785 /* Test for a NULL value. */
1786 tmp
= build3_loc (input_location
, COND_EXPR
, TREE_TYPE (tmp
), present
,
1787 tmp
, fold_convert (TREE_TYPE (tmp
), integer_one_node
));
1788 tmp
= gfc_evaluate_now (tmp
, &se
->pre
);
1789 se
->expr
= gfc_build_addr_expr (NULL_TREE
, tmp
);
1793 tmp
= build3_loc (input_location
, COND_EXPR
, TREE_TYPE (se
->expr
),
1795 build_zero_cst (TREE_TYPE (se
->expr
)));
1796 tmp
= gfc_evaluate_now (tmp
, &se
->pre
);
1800 if (ts
.type
== BT_CHARACTER
)
1802 tmp
= build_int_cst (gfc_charlen_type_node
, 0);
1803 tmp
= fold_build3_loc (input_location
, COND_EXPR
, gfc_charlen_type_node
,
1804 present
, se
->string_length
, tmp
);
1805 tmp
= gfc_evaluate_now (tmp
, &se
->pre
);
1806 se
->string_length
= tmp
;
1812 /* Get the character length of an expression, looking through gfc_refs
1816 gfc_get_expr_charlen (gfc_expr
*e
)
1821 gcc_assert (e
->expr_type
== EXPR_VARIABLE
1822 && e
->ts
.type
== BT_CHARACTER
);
1824 length
= NULL
; /* To silence compiler warning. */
1826 if (is_subref_array (e
) && e
->ts
.u
.cl
->length
)
1829 gfc_init_se (&tmpse
, NULL
);
1830 gfc_conv_expr_type (&tmpse
, e
->ts
.u
.cl
->length
, gfc_charlen_type_node
);
1831 e
->ts
.u
.cl
->backend_decl
= tmpse
.expr
;
1835 /* First candidate: if the variable is of type CHARACTER, the
1836 expression's length could be the length of the character
1838 if (e
->symtree
->n
.sym
->ts
.type
== BT_CHARACTER
)
1839 length
= e
->symtree
->n
.sym
->ts
.u
.cl
->backend_decl
;
1841 /* Look through the reference chain for component references. */
1842 for (r
= e
->ref
; r
; r
= r
->next
)
1847 if (r
->u
.c
.component
->ts
.type
== BT_CHARACTER
)
1848 length
= r
->u
.c
.component
->ts
.u
.cl
->backend_decl
;
1856 /* We should never got substring references here. These will be
1857 broken down by the scalarizer. */
1863 gcc_assert (length
!= NULL
);
1868 /* Return for an expression the backend decl of the coarray. */
1871 gfc_get_tree_for_caf_expr (gfc_expr
*expr
)
1877 gcc_assert (expr
&& expr
->expr_type
== EXPR_VARIABLE
);
1879 /* Not-implemented diagnostic. */
1880 if (expr
->symtree
->n
.sym
->ts
.type
== BT_CLASS
1881 && UNLIMITED_POLY (expr
->symtree
->n
.sym
)
1882 && CLASS_DATA (expr
->symtree
->n
.sym
)->attr
.codimension
)
1883 gfc_error ("Sorry, coindexed access to an unlimited polymorphic object at "
1884 "%L is not supported", &expr
->where
);
1886 for (ref
= expr
->ref
; ref
; ref
= ref
->next
)
1887 if (ref
->type
== REF_COMPONENT
)
1889 if (ref
->u
.c
.component
->ts
.type
== BT_CLASS
1890 && UNLIMITED_POLY (ref
->u
.c
.component
)
1891 && CLASS_DATA (ref
->u
.c
.component
)->attr
.codimension
)
1892 gfc_error ("Sorry, coindexed access to an unlimited polymorphic "
1893 "component at %L is not supported", &expr
->where
);
1896 /* Make sure the backend_decl is present before accessing it. */
1897 caf_decl
= expr
->symtree
->n
.sym
->backend_decl
== NULL_TREE
1898 ? gfc_get_symbol_decl (expr
->symtree
->n
.sym
)
1899 : expr
->symtree
->n
.sym
->backend_decl
;
1901 if (expr
->symtree
->n
.sym
->ts
.type
== BT_CLASS
)
1903 if (expr
->ref
&& expr
->ref
->type
== REF_ARRAY
)
1905 caf_decl
= gfc_class_data_get (caf_decl
);
1906 if (CLASS_DATA (expr
->symtree
->n
.sym
)->attr
.codimension
)
1909 for (ref
= expr
->ref
; ref
; ref
= ref
->next
)
1911 if (ref
->type
== REF_COMPONENT
1912 && strcmp (ref
->u
.c
.component
->name
, "_data") != 0)
1914 caf_decl
= gfc_class_data_get (caf_decl
);
1915 if (CLASS_DATA (expr
->symtree
->n
.sym
)->attr
.codimension
)
1919 else if (ref
->type
== REF_ARRAY
&& ref
->u
.ar
.dimen
)
1923 if (expr
->symtree
->n
.sym
->attr
.codimension
)
1926 /* The following code assumes that the coarray is a component reachable via
1927 only scalar components/variables; the Fortran standard guarantees this. */
1929 for (ref
= expr
->ref
; ref
; ref
= ref
->next
)
1930 if (ref
->type
== REF_COMPONENT
)
1932 gfc_component
*comp
= ref
->u
.c
.component
;
1934 if (POINTER_TYPE_P (TREE_TYPE (caf_decl
)))
1935 caf_decl
= build_fold_indirect_ref_loc (input_location
, caf_decl
);
1936 caf_decl
= fold_build3_loc (input_location
, COMPONENT_REF
,
1937 TREE_TYPE (comp
->backend_decl
), caf_decl
,
1938 comp
->backend_decl
, NULL_TREE
);
1939 if (comp
->ts
.type
== BT_CLASS
)
1941 caf_decl
= gfc_class_data_get (caf_decl
);
1942 if (CLASS_DATA (comp
)->attr
.codimension
)
1948 if (comp
->attr
.codimension
)
1954 gcc_assert (found
&& caf_decl
);
1959 /* Obtain the Coarray token - and optionally also the offset. */
1962 gfc_get_caf_token_offset (gfc_se
*se
, tree
*token
, tree
*offset
, tree caf_decl
,
1963 tree se_expr
, gfc_expr
*expr
)
1967 /* Coarray token. */
1968 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (caf_decl
)))
1970 gcc_assert (GFC_TYPE_ARRAY_AKIND (TREE_TYPE (caf_decl
))
1971 == GFC_ARRAY_ALLOCATABLE
1972 || expr
->symtree
->n
.sym
->attr
.select_type_temporary
);
1973 *token
= gfc_conv_descriptor_token (caf_decl
);
1975 else if (DECL_LANG_SPECIFIC (caf_decl
)
1976 && GFC_DECL_TOKEN (caf_decl
) != NULL_TREE
)
1977 *token
= GFC_DECL_TOKEN (caf_decl
);
1980 gcc_assert (GFC_ARRAY_TYPE_P (TREE_TYPE (caf_decl
))
1981 && GFC_TYPE_ARRAY_CAF_TOKEN (TREE_TYPE (caf_decl
)) != NULL_TREE
);
1982 *token
= GFC_TYPE_ARRAY_CAF_TOKEN (TREE_TYPE (caf_decl
));
1988 /* Offset between the coarray base address and the address wanted. */
1989 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (caf_decl
))
1990 && (GFC_TYPE_ARRAY_AKIND (TREE_TYPE (caf_decl
)) == GFC_ARRAY_ALLOCATABLE
1991 || GFC_TYPE_ARRAY_AKIND (TREE_TYPE (caf_decl
)) == GFC_ARRAY_POINTER
))
1992 *offset
= build_int_cst (gfc_array_index_type
, 0);
1993 else if (DECL_LANG_SPECIFIC (caf_decl
)
1994 && GFC_DECL_CAF_OFFSET (caf_decl
) != NULL_TREE
)
1995 *offset
= GFC_DECL_CAF_OFFSET (caf_decl
);
1996 else if (GFC_TYPE_ARRAY_CAF_OFFSET (TREE_TYPE (caf_decl
)) != NULL_TREE
)
1997 *offset
= GFC_TYPE_ARRAY_CAF_OFFSET (TREE_TYPE (caf_decl
));
1999 *offset
= build_int_cst (gfc_array_index_type
, 0);
2001 if (POINTER_TYPE_P (TREE_TYPE (se_expr
))
2002 && GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (TREE_TYPE (se_expr
))))
2004 tmp
= build_fold_indirect_ref_loc (input_location
, se_expr
);
2005 tmp
= gfc_conv_descriptor_data_get (tmp
);
2007 else if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (se_expr
)))
2008 tmp
= gfc_conv_descriptor_data_get (se_expr
);
2011 gcc_assert (POINTER_TYPE_P (TREE_TYPE (se_expr
)));
2015 *offset
= fold_build2_loc (input_location
, PLUS_EXPR
, gfc_array_index_type
,
2016 *offset
, fold_convert (gfc_array_index_type
, tmp
));
2018 if (expr
->symtree
->n
.sym
->ts
.type
== BT_DERIVED
2019 && expr
->symtree
->n
.sym
->attr
.codimension
2020 && expr
->symtree
->n
.sym
->ts
.u
.derived
->attr
.alloc_comp
)
2022 gfc_expr
*base_expr
= gfc_copy_expr (expr
);
2023 gfc_ref
*ref
= base_expr
->ref
;
2026 // Iterate through the refs until the last one.
2030 if (ref
->type
== REF_ARRAY
2031 && ref
->u
.ar
.type
!= AR_FULL
)
2033 const int ranksum
= ref
->u
.ar
.dimen
+ ref
->u
.ar
.codimen
;
2035 for (i
= 0; i
< ranksum
; ++i
)
2037 ref
->u
.ar
.start
[i
] = NULL
;
2038 ref
->u
.ar
.end
[i
] = NULL
;
2040 ref
->u
.ar
.type
= AR_FULL
;
2042 gfc_init_se (&base_se
, NULL
);
2043 if (gfc_caf_attr (base_expr
).dimension
)
2045 gfc_conv_expr_descriptor (&base_se
, base_expr
);
2046 tmp
= gfc_conv_descriptor_data_get (base_se
.expr
);
2050 gfc_conv_expr (&base_se
, base_expr
);
2054 gfc_free_expr (base_expr
);
2055 gfc_add_block_to_block (&se
->pre
, &base_se
.pre
);
2056 gfc_add_block_to_block (&se
->post
, &base_se
.post
);
2058 else if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (caf_decl
)))
2059 tmp
= gfc_conv_descriptor_data_get (caf_decl
);
2062 gcc_assert (POINTER_TYPE_P (TREE_TYPE (caf_decl
)));
2066 *offset
= fold_build2_loc (input_location
, MINUS_EXPR
, gfc_array_index_type
,
2067 fold_convert (gfc_array_index_type
, *offset
),
2068 fold_convert (gfc_array_index_type
, tmp
));
2072 /* Convert the coindex of a coarray into an image index; the result is
2073 image_num = (idx(1)-lcobound(1)+1) + (idx(2)-lcobound(2))*extent(1)
2074 + (idx(3)-lcobound(3))*extend(1)*extent(2) + ... */
2077 gfc_caf_get_image_index (stmtblock_t
*block
, gfc_expr
*e
, tree desc
)
2080 tree lbound
, ubound
, extent
, tmp
, img_idx
;
2084 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
2085 if (ref
->type
== REF_ARRAY
&& ref
->u
.ar
.codimen
> 0)
2087 gcc_assert (ref
!= NULL
);
2089 if (ref
->u
.ar
.dimen_type
[ref
->u
.ar
.dimen
] == DIMEN_THIS_IMAGE
)
2091 return build_call_expr_loc (input_location
, gfor_fndecl_caf_this_image
, 1,
2095 img_idx
= integer_zero_node
;
2096 extent
= integer_one_node
;
2097 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (desc
)))
2098 for (i
= ref
->u
.ar
.dimen
; i
< ref
->u
.ar
.dimen
+ ref
->u
.ar
.codimen
; i
++)
2100 gfc_init_se (&se
, NULL
);
2101 gfc_conv_expr_type (&se
, ref
->u
.ar
.start
[i
], integer_type_node
);
2102 gfc_add_block_to_block (block
, &se
.pre
);
2103 lbound
= gfc_conv_descriptor_lbound_get (desc
, gfc_rank_cst
[i
]);
2104 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
2105 integer_type_node
, se
.expr
,
2106 fold_convert(integer_type_node
, lbound
));
2107 tmp
= fold_build2_loc (input_location
, MULT_EXPR
, integer_type_node
,
2109 img_idx
= fold_build2_loc (input_location
, PLUS_EXPR
, integer_type_node
,
2111 if (i
< ref
->u
.ar
.dimen
+ ref
->u
.ar
.codimen
- 1)
2113 ubound
= gfc_conv_descriptor_ubound_get (desc
, gfc_rank_cst
[i
]);
2114 tmp
= gfc_conv_array_extent_dim (lbound
, ubound
, NULL
);
2115 tmp
= fold_convert (integer_type_node
, tmp
);
2116 extent
= fold_build2_loc (input_location
, MULT_EXPR
,
2117 integer_type_node
, extent
, tmp
);
2121 for (i
= ref
->u
.ar
.dimen
; i
< ref
->u
.ar
.dimen
+ ref
->u
.ar
.codimen
; i
++)
2123 gfc_init_se (&se
, NULL
);
2124 gfc_conv_expr_type (&se
, ref
->u
.ar
.start
[i
], integer_type_node
);
2125 gfc_add_block_to_block (block
, &se
.pre
);
2126 lbound
= GFC_TYPE_ARRAY_LBOUND (TREE_TYPE (desc
), i
);
2127 lbound
= fold_convert (integer_type_node
, lbound
);
2128 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
2129 integer_type_node
, se
.expr
, lbound
);
2130 tmp
= fold_build2_loc (input_location
, MULT_EXPR
, integer_type_node
,
2132 img_idx
= fold_build2_loc (input_location
, PLUS_EXPR
, integer_type_node
,
2134 if (i
< ref
->u
.ar
.dimen
+ ref
->u
.ar
.codimen
- 1)
2136 ubound
= GFC_TYPE_ARRAY_UBOUND (TREE_TYPE (desc
), i
);
2137 ubound
= fold_convert (integer_type_node
, ubound
);
2138 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
2139 integer_type_node
, ubound
, lbound
);
2140 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
, integer_type_node
,
2141 tmp
, integer_one_node
);
2142 extent
= fold_build2_loc (input_location
, MULT_EXPR
,
2143 integer_type_node
, extent
, tmp
);
2146 img_idx
= fold_build2_loc (input_location
, PLUS_EXPR
, integer_type_node
,
2147 img_idx
, integer_one_node
);
2152 /* For each character array constructor subexpression without a ts.u.cl->length,
2153 replace it by its first element (if there aren't any elements, the length
2154 should already be set to zero). */
2157 flatten_array_ctors_without_strlen (gfc_expr
* e
)
2159 gfc_actual_arglist
* arg
;
2165 switch (e
->expr_type
)
2169 flatten_array_ctors_without_strlen (e
->value
.op
.op1
);
2170 flatten_array_ctors_without_strlen (e
->value
.op
.op2
);
2174 /* TODO: Implement as with EXPR_FUNCTION when needed. */
2178 for (arg
= e
->value
.function
.actual
; arg
; arg
= arg
->next
)
2179 flatten_array_ctors_without_strlen (arg
->expr
);
2184 /* We've found what we're looking for. */
2185 if (e
->ts
.type
== BT_CHARACTER
&& !e
->ts
.u
.cl
->length
)
2190 gcc_assert (e
->value
.constructor
);
2192 c
= gfc_constructor_first (e
->value
.constructor
);
2196 flatten_array_ctors_without_strlen (new_expr
);
2197 gfc_replace_expr (e
, new_expr
);
2201 /* Otherwise, fall through to handle constructor elements. */
2203 case EXPR_STRUCTURE
:
2204 for (c
= gfc_constructor_first (e
->value
.constructor
);
2205 c
; c
= gfc_constructor_next (c
))
2206 flatten_array_ctors_without_strlen (c
->expr
);
2216 /* Generate code to initialize a string length variable. Returns the
2217 value. For array constructors, cl->length might be NULL and in this case,
2218 the first element of the constructor is needed. expr is the original
2219 expression so we can access it but can be NULL if this is not needed. */
2222 gfc_conv_string_length (gfc_charlen
* cl
, gfc_expr
* expr
, stmtblock_t
* pblock
)
2226 gfc_init_se (&se
, NULL
);
2228 if (!cl
->length
&& cl
->backend_decl
&& VAR_P (cl
->backend_decl
))
2231 /* If cl->length is NULL, use gfc_conv_expr to obtain the string length but
2232 "flatten" array constructors by taking their first element; all elements
2233 should be the same length or a cl->length should be present. */
2236 gfc_expr
* expr_flat
;
2238 expr_flat
= gfc_copy_expr (expr
);
2239 flatten_array_ctors_without_strlen (expr_flat
);
2240 gfc_resolve_expr (expr_flat
);
2242 gfc_conv_expr (&se
, expr_flat
);
2243 gfc_add_block_to_block (pblock
, &se
.pre
);
2244 cl
->backend_decl
= convert (gfc_charlen_type_node
, se
.string_length
);
2246 gfc_free_expr (expr_flat
);
2250 /* Convert cl->length. */
2252 gcc_assert (cl
->length
);
2254 gfc_conv_expr_type (&se
, cl
->length
, gfc_charlen_type_node
);
2255 se
.expr
= fold_build2_loc (input_location
, MAX_EXPR
, gfc_charlen_type_node
,
2256 se
.expr
, build_zero_cst (TREE_TYPE (se
.expr
)));
2257 gfc_add_block_to_block (pblock
, &se
.pre
);
2259 if (cl
->backend_decl
)
2260 gfc_add_modify (pblock
, cl
->backend_decl
, se
.expr
);
2262 cl
->backend_decl
= gfc_evaluate_now (se
.expr
, pblock
);
2267 gfc_conv_substring (gfc_se
* se
, gfc_ref
* ref
, int kind
,
2268 const char *name
, locus
*where
)
2278 type
= gfc_get_character_type (kind
, ref
->u
.ss
.length
);
2279 type
= build_pointer_type (type
);
2281 gfc_init_se (&start
, se
);
2282 gfc_conv_expr_type (&start
, ref
->u
.ss
.start
, gfc_charlen_type_node
);
2283 gfc_add_block_to_block (&se
->pre
, &start
.pre
);
2285 if (integer_onep (start
.expr
))
2286 gfc_conv_string_parameter (se
);
2291 /* Avoid multiple evaluation of substring start. */
2292 if (!CONSTANT_CLASS_P (tmp
) && !DECL_P (tmp
))
2293 start
.expr
= gfc_evaluate_now (start
.expr
, &se
->pre
);
2295 /* Change the start of the string. */
2296 if (TYPE_STRING_FLAG (TREE_TYPE (se
->expr
)))
2299 tmp
= build_fold_indirect_ref_loc (input_location
,
2301 tmp
= gfc_build_array_ref (tmp
, start
.expr
, NULL
);
2302 se
->expr
= gfc_build_addr_expr (type
, tmp
);
2305 /* Length = end + 1 - start. */
2306 gfc_init_se (&end
, se
);
2307 if (ref
->u
.ss
.end
== NULL
)
2308 end
.expr
= se
->string_length
;
2311 gfc_conv_expr_type (&end
, ref
->u
.ss
.end
, gfc_charlen_type_node
);
2312 gfc_add_block_to_block (&se
->pre
, &end
.pre
);
2316 if (!CONSTANT_CLASS_P (tmp
) && !DECL_P (tmp
))
2317 end
.expr
= gfc_evaluate_now (end
.expr
, &se
->pre
);
2319 if (gfc_option
.rtcheck
& GFC_RTCHECK_BOUNDS
)
2321 tree nonempty
= fold_build2_loc (input_location
, LE_EXPR
,
2322 logical_type_node
, start
.expr
,
2325 /* Check lower bound. */
2326 fault
= fold_build2_loc (input_location
, LT_EXPR
, logical_type_node
,
2328 build_one_cst (TREE_TYPE (start
.expr
)));
2329 fault
= fold_build2_loc (input_location
, TRUTH_ANDIF_EXPR
,
2330 logical_type_node
, nonempty
, fault
);
2332 msg
= xasprintf ("Substring out of bounds: lower bound (%%ld) of '%s' "
2333 "is less than one", name
);
2335 msg
= xasprintf ("Substring out of bounds: lower bound (%%ld) "
2336 "is less than one");
2337 gfc_trans_runtime_check (true, false, fault
, &se
->pre
, where
, msg
,
2338 fold_convert (long_integer_type_node
,
2342 /* Check upper bound. */
2343 fault
= fold_build2_loc (input_location
, GT_EXPR
, logical_type_node
,
2344 end
.expr
, se
->string_length
);
2345 fault
= fold_build2_loc (input_location
, TRUTH_ANDIF_EXPR
,
2346 logical_type_node
, nonempty
, fault
);
2348 msg
= xasprintf ("Substring out of bounds: upper bound (%%ld) of '%s' "
2349 "exceeds string length (%%ld)", name
);
2351 msg
= xasprintf ("Substring out of bounds: upper bound (%%ld) "
2352 "exceeds string length (%%ld)");
2353 gfc_trans_runtime_check (true, false, fault
, &se
->pre
, where
, msg
,
2354 fold_convert (long_integer_type_node
, end
.expr
),
2355 fold_convert (long_integer_type_node
,
2356 se
->string_length
));
2360 /* Try to calculate the length from the start and end expressions. */
2362 && gfc_dep_difference (ref
->u
.ss
.end
, ref
->u
.ss
.start
, &length
))
2364 HOST_WIDE_INT i_len
;
2366 i_len
= gfc_mpz_get_hwi (length
) + 1;
2370 tmp
= build_int_cst (gfc_charlen_type_node
, i_len
);
2371 mpz_clear (length
); /* Was initialized by gfc_dep_difference. */
2375 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, gfc_charlen_type_node
,
2376 fold_convert (gfc_charlen_type_node
, end
.expr
),
2377 fold_convert (gfc_charlen_type_node
, start
.expr
));
2378 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
, gfc_charlen_type_node
,
2379 build_int_cst (gfc_charlen_type_node
, 1), tmp
);
2380 tmp
= fold_build2_loc (input_location
, MAX_EXPR
, gfc_charlen_type_node
,
2381 tmp
, build_int_cst (gfc_charlen_type_node
, 0));
2384 se
->string_length
= tmp
;
2388 /* Convert a derived type component reference. */
2391 gfc_conv_component_ref (gfc_se
* se
, gfc_ref
* ref
)
2399 c
= ref
->u
.c
.component
;
2401 if (c
->backend_decl
== NULL_TREE
2402 && ref
->u
.c
.sym
!= NULL
)
2403 gfc_get_derived_type (ref
->u
.c
.sym
);
2405 field
= c
->backend_decl
;
2406 gcc_assert (field
&& TREE_CODE (field
) == FIELD_DECL
);
2408 context
= DECL_FIELD_CONTEXT (field
);
2410 /* Components can correspond to fields of different containing
2411 types, as components are created without context, whereas
2412 a concrete use of a component has the type of decl as context.
2413 So, if the type doesn't match, we search the corresponding
2414 FIELD_DECL in the parent type. To not waste too much time
2415 we cache this result in norestrict_decl.
2416 On the other hand, if the context is a UNION or a MAP (a
2417 RECORD_TYPE within a UNION_TYPE) always use the given FIELD_DECL. */
2419 if (context
!= TREE_TYPE (decl
)
2420 && !( TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
/* Field is union */
2421 || TREE_CODE (context
) == UNION_TYPE
)) /* Field is map */
2423 tree f2
= c
->norestrict_decl
;
2424 if (!f2
|| DECL_FIELD_CONTEXT (f2
) != TREE_TYPE (decl
))
2425 for (f2
= TYPE_FIELDS (TREE_TYPE (decl
)); f2
; f2
= DECL_CHAIN (f2
))
2426 if (TREE_CODE (f2
) == FIELD_DECL
2427 && DECL_NAME (f2
) == DECL_NAME (field
))
2430 c
->norestrict_decl
= f2
;
2434 if (ref
->u
.c
.sym
&& ref
->u
.c
.sym
->ts
.type
== BT_CLASS
2435 && strcmp ("_data", c
->name
) == 0)
2437 /* Found a ref to the _data component. Store the associated ref to
2438 the vptr in se->class_vptr. */
2439 se
->class_vptr
= gfc_class_vptr_get (decl
);
2442 se
->class_vptr
= NULL_TREE
;
2444 tmp
= fold_build3_loc (input_location
, COMPONENT_REF
, TREE_TYPE (field
),
2445 decl
, field
, NULL_TREE
);
2449 /* Allocatable deferred char arrays are to be handled by the gfc_deferred_
2450 strlen () conditional below. */
2451 if (c
->ts
.type
== BT_CHARACTER
&& !c
->attr
.proc_pointer
2452 && !(c
->attr
.allocatable
&& c
->ts
.deferred
)
2453 && !c
->attr
.pdt_string
)
2455 tmp
= c
->ts
.u
.cl
->backend_decl
;
2456 /* Components must always be constant length. */
2457 gcc_assert (tmp
&& INTEGER_CST_P (tmp
));
2458 se
->string_length
= tmp
;
2461 if (gfc_deferred_strlen (c
, &field
))
2463 tmp
= fold_build3_loc (input_location
, COMPONENT_REF
,
2465 decl
, field
, NULL_TREE
);
2466 se
->string_length
= tmp
;
2469 if (((c
->attr
.pointer
|| c
->attr
.allocatable
)
2470 && (!c
->attr
.dimension
&& !c
->attr
.codimension
)
2471 && c
->ts
.type
!= BT_CHARACTER
)
2472 || c
->attr
.proc_pointer
)
2473 se
->expr
= build_fold_indirect_ref_loc (input_location
,
2478 /* This function deals with component references to components of the
2479 parent type for derived type extensions. */
2481 conv_parent_component_references (gfc_se
* se
, gfc_ref
* ref
)
2489 c
= ref
->u
.c
.component
;
2491 /* Return if the component is in the parent type. */
2492 for (cmp
= dt
->components
; cmp
; cmp
= cmp
->next
)
2493 if (strcmp (c
->name
, cmp
->name
) == 0)
2496 /* Build a gfc_ref to recursively call gfc_conv_component_ref. */
2497 parent
.type
= REF_COMPONENT
;
2499 parent
.u
.c
.sym
= dt
;
2500 parent
.u
.c
.component
= dt
->components
;
2502 if (dt
->backend_decl
== NULL
)
2503 gfc_get_derived_type (dt
);
2505 /* Build the reference and call self. */
2506 gfc_conv_component_ref (se
, &parent
);
2507 parent
.u
.c
.sym
= dt
->components
->ts
.u
.derived
;
2508 parent
.u
.c
.component
= c
;
2509 conv_parent_component_references (se
, &parent
);
2512 /* Return the contents of a variable. Also handles reference/pointer
2513 variables (all Fortran pointer references are implicit). */
2516 gfc_conv_variable (gfc_se
* se
, gfc_expr
* expr
)
2521 tree parent_decl
= NULL_TREE
;
2524 bool alternate_entry
;
2527 bool first_time
= true;
2529 sym
= expr
->symtree
->n
.sym
;
2530 is_classarray
= IS_CLASS_ARRAY (sym
);
2534 gfc_ss_info
*ss_info
= ss
->info
;
2536 /* Check that something hasn't gone horribly wrong. */
2537 gcc_assert (ss
!= gfc_ss_terminator
);
2538 gcc_assert (ss_info
->expr
== expr
);
2540 /* A scalarized term. We already know the descriptor. */
2541 se
->expr
= ss_info
->data
.array
.descriptor
;
2542 se
->string_length
= ss_info
->string_length
;
2543 ref
= ss_info
->data
.array
.ref
;
2545 gcc_assert (ref
->type
== REF_ARRAY
2546 && ref
->u
.ar
.type
!= AR_ELEMENT
);
2548 gfc_conv_tmp_array_ref (se
);
2552 tree se_expr
= NULL_TREE
;
2554 se
->expr
= gfc_get_symbol_decl (sym
);
2556 /* Deal with references to a parent results or entries by storing
2557 the current_function_decl and moving to the parent_decl. */
2558 return_value
= sym
->attr
.function
&& sym
->result
== sym
;
2559 alternate_entry
= sym
->attr
.function
&& sym
->attr
.entry
2560 && sym
->result
== sym
;
2561 entry_master
= sym
->attr
.result
2562 && sym
->ns
->proc_name
->attr
.entry_master
2563 && !gfc_return_by_reference (sym
->ns
->proc_name
);
2564 if (current_function_decl
)
2565 parent_decl
= DECL_CONTEXT (current_function_decl
);
2567 if ((se
->expr
== parent_decl
&& return_value
)
2568 || (sym
->ns
&& sym
->ns
->proc_name
2570 && sym
->ns
->proc_name
->backend_decl
== parent_decl
2571 && (alternate_entry
|| entry_master
)))
2576 /* Special case for assigning the return value of a function.
2577 Self recursive functions must have an explicit return value. */
2578 if (return_value
&& (se
->expr
== current_function_decl
|| parent_flag
))
2579 se_expr
= gfc_get_fake_result_decl (sym
, parent_flag
);
2581 /* Similarly for alternate entry points. */
2582 else if (alternate_entry
2583 && (sym
->ns
->proc_name
->backend_decl
== current_function_decl
2586 gfc_entry_list
*el
= NULL
;
2588 for (el
= sym
->ns
->entries
; el
; el
= el
->next
)
2591 se_expr
= gfc_get_fake_result_decl (sym
, parent_flag
);
2596 else if (entry_master
2597 && (sym
->ns
->proc_name
->backend_decl
== current_function_decl
2599 se_expr
= gfc_get_fake_result_decl (sym
, parent_flag
);
2604 /* Procedure actual arguments. Look out for temporary variables
2605 with the same attributes as function values. */
2606 else if (!sym
->attr
.temporary
2607 && sym
->attr
.flavor
== FL_PROCEDURE
2608 && se
->expr
!= current_function_decl
)
2610 if (!sym
->attr
.dummy
&& !sym
->attr
.proc_pointer
)
2612 gcc_assert (TREE_CODE (se
->expr
) == FUNCTION_DECL
);
2613 se
->expr
= gfc_build_addr_expr (NULL_TREE
, se
->expr
);
2619 /* Dereference the expression, where needed. Since characters
2620 are entirely different from other types, they are treated
2622 if (sym
->ts
.type
== BT_CHARACTER
)
2624 /* Dereference character pointer dummy arguments
2626 if ((sym
->attr
.pointer
|| sym
->attr
.allocatable
)
2628 || sym
->attr
.function
2629 || sym
->attr
.result
))
2630 se
->expr
= build_fold_indirect_ref_loc (input_location
,
2634 else if (!sym
->attr
.value
)
2636 /* Dereference temporaries for class array dummy arguments. */
2637 if (sym
->attr
.dummy
&& is_classarray
2638 && GFC_ARRAY_TYPE_P (TREE_TYPE (se
->expr
)))
2640 if (!se
->descriptor_only
)
2641 se
->expr
= GFC_DECL_SAVED_DESCRIPTOR (se
->expr
);
2643 se
->expr
= build_fold_indirect_ref_loc (input_location
,
2647 /* Dereference non-character scalar dummy arguments. */
2648 if (sym
->attr
.dummy
&& !sym
->attr
.dimension
2649 && !(sym
->attr
.codimension
&& sym
->attr
.allocatable
)
2650 && (sym
->ts
.type
!= BT_CLASS
2651 || (!CLASS_DATA (sym
)->attr
.dimension
2652 && !(CLASS_DATA (sym
)->attr
.codimension
2653 && CLASS_DATA (sym
)->attr
.allocatable
))))
2654 se
->expr
= build_fold_indirect_ref_loc (input_location
,
2657 /* Dereference scalar hidden result. */
2658 if (flag_f2c
&& sym
->ts
.type
== BT_COMPLEX
2659 && (sym
->attr
.function
|| sym
->attr
.result
)
2660 && !sym
->attr
.dimension
&& !sym
->attr
.pointer
2661 && !sym
->attr
.always_explicit
)
2662 se
->expr
= build_fold_indirect_ref_loc (input_location
,
2665 /* Dereference non-character, non-class pointer variables.
2666 These must be dummies, results, or scalars. */
2668 && (sym
->attr
.pointer
|| sym
->attr
.allocatable
2669 || gfc_is_associate_pointer (sym
)
2670 || (sym
->as
&& sym
->as
->type
== AS_ASSUMED_RANK
))
2672 || sym
->attr
.function
2674 || (!sym
->attr
.dimension
2675 && (!sym
->attr
.codimension
|| !sym
->attr
.allocatable
))))
2676 se
->expr
= build_fold_indirect_ref_loc (input_location
,
2678 /* Now treat the class array pointer variables accordingly. */
2679 else if (sym
->ts
.type
== BT_CLASS
2681 && (CLASS_DATA (sym
)->attr
.dimension
2682 || CLASS_DATA (sym
)->attr
.codimension
)
2683 && ((CLASS_DATA (sym
)->as
2684 && CLASS_DATA (sym
)->as
->type
== AS_ASSUMED_RANK
)
2685 || CLASS_DATA (sym
)->attr
.allocatable
2686 || CLASS_DATA (sym
)->attr
.class_pointer
))
2687 se
->expr
= build_fold_indirect_ref_loc (input_location
,
2689 /* And the case where a non-dummy, non-result, non-function,
2690 non-allotable and non-pointer classarray is present. This case was
2691 previously covered by the first if, but with introducing the
2692 condition !is_classarray there, that case has to be covered
2694 else if (sym
->ts
.type
== BT_CLASS
2696 && !sym
->attr
.function
2697 && !sym
->attr
.result
2698 && (CLASS_DATA (sym
)->attr
.dimension
2699 || CLASS_DATA (sym
)->attr
.codimension
)
2701 || !CLASS_DATA (sym
)->attr
.allocatable
)
2702 && !CLASS_DATA (sym
)->attr
.class_pointer
)
2703 se
->expr
= build_fold_indirect_ref_loc (input_location
,
2710 /* For character variables, also get the length. */
2711 if (sym
->ts
.type
== BT_CHARACTER
)
2713 /* If the character length of an entry isn't set, get the length from
2714 the master function instead. */
2715 if (sym
->attr
.entry
&& !sym
->ts
.u
.cl
->backend_decl
)
2716 se
->string_length
= sym
->ns
->proc_name
->ts
.u
.cl
->backend_decl
;
2718 se
->string_length
= sym
->ts
.u
.cl
->backend_decl
;
2719 gcc_assert (se
->string_length
);
2727 /* Return the descriptor if that's what we want and this is an array
2728 section reference. */
2729 if (se
->descriptor_only
&& ref
->u
.ar
.type
!= AR_ELEMENT
)
2731 /* TODO: Pointers to single elements of array sections, eg elemental subs. */
2732 /* Return the descriptor for array pointers and allocations. */
2733 if (se
->want_pointer
2734 && ref
->next
== NULL
&& (se
->descriptor_only
))
2737 gfc_conv_array_ref (se
, &ref
->u
.ar
, expr
, &expr
->where
);
2738 /* Return a pointer to an element. */
2742 if (first_time
&& is_classarray
&& sym
->attr
.dummy
2743 && se
->descriptor_only
2744 && !CLASS_DATA (sym
)->attr
.allocatable
2745 && !CLASS_DATA (sym
)->attr
.class_pointer
2746 && CLASS_DATA (sym
)->as
2747 && CLASS_DATA (sym
)->as
->type
!= AS_ASSUMED_RANK
2748 && strcmp ("_data", ref
->u
.c
.component
->name
) == 0)
2749 /* Skip the first ref of a _data component, because for class
2750 arrays that one is already done by introducing a temporary
2751 array descriptor. */
2754 if (ref
->u
.c
.sym
->attr
.extension
)
2755 conv_parent_component_references (se
, ref
);
2757 gfc_conv_component_ref (se
, ref
);
2758 if (!ref
->next
&& ref
->u
.c
.sym
->attr
.codimension
2759 && se
->want_pointer
&& se
->descriptor_only
)
2765 gfc_conv_substring (se
, ref
, expr
->ts
.kind
,
2766 expr
->symtree
->name
, &expr
->where
);
2776 /* Pointer assignment, allocation or pass by reference. Arrays are handled
2778 if (se
->want_pointer
)
2780 if (expr
->ts
.type
== BT_CHARACTER
&& !gfc_is_proc_ptr_comp (expr
))
2781 gfc_conv_string_parameter (se
);
2783 se
->expr
= gfc_build_addr_expr (NULL_TREE
, se
->expr
);
2788 /* Unary ops are easy... Or they would be if ! was a valid op. */
2791 gfc_conv_unary_op (enum tree_code code
, gfc_se
* se
, gfc_expr
* expr
)
2796 gcc_assert (expr
->ts
.type
!= BT_CHARACTER
);
2797 /* Initialize the operand. */
2798 gfc_init_se (&operand
, se
);
2799 gfc_conv_expr_val (&operand
, expr
->value
.op
.op1
);
2800 gfc_add_block_to_block (&se
->pre
, &operand
.pre
);
2802 type
= gfc_typenode_for_spec (&expr
->ts
);
2804 /* TRUTH_NOT_EXPR is not a "true" unary operator in GCC.
2805 We must convert it to a compare to 0 (e.g. EQ_EXPR (op1, 0)).
2806 All other unary operators have an equivalent GIMPLE unary operator. */
2807 if (code
== TRUTH_NOT_EXPR
)
2808 se
->expr
= fold_build2_loc (input_location
, EQ_EXPR
, type
, operand
.expr
,
2809 build_int_cst (type
, 0));
2811 se
->expr
= fold_build1_loc (input_location
, code
, type
, operand
.expr
);
2815 /* Expand power operator to optimal multiplications when a value is raised
2816 to a constant integer n. See section 4.6.3, "Evaluation of Powers" of
2817 Donald E. Knuth, "Seminumerical Algorithms", Vol. 2, "The Art of Computer
2818 Programming", 3rd Edition, 1998. */
2820 /* This code is mostly duplicated from expand_powi in the backend.
2821 We establish the "optimal power tree" lookup table with the defined size.
2822 The items in the table are the exponents used to calculate the index
2823 exponents. Any integer n less than the value can get an "addition chain",
2824 with the first node being one. */
2825 #define POWI_TABLE_SIZE 256
2827 /* The table is from builtins.c. */
2828 static const unsigned char powi_table
[POWI_TABLE_SIZE
] =
2830 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
2831 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
2832 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
2833 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
2834 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
2835 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
2836 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
2837 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
2838 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
2839 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
2840 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
2841 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
2842 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
2843 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
2844 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
2845 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
2846 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
2847 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
2848 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
2849 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
2850 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
2851 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
2852 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
2853 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
2854 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
2855 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
2856 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
2857 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
2858 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
2859 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
2860 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
2861 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
2864 /* If n is larger than lookup table's max index, we use the "window
2866 #define POWI_WINDOW_SIZE 3
2868 /* Recursive function to expand the power operator. The temporary
2869 values are put in tmpvar. The function returns tmpvar[1] ** n. */
2871 gfc_conv_powi (gfc_se
* se
, unsigned HOST_WIDE_INT n
, tree
* tmpvar
)
2878 if (n
< POWI_TABLE_SIZE
)
2883 op0
= gfc_conv_powi (se
, n
- powi_table
[n
], tmpvar
);
2884 op1
= gfc_conv_powi (se
, powi_table
[n
], tmpvar
);
2888 digit
= n
& ((1 << POWI_WINDOW_SIZE
) - 1);
2889 op0
= gfc_conv_powi (se
, n
- digit
, tmpvar
);
2890 op1
= gfc_conv_powi (se
, digit
, tmpvar
);
2894 op0
= gfc_conv_powi (se
, n
>> 1, tmpvar
);
2898 tmp
= fold_build2_loc (input_location
, MULT_EXPR
, TREE_TYPE (op0
), op0
, op1
);
2899 tmp
= gfc_evaluate_now (tmp
, &se
->pre
);
2901 if (n
< POWI_TABLE_SIZE
)
2908 /* Expand lhs ** rhs. rhs is a constant integer. If it expands successfully,
2909 return 1. Else return 0 and a call to runtime library functions
2910 will have to be built. */
2912 gfc_conv_cst_int_power (gfc_se
* se
, tree lhs
, tree rhs
)
2917 tree vartmp
[POWI_TABLE_SIZE
];
2919 unsigned HOST_WIDE_INT n
;
2921 wi::tree_to_wide_ref wrhs
= wi::to_wide (rhs
);
2923 /* If exponent is too large, we won't expand it anyway, so don't bother
2924 with large integer values. */
2925 if (!wi::fits_shwi_p (wrhs
))
2928 m
= wrhs
.to_shwi ();
2929 /* Use the wide_int's routine to reliably get the absolute value on all
2930 platforms. Then convert it to a HOST_WIDE_INT like above. */
2931 n
= wi::abs (wrhs
).to_shwi ();
2933 type
= TREE_TYPE (lhs
);
2934 sgn
= tree_int_cst_sgn (rhs
);
2936 if (((FLOAT_TYPE_P (type
) && !flag_unsafe_math_optimizations
)
2937 || optimize_size
) && (m
> 2 || m
< -1))
2943 se
->expr
= gfc_build_const (type
, integer_one_node
);
2947 /* If rhs < 0 and lhs is an integer, the result is -1, 0 or 1. */
2948 if ((sgn
== -1) && (TREE_CODE (type
) == INTEGER_TYPE
))
2950 tmp
= fold_build2_loc (input_location
, EQ_EXPR
, logical_type_node
,
2951 lhs
, build_int_cst (TREE_TYPE (lhs
), -1));
2952 cond
= fold_build2_loc (input_location
, EQ_EXPR
, logical_type_node
,
2953 lhs
, build_int_cst (TREE_TYPE (lhs
), 1));
2956 result = (lhs == 1 || lhs == -1) ? 1 : 0. */
2959 tmp
= fold_build2_loc (input_location
, TRUTH_OR_EXPR
,
2960 logical_type_node
, tmp
, cond
);
2961 se
->expr
= fold_build3_loc (input_location
, COND_EXPR
, type
,
2962 tmp
, build_int_cst (type
, 1),
2963 build_int_cst (type
, 0));
2967 result = (lhs == 1) ? 1 : (lhs == -1) ? -1 : 0. */
2968 tmp
= fold_build3_loc (input_location
, COND_EXPR
, type
, tmp
,
2969 build_int_cst (type
, -1),
2970 build_int_cst (type
, 0));
2971 se
->expr
= fold_build3_loc (input_location
, COND_EXPR
, type
,
2972 cond
, build_int_cst (type
, 1), tmp
);
2976 memset (vartmp
, 0, sizeof (vartmp
));
2980 tmp
= gfc_build_const (type
, integer_one_node
);
2981 vartmp
[1] = fold_build2_loc (input_location
, RDIV_EXPR
, type
, tmp
,
2985 se
->expr
= gfc_conv_powi (se
, n
, vartmp
);
2991 /* Power op (**). Constant integer exponent has special handling. */
2994 gfc_conv_power_op (gfc_se
* se
, gfc_expr
* expr
)
2996 tree gfc_int4_type_node
;
2999 int res_ikind_1
, res_ikind_2
;
3004 gfc_init_se (&lse
, se
);
3005 gfc_conv_expr_val (&lse
, expr
->value
.op
.op1
);
3006 lse
.expr
= gfc_evaluate_now (lse
.expr
, &lse
.pre
);
3007 gfc_add_block_to_block (&se
->pre
, &lse
.pre
);
3009 gfc_init_se (&rse
, se
);
3010 gfc_conv_expr_val (&rse
, expr
->value
.op
.op2
);
3011 gfc_add_block_to_block (&se
->pre
, &rse
.pre
);
3013 if (expr
->value
.op
.op2
->ts
.type
== BT_INTEGER
3014 && expr
->value
.op
.op2
->expr_type
== EXPR_CONSTANT
)
3015 if (gfc_conv_cst_int_power (se
, lse
.expr
, rse
.expr
))
3018 gfc_int4_type_node
= gfc_get_int_type (4);
3020 /* In case of integer operands with kinds 1 or 2, we call the integer kind 4
3021 library routine. But in the end, we have to convert the result back
3022 if this case applies -- with res_ikind_K, we keep track whether operand K
3023 falls into this case. */
3027 kind
= expr
->value
.op
.op1
->ts
.kind
;
3028 switch (expr
->value
.op
.op2
->ts
.type
)
3031 ikind
= expr
->value
.op
.op2
->ts
.kind
;
3036 rse
.expr
= convert (gfc_int4_type_node
, rse
.expr
);
3037 res_ikind_2
= ikind
;
3059 if (expr
->value
.op
.op1
->ts
.type
== BT_INTEGER
)
3061 lse
.expr
= convert (gfc_int4_type_node
, lse
.expr
);
3088 switch (expr
->value
.op
.op1
->ts
.type
)
3091 if (kind
== 3) /* Case 16 was not handled properly above. */
3093 fndecl
= gfor_fndecl_math_powi
[kind
][ikind
].integer
;
3097 /* Use builtins for real ** int4. */
3103 fndecl
= builtin_decl_explicit (BUILT_IN_POWIF
);
3107 fndecl
= builtin_decl_explicit (BUILT_IN_POWI
);
3111 fndecl
= builtin_decl_explicit (BUILT_IN_POWIL
);
3115 /* Use the __builtin_powil() only if real(kind=16) is
3116 actually the C long double type. */
3117 if (!gfc_real16_is_float128
)
3118 fndecl
= builtin_decl_explicit (BUILT_IN_POWIL
);
3126 /* If we don't have a good builtin for this, go for the
3127 library function. */
3129 fndecl
= gfor_fndecl_math_powi
[kind
][ikind
].real
;
3133 fndecl
= gfor_fndecl_math_powi
[kind
][ikind
].cmplx
;
3142 fndecl
= gfc_builtin_decl_for_float_kind (BUILT_IN_POW
, kind
);
3146 fndecl
= gfc_builtin_decl_for_float_kind (BUILT_IN_CPOW
, kind
);
3154 se
->expr
= build_call_expr_loc (input_location
,
3155 fndecl
, 2, lse
.expr
, rse
.expr
);
3157 /* Convert the result back if it is of wrong integer kind. */
3158 if (res_ikind_1
!= -1 && res_ikind_2
!= -1)
3160 /* We want the maximum of both operand kinds as result. */
3161 if (res_ikind_1
< res_ikind_2
)
3162 res_ikind_1
= res_ikind_2
;
3163 se
->expr
= convert (gfc_get_int_type (res_ikind_1
), se
->expr
);
3168 /* Generate code to allocate a string temporary. */
3171 gfc_conv_string_tmp (gfc_se
* se
, tree type
, tree len
)
3176 if (gfc_can_put_var_on_stack (len
))
3178 /* Create a temporary variable to hold the result. */
3179 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
3180 TREE_TYPE (len
), len
,
3181 build_int_cst (TREE_TYPE (len
), 1));
3182 tmp
= build_range_type (gfc_charlen_type_node
, size_zero_node
, tmp
);
3184 if (TREE_CODE (TREE_TYPE (type
)) == ARRAY_TYPE
)
3185 tmp
= build_array_type (TREE_TYPE (TREE_TYPE (type
)), tmp
);
3187 tmp
= build_array_type (TREE_TYPE (type
), tmp
);
3189 var
= gfc_create_var (tmp
, "str");
3190 var
= gfc_build_addr_expr (type
, var
);
3194 /* Allocate a temporary to hold the result. */
3195 var
= gfc_create_var (type
, "pstr");
3196 gcc_assert (POINTER_TYPE_P (type
));
3197 tmp
= TREE_TYPE (type
);
3198 if (TREE_CODE (tmp
) == ARRAY_TYPE
)
3199 tmp
= TREE_TYPE (tmp
);
3200 tmp
= TYPE_SIZE_UNIT (tmp
);
3201 tmp
= fold_build2_loc (input_location
, MULT_EXPR
, size_type_node
,
3202 fold_convert (size_type_node
, len
),
3203 fold_convert (size_type_node
, tmp
));
3204 tmp
= gfc_call_malloc (&se
->pre
, type
, tmp
);
3205 gfc_add_modify (&se
->pre
, var
, tmp
);
3207 /* Free the temporary afterwards. */
3208 tmp
= gfc_call_free (var
);
3209 gfc_add_expr_to_block (&se
->post
, tmp
);
3216 /* Handle a string concatenation operation. A temporary will be allocated to
3220 gfc_conv_concat_op (gfc_se
* se
, gfc_expr
* expr
)
3223 tree len
, type
, var
, tmp
, fndecl
;
3225 gcc_assert (expr
->value
.op
.op1
->ts
.type
== BT_CHARACTER
3226 && expr
->value
.op
.op2
->ts
.type
== BT_CHARACTER
);
3227 gcc_assert (expr
->value
.op
.op1
->ts
.kind
== expr
->value
.op
.op2
->ts
.kind
);
3229 gfc_init_se (&lse
, se
);
3230 gfc_conv_expr (&lse
, expr
->value
.op
.op1
);
3231 gfc_conv_string_parameter (&lse
);
3232 gfc_init_se (&rse
, se
);
3233 gfc_conv_expr (&rse
, expr
->value
.op
.op2
);
3234 gfc_conv_string_parameter (&rse
);
3236 gfc_add_block_to_block (&se
->pre
, &lse
.pre
);
3237 gfc_add_block_to_block (&se
->pre
, &rse
.pre
);
3239 type
= gfc_get_character_type (expr
->ts
.kind
, expr
->ts
.u
.cl
);
3240 len
= TYPE_MAX_VALUE (TYPE_DOMAIN (type
));
3241 if (len
== NULL_TREE
)
3243 len
= fold_build2_loc (input_location
, PLUS_EXPR
,
3244 gfc_charlen_type_node
,
3245 fold_convert (gfc_charlen_type_node
,
3247 fold_convert (gfc_charlen_type_node
,
3248 rse
.string_length
));
3251 type
= build_pointer_type (type
);
3253 var
= gfc_conv_string_tmp (se
, type
, len
);
3255 /* Do the actual concatenation. */
3256 if (expr
->ts
.kind
== 1)
3257 fndecl
= gfor_fndecl_concat_string
;
3258 else if (expr
->ts
.kind
== 4)
3259 fndecl
= gfor_fndecl_concat_string_char4
;
3263 tmp
= build_call_expr_loc (input_location
,
3264 fndecl
, 6, len
, var
, lse
.string_length
, lse
.expr
,
3265 rse
.string_length
, rse
.expr
);
3266 gfc_add_expr_to_block (&se
->pre
, tmp
);
3268 /* Add the cleanup for the operands. */
3269 gfc_add_block_to_block (&se
->pre
, &rse
.post
);
3270 gfc_add_block_to_block (&se
->pre
, &lse
.post
);
3273 se
->string_length
= len
;
3276 /* Translates an op expression. Common (binary) cases are handled by this
3277 function, others are passed on. Recursion is used in either case.
3278 We use the fact that (op1.ts == op2.ts) (except for the power
3280 Operators need no special handling for scalarized expressions as long as
3281 they call gfc_conv_simple_val to get their operands.
3282 Character strings get special handling. */
3285 gfc_conv_expr_op (gfc_se
* se
, gfc_expr
* expr
)
3287 enum tree_code code
;
3296 switch (expr
->value
.op
.op
)
3298 case INTRINSIC_PARENTHESES
:
3299 if ((expr
->ts
.type
== BT_REAL
|| expr
->ts
.type
== BT_COMPLEX
)
3300 && flag_protect_parens
)
3302 gfc_conv_unary_op (PAREN_EXPR
, se
, expr
);
3303 gcc_assert (FLOAT_TYPE_P (TREE_TYPE (se
->expr
)));
3308 case INTRINSIC_UPLUS
:
3309 gfc_conv_expr (se
, expr
->value
.op
.op1
);
3312 case INTRINSIC_UMINUS
:
3313 gfc_conv_unary_op (NEGATE_EXPR
, se
, expr
);
3317 gfc_conv_unary_op (TRUTH_NOT_EXPR
, se
, expr
);
3320 case INTRINSIC_PLUS
:
3324 case INTRINSIC_MINUS
:
3328 case INTRINSIC_TIMES
:
3332 case INTRINSIC_DIVIDE
:
3333 /* If expr is a real or complex expr, use an RDIV_EXPR. If op1 is
3334 an integer, we must round towards zero, so we use a
3336 if (expr
->ts
.type
== BT_INTEGER
)
3337 code
= TRUNC_DIV_EXPR
;
3342 case INTRINSIC_POWER
:
3343 gfc_conv_power_op (se
, expr
);
3346 case INTRINSIC_CONCAT
:
3347 gfc_conv_concat_op (se
, expr
);
3351 code
= TRUTH_ANDIF_EXPR
;
3356 code
= TRUTH_ORIF_EXPR
;
3360 /* EQV and NEQV only work on logicals, but since we represent them
3361 as integers, we can use EQ_EXPR and NE_EXPR for them in GIMPLE. */
3363 case INTRINSIC_EQ_OS
:
3371 case INTRINSIC_NE_OS
:
3372 case INTRINSIC_NEQV
:
3379 case INTRINSIC_GT_OS
:
3386 case INTRINSIC_GE_OS
:
3393 case INTRINSIC_LT_OS
:
3400 case INTRINSIC_LE_OS
:
3406 case INTRINSIC_USER
:
3407 case INTRINSIC_ASSIGN
:
3408 /* These should be converted into function calls by the frontend. */
3412 fatal_error (input_location
, "Unknown intrinsic op");
3416 /* The only exception to this is **, which is handled separately anyway. */
3417 gcc_assert (expr
->value
.op
.op1
->ts
.type
== expr
->value
.op
.op2
->ts
.type
);
3419 if (checkstring
&& expr
->value
.op
.op1
->ts
.type
!= BT_CHARACTER
)
3423 gfc_init_se (&lse
, se
);
3424 gfc_conv_expr (&lse
, expr
->value
.op
.op1
);
3425 gfc_add_block_to_block (&se
->pre
, &lse
.pre
);
3428 gfc_init_se (&rse
, se
);
3429 gfc_conv_expr (&rse
, expr
->value
.op
.op2
);
3430 gfc_add_block_to_block (&se
->pre
, &rse
.pre
);
3434 gfc_conv_string_parameter (&lse
);
3435 gfc_conv_string_parameter (&rse
);
3437 lse
.expr
= gfc_build_compare_string (lse
.string_length
, lse
.expr
,
3438 rse
.string_length
, rse
.expr
,
3439 expr
->value
.op
.op1
->ts
.kind
,
3441 rse
.expr
= build_int_cst (TREE_TYPE (lse
.expr
), 0);
3442 gfc_add_block_to_block (&lse
.post
, &rse
.post
);
3445 type
= gfc_typenode_for_spec (&expr
->ts
);
3449 /* The result of logical ops is always logical_type_node. */
3450 tmp
= fold_build2_loc (input_location
, code
, logical_type_node
,
3451 lse
.expr
, rse
.expr
);
3452 se
->expr
= convert (type
, tmp
);
3455 se
->expr
= fold_build2_loc (input_location
, code
, type
, lse
.expr
, rse
.expr
);
3457 /* Add the post blocks. */
3458 gfc_add_block_to_block (&se
->post
, &rse
.post
);
3459 gfc_add_block_to_block (&se
->post
, &lse
.post
);
3462 /* If a string's length is one, we convert it to a single character. */
3465 gfc_string_to_single_character (tree len
, tree str
, int kind
)
3469 || !tree_fits_uhwi_p (len
)
3470 || !POINTER_TYPE_P (TREE_TYPE (str
)))
3473 if (TREE_INT_CST_LOW (len
) == 1)
3475 str
= fold_convert (gfc_get_pchar_type (kind
), str
);
3476 return build_fold_indirect_ref_loc (input_location
, str
);
3480 && TREE_CODE (str
) == ADDR_EXPR
3481 && TREE_CODE (TREE_OPERAND (str
, 0)) == ARRAY_REF
3482 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (str
, 0), 0)) == STRING_CST
3483 && array_ref_low_bound (TREE_OPERAND (str
, 0))
3484 == TREE_OPERAND (TREE_OPERAND (str
, 0), 1)
3485 && TREE_INT_CST_LOW (len
) > 1
3486 && TREE_INT_CST_LOW (len
)
3487 == (unsigned HOST_WIDE_INT
)
3488 TREE_STRING_LENGTH (TREE_OPERAND (TREE_OPERAND (str
, 0), 0)))
3490 tree ret
= fold_convert (gfc_get_pchar_type (kind
), str
);
3491 ret
= build_fold_indirect_ref_loc (input_location
, ret
);
3492 if (TREE_CODE (ret
) == INTEGER_CST
)
3494 tree string_cst
= TREE_OPERAND (TREE_OPERAND (str
, 0), 0);
3495 int i
, length
= TREE_STRING_LENGTH (string_cst
);
3496 const char *ptr
= TREE_STRING_POINTER (string_cst
);
3498 for (i
= 1; i
< length
; i
++)
3511 gfc_conv_scalar_char_value (gfc_symbol
*sym
, gfc_se
*se
, gfc_expr
**expr
)
3514 if (sym
->backend_decl
)
3516 /* This becomes the nominal_type in
3517 function.c:assign_parm_find_data_types. */
3518 TREE_TYPE (sym
->backend_decl
) = unsigned_char_type_node
;
3519 /* This becomes the passed_type in
3520 function.c:assign_parm_find_data_types. C promotes char to
3521 integer for argument passing. */
3522 DECL_ARG_TYPE (sym
->backend_decl
) = unsigned_type_node
;
3524 DECL_BY_REFERENCE (sym
->backend_decl
) = 0;
3529 /* If we have a constant character expression, make it into an
3531 if ((*expr
)->expr_type
== EXPR_CONSTANT
)
3536 *expr
= gfc_get_int_expr (gfc_default_integer_kind
, NULL
,
3537 (int)(*expr
)->value
.character
.string
[0]);
3538 if ((*expr
)->ts
.kind
!= gfc_c_int_kind
)
3540 /* The expr needs to be compatible with a C int. If the
3541 conversion fails, then the 2 causes an ICE. */
3542 ts
.type
= BT_INTEGER
;
3543 ts
.kind
= gfc_c_int_kind
;
3544 gfc_convert_type (*expr
, &ts
, 2);
3547 else if (se
!= NULL
&& (*expr
)->expr_type
== EXPR_VARIABLE
)
3549 if ((*expr
)->ref
== NULL
)
3551 se
->expr
= gfc_string_to_single_character
3552 (build_int_cst (integer_type_node
, 1),
3553 gfc_build_addr_expr (gfc_get_pchar_type ((*expr
)->ts
.kind
),
3555 ((*expr
)->symtree
->n
.sym
)),
3560 gfc_conv_variable (se
, *expr
);
3561 se
->expr
= gfc_string_to_single_character
3562 (build_int_cst (integer_type_node
, 1),
3563 gfc_build_addr_expr (gfc_get_pchar_type ((*expr
)->ts
.kind
),
3571 /* Helper function for gfc_build_compare_string. Return LEN_TRIM value
3572 if STR is a string literal, otherwise return -1. */
3575 gfc_optimize_len_trim (tree len
, tree str
, int kind
)
3578 && TREE_CODE (str
) == ADDR_EXPR
3579 && TREE_CODE (TREE_OPERAND (str
, 0)) == ARRAY_REF
3580 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (str
, 0), 0)) == STRING_CST
3581 && array_ref_low_bound (TREE_OPERAND (str
, 0))
3582 == TREE_OPERAND (TREE_OPERAND (str
, 0), 1)
3583 && tree_fits_uhwi_p (len
)
3584 && tree_to_uhwi (len
) >= 1
3585 && tree_to_uhwi (len
)
3586 == (unsigned HOST_WIDE_INT
)
3587 TREE_STRING_LENGTH (TREE_OPERAND (TREE_OPERAND (str
, 0), 0)))
3589 tree folded
= fold_convert (gfc_get_pchar_type (kind
), str
);
3590 folded
= build_fold_indirect_ref_loc (input_location
, folded
);
3591 if (TREE_CODE (folded
) == INTEGER_CST
)
3593 tree string_cst
= TREE_OPERAND (TREE_OPERAND (str
, 0), 0);
3594 int length
= TREE_STRING_LENGTH (string_cst
);
3595 const char *ptr
= TREE_STRING_POINTER (string_cst
);
3597 for (; length
> 0; length
--)
3598 if (ptr
[length
- 1] != ' ')
3607 /* Helper to build a call to memcmp. */
3610 build_memcmp_call (tree s1
, tree s2
, tree n
)
3614 if (!POINTER_TYPE_P (TREE_TYPE (s1
)))
3615 s1
= gfc_build_addr_expr (pvoid_type_node
, s1
);
3617 s1
= fold_convert (pvoid_type_node
, s1
);
3619 if (!POINTER_TYPE_P (TREE_TYPE (s2
)))
3620 s2
= gfc_build_addr_expr (pvoid_type_node
, s2
);
3622 s2
= fold_convert (pvoid_type_node
, s2
);
3624 n
= fold_convert (size_type_node
, n
);
3626 tmp
= build_call_expr_loc (input_location
,
3627 builtin_decl_explicit (BUILT_IN_MEMCMP
),
3630 return fold_convert (integer_type_node
, tmp
);
3633 /* Compare two strings. If they are all single characters, the result is the
3634 subtraction of them. Otherwise, we build a library call. */
3637 gfc_build_compare_string (tree len1
, tree str1
, tree len2
, tree str2
, int kind
,
3638 enum tree_code code
)
3644 gcc_assert (POINTER_TYPE_P (TREE_TYPE (str1
)));
3645 gcc_assert (POINTER_TYPE_P (TREE_TYPE (str2
)));
3647 sc1
= gfc_string_to_single_character (len1
, str1
, kind
);
3648 sc2
= gfc_string_to_single_character (len2
, str2
, kind
);
3650 if (sc1
!= NULL_TREE
&& sc2
!= NULL_TREE
)
3652 /* Deal with single character specially. */
3653 sc1
= fold_convert (integer_type_node
, sc1
);
3654 sc2
= fold_convert (integer_type_node
, sc2
);
3655 return fold_build2_loc (input_location
, MINUS_EXPR
, integer_type_node
,
3659 if ((code
== EQ_EXPR
|| code
== NE_EXPR
)
3661 && INTEGER_CST_P (len1
) && INTEGER_CST_P (len2
))
3663 /* If one string is a string literal with LEN_TRIM longer
3664 than the length of the second string, the strings
3666 int len
= gfc_optimize_len_trim (len1
, str1
, kind
);
3667 if (len
> 0 && compare_tree_int (len2
, len
) < 0)
3668 return integer_one_node
;
3669 len
= gfc_optimize_len_trim (len2
, str2
, kind
);
3670 if (len
> 0 && compare_tree_int (len1
, len
) < 0)
3671 return integer_one_node
;
3674 /* We can compare via memcpy if the strings are known to be equal
3675 in length and they are
3677 - kind=4 and the comparison is for (in)equality. */
3679 if (INTEGER_CST_P (len1
) && INTEGER_CST_P (len2
)
3680 && tree_int_cst_equal (len1
, len2
)
3681 && (kind
== 1 || code
== EQ_EXPR
|| code
== NE_EXPR
))
3686 chartype
= gfc_get_char_type (kind
);
3687 tmp
= fold_build2_loc (input_location
, MULT_EXPR
, TREE_TYPE(len1
),
3688 fold_convert (TREE_TYPE(len1
),
3689 TYPE_SIZE_UNIT(chartype
)),
3691 return build_memcmp_call (str1
, str2
, tmp
);
3694 /* Build a call for the comparison. */
3696 fndecl
= gfor_fndecl_compare_string
;
3698 fndecl
= gfor_fndecl_compare_string_char4
;
3702 return build_call_expr_loc (input_location
, fndecl
, 4,
3703 len1
, str1
, len2
, str2
);
3707 /* Return the backend_decl for a procedure pointer component. */
3710 get_proc_ptr_comp (gfc_expr
*e
)
3716 gfc_init_se (&comp_se
, NULL
);
3717 e2
= gfc_copy_expr (e
);
3718 /* We have to restore the expr type later so that gfc_free_expr frees
3719 the exact same thing that was allocated.
3720 TODO: This is ugly. */
3721 old_type
= e2
->expr_type
;
3722 e2
->expr_type
= EXPR_VARIABLE
;
3723 gfc_conv_expr (&comp_se
, e2
);
3724 e2
->expr_type
= old_type
;
3726 return build_fold_addr_expr_loc (input_location
, comp_se
.expr
);
3730 /* Convert a typebound function reference from a class object. */
3732 conv_base_obj_fcn_val (gfc_se
* se
, tree base_object
, gfc_expr
* expr
)
3737 if (!VAR_P (base_object
))
3739 var
= gfc_create_var (TREE_TYPE (base_object
), NULL
);
3740 gfc_add_modify (&se
->pre
, var
, base_object
);
3742 se
->expr
= gfc_class_vptr_get (base_object
);
3743 se
->expr
= build_fold_indirect_ref_loc (input_location
, se
->expr
);
3745 while (ref
&& ref
->next
)
3747 gcc_assert (ref
&& ref
->type
== REF_COMPONENT
);
3748 if (ref
->u
.c
.sym
->attr
.extension
)
3749 conv_parent_component_references (se
, ref
);
3750 gfc_conv_component_ref (se
, ref
);
3751 se
->expr
= build_fold_addr_expr_loc (input_location
, se
->expr
);
3756 conv_function_val (gfc_se
* se
, gfc_symbol
* sym
, gfc_expr
* expr
)
3760 if (gfc_is_proc_ptr_comp (expr
))
3761 tmp
= get_proc_ptr_comp (expr
);
3762 else if (sym
->attr
.dummy
)
3764 tmp
= gfc_get_symbol_decl (sym
);
3765 if (sym
->attr
.proc_pointer
)
3766 tmp
= build_fold_indirect_ref_loc (input_location
,
3768 gcc_assert (TREE_CODE (TREE_TYPE (tmp
)) == POINTER_TYPE
3769 && TREE_CODE (TREE_TYPE (TREE_TYPE (tmp
))) == FUNCTION_TYPE
);
3773 if (!sym
->backend_decl
)
3774 sym
->backend_decl
= gfc_get_extern_function_decl (sym
);
3776 TREE_USED (sym
->backend_decl
) = 1;
3778 tmp
= sym
->backend_decl
;
3780 if (sym
->attr
.cray_pointee
)
3782 /* TODO - make the cray pointee a pointer to a procedure,
3783 assign the pointer to it and use it for the call. This
3785 tmp
= convert (build_pointer_type (TREE_TYPE (tmp
)),
3786 gfc_get_symbol_decl (sym
->cp_pointer
));
3787 tmp
= gfc_evaluate_now (tmp
, &se
->pre
);
3790 if (!POINTER_TYPE_P (TREE_TYPE (tmp
)))
3792 gcc_assert (TREE_CODE (tmp
) == FUNCTION_DECL
);
3793 tmp
= gfc_build_addr_expr (NULL_TREE
, tmp
);
3800 /* Initialize MAPPING. */
3803 gfc_init_interface_mapping (gfc_interface_mapping
* mapping
)
3805 mapping
->syms
= NULL
;
3806 mapping
->charlens
= NULL
;
3810 /* Free all memory held by MAPPING (but not MAPPING itself). */
3813 gfc_free_interface_mapping (gfc_interface_mapping
* mapping
)
3815 gfc_interface_sym_mapping
*sym
;
3816 gfc_interface_sym_mapping
*nextsym
;
3818 gfc_charlen
*nextcl
;
3820 for (sym
= mapping
->syms
; sym
; sym
= nextsym
)
3822 nextsym
= sym
->next
;
3823 sym
->new_sym
->n
.sym
->formal
= NULL
;
3824 gfc_free_symbol (sym
->new_sym
->n
.sym
);
3825 gfc_free_expr (sym
->expr
);
3826 free (sym
->new_sym
);
3829 for (cl
= mapping
->charlens
; cl
; cl
= nextcl
)
3832 gfc_free_expr (cl
->length
);
3838 /* Return a copy of gfc_charlen CL. Add the returned structure to
3839 MAPPING so that it will be freed by gfc_free_interface_mapping. */
3841 static gfc_charlen
*
3842 gfc_get_interface_mapping_charlen (gfc_interface_mapping
* mapping
,
3845 gfc_charlen
*new_charlen
;
3847 new_charlen
= gfc_get_charlen ();
3848 new_charlen
->next
= mapping
->charlens
;
3849 new_charlen
->length
= gfc_copy_expr (cl
->length
);
3851 mapping
->charlens
= new_charlen
;
3856 /* A subroutine of gfc_add_interface_mapping. Return a descriptorless
3857 array variable that can be used as the actual argument for dummy
3858 argument SYM. Add any initialization code to BLOCK. PACKED is as
3859 for gfc_get_nodesc_array_type and DATA points to the first element
3860 in the passed array. */
3863 gfc_get_interface_mapping_array (stmtblock_t
* block
, gfc_symbol
* sym
,
3864 gfc_packed packed
, tree data
)
3869 type
= gfc_typenode_for_spec (&sym
->ts
);
3870 type
= gfc_get_nodesc_array_type (type
, sym
->as
, packed
,
3871 !sym
->attr
.target
&& !sym
->attr
.pointer
3872 && !sym
->attr
.proc_pointer
);
3874 var
= gfc_create_var (type
, "ifm");
3875 gfc_add_modify (block
, var
, fold_convert (type
, data
));
3881 /* A subroutine of gfc_add_interface_mapping. Set the stride, upper bounds
3882 and offset of descriptorless array type TYPE given that it has the same
3883 size as DESC. Add any set-up code to BLOCK. */
3886 gfc_set_interface_mapping_bounds (stmtblock_t
* block
, tree type
, tree desc
)
3893 offset
= gfc_index_zero_node
;
3894 for (n
= 0; n
< GFC_TYPE_ARRAY_RANK (type
); n
++)
3896 dim
= gfc_rank_cst
[n
];
3897 GFC_TYPE_ARRAY_STRIDE (type
, n
) = gfc_conv_array_stride (desc
, n
);
3898 if (GFC_TYPE_ARRAY_LBOUND (type
, n
) == NULL_TREE
)
3900 GFC_TYPE_ARRAY_LBOUND (type
, n
)
3901 = gfc_conv_descriptor_lbound_get (desc
, dim
);
3902 GFC_TYPE_ARRAY_UBOUND (type
, n
)
3903 = gfc_conv_descriptor_ubound_get (desc
, dim
);
3905 else if (GFC_TYPE_ARRAY_UBOUND (type
, n
) == NULL_TREE
)
3907 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
3908 gfc_array_index_type
,
3909 gfc_conv_descriptor_ubound_get (desc
, dim
),
3910 gfc_conv_descriptor_lbound_get (desc
, dim
));
3911 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
,
3912 gfc_array_index_type
,
3913 GFC_TYPE_ARRAY_LBOUND (type
, n
), tmp
);
3914 tmp
= gfc_evaluate_now (tmp
, block
);
3915 GFC_TYPE_ARRAY_UBOUND (type
, n
) = tmp
;
3917 tmp
= fold_build2_loc (input_location
, MULT_EXPR
, gfc_array_index_type
,
3918 GFC_TYPE_ARRAY_LBOUND (type
, n
),
3919 GFC_TYPE_ARRAY_STRIDE (type
, n
));
3920 offset
= fold_build2_loc (input_location
, MINUS_EXPR
,
3921 gfc_array_index_type
, offset
, tmp
);
3923 offset
= gfc_evaluate_now (offset
, block
);
3924 GFC_TYPE_ARRAY_OFFSET (type
) = offset
;
3928 /* Extend MAPPING so that it maps dummy argument SYM to the value stored
3929 in SE. The caller may still use se->expr and se->string_length after
3930 calling this function. */
3933 gfc_add_interface_mapping (gfc_interface_mapping
* mapping
,
3934 gfc_symbol
* sym
, gfc_se
* se
,
3937 gfc_interface_sym_mapping
*sm
;
3941 gfc_symbol
*new_sym
;
3943 gfc_symtree
*new_symtree
;
3945 /* Create a new symbol to represent the actual argument. */
3946 new_sym
= gfc_new_symbol (sym
->name
, NULL
);
3947 new_sym
->ts
= sym
->ts
;
3948 new_sym
->as
= gfc_copy_array_spec (sym
->as
);
3949 new_sym
->attr
.referenced
= 1;
3950 new_sym
->attr
.dimension
= sym
->attr
.dimension
;
3951 new_sym
->attr
.contiguous
= sym
->attr
.contiguous
;
3952 new_sym
->attr
.codimension
= sym
->attr
.codimension
;
3953 new_sym
->attr
.pointer
= sym
->attr
.pointer
;
3954 new_sym
->attr
.allocatable
= sym
->attr
.allocatable
;
3955 new_sym
->attr
.flavor
= sym
->attr
.flavor
;
3956 new_sym
->attr
.function
= sym
->attr
.function
;
3958 /* Ensure that the interface is available and that
3959 descriptors are passed for array actual arguments. */
3960 if (sym
->attr
.flavor
== FL_PROCEDURE
)
3962 new_sym
->formal
= expr
->symtree
->n
.sym
->formal
;
3963 new_sym
->attr
.always_explicit
3964 = expr
->symtree
->n
.sym
->attr
.always_explicit
;
3967 /* Create a fake symtree for it. */
3969 new_symtree
= gfc_new_symtree (&root
, sym
->name
);
3970 new_symtree
->n
.sym
= new_sym
;
3971 gcc_assert (new_symtree
== root
);
3973 /* Create a dummy->actual mapping. */
3974 sm
= XCNEW (gfc_interface_sym_mapping
);
3975 sm
->next
= mapping
->syms
;
3977 sm
->new_sym
= new_symtree
;
3978 sm
->expr
= gfc_copy_expr (expr
);
3981 /* Stabilize the argument's value. */
3982 if (!sym
->attr
.function
&& se
)
3983 se
->expr
= gfc_evaluate_now (se
->expr
, &se
->pre
);
3985 if (sym
->ts
.type
== BT_CHARACTER
)
3987 /* Create a copy of the dummy argument's length. */
3988 new_sym
->ts
.u
.cl
= gfc_get_interface_mapping_charlen (mapping
, sym
->ts
.u
.cl
);
3989 sm
->expr
->ts
.u
.cl
= new_sym
->ts
.u
.cl
;
3991 /* If the length is specified as "*", record the length that
3992 the caller is passing. We should use the callee's length
3993 in all other cases. */
3994 if (!new_sym
->ts
.u
.cl
->length
&& se
)
3996 se
->string_length
= gfc_evaluate_now (se
->string_length
, &se
->pre
);
3997 new_sym
->ts
.u
.cl
->backend_decl
= se
->string_length
;
4004 /* Use the passed value as-is if the argument is a function. */
4005 if (sym
->attr
.flavor
== FL_PROCEDURE
)
4008 /* If the argument is a pass-by-value scalar, use the value as is. */
4009 else if (!sym
->attr
.dimension
&& sym
->attr
.value
)
4012 /* If the argument is either a string or a pointer to a string,
4013 convert it to a boundless character type. */
4014 else if (!sym
->attr
.dimension
&& sym
->ts
.type
== BT_CHARACTER
)
4016 tmp
= gfc_get_character_type_len (sym
->ts
.kind
, NULL
);
4017 tmp
= build_pointer_type (tmp
);
4018 if (sym
->attr
.pointer
)
4019 value
= build_fold_indirect_ref_loc (input_location
,
4023 value
= fold_convert (tmp
, value
);
4026 /* If the argument is a scalar, a pointer to an array or an allocatable,
4028 else if (!sym
->attr
.dimension
|| sym
->attr
.pointer
|| sym
->attr
.allocatable
)
4029 value
= build_fold_indirect_ref_loc (input_location
,
4032 /* For character(*), use the actual argument's descriptor. */
4033 else if (sym
->ts
.type
== BT_CHARACTER
&& !new_sym
->ts
.u
.cl
->length
)
4034 value
= build_fold_indirect_ref_loc (input_location
,
4037 /* If the argument is an array descriptor, use it to determine
4038 information about the actual argument's shape. */
4039 else if (POINTER_TYPE_P (TREE_TYPE (se
->expr
))
4040 && GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (TREE_TYPE (se
->expr
))))
4042 /* Get the actual argument's descriptor. */
4043 desc
= build_fold_indirect_ref_loc (input_location
,
4046 /* Create the replacement variable. */
4047 tmp
= gfc_conv_descriptor_data_get (desc
);
4048 value
= gfc_get_interface_mapping_array (&se
->pre
, sym
,
4051 /* Use DESC to work out the upper bounds, strides and offset. */
4052 gfc_set_interface_mapping_bounds (&se
->pre
, TREE_TYPE (value
), desc
);
4055 /* Otherwise we have a packed array. */
4056 value
= gfc_get_interface_mapping_array (&se
->pre
, sym
,
4057 PACKED_FULL
, se
->expr
);
4059 new_sym
->backend_decl
= value
;
4063 /* Called once all dummy argument mappings have been added to MAPPING,
4064 but before the mapping is used to evaluate expressions. Pre-evaluate
4065 the length of each argument, adding any initialization code to PRE and
4066 any finalization code to POST. */
4069 gfc_finish_interface_mapping (gfc_interface_mapping
* mapping
,
4070 stmtblock_t
* pre
, stmtblock_t
* post
)
4072 gfc_interface_sym_mapping
*sym
;
4076 for (sym
= mapping
->syms
; sym
; sym
= sym
->next
)
4077 if (sym
->new_sym
->n
.sym
->ts
.type
== BT_CHARACTER
4078 && !sym
->new_sym
->n
.sym
->ts
.u
.cl
->backend_decl
)
4080 expr
= sym
->new_sym
->n
.sym
->ts
.u
.cl
->length
;
4081 gfc_apply_interface_mapping_to_expr (mapping
, expr
);
4082 gfc_init_se (&se
, NULL
);
4083 gfc_conv_expr (&se
, expr
);
4084 se
.expr
= fold_convert (gfc_charlen_type_node
, se
.expr
);
4085 se
.expr
= gfc_evaluate_now (se
.expr
, &se
.pre
);
4086 gfc_add_block_to_block (pre
, &se
.pre
);
4087 gfc_add_block_to_block (post
, &se
.post
);
4089 sym
->new_sym
->n
.sym
->ts
.u
.cl
->backend_decl
= se
.expr
;
4094 /* Like gfc_apply_interface_mapping_to_expr, but applied to
4098 gfc_apply_interface_mapping_to_cons (gfc_interface_mapping
* mapping
,
4099 gfc_constructor_base base
)
4102 for (c
= gfc_constructor_first (base
); c
; c
= gfc_constructor_next (c
))
4104 gfc_apply_interface_mapping_to_expr (mapping
, c
->expr
);
4107 gfc_apply_interface_mapping_to_expr (mapping
, c
->iterator
->start
);
4108 gfc_apply_interface_mapping_to_expr (mapping
, c
->iterator
->end
);
4109 gfc_apply_interface_mapping_to_expr (mapping
, c
->iterator
->step
);
4115 /* Like gfc_apply_interface_mapping_to_expr, but applied to
4119 gfc_apply_interface_mapping_to_ref (gfc_interface_mapping
* mapping
,
4124 for (; ref
; ref
= ref
->next
)
4128 for (n
= 0; n
< ref
->u
.ar
.dimen
; n
++)
4130 gfc_apply_interface_mapping_to_expr (mapping
, ref
->u
.ar
.start
[n
]);
4131 gfc_apply_interface_mapping_to_expr (mapping
, ref
->u
.ar
.end
[n
]);
4132 gfc_apply_interface_mapping_to_expr (mapping
, ref
->u
.ar
.stride
[n
]);
4140 gfc_apply_interface_mapping_to_expr (mapping
, ref
->u
.ss
.start
);
4141 gfc_apply_interface_mapping_to_expr (mapping
, ref
->u
.ss
.end
);
4147 /* Convert intrinsic function calls into result expressions. */
4150 gfc_map_intrinsic_function (gfc_expr
*expr
, gfc_interface_mapping
*mapping
)
4158 arg1
= expr
->value
.function
.actual
->expr
;
4159 if (expr
->value
.function
.actual
->next
)
4160 arg2
= expr
->value
.function
.actual
->next
->expr
;
4164 sym
= arg1
->symtree
->n
.sym
;
4166 if (sym
->attr
.dummy
)
4171 switch (expr
->value
.function
.isym
->id
)
4174 /* TODO figure out why this condition is necessary. */
4175 if (sym
->attr
.function
4176 && (arg1
->ts
.u
.cl
->length
== NULL
4177 || (arg1
->ts
.u
.cl
->length
->expr_type
!= EXPR_CONSTANT
4178 && arg1
->ts
.u
.cl
->length
->expr_type
!= EXPR_VARIABLE
)))
4181 new_expr
= gfc_copy_expr (arg1
->ts
.u
.cl
->length
);
4184 case GFC_ISYM_LEN_TRIM
:
4185 new_expr
= gfc_copy_expr (arg1
);
4186 gfc_apply_interface_mapping_to_expr (mapping
, new_expr
);
4191 gfc_replace_expr (arg1
, new_expr
);
4195 if (!sym
->as
|| sym
->as
->rank
== 0)
4198 if (arg2
&& arg2
->expr_type
== EXPR_CONSTANT
)
4200 dup
= mpz_get_si (arg2
->value
.integer
);
4205 dup
= sym
->as
->rank
;
4209 for (; d
< dup
; d
++)
4213 if (!sym
->as
->upper
[d
] || !sym
->as
->lower
[d
])
4215 gfc_free_expr (new_expr
);
4219 tmp
= gfc_add (gfc_copy_expr (sym
->as
->upper
[d
]),
4220 gfc_get_int_expr (gfc_default_integer_kind
,
4222 tmp
= gfc_subtract (tmp
, gfc_copy_expr (sym
->as
->lower
[d
]));
4224 new_expr
= gfc_multiply (new_expr
, tmp
);
4230 case GFC_ISYM_LBOUND
:
4231 case GFC_ISYM_UBOUND
:
4232 /* TODO These implementations of lbound and ubound do not limit if
4233 the size < 0, according to F95's 13.14.53 and 13.14.113. */
4235 if (!sym
->as
|| sym
->as
->rank
== 0)
4238 if (arg2
&& arg2
->expr_type
== EXPR_CONSTANT
)
4239 d
= mpz_get_si (arg2
->value
.integer
) - 1;
4243 if (expr
->value
.function
.isym
->id
== GFC_ISYM_LBOUND
)
4245 if (sym
->as
->lower
[d
])
4246 new_expr
= gfc_copy_expr (sym
->as
->lower
[d
]);
4250 if (sym
->as
->upper
[d
])
4251 new_expr
= gfc_copy_expr (sym
->as
->upper
[d
]);
4259 gfc_apply_interface_mapping_to_expr (mapping
, new_expr
);
4263 gfc_replace_expr (expr
, new_expr
);
4269 gfc_map_fcn_formal_to_actual (gfc_expr
*expr
, gfc_expr
*map_expr
,
4270 gfc_interface_mapping
* mapping
)
4272 gfc_formal_arglist
*f
;
4273 gfc_actual_arglist
*actual
;
4275 actual
= expr
->value
.function
.actual
;
4276 f
= gfc_sym_get_dummy_args (map_expr
->symtree
->n
.sym
);
4278 for (; f
&& actual
; f
= f
->next
, actual
= actual
->next
)
4283 gfc_add_interface_mapping (mapping
, f
->sym
, NULL
, actual
->expr
);
4286 if (map_expr
->symtree
->n
.sym
->attr
.dimension
)
4291 as
= gfc_copy_array_spec (map_expr
->symtree
->n
.sym
->as
);
4293 for (d
= 0; d
< as
->rank
; d
++)
4295 gfc_apply_interface_mapping_to_expr (mapping
, as
->lower
[d
]);
4296 gfc_apply_interface_mapping_to_expr (mapping
, as
->upper
[d
]);
4299 expr
->value
.function
.esym
->as
= as
;
4302 if (map_expr
->symtree
->n
.sym
->ts
.type
== BT_CHARACTER
)
4304 expr
->value
.function
.esym
->ts
.u
.cl
->length
4305 = gfc_copy_expr (map_expr
->symtree
->n
.sym
->ts
.u
.cl
->length
);
4307 gfc_apply_interface_mapping_to_expr (mapping
,
4308 expr
->value
.function
.esym
->ts
.u
.cl
->length
);
4313 /* EXPR is a copy of an expression that appeared in the interface
4314 associated with MAPPING. Walk it recursively looking for references to
4315 dummy arguments that MAPPING maps to actual arguments. Replace each such
4316 reference with a reference to the associated actual argument. */
4319 gfc_apply_interface_mapping_to_expr (gfc_interface_mapping
* mapping
,
4322 gfc_interface_sym_mapping
*sym
;
4323 gfc_actual_arglist
*actual
;
4328 /* Copying an expression does not copy its length, so do that here. */
4329 if (expr
->ts
.type
== BT_CHARACTER
&& expr
->ts
.u
.cl
)
4331 expr
->ts
.u
.cl
= gfc_get_interface_mapping_charlen (mapping
, expr
->ts
.u
.cl
);
4332 gfc_apply_interface_mapping_to_expr (mapping
, expr
->ts
.u
.cl
->length
);
4335 /* Apply the mapping to any references. */
4336 gfc_apply_interface_mapping_to_ref (mapping
, expr
->ref
);
4338 /* ...and to the expression's symbol, if it has one. */
4339 /* TODO Find out why the condition on expr->symtree had to be moved into
4340 the loop rather than being outside it, as originally. */
4341 for (sym
= mapping
->syms
; sym
; sym
= sym
->next
)
4342 if (expr
->symtree
&& sym
->old
== expr
->symtree
->n
.sym
)
4344 if (sym
->new_sym
->n
.sym
->backend_decl
)
4345 expr
->symtree
= sym
->new_sym
;
4347 gfc_replace_expr (expr
, gfc_copy_expr (sym
->expr
));
4350 /* ...and to subexpressions in expr->value. */
4351 switch (expr
->expr_type
)
4356 case EXPR_SUBSTRING
:
4360 gfc_apply_interface_mapping_to_expr (mapping
, expr
->value
.op
.op1
);
4361 gfc_apply_interface_mapping_to_expr (mapping
, expr
->value
.op
.op2
);
4365 for (actual
= expr
->value
.function
.actual
; actual
; actual
= actual
->next
)
4366 gfc_apply_interface_mapping_to_expr (mapping
, actual
->expr
);
4368 if (expr
->value
.function
.esym
== NULL
4369 && expr
->value
.function
.isym
!= NULL
4370 && expr
->value
.function
.actual
4371 && expr
->value
.function
.actual
->expr
4372 && expr
->value
.function
.actual
->expr
->symtree
4373 && gfc_map_intrinsic_function (expr
, mapping
))
4376 for (sym
= mapping
->syms
; sym
; sym
= sym
->next
)
4377 if (sym
->old
== expr
->value
.function
.esym
)
4379 expr
->value
.function
.esym
= sym
->new_sym
->n
.sym
;
4380 gfc_map_fcn_formal_to_actual (expr
, sym
->expr
, mapping
);
4381 expr
->value
.function
.esym
->result
= sym
->new_sym
->n
.sym
;
4386 case EXPR_STRUCTURE
:
4387 gfc_apply_interface_mapping_to_cons (mapping
, expr
->value
.constructor
);
4400 /* Evaluate interface expression EXPR using MAPPING. Store the result
4404 gfc_apply_interface_mapping (gfc_interface_mapping
* mapping
,
4405 gfc_se
* se
, gfc_expr
* expr
)
4407 expr
= gfc_copy_expr (expr
);
4408 gfc_apply_interface_mapping_to_expr (mapping
, expr
);
4409 gfc_conv_expr (se
, expr
);
4410 se
->expr
= gfc_evaluate_now (se
->expr
, &se
->pre
);
4411 gfc_free_expr (expr
);
4415 /* Returns a reference to a temporary array into which a component of
4416 an actual argument derived type array is copied and then returned
4417 after the function call. */
4419 gfc_conv_subref_array_arg (gfc_se
* parmse
, gfc_expr
* expr
, int g77
,
4420 sym_intent intent
, bool formal_ptr
)
4428 gfc_array_info
*info
;
4438 gfc_init_se (&lse
, NULL
);
4439 gfc_init_se (&rse
, NULL
);
4441 /* Walk the argument expression. */
4442 rss
= gfc_walk_expr (expr
);
4444 gcc_assert (rss
!= gfc_ss_terminator
);
4446 /* Initialize the scalarizer. */
4447 gfc_init_loopinfo (&loop
);
4448 gfc_add_ss_to_loop (&loop
, rss
);
4450 /* Calculate the bounds of the scalarization. */
4451 gfc_conv_ss_startstride (&loop
);
4453 /* Build an ss for the temporary. */
4454 if (expr
->ts
.type
== BT_CHARACTER
&& !expr
->ts
.u
.cl
->backend_decl
)
4455 gfc_conv_string_length (expr
->ts
.u
.cl
, expr
, &parmse
->pre
);
4457 base_type
= gfc_typenode_for_spec (&expr
->ts
);
4458 if (GFC_ARRAY_TYPE_P (base_type
)
4459 || GFC_DESCRIPTOR_TYPE_P (base_type
))
4460 base_type
= gfc_get_element_type (base_type
);
4462 if (expr
->ts
.type
== BT_CLASS
)
4463 base_type
= gfc_typenode_for_spec (&CLASS_DATA (expr
)->ts
);
4465 loop
.temp_ss
= gfc_get_temp_ss (base_type
, ((expr
->ts
.type
== BT_CHARACTER
)
4466 ? expr
->ts
.u
.cl
->backend_decl
4470 parmse
->string_length
= loop
.temp_ss
->info
->string_length
;
4472 /* Associate the SS with the loop. */
4473 gfc_add_ss_to_loop (&loop
, loop
.temp_ss
);
4475 /* Setup the scalarizing loops. */
4476 gfc_conv_loop_setup (&loop
, &expr
->where
);
4478 /* Pass the temporary descriptor back to the caller. */
4479 info
= &loop
.temp_ss
->info
->data
.array
;
4480 parmse
->expr
= info
->descriptor
;
4482 /* Setup the gfc_se structures. */
4483 gfc_copy_loopinfo_to_se (&lse
, &loop
);
4484 gfc_copy_loopinfo_to_se (&rse
, &loop
);
4487 lse
.ss
= loop
.temp_ss
;
4488 gfc_mark_ss_chain_used (rss
, 1);
4489 gfc_mark_ss_chain_used (loop
.temp_ss
, 1);
4491 /* Start the scalarized loop body. */
4492 gfc_start_scalarized_body (&loop
, &body
);
4494 /* Translate the expression. */
4495 gfc_conv_expr (&rse
, expr
);
4497 /* Reset the offset for the function call since the loop
4498 is zero based on the data pointer. Note that the temp
4499 comes first in the loop chain since it is added second. */
4500 if (gfc_is_class_array_function (expr
))
4502 tmp
= loop
.ss
->loop_chain
->info
->data
.array
.descriptor
;
4503 gfc_conv_descriptor_offset_set (&loop
.pre
, tmp
,
4504 gfc_index_zero_node
);
4507 gfc_conv_tmp_array_ref (&lse
);
4509 if (intent
!= INTENT_OUT
)
4511 tmp
= gfc_trans_scalar_assign (&lse
, &rse
, expr
->ts
, false, false);
4512 gfc_add_expr_to_block (&body
, tmp
);
4513 gcc_assert (rse
.ss
== gfc_ss_terminator
);
4514 gfc_trans_scalarizing_loops (&loop
, &body
);
4518 /* Make sure that the temporary declaration survives by merging
4519 all the loop declarations into the current context. */
4520 for (n
= 0; n
< loop
.dimen
; n
++)
4522 gfc_merge_block_scope (&body
);
4523 body
= loop
.code
[loop
.order
[n
]];
4525 gfc_merge_block_scope (&body
);
4528 /* Add the post block after the second loop, so that any
4529 freeing of allocated memory is done at the right time. */
4530 gfc_add_block_to_block (&parmse
->pre
, &loop
.pre
);
4532 /**********Copy the temporary back again.*********/
4534 gfc_init_se (&lse
, NULL
);
4535 gfc_init_se (&rse
, NULL
);
4537 /* Walk the argument expression. */
4538 lss
= gfc_walk_expr (expr
);
4539 rse
.ss
= loop
.temp_ss
;
4542 /* Initialize the scalarizer. */
4543 gfc_init_loopinfo (&loop2
);
4544 gfc_add_ss_to_loop (&loop2
, lss
);
4546 dimen
= rse
.ss
->dimen
;
4548 /* Skip the write-out loop for this case. */
4549 if (gfc_is_class_array_function (expr
))
4550 goto class_array_fcn
;
4552 /* Calculate the bounds of the scalarization. */
4553 gfc_conv_ss_startstride (&loop2
);
4555 /* Setup the scalarizing loops. */
4556 gfc_conv_loop_setup (&loop2
, &expr
->where
);
4558 gfc_copy_loopinfo_to_se (&lse
, &loop2
);
4559 gfc_copy_loopinfo_to_se (&rse
, &loop2
);
4561 gfc_mark_ss_chain_used (lss
, 1);
4562 gfc_mark_ss_chain_used (loop
.temp_ss
, 1);
4564 /* Declare the variable to hold the temporary offset and start the
4565 scalarized loop body. */
4566 offset
= gfc_create_var (gfc_array_index_type
, NULL
);
4567 gfc_start_scalarized_body (&loop2
, &body
);
4569 /* Build the offsets for the temporary from the loop variables. The
4570 temporary array has lbounds of zero and strides of one in all
4571 dimensions, so this is very simple. The offset is only computed
4572 outside the innermost loop, so the overall transfer could be
4573 optimized further. */
4574 info
= &rse
.ss
->info
->data
.array
;
4576 tmp_index
= gfc_index_zero_node
;
4577 for (n
= dimen
- 1; n
> 0; n
--)
4580 tmp
= rse
.loop
->loopvar
[n
];
4581 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, gfc_array_index_type
,
4582 tmp
, rse
.loop
->from
[n
]);
4583 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
, gfc_array_index_type
,
4586 tmp_str
= fold_build2_loc (input_location
, MINUS_EXPR
,
4587 gfc_array_index_type
,
4588 rse
.loop
->to
[n
-1], rse
.loop
->from
[n
-1]);
4589 tmp_str
= fold_build2_loc (input_location
, PLUS_EXPR
,
4590 gfc_array_index_type
,
4591 tmp_str
, gfc_index_one_node
);
4593 tmp_index
= fold_build2_loc (input_location
, MULT_EXPR
,
4594 gfc_array_index_type
, tmp
, tmp_str
);
4597 tmp_index
= fold_build2_loc (input_location
, MINUS_EXPR
,
4598 gfc_array_index_type
,
4599 tmp_index
, rse
.loop
->from
[0]);
4600 gfc_add_modify (&rse
.loop
->code
[0], offset
, tmp_index
);
4602 tmp_index
= fold_build2_loc (input_location
, PLUS_EXPR
,
4603 gfc_array_index_type
,
4604 rse
.loop
->loopvar
[0], offset
);
4606 /* Now use the offset for the reference. */
4607 tmp
= build_fold_indirect_ref_loc (input_location
,
4609 rse
.expr
= gfc_build_array_ref (tmp
, tmp_index
, NULL
);
4611 if (expr
->ts
.type
== BT_CHARACTER
)
4612 rse
.string_length
= expr
->ts
.u
.cl
->backend_decl
;
4614 gfc_conv_expr (&lse
, expr
);
4616 gcc_assert (lse
.ss
== gfc_ss_terminator
);
4618 tmp
= gfc_trans_scalar_assign (&lse
, &rse
, expr
->ts
, false, true);
4619 gfc_add_expr_to_block (&body
, tmp
);
4621 /* Generate the copying loops. */
4622 gfc_trans_scalarizing_loops (&loop2
, &body
);
4624 /* Wrap the whole thing up by adding the second loop to the post-block
4625 and following it by the post-block of the first loop. In this way,
4626 if the temporary needs freeing, it is done after use! */
4627 if (intent
!= INTENT_IN
)
4629 gfc_add_block_to_block (&parmse
->post
, &loop2
.pre
);
4630 gfc_add_block_to_block (&parmse
->post
, &loop2
.post
);
4635 gfc_add_block_to_block (&parmse
->post
, &loop
.post
);
4637 gfc_cleanup_loop (&loop
);
4638 gfc_cleanup_loop (&loop2
);
4640 /* Pass the string length to the argument expression. */
4641 if (expr
->ts
.type
== BT_CHARACTER
)
4642 parmse
->string_length
= expr
->ts
.u
.cl
->backend_decl
;
4644 /* Determine the offset for pointer formal arguments and set the
4648 size
= gfc_index_one_node
;
4649 offset
= gfc_index_zero_node
;
4650 for (n
= 0; n
< dimen
; n
++)
4652 tmp
= gfc_conv_descriptor_ubound_get (parmse
->expr
,
4654 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
,
4655 gfc_array_index_type
, tmp
,
4656 gfc_index_one_node
);
4657 gfc_conv_descriptor_ubound_set (&parmse
->pre
,
4661 gfc_conv_descriptor_lbound_set (&parmse
->pre
,
4664 gfc_index_one_node
);
4665 size
= gfc_evaluate_now (size
, &parmse
->pre
);
4666 offset
= fold_build2_loc (input_location
, MINUS_EXPR
,
4667 gfc_array_index_type
,
4669 offset
= gfc_evaluate_now (offset
, &parmse
->pre
);
4670 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
4671 gfc_array_index_type
,
4672 rse
.loop
->to
[n
], rse
.loop
->from
[n
]);
4673 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
,
4674 gfc_array_index_type
,
4675 tmp
, gfc_index_one_node
);
4676 size
= fold_build2_loc (input_location
, MULT_EXPR
,
4677 gfc_array_index_type
, size
, tmp
);
4680 gfc_conv_descriptor_offset_set (&parmse
->pre
, parmse
->expr
,
4684 /* We want either the address for the data or the address of the descriptor,
4685 depending on the mode of passing array arguments. */
4687 parmse
->expr
= gfc_conv_descriptor_data_get (parmse
->expr
);
4689 parmse
->expr
= gfc_build_addr_expr (NULL_TREE
, parmse
->expr
);
4695 /* Generate the code for argument list functions. */
4698 conv_arglist_function (gfc_se
*se
, gfc_expr
*expr
, const char *name
)
4700 /* Pass by value for g77 %VAL(arg), pass the address
4701 indirectly for %LOC, else by reference. Thus %REF
4702 is a "do-nothing" and %LOC is the same as an F95
4704 if (strncmp (name
, "%VAL", 4) == 0)
4705 gfc_conv_expr (se
, expr
);
4706 else if (strncmp (name
, "%LOC", 4) == 0)
4708 gfc_conv_expr_reference (se
, expr
);
4709 se
->expr
= gfc_build_addr_expr (NULL
, se
->expr
);
4711 else if (strncmp (name
, "%REF", 4) == 0)
4712 gfc_conv_expr_reference (se
, expr
);
4714 gfc_error ("Unknown argument list function at %L", &expr
->where
);
4718 /* This function tells whether the middle-end representation of the expression
4719 E given as input may point to data otherwise accessible through a variable
4721 It is assumed that the only expressions that may alias are variables,
4722 and array constructors if ARRAY_MAY_ALIAS is true and some of its elements
4724 This function is used to decide whether freeing an expression's allocatable
4725 components is safe or should be avoided.
4727 If ARRAY_MAY_ALIAS is true, an array constructor may alias if some of
4728 its elements are copied from a variable. This ARRAY_MAY_ALIAS trick
4729 is necessary because for array constructors, aliasing depends on how
4731 - If E is an array constructor used as argument to an elemental procedure,
4732 the array, which is generated through shallow copy by the scalarizer,
4733 is used directly and can alias the expressions it was copied from.
4734 - If E is an array constructor used as argument to a non-elemental
4735 procedure,the scalarizer is used in gfc_conv_expr_descriptor to generate
4736 the array as in the previous case, but then that array is used
4737 to initialize a new descriptor through deep copy. There is no alias
4738 possible in that case.
4739 Thus, the ARRAY_MAY_ALIAS flag is necessary to distinguish the two cases
4743 expr_may_alias_variables (gfc_expr
*e
, bool array_may_alias
)
4747 if (e
->expr_type
== EXPR_VARIABLE
)
4749 else if (e
->expr_type
== EXPR_FUNCTION
)
4751 gfc_symbol
*proc_ifc
= gfc_get_proc_ifc_for_expr (e
);
4753 if (proc_ifc
->result
!= NULL
4754 && ((proc_ifc
->result
->ts
.type
== BT_CLASS
4755 && proc_ifc
->result
->ts
.u
.derived
->attr
.is_class
4756 && CLASS_DATA (proc_ifc
->result
)->attr
.class_pointer
)
4757 || proc_ifc
->result
->attr
.pointer
))
4762 else if (e
->expr_type
!= EXPR_ARRAY
|| !array_may_alias
)
4765 for (c
= gfc_constructor_first (e
->value
.constructor
);
4766 c
; c
= gfc_constructor_next (c
))
4768 && expr_may_alias_variables (c
->expr
, array_may_alias
))
4775 /* Generate code for a procedure call. Note can return se->post != NULL.
4776 If se->direct_byref is set then se->expr contains the return parameter.
4777 Return nonzero, if the call has alternate specifiers.
4778 'expr' is only needed for procedure pointer components. */
4781 gfc_conv_procedure_call (gfc_se
* se
, gfc_symbol
* sym
,
4782 gfc_actual_arglist
* args
, gfc_expr
* expr
,
4783 vec
<tree
, va_gc
> *append_args
)
4785 gfc_interface_mapping mapping
;
4786 vec
<tree
, va_gc
> *arglist
;
4787 vec
<tree
, va_gc
> *retargs
;
4791 gfc_array_info
*info
;
4798 vec
<tree
, va_gc
> *stringargs
;
4799 vec
<tree
, va_gc
> *optionalargs
;
4801 gfc_formal_arglist
*formal
;
4802 gfc_actual_arglist
*arg
;
4803 int has_alternate_specifier
= 0;
4804 bool need_interface_mapping
;
4812 enum {MISSING
= 0, ELEMENTAL
, SCALAR
, SCALAR_POINTER
, ARRAY
};
4813 gfc_component
*comp
= NULL
;
4820 optionalargs
= NULL
;
4825 comp
= gfc_get_proc_ptr_comp (expr
);
4827 bool elemental_proc
= (comp
4828 && comp
->ts
.interface
4829 && comp
->ts
.interface
->attr
.elemental
)
4830 || (comp
&& comp
->attr
.elemental
)
4831 || sym
->attr
.elemental
;
4835 if (!elemental_proc
)
4837 gcc_assert (se
->ss
->info
->type
== GFC_SS_FUNCTION
);
4838 if (se
->ss
->info
->useflags
)
4840 gcc_assert ((!comp
&& gfc_return_by_reference (sym
)
4841 && sym
->result
->attr
.dimension
)
4842 || (comp
&& comp
->attr
.dimension
)
4843 || gfc_is_class_array_function (expr
));
4844 gcc_assert (se
->loop
!= NULL
);
4845 /* Access the previously obtained result. */
4846 gfc_conv_tmp_array_ref (se
);
4850 info
= &se
->ss
->info
->data
.array
;
4855 gfc_init_block (&post
);
4856 gfc_init_interface_mapping (&mapping
);
4859 formal
= gfc_sym_get_dummy_args (sym
);
4860 need_interface_mapping
= sym
->attr
.dimension
||
4861 (sym
->ts
.type
== BT_CHARACTER
4862 && sym
->ts
.u
.cl
->length
4863 && sym
->ts
.u
.cl
->length
->expr_type
4868 formal
= comp
->ts
.interface
? comp
->ts
.interface
->formal
: NULL
;
4869 need_interface_mapping
= comp
->attr
.dimension
||
4870 (comp
->ts
.type
== BT_CHARACTER
4871 && comp
->ts
.u
.cl
->length
4872 && comp
->ts
.u
.cl
->length
->expr_type
4876 base_object
= NULL_TREE
;
4877 /* For _vprt->_copy () routines no formal symbol is present. Nevertheless
4878 is the third and fourth argument to such a function call a value
4879 denoting the number of elements to copy (i.e., most of the time the
4880 length of a deferred length string). */
4881 ulim_copy
= (formal
== NULL
)
4882 && UNLIMITED_POLY (sym
)
4883 && comp
&& (strcmp ("_copy", comp
->name
) == 0);
4885 /* Evaluate the arguments. */
4886 for (arg
= args
, argc
= 0; arg
!= NULL
;
4887 arg
= arg
->next
, formal
= formal
? formal
->next
: NULL
, ++argc
)
4890 fsym
= formal
? formal
->sym
: NULL
;
4891 parm_kind
= MISSING
;
4893 /* If the procedure requires an explicit interface, the actual
4894 argument is passed according to the corresponding formal
4895 argument. If the corresponding formal argument is a POINTER,
4896 ALLOCATABLE or assumed shape, we do not use g77's calling
4897 convention, and pass the address of the array descriptor
4898 instead. Otherwise we use g77's calling convention, in other words
4899 pass the array data pointer without descriptor. */
4900 bool nodesc_arg
= fsym
!= NULL
4901 && !(fsym
->attr
.pointer
|| fsym
->attr
.allocatable
)
4903 && fsym
->as
->type
!= AS_ASSUMED_SHAPE
4904 && fsym
->as
->type
!= AS_ASSUMED_RANK
;
4906 nodesc_arg
= nodesc_arg
|| !comp
->attr
.always_explicit
;
4908 nodesc_arg
= nodesc_arg
|| !sym
->attr
.always_explicit
;
4910 /* Class array expressions are sometimes coming completely unadorned
4911 with either arrayspec or _data component. Correct that here.
4912 OOP-TODO: Move this to the frontend. */
4913 if (e
&& e
->expr_type
== EXPR_VARIABLE
4915 && e
->ts
.type
== BT_CLASS
4916 && (CLASS_DATA (e
)->attr
.codimension
4917 || CLASS_DATA (e
)->attr
.dimension
))
4919 gfc_typespec temp_ts
= e
->ts
;
4920 gfc_add_class_array_ref (e
);
4926 if (se
->ignore_optional
)
4928 /* Some intrinsics have already been resolved to the correct
4932 else if (arg
->label
)
4934 has_alternate_specifier
= 1;
4939 gfc_init_se (&parmse
, NULL
);
4941 /* For scalar arguments with VALUE attribute which are passed by
4942 value, pass "0" and a hidden argument gives the optional
4944 if (fsym
&& fsym
->attr
.optional
&& fsym
->attr
.value
4945 && !fsym
->attr
.dimension
&& fsym
->ts
.type
!= BT_CHARACTER
4946 && fsym
->ts
.type
!= BT_CLASS
&& fsym
->ts
.type
!= BT_DERIVED
)
4948 parmse
.expr
= fold_convert (gfc_sym_type (fsym
),
4950 vec_safe_push (optionalargs
, boolean_false_node
);
4954 /* Pass a NULL pointer for an absent arg. */
4955 parmse
.expr
= null_pointer_node
;
4956 if (arg
->missing_arg_type
== BT_CHARACTER
)
4957 parmse
.string_length
= build_int_cst (gfc_charlen_type_node
,
4962 else if (arg
->expr
->expr_type
== EXPR_NULL
4963 && fsym
&& !fsym
->attr
.pointer
4964 && (fsym
->ts
.type
!= BT_CLASS
4965 || !CLASS_DATA (fsym
)->attr
.class_pointer
))
4967 /* Pass a NULL pointer to denote an absent arg. */
4968 gcc_assert (fsym
->attr
.optional
&& !fsym
->attr
.allocatable
4969 && (fsym
->ts
.type
!= BT_CLASS
4970 || !CLASS_DATA (fsym
)->attr
.allocatable
));
4971 gfc_init_se (&parmse
, NULL
);
4972 parmse
.expr
= null_pointer_node
;
4973 if (arg
->missing_arg_type
== BT_CHARACTER
)
4974 parmse
.string_length
= build_int_cst (gfc_charlen_type_node
, 0);
4976 else if (fsym
&& fsym
->ts
.type
== BT_CLASS
4977 && e
->ts
.type
== BT_DERIVED
)
4979 /* The derived type needs to be converted to a temporary
4981 gfc_init_se (&parmse
, se
);
4982 gfc_conv_derived_to_class (&parmse
, e
, fsym
->ts
, NULL
,
4984 && e
->expr_type
== EXPR_VARIABLE
4985 && e
->symtree
->n
.sym
->attr
.optional
,
4986 CLASS_DATA (fsym
)->attr
.class_pointer
4987 || CLASS_DATA (fsym
)->attr
.allocatable
);
4989 else if (UNLIMITED_POLY (fsym
) && e
->ts
.type
!= BT_CLASS
)
4991 /* The intrinsic type needs to be converted to a temporary
4992 CLASS object for the unlimited polymorphic formal. */
4993 gfc_init_se (&parmse
, se
);
4994 gfc_conv_intrinsic_to_class (&parmse
, e
, fsym
->ts
);
4996 else if (se
->ss
&& se
->ss
->info
->useflags
)
5002 /* An elemental function inside a scalarized loop. */
5003 gfc_init_se (&parmse
, se
);
5004 parm_kind
= ELEMENTAL
;
5006 /* When no fsym is present, ulim_copy is set and this is a third or
5007 fourth argument, use call-by-value instead of by reference to
5008 hand the length properties to the copy routine (i.e., most of the
5009 time this will be a call to a __copy_character_* routine where the
5010 third and fourth arguments are the lengths of a deferred length
5012 if ((fsym
&& fsym
->attr
.value
)
5013 || (ulim_copy
&& (argc
== 2 || argc
== 3)))
5014 gfc_conv_expr (&parmse
, e
);
5016 gfc_conv_expr_reference (&parmse
, e
);
5018 if (e
->ts
.type
== BT_CHARACTER
&& !e
->rank
5019 && e
->expr_type
== EXPR_FUNCTION
)
5020 parmse
.expr
= build_fold_indirect_ref_loc (input_location
,
5023 if (fsym
&& fsym
->ts
.type
== BT_DERIVED
5024 && gfc_is_class_container_ref (e
))
5026 parmse
.expr
= gfc_class_data_get (parmse
.expr
);
5028 if (fsym
->attr
.optional
&& e
->expr_type
== EXPR_VARIABLE
5029 && e
->symtree
->n
.sym
->attr
.optional
)
5031 tree cond
= gfc_conv_expr_present (e
->symtree
->n
.sym
);
5032 parmse
.expr
= build3_loc (input_location
, COND_EXPR
,
5033 TREE_TYPE (parmse
.expr
),
5035 fold_convert (TREE_TYPE (parmse
.expr
),
5036 null_pointer_node
));
5040 /* If we are passing an absent array as optional dummy to an
5041 elemental procedure, make sure that we pass NULL when the data
5042 pointer is NULL. We need this extra conditional because of
5043 scalarization which passes arrays elements to the procedure,
5044 ignoring the fact that the array can be absent/unallocated/... */
5045 if (ss
->info
->can_be_null_ref
&& ss
->info
->type
!= GFC_SS_REFERENCE
)
5047 tree descriptor_data
;
5049 descriptor_data
= ss
->info
->data
.array
.data
;
5050 tmp
= fold_build2_loc (input_location
, EQ_EXPR
, logical_type_node
,
5052 fold_convert (TREE_TYPE (descriptor_data
),
5053 null_pointer_node
));
5055 = fold_build3_loc (input_location
, COND_EXPR
,
5056 TREE_TYPE (parmse
.expr
),
5057 gfc_unlikely (tmp
, PRED_FORTRAN_ABSENT_DUMMY
),
5058 fold_convert (TREE_TYPE (parmse
.expr
),
5063 /* The scalarizer does not repackage the reference to a class
5064 array - instead it returns a pointer to the data element. */
5065 if (fsym
&& fsym
->ts
.type
== BT_CLASS
&& e
->ts
.type
== BT_CLASS
)
5066 gfc_conv_class_to_class (&parmse
, e
, fsym
->ts
, true,
5067 fsym
->attr
.intent
!= INTENT_IN
5068 && (CLASS_DATA (fsym
)->attr
.class_pointer
5069 || CLASS_DATA (fsym
)->attr
.allocatable
),
5071 && e
->expr_type
== EXPR_VARIABLE
5072 && e
->symtree
->n
.sym
->attr
.optional
,
5073 CLASS_DATA (fsym
)->attr
.class_pointer
5074 || CLASS_DATA (fsym
)->attr
.allocatable
);
5081 gfc_init_se (&parmse
, NULL
);
5083 /* Check whether the expression is a scalar or not; we cannot use
5084 e->rank as it can be nonzero for functions arguments. */
5085 argss
= gfc_walk_expr (e
);
5086 scalar
= argss
== gfc_ss_terminator
;
5088 gfc_free_ss_chain (argss
);
5090 /* Special handling for passing scalar polymorphic coarrays;
5091 otherwise one passes "class->_data.data" instead of "&class". */
5092 if (e
->rank
== 0 && e
->ts
.type
== BT_CLASS
5093 && fsym
&& fsym
->ts
.type
== BT_CLASS
5094 && CLASS_DATA (fsym
)->attr
.codimension
5095 && !CLASS_DATA (fsym
)->attr
.dimension
)
5097 gfc_add_class_array_ref (e
);
5098 parmse
.want_coarray
= 1;
5102 /* A scalar or transformational function. */
5105 if (e
->expr_type
== EXPR_VARIABLE
5106 && e
->symtree
->n
.sym
->attr
.cray_pointee
5107 && fsym
&& fsym
->attr
.flavor
== FL_PROCEDURE
)
5109 /* The Cray pointer needs to be converted to a pointer to
5110 a type given by the expression. */
5111 gfc_conv_expr (&parmse
, e
);
5112 type
= build_pointer_type (TREE_TYPE (parmse
.expr
));
5113 tmp
= gfc_get_symbol_decl (e
->symtree
->n
.sym
->cp_pointer
);
5114 parmse
.expr
= convert (type
, tmp
);
5116 else if (fsym
&& fsym
->attr
.value
)
5118 if (fsym
->ts
.type
== BT_CHARACTER
5119 && fsym
->ts
.is_c_interop
5120 && fsym
->ns
->proc_name
!= NULL
5121 && fsym
->ns
->proc_name
->attr
.is_bind_c
)
5124 gfc_conv_scalar_char_value (fsym
, &parmse
, &e
);
5125 if (parmse
.expr
== NULL
)
5126 gfc_conv_expr (&parmse
, e
);
5130 gfc_conv_expr (&parmse
, e
);
5131 if (fsym
->attr
.optional
5132 && fsym
->ts
.type
!= BT_CLASS
5133 && fsym
->ts
.type
!= BT_DERIVED
)
5135 if (e
->expr_type
!= EXPR_VARIABLE
5136 || !e
->symtree
->n
.sym
->attr
.optional
5138 vec_safe_push (optionalargs
, boolean_true_node
);
5141 tmp
= gfc_conv_expr_present (e
->symtree
->n
.sym
);
5142 if (!e
->symtree
->n
.sym
->attr
.value
)
5144 = fold_build3_loc (input_location
, COND_EXPR
,
5145 TREE_TYPE (parmse
.expr
),
5147 fold_convert (TREE_TYPE (parmse
.expr
),
5148 integer_zero_node
));
5150 vec_safe_push (optionalargs
, tmp
);
5155 else if (arg
->name
&& arg
->name
[0] == '%')
5156 /* Argument list functions %VAL, %LOC and %REF are signalled
5157 through arg->name. */
5158 conv_arglist_function (&parmse
, arg
->expr
, arg
->name
);
5159 else if ((e
->expr_type
== EXPR_FUNCTION
)
5160 && ((e
->value
.function
.esym
5161 && e
->value
.function
.esym
->result
->attr
.pointer
)
5162 || (!e
->value
.function
.esym
5163 && e
->symtree
->n
.sym
->attr
.pointer
))
5164 && fsym
&& fsym
->attr
.target
)
5166 gfc_conv_expr (&parmse
, e
);
5167 parmse
.expr
= gfc_build_addr_expr (NULL_TREE
, parmse
.expr
);
5169 else if (e
->expr_type
== EXPR_FUNCTION
5170 && e
->symtree
->n
.sym
->result
5171 && e
->symtree
->n
.sym
->result
!= e
->symtree
->n
.sym
5172 && e
->symtree
->n
.sym
->result
->attr
.proc_pointer
)
5174 /* Functions returning procedure pointers. */
5175 gfc_conv_expr (&parmse
, e
);
5176 if (fsym
&& fsym
->attr
.proc_pointer
)
5177 parmse
.expr
= gfc_build_addr_expr (NULL_TREE
, parmse
.expr
);
5181 if (e
->ts
.type
== BT_CLASS
&& fsym
5182 && fsym
->ts
.type
== BT_CLASS
5183 && (!CLASS_DATA (fsym
)->as
5184 || CLASS_DATA (fsym
)->as
->type
!= AS_ASSUMED_RANK
)
5185 && CLASS_DATA (e
)->attr
.codimension
)
5187 gcc_assert (!CLASS_DATA (fsym
)->attr
.codimension
);
5188 gcc_assert (!CLASS_DATA (fsym
)->as
);
5189 gfc_add_class_array_ref (e
);
5190 parmse
.want_coarray
= 1;
5191 gfc_conv_expr_reference (&parmse
, e
);
5192 class_scalar_coarray_to_class (&parmse
, e
, fsym
->ts
,
5194 && e
->expr_type
== EXPR_VARIABLE
);
5196 else if (e
->ts
.type
== BT_CLASS
&& fsym
5197 && fsym
->ts
.type
== BT_CLASS
5198 && !CLASS_DATA (fsym
)->as
5199 && !CLASS_DATA (e
)->as
5200 && strcmp (fsym
->ts
.u
.derived
->name
,
5201 e
->ts
.u
.derived
->name
))
5203 type
= gfc_typenode_for_spec (&fsym
->ts
);
5204 var
= gfc_create_var (type
, fsym
->name
);
5205 gfc_conv_expr (&parmse
, e
);
5206 if (fsym
->attr
.optional
5207 && e
->expr_type
== EXPR_VARIABLE
5208 && e
->symtree
->n
.sym
->attr
.optional
)
5212 tmp
= gfc_build_addr_expr (NULL_TREE
, parmse
.expr
);
5213 cond
= fold_build2_loc (input_location
, NE_EXPR
,
5214 logical_type_node
, tmp
,
5215 fold_convert (TREE_TYPE (tmp
),
5216 null_pointer_node
));
5217 gfc_start_block (&block
);
5218 gfc_add_modify (&block
, var
,
5219 fold_build1_loc (input_location
,
5221 type
, parmse
.expr
));
5222 gfc_add_expr_to_block (&parmse
.pre
,
5223 fold_build3_loc (input_location
,
5224 COND_EXPR
, void_type_node
,
5225 cond
, gfc_finish_block (&block
),
5226 build_empty_stmt (input_location
)));
5227 parmse
.expr
= gfc_build_addr_expr (NULL_TREE
, var
);
5228 parmse
.expr
= build3_loc (input_location
, COND_EXPR
,
5229 TREE_TYPE (parmse
.expr
),
5231 fold_convert (TREE_TYPE (parmse
.expr
),
5232 null_pointer_node
));
5236 /* Since the internal representation of unlimited
5237 polymorphic expressions includes an extra field
5238 that other class objects do not, a cast to the
5239 formal type does not work. */
5240 if (!UNLIMITED_POLY (e
) && UNLIMITED_POLY (fsym
))
5244 /* Set the _data field. */
5245 tmp
= gfc_class_data_get (var
);
5246 efield
= fold_convert (TREE_TYPE (tmp
),
5247 gfc_class_data_get (parmse
.expr
));
5248 gfc_add_modify (&parmse
.pre
, tmp
, efield
);
5250 /* Set the _vptr field. */
5251 tmp
= gfc_class_vptr_get (var
);
5252 efield
= fold_convert (TREE_TYPE (tmp
),
5253 gfc_class_vptr_get (parmse
.expr
));
5254 gfc_add_modify (&parmse
.pre
, tmp
, efield
);
5256 /* Set the _len field. */
5257 tmp
= gfc_class_len_get (var
);
5258 gfc_add_modify (&parmse
.pre
, tmp
,
5259 build_int_cst (TREE_TYPE (tmp
), 0));
5263 tmp
= fold_build1_loc (input_location
,
5266 gfc_add_modify (&parmse
.pre
, var
, tmp
);
5269 parmse
.expr
= gfc_build_addr_expr (NULL_TREE
, var
);
5273 gfc_conv_expr_reference (&parmse
, e
);
5275 /* Catch base objects that are not variables. */
5276 if (e
->ts
.type
== BT_CLASS
5277 && e
->expr_type
!= EXPR_VARIABLE
5278 && expr
&& e
== expr
->base_expr
)
5279 base_object
= build_fold_indirect_ref_loc (input_location
,
5282 /* A class array element needs converting back to be a
5283 class object, if the formal argument is a class object. */
5284 if (fsym
&& fsym
->ts
.type
== BT_CLASS
5285 && e
->ts
.type
== BT_CLASS
5286 && ((CLASS_DATA (fsym
)->as
5287 && CLASS_DATA (fsym
)->as
->type
== AS_ASSUMED_RANK
)
5288 || CLASS_DATA (e
)->attr
.dimension
))
5289 gfc_conv_class_to_class (&parmse
, e
, fsym
->ts
, false,
5290 fsym
->attr
.intent
!= INTENT_IN
5291 && (CLASS_DATA (fsym
)->attr
.class_pointer
5292 || CLASS_DATA (fsym
)->attr
.allocatable
),
5294 && e
->expr_type
== EXPR_VARIABLE
5295 && e
->symtree
->n
.sym
->attr
.optional
,
5296 CLASS_DATA (fsym
)->attr
.class_pointer
5297 || CLASS_DATA (fsym
)->attr
.allocatable
);
5299 /* If an ALLOCATABLE dummy argument has INTENT(OUT) and is
5300 allocated on entry, it must be deallocated. */
5301 if (fsym
&& fsym
->attr
.intent
== INTENT_OUT
5302 && (fsym
->attr
.allocatable
5303 || (fsym
->ts
.type
== BT_CLASS
5304 && CLASS_DATA (fsym
)->attr
.allocatable
)))
5309 gfc_init_block (&block
);
5311 if (e
->ts
.type
== BT_CLASS
)
5312 ptr
= gfc_class_data_get (ptr
);
5314 tmp
= gfc_deallocate_scalar_with_status (ptr
, NULL_TREE
,
5317 gfc_add_expr_to_block (&block
, tmp
);
5318 tmp
= fold_build2_loc (input_location
, MODIFY_EXPR
,
5319 void_type_node
, ptr
,
5321 gfc_add_expr_to_block (&block
, tmp
);
5323 if (fsym
->ts
.type
== BT_CLASS
&& UNLIMITED_POLY (fsym
))
5325 gfc_add_modify (&block
, ptr
,
5326 fold_convert (TREE_TYPE (ptr
),
5327 null_pointer_node
));
5328 gfc_add_expr_to_block (&block
, tmp
);
5330 else if (fsym
->ts
.type
== BT_CLASS
)
5333 vtab
= gfc_find_derived_vtab (fsym
->ts
.u
.derived
);
5334 tmp
= gfc_get_symbol_decl (vtab
);
5335 tmp
= gfc_build_addr_expr (NULL_TREE
, tmp
);
5336 ptr
= gfc_class_vptr_get (parmse
.expr
);
5337 gfc_add_modify (&block
, ptr
,
5338 fold_convert (TREE_TYPE (ptr
), tmp
));
5339 gfc_add_expr_to_block (&block
, tmp
);
5342 if (fsym
->attr
.optional
5343 && e
->expr_type
== EXPR_VARIABLE
5344 && e
->symtree
->n
.sym
->attr
.optional
)
5346 tmp
= fold_build3_loc (input_location
, COND_EXPR
,
5348 gfc_conv_expr_present (e
->symtree
->n
.sym
),
5349 gfc_finish_block (&block
),
5350 build_empty_stmt (input_location
));
5353 tmp
= gfc_finish_block (&block
);
5355 gfc_add_expr_to_block (&se
->pre
, tmp
);
5358 if (fsym
&& (fsym
->ts
.type
== BT_DERIVED
5359 || fsym
->ts
.type
== BT_ASSUMED
)
5360 && e
->ts
.type
== BT_CLASS
5361 && !CLASS_DATA (e
)->attr
.dimension
5362 && !CLASS_DATA (e
)->attr
.codimension
)
5363 parmse
.expr
= gfc_class_data_get (parmse
.expr
);
5365 /* Wrap scalar variable in a descriptor. We need to convert
5366 the address of a pointer back to the pointer itself before,
5367 we can assign it to the data field. */
5369 if (fsym
&& fsym
->as
&& fsym
->as
->type
== AS_ASSUMED_RANK
5370 && fsym
->ts
.type
!= BT_CLASS
&& e
->expr_type
!= EXPR_NULL
)
5373 if (TREE_CODE (tmp
) == ADDR_EXPR
)
5374 tmp
= build_fold_indirect_ref_loc (input_location
, tmp
);
5375 parmse
.expr
= gfc_conv_scalar_to_descriptor (&parmse
, tmp
,
5377 parmse
.expr
= gfc_build_addr_expr (NULL_TREE
,
5380 else if (fsym
&& e
->expr_type
!= EXPR_NULL
5381 && ((fsym
->attr
.pointer
5382 && fsym
->attr
.flavor
!= FL_PROCEDURE
)
5383 || (fsym
->attr
.proc_pointer
5384 && !(e
->expr_type
== EXPR_VARIABLE
5385 && e
->symtree
->n
.sym
->attr
.dummy
))
5386 || (fsym
->attr
.proc_pointer
5387 && e
->expr_type
== EXPR_VARIABLE
5388 && gfc_is_proc_ptr_comp (e
))
5389 || (fsym
->attr
.allocatable
5390 && fsym
->attr
.flavor
!= FL_PROCEDURE
)))
5392 /* Scalar pointer dummy args require an extra level of
5393 indirection. The null pointer already contains
5394 this level of indirection. */
5395 parm_kind
= SCALAR_POINTER
;
5396 parmse
.expr
= gfc_build_addr_expr (NULL_TREE
, parmse
.expr
);
5400 else if (e
->ts
.type
== BT_CLASS
5401 && fsym
&& fsym
->ts
.type
== BT_CLASS
5402 && (CLASS_DATA (fsym
)->attr
.dimension
5403 || CLASS_DATA (fsym
)->attr
.codimension
))
5405 /* Pass a class array. */
5406 parmse
.use_offset
= 1;
5407 gfc_conv_expr_descriptor (&parmse
, e
);
5409 /* If an ALLOCATABLE dummy argument has INTENT(OUT) and is
5410 allocated on entry, it must be deallocated. */
5411 if (fsym
->attr
.intent
== INTENT_OUT
5412 && CLASS_DATA (fsym
)->attr
.allocatable
)
5417 gfc_init_block (&block
);
5419 ptr
= gfc_class_data_get (ptr
);
5421 tmp
= gfc_deallocate_with_status (ptr
, NULL_TREE
,
5422 NULL_TREE
, NULL_TREE
,
5424 GFC_CAF_COARRAY_NOCOARRAY
);
5425 gfc_add_expr_to_block (&block
, tmp
);
5426 tmp
= fold_build2_loc (input_location
, MODIFY_EXPR
,
5427 void_type_node
, ptr
,
5429 gfc_add_expr_to_block (&block
, tmp
);
5430 gfc_reset_vptr (&block
, e
);
5432 if (fsym
->attr
.optional
5433 && e
->expr_type
== EXPR_VARIABLE
5435 || (e
->ref
->type
== REF_ARRAY
5436 && e
->ref
->u
.ar
.type
!= AR_FULL
))
5437 && e
->symtree
->n
.sym
->attr
.optional
)
5439 tmp
= fold_build3_loc (input_location
, COND_EXPR
,
5441 gfc_conv_expr_present (e
->symtree
->n
.sym
),
5442 gfc_finish_block (&block
),
5443 build_empty_stmt (input_location
));
5446 tmp
= gfc_finish_block (&block
);
5448 gfc_add_expr_to_block (&se
->pre
, tmp
);
5451 /* The conversion does not repackage the reference to a class
5452 array - _data descriptor. */
5453 gfc_conv_class_to_class (&parmse
, e
, fsym
->ts
, false,
5454 fsym
->attr
.intent
!= INTENT_IN
5455 && (CLASS_DATA (fsym
)->attr
.class_pointer
5456 || CLASS_DATA (fsym
)->attr
.allocatable
),
5458 && e
->expr_type
== EXPR_VARIABLE
5459 && e
->symtree
->n
.sym
->attr
.optional
,
5460 CLASS_DATA (fsym
)->attr
.class_pointer
5461 || CLASS_DATA (fsym
)->attr
.allocatable
);
5465 /* If the argument is a function call that may not create
5466 a temporary for the result, we have to check that we
5467 can do it, i.e. that there is no alias between this
5468 argument and another one. */
5469 if (gfc_get_noncopying_intrinsic_argument (e
) != NULL
)
5475 intent
= fsym
->attr
.intent
;
5477 intent
= INTENT_UNKNOWN
;
5479 if (gfc_check_fncall_dependency (e
, intent
, sym
, args
,
5481 parmse
.force_tmp
= 1;
5483 iarg
= e
->value
.function
.actual
->expr
;
5485 /* Temporary needed if aliasing due to host association. */
5486 if (sym
->attr
.contained
5488 && !sym
->attr
.implicit_pure
5489 && !sym
->attr
.use_assoc
5490 && iarg
->expr_type
== EXPR_VARIABLE
5491 && sym
->ns
== iarg
->symtree
->n
.sym
->ns
)
5492 parmse
.force_tmp
= 1;
5494 /* Ditto within module. */
5495 if (sym
->attr
.use_assoc
5497 && !sym
->attr
.implicit_pure
5498 && iarg
->expr_type
== EXPR_VARIABLE
5499 && sym
->module
== iarg
->symtree
->n
.sym
->module
)
5500 parmse
.force_tmp
= 1;
5503 if (e
->expr_type
== EXPR_VARIABLE
5504 && is_subref_array (e
)
5505 && !(fsym
&& fsym
->attr
.pointer
))
5506 /* The actual argument is a component reference to an
5507 array of derived types. In this case, the argument
5508 is converted to a temporary, which is passed and then
5509 written back after the procedure call. */
5510 gfc_conv_subref_array_arg (&parmse
, e
, nodesc_arg
,
5511 fsym
? fsym
->attr
.intent
: INTENT_INOUT
,
5512 fsym
&& fsym
->attr
.pointer
);
5513 else if (gfc_is_class_array_ref (e
, NULL
)
5514 && fsym
&& fsym
->ts
.type
== BT_DERIVED
)
5515 /* The actual argument is a component reference to an
5516 array of derived types. In this case, the argument
5517 is converted to a temporary, which is passed and then
5518 written back after the procedure call.
5519 OOP-TODO: Insert code so that if the dynamic type is
5520 the same as the declared type, copy-in/copy-out does
5522 gfc_conv_subref_array_arg (&parmse
, e
, nodesc_arg
,
5523 fsym
? fsym
->attr
.intent
: INTENT_INOUT
,
5524 fsym
&& fsym
->attr
.pointer
);
5526 else if (gfc_is_class_array_function (e
)
5527 && fsym
&& fsym
->ts
.type
== BT_DERIVED
)
5528 /* See previous comment. For function actual argument,
5529 the write out is not needed so the intent is set as
5532 e
->must_finalize
= 1;
5533 gfc_conv_subref_array_arg (&parmse
, e
, nodesc_arg
,
5535 fsym
&& fsym
->attr
.pointer
);
5538 gfc_conv_array_parameter (&parmse
, e
, nodesc_arg
, fsym
,
5541 /* If an ALLOCATABLE dummy argument has INTENT(OUT) and is
5542 allocated on entry, it must be deallocated. */
5543 if (fsym
&& fsym
->attr
.allocatable
5544 && fsym
->attr
.intent
== INTENT_OUT
)
5546 if (fsym
->ts
.type
== BT_DERIVED
5547 && fsym
->ts
.u
.derived
->attr
.alloc_comp
)
5549 // deallocate the components first
5550 tmp
= gfc_deallocate_alloc_comp (fsym
->ts
.u
.derived
,
5551 parmse
.expr
, e
->rank
);
5552 if (tmp
!= NULL_TREE
)
5553 gfc_add_expr_to_block (&se
->pre
, tmp
);
5556 tmp
= build_fold_indirect_ref_loc (input_location
,
5558 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (tmp
)))
5559 tmp
= gfc_conv_descriptor_data_get (tmp
);
5560 tmp
= gfc_deallocate_with_status (tmp
, NULL_TREE
, NULL_TREE
,
5561 NULL_TREE
, NULL_TREE
, true,
5563 GFC_CAF_COARRAY_NOCOARRAY
);
5564 if (fsym
->attr
.optional
5565 && e
->expr_type
== EXPR_VARIABLE
5566 && e
->symtree
->n
.sym
->attr
.optional
)
5567 tmp
= fold_build3_loc (input_location
, COND_EXPR
,
5569 gfc_conv_expr_present (e
->symtree
->n
.sym
),
5570 tmp
, build_empty_stmt (input_location
));
5571 gfc_add_expr_to_block (&se
->pre
, tmp
);
5576 /* The case with fsym->attr.optional is that of a user subroutine
5577 with an interface indicating an optional argument. When we call
5578 an intrinsic subroutine, however, fsym is NULL, but we might still
5579 have an optional argument, so we proceed to the substitution
5581 if (e
&& (fsym
== NULL
|| fsym
->attr
.optional
))
5583 /* If an optional argument is itself an optional dummy argument,
5584 check its presence and substitute a null if absent. This is
5585 only needed when passing an array to an elemental procedure
5586 as then array elements are accessed - or no NULL pointer is
5587 allowed and a "1" or "0" should be passed if not present.
5588 When passing a non-array-descriptor full array to a
5589 non-array-descriptor dummy, no check is needed. For
5590 array-descriptor actual to array-descriptor dummy, see
5591 PR 41911 for why a check has to be inserted.
5592 fsym == NULL is checked as intrinsics required the descriptor
5593 but do not always set fsym. */
5594 if (e
->expr_type
== EXPR_VARIABLE
5595 && e
->symtree
->n
.sym
->attr
.optional
5596 && ((e
->rank
!= 0 && elemental_proc
)
5597 || e
->representation
.length
|| e
->ts
.type
== BT_CHARACTER
5601 && (fsym
->as
->type
== AS_ASSUMED_SHAPE
5602 || fsym
->as
->type
== AS_ASSUMED_RANK
5603 || fsym
->as
->type
== AS_DEFERRED
))))))
5604 gfc_conv_missing_dummy (&parmse
, e
, fsym
? fsym
->ts
: e
->ts
,
5605 e
->representation
.length
);
5610 /* Obtain the character length of an assumed character length
5611 length procedure from the typespec. */
5612 if (fsym
->ts
.type
== BT_CHARACTER
5613 && parmse
.string_length
== NULL_TREE
5614 && e
->ts
.type
== BT_PROCEDURE
5615 && e
->symtree
->n
.sym
->ts
.type
== BT_CHARACTER
5616 && e
->symtree
->n
.sym
->ts
.u
.cl
->length
!= NULL
5617 && e
->symtree
->n
.sym
->ts
.u
.cl
->length
->expr_type
== EXPR_CONSTANT
)
5619 gfc_conv_const_charlen (e
->symtree
->n
.sym
->ts
.u
.cl
);
5620 parmse
.string_length
= e
->symtree
->n
.sym
->ts
.u
.cl
->backend_decl
;
5624 if (fsym
&& need_interface_mapping
&& e
)
5625 gfc_add_interface_mapping (&mapping
, fsym
, &parmse
, e
);
5627 gfc_add_block_to_block (&se
->pre
, &parmse
.pre
);
5628 gfc_add_block_to_block (&post
, &parmse
.post
);
5630 /* Allocated allocatable components of derived types must be
5631 deallocated for non-variable scalars, array arguments to elemental
5632 procedures, and array arguments with descriptor to non-elemental
5633 procedures. As bounds information for descriptorless arrays is no
5634 longer available here, they are dealt with in trans-array.c
5635 (gfc_conv_array_parameter). */
5636 if (e
&& (e
->ts
.type
== BT_DERIVED
|| e
->ts
.type
== BT_CLASS
)
5637 && e
->ts
.u
.derived
->attr
.alloc_comp
5638 && (e
->rank
== 0 || elemental_proc
|| !nodesc_arg
)
5639 && !expr_may_alias_variables (e
, elemental_proc
))
5642 /* It is known the e returns a structure type with at least one
5643 allocatable component. When e is a function, ensure that the
5644 function is called once only by using a temporary variable. */
5645 if (!DECL_P (parmse
.expr
))
5646 parmse
.expr
= gfc_evaluate_now_loc (input_location
,
5647 parmse
.expr
, &se
->pre
);
5649 if (fsym
&& fsym
->attr
.value
)
5652 tmp
= build_fold_indirect_ref_loc (input_location
,
5655 parm_rank
= e
->rank
;
5663 case (SCALAR_POINTER
):
5664 tmp
= build_fold_indirect_ref_loc (input_location
,
5669 if (e
->expr_type
== EXPR_OP
5670 && e
->value
.op
.op
== INTRINSIC_PARENTHESES
5671 && e
->value
.op
.op1
->expr_type
== EXPR_VARIABLE
)
5674 local_tmp
= gfc_evaluate_now (tmp
, &se
->pre
);
5675 local_tmp
= gfc_copy_alloc_comp (e
->ts
.u
.derived
, local_tmp
, tmp
,
5677 gfc_add_expr_to_block (&se
->post
, local_tmp
);
5680 if (e
->ts
.type
== BT_DERIVED
&& fsym
&& fsym
->ts
.type
== BT_CLASS
)
5682 /* The derived type is passed to gfc_deallocate_alloc_comp.
5683 Therefore, class actuals can handled correctly but derived
5684 types passed to class formals need the _data component. */
5685 tmp
= gfc_class_data_get (tmp
);
5686 if (!CLASS_DATA (fsym
)->attr
.dimension
)
5687 tmp
= build_fold_indirect_ref_loc (input_location
, tmp
);
5690 tmp
= gfc_deallocate_alloc_comp (e
->ts
.u
.derived
, tmp
, parm_rank
);
5692 gfc_prepend_expr_to_block (&post
, tmp
);
5695 /* Add argument checking of passing an unallocated/NULL actual to
5696 a nonallocatable/nonpointer dummy. */
5698 if (gfc_option
.rtcheck
& GFC_RTCHECK_POINTER
&& e
!= NULL
)
5700 symbol_attribute attr
;
5704 if (e
->expr_type
== EXPR_VARIABLE
|| e
->expr_type
== EXPR_FUNCTION
)
5705 attr
= gfc_expr_attr (e
);
5707 goto end_pointer_check
;
5709 /* In Fortran 2008 it's allowed to pass a NULL pointer/nonallocated
5710 allocatable to an optional dummy, cf. 12.5.2.12. */
5711 if (fsym
!= NULL
&& fsym
->attr
.optional
&& !attr
.proc_pointer
5712 && (gfc_option
.allow_std
& GFC_STD_F2008
) != 0)
5713 goto end_pointer_check
;
5717 /* If the actual argument is an optional pointer/allocatable and
5718 the formal argument takes an nonpointer optional value,
5719 it is invalid to pass a non-present argument on, even
5720 though there is no technical reason for this in gfortran.
5721 See Fortran 2003, Section 12.4.1.6 item (7)+(8). */
5722 tree present
, null_ptr
, type
;
5724 if (attr
.allocatable
5725 && (fsym
== NULL
|| !fsym
->attr
.allocatable
))
5726 msg
= xasprintf ("Allocatable actual argument '%s' is not "
5727 "allocated or not present",
5728 e
->symtree
->n
.sym
->name
);
5729 else if (attr
.pointer
5730 && (fsym
== NULL
|| !fsym
->attr
.pointer
))
5731 msg
= xasprintf ("Pointer actual argument '%s' is not "
5732 "associated or not present",
5733 e
->symtree
->n
.sym
->name
);
5734 else if (attr
.proc_pointer
5735 && (fsym
== NULL
|| !fsym
->attr
.proc_pointer
))
5736 msg
= xasprintf ("Proc-pointer actual argument '%s' is not "
5737 "associated or not present",
5738 e
->symtree
->n
.sym
->name
);
5740 goto end_pointer_check
;
5742 present
= gfc_conv_expr_present (e
->symtree
->n
.sym
);
5743 type
= TREE_TYPE (present
);
5744 present
= fold_build2_loc (input_location
, EQ_EXPR
,
5745 logical_type_node
, present
,
5747 null_pointer_node
));
5748 type
= TREE_TYPE (parmse
.expr
);
5749 null_ptr
= fold_build2_loc (input_location
, EQ_EXPR
,
5750 logical_type_node
, parmse
.expr
,
5752 null_pointer_node
));
5753 cond
= fold_build2_loc (input_location
, TRUTH_ORIF_EXPR
,
5754 logical_type_node
, present
, null_ptr
);
5758 if (attr
.allocatable
5759 && (fsym
== NULL
|| !fsym
->attr
.allocatable
))
5760 msg
= xasprintf ("Allocatable actual argument '%s' is not "
5761 "allocated", e
->symtree
->n
.sym
->name
);
5762 else if (attr
.pointer
5763 && (fsym
== NULL
|| !fsym
->attr
.pointer
))
5764 msg
= xasprintf ("Pointer actual argument '%s' is not "
5765 "associated", e
->symtree
->n
.sym
->name
);
5766 else if (attr
.proc_pointer
5767 && (fsym
== NULL
|| !fsym
->attr
.proc_pointer
))
5768 msg
= xasprintf ("Proc-pointer actual argument '%s' is not "
5769 "associated", e
->symtree
->n
.sym
->name
);
5771 goto end_pointer_check
;
5775 /* If the argument is passed by value, we need to strip the
5777 if (!POINTER_TYPE_P (TREE_TYPE (parmse
.expr
)))
5778 tmp
= gfc_build_addr_expr (NULL_TREE
, tmp
);
5780 cond
= fold_build2_loc (input_location
, EQ_EXPR
,
5781 logical_type_node
, tmp
,
5782 fold_convert (TREE_TYPE (tmp
),
5783 null_pointer_node
));
5786 gfc_trans_runtime_check (true, false, cond
, &se
->pre
, &e
->where
,
5792 /* Deferred length dummies pass the character length by reference
5793 so that the value can be returned. */
5794 if (parmse
.string_length
&& fsym
&& fsym
->ts
.deferred
)
5796 if (INDIRECT_REF_P (parmse
.string_length
))
5797 /* In chains of functions/procedure calls the string_length already
5798 is a pointer to the variable holding the length. Therefore
5799 remove the deref on call. */
5800 parmse
.string_length
= TREE_OPERAND (parmse
.string_length
, 0);
5803 tmp
= parmse
.string_length
;
5804 if (!VAR_P (tmp
) && TREE_CODE (tmp
) != COMPONENT_REF
)
5805 tmp
= gfc_evaluate_now (parmse
.string_length
, &se
->pre
);
5806 parmse
.string_length
= gfc_build_addr_expr (NULL_TREE
, tmp
);
5810 /* Character strings are passed as two parameters, a length and a
5811 pointer - except for Bind(c) which only passes the pointer.
5812 An unlimited polymorphic formal argument likewise does not
5814 if (parmse
.string_length
!= NULL_TREE
5815 && !sym
->attr
.is_bind_c
5816 && !(fsym
&& UNLIMITED_POLY (fsym
)))
5817 vec_safe_push (stringargs
, parmse
.string_length
);
5819 /* When calling __copy for character expressions to unlimited
5820 polymorphic entities, the dst argument needs a string length. */
5821 if (sym
->name
[0] == '_' && e
&& e
->ts
.type
== BT_CHARACTER
5822 && strncmp (sym
->name
, "__vtab_CHARACTER", 16) == 0
5823 && arg
->next
&& arg
->next
->expr
5824 && (arg
->next
->expr
->ts
.type
== BT_DERIVED
5825 || arg
->next
->expr
->ts
.type
== BT_CLASS
)
5826 && arg
->next
->expr
->ts
.u
.derived
->attr
.unlimited_polymorphic
)
5827 vec_safe_push (stringargs
, parmse
.string_length
);
5829 /* For descriptorless coarrays and assumed-shape coarray dummies, we
5830 pass the token and the offset as additional arguments. */
5831 if (fsym
&& e
== NULL
&& flag_coarray
== GFC_FCOARRAY_LIB
5832 && ((fsym
->ts
.type
!= BT_CLASS
&& fsym
->attr
.codimension
5833 && !fsym
->attr
.allocatable
)
5834 || (fsym
->ts
.type
== BT_CLASS
5835 && CLASS_DATA (fsym
)->attr
.codimension
5836 && !CLASS_DATA (fsym
)->attr
.allocatable
)))
5838 /* Token and offset. */
5839 vec_safe_push (stringargs
, null_pointer_node
);
5840 vec_safe_push (stringargs
, build_int_cst (gfc_array_index_type
, 0));
5841 gcc_assert (fsym
->attr
.optional
);
5843 else if (fsym
&& flag_coarray
== GFC_FCOARRAY_LIB
5844 && ((fsym
->ts
.type
!= BT_CLASS
&& fsym
->attr
.codimension
5845 && !fsym
->attr
.allocatable
)
5846 || (fsym
->ts
.type
== BT_CLASS
5847 && CLASS_DATA (fsym
)->attr
.codimension
5848 && !CLASS_DATA (fsym
)->attr
.allocatable
)))
5850 tree caf_decl
, caf_type
;
5853 caf_decl
= gfc_get_tree_for_caf_expr (e
);
5854 caf_type
= TREE_TYPE (caf_decl
);
5856 if (GFC_DESCRIPTOR_TYPE_P (caf_type
)
5857 && (GFC_TYPE_ARRAY_AKIND (caf_type
) == GFC_ARRAY_ALLOCATABLE
5858 || GFC_TYPE_ARRAY_AKIND (caf_type
) == GFC_ARRAY_POINTER
))
5859 tmp
= gfc_conv_descriptor_token (caf_decl
);
5860 else if (DECL_LANG_SPECIFIC (caf_decl
)
5861 && GFC_DECL_TOKEN (caf_decl
) != NULL_TREE
)
5862 tmp
= GFC_DECL_TOKEN (caf_decl
);
5865 gcc_assert (GFC_ARRAY_TYPE_P (caf_type
)
5866 && GFC_TYPE_ARRAY_CAF_TOKEN (caf_type
) != NULL_TREE
);
5867 tmp
= GFC_TYPE_ARRAY_CAF_TOKEN (caf_type
);
5870 vec_safe_push (stringargs
, tmp
);
5872 if (GFC_DESCRIPTOR_TYPE_P (caf_type
)
5873 && GFC_TYPE_ARRAY_AKIND (caf_type
) == GFC_ARRAY_ALLOCATABLE
)
5874 offset
= build_int_cst (gfc_array_index_type
, 0);
5875 else if (DECL_LANG_SPECIFIC (caf_decl
)
5876 && GFC_DECL_CAF_OFFSET (caf_decl
) != NULL_TREE
)
5877 offset
= GFC_DECL_CAF_OFFSET (caf_decl
);
5878 else if (GFC_TYPE_ARRAY_CAF_OFFSET (caf_type
) != NULL_TREE
)
5879 offset
= GFC_TYPE_ARRAY_CAF_OFFSET (caf_type
);
5881 offset
= build_int_cst (gfc_array_index_type
, 0);
5883 if (GFC_DESCRIPTOR_TYPE_P (caf_type
))
5884 tmp
= gfc_conv_descriptor_data_get (caf_decl
);
5887 gcc_assert (POINTER_TYPE_P (caf_type
));
5891 tmp2
= fsym
->ts
.type
== BT_CLASS
5892 ? gfc_class_data_get (parmse
.expr
) : parmse
.expr
;
5893 if ((fsym
->ts
.type
!= BT_CLASS
5894 && (fsym
->as
->type
== AS_ASSUMED_SHAPE
5895 || fsym
->as
->type
== AS_ASSUMED_RANK
))
5896 || (fsym
->ts
.type
== BT_CLASS
5897 && (CLASS_DATA (fsym
)->as
->type
== AS_ASSUMED_SHAPE
5898 || CLASS_DATA (fsym
)->as
->type
== AS_ASSUMED_RANK
)))
5900 if (fsym
->ts
.type
== BT_CLASS
)
5901 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (tmp2
)));
5904 gcc_assert (POINTER_TYPE_P (TREE_TYPE (tmp2
)));
5905 tmp2
= build_fold_indirect_ref_loc (input_location
, tmp2
);
5907 gcc_assert (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (tmp2
)));
5908 tmp2
= gfc_conv_descriptor_data_get (tmp2
);
5910 else if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (tmp2
)))
5911 tmp2
= gfc_conv_descriptor_data_get (tmp2
);
5914 gcc_assert (POINTER_TYPE_P (TREE_TYPE (tmp2
)));
5917 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
5918 gfc_array_index_type
,
5919 fold_convert (gfc_array_index_type
, tmp2
),
5920 fold_convert (gfc_array_index_type
, tmp
));
5921 offset
= fold_build2_loc (input_location
, PLUS_EXPR
,
5922 gfc_array_index_type
, offset
, tmp
);
5924 vec_safe_push (stringargs
, offset
);
5927 vec_safe_push (arglist
, parmse
.expr
);
5929 gfc_finish_interface_mapping (&mapping
, &se
->pre
, &se
->post
);
5933 else if (sym
->ts
.type
== BT_CLASS
)
5934 ts
= CLASS_DATA (sym
)->ts
;
5938 if (ts
.type
== BT_CHARACTER
&& sym
->attr
.is_bind_c
)
5939 se
->string_length
= build_int_cst (gfc_charlen_type_node
, 1);
5940 else if (ts
.type
== BT_CHARACTER
)
5942 if (ts
.u
.cl
->length
== NULL
)
5944 /* Assumed character length results are not allowed by 5.1.1.5 of the
5945 standard and are trapped in resolve.c; except in the case of SPREAD
5946 (and other intrinsics?) and dummy functions. In the case of SPREAD,
5947 we take the character length of the first argument for the result.
5948 For dummies, we have to look through the formal argument list for
5949 this function and use the character length found there.*/
5951 cl
.backend_decl
= gfc_create_var (gfc_charlen_type_node
, "slen");
5952 else if (!sym
->attr
.dummy
)
5953 cl
.backend_decl
= (*stringargs
)[0];
5956 formal
= gfc_sym_get_dummy_args (sym
->ns
->proc_name
);
5957 for (; formal
; formal
= formal
->next
)
5958 if (strcmp (formal
->sym
->name
, sym
->name
) == 0)
5959 cl
.backend_decl
= formal
->sym
->ts
.u
.cl
->backend_decl
;
5961 len
= cl
.backend_decl
;
5967 /* Calculate the length of the returned string. */
5968 gfc_init_se (&parmse
, NULL
);
5969 if (need_interface_mapping
)
5970 gfc_apply_interface_mapping (&mapping
, &parmse
, ts
.u
.cl
->length
);
5972 gfc_conv_expr (&parmse
, ts
.u
.cl
->length
);
5973 gfc_add_block_to_block (&se
->pre
, &parmse
.pre
);
5974 gfc_add_block_to_block (&se
->post
, &parmse
.post
);
5976 tmp
= fold_build2_loc (input_location
, MAX_EXPR
,
5977 TREE_TYPE (tmp
), tmp
,
5978 build_zero_cst (TREE_TYPE (tmp
)));
5979 cl
.backend_decl
= tmp
;
5982 /* Set up a charlen structure for it. */
5987 len
= cl
.backend_decl
;
5990 byref
= (comp
&& (comp
->attr
.dimension
5991 || (comp
->ts
.type
== BT_CHARACTER
&& !sym
->attr
.is_bind_c
)))
5992 || (!comp
&& gfc_return_by_reference (sym
));
5995 if (se
->direct_byref
)
5997 /* Sometimes, too much indirection can be applied; e.g. for
5998 function_result = array_valued_recursive_function. */
5999 if (TREE_TYPE (TREE_TYPE (se
->expr
))
6000 && TREE_TYPE (TREE_TYPE (TREE_TYPE (se
->expr
)))
6001 && GFC_DESCRIPTOR_TYPE_P
6002 (TREE_TYPE (TREE_TYPE (TREE_TYPE (se
->expr
)))))
6003 se
->expr
= build_fold_indirect_ref_loc (input_location
,
6006 /* If the lhs of an assignment x = f(..) is allocatable and
6007 f2003 is allowed, we must do the automatic reallocation.
6008 TODO - deal with intrinsics, without using a temporary. */
6009 if (flag_realloc_lhs
6010 && se
->ss
&& se
->ss
->loop_chain
6011 && se
->ss
->loop_chain
->is_alloc_lhs
6012 && !expr
->value
.function
.isym
6013 && sym
->result
->as
!= NULL
)
6015 /* Evaluate the bounds of the result, if known. */
6016 gfc_set_loop_bounds_from_array_spec (&mapping
, se
,
6019 /* Perform the automatic reallocation. */
6020 tmp
= gfc_alloc_allocatable_for_assignment (se
->loop
,
6022 gfc_add_expr_to_block (&se
->pre
, tmp
);
6024 /* Pass the temporary as the first argument. */
6025 result
= info
->descriptor
;
6028 result
= build_fold_indirect_ref_loc (input_location
,
6030 vec_safe_push (retargs
, se
->expr
);
6032 else if (comp
&& comp
->attr
.dimension
)
6034 gcc_assert (se
->loop
&& info
);
6036 /* Set the type of the array. */
6037 tmp
= gfc_typenode_for_spec (&comp
->ts
);
6038 gcc_assert (se
->ss
->dimen
== se
->loop
->dimen
);
6040 /* Evaluate the bounds of the result, if known. */
6041 gfc_set_loop_bounds_from_array_spec (&mapping
, se
, comp
->as
);
6043 /* If the lhs of an assignment x = f(..) is allocatable and
6044 f2003 is allowed, we must not generate the function call
6045 here but should just send back the results of the mapping.
6046 This is signalled by the function ss being flagged. */
6047 if (flag_realloc_lhs
&& se
->ss
&& se
->ss
->is_alloc_lhs
)
6049 gfc_free_interface_mapping (&mapping
);
6050 return has_alternate_specifier
;
6053 /* Create a temporary to store the result. In case the function
6054 returns a pointer, the temporary will be a shallow copy and
6055 mustn't be deallocated. */
6056 callee_alloc
= comp
->attr
.allocatable
|| comp
->attr
.pointer
;
6057 gfc_trans_create_temp_array (&se
->pre
, &se
->post
, se
->ss
,
6058 tmp
, NULL_TREE
, false,
6059 !comp
->attr
.pointer
, callee_alloc
,
6060 &se
->ss
->info
->expr
->where
);
6062 /* Pass the temporary as the first argument. */
6063 result
= info
->descriptor
;
6064 tmp
= gfc_build_addr_expr (NULL_TREE
, result
);
6065 vec_safe_push (retargs
, tmp
);
6067 else if (!comp
&& sym
->result
->attr
.dimension
)
6069 gcc_assert (se
->loop
&& info
);
6071 /* Set the type of the array. */
6072 tmp
= gfc_typenode_for_spec (&ts
);
6073 gcc_assert (se
->ss
->dimen
== se
->loop
->dimen
);
6075 /* Evaluate the bounds of the result, if known. */
6076 gfc_set_loop_bounds_from_array_spec (&mapping
, se
, sym
->result
->as
);
6078 /* If the lhs of an assignment x = f(..) is allocatable and
6079 f2003 is allowed, we must not generate the function call
6080 here but should just send back the results of the mapping.
6081 This is signalled by the function ss being flagged. */
6082 if (flag_realloc_lhs
&& se
->ss
&& se
->ss
->is_alloc_lhs
)
6084 gfc_free_interface_mapping (&mapping
);
6085 return has_alternate_specifier
;
6088 /* Create a temporary to store the result. In case the function
6089 returns a pointer, the temporary will be a shallow copy and
6090 mustn't be deallocated. */
6091 callee_alloc
= sym
->attr
.allocatable
|| sym
->attr
.pointer
;
6092 gfc_trans_create_temp_array (&se
->pre
, &se
->post
, se
->ss
,
6093 tmp
, NULL_TREE
, false,
6094 !sym
->attr
.pointer
, callee_alloc
,
6095 &se
->ss
->info
->expr
->where
);
6097 /* Pass the temporary as the first argument. */
6098 result
= info
->descriptor
;
6099 tmp
= gfc_build_addr_expr (NULL_TREE
, result
);
6100 vec_safe_push (retargs
, tmp
);
6102 else if (ts
.type
== BT_CHARACTER
)
6104 /* Pass the string length. */
6105 type
= gfc_get_character_type (ts
.kind
, ts
.u
.cl
);
6106 type
= build_pointer_type (type
);
6108 /* Emit a DECL_EXPR for the VLA type. */
6109 tmp
= TREE_TYPE (type
);
6111 && TREE_CODE (TYPE_SIZE (tmp
)) != INTEGER_CST
)
6113 tmp
= build_decl (input_location
, TYPE_DECL
, NULL_TREE
, tmp
);
6114 DECL_ARTIFICIAL (tmp
) = 1;
6115 DECL_IGNORED_P (tmp
) = 1;
6116 tmp
= fold_build1_loc (input_location
, DECL_EXPR
,
6117 TREE_TYPE (tmp
), tmp
);
6118 gfc_add_expr_to_block (&se
->pre
, tmp
);
6121 /* Return an address to a char[0:len-1]* temporary for
6122 character pointers. */
6123 if ((!comp
&& (sym
->attr
.pointer
|| sym
->attr
.allocatable
))
6124 || (comp
&& (comp
->attr
.pointer
|| comp
->attr
.allocatable
)))
6126 var
= gfc_create_var (type
, "pstr");
6128 if ((!comp
&& sym
->attr
.allocatable
)
6129 || (comp
&& comp
->attr
.allocatable
))
6131 gfc_add_modify (&se
->pre
, var
,
6132 fold_convert (TREE_TYPE (var
),
6133 null_pointer_node
));
6134 tmp
= gfc_call_free (var
);
6135 gfc_add_expr_to_block (&se
->post
, tmp
);
6138 /* Provide an address expression for the function arguments. */
6139 var
= gfc_build_addr_expr (NULL_TREE
, var
);
6142 var
= gfc_conv_string_tmp (se
, type
, len
);
6144 vec_safe_push (retargs
, var
);
6148 gcc_assert (flag_f2c
&& ts
.type
== BT_COMPLEX
);
6150 type
= gfc_get_complex_type (ts
.kind
);
6151 var
= gfc_build_addr_expr (NULL_TREE
, gfc_create_var (type
, "cmplx"));
6152 vec_safe_push (retargs
, var
);
6155 /* Add the string length to the argument list. */
6156 if (ts
.type
== BT_CHARACTER
&& ts
.deferred
)
6160 tmp
= gfc_evaluate_now (len
, &se
->pre
);
6161 TREE_STATIC (tmp
) = 1;
6162 gfc_add_modify (&se
->pre
, tmp
,
6163 build_int_cst (TREE_TYPE (tmp
), 0));
6164 tmp
= gfc_build_addr_expr (NULL_TREE
, tmp
);
6165 vec_safe_push (retargs
, tmp
);
6167 else if (ts
.type
== BT_CHARACTER
)
6168 vec_safe_push (retargs
, len
);
6170 gfc_free_interface_mapping (&mapping
);
6172 /* We need to glom RETARGS + ARGLIST + STRINGARGS + APPEND_ARGS. */
6173 arglen
= (vec_safe_length (arglist
) + vec_safe_length (optionalargs
)
6174 + vec_safe_length (stringargs
) + vec_safe_length (append_args
));
6175 vec_safe_reserve (retargs
, arglen
);
6177 /* Add the return arguments. */
6178 vec_safe_splice (retargs
, arglist
);
6180 /* Add the hidden present status for optional+value to the arguments. */
6181 vec_safe_splice (retargs
, optionalargs
);
6183 /* Add the hidden string length parameters to the arguments. */
6184 vec_safe_splice (retargs
, stringargs
);
6186 /* We may want to append extra arguments here. This is used e.g. for
6187 calls to libgfortran_matmul_??, which need extra information. */
6188 vec_safe_splice (retargs
, append_args
);
6192 /* Generate the actual call. */
6193 if (base_object
== NULL_TREE
)
6194 conv_function_val (se
, sym
, expr
);
6196 conv_base_obj_fcn_val (se
, base_object
, expr
);
6198 /* If there are alternate return labels, function type should be
6199 integer. Can't modify the type in place though, since it can be shared
6200 with other functions. For dummy arguments, the typing is done to
6201 this result, even if it has to be repeated for each call. */
6202 if (has_alternate_specifier
6203 && TREE_TYPE (TREE_TYPE (TREE_TYPE (se
->expr
))) != integer_type_node
)
6205 if (!sym
->attr
.dummy
)
6207 TREE_TYPE (sym
->backend_decl
)
6208 = build_function_type (integer_type_node
,
6209 TYPE_ARG_TYPES (TREE_TYPE (sym
->backend_decl
)));
6210 se
->expr
= gfc_build_addr_expr (NULL_TREE
, sym
->backend_decl
);
6213 TREE_TYPE (TREE_TYPE (TREE_TYPE (se
->expr
))) = integer_type_node
;
6216 fntype
= TREE_TYPE (TREE_TYPE (se
->expr
));
6217 se
->expr
= build_call_vec (TREE_TYPE (fntype
), se
->expr
, arglist
);
6219 /* Allocatable scalar function results must be freed and nullified
6220 after use. This necessitates the creation of a temporary to
6221 hold the result to prevent duplicate calls. */
6222 if (!byref
&& sym
->ts
.type
!= BT_CHARACTER
6223 && ((sym
->attr
.allocatable
&& !sym
->attr
.dimension
&& !comp
)
6224 || (comp
&& comp
->attr
.allocatable
&& !comp
->attr
.dimension
)))
6226 tmp
= gfc_create_var (TREE_TYPE (se
->expr
), NULL
);
6227 gfc_add_modify (&se
->pre
, tmp
, se
->expr
);
6229 tmp
= gfc_call_free (tmp
);
6230 gfc_add_expr_to_block (&post
, tmp
);
6231 gfc_add_modify (&post
, se
->expr
, build_int_cst (TREE_TYPE (se
->expr
), 0));
6234 /* If we have a pointer function, but we don't want a pointer, e.g.
6237 where f is pointer valued, we have to dereference the result. */
6238 if (!se
->want_pointer
&& !byref
6239 && ((!comp
&& (sym
->attr
.pointer
|| sym
->attr
.allocatable
))
6240 || (comp
&& (comp
->attr
.pointer
|| comp
->attr
.allocatable
))))
6241 se
->expr
= build_fold_indirect_ref_loc (input_location
, se
->expr
);
6243 /* f2c calling conventions require a scalar default real function to
6244 return a double precision result. Convert this back to default
6245 real. We only care about the cases that can happen in Fortran 77.
6247 if (flag_f2c
&& sym
->ts
.type
== BT_REAL
6248 && sym
->ts
.kind
== gfc_default_real_kind
6249 && !sym
->attr
.always_explicit
)
6250 se
->expr
= fold_convert (gfc_get_real_type (sym
->ts
.kind
), se
->expr
);
6252 /* A pure function may still have side-effects - it may modify its
6254 TREE_SIDE_EFFECTS (se
->expr
) = 1;
6256 if (!sym
->attr
.pure
)
6257 TREE_SIDE_EFFECTS (se
->expr
) = 1;
6262 /* Add the function call to the pre chain. There is no expression. */
6263 gfc_add_expr_to_block (&se
->pre
, se
->expr
);
6264 se
->expr
= NULL_TREE
;
6266 if (!se
->direct_byref
)
6268 if ((sym
->attr
.dimension
&& !comp
) || (comp
&& comp
->attr
.dimension
))
6270 if (gfc_option
.rtcheck
& GFC_RTCHECK_BOUNDS
)
6272 /* Check the data pointer hasn't been modified. This would
6273 happen in a function returning a pointer. */
6274 tmp
= gfc_conv_descriptor_data_get (info
->descriptor
);
6275 tmp
= fold_build2_loc (input_location
, NE_EXPR
,
6278 gfc_trans_runtime_check (true, false, tmp
, &se
->pre
, NULL
,
6281 se
->expr
= info
->descriptor
;
6282 /* Bundle in the string length. */
6283 se
->string_length
= len
;
6285 else if (ts
.type
== BT_CHARACTER
)
6287 /* Dereference for character pointer results. */
6288 if ((!comp
&& (sym
->attr
.pointer
|| sym
->attr
.allocatable
))
6289 || (comp
&& (comp
->attr
.pointer
|| comp
->attr
.allocatable
)))
6290 se
->expr
= build_fold_indirect_ref_loc (input_location
, var
);
6294 se
->string_length
= len
;
6298 gcc_assert (ts
.type
== BT_COMPLEX
&& flag_f2c
);
6299 se
->expr
= build_fold_indirect_ref_loc (input_location
, var
);
6304 /* Associate the rhs class object's meta-data with the result, when the
6305 result is a temporary. */
6306 if (args
&& args
->expr
&& args
->expr
->ts
.type
== BT_CLASS
6307 && sym
->ts
.type
== BT_CLASS
&& result
!= NULL_TREE
&& DECL_P (result
)
6308 && !GFC_CLASS_TYPE_P (TREE_TYPE (result
)))
6311 gfc_expr
*class_expr
= gfc_find_and_cut_at_last_class_ref (args
->expr
);
6313 gfc_init_se (&parmse
, NULL
);
6314 parmse
.data_not_needed
= 1;
6315 gfc_conv_expr (&parmse
, class_expr
);
6316 if (!DECL_LANG_SPECIFIC (result
))
6317 gfc_allocate_lang_decl (result
);
6318 GFC_DECL_SAVED_DESCRIPTOR (result
) = parmse
.expr
;
6319 gfc_free_expr (class_expr
);
6320 gcc_assert (parmse
.pre
.head
== NULL_TREE
6321 && parmse
.post
.head
== NULL_TREE
);
6324 /* Follow the function call with the argument post block. */
6327 gfc_add_block_to_block (&se
->pre
, &post
);
6329 /* Transformational functions of derived types with allocatable
6330 components must have the result allocatable components copied when the
6331 argument is actually given. */
6332 arg
= expr
->value
.function
.actual
;
6333 if (result
&& arg
&& expr
->rank
6334 && expr
->value
.function
.isym
6335 && expr
->value
.function
.isym
->transformational
6337 && arg
->expr
->ts
.type
== BT_DERIVED
6338 && arg
->expr
->ts
.u
.derived
->attr
.alloc_comp
)
6341 /* Copy the allocatable components. We have to use a
6342 temporary here to prevent source allocatable components
6343 from being corrupted. */
6344 tmp2
= gfc_evaluate_now (result
, &se
->pre
);
6345 tmp
= gfc_copy_alloc_comp (arg
->expr
->ts
.u
.derived
,
6346 result
, tmp2
, expr
->rank
, 0);
6347 gfc_add_expr_to_block (&se
->pre
, tmp
);
6348 tmp
= gfc_copy_allocatable_data (result
, tmp2
, TREE_TYPE(tmp2
),
6350 gfc_add_expr_to_block (&se
->pre
, tmp
);
6352 /* Finally free the temporary's data field. */
6353 tmp
= gfc_conv_descriptor_data_get (tmp2
);
6354 tmp
= gfc_deallocate_with_status (tmp
, NULL_TREE
, NULL_TREE
,
6355 NULL_TREE
, NULL_TREE
, true,
6356 NULL
, GFC_CAF_COARRAY_NOCOARRAY
);
6357 gfc_add_expr_to_block (&se
->pre
, tmp
);
6362 /* For a function with a class array result, save the result as
6363 a temporary, set the info fields needed by the scalarizer and
6364 call the finalization function of the temporary. Note that the
6365 nullification of allocatable components needed by the result
6366 is done in gfc_trans_assignment_1. */
6367 if (expr
&& ((gfc_is_class_array_function (expr
)
6368 && se
->ss
&& se
->ss
->loop
)
6369 || gfc_is_alloc_class_scalar_function (expr
))
6370 && se
->expr
&& GFC_CLASS_TYPE_P (TREE_TYPE (se
->expr
))
6371 && expr
->must_finalize
)
6376 if (se
->ss
&& se
->ss
->loop
)
6378 gfc_add_block_to_block (&se
->ss
->loop
->pre
, &se
->pre
);
6379 se
->expr
= gfc_evaluate_now (se
->expr
, &se
->ss
->loop
->pre
);
6380 tmp
= gfc_class_data_get (se
->expr
);
6381 info
->descriptor
= tmp
;
6382 info
->data
= gfc_conv_descriptor_data_get (tmp
);
6383 info
->offset
= gfc_conv_descriptor_offset_get (tmp
);
6384 for (n
= 0; n
< se
->ss
->loop
->dimen
; n
++)
6386 tree dim
= gfc_rank_cst
[n
];
6387 se
->ss
->loop
->to
[n
] = gfc_conv_descriptor_ubound_get (tmp
, dim
);
6388 se
->ss
->loop
->from
[n
] = gfc_conv_descriptor_lbound_get (tmp
, dim
);
6393 /* TODO Eliminate the doubling of temporaries. This
6394 one is necessary to ensure no memory leakage. */
6395 se
->expr
= gfc_evaluate_now (se
->expr
, &se
->pre
);
6396 tmp
= gfc_class_data_get (se
->expr
);
6397 tmp
= gfc_conv_scalar_to_descriptor (se
, tmp
,
6398 CLASS_DATA (expr
->value
.function
.esym
->result
)->attr
);
6401 if ((gfc_is_class_array_function (expr
)
6402 || gfc_is_alloc_class_scalar_function (expr
))
6403 && CLASS_DATA (expr
->value
.function
.esym
->result
)->attr
.pointer
)
6404 goto no_finalization
;
6406 final_fndecl
= gfc_class_vtab_final_get (se
->expr
);
6407 is_final
= fold_build2_loc (input_location
, NE_EXPR
,
6410 fold_convert (TREE_TYPE (final_fndecl
),
6411 null_pointer_node
));
6412 final_fndecl
= build_fold_indirect_ref_loc (input_location
,
6414 tmp
= build_call_expr_loc (input_location
,
6416 gfc_build_addr_expr (NULL
, tmp
),
6417 gfc_class_vtab_size_get (se
->expr
),
6418 boolean_false_node
);
6419 tmp
= fold_build3_loc (input_location
, COND_EXPR
,
6420 void_type_node
, is_final
, tmp
,
6421 build_empty_stmt (input_location
));
6423 if (se
->ss
&& se
->ss
->loop
)
6425 gfc_add_expr_to_block (&se
->ss
->loop
->post
, tmp
);
6426 tmp
= gfc_call_free (info
->data
);
6427 gfc_add_expr_to_block (&se
->ss
->loop
->post
, tmp
);
6431 gfc_add_expr_to_block (&se
->post
, tmp
);
6432 tmp
= gfc_class_data_get (se
->expr
);
6433 tmp
= gfc_call_free (tmp
);
6434 gfc_add_expr_to_block (&se
->post
, tmp
);
6438 expr
->must_finalize
= 0;
6441 gfc_add_block_to_block (&se
->post
, &post
);
6444 return has_alternate_specifier
;
6448 /* Fill a character string with spaces. */
6451 fill_with_spaces (tree start
, tree type
, tree size
)
6453 stmtblock_t block
, loop
;
6454 tree i
, el
, exit_label
, cond
, tmp
;
6456 /* For a simple char type, we can call memset(). */
6457 if (compare_tree_int (TYPE_SIZE_UNIT (type
), 1) == 0)
6458 return build_call_expr_loc (input_location
,
6459 builtin_decl_explicit (BUILT_IN_MEMSET
),
6461 build_int_cst (gfc_get_int_type (gfc_c_int_kind
),
6462 lang_hooks
.to_target_charset (' ')),
6463 fold_convert (size_type_node
, size
));
6465 /* Otherwise, we use a loop:
6466 for (el = start, i = size; i > 0; el--, i+= TYPE_SIZE_UNIT (type))
6470 /* Initialize variables. */
6471 gfc_init_block (&block
);
6472 i
= gfc_create_var (sizetype
, "i");
6473 gfc_add_modify (&block
, i
, fold_convert (sizetype
, size
));
6474 el
= gfc_create_var (build_pointer_type (type
), "el");
6475 gfc_add_modify (&block
, el
, fold_convert (TREE_TYPE (el
), start
));
6476 exit_label
= gfc_build_label_decl (NULL_TREE
);
6477 TREE_USED (exit_label
) = 1;
6481 gfc_init_block (&loop
);
6483 /* Exit condition. */
6484 cond
= fold_build2_loc (input_location
, LE_EXPR
, logical_type_node
, i
,
6485 build_zero_cst (sizetype
));
6486 tmp
= build1_v (GOTO_EXPR
, exit_label
);
6487 tmp
= fold_build3_loc (input_location
, COND_EXPR
, void_type_node
, cond
, tmp
,
6488 build_empty_stmt (input_location
));
6489 gfc_add_expr_to_block (&loop
, tmp
);
6492 gfc_add_modify (&loop
,
6493 fold_build1_loc (input_location
, INDIRECT_REF
, type
, el
),
6494 build_int_cst (type
, lang_hooks
.to_target_charset (' ')));
6496 /* Increment loop variables. */
6497 gfc_add_modify (&loop
, i
,
6498 fold_build2_loc (input_location
, MINUS_EXPR
, sizetype
, i
,
6499 TYPE_SIZE_UNIT (type
)));
6500 gfc_add_modify (&loop
, el
,
6501 fold_build_pointer_plus_loc (input_location
,
6502 el
, TYPE_SIZE_UNIT (type
)));
6504 /* Making the loop... actually loop! */
6505 tmp
= gfc_finish_block (&loop
);
6506 tmp
= build1_v (LOOP_EXPR
, tmp
);
6507 gfc_add_expr_to_block (&block
, tmp
);
6509 /* The exit label. */
6510 tmp
= build1_v (LABEL_EXPR
, exit_label
);
6511 gfc_add_expr_to_block (&block
, tmp
);
6514 return gfc_finish_block (&block
);
6518 /* Generate code to copy a string. */
6521 gfc_trans_string_copy (stmtblock_t
* block
, tree dlength
, tree dest
,
6522 int dkind
, tree slength
, tree src
, int skind
)
6524 tree tmp
, dlen
, slen
;
6533 stmtblock_t tempblock
;
6535 gcc_assert (dkind
== skind
);
6537 if (slength
!= NULL_TREE
)
6539 slen
= gfc_evaluate_now (fold_convert (gfc_charlen_type_node
, slength
), block
);
6540 ssc
= gfc_string_to_single_character (slen
, src
, skind
);
6544 slen
= build_one_cst (gfc_charlen_type_node
);
6548 if (dlength
!= NULL_TREE
)
6550 dlen
= gfc_evaluate_now (fold_convert (gfc_charlen_type_node
, dlength
), block
);
6551 dsc
= gfc_string_to_single_character (dlen
, dest
, dkind
);
6555 dlen
= build_one_cst (gfc_charlen_type_node
);
6559 /* Assign directly if the types are compatible. */
6560 if (dsc
!= NULL_TREE
&& ssc
!= NULL_TREE
6561 && TREE_TYPE (dsc
) == TREE_TYPE (ssc
))
6563 gfc_add_modify (block
, dsc
, ssc
);
6567 /* The string copy algorithm below generates code like
6571 if (srclen < destlen)
6573 memmove (dest, src, srclen);
6575 memset (&dest[srclen], ' ', destlen - srclen);
6579 // Truncate if too long.
6580 memmove (dest, src, destlen);
6585 /* Do nothing if the destination length is zero. */
6586 cond
= fold_build2_loc (input_location
, GT_EXPR
, logical_type_node
, dlen
,
6587 build_zero_cst (TREE_TYPE (dlen
)));
6589 /* For non-default character kinds, we have to multiply the string
6590 length by the base type size. */
6591 chartype
= gfc_get_char_type (dkind
);
6592 slen
= fold_build2_loc (input_location
, MULT_EXPR
, TREE_TYPE (slen
),
6594 fold_convert (TREE_TYPE (slen
),
6595 TYPE_SIZE_UNIT (chartype
)));
6596 dlen
= fold_build2_loc (input_location
, MULT_EXPR
, TREE_TYPE (dlen
),
6598 fold_convert (TREE_TYPE (dlen
),
6599 TYPE_SIZE_UNIT (chartype
)));
6601 if (dlength
&& POINTER_TYPE_P (TREE_TYPE (dest
)))
6602 dest
= fold_convert (pvoid_type_node
, dest
);
6604 dest
= gfc_build_addr_expr (pvoid_type_node
, dest
);
6606 if (slength
&& POINTER_TYPE_P (TREE_TYPE (src
)))
6607 src
= fold_convert (pvoid_type_node
, src
);
6609 src
= gfc_build_addr_expr (pvoid_type_node
, src
);
6611 /* Truncate string if source is too long. */
6612 cond2
= fold_build2_loc (input_location
, LT_EXPR
, logical_type_node
, slen
,
6615 /* Copy and pad with spaces. */
6616 tmp3
= build_call_expr_loc (input_location
,
6617 builtin_decl_explicit (BUILT_IN_MEMMOVE
),
6619 fold_convert (size_type_node
, slen
));
6621 /* Wstringop-overflow appears at -O3 even though this warning is not
6622 explicitly available in fortran nor can it be switched off. If the
6623 source length is a constant, its negative appears as a very large
6624 postive number and triggers the warning in BUILTIN_MEMSET. Fixing
6625 the result of the MINUS_EXPR suppresses this spurious warning. */
6626 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
6627 TREE_TYPE(dlen
), dlen
, slen
);
6628 if (slength
&& TREE_CONSTANT (slength
))
6629 tmp
= gfc_evaluate_now (tmp
, block
);
6631 tmp4
= fold_build_pointer_plus_loc (input_location
, dest
, slen
);
6632 tmp4
= fill_with_spaces (tmp4
, chartype
, tmp
);
6634 gfc_init_block (&tempblock
);
6635 gfc_add_expr_to_block (&tempblock
, tmp3
);
6636 gfc_add_expr_to_block (&tempblock
, tmp4
);
6637 tmp3
= gfc_finish_block (&tempblock
);
6639 /* The truncated memmove if the slen >= dlen. */
6640 tmp2
= build_call_expr_loc (input_location
,
6641 builtin_decl_explicit (BUILT_IN_MEMMOVE
),
6643 fold_convert (size_type_node
, dlen
));
6645 /* The whole copy_string function is there. */
6646 tmp
= fold_build3_loc (input_location
, COND_EXPR
, void_type_node
, cond2
,
6648 tmp
= fold_build3_loc (input_location
, COND_EXPR
, void_type_node
, cond
, tmp
,
6649 build_empty_stmt (input_location
));
6650 gfc_add_expr_to_block (block
, tmp
);
6654 /* Translate a statement function.
6655 The value of a statement function reference is obtained by evaluating the
6656 expression using the values of the actual arguments for the values of the
6657 corresponding dummy arguments. */
6660 gfc_conv_statement_function (gfc_se
* se
, gfc_expr
* expr
)
6664 gfc_formal_arglist
*fargs
;
6665 gfc_actual_arglist
*args
;
6668 gfc_saved_var
*saved_vars
;
6674 sym
= expr
->symtree
->n
.sym
;
6675 args
= expr
->value
.function
.actual
;
6676 gfc_init_se (&lse
, NULL
);
6677 gfc_init_se (&rse
, NULL
);
6680 for (fargs
= gfc_sym_get_dummy_args (sym
); fargs
; fargs
= fargs
->next
)
6682 saved_vars
= XCNEWVEC (gfc_saved_var
, n
);
6683 temp_vars
= XCNEWVEC (tree
, n
);
6685 for (fargs
= gfc_sym_get_dummy_args (sym
), n
= 0; fargs
;
6686 fargs
= fargs
->next
, n
++)
6688 /* Each dummy shall be specified, explicitly or implicitly, to be
6690 gcc_assert (fargs
->sym
->attr
.dimension
== 0);
6693 if (fsym
->ts
.type
== BT_CHARACTER
)
6695 /* Copy string arguments. */
6698 gcc_assert (fsym
->ts
.u
.cl
&& fsym
->ts
.u
.cl
->length
6699 && fsym
->ts
.u
.cl
->length
->expr_type
== EXPR_CONSTANT
);
6701 /* Create a temporary to hold the value. */
6702 if (fsym
->ts
.u
.cl
->backend_decl
== NULL_TREE
)
6703 fsym
->ts
.u
.cl
->backend_decl
6704 = gfc_conv_constant_to_tree (fsym
->ts
.u
.cl
->length
);
6706 type
= gfc_get_character_type (fsym
->ts
.kind
, fsym
->ts
.u
.cl
);
6707 temp_vars
[n
] = gfc_create_var (type
, fsym
->name
);
6709 arglen
= TYPE_MAX_VALUE (TYPE_DOMAIN (type
));
6711 gfc_conv_expr (&rse
, args
->expr
);
6712 gfc_conv_string_parameter (&rse
);
6713 gfc_add_block_to_block (&se
->pre
, &lse
.pre
);
6714 gfc_add_block_to_block (&se
->pre
, &rse
.pre
);
6716 gfc_trans_string_copy (&se
->pre
, arglen
, temp_vars
[n
], fsym
->ts
.kind
,
6717 rse
.string_length
, rse
.expr
, fsym
->ts
.kind
);
6718 gfc_add_block_to_block (&se
->pre
, &lse
.post
);
6719 gfc_add_block_to_block (&se
->pre
, &rse
.post
);
6723 /* For everything else, just evaluate the expression. */
6725 /* Create a temporary to hold the value. */
6726 type
= gfc_typenode_for_spec (&fsym
->ts
);
6727 temp_vars
[n
] = gfc_create_var (type
, fsym
->name
);
6729 gfc_conv_expr (&lse
, args
->expr
);
6731 gfc_add_block_to_block (&se
->pre
, &lse
.pre
);
6732 gfc_add_modify (&se
->pre
, temp_vars
[n
], lse
.expr
);
6733 gfc_add_block_to_block (&se
->pre
, &lse
.post
);
6739 /* Use the temporary variables in place of the real ones. */
6740 for (fargs
= gfc_sym_get_dummy_args (sym
), n
= 0; fargs
;
6741 fargs
= fargs
->next
, n
++)
6742 gfc_shadow_sym (fargs
->sym
, temp_vars
[n
], &saved_vars
[n
]);
6744 gfc_conv_expr (se
, sym
->value
);
6746 if (sym
->ts
.type
== BT_CHARACTER
)
6748 gfc_conv_const_charlen (sym
->ts
.u
.cl
);
6750 /* Force the expression to the correct length. */
6751 if (!INTEGER_CST_P (se
->string_length
)
6752 || tree_int_cst_lt (se
->string_length
,
6753 sym
->ts
.u
.cl
->backend_decl
))
6755 type
= gfc_get_character_type (sym
->ts
.kind
, sym
->ts
.u
.cl
);
6756 tmp
= gfc_create_var (type
, sym
->name
);
6757 tmp
= gfc_build_addr_expr (build_pointer_type (type
), tmp
);
6758 gfc_trans_string_copy (&se
->pre
, sym
->ts
.u
.cl
->backend_decl
, tmp
,
6759 sym
->ts
.kind
, se
->string_length
, se
->expr
,
6763 se
->string_length
= sym
->ts
.u
.cl
->backend_decl
;
6766 /* Restore the original variables. */
6767 for (fargs
= gfc_sym_get_dummy_args (sym
), n
= 0; fargs
;
6768 fargs
= fargs
->next
, n
++)
6769 gfc_restore_sym (fargs
->sym
, &saved_vars
[n
]);
6775 /* Translate a function expression. */
6778 gfc_conv_function_expr (gfc_se
* se
, gfc_expr
* expr
)
6782 if (expr
->value
.function
.isym
)
6784 gfc_conv_intrinsic_function (se
, expr
);
6788 /* expr.value.function.esym is the resolved (specific) function symbol for
6789 most functions. However this isn't set for dummy procedures. */
6790 sym
= expr
->value
.function
.esym
;
6792 sym
= expr
->symtree
->n
.sym
;
6794 /* The IEEE_ARITHMETIC functions are caught here. */
6795 if (sym
->from_intmod
== INTMOD_IEEE_ARITHMETIC
)
6796 if (gfc_conv_ieee_arithmetic_function (se
, expr
))
6799 /* We distinguish statement functions from general functions to improve
6800 runtime performance. */
6801 if (sym
->attr
.proc
== PROC_ST_FUNCTION
)
6803 gfc_conv_statement_function (se
, expr
);
6807 gfc_conv_procedure_call (se
, sym
, expr
->value
.function
.actual
, expr
,
6812 /* Determine whether the given EXPR_CONSTANT is a zero initializer. */
6815 is_zero_initializer_p (gfc_expr
* expr
)
6817 if (expr
->expr_type
!= EXPR_CONSTANT
)
6820 /* We ignore constants with prescribed memory representations for now. */
6821 if (expr
->representation
.string
)
6824 switch (expr
->ts
.type
)
6827 return mpz_cmp_si (expr
->value
.integer
, 0) == 0;
6830 return mpfr_zero_p (expr
->value
.real
)
6831 && MPFR_SIGN (expr
->value
.real
) >= 0;
6834 return expr
->value
.logical
== 0;
6837 return mpfr_zero_p (mpc_realref (expr
->value
.complex))
6838 && MPFR_SIGN (mpc_realref (expr
->value
.complex)) >= 0
6839 && mpfr_zero_p (mpc_imagref (expr
->value
.complex))
6840 && MPFR_SIGN (mpc_imagref (expr
->value
.complex)) >= 0;
6850 gfc_conv_array_constructor_expr (gfc_se
* se
, gfc_expr
* expr
)
6855 gcc_assert (ss
!= NULL
&& ss
!= gfc_ss_terminator
);
6856 gcc_assert (ss
->info
->expr
== expr
&& ss
->info
->type
== GFC_SS_CONSTRUCTOR
);
6858 gfc_conv_tmp_array_ref (se
);
6862 /* Build a static initializer. EXPR is the expression for the initial value.
6863 The other parameters describe the variable of the component being
6864 initialized. EXPR may be null. */
6867 gfc_conv_initializer (gfc_expr
* expr
, gfc_typespec
* ts
, tree type
,
6868 bool array
, bool pointer
, bool procptr
)
6872 if (flag_coarray
!= GFC_FCOARRAY_LIB
&& ts
->type
== BT_DERIVED
6873 && ts
->u
.derived
->from_intmod
== INTMOD_ISO_FORTRAN_ENV
6874 && ts
->u
.derived
->intmod_sym_id
== ISOFORTRAN_EVENT_TYPE
)
6875 return build_constructor (type
, NULL
);
6877 if (!(expr
|| pointer
|| procptr
))
6880 /* Check if we have ISOCBINDING_NULL_PTR or ISOCBINDING_NULL_FUNPTR
6881 (these are the only two iso_c_binding derived types that can be
6882 used as initialization expressions). If so, we need to modify
6883 the 'expr' to be that for a (void *). */
6884 if (expr
!= NULL
&& expr
->ts
.type
== BT_DERIVED
6885 && expr
->ts
.is_iso_c
&& expr
->ts
.u
.derived
)
6887 gfc_symbol
*derived
= expr
->ts
.u
.derived
;
6889 /* The derived symbol has already been converted to a (void *). Use
6891 if (derived
->ts
.kind
== 0)
6892 derived
->ts
.kind
= gfc_default_integer_kind
;
6893 expr
= gfc_get_int_expr (derived
->ts
.kind
, NULL
, 0);
6894 expr
->ts
.f90_type
= derived
->ts
.f90_type
;
6896 gfc_init_se (&se
, NULL
);
6897 gfc_conv_constant (&se
, expr
);
6898 gcc_assert (TREE_CODE (se
.expr
) != CONSTRUCTOR
);
6902 if (array
&& !procptr
)
6905 /* Arrays need special handling. */
6907 ctor
= gfc_build_null_descriptor (type
);
6908 /* Special case assigning an array to zero. */
6909 else if (is_zero_initializer_p (expr
))
6910 ctor
= build_constructor (type
, NULL
);
6912 ctor
= gfc_conv_array_initializer (type
, expr
);
6913 TREE_STATIC (ctor
) = 1;
6916 else if (pointer
|| procptr
)
6918 if (ts
->type
== BT_CLASS
&& !procptr
)
6920 gfc_init_se (&se
, NULL
);
6921 gfc_conv_structure (&se
, gfc_class_initializer (ts
, expr
), 1);
6922 gcc_assert (TREE_CODE (se
.expr
) == CONSTRUCTOR
);
6923 TREE_STATIC (se
.expr
) = 1;
6926 else if (!expr
|| expr
->expr_type
== EXPR_NULL
)
6927 return fold_convert (type
, null_pointer_node
);
6930 gfc_init_se (&se
, NULL
);
6931 se
.want_pointer
= 1;
6932 gfc_conv_expr (&se
, expr
);
6933 gcc_assert (TREE_CODE (se
.expr
) != CONSTRUCTOR
);
6943 gfc_init_se (&se
, NULL
);
6944 if (ts
->type
== BT_CLASS
&& expr
->expr_type
== EXPR_NULL
)
6945 gfc_conv_structure (&se
, gfc_class_initializer (ts
, expr
), 1);
6947 gfc_conv_structure (&se
, expr
, 1);
6948 gcc_assert (TREE_CODE (se
.expr
) == CONSTRUCTOR
);
6949 TREE_STATIC (se
.expr
) = 1;
6954 tree ctor
= gfc_conv_string_init (ts
->u
.cl
->backend_decl
,expr
);
6955 TREE_STATIC (ctor
) = 1;
6960 gfc_init_se (&se
, NULL
);
6961 gfc_conv_constant (&se
, expr
);
6962 gcc_assert (TREE_CODE (se
.expr
) != CONSTRUCTOR
);
6969 gfc_trans_subarray_assign (tree dest
, gfc_component
* cm
, gfc_expr
* expr
)
6975 gfc_array_info
*lss_array
;
6982 gfc_start_block (&block
);
6984 /* Initialize the scalarizer. */
6985 gfc_init_loopinfo (&loop
);
6987 gfc_init_se (&lse
, NULL
);
6988 gfc_init_se (&rse
, NULL
);
6991 rss
= gfc_walk_expr (expr
);
6992 if (rss
== gfc_ss_terminator
)
6993 /* The rhs is scalar. Add a ss for the expression. */
6994 rss
= gfc_get_scalar_ss (gfc_ss_terminator
, expr
);
6996 /* Create a SS for the destination. */
6997 lss
= gfc_get_array_ss (gfc_ss_terminator
, NULL
, cm
->as
->rank
,
6999 lss_array
= &lss
->info
->data
.array
;
7000 lss_array
->shape
= gfc_get_shape (cm
->as
->rank
);
7001 lss_array
->descriptor
= dest
;
7002 lss_array
->data
= gfc_conv_array_data (dest
);
7003 lss_array
->offset
= gfc_conv_array_offset (dest
);
7004 for (n
= 0; n
< cm
->as
->rank
; n
++)
7006 lss_array
->start
[n
] = gfc_conv_array_lbound (dest
, n
);
7007 lss_array
->stride
[n
] = gfc_index_one_node
;
7009 mpz_init (lss_array
->shape
[n
]);
7010 mpz_sub (lss_array
->shape
[n
], cm
->as
->upper
[n
]->value
.integer
,
7011 cm
->as
->lower
[n
]->value
.integer
);
7012 mpz_add_ui (lss_array
->shape
[n
], lss_array
->shape
[n
], 1);
7015 /* Associate the SS with the loop. */
7016 gfc_add_ss_to_loop (&loop
, lss
);
7017 gfc_add_ss_to_loop (&loop
, rss
);
7019 /* Calculate the bounds of the scalarization. */
7020 gfc_conv_ss_startstride (&loop
);
7022 /* Setup the scalarizing loops. */
7023 gfc_conv_loop_setup (&loop
, &expr
->where
);
7025 /* Setup the gfc_se structures. */
7026 gfc_copy_loopinfo_to_se (&lse
, &loop
);
7027 gfc_copy_loopinfo_to_se (&rse
, &loop
);
7030 gfc_mark_ss_chain_used (rss
, 1);
7032 gfc_mark_ss_chain_used (lss
, 1);
7034 /* Start the scalarized loop body. */
7035 gfc_start_scalarized_body (&loop
, &body
);
7037 gfc_conv_tmp_array_ref (&lse
);
7038 if (cm
->ts
.type
== BT_CHARACTER
)
7039 lse
.string_length
= cm
->ts
.u
.cl
->backend_decl
;
7041 gfc_conv_expr (&rse
, expr
);
7043 tmp
= gfc_trans_scalar_assign (&lse
, &rse
, cm
->ts
, true, false);
7044 gfc_add_expr_to_block (&body
, tmp
);
7046 gcc_assert (rse
.ss
== gfc_ss_terminator
);
7048 /* Generate the copying loops. */
7049 gfc_trans_scalarizing_loops (&loop
, &body
);
7051 /* Wrap the whole thing up. */
7052 gfc_add_block_to_block (&block
, &loop
.pre
);
7053 gfc_add_block_to_block (&block
, &loop
.post
);
7055 gcc_assert (lss_array
->shape
!= NULL
);
7056 gfc_free_shape (&lss_array
->shape
, cm
->as
->rank
);
7057 gfc_cleanup_loop (&loop
);
7059 return gfc_finish_block (&block
);
7064 gfc_trans_alloc_subarray_assign (tree dest
, gfc_component
* cm
,
7074 gfc_expr
*arg
= NULL
;
7076 gfc_start_block (&block
);
7077 gfc_init_se (&se
, NULL
);
7079 /* Get the descriptor for the expressions. */
7080 se
.want_pointer
= 0;
7081 gfc_conv_expr_descriptor (&se
, expr
);
7082 gfc_add_block_to_block (&block
, &se
.pre
);
7083 gfc_add_modify (&block
, dest
, se
.expr
);
7085 /* Deal with arrays of derived types with allocatable components. */
7086 if (gfc_bt_struct (cm
->ts
.type
)
7087 && cm
->ts
.u
.derived
->attr
.alloc_comp
)
7088 // TODO: Fix caf_mode
7089 tmp
= gfc_copy_alloc_comp (cm
->ts
.u
.derived
,
7092 else if (cm
->ts
.type
== BT_CLASS
&& expr
->ts
.type
== BT_DERIVED
7093 && CLASS_DATA(cm
)->attr
.allocatable
)
7095 if (cm
->ts
.u
.derived
->attr
.alloc_comp
)
7096 // TODO: Fix caf_mode
7097 tmp
= gfc_copy_alloc_comp (expr
->ts
.u
.derived
,
7102 tmp
= TREE_TYPE (dest
);
7103 tmp
= gfc_duplicate_allocatable (dest
, se
.expr
,
7104 tmp
, expr
->rank
, NULL_TREE
);
7108 tmp
= gfc_duplicate_allocatable (dest
, se
.expr
,
7109 TREE_TYPE(cm
->backend_decl
),
7110 cm
->as
->rank
, NULL_TREE
);
7112 gfc_add_expr_to_block (&block
, tmp
);
7113 gfc_add_block_to_block (&block
, &se
.post
);
7115 if (expr
->expr_type
!= EXPR_VARIABLE
)
7116 gfc_conv_descriptor_data_set (&block
, se
.expr
,
7119 /* We need to know if the argument of a conversion function is a
7120 variable, so that the correct lower bound can be used. */
7121 if (expr
->expr_type
== EXPR_FUNCTION
7122 && expr
->value
.function
.isym
7123 && expr
->value
.function
.isym
->conversion
7124 && expr
->value
.function
.actual
->expr
7125 && expr
->value
.function
.actual
->expr
->expr_type
== EXPR_VARIABLE
)
7126 arg
= expr
->value
.function
.actual
->expr
;
7128 /* Obtain the array spec of full array references. */
7130 as
= gfc_get_full_arrayspec_from_expr (arg
);
7132 as
= gfc_get_full_arrayspec_from_expr (expr
);
7134 /* Shift the lbound and ubound of temporaries to being unity,
7135 rather than zero, based. Always calculate the offset. */
7136 offset
= gfc_conv_descriptor_offset_get (dest
);
7137 gfc_add_modify (&block
, offset
, gfc_index_zero_node
);
7138 tmp2
=gfc_create_var (gfc_array_index_type
, NULL
);
7140 for (n
= 0; n
< expr
->rank
; n
++)
7145 /* Obtain the correct lbound - ISO/IEC TR 15581:2001 page 9.
7146 TODO It looks as if gfc_conv_expr_descriptor should return
7147 the correct bounds and that the following should not be
7148 necessary. This would simplify gfc_conv_intrinsic_bound
7150 if (as
&& as
->lower
[n
])
7153 gfc_init_se (&lbse
, NULL
);
7154 gfc_conv_expr (&lbse
, as
->lower
[n
]);
7155 gfc_add_block_to_block (&block
, &lbse
.pre
);
7156 lbound
= gfc_evaluate_now (lbse
.expr
, &block
);
7160 tmp
= gfc_get_symbol_decl (arg
->symtree
->n
.sym
);
7161 lbound
= gfc_conv_descriptor_lbound_get (tmp
,
7165 lbound
= gfc_conv_descriptor_lbound_get (dest
,
7168 lbound
= gfc_index_one_node
;
7170 lbound
= fold_convert (gfc_array_index_type
, lbound
);
7172 /* Shift the bounds and set the offset accordingly. */
7173 tmp
= gfc_conv_descriptor_ubound_get (dest
, gfc_rank_cst
[n
]);
7174 span
= fold_build2_loc (input_location
, MINUS_EXPR
, gfc_array_index_type
,
7175 tmp
, gfc_conv_descriptor_lbound_get (dest
, gfc_rank_cst
[n
]));
7176 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
, gfc_array_index_type
,
7178 gfc_conv_descriptor_ubound_set (&block
, dest
,
7179 gfc_rank_cst
[n
], tmp
);
7180 gfc_conv_descriptor_lbound_set (&block
, dest
,
7181 gfc_rank_cst
[n
], lbound
);
7183 tmp
= fold_build2_loc (input_location
, MULT_EXPR
, gfc_array_index_type
,
7184 gfc_conv_descriptor_lbound_get (dest
,
7186 gfc_conv_descriptor_stride_get (dest
,
7188 gfc_add_modify (&block
, tmp2
, tmp
);
7189 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
, gfc_array_index_type
,
7191 gfc_conv_descriptor_offset_set (&block
, dest
, tmp
);
7196 /* If a conversion expression has a null data pointer
7197 argument, nullify the allocatable component. */
7201 if (arg
->symtree
->n
.sym
->attr
.allocatable
7202 || arg
->symtree
->n
.sym
->attr
.pointer
)
7204 non_null_expr
= gfc_finish_block (&block
);
7205 gfc_start_block (&block
);
7206 gfc_conv_descriptor_data_set (&block
, dest
,
7208 null_expr
= gfc_finish_block (&block
);
7209 tmp
= gfc_conv_descriptor_data_get (arg
->symtree
->n
.sym
->backend_decl
);
7210 tmp
= build2_loc (input_location
, EQ_EXPR
, logical_type_node
, tmp
,
7211 fold_convert (TREE_TYPE (tmp
), null_pointer_node
));
7212 return build3_v (COND_EXPR
, tmp
,
7213 null_expr
, non_null_expr
);
7217 return gfc_finish_block (&block
);
7221 /* Allocate or reallocate scalar component, as necessary. */
7224 alloc_scalar_allocatable_for_subcomponent_assignment (stmtblock_t
*block
,
7234 tree lhs_cl_size
= NULL_TREE
;
7239 if (!expr2
|| expr2
->rank
)
7242 realloc_lhs_warning (expr2
->ts
.type
, false, &expr2
->where
);
7244 if (cm
->ts
.type
== BT_CHARACTER
&& cm
->ts
.deferred
)
7246 char name
[GFC_MAX_SYMBOL_LEN
+9];
7247 gfc_component
*strlen
;
7248 /* Use the rhs string length and the lhs element size. */
7249 gcc_assert (expr2
->ts
.type
== BT_CHARACTER
);
7250 if (!expr2
->ts
.u
.cl
->backend_decl
)
7252 gfc_conv_string_length (expr2
->ts
.u
.cl
, expr2
, block
);
7253 gcc_assert (expr2
->ts
.u
.cl
->backend_decl
);
7256 size
= expr2
->ts
.u
.cl
->backend_decl
;
7258 /* Ensure that cm->ts.u.cl->backend_decl is a componentref to _%s_length
7260 sprintf (name
, "_%s_length", cm
->name
);
7261 strlen
= gfc_find_component (sym
, name
, true, true, NULL
);
7262 lhs_cl_size
= fold_build3_loc (input_location
, COMPONENT_REF
,
7263 gfc_charlen_type_node
,
7264 TREE_OPERAND (comp
, 0),
7265 strlen
->backend_decl
, NULL_TREE
);
7267 tmp
= TREE_TYPE (gfc_typenode_for_spec (&cm
->ts
));
7268 tmp
= TYPE_SIZE_UNIT (tmp
);
7269 size_in_bytes
= fold_build2_loc (input_location
, MULT_EXPR
,
7270 TREE_TYPE (tmp
), tmp
,
7271 fold_convert (TREE_TYPE (tmp
), size
));
7273 else if (cm
->ts
.type
== BT_CLASS
)
7275 gcc_assert (expr2
->ts
.type
== BT_CLASS
|| expr2
->ts
.type
== BT_DERIVED
);
7276 if (expr2
->ts
.type
== BT_DERIVED
)
7278 tmp
= gfc_get_symbol_decl (expr2
->ts
.u
.derived
);
7279 size
= TYPE_SIZE_UNIT (tmp
);
7285 e2vtab
= gfc_find_and_cut_at_last_class_ref (expr2
);
7286 gfc_add_vptr_component (e2vtab
);
7287 gfc_add_size_component (e2vtab
);
7288 gfc_init_se (&se
, NULL
);
7289 gfc_conv_expr (&se
, e2vtab
);
7290 gfc_add_block_to_block (block
, &se
.pre
);
7291 size
= fold_convert (size_type_node
, se
.expr
);
7292 gfc_free_expr (e2vtab
);
7294 size_in_bytes
= size
;
7298 /* Otherwise use the length in bytes of the rhs. */
7299 size
= TYPE_SIZE_UNIT (gfc_typenode_for_spec (&cm
->ts
));
7300 size_in_bytes
= size
;
7303 size_in_bytes
= fold_build2_loc (input_location
, MAX_EXPR
, size_type_node
,
7304 size_in_bytes
, size_one_node
);
7306 if (cm
->ts
.type
== BT_DERIVED
&& cm
->ts
.u
.derived
->attr
.alloc_comp
)
7308 tmp
= build_call_expr_loc (input_location
,
7309 builtin_decl_explicit (BUILT_IN_CALLOC
),
7310 2, build_one_cst (size_type_node
),
7312 tmp
= fold_convert (TREE_TYPE (comp
), tmp
);
7313 gfc_add_modify (block
, comp
, tmp
);
7317 tmp
= build_call_expr_loc (input_location
,
7318 builtin_decl_explicit (BUILT_IN_MALLOC
),
7320 if (GFC_CLASS_TYPE_P (TREE_TYPE (comp
)))
7321 ptr
= gfc_class_data_get (comp
);
7324 tmp
= fold_convert (TREE_TYPE (ptr
), tmp
);
7325 gfc_add_modify (block
, ptr
, tmp
);
7328 if (cm
->ts
.type
== BT_CHARACTER
&& cm
->ts
.deferred
)
7329 /* Update the lhs character length. */
7330 gfc_add_modify (block
, lhs_cl_size
,
7331 fold_convert (TREE_TYPE (lhs_cl_size
), size
));
7335 /* Assign a single component of a derived type constructor. */
7338 gfc_trans_subcomponent_assign (tree dest
, gfc_component
* cm
, gfc_expr
* expr
,
7339 gfc_symbol
*sym
, bool init
)
7347 gfc_start_block (&block
);
7349 if (cm
->attr
.pointer
|| cm
->attr
.proc_pointer
)
7351 /* Only care about pointers here, not about allocatables. */
7352 gfc_init_se (&se
, NULL
);
7353 /* Pointer component. */
7354 if ((cm
->attr
.dimension
|| cm
->attr
.codimension
)
7355 && !cm
->attr
.proc_pointer
)
7357 /* Array pointer. */
7358 if (expr
->expr_type
== EXPR_NULL
)
7359 gfc_conv_descriptor_data_set (&block
, dest
, null_pointer_node
);
7362 se
.direct_byref
= 1;
7364 gfc_conv_expr_descriptor (&se
, expr
);
7365 gfc_add_block_to_block (&block
, &se
.pre
);
7366 gfc_add_block_to_block (&block
, &se
.post
);
7371 /* Scalar pointers. */
7372 se
.want_pointer
= 1;
7373 gfc_conv_expr (&se
, expr
);
7374 gfc_add_block_to_block (&block
, &se
.pre
);
7376 if (expr
->symtree
&& expr
->symtree
->n
.sym
->attr
.proc_pointer
7377 && expr
->symtree
->n
.sym
->attr
.dummy
)
7378 se
.expr
= build_fold_indirect_ref_loc (input_location
, se
.expr
);
7380 gfc_add_modify (&block
, dest
,
7381 fold_convert (TREE_TYPE (dest
), se
.expr
));
7382 gfc_add_block_to_block (&block
, &se
.post
);
7385 else if (cm
->ts
.type
== BT_CLASS
&& expr
->expr_type
== EXPR_NULL
)
7387 /* NULL initialization for CLASS components. */
7388 tmp
= gfc_trans_structure_assign (dest
,
7389 gfc_class_initializer (&cm
->ts
, expr
),
7391 gfc_add_expr_to_block (&block
, tmp
);
7393 else if ((cm
->attr
.dimension
|| cm
->attr
.codimension
)
7394 && !cm
->attr
.proc_pointer
)
7396 if (cm
->attr
.allocatable
&& expr
->expr_type
== EXPR_NULL
)
7397 gfc_conv_descriptor_data_set (&block
, dest
, null_pointer_node
);
7398 else if (cm
->attr
.allocatable
|| cm
->attr
.pdt_array
)
7400 tmp
= gfc_trans_alloc_subarray_assign (dest
, cm
, expr
);
7401 gfc_add_expr_to_block (&block
, tmp
);
7405 tmp
= gfc_trans_subarray_assign (dest
, cm
, expr
);
7406 gfc_add_expr_to_block (&block
, tmp
);
7409 else if (cm
->ts
.type
== BT_CLASS
7410 && CLASS_DATA (cm
)->attr
.dimension
7411 && CLASS_DATA (cm
)->attr
.allocatable
7412 && expr
->ts
.type
== BT_DERIVED
)
7414 vtab
= gfc_get_symbol_decl (gfc_find_vtab (&expr
->ts
));
7415 vtab
= gfc_build_addr_expr (NULL_TREE
, vtab
);
7416 tmp
= gfc_class_vptr_get (dest
);
7417 gfc_add_modify (&block
, tmp
,
7418 fold_convert (TREE_TYPE (tmp
), vtab
));
7419 tmp
= gfc_class_data_get (dest
);
7420 tmp
= gfc_trans_alloc_subarray_assign (tmp
, cm
, expr
);
7421 gfc_add_expr_to_block (&block
, tmp
);
7423 else if (init
&& cm
->attr
.allocatable
&& expr
->expr_type
== EXPR_NULL
)
7425 /* NULL initialization for allocatable components. */
7426 gfc_add_modify (&block
, dest
, fold_convert (TREE_TYPE (dest
),
7427 null_pointer_node
));
7429 else if (init
&& (cm
->attr
.allocatable
7430 || (cm
->ts
.type
== BT_CLASS
&& CLASS_DATA (cm
)->attr
.allocatable
7431 && expr
->ts
.type
!= BT_CLASS
)))
7433 /* Take care about non-array allocatable components here. The alloc_*
7434 routine below is motivated by the alloc_scalar_allocatable_for_
7435 assignment() routine, but with the realloc portions removed and
7437 alloc_scalar_allocatable_for_subcomponent_assignment (&block
,
7442 /* The remainder of these instructions follow the if (cm->attr.pointer)
7443 if (!cm->attr.dimension) part above. */
7444 gfc_init_se (&se
, NULL
);
7445 gfc_conv_expr (&se
, expr
);
7446 gfc_add_block_to_block (&block
, &se
.pre
);
7448 if (expr
->symtree
&& expr
->symtree
->n
.sym
->attr
.proc_pointer
7449 && expr
->symtree
->n
.sym
->attr
.dummy
)
7450 se
.expr
= build_fold_indirect_ref_loc (input_location
, se
.expr
);
7452 if (cm
->ts
.type
== BT_CLASS
&& expr
->ts
.type
== BT_DERIVED
)
7454 tmp
= gfc_class_data_get (dest
);
7455 tmp
= build_fold_indirect_ref_loc (input_location
, tmp
);
7456 vtab
= gfc_get_symbol_decl (gfc_find_vtab (&expr
->ts
));
7457 vtab
= gfc_build_addr_expr (NULL_TREE
, vtab
);
7458 gfc_add_modify (&block
, gfc_class_vptr_get (dest
),
7459 fold_convert (TREE_TYPE (gfc_class_vptr_get (dest
)), vtab
));
7462 tmp
= build_fold_indirect_ref_loc (input_location
, dest
);
7464 /* For deferred strings insert a memcpy. */
7465 if (cm
->ts
.type
== BT_CHARACTER
&& cm
->ts
.deferred
)
7468 gcc_assert (se
.string_length
|| expr
->ts
.u
.cl
->backend_decl
);
7469 size
= size_of_string_in_bytes (cm
->ts
.kind
, se
.string_length
7471 : expr
->ts
.u
.cl
->backend_decl
);
7472 tmp
= gfc_build_memcpy_call (tmp
, se
.expr
, size
);
7473 gfc_add_expr_to_block (&block
, tmp
);
7476 gfc_add_modify (&block
, tmp
,
7477 fold_convert (TREE_TYPE (tmp
), se
.expr
));
7478 gfc_add_block_to_block (&block
, &se
.post
);
7480 else if (expr
->ts
.type
== BT_UNION
)
7483 gfc_constructor
*c
= gfc_constructor_first (expr
->value
.constructor
);
7484 /* We mark that the entire union should be initialized with a contrived
7485 EXPR_NULL expression at the beginning. */
7486 if (c
!= NULL
&& c
->n
.component
== NULL
7487 && c
->expr
!= NULL
&& c
->expr
->expr_type
== EXPR_NULL
)
7489 tmp
= build2_loc (input_location
, MODIFY_EXPR
, void_type_node
,
7490 dest
, build_constructor (TREE_TYPE (dest
), NULL
));
7491 gfc_add_expr_to_block (&block
, tmp
);
7492 c
= gfc_constructor_next (c
);
7494 /* The following constructor expression, if any, represents a specific
7495 map intializer, as given by the user. */
7496 if (c
!= NULL
&& c
->expr
!= NULL
)
7498 gcc_assert (expr
->expr_type
== EXPR_STRUCTURE
);
7499 tmp
= gfc_trans_structure_assign (dest
, expr
, expr
->symtree
!= NULL
);
7500 gfc_add_expr_to_block (&block
, tmp
);
7503 else if (expr
->ts
.type
== BT_DERIVED
&& expr
->ts
.f90_type
!= BT_VOID
)
7505 if (expr
->expr_type
!= EXPR_STRUCTURE
)
7507 tree dealloc
= NULL_TREE
;
7508 gfc_init_se (&se
, NULL
);
7509 gfc_conv_expr (&se
, expr
);
7510 gfc_add_block_to_block (&block
, &se
.pre
);
7511 /* Prevent repeat evaluations in gfc_copy_alloc_comp by fixing the
7512 expression in a temporary variable and deallocate the allocatable
7513 components. Then we can the copy the expression to the result. */
7514 if (cm
->ts
.u
.derived
->attr
.alloc_comp
7515 && expr
->expr_type
!= EXPR_VARIABLE
)
7517 se
.expr
= gfc_evaluate_now (se
.expr
, &block
);
7518 dealloc
= gfc_deallocate_alloc_comp (cm
->ts
.u
.derived
, se
.expr
,
7521 gfc_add_modify (&block
, dest
,
7522 fold_convert (TREE_TYPE (dest
), se
.expr
));
7523 if (cm
->ts
.u
.derived
->attr
.alloc_comp
7524 && expr
->expr_type
!= EXPR_NULL
)
7526 // TODO: Fix caf_mode
7527 tmp
= gfc_copy_alloc_comp (cm
->ts
.u
.derived
, se
.expr
,
7528 dest
, expr
->rank
, 0);
7529 gfc_add_expr_to_block (&block
, tmp
);
7530 if (dealloc
!= NULL_TREE
)
7531 gfc_add_expr_to_block (&block
, dealloc
);
7533 gfc_add_block_to_block (&block
, &se
.post
);
7537 /* Nested constructors. */
7538 tmp
= gfc_trans_structure_assign (dest
, expr
, expr
->symtree
!= NULL
);
7539 gfc_add_expr_to_block (&block
, tmp
);
7542 else if (gfc_deferred_strlen (cm
, &tmp
))
7546 gcc_assert (strlen
);
7547 strlen
= fold_build3_loc (input_location
, COMPONENT_REF
,
7549 TREE_OPERAND (dest
, 0),
7552 if (expr
->expr_type
== EXPR_NULL
)
7554 tmp
= build_int_cst (TREE_TYPE (cm
->backend_decl
), 0);
7555 gfc_add_modify (&block
, dest
, tmp
);
7556 tmp
= build_int_cst (TREE_TYPE (strlen
), 0);
7557 gfc_add_modify (&block
, strlen
, tmp
);
7562 gfc_init_se (&se
, NULL
);
7563 gfc_conv_expr (&se
, expr
);
7564 size
= size_of_string_in_bytes (cm
->ts
.kind
, se
.string_length
);
7565 tmp
= build_call_expr_loc (input_location
,
7566 builtin_decl_explicit (BUILT_IN_MALLOC
),
7568 gfc_add_modify (&block
, dest
,
7569 fold_convert (TREE_TYPE (dest
), tmp
));
7570 gfc_add_modify (&block
, strlen
,
7571 fold_convert (TREE_TYPE (strlen
), se
.string_length
));
7572 tmp
= gfc_build_memcpy_call (dest
, se
.expr
, size
);
7573 gfc_add_expr_to_block (&block
, tmp
);
7576 else if (!cm
->attr
.artificial
)
7578 /* Scalar component (excluding deferred parameters). */
7579 gfc_init_se (&se
, NULL
);
7580 gfc_init_se (&lse
, NULL
);
7582 gfc_conv_expr (&se
, expr
);
7583 if (cm
->ts
.type
== BT_CHARACTER
)
7584 lse
.string_length
= cm
->ts
.u
.cl
->backend_decl
;
7586 tmp
= gfc_trans_scalar_assign (&lse
, &se
, cm
->ts
, false, false);
7587 gfc_add_expr_to_block (&block
, tmp
);
7589 return gfc_finish_block (&block
);
7592 /* Assign a derived type constructor to a variable. */
7595 gfc_trans_structure_assign (tree dest
, gfc_expr
* expr
, bool init
, bool coarray
)
7604 gfc_start_block (&block
);
7605 cm
= expr
->ts
.u
.derived
->components
;
7607 if (expr
->ts
.u
.derived
->from_intmod
== INTMOD_ISO_C_BINDING
7608 && (expr
->ts
.u
.derived
->intmod_sym_id
== ISOCBINDING_PTR
7609 || expr
->ts
.u
.derived
->intmod_sym_id
== ISOCBINDING_FUNPTR
))
7613 gfc_init_se (&se
, NULL
);
7614 gfc_init_se (&lse
, NULL
);
7615 gfc_conv_expr (&se
, gfc_constructor_first (expr
->value
.constructor
)->expr
);
7617 gfc_add_modify (&block
, lse
.expr
,
7618 fold_convert (TREE_TYPE (lse
.expr
), se
.expr
));
7620 return gfc_finish_block (&block
);
7624 gfc_init_se (&se
, NULL
);
7626 for (c
= gfc_constructor_first (expr
->value
.constructor
);
7627 c
; c
= gfc_constructor_next (c
), cm
= cm
->next
)
7629 /* Skip absent members in default initializers. */
7630 if (!c
->expr
&& !cm
->attr
.allocatable
)
7633 /* Register the component with the caf-lib before it is initialized.
7634 Register only allocatable components, that are not coarray'ed
7635 components (%comp[*]). Only register when the constructor is not the
7637 if (coarray
&& !cm
->attr
.codimension
7638 && (cm
->attr
.allocatable
|| cm
->attr
.pointer
)
7639 && (!c
->expr
|| c
->expr
->expr_type
== EXPR_NULL
))
7641 tree token
, desc
, size
;
7642 bool is_array
= cm
->ts
.type
== BT_CLASS
7643 ? CLASS_DATA (cm
)->attr
.dimension
: cm
->attr
.dimension
;
7645 field
= cm
->backend_decl
;
7646 field
= fold_build3_loc (input_location
, COMPONENT_REF
,
7647 TREE_TYPE (field
), dest
, field
, NULL_TREE
);
7648 if (cm
->ts
.type
== BT_CLASS
)
7649 field
= gfc_class_data_get (field
);
7651 token
= is_array
? gfc_conv_descriptor_token (field
)
7652 : fold_build3_loc (input_location
, COMPONENT_REF
,
7653 TREE_TYPE (cm
->caf_token
), dest
,
7654 cm
->caf_token
, NULL_TREE
);
7658 /* The _caf_register routine looks at the rank of the array
7659 descriptor to decide whether the data registered is an array
7661 int rank
= cm
->ts
.type
== BT_CLASS
? CLASS_DATA (cm
)->as
->rank
7663 /* When the rank is not known just set a positive rank, which
7664 suffices to recognize the data as array. */
7667 size
= integer_zero_node
;
7669 gfc_add_modify (&block
, gfc_conv_descriptor_rank (desc
),
7670 build_int_cst (signed_char_type_node
, rank
));
7674 desc
= gfc_conv_scalar_to_descriptor (&se
, field
,
7675 cm
->ts
.type
== BT_CLASS
7676 ? CLASS_DATA (cm
)->attr
7678 size
= TYPE_SIZE_UNIT (TREE_TYPE (field
));
7680 gfc_add_block_to_block (&block
, &se
.pre
);
7681 tmp
= build_call_expr_loc (input_location
, gfor_fndecl_caf_register
,
7682 7, size
, build_int_cst (
7684 GFC_CAF_COARRAY_ALLOC_REGISTER_ONLY
),
7685 gfc_build_addr_expr (pvoid_type_node
,
7687 gfc_build_addr_expr (NULL_TREE
, desc
),
7688 null_pointer_node
, null_pointer_node
,
7690 gfc_add_expr_to_block (&block
, tmp
);
7692 field
= cm
->backend_decl
;
7693 tmp
= fold_build3_loc (input_location
, COMPONENT_REF
, TREE_TYPE (field
),
7694 dest
, field
, NULL_TREE
);
7697 gfc_expr
*e
= gfc_get_null_expr (NULL
);
7698 tmp
= gfc_trans_subcomponent_assign (tmp
, cm
, e
, expr
->ts
.u
.derived
,
7703 tmp
= gfc_trans_subcomponent_assign (tmp
, cm
, c
->expr
,
7704 expr
->ts
.u
.derived
, init
);
7705 gfc_add_expr_to_block (&block
, tmp
);
7707 return gfc_finish_block (&block
);
7711 gfc_conv_union_initializer (vec
<constructor_elt
, va_gc
> *v
,
7712 gfc_component
*un
, gfc_expr
*init
)
7714 gfc_constructor
*ctor
;
7716 if (un
->ts
.type
!= BT_UNION
|| un
== NULL
|| init
== NULL
)
7719 ctor
= gfc_constructor_first (init
->value
.constructor
);
7721 if (ctor
== NULL
|| ctor
->expr
== NULL
)
7724 gcc_assert (init
->expr_type
== EXPR_STRUCTURE
);
7726 /* If we have an 'initialize all' constructor, do it first. */
7727 if (ctor
->expr
->expr_type
== EXPR_NULL
)
7729 tree union_type
= TREE_TYPE (un
->backend_decl
);
7730 tree val
= build_constructor (union_type
, NULL
);
7731 CONSTRUCTOR_APPEND_ELT (v
, un
->backend_decl
, val
);
7732 ctor
= gfc_constructor_next (ctor
);
7735 /* Add the map initializer on top. */
7736 if (ctor
!= NULL
&& ctor
->expr
!= NULL
)
7738 gcc_assert (ctor
->expr
->expr_type
== EXPR_STRUCTURE
);
7739 tree val
= gfc_conv_initializer (ctor
->expr
, &un
->ts
,
7740 TREE_TYPE (un
->backend_decl
),
7741 un
->attr
.dimension
, un
->attr
.pointer
,
7742 un
->attr
.proc_pointer
);
7743 CONSTRUCTOR_APPEND_ELT (v
, un
->backend_decl
, val
);
7747 /* Build an expression for a constructor. If init is nonzero then
7748 this is part of a static variable initializer. */
7751 gfc_conv_structure (gfc_se
* se
, gfc_expr
* expr
, int init
)
7758 vec
<constructor_elt
, va_gc
> *v
= NULL
;
7760 gcc_assert (se
->ss
== NULL
);
7761 gcc_assert (expr
->expr_type
== EXPR_STRUCTURE
);
7762 type
= gfc_typenode_for_spec (&expr
->ts
);
7766 /* Create a temporary variable and fill it in. */
7767 se
->expr
= gfc_create_var (type
, expr
->ts
.u
.derived
->name
);
7768 /* The symtree in expr is NULL, if the code to generate is for
7769 initializing the static members only. */
7770 tmp
= gfc_trans_structure_assign (se
->expr
, expr
, expr
->symtree
!= NULL
,
7772 gfc_add_expr_to_block (&se
->pre
, tmp
);
7776 cm
= expr
->ts
.u
.derived
->components
;
7778 for (c
= gfc_constructor_first (expr
->value
.constructor
);
7779 c
; c
= gfc_constructor_next (c
), cm
= cm
->next
)
7781 /* Skip absent members in default initializers and allocatable
7782 components. Although the latter have a default initializer
7783 of EXPR_NULL,... by default, the static nullify is not needed
7784 since this is done every time we come into scope. */
7785 if (!c
->expr
|| (cm
->attr
.allocatable
&& cm
->attr
.flavor
!= FL_PROCEDURE
))
7788 if (cm
->initializer
&& cm
->initializer
->expr_type
!= EXPR_NULL
7789 && strcmp (cm
->name
, "_extends") == 0
7790 && cm
->initializer
->symtree
)
7794 vtabs
= cm
->initializer
->symtree
->n
.sym
;
7795 vtab
= gfc_build_addr_expr (NULL_TREE
, gfc_get_symbol_decl (vtabs
));
7796 vtab
= unshare_expr_without_location (vtab
);
7797 CONSTRUCTOR_APPEND_ELT (v
, cm
->backend_decl
, vtab
);
7799 else if (cm
->ts
.u
.derived
&& strcmp (cm
->name
, "_size") == 0)
7801 val
= TYPE_SIZE_UNIT (gfc_get_derived_type (cm
->ts
.u
.derived
));
7802 CONSTRUCTOR_APPEND_ELT (v
, cm
->backend_decl
,
7803 fold_convert (TREE_TYPE (cm
->backend_decl
),
7806 else if (cm
->ts
.type
== BT_INTEGER
&& strcmp (cm
->name
, "_len") == 0)
7807 CONSTRUCTOR_APPEND_ELT (v
, cm
->backend_decl
,
7808 fold_convert (TREE_TYPE (cm
->backend_decl
),
7809 integer_zero_node
));
7810 else if (cm
->ts
.type
== BT_UNION
)
7811 gfc_conv_union_initializer (v
, cm
, c
->expr
);
7814 val
= gfc_conv_initializer (c
->expr
, &cm
->ts
,
7815 TREE_TYPE (cm
->backend_decl
),
7816 cm
->attr
.dimension
, cm
->attr
.pointer
,
7817 cm
->attr
.proc_pointer
);
7818 val
= unshare_expr_without_location (val
);
7820 /* Append it to the constructor list. */
7821 CONSTRUCTOR_APPEND_ELT (v
, cm
->backend_decl
, val
);
7825 se
->expr
= build_constructor (type
, v
);
7827 TREE_CONSTANT (se
->expr
) = 1;
7831 /* Translate a substring expression. */
7834 gfc_conv_substring_expr (gfc_se
* se
, gfc_expr
* expr
)
7840 gcc_assert (ref
== NULL
|| ref
->type
== REF_SUBSTRING
);
7842 se
->expr
= gfc_build_wide_string_const (expr
->ts
.kind
,
7843 expr
->value
.character
.length
,
7844 expr
->value
.character
.string
);
7846 se
->string_length
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (se
->expr
)));
7847 TYPE_STRING_FLAG (TREE_TYPE (se
->expr
)) = 1;
7850 gfc_conv_substring (se
, ref
, expr
->ts
.kind
, NULL
, &expr
->where
);
7854 /* Entry point for expression translation. Evaluates a scalar quantity.
7855 EXPR is the expression to be translated, and SE is the state structure if
7856 called from within the scalarized. */
7859 gfc_conv_expr (gfc_se
* se
, gfc_expr
* expr
)
7864 if (ss
&& ss
->info
->expr
== expr
7865 && (ss
->info
->type
== GFC_SS_SCALAR
7866 || ss
->info
->type
== GFC_SS_REFERENCE
))
7868 gfc_ss_info
*ss_info
;
7871 /* Substitute a scalar expression evaluated outside the scalarization
7873 se
->expr
= ss_info
->data
.scalar
.value
;
7874 if (gfc_scalar_elemental_arg_saved_as_reference (ss_info
))
7875 se
->expr
= build_fold_indirect_ref_loc (input_location
, se
->expr
);
7877 se
->string_length
= ss_info
->string_length
;
7878 gfc_advance_se_ss_chain (se
);
7882 /* We need to convert the expressions for the iso_c_binding derived types.
7883 C_NULL_PTR and C_NULL_FUNPTR will be made EXPR_NULL, which evaluates to
7884 null_pointer_node. C_PTR and C_FUNPTR are converted to match the
7885 typespec for the C_PTR and C_FUNPTR symbols, which has already been
7886 updated to be an integer with a kind equal to the size of a (void *). */
7887 if (expr
->ts
.type
== BT_DERIVED
&& expr
->ts
.u
.derived
->ts
.f90_type
== BT_VOID
7888 && expr
->ts
.u
.derived
->attr
.is_bind_c
)
7890 if (expr
->expr_type
== EXPR_VARIABLE
7891 && (expr
->symtree
->n
.sym
->intmod_sym_id
== ISOCBINDING_NULL_PTR
7892 || expr
->symtree
->n
.sym
->intmod_sym_id
7893 == ISOCBINDING_NULL_FUNPTR
))
7895 /* Set expr_type to EXPR_NULL, which will result in
7896 null_pointer_node being used below. */
7897 expr
->expr_type
= EXPR_NULL
;
7901 /* Update the type/kind of the expression to be what the new
7902 type/kind are for the updated symbols of C_PTR/C_FUNPTR. */
7903 expr
->ts
.type
= BT_INTEGER
;
7904 expr
->ts
.f90_type
= BT_VOID
;
7905 expr
->ts
.kind
= gfc_index_integer_kind
;
7909 gfc_fix_class_refs (expr
);
7911 switch (expr
->expr_type
)
7914 gfc_conv_expr_op (se
, expr
);
7918 gfc_conv_function_expr (se
, expr
);
7922 gfc_conv_constant (se
, expr
);
7926 gfc_conv_variable (se
, expr
);
7930 se
->expr
= null_pointer_node
;
7933 case EXPR_SUBSTRING
:
7934 gfc_conv_substring_expr (se
, expr
);
7937 case EXPR_STRUCTURE
:
7938 gfc_conv_structure (se
, expr
, 0);
7942 gfc_conv_array_constructor_expr (se
, expr
);
7951 /* Like gfc_conv_expr_val, but the value is also suitable for use in the lhs
7952 of an assignment. */
7954 gfc_conv_expr_lhs (gfc_se
* se
, gfc_expr
* expr
)
7956 gfc_conv_expr (se
, expr
);
7957 /* All numeric lvalues should have empty post chains. If not we need to
7958 figure out a way of rewriting an lvalue so that it has no post chain. */
7959 gcc_assert (expr
->ts
.type
== BT_CHARACTER
|| !se
->post
.head
);
7962 /* Like gfc_conv_expr, but the POST block is guaranteed to be empty for
7963 numeric expressions. Used for scalar values where inserting cleanup code
7966 gfc_conv_expr_val (gfc_se
* se
, gfc_expr
* expr
)
7970 gcc_assert (expr
->ts
.type
!= BT_CHARACTER
);
7971 gfc_conv_expr (se
, expr
);
7974 val
= gfc_create_var (TREE_TYPE (se
->expr
), NULL
);
7975 gfc_add_modify (&se
->pre
, val
, se
->expr
);
7977 gfc_add_block_to_block (&se
->pre
, &se
->post
);
7981 /* Helper to translate an expression and convert it to a particular type. */
7983 gfc_conv_expr_type (gfc_se
* se
, gfc_expr
* expr
, tree type
)
7985 gfc_conv_expr_val (se
, expr
);
7986 se
->expr
= convert (type
, se
->expr
);
7990 /* Converts an expression so that it can be passed by reference. Scalar
7994 gfc_conv_expr_reference (gfc_se
* se
, gfc_expr
* expr
)
8000 if (ss
&& ss
->info
->expr
== expr
8001 && ss
->info
->type
== GFC_SS_REFERENCE
)
8003 /* Returns a reference to the scalar evaluated outside the loop
8005 gfc_conv_expr (se
, expr
);
8007 if (expr
->ts
.type
== BT_CHARACTER
8008 && expr
->expr_type
!= EXPR_FUNCTION
)
8009 gfc_conv_string_parameter (se
);
8011 se
->expr
= gfc_build_addr_expr (NULL_TREE
, se
->expr
);
8016 if (expr
->ts
.type
== BT_CHARACTER
)
8018 gfc_conv_expr (se
, expr
);
8019 gfc_conv_string_parameter (se
);
8023 if (expr
->expr_type
== EXPR_VARIABLE
)
8025 se
->want_pointer
= 1;
8026 gfc_conv_expr (se
, expr
);
8029 var
= gfc_create_var (TREE_TYPE (se
->expr
), NULL
);
8030 gfc_add_modify (&se
->pre
, var
, se
->expr
);
8031 gfc_add_block_to_block (&se
->pre
, &se
->post
);
8037 if (expr
->expr_type
== EXPR_FUNCTION
8038 && ((expr
->value
.function
.esym
8039 && expr
->value
.function
.esym
->result
->attr
.pointer
8040 && !expr
->value
.function
.esym
->result
->attr
.dimension
)
8041 || (!expr
->value
.function
.esym
&& !expr
->ref
8042 && expr
->symtree
->n
.sym
->attr
.pointer
8043 && !expr
->symtree
->n
.sym
->attr
.dimension
)))
8045 se
->want_pointer
= 1;
8046 gfc_conv_expr (se
, expr
);
8047 var
= gfc_create_var (TREE_TYPE (se
->expr
), NULL
);
8048 gfc_add_modify (&se
->pre
, var
, se
->expr
);
8053 gfc_conv_expr (se
, expr
);
8055 /* Create a temporary var to hold the value. */
8056 if (TREE_CONSTANT (se
->expr
))
8058 tree tmp
= se
->expr
;
8059 STRIP_TYPE_NOPS (tmp
);
8060 var
= build_decl (input_location
,
8061 CONST_DECL
, NULL
, TREE_TYPE (tmp
));
8062 DECL_INITIAL (var
) = tmp
;
8063 TREE_STATIC (var
) = 1;
8068 var
= gfc_create_var (TREE_TYPE (se
->expr
), NULL
);
8069 gfc_add_modify (&se
->pre
, var
, se
->expr
);
8071 gfc_add_block_to_block (&se
->pre
, &se
->post
);
8073 /* Take the address of that value. */
8074 se
->expr
= gfc_build_addr_expr (NULL_TREE
, var
);
8078 /* Get the _len component for an unlimited polymorphic expression. */
8081 trans_get_upoly_len (stmtblock_t
*block
, gfc_expr
*expr
)
8084 gfc_ref
*ref
= expr
->ref
;
8086 gfc_init_se (&se
, NULL
);
8087 while (ref
&& ref
->next
)
8089 gfc_add_len_component (expr
);
8090 gfc_conv_expr (&se
, expr
);
8091 gfc_add_block_to_block (block
, &se
.pre
);
8092 gcc_assert (se
.post
.head
== NULL_TREE
);
8095 gfc_free_ref_list (ref
->next
);
8100 gfc_free_ref_list (expr
->ref
);
8107 /* Assign _vptr and _len components as appropriate. BLOCK should be a
8108 statement-list outside of the scalarizer-loop. When code is generated, that
8109 depends on the scalarized expression, it is added to RSE.PRE.
8110 Returns le's _vptr tree and when set the len expressions in to_lenp and
8111 from_lenp to form a le%_vptr%_copy (re, le, [from_lenp, to_lenp])
8115 trans_class_vptr_len_assignment (stmtblock_t
*block
, gfc_expr
* le
,
8116 gfc_expr
* re
, gfc_se
*rse
,
8117 tree
* to_lenp
, tree
* from_lenp
)
8120 gfc_expr
* vptr_expr
;
8121 tree tmp
, to_len
= NULL_TREE
, from_len
= NULL_TREE
, lhs_vptr
;
8122 bool set_vptr
= false, temp_rhs
= false;
8123 stmtblock_t
*pre
= block
;
8125 /* Create a temporary for complicated expressions. */
8126 if (re
->expr_type
!= EXPR_VARIABLE
&& re
->expr_type
!= EXPR_NULL
8127 && rse
->expr
!= NULL_TREE
&& !DECL_P (rse
->expr
))
8129 tmp
= gfc_create_var (TREE_TYPE (rse
->expr
), "rhs");
8131 gfc_add_modify (&rse
->pre
, tmp
, rse
->expr
);
8136 /* Get the _vptr for the left-hand side expression. */
8137 gfc_init_se (&se
, NULL
);
8138 vptr_expr
= gfc_find_and_cut_at_last_class_ref (le
);
8139 if (vptr_expr
!= NULL
&& gfc_expr_attr (vptr_expr
).class_ok
)
8141 /* Care about _len for unlimited polymorphic entities. */
8142 if (UNLIMITED_POLY (vptr_expr
)
8143 || (vptr_expr
->ts
.type
== BT_DERIVED
8144 && vptr_expr
->ts
.u
.derived
->attr
.unlimited_polymorphic
))
8145 to_len
= trans_get_upoly_len (block
, vptr_expr
);
8146 gfc_add_vptr_component (vptr_expr
);
8150 vptr_expr
= gfc_lval_expr_from_sym (gfc_find_vtab (&le
->ts
));
8151 se
.want_pointer
= 1;
8152 gfc_conv_expr (&se
, vptr_expr
);
8153 gfc_free_expr (vptr_expr
);
8154 gfc_add_block_to_block (block
, &se
.pre
);
8155 gcc_assert (se
.post
.head
== NULL_TREE
);
8157 STRIP_NOPS (lhs_vptr
);
8159 /* Set the _vptr only when the left-hand side of the assignment is a
8163 /* Get the vptr from the rhs expression only, when it is variable.
8164 Functions are expected to be assigned to a temporary beforehand. */
8165 vptr_expr
= (re
->expr_type
== EXPR_VARIABLE
&& re
->ts
.type
== BT_CLASS
)
8166 ? gfc_find_and_cut_at_last_class_ref (re
)
8168 if (vptr_expr
!= NULL
&& vptr_expr
->ts
.type
== BT_CLASS
)
8170 if (to_len
!= NULL_TREE
)
8172 /* Get the _len information from the rhs. */
8173 if (UNLIMITED_POLY (vptr_expr
)
8174 || (vptr_expr
->ts
.type
== BT_DERIVED
8175 && vptr_expr
->ts
.u
.derived
->attr
.unlimited_polymorphic
))
8176 from_len
= trans_get_upoly_len (block
, vptr_expr
);
8178 gfc_add_vptr_component (vptr_expr
);
8182 if (re
->expr_type
== EXPR_VARIABLE
8183 && DECL_P (re
->symtree
->n
.sym
->backend_decl
)
8184 && DECL_LANG_SPECIFIC (re
->symtree
->n
.sym
->backend_decl
)
8185 && GFC_DECL_SAVED_DESCRIPTOR (re
->symtree
->n
.sym
->backend_decl
)
8186 && GFC_CLASS_TYPE_P (TREE_TYPE (GFC_DECL_SAVED_DESCRIPTOR (
8187 re
->symtree
->n
.sym
->backend_decl
))))
8190 se
.expr
= gfc_class_vptr_get (GFC_DECL_SAVED_DESCRIPTOR (
8191 re
->symtree
->n
.sym
->backend_decl
));
8193 from_len
= gfc_class_len_get (GFC_DECL_SAVED_DESCRIPTOR (
8194 re
->symtree
->n
.sym
->backend_decl
));
8196 else if (temp_rhs
&& re
->ts
.type
== BT_CLASS
)
8199 se
.expr
= gfc_class_vptr_get (rse
->expr
);
8200 if (UNLIMITED_POLY (re
))
8201 from_len
= gfc_class_len_get (rse
->expr
);
8203 else if (re
->expr_type
!= EXPR_NULL
)
8204 /* Only when rhs is non-NULL use its declared type for vptr
8206 vptr_expr
= gfc_lval_expr_from_sym (gfc_find_vtab (&re
->ts
));
8208 /* When the rhs is NULL use the vtab of lhs' declared type. */
8209 vptr_expr
= gfc_lval_expr_from_sym (gfc_find_vtab (&le
->ts
));
8214 gfc_init_se (&se
, NULL
);
8215 se
.want_pointer
= 1;
8216 gfc_conv_expr (&se
, vptr_expr
);
8217 gfc_free_expr (vptr_expr
);
8218 gfc_add_block_to_block (block
, &se
.pre
);
8219 gcc_assert (se
.post
.head
== NULL_TREE
);
8221 gfc_add_modify (pre
, lhs_vptr
, fold_convert (TREE_TYPE (lhs_vptr
),
8224 if (to_len
!= NULL_TREE
)
8226 /* The _len component needs to be set. Figure how to get the
8227 value of the right-hand side. */
8228 if (from_len
== NULL_TREE
)
8230 if (rse
->string_length
!= NULL_TREE
)
8231 from_len
= rse
->string_length
;
8232 else if (re
->ts
.type
== BT_CHARACTER
&& re
->ts
.u
.cl
->length
)
8234 from_len
= gfc_get_expr_charlen (re
);
8235 gfc_init_se (&se
, NULL
);
8236 gfc_conv_expr (&se
, re
->ts
.u
.cl
->length
);
8237 gfc_add_block_to_block (block
, &se
.pre
);
8238 gcc_assert (se
.post
.head
== NULL_TREE
);
8239 from_len
= gfc_evaluate_now (se
.expr
, block
);
8242 from_len
= build_zero_cst (gfc_charlen_type_node
);
8244 gfc_add_modify (pre
, to_len
, fold_convert (TREE_TYPE (to_len
),
8249 /* Return the _len trees only, when requested. */
8253 *from_lenp
= from_len
;
8258 /* Assign tokens for pointer components. */
8261 trans_caf_token_assign (gfc_se
*lse
, gfc_se
*rse
, gfc_expr
*expr1
,
8264 symbol_attribute lhs_attr
, rhs_attr
;
8265 tree tmp
, lhs_tok
, rhs_tok
;
8266 /* Flag to indicated component refs on the rhs. */
8269 lhs_attr
= gfc_caf_attr (expr1
);
8270 if (expr2
->expr_type
!= EXPR_NULL
)
8272 rhs_attr
= gfc_caf_attr (expr2
, false, &rhs_cr
);
8273 if (lhs_attr
.codimension
&& rhs_attr
.codimension
)
8275 lhs_tok
= gfc_get_ultimate_alloc_ptr_comps_caf_token (lse
, expr1
);
8276 lhs_tok
= build_fold_indirect_ref (lhs_tok
);
8279 rhs_tok
= gfc_get_ultimate_alloc_ptr_comps_caf_token (rse
, expr2
);
8283 caf_decl
= gfc_get_tree_for_caf_expr (expr2
);
8284 gfc_get_caf_token_offset (rse
, &rhs_tok
, NULL
, caf_decl
,
8287 tmp
= build2_loc (input_location
, MODIFY_EXPR
, void_type_node
,
8289 fold_convert (TREE_TYPE (lhs_tok
), rhs_tok
));
8290 gfc_prepend_expr_to_block (&lse
->post
, tmp
);
8293 else if (lhs_attr
.codimension
)
8295 lhs_tok
= gfc_get_ultimate_alloc_ptr_comps_caf_token (lse
, expr1
);
8296 lhs_tok
= build_fold_indirect_ref (lhs_tok
);
8297 tmp
= build2_loc (input_location
, MODIFY_EXPR
, void_type_node
,
8298 lhs_tok
, null_pointer_node
);
8299 gfc_prepend_expr_to_block (&lse
->post
, tmp
);
8303 /* Indentify class valued proc_pointer assignments. */
8306 pointer_assignment_is_proc_pointer (gfc_expr
* expr1
, gfc_expr
* expr2
)
8311 while (ref
&& ref
->next
)
8314 return ref
&& ref
->type
== REF_COMPONENT
8315 && ref
->u
.c
.component
->attr
.proc_pointer
8316 && expr2
->expr_type
== EXPR_VARIABLE
8317 && expr2
->symtree
->n
.sym
->attr
.flavor
== FL_PROCEDURE
;
8321 /* Do everything that is needed for a CLASS function expr2. */
8324 trans_class_pointer_fcn (stmtblock_t
*block
, gfc_se
*lse
, gfc_se
*rse
,
8325 gfc_expr
*expr1
, gfc_expr
*expr2
)
8327 tree expr1_vptr
= NULL_TREE
;
8330 gfc_conv_function_expr (rse
, expr2
);
8331 rse
->expr
= gfc_evaluate_now (rse
->expr
, &rse
->pre
);
8333 if (expr1
->ts
.type
!= BT_CLASS
)
8334 rse
->expr
= gfc_class_data_get (rse
->expr
);
8337 expr1_vptr
= trans_class_vptr_len_assignment (block
, expr1
,
8340 gfc_add_block_to_block (block
, &rse
->pre
);
8341 tmp
= gfc_create_var (TREE_TYPE (rse
->expr
), "ptrtemp");
8342 gfc_add_modify (&lse
->pre
, tmp
, rse
->expr
);
8344 gfc_add_modify (&lse
->pre
, expr1_vptr
,
8345 fold_convert (TREE_TYPE (expr1_vptr
),
8346 gfc_class_vptr_get (tmp
)));
8347 rse
->expr
= gfc_class_data_get (tmp
);
8355 gfc_trans_pointer_assign (gfc_code
* code
)
8357 return gfc_trans_pointer_assignment (code
->expr1
, code
->expr2
);
8361 /* Generate code for a pointer assignment. */
8364 gfc_trans_pointer_assignment (gfc_expr
* expr1
, gfc_expr
* expr2
)
8371 tree expr1_vptr
= NULL_TREE
;
8372 bool scalar
, non_proc_pointer_assign
;
8375 gfc_start_block (&block
);
8377 gfc_init_se (&lse
, NULL
);
8379 /* Usually testing whether this is not a proc pointer assignment. */
8380 non_proc_pointer_assign
= !pointer_assignment_is_proc_pointer (expr1
, expr2
);
8382 /* Check whether the expression is a scalar or not; we cannot use
8383 expr1->rank as it can be nonzero for proc pointers. */
8384 ss
= gfc_walk_expr (expr1
);
8385 scalar
= ss
== gfc_ss_terminator
;
8387 gfc_free_ss_chain (ss
);
8389 if (expr1
->ts
.type
== BT_DERIVED
&& expr2
->ts
.type
== BT_CLASS
8390 && expr2
->expr_type
!= EXPR_FUNCTION
&& non_proc_pointer_assign
)
8392 gfc_add_data_component (expr2
);
8393 /* The following is required as gfc_add_data_component doesn't
8394 update ts.type if there is a tailing REF_ARRAY. */
8395 expr2
->ts
.type
= BT_DERIVED
;
8400 /* Scalar pointers. */
8401 lse
.want_pointer
= 1;
8402 gfc_conv_expr (&lse
, expr1
);
8403 gfc_init_se (&rse
, NULL
);
8404 rse
.want_pointer
= 1;
8405 if (expr2
->expr_type
== EXPR_FUNCTION
&& expr2
->ts
.type
== BT_CLASS
)
8406 trans_class_pointer_fcn (&block
, &lse
, &rse
, expr1
, expr2
);
8408 gfc_conv_expr (&rse
, expr2
);
8410 if (non_proc_pointer_assign
&& expr1
->ts
.type
== BT_CLASS
)
8412 trans_class_vptr_len_assignment (&block
, expr1
, expr2
, &rse
, NULL
,
8414 lse
.expr
= gfc_class_data_get (lse
.expr
);
8417 if (expr1
->symtree
->n
.sym
->attr
.proc_pointer
8418 && expr1
->symtree
->n
.sym
->attr
.dummy
)
8419 lse
.expr
= build_fold_indirect_ref_loc (input_location
,
8422 if (expr2
->symtree
&& expr2
->symtree
->n
.sym
->attr
.proc_pointer
8423 && expr2
->symtree
->n
.sym
->attr
.dummy
)
8424 rse
.expr
= build_fold_indirect_ref_loc (input_location
,
8427 gfc_add_block_to_block (&block
, &lse
.pre
);
8428 gfc_add_block_to_block (&block
, &rse
.pre
);
8430 /* Check character lengths if character expression. The test is only
8431 really added if -fbounds-check is enabled. Exclude deferred
8432 character length lefthand sides. */
8433 if (expr1
->ts
.type
== BT_CHARACTER
&& expr2
->expr_type
!= EXPR_NULL
8434 && !expr1
->ts
.deferred
8435 && !expr1
->symtree
->n
.sym
->attr
.proc_pointer
8436 && !gfc_is_proc_ptr_comp (expr1
))
8438 gcc_assert (expr2
->ts
.type
== BT_CHARACTER
);
8439 gcc_assert (lse
.string_length
&& rse
.string_length
);
8440 gfc_trans_same_strlen_check ("pointer assignment", &expr1
->where
,
8441 lse
.string_length
, rse
.string_length
,
8445 /* The assignment to an deferred character length sets the string
8446 length to that of the rhs. */
8447 if (expr1
->ts
.deferred
)
8449 if (expr2
->expr_type
!= EXPR_NULL
&& lse
.string_length
!= NULL
)
8450 gfc_add_modify (&block
, lse
.string_length
,
8451 fold_convert (TREE_TYPE (lse
.string_length
),
8452 rse
.string_length
));
8453 else if (lse
.string_length
!= NULL
)
8454 gfc_add_modify (&block
, lse
.string_length
,
8455 build_zero_cst (TREE_TYPE (lse
.string_length
)));
8458 gfc_add_modify (&block
, lse
.expr
,
8459 fold_convert (TREE_TYPE (lse
.expr
), rse
.expr
));
8461 /* Also set the tokens for pointer components in derived typed
8463 if (flag_coarray
== GFC_FCOARRAY_LIB
)
8464 trans_caf_token_assign (&lse
, &rse
, expr1
, expr2
);
8466 gfc_add_block_to_block (&block
, &rse
.post
);
8467 gfc_add_block_to_block (&block
, &lse
.post
);
8474 tree strlen_rhs
= NULL_TREE
;
8476 /* Array pointer. Find the last reference on the LHS and if it is an
8477 array section ref, we're dealing with bounds remapping. In this case,
8478 set it to AR_FULL so that gfc_conv_expr_descriptor does
8479 not see it and process the bounds remapping afterwards explicitly. */
8480 for (remap
= expr1
->ref
; remap
; remap
= remap
->next
)
8481 if (!remap
->next
&& remap
->type
== REF_ARRAY
8482 && remap
->u
.ar
.type
== AR_SECTION
)
8484 rank_remap
= (remap
&& remap
->u
.ar
.end
[0]);
8486 gfc_init_se (&lse
, NULL
);
8488 lse
.descriptor_only
= 1;
8489 gfc_conv_expr_descriptor (&lse
, expr1
);
8490 strlen_lhs
= lse
.string_length
;
8493 if (expr2
->expr_type
== EXPR_NULL
)
8495 /* Just set the data pointer to null. */
8496 gfc_conv_descriptor_data_set (&lse
.pre
, lse
.expr
, null_pointer_node
);
8498 else if (rank_remap
)
8500 /* If we are rank-remapping, just get the RHS's descriptor and
8501 process this later on. */
8502 gfc_init_se (&rse
, NULL
);
8503 rse
.direct_byref
= 1;
8504 rse
.byref_noassign
= 1;
8506 if (expr2
->expr_type
== EXPR_FUNCTION
&& expr2
->ts
.type
== BT_CLASS
)
8507 expr1_vptr
= trans_class_pointer_fcn (&block
, &lse
, &rse
,
8509 else if (expr2
->expr_type
== EXPR_FUNCTION
)
8511 tree bound
[GFC_MAX_DIMENSIONS
];
8514 for (i
= 0; i
< expr2
->rank
; i
++)
8515 bound
[i
] = NULL_TREE
;
8516 tmp
= gfc_typenode_for_spec (&expr2
->ts
);
8517 tmp
= gfc_get_array_type_bounds (tmp
, expr2
->rank
, 0,
8519 GFC_ARRAY_POINTER_CONT
, false);
8520 tmp
= gfc_create_var (tmp
, "ptrtemp");
8521 rse
.descriptor_only
= 0;
8523 rse
.direct_byref
= 1;
8524 gfc_conv_expr_descriptor (&rse
, expr2
);
8525 strlen_rhs
= rse
.string_length
;
8530 gfc_conv_expr_descriptor (&rse
, expr2
);
8531 strlen_rhs
= rse
.string_length
;
8532 if (expr1
->ts
.type
== BT_CLASS
)
8533 expr1_vptr
= trans_class_vptr_len_assignment (&block
, expr1
,
8538 else if (expr2
->expr_type
== EXPR_VARIABLE
)
8540 /* Assign directly to the LHS's descriptor. */
8541 lse
.descriptor_only
= 0;
8542 lse
.direct_byref
= 1;
8543 gfc_conv_expr_descriptor (&lse
, expr2
);
8544 strlen_rhs
= lse
.string_length
;
8546 if (expr1
->ts
.type
== BT_CLASS
)
8548 rse
.expr
= NULL_TREE
;
8549 rse
.string_length
= NULL_TREE
;
8550 trans_class_vptr_len_assignment (&block
, expr1
, expr2
, &rse
,
8556 /* If the target is not a whole array, use the target array
8557 reference for remap. */
8558 for (remap
= expr2
->ref
; remap
; remap
= remap
->next
)
8559 if (remap
->type
== REF_ARRAY
8560 && remap
->u
.ar
.type
== AR_FULL
8565 else if (expr2
->expr_type
== EXPR_FUNCTION
&& expr2
->ts
.type
== BT_CLASS
)
8567 gfc_init_se (&rse
, NULL
);
8568 rse
.want_pointer
= 1;
8569 gfc_conv_function_expr (&rse
, expr2
);
8570 if (expr1
->ts
.type
!= BT_CLASS
)
8572 rse
.expr
= gfc_class_data_get (rse
.expr
);
8573 gfc_add_modify (&lse
.pre
, desc
, rse
.expr
);
8574 /* Set the lhs span. */
8575 tmp
= TREE_TYPE (rse
.expr
);
8576 tmp
= TYPE_SIZE_UNIT (gfc_get_element_type (tmp
));
8577 tmp
= fold_convert (gfc_array_index_type
, tmp
);
8578 gfc_conv_descriptor_span_set (&lse
.pre
, desc
, tmp
);
8582 expr1_vptr
= trans_class_vptr_len_assignment (&block
, expr1
,
8585 gfc_add_block_to_block (&block
, &rse
.pre
);
8586 tmp
= gfc_create_var (TREE_TYPE (rse
.expr
), "ptrtemp");
8587 gfc_add_modify (&lse
.pre
, tmp
, rse
.expr
);
8589 gfc_add_modify (&lse
.pre
, expr1_vptr
,
8590 fold_convert (TREE_TYPE (expr1_vptr
),
8591 gfc_class_vptr_get (tmp
)));
8592 rse
.expr
= gfc_class_data_get (tmp
);
8593 gfc_add_modify (&lse
.pre
, desc
, rse
.expr
);
8598 /* Assign to a temporary descriptor and then copy that
8599 temporary to the pointer. */
8600 tmp
= gfc_create_var (TREE_TYPE (desc
), "ptrtemp");
8601 lse
.descriptor_only
= 0;
8603 lse
.direct_byref
= 1;
8604 gfc_conv_expr_descriptor (&lse
, expr2
);
8605 strlen_rhs
= lse
.string_length
;
8606 gfc_add_modify (&lse
.pre
, desc
, tmp
);
8609 gfc_add_block_to_block (&block
, &lse
.pre
);
8611 gfc_add_block_to_block (&block
, &rse
.pre
);
8613 /* If we do bounds remapping, update LHS descriptor accordingly. */
8617 gcc_assert (remap
->u
.ar
.dimen
== expr1
->rank
);
8621 /* Do rank remapping. We already have the RHS's descriptor
8622 converted in rse and now have to build the correct LHS
8623 descriptor for it. */
8625 tree dtype
, data
, span
;
8627 tree lbound
, ubound
;
8630 dtype
= gfc_conv_descriptor_dtype (desc
);
8631 tmp
= gfc_get_dtype (TREE_TYPE (desc
));
8632 gfc_add_modify (&block
, dtype
, tmp
);
8634 /* Copy data pointer. */
8635 data
= gfc_conv_descriptor_data_get (rse
.expr
);
8636 gfc_conv_descriptor_data_set (&block
, desc
, data
);
8638 /* Copy the span. */
8639 if (TREE_CODE (rse
.expr
) == VAR_DECL
8640 && GFC_DECL_PTR_ARRAY_P (rse
.expr
))
8641 span
= gfc_conv_descriptor_span_get (rse
.expr
);
8644 tmp
= TREE_TYPE (rse
.expr
);
8645 tmp
= TYPE_SIZE_UNIT (gfc_get_element_type (tmp
));
8646 span
= fold_convert (gfc_array_index_type
, tmp
);
8648 gfc_conv_descriptor_span_set (&block
, desc
, span
);
8650 /* Copy offset but adjust it such that it would correspond
8651 to a lbound of zero. */
8652 offs
= gfc_conv_descriptor_offset_get (rse
.expr
);
8653 for (dim
= 0; dim
< expr2
->rank
; ++dim
)
8655 stride
= gfc_conv_descriptor_stride_get (rse
.expr
,
8657 lbound
= gfc_conv_descriptor_lbound_get (rse
.expr
,
8659 tmp
= fold_build2_loc (input_location
, MULT_EXPR
,
8660 gfc_array_index_type
, stride
, lbound
);
8661 offs
= fold_build2_loc (input_location
, PLUS_EXPR
,
8662 gfc_array_index_type
, offs
, tmp
);
8664 gfc_conv_descriptor_offset_set (&block
, desc
, offs
);
8666 /* Set the bounds as declared for the LHS and calculate strides as
8667 well as another offset update accordingly. */
8668 stride
= gfc_conv_descriptor_stride_get (rse
.expr
,
8670 for (dim
= 0; dim
< expr1
->rank
; ++dim
)
8675 gcc_assert (remap
->u
.ar
.start
[dim
] && remap
->u
.ar
.end
[dim
]);
8677 /* Convert declared bounds. */
8678 gfc_init_se (&lower_se
, NULL
);
8679 gfc_init_se (&upper_se
, NULL
);
8680 gfc_conv_expr (&lower_se
, remap
->u
.ar
.start
[dim
]);
8681 gfc_conv_expr (&upper_se
, remap
->u
.ar
.end
[dim
]);
8683 gfc_add_block_to_block (&block
, &lower_se
.pre
);
8684 gfc_add_block_to_block (&block
, &upper_se
.pre
);
8686 lbound
= fold_convert (gfc_array_index_type
, lower_se
.expr
);
8687 ubound
= fold_convert (gfc_array_index_type
, upper_se
.expr
);
8689 lbound
= gfc_evaluate_now (lbound
, &block
);
8690 ubound
= gfc_evaluate_now (ubound
, &block
);
8692 gfc_add_block_to_block (&block
, &lower_se
.post
);
8693 gfc_add_block_to_block (&block
, &upper_se
.post
);
8695 /* Set bounds in descriptor. */
8696 gfc_conv_descriptor_lbound_set (&block
, desc
,
8697 gfc_rank_cst
[dim
], lbound
);
8698 gfc_conv_descriptor_ubound_set (&block
, desc
,
8699 gfc_rank_cst
[dim
], ubound
);
8702 stride
= gfc_evaluate_now (stride
, &block
);
8703 gfc_conv_descriptor_stride_set (&block
, desc
,
8704 gfc_rank_cst
[dim
], stride
);
8706 /* Update offset. */
8707 offs
= gfc_conv_descriptor_offset_get (desc
);
8708 tmp
= fold_build2_loc (input_location
, MULT_EXPR
,
8709 gfc_array_index_type
, lbound
, stride
);
8710 offs
= fold_build2_loc (input_location
, MINUS_EXPR
,
8711 gfc_array_index_type
, offs
, tmp
);
8712 offs
= gfc_evaluate_now (offs
, &block
);
8713 gfc_conv_descriptor_offset_set (&block
, desc
, offs
);
8715 /* Update stride. */
8716 tmp
= gfc_conv_array_extent_dim (lbound
, ubound
, NULL
);
8717 stride
= fold_build2_loc (input_location
, MULT_EXPR
,
8718 gfc_array_index_type
, stride
, tmp
);
8723 /* Bounds remapping. Just shift the lower bounds. */
8725 gcc_assert (expr1
->rank
== expr2
->rank
);
8727 for (dim
= 0; dim
< remap
->u
.ar
.dimen
; ++dim
)
8731 gcc_assert (!remap
->u
.ar
.end
[dim
]);
8732 gfc_init_se (&lbound_se
, NULL
);
8733 if (remap
->u
.ar
.start
[dim
])
8735 gfc_conv_expr (&lbound_se
, remap
->u
.ar
.start
[dim
]);
8736 gfc_add_block_to_block (&block
, &lbound_se
.pre
);
8739 /* This remap arises from a target that is not a whole
8740 array. The start expressions will be NULL but we need
8741 the lbounds to be one. */
8742 lbound_se
.expr
= gfc_index_one_node
;
8743 gfc_conv_shift_descriptor_lbound (&block
, desc
,
8744 dim
, lbound_se
.expr
);
8745 gfc_add_block_to_block (&block
, &lbound_se
.post
);
8750 /* Check string lengths if applicable. The check is only really added
8751 to the output code if -fbounds-check is enabled. */
8752 if (expr1
->ts
.type
== BT_CHARACTER
&& expr2
->expr_type
!= EXPR_NULL
)
8754 gcc_assert (expr2
->ts
.type
== BT_CHARACTER
);
8755 gcc_assert (strlen_lhs
&& strlen_rhs
);
8756 gfc_trans_same_strlen_check ("pointer assignment", &expr1
->where
,
8757 strlen_lhs
, strlen_rhs
, &block
);
8760 /* If rank remapping was done, check with -fcheck=bounds that
8761 the target is at least as large as the pointer. */
8762 if (rank_remap
&& (gfc_option
.rtcheck
& GFC_RTCHECK_BOUNDS
))
8768 lsize
= gfc_conv_descriptor_size (lse
.expr
, expr1
->rank
);
8769 rsize
= gfc_conv_descriptor_size (rse
.expr
, expr2
->rank
);
8771 lsize
= gfc_evaluate_now (lsize
, &block
);
8772 rsize
= gfc_evaluate_now (rsize
, &block
);
8773 fault
= fold_build2_loc (input_location
, LT_EXPR
, logical_type_node
,
8776 msg
= _("Target of rank remapping is too small (%ld < %ld)");
8777 gfc_trans_runtime_check (true, false, fault
, &block
, &expr2
->where
,
8781 gfc_add_block_to_block (&block
, &lse
.post
);
8783 gfc_add_block_to_block (&block
, &rse
.post
);
8786 return gfc_finish_block (&block
);
8790 /* Makes sure se is suitable for passing as a function string parameter. */
8791 /* TODO: Need to check all callers of this function. It may be abused. */
8794 gfc_conv_string_parameter (gfc_se
* se
)
8798 if (TREE_CODE (se
->expr
) == STRING_CST
)
8800 type
= TREE_TYPE (TREE_TYPE (se
->expr
));
8801 se
->expr
= gfc_build_addr_expr (build_pointer_type (type
), se
->expr
);
8805 if (TYPE_STRING_FLAG (TREE_TYPE (se
->expr
)))
8807 if (TREE_CODE (se
->expr
) != INDIRECT_REF
)
8809 type
= TREE_TYPE (se
->expr
);
8810 se
->expr
= gfc_build_addr_expr (build_pointer_type (type
), se
->expr
);
8814 type
= gfc_get_character_type_len (gfc_default_character_kind
,
8816 type
= build_pointer_type (type
);
8817 se
->expr
= gfc_build_addr_expr (type
, se
->expr
);
8821 gcc_assert (POINTER_TYPE_P (TREE_TYPE (se
->expr
)));
8825 /* Generate code for assignment of scalar variables. Includes character
8826 strings and derived types with allocatable components.
8827 If you know that the LHS has no allocations, set dealloc to false.
8829 DEEP_COPY has no effect if the typespec TS is not a derived type with
8830 allocatable components. Otherwise, if it is set, an explicit copy of each
8831 allocatable component is made. This is necessary as a simple copy of the
8832 whole object would copy array descriptors as is, so that the lhs's
8833 allocatable components would point to the rhs's after the assignment.
8834 Typically, setting DEEP_COPY is necessary if the rhs is a variable, and not
8835 necessary if the rhs is a non-pointer function, as the allocatable components
8836 are not accessible by other means than the function's result after the
8837 function has returned. It is even more subtle when temporaries are involved,
8838 as the two following examples show:
8839 1. When we evaluate an array constructor, a temporary is created. Thus
8840 there is theoretically no alias possible. However, no deep copy is
8841 made for this temporary, so that if the constructor is made of one or
8842 more variable with allocatable components, those components still point
8843 to the variable's: DEEP_COPY should be set for the assignment from the
8844 temporary to the lhs in that case.
8845 2. When assigning a scalar to an array, we evaluate the scalar value out
8846 of the loop, store it into a temporary variable, and assign from that.
8847 In that case, deep copying when assigning to the temporary would be a
8848 waste of resources; however deep copies should happen when assigning from
8849 the temporary to each array element: again DEEP_COPY should be set for
8850 the assignment from the temporary to the lhs. */
8853 gfc_trans_scalar_assign (gfc_se
* lse
, gfc_se
* rse
, gfc_typespec ts
,
8854 bool deep_copy
, bool dealloc
, bool in_coarray
)
8860 gfc_init_block (&block
);
8862 if (ts
.type
== BT_CHARACTER
)
8867 if (lse
->string_length
!= NULL_TREE
)
8869 gfc_conv_string_parameter (lse
);
8870 gfc_add_block_to_block (&block
, &lse
->pre
);
8871 llen
= lse
->string_length
;
8874 if (rse
->string_length
!= NULL_TREE
)
8876 gfc_conv_string_parameter (rse
);
8877 gfc_add_block_to_block (&block
, &rse
->pre
);
8878 rlen
= rse
->string_length
;
8881 gfc_trans_string_copy (&block
, llen
, lse
->expr
, ts
.kind
, rlen
,
8882 rse
->expr
, ts
.kind
);
8884 else if (gfc_bt_struct (ts
.type
)
8885 && (ts
.u
.derived
->attr
.alloc_comp
8886 || (deep_copy
&& ts
.u
.derived
->attr
.pdt_type
)))
8888 tree tmp_var
= NULL_TREE
;
8891 /* Are the rhs and the lhs the same? */
8894 cond
= fold_build2_loc (input_location
, EQ_EXPR
, logical_type_node
,
8895 gfc_build_addr_expr (NULL_TREE
, lse
->expr
),
8896 gfc_build_addr_expr (NULL_TREE
, rse
->expr
));
8897 cond
= gfc_evaluate_now (cond
, &lse
->pre
);
8900 /* Deallocate the lhs allocated components as long as it is not
8901 the same as the rhs. This must be done following the assignment
8902 to prevent deallocating data that could be used in the rhs
8906 tmp_var
= gfc_evaluate_now (lse
->expr
, &lse
->pre
);
8907 tmp
= gfc_deallocate_alloc_comp_no_caf (ts
.u
.derived
, tmp_var
, 0);
8909 tmp
= build3_v (COND_EXPR
, cond
, build_empty_stmt (input_location
),
8911 gfc_add_expr_to_block (&lse
->post
, tmp
);
8914 gfc_add_block_to_block (&block
, &rse
->pre
);
8915 gfc_add_block_to_block (&block
, &lse
->pre
);
8917 gfc_add_modify (&block
, lse
->expr
,
8918 fold_convert (TREE_TYPE (lse
->expr
), rse
->expr
));
8920 /* Restore pointer address of coarray components. */
8921 if (ts
.u
.derived
->attr
.coarray_comp
&& deep_copy
&& tmp_var
!= NULL_TREE
)
8923 tmp
= gfc_reassign_alloc_comp_caf (ts
.u
.derived
, tmp_var
, lse
->expr
);
8924 tmp
= build3_v (COND_EXPR
, cond
, build_empty_stmt (input_location
),
8926 gfc_add_expr_to_block (&block
, tmp
);
8929 /* Do a deep copy if the rhs is a variable, if it is not the
8933 int caf_mode
= in_coarray
? (GFC_STRUCTURE_CAF_MODE_ENABLE_COARRAY
8934 | GFC_STRUCTURE_CAF_MODE_IN_COARRAY
) : 0;
8935 tmp
= gfc_copy_alloc_comp (ts
.u
.derived
, rse
->expr
, lse
->expr
, 0,
8937 tmp
= build3_v (COND_EXPR
, cond
, build_empty_stmt (input_location
),
8939 gfc_add_expr_to_block (&block
, tmp
);
8942 else if (gfc_bt_struct (ts
.type
) || ts
.type
== BT_CLASS
)
8944 gfc_add_block_to_block (&block
, &lse
->pre
);
8945 gfc_add_block_to_block (&block
, &rse
->pre
);
8946 tmp
= fold_build1_loc (input_location
, VIEW_CONVERT_EXPR
,
8947 TREE_TYPE (lse
->expr
), rse
->expr
);
8948 gfc_add_modify (&block
, lse
->expr
, tmp
);
8952 gfc_add_block_to_block (&block
, &lse
->pre
);
8953 gfc_add_block_to_block (&block
, &rse
->pre
);
8955 gfc_add_modify (&block
, lse
->expr
,
8956 fold_convert (TREE_TYPE (lse
->expr
), rse
->expr
));
8959 gfc_add_block_to_block (&block
, &lse
->post
);
8960 gfc_add_block_to_block (&block
, &rse
->post
);
8962 return gfc_finish_block (&block
);
8966 /* There are quite a lot of restrictions on the optimisation in using an
8967 array function assign without a temporary. */
8970 arrayfunc_assign_needs_temporary (gfc_expr
* expr1
, gfc_expr
* expr2
)
8973 bool seen_array_ref
;
8975 gfc_symbol
*sym
= expr1
->symtree
->n
.sym
;
8977 /* Play it safe with class functions assigned to a derived type. */
8978 if (gfc_is_class_array_function (expr2
)
8979 && expr1
->ts
.type
== BT_DERIVED
)
8982 /* The caller has already checked rank>0 and expr_type == EXPR_FUNCTION. */
8983 if (expr2
->value
.function
.isym
&& !gfc_is_intrinsic_libcall (expr2
))
8986 /* Elemental functions are scalarized so that they don't need a
8987 temporary in gfc_trans_assignment_1, so return a true. Otherwise,
8988 they would need special treatment in gfc_trans_arrayfunc_assign. */
8989 if (expr2
->value
.function
.esym
!= NULL
8990 && expr2
->value
.function
.esym
->attr
.elemental
)
8993 /* Need a temporary if rhs is not FULL or a contiguous section. */
8994 if (expr1
->ref
&& !(gfc_full_array_ref_p (expr1
->ref
, &c
) || c
))
8997 /* Need a temporary if EXPR1 can't be expressed as a descriptor. */
8998 if (gfc_ref_needs_temporary_p (expr1
->ref
))
9001 /* Functions returning pointers or allocatables need temporaries. */
9002 c
= expr2
->value
.function
.esym
9003 ? (expr2
->value
.function
.esym
->attr
.pointer
9004 || expr2
->value
.function
.esym
->attr
.allocatable
)
9005 : (expr2
->symtree
->n
.sym
->attr
.pointer
9006 || expr2
->symtree
->n
.sym
->attr
.allocatable
);
9010 /* Character array functions need temporaries unless the
9011 character lengths are the same. */
9012 if (expr2
->ts
.type
== BT_CHARACTER
&& expr2
->rank
> 0)
9014 if (expr1
->ts
.u
.cl
->length
== NULL
9015 || expr1
->ts
.u
.cl
->length
->expr_type
!= EXPR_CONSTANT
)
9018 if (expr2
->ts
.u
.cl
->length
== NULL
9019 || expr2
->ts
.u
.cl
->length
->expr_type
!= EXPR_CONSTANT
)
9022 if (mpz_cmp (expr1
->ts
.u
.cl
->length
->value
.integer
,
9023 expr2
->ts
.u
.cl
->length
->value
.integer
) != 0)
9027 /* Check that no LHS component references appear during an array
9028 reference. This is needed because we do not have the means to
9029 span any arbitrary stride with an array descriptor. This check
9030 is not needed for the rhs because the function result has to be
9032 seen_array_ref
= false;
9033 for (ref
= expr1
->ref
; ref
; ref
= ref
->next
)
9035 if (ref
->type
== REF_ARRAY
)
9036 seen_array_ref
= true;
9037 else if (ref
->type
== REF_COMPONENT
&& seen_array_ref
)
9041 /* Check for a dependency. */
9042 if (gfc_check_fncall_dependency (expr1
, INTENT_OUT
,
9043 expr2
->value
.function
.esym
,
9044 expr2
->value
.function
.actual
,
9048 /* If we have reached here with an intrinsic function, we do not
9049 need a temporary except in the particular case that reallocation
9050 on assignment is active and the lhs is allocatable and a target. */
9051 if (expr2
->value
.function
.isym
)
9052 return (flag_realloc_lhs
&& sym
->attr
.allocatable
&& sym
->attr
.target
);
9054 /* If the LHS is a dummy, we need a temporary if it is not
9056 if (sym
->attr
.dummy
&& sym
->attr
.intent
!= INTENT_OUT
)
9059 /* If the lhs has been host_associated, is in common, a pointer or is
9060 a target and the function is not using a RESULT variable, aliasing
9061 can occur and a temporary is needed. */
9062 if ((sym
->attr
.host_assoc
9063 || sym
->attr
.in_common
9064 || sym
->attr
.pointer
9065 || sym
->attr
.cray_pointee
9066 || sym
->attr
.target
)
9067 && expr2
->symtree
!= NULL
9068 && expr2
->symtree
->n
.sym
== expr2
->symtree
->n
.sym
->result
)
9071 /* A PURE function can unconditionally be called without a temporary. */
9072 if (expr2
->value
.function
.esym
!= NULL
9073 && expr2
->value
.function
.esym
->attr
.pure
)
9076 /* Implicit_pure functions are those which could legally be declared
9078 if (expr2
->value
.function
.esym
!= NULL
9079 && expr2
->value
.function
.esym
->attr
.implicit_pure
)
9082 if (!sym
->attr
.use_assoc
9083 && !sym
->attr
.in_common
9084 && !sym
->attr
.pointer
9085 && !sym
->attr
.target
9086 && !sym
->attr
.cray_pointee
9087 && expr2
->value
.function
.esym
)
9089 /* A temporary is not needed if the function is not contained and
9090 the variable is local or host associated and not a pointer or
9092 if (!expr2
->value
.function
.esym
->attr
.contained
)
9095 /* A temporary is not needed if the lhs has never been host
9096 associated and the procedure is contained. */
9097 else if (!sym
->attr
.host_assoc
)
9100 /* A temporary is not needed if the variable is local and not
9101 a pointer, a target or a result. */
9103 && expr2
->value
.function
.esym
->ns
== sym
->ns
->parent
)
9107 /* Default to temporary use. */
9112 /* Provide the loop info so that the lhs descriptor can be built for
9113 reallocatable assignments from extrinsic function calls. */
9116 realloc_lhs_loop_for_fcn_call (gfc_se
*se
, locus
*where
, gfc_ss
**ss
,
9119 /* Signal that the function call should not be made by
9120 gfc_conv_loop_setup. */
9121 se
->ss
->is_alloc_lhs
= 1;
9122 gfc_init_loopinfo (loop
);
9123 gfc_add_ss_to_loop (loop
, *ss
);
9124 gfc_add_ss_to_loop (loop
, se
->ss
);
9125 gfc_conv_ss_startstride (loop
);
9126 gfc_conv_loop_setup (loop
, where
);
9127 gfc_copy_loopinfo_to_se (se
, loop
);
9128 gfc_add_block_to_block (&se
->pre
, &loop
->pre
);
9129 gfc_add_block_to_block (&se
->pre
, &loop
->post
);
9130 se
->ss
->is_alloc_lhs
= 0;
9134 /* For assignment to a reallocatable lhs from intrinsic functions,
9135 replace the se.expr (ie. the result) with a temporary descriptor.
9136 Null the data field so that the library allocates space for the
9137 result. Free the data of the original descriptor after the function,
9138 in case it appears in an argument expression and transfer the
9139 result to the original descriptor. */
9142 fcncall_realloc_result (gfc_se
*se
, int rank
)
9151 /* Use the allocation done by the library. Substitute the lhs
9152 descriptor with a copy, whose data field is nulled.*/
9153 desc
= build_fold_indirect_ref_loc (input_location
, se
->expr
);
9154 if (POINTER_TYPE_P (TREE_TYPE (desc
)))
9155 desc
= build_fold_indirect_ref_loc (input_location
, desc
);
9157 /* Unallocated, the descriptor does not have a dtype. */
9158 tmp
= gfc_conv_descriptor_dtype (desc
);
9159 gfc_add_modify (&se
->pre
, tmp
, gfc_get_dtype (TREE_TYPE (desc
)));
9161 res_desc
= gfc_evaluate_now (desc
, &se
->pre
);
9162 gfc_conv_descriptor_data_set (&se
->pre
, res_desc
, null_pointer_node
);
9163 se
->expr
= gfc_build_addr_expr (NULL_TREE
, res_desc
);
9165 /* Free the lhs after the function call and copy the result data to
9166 the lhs descriptor. */
9167 tmp
= gfc_conv_descriptor_data_get (desc
);
9168 zero_cond
= fold_build2_loc (input_location
, EQ_EXPR
,
9169 logical_type_node
, tmp
,
9170 build_int_cst (TREE_TYPE (tmp
), 0));
9171 zero_cond
= gfc_evaluate_now (zero_cond
, &se
->post
);
9172 tmp
= gfc_call_free (tmp
);
9173 gfc_add_expr_to_block (&se
->post
, tmp
);
9175 tmp
= gfc_conv_descriptor_data_get (res_desc
);
9176 gfc_conv_descriptor_data_set (&se
->post
, desc
, tmp
);
9178 /* Check that the shapes are the same between lhs and expression. */
9179 for (n
= 0 ; n
< rank
; n
++)
9182 tmp
= gfc_conv_descriptor_lbound_get (desc
, gfc_rank_cst
[n
]);
9183 tmp1
= gfc_conv_descriptor_lbound_get (res_desc
, gfc_rank_cst
[n
]);
9184 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
9185 gfc_array_index_type
, tmp
, tmp1
);
9186 tmp1
= gfc_conv_descriptor_ubound_get (desc
, gfc_rank_cst
[n
]);
9187 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
9188 gfc_array_index_type
, tmp
, tmp1
);
9189 tmp1
= gfc_conv_descriptor_ubound_get (res_desc
, gfc_rank_cst
[n
]);
9190 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
,
9191 gfc_array_index_type
, tmp
, tmp1
);
9192 tmp
= fold_build2_loc (input_location
, NE_EXPR
,
9193 logical_type_node
, tmp
,
9194 gfc_index_zero_node
);
9195 tmp
= gfc_evaluate_now (tmp
, &se
->post
);
9196 zero_cond
= fold_build2_loc (input_location
, TRUTH_OR_EXPR
,
9197 logical_type_node
, tmp
,
9201 /* 'zero_cond' being true is equal to lhs not being allocated or the
9202 shapes being different. */
9203 zero_cond
= gfc_evaluate_now (zero_cond
, &se
->post
);
9205 /* Now reset the bounds returned from the function call to bounds based
9206 on the lhs lbounds, except where the lhs is not allocated or the shapes
9207 of 'variable and 'expr' are different. Set the offset accordingly. */
9208 offset
= gfc_index_zero_node
;
9209 for (n
= 0 ; n
< rank
; n
++)
9213 lbound
= gfc_conv_descriptor_lbound_get (desc
, gfc_rank_cst
[n
]);
9214 lbound
= fold_build3_loc (input_location
, COND_EXPR
,
9215 gfc_array_index_type
, zero_cond
,
9216 gfc_index_one_node
, lbound
);
9217 lbound
= gfc_evaluate_now (lbound
, &se
->post
);
9219 tmp
= gfc_conv_descriptor_ubound_get (res_desc
, gfc_rank_cst
[n
]);
9220 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
,
9221 gfc_array_index_type
, tmp
, lbound
);
9222 gfc_conv_descriptor_lbound_set (&se
->post
, desc
,
9223 gfc_rank_cst
[n
], lbound
);
9224 gfc_conv_descriptor_ubound_set (&se
->post
, desc
,
9225 gfc_rank_cst
[n
], tmp
);
9227 /* Set stride and accumulate the offset. */
9228 tmp
= gfc_conv_descriptor_stride_get (res_desc
, gfc_rank_cst
[n
]);
9229 gfc_conv_descriptor_stride_set (&se
->post
, desc
,
9230 gfc_rank_cst
[n
], tmp
);
9231 tmp
= fold_build2_loc (input_location
, MULT_EXPR
,
9232 gfc_array_index_type
, lbound
, tmp
);
9233 offset
= fold_build2_loc (input_location
, MINUS_EXPR
,
9234 gfc_array_index_type
, offset
, tmp
);
9235 offset
= gfc_evaluate_now (offset
, &se
->post
);
9238 gfc_conv_descriptor_offset_set (&se
->post
, desc
, offset
);
9243 /* Try to translate array(:) = func (...), where func is a transformational
9244 array function, without using a temporary. Returns NULL if this isn't the
9248 gfc_trans_arrayfunc_assign (gfc_expr
* expr1
, gfc_expr
* expr2
)
9252 gfc_component
*comp
= NULL
;
9255 if (arrayfunc_assign_needs_temporary (expr1
, expr2
))
9258 /* The frontend doesn't seem to bother filling in expr->symtree for intrinsic
9260 comp
= gfc_get_proc_ptr_comp (expr2
);
9261 gcc_assert (expr2
->value
.function
.isym
9262 || (comp
&& comp
->attr
.dimension
)
9263 || (!comp
&& gfc_return_by_reference (expr2
->value
.function
.esym
)
9264 && expr2
->value
.function
.esym
->result
->attr
.dimension
));
9266 gfc_init_se (&se
, NULL
);
9267 gfc_start_block (&se
.pre
);
9268 se
.want_pointer
= 1;
9270 gfc_conv_array_parameter (&se
, expr1
, false, NULL
, NULL
, NULL
);
9272 if (expr1
->ts
.type
== BT_DERIVED
9273 && expr1
->ts
.u
.derived
->attr
.alloc_comp
)
9276 tmp
= gfc_deallocate_alloc_comp_no_caf (expr1
->ts
.u
.derived
, se
.expr
,
9278 gfc_add_expr_to_block (&se
.pre
, tmp
);
9281 se
.direct_byref
= 1;
9282 se
.ss
= gfc_walk_expr (expr2
);
9283 gcc_assert (se
.ss
!= gfc_ss_terminator
);
9285 /* Reallocate on assignment needs the loopinfo for extrinsic functions.
9286 This is signalled to gfc_conv_procedure_call by setting is_alloc_lhs.
9287 Clearly, this cannot be done for an allocatable function result, since
9288 the shape of the result is unknown and, in any case, the function must
9289 correctly take care of the reallocation internally. For intrinsic
9290 calls, the array data is freed and the library takes care of allocation.
9291 TODO: Add logic of trans-array.c: gfc_alloc_allocatable_for_assignment
9293 if (flag_realloc_lhs
9294 && gfc_is_reallocatable_lhs (expr1
)
9295 && !gfc_expr_attr (expr1
).codimension
9296 && !gfc_is_coindexed (expr1
)
9297 && !(expr2
->value
.function
.esym
9298 && expr2
->value
.function
.esym
->result
->attr
.allocatable
))
9300 realloc_lhs_warning (expr1
->ts
.type
, true, &expr1
->where
);
9302 if (!expr2
->value
.function
.isym
)
9304 ss
= gfc_walk_expr (expr1
);
9305 gcc_assert (ss
!= gfc_ss_terminator
);
9307 realloc_lhs_loop_for_fcn_call (&se
, &expr1
->where
, &ss
, &loop
);
9308 ss
->is_alloc_lhs
= 1;
9311 fcncall_realloc_result (&se
, expr1
->rank
);
9314 gfc_conv_function_expr (&se
, expr2
);
9315 gfc_add_block_to_block (&se
.pre
, &se
.post
);
9318 gfc_cleanup_loop (&loop
);
9320 gfc_free_ss_chain (se
.ss
);
9322 return gfc_finish_block (&se
.pre
);
9326 /* Try to efficiently translate array(:) = 0. Return NULL if this
9330 gfc_trans_zero_assign (gfc_expr
* expr
)
9332 tree dest
, len
, type
;
9336 sym
= expr
->symtree
->n
.sym
;
9337 dest
= gfc_get_symbol_decl (sym
);
9339 type
= TREE_TYPE (dest
);
9340 if (POINTER_TYPE_P (type
))
9341 type
= TREE_TYPE (type
);
9342 if (!GFC_ARRAY_TYPE_P (type
))
9345 /* Determine the length of the array. */
9346 len
= GFC_TYPE_ARRAY_SIZE (type
);
9347 if (!len
|| TREE_CODE (len
) != INTEGER_CST
)
9350 tmp
= TYPE_SIZE_UNIT (gfc_get_element_type (type
));
9351 len
= fold_build2_loc (input_location
, MULT_EXPR
, gfc_array_index_type
, len
,
9352 fold_convert (gfc_array_index_type
, tmp
));
9354 /* If we are zeroing a local array avoid taking its address by emitting
9356 if (!POINTER_TYPE_P (TREE_TYPE (dest
)))
9357 return build2_loc (input_location
, MODIFY_EXPR
, void_type_node
,
9358 dest
, build_constructor (TREE_TYPE (dest
),
9361 /* Convert arguments to the correct types. */
9362 dest
= fold_convert (pvoid_type_node
, dest
);
9363 len
= fold_convert (size_type_node
, len
);
9365 /* Construct call to __builtin_memset. */
9366 tmp
= build_call_expr_loc (input_location
,
9367 builtin_decl_explicit (BUILT_IN_MEMSET
),
9368 3, dest
, integer_zero_node
, len
);
9369 return fold_convert (void_type_node
, tmp
);
9373 /* Helper for gfc_trans_array_copy and gfc_trans_array_constructor_copy
9374 that constructs the call to __builtin_memcpy. */
9377 gfc_build_memcpy_call (tree dst
, tree src
, tree len
)
9381 /* Convert arguments to the correct types. */
9382 if (!POINTER_TYPE_P (TREE_TYPE (dst
)))
9383 dst
= gfc_build_addr_expr (pvoid_type_node
, dst
);
9385 dst
= fold_convert (pvoid_type_node
, dst
);
9387 if (!POINTER_TYPE_P (TREE_TYPE (src
)))
9388 src
= gfc_build_addr_expr (pvoid_type_node
, src
);
9390 src
= fold_convert (pvoid_type_node
, src
);
9392 len
= fold_convert (size_type_node
, len
);
9394 /* Construct call to __builtin_memcpy. */
9395 tmp
= build_call_expr_loc (input_location
,
9396 builtin_decl_explicit (BUILT_IN_MEMCPY
),
9398 return fold_convert (void_type_node
, tmp
);
9402 /* Try to efficiently translate dst(:) = src(:). Return NULL if this
9403 can't be done. EXPR1 is the destination/lhs and EXPR2 is the
9404 source/rhs, both are gfc_full_array_ref_p which have been checked for
9408 gfc_trans_array_copy (gfc_expr
* expr1
, gfc_expr
* expr2
)
9410 tree dst
, dlen
, dtype
;
9411 tree src
, slen
, stype
;
9414 dst
= gfc_get_symbol_decl (expr1
->symtree
->n
.sym
);
9415 src
= gfc_get_symbol_decl (expr2
->symtree
->n
.sym
);
9417 dtype
= TREE_TYPE (dst
);
9418 if (POINTER_TYPE_P (dtype
))
9419 dtype
= TREE_TYPE (dtype
);
9420 stype
= TREE_TYPE (src
);
9421 if (POINTER_TYPE_P (stype
))
9422 stype
= TREE_TYPE (stype
);
9424 if (!GFC_ARRAY_TYPE_P (dtype
) || !GFC_ARRAY_TYPE_P (stype
))
9427 /* Determine the lengths of the arrays. */
9428 dlen
= GFC_TYPE_ARRAY_SIZE (dtype
);
9429 if (!dlen
|| TREE_CODE (dlen
) != INTEGER_CST
)
9431 tmp
= TYPE_SIZE_UNIT (gfc_get_element_type (dtype
));
9432 dlen
= fold_build2_loc (input_location
, MULT_EXPR
, gfc_array_index_type
,
9433 dlen
, fold_convert (gfc_array_index_type
, tmp
));
9435 slen
= GFC_TYPE_ARRAY_SIZE (stype
);
9436 if (!slen
|| TREE_CODE (slen
) != INTEGER_CST
)
9438 tmp
= TYPE_SIZE_UNIT (gfc_get_element_type (stype
));
9439 slen
= fold_build2_loc (input_location
, MULT_EXPR
, gfc_array_index_type
,
9440 slen
, fold_convert (gfc_array_index_type
, tmp
));
9442 /* Sanity check that they are the same. This should always be
9443 the case, as we should already have checked for conformance. */
9444 if (!tree_int_cst_equal (slen
, dlen
))
9447 return gfc_build_memcpy_call (dst
, src
, dlen
);
9451 /* Try to efficiently translate array(:) = (/ ... /). Return NULL if
9452 this can't be done. EXPR1 is the destination/lhs for which
9453 gfc_full_array_ref_p is true, and EXPR2 is the source/rhs. */
9456 gfc_trans_array_constructor_copy (gfc_expr
* expr1
, gfc_expr
* expr2
)
9458 unsigned HOST_WIDE_INT nelem
;
9464 nelem
= gfc_constant_array_constructor_p (expr2
->value
.constructor
);
9468 dst
= gfc_get_symbol_decl (expr1
->symtree
->n
.sym
);
9469 dtype
= TREE_TYPE (dst
);
9470 if (POINTER_TYPE_P (dtype
))
9471 dtype
= TREE_TYPE (dtype
);
9472 if (!GFC_ARRAY_TYPE_P (dtype
))
9475 /* Determine the lengths of the array. */
9476 len
= GFC_TYPE_ARRAY_SIZE (dtype
);
9477 if (!len
|| TREE_CODE (len
) != INTEGER_CST
)
9480 /* Confirm that the constructor is the same size. */
9481 if (compare_tree_int (len
, nelem
) != 0)
9484 tmp
= TYPE_SIZE_UNIT (gfc_get_element_type (dtype
));
9485 len
= fold_build2_loc (input_location
, MULT_EXPR
, gfc_array_index_type
, len
,
9486 fold_convert (gfc_array_index_type
, tmp
));
9488 stype
= gfc_typenode_for_spec (&expr2
->ts
);
9489 src
= gfc_build_constant_array_constructor (expr2
, stype
);
9491 stype
= TREE_TYPE (src
);
9492 if (POINTER_TYPE_P (stype
))
9493 stype
= TREE_TYPE (stype
);
9495 return gfc_build_memcpy_call (dst
, src
, len
);
9499 /* Tells whether the expression is to be treated as a variable reference. */
9502 gfc_expr_is_variable (gfc_expr
*expr
)
9505 gfc_component
*comp
;
9506 gfc_symbol
*func_ifc
;
9508 if (expr
->expr_type
== EXPR_VARIABLE
)
9511 arg
= gfc_get_noncopying_intrinsic_argument (expr
);
9514 gcc_assert (expr
->value
.function
.isym
->id
== GFC_ISYM_TRANSPOSE
);
9515 return gfc_expr_is_variable (arg
);
9518 /* A data-pointer-returning function should be considered as a variable
9520 if (expr
->expr_type
== EXPR_FUNCTION
9521 && expr
->ref
== NULL
)
9523 if (expr
->value
.function
.isym
!= NULL
)
9526 if (expr
->value
.function
.esym
!= NULL
)
9528 func_ifc
= expr
->value
.function
.esym
;
9533 gcc_assert (expr
->symtree
);
9534 func_ifc
= expr
->symtree
->n
.sym
;
9541 comp
= gfc_get_proc_ptr_comp (expr
);
9542 if ((expr
->expr_type
== EXPR_PPC
|| expr
->expr_type
== EXPR_FUNCTION
)
9545 func_ifc
= comp
->ts
.interface
;
9549 if (expr
->expr_type
== EXPR_COMPCALL
)
9551 gcc_assert (!expr
->value
.compcall
.tbp
->is_generic
);
9552 func_ifc
= expr
->value
.compcall
.tbp
->u
.specific
->n
.sym
;
9559 gcc_assert (func_ifc
->attr
.function
9560 && func_ifc
->result
!= NULL
);
9561 return func_ifc
->result
->attr
.pointer
;
9565 /* Is the lhs OK for automatic reallocation? */
9568 is_scalar_reallocatable_lhs (gfc_expr
*expr
)
9572 /* An allocatable variable with no reference. */
9573 if (expr
->symtree
->n
.sym
->attr
.allocatable
9577 /* All that can be left are allocatable components. However, we do
9578 not check for allocatable components here because the expression
9579 could be an allocatable component of a pointer component. */
9580 if (expr
->symtree
->n
.sym
->ts
.type
!= BT_DERIVED
9581 && expr
->symtree
->n
.sym
->ts
.type
!= BT_CLASS
)
9584 /* Find an allocatable component ref last. */
9585 for (ref
= expr
->ref
; ref
; ref
= ref
->next
)
9586 if (ref
->type
== REF_COMPONENT
9588 && ref
->u
.c
.component
->attr
.allocatable
)
9595 /* Allocate or reallocate scalar lhs, as necessary. */
9598 alloc_scalar_allocatable_for_assignment (stmtblock_t
*block
,
9613 if (!expr1
|| expr1
->rank
)
9616 if (!expr2
|| expr2
->rank
)
9619 for (ref
= expr1
->ref
; ref
; ref
= ref
->next
)
9620 if (ref
->type
== REF_SUBSTRING
)
9623 realloc_lhs_warning (expr2
->ts
.type
, false, &expr2
->where
);
9625 /* Since this is a scalar lhs, we can afford to do this. That is,
9626 there is no risk of side effects being repeated. */
9627 gfc_init_se (&lse
, NULL
);
9628 lse
.want_pointer
= 1;
9629 gfc_conv_expr (&lse
, expr1
);
9631 jump_label1
= gfc_build_label_decl (NULL_TREE
);
9632 jump_label2
= gfc_build_label_decl (NULL_TREE
);
9634 /* Do the allocation if the lhs is NULL. Otherwise go to label 1. */
9635 tmp
= build_int_cst (TREE_TYPE (lse
.expr
), 0);
9636 cond
= fold_build2_loc (input_location
, NE_EXPR
, logical_type_node
,
9638 tmp
= build3_v (COND_EXPR
, cond
,
9639 build1_v (GOTO_EXPR
, jump_label1
),
9640 build_empty_stmt (input_location
));
9641 gfc_add_expr_to_block (block
, tmp
);
9643 if (expr1
->ts
.type
== BT_CHARACTER
&& expr1
->ts
.deferred
)
9645 /* Use the rhs string length and the lhs element size. */
9646 size
= string_length
;
9647 tmp
= TREE_TYPE (gfc_typenode_for_spec (&expr1
->ts
));
9648 tmp
= TYPE_SIZE_UNIT (tmp
);
9649 size_in_bytes
= fold_build2_loc (input_location
, MULT_EXPR
,
9650 TREE_TYPE (tmp
), tmp
,
9651 fold_convert (TREE_TYPE (tmp
), size
));
9655 /* Otherwise use the length in bytes of the rhs. */
9656 size
= TYPE_SIZE_UNIT (gfc_typenode_for_spec (&expr1
->ts
));
9657 size_in_bytes
= size
;
9660 size_in_bytes
= fold_build2_loc (input_location
, MAX_EXPR
, size_type_node
,
9661 size_in_bytes
, size_one_node
);
9663 if (gfc_caf_attr (expr1
).codimension
&& flag_coarray
== GFC_FCOARRAY_LIB
)
9665 tree caf_decl
, token
;
9667 symbol_attribute attr
;
9669 gfc_clear_attr (&attr
);
9670 gfc_init_se (&caf_se
, NULL
);
9672 caf_decl
= gfc_get_tree_for_caf_expr (expr1
);
9673 gfc_get_caf_token_offset (&caf_se
, &token
, NULL
, caf_decl
, NULL_TREE
,
9675 gfc_add_block_to_block (block
, &caf_se
.pre
);
9676 gfc_allocate_allocatable (block
, lse
.expr
, size_in_bytes
,
9677 gfc_build_addr_expr (NULL_TREE
, token
),
9678 NULL_TREE
, NULL_TREE
, NULL_TREE
, jump_label1
,
9681 else if (expr1
->ts
.type
== BT_DERIVED
&& expr1
->ts
.u
.derived
->attr
.alloc_comp
)
9683 tmp
= build_call_expr_loc (input_location
,
9684 builtin_decl_explicit (BUILT_IN_CALLOC
),
9685 2, build_one_cst (size_type_node
),
9687 tmp
= fold_convert (TREE_TYPE (lse
.expr
), tmp
);
9688 gfc_add_modify (block
, lse
.expr
, tmp
);
9692 tmp
= build_call_expr_loc (input_location
,
9693 builtin_decl_explicit (BUILT_IN_MALLOC
),
9695 tmp
= fold_convert (TREE_TYPE (lse
.expr
), tmp
);
9696 gfc_add_modify (block
, lse
.expr
, tmp
);
9699 if (expr1
->ts
.type
== BT_CHARACTER
&& expr1
->ts
.deferred
)
9701 /* Deferred characters need checking for lhs and rhs string
9702 length. Other deferred parameter variables will have to
9704 tmp
= build1_v (GOTO_EXPR
, jump_label2
);
9705 gfc_add_expr_to_block (block
, tmp
);
9707 tmp
= build1_v (LABEL_EXPR
, jump_label1
);
9708 gfc_add_expr_to_block (block
, tmp
);
9710 /* For a deferred length character, reallocate if lengths of lhs and
9711 rhs are different. */
9712 if (expr1
->ts
.type
== BT_CHARACTER
&& expr1
->ts
.deferred
)
9714 cond
= fold_build2_loc (input_location
, EQ_EXPR
, logical_type_node
,
9716 fold_convert (TREE_TYPE (lse
.string_length
),
9718 /* Jump past the realloc if the lengths are the same. */
9719 tmp
= build3_v (COND_EXPR
, cond
,
9720 build1_v (GOTO_EXPR
, jump_label2
),
9721 build_empty_stmt (input_location
));
9722 gfc_add_expr_to_block (block
, tmp
);
9723 tmp
= build_call_expr_loc (input_location
,
9724 builtin_decl_explicit (BUILT_IN_REALLOC
),
9725 2, fold_convert (pvoid_type_node
, lse
.expr
),
9727 tmp
= fold_convert (TREE_TYPE (lse
.expr
), tmp
);
9728 gfc_add_modify (block
, lse
.expr
, tmp
);
9729 tmp
= build1_v (LABEL_EXPR
, jump_label2
);
9730 gfc_add_expr_to_block (block
, tmp
);
9732 /* Update the lhs character length. */
9733 size
= string_length
;
9734 gfc_add_modify (block
, lse
.string_length
,
9735 fold_convert (TREE_TYPE (lse
.string_length
), size
));
9739 /* Check for assignments of the type
9743 to make sure we do not check for reallocation unneccessarily. */
9747 is_runtime_conformable (gfc_expr
*expr1
, gfc_expr
*expr2
)
9749 gfc_actual_arglist
*a
;
9752 switch (expr2
->expr_type
)
9755 return gfc_dep_compare_expr (expr1
, expr2
) == 0;
9758 if (expr2
->value
.function
.esym
9759 && expr2
->value
.function
.esym
->attr
.elemental
)
9761 for (a
= expr2
->value
.function
.actual
; a
!= NULL
; a
= a
->next
)
9764 if (e1
&& e1
->rank
> 0 && !is_runtime_conformable (expr1
, e1
))
9769 else if (expr2
->value
.function
.isym
9770 && expr2
->value
.function
.isym
->elemental
)
9772 for (a
= expr2
->value
.function
.actual
; a
!= NULL
; a
= a
->next
)
9775 if (e1
&& e1
->rank
> 0 && !is_runtime_conformable (expr1
, e1
))
9784 switch (expr2
->value
.op
.op
)
9787 case INTRINSIC_UPLUS
:
9788 case INTRINSIC_UMINUS
:
9789 case INTRINSIC_PARENTHESES
:
9790 return is_runtime_conformable (expr1
, expr2
->value
.op
.op1
);
9792 case INTRINSIC_PLUS
:
9793 case INTRINSIC_MINUS
:
9794 case INTRINSIC_TIMES
:
9795 case INTRINSIC_DIVIDE
:
9796 case INTRINSIC_POWER
:
9800 case INTRINSIC_NEQV
:
9807 case INTRINSIC_EQ_OS
:
9808 case INTRINSIC_NE_OS
:
9809 case INTRINSIC_GT_OS
:
9810 case INTRINSIC_GE_OS
:
9811 case INTRINSIC_LT_OS
:
9812 case INTRINSIC_LE_OS
:
9814 e1
= expr2
->value
.op
.op1
;
9815 e2
= expr2
->value
.op
.op2
;
9817 if (e1
->rank
== 0 && e2
->rank
> 0)
9818 return is_runtime_conformable (expr1
, e2
);
9819 else if (e1
->rank
> 0 && e2
->rank
== 0)
9820 return is_runtime_conformable (expr1
, e1
);
9821 else if (e1
->rank
> 0 && e2
->rank
> 0)
9822 return is_runtime_conformable (expr1
, e1
)
9823 && is_runtime_conformable (expr1
, e2
);
9841 trans_class_assignment (stmtblock_t
*block
, gfc_expr
*lhs
, gfc_expr
*rhs
,
9842 gfc_se
*lse
, gfc_se
*rse
, bool use_vptr_copy
,
9845 tree tmp
, fcn
, stdcopy
, to_len
, from_len
, vptr
;
9846 vec
<tree
, va_gc
> *args
= NULL
;
9848 vptr
= trans_class_vptr_len_assignment (block
, lhs
, rhs
, rse
, &to_len
,
9851 /* Generate allocation of the lhs. */
9857 tmp
= gfc_vptr_size_get (vptr
);
9858 class_han
= GFC_CLASS_TYPE_P (TREE_TYPE (lse
->expr
))
9859 ? gfc_class_data_get (lse
->expr
) : lse
->expr
;
9860 gfc_init_block (&alloc
);
9861 gfc_allocate_using_malloc (&alloc
, class_han
, tmp
, NULL_TREE
);
9862 tmp
= fold_build2_loc (input_location
, EQ_EXPR
,
9863 logical_type_node
, class_han
,
9864 build_int_cst (prvoid_type_node
, 0));
9865 tmp
= fold_build3_loc (input_location
, COND_EXPR
, void_type_node
,
9867 PRED_FORTRAN_FAIL_ALLOC
),
9868 gfc_finish_block (&alloc
),
9869 build_empty_stmt (input_location
));
9870 gfc_add_expr_to_block (&lse
->pre
, tmp
);
9873 fcn
= gfc_vptr_copy_get (vptr
);
9875 tmp
= GFC_CLASS_TYPE_P (TREE_TYPE (rse
->expr
))
9876 ? gfc_class_data_get (rse
->expr
) : rse
->expr
;
9879 if (!POINTER_TYPE_P (TREE_TYPE (tmp
))
9880 || INDIRECT_REF_P (tmp
)
9881 || (rhs
->ts
.type
== BT_DERIVED
9882 && rhs
->ts
.u
.derived
->attr
.unlimited_polymorphic
9883 && !rhs
->ts
.u
.derived
->attr
.pointer
9884 && !rhs
->ts
.u
.derived
->attr
.allocatable
)
9885 || (UNLIMITED_POLY (rhs
)
9886 && !CLASS_DATA (rhs
)->attr
.pointer
9887 && !CLASS_DATA (rhs
)->attr
.allocatable
))
9888 vec_safe_push (args
, gfc_build_addr_expr (NULL_TREE
, tmp
));
9890 vec_safe_push (args
, tmp
);
9891 tmp
= GFC_CLASS_TYPE_P (TREE_TYPE (lse
->expr
))
9892 ? gfc_class_data_get (lse
->expr
) : lse
->expr
;
9893 if (!POINTER_TYPE_P (TREE_TYPE (tmp
))
9894 || INDIRECT_REF_P (tmp
)
9895 || (lhs
->ts
.type
== BT_DERIVED
9896 && lhs
->ts
.u
.derived
->attr
.unlimited_polymorphic
9897 && !lhs
->ts
.u
.derived
->attr
.pointer
9898 && !lhs
->ts
.u
.derived
->attr
.allocatable
)
9899 || (UNLIMITED_POLY (lhs
)
9900 && !CLASS_DATA (lhs
)->attr
.pointer
9901 && !CLASS_DATA (lhs
)->attr
.allocatable
))
9902 vec_safe_push (args
, gfc_build_addr_expr (NULL_TREE
, tmp
));
9904 vec_safe_push (args
, tmp
);
9906 stdcopy
= build_call_vec (TREE_TYPE (TREE_TYPE (fcn
)), fcn
, args
);
9908 if (to_len
!= NULL_TREE
&& !integer_zerop (from_len
))
9911 vec_safe_push (args
, from_len
);
9912 vec_safe_push (args
, to_len
);
9913 extcopy
= build_call_vec (TREE_TYPE (TREE_TYPE (fcn
)), fcn
, args
);
9915 tmp
= fold_build2_loc (input_location
, GT_EXPR
,
9916 logical_type_node
, from_len
,
9917 build_zero_cst (TREE_TYPE (from_len
)));
9918 return fold_build3_loc (input_location
, COND_EXPR
,
9919 void_type_node
, tmp
,
9927 tree rhst
= GFC_CLASS_TYPE_P (TREE_TYPE (lse
->expr
))
9928 ? gfc_class_data_get (lse
->expr
) : lse
->expr
;
9930 gfc_init_block (&tblock
);
9931 if (!POINTER_TYPE_P (TREE_TYPE (tmp
)))
9932 tmp
= gfc_build_addr_expr (NULL_TREE
, tmp
);
9933 if (!POINTER_TYPE_P (TREE_TYPE (rhst
)))
9934 rhst
= gfc_build_addr_expr (NULL_TREE
, rhst
);
9935 /* When coming from a ptr_copy lhs and rhs are swapped. */
9936 gfc_add_modify_loc (input_location
, &tblock
, rhst
,
9937 fold_convert (TREE_TYPE (rhst
), tmp
));
9938 return gfc_finish_block (&tblock
);
9942 /* Subroutine of gfc_trans_assignment that actually scalarizes the
9943 assignment. EXPR1 is the destination/LHS and EXPR2 is the source/RHS.
9944 init_flag indicates initialization expressions and dealloc that no
9945 deallocate prior assignment is needed (if in doubt, set true).
9946 When PTR_COPY is set and expr1 is a class type, then use the _vptr-copy
9947 routine instead of a pointer assignment. Alias resolution is only done,
9948 when MAY_ALIAS is set (the default). This flag is used by ALLOCATE()
9949 where it is known, that newly allocated memory on the lhs can never be
9950 an alias of the rhs. */
9953 gfc_trans_assignment_1 (gfc_expr
* expr1
, gfc_expr
* expr2
, bool init_flag
,
9954 bool dealloc
, bool use_vptr_copy
, bool may_alias
)
9959 gfc_ss
*lss_section
;
9966 bool scalar_to_array
;
9969 bool maybe_workshare
= false, lhs_refs_comp
= false, rhs_refs_comp
= false;
9970 symbol_attribute lhs_caf_attr
, rhs_caf_attr
, lhs_attr
;
9971 bool is_poly_assign
;
9973 /* Assignment of the form lhs = rhs. */
9974 gfc_start_block (&block
);
9976 gfc_init_se (&lse
, NULL
);
9977 gfc_init_se (&rse
, NULL
);
9980 lss
= gfc_walk_expr (expr1
);
9981 if (gfc_is_reallocatable_lhs (expr1
)
9982 && !(expr2
->expr_type
== EXPR_FUNCTION
9983 && expr2
->value
.function
.isym
!= NULL
9984 && !(expr2
->value
.function
.isym
->elemental
9985 || expr2
->value
.function
.isym
->conversion
)))
9986 lss
->is_alloc_lhs
= 1;
9990 if ((expr1
->ts
.type
== BT_DERIVED
)
9991 && (gfc_is_class_array_function (expr2
)
9992 || gfc_is_alloc_class_scalar_function (expr2
)))
9993 expr2
->must_finalize
= 1;
9995 /* Checking whether a class assignment is desired is quite complicated and
9996 needed at two locations, so do it once only before the information is
9998 lhs_attr
= gfc_expr_attr (expr1
);
9999 is_poly_assign
= (use_vptr_copy
|| lhs_attr
.pointer
10000 || (lhs_attr
.allocatable
&& !lhs_attr
.dimension
))
10001 && (expr1
->ts
.type
== BT_CLASS
10002 || gfc_is_class_array_ref (expr1
, NULL
)
10003 || gfc_is_class_scalar_expr (expr1
)
10004 || gfc_is_class_array_ref (expr2
, NULL
)
10005 || gfc_is_class_scalar_expr (expr2
));
10008 /* Only analyze the expressions for coarray properties, when in coarray-lib
10010 if (flag_coarray
== GFC_FCOARRAY_LIB
)
10012 lhs_caf_attr
= gfc_caf_attr (expr1
, false, &lhs_refs_comp
);
10013 rhs_caf_attr
= gfc_caf_attr (expr2
, false, &rhs_refs_comp
);
10016 if (lss
!= gfc_ss_terminator
)
10018 /* The assignment needs scalarization. */
10021 /* Find a non-scalar SS from the lhs. */
10022 while (lss_section
!= gfc_ss_terminator
10023 && lss_section
->info
->type
!= GFC_SS_SECTION
)
10024 lss_section
= lss_section
->next
;
10026 gcc_assert (lss_section
!= gfc_ss_terminator
);
10028 /* Initialize the scalarizer. */
10029 gfc_init_loopinfo (&loop
);
10031 /* Walk the rhs. */
10032 rss
= gfc_walk_expr (expr2
);
10033 if (rss
== gfc_ss_terminator
)
10034 /* The rhs is scalar. Add a ss for the expression. */
10035 rss
= gfc_get_scalar_ss (gfc_ss_terminator
, expr2
);
10036 /* When doing a class assign, then the handle to the rhs needs to be a
10037 pointer to allow for polymorphism. */
10038 if (is_poly_assign
&& expr2
->rank
== 0 && !UNLIMITED_POLY (expr2
))
10039 rss
->info
->type
= GFC_SS_REFERENCE
;
10041 /* Associate the SS with the loop. */
10042 gfc_add_ss_to_loop (&loop
, lss
);
10043 gfc_add_ss_to_loop (&loop
, rss
);
10045 /* Calculate the bounds of the scalarization. */
10046 gfc_conv_ss_startstride (&loop
);
10047 /* Enable loop reversal. */
10048 for (n
= 0; n
< GFC_MAX_DIMENSIONS
; n
++)
10049 loop
.reverse
[n
] = GFC_ENABLE_REVERSE
;
10050 /* Resolve any data dependencies in the statement. */
10052 gfc_conv_resolve_dependencies (&loop
, lss
, rss
);
10053 /* Setup the scalarizing loops. */
10054 gfc_conv_loop_setup (&loop
, &expr2
->where
);
10056 /* Setup the gfc_se structures. */
10057 gfc_copy_loopinfo_to_se (&lse
, &loop
);
10058 gfc_copy_loopinfo_to_se (&rse
, &loop
);
10061 gfc_mark_ss_chain_used (rss
, 1);
10062 if (loop
.temp_ss
== NULL
)
10065 gfc_mark_ss_chain_used (lss
, 1);
10069 lse
.ss
= loop
.temp_ss
;
10070 gfc_mark_ss_chain_used (lss
, 3);
10071 gfc_mark_ss_chain_used (loop
.temp_ss
, 3);
10074 /* Allow the scalarizer to workshare array assignments. */
10075 if ((ompws_flags
& (OMPWS_WORKSHARE_FLAG
| OMPWS_SCALARIZER_BODY
))
10076 == OMPWS_WORKSHARE_FLAG
10077 && loop
.temp_ss
== NULL
)
10079 maybe_workshare
= true;
10080 ompws_flags
|= OMPWS_SCALARIZER_WS
| OMPWS_SCALARIZER_BODY
;
10083 /* Start the scalarized loop body. */
10084 gfc_start_scalarized_body (&loop
, &body
);
10087 gfc_init_block (&body
);
10089 l_is_temp
= (lss
!= gfc_ss_terminator
&& loop
.temp_ss
!= NULL
);
10091 /* Translate the expression. */
10092 rse
.want_coarray
= flag_coarray
== GFC_FCOARRAY_LIB
&& init_flag
10093 && lhs_caf_attr
.codimension
;
10094 gfc_conv_expr (&rse
, expr2
);
10096 /* Deal with the case of a scalar class function assigned to a derived type. */
10097 if (gfc_is_alloc_class_scalar_function (expr2
)
10098 && expr1
->ts
.type
== BT_DERIVED
)
10100 rse
.expr
= gfc_class_data_get (rse
.expr
);
10101 rse
.expr
= build_fold_indirect_ref_loc (input_location
, rse
.expr
);
10104 /* Stabilize a string length for temporaries. */
10105 if (expr2
->ts
.type
== BT_CHARACTER
&& !expr1
->ts
.deferred
10106 && !(VAR_P (rse
.string_length
)
10107 || TREE_CODE (rse
.string_length
) == PARM_DECL
10108 || TREE_CODE (rse
.string_length
) == INDIRECT_REF
))
10109 string_length
= gfc_evaluate_now (rse
.string_length
, &rse
.pre
);
10110 else if (expr2
->ts
.type
== BT_CHARACTER
)
10111 string_length
= rse
.string_length
;
10113 string_length
= NULL_TREE
;
10117 gfc_conv_tmp_array_ref (&lse
);
10118 if (expr2
->ts
.type
== BT_CHARACTER
)
10119 lse
.string_length
= string_length
;
10123 gfc_conv_expr (&lse
, expr1
);
10124 if (gfc_option
.rtcheck
& GFC_RTCHECK_MEM
10126 && gfc_expr_attr (expr1
).allocatable
10133 tmp
= INDIRECT_REF_P (lse
.expr
)
10134 ? gfc_build_addr_expr (NULL_TREE
, lse
.expr
) : lse
.expr
;
10136 /* We should only get array references here. */
10137 gcc_assert (TREE_CODE (tmp
) == POINTER_PLUS_EXPR
10138 || TREE_CODE (tmp
) == ARRAY_REF
);
10140 /* 'tmp' is either the pointer to the array(POINTER_PLUS_EXPR)
10141 or the array itself(ARRAY_REF). */
10142 tmp
= TREE_OPERAND (tmp
, 0);
10144 /* Provide the address of the array. */
10145 if (TREE_CODE (lse
.expr
) == ARRAY_REF
)
10146 tmp
= gfc_build_addr_expr (NULL_TREE
, tmp
);
10148 cond
= fold_build2_loc (input_location
, EQ_EXPR
, logical_type_node
,
10149 tmp
, build_int_cst (TREE_TYPE (tmp
), 0));
10150 msg
= _("Assignment of scalar to unallocated array");
10151 gfc_trans_runtime_check (true, false, cond
, &loop
.pre
,
10152 &expr1
->where
, msg
);
10155 /* Deallocate the lhs parameterized components if required. */
10156 if (dealloc
&& expr2
->expr_type
== EXPR_FUNCTION
10157 && !expr1
->symtree
->n
.sym
->attr
.associate_var
)
10159 if (expr1
->ts
.type
== BT_DERIVED
10160 && expr1
->ts
.u
.derived
10161 && expr1
->ts
.u
.derived
->attr
.pdt_type
)
10163 tmp
= gfc_deallocate_pdt_comp (expr1
->ts
.u
.derived
, lse
.expr
,
10165 gfc_add_expr_to_block (&lse
.pre
, tmp
);
10167 else if (expr1
->ts
.type
== BT_CLASS
10168 && CLASS_DATA (expr1
)->ts
.u
.derived
10169 && CLASS_DATA (expr1
)->ts
.u
.derived
->attr
.pdt_type
)
10171 tmp
= gfc_class_data_get (lse
.expr
);
10172 tmp
= gfc_deallocate_pdt_comp (CLASS_DATA (expr1
)->ts
.u
.derived
,
10174 gfc_add_expr_to_block (&lse
.pre
, tmp
);
10179 /* Assignments of scalar derived types with allocatable components
10180 to arrays must be done with a deep copy and the rhs temporary
10181 must have its components deallocated afterwards. */
10182 scalar_to_array
= (expr2
->ts
.type
== BT_DERIVED
10183 && expr2
->ts
.u
.derived
->attr
.alloc_comp
10184 && !gfc_expr_is_variable (expr2
)
10185 && expr1
->rank
&& !expr2
->rank
);
10186 scalar_to_array
|= (expr1
->ts
.type
== BT_DERIVED
10188 && expr1
->ts
.u
.derived
->attr
.alloc_comp
10189 && gfc_is_alloc_class_scalar_function (expr2
));
10190 if (scalar_to_array
&& dealloc
)
10192 tmp
= gfc_deallocate_alloc_comp_no_caf (expr2
->ts
.u
.derived
, rse
.expr
, 0);
10193 gfc_prepend_expr_to_block (&loop
.post
, tmp
);
10196 /* When assigning a character function result to a deferred-length variable,
10197 the function call must happen before the (re)allocation of the lhs -
10198 otherwise the character length of the result is not known.
10199 NOTE: This relies on having the exact dependence of the length type
10200 parameter available to the caller; gfortran saves it in the .mod files.
10201 NOTE ALSO: The concatenation operation generates a temporary pointer,
10202 whose allocation must go to the innermost loop.
10203 NOTE ALSO (2): A character conversion may generate a temporary, too. */
10204 if (flag_realloc_lhs
10205 && expr2
->ts
.type
== BT_CHARACTER
&& expr1
->ts
.deferred
10206 && !(lss
!= gfc_ss_terminator
10207 && ((expr2
->expr_type
== EXPR_OP
10208 && expr2
->value
.op
.op
== INTRINSIC_CONCAT
)
10209 || (expr2
->expr_type
== EXPR_FUNCTION
10210 && expr2
->value
.function
.isym
!= NULL
10211 && expr2
->value
.function
.isym
->id
== GFC_ISYM_CONVERSION
))))
10212 gfc_add_block_to_block (&block
, &rse
.pre
);
10214 /* Nullify the allocatable components corresponding to those of the lhs
10215 derived type, so that the finalization of the function result does not
10216 affect the lhs of the assignment. Prepend is used to ensure that the
10217 nullification occurs before the call to the finalizer. In the case of
10218 a scalar to array assignment, this is done in gfc_trans_scalar_assign
10219 as part of the deep copy. */
10220 if (!scalar_to_array
&& expr1
->ts
.type
== BT_DERIVED
10221 && (gfc_is_class_array_function (expr2
)
10222 || gfc_is_alloc_class_scalar_function (expr2
)))
10225 tmp
= gfc_nullify_alloc_comp (expr1
->ts
.u
.derived
, rse
.expr
, 0);
10226 gfc_prepend_expr_to_block (&rse
.post
, tmp
);
10227 if (lss
!= gfc_ss_terminator
&& rss
== gfc_ss_terminator
)
10228 gfc_add_block_to_block (&loop
.post
, &rse
.post
);
10231 if (is_poly_assign
)
10232 tmp
= trans_class_assignment (&body
, expr1
, expr2
, &lse
, &rse
,
10233 use_vptr_copy
|| (lhs_attr
.allocatable
10234 && !lhs_attr
.dimension
),
10235 flag_realloc_lhs
&& !lhs_attr
.pointer
);
10236 else if (flag_coarray
== GFC_FCOARRAY_LIB
10237 && lhs_caf_attr
.codimension
&& rhs_caf_attr
.codimension
10238 && ((lhs_caf_attr
.allocatable
&& lhs_refs_comp
)
10239 || (rhs_caf_attr
.allocatable
&& rhs_refs_comp
)))
10241 /* Only detour to caf_send[get][_by_ref] () when the lhs or rhs is an
10242 allocatable component, because those need to be accessed via the
10243 caf-runtime. No need to check for coindexes here, because resolve
10244 has rewritten those already. */
10246 gfc_actual_arglist a1
, a2
;
10247 /* Clear the structures to prevent accessing garbage. */
10248 memset (&code
, '\0', sizeof (gfc_code
));
10249 memset (&a1
, '\0', sizeof (gfc_actual_arglist
));
10250 memset (&a2
, '\0', sizeof (gfc_actual_arglist
));
10255 code
.ext
.actual
= &a1
;
10256 code
.resolved_isym
= gfc_intrinsic_subroutine_by_id (GFC_ISYM_CAF_SEND
);
10257 tmp
= gfc_conv_intrinsic_subroutine (&code
);
10260 tmp
= gfc_trans_scalar_assign (&lse
, &rse
, expr1
->ts
,
10261 gfc_expr_is_variable (expr2
)
10263 || expr2
->expr_type
== EXPR_ARRAY
,
10264 !(l_is_temp
|| init_flag
) && dealloc
,
10265 expr1
->symtree
->n
.sym
->attr
.codimension
);
10266 /* Add the pre blocks to the body. */
10267 gfc_add_block_to_block (&body
, &rse
.pre
);
10268 gfc_add_block_to_block (&body
, &lse
.pre
);
10269 gfc_add_expr_to_block (&body
, tmp
);
10270 /* Add the post blocks to the body. */
10271 gfc_add_block_to_block (&body
, &rse
.post
);
10272 gfc_add_block_to_block (&body
, &lse
.post
);
10274 if (lss
== gfc_ss_terminator
)
10276 /* F2003: Add the code for reallocation on assignment. */
10277 if (flag_realloc_lhs
&& is_scalar_reallocatable_lhs (expr1
)
10278 && !is_poly_assign
)
10279 alloc_scalar_allocatable_for_assignment (&block
, string_length
,
10282 /* Use the scalar assignment as is. */
10283 gfc_add_block_to_block (&block
, &body
);
10287 gcc_assert (lse
.ss
== gfc_ss_terminator
10288 && rse
.ss
== gfc_ss_terminator
);
10292 gfc_trans_scalarized_loop_boundary (&loop
, &body
);
10294 /* We need to copy the temporary to the actual lhs. */
10295 gfc_init_se (&lse
, NULL
);
10296 gfc_init_se (&rse
, NULL
);
10297 gfc_copy_loopinfo_to_se (&lse
, &loop
);
10298 gfc_copy_loopinfo_to_se (&rse
, &loop
);
10300 rse
.ss
= loop
.temp_ss
;
10303 gfc_conv_tmp_array_ref (&rse
);
10304 gfc_conv_expr (&lse
, expr1
);
10306 gcc_assert (lse
.ss
== gfc_ss_terminator
10307 && rse
.ss
== gfc_ss_terminator
);
10309 if (expr2
->ts
.type
== BT_CHARACTER
)
10310 rse
.string_length
= string_length
;
10312 tmp
= gfc_trans_scalar_assign (&lse
, &rse
, expr1
->ts
,
10314 gfc_add_expr_to_block (&body
, tmp
);
10317 /* F2003: Allocate or reallocate lhs of allocatable array. */
10318 if (flag_realloc_lhs
10319 && gfc_is_reallocatable_lhs (expr1
)
10321 && !is_runtime_conformable (expr1
, expr2
))
10323 realloc_lhs_warning (expr1
->ts
.type
, true, &expr1
->where
);
10324 ompws_flags
&= ~OMPWS_SCALARIZER_WS
;
10325 tmp
= gfc_alloc_allocatable_for_assignment (&loop
, expr1
, expr2
);
10326 if (tmp
!= NULL_TREE
)
10327 gfc_add_expr_to_block (&loop
.code
[expr1
->rank
- 1], tmp
);
10330 if (maybe_workshare
)
10331 ompws_flags
&= ~OMPWS_SCALARIZER_BODY
;
10333 /* Generate the copying loops. */
10334 gfc_trans_scalarizing_loops (&loop
, &body
);
10336 /* Wrap the whole thing up. */
10337 gfc_add_block_to_block (&block
, &loop
.pre
);
10338 gfc_add_block_to_block (&block
, &loop
.post
);
10340 gfc_cleanup_loop (&loop
);
10343 return gfc_finish_block (&block
);
10347 /* Check whether EXPR is a copyable array. */
10350 copyable_array_p (gfc_expr
* expr
)
10352 if (expr
->expr_type
!= EXPR_VARIABLE
)
10355 /* First check it's an array. */
10356 if (expr
->rank
< 1 || !expr
->ref
|| expr
->ref
->next
)
10359 if (!gfc_full_array_ref_p (expr
->ref
, NULL
))
10362 /* Next check that it's of a simple enough type. */
10363 switch (expr
->ts
.type
)
10375 return !expr
->ts
.u
.derived
->attr
.alloc_comp
;
10384 /* Translate an assignment. */
10387 gfc_trans_assignment (gfc_expr
* expr1
, gfc_expr
* expr2
, bool init_flag
,
10388 bool dealloc
, bool use_vptr_copy
, bool may_alias
)
10392 /* Special case a single function returning an array. */
10393 if (expr2
->expr_type
== EXPR_FUNCTION
&& expr2
->rank
> 0)
10395 tmp
= gfc_trans_arrayfunc_assign (expr1
, expr2
);
10400 /* Special case assigning an array to zero. */
10401 if (copyable_array_p (expr1
)
10402 && is_zero_initializer_p (expr2
))
10404 tmp
= gfc_trans_zero_assign (expr1
);
10409 /* Special case copying one array to another. */
10410 if (copyable_array_p (expr1
)
10411 && copyable_array_p (expr2
)
10412 && gfc_compare_types (&expr1
->ts
, &expr2
->ts
)
10413 && !gfc_check_dependency (expr1
, expr2
, 0))
10415 tmp
= gfc_trans_array_copy (expr1
, expr2
);
10420 /* Special case initializing an array from a constant array constructor. */
10421 if (copyable_array_p (expr1
)
10422 && expr2
->expr_type
== EXPR_ARRAY
10423 && gfc_compare_types (&expr1
->ts
, &expr2
->ts
))
10425 tmp
= gfc_trans_array_constructor_copy (expr1
, expr2
);
10430 /* Fallback to the scalarizer to generate explicit loops. */
10431 return gfc_trans_assignment_1 (expr1
, expr2
, init_flag
, dealloc
,
10432 use_vptr_copy
, may_alias
);
10436 gfc_trans_init_assign (gfc_code
* code
)
10438 return gfc_trans_assignment (code
->expr1
, code
->expr2
, true, false, true);
10442 gfc_trans_assign (gfc_code
* code
)
10444 return gfc_trans_assignment (code
->expr1
, code
->expr2
, false, true);