1 /* Array translation routines
2 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
4 Free Software Foundation, Inc.
5 Contributed by Paul Brook <paul@nowt.org>
6 and Steven Bosscher <s.bosscher@student.tudelft.nl>
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
24 /* trans-array.c-- Various array related code, including scalarization,
25 allocation, initialization and other support routines. */
27 /* How the scalarizer works.
28 In gfortran, array expressions use the same core routines as scalar
30 First, a Scalarization State (SS) chain is built. This is done by walking
31 the expression tree, and building a linear list of the terms in the
32 expression. As the tree is walked, scalar subexpressions are translated.
34 The scalarization parameters are stored in a gfc_loopinfo structure.
35 First the start and stride of each term is calculated by
36 gfc_conv_ss_startstride. During this process the expressions for the array
37 descriptors and data pointers are also translated.
39 If the expression is an assignment, we must then resolve any dependencies.
40 In fortran all the rhs values of an assignment must be evaluated before
41 any assignments take place. This can require a temporary array to store the
42 values. We also require a temporary when we are passing array expressions
43 or vector subscripts as procedure parameters.
45 Array sections are passed without copying to a temporary. These use the
46 scalarizer to determine the shape of the section. The flag
47 loop->array_parameter tells the scalarizer that the actual values and loop
48 variables will not be required.
50 The function gfc_conv_loop_setup generates the scalarization setup code.
51 It determines the range of the scalarizing loop variables. If a temporary
52 is required, this is created and initialized. Code for scalar expressions
53 taken outside the loop is also generated at this time. Next the offset and
54 scaling required to translate from loop variables to array indices for each
57 A call to gfc_start_scalarized_body marks the start of the scalarized
58 expression. This creates a scope and declares the loop variables. Before
59 calling this gfc_make_ss_chain_used must be used to indicate which terms
60 will be used inside this loop.
62 The scalar gfc_conv_* functions are then used to build the main body of the
63 scalarization loop. Scalarization loop variables and precalculated scalar
64 values are automatically substituted. Note that gfc_advance_se_ss_chain
65 must be used, rather than changing the se->ss directly.
67 For assignment expressions requiring a temporary two sub loops are
68 generated. The first stores the result of the expression in the temporary,
69 the second copies it to the result. A call to
70 gfc_trans_scalarized_loop_boundary marks the end of the main loop code and
71 the start of the copying loop. The temporary may be less than full rank.
73 Finally gfc_trans_scalarizing_loops is called to generate the implicit do
74 loops. The loops are added to the pre chain of the loopinfo. The post
75 chain may still contain cleanup code.
77 After the loop code has been added into its parent scope gfc_cleanup_loop
78 is called to free all the SS allocated by the scalarizer. */
82 #include "coretypes.h"
85 #include "diagnostic-core.h" /* For internal_error/fatal_error. */
88 #include "constructor.h"
90 #include "trans-stmt.h"
91 #include "trans-types.h"
92 #include "trans-array.h"
93 #include "trans-const.h"
94 #include "dependency.h"
96 static bool gfc_get_array_constructor_size (mpz_t *, gfc_constructor_base);
98 /* The contents of this structure aren't actually used, just the address. */
99 static gfc_ss gfc_ss_terminator_var;
100 gfc_ss * const gfc_ss_terminator = &gfc_ss_terminator_var;
104 gfc_array_dataptr_type (tree desc)
106 return (GFC_TYPE_ARRAY_DATAPTR_TYPE (TREE_TYPE (desc)));
110 /* Build expressions to access the members of an array descriptor.
111 It's surprisingly easy to mess up here, so never access
112 an array descriptor by "brute force", always use these
113 functions. This also avoids problems if we change the format
114 of an array descriptor.
116 To understand these magic numbers, look at the comments
117 before gfc_build_array_type() in trans-types.c.
119 The code within these defines should be the only code which knows the format
120 of an array descriptor.
122 Any code just needing to read obtain the bounds of an array should use
123 gfc_conv_array_* rather than the following functions as these will return
124 know constant values, and work with arrays which do not have descriptors.
126 Don't forget to #undef these! */
129 #define OFFSET_FIELD 1
130 #define DTYPE_FIELD 2
131 #define DIMENSION_FIELD 3
132 #define CAF_TOKEN_FIELD 4
134 #define STRIDE_SUBFIELD 0
135 #define LBOUND_SUBFIELD 1
136 #define UBOUND_SUBFIELD 2
138 /* This provides READ-ONLY access to the data field. The field itself
139 doesn't have the proper type. */
142 gfc_conv_descriptor_data_get (tree desc)
146 type = TREE_TYPE (desc);
147 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
149 field = TYPE_FIELDS (type);
150 gcc_assert (DATA_FIELD == 0);
152 t = fold_build3_loc (input_location, COMPONENT_REF, TREE_TYPE (field), desc,
154 t = fold_convert (GFC_TYPE_ARRAY_DATAPTR_TYPE (type), t);
159 /* This provides WRITE access to the data field.
161 TUPLES_P is true if we are generating tuples.
163 This function gets called through the following macros:
164 gfc_conv_descriptor_data_set
165 gfc_conv_descriptor_data_set. */
168 gfc_conv_descriptor_data_set (stmtblock_t *block, tree desc, tree value)
172 type = TREE_TYPE (desc);
173 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
175 field = TYPE_FIELDS (type);
176 gcc_assert (DATA_FIELD == 0);
178 t = fold_build3_loc (input_location, COMPONENT_REF, TREE_TYPE (field), desc,
180 gfc_add_modify (block, t, fold_convert (TREE_TYPE (field), value));
184 /* This provides address access to the data field. This should only be
185 used by array allocation, passing this on to the runtime. */
188 gfc_conv_descriptor_data_addr (tree desc)
192 type = TREE_TYPE (desc);
193 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
195 field = TYPE_FIELDS (type);
196 gcc_assert (DATA_FIELD == 0);
198 t = fold_build3_loc (input_location, COMPONENT_REF, TREE_TYPE (field), desc,
200 return gfc_build_addr_expr (NULL_TREE, t);
204 gfc_conv_descriptor_offset (tree desc)
209 type = TREE_TYPE (desc);
210 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
212 field = gfc_advance_chain (TYPE_FIELDS (type), OFFSET_FIELD);
213 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == gfc_array_index_type);
215 return fold_build3_loc (input_location, COMPONENT_REF, TREE_TYPE (field),
216 desc, field, NULL_TREE);
220 gfc_conv_descriptor_offset_get (tree desc)
222 return gfc_conv_descriptor_offset (desc);
226 gfc_conv_descriptor_offset_set (stmtblock_t *block, tree desc,
229 tree t = gfc_conv_descriptor_offset (desc);
230 gfc_add_modify (block, t, fold_convert (TREE_TYPE (t), value));
235 gfc_conv_descriptor_dtype (tree desc)
240 type = TREE_TYPE (desc);
241 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
243 field = gfc_advance_chain (TYPE_FIELDS (type), DTYPE_FIELD);
244 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == gfc_array_index_type);
246 return fold_build3_loc (input_location, COMPONENT_REF, TREE_TYPE (field),
247 desc, field, NULL_TREE);
251 gfc_conv_descriptor_dimension (tree desc, tree dim)
257 type = TREE_TYPE (desc);
258 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
260 field = gfc_advance_chain (TYPE_FIELDS (type), DIMENSION_FIELD);
261 gcc_assert (field != NULL_TREE
262 && TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
263 && TREE_CODE (TREE_TYPE (TREE_TYPE (field))) == RECORD_TYPE);
265 tmp = fold_build3_loc (input_location, COMPONENT_REF, TREE_TYPE (field),
266 desc, field, NULL_TREE);
267 tmp = gfc_build_array_ref (tmp, dim, NULL);
273 gfc_conv_descriptor_token (tree desc)
278 type = TREE_TYPE (desc);
279 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
280 gcc_assert (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ALLOCATABLE);
281 gcc_assert (gfc_option.coarray == GFC_FCOARRAY_LIB);
282 field = gfc_advance_chain (TYPE_FIELDS (type), CAF_TOKEN_FIELD);
283 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == prvoid_type_node);
285 return fold_build3_loc (input_location, COMPONENT_REF, TREE_TYPE (field),
286 desc, field, NULL_TREE);
291 gfc_conv_descriptor_stride (tree desc, tree dim)
296 tmp = gfc_conv_descriptor_dimension (desc, dim);
297 field = TYPE_FIELDS (TREE_TYPE (tmp));
298 field = gfc_advance_chain (field, STRIDE_SUBFIELD);
299 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == gfc_array_index_type);
301 tmp = fold_build3_loc (input_location, COMPONENT_REF, TREE_TYPE (field),
302 tmp, field, NULL_TREE);
307 gfc_conv_descriptor_stride_get (tree desc, tree dim)
309 tree type = TREE_TYPE (desc);
310 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
311 if (integer_zerop (dim)
312 && (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ALLOCATABLE
313 ||GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE_CONT
314 ||GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_POINTER_CONT))
315 return gfc_index_one_node;
317 return gfc_conv_descriptor_stride (desc, dim);
321 gfc_conv_descriptor_stride_set (stmtblock_t *block, tree desc,
322 tree dim, tree value)
324 tree t = gfc_conv_descriptor_stride (desc, dim);
325 gfc_add_modify (block, t, fold_convert (TREE_TYPE (t), value));
329 gfc_conv_descriptor_lbound (tree desc, tree dim)
334 tmp = gfc_conv_descriptor_dimension (desc, dim);
335 field = TYPE_FIELDS (TREE_TYPE (tmp));
336 field = gfc_advance_chain (field, LBOUND_SUBFIELD);
337 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == gfc_array_index_type);
339 tmp = fold_build3_loc (input_location, COMPONENT_REF, TREE_TYPE (field),
340 tmp, field, NULL_TREE);
345 gfc_conv_descriptor_lbound_get (tree desc, tree dim)
347 return gfc_conv_descriptor_lbound (desc, dim);
351 gfc_conv_descriptor_lbound_set (stmtblock_t *block, tree desc,
352 tree dim, tree value)
354 tree t = gfc_conv_descriptor_lbound (desc, dim);
355 gfc_add_modify (block, t, fold_convert (TREE_TYPE (t), value));
359 gfc_conv_descriptor_ubound (tree desc, tree dim)
364 tmp = gfc_conv_descriptor_dimension (desc, dim);
365 field = TYPE_FIELDS (TREE_TYPE (tmp));
366 field = gfc_advance_chain (field, UBOUND_SUBFIELD);
367 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == gfc_array_index_type);
369 tmp = fold_build3_loc (input_location, COMPONENT_REF, TREE_TYPE (field),
370 tmp, field, NULL_TREE);
375 gfc_conv_descriptor_ubound_get (tree desc, tree dim)
377 return gfc_conv_descriptor_ubound (desc, dim);
381 gfc_conv_descriptor_ubound_set (stmtblock_t *block, tree desc,
382 tree dim, tree value)
384 tree t = gfc_conv_descriptor_ubound (desc, dim);
385 gfc_add_modify (block, t, fold_convert (TREE_TYPE (t), value));
388 /* Build a null array descriptor constructor. */
391 gfc_build_null_descriptor (tree type)
396 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
397 gcc_assert (DATA_FIELD == 0);
398 field = TYPE_FIELDS (type);
400 /* Set a NULL data pointer. */
401 tmp = build_constructor_single (type, field, null_pointer_node);
402 TREE_CONSTANT (tmp) = 1;
403 /* All other fields are ignored. */
409 /* Modify a descriptor such that the lbound of a given dimension is the value
410 specified. This also updates ubound and offset accordingly. */
413 gfc_conv_shift_descriptor_lbound (stmtblock_t* block, tree desc,
414 int dim, tree new_lbound)
416 tree offs, ubound, lbound, stride;
417 tree diff, offs_diff;
419 new_lbound = fold_convert (gfc_array_index_type, new_lbound);
421 offs = gfc_conv_descriptor_offset_get (desc);
422 lbound = gfc_conv_descriptor_lbound_get (desc, gfc_rank_cst[dim]);
423 ubound = gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[dim]);
424 stride = gfc_conv_descriptor_stride_get (desc, gfc_rank_cst[dim]);
426 /* Get difference (new - old) by which to shift stuff. */
427 diff = fold_build2_loc (input_location, MINUS_EXPR, gfc_array_index_type,
430 /* Shift ubound and offset accordingly. This has to be done before
431 updating the lbound, as they depend on the lbound expression! */
432 ubound = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
434 gfc_conv_descriptor_ubound_set (block, desc, gfc_rank_cst[dim], ubound);
435 offs_diff = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
437 offs = fold_build2_loc (input_location, MINUS_EXPR, gfc_array_index_type,
439 gfc_conv_descriptor_offset_set (block, desc, offs);
441 /* Finally set lbound to value we want. */
442 gfc_conv_descriptor_lbound_set (block, desc, gfc_rank_cst[dim], new_lbound);
446 /* Cleanup those #defines. */
451 #undef DIMENSION_FIELD
452 #undef CAF_TOKEN_FIELD
453 #undef STRIDE_SUBFIELD
454 #undef LBOUND_SUBFIELD
455 #undef UBOUND_SUBFIELD
458 /* Mark a SS chain as used. Flags specifies in which loops the SS is used.
459 flags & 1 = Main loop body.
460 flags & 2 = temp copy loop. */
463 gfc_mark_ss_chain_used (gfc_ss * ss, unsigned flags)
465 for (; ss != gfc_ss_terminator; ss = ss->next)
466 ss->info->useflags = flags;
470 /* Free a gfc_ss chain. */
473 gfc_free_ss_chain (gfc_ss * ss)
477 while (ss != gfc_ss_terminator)
479 gcc_assert (ss != NULL);
488 free_ss_info (gfc_ss_info *ss_info)
491 if (ss_info->refcount > 0)
494 gcc_assert (ss_info->refcount == 0);
502 gfc_free_ss (gfc_ss * ss)
504 gfc_ss_info *ss_info;
509 switch (ss_info->type)
512 for (n = 0; n < ss->dimen; n++)
514 if (ss_info->data.array.subscript[ss->dim[n]])
515 gfc_free_ss_chain (ss_info->data.array.subscript[ss->dim[n]]);
523 free_ss_info (ss_info);
528 /* Creates and initializes an array type gfc_ss struct. */
531 gfc_get_array_ss (gfc_ss *next, gfc_expr *expr, int dimen, gfc_ss_type type)
534 gfc_ss_info *ss_info;
537 ss_info = gfc_get_ss_info ();
539 ss_info->type = type;
540 ss_info->expr = expr;
546 for (i = 0; i < ss->dimen; i++)
553 /* Creates and initializes a temporary type gfc_ss struct. */
556 gfc_get_temp_ss (tree type, tree string_length, int dimen)
559 gfc_ss_info *ss_info;
562 ss_info = gfc_get_ss_info ();
564 ss_info->type = GFC_SS_TEMP;
565 ss_info->string_length = string_length;
566 ss_info->data.temp.type = type;
570 ss->next = gfc_ss_terminator;
572 for (i = 0; i < ss->dimen; i++)
579 /* Creates and initializes a scalar type gfc_ss struct. */
582 gfc_get_scalar_ss (gfc_ss *next, gfc_expr *expr)
585 gfc_ss_info *ss_info;
587 ss_info = gfc_get_ss_info ();
589 ss_info->type = GFC_SS_SCALAR;
590 ss_info->expr = expr;
600 /* Free all the SS associated with a loop. */
603 gfc_cleanup_loop (gfc_loopinfo * loop)
605 gfc_loopinfo *loop_next, **ploop;
610 while (ss != gfc_ss_terminator)
612 gcc_assert (ss != NULL);
613 next = ss->loop_chain;
618 /* Remove reference to self in the parent loop. */
620 for (ploop = &loop->parent->nested; *ploop; ploop = &(*ploop)->next)
627 /* Free non-freed nested loops. */
628 for (loop = loop->nested; loop; loop = loop_next)
630 loop_next = loop->next;
631 gfc_cleanup_loop (loop);
638 set_ss_loop (gfc_ss *ss, gfc_loopinfo *loop)
642 for (; ss != gfc_ss_terminator; ss = ss->next)
646 if (ss->info->type == GFC_SS_SCALAR
647 || ss->info->type == GFC_SS_REFERENCE
648 || ss->info->type == GFC_SS_TEMP)
651 for (n = 0; n < GFC_MAX_DIMENSIONS; n++)
652 if (ss->info->data.array.subscript[n] != NULL)
653 set_ss_loop (ss->info->data.array.subscript[n], loop);
658 /* Associate a SS chain with a loop. */
661 gfc_add_ss_to_loop (gfc_loopinfo * loop, gfc_ss * head)
664 gfc_loopinfo *nested_loop;
666 if (head == gfc_ss_terminator)
669 set_ss_loop (head, loop);
672 for (; ss && ss != gfc_ss_terminator; ss = ss->next)
676 nested_loop = ss->nested_ss->loop;
678 /* More than one ss can belong to the same loop. Hence, we add the
679 loop to the chain only if it is different from the previously
680 added one, to avoid duplicate nested loops. */
681 if (nested_loop != loop->nested)
683 gcc_assert (nested_loop->parent == NULL);
684 nested_loop->parent = loop;
686 gcc_assert (nested_loop->next == NULL);
687 nested_loop->next = loop->nested;
688 loop->nested = nested_loop;
691 gcc_assert (nested_loop->parent == loop);
694 if (ss->next == gfc_ss_terminator)
695 ss->loop_chain = loop->ss;
697 ss->loop_chain = ss->next;
699 gcc_assert (ss == gfc_ss_terminator);
704 /* Generate an initializer for a static pointer or allocatable array. */
707 gfc_trans_static_array_pointer (gfc_symbol * sym)
711 gcc_assert (TREE_STATIC (sym->backend_decl));
712 /* Just zero the data member. */
713 type = TREE_TYPE (sym->backend_decl);
714 DECL_INITIAL (sym->backend_decl) = gfc_build_null_descriptor (type);
718 /* If the bounds of SE's loop have not yet been set, see if they can be
719 determined from array spec AS, which is the array spec of a called
720 function. MAPPING maps the callee's dummy arguments to the values
721 that the caller is passing. Add any initialization and finalization
725 gfc_set_loop_bounds_from_array_spec (gfc_interface_mapping * mapping,
726 gfc_se * se, gfc_array_spec * as)
728 int n, dim, total_dim;
737 if (!as || as->type != AS_EXPLICIT)
740 for (ss = se->ss; ss; ss = ss->parent)
742 total_dim += ss->loop->dimen;
743 for (n = 0; n < ss->loop->dimen; n++)
745 /* The bound is known, nothing to do. */
746 if (ss->loop->to[n] != NULL_TREE)
750 gcc_assert (dim < as->rank);
751 gcc_assert (ss->loop->dimen <= as->rank);
753 /* Evaluate the lower bound. */
754 gfc_init_se (&tmpse, NULL);
755 gfc_apply_interface_mapping (mapping, &tmpse, as->lower[dim]);
756 gfc_add_block_to_block (&se->pre, &tmpse.pre);
757 gfc_add_block_to_block (&se->post, &tmpse.post);
758 lower = fold_convert (gfc_array_index_type, tmpse.expr);
760 /* ...and the upper bound. */
761 gfc_init_se (&tmpse, NULL);
762 gfc_apply_interface_mapping (mapping, &tmpse, as->upper[dim]);
763 gfc_add_block_to_block (&se->pre, &tmpse.pre);
764 gfc_add_block_to_block (&se->post, &tmpse.post);
765 upper = fold_convert (gfc_array_index_type, tmpse.expr);
767 /* Set the upper bound of the loop to UPPER - LOWER. */
768 tmp = fold_build2_loc (input_location, MINUS_EXPR,
769 gfc_array_index_type, upper, lower);
770 tmp = gfc_evaluate_now (tmp, &se->pre);
771 ss->loop->to[n] = tmp;
775 gcc_assert (total_dim == as->rank);
779 /* Generate code to allocate an array temporary, or create a variable to
780 hold the data. If size is NULL, zero the descriptor so that the
781 callee will allocate the array. If DEALLOC is true, also generate code to
782 free the array afterwards.
784 If INITIAL is not NULL, it is packed using internal_pack and the result used
785 as data instead of allocating a fresh, unitialized area of memory.
787 Initialization code is added to PRE and finalization code to POST.
788 DYNAMIC is true if the caller may want to extend the array later
789 using realloc. This prevents us from putting the array on the stack. */
792 gfc_trans_allocate_array_storage (stmtblock_t * pre, stmtblock_t * post,
793 gfc_array_info * info, tree size, tree nelem,
794 tree initial, bool dynamic, bool dealloc)
800 desc = info->descriptor;
801 info->offset = gfc_index_zero_node;
802 if (size == NULL_TREE || integer_zerop (size))
804 /* A callee allocated array. */
805 gfc_conv_descriptor_data_set (pre, desc, null_pointer_node);
810 /* Allocate the temporary. */
811 onstack = !dynamic && initial == NULL_TREE
812 && (gfc_option.flag_stack_arrays
813 || gfc_can_put_var_on_stack (size));
817 /* Make a temporary variable to hold the data. */
818 tmp = fold_build2_loc (input_location, MINUS_EXPR, TREE_TYPE (nelem),
819 nelem, gfc_index_one_node);
820 tmp = gfc_evaluate_now (tmp, pre);
821 tmp = build_range_type (gfc_array_index_type, gfc_index_zero_node,
823 tmp = build_array_type (gfc_get_element_type (TREE_TYPE (desc)),
825 tmp = gfc_create_var (tmp, "A");
826 /* If we're here only because of -fstack-arrays we have to
827 emit a DECL_EXPR to make the gimplifier emit alloca calls. */
828 if (!gfc_can_put_var_on_stack (size))
829 gfc_add_expr_to_block (pre,
830 fold_build1_loc (input_location,
831 DECL_EXPR, TREE_TYPE (tmp),
833 tmp = gfc_build_addr_expr (NULL_TREE, tmp);
834 gfc_conv_descriptor_data_set (pre, desc, tmp);
838 /* Allocate memory to hold the data or call internal_pack. */
839 if (initial == NULL_TREE)
841 tmp = gfc_call_malloc (pre, NULL, size);
842 tmp = gfc_evaluate_now (tmp, pre);
849 stmtblock_t do_copying;
851 tmp = TREE_TYPE (initial); /* Pointer to descriptor. */
852 gcc_assert (TREE_CODE (tmp) == POINTER_TYPE);
853 tmp = TREE_TYPE (tmp); /* The descriptor itself. */
854 tmp = gfc_get_element_type (tmp);
855 gcc_assert (tmp == gfc_get_element_type (TREE_TYPE (desc)));
856 packed = gfc_create_var (build_pointer_type (tmp), "data");
858 tmp = build_call_expr_loc (input_location,
859 gfor_fndecl_in_pack, 1, initial);
860 tmp = fold_convert (TREE_TYPE (packed), tmp);
861 gfc_add_modify (pre, packed, tmp);
863 tmp = build_fold_indirect_ref_loc (input_location,
865 source_data = gfc_conv_descriptor_data_get (tmp);
867 /* internal_pack may return source->data without any allocation
868 or copying if it is already packed. If that's the case, we
869 need to allocate and copy manually. */
871 gfc_start_block (&do_copying);
872 tmp = gfc_call_malloc (&do_copying, NULL, size);
873 tmp = fold_convert (TREE_TYPE (packed), tmp);
874 gfc_add_modify (&do_copying, packed, tmp);
875 tmp = gfc_build_memcpy_call (packed, source_data, size);
876 gfc_add_expr_to_block (&do_copying, tmp);
878 was_packed = fold_build2_loc (input_location, EQ_EXPR,
879 boolean_type_node, packed,
881 tmp = gfc_finish_block (&do_copying);
882 tmp = build3_v (COND_EXPR, was_packed, tmp,
883 build_empty_stmt (input_location));
884 gfc_add_expr_to_block (pre, tmp);
886 tmp = fold_convert (pvoid_type_node, packed);
889 gfc_conv_descriptor_data_set (pre, desc, tmp);
892 info->data = gfc_conv_descriptor_data_get (desc);
894 /* The offset is zero because we create temporaries with a zero
896 gfc_conv_descriptor_offset_set (pre, desc, gfc_index_zero_node);
898 if (dealloc && !onstack)
900 /* Free the temporary. */
901 tmp = gfc_conv_descriptor_data_get (desc);
902 tmp = gfc_call_free (fold_convert (pvoid_type_node, tmp));
903 gfc_add_expr_to_block (post, tmp);
908 /* Get the scalarizer array dimension corresponding to actual array dimension
911 For example, if SS represents the array ref a(1,:,:,1), it is a
912 bidimensional scalarizer array, and the result would be 0 for ARRAY_DIM=1,
913 and 1 for ARRAY_DIM=2.
914 If SS represents transpose(a(:,1,1,:)), it is again a bidimensional
915 scalarizer array, and the result would be 1 for ARRAY_DIM=0 and 0 for
917 If SS represents sum(a(:,:,:,1), dim=1), it is a 2+1-dimensional scalarizer
918 array. If called on the inner ss, the result would be respectively 0,1,2 for
919 ARRAY_DIM=0,1,2. If called on the outer ss, the result would be 0,1
920 for ARRAY_DIM=1,2. */
923 get_scalarizer_dim_for_array_dim (gfc_ss *ss, int array_dim)
930 for (; ss; ss = ss->parent)
931 for (n = 0; n < ss->dimen; n++)
932 if (ss->dim[n] < array_dim)
935 return array_ref_dim;
940 innermost_ss (gfc_ss *ss)
942 while (ss->nested_ss != NULL)
950 /* Get the array reference dimension corresponding to the given loop dimension.
951 It is different from the true array dimension given by the dim array in
952 the case of a partial array reference (i.e. a(:,:,1,:) for example)
953 It is different from the loop dimension in the case of a transposed array.
957 get_array_ref_dim_for_loop_dim (gfc_ss *ss, int loop_dim)
959 return get_scalarizer_dim_for_array_dim (innermost_ss (ss),
964 /* Generate code to create and initialize the descriptor for a temporary
965 array. This is used for both temporaries needed by the scalarizer, and
966 functions returning arrays. Adjusts the loop variables to be
967 zero-based, and calculates the loop bounds for callee allocated arrays.
968 Allocate the array unless it's callee allocated (we have a callee
969 allocated array if 'callee_alloc' is true, or if loop->to[n] is
970 NULL_TREE for any n). Also fills in the descriptor, data and offset
971 fields of info if known. Returns the size of the array, or NULL for a
972 callee allocated array.
974 'eltype' == NULL signals that the temporary should be a class object.
975 The 'initial' expression is used to obtain the size of the dynamic
976 type; otehrwise the allocation and initialisation proceeds as for any
979 PRE, POST, INITIAL, DYNAMIC and DEALLOC are as for
980 gfc_trans_allocate_array_storage. */
983 gfc_trans_create_temp_array (stmtblock_t * pre, stmtblock_t * post, gfc_ss * ss,
984 tree eltype, tree initial, bool dynamic,
985 bool dealloc, bool callee_alloc, locus * where)
989 gfc_array_info *info;
990 tree from[GFC_MAX_DIMENSIONS], to[GFC_MAX_DIMENSIONS];
998 tree class_expr = NULL_TREE;
1002 /* This signals a class array for which we need the size of the
1003 dynamic type. Generate an eltype and then the class expression. */
1004 if (eltype == NULL_TREE && initial)
1006 if (POINTER_TYPE_P (TREE_TYPE (initial)))
1007 class_expr = build_fold_indirect_ref_loc (input_location, initial);
1008 eltype = TREE_TYPE (class_expr);
1009 eltype = gfc_get_element_type (eltype);
1010 /* Obtain the structure (class) expression. */
1011 class_expr = TREE_OPERAND (class_expr, 0);
1012 gcc_assert (class_expr);
1015 memset (from, 0, sizeof (from));
1016 memset (to, 0, sizeof (to));
1018 info = &ss->info->data.array;
1020 gcc_assert (ss->dimen > 0);
1021 gcc_assert (ss->loop->dimen == ss->dimen);
1023 if (gfc_option.warn_array_temp && where)
1024 gfc_warning ("Creating array temporary at %L", where);
1026 /* Set the lower bound to zero. */
1027 for (s = ss; s; s = s->parent)
1031 total_dim += loop->dimen;
1032 for (n = 0; n < loop->dimen; n++)
1036 /* Callee allocated arrays may not have a known bound yet. */
1038 loop->to[n] = gfc_evaluate_now (
1039 fold_build2_loc (input_location, MINUS_EXPR,
1040 gfc_array_index_type,
1041 loop->to[n], loop->from[n]),
1043 loop->from[n] = gfc_index_zero_node;
1045 /* We have just changed the loop bounds, we must clear the
1046 corresponding specloop, so that delta calculation is not skipped
1047 later in gfc_set_delta. */
1048 loop->specloop[n] = NULL;
1050 /* We are constructing the temporary's descriptor based on the loop
1051 dimensions. As the dimensions may be accessed in arbitrary order
1052 (think of transpose) the size taken from the n'th loop may not map
1053 to the n'th dimension of the array. We need to reconstruct loop
1054 infos in the right order before using it to set the descriptor
1056 tmp_dim = get_scalarizer_dim_for_array_dim (ss, dim);
1057 from[tmp_dim] = loop->from[n];
1058 to[tmp_dim] = loop->to[n];
1060 info->delta[dim] = gfc_index_zero_node;
1061 info->start[dim] = gfc_index_zero_node;
1062 info->end[dim] = gfc_index_zero_node;
1063 info->stride[dim] = gfc_index_one_node;
1067 /* Initialize the descriptor. */
1069 gfc_get_array_type_bounds (eltype, total_dim, 0, from, to, 1,
1070 GFC_ARRAY_UNKNOWN, true);
1071 desc = gfc_create_var (type, "atmp");
1072 GFC_DECL_PACKED_ARRAY (desc) = 1;
1074 info->descriptor = desc;
1075 size = gfc_index_one_node;
1077 /* Fill in the array dtype. */
1078 tmp = gfc_conv_descriptor_dtype (desc);
1079 gfc_add_modify (pre, tmp, gfc_get_dtype (TREE_TYPE (desc)));
1082 Fill in the bounds and stride. This is a packed array, so:
1085 for (n = 0; n < rank; n++)
1088 delta = ubound[n] + 1 - lbound[n];
1089 size = size * delta;
1091 size = size * sizeof(element);
1094 or_expr = NULL_TREE;
1096 /* If there is at least one null loop->to[n], it is a callee allocated
1098 for (n = 0; n < total_dim; n++)
1099 if (to[n] == NULL_TREE)
1105 if (size == NULL_TREE)
1106 for (s = ss; s; s = s->parent)
1107 for (n = 0; n < s->loop->dimen; n++)
1109 dim = get_scalarizer_dim_for_array_dim (ss, s->dim[n]);
1111 /* For a callee allocated array express the loop bounds in terms
1112 of the descriptor fields. */
1113 tmp = fold_build2_loc (input_location,
1114 MINUS_EXPR, gfc_array_index_type,
1115 gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[dim]),
1116 gfc_conv_descriptor_lbound_get (desc, gfc_rank_cst[dim]));
1117 s->loop->to[n] = tmp;
1121 for (n = 0; n < total_dim; n++)
1123 /* Store the stride and bound components in the descriptor. */
1124 gfc_conv_descriptor_stride_set (pre, desc, gfc_rank_cst[n], size);
1126 gfc_conv_descriptor_lbound_set (pre, desc, gfc_rank_cst[n],
1127 gfc_index_zero_node);
1129 gfc_conv_descriptor_ubound_set (pre, desc, gfc_rank_cst[n], to[n]);
1131 tmp = fold_build2_loc (input_location, PLUS_EXPR,
1132 gfc_array_index_type,
1133 to[n], gfc_index_one_node);
1135 /* Check whether the size for this dimension is negative. */
1136 cond = fold_build2_loc (input_location, LE_EXPR, boolean_type_node,
1137 tmp, gfc_index_zero_node);
1138 cond = gfc_evaluate_now (cond, pre);
1143 or_expr = fold_build2_loc (input_location, TRUTH_OR_EXPR,
1144 boolean_type_node, or_expr, cond);
1146 size = fold_build2_loc (input_location, MULT_EXPR,
1147 gfc_array_index_type, size, tmp);
1148 size = gfc_evaluate_now (size, pre);
1152 /* Get the size of the array. */
1153 if (size && !callee_alloc)
1156 /* If or_expr is true, then the extent in at least one
1157 dimension is zero and the size is set to zero. */
1158 size = fold_build3_loc (input_location, COND_EXPR, gfc_array_index_type,
1159 or_expr, gfc_index_zero_node, size);
1162 if (class_expr == NULL_TREE)
1163 elemsize = fold_convert (gfc_array_index_type,
1164 TYPE_SIZE_UNIT (gfc_get_element_type (type)));
1166 elemsize = gfc_vtable_size_get (class_expr);
1168 size = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
1177 gfc_trans_allocate_array_storage (pre, post, info, size, nelem, initial,
1183 if (ss->dimen > ss->loop->temp_dim)
1184 ss->loop->temp_dim = ss->dimen;
1190 /* Return the number of iterations in a loop that starts at START,
1191 ends at END, and has step STEP. */
1194 gfc_get_iteration_count (tree start, tree end, tree step)
1199 type = TREE_TYPE (step);
1200 tmp = fold_build2_loc (input_location, MINUS_EXPR, type, end, start);
1201 tmp = fold_build2_loc (input_location, FLOOR_DIV_EXPR, type, tmp, step);
1202 tmp = fold_build2_loc (input_location, PLUS_EXPR, type, tmp,
1203 build_int_cst (type, 1));
1204 tmp = fold_build2_loc (input_location, MAX_EXPR, type, tmp,
1205 build_int_cst (type, 0));
1206 return fold_convert (gfc_array_index_type, tmp);
1210 /* Extend the data in array DESC by EXTRA elements. */
1213 gfc_grow_array (stmtblock_t * pblock, tree desc, tree extra)
1220 if (integer_zerop (extra))
1223 ubound = gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[0]);
1225 /* Add EXTRA to the upper bound. */
1226 tmp = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
1228 gfc_conv_descriptor_ubound_set (pblock, desc, gfc_rank_cst[0], tmp);
1230 /* Get the value of the current data pointer. */
1231 arg0 = gfc_conv_descriptor_data_get (desc);
1233 /* Calculate the new array size. */
1234 size = TYPE_SIZE_UNIT (gfc_get_element_type (TREE_TYPE (desc)));
1235 tmp = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
1236 ubound, gfc_index_one_node);
1237 arg1 = fold_build2_loc (input_location, MULT_EXPR, size_type_node,
1238 fold_convert (size_type_node, tmp),
1239 fold_convert (size_type_node, size));
1241 /* Call the realloc() function. */
1242 tmp = gfc_call_realloc (pblock, arg0, arg1);
1243 gfc_conv_descriptor_data_set (pblock, desc, tmp);
1247 /* Return true if the bounds of iterator I can only be determined
1251 gfc_iterator_has_dynamic_bounds (gfc_iterator * i)
1253 return (i->start->expr_type != EXPR_CONSTANT
1254 || i->end->expr_type != EXPR_CONSTANT
1255 || i->step->expr_type != EXPR_CONSTANT);
1259 /* Split the size of constructor element EXPR into the sum of two terms,
1260 one of which can be determined at compile time and one of which must
1261 be calculated at run time. Set *SIZE to the former and return true
1262 if the latter might be nonzero. */
1265 gfc_get_array_constructor_element_size (mpz_t * size, gfc_expr * expr)
1267 if (expr->expr_type == EXPR_ARRAY)
1268 return gfc_get_array_constructor_size (size, expr->value.constructor);
1269 else if (expr->rank > 0)
1271 /* Calculate everything at run time. */
1272 mpz_set_ui (*size, 0);
1277 /* A single element. */
1278 mpz_set_ui (*size, 1);
1284 /* Like gfc_get_array_constructor_element_size, but applied to the whole
1285 of array constructor C. */
1288 gfc_get_array_constructor_size (mpz_t * size, gfc_constructor_base base)
1296 mpz_set_ui (*size, 0);
1301 for (c = gfc_constructor_first (base); c; c = gfc_constructor_next (c))
1304 if (i && gfc_iterator_has_dynamic_bounds (i))
1308 dynamic |= gfc_get_array_constructor_element_size (&len, c->expr);
1311 /* Multiply the static part of the element size by the
1312 number of iterations. */
1313 mpz_sub (val, i->end->value.integer, i->start->value.integer);
1314 mpz_fdiv_q (val, val, i->step->value.integer);
1315 mpz_add_ui (val, val, 1);
1316 if (mpz_sgn (val) > 0)
1317 mpz_mul (len, len, val);
1319 mpz_set_ui (len, 0);
1321 mpz_add (*size, *size, len);
1330 /* Make sure offset is a variable. */
1333 gfc_put_offset_into_var (stmtblock_t * pblock, tree * poffset,
1336 /* We should have already created the offset variable. We cannot
1337 create it here because we may be in an inner scope. */
1338 gcc_assert (*offsetvar != NULL_TREE);
1339 gfc_add_modify (pblock, *offsetvar, *poffset);
1340 *poffset = *offsetvar;
1341 TREE_USED (*offsetvar) = 1;
1345 /* Variables needed for bounds-checking. */
1346 static bool first_len;
1347 static tree first_len_val;
1348 static bool typespec_chararray_ctor;
1351 gfc_trans_array_ctor_element (stmtblock_t * pblock, tree desc,
1352 tree offset, gfc_se * se, gfc_expr * expr)
1356 gfc_conv_expr (se, expr);
1358 /* Store the value. */
1359 tmp = build_fold_indirect_ref_loc (input_location,
1360 gfc_conv_descriptor_data_get (desc));
1361 tmp = gfc_build_array_ref (tmp, offset, NULL);
1363 if (expr->ts.type == BT_CHARACTER)
1365 int i = gfc_validate_kind (BT_CHARACTER, expr->ts.kind, false);
1368 esize = size_in_bytes (gfc_get_element_type (TREE_TYPE (desc)));
1369 esize = fold_convert (gfc_charlen_type_node, esize);
1370 esize = fold_build2_loc (input_location, TRUNC_DIV_EXPR,
1371 gfc_charlen_type_node, esize,
1372 build_int_cst (gfc_charlen_type_node,
1373 gfc_character_kinds[i].bit_size / 8));
1375 gfc_conv_string_parameter (se);
1376 if (POINTER_TYPE_P (TREE_TYPE (tmp)))
1378 /* The temporary is an array of pointers. */
1379 se->expr = fold_convert (TREE_TYPE (tmp), se->expr);
1380 gfc_add_modify (&se->pre, tmp, se->expr);
1384 /* The temporary is an array of string values. */
1385 tmp = gfc_build_addr_expr (gfc_get_pchar_type (expr->ts.kind), tmp);
1386 /* We know the temporary and the value will be the same length,
1387 so can use memcpy. */
1388 gfc_trans_string_copy (&se->pre, esize, tmp, expr->ts.kind,
1389 se->string_length, se->expr, expr->ts.kind);
1391 if ((gfc_option.rtcheck & GFC_RTCHECK_BOUNDS) && !typespec_chararray_ctor)
1395 gfc_add_modify (&se->pre, first_len_val,
1401 /* Verify that all constructor elements are of the same
1403 tree cond = fold_build2_loc (input_location, NE_EXPR,
1404 boolean_type_node, first_len_val,
1406 gfc_trans_runtime_check
1407 (true, false, cond, &se->pre, &expr->where,
1408 "Different CHARACTER lengths (%ld/%ld) in array constructor",
1409 fold_convert (long_integer_type_node, first_len_val),
1410 fold_convert (long_integer_type_node, se->string_length));
1416 /* TODO: Should the frontend already have done this conversion? */
1417 se->expr = fold_convert (TREE_TYPE (tmp), se->expr);
1418 gfc_add_modify (&se->pre, tmp, se->expr);
1421 gfc_add_block_to_block (pblock, &se->pre);
1422 gfc_add_block_to_block (pblock, &se->post);
1426 /* Add the contents of an array to the constructor. DYNAMIC is as for
1427 gfc_trans_array_constructor_value. */
1430 gfc_trans_array_constructor_subarray (stmtblock_t * pblock,
1431 tree type ATTRIBUTE_UNUSED,
1432 tree desc, gfc_expr * expr,
1433 tree * poffset, tree * offsetvar,
1444 /* We need this to be a variable so we can increment it. */
1445 gfc_put_offset_into_var (pblock, poffset, offsetvar);
1447 gfc_init_se (&se, NULL);
1449 /* Walk the array expression. */
1450 ss = gfc_walk_expr (expr);
1451 gcc_assert (ss != gfc_ss_terminator);
1453 /* Initialize the scalarizer. */
1454 gfc_init_loopinfo (&loop);
1455 gfc_add_ss_to_loop (&loop, ss);
1457 /* Initialize the loop. */
1458 gfc_conv_ss_startstride (&loop);
1459 gfc_conv_loop_setup (&loop, &expr->where);
1461 /* Make sure the constructed array has room for the new data. */
1464 /* Set SIZE to the total number of elements in the subarray. */
1465 size = gfc_index_one_node;
1466 for (n = 0; n < loop.dimen; n++)
1468 tmp = gfc_get_iteration_count (loop.from[n], loop.to[n],
1469 gfc_index_one_node);
1470 size = fold_build2_loc (input_location, MULT_EXPR,
1471 gfc_array_index_type, size, tmp);
1474 /* Grow the constructed array by SIZE elements. */
1475 gfc_grow_array (&loop.pre, desc, size);
1478 /* Make the loop body. */
1479 gfc_mark_ss_chain_used (ss, 1);
1480 gfc_start_scalarized_body (&loop, &body);
1481 gfc_copy_loopinfo_to_se (&se, &loop);
1484 gfc_trans_array_ctor_element (&body, desc, *poffset, &se, expr);
1485 gcc_assert (se.ss == gfc_ss_terminator);
1487 /* Increment the offset. */
1488 tmp = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
1489 *poffset, gfc_index_one_node);
1490 gfc_add_modify (&body, *poffset, tmp);
1492 /* Finish the loop. */
1493 gfc_trans_scalarizing_loops (&loop, &body);
1494 gfc_add_block_to_block (&loop.pre, &loop.post);
1495 tmp = gfc_finish_block (&loop.pre);
1496 gfc_add_expr_to_block (pblock, tmp);
1498 gfc_cleanup_loop (&loop);
1502 /* Assign the values to the elements of an array constructor. DYNAMIC
1503 is true if descriptor DESC only contains enough data for the static
1504 size calculated by gfc_get_array_constructor_size. When true, memory
1505 for the dynamic parts must be allocated using realloc. */
1508 gfc_trans_array_constructor_value (stmtblock_t * pblock, tree type,
1509 tree desc, gfc_constructor_base base,
1510 tree * poffset, tree * offsetvar,
1519 tree shadow_loopvar = NULL_TREE;
1520 gfc_saved_var saved_loopvar;
1523 for (c = gfc_constructor_first (base); c; c = gfc_constructor_next (c))
1525 /* If this is an iterator or an array, the offset must be a variable. */
1526 if ((c->iterator || c->expr->rank > 0) && INTEGER_CST_P (*poffset))
1527 gfc_put_offset_into_var (pblock, poffset, offsetvar);
1529 /* Shadowing the iterator avoids changing its value and saves us from
1530 keeping track of it. Further, it makes sure that there's always a
1531 backend-decl for the symbol, even if there wasn't one before,
1532 e.g. in the case of an iterator that appears in a specification
1533 expression in an interface mapping. */
1536 gfc_symbol *sym = c->iterator->var->symtree->n.sym;
1537 tree type = gfc_typenode_for_spec (&sym->ts);
1539 shadow_loopvar = gfc_create_var (type, "shadow_loopvar");
1540 gfc_shadow_sym (sym, shadow_loopvar, &saved_loopvar);
1543 gfc_start_block (&body);
1545 if (c->expr->expr_type == EXPR_ARRAY)
1547 /* Array constructors can be nested. */
1548 gfc_trans_array_constructor_value (&body, type, desc,
1549 c->expr->value.constructor,
1550 poffset, offsetvar, dynamic);
1552 else if (c->expr->rank > 0)
1554 gfc_trans_array_constructor_subarray (&body, type, desc, c->expr,
1555 poffset, offsetvar, dynamic);
1559 /* This code really upsets the gimplifier so don't bother for now. */
1566 while (p && !(p->iterator || p->expr->expr_type != EXPR_CONSTANT))
1568 p = gfc_constructor_next (p);
1573 /* Scalar values. */
1574 gfc_init_se (&se, NULL);
1575 gfc_trans_array_ctor_element (&body, desc, *poffset,
1578 *poffset = fold_build2_loc (input_location, PLUS_EXPR,
1579 gfc_array_index_type,
1580 *poffset, gfc_index_one_node);
1584 /* Collect multiple scalar constants into a constructor. */
1585 VEC(constructor_elt,gc) *v = NULL;
1589 HOST_WIDE_INT idx = 0;
1592 /* Count the number of consecutive scalar constants. */
1593 while (p && !(p->iterator
1594 || p->expr->expr_type != EXPR_CONSTANT))
1596 gfc_init_se (&se, NULL);
1597 gfc_conv_constant (&se, p->expr);
1599 if (c->expr->ts.type != BT_CHARACTER)
1600 se.expr = fold_convert (type, se.expr);
1601 /* For constant character array constructors we build
1602 an array of pointers. */
1603 else if (POINTER_TYPE_P (type))
1604 se.expr = gfc_build_addr_expr
1605 (gfc_get_pchar_type (p->expr->ts.kind),
1608 CONSTRUCTOR_APPEND_ELT (v,
1609 build_int_cst (gfc_array_index_type,
1613 p = gfc_constructor_next (p);
1616 bound = size_int (n - 1);
1617 /* Create an array type to hold them. */
1618 tmptype = build_range_type (gfc_array_index_type,
1619 gfc_index_zero_node, bound);
1620 tmptype = build_array_type (type, tmptype);
1622 init = build_constructor (tmptype, v);
1623 TREE_CONSTANT (init) = 1;
1624 TREE_STATIC (init) = 1;
1625 /* Create a static variable to hold the data. */
1626 tmp = gfc_create_var (tmptype, "data");
1627 TREE_STATIC (tmp) = 1;
1628 TREE_CONSTANT (tmp) = 1;
1629 TREE_READONLY (tmp) = 1;
1630 DECL_INITIAL (tmp) = init;
1633 /* Use BUILTIN_MEMCPY to assign the values. */
1634 tmp = gfc_conv_descriptor_data_get (desc);
1635 tmp = build_fold_indirect_ref_loc (input_location,
1637 tmp = gfc_build_array_ref (tmp, *poffset, NULL);
1638 tmp = gfc_build_addr_expr (NULL_TREE, tmp);
1639 init = gfc_build_addr_expr (NULL_TREE, init);
1641 size = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (type));
1642 bound = build_int_cst (size_type_node, n * size);
1643 tmp = build_call_expr_loc (input_location,
1644 builtin_decl_explicit (BUILT_IN_MEMCPY),
1645 3, tmp, init, bound);
1646 gfc_add_expr_to_block (&body, tmp);
1648 *poffset = fold_build2_loc (input_location, PLUS_EXPR,
1649 gfc_array_index_type, *poffset,
1650 build_int_cst (gfc_array_index_type, n));
1652 if (!INTEGER_CST_P (*poffset))
1654 gfc_add_modify (&body, *offsetvar, *poffset);
1655 *poffset = *offsetvar;
1659 /* The frontend should already have done any expansions
1663 /* Pass the code as is. */
1664 tmp = gfc_finish_block (&body);
1665 gfc_add_expr_to_block (pblock, tmp);
1669 /* Build the implied do-loop. */
1670 stmtblock_t implied_do_block;
1678 loopbody = gfc_finish_block (&body);
1680 /* Create a new block that holds the implied-do loop. A temporary
1681 loop-variable is used. */
1682 gfc_start_block(&implied_do_block);
1684 /* Initialize the loop. */
1685 gfc_init_se (&se, NULL);
1686 gfc_conv_expr_val (&se, c->iterator->start);
1687 gfc_add_block_to_block (&implied_do_block, &se.pre);
1688 gfc_add_modify (&implied_do_block, shadow_loopvar, se.expr);
1690 gfc_init_se (&se, NULL);
1691 gfc_conv_expr_val (&se, c->iterator->end);
1692 gfc_add_block_to_block (&implied_do_block, &se.pre);
1693 end = gfc_evaluate_now (se.expr, &implied_do_block);
1695 gfc_init_se (&se, NULL);
1696 gfc_conv_expr_val (&se, c->iterator->step);
1697 gfc_add_block_to_block (&implied_do_block, &se.pre);
1698 step = gfc_evaluate_now (se.expr, &implied_do_block);
1700 /* If this array expands dynamically, and the number of iterations
1701 is not constant, we won't have allocated space for the static
1702 part of C->EXPR's size. Do that now. */
1703 if (dynamic && gfc_iterator_has_dynamic_bounds (c->iterator))
1705 /* Get the number of iterations. */
1706 tmp = gfc_get_iteration_count (shadow_loopvar, end, step);
1708 /* Get the static part of C->EXPR's size. */
1709 gfc_get_array_constructor_element_size (&size, c->expr);
1710 tmp2 = gfc_conv_mpz_to_tree (size, gfc_index_integer_kind);
1712 /* Grow the array by TMP * TMP2 elements. */
1713 tmp = fold_build2_loc (input_location, MULT_EXPR,
1714 gfc_array_index_type, tmp, tmp2);
1715 gfc_grow_array (&implied_do_block, desc, tmp);
1718 /* Generate the loop body. */
1719 exit_label = gfc_build_label_decl (NULL_TREE);
1720 gfc_start_block (&body);
1722 /* Generate the exit condition. Depending on the sign of
1723 the step variable we have to generate the correct
1725 tmp = fold_build2_loc (input_location, GT_EXPR, boolean_type_node,
1726 step, build_int_cst (TREE_TYPE (step), 0));
1727 cond = fold_build3_loc (input_location, COND_EXPR,
1728 boolean_type_node, tmp,
1729 fold_build2_loc (input_location, GT_EXPR,
1730 boolean_type_node, shadow_loopvar, end),
1731 fold_build2_loc (input_location, LT_EXPR,
1732 boolean_type_node, shadow_loopvar, end));
1733 tmp = build1_v (GOTO_EXPR, exit_label);
1734 TREE_USED (exit_label) = 1;
1735 tmp = build3_v (COND_EXPR, cond, tmp,
1736 build_empty_stmt (input_location));
1737 gfc_add_expr_to_block (&body, tmp);
1739 /* The main loop body. */
1740 gfc_add_expr_to_block (&body, loopbody);
1742 /* Increase loop variable by step. */
1743 tmp = fold_build2_loc (input_location, PLUS_EXPR,
1744 TREE_TYPE (shadow_loopvar), shadow_loopvar,
1746 gfc_add_modify (&body, shadow_loopvar, tmp);
1748 /* Finish the loop. */
1749 tmp = gfc_finish_block (&body);
1750 tmp = build1_v (LOOP_EXPR, tmp);
1751 gfc_add_expr_to_block (&implied_do_block, tmp);
1753 /* Add the exit label. */
1754 tmp = build1_v (LABEL_EXPR, exit_label);
1755 gfc_add_expr_to_block (&implied_do_block, tmp);
1757 /* Finishe the implied-do loop. */
1758 tmp = gfc_finish_block(&implied_do_block);
1759 gfc_add_expr_to_block(pblock, tmp);
1761 gfc_restore_sym (c->iterator->var->symtree->n.sym, &saved_loopvar);
1768 /* A catch-all to obtain the string length for anything that is not a
1769 a substring of non-constant length, a constant, array or variable. */
1772 get_array_ctor_all_strlen (stmtblock_t *block, gfc_expr *e, tree *len)
1777 /* Don't bother if we already know the length is a constant. */
1778 if (*len && INTEGER_CST_P (*len))
1781 if (!e->ref && e->ts.u.cl && e->ts.u.cl->length
1782 && e->ts.u.cl->length->expr_type == EXPR_CONSTANT)
1785 gfc_conv_const_charlen (e->ts.u.cl);
1786 *len = e->ts.u.cl->backend_decl;
1790 /* Otherwise, be brutal even if inefficient. */
1791 ss = gfc_walk_expr (e);
1792 gfc_init_se (&se, NULL);
1794 /* No function call, in case of side effects. */
1795 se.no_function_call = 1;
1796 if (ss == gfc_ss_terminator)
1797 gfc_conv_expr (&se, e);
1799 gfc_conv_expr_descriptor (&se, e, ss);
1801 /* Fix the value. */
1802 *len = gfc_evaluate_now (se.string_length, &se.pre);
1804 gfc_add_block_to_block (block, &se.pre);
1805 gfc_add_block_to_block (block, &se.post);
1807 e->ts.u.cl->backend_decl = *len;
1812 /* Figure out the string length of a variable reference expression.
1813 Used by get_array_ctor_strlen. */
1816 get_array_ctor_var_strlen (stmtblock_t *block, gfc_expr * expr, tree * len)
1822 /* Don't bother if we already know the length is a constant. */
1823 if (*len && INTEGER_CST_P (*len))
1826 ts = &expr->symtree->n.sym->ts;
1827 for (ref = expr->ref; ref; ref = ref->next)
1832 /* Array references don't change the string length. */
1836 /* Use the length of the component. */
1837 ts = &ref->u.c.component->ts;
1841 if (ref->u.ss.start->expr_type != EXPR_CONSTANT
1842 || ref->u.ss.end->expr_type != EXPR_CONSTANT)
1844 /* Note that this might evaluate expr. */
1845 get_array_ctor_all_strlen (block, expr, len);
1848 mpz_init_set_ui (char_len, 1);
1849 mpz_add (char_len, char_len, ref->u.ss.end->value.integer);
1850 mpz_sub (char_len, char_len, ref->u.ss.start->value.integer);
1851 *len = gfc_conv_mpz_to_tree (char_len, gfc_default_integer_kind);
1852 *len = convert (gfc_charlen_type_node, *len);
1853 mpz_clear (char_len);
1861 *len = ts->u.cl->backend_decl;
1865 /* Figure out the string length of a character array constructor.
1866 If len is NULL, don't calculate the length; this happens for recursive calls
1867 when a sub-array-constructor is an element but not at the first position,
1868 so when we're not interested in the length.
1869 Returns TRUE if all elements are character constants. */
1872 get_array_ctor_strlen (stmtblock_t *block, gfc_constructor_base base, tree * len)
1879 if (gfc_constructor_first (base) == NULL)
1882 *len = build_int_cstu (gfc_charlen_type_node, 0);
1886 /* Loop over all constructor elements to find out is_const, but in len we
1887 want to store the length of the first, not the last, element. We can
1888 of course exit the loop as soon as is_const is found to be false. */
1889 for (c = gfc_constructor_first (base);
1890 c && is_const; c = gfc_constructor_next (c))
1892 switch (c->expr->expr_type)
1895 if (len && !(*len && INTEGER_CST_P (*len)))
1896 *len = build_int_cstu (gfc_charlen_type_node,
1897 c->expr->value.character.length);
1901 if (!get_array_ctor_strlen (block, c->expr->value.constructor, len))
1908 get_array_ctor_var_strlen (block, c->expr, len);
1914 get_array_ctor_all_strlen (block, c->expr, len);
1918 /* After the first iteration, we don't want the length modified. */
1925 /* Check whether the array constructor C consists entirely of constant
1926 elements, and if so returns the number of those elements, otherwise
1927 return zero. Note, an empty or NULL array constructor returns zero. */
1929 unsigned HOST_WIDE_INT
1930 gfc_constant_array_constructor_p (gfc_constructor_base base)
1932 unsigned HOST_WIDE_INT nelem = 0;
1934 gfc_constructor *c = gfc_constructor_first (base);
1938 || c->expr->rank > 0
1939 || c->expr->expr_type != EXPR_CONSTANT)
1941 c = gfc_constructor_next (c);
1948 /* Given EXPR, the constant array constructor specified by an EXPR_ARRAY,
1949 and the tree type of it's elements, TYPE, return a static constant
1950 variable that is compile-time initialized. */
1953 gfc_build_constant_array_constructor (gfc_expr * expr, tree type)
1955 tree tmptype, init, tmp;
1956 HOST_WIDE_INT nelem;
1961 VEC(constructor_elt,gc) *v = NULL;
1963 /* First traverse the constructor list, converting the constants
1964 to tree to build an initializer. */
1966 c = gfc_constructor_first (expr->value.constructor);
1969 gfc_init_se (&se, NULL);
1970 gfc_conv_constant (&se, c->expr);
1971 if (c->expr->ts.type != BT_CHARACTER)
1972 se.expr = fold_convert (type, se.expr);
1973 else if (POINTER_TYPE_P (type))
1974 se.expr = gfc_build_addr_expr (gfc_get_pchar_type (c->expr->ts.kind),
1976 CONSTRUCTOR_APPEND_ELT (v, build_int_cst (gfc_array_index_type, nelem),
1978 c = gfc_constructor_next (c);
1982 /* Next determine the tree type for the array. We use the gfortran
1983 front-end's gfc_get_nodesc_array_type in order to create a suitable
1984 GFC_ARRAY_TYPE_P that may be used by the scalarizer. */
1986 memset (&as, 0, sizeof (gfc_array_spec));
1988 as.rank = expr->rank;
1989 as.type = AS_EXPLICIT;
1992 as.lower[0] = gfc_get_int_expr (gfc_default_integer_kind, NULL, 0);
1993 as.upper[0] = gfc_get_int_expr (gfc_default_integer_kind,
1997 for (i = 0; i < expr->rank; i++)
1999 int tmp = (int) mpz_get_si (expr->shape[i]);
2000 as.lower[i] = gfc_get_int_expr (gfc_default_integer_kind, NULL, 0);
2001 as.upper[i] = gfc_get_int_expr (gfc_default_integer_kind,
2005 tmptype = gfc_get_nodesc_array_type (type, &as, PACKED_STATIC, true);
2007 /* as is not needed anymore. */
2008 for (i = 0; i < as.rank + as.corank; i++)
2010 gfc_free_expr (as.lower[i]);
2011 gfc_free_expr (as.upper[i]);
2014 init = build_constructor (tmptype, v);
2016 TREE_CONSTANT (init) = 1;
2017 TREE_STATIC (init) = 1;
2019 tmp = gfc_create_var (tmptype, "A");
2020 TREE_STATIC (tmp) = 1;
2021 TREE_CONSTANT (tmp) = 1;
2022 TREE_READONLY (tmp) = 1;
2023 DECL_INITIAL (tmp) = init;
2029 /* Translate a constant EXPR_ARRAY array constructor for the scalarizer.
2030 This mostly initializes the scalarizer state info structure with the
2031 appropriate values to directly use the array created by the function
2032 gfc_build_constant_array_constructor. */
2035 trans_constant_array_constructor (gfc_ss * ss, tree type)
2037 gfc_array_info *info;
2041 tmp = gfc_build_constant_array_constructor (ss->info->expr, type);
2043 info = &ss->info->data.array;
2045 info->descriptor = tmp;
2046 info->data = gfc_build_addr_expr (NULL_TREE, tmp);
2047 info->offset = gfc_index_zero_node;
2049 for (i = 0; i < ss->dimen; i++)
2051 info->delta[i] = gfc_index_zero_node;
2052 info->start[i] = gfc_index_zero_node;
2053 info->end[i] = gfc_index_zero_node;
2054 info->stride[i] = gfc_index_one_node;
2060 get_rank (gfc_loopinfo *loop)
2065 for (; loop; loop = loop->parent)
2066 rank += loop->dimen;
2072 /* Helper routine of gfc_trans_array_constructor to determine if the
2073 bounds of the loop specified by LOOP are constant and simple enough
2074 to use with trans_constant_array_constructor. Returns the
2075 iteration count of the loop if suitable, and NULL_TREE otherwise. */
2078 constant_array_constructor_loop_size (gfc_loopinfo * l)
2081 tree size = gfc_index_one_node;
2085 total_dim = get_rank (l);
2087 for (loop = l; loop; loop = loop->parent)
2089 for (i = 0; i < loop->dimen; i++)
2091 /* If the bounds aren't constant, return NULL_TREE. */
2092 if (!INTEGER_CST_P (loop->from[i]) || !INTEGER_CST_P (loop->to[i]))
2094 if (!integer_zerop (loop->from[i]))
2096 /* Only allow nonzero "from" in one-dimensional arrays. */
2099 tmp = fold_build2_loc (input_location, MINUS_EXPR,
2100 gfc_array_index_type,
2101 loop->to[i], loop->from[i]);
2105 tmp = fold_build2_loc (input_location, PLUS_EXPR,
2106 gfc_array_index_type, tmp, gfc_index_one_node);
2107 size = fold_build2_loc (input_location, MULT_EXPR,
2108 gfc_array_index_type, size, tmp);
2117 get_loop_upper_bound_for_array (gfc_ss *array, int array_dim)
2122 gcc_assert (array->nested_ss == NULL);
2124 for (ss = array; ss; ss = ss->parent)
2125 for (n = 0; n < ss->loop->dimen; n++)
2126 if (array_dim == get_array_ref_dim_for_loop_dim (ss, n))
2127 return &(ss->loop->to[n]);
2133 static gfc_loopinfo *
2134 outermost_loop (gfc_loopinfo * loop)
2136 while (loop->parent != NULL)
2137 loop = loop->parent;
2143 /* Array constructors are handled by constructing a temporary, then using that
2144 within the scalarization loop. This is not optimal, but seems by far the
2148 trans_array_constructor (gfc_ss * ss, locus * where)
2150 gfc_constructor_base c;
2158 bool old_first_len, old_typespec_chararray_ctor;
2159 tree old_first_len_val;
2160 gfc_loopinfo *loop, *outer_loop;
2161 gfc_ss_info *ss_info;
2165 /* Save the old values for nested checking. */
2166 old_first_len = first_len;
2167 old_first_len_val = first_len_val;
2168 old_typespec_chararray_ctor = typespec_chararray_ctor;
2171 outer_loop = outermost_loop (loop);
2173 expr = ss_info->expr;
2175 /* Do bounds-checking here and in gfc_trans_array_ctor_element only if no
2176 typespec was given for the array constructor. */
2177 typespec_chararray_ctor = (expr->ts.u.cl
2178 && expr->ts.u.cl->length_from_typespec);
2180 if ((gfc_option.rtcheck & GFC_RTCHECK_BOUNDS)
2181 && expr->ts.type == BT_CHARACTER && !typespec_chararray_ctor)
2183 first_len_val = gfc_create_var (gfc_charlen_type_node, "len");
2187 gcc_assert (ss->dimen == ss->loop->dimen);
2189 c = expr->value.constructor;
2190 if (expr->ts.type == BT_CHARACTER)
2194 /* get_array_ctor_strlen walks the elements of the constructor, if a
2195 typespec was given, we already know the string length and want the one
2197 if (typespec_chararray_ctor && expr->ts.u.cl->length
2198 && expr->ts.u.cl->length->expr_type != EXPR_CONSTANT)
2202 const_string = false;
2203 gfc_init_se (&length_se, NULL);
2204 gfc_conv_expr_type (&length_se, expr->ts.u.cl->length,
2205 gfc_charlen_type_node);
2206 ss_info->string_length = length_se.expr;
2207 gfc_add_block_to_block (&outer_loop->pre, &length_se.pre);
2208 gfc_add_block_to_block (&outer_loop->post, &length_se.post);
2211 const_string = get_array_ctor_strlen (&outer_loop->pre, c,
2212 &ss_info->string_length);
2214 /* Complex character array constructors should have been taken care of
2215 and not end up here. */
2216 gcc_assert (ss_info->string_length);
2218 expr->ts.u.cl->backend_decl = ss_info->string_length;
2220 type = gfc_get_character_type_len (expr->ts.kind, ss_info->string_length);
2222 type = build_pointer_type (type);
2225 type = gfc_typenode_for_spec (&expr->ts);
2227 /* See if the constructor determines the loop bounds. */
2230 loop_ubound0 = get_loop_upper_bound_for_array (ss, 0);
2232 if (expr->shape && get_rank (loop) > 1 && *loop_ubound0 == NULL_TREE)
2234 /* We have a multidimensional parameter. */
2235 for (s = ss; s; s = s->parent)
2238 for (n = 0; n < s->loop->dimen; n++)
2240 s->loop->from[n] = gfc_index_zero_node;
2241 s->loop->to[n] = gfc_conv_mpz_to_tree (expr->shape[s->dim[n]],
2242 gfc_index_integer_kind);
2243 s->loop->to[n] = fold_build2_loc (input_location, MINUS_EXPR,
2244 gfc_array_index_type,
2246 gfc_index_one_node);
2251 if (*loop_ubound0 == NULL_TREE)
2255 /* We should have a 1-dimensional, zero-based loop. */
2256 gcc_assert (loop->parent == NULL && loop->nested == NULL);
2257 gcc_assert (loop->dimen == 1);
2258 gcc_assert (integer_zerop (loop->from[0]));
2260 /* Split the constructor size into a static part and a dynamic part.
2261 Allocate the static size up-front and record whether the dynamic
2262 size might be nonzero. */
2264 dynamic = gfc_get_array_constructor_size (&size, c);
2265 mpz_sub_ui (size, size, 1);
2266 loop->to[0] = gfc_conv_mpz_to_tree (size, gfc_index_integer_kind);
2270 /* Special case constant array constructors. */
2273 unsigned HOST_WIDE_INT nelem = gfc_constant_array_constructor_p (c);
2276 tree size = constant_array_constructor_loop_size (loop);
2277 if (size && compare_tree_int (size, nelem) == 0)
2279 trans_constant_array_constructor (ss, type);
2285 if (TREE_CODE (*loop_ubound0) == VAR_DECL)
2288 gfc_trans_create_temp_array (&outer_loop->pre, &outer_loop->post, ss, type,
2289 NULL_TREE, dynamic, true, false, where);
2291 desc = ss_info->data.array.descriptor;
2292 offset = gfc_index_zero_node;
2293 offsetvar = gfc_create_var_np (gfc_array_index_type, "offset");
2294 TREE_NO_WARNING (offsetvar) = 1;
2295 TREE_USED (offsetvar) = 0;
2296 gfc_trans_array_constructor_value (&outer_loop->pre, type, desc, c,
2297 &offset, &offsetvar, dynamic);
2299 /* If the array grows dynamically, the upper bound of the loop variable
2300 is determined by the array's final upper bound. */
2303 tmp = fold_build2_loc (input_location, MINUS_EXPR,
2304 gfc_array_index_type,
2305 offsetvar, gfc_index_one_node);
2306 tmp = gfc_evaluate_now (tmp, &outer_loop->pre);
2307 gfc_conv_descriptor_ubound_set (&loop->pre, desc, gfc_rank_cst[0], tmp);
2308 if (*loop_ubound0 && TREE_CODE (*loop_ubound0) == VAR_DECL)
2309 gfc_add_modify (&outer_loop->pre, *loop_ubound0, tmp);
2311 *loop_ubound0 = tmp;
2314 if (TREE_USED (offsetvar))
2315 pushdecl (offsetvar);
2317 gcc_assert (INTEGER_CST_P (offset));
2320 /* Disable bound checking for now because it's probably broken. */
2321 if (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS)
2328 /* Restore old values of globals. */
2329 first_len = old_first_len;
2330 first_len_val = old_first_len_val;
2331 typespec_chararray_ctor = old_typespec_chararray_ctor;
2335 /* INFO describes a GFC_SS_SECTION in loop LOOP, and this function is
2336 called after evaluating all of INFO's vector dimensions. Go through
2337 each such vector dimension and see if we can now fill in any missing
2341 set_vector_loop_bounds (gfc_ss * ss)
2343 gfc_loopinfo *loop, *outer_loop;
2344 gfc_array_info *info;
2352 outer_loop = outermost_loop (ss->loop);
2354 info = &ss->info->data.array;
2356 for (; ss; ss = ss->parent)
2360 for (n = 0; n < loop->dimen; n++)
2363 if (info->ref->u.ar.dimen_type[dim] != DIMEN_VECTOR
2364 || loop->to[n] != NULL)
2367 /* Loop variable N indexes vector dimension DIM, and we don't
2368 yet know the upper bound of loop variable N. Set it to the
2369 difference between the vector's upper and lower bounds. */
2370 gcc_assert (loop->from[n] == gfc_index_zero_node);
2371 gcc_assert (info->subscript[dim]
2372 && info->subscript[dim]->info->type == GFC_SS_VECTOR);
2374 gfc_init_se (&se, NULL);
2375 desc = info->subscript[dim]->info->data.array.descriptor;
2376 zero = gfc_rank_cst[0];
2377 tmp = fold_build2_loc (input_location, MINUS_EXPR,
2378 gfc_array_index_type,
2379 gfc_conv_descriptor_ubound_get (desc, zero),
2380 gfc_conv_descriptor_lbound_get (desc, zero));
2381 tmp = gfc_evaluate_now (tmp, &outer_loop->pre);
2388 /* Add the pre and post chains for all the scalar expressions in a SS chain
2389 to loop. This is called after the loop parameters have been calculated,
2390 but before the actual scalarizing loops. */
2393 gfc_add_loop_ss_code (gfc_loopinfo * loop, gfc_ss * ss, bool subscript,
2396 gfc_loopinfo *nested_loop, *outer_loop;
2398 gfc_ss_info *ss_info;
2399 gfc_array_info *info;
2401 bool skip_nested = false;
2404 outer_loop = outermost_loop (loop);
2406 /* TODO: This can generate bad code if there are ordering dependencies,
2407 e.g., a callee allocated function and an unknown size constructor. */
2408 gcc_assert (ss != NULL);
2410 for (; ss != gfc_ss_terminator; ss = ss->loop_chain)
2414 /* Cross loop arrays are handled from within the most nested loop. */
2415 if (ss->nested_ss != NULL)
2419 expr = ss_info->expr;
2420 info = &ss_info->data.array;
2422 switch (ss_info->type)
2425 /* Scalar expression. Evaluate this now. This includes elemental
2426 dimension indices, but not array section bounds. */
2427 gfc_init_se (&se, NULL);
2428 gfc_conv_expr (&se, expr);
2429 gfc_add_block_to_block (&outer_loop->pre, &se.pre);
2431 if (expr->ts.type != BT_CHARACTER)
2433 /* Move the evaluation of scalar expressions outside the
2434 scalarization loop, except for WHERE assignments. */
2436 se.expr = convert(gfc_array_index_type, se.expr);
2437 if (!ss_info->where)
2438 se.expr = gfc_evaluate_now (se.expr, &outer_loop->pre);
2439 gfc_add_block_to_block (&outer_loop->pre, &se.post);
2442 gfc_add_block_to_block (&outer_loop->post, &se.post);
2444 ss_info->data.scalar.value = se.expr;
2445 ss_info->string_length = se.string_length;
2448 case GFC_SS_REFERENCE:
2449 /* Scalar argument to elemental procedure. */
2450 gfc_init_se (&se, NULL);
2451 if (ss_info->data.scalar.can_be_null_ref)
2453 /* If the actual argument can be absent (in other words, it can
2454 be a NULL reference), don't try to evaluate it; pass instead
2455 the reference directly. */
2456 gfc_conv_expr_reference (&se, expr);
2460 /* Otherwise, evaluate the argument outside the loop and pass
2461 a reference to the value. */
2462 gfc_conv_expr (&se, expr);
2464 gfc_add_block_to_block (&outer_loop->pre, &se.pre);
2465 gfc_add_block_to_block (&outer_loop->post, &se.post);
2466 if (gfc_is_class_scalar_expr (expr))
2467 /* This is necessary because the dynamic type will always be
2468 large than the declared type. In consequence, assigning
2469 the value to a temporary could segfault.
2470 OOP-TODO: see if this is generally correct or is the value
2471 has to be written to an allocated temporary, whose address
2472 is passed via ss_info. */
2473 ss_info->data.scalar.value = se.expr;
2475 ss_info->data.scalar.value = gfc_evaluate_now (se.expr,
2478 ss_info->string_length = se.string_length;
2481 case GFC_SS_SECTION:
2482 /* Add the expressions for scalar and vector subscripts. */
2483 for (n = 0; n < GFC_MAX_DIMENSIONS; n++)
2484 if (info->subscript[n])
2486 gfc_add_loop_ss_code (loop, info->subscript[n], true, where);
2487 /* The recursive call will have taken care of the nested loops.
2488 No need to do it twice. */
2492 set_vector_loop_bounds (ss);
2496 /* Get the vector's descriptor and store it in SS. */
2497 gfc_init_se (&se, NULL);
2498 gfc_conv_expr_descriptor (&se, expr, gfc_walk_expr (expr));
2499 gfc_add_block_to_block (&outer_loop->pre, &se.pre);
2500 gfc_add_block_to_block (&outer_loop->post, &se.post);
2501 info->descriptor = se.expr;
2504 case GFC_SS_INTRINSIC:
2505 gfc_add_intrinsic_ss_code (loop, ss);
2508 case GFC_SS_FUNCTION:
2509 /* Array function return value. We call the function and save its
2510 result in a temporary for use inside the loop. */
2511 gfc_init_se (&se, NULL);
2514 gfc_conv_expr (&se, expr);
2515 gfc_add_block_to_block (&outer_loop->pre, &se.pre);
2516 gfc_add_block_to_block (&outer_loop->post, &se.post);
2517 ss_info->string_length = se.string_length;
2520 case GFC_SS_CONSTRUCTOR:
2521 if (expr->ts.type == BT_CHARACTER
2522 && ss_info->string_length == NULL
2524 && expr->ts.u.cl->length)
2526 gfc_init_se (&se, NULL);
2527 gfc_conv_expr_type (&se, expr->ts.u.cl->length,
2528 gfc_charlen_type_node);
2529 ss_info->string_length = se.expr;
2530 gfc_add_block_to_block (&outer_loop->pre, &se.pre);
2531 gfc_add_block_to_block (&outer_loop->post, &se.post);
2533 trans_array_constructor (ss, where);
2537 case GFC_SS_COMPONENT:
2538 /* Do nothing. These are handled elsewhere. */
2547 for (nested_loop = loop->nested; nested_loop;
2548 nested_loop = nested_loop->next)
2549 gfc_add_loop_ss_code (nested_loop, nested_loop->ss, subscript, where);
2553 /* Translate expressions for the descriptor and data pointer of a SS. */
2557 gfc_conv_ss_descriptor (stmtblock_t * block, gfc_ss * ss, int base)
2560 gfc_ss_info *ss_info;
2561 gfc_array_info *info;
2565 info = &ss_info->data.array;
2567 /* Get the descriptor for the array to be scalarized. */
2568 gcc_assert (ss_info->expr->expr_type == EXPR_VARIABLE);
2569 gfc_init_se (&se, NULL);
2570 se.descriptor_only = 1;
2571 gfc_conv_expr_lhs (&se, ss_info->expr);
2572 gfc_add_block_to_block (block, &se.pre);
2573 info->descriptor = se.expr;
2574 ss_info->string_length = se.string_length;
2578 /* Also the data pointer. */
2579 tmp = gfc_conv_array_data (se.expr);
2580 /* If this is a variable or address of a variable we use it directly.
2581 Otherwise we must evaluate it now to avoid breaking dependency
2582 analysis by pulling the expressions for elemental array indices
2585 || (TREE_CODE (tmp) == ADDR_EXPR
2586 && DECL_P (TREE_OPERAND (tmp, 0)))))
2587 tmp = gfc_evaluate_now (tmp, block);
2590 tmp = gfc_conv_array_offset (se.expr);
2591 info->offset = gfc_evaluate_now (tmp, block);
2593 /* Make absolutely sure that the saved_offset is indeed saved
2594 so that the variable is still accessible after the loops
2596 info->saved_offset = info->offset;
2601 /* Initialize a gfc_loopinfo structure. */
2604 gfc_init_loopinfo (gfc_loopinfo * loop)
2608 memset (loop, 0, sizeof (gfc_loopinfo));
2609 gfc_init_block (&loop->pre);
2610 gfc_init_block (&loop->post);
2612 /* Initially scalarize in order and default to no loop reversal. */
2613 for (n = 0; n < GFC_MAX_DIMENSIONS; n++)
2616 loop->reverse[n] = GFC_INHIBIT_REVERSE;
2619 loop->ss = gfc_ss_terminator;
2623 /* Copies the loop variable info to a gfc_se structure. Does not copy the SS
2627 gfc_copy_loopinfo_to_se (gfc_se * se, gfc_loopinfo * loop)
2633 /* Return an expression for the data pointer of an array. */
2636 gfc_conv_array_data (tree descriptor)
2640 type = TREE_TYPE (descriptor);
2641 if (GFC_ARRAY_TYPE_P (type))
2643 if (TREE_CODE (type) == POINTER_TYPE)
2647 /* Descriptorless arrays. */
2648 return gfc_build_addr_expr (NULL_TREE, descriptor);
2652 return gfc_conv_descriptor_data_get (descriptor);
2656 /* Return an expression for the base offset of an array. */
2659 gfc_conv_array_offset (tree descriptor)
2663 type = TREE_TYPE (descriptor);
2664 if (GFC_ARRAY_TYPE_P (type))
2665 return GFC_TYPE_ARRAY_OFFSET (type);
2667 return gfc_conv_descriptor_offset_get (descriptor);
2671 /* Get an expression for the array stride. */
2674 gfc_conv_array_stride (tree descriptor, int dim)
2679 type = TREE_TYPE (descriptor);
2681 /* For descriptorless arrays use the array size. */
2682 tmp = GFC_TYPE_ARRAY_STRIDE (type, dim);
2683 if (tmp != NULL_TREE)
2686 tmp = gfc_conv_descriptor_stride_get (descriptor, gfc_rank_cst[dim]);
2691 /* Like gfc_conv_array_stride, but for the lower bound. */
2694 gfc_conv_array_lbound (tree descriptor, int dim)
2699 type = TREE_TYPE (descriptor);
2701 tmp = GFC_TYPE_ARRAY_LBOUND (type, dim);
2702 if (tmp != NULL_TREE)
2705 tmp = gfc_conv_descriptor_lbound_get (descriptor, gfc_rank_cst[dim]);
2710 /* Like gfc_conv_array_stride, but for the upper bound. */
2713 gfc_conv_array_ubound (tree descriptor, int dim)
2718 type = TREE_TYPE (descriptor);
2720 tmp = GFC_TYPE_ARRAY_UBOUND (type, dim);
2721 if (tmp != NULL_TREE)
2724 /* This should only ever happen when passing an assumed shape array
2725 as an actual parameter. The value will never be used. */
2726 if (GFC_ARRAY_TYPE_P (TREE_TYPE (descriptor)))
2727 return gfc_index_zero_node;
2729 tmp = gfc_conv_descriptor_ubound_get (descriptor, gfc_rank_cst[dim]);
2734 /* Generate code to perform an array index bound check. */
2737 trans_array_bound_check (gfc_se * se, gfc_ss *ss, tree index, int n,
2738 locus * where, bool check_upper)
2741 tree tmp_lo, tmp_up;
2744 const char * name = NULL;
2746 if (!(gfc_option.rtcheck & GFC_RTCHECK_BOUNDS))
2749 descriptor = ss->info->data.array.descriptor;
2751 index = gfc_evaluate_now (index, &se->pre);
2753 /* We find a name for the error message. */
2754 name = ss->info->expr->symtree->n.sym->name;
2755 gcc_assert (name != NULL);
2757 if (TREE_CODE (descriptor) == VAR_DECL)
2758 name = IDENTIFIER_POINTER (DECL_NAME (descriptor));
2760 /* If upper bound is present, include both bounds in the error message. */
2763 tmp_lo = gfc_conv_array_lbound (descriptor, n);
2764 tmp_up = gfc_conv_array_ubound (descriptor, n);
2767 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
2768 "outside of expected range (%%ld:%%ld)", n+1, name);
2770 asprintf (&msg, "Index '%%ld' of dimension %d "
2771 "outside of expected range (%%ld:%%ld)", n+1);
2773 fault = fold_build2_loc (input_location, LT_EXPR, boolean_type_node,
2775 gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg,
2776 fold_convert (long_integer_type_node, index),
2777 fold_convert (long_integer_type_node, tmp_lo),
2778 fold_convert (long_integer_type_node, tmp_up));
2779 fault = fold_build2_loc (input_location, GT_EXPR, boolean_type_node,
2781 gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg,
2782 fold_convert (long_integer_type_node, index),
2783 fold_convert (long_integer_type_node, tmp_lo),
2784 fold_convert (long_integer_type_node, tmp_up));
2789 tmp_lo = gfc_conv_array_lbound (descriptor, n);
2792 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
2793 "below lower bound of %%ld", n+1, name);
2795 asprintf (&msg, "Index '%%ld' of dimension %d "
2796 "below lower bound of %%ld", n+1);
2798 fault = fold_build2_loc (input_location, LT_EXPR, boolean_type_node,
2800 gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg,
2801 fold_convert (long_integer_type_node, index),
2802 fold_convert (long_integer_type_node, tmp_lo));
2810 /* Return the offset for an index. Performs bound checking for elemental
2811 dimensions. Single element references are processed separately.
2812 DIM is the array dimension, I is the loop dimension. */
2815 conv_array_index_offset (gfc_se * se, gfc_ss * ss, int dim, int i,
2816 gfc_array_ref * ar, tree stride)
2818 gfc_array_info *info;
2823 info = &ss->info->data.array;
2825 /* Get the index into the array for this dimension. */
2828 gcc_assert (ar->type != AR_ELEMENT);
2829 switch (ar->dimen_type[dim])
2831 case DIMEN_THIS_IMAGE:
2835 /* Elemental dimension. */
2836 gcc_assert (info->subscript[dim]
2837 && info->subscript[dim]->info->type == GFC_SS_SCALAR);
2838 /* We've already translated this value outside the loop. */
2839 index = info->subscript[dim]->info->data.scalar.value;
2841 index = trans_array_bound_check (se, ss, index, dim, &ar->where,
2842 ar->as->type != AS_ASSUMED_SIZE
2843 || dim < ar->dimen - 1);
2847 gcc_assert (info && se->loop);
2848 gcc_assert (info->subscript[dim]
2849 && info->subscript[dim]->info->type == GFC_SS_VECTOR);
2850 desc = info->subscript[dim]->info->data.array.descriptor;
2852 /* Get a zero-based index into the vector. */
2853 index = fold_build2_loc (input_location, MINUS_EXPR,
2854 gfc_array_index_type,
2855 se->loop->loopvar[i], se->loop->from[i]);
2857 /* Multiply the index by the stride. */
2858 index = fold_build2_loc (input_location, MULT_EXPR,
2859 gfc_array_index_type,
2860 index, gfc_conv_array_stride (desc, 0));
2862 /* Read the vector to get an index into info->descriptor. */
2863 data = build_fold_indirect_ref_loc (input_location,
2864 gfc_conv_array_data (desc));
2865 index = gfc_build_array_ref (data, index, NULL);
2866 index = gfc_evaluate_now (index, &se->pre);
2867 index = fold_convert (gfc_array_index_type, index);
2869 /* Do any bounds checking on the final info->descriptor index. */
2870 index = trans_array_bound_check (se, ss, index, dim, &ar->where,
2871 ar->as->type != AS_ASSUMED_SIZE
2872 || dim < ar->dimen - 1);
2876 /* Scalarized dimension. */
2877 gcc_assert (info && se->loop);
2879 /* Multiply the loop variable by the stride and delta. */
2880 index = se->loop->loopvar[i];
2881 if (!integer_onep (info->stride[dim]))
2882 index = fold_build2_loc (input_location, MULT_EXPR,
2883 gfc_array_index_type, index,
2885 if (!integer_zerop (info->delta[dim]))
2886 index = fold_build2_loc (input_location, PLUS_EXPR,
2887 gfc_array_index_type, index,
2897 /* Temporary array or derived type component. */
2898 gcc_assert (se->loop);
2899 index = se->loop->loopvar[se->loop->order[i]];
2901 /* Pointer functions can have stride[0] different from unity.
2902 Use the stride returned by the function call and stored in
2903 the descriptor for the temporary. */
2904 if (se->ss && se->ss->info->type == GFC_SS_FUNCTION
2905 && se->ss->info->expr
2906 && se->ss->info->expr->symtree
2907 && se->ss->info->expr->symtree->n.sym->result
2908 && se->ss->info->expr->symtree->n.sym->result->attr.pointer)
2909 stride = gfc_conv_descriptor_stride_get (info->descriptor,
2912 if (!integer_zerop (info->delta[dim]))
2913 index = fold_build2_loc (input_location, PLUS_EXPR,
2914 gfc_array_index_type, index, info->delta[dim]);
2917 /* Multiply by the stride. */
2918 if (!integer_onep (stride))
2919 index = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
2926 /* Build a scalarized array reference using the vptr 'size'. */
2929 build_class_array_ref (gfc_se *se, tree base, tree index)
2936 gfc_expr *expr = se->ss->info->expr;
2941 if (expr == NULL || expr->ts.type != BT_CLASS)
2944 if (expr->symtree && expr->symtree->n.sym->ts.type == BT_CLASS)
2945 ts = &expr->symtree->n.sym->ts;
2950 for (ref = expr->ref; ref; ref = ref->next)
2952 if (ref->type == REF_COMPONENT
2953 && ref->u.c.component->ts.type == BT_CLASS
2954 && ref->next && ref->next->type == REF_COMPONENT
2955 && strcmp (ref->next->u.c.component->name, "_data") == 0
2957 && ref->next->next->type == REF_ARRAY
2958 && ref->next->next->u.ar.type != AR_ELEMENT)
2960 ts = &ref->u.c.component->ts;
2969 if (class_ref == NULL)
2970 decl = expr->symtree->n.sym->backend_decl;
2973 /* Remove everything after the last class reference, convert the
2974 expression and then recover its tailend once more. */
2976 ref = class_ref->next;
2977 class_ref->next = NULL;
2978 gfc_init_se (&tmpse, NULL);
2979 gfc_conv_expr (&tmpse, expr);
2981 class_ref->next = ref;
2984 size = gfc_vtable_size_get (decl);
2986 /* Build the address of the element. */
2987 type = TREE_TYPE (TREE_TYPE (base));
2988 size = fold_convert (TREE_TYPE (index), size);
2989 offset = fold_build2_loc (input_location, MULT_EXPR,
2990 gfc_array_index_type,
2992 tmp = gfc_build_addr_expr (pvoid_type_node, base);
2993 tmp = fold_build_pointer_plus_loc (input_location, tmp, offset);
2994 tmp = fold_convert (build_pointer_type (type), tmp);
2996 /* Return the element in the se expression. */
2997 se->expr = build_fold_indirect_ref_loc (input_location, tmp);
3002 /* Build a scalarized reference to an array. */
3005 gfc_conv_scalarized_array_ref (gfc_se * se, gfc_array_ref * ar)
3007 gfc_array_info *info;
3008 tree decl = NULL_TREE;
3016 expr = ss->info->expr;
3017 info = &ss->info->data.array;
3019 n = se->loop->order[0];
3023 index = conv_array_index_offset (se, ss, ss->dim[n], n, ar, info->stride0);
3024 /* Add the offset for this dimension to the stored offset for all other
3026 if (!integer_zerop (info->offset))
3027 index = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
3028 index, info->offset);
3030 if (expr && is_subref_array (expr))
3031 decl = expr->symtree->n.sym->backend_decl;
3033 tmp = build_fold_indirect_ref_loc (input_location, info->data);
3035 /* Use the vptr 'size' field to access a class the element of a class
3037 if (build_class_array_ref (se, tmp, index))
3040 se->expr = gfc_build_array_ref (tmp, index, decl);
3044 /* Translate access of temporary array. */
3047 gfc_conv_tmp_array_ref (gfc_se * se)
3049 se->string_length = se->ss->info->string_length;
3050 gfc_conv_scalarized_array_ref (se, NULL);
3051 gfc_advance_se_ss_chain (se);
3054 /* Add T to the offset pair *OFFSET, *CST_OFFSET. */
3057 add_to_offset (tree *cst_offset, tree *offset, tree t)
3059 if (TREE_CODE (t) == INTEGER_CST)
3060 *cst_offset = int_const_binop (PLUS_EXPR, *cst_offset, t);
3063 if (!integer_zerop (*offset))
3064 *offset = fold_build2_loc (input_location, PLUS_EXPR,
3065 gfc_array_index_type, *offset, t);
3071 /* Build an array reference. se->expr already holds the array descriptor.
3072 This should be either a variable, indirect variable reference or component
3073 reference. For arrays which do not have a descriptor, se->expr will be
3075 a(i, j, k) = base[offset + i * stride[0] + j * stride[1] + k * stride[2]]*/
3078 gfc_conv_array_ref (gfc_se * se, gfc_array_ref * ar, gfc_symbol * sym,
3082 tree offset, cst_offset;
3090 gcc_assert (ar->codimen);
3092 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (se->expr)))
3093 se->expr = build_fold_indirect_ref (gfc_conv_array_data (se->expr));
3096 if (GFC_ARRAY_TYPE_P (TREE_TYPE (se->expr))
3097 && TREE_CODE (TREE_TYPE (se->expr)) == POINTER_TYPE)
3098 se->expr = build_fold_indirect_ref_loc (input_location, se->expr);
3100 /* Use the actual tree type and not the wrapped coarray. */
3101 if (!se->want_pointer)
3102 se->expr = fold_convert (TYPE_MAIN_VARIANT (TREE_TYPE (se->expr)),
3109 /* Handle scalarized references separately. */
3110 if (ar->type != AR_ELEMENT)
3112 gfc_conv_scalarized_array_ref (se, ar);
3113 gfc_advance_se_ss_chain (se);
3117 cst_offset = offset = gfc_index_zero_node;
3118 add_to_offset (&cst_offset, &offset, gfc_conv_array_offset (se->expr));
3120 /* Calculate the offsets from all the dimensions. Make sure to associate
3121 the final offset so that we form a chain of loop invariant summands. */
3122 for (n = ar->dimen - 1; n >= 0; n--)
3124 /* Calculate the index for this dimension. */
3125 gfc_init_se (&indexse, se);
3126 gfc_conv_expr_type (&indexse, ar->start[n], gfc_array_index_type);
3127 gfc_add_block_to_block (&se->pre, &indexse.pre);
3129 if (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS)
3131 /* Check array bounds. */
3135 /* Evaluate the indexse.expr only once. */
3136 indexse.expr = save_expr (indexse.expr);
3139 tmp = gfc_conv_array_lbound (se->expr, n);
3140 if (sym->attr.temporary)
3142 gfc_init_se (&tmpse, se);
3143 gfc_conv_expr_type (&tmpse, ar->as->lower[n],
3144 gfc_array_index_type);
3145 gfc_add_block_to_block (&se->pre, &tmpse.pre);
3149 cond = fold_build2_loc (input_location, LT_EXPR, boolean_type_node,
3151 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
3152 "below lower bound of %%ld", n+1, sym->name);
3153 gfc_trans_runtime_check (true, false, cond, &se->pre, where, msg,
3154 fold_convert (long_integer_type_node,
3156 fold_convert (long_integer_type_node, tmp));
3159 /* Upper bound, but not for the last dimension of assumed-size
3161 if (n < ar->dimen - 1 || ar->as->type != AS_ASSUMED_SIZE)
3163 tmp = gfc_conv_array_ubound (se->expr, n);
3164 if (sym->attr.temporary)
3166 gfc_init_se (&tmpse, se);
3167 gfc_conv_expr_type (&tmpse, ar->as->upper[n],
3168 gfc_array_index_type);
3169 gfc_add_block_to_block (&se->pre, &tmpse.pre);
3173 cond = fold_build2_loc (input_location, GT_EXPR,
3174 boolean_type_node, indexse.expr, tmp);
3175 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
3176 "above upper bound of %%ld", n+1, sym->name);
3177 gfc_trans_runtime_check (true, false, cond, &se->pre, where, msg,
3178 fold_convert (long_integer_type_node,
3180 fold_convert (long_integer_type_node, tmp));
3185 /* Multiply the index by the stride. */
3186 stride = gfc_conv_array_stride (se->expr, n);
3187 tmp = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
3188 indexse.expr, stride);
3190 /* And add it to the total. */
3191 add_to_offset (&cst_offset, &offset, tmp);
3194 if (!integer_zerop (cst_offset))
3195 offset = fold_build2_loc (input_location, PLUS_EXPR,
3196 gfc_array_index_type, offset, cst_offset);
3198 /* Access the calculated element. */
3199 tmp = gfc_conv_array_data (se->expr);
3200 tmp = build_fold_indirect_ref (tmp);
3201 se->expr = gfc_build_array_ref (tmp, offset, sym->backend_decl);
3205 /* Add the offset corresponding to array's ARRAY_DIM dimension and loop's
3206 LOOP_DIM dimension (if any) to array's offset. */
3209 add_array_offset (stmtblock_t *pblock, gfc_loopinfo *loop, gfc_ss *ss,
3210 gfc_array_ref *ar, int array_dim, int loop_dim)
3213 gfc_array_info *info;
3216 info = &ss->info->data.array;
3218 gfc_init_se (&se, NULL);
3220 se.expr = info->descriptor;
3221 stride = gfc_conv_array_stride (info->descriptor, array_dim);
3222 index = conv_array_index_offset (&se, ss, array_dim, loop_dim, ar, stride);
3223 gfc_add_block_to_block (pblock, &se.pre);
3225 info->offset = fold_build2_loc (input_location, PLUS_EXPR,
3226 gfc_array_index_type,
3227 info->offset, index);
3228 info->offset = gfc_evaluate_now (info->offset, pblock);
3232 /* Generate the code to be executed immediately before entering a
3233 scalarization loop. */
3236 gfc_trans_preloop_setup (gfc_loopinfo * loop, int dim, int flag,
3237 stmtblock_t * pblock)
3240 gfc_ss_info *ss_info;
3241 gfc_array_info *info;
3242 gfc_ss_type ss_type;
3244 gfc_loopinfo *ploop;
3248 /* This code will be executed before entering the scalarization loop
3249 for this dimension. */
3250 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
3254 if ((ss_info->useflags & flag) == 0)
3257 ss_type = ss_info->type;
3258 if (ss_type != GFC_SS_SECTION
3259 && ss_type != GFC_SS_FUNCTION
3260 && ss_type != GFC_SS_CONSTRUCTOR
3261 && ss_type != GFC_SS_COMPONENT)
3264 info = &ss_info->data.array;
3266 gcc_assert (dim < ss->dimen);
3267 gcc_assert (ss->dimen == loop->dimen);
3270 ar = &info->ref->u.ar;
3274 if (dim == loop->dimen - 1 && loop->parent != NULL)
3276 /* If we are in the outermost dimension of this loop, the previous
3277 dimension shall be in the parent loop. */
3278 gcc_assert (ss->parent != NULL);
3281 ploop = loop->parent;
3283 /* ss and ss->parent are about the same array. */
3284 gcc_assert (ss_info == pss->info);
3292 if (dim == loop->dimen - 1)
3297 /* For the time being, there is no loop reordering. */
3298 gcc_assert (i == ploop->order[i]);
3299 i = ploop->order[i];
3301 if (dim == loop->dimen - 1 && loop->parent == NULL)
3303 stride = gfc_conv_array_stride (info->descriptor,
3304 innermost_ss (ss)->dim[i]);
3306 /* Calculate the stride of the innermost loop. Hopefully this will
3307 allow the backend optimizers to do their stuff more effectively.
3309 info->stride0 = gfc_evaluate_now (stride, pblock);
3311 /* For the outermost loop calculate the offset due to any
3312 elemental dimensions. It will have been initialized with the
3313 base offset of the array. */
3316 for (i = 0; i < ar->dimen; i++)
3318 if (ar->dimen_type[i] != DIMEN_ELEMENT)
3321 add_array_offset (pblock, loop, ss, ar, i, /* unused */ -1);
3326 /* Add the offset for the previous loop dimension. */
3327 add_array_offset (pblock, ploop, ss, ar, pss->dim[i], i);
3329 /* Remember this offset for the second loop. */
3330 if (dim == loop->temp_dim - 1 && loop->parent == NULL)
3331 info->saved_offset = info->offset;
3336 /* Start a scalarized expression. Creates a scope and declares loop
3340 gfc_start_scalarized_body (gfc_loopinfo * loop, stmtblock_t * pbody)
3346 gcc_assert (!loop->array_parameter);
3348 for (dim = loop->dimen - 1; dim >= 0; dim--)
3350 n = loop->order[dim];
3352 gfc_start_block (&loop->code[n]);
3354 /* Create the loop variable. */
3355 loop->loopvar[n] = gfc_create_var (gfc_array_index_type, "S");
3357 if (dim < loop->temp_dim)
3361 /* Calculate values that will be constant within this loop. */
3362 gfc_trans_preloop_setup (loop, dim, flags, &loop->code[n]);
3364 gfc_start_block (pbody);
3368 /* Generates the actual loop code for a scalarization loop. */
3371 gfc_trans_scalarized_loop_end (gfc_loopinfo * loop, int n,
3372 stmtblock_t * pbody)
3383 if ((ompws_flags & (OMPWS_WORKSHARE_FLAG | OMPWS_SCALARIZER_WS))
3384 == (OMPWS_WORKSHARE_FLAG | OMPWS_SCALARIZER_WS)
3385 && n == loop->dimen - 1)
3387 /* We create an OMP_FOR construct for the outermost scalarized loop. */
3388 init = make_tree_vec (1);
3389 cond = make_tree_vec (1);
3390 incr = make_tree_vec (1);
3392 /* Cycle statement is implemented with a goto. Exit statement must not
3393 be present for this loop. */
3394 exit_label = gfc_build_label_decl (NULL_TREE);
3395 TREE_USED (exit_label) = 1;
3397 /* Label for cycle statements (if needed). */
3398 tmp = build1_v (LABEL_EXPR, exit_label);
3399 gfc_add_expr_to_block (pbody, tmp);
3401 stmt = make_node (OMP_FOR);
3403 TREE_TYPE (stmt) = void_type_node;
3404 OMP_FOR_BODY (stmt) = loopbody = gfc_finish_block (pbody);
3406 OMP_FOR_CLAUSES (stmt) = build_omp_clause (input_location,
3407 OMP_CLAUSE_SCHEDULE);
3408 OMP_CLAUSE_SCHEDULE_KIND (OMP_FOR_CLAUSES (stmt))
3409 = OMP_CLAUSE_SCHEDULE_STATIC;
3410 if (ompws_flags & OMPWS_NOWAIT)
3411 OMP_CLAUSE_CHAIN (OMP_FOR_CLAUSES (stmt))
3412 = build_omp_clause (input_location, OMP_CLAUSE_NOWAIT);
3414 /* Initialize the loopvar. */
3415 TREE_VEC_ELT (init, 0) = build2_v (MODIFY_EXPR, loop->loopvar[n],
3417 OMP_FOR_INIT (stmt) = init;
3418 /* The exit condition. */
3419 TREE_VEC_ELT (cond, 0) = build2_loc (input_location, LE_EXPR,
3421 loop->loopvar[n], loop->to[n]);
3422 SET_EXPR_LOCATION (TREE_VEC_ELT (cond, 0), input_location);
3423 OMP_FOR_COND (stmt) = cond;
3424 /* Increment the loopvar. */
3425 tmp = build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
3426 loop->loopvar[n], gfc_index_one_node);
3427 TREE_VEC_ELT (incr, 0) = fold_build2_loc (input_location, MODIFY_EXPR,
3428 void_type_node, loop->loopvar[n], tmp);
3429 OMP_FOR_INCR (stmt) = incr;
3431 ompws_flags &= ~OMPWS_CURR_SINGLEUNIT;
3432 gfc_add_expr_to_block (&loop->code[n], stmt);
3436 bool reverse_loop = (loop->reverse[n] == GFC_REVERSE_SET)
3437 && (loop->temp_ss == NULL);
3439 loopbody = gfc_finish_block (pbody);
3443 tmp = loop->from[n];
3444 loop->from[n] = loop->to[n];
3448 /* Initialize the loopvar. */
3449 if (loop->loopvar[n] != loop->from[n])
3450 gfc_add_modify (&loop->code[n], loop->loopvar[n], loop->from[n]);
3452 exit_label = gfc_build_label_decl (NULL_TREE);
3454 /* Generate the loop body. */
3455 gfc_init_block (&block);
3457 /* The exit condition. */
3458 cond = fold_build2_loc (input_location, reverse_loop ? LT_EXPR : GT_EXPR,
3459 boolean_type_node, loop->loopvar[n], loop->to[n]);
3460 tmp = build1_v (GOTO_EXPR, exit_label);
3461 TREE_USED (exit_label) = 1;
3462 tmp = build3_v (COND_EXPR, cond, tmp, build_empty_stmt (input_location));
3463 gfc_add_expr_to_block (&block, tmp);
3465 /* The main body. */
3466 gfc_add_expr_to_block (&block, loopbody);
3468 /* Increment the loopvar. */
3469 tmp = fold_build2_loc (input_location,
3470 reverse_loop ? MINUS_EXPR : PLUS_EXPR,
3471 gfc_array_index_type, loop->loopvar[n],
3472 gfc_index_one_node);
3474 gfc_add_modify (&block, loop->loopvar[n], tmp);
3476 /* Build the loop. */
3477 tmp = gfc_finish_block (&block);
3478 tmp = build1_v (LOOP_EXPR, tmp);
3479 gfc_add_expr_to_block (&loop->code[n], tmp);
3481 /* Add the exit label. */
3482 tmp = build1_v (LABEL_EXPR, exit_label);
3483 gfc_add_expr_to_block (&loop->code[n], tmp);
3489 /* Finishes and generates the loops for a scalarized expression. */
3492 gfc_trans_scalarizing_loops (gfc_loopinfo * loop, stmtblock_t * body)
3497 stmtblock_t *pblock;
3501 /* Generate the loops. */
3502 for (dim = 0; dim < loop->dimen; dim++)
3504 n = loop->order[dim];
3505 gfc_trans_scalarized_loop_end (loop, n, pblock);
3506 loop->loopvar[n] = NULL_TREE;
3507 pblock = &loop->code[n];
3510 tmp = gfc_finish_block (pblock);
3511 gfc_add_expr_to_block (&loop->pre, tmp);
3513 /* Clear all the used flags. */
3514 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
3515 if (ss->parent == NULL)
3516 ss->info->useflags = 0;
3520 /* Finish the main body of a scalarized expression, and start the secondary
3524 gfc_trans_scalarized_loop_boundary (gfc_loopinfo * loop, stmtblock_t * body)
3528 stmtblock_t *pblock;
3532 /* We finish as many loops as are used by the temporary. */
3533 for (dim = 0; dim < loop->temp_dim - 1; dim++)
3535 n = loop->order[dim];
3536 gfc_trans_scalarized_loop_end (loop, n, pblock);
3537 loop->loopvar[n] = NULL_TREE;
3538 pblock = &loop->code[n];
3541 /* We don't want to finish the outermost loop entirely. */
3542 n = loop->order[loop->temp_dim - 1];
3543 gfc_trans_scalarized_loop_end (loop, n, pblock);
3545 /* Restore the initial offsets. */
3546 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
3548 gfc_ss_type ss_type;
3549 gfc_ss_info *ss_info;
3553 if ((ss_info->useflags & 2) == 0)
3556 ss_type = ss_info->type;
3557 if (ss_type != GFC_SS_SECTION
3558 && ss_type != GFC_SS_FUNCTION
3559 && ss_type != GFC_SS_CONSTRUCTOR
3560 && ss_type != GFC_SS_COMPONENT)
3563 ss_info->data.array.offset = ss_info->data.array.saved_offset;
3566 /* Restart all the inner loops we just finished. */
3567 for (dim = loop->temp_dim - 2; dim >= 0; dim--)
3569 n = loop->order[dim];
3571 gfc_start_block (&loop->code[n]);
3573 loop->loopvar[n] = gfc_create_var (gfc_array_index_type, "Q");
3575 gfc_trans_preloop_setup (loop, dim, 2, &loop->code[n]);
3578 /* Start a block for the secondary copying code. */
3579 gfc_start_block (body);
3583 /* Precalculate (either lower or upper) bound of an array section.
3584 BLOCK: Block in which the (pre)calculation code will go.
3585 BOUNDS[DIM]: Where the bound value will be stored once evaluated.
3586 VALUES[DIM]: Specified bound (NULL <=> unspecified).
3587 DESC: Array descriptor from which the bound will be picked if unspecified
3588 (either lower or upper bound according to LBOUND). */
3591 evaluate_bound (stmtblock_t *block, tree *bounds, gfc_expr ** values,
3592 tree desc, int dim, bool lbound)
3595 gfc_expr * input_val = values[dim];
3596 tree *output = &bounds[dim];
3601 /* Specified section bound. */
3602 gfc_init_se (&se, NULL);
3603 gfc_conv_expr_type (&se, input_val, gfc_array_index_type);
3604 gfc_add_block_to_block (block, &se.pre);
3609 /* No specific bound specified so use the bound of the array. */
3610 *output = lbound ? gfc_conv_array_lbound (desc, dim) :
3611 gfc_conv_array_ubound (desc, dim);
3613 *output = gfc_evaluate_now (*output, block);
3617 /* Calculate the lower bound of an array section. */
3620 gfc_conv_section_startstride (gfc_loopinfo * loop, gfc_ss * ss, int dim)
3622 gfc_expr *stride = NULL;
3625 gfc_array_info *info;
3628 gcc_assert (ss->info->type == GFC_SS_SECTION);
3630 info = &ss->info->data.array;
3631 ar = &info->ref->u.ar;
3633 if (ar->dimen_type[dim] == DIMEN_VECTOR)
3635 /* We use a zero-based index to access the vector. */
3636 info->start[dim] = gfc_index_zero_node;
3637 info->end[dim] = NULL;
3638 info->stride[dim] = gfc_index_one_node;
3642 gcc_assert (ar->dimen_type[dim] == DIMEN_RANGE
3643 || ar->dimen_type[dim] == DIMEN_THIS_IMAGE);
3644 desc = info->descriptor;
3645 stride = ar->stride[dim];
3647 /* Calculate the start of the range. For vector subscripts this will
3648 be the range of the vector. */
3649 evaluate_bound (&loop->pre, info->start, ar->start, desc, dim, true);
3651 /* Similarly calculate the end. Although this is not used in the
3652 scalarizer, it is needed when checking bounds and where the end
3653 is an expression with side-effects. */
3654 evaluate_bound (&loop->pre, info->end, ar->end, desc, dim, false);
3656 /* Calculate the stride. */
3658 info->stride[dim] = gfc_index_one_node;
3661 gfc_init_se (&se, NULL);
3662 gfc_conv_expr_type (&se, stride, gfc_array_index_type);
3663 gfc_add_block_to_block (&loop->pre, &se.pre);
3664 info->stride[dim] = gfc_evaluate_now (se.expr, &loop->pre);
3669 /* Calculates the range start and stride for a SS chain. Also gets the
3670 descriptor and data pointer. The range of vector subscripts is the size
3671 of the vector. Array bounds are also checked. */
3674 gfc_conv_ss_startstride (gfc_loopinfo * loop)
3682 /* Determine the rank of the loop. */
3683 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
3685 switch (ss->info->type)
3687 case GFC_SS_SECTION:
3688 case GFC_SS_CONSTRUCTOR:
3689 case GFC_SS_FUNCTION:
3690 case GFC_SS_COMPONENT:
3691 loop->dimen = ss->dimen;
3694 /* As usual, lbound and ubound are exceptions!. */
3695 case GFC_SS_INTRINSIC:
3696 switch (ss->info->expr->value.function.isym->id)
3698 case GFC_ISYM_LBOUND:
3699 case GFC_ISYM_UBOUND:
3700 case GFC_ISYM_LCOBOUND:
3701 case GFC_ISYM_UCOBOUND:
3702 case GFC_ISYM_THIS_IMAGE:
3703 loop->dimen = ss->dimen;
3715 /* We should have determined the rank of the expression by now. If
3716 not, that's bad news. */
3720 /* Loop over all the SS in the chain. */
3721 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
3723 gfc_ss_info *ss_info;
3724 gfc_array_info *info;
3728 expr = ss_info->expr;
3729 info = &ss_info->data.array;
3731 if (expr && expr->shape && !info->shape)
3732 info->shape = expr->shape;
3734 switch (ss_info->type)
3736 case GFC_SS_SECTION:
3737 /* Get the descriptor for the array. If it is a cross loops array,
3738 we got the descriptor already in the outermost loop. */
3739 if (ss->parent == NULL)
3740 gfc_conv_ss_descriptor (&loop->pre, ss, !loop->array_parameter);
3742 for (n = 0; n < ss->dimen; n++)
3743 gfc_conv_section_startstride (loop, ss, ss->dim[n]);
3746 case GFC_SS_INTRINSIC:
3747 switch (expr->value.function.isym->id)
3749 /* Fall through to supply start and stride. */
3750 case GFC_ISYM_LBOUND:
3751 case GFC_ISYM_UBOUND:
3752 case GFC_ISYM_LCOBOUND:
3753 case GFC_ISYM_UCOBOUND:
3754 case GFC_ISYM_THIS_IMAGE:
3761 case GFC_SS_CONSTRUCTOR:
3762 case GFC_SS_FUNCTION:
3763 for (n = 0; n < ss->dimen; n++)
3765 int dim = ss->dim[n];
3767 info->start[dim] = gfc_index_zero_node;
3768 info->end[dim] = gfc_index_zero_node;
3769 info->stride[dim] = gfc_index_one_node;
3778 /* The rest is just runtime bound checking. */
3779 if (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS)
3782 tree lbound, ubound;
3784 tree size[GFC_MAX_DIMENSIONS];
3785 tree stride_pos, stride_neg, non_zerosized, tmp2, tmp3;
3786 gfc_array_info *info;
3790 gfc_start_block (&block);
3792 for (n = 0; n < loop->dimen; n++)
3793 size[n] = NULL_TREE;
3795 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
3798 gfc_ss_info *ss_info;
3801 const char *expr_name;
3804 if (ss_info->type != GFC_SS_SECTION)
3807 /* Catch allocatable lhs in f2003. */
3808 if (gfc_option.flag_realloc_lhs && ss->is_alloc_lhs)
3811 expr = ss_info->expr;
3812 expr_loc = &expr->where;
3813 expr_name = expr->symtree->name;
3815 gfc_start_block (&inner);
3817 /* TODO: range checking for mapped dimensions. */
3818 info = &ss_info->data.array;
3820 /* This code only checks ranges. Elemental and vector
3821 dimensions are checked later. */
3822 for (n = 0; n < loop->dimen; n++)
3827 if (info->ref->u.ar.dimen_type[dim] != DIMEN_RANGE)
3830 if (dim == info->ref->u.ar.dimen - 1
3831 && info->ref->u.ar.as->type == AS_ASSUMED_SIZE)
3832 check_upper = false;
3836 /* Zero stride is not allowed. */
3837 tmp = fold_build2_loc (input_location, EQ_EXPR, boolean_type_node,
3838 info->stride[dim], gfc_index_zero_node);
3839 asprintf (&msg, "Zero stride is not allowed, for dimension %d "
3840 "of array '%s'", dim + 1, expr_name);
3841 gfc_trans_runtime_check (true, false, tmp, &inner,
3845 desc = info->descriptor;
3847 /* This is the run-time equivalent of resolve.c's
3848 check_dimension(). The logical is more readable there
3849 than it is here, with all the trees. */
3850 lbound = gfc_conv_array_lbound (desc, dim);
3851 end = info->end[dim];
3853 ubound = gfc_conv_array_ubound (desc, dim);
3857 /* non_zerosized is true when the selected range is not
3859 stride_pos = fold_build2_loc (input_location, GT_EXPR,
3860 boolean_type_node, info->stride[dim],
3861 gfc_index_zero_node);
3862 tmp = fold_build2_loc (input_location, LE_EXPR, boolean_type_node,
3863 info->start[dim], end);
3864 stride_pos = fold_build2_loc (input_location, TRUTH_AND_EXPR,
3865 boolean_type_node, stride_pos, tmp);
3867 stride_neg = fold_build2_loc (input_location, LT_EXPR,
3869 info->stride[dim], gfc_index_zero_node);
3870 tmp = fold_build2_loc (input_location, GE_EXPR, boolean_type_node,
3871 info->start[dim], end);
3872 stride_neg = fold_build2_loc (input_location, TRUTH_AND_EXPR,
3875 non_zerosized = fold_build2_loc (input_location, TRUTH_OR_EXPR,
3877 stride_pos, stride_neg);
3879 /* Check the start of the range against the lower and upper
3880 bounds of the array, if the range is not empty.
3881 If upper bound is present, include both bounds in the
3885 tmp = fold_build2_loc (input_location, LT_EXPR,
3887 info->start[dim], lbound);
3888 tmp = fold_build2_loc (input_location, TRUTH_AND_EXPR,
3890 non_zerosized, tmp);
3891 tmp2 = fold_build2_loc (input_location, GT_EXPR,
3893 info->start[dim], ubound);
3894 tmp2 = fold_build2_loc (input_location, TRUTH_AND_EXPR,
3896 non_zerosized, tmp2);
3897 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
3898 "outside of expected range (%%ld:%%ld)",
3899 dim + 1, expr_name);
3900 gfc_trans_runtime_check (true, false, tmp, &inner,
3902 fold_convert (long_integer_type_node, info->start[dim]),
3903 fold_convert (long_integer_type_node, lbound),
3904 fold_convert (long_integer_type_node, ubound));
3905 gfc_trans_runtime_check (true, false, tmp2, &inner,
3907 fold_convert (long_integer_type_node, info->start[dim]),
3908 fold_convert (long_integer_type_node, lbound),
3909 fold_convert (long_integer_type_node, ubound));
3914 tmp = fold_build2_loc (input_location, LT_EXPR,
3916 info->start[dim], lbound);
3917 tmp = fold_build2_loc (input_location, TRUTH_AND_EXPR,
3918 boolean_type_node, non_zerosized, tmp);
3919 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
3920 "below lower bound of %%ld",
3921 dim + 1, expr_name);
3922 gfc_trans_runtime_check (true, false, tmp, &inner,
3924 fold_convert (long_integer_type_node, info->start[dim]),
3925 fold_convert (long_integer_type_node, lbound));
3929 /* Compute the last element of the range, which is not
3930 necessarily "end" (think 0:5:3, which doesn't contain 5)
3931 and check it against both lower and upper bounds. */
3933 tmp = fold_build2_loc (input_location, MINUS_EXPR,
3934 gfc_array_index_type, end,
3936 tmp = fold_build2_loc (input_location, TRUNC_MOD_EXPR,
3937 gfc_array_index_type, tmp,
3939 tmp = fold_build2_loc (input_location, MINUS_EXPR,
3940 gfc_array_index_type, end, tmp);
3941 tmp2 = fold_build2_loc (input_location, LT_EXPR,
3942 boolean_type_node, tmp, lbound);
3943 tmp2 = fold_build2_loc (input_location, TRUTH_AND_EXPR,
3944 boolean_type_node, non_zerosized, tmp2);
3947 tmp3 = fold_build2_loc (input_location, GT_EXPR,
3948 boolean_type_node, tmp, ubound);
3949 tmp3 = fold_build2_loc (input_location, TRUTH_AND_EXPR,
3950 boolean_type_node, non_zerosized, tmp3);
3951 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
3952 "outside of expected range (%%ld:%%ld)",
3953 dim + 1, expr_name);
3954 gfc_trans_runtime_check (true, false, tmp2, &inner,
3956 fold_convert (long_integer_type_node, tmp),
3957 fold_convert (long_integer_type_node, ubound),
3958 fold_convert (long_integer_type_node, lbound));
3959 gfc_trans_runtime_check (true, false, tmp3, &inner,
3961 fold_convert (long_integer_type_node, tmp),
3962 fold_convert (long_integer_type_node, ubound),
3963 fold_convert (long_integer_type_node, lbound));
3968 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
3969 "below lower bound of %%ld",
3970 dim + 1, expr_name);
3971 gfc_trans_runtime_check (true, false, tmp2, &inner,
3973 fold_convert (long_integer_type_node, tmp),
3974 fold_convert (long_integer_type_node, lbound));
3978 /* Check the section sizes match. */
3979 tmp = fold_build2_loc (input_location, MINUS_EXPR,
3980 gfc_array_index_type, end,
3982 tmp = fold_build2_loc (input_location, FLOOR_DIV_EXPR,
3983 gfc_array_index_type, tmp,
3985 tmp = fold_build2_loc (input_location, PLUS_EXPR,
3986 gfc_array_index_type,
3987 gfc_index_one_node, tmp);
3988 tmp = fold_build2_loc (input_location, MAX_EXPR,
3989 gfc_array_index_type, tmp,
3990 build_int_cst (gfc_array_index_type, 0));
3991 /* We remember the size of the first section, and check all the
3992 others against this. */
3995 tmp3 = fold_build2_loc (input_location, NE_EXPR,
3996 boolean_type_node, tmp, size[n]);
3997 asprintf (&msg, "Array bound mismatch for dimension %d "
3998 "of array '%s' (%%ld/%%ld)",
3999 dim + 1, expr_name);
4001 gfc_trans_runtime_check (true, false, tmp3, &inner,
4003 fold_convert (long_integer_type_node, tmp),
4004 fold_convert (long_integer_type_node, size[n]));
4009 size[n] = gfc_evaluate_now (tmp, &inner);
4012 tmp = gfc_finish_block (&inner);
4014 /* For optional arguments, only check bounds if the argument is
4016 if (expr->symtree->n.sym->attr.optional
4017 || expr->symtree->n.sym->attr.not_always_present)
4018 tmp = build3_v (COND_EXPR,
4019 gfc_conv_expr_present (expr->symtree->n.sym),
4020 tmp, build_empty_stmt (input_location));
4022 gfc_add_expr_to_block (&block, tmp);
4026 tmp = gfc_finish_block (&block);
4027 gfc_add_expr_to_block (&loop->pre, tmp);
4030 for (loop = loop->nested; loop; loop = loop->next)
4031 gfc_conv_ss_startstride (loop);
4034 /* Return true if both symbols could refer to the same data object. Does
4035 not take account of aliasing due to equivalence statements. */
4038 symbols_could_alias (gfc_symbol *lsym, gfc_symbol *rsym, bool lsym_pointer,
4039 bool lsym_target, bool rsym_pointer, bool rsym_target)
4041 /* Aliasing isn't possible if the symbols have different base types. */
4042 if (gfc_compare_types (&lsym->ts, &rsym->ts) == 0)
4045 /* Pointers can point to other pointers and target objects. */
4047 if ((lsym_pointer && (rsym_pointer || rsym_target))
4048 || (rsym_pointer && (lsym_pointer || lsym_target)))
4051 /* Special case: Argument association, cf. F90 12.4.1.6, F2003 12.4.1.7
4052 and F2008 12.5.2.13 items 3b and 4b. The pointer case (a) is already
4054 if (lsym_target && rsym_target
4055 && ((lsym->attr.dummy && !lsym->attr.contiguous
4056 && (!lsym->attr.dimension || lsym->as->type == AS_ASSUMED_SHAPE))
4057 || (rsym->attr.dummy && !rsym->attr.contiguous
4058 && (!rsym->attr.dimension
4059 || rsym->as->type == AS_ASSUMED_SHAPE))))
4066 /* Return true if the two SS could be aliased, i.e. both point to the same data
4068 /* TODO: resolve aliases based on frontend expressions. */
4071 gfc_could_be_alias (gfc_ss * lss, gfc_ss * rss)
4075 gfc_expr *lexpr, *rexpr;
4078 bool lsym_pointer, lsym_target, rsym_pointer, rsym_target;
4080 lexpr = lss->info->expr;
4081 rexpr = rss->info->expr;
4083 lsym = lexpr->symtree->n.sym;
4084 rsym = rexpr->symtree->n.sym;
4086 lsym_pointer = lsym->attr.pointer;
4087 lsym_target = lsym->attr.target;
4088 rsym_pointer = rsym->attr.pointer;
4089 rsym_target = rsym->attr.target;
4091 if (symbols_could_alias (lsym, rsym, lsym_pointer, lsym_target,
4092 rsym_pointer, rsym_target))
4095 if (rsym->ts.type != BT_DERIVED && rsym->ts.type != BT_CLASS
4096 && lsym->ts.type != BT_DERIVED && lsym->ts.type != BT_CLASS)
4099 /* For derived types we must check all the component types. We can ignore
4100 array references as these will have the same base type as the previous
4102 for (lref = lexpr->ref; lref != lss->info->data.array.ref; lref = lref->next)
4104 if (lref->type != REF_COMPONENT)
4107 lsym_pointer = lsym_pointer || lref->u.c.sym->attr.pointer;
4108 lsym_target = lsym_target || lref->u.c.sym->attr.target;
4110 if (symbols_could_alias (lref->u.c.sym, rsym, lsym_pointer, lsym_target,
4111 rsym_pointer, rsym_target))
4114 if ((lsym_pointer && (rsym_pointer || rsym_target))
4115 || (rsym_pointer && (lsym_pointer || lsym_target)))
4117 if (gfc_compare_types (&lref->u.c.component->ts,
4122 for (rref = rexpr->ref; rref != rss->info->data.array.ref;
4125 if (rref->type != REF_COMPONENT)
4128 rsym_pointer = rsym_pointer || rref->u.c.sym->attr.pointer;
4129 rsym_target = lsym_target || rref->u.c.sym->attr.target;
4131 if (symbols_could_alias (lref->u.c.sym, rref->u.c.sym,
4132 lsym_pointer, lsym_target,
4133 rsym_pointer, rsym_target))
4136 if ((lsym_pointer && (rsym_pointer || rsym_target))
4137 || (rsym_pointer && (lsym_pointer || lsym_target)))
4139 if (gfc_compare_types (&lref->u.c.component->ts,
4140 &rref->u.c.sym->ts))
4142 if (gfc_compare_types (&lref->u.c.sym->ts,
4143 &rref->u.c.component->ts))
4145 if (gfc_compare_types (&lref->u.c.component->ts,
4146 &rref->u.c.component->ts))
4152 lsym_pointer = lsym->attr.pointer;
4153 lsym_target = lsym->attr.target;
4154 lsym_pointer = lsym->attr.pointer;
4155 lsym_target = lsym->attr.target;
4157 for (rref = rexpr->ref; rref != rss->info->data.array.ref; rref = rref->next)
4159 if (rref->type != REF_COMPONENT)
4162 rsym_pointer = rsym_pointer || rref->u.c.sym->attr.pointer;
4163 rsym_target = lsym_target || rref->u.c.sym->attr.target;
4165 if (symbols_could_alias (rref->u.c.sym, lsym,
4166 lsym_pointer, lsym_target,
4167 rsym_pointer, rsym_target))
4170 if ((lsym_pointer && (rsym_pointer || rsym_target))
4171 || (rsym_pointer && (lsym_pointer || lsym_target)))
4173 if (gfc_compare_types (&lsym->ts, &rref->u.c.component->ts))
4182 /* Resolve array data dependencies. Creates a temporary if required. */
4183 /* TODO: Calc dependencies with gfc_expr rather than gfc_ss, and move to
4187 gfc_conv_resolve_dependencies (gfc_loopinfo * loop, gfc_ss * dest,
4193 gfc_expr *dest_expr;
4198 loop->temp_ss = NULL;
4199 dest_expr = dest->info->expr;
4201 for (ss = rss; ss != gfc_ss_terminator; ss = ss->next)
4203 if (ss->info->type != GFC_SS_SECTION)
4206 ss_expr = ss->info->expr;
4208 if (dest_expr->symtree->n.sym != ss_expr->symtree->n.sym)
4210 if (gfc_could_be_alias (dest, ss)
4211 || gfc_are_equivalenced_arrays (dest_expr, ss_expr))
4219 lref = dest_expr->ref;
4220 rref = ss_expr->ref;
4222 nDepend = gfc_dep_resolver (lref, rref, &loop->reverse[0]);
4227 for (i = 0; i < dest->dimen; i++)
4228 for (j = 0; j < ss->dimen; j++)
4230 && dest->dim[i] == ss->dim[j])
4232 /* If we don't access array elements in the same order,
4233 there is a dependency. */
4238 /* TODO : loop shifting. */
4241 /* Mark the dimensions for LOOP SHIFTING */
4242 for (n = 0; n < loop->dimen; n++)
4244 int dim = dest->data.info.dim[n];
4246 if (lref->u.ar.dimen_type[dim] == DIMEN_VECTOR)
4248 else if (! gfc_is_same_range (&lref->u.ar,
4249 &rref->u.ar, dim, 0))
4253 /* Put all the dimensions with dependencies in the
4256 for (n = 0; n < loop->dimen; n++)
4258 gcc_assert (loop->order[n] == n);
4260 loop->order[dim++] = n;
4262 for (n = 0; n < loop->dimen; n++)
4265 loop->order[dim++] = n;
4268 gcc_assert (dim == loop->dimen);
4279 tree base_type = gfc_typenode_for_spec (&dest_expr->ts);
4280 if (GFC_ARRAY_TYPE_P (base_type)
4281 || GFC_DESCRIPTOR_TYPE_P (base_type))
4282 base_type = gfc_get_element_type (base_type);
4283 loop->temp_ss = gfc_get_temp_ss (base_type, dest->info->string_length,
4285 gfc_add_ss_to_loop (loop, loop->temp_ss);
4288 loop->temp_ss = NULL;
4292 /* Browse through each array's information from the scalarizer and set the loop
4293 bounds according to the "best" one (per dimension), i.e. the one which
4294 provides the most information (constant bounds, shape, etc). */
4297 set_loop_bounds (gfc_loopinfo *loop)
4299 int n, dim, spec_dim;
4300 gfc_array_info *info;
4301 gfc_array_info *specinfo;
4305 bool dynamic[GFC_MAX_DIMENSIONS];
4309 loopspec = loop->specloop;
4312 for (n = 0; n < loop->dimen; n++)
4316 /* We use one SS term, and use that to determine the bounds of the
4317 loop for this dimension. We try to pick the simplest term. */
4318 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
4320 gfc_ss_type ss_type;
4322 ss_type = ss->info->type;
4323 if (ss_type == GFC_SS_SCALAR
4324 || ss_type == GFC_SS_TEMP
4325 || ss_type == GFC_SS_REFERENCE)
4328 info = &ss->info->data.array;
4331 if (loopspec[n] != NULL)
4333 specinfo = &loopspec[n]->info->data.array;
4334 spec_dim = loopspec[n]->dim[n];
4338 /* Silence unitialized warnings. */
4345 gcc_assert (info->shape[dim]);
4346 /* The frontend has worked out the size for us. */
4349 || !integer_zerop (specinfo->start[spec_dim]))
4350 /* Prefer zero-based descriptors if possible. */
4355 if (ss_type == GFC_SS_CONSTRUCTOR)
4357 gfc_constructor_base base;
4358 /* An unknown size constructor will always be rank one.
4359 Higher rank constructors will either have known shape,
4360 or still be wrapped in a call to reshape. */
4361 gcc_assert (loop->dimen == 1);
4363 /* Always prefer to use the constructor bounds if the size
4364 can be determined at compile time. Prefer not to otherwise,
4365 since the general case involves realloc, and it's better to
4366 avoid that overhead if possible. */
4367 base = ss->info->expr->value.constructor;
4368 dynamic[n] = gfc_get_array_constructor_size (&i, base);
4369 if (!dynamic[n] || !loopspec[n])
4374 /* TODO: Pick the best bound if we have a choice between a
4375 function and something else. */
4376 if (ss_type == GFC_SS_FUNCTION)
4382 /* Avoid using an allocatable lhs in an assignment, since
4383 there might be a reallocation coming. */
4384 if (loopspec[n] && ss->is_alloc_lhs)
4387 if (ss_type != GFC_SS_SECTION)
4392 /* Criteria for choosing a loop specifier (most important first):
4393 doesn't need realloc
4399 else if ((loopspec[n]->info->type == GFC_SS_CONSTRUCTOR && dynamic[n])
4400 || n >= loop->dimen)
4402 else if (integer_onep (info->stride[dim])
4403 && !integer_onep (specinfo->stride[spec_dim]))
4405 else if (INTEGER_CST_P (info->stride[dim])
4406 && !INTEGER_CST_P (specinfo->stride[spec_dim]))
4408 else if (INTEGER_CST_P (info->start[dim])
4409 && !INTEGER_CST_P (specinfo->start[spec_dim]))
4411 /* We don't work out the upper bound.
4412 else if (INTEGER_CST_P (info->finish[n])
4413 && ! INTEGER_CST_P (specinfo->finish[n]))
4414 loopspec[n] = ss; */
4417 /* We should have found the scalarization loop specifier. If not,
4419 gcc_assert (loopspec[n]);
4421 info = &loopspec[n]->info->data.array;
4422 dim = loopspec[n]->dim[n];
4424 /* Set the extents of this range. */
4425 cshape = info->shape;
4426 if (cshape && INTEGER_CST_P (info->start[dim])
4427 && INTEGER_CST_P (info->stride[dim]))
4429 loop->from[n] = info->start[dim];
4430 mpz_set (i, cshape[get_array_ref_dim_for_loop_dim (loopspec[n], n)]);
4431 mpz_sub_ui (i, i, 1);
4432 /* To = from + (size - 1) * stride. */
4433 tmp = gfc_conv_mpz_to_tree (i, gfc_index_integer_kind);
4434 if (!integer_onep (info->stride[dim]))
4435 tmp = fold_build2_loc (input_location, MULT_EXPR,
4436 gfc_array_index_type, tmp,
4438 loop->to[n] = fold_build2_loc (input_location, PLUS_EXPR,
4439 gfc_array_index_type,
4440 loop->from[n], tmp);
4444 loop->from[n] = info->start[dim];
4445 switch (loopspec[n]->info->type)
4447 case GFC_SS_CONSTRUCTOR:
4448 /* The upper bound is calculated when we expand the
4450 gcc_assert (loop->to[n] == NULL_TREE);
4453 case GFC_SS_SECTION:
4454 /* Use the end expression if it exists and is not constant,
4455 so that it is only evaluated once. */
4456 loop->to[n] = info->end[dim];
4459 case GFC_SS_FUNCTION:
4460 /* The loop bound will be set when we generate the call. */
4461 gcc_assert (loop->to[n] == NULL_TREE);
4469 /* Transform everything so we have a simple incrementing variable. */
4470 if (integer_onep (info->stride[dim]))
4471 info->delta[dim] = gfc_index_zero_node;
4474 /* Set the delta for this section. */
4475 info->delta[dim] = gfc_evaluate_now (loop->from[n], &loop->pre);
4476 /* Number of iterations is (end - start + step) / step.
4477 with start = 0, this simplifies to
4479 for (i = 0; i<=last; i++){...}; */
4480 tmp = fold_build2_loc (input_location, MINUS_EXPR,
4481 gfc_array_index_type, loop->to[n],
4483 tmp = fold_build2_loc (input_location, FLOOR_DIV_EXPR,
4484 gfc_array_index_type, tmp, info->stride[dim]);
4485 tmp = fold_build2_loc (input_location, MAX_EXPR, gfc_array_index_type,
4486 tmp, build_int_cst (gfc_array_index_type, -1));
4487 loop->to[n] = gfc_evaluate_now (tmp, &loop->pre);
4488 /* Make the loop variable start at 0. */
4489 loop->from[n] = gfc_index_zero_node;
4494 for (loop = loop->nested; loop; loop = loop->next)
4495 set_loop_bounds (loop);
4499 /* Initialize the scalarization loop. Creates the loop variables. Determines
4500 the range of the loop variables. Creates a temporary if required.
4501 Also generates code for scalar expressions which have been
4502 moved outside the loop. */
4505 gfc_conv_loop_setup (gfc_loopinfo * loop, locus * where)
4510 set_loop_bounds (loop);
4512 /* Add all the scalar code that can be taken out of the loops.
4513 This may include calculating the loop bounds, so do it before
4514 allocating the temporary. */
4515 gfc_add_loop_ss_code (loop, loop->ss, false, where);
4517 tmp_ss = loop->temp_ss;
4518 /* If we want a temporary then create it. */
4521 gfc_ss_info *tmp_ss_info;
4523 tmp_ss_info = tmp_ss->info;
4524 gcc_assert (tmp_ss_info->type == GFC_SS_TEMP);
4525 gcc_assert (loop->parent == NULL);
4527 /* Make absolutely sure that this is a complete type. */
4528 if (tmp_ss_info->string_length)
4529 tmp_ss_info->data.temp.type
4530 = gfc_get_character_type_len_for_eltype
4531 (TREE_TYPE (tmp_ss_info->data.temp.type),
4532 tmp_ss_info->string_length);
4534 tmp = tmp_ss_info->data.temp.type;
4535 memset (&tmp_ss_info->data.array, 0, sizeof (gfc_array_info));
4536 tmp_ss_info->type = GFC_SS_SECTION;
4538 gcc_assert (tmp_ss->dimen != 0);
4540 gfc_trans_create_temp_array (&loop->pre, &loop->post, tmp_ss, tmp,
4541 NULL_TREE, false, true, false, where);
4544 /* For array parameters we don't have loop variables, so don't calculate the
4546 if (!loop->array_parameter)
4547 gfc_set_delta (loop);
4551 /* Calculates how to transform from loop variables to array indices for each
4552 array: once loop bounds are chosen, sets the difference (DELTA field) between
4553 loop bounds and array reference bounds, for each array info. */
4556 gfc_set_delta (gfc_loopinfo *loop)
4558 gfc_ss *ss, **loopspec;
4559 gfc_array_info *info;
4563 loopspec = loop->specloop;
4565 /* Calculate the translation from loop variables to array indices. */
4566 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
4568 gfc_ss_type ss_type;
4570 ss_type = ss->info->type;
4571 if (ss_type != GFC_SS_SECTION
4572 && ss_type != GFC_SS_COMPONENT
4573 && ss_type != GFC_SS_CONSTRUCTOR)
4576 info = &ss->info->data.array;
4578 for (n = 0; n < ss->dimen; n++)
4580 /* If we are specifying the range the delta is already set. */
4581 if (loopspec[n] != ss)
4585 /* Calculate the offset relative to the loop variable.
4586 First multiply by the stride. */
4587 tmp = loop->from[n];
4588 if (!integer_onep (info->stride[dim]))
4589 tmp = fold_build2_loc (input_location, MULT_EXPR,
4590 gfc_array_index_type,
4591 tmp, info->stride[dim]);
4593 /* Then subtract this from our starting value. */
4594 tmp = fold_build2_loc (input_location, MINUS_EXPR,
4595 gfc_array_index_type,
4596 info->start[dim], tmp);
4598 info->delta[dim] = gfc_evaluate_now (tmp, &loop->pre);
4603 for (loop = loop->nested; loop; loop = loop->next)
4604 gfc_set_delta (loop);
4608 /* Calculate the size of a given array dimension from the bounds. This
4609 is simply (ubound - lbound + 1) if this expression is positive
4610 or 0 if it is negative (pick either one if it is zero). Optionally
4611 (if or_expr is present) OR the (expression != 0) condition to it. */
4614 gfc_conv_array_extent_dim (tree lbound, tree ubound, tree* or_expr)
4619 /* Calculate (ubound - lbound + 1). */
4620 res = fold_build2_loc (input_location, MINUS_EXPR, gfc_array_index_type,
4622 res = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type, res,
4623 gfc_index_one_node);
4625 /* Check whether the size for this dimension is negative. */
4626 cond = fold_build2_loc (input_location, LE_EXPR, boolean_type_node, res,
4627 gfc_index_zero_node);
4628 res = fold_build3_loc (input_location, COND_EXPR, gfc_array_index_type, cond,
4629 gfc_index_zero_node, res);
4631 /* Build OR expression. */
4633 *or_expr = fold_build2_loc (input_location, TRUTH_OR_EXPR,
4634 boolean_type_node, *or_expr, cond);
4640 /* For an array descriptor, get the total number of elements. This is just
4641 the product of the extents along from_dim to to_dim. */
4644 gfc_conv_descriptor_size_1 (tree desc, int from_dim, int to_dim)
4649 res = gfc_index_one_node;
4651 for (dim = from_dim; dim < to_dim; ++dim)
4657 lbound = gfc_conv_descriptor_lbound_get (desc, gfc_rank_cst[dim]);
4658 ubound = gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[dim]);
4660 extent = gfc_conv_array_extent_dim (lbound, ubound, NULL);
4661 res = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
4669 /* Full size of an array. */
4672 gfc_conv_descriptor_size (tree desc, int rank)
4674 return gfc_conv_descriptor_size_1 (desc, 0, rank);
4678 /* Size of a coarray for all dimensions but the last. */
4681 gfc_conv_descriptor_cosize (tree desc, int rank, int corank)
4683 return gfc_conv_descriptor_size_1 (desc, rank, rank + corank - 1);
4687 /* Fills in an array descriptor, and returns the size of the array.
4688 The size will be a simple_val, ie a variable or a constant. Also
4689 calculates the offset of the base. The pointer argument overflow,
4690 which should be of integer type, will increase in value if overflow
4691 occurs during the size calculation. Returns the size of the array.
4695 for (n = 0; n < rank; n++)
4697 a.lbound[n] = specified_lower_bound;
4698 offset = offset + a.lbond[n] * stride;
4700 a.ubound[n] = specified_upper_bound;
4701 a.stride[n] = stride;
4702 size = size >= 0 ? ubound + size : 0; //size = ubound + 1 - lbound
4703 overflow += size == 0 ? 0: (MAX/size < stride ? 1: 0);
4704 stride = stride * size;
4706 for (n = rank; n < rank+corank; n++)
4707 (Set lcobound/ucobound as above.)
4708 element_size = sizeof (array element);
4711 stride = (size_t) stride;
4712 overflow += element_size == 0 ? 0: (MAX/element_size < stride ? 1: 0);
4713 stride = stride * element_size;
4719 gfc_array_init_size (tree descriptor, int rank, int corank, tree * poffset,
4720 gfc_expr ** lower, gfc_expr ** upper, stmtblock_t * pblock,
4721 stmtblock_t * descriptor_block, tree * overflow,
4722 tree expr3_elem_size, tree *nelems, gfc_expr *expr3)
4735 stmtblock_t thenblock;
4736 stmtblock_t elseblock;
4741 type = TREE_TYPE (descriptor);
4743 stride = gfc_index_one_node;
4744 offset = gfc_index_zero_node;
4746 /* Set the dtype. */
4747 tmp = gfc_conv_descriptor_dtype (descriptor);
4748 gfc_add_modify (descriptor_block, tmp, gfc_get_dtype (TREE_TYPE (descriptor)));
4750 or_expr = boolean_false_node;
4752 for (n = 0; n < rank; n++)
4757 /* We have 3 possibilities for determining the size of the array:
4758 lower == NULL => lbound = 1, ubound = upper[n]
4759 upper[n] = NULL => lbound = 1, ubound = lower[n]
4760 upper[n] != NULL => lbound = lower[n], ubound = upper[n] */
4763 /* Set lower bound. */
4764 gfc_init_se (&se, NULL);
4766 se.expr = gfc_index_one_node;
4769 gcc_assert (lower[n]);
4772 gfc_conv_expr_type (&se, lower[n], gfc_array_index_type);
4773 gfc_add_block_to_block (pblock, &se.pre);
4777 se.expr = gfc_index_one_node;
4781 gfc_conv_descriptor_lbound_set (descriptor_block, descriptor,
4782 gfc_rank_cst[n], se.expr);
4783 conv_lbound = se.expr;
4785 /* Work out the offset for this component. */
4786 tmp = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
4788 offset = fold_build2_loc (input_location, MINUS_EXPR,
4789 gfc_array_index_type, offset, tmp);
4791 /* Set upper bound. */
4792 gfc_init_se (&se, NULL);
4793 gcc_assert (ubound);
4794 gfc_conv_expr_type (&se, ubound, gfc_array_index_type);
4795 gfc_add_block_to_block (pblock, &se.pre);
4797 gfc_conv_descriptor_ubound_set (descriptor_block, descriptor,
4798 gfc_rank_cst[n], se.expr);
4799 conv_ubound = se.expr;
4801 /* Store the stride. */
4802 gfc_conv_descriptor_stride_set (descriptor_block, descriptor,
4803 gfc_rank_cst[n], stride);
4805 /* Calculate size and check whether extent is negative. */
4806 size = gfc_conv_array_extent_dim (conv_lbound, conv_ubound, &or_expr);
4807 size = gfc_evaluate_now (size, pblock);
4809 /* Check whether multiplying the stride by the number of
4810 elements in this dimension would overflow. We must also check
4811 whether the current dimension has zero size in order to avoid
4814 tmp = fold_build2_loc (input_location, TRUNC_DIV_EXPR,
4815 gfc_array_index_type,
4816 fold_convert (gfc_array_index_type,
4817 TYPE_MAX_VALUE (gfc_array_index_type)),
4819 cond = gfc_unlikely (fold_build2_loc (input_location, LT_EXPR,
4820 boolean_type_node, tmp, stride));
4821 tmp = fold_build3_loc (input_location, COND_EXPR, integer_type_node, cond,
4822 integer_one_node, integer_zero_node);
4823 cond = gfc_unlikely (fold_build2_loc (input_location, EQ_EXPR,
4824 boolean_type_node, size,
4825 gfc_index_zero_node));
4826 tmp = fold_build3_loc (input_location, COND_EXPR, integer_type_node, cond,
4827 integer_zero_node, tmp);
4828 tmp = fold_build2_loc (input_location, PLUS_EXPR, integer_type_node,
4830 *overflow = gfc_evaluate_now (tmp, pblock);
4832 /* Multiply the stride by the number of elements in this dimension. */
4833 stride = fold_build2_loc (input_location, MULT_EXPR,
4834 gfc_array_index_type, stride, size);
4835 stride = gfc_evaluate_now (stride, pblock);
4838 for (n = rank; n < rank + corank; n++)
4842 /* Set lower bound. */
4843 gfc_init_se (&se, NULL);
4844 if (lower == NULL || lower[n] == NULL)
4846 gcc_assert (n == rank + corank - 1);
4847 se.expr = gfc_index_one_node;
4851 if (ubound || n == rank + corank - 1)
4853 gfc_conv_expr_type (&se, lower[n], gfc_array_index_type);
4854 gfc_add_block_to_block (pblock, &se.pre);
4858 se.expr = gfc_index_one_node;
4862 gfc_conv_descriptor_lbound_set (descriptor_block, descriptor,
4863 gfc_rank_cst[n], se.expr);
4865 if (n < rank + corank - 1)
4867 gfc_init_se (&se, NULL);
4868 gcc_assert (ubound);
4869 gfc_conv_expr_type (&se, ubound, gfc_array_index_type);
4870 gfc_add_block_to_block (pblock, &se.pre);
4871 gfc_conv_descriptor_ubound_set (descriptor_block, descriptor,
4872 gfc_rank_cst[n], se.expr);
4876 /* The stride is the number of elements in the array, so multiply by the
4877 size of an element to get the total size. Obviously, if there ia a
4878 SOURCE expression (expr3) we must use its element size. */
4879 if (expr3_elem_size != NULL_TREE)
4880 tmp = expr3_elem_size;
4881 else if (expr3 != NULL)
4883 if (expr3->ts.type == BT_CLASS)
4886 gfc_expr *sz = gfc_copy_expr (expr3);
4887 gfc_add_vptr_component (sz);
4888 gfc_add_size_component (sz);
4889 gfc_init_se (&se_sz, NULL);
4890 gfc_conv_expr (&se_sz, sz);
4896 tmp = gfc_typenode_for_spec (&expr3->ts);
4897 tmp = TYPE_SIZE_UNIT (tmp);
4901 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (type));
4903 /* Convert to size_t. */
4904 element_size = fold_convert (size_type_node, tmp);
4907 return element_size;
4909 *nelems = gfc_evaluate_now (stride, pblock);
4910 stride = fold_convert (size_type_node, stride);
4912 /* First check for overflow. Since an array of type character can
4913 have zero element_size, we must check for that before
4915 tmp = fold_build2_loc (input_location, TRUNC_DIV_EXPR,
4917 TYPE_MAX_VALUE (size_type_node), element_size);
4918 cond = gfc_unlikely (fold_build2_loc (input_location, LT_EXPR,
4919 boolean_type_node, tmp, stride));
4920 tmp = fold_build3_loc (input_location, COND_EXPR, integer_type_node, cond,
4921 integer_one_node, integer_zero_node);
4922 cond = gfc_unlikely (fold_build2_loc (input_location, EQ_EXPR,
4923 boolean_type_node, element_size,
4924 build_int_cst (size_type_node, 0)));
4925 tmp = fold_build3_loc (input_location, COND_EXPR, integer_type_node, cond,
4926 integer_zero_node, tmp);
4927 tmp = fold_build2_loc (input_location, PLUS_EXPR, integer_type_node,
4929 *overflow = gfc_evaluate_now (tmp, pblock);
4931 size = fold_build2_loc (input_location, MULT_EXPR, size_type_node,
4932 stride, element_size);
4934 if (poffset != NULL)
4936 offset = gfc_evaluate_now (offset, pblock);
4940 if (integer_zerop (or_expr))
4942 if (integer_onep (or_expr))
4943 return build_int_cst (size_type_node, 0);
4945 var = gfc_create_var (TREE_TYPE (size), "size");
4946 gfc_start_block (&thenblock);
4947 gfc_add_modify (&thenblock, var, build_int_cst (size_type_node, 0));
4948 thencase = gfc_finish_block (&thenblock);
4950 gfc_start_block (&elseblock);
4951 gfc_add_modify (&elseblock, var, size);
4952 elsecase = gfc_finish_block (&elseblock);
4954 tmp = gfc_evaluate_now (or_expr, pblock);
4955 tmp = build3_v (COND_EXPR, tmp, thencase, elsecase);
4956 gfc_add_expr_to_block (pblock, tmp);
4962 /* Initializes the descriptor and generates a call to _gfor_allocate. Does
4963 the work for an ALLOCATE statement. */
4967 gfc_array_allocate (gfc_se * se, gfc_expr * expr, tree status, tree errmsg,
4968 tree errlen, tree label_finish, tree expr3_elem_size,
4969 tree *nelems, gfc_expr *expr3)
4973 tree offset = NULL_TREE;
4974 tree token = NULL_TREE;
4977 tree error = NULL_TREE;
4978 tree overflow; /* Boolean storing whether size calculation overflows. */
4979 tree var_overflow = NULL_TREE;
4981 tree set_descriptor;
4982 stmtblock_t set_descriptor_block;
4983 stmtblock_t elseblock;
4986 gfc_ref *ref, *prev_ref = NULL;
4987 bool allocatable, coarray, dimension;
4991 /* Find the last reference in the chain. */
4992 while (ref && ref->next != NULL)
4994 gcc_assert (ref->type != REF_ARRAY || ref->u.ar.type == AR_ELEMENT
4995 || (ref->u.ar.dimen == 0 && ref->u.ar.codimen > 0));
5000 if (ref == NULL || ref->type != REF_ARRAY)
5005 allocatable = expr->symtree->n.sym->attr.allocatable;
5006 coarray = expr->symtree->n.sym->attr.codimension;
5007 dimension = expr->symtree->n.sym->attr.dimension;
5011 allocatable = prev_ref->u.c.component->attr.allocatable;
5012 coarray = prev_ref->u.c.component->attr.codimension;
5013 dimension = prev_ref->u.c.component->attr.dimension;
5017 gcc_assert (coarray);
5019 /* Figure out the size of the array. */
5020 switch (ref->u.ar.type)
5026 upper = ref->u.ar.start;
5032 lower = ref->u.ar.start;
5033 upper = ref->u.ar.end;
5037 gcc_assert (ref->u.ar.as->type == AS_EXPLICIT);
5039 lower = ref->u.ar.as->lower;
5040 upper = ref->u.ar.as->upper;
5048 overflow = integer_zero_node;
5050 gfc_init_block (&set_descriptor_block);
5051 size = gfc_array_init_size (se->expr, ref->u.ar.as->rank,
5052 ref->u.ar.as->corank, &offset, lower, upper,
5053 &se->pre, &set_descriptor_block, &overflow,
5054 expr3_elem_size, nelems, expr3);
5059 var_overflow = gfc_create_var (integer_type_node, "overflow");
5060 gfc_add_modify (&se->pre, var_overflow, overflow);
5062 /* Generate the block of code handling overflow. */
5063 msg = gfc_build_addr_expr (pchar_type_node,
5064 gfc_build_localized_cstring_const
5065 ("Integer overflow when calculating the amount of "
5066 "memory to allocate"));
5067 error = build_call_expr_loc (input_location, gfor_fndecl_runtime_error,
5071 if (status != NULL_TREE)
5073 tree status_type = TREE_TYPE (status);
5074 stmtblock_t set_status_block;
5076 gfc_start_block (&set_status_block);
5077 gfc_add_modify (&set_status_block, status,
5078 build_int_cst (status_type, LIBERROR_ALLOCATION));
5079 error = gfc_finish_block (&set_status_block);
5082 gfc_start_block (&elseblock);
5084 /* Allocate memory to store the data. */
5085 if (POINTER_TYPE_P (TREE_TYPE (se->expr)))
5086 se->expr = build_fold_indirect_ref_loc (input_location, se->expr);
5088 pointer = gfc_conv_descriptor_data_get (se->expr);
5089 STRIP_NOPS (pointer);
5091 if (coarray && gfc_option.coarray == GFC_FCOARRAY_LIB)
5092 token = gfc_build_addr_expr (NULL_TREE,
5093 gfc_conv_descriptor_token (se->expr));
5095 /* The allocatable variant takes the old pointer as first argument. */
5097 gfc_allocate_allocatable (&elseblock, pointer, size, token,
5098 status, errmsg, errlen, label_finish, expr);
5100 gfc_allocate_using_malloc (&elseblock, pointer, size, status);
5104 cond = gfc_unlikely (fold_build2_loc (input_location, NE_EXPR,
5105 boolean_type_node, var_overflow, integer_zero_node));
5106 tmp = fold_build3_loc (input_location, COND_EXPR, void_type_node, cond,
5107 error, gfc_finish_block (&elseblock));
5110 tmp = gfc_finish_block (&elseblock);
5112 gfc_add_expr_to_block (&se->pre, tmp);
5114 if (expr->ts.type == BT_CLASS)
5116 tmp = build_int_cst (unsigned_char_type_node, 0);
5117 /* With class objects, it is best to play safe and null the
5118 memory because we cannot know if dynamic types have allocatable
5119 components or not. */
5120 tmp = build_call_expr_loc (input_location,
5121 builtin_decl_explicit (BUILT_IN_MEMSET),
5122 3, pointer, tmp, size);
5123 gfc_add_expr_to_block (&se->pre, tmp);
5126 /* Update the array descriptors. */
5128 gfc_conv_descriptor_offset_set (&set_descriptor_block, se->expr, offset);
5130 set_descriptor = gfc_finish_block (&set_descriptor_block);
5131 if (status != NULL_TREE)
5133 cond = fold_build2_loc (input_location, EQ_EXPR,
5134 boolean_type_node, status,
5135 build_int_cst (TREE_TYPE (status), 0));
5136 gfc_add_expr_to_block (&se->pre,
5137 fold_build3_loc (input_location, COND_EXPR, void_type_node,
5138 gfc_likely (cond), set_descriptor,
5139 build_empty_stmt (input_location)));
5142 gfc_add_expr_to_block (&se->pre, set_descriptor);
5144 if ((expr->ts.type == BT_DERIVED)
5145 && expr->ts.u.derived->attr.alloc_comp)
5147 tmp = gfc_nullify_alloc_comp (expr->ts.u.derived, se->expr,
5148 ref->u.ar.as->rank);
5149 gfc_add_expr_to_block (&se->pre, tmp);
5156 /* Deallocate an array variable. Also used when an allocated variable goes
5161 gfc_array_deallocate (tree descriptor, tree pstat, tree errmsg, tree errlen,
5162 tree label_finish, gfc_expr* expr)
5167 bool coarray = gfc_is_coarray (expr);
5169 gfc_start_block (&block);
5171 /* Get a pointer to the data. */
5172 var = gfc_conv_descriptor_data_get (descriptor);
5175 /* Parameter is the address of the data component. */
5176 tmp = gfc_deallocate_with_status (coarray ? descriptor : var, pstat, errmsg,
5177 errlen, label_finish, false, expr, coarray);
5178 gfc_add_expr_to_block (&block, tmp);
5180 /* Zero the data pointer; only for coarrays an error can occur and then
5181 the allocation status may not be changed. */
5182 tmp = fold_build2_loc (input_location, MODIFY_EXPR, void_type_node,
5183 var, build_int_cst (TREE_TYPE (var), 0));
5184 if (pstat != NULL_TREE && coarray && gfc_option.coarray == GFC_FCOARRAY_LIB)
5187 tree stat = build_fold_indirect_ref_loc (input_location, pstat);
5189 cond = fold_build2_loc (input_location, EQ_EXPR, boolean_type_node,
5190 stat, build_int_cst (TREE_TYPE (stat), 0));
5191 tmp = fold_build3_loc (input_location, COND_EXPR, void_type_node,
5192 cond, tmp, build_empty_stmt (input_location));
5195 gfc_add_expr_to_block (&block, tmp);
5197 return gfc_finish_block (&block);
5201 /* Create an array constructor from an initialization expression.
5202 We assume the frontend already did any expansions and conversions. */
5205 gfc_conv_array_initializer (tree type, gfc_expr * expr)
5211 unsigned HOST_WIDE_INT lo;
5213 VEC(constructor_elt,gc) *v = NULL;
5215 if (expr->expr_type == EXPR_VARIABLE
5216 && expr->symtree->n.sym->attr.flavor == FL_PARAMETER
5217 && expr->symtree->n.sym->value)
5218 expr = expr->symtree->n.sym->value;
5220 switch (expr->expr_type)
5223 case EXPR_STRUCTURE:
5224 /* A single scalar or derived type value. Create an array with all
5225 elements equal to that value. */
5226 gfc_init_se (&se, NULL);
5228 if (expr->expr_type == EXPR_CONSTANT)
5229 gfc_conv_constant (&se, expr);
5231 gfc_conv_structure (&se, expr, 1);
5233 tmp = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
5234 gcc_assert (tmp && INTEGER_CST_P (tmp));
5235 hi = TREE_INT_CST_HIGH (tmp);
5236 lo = TREE_INT_CST_LOW (tmp);
5240 /* This will probably eat buckets of memory for large arrays. */
5241 while (hi != 0 || lo != 0)
5243 CONSTRUCTOR_APPEND_ELT (v, NULL_TREE, se.expr);
5251 /* Create a vector of all the elements. */
5252 for (c = gfc_constructor_first (expr->value.constructor);
5253 c; c = gfc_constructor_next (c))
5257 /* Problems occur when we get something like
5258 integer :: a(lots) = (/(i, i=1, lots)/) */
5259 gfc_fatal_error ("The number of elements in the array constructor "
5260 "at %L requires an increase of the allowed %d "
5261 "upper limit. See -fmax-array-constructor "
5262 "option", &expr->where,
5263 gfc_option.flag_max_array_constructor);
5266 if (mpz_cmp_si (c->offset, 0) != 0)
5267 index = gfc_conv_mpz_to_tree (c->offset, gfc_index_integer_kind);
5271 if (mpz_cmp_si (c->repeat, 1) > 0)
5277 mpz_add (maxval, c->offset, c->repeat);
5278 mpz_sub_ui (maxval, maxval, 1);
5279 tmp2 = gfc_conv_mpz_to_tree (maxval, gfc_index_integer_kind);
5280 if (mpz_cmp_si (c->offset, 0) != 0)
5282 mpz_add_ui (maxval, c->offset, 1);
5283 tmp1 = gfc_conv_mpz_to_tree (maxval, gfc_index_integer_kind);
5286 tmp1 = gfc_conv_mpz_to_tree (c->offset, gfc_index_integer_kind);
5288 range = fold_build2 (RANGE_EXPR, gfc_array_index_type, tmp1, tmp2);
5294 gfc_init_se (&se, NULL);
5295 switch (c->expr->expr_type)
5298 gfc_conv_constant (&se, c->expr);
5301 case EXPR_STRUCTURE:
5302 gfc_conv_structure (&se, c->expr, 1);
5306 /* Catch those occasional beasts that do not simplify
5307 for one reason or another, assuming that if they are
5308 standard defying the frontend will catch them. */
5309 gfc_conv_expr (&se, c->expr);
5313 if (range == NULL_TREE)
5314 CONSTRUCTOR_APPEND_ELT (v, index, se.expr);
5317 if (index != NULL_TREE)
5318 CONSTRUCTOR_APPEND_ELT (v, index, se.expr);
5319 CONSTRUCTOR_APPEND_ELT (v, range, se.expr);
5325 return gfc_build_null_descriptor (type);
5331 /* Create a constructor from the list of elements. */
5332 tmp = build_constructor (type, v);
5333 TREE_CONSTANT (tmp) = 1;
5338 /* Generate code to evaluate non-constant coarray cobounds. */
5341 gfc_trans_array_cobounds (tree type, stmtblock_t * pblock,
5342 const gfc_symbol *sym)
5352 for (dim = as->rank; dim < as->rank + as->corank; dim++)
5354 /* Evaluate non-constant array bound expressions. */
5355 lbound = GFC_TYPE_ARRAY_LBOUND (type, dim);
5356 if (as->lower[dim] && !INTEGER_CST_P (lbound))
5358 gfc_init_se (&se, NULL);
5359 gfc_conv_expr_type (&se, as->lower[dim], gfc_array_index_type);
5360 gfc_add_block_to_block (pblock, &se.pre);
5361 gfc_add_modify (pblock, lbound, se.expr);
5363 ubound = GFC_TYPE_ARRAY_UBOUND (type, dim);
5364 if (as->upper[dim] && !INTEGER_CST_P (ubound))
5366 gfc_init_se (&se, NULL);
5367 gfc_conv_expr_type (&se, as->upper[dim], gfc_array_index_type);
5368 gfc_add_block_to_block (pblock, &se.pre);
5369 gfc_add_modify (pblock, ubound, se.expr);
5375 /* Generate code to evaluate non-constant array bounds. Sets *poffset and
5376 returns the size (in elements) of the array. */
5379 gfc_trans_array_bounds (tree type, gfc_symbol * sym, tree * poffset,
5380 stmtblock_t * pblock)
5395 size = gfc_index_one_node;
5396 offset = gfc_index_zero_node;
5397 for (dim = 0; dim < as->rank; dim++)
5399 /* Evaluate non-constant array bound expressions. */
5400 lbound = GFC_TYPE_ARRAY_LBOUND (type, dim);
5401 if (as->lower[dim] && !INTEGER_CST_P (lbound))
5403 gfc_init_se (&se, NULL);
5404 gfc_conv_expr_type (&se, as->lower[dim], gfc_array_index_type);
5405 gfc_add_block_to_block (pblock, &se.pre);
5406 gfc_add_modify (pblock, lbound, se.expr);
5408 ubound = GFC_TYPE_ARRAY_UBOUND (type, dim);
5409 if (as->upper[dim] && !INTEGER_CST_P (ubound))
5411 gfc_init_se (&se, NULL);
5412 gfc_conv_expr_type (&se, as->upper[dim], gfc_array_index_type);
5413 gfc_add_block_to_block (pblock, &se.pre);
5414 gfc_add_modify (pblock, ubound, se.expr);
5416 /* The offset of this dimension. offset = offset - lbound * stride. */
5417 tmp = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
5419 offset = fold_build2_loc (input_location, MINUS_EXPR, gfc_array_index_type,
5422 /* The size of this dimension, and the stride of the next. */
5423 if (dim + 1 < as->rank)
5424 stride = GFC_TYPE_ARRAY_STRIDE (type, dim + 1);
5426 stride = GFC_TYPE_ARRAY_SIZE (type);
5428 if (ubound != NULL_TREE && !(stride && INTEGER_CST_P (stride)))
5430 /* Calculate stride = size * (ubound + 1 - lbound). */
5431 tmp = fold_build2_loc (input_location, MINUS_EXPR,
5432 gfc_array_index_type,
5433 gfc_index_one_node, lbound);
5434 tmp = fold_build2_loc (input_location, PLUS_EXPR,
5435 gfc_array_index_type, ubound, tmp);
5436 tmp = fold_build2_loc (input_location, MULT_EXPR,
5437 gfc_array_index_type, size, tmp);
5439 gfc_add_modify (pblock, stride, tmp);
5441 stride = gfc_evaluate_now (tmp, pblock);
5443 /* Make sure that negative size arrays are translated
5444 to being zero size. */
5445 tmp = fold_build2_loc (input_location, GE_EXPR, boolean_type_node,
5446 stride, gfc_index_zero_node);
5447 tmp = fold_build3_loc (input_location, COND_EXPR,
5448 gfc_array_index_type, tmp,
5449 stride, gfc_index_zero_node);
5450 gfc_add_modify (pblock, stride, tmp);
5456 gfc_trans_array_cobounds (type, pblock, sym);
5457 gfc_trans_vla_type_sizes (sym, pblock);
5464 /* Generate code to initialize/allocate an array variable. */
5467 gfc_trans_auto_array_allocation (tree decl, gfc_symbol * sym,
5468 gfc_wrapped_block * block)
5472 tree tmp = NULL_TREE;
5479 gcc_assert (!(sym->attr.pointer || sym->attr.allocatable));
5481 /* Do nothing for USEd variables. */
5482 if (sym->attr.use_assoc)
5485 type = TREE_TYPE (decl);
5486 gcc_assert (GFC_ARRAY_TYPE_P (type));
5487 onstack = TREE_CODE (type) != POINTER_TYPE;
5489 gfc_init_block (&init);
5491 /* Evaluate character string length. */
5492 if (sym->ts.type == BT_CHARACTER
5493 && onstack && !INTEGER_CST_P (sym->ts.u.cl->backend_decl))
5495 gfc_conv_string_length (sym->ts.u.cl, NULL, &init);
5497 gfc_trans_vla_type_sizes (sym, &init);
5499 /* Emit a DECL_EXPR for this variable, which will cause the
5500 gimplifier to allocate storage, and all that good stuff. */
5501 tmp = fold_build1_loc (input_location, DECL_EXPR, TREE_TYPE (decl), decl);
5502 gfc_add_expr_to_block (&init, tmp);
5507 gfc_add_init_cleanup (block, gfc_finish_block (&init), NULL_TREE);
5511 type = TREE_TYPE (type);
5513 gcc_assert (!sym->attr.use_assoc);
5514 gcc_assert (!TREE_STATIC (decl));
5515 gcc_assert (!sym->module);
5517 if (sym->ts.type == BT_CHARACTER
5518 && !INTEGER_CST_P (sym->ts.u.cl->backend_decl))
5519 gfc_conv_string_length (sym->ts.u.cl, NULL, &init);
5521 size = gfc_trans_array_bounds (type, sym, &offset, &init);
5523 /* Don't actually allocate space for Cray Pointees. */
5524 if (sym->attr.cray_pointee)
5526 if (TREE_CODE (GFC_TYPE_ARRAY_OFFSET (type)) == VAR_DECL)
5527 gfc_add_modify (&init, GFC_TYPE_ARRAY_OFFSET (type), offset);
5529 gfc_add_init_cleanup (block, gfc_finish_block (&init), NULL_TREE);
5533 if (gfc_option.flag_stack_arrays)
5535 gcc_assert (TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE);
5536 space = build_decl (sym->declared_at.lb->location,
5537 VAR_DECL, create_tmp_var_name ("A"),
5538 TREE_TYPE (TREE_TYPE (decl)));
5539 gfc_trans_vla_type_sizes (sym, &init);
5543 /* The size is the number of elements in the array, so multiply by the
5544 size of an element to get the total size. */
5545 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (type));
5546 size = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
5547 size, fold_convert (gfc_array_index_type, tmp));
5549 /* Allocate memory to hold the data. */
5550 tmp = gfc_call_malloc (&init, TREE_TYPE (decl), size);
5551 gfc_add_modify (&init, decl, tmp);
5553 /* Free the temporary. */
5554 tmp = gfc_call_free (convert (pvoid_type_node, decl));
5558 /* Set offset of the array. */
5559 if (TREE_CODE (GFC_TYPE_ARRAY_OFFSET (type)) == VAR_DECL)
5560 gfc_add_modify (&init, GFC_TYPE_ARRAY_OFFSET (type), offset);
5562 /* Automatic arrays should not have initializers. */
5563 gcc_assert (!sym->value);
5565 inittree = gfc_finish_block (&init);
5572 /* Don't create new scope, emit the DECL_EXPR in exactly the scope
5573 where also space is located. */
5574 gfc_init_block (&init);
5575 tmp = fold_build1_loc (input_location, DECL_EXPR,
5576 TREE_TYPE (space), space);
5577 gfc_add_expr_to_block (&init, tmp);
5578 addr = fold_build1_loc (sym->declared_at.lb->location,
5579 ADDR_EXPR, TREE_TYPE (decl), space);
5580 gfc_add_modify (&init, decl, addr);
5581 gfc_add_init_cleanup (block, gfc_finish_block (&init), NULL_TREE);
5584 gfc_add_init_cleanup (block, inittree, tmp);
5588 /* Generate entry and exit code for g77 calling convention arrays. */
5591 gfc_trans_g77_array (gfc_symbol * sym, gfc_wrapped_block * block)
5601 gfc_save_backend_locus (&loc);
5602 gfc_set_backend_locus (&sym->declared_at);
5604 /* Descriptor type. */
5605 parm = sym->backend_decl;
5606 type = TREE_TYPE (parm);
5607 gcc_assert (GFC_ARRAY_TYPE_P (type));
5609 gfc_start_block (&init);
5611 if (sym->ts.type == BT_CHARACTER
5612 && TREE_CODE (sym->ts.u.cl->backend_decl) == VAR_DECL)
5613 gfc_conv_string_length (sym->ts.u.cl, NULL, &init);
5615 /* Evaluate the bounds of the array. */
5616 gfc_trans_array_bounds (type, sym, &offset, &init);
5618 /* Set the offset. */
5619 if (TREE_CODE (GFC_TYPE_ARRAY_OFFSET (type)) == VAR_DECL)
5620 gfc_add_modify (&init, GFC_TYPE_ARRAY_OFFSET (type), offset);
5622 /* Set the pointer itself if we aren't using the parameter directly. */
5623 if (TREE_CODE (parm) != PARM_DECL)
5625 tmp = convert (TREE_TYPE (parm), GFC_DECL_SAVED_DESCRIPTOR (parm));
5626 gfc_add_modify (&init, parm, tmp);
5628 stmt = gfc_finish_block (&init);
5630 gfc_restore_backend_locus (&loc);
5632 /* Add the initialization code to the start of the function. */
5634 if (sym->attr.optional || sym->attr.not_always_present)
5636 tmp = gfc_conv_expr_present (sym);
5637 stmt = build3_v (COND_EXPR, tmp, stmt, build_empty_stmt (input_location));
5640 gfc_add_init_cleanup (block, stmt, NULL_TREE);
5644 /* Modify the descriptor of an array parameter so that it has the
5645 correct lower bound. Also move the upper bound accordingly.
5646 If the array is not packed, it will be copied into a temporary.
5647 For each dimension we set the new lower and upper bounds. Then we copy the
5648 stride and calculate the offset for this dimension. We also work out
5649 what the stride of a packed array would be, and see it the two match.
5650 If the array need repacking, we set the stride to the values we just
5651 calculated, recalculate the offset and copy the array data.
5652 Code is also added to copy the data back at the end of the function.
5656 gfc_trans_dummy_array_bias (gfc_symbol * sym, tree tmpdesc,
5657 gfc_wrapped_block * block)
5664 tree stmtInit, stmtCleanup;
5671 tree stride, stride2;
5681 /* Do nothing for pointer and allocatable arrays. */
5682 if (sym->attr.pointer || sym->attr.allocatable)
5685 if (sym->attr.dummy && gfc_is_nodesc_array (sym))
5687 gfc_trans_g77_array (sym, block);
5691 gfc_save_backend_locus (&loc);
5692 gfc_set_backend_locus (&sym->declared_at);
5694 /* Descriptor type. */
5695 type = TREE_TYPE (tmpdesc);
5696 gcc_assert (GFC_ARRAY_TYPE_P (type));
5697 dumdesc = GFC_DECL_SAVED_DESCRIPTOR (tmpdesc);
5698 dumdesc = build_fold_indirect_ref_loc (input_location, dumdesc);
5699 gfc_start_block (&init);
5701 if (sym->ts.type == BT_CHARACTER
5702 && TREE_CODE (sym->ts.u.cl->backend_decl) == VAR_DECL)
5703 gfc_conv_string_length (sym->ts.u.cl, NULL, &init);
5705 checkparm = (sym->as->type == AS_EXPLICIT
5706 && (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS));
5708 no_repack = !(GFC_DECL_PACKED_ARRAY (tmpdesc)
5709 || GFC_DECL_PARTIAL_PACKED_ARRAY (tmpdesc));
5711 if (GFC_DECL_PARTIAL_PACKED_ARRAY (tmpdesc))
5713 /* For non-constant shape arrays we only check if the first dimension
5714 is contiguous. Repacking higher dimensions wouldn't gain us
5715 anything as we still don't know the array stride. */
5716 partial = gfc_create_var (boolean_type_node, "partial");
5717 TREE_USED (partial) = 1;
5718 tmp = gfc_conv_descriptor_stride_get (dumdesc, gfc_rank_cst[0]);
5719 tmp = fold_build2_loc (input_location, EQ_EXPR, boolean_type_node, tmp,
5720 gfc_index_one_node);
5721 gfc_add_modify (&init, partial, tmp);
5724 partial = NULL_TREE;
5726 /* The naming of stmt_unpacked and stmt_packed may be counter-intuitive
5727 here, however I think it does the right thing. */
5730 /* Set the first stride. */
5731 stride = gfc_conv_descriptor_stride_get (dumdesc, gfc_rank_cst[0]);
5732 stride = gfc_evaluate_now (stride, &init);
5734 tmp = fold_build2_loc (input_location, EQ_EXPR, boolean_type_node,
5735 stride, gfc_index_zero_node);
5736 tmp = fold_build3_loc (input_location, COND_EXPR, gfc_array_index_type,
5737 tmp, gfc_index_one_node, stride);
5738 stride = GFC_TYPE_ARRAY_STRIDE (type, 0);
5739 gfc_add_modify (&init, stride, tmp);
5741 /* Allow the user to disable array repacking. */
5742 stmt_unpacked = NULL_TREE;
5746 gcc_assert (integer_onep (GFC_TYPE_ARRAY_STRIDE (type, 0)));
5747 /* A library call to repack the array if necessary. */
5748 tmp = GFC_DECL_SAVED_DESCRIPTOR (tmpdesc);
5749 stmt_unpacked = build_call_expr_loc (input_location,
5750 gfor_fndecl_in_pack, 1, tmp);
5752 stride = gfc_index_one_node;
5754 if (gfc_option.warn_array_temp)
5755 gfc_warning ("Creating array temporary at %L", &loc);
5758 /* This is for the case where the array data is used directly without
5759 calling the repack function. */
5760 if (no_repack || partial != NULL_TREE)
5761 stmt_packed = gfc_conv_descriptor_data_get (dumdesc);
5763 stmt_packed = NULL_TREE;
5765 /* Assign the data pointer. */
5766 if (stmt_packed != NULL_TREE && stmt_unpacked != NULL_TREE)
5768 /* Don't repack unknown shape arrays when the first stride is 1. */
5769 tmp = fold_build3_loc (input_location, COND_EXPR, TREE_TYPE (stmt_packed),
5770 partial, stmt_packed, stmt_unpacked);
5773 tmp = stmt_packed != NULL_TREE ? stmt_packed : stmt_unpacked;
5774 gfc_add_modify (&init, tmpdesc, fold_convert (type, tmp));
5776 offset = gfc_index_zero_node;
5777 size = gfc_index_one_node;
5779 /* Evaluate the bounds of the array. */
5780 for (n = 0; n < sym->as->rank; n++)
5782 if (checkparm || !sym->as->upper[n])
5784 /* Get the bounds of the actual parameter. */
5785 dubound = gfc_conv_descriptor_ubound_get (dumdesc, gfc_rank_cst[n]);
5786 dlbound = gfc_conv_descriptor_lbound_get (dumdesc, gfc_rank_cst[n]);
5790 dubound = NULL_TREE;
5791 dlbound = NULL_TREE;
5794 lbound = GFC_TYPE_ARRAY_LBOUND (type, n);
5795 if (!INTEGER_CST_P (lbound))
5797 gfc_init_se (&se, NULL);
5798 gfc_conv_expr_type (&se, sym->as->lower[n],
5799 gfc_array_index_type);
5800 gfc_add_block_to_block (&init, &se.pre);
5801 gfc_add_modify (&init, lbound, se.expr);
5804 ubound = GFC_TYPE_ARRAY_UBOUND (type, n);
5805 /* Set the desired upper bound. */
5806 if (sym->as->upper[n])
5808 /* We know what we want the upper bound to be. */
5809 if (!INTEGER_CST_P (ubound))
5811 gfc_init_se (&se, NULL);
5812 gfc_conv_expr_type (&se, sym->as->upper[n],
5813 gfc_array_index_type);
5814 gfc_add_block_to_block (&init, &se.pre);
5815 gfc_add_modify (&init, ubound, se.expr);
5818 /* Check the sizes match. */
5821 /* Check (ubound(a) - lbound(a) == ubound(b) - lbound(b)). */
5825 temp = fold_build2_loc (input_location, MINUS_EXPR,
5826 gfc_array_index_type, ubound, lbound);
5827 temp = fold_build2_loc (input_location, PLUS_EXPR,
5828 gfc_array_index_type,
5829 gfc_index_one_node, temp);
5830 stride2 = fold_build2_loc (input_location, MINUS_EXPR,
5831 gfc_array_index_type, dubound,
5833 stride2 = fold_build2_loc (input_location, PLUS_EXPR,
5834 gfc_array_index_type,
5835 gfc_index_one_node, stride2);
5836 tmp = fold_build2_loc (input_location, NE_EXPR,
5837 gfc_array_index_type, temp, stride2);
5838 asprintf (&msg, "Dimension %d of array '%s' has extent "
5839 "%%ld instead of %%ld", n+1, sym->name);
5841 gfc_trans_runtime_check (true, false, tmp, &init, &loc, msg,
5842 fold_convert (long_integer_type_node, temp),
5843 fold_convert (long_integer_type_node, stride2));
5850 /* For assumed shape arrays move the upper bound by the same amount
5851 as the lower bound. */
5852 tmp = fold_build2_loc (input_location, MINUS_EXPR,
5853 gfc_array_index_type, dubound, dlbound);
5854 tmp = fold_build2_loc (input_location, PLUS_EXPR,
5855 gfc_array_index_type, tmp, lbound);
5856 gfc_add_modify (&init, ubound, tmp);
5858 /* The offset of this dimension. offset = offset - lbound * stride. */
5859 tmp = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
5861 offset = fold_build2_loc (input_location, MINUS_EXPR,
5862 gfc_array_index_type, offset, tmp);
5864 /* The size of this dimension, and the stride of the next. */
5865 if (n + 1 < sym->as->rank)
5867 stride = GFC_TYPE_ARRAY_STRIDE (type, n + 1);
5869 if (no_repack || partial != NULL_TREE)
5871 gfc_conv_descriptor_stride_get (dumdesc, gfc_rank_cst[n+1]);
5873 /* Figure out the stride if not a known constant. */
5874 if (!INTEGER_CST_P (stride))
5877 stmt_packed = NULL_TREE;
5880 /* Calculate stride = size * (ubound + 1 - lbound). */
5881 tmp = fold_build2_loc (input_location, MINUS_EXPR,
5882 gfc_array_index_type,
5883 gfc_index_one_node, lbound);
5884 tmp = fold_build2_loc (input_location, PLUS_EXPR,
5885 gfc_array_index_type, ubound, tmp);
5886 size = fold_build2_loc (input_location, MULT_EXPR,
5887 gfc_array_index_type, size, tmp);
5891 /* Assign the stride. */
5892 if (stmt_packed != NULL_TREE && stmt_unpacked != NULL_TREE)
5893 tmp = fold_build3_loc (input_location, COND_EXPR,
5894 gfc_array_index_type, partial,
5895 stmt_unpacked, stmt_packed);
5897 tmp = (stmt_packed != NULL_TREE) ? stmt_packed : stmt_unpacked;
5898 gfc_add_modify (&init, stride, tmp);
5903 stride = GFC_TYPE_ARRAY_SIZE (type);
5905 if (stride && !INTEGER_CST_P (stride))
5907 /* Calculate size = stride * (ubound + 1 - lbound). */
5908 tmp = fold_build2_loc (input_location, MINUS_EXPR,
5909 gfc_array_index_type,
5910 gfc_index_one_node, lbound);
5911 tmp = fold_build2_loc (input_location, PLUS_EXPR,
5912 gfc_array_index_type,
5914 tmp = fold_build2_loc (input_location, MULT_EXPR,
5915 gfc_array_index_type,
5916 GFC_TYPE_ARRAY_STRIDE (type, n), tmp);
5917 gfc_add_modify (&init, stride, tmp);
5922 gfc_trans_array_cobounds (type, &init, sym);
5924 /* Set the offset. */
5925 if (TREE_CODE (GFC_TYPE_ARRAY_OFFSET (type)) == VAR_DECL)
5926 gfc_add_modify (&init, GFC_TYPE_ARRAY_OFFSET (type), offset);
5928 gfc_trans_vla_type_sizes (sym, &init);
5930 stmtInit = gfc_finish_block (&init);
5932 /* Only do the entry/initialization code if the arg is present. */
5933 dumdesc = GFC_DECL_SAVED_DESCRIPTOR (tmpdesc);
5934 optional_arg = (sym->attr.optional
5935 || (sym->ns->proc_name->attr.entry_master
5936 && sym->attr.dummy));
5939 tmp = gfc_conv_expr_present (sym);
5940 stmtInit = build3_v (COND_EXPR, tmp, stmtInit,
5941 build_empty_stmt (input_location));
5946 stmtCleanup = NULL_TREE;
5949 stmtblock_t cleanup;
5950 gfc_start_block (&cleanup);
5952 if (sym->attr.intent != INTENT_IN)
5954 /* Copy the data back. */
5955 tmp = build_call_expr_loc (input_location,
5956 gfor_fndecl_in_unpack, 2, dumdesc, tmpdesc);
5957 gfc_add_expr_to_block (&cleanup, tmp);
5960 /* Free the temporary. */
5961 tmp = gfc_call_free (tmpdesc);
5962 gfc_add_expr_to_block (&cleanup, tmp);
5964 stmtCleanup = gfc_finish_block (&cleanup);
5966 /* Only do the cleanup if the array was repacked. */
5967 tmp = build_fold_indirect_ref_loc (input_location, dumdesc);
5968 tmp = gfc_conv_descriptor_data_get (tmp);
5969 tmp = fold_build2_loc (input_location, NE_EXPR, boolean_type_node,
5971 stmtCleanup = build3_v (COND_EXPR, tmp, stmtCleanup,
5972 build_empty_stmt (input_location));
5976 tmp = gfc_conv_expr_present (sym);
5977 stmtCleanup = build3_v (COND_EXPR, tmp, stmtCleanup,
5978 build_empty_stmt (input_location));
5982 /* We don't need to free any memory allocated by internal_pack as it will
5983 be freed at the end of the function by pop_context. */
5984 gfc_add_init_cleanup (block, stmtInit, stmtCleanup);
5986 gfc_restore_backend_locus (&loc);
5990 /* Calculate the overall offset, including subreferences. */
5992 gfc_get_dataptr_offset (stmtblock_t *block, tree parm, tree desc, tree offset,
5993 bool subref, gfc_expr *expr)
6003 /* If offset is NULL and this is not a subreferenced array, there is
6005 if (offset == NULL_TREE)
6008 offset = gfc_index_zero_node;
6013 tmp = gfc_conv_array_data (desc);
6014 tmp = build_fold_indirect_ref_loc (input_location,
6016 tmp = gfc_build_array_ref (tmp, offset, NULL);
6018 /* Offset the data pointer for pointer assignments from arrays with
6019 subreferences; e.g. my_integer => my_type(:)%integer_component. */
6022 /* Go past the array reference. */
6023 for (ref = expr->ref; ref; ref = ref->next)
6024 if (ref->type == REF_ARRAY &&
6025 ref->u.ar.type != AR_ELEMENT)
6031 /* Calculate the offset for each subsequent subreference. */
6032 for (; ref; ref = ref->next)
6037 field = ref->u.c.component->backend_decl;
6038 gcc_assert (field && TREE_CODE (field) == FIELD_DECL);
6039 tmp = fold_build3_loc (input_location, COMPONENT_REF,
6041 tmp, field, NULL_TREE);
6045 gcc_assert (TREE_CODE (TREE_TYPE (tmp)) == ARRAY_TYPE);
6046 gfc_init_se (&start, NULL);
6047 gfc_conv_expr_type (&start, ref->u.ss.start, gfc_charlen_type_node);
6048 gfc_add_block_to_block (block, &start.pre);
6049 tmp = gfc_build_array_ref (tmp, start.expr, NULL);
6053 gcc_assert (TREE_CODE (TREE_TYPE (tmp)) == ARRAY_TYPE
6054 && ref->u.ar.type == AR_ELEMENT);
6056 /* TODO - Add bounds checking. */
6057 stride = gfc_index_one_node;
6058 index = gfc_index_zero_node;
6059 for (n = 0; n < ref->u.ar.dimen; n++)
6064 /* Update the index. */
6065 gfc_init_se (&start, NULL);
6066 gfc_conv_expr_type (&start, ref->u.ar.start[n], gfc_array_index_type);
6067 itmp = gfc_evaluate_now (start.expr, block);
6068 gfc_init_se (&start, NULL);
6069 gfc_conv_expr_type (&start, ref->u.ar.as->lower[n], gfc_array_index_type);
6070 jtmp = gfc_evaluate_now (start.expr, block);
6071 itmp = fold_build2_loc (input_location, MINUS_EXPR,
6072 gfc_array_index_type, itmp, jtmp);
6073 itmp = fold_build2_loc (input_location, MULT_EXPR,
6074 gfc_array_index_type, itmp, stride);
6075 index = fold_build2_loc (input_location, PLUS_EXPR,
6076 gfc_array_index_type, itmp, index);
6077 index = gfc_evaluate_now (index, block);
6079 /* Update the stride. */
6080 gfc_init_se (&start, NULL);
6081 gfc_conv_expr_type (&start, ref->u.ar.as->upper[n], gfc_array_index_type);
6082 itmp = fold_build2_loc (input_location, MINUS_EXPR,
6083 gfc_array_index_type, start.expr,
6085 itmp = fold_build2_loc (input_location, PLUS_EXPR,
6086 gfc_array_index_type,
6087 gfc_index_one_node, itmp);
6088 stride = fold_build2_loc (input_location, MULT_EXPR,
6089 gfc_array_index_type, stride, itmp);
6090 stride = gfc_evaluate_now (stride, block);
6093 /* Apply the index to obtain the array element. */
6094 tmp = gfc_build_array_ref (tmp, index, NULL);
6104 /* Set the target data pointer. */
6105 offset = gfc_build_addr_expr (gfc_array_dataptr_type (desc), tmp);
6106 gfc_conv_descriptor_data_set (block, parm, offset);
6110 /* gfc_conv_expr_descriptor needs the string length an expression
6111 so that the size of the temporary can be obtained. This is done
6112 by adding up the string lengths of all the elements in the
6113 expression. Function with non-constant expressions have their
6114 string lengths mapped onto the actual arguments using the
6115 interface mapping machinery in trans-expr.c. */
6117 get_array_charlen (gfc_expr *expr, gfc_se *se)
6119 gfc_interface_mapping mapping;
6120 gfc_formal_arglist *formal;
6121 gfc_actual_arglist *arg;
6124 if (expr->ts.u.cl->length
6125 && gfc_is_constant_expr (expr->ts.u.cl->length))
6127 if (!expr->ts.u.cl->backend_decl)
6128 gfc_conv_string_length (expr->ts.u.cl, expr, &se->pre);
6132 switch (expr->expr_type)
6135 get_array_charlen (expr->value.op.op1, se);
6137 /* For parentheses the expression ts.u.cl is identical. */
6138 if (expr->value.op.op == INTRINSIC_PARENTHESES)
6141 expr->ts.u.cl->backend_decl =
6142 gfc_create_var (gfc_charlen_type_node, "sln");
6144 if (expr->value.op.op2)
6146 get_array_charlen (expr->value.op.op2, se);
6148 gcc_assert (expr->value.op.op == INTRINSIC_CONCAT);
6150 /* Add the string lengths and assign them to the expression
6151 string length backend declaration. */
6152 gfc_add_modify (&se->pre, expr->ts.u.cl->backend_decl,
6153 fold_build2_loc (input_location, PLUS_EXPR,
6154 gfc_charlen_type_node,
6155 expr->value.op.op1->ts.u.cl->backend_decl,
6156 expr->value.op.op2->ts.u.cl->backend_decl));
6159 gfc_add_modify (&se->pre, expr->ts.u.cl->backend_decl,
6160 expr->value.op.op1->ts.u.cl->backend_decl);
6164 if (expr->value.function.esym == NULL
6165 || expr->ts.u.cl->length->expr_type == EXPR_CONSTANT)
6167 gfc_conv_string_length (expr->ts.u.cl, expr, &se->pre);
6171 /* Map expressions involving the dummy arguments onto the actual
6172 argument expressions. */
6173 gfc_init_interface_mapping (&mapping);
6174 formal = expr->symtree->n.sym->formal;
6175 arg = expr->value.function.actual;
6177 /* Set se = NULL in the calls to the interface mapping, to suppress any
6179 for (; arg != NULL; arg = arg->next, formal = formal ? formal->next : NULL)
6184 gfc_add_interface_mapping (&mapping, formal->sym, NULL, arg->expr);
6187 gfc_init_se (&tse, NULL);
6189 /* Build the expression for the character length and convert it. */
6190 gfc_apply_interface_mapping (&mapping, &tse, expr->ts.u.cl->length);
6192 gfc_add_block_to_block (&se->pre, &tse.pre);
6193 gfc_add_block_to_block (&se->post, &tse.post);
6194 tse.expr = fold_convert (gfc_charlen_type_node, tse.expr);
6195 tse.expr = fold_build2_loc (input_location, MAX_EXPR,
6196 gfc_charlen_type_node, tse.expr,
6197 build_int_cst (gfc_charlen_type_node, 0));
6198 expr->ts.u.cl->backend_decl = tse.expr;
6199 gfc_free_interface_mapping (&mapping);
6203 gfc_conv_string_length (expr->ts.u.cl, expr, &se->pre);
6209 /* Helper function to check dimensions. */
6211 transposed_dims (gfc_ss *ss)
6215 for (n = 0; n < ss->dimen; n++)
6216 if (ss->dim[n] != n)
6221 /* Convert an array for passing as an actual argument. Expressions and
6222 vector subscripts are evaluated and stored in a temporary, which is then
6223 passed. For whole arrays the descriptor is passed. For array sections
6224 a modified copy of the descriptor is passed, but using the original data.
6226 This function is also used for array pointer assignments, and there
6229 - se->want_pointer && !se->direct_byref
6230 EXPR is an actual argument. On exit, se->expr contains a
6231 pointer to the array descriptor.
6233 - !se->want_pointer && !se->direct_byref
6234 EXPR is an actual argument to an intrinsic function or the
6235 left-hand side of a pointer assignment. On exit, se->expr
6236 contains the descriptor for EXPR.
6238 - !se->want_pointer && se->direct_byref
6239 EXPR is the right-hand side of a pointer assignment and
6240 se->expr is the descriptor for the previously-evaluated
6241 left-hand side. The function creates an assignment from
6245 The se->force_tmp flag disables the non-copying descriptor optimization
6246 that is used for transpose. It may be used in cases where there is an
6247 alias between the transpose argument and another argument in the same
6251 gfc_conv_expr_descriptor (gfc_se * se, gfc_expr * expr, gfc_ss * ss)
6253 gfc_ss_type ss_type;
6254 gfc_ss_info *ss_info;
6256 gfc_array_info *info;
6265 bool subref_array_target = false;
6266 gfc_expr *arg, *ss_expr;
6268 gcc_assert (ss != NULL);
6269 gcc_assert (ss != gfc_ss_terminator);
6272 ss_type = ss_info->type;
6273 ss_expr = ss_info->expr;
6275 /* Special case things we know we can pass easily. */
6276 switch (expr->expr_type)
6279 /* If we have a linear array section, we can pass it directly.
6280 Otherwise we need to copy it into a temporary. */
6282 gcc_assert (ss_type == GFC_SS_SECTION);
6283 gcc_assert (ss_expr == expr);
6284 info = &ss_info->data.array;
6286 /* Get the descriptor for the array. */
6287 gfc_conv_ss_descriptor (&se->pre, ss, 0);
6288 desc = info->descriptor;
6290 subref_array_target = se->direct_byref && is_subref_array (expr);
6291 need_tmp = gfc_ref_needs_temporary_p (expr->ref)
6292 && !subref_array_target;
6299 else if (GFC_ARRAY_TYPE_P (TREE_TYPE (desc)))
6301 /* Create a new descriptor if the array doesn't have one. */
6304 else if (info->ref->u.ar.type == AR_FULL)
6306 else if (se->direct_byref)
6309 full = gfc_full_array_ref_p (info->ref, NULL);
6311 if (full && !transposed_dims (ss))
6313 if (se->direct_byref && !se->byref_noassign)
6315 /* Copy the descriptor for pointer assignments. */
6316 gfc_add_modify (&se->pre, se->expr, desc);
6318 /* Add any offsets from subreferences. */
6319 gfc_get_dataptr_offset (&se->pre, se->expr, desc, NULL_TREE,
6320 subref_array_target, expr);
6322 else if (se->want_pointer)
6324 /* We pass full arrays directly. This means that pointers and
6325 allocatable arrays should also work. */
6326 se->expr = gfc_build_addr_expr (NULL_TREE, desc);
6333 if (expr->ts.type == BT_CHARACTER)
6334 se->string_length = gfc_get_expr_charlen (expr);
6342 /* We don't need to copy data in some cases. */
6343 arg = gfc_get_noncopying_intrinsic_argument (expr);
6346 /* This is a call to transpose... */
6347 gcc_assert (expr->value.function.isym->id == GFC_ISYM_TRANSPOSE);
6348 /* ... which has already been handled by the scalarizer, so
6349 that we just need to get its argument's descriptor. */
6350 gfc_conv_expr_descriptor (se, expr->value.function.actual->expr, ss);
6354 /* A transformational function return value will be a temporary
6355 array descriptor. We still need to go through the scalarizer
6356 to create the descriptor. Elemental functions ar handled as
6357 arbitrary expressions, i.e. copy to a temporary. */
6359 if (se->direct_byref)
6361 gcc_assert (ss_type == GFC_SS_FUNCTION && ss_expr == expr);
6363 /* For pointer assignments pass the descriptor directly. */
6367 gcc_assert (se->ss == ss);
6368 se->expr = gfc_build_addr_expr (NULL_TREE, se->expr);
6369 gfc_conv_expr (se, expr);
6373 if (ss_expr != expr || ss_type != GFC_SS_FUNCTION)
6375 if (ss_expr != expr)
6376 /* Elemental function. */
6377 gcc_assert ((expr->value.function.esym != NULL
6378 && expr->value.function.esym->attr.elemental)
6379 || (expr->value.function.isym != NULL
6380 && expr->value.function.isym->elemental)
6381 || gfc_inline_intrinsic_function_p (expr));
6383 gcc_assert (ss_type == GFC_SS_INTRINSIC);
6386 if (expr->ts.type == BT_CHARACTER
6387 && expr->ts.u.cl->length->expr_type != EXPR_CONSTANT)
6388 get_array_charlen (expr, se);
6394 /* Transformational function. */
6395 info = &ss_info->data.array;
6401 /* Constant array constructors don't need a temporary. */
6402 if (ss_type == GFC_SS_CONSTRUCTOR
6403 && expr->ts.type != BT_CHARACTER
6404 && gfc_constant_array_constructor_p (expr->value.constructor))
6407 info = &ss_info->data.array;
6417 /* Something complicated. Copy it into a temporary. */
6423 /* If we are creating a temporary, we don't need to bother about aliases
6428 gfc_init_loopinfo (&loop);
6430 /* Associate the SS with the loop. */
6431 gfc_add_ss_to_loop (&loop, ss);
6433 /* Tell the scalarizer not to bother creating loop variables, etc. */
6435 loop.array_parameter = 1;
6437 /* The right-hand side of a pointer assignment mustn't use a temporary. */
6438 gcc_assert (!se->direct_byref);
6440 /* Setup the scalarizing loops and bounds. */
6441 gfc_conv_ss_startstride (&loop);
6445 if (expr->ts.type == BT_CHARACTER && !expr->ts.u.cl->backend_decl)
6446 get_array_charlen (expr, se);
6448 /* Tell the scalarizer to make a temporary. */
6449 loop.temp_ss = gfc_get_temp_ss (gfc_typenode_for_spec (&expr->ts),
6450 ((expr->ts.type == BT_CHARACTER)
6451 ? expr->ts.u.cl->backend_decl
6455 se->string_length = loop.temp_ss->info->string_length;
6456 gcc_assert (loop.temp_ss->dimen == loop.dimen);
6457 gfc_add_ss_to_loop (&loop, loop.temp_ss);
6460 gfc_conv_loop_setup (&loop, & expr->where);
6464 /* Copy into a temporary and pass that. We don't need to copy the data
6465 back because expressions and vector subscripts must be INTENT_IN. */
6466 /* TODO: Optimize passing function return values. */
6470 /* Start the copying loops. */
6471 gfc_mark_ss_chain_used (loop.temp_ss, 1);
6472 gfc_mark_ss_chain_used (ss, 1);
6473 gfc_start_scalarized_body (&loop, &block);
6475 /* Copy each data element. */
6476 gfc_init_se (&lse, NULL);
6477 gfc_copy_loopinfo_to_se (&lse, &loop);
6478 gfc_init_se (&rse, NULL);
6479 gfc_copy_loopinfo_to_se (&rse, &loop);
6481 lse.ss = loop.temp_ss;
6484 gfc_conv_scalarized_array_ref (&lse, NULL);
6485 if (expr->ts.type == BT_CHARACTER)
6487 gfc_conv_expr (&rse, expr);
6488 if (POINTER_TYPE_P (TREE_TYPE (rse.expr)))
6489 rse.expr = build_fold_indirect_ref_loc (input_location,
6493 gfc_conv_expr_val (&rse, expr);
6495 gfc_add_block_to_block (&block, &rse.pre);
6496 gfc_add_block_to_block (&block, &lse.pre);
6498 lse.string_length = rse.string_length;
6499 tmp = gfc_trans_scalar_assign (&lse, &rse, expr->ts, true,
6500 expr->expr_type == EXPR_VARIABLE
6501 || expr->expr_type == EXPR_ARRAY, true);
6502 gfc_add_expr_to_block (&block, tmp);
6504 /* Finish the copying loops. */
6505 gfc_trans_scalarizing_loops (&loop, &block);
6507 desc = loop.temp_ss->info->data.array.descriptor;
6509 else if (expr->expr_type == EXPR_FUNCTION && !transposed_dims (ss))
6511 desc = info->descriptor;
6512 se->string_length = ss_info->string_length;
6516 /* We pass sections without copying to a temporary. Make a new
6517 descriptor and point it at the section we want. The loop variable
6518 limits will be the limits of the section.
6519 A function may decide to repack the array to speed up access, but
6520 we're not bothered about that here. */
6521 int dim, ndim, codim;
6529 ndim = info->ref ? info->ref->u.ar.dimen : ss->dimen;
6531 if (se->want_coarray)
6533 gfc_array_ref *ar = &info->ref->u.ar;
6535 codim = gfc_get_corank (expr);
6536 for (n = 0; n < codim - 1; n++)
6538 /* Make sure we are not lost somehow. */
6539 gcc_assert (ar->dimen_type[n + ndim] == DIMEN_THIS_IMAGE);
6541 /* Make sure the call to gfc_conv_section_startstride won't
6542 generate unnecessary code to calculate stride. */
6543 gcc_assert (ar->stride[n + ndim] == NULL);
6545 gfc_conv_section_startstride (&loop, ss, n + ndim);
6546 loop.from[n + loop.dimen] = info->start[n + ndim];
6547 loop.to[n + loop.dimen] = info->end[n + ndim];
6550 gcc_assert (n == codim - 1);
6551 evaluate_bound (&loop.pre, info->start, ar->start,
6552 info->descriptor, n + ndim, true);
6553 loop.from[n + loop.dimen] = info->start[n + ndim];
6558 /* Set the string_length for a character array. */
6559 if (expr->ts.type == BT_CHARACTER)
6560 se->string_length = gfc_get_expr_charlen (expr);
6562 desc = info->descriptor;
6563 if (se->direct_byref && !se->byref_noassign)
6565 /* For pointer assignments we fill in the destination. */
6567 parmtype = TREE_TYPE (parm);
6571 /* Otherwise make a new one. */
6572 parmtype = gfc_get_element_type (TREE_TYPE (desc));
6573 parmtype = gfc_get_array_type_bounds (parmtype, loop.dimen, codim,
6574 loop.from, loop.to, 0,
6575 GFC_ARRAY_UNKNOWN, false);
6576 parm = gfc_create_var (parmtype, "parm");
6579 offset = gfc_index_zero_node;
6581 /* The following can be somewhat confusing. We have two
6582 descriptors, a new one and the original array.
6583 {parm, parmtype, dim} refer to the new one.
6584 {desc, type, n, loop} refer to the original, which maybe
6585 a descriptorless array.
6586 The bounds of the scalarization are the bounds of the section.
6587 We don't have to worry about numeric overflows when calculating
6588 the offsets because all elements are within the array data. */
6590 /* Set the dtype. */
6591 tmp = gfc_conv_descriptor_dtype (parm);
6592 gfc_add_modify (&loop.pre, tmp, gfc_get_dtype (parmtype));
6594 /* Set offset for assignments to pointer only to zero if it is not
6596 if (se->direct_byref
6597 && info->ref && info->ref->u.ar.type != AR_FULL)
6598 base = gfc_index_zero_node;
6599 else if (GFC_ARRAY_TYPE_P (TREE_TYPE (desc)))
6600 base = gfc_evaluate_now (gfc_conv_array_offset (desc), &loop.pre);
6604 for (n = 0; n < ndim; n++)
6606 stride = gfc_conv_array_stride (desc, n);
6608 /* Work out the offset. */
6610 && info->ref->u.ar.dimen_type[n] == DIMEN_ELEMENT)
6612 gcc_assert (info->subscript[n]
6613 && info->subscript[n]->info->type == GFC_SS_SCALAR);
6614 start = info->subscript[n]->info->data.scalar.value;
6618 /* Evaluate and remember the start of the section. */
6619 start = info->start[n];
6620 stride = gfc_evaluate_now (stride, &loop.pre);
6623 tmp = gfc_conv_array_lbound (desc, n);
6624 tmp = fold_build2_loc (input_location, MINUS_EXPR, TREE_TYPE (tmp),
6626 tmp = fold_build2_loc (input_location, MULT_EXPR, TREE_TYPE (tmp),
6628 offset = fold_build2_loc (input_location, PLUS_EXPR, TREE_TYPE (tmp),
6632 && info->ref->u.ar.dimen_type[n] == DIMEN_ELEMENT)
6634 /* For elemental dimensions, we only need the offset. */
6638 /* Vector subscripts need copying and are handled elsewhere. */
6640 gcc_assert (info->ref->u.ar.dimen_type[n] == DIMEN_RANGE);
6642 /* look for the corresponding scalarizer dimension: dim. */
6643 for (dim = 0; dim < ndim; dim++)
6644 if (ss->dim[dim] == n)
6647 /* loop exited early: the DIM being looked for has been found. */
6648 gcc_assert (dim < ndim);
6650 /* Set the new lower bound. */
6651 from = loop.from[dim];
6654 /* If we have an array section or are assigning make sure that
6655 the lower bound is 1. References to the full
6656 array should otherwise keep the original bounds. */
6658 || info->ref->u.ar.type != AR_FULL)
6659 && !integer_onep (from))
6661 tmp = fold_build2_loc (input_location, MINUS_EXPR,
6662 gfc_array_index_type, gfc_index_one_node,
6664 to = fold_build2_loc (input_location, PLUS_EXPR,
6665 gfc_array_index_type, to, tmp);
6666 from = gfc_index_one_node;
6668 gfc_conv_descriptor_lbound_set (&loop.pre, parm,
6669 gfc_rank_cst[dim], from);
6671 /* Set the new upper bound. */
6672 gfc_conv_descriptor_ubound_set (&loop.pre, parm,
6673 gfc_rank_cst[dim], to);
6675 /* Multiply the stride by the section stride to get the
6677 stride = fold_build2_loc (input_location, MULT_EXPR,
6678 gfc_array_index_type,
6679 stride, info->stride[n]);
6681 if (se->direct_byref
6683 && info->ref->u.ar.type != AR_FULL)
6685 base = fold_build2_loc (input_location, MINUS_EXPR,
6686 TREE_TYPE (base), base, stride);
6688 else if (GFC_ARRAY_TYPE_P (TREE_TYPE (desc)))
6690 tmp = gfc_conv_array_lbound (desc, n);
6691 tmp = fold_build2_loc (input_location, MINUS_EXPR,
6692 TREE_TYPE (base), tmp, loop.from[dim]);
6693 tmp = fold_build2_loc (input_location, MULT_EXPR,
6694 TREE_TYPE (base), tmp,
6695 gfc_conv_array_stride (desc, n));
6696 base = fold_build2_loc (input_location, PLUS_EXPR,
6697 TREE_TYPE (base), tmp, base);
6700 /* Store the new stride. */
6701 gfc_conv_descriptor_stride_set (&loop.pre, parm,
6702 gfc_rank_cst[dim], stride);
6705 for (n = loop.dimen; n < loop.dimen + codim; n++)
6707 from = loop.from[n];
6709 gfc_conv_descriptor_lbound_set (&loop.pre, parm,
6710 gfc_rank_cst[n], from);
6711 if (n < loop.dimen + codim - 1)
6712 gfc_conv_descriptor_ubound_set (&loop.pre, parm,
6713 gfc_rank_cst[n], to);
6716 if (se->data_not_needed)
6717 gfc_conv_descriptor_data_set (&loop.pre, parm,
6718 gfc_index_zero_node);
6720 /* Point the data pointer at the 1st element in the section. */
6721 gfc_get_dataptr_offset (&loop.pre, parm, desc, offset,
6722 subref_array_target, expr);
6724 if ((se->direct_byref || GFC_ARRAY_TYPE_P (TREE_TYPE (desc)))
6725 && !se->data_not_needed)
6727 /* Set the offset. */
6728 gfc_conv_descriptor_offset_set (&loop.pre, parm, base);
6732 /* Only the callee knows what the correct offset it, so just set
6734 gfc_conv_descriptor_offset_set (&loop.pre, parm, gfc_index_zero_node);
6739 if (!se->direct_byref || se->byref_noassign)
6741 /* Get a pointer to the new descriptor. */
6742 if (se->want_pointer)
6743 se->expr = gfc_build_addr_expr (NULL_TREE, desc);
6748 gfc_add_block_to_block (&se->pre, &loop.pre);
6749 gfc_add_block_to_block (&se->post, &loop.post);
6751 /* Cleanup the scalarizer. */
6752 gfc_cleanup_loop (&loop);
6755 /* Helper function for gfc_conv_array_parameter if array size needs to be
6759 array_parameter_size (tree desc, gfc_expr *expr, tree *size)
6762 if (GFC_ARRAY_TYPE_P (TREE_TYPE (desc)))
6763 *size = GFC_TYPE_ARRAY_SIZE (TREE_TYPE (desc));
6764 else if (expr->rank > 1)
6765 *size = build_call_expr_loc (input_location,
6766 gfor_fndecl_size0, 1,
6767 gfc_build_addr_expr (NULL, desc));
6770 tree ubound = gfc_conv_descriptor_ubound_get (desc, gfc_index_zero_node);
6771 tree lbound = gfc_conv_descriptor_lbound_get (desc, gfc_index_zero_node);
6773 *size = fold_build2_loc (input_location, MINUS_EXPR,
6774 gfc_array_index_type, ubound, lbound);
6775 *size = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
6776 *size, gfc_index_one_node);
6777 *size = fold_build2_loc (input_location, MAX_EXPR, gfc_array_index_type,
6778 *size, gfc_index_zero_node);
6780 elem = TYPE_SIZE_UNIT (gfc_get_element_type (TREE_TYPE (desc)));
6781 *size = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
6782 *size, fold_convert (gfc_array_index_type, elem));
6785 /* Convert an array for passing as an actual parameter. */
6786 /* TODO: Optimize passing g77 arrays. */
6789 gfc_conv_array_parameter (gfc_se * se, gfc_expr * expr, gfc_ss * ss, bool g77,
6790 const gfc_symbol *fsym, const char *proc_name,
6795 tree tmp = NULL_TREE;
6797 tree parent = DECL_CONTEXT (current_function_decl);
6798 bool full_array_var;
6799 bool this_array_result;
6802 bool array_constructor;
6803 bool good_allocatable;
6804 bool ultimate_ptr_comp;
6805 bool ultimate_alloc_comp;
6810 ultimate_ptr_comp = false;
6811 ultimate_alloc_comp = false;
6813 for (ref = expr->ref; ref; ref = ref->next)
6815 if (ref->next == NULL)
6818 if (ref->type == REF_COMPONENT)
6820 ultimate_ptr_comp = ref->u.c.component->attr.pointer;
6821 ultimate_alloc_comp = ref->u.c.component->attr.allocatable;
6825 full_array_var = false;
6828 if (expr->expr_type == EXPR_VARIABLE && ref && !ultimate_ptr_comp)
6829 full_array_var = gfc_full_array_ref_p (ref, &contiguous);
6831 sym = full_array_var ? expr->symtree->n.sym : NULL;
6833 /* The symbol should have an array specification. */
6834 gcc_assert (!sym || sym->as || ref->u.ar.as);
6836 if (expr->expr_type == EXPR_ARRAY && expr->ts.type == BT_CHARACTER)
6838 get_array_ctor_strlen (&se->pre, expr->value.constructor, &tmp);
6839 expr->ts.u.cl->backend_decl = tmp;
6840 se->string_length = tmp;
6843 /* Is this the result of the enclosing procedure? */
6844 this_array_result = (full_array_var && sym->attr.flavor == FL_PROCEDURE);
6845 if (this_array_result
6846 && (sym->backend_decl != current_function_decl)
6847 && (sym->backend_decl != parent))
6848 this_array_result = false;
6850 /* Passing address of the array if it is not pointer or assumed-shape. */
6851 if (full_array_var && g77 && !this_array_result)
6853 tmp = gfc_get_symbol_decl (sym);
6855 if (sym->ts.type == BT_CHARACTER)
6856 se->string_length = sym->ts.u.cl->backend_decl;
6858 if (sym->ts.type == BT_DERIVED || sym->ts.type == BT_CLASS)
6860 gfc_conv_expr_descriptor (se, expr, ss);
6861 se->expr = gfc_conv_array_data (se->expr);
6865 if (!sym->attr.pointer
6867 && sym->as->type != AS_ASSUMED_SHAPE
6868 && !sym->attr.allocatable)
6870 /* Some variables are declared directly, others are declared as
6871 pointers and allocated on the heap. */
6872 if (sym->attr.dummy || POINTER_TYPE_P (TREE_TYPE (tmp)))
6875 se->expr = gfc_build_addr_expr (NULL_TREE, tmp);
6877 array_parameter_size (tmp, expr, size);
6881 if (sym->attr.allocatable)
6883 if (sym->attr.dummy || sym->attr.result)
6885 gfc_conv_expr_descriptor (se, expr, ss);
6889 array_parameter_size (tmp, expr, size);
6890 se->expr = gfc_conv_array_data (tmp);
6895 /* A convenient reduction in scope. */
6896 contiguous = g77 && !this_array_result && contiguous;
6898 /* There is no need to pack and unpack the array, if it is contiguous
6899 and not a deferred- or assumed-shape array, or if it is simply
6901 no_pack = ((sym && sym->as
6902 && !sym->attr.pointer
6903 && sym->as->type != AS_DEFERRED
6904 && sym->as->type != AS_ASSUMED_SHAPE)
6906 (ref && ref->u.ar.as
6907 && ref->u.ar.as->type != AS_DEFERRED
6908 && ref->u.ar.as->type != AS_ASSUMED_SHAPE)
6910 gfc_is_simply_contiguous (expr, false));
6912 no_pack = contiguous && no_pack;
6914 /* Array constructors are always contiguous and do not need packing. */
6915 array_constructor = g77 && !this_array_result && expr->expr_type == EXPR_ARRAY;
6917 /* Same is true of contiguous sections from allocatable variables. */
6918 good_allocatable = contiguous
6920 && expr->symtree->n.sym->attr.allocatable;
6922 /* Or ultimate allocatable components. */
6923 ultimate_alloc_comp = contiguous && ultimate_alloc_comp;
6925 if (no_pack || array_constructor || good_allocatable || ultimate_alloc_comp)
6927 gfc_conv_expr_descriptor (se, expr, ss);
6928 if (expr->ts.type == BT_CHARACTER)
6929 se->string_length = expr->ts.u.cl->backend_decl;
6931 array_parameter_size (se->expr, expr, size);
6932 se->expr = gfc_conv_array_data (se->expr);
6936 if (this_array_result)
6938 /* Result of the enclosing function. */
6939 gfc_conv_expr_descriptor (se, expr, ss);
6941 array_parameter_size (se->expr, expr, size);
6942 se->expr = gfc_build_addr_expr (NULL_TREE, se->expr);
6944 if (g77 && TREE_TYPE (TREE_TYPE (se->expr)) != NULL_TREE
6945 && GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (TREE_TYPE (se->expr))))
6946 se->expr = gfc_conv_array_data (build_fold_indirect_ref_loc (input_location,
6953 /* Every other type of array. */
6954 se->want_pointer = 1;
6955 gfc_conv_expr_descriptor (se, expr, ss);
6957 array_parameter_size (build_fold_indirect_ref_loc (input_location,
6962 /* Deallocate the allocatable components of structures that are
6964 if ((expr->ts.type == BT_DERIVED || expr->ts.type == BT_CLASS)
6965 && expr->ts.u.derived->attr.alloc_comp
6966 && expr->expr_type != EXPR_VARIABLE)
6968 tmp = build_fold_indirect_ref_loc (input_location, se->expr);
6969 tmp = gfc_deallocate_alloc_comp (expr->ts.u.derived, tmp, expr->rank);
6971 /* The components shall be deallocated before their containing entity. */
6972 gfc_prepend_expr_to_block (&se->post, tmp);
6975 if (g77 || (fsym && fsym->attr.contiguous
6976 && !gfc_is_simply_contiguous (expr, false)))
6978 tree origptr = NULL_TREE;
6982 /* For contiguous arrays, save the original value of the descriptor. */
6985 origptr = gfc_create_var (pvoid_type_node, "origptr");
6986 tmp = build_fold_indirect_ref_loc (input_location, desc);
6987 tmp = gfc_conv_array_data (tmp);
6988 tmp = fold_build2_loc (input_location, MODIFY_EXPR,
6989 TREE_TYPE (origptr), origptr,
6990 fold_convert (TREE_TYPE (origptr), tmp));
6991 gfc_add_expr_to_block (&se->pre, tmp);
6994 /* Repack the array. */
6995 if (gfc_option.warn_array_temp)
6998 gfc_warning ("Creating array temporary at %L for argument '%s'",
6999 &expr->where, fsym->name);
7001 gfc_warning ("Creating array temporary at %L", &expr->where);
7004 ptr = build_call_expr_loc (input_location,
7005 gfor_fndecl_in_pack, 1, desc);
7007 if (fsym && fsym->attr.optional && sym && sym->attr.optional)
7009 tmp = gfc_conv_expr_present (sym);
7010 ptr = build3_loc (input_location, COND_EXPR, TREE_TYPE (se->expr),
7011 tmp, fold_convert (TREE_TYPE (se->expr), ptr),
7012 fold_convert (TREE_TYPE (se->expr), null_pointer_node));
7015 ptr = gfc_evaluate_now (ptr, &se->pre);
7017 /* Use the packed data for the actual argument, except for contiguous arrays,
7018 where the descriptor's data component is set. */
7023 tmp = build_fold_indirect_ref_loc (input_location, desc);
7024 gfc_conv_descriptor_data_set (&se->pre, tmp, ptr);
7027 if (gfc_option.rtcheck & GFC_RTCHECK_ARRAY_TEMPS)
7031 if (fsym && proc_name)
7032 asprintf (&msg, "An array temporary was created for argument "
7033 "'%s' of procedure '%s'", fsym->name, proc_name);
7035 asprintf (&msg, "An array temporary was created");
7037 tmp = build_fold_indirect_ref_loc (input_location,
7039 tmp = gfc_conv_array_data (tmp);
7040 tmp = fold_build2_loc (input_location, NE_EXPR, boolean_type_node,
7041 fold_convert (TREE_TYPE (tmp), ptr), tmp);
7043 if (fsym && fsym->attr.optional && sym && sym->attr.optional)
7044 tmp = fold_build2_loc (input_location, TRUTH_AND_EXPR,
7046 gfc_conv_expr_present (sym), tmp);
7048 gfc_trans_runtime_check (false, true, tmp, &se->pre,
7053 gfc_start_block (&block);
7055 /* Copy the data back. */
7056 if (fsym == NULL || fsym->attr.intent != INTENT_IN)
7058 tmp = build_call_expr_loc (input_location,
7059 gfor_fndecl_in_unpack, 2, desc, ptr);
7060 gfc_add_expr_to_block (&block, tmp);
7063 /* Free the temporary. */
7064 tmp = gfc_call_free (convert (pvoid_type_node, ptr));
7065 gfc_add_expr_to_block (&block, tmp);
7067 stmt = gfc_finish_block (&block);
7069 gfc_init_block (&block);
7070 /* Only if it was repacked. This code needs to be executed before the
7071 loop cleanup code. */
7072 tmp = build_fold_indirect_ref_loc (input_location,
7074 tmp = gfc_conv_array_data (tmp);
7075 tmp = fold_build2_loc (input_location, NE_EXPR, boolean_type_node,
7076 fold_convert (TREE_TYPE (tmp), ptr), tmp);
7078 if (fsym && fsym->attr.optional && sym && sym->attr.optional)
7079 tmp = fold_build2_loc (input_location, TRUTH_AND_EXPR,
7081 gfc_conv_expr_present (sym), tmp);
7083 tmp = build3_v (COND_EXPR, tmp, stmt, build_empty_stmt (input_location));
7085 gfc_add_expr_to_block (&block, tmp);
7086 gfc_add_block_to_block (&block, &se->post);
7088 gfc_init_block (&se->post);
7090 /* Reset the descriptor pointer. */
7093 tmp = build_fold_indirect_ref_loc (input_location, desc);
7094 gfc_conv_descriptor_data_set (&se->post, tmp, origptr);
7097 gfc_add_block_to_block (&se->post, &block);
7102 /* Generate code to deallocate an array, if it is allocated. */
7105 gfc_trans_dealloc_allocated (tree descriptor, bool coarray)
7111 gfc_start_block (&block);
7113 var = gfc_conv_descriptor_data_get (descriptor);
7116 /* Call array_deallocate with an int * present in the second argument.
7117 Although it is ignored here, it's presence ensures that arrays that
7118 are already deallocated are ignored. */
7119 tmp = gfc_deallocate_with_status (coarray ? descriptor : var, NULL_TREE,
7120 NULL_TREE, NULL_TREE, NULL_TREE, true,
7122 gfc_add_expr_to_block (&block, tmp);
7124 /* Zero the data pointer. */
7125 tmp = fold_build2_loc (input_location, MODIFY_EXPR, void_type_node,
7126 var, build_int_cst (TREE_TYPE (var), 0));
7127 gfc_add_expr_to_block (&block, tmp);
7129 return gfc_finish_block (&block);
7133 /* This helper function calculates the size in words of a full array. */
7136 get_full_array_size (stmtblock_t *block, tree decl, int rank)
7141 idx = gfc_rank_cst[rank - 1];
7142 nelems = gfc_conv_descriptor_ubound_get (decl, idx);
7143 tmp = gfc_conv_descriptor_lbound_get (decl, idx);
7144 tmp = fold_build2_loc (input_location, MINUS_EXPR, gfc_array_index_type,
7146 tmp = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
7147 tmp, gfc_index_one_node);
7148 tmp = gfc_evaluate_now (tmp, block);
7150 nelems = gfc_conv_descriptor_stride_get (decl, idx);
7151 tmp = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
7153 return gfc_evaluate_now (tmp, block);
7157 /* Allocate dest to the same size as src, and copy src -> dest.
7158 If no_malloc is set, only the copy is done. */
7161 duplicate_allocatable (tree dest, tree src, tree type, int rank,
7171 /* If the source is null, set the destination to null. Then,
7172 allocate memory to the destination. */
7173 gfc_init_block (&block);
7177 tmp = null_pointer_node;
7178 tmp = fold_build2_loc (input_location, MODIFY_EXPR, type, dest, tmp);
7179 gfc_add_expr_to_block (&block, tmp);
7180 null_data = gfc_finish_block (&block);
7182 gfc_init_block (&block);
7183 size = TYPE_SIZE_UNIT (TREE_TYPE (type));
7186 tmp = gfc_call_malloc (&block, type, size);
7187 tmp = fold_build2_loc (input_location, MODIFY_EXPR, void_type_node,
7188 dest, fold_convert (type, tmp));
7189 gfc_add_expr_to_block (&block, tmp);
7192 tmp = builtin_decl_explicit (BUILT_IN_MEMCPY);
7193 tmp = build_call_expr_loc (input_location, tmp, 3,
7198 gfc_conv_descriptor_data_set (&block, dest, null_pointer_node);
7199 null_data = gfc_finish_block (&block);
7201 gfc_init_block (&block);
7202 nelems = get_full_array_size (&block, src, rank);
7203 tmp = fold_convert (gfc_array_index_type,
7204 TYPE_SIZE_UNIT (gfc_get_element_type (type)));
7205 size = fold_build2_loc (input_location, MULT_EXPR, gfc_array_index_type,
7209 tmp = TREE_TYPE (gfc_conv_descriptor_data_get (src));
7210 tmp = gfc_call_malloc (&block, tmp, size);
7211 gfc_conv_descriptor_data_set (&block, dest, tmp);
7214 /* We know the temporary and the value will be the same length,
7215 so can use memcpy. */
7216 tmp = builtin_decl_explicit (BUILT_IN_MEMCPY);
7217 tmp = build_call_expr_loc (input_location,
7218 tmp, 3, gfc_conv_descriptor_data_get (dest),
7219 gfc_conv_descriptor_data_get (src), size);
7222 gfc_add_expr_to_block (&block, tmp);
7223 tmp = gfc_finish_block (&block);
7225 /* Null the destination if the source is null; otherwise do
7226 the allocate and copy. */
7230 null_cond = gfc_conv_descriptor_data_get (src);
7232 null_cond = convert (pvoid_type_node, null_cond);
7233 null_cond = fold_build2_loc (input_location, NE_EXPR, boolean_type_node,
7234 null_cond, null_pointer_node);
7235 return build3_v (COND_EXPR, null_cond, tmp, null_data);
7239 /* Allocate dest to the same size as src, and copy data src -> dest. */
7242 gfc_duplicate_allocatable (tree dest, tree src, tree type, int rank)
7244 return duplicate_allocatable (dest, src, type, rank, false);
7248 /* Copy data src -> dest. */
7251 gfc_copy_allocatable_data (tree dest, tree src, tree type, int rank)
7253 return duplicate_allocatable (dest, src, type, rank, true);
7257 /* Recursively traverse an object of derived type, generating code to
7258 deallocate, nullify or copy allocatable components. This is the work horse
7259 function for the functions named in this enum. */
7261 enum {DEALLOCATE_ALLOC_COMP = 1, NULLIFY_ALLOC_COMP, COPY_ALLOC_COMP,
7262 COPY_ONLY_ALLOC_COMP};
7265 structure_alloc_comps (gfc_symbol * der_type, tree decl,
7266 tree dest, int rank, int purpose)
7270 stmtblock_t fnblock;
7271 stmtblock_t loopbody;
7272 stmtblock_t tmpblock;
7283 tree null_cond = NULL_TREE;
7284 bool called_dealloc_with_status;
7286 gfc_init_block (&fnblock);
7288 decl_type = TREE_TYPE (decl);
7290 if ((POINTER_TYPE_P (decl_type) && rank != 0)
7291 || (TREE_CODE (decl_type) == REFERENCE_TYPE && rank == 0))
7293 decl = build_fold_indirect_ref_loc (input_location,
7296 /* Just in case in gets dereferenced. */
7297 decl_type = TREE_TYPE (decl);
7299 /* If this an array of derived types with allocatable components
7300 build a loop and recursively call this function. */
7301 if (TREE_CODE (decl_type) == ARRAY_TYPE
7302 || GFC_DESCRIPTOR_TYPE_P (decl_type))
7304 tmp = gfc_conv_array_data (decl);
7305 var = build_fold_indirect_ref_loc (input_location,
7308 /* Get the number of elements - 1 and set the counter. */
7309 if (GFC_DESCRIPTOR_TYPE_P (decl_type))
7311 /* Use the descriptor for an allocatable array. Since this
7312 is a full array reference, we only need the descriptor
7313 information from dimension = rank. */
7314 tmp = get_full_array_size (&fnblock, decl, rank);
7315 tmp = fold_build2_loc (input_location, MINUS_EXPR,
7316 gfc_array_index_type, tmp,
7317 gfc_index_one_node);
7319 null_cond = gfc_conv_descriptor_data_get (decl);
7320 null_cond = fold_build2_loc (input_location, NE_EXPR,
7321 boolean_type_node, null_cond,
7322 build_int_cst (TREE_TYPE (null_cond), 0));
7326 /* Otherwise use the TYPE_DOMAIN information. */
7327 tmp = array_type_nelts (decl_type);
7328 tmp = fold_convert (gfc_array_index_type, tmp);
7331 /* Remember that this is, in fact, the no. of elements - 1. */
7332 nelems = gfc_evaluate_now (tmp, &fnblock);
7333 index = gfc_create_var (gfc_array_index_type, "S");
7335 /* Build the body of the loop. */
7336 gfc_init_block (&loopbody);
7338 vref = gfc_build_array_ref (var, index, NULL);
7340 if (purpose == COPY_ALLOC_COMP)
7342 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (dest)))
7344 tmp = gfc_duplicate_allocatable (dest, decl, decl_type, rank);
7345 gfc_add_expr_to_block (&fnblock, tmp);
7347 tmp = build_fold_indirect_ref_loc (input_location,
7348 gfc_conv_array_data (dest));
7349 dref = gfc_build_array_ref (tmp, index, NULL);
7350 tmp = structure_alloc_comps (der_type, vref, dref, rank, purpose);
7352 else if (purpose == COPY_ONLY_ALLOC_COMP)
7354 tmp = build_fold_indirect_ref_loc (input_location,
7355 gfc_conv_array_data (dest));
7356 dref = gfc_build_array_ref (tmp, index, NULL);
7357 tmp = structure_alloc_comps (der_type, vref, dref, rank,
7361 tmp = structure_alloc_comps (der_type, vref, NULL_TREE, rank, purpose);
7363 gfc_add_expr_to_block (&loopbody, tmp);
7365 /* Build the loop and return. */
7366 gfc_init_loopinfo (&loop);
7368 loop.from[0] = gfc_index_zero_node;
7369 loop.loopvar[0] = index;
7370 loop.to[0] = nelems;
7371 gfc_trans_scalarizing_loops (&loop, &loopbody);
7372 gfc_add_block_to_block (&fnblock, &loop.pre);
7374 tmp = gfc_finish_block (&fnblock);
7375 if (null_cond != NULL_TREE)
7376 tmp = build3_v (COND_EXPR, null_cond, tmp,
7377 build_empty_stmt (input_location));
7382 /* Otherwise, act on the components or recursively call self to
7383 act on a chain of components. */
7384 for (c = der_type->components; c; c = c->next)
7386 bool cmp_has_alloc_comps = (c->ts.type == BT_DERIVED
7387 || c->ts.type == BT_CLASS)
7388 && c->ts.u.derived->attr.alloc_comp;
7389 cdecl = c->backend_decl;
7390 ctype = TREE_TYPE (cdecl);
7394 case DEALLOCATE_ALLOC_COMP:
7396 /* gfc_deallocate_scalar_with_status calls gfc_deallocate_alloc_comp
7397 (ie. this function) so generate all the calls and suppress the
7398 recursion from here, if necessary. */
7399 called_dealloc_with_status = false;
7400 gfc_init_block (&tmpblock);
7402 if (c->attr.allocatable
7403 && (c->attr.dimension || c->attr.codimension))
7405 comp = fold_build3_loc (input_location, COMPONENT_REF, ctype,
7406 decl, cdecl, NULL_TREE);
7407 tmp = gfc_trans_dealloc_allocated (comp, c->attr.codimension);
7408 gfc_add_expr_to_block (&tmpblock, tmp);
7410 else if (c->attr.allocatable)
7412 /* Allocatable scalar components. */
7413 comp = fold_build3_loc (input_location, COMPONENT_REF, ctype,
7414 decl, cdecl, NULL_TREE);
7416 tmp = gfc_deallocate_scalar_with_status (comp, NULL, true, NULL,
7418 gfc_add_expr_to_block (&tmpblock, tmp);
7419 called_dealloc_with_status = true;
7421 tmp = fold_build2_loc (input_location, MODIFY_EXPR,
7422 void_type_node, comp,
7423 build_int_cst (TREE_TYPE (comp), 0));
7424 gfc_add_expr_to_block (&tmpblock, tmp);
7426 else if (c->ts.type == BT_CLASS && CLASS_DATA (c)->attr.allocatable)
7428 /* Allocatable CLASS components. */
7429 comp = fold_build3_loc (input_location, COMPONENT_REF, ctype,
7430 decl, cdecl, NULL_TREE);
7432 /* Add reference to '_data' component. */
7433 tmp = CLASS_DATA (c)->backend_decl;
7434 comp = fold_build3_loc (input_location, COMPONENT_REF,
7435 TREE_TYPE (tmp), comp, tmp, NULL_TREE);
7437 if (GFC_DESCRIPTOR_TYPE_P(TREE_TYPE (comp)))
7438 tmp = gfc_trans_dealloc_allocated (comp,
7439 CLASS_DATA (c)->attr.codimension);
7442 tmp = gfc_deallocate_scalar_with_status (comp, NULL, true, NULL,
7443 CLASS_DATA (c)->ts);
7444 gfc_add_expr_to_block (&tmpblock, tmp);
7445 called_dealloc_with_status = true;
7447 tmp = fold_build2_loc (input_location, MODIFY_EXPR,
7448 void_type_node, comp,
7449 build_int_cst (TREE_TYPE (comp), 0));
7451 gfc_add_expr_to_block (&tmpblock, tmp);
7454 if (cmp_has_alloc_comps
7456 && !called_dealloc_with_status)
7458 /* Do not deallocate the components of ultimate pointer
7459 components or iteratively call self if call has been made
7460 to gfc_trans_dealloc_allocated */
7461 comp = fold_build3_loc (input_location, COMPONENT_REF, ctype,
7462 decl, cdecl, NULL_TREE);
7463 rank = c->as ? c->as->rank : 0;
7464 tmp = structure_alloc_comps (c->ts.u.derived, comp, NULL_TREE,
7466 gfc_add_expr_to_block (&fnblock, tmp);
7469 /* Now add the deallocation of this component. */
7470 gfc_add_block_to_block (&fnblock, &tmpblock);
7473 case NULLIFY_ALLOC_COMP:
7474 if (c->attr.pointer)
7476 else if (c->attr.allocatable
7477 && (c->attr.dimension|| c->attr.codimension))
7479 comp = fold_build3_loc (input_location, COMPONENT_REF, ctype,
7480 decl, cdecl, NULL_TREE);
7481 gfc_conv_descriptor_data_set (&fnblock, comp, null_pointer_node);
7483 else if (c->attr.allocatable)
7485 /* Allocatable scalar components. */
7486 comp = fold_build3_loc (input_location, COMPONENT_REF, ctype,
7487 decl, cdecl, NULL_TREE);
7488 tmp = fold_build2_loc (input_location, MODIFY_EXPR,
7489 void_type_node, comp,
7490 build_int_cst (TREE_TYPE (comp), 0));
7491 gfc_add_expr_to_block (&fnblock, tmp);
7493 else if (c->ts.type == BT_CLASS && CLASS_DATA (c)->attr.allocatable)
7495 /* Allocatable CLASS components. */
7496 comp = fold_build3_loc (input_location, COMPONENT_REF, ctype,
7497 decl, cdecl, NULL_TREE);
7498 /* Add reference to '_data' component. */
7499 tmp = CLASS_DATA (c)->backend_decl;
7500 comp = fold_build3_loc (input_location, COMPONENT_REF,
7501 TREE_TYPE (tmp), comp, tmp, NULL_TREE);
7502 if (GFC_DESCRIPTOR_TYPE_P(TREE_TYPE (comp)))
7503 gfc_conv_descriptor_data_set (&fnblock, comp, null_pointer_node);
7506 tmp = fold_build2_loc (input_location, MODIFY_EXPR,
7507 void_type_node, comp,
7508 build_int_cst (TREE_TYPE (comp), 0));
7509 gfc_add_expr_to_block (&fnblock, tmp);
7512 else if (cmp_has_alloc_comps)
7514 comp = fold_build3_loc (input_location, COMPONENT_REF, ctype,
7515 decl, cdecl, NULL_TREE);
7516 rank = c->as ? c->as->rank : 0;
7517 tmp = structure_alloc_comps (c->ts.u.derived, comp, NULL_TREE,
7519 gfc_add_expr_to_block (&fnblock, tmp);
7523 case COPY_ALLOC_COMP:
7524 if (c->attr.pointer)
7527 /* We need source and destination components. */
7528 comp = fold_build3_loc (input_location, COMPONENT_REF, ctype, decl,
7530 dcmp = fold_build3_loc (input_location, COMPONENT_REF, ctype, dest,
7532 dcmp = fold_convert (TREE_TYPE (comp), dcmp);
7534 if (c->ts.type == BT_CLASS && CLASS_DATA (c)->attr.allocatable)
7542 dst_data = gfc_class_data_get (dcmp);
7543 src_data = gfc_class_data_get (comp);
7544 size = fold_convert (size_type_node, gfc_vtable_size_get (comp));
7546 if (CLASS_DATA (c)->attr.dimension)
7548 nelems = gfc_conv_descriptor_size (src_data,
7549 CLASS_DATA (c)->as->rank);
7550 src_data = gfc_conv_descriptor_data_get (src_data);
7551 dst_data = gfc_conv_descriptor_data_get (dst_data);
7554 nelems = build_int_cst (size_type_node, 1);
7556 gfc_init_block (&tmpblock);
7558 /* We need to use CALLOC as _copy might try to free allocatable
7559 components of the destination. */
7560 ftn_tree = builtin_decl_explicit (BUILT_IN_CALLOC);
7561 tmp = build_call_expr_loc (input_location, ftn_tree, 2, nelems,
7563 gfc_add_modify (&tmpblock, dst_data,
7564 fold_convert (TREE_TYPE (dst_data), tmp));
7566 tmp = gfc_copy_class_to_class (comp, dcmp, nelems);
7567 gfc_add_expr_to_block (&tmpblock, tmp);
7568 tmp = gfc_finish_block (&tmpblock);
7570 gfc_init_block (&tmpblock);
7571 gfc_add_modify (&tmpblock, dst_data,
7572 fold_convert (TREE_TYPE (dst_data),
7573 null_pointer_node));
7574 null_data = gfc_finish_block (&tmpblock);
7576 null_cond = fold_build2_loc (input_location, NE_EXPR,
7577 boolean_type_node, src_data,
7580 gfc_add_expr_to_block (&fnblock, build3_v (COND_EXPR, null_cond,
7585 if (c->attr.allocatable && !cmp_has_alloc_comps)
7587 rank = c->as ? c->as->rank : 0;
7588 tmp = gfc_duplicate_allocatable (dcmp, comp, ctype, rank);
7589 gfc_add_expr_to_block (&fnblock, tmp);
7592 if (cmp_has_alloc_comps)
7594 rank = c->as ? c->as->rank : 0;
7595 tmp = fold_convert (TREE_TYPE (dcmp), comp);
7596 gfc_add_modify (&fnblock, dcmp, tmp);
7597 tmp = structure_alloc_comps (c->ts.u.derived, comp, dcmp,
7599 gfc_add_expr_to_block (&fnblock, tmp);
7609 return gfc_finish_block (&fnblock);
7612 /* Recursively traverse an object of derived type, generating code to
7613 nullify allocatable components. */
7616 gfc_nullify_alloc_comp (gfc_symbol * der_type, tree decl, int rank)
7618 return structure_alloc_comps (der_type, decl, NULL_TREE, rank,
7619 NULLIFY_ALLOC_COMP);
7623 /* Recursively traverse an object of derived type, generating code to
7624 deallocate allocatable components. */
7627 gfc_deallocate_alloc_comp (gfc_symbol * der_type, tree decl, int rank)
7629 return structure_alloc_comps (der_type, decl, NULL_TREE, rank,
7630 DEALLOCATE_ALLOC_COMP);
7634 /* Recursively traverse an object of derived type, generating code to
7635 copy it and its allocatable components. */
7638 gfc_copy_alloc_comp (gfc_symbol * der_type, tree decl, tree dest, int rank)
7640 return structure_alloc_comps (der_type, decl, dest, rank, COPY_ALLOC_COMP);
7644 /* Recursively traverse an object of derived type, generating code to
7645 copy only its allocatable components. */
7648 gfc_copy_only_alloc_comp (gfc_symbol * der_type, tree decl, tree dest, int rank)
7650 return structure_alloc_comps (der_type, decl, dest, rank, COPY_ONLY_ALLOC_COMP);
7654 /* Returns the value of LBOUND for an expression. This could be broken out
7655 from gfc_conv_intrinsic_bound but this seemed to be simpler. This is
7656 called by gfc_alloc_allocatable_for_assignment. */
7658 get_std_lbound (gfc_expr *expr, tree desc, int dim, bool assumed_size)
7663 tree cond, cond1, cond3, cond4;
7667 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (desc)))
7669 tmp = gfc_rank_cst[dim];
7670 lbound = gfc_conv_descriptor_lbound_get (desc, tmp);
7671 ubound = gfc_conv_descriptor_ubound_get (desc, tmp);
7672 stride = gfc_conv_descriptor_stride_get (desc, tmp);
7673 cond1 = fold_build2_loc (input_location, GE_EXPR, boolean_type_node,
7675 cond3 = fold_build2_loc (input_location, GE_EXPR, boolean_type_node,
7676 stride, gfc_index_zero_node);
7677 cond3 = fold_build2_loc (input_location, TRUTH_AND_EXPR,
7678 boolean_type_node, cond3, cond1);
7679 cond4 = fold_build2_loc (input_location, LT_EXPR, boolean_type_node,
7680 stride, gfc_index_zero_node);
7682 cond = fold_build2_loc (input_location, EQ_EXPR, boolean_type_node,
7683 tmp, build_int_cst (gfc_array_index_type,
7686 cond = boolean_false_node;
7688 cond1 = fold_build2_loc (input_location, TRUTH_OR_EXPR,
7689 boolean_type_node, cond3, cond4);
7690 cond = fold_build2_loc (input_location, TRUTH_OR_EXPR,
7691 boolean_type_node, cond, cond1);
7693 return fold_build3_loc (input_location, COND_EXPR,
7694 gfc_array_index_type, cond,
7695 lbound, gfc_index_one_node);
7698 if (expr->expr_type == EXPR_FUNCTION)
7700 /* A conversion function, so use the argument. */
7701 gcc_assert (expr->value.function.isym
7702 && expr->value.function.isym->conversion);
7703 expr = expr->value.function.actual->expr;
7706 if (expr->expr_type == EXPR_VARIABLE)
7708 tmp = TREE_TYPE (expr->symtree->n.sym->backend_decl);
7709 for (ref = expr->ref; ref; ref = ref->next)
7711 if (ref->type == REF_COMPONENT
7712 && ref->u.c.component->as
7714 && ref->next->u.ar.type == AR_FULL)
7715 tmp = TREE_TYPE (ref->u.c.component->backend_decl);
7717 return GFC_TYPE_ARRAY_LBOUND(tmp, dim);
7720 return gfc_index_one_node;
7724 /* Returns true if an expression represents an lhs that can be reallocated
7728 gfc_is_reallocatable_lhs (gfc_expr *expr)
7735 /* An allocatable variable. */
7736 if (expr->symtree->n.sym->attr.allocatable
7738 && expr->ref->type == REF_ARRAY
7739 && expr->ref->u.ar.type == AR_FULL)
7742 /* All that can be left are allocatable components. */
7743 if ((expr->symtree->n.sym->ts.type != BT_DERIVED
7744 && expr->symtree->n.sym->ts.type != BT_CLASS)
7745 || !expr->symtree->n.sym->ts.u.derived->attr.alloc_comp)
7748 /* Find a component ref followed by an array reference. */
7749 for (ref = expr->ref; ref; ref = ref->next)
7751 && ref->type == REF_COMPONENT
7752 && ref->next->type == REF_ARRAY
7753 && !ref->next->next)
7759 /* Return true if valid reallocatable lhs. */
7760 if (ref->u.c.component->attr.allocatable
7761 && ref->next->u.ar.type == AR_FULL)
7768 /* Allocate the lhs of an assignment to an allocatable array, otherwise
7772 gfc_alloc_allocatable_for_assignment (gfc_loopinfo *loop,
7776 stmtblock_t realloc_block;
7777 stmtblock_t alloc_block;
7781 gfc_array_info *linfo;
7801 gfc_array_spec * as;
7803 /* x = f(...) with x allocatable. In this case, expr1 is the rhs.
7804 Find the lhs expression in the loop chain and set expr1 and
7805 expr2 accordingly. */
7806 if (expr1->expr_type == EXPR_FUNCTION && expr2 == NULL)
7809 /* Find the ss for the lhs. */
7811 for (; lss && lss != gfc_ss_terminator; lss = lss->loop_chain)
7812 if (lss->info->expr && lss->info->expr->expr_type == EXPR_VARIABLE)
7814 if (lss == gfc_ss_terminator)
7816 expr1 = lss->info->expr;
7819 /* Bail out if this is not a valid allocate on assignment. */
7820 if (!gfc_is_reallocatable_lhs (expr1)
7821 || (expr2 && !expr2->rank))
7824 /* Find the ss for the lhs. */
7826 for (; lss && lss != gfc_ss_terminator; lss = lss->loop_chain)
7827 if (lss->info->expr == expr1)
7830 if (lss == gfc_ss_terminator)
7833 linfo = &lss->info->data.array;
7835 /* Find an ss for the rhs. For operator expressions, we see the
7836 ss's for the operands. Any one of these will do. */
7838 for (; rss && rss != gfc_ss_terminator; rss = rss->loop_chain)
7839 if (rss->info->expr != expr1 && rss != loop->temp_ss)
7842 if (expr2 && rss == gfc_ss_terminator)
7845 gfc_start_block (&fblock);
7847 /* Since the lhs is allocatable, this must be a descriptor type.
7848 Get the data and array size. */
7849 desc = linfo->descriptor;
7850 gcc_assert (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (desc)));
7851 array1 = gfc_conv_descriptor_data_get (desc);
7853 /* 7.4.1.3 "If variable is an allocated allocatable variable, it is
7854 deallocated if expr is an array of different shape or any of the
7855 corresponding length type parameter values of variable and expr
7856 differ." This assures F95 compatibility. */
7857 jump_label1 = gfc_build_label_decl (NULL_TREE);
7858 jump_label2 = gfc_build_label_decl (NULL_TREE);
7860 /* Allocate if data is NULL. */
7861 cond = fold_build2_loc (input_location, EQ_EXPR, boolean_type_node,
7862 array1, build_int_cst (TREE_TYPE (array1), 0));
7863 tmp = build3_v (COND_EXPR, cond,
7864 build1_v (GOTO_EXPR, jump_label1),
7865 build_empty_stmt (input_location));
7866 gfc_add_expr_to_block (&fblock, tmp);
7868 /* Get arrayspec if expr is a full array. */
7869 if (expr2 && expr2->expr_type == EXPR_FUNCTION
7870 && expr2->value.function.isym
7871 && expr2->value.function.isym->conversion)
7873 /* For conversion functions, take the arg. */
7874 gfc_expr *arg = expr2->value.function.actual->expr;
7875 as = gfc_get_full_arrayspec_from_expr (arg);
7878 as = gfc_get_full_arrayspec_from_expr (expr2);
7882 /* If the lhs shape is not the same as the rhs jump to setting the
7883 bounds and doing the reallocation....... */
7884 for (n = 0; n < expr1->rank; n++)
7886 /* Check the shape. */
7887 lbound = gfc_conv_descriptor_lbound_get (desc, gfc_rank_cst[n]);
7888 ubound = gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[n]);
7889 tmp = fold_build2_loc (input_location, MINUS_EXPR,
7890 gfc_array_index_type,
7891 loop->to[n], loop->from[n]);
7892 tmp = fold_build2_loc (input_location, PLUS_EXPR,
7893 gfc_array_index_type,
7895 tmp = fold_build2_loc (input_location, MINUS_EXPR,
7896 gfc_array_index_type,
7898 cond = fold_build2_loc (input_location, NE_EXPR,
7900 tmp, gfc_index_zero_node);
7901 tmp = build3_v (COND_EXPR, cond,
7902 build1_v (GOTO_EXPR, jump_label1),
7903 build_empty_stmt (input_location));
7904 gfc_add_expr_to_block (&fblock, tmp);
7907 /* ....else jump past the (re)alloc code. */
7908 tmp = build1_v (GOTO_EXPR, jump_label2);
7909 gfc_add_expr_to_block (&fblock, tmp);
7911 /* Add the label to start automatic (re)allocation. */
7912 tmp = build1_v (LABEL_EXPR, jump_label1);
7913 gfc_add_expr_to_block (&fblock, tmp);
7915 size1 = gfc_conv_descriptor_size (desc, expr1->rank);
7917 /* Get the rhs size. Fix both sizes. */
7919 desc2 = rss->info->data.array.descriptor;
7922 size2 = gfc_index_one_node;
7923 for (n = 0; n < expr2->rank; n++)
7925 tmp = fold_build2_loc (input_location, MINUS_EXPR,
7926 gfc_array_index_type,
7927 loop->to[n], loop->from[n]);
7928 tmp = fold_build2_loc (input_location, PLUS_EXPR,
7929 gfc_array_index_type,
7930 tmp, gfc_index_one_node);
7931 size2 = fold_build2_loc (input_location, MULT_EXPR,
7932 gfc_array_index_type,
7936 size1 = gfc_evaluate_now (size1, &fblock);
7937 size2 = gfc_evaluate_now (size2, &fblock);
7939 cond = fold_build2_loc (input_location, NE_EXPR, boolean_type_node,
7941 neq_size = gfc_evaluate_now (cond, &fblock);
7944 /* Now modify the lhs descriptor and the associated scalarizer
7945 variables. F2003 7.4.1.3: "If variable is or becomes an
7946 unallocated allocatable variable, then it is allocated with each
7947 deferred type parameter equal to the corresponding type parameters
7948 of expr , with the shape of expr , and with each lower bound equal
7949 to the corresponding element of LBOUND(expr)."
7950 Reuse size1 to keep a dimension-by-dimension track of the
7951 stride of the new array. */
7952 size1 = gfc_index_one_node;
7953 offset = gfc_index_zero_node;
7955 for (n = 0; n < expr2->rank; n++)
7957 tmp = fold_build2_loc (input_location, MINUS_EXPR,
7958 gfc_array_index_type,
7959 loop->to[n], loop->from[n]);
7960 tmp = fold_build2_loc (input_location, PLUS_EXPR,
7961 gfc_array_index_type,
7962 tmp, gfc_index_one_node);
7964 lbound = gfc_index_one_node;
7969 lbd = get_std_lbound (expr2, desc2, n,
7970 as->type == AS_ASSUMED_SIZE);
7971 ubound = fold_build2_loc (input_location,
7973 gfc_array_index_type,
7975 ubound = fold_build2_loc (input_location,
7977 gfc_array_index_type,
7982 gfc_conv_descriptor_lbound_set (&fblock, desc,
7985 gfc_conv_descriptor_ubound_set (&fblock, desc,
7988 gfc_conv_descriptor_stride_set (&fblock, desc,
7991 lbound = gfc_conv_descriptor_lbound_get (desc,
7993 tmp2 = fold_build2_loc (input_location, MULT_EXPR,
7994 gfc_array_index_type,
7996 offset = fold_build2_loc (input_location, MINUS_EXPR,
7997 gfc_array_index_type,
7999 size1 = fold_build2_loc (input_location, MULT_EXPR,
8000 gfc_array_index_type,
8004 /* Set the lhs descriptor and scalarizer offsets. For rank > 1,
8005 the array offset is saved and the info.offset is used for a
8006 running offset. Use the saved_offset instead. */
8007 tmp = gfc_conv_descriptor_offset (desc);
8008 gfc_add_modify (&fblock, tmp, offset);
8009 if (linfo->saved_offset
8010 && TREE_CODE (linfo->saved_offset) == VAR_DECL)
8011 gfc_add_modify (&fblock, linfo->saved_offset, tmp);
8013 /* Now set the deltas for the lhs. */
8014 for (n = 0; n < expr1->rank; n++)
8016 tmp = gfc_conv_descriptor_lbound_get (desc, gfc_rank_cst[n]);
8018 tmp = fold_build2_loc (input_location, MINUS_EXPR,
8019 gfc_array_index_type, tmp,
8021 if (linfo->delta[dim]
8022 && TREE_CODE (linfo->delta[dim]) == VAR_DECL)
8023 gfc_add_modify (&fblock, linfo->delta[dim], tmp);
8026 /* Get the new lhs size in bytes. */
8027 if (expr1->ts.type == BT_CHARACTER && expr1->ts.deferred)
8029 tmp = expr2->ts.u.cl->backend_decl;
8030 gcc_assert (expr1->ts.u.cl->backend_decl);
8031 tmp = fold_convert (TREE_TYPE (expr1->ts.u.cl->backend_decl), tmp);
8032 gfc_add_modify (&fblock, expr1->ts.u.cl->backend_decl, tmp);
8034 else if (expr1->ts.type == BT_CHARACTER && expr1->ts.u.cl->backend_decl)
8036 tmp = TYPE_SIZE_UNIT (TREE_TYPE (gfc_typenode_for_spec (&expr1->ts)));
8037 tmp = fold_build2_loc (input_location, MULT_EXPR,
8038 gfc_array_index_type, tmp,
8039 expr1->ts.u.cl->backend_decl);
8042 tmp = TYPE_SIZE_UNIT (gfc_typenode_for_spec (&expr1->ts));
8043 tmp = fold_convert (gfc_array_index_type, tmp);
8044 size2 = fold_build2_loc (input_location, MULT_EXPR,
8045 gfc_array_index_type,
8047 size2 = fold_convert (size_type_node, size2);
8048 size2 = gfc_evaluate_now (size2, &fblock);
8050 /* Realloc expression. Note that the scalarizer uses desc.data
8051 in the array reference - (*desc.data)[<element>]. */
8052 gfc_init_block (&realloc_block);
8053 tmp = build_call_expr_loc (input_location,
8054 builtin_decl_explicit (BUILT_IN_REALLOC), 2,
8055 fold_convert (pvoid_type_node, array1),
8057 gfc_conv_descriptor_data_set (&realloc_block,
8059 realloc_expr = gfc_finish_block (&realloc_block);
8061 /* Only reallocate if sizes are different. */
8062 tmp = build3_v (COND_EXPR, neq_size, realloc_expr,
8063 build_empty_stmt (input_location));
8067 /* Malloc expression. */
8068 gfc_init_block (&alloc_block);
8069 tmp = build_call_expr_loc (input_location,
8070 builtin_decl_explicit (BUILT_IN_MALLOC),
8072 gfc_conv_descriptor_data_set (&alloc_block,
8074 tmp = gfc_conv_descriptor_dtype (desc);
8075 gfc_add_modify (&alloc_block, tmp, gfc_get_dtype (TREE_TYPE (desc)));
8076 alloc_expr = gfc_finish_block (&alloc_block);
8078 /* Malloc if not allocated; realloc otherwise. */
8079 tmp = build_int_cst (TREE_TYPE (array1), 0);
8080 cond = fold_build2_loc (input_location, EQ_EXPR,
8083 tmp = build3_v (COND_EXPR, cond, alloc_expr, realloc_expr);
8084 gfc_add_expr_to_block (&fblock, tmp);
8086 /* Make sure that the scalarizer data pointer is updated. */
8088 && TREE_CODE (linfo->data) == VAR_DECL)
8090 tmp = gfc_conv_descriptor_data_get (desc);
8091 gfc_add_modify (&fblock, linfo->data, tmp);
8094 /* Add the exit label. */
8095 tmp = build1_v (LABEL_EXPR, jump_label2);
8096 gfc_add_expr_to_block (&fblock, tmp);
8098 return gfc_finish_block (&fblock);
8102 /* NULLIFY an allocatable/pointer array on function entry, free it on exit.
8103 Do likewise, recursively if necessary, with the allocatable components of
8107 gfc_trans_deferred_array (gfc_symbol * sym, gfc_wrapped_block * block)
8113 stmtblock_t cleanup;
8116 bool sym_has_alloc_comp;
8118 sym_has_alloc_comp = (sym->ts.type == BT_DERIVED
8119 || sym->ts.type == BT_CLASS)
8120 && sym->ts.u.derived->attr.alloc_comp;
8122 /* Make sure the frontend gets these right. */
8123 if (!(sym->attr.pointer || sym->attr.allocatable || sym_has_alloc_comp))
8124 fatal_error ("Possible front-end bug: Deferred array size without pointer, "
8125 "allocatable attribute or derived type without allocatable "
8128 gfc_save_backend_locus (&loc);
8129 gfc_set_backend_locus (&sym->declared_at);
8130 gfc_init_block (&init);
8132 gcc_assert (TREE_CODE (sym->backend_decl) == VAR_DECL
8133 || TREE_CODE (sym->backend_decl) == PARM_DECL);
8135 if (sym->ts.type == BT_CHARACTER
8136 && !INTEGER_CST_P (sym->ts.u.cl->backend_decl))
8138 gfc_conv_string_length (sym->ts.u.cl, NULL, &init);
8139 gfc_trans_vla_type_sizes (sym, &init);
8142 /* Dummy, use associated and result variables don't need anything special. */
8143 if (sym->attr.dummy || sym->attr.use_assoc || sym->attr.result)
8145 gfc_add_init_cleanup (block, gfc_finish_block (&init), NULL_TREE);
8146 gfc_restore_backend_locus (&loc);
8150 descriptor = sym->backend_decl;
8152 /* Although static, derived types with default initializers and
8153 allocatable components must not be nulled wholesale; instead they
8154 are treated component by component. */
8155 if (TREE_STATIC (descriptor) && !sym_has_alloc_comp)
8157 /* SAVEd variables are not freed on exit. */
8158 gfc_trans_static_array_pointer (sym);
8160 gfc_add_init_cleanup (block, gfc_finish_block (&init), NULL_TREE);
8161 gfc_restore_backend_locus (&loc);
8165 /* Get the descriptor type. */
8166 type = TREE_TYPE (sym->backend_decl);
8168 if (sym_has_alloc_comp && !(sym->attr.pointer || sym->attr.allocatable))
8171 && !(TREE_STATIC (sym->backend_decl) && sym->attr.is_main_program))
8173 if (sym->value == NULL
8174 || !gfc_has_default_initializer (sym->ts.u.derived))
8176 rank = sym->as ? sym->as->rank : 0;
8177 tmp = gfc_nullify_alloc_comp (sym->ts.u.derived,
8179 gfc_add_expr_to_block (&init, tmp);
8182 gfc_init_default_dt (sym, &init, false);
8185 else if (!GFC_DESCRIPTOR_TYPE_P (type))
8187 /* If the backend_decl is not a descriptor, we must have a pointer
8189 descriptor = build_fold_indirect_ref_loc (input_location,
8191 type = TREE_TYPE (descriptor);
8194 /* NULLIFY the data pointer. */
8195 if (GFC_DESCRIPTOR_TYPE_P (type) && !sym->attr.save)
8196 gfc_conv_descriptor_data_set (&init, descriptor, null_pointer_node);
8198 gfc_restore_backend_locus (&loc);
8199 gfc_init_block (&cleanup);
8201 /* Allocatable arrays need to be freed when they go out of scope.
8202 The allocatable components of pointers must not be touched. */
8203 if (sym_has_alloc_comp && !(sym->attr.function || sym->attr.result)
8204 && !sym->attr.pointer && !sym->attr.save)
8207 rank = sym->as ? sym->as->rank : 0;
8208 tmp = gfc_deallocate_alloc_comp (sym->ts.u.derived, descriptor, rank);
8209 gfc_add_expr_to_block (&cleanup, tmp);
8212 if (sym->attr.allocatable && (sym->attr.dimension || sym->attr.codimension)
8213 && !sym->attr.save && !sym->attr.result)
8215 tmp = gfc_trans_dealloc_allocated (sym->backend_decl,
8216 sym->attr.codimension);
8217 gfc_add_expr_to_block (&cleanup, tmp);
8220 gfc_add_init_cleanup (block, gfc_finish_block (&init),
8221 gfc_finish_block (&cleanup));
8224 /************ Expression Walking Functions ******************/
8226 /* Walk a variable reference.
8228 Possible extension - multiple component subscripts.
8229 x(:,:) = foo%a(:)%b(:)
8231 forall (i=..., j=...)
8232 x(i,j) = foo%a(j)%b(i)
8234 This adds a fair amount of complexity because you need to deal with more
8235 than one ref. Maybe handle in a similar manner to vector subscripts.
8236 Maybe not worth the effort. */
8240 gfc_walk_variable_expr (gfc_ss * ss, gfc_expr * expr)
8244 for (ref = expr->ref; ref; ref = ref->next)
8245 if (ref->type == REF_ARRAY && ref->u.ar.type != AR_ELEMENT)
8248 return gfc_walk_array_ref (ss, expr, ref);
8253 gfc_walk_array_ref (gfc_ss * ss, gfc_expr * expr, gfc_ref * ref)
8259 for (; ref; ref = ref->next)
8261 if (ref->type == REF_SUBSTRING)
8263 ss = gfc_get_scalar_ss (ss, ref->u.ss.start);
8264 ss = gfc_get_scalar_ss (ss, ref->u.ss.end);
8267 /* We're only interested in array sections from now on. */
8268 if (ref->type != REF_ARRAY)
8276 for (n = ar->dimen - 1; n >= 0; n--)
8277 ss = gfc_get_scalar_ss (ss, ar->start[n]);
8281 newss = gfc_get_array_ss (ss, expr, ar->as->rank, GFC_SS_SECTION);
8282 newss->info->data.array.ref = ref;
8284 /* Make sure array is the same as array(:,:), this way
8285 we don't need to special case all the time. */
8286 ar->dimen = ar->as->rank;
8287 for (n = 0; n < ar->dimen; n++)
8289 ar->dimen_type[n] = DIMEN_RANGE;
8291 gcc_assert (ar->start[n] == NULL);
8292 gcc_assert (ar->end[n] == NULL);
8293 gcc_assert (ar->stride[n] == NULL);
8299 newss = gfc_get_array_ss (ss, expr, 0, GFC_SS_SECTION);
8300 newss->info->data.array.ref = ref;
8302 /* We add SS chains for all the subscripts in the section. */
8303 for (n = 0; n < ar->dimen; n++)
8307 switch (ar->dimen_type[n])
8310 /* Add SS for elemental (scalar) subscripts. */
8311 gcc_assert (ar->start[n]);
8312 indexss = gfc_get_scalar_ss (gfc_ss_terminator, ar->start[n]);
8313 indexss->loop_chain = gfc_ss_terminator;
8314 newss->info->data.array.subscript[n] = indexss;
8318 /* We don't add anything for sections, just remember this
8319 dimension for later. */
8320 newss->dim[newss->dimen] = n;
8325 /* Create a GFC_SS_VECTOR index in which we can store
8326 the vector's descriptor. */
8327 indexss = gfc_get_array_ss (gfc_ss_terminator, ar->start[n],
8329 indexss->loop_chain = gfc_ss_terminator;
8330 newss->info->data.array.subscript[n] = indexss;
8331 newss->dim[newss->dimen] = n;
8336 /* We should know what sort of section it is by now. */
8340 /* We should have at least one non-elemental dimension,
8341 unless we are creating a descriptor for a (scalar) coarray. */
8342 gcc_assert (newss->dimen > 0
8343 || newss->info->data.array.ref->u.ar.as->corank > 0);
8348 /* We should know what sort of section it is by now. */
8357 /* Walk an expression operator. If only one operand of a binary expression is
8358 scalar, we must also add the scalar term to the SS chain. */
8361 gfc_walk_op_expr (gfc_ss * ss, gfc_expr * expr)
8366 head = gfc_walk_subexpr (ss, expr->value.op.op1);
8367 if (expr->value.op.op2 == NULL)
8370 head2 = gfc_walk_subexpr (head, expr->value.op.op2);
8372 /* All operands are scalar. Pass back and let the caller deal with it. */
8376 /* All operands require scalarization. */
8377 if (head != ss && (expr->value.op.op2 == NULL || head2 != head))
8380 /* One of the operands needs scalarization, the other is scalar.
8381 Create a gfc_ss for the scalar expression. */
8384 /* First operand is scalar. We build the chain in reverse order, so
8385 add the scalar SS after the second operand. */
8387 while (head && head->next != ss)
8389 /* Check we haven't somehow broken the chain. */
8391 head->next = gfc_get_scalar_ss (ss, expr->value.op.op1);
8393 else /* head2 == head */
8395 gcc_assert (head2 == head);
8396 /* Second operand is scalar. */
8397 head2 = gfc_get_scalar_ss (head2, expr->value.op.op2);
8404 /* Reverse a SS chain. */
8407 gfc_reverse_ss (gfc_ss * ss)
8412 gcc_assert (ss != NULL);
8414 head = gfc_ss_terminator;
8415 while (ss != gfc_ss_terminator)
8418 /* Check we didn't somehow break the chain. */
8419 gcc_assert (next != NULL);
8429 /* Walk the arguments of an elemental function.
8430 PROC_EXPR is used to check whether an argument is permitted to be absent. If
8431 it is NULL, we don't do the check and the argument is assumed to be present.
8435 gfc_walk_elemental_function_args (gfc_ss * ss, gfc_actual_arglist *arg,
8436 gfc_expr *proc_expr, gfc_ss_type type)
8438 gfc_formal_arglist *dummy_arg;
8444 head = gfc_ss_terminator;
8451 /* Normal procedure case. */
8452 dummy_arg = proc_expr->symtree->n.sym->formal;
8454 /* Typebound procedure case. */
8455 for (ref = proc_expr->ref; ref; ref = ref->next)
8457 if (ref->type == REF_COMPONENT
8458 && ref->u.c.component->attr.proc_pointer
8459 && ref->u.c.component->ts.interface)
8460 dummy_arg = ref->u.c.component->ts.interface->formal;
8469 for (; arg; arg = arg->next)
8471 if (!arg->expr || arg->expr->expr_type == EXPR_NULL)
8474 newss = gfc_walk_subexpr (head, arg->expr);
8477 /* Scalar argument. */
8478 gcc_assert (type == GFC_SS_SCALAR || type == GFC_SS_REFERENCE);
8479 newss = gfc_get_scalar_ss (head, arg->expr);
8480 newss->info->type = type;
8482 if (dummy_arg != NULL
8483 && dummy_arg->sym->attr.optional
8484 && arg->expr->expr_type == EXPR_VARIABLE
8485 && (gfc_expr_attr (arg->expr).optional
8486 || gfc_expr_attr (arg->expr).allocatable
8487 || gfc_expr_attr (arg->expr).pointer))
8488 newss->info->data.scalar.can_be_null_ref = true;
8497 while (tail->next != gfc_ss_terminator)
8501 if (dummy_arg != NULL)
8502 dummy_arg = dummy_arg->next;
8507 /* If all the arguments are scalar we don't need the argument SS. */
8508 gfc_free_ss_chain (head);
8513 /* Add it onto the existing chain. */
8519 /* Walk a function call. Scalar functions are passed back, and taken out of
8520 scalarization loops. For elemental functions we walk their arguments.
8521 The result of functions returning arrays is stored in a temporary outside
8522 the loop, so that the function is only called once. Hence we do not need
8523 to walk their arguments. */
8526 gfc_walk_function_expr (gfc_ss * ss, gfc_expr * expr)
8528 gfc_intrinsic_sym *isym;
8530 gfc_component *comp = NULL;
8532 isym = expr->value.function.isym;
8534 /* Handle intrinsic functions separately. */
8536 return gfc_walk_intrinsic_function (ss, expr, isym);
8538 sym = expr->value.function.esym;
8540 sym = expr->symtree->n.sym;
8542 /* A function that returns arrays. */
8543 gfc_is_proc_ptr_comp (expr, &comp);
8544 if ((!comp && gfc_return_by_reference (sym) && sym->result->attr.dimension)
8545 || (comp && comp->attr.dimension))
8546 return gfc_get_array_ss (ss, expr, expr->rank, GFC_SS_FUNCTION);
8548 /* Walk the parameters of an elemental function. For now we always pass
8550 if (sym->attr.elemental || (comp && comp->attr.elemental))
8551 return gfc_walk_elemental_function_args (ss, expr->value.function.actual,
8552 expr, GFC_SS_REFERENCE);
8554 /* Scalar functions are OK as these are evaluated outside the scalarization
8555 loop. Pass back and let the caller deal with it. */
8560 /* An array temporary is constructed for array constructors. */
8563 gfc_walk_array_constructor (gfc_ss * ss, gfc_expr * expr)
8565 return gfc_get_array_ss (ss, expr, expr->rank, GFC_SS_CONSTRUCTOR);
8569 /* Walk an expression. Add walked expressions to the head of the SS chain.
8570 A wholly scalar expression will not be added. */
8573 gfc_walk_subexpr (gfc_ss * ss, gfc_expr * expr)
8577 switch (expr->expr_type)
8580 head = gfc_walk_variable_expr (ss, expr);
8584 head = gfc_walk_op_expr (ss, expr);
8588 head = gfc_walk_function_expr (ss, expr);
8593 case EXPR_STRUCTURE:
8594 /* Pass back and let the caller deal with it. */
8598 head = gfc_walk_array_constructor (ss, expr);
8601 case EXPR_SUBSTRING:
8602 /* Pass back and let the caller deal with it. */
8606 internal_error ("bad expression type during walk (%d)",
8613 /* Entry point for expression walking.
8614 A return value equal to the passed chain means this is
8615 a scalar expression. It is up to the caller to take whatever action is
8616 necessary to translate these. */
8619 gfc_walk_expr (gfc_expr * expr)
8623 res = gfc_walk_subexpr (gfc_ss_terminator, expr);
8624 return gfc_reverse_ss (res);