1 /* Array translation routines
2 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
4 Contributed by Paul Brook <paul@nowt.org>
5 and Steven Bosscher <s.bosscher@student.tudelft.nl>
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* trans-array.c-- Various array related code, including scalarization,
24 allocation, initialization and other support routines. */
26 /* How the scalarizer works.
27 In gfortran, array expressions use the same core routines as scalar
29 First, a Scalarization State (SS) chain is built. This is done by walking
30 the expression tree, and building a linear list of the terms in the
31 expression. As the tree is walked, scalar subexpressions are translated.
33 The scalarization parameters are stored in a gfc_loopinfo structure.
34 First the start and stride of each term is calculated by
35 gfc_conv_ss_startstride. During this process the expressions for the array
36 descriptors and data pointers are also translated.
38 If the expression is an assignment, we must then resolve any dependencies.
39 In fortran all the rhs values of an assignment must be evaluated before
40 any assignments take place. This can require a temporary array to store the
41 values. We also require a temporary when we are passing array expressions
42 or vector subscripts as procedure parameters.
44 Array sections are passed without copying to a temporary. These use the
45 scalarizer to determine the shape of the section. The flag
46 loop->array_parameter tells the scalarizer that the actual values and loop
47 variables will not be required.
49 The function gfc_conv_loop_setup generates the scalarization setup code.
50 It determines the range of the scalarizing loop variables. If a temporary
51 is required, this is created and initialized. Code for scalar expressions
52 taken outside the loop is also generated at this time. Next the offset and
53 scaling required to translate from loop variables to array indices for each
56 A call to gfc_start_scalarized_body marks the start of the scalarized
57 expression. This creates a scope and declares the loop variables. Before
58 calling this gfc_make_ss_chain_used must be used to indicate which terms
59 will be used inside this loop.
61 The scalar gfc_conv_* functions are then used to build the main body of the
62 scalarization loop. Scalarization loop variables and precalculated scalar
63 values are automatically substituted. Note that gfc_advance_se_ss_chain
64 must be used, rather than changing the se->ss directly.
66 For assignment expressions requiring a temporary two sub loops are
67 generated. The first stores the result of the expression in the temporary,
68 the second copies it to the result. A call to
69 gfc_trans_scalarized_loop_boundary marks the end of the main loop code and
70 the start of the copying loop. The temporary may be less than full rank.
72 Finally gfc_trans_scalarizing_loops is called to generate the implicit do
73 loops. The loops are added to the pre chain of the loopinfo. The post
74 chain may still contain cleanup code.
76 After the loop code has been added into its parent scope gfc_cleanup_loop
77 is called to free all the SS allocated by the scalarizer. */
81 #include "coretypes.h"
89 #include "constructor.h"
91 #include "trans-stmt.h"
92 #include "trans-types.h"
93 #include "trans-array.h"
94 #include "trans-const.h"
95 #include "dependency.h"
97 static gfc_ss *gfc_walk_subexpr (gfc_ss *, gfc_expr *);
98 static bool gfc_get_array_constructor_size (mpz_t *, gfc_constructor_base);
100 /* The contents of this structure aren't actually used, just the address. */
101 static gfc_ss gfc_ss_terminator_var;
102 gfc_ss * const gfc_ss_terminator = &gfc_ss_terminator_var;
106 gfc_array_dataptr_type (tree desc)
108 return (GFC_TYPE_ARRAY_DATAPTR_TYPE (TREE_TYPE (desc)));
112 /* Build expressions to access the members of an array descriptor.
113 It's surprisingly easy to mess up here, so never access
114 an array descriptor by "brute force", always use these
115 functions. This also avoids problems if we change the format
116 of an array descriptor.
118 To understand these magic numbers, look at the comments
119 before gfc_build_array_type() in trans-types.c.
121 The code within these defines should be the only code which knows the format
122 of an array descriptor.
124 Any code just needing to read obtain the bounds of an array should use
125 gfc_conv_array_* rather than the following functions as these will return
126 know constant values, and work with arrays which do not have descriptors.
128 Don't forget to #undef these! */
131 #define OFFSET_FIELD 1
132 #define DTYPE_FIELD 2
133 #define DIMENSION_FIELD 3
135 #define STRIDE_SUBFIELD 0
136 #define LBOUND_SUBFIELD 1
137 #define UBOUND_SUBFIELD 2
139 /* This provides READ-ONLY access to the data field. The field itself
140 doesn't have the proper type. */
143 gfc_conv_descriptor_data_get (tree desc)
147 type = TREE_TYPE (desc);
148 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
150 field = TYPE_FIELDS (type);
151 gcc_assert (DATA_FIELD == 0);
153 t = fold_build3 (COMPONENT_REF, TREE_TYPE (field), desc, field, NULL_TREE);
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 (COMPONENT_REF, TREE_TYPE (field), desc, field, NULL_TREE);
179 gfc_add_modify (block, t, fold_convert (TREE_TYPE (field), value));
183 /* This provides address access to the data field. This should only be
184 used by array allocation, passing this on to the runtime. */
187 gfc_conv_descriptor_data_addr (tree desc)
191 type = TREE_TYPE (desc);
192 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
194 field = TYPE_FIELDS (type);
195 gcc_assert (DATA_FIELD == 0);
197 t = fold_build3 (COMPONENT_REF, TREE_TYPE (field), desc, field, NULL_TREE);
198 return gfc_build_addr_expr (NULL_TREE, t);
202 gfc_conv_descriptor_offset (tree desc)
207 type = TREE_TYPE (desc);
208 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
210 field = gfc_advance_chain (TYPE_FIELDS (type), OFFSET_FIELD);
211 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == gfc_array_index_type);
213 return fold_build3 (COMPONENT_REF, TREE_TYPE (field),
214 desc, field, NULL_TREE);
218 gfc_conv_descriptor_offset_get (tree desc)
220 return gfc_conv_descriptor_offset (desc);
224 gfc_conv_descriptor_offset_set (stmtblock_t *block, tree desc,
227 tree t = gfc_conv_descriptor_offset (desc);
228 gfc_add_modify (block, t, fold_convert (TREE_TYPE (t), value));
233 gfc_conv_descriptor_dtype (tree desc)
238 type = TREE_TYPE (desc);
239 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
241 field = gfc_advance_chain (TYPE_FIELDS (type), DTYPE_FIELD);
242 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == gfc_array_index_type);
244 return fold_build3 (COMPONENT_REF, TREE_TYPE (field),
245 desc, field, NULL_TREE);
249 gfc_conv_descriptor_dimension (tree desc, tree dim)
255 type = TREE_TYPE (desc);
256 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
258 field = gfc_advance_chain (TYPE_FIELDS (type), DIMENSION_FIELD);
259 gcc_assert (field != NULL_TREE
260 && TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
261 && TREE_CODE (TREE_TYPE (TREE_TYPE (field))) == RECORD_TYPE);
263 tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field),
264 desc, field, NULL_TREE);
265 tmp = gfc_build_array_ref (tmp, dim, NULL);
270 gfc_conv_descriptor_stride (tree desc, tree dim)
275 tmp = gfc_conv_descriptor_dimension (desc, dim);
276 field = TYPE_FIELDS (TREE_TYPE (tmp));
277 field = gfc_advance_chain (field, STRIDE_SUBFIELD);
278 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == gfc_array_index_type);
280 tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field),
281 tmp, field, NULL_TREE);
286 gfc_conv_descriptor_stride_get (tree desc, tree dim)
288 tree type = TREE_TYPE (desc);
289 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
290 if (integer_zerop (dim)
291 && GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ALLOCATABLE)
292 return gfc_index_one_node;
294 return gfc_conv_descriptor_stride (desc, dim);
298 gfc_conv_descriptor_stride_set (stmtblock_t *block, tree desc,
299 tree dim, tree value)
301 tree t = gfc_conv_descriptor_stride (desc, dim);
302 gfc_add_modify (block, t, fold_convert (TREE_TYPE (t), value));
306 gfc_conv_descriptor_lbound (tree desc, tree dim)
311 tmp = gfc_conv_descriptor_dimension (desc, dim);
312 field = TYPE_FIELDS (TREE_TYPE (tmp));
313 field = gfc_advance_chain (field, LBOUND_SUBFIELD);
314 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == gfc_array_index_type);
316 tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field),
317 tmp, field, NULL_TREE);
322 gfc_conv_descriptor_lbound_get (tree desc, tree dim)
324 return gfc_conv_descriptor_lbound (desc, dim);
328 gfc_conv_descriptor_lbound_set (stmtblock_t *block, tree desc,
329 tree dim, tree value)
331 tree t = gfc_conv_descriptor_lbound (desc, dim);
332 gfc_add_modify (block, t, fold_convert (TREE_TYPE (t), value));
336 gfc_conv_descriptor_ubound (tree desc, tree dim)
341 tmp = gfc_conv_descriptor_dimension (desc, dim);
342 field = TYPE_FIELDS (TREE_TYPE (tmp));
343 field = gfc_advance_chain (field, UBOUND_SUBFIELD);
344 gcc_assert (field != NULL_TREE && TREE_TYPE (field) == gfc_array_index_type);
346 tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field),
347 tmp, field, NULL_TREE);
352 gfc_conv_descriptor_ubound_get (tree desc, tree dim)
354 return gfc_conv_descriptor_ubound (desc, dim);
358 gfc_conv_descriptor_ubound_set (stmtblock_t *block, tree desc,
359 tree dim, tree value)
361 tree t = gfc_conv_descriptor_ubound (desc, dim);
362 gfc_add_modify (block, t, fold_convert (TREE_TYPE (t), value));
365 /* Build a null array descriptor constructor. */
368 gfc_build_null_descriptor (tree type)
373 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
374 gcc_assert (DATA_FIELD == 0);
375 field = TYPE_FIELDS (type);
377 /* Set a NULL data pointer. */
378 tmp = build_constructor_single (type, field, null_pointer_node);
379 TREE_CONSTANT (tmp) = 1;
380 /* All other fields are ignored. */
386 /* Cleanup those #defines. */
391 #undef DIMENSION_FIELD
392 #undef STRIDE_SUBFIELD
393 #undef LBOUND_SUBFIELD
394 #undef UBOUND_SUBFIELD
397 /* Mark a SS chain as used. Flags specifies in which loops the SS is used.
398 flags & 1 = Main loop body.
399 flags & 2 = temp copy loop. */
402 gfc_mark_ss_chain_used (gfc_ss * ss, unsigned flags)
404 for (; ss != gfc_ss_terminator; ss = ss->next)
405 ss->useflags = flags;
408 static void gfc_free_ss (gfc_ss *);
411 /* Free a gfc_ss chain. */
414 gfc_free_ss_chain (gfc_ss * ss)
418 while (ss != gfc_ss_terminator)
420 gcc_assert (ss != NULL);
431 gfc_free_ss (gfc_ss * ss)
438 for (n = 0; n < GFC_MAX_DIMENSIONS; n++)
440 if (ss->data.info.subscript[n])
441 gfc_free_ss_chain (ss->data.info.subscript[n]);
453 /* Free all the SS associated with a loop. */
456 gfc_cleanup_loop (gfc_loopinfo * loop)
462 while (ss != gfc_ss_terminator)
464 gcc_assert (ss != NULL);
465 next = ss->loop_chain;
472 /* Associate a SS chain with a loop. */
475 gfc_add_ss_to_loop (gfc_loopinfo * loop, gfc_ss * head)
479 if (head == gfc_ss_terminator)
483 for (; ss && ss != gfc_ss_terminator; ss = ss->next)
485 if (ss->next == gfc_ss_terminator)
486 ss->loop_chain = loop->ss;
488 ss->loop_chain = ss->next;
490 gcc_assert (ss == gfc_ss_terminator);
495 /* Generate an initializer for a static pointer or allocatable array. */
498 gfc_trans_static_array_pointer (gfc_symbol * sym)
502 gcc_assert (TREE_STATIC (sym->backend_decl));
503 /* Just zero the data member. */
504 type = TREE_TYPE (sym->backend_decl);
505 DECL_INITIAL (sym->backend_decl) = gfc_build_null_descriptor (type);
509 /* If the bounds of SE's loop have not yet been set, see if they can be
510 determined from array spec AS, which is the array spec of a called
511 function. MAPPING maps the callee's dummy arguments to the values
512 that the caller is passing. Add any initialization and finalization
516 gfc_set_loop_bounds_from_array_spec (gfc_interface_mapping * mapping,
517 gfc_se * se, gfc_array_spec * as)
525 if (as && as->type == AS_EXPLICIT)
526 for (dim = 0; dim < se->loop->dimen; dim++)
528 n = se->loop->order[dim];
529 if (se->loop->to[n] == NULL_TREE)
531 /* Evaluate the lower bound. */
532 gfc_init_se (&tmpse, NULL);
533 gfc_apply_interface_mapping (mapping, &tmpse, as->lower[dim]);
534 gfc_add_block_to_block (&se->pre, &tmpse.pre);
535 gfc_add_block_to_block (&se->post, &tmpse.post);
536 lower = fold_convert (gfc_array_index_type, tmpse.expr);
538 /* ...and the upper bound. */
539 gfc_init_se (&tmpse, NULL);
540 gfc_apply_interface_mapping (mapping, &tmpse, as->upper[dim]);
541 gfc_add_block_to_block (&se->pre, &tmpse.pre);
542 gfc_add_block_to_block (&se->post, &tmpse.post);
543 upper = fold_convert (gfc_array_index_type, tmpse.expr);
545 /* Set the upper bound of the loop to UPPER - LOWER. */
546 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, upper, lower);
547 tmp = gfc_evaluate_now (tmp, &se->pre);
548 se->loop->to[n] = tmp;
554 /* Generate code to allocate an array temporary, or create a variable to
555 hold the data. If size is NULL, zero the descriptor so that the
556 callee will allocate the array. If DEALLOC is true, also generate code to
557 free the array afterwards.
559 If INITIAL is not NULL, it is packed using internal_pack and the result used
560 as data instead of allocating a fresh, unitialized area of memory.
562 Initialization code is added to PRE and finalization code to POST.
563 DYNAMIC is true if the caller may want to extend the array later
564 using realloc. This prevents us from putting the array on the stack. */
567 gfc_trans_allocate_array_storage (stmtblock_t * pre, stmtblock_t * post,
568 gfc_ss_info * info, tree size, tree nelem,
569 tree initial, bool dynamic, bool dealloc)
575 desc = info->descriptor;
576 info->offset = gfc_index_zero_node;
577 if (size == NULL_TREE || integer_zerop (size))
579 /* A callee allocated array. */
580 gfc_conv_descriptor_data_set (pre, desc, null_pointer_node);
585 /* Allocate the temporary. */
586 onstack = !dynamic && initial == NULL_TREE
587 && gfc_can_put_var_on_stack (size);
591 /* Make a temporary variable to hold the data. */
592 tmp = fold_build2 (MINUS_EXPR, TREE_TYPE (nelem), nelem,
594 tmp = build_range_type (gfc_array_index_type, gfc_index_zero_node,
596 tmp = build_array_type (gfc_get_element_type (TREE_TYPE (desc)),
598 tmp = gfc_create_var (tmp, "A");
599 tmp = gfc_build_addr_expr (NULL_TREE, tmp);
600 gfc_conv_descriptor_data_set (pre, desc, tmp);
604 /* Allocate memory to hold the data or call internal_pack. */
605 if (initial == NULL_TREE)
607 tmp = gfc_call_malloc (pre, NULL, size);
608 tmp = gfc_evaluate_now (tmp, pre);
615 stmtblock_t do_copying;
617 tmp = TREE_TYPE (initial); /* Pointer to descriptor. */
618 gcc_assert (TREE_CODE (tmp) == POINTER_TYPE);
619 tmp = TREE_TYPE (tmp); /* The descriptor itself. */
620 tmp = gfc_get_element_type (tmp);
621 gcc_assert (tmp == gfc_get_element_type (TREE_TYPE (desc)));
622 packed = gfc_create_var (build_pointer_type (tmp), "data");
624 tmp = build_call_expr_loc (input_location,
625 gfor_fndecl_in_pack, 1, initial);
626 tmp = fold_convert (TREE_TYPE (packed), tmp);
627 gfc_add_modify (pre, packed, tmp);
629 tmp = build_fold_indirect_ref_loc (input_location,
631 source_data = gfc_conv_descriptor_data_get (tmp);
633 /* internal_pack may return source->data without any allocation
634 or copying if it is already packed. If that's the case, we
635 need to allocate and copy manually. */
637 gfc_start_block (&do_copying);
638 tmp = gfc_call_malloc (&do_copying, NULL, size);
639 tmp = fold_convert (TREE_TYPE (packed), tmp);
640 gfc_add_modify (&do_copying, packed, tmp);
641 tmp = gfc_build_memcpy_call (packed, source_data, size);
642 gfc_add_expr_to_block (&do_copying, tmp);
644 was_packed = fold_build2 (EQ_EXPR, boolean_type_node,
645 packed, source_data);
646 tmp = gfc_finish_block (&do_copying);
647 tmp = build3_v (COND_EXPR, was_packed, tmp,
648 build_empty_stmt (input_location));
649 gfc_add_expr_to_block (pre, tmp);
651 tmp = fold_convert (pvoid_type_node, packed);
654 gfc_conv_descriptor_data_set (pre, desc, tmp);
657 info->data = gfc_conv_descriptor_data_get (desc);
659 /* The offset is zero because we create temporaries with a zero
661 gfc_conv_descriptor_offset_set (pre, desc, gfc_index_zero_node);
663 if (dealloc && !onstack)
665 /* Free the temporary. */
666 tmp = gfc_conv_descriptor_data_get (desc);
667 tmp = gfc_call_free (fold_convert (pvoid_type_node, tmp));
668 gfc_add_expr_to_block (post, tmp);
673 /* Generate code to create and initialize the descriptor for a temporary
674 array. This is used for both temporaries needed by the scalarizer, and
675 functions returning arrays. Adjusts the loop variables to be
676 zero-based, and calculates the loop bounds for callee allocated arrays.
677 Allocate the array unless it's callee allocated (we have a callee
678 allocated array if 'callee_alloc' is true, or if loop->to[n] is
679 NULL_TREE for any n). Also fills in the descriptor, data and offset
680 fields of info if known. Returns the size of the array, or NULL for a
681 callee allocated array.
683 PRE, POST, INITIAL, DYNAMIC and DEALLOC are as for
684 gfc_trans_allocate_array_storage.
688 gfc_trans_create_temp_array (stmtblock_t * pre, stmtblock_t * post,
689 gfc_loopinfo * loop, gfc_ss_info * info,
690 tree eltype, tree initial, bool dynamic,
691 bool dealloc, bool callee_alloc, locus * where)
703 gcc_assert (info->dimen > 0);
705 if (gfc_option.warn_array_temp && where)
706 gfc_warning ("Creating array temporary at %L", where);
708 /* Set the lower bound to zero. */
709 for (dim = 0; dim < info->dimen; dim++)
711 n = loop->order[dim];
712 /* Callee allocated arrays may not have a known bound yet. */
714 loop->to[n] = gfc_evaluate_now (fold_build2 (MINUS_EXPR,
715 gfc_array_index_type,
716 loop->to[n], loop->from[n]), pre);
717 loop->from[n] = gfc_index_zero_node;
719 info->delta[dim] = gfc_index_zero_node;
720 info->start[dim] = gfc_index_zero_node;
721 info->end[dim] = gfc_index_zero_node;
722 info->stride[dim] = gfc_index_one_node;
723 info->dim[dim] = dim;
726 /* Initialize the descriptor. */
728 gfc_get_array_type_bounds (eltype, info->dimen, loop->from, loop->to, 1,
729 GFC_ARRAY_UNKNOWN, true);
730 desc = gfc_create_var (type, "atmp");
731 GFC_DECL_PACKED_ARRAY (desc) = 1;
733 info->descriptor = desc;
734 size = gfc_index_one_node;
736 /* Fill in the array dtype. */
737 tmp = gfc_conv_descriptor_dtype (desc);
738 gfc_add_modify (pre, tmp, gfc_get_dtype (TREE_TYPE (desc)));
741 Fill in the bounds and stride. This is a packed array, so:
744 for (n = 0; n < rank; n++)
747 delta = ubound[n] + 1 - lbound[n];
750 size = size * sizeof(element);
755 /* If there is at least one null loop->to[n], it is a callee allocated
757 for (n = 0; n < info->dimen; n++)
758 if (loop->to[n] == NULL_TREE)
764 for (n = 0; n < info->dimen; n++)
766 if (size == NULL_TREE)
768 /* For a callee allocated array express the loop bounds in terms
769 of the descriptor fields. */
771 fold_build2 (MINUS_EXPR, gfc_array_index_type,
772 gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[n]),
773 gfc_conv_descriptor_lbound_get (desc, gfc_rank_cst[n]));
778 /* Store the stride and bound components in the descriptor. */
779 gfc_conv_descriptor_stride_set (pre, desc, gfc_rank_cst[n], size);
781 gfc_conv_descriptor_lbound_set (pre, desc, gfc_rank_cst[n],
782 gfc_index_zero_node);
784 gfc_conv_descriptor_ubound_set (pre, desc, gfc_rank_cst[n], loop->to[n]);
786 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
787 loop->to[n], gfc_index_one_node);
789 /* Check whether the size for this dimension is negative. */
790 cond = fold_build2 (LE_EXPR, boolean_type_node, tmp,
791 gfc_index_zero_node);
792 cond = gfc_evaluate_now (cond, pre);
797 or_expr = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, or_expr, cond);
799 size = fold_build2 (MULT_EXPR, gfc_array_index_type, size, tmp);
800 size = gfc_evaluate_now (size, pre);
803 /* Get the size of the array. */
805 if (size && !callee_alloc)
807 /* If or_expr is true, then the extent in at least one
808 dimension is zero and the size is set to zero. */
809 size = fold_build3 (COND_EXPR, gfc_array_index_type,
810 or_expr, gfc_index_zero_node, size);
813 size = fold_build2 (MULT_EXPR, gfc_array_index_type, size,
814 fold_convert (gfc_array_index_type,
815 TYPE_SIZE_UNIT (gfc_get_element_type (type))));
823 gfc_trans_allocate_array_storage (pre, post, info, size, nelem, initial,
826 if (info->dimen > loop->temp_dim)
827 loop->temp_dim = info->dimen;
833 /* Generate code to transpose array EXPR by creating a new descriptor
834 in which the dimension specifications have been reversed. */
837 gfc_conv_array_transpose (gfc_se * se, gfc_expr * expr)
839 tree dest, src, dest_index, src_index;
841 gfc_ss_info *dest_info;
842 gfc_ss *dest_ss, *src_ss;
848 src_ss = gfc_walk_expr (expr);
851 dest_info = &dest_ss->data.info;
852 gcc_assert (dest_info->dimen == 2);
854 /* Get a descriptor for EXPR. */
855 gfc_init_se (&src_se, NULL);
856 gfc_conv_expr_descriptor (&src_se, expr, src_ss);
857 gfc_add_block_to_block (&se->pre, &src_se.pre);
858 gfc_add_block_to_block (&se->post, &src_se.post);
861 /* Allocate a new descriptor for the return value. */
862 dest = gfc_create_var (TREE_TYPE (src), "atmp");
863 dest_info->descriptor = dest;
866 /* Copy across the dtype field. */
867 gfc_add_modify (&se->pre,
868 gfc_conv_descriptor_dtype (dest),
869 gfc_conv_descriptor_dtype (src));
871 /* Copy the dimension information, renumbering dimension 1 to 0 and
873 for (n = 0; n < 2; n++)
875 dest_info->delta[n] = gfc_index_zero_node;
876 dest_info->start[n] = gfc_index_zero_node;
877 dest_info->end[n] = gfc_index_zero_node;
878 dest_info->stride[n] = gfc_index_one_node;
879 dest_info->dim[n] = n;
881 dest_index = gfc_rank_cst[n];
882 src_index = gfc_rank_cst[1 - n];
884 gfc_conv_descriptor_stride_set (&se->pre, dest, dest_index,
885 gfc_conv_descriptor_stride_get (src, src_index));
887 gfc_conv_descriptor_lbound_set (&se->pre, dest, dest_index,
888 gfc_conv_descriptor_lbound_get (src, src_index));
890 gfc_conv_descriptor_ubound_set (&se->pre, dest, dest_index,
891 gfc_conv_descriptor_ubound_get (src, src_index));
895 gcc_assert (integer_zerop (loop->from[n]));
897 fold_build2 (MINUS_EXPR, gfc_array_index_type,
898 gfc_conv_descriptor_ubound_get (dest, dest_index),
899 gfc_conv_descriptor_lbound_get (dest, dest_index));
903 /* Copy the data pointer. */
904 dest_info->data = gfc_conv_descriptor_data_get (src);
905 gfc_conv_descriptor_data_set (&se->pre, dest, dest_info->data);
907 /* Copy the offset. This is not changed by transposition; the top-left
908 element is still at the same offset as before, except where the loop
910 if (!integer_zerop (loop->from[0]))
911 dest_info->offset = gfc_conv_descriptor_offset_get (src);
913 dest_info->offset = gfc_index_zero_node;
915 gfc_conv_descriptor_offset_set (&se->pre, dest,
918 if (dest_info->dimen > loop->temp_dim)
919 loop->temp_dim = dest_info->dimen;
923 /* Return the number of iterations in a loop that starts at START,
924 ends at END, and has step STEP. */
927 gfc_get_iteration_count (tree start, tree end, tree step)
932 type = TREE_TYPE (step);
933 tmp = fold_build2 (MINUS_EXPR, type, end, start);
934 tmp = fold_build2 (FLOOR_DIV_EXPR, type, tmp, step);
935 tmp = fold_build2 (PLUS_EXPR, type, tmp, build_int_cst (type, 1));
936 tmp = fold_build2 (MAX_EXPR, type, tmp, build_int_cst (type, 0));
937 return fold_convert (gfc_array_index_type, tmp);
941 /* Extend the data in array DESC by EXTRA elements. */
944 gfc_grow_array (stmtblock_t * pblock, tree desc, tree extra)
951 if (integer_zerop (extra))
954 ubound = gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[0]);
956 /* Add EXTRA to the upper bound. */
957 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type, ubound, extra);
958 gfc_conv_descriptor_ubound_set (pblock, desc, gfc_rank_cst[0], tmp);
960 /* Get the value of the current data pointer. */
961 arg0 = gfc_conv_descriptor_data_get (desc);
963 /* Calculate the new array size. */
964 size = TYPE_SIZE_UNIT (gfc_get_element_type (TREE_TYPE (desc)));
965 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
966 ubound, gfc_index_one_node);
967 arg1 = fold_build2 (MULT_EXPR, size_type_node,
968 fold_convert (size_type_node, tmp),
969 fold_convert (size_type_node, size));
971 /* Call the realloc() function. */
972 tmp = gfc_call_realloc (pblock, arg0, arg1);
973 gfc_conv_descriptor_data_set (pblock, desc, tmp);
977 /* Return true if the bounds of iterator I can only be determined
981 gfc_iterator_has_dynamic_bounds (gfc_iterator * i)
983 return (i->start->expr_type != EXPR_CONSTANT
984 || i->end->expr_type != EXPR_CONSTANT
985 || i->step->expr_type != EXPR_CONSTANT);
989 /* Split the size of constructor element EXPR into the sum of two terms,
990 one of which can be determined at compile time and one of which must
991 be calculated at run time. Set *SIZE to the former and return true
992 if the latter might be nonzero. */
995 gfc_get_array_constructor_element_size (mpz_t * size, gfc_expr * expr)
997 if (expr->expr_type == EXPR_ARRAY)
998 return gfc_get_array_constructor_size (size, expr->value.constructor);
999 else if (expr->rank > 0)
1001 /* Calculate everything at run time. */
1002 mpz_set_ui (*size, 0);
1007 /* A single element. */
1008 mpz_set_ui (*size, 1);
1014 /* Like gfc_get_array_constructor_element_size, but applied to the whole
1015 of array constructor C. */
1018 gfc_get_array_constructor_size (mpz_t * size, gfc_constructor_base base)
1026 mpz_set_ui (*size, 0);
1031 for (c = gfc_constructor_first (base); c; c = gfc_constructor_next (c))
1034 if (i && gfc_iterator_has_dynamic_bounds (i))
1038 dynamic |= gfc_get_array_constructor_element_size (&len, c->expr);
1041 /* Multiply the static part of the element size by the
1042 number of iterations. */
1043 mpz_sub (val, i->end->value.integer, i->start->value.integer);
1044 mpz_fdiv_q (val, val, i->step->value.integer);
1045 mpz_add_ui (val, val, 1);
1046 if (mpz_sgn (val) > 0)
1047 mpz_mul (len, len, val);
1049 mpz_set_ui (len, 0);
1051 mpz_add (*size, *size, len);
1060 /* Make sure offset is a variable. */
1063 gfc_put_offset_into_var (stmtblock_t * pblock, tree * poffset,
1066 /* We should have already created the offset variable. We cannot
1067 create it here because we may be in an inner scope. */
1068 gcc_assert (*offsetvar != NULL_TREE);
1069 gfc_add_modify (pblock, *offsetvar, *poffset);
1070 *poffset = *offsetvar;
1071 TREE_USED (*offsetvar) = 1;
1075 /* Variables needed for bounds-checking. */
1076 static bool first_len;
1077 static tree first_len_val;
1078 static bool typespec_chararray_ctor;
1081 gfc_trans_array_ctor_element (stmtblock_t * pblock, tree desc,
1082 tree offset, gfc_se * se, gfc_expr * expr)
1086 gfc_conv_expr (se, expr);
1088 /* Store the value. */
1089 tmp = build_fold_indirect_ref_loc (input_location,
1090 gfc_conv_descriptor_data_get (desc));
1091 tmp = gfc_build_array_ref (tmp, offset, NULL);
1093 if (expr->ts.type == BT_CHARACTER)
1095 int i = gfc_validate_kind (BT_CHARACTER, expr->ts.kind, false);
1098 esize = size_in_bytes (gfc_get_element_type (TREE_TYPE (desc)));
1099 esize = fold_convert (gfc_charlen_type_node, esize);
1100 esize = fold_build2 (TRUNC_DIV_EXPR, gfc_charlen_type_node, esize,
1101 build_int_cst (gfc_charlen_type_node,
1102 gfc_character_kinds[i].bit_size / 8));
1104 gfc_conv_string_parameter (se);
1105 if (POINTER_TYPE_P (TREE_TYPE (tmp)))
1107 /* The temporary is an array of pointers. */
1108 se->expr = fold_convert (TREE_TYPE (tmp), se->expr);
1109 gfc_add_modify (&se->pre, tmp, se->expr);
1113 /* The temporary is an array of string values. */
1114 tmp = gfc_build_addr_expr (gfc_get_pchar_type (expr->ts.kind), tmp);
1115 /* We know the temporary and the value will be the same length,
1116 so can use memcpy. */
1117 gfc_trans_string_copy (&se->pre, esize, tmp, expr->ts.kind,
1118 se->string_length, se->expr, expr->ts.kind);
1120 if ((gfc_option.rtcheck & GFC_RTCHECK_BOUNDS) && !typespec_chararray_ctor)
1124 gfc_add_modify (&se->pre, first_len_val,
1130 /* Verify that all constructor elements are of the same
1132 tree cond = fold_build2 (NE_EXPR, boolean_type_node,
1133 first_len_val, se->string_length);
1134 gfc_trans_runtime_check
1135 (true, false, cond, &se->pre, &expr->where,
1136 "Different CHARACTER lengths (%ld/%ld) in array constructor",
1137 fold_convert (long_integer_type_node, first_len_val),
1138 fold_convert (long_integer_type_node, se->string_length));
1144 /* TODO: Should the frontend already have done this conversion? */
1145 se->expr = fold_convert (TREE_TYPE (tmp), se->expr);
1146 gfc_add_modify (&se->pre, tmp, se->expr);
1149 gfc_add_block_to_block (pblock, &se->pre);
1150 gfc_add_block_to_block (pblock, &se->post);
1154 /* Add the contents of an array to the constructor. DYNAMIC is as for
1155 gfc_trans_array_constructor_value. */
1158 gfc_trans_array_constructor_subarray (stmtblock_t * pblock,
1159 tree type ATTRIBUTE_UNUSED,
1160 tree desc, gfc_expr * expr,
1161 tree * poffset, tree * offsetvar,
1172 /* We need this to be a variable so we can increment it. */
1173 gfc_put_offset_into_var (pblock, poffset, offsetvar);
1175 gfc_init_se (&se, NULL);
1177 /* Walk the array expression. */
1178 ss = gfc_walk_expr (expr);
1179 gcc_assert (ss != gfc_ss_terminator);
1181 /* Initialize the scalarizer. */
1182 gfc_init_loopinfo (&loop);
1183 gfc_add_ss_to_loop (&loop, ss);
1185 /* Initialize the loop. */
1186 gfc_conv_ss_startstride (&loop);
1187 gfc_conv_loop_setup (&loop, &expr->where);
1189 /* Make sure the constructed array has room for the new data. */
1192 /* Set SIZE to the total number of elements in the subarray. */
1193 size = gfc_index_one_node;
1194 for (n = 0; n < loop.dimen; n++)
1196 tmp = gfc_get_iteration_count (loop.from[n], loop.to[n],
1197 gfc_index_one_node);
1198 size = fold_build2 (MULT_EXPR, gfc_array_index_type, size, tmp);
1201 /* Grow the constructed array by SIZE elements. */
1202 gfc_grow_array (&loop.pre, desc, size);
1205 /* Make the loop body. */
1206 gfc_mark_ss_chain_used (ss, 1);
1207 gfc_start_scalarized_body (&loop, &body);
1208 gfc_copy_loopinfo_to_se (&se, &loop);
1211 gfc_trans_array_ctor_element (&body, desc, *poffset, &se, expr);
1212 gcc_assert (se.ss == gfc_ss_terminator);
1214 /* Increment the offset. */
1215 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
1216 *poffset, gfc_index_one_node);
1217 gfc_add_modify (&body, *poffset, tmp);
1219 /* Finish the loop. */
1220 gfc_trans_scalarizing_loops (&loop, &body);
1221 gfc_add_block_to_block (&loop.pre, &loop.post);
1222 tmp = gfc_finish_block (&loop.pre);
1223 gfc_add_expr_to_block (pblock, tmp);
1225 gfc_cleanup_loop (&loop);
1229 /* Assign the values to the elements of an array constructor. DYNAMIC
1230 is true if descriptor DESC only contains enough data for the static
1231 size calculated by gfc_get_array_constructor_size. When true, memory
1232 for the dynamic parts must be allocated using realloc. */
1235 gfc_trans_array_constructor_value (stmtblock_t * pblock, tree type,
1236 tree desc, gfc_constructor_base base,
1237 tree * poffset, tree * offsetvar,
1246 tree shadow_loopvar = NULL_TREE;
1247 gfc_saved_var saved_loopvar;
1250 for (c = gfc_constructor_first (base); c; c = gfc_constructor_next (c))
1252 /* If this is an iterator or an array, the offset must be a variable. */
1253 if ((c->iterator || c->expr->rank > 0) && INTEGER_CST_P (*poffset))
1254 gfc_put_offset_into_var (pblock, poffset, offsetvar);
1256 /* Shadowing the iterator avoids changing its value and saves us from
1257 keeping track of it. Further, it makes sure that there's always a
1258 backend-decl for the symbol, even if there wasn't one before,
1259 e.g. in the case of an iterator that appears in a specification
1260 expression in an interface mapping. */
1263 gfc_symbol *sym = c->iterator->var->symtree->n.sym;
1264 tree type = gfc_typenode_for_spec (&sym->ts);
1266 shadow_loopvar = gfc_create_var (type, "shadow_loopvar");
1267 gfc_shadow_sym (sym, shadow_loopvar, &saved_loopvar);
1270 gfc_start_block (&body);
1272 if (c->expr->expr_type == EXPR_ARRAY)
1274 /* Array constructors can be nested. */
1275 gfc_trans_array_constructor_value (&body, type, desc,
1276 c->expr->value.constructor,
1277 poffset, offsetvar, dynamic);
1279 else if (c->expr->rank > 0)
1281 gfc_trans_array_constructor_subarray (&body, type, desc, c->expr,
1282 poffset, offsetvar, dynamic);
1286 /* This code really upsets the gimplifier so don't bother for now. */
1293 while (p && !(p->iterator || p->expr->expr_type != EXPR_CONSTANT))
1295 p = gfc_constructor_next (p);
1300 /* Scalar values. */
1301 gfc_init_se (&se, NULL);
1302 gfc_trans_array_ctor_element (&body, desc, *poffset,
1305 *poffset = fold_build2 (PLUS_EXPR, gfc_array_index_type,
1306 *poffset, gfc_index_one_node);
1310 /* Collect multiple scalar constants into a constructor. */
1315 HOST_WIDE_INT idx = 0;
1319 /* Count the number of consecutive scalar constants. */
1320 while (p && !(p->iterator
1321 || p->expr->expr_type != EXPR_CONSTANT))
1323 gfc_init_se (&se, NULL);
1324 gfc_conv_constant (&se, p->expr);
1326 if (c->expr->ts.type != BT_CHARACTER)
1327 se.expr = fold_convert (type, se.expr);
1328 /* For constant character array constructors we build
1329 an array of pointers. */
1330 else if (POINTER_TYPE_P (type))
1331 se.expr = gfc_build_addr_expr
1332 (gfc_get_pchar_type (p->expr->ts.kind),
1335 list = tree_cons (build_int_cst (gfc_array_index_type,
1336 idx++), se.expr, list);
1338 p = gfc_constructor_next (p);
1341 bound = build_int_cst (NULL_TREE, n - 1);
1342 /* Create an array type to hold them. */
1343 tmptype = build_range_type (gfc_array_index_type,
1344 gfc_index_zero_node, bound);
1345 tmptype = build_array_type (type, tmptype);
1347 init = build_constructor_from_list (tmptype, nreverse (list));
1348 TREE_CONSTANT (init) = 1;
1349 TREE_STATIC (init) = 1;
1350 /* Create a static variable to hold the data. */
1351 tmp = gfc_create_var (tmptype, "data");
1352 TREE_STATIC (tmp) = 1;
1353 TREE_CONSTANT (tmp) = 1;
1354 TREE_READONLY (tmp) = 1;
1355 DECL_INITIAL (tmp) = init;
1358 /* Use BUILTIN_MEMCPY to assign the values. */
1359 tmp = gfc_conv_descriptor_data_get (desc);
1360 tmp = build_fold_indirect_ref_loc (input_location,
1362 tmp = gfc_build_array_ref (tmp, *poffset, NULL);
1363 tmp = gfc_build_addr_expr (NULL_TREE, tmp);
1364 init = gfc_build_addr_expr (NULL_TREE, init);
1366 size = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (type));
1367 bound = build_int_cst (NULL_TREE, n * size);
1368 tmp = build_call_expr_loc (input_location,
1369 built_in_decls[BUILT_IN_MEMCPY], 3,
1371 gfc_add_expr_to_block (&body, tmp);
1373 *poffset = fold_build2 (PLUS_EXPR, gfc_array_index_type,
1375 build_int_cst (gfc_array_index_type, n));
1377 if (!INTEGER_CST_P (*poffset))
1379 gfc_add_modify (&body, *offsetvar, *poffset);
1380 *poffset = *offsetvar;
1384 /* The frontend should already have done any expansions
1388 /* Pass the code as is. */
1389 tmp = gfc_finish_block (&body);
1390 gfc_add_expr_to_block (pblock, tmp);
1394 /* Build the implied do-loop. */
1395 stmtblock_t implied_do_block;
1403 loopbody = gfc_finish_block (&body);
1405 /* Create a new block that holds the implied-do loop. A temporary
1406 loop-variable is used. */
1407 gfc_start_block(&implied_do_block);
1409 /* Initialize the loop. */
1410 gfc_init_se (&se, NULL);
1411 gfc_conv_expr_val (&se, c->iterator->start);
1412 gfc_add_block_to_block (&implied_do_block, &se.pre);
1413 gfc_add_modify (&implied_do_block, shadow_loopvar, se.expr);
1415 gfc_init_se (&se, NULL);
1416 gfc_conv_expr_val (&se, c->iterator->end);
1417 gfc_add_block_to_block (&implied_do_block, &se.pre);
1418 end = gfc_evaluate_now (se.expr, &implied_do_block);
1420 gfc_init_se (&se, NULL);
1421 gfc_conv_expr_val (&se, c->iterator->step);
1422 gfc_add_block_to_block (&implied_do_block, &se.pre);
1423 step = gfc_evaluate_now (se.expr, &implied_do_block);
1425 /* If this array expands dynamically, and the number of iterations
1426 is not constant, we won't have allocated space for the static
1427 part of C->EXPR's size. Do that now. */
1428 if (dynamic && gfc_iterator_has_dynamic_bounds (c->iterator))
1430 /* Get the number of iterations. */
1431 tmp = gfc_get_iteration_count (shadow_loopvar, end, step);
1433 /* Get the static part of C->EXPR's size. */
1434 gfc_get_array_constructor_element_size (&size, c->expr);
1435 tmp2 = gfc_conv_mpz_to_tree (size, gfc_index_integer_kind);
1437 /* Grow the array by TMP * TMP2 elements. */
1438 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type, tmp, tmp2);
1439 gfc_grow_array (&implied_do_block, desc, tmp);
1442 /* Generate the loop body. */
1443 exit_label = gfc_build_label_decl (NULL_TREE);
1444 gfc_start_block (&body);
1446 /* Generate the exit condition. Depending on the sign of
1447 the step variable we have to generate the correct
1449 tmp = fold_build2 (GT_EXPR, boolean_type_node, step,
1450 build_int_cst (TREE_TYPE (step), 0));
1451 cond = fold_build3 (COND_EXPR, boolean_type_node, tmp,
1452 fold_build2 (GT_EXPR, boolean_type_node,
1453 shadow_loopvar, end),
1454 fold_build2 (LT_EXPR, boolean_type_node,
1455 shadow_loopvar, end));
1456 tmp = build1_v (GOTO_EXPR, exit_label);
1457 TREE_USED (exit_label) = 1;
1458 tmp = build3_v (COND_EXPR, cond, tmp,
1459 build_empty_stmt (input_location));
1460 gfc_add_expr_to_block (&body, tmp);
1462 /* The main loop body. */
1463 gfc_add_expr_to_block (&body, loopbody);
1465 /* Increase loop variable by step. */
1466 tmp = fold_build2 (PLUS_EXPR, TREE_TYPE (shadow_loopvar), shadow_loopvar, step);
1467 gfc_add_modify (&body, shadow_loopvar, tmp);
1469 /* Finish the loop. */
1470 tmp = gfc_finish_block (&body);
1471 tmp = build1_v (LOOP_EXPR, tmp);
1472 gfc_add_expr_to_block (&implied_do_block, tmp);
1474 /* Add the exit label. */
1475 tmp = build1_v (LABEL_EXPR, exit_label);
1476 gfc_add_expr_to_block (&implied_do_block, tmp);
1478 /* Finishe the implied-do loop. */
1479 tmp = gfc_finish_block(&implied_do_block);
1480 gfc_add_expr_to_block(pblock, tmp);
1482 gfc_restore_sym (c->iterator->var->symtree->n.sym, &saved_loopvar);
1489 /* Figure out the string length of a variable reference expression.
1490 Used by get_array_ctor_strlen. */
1493 get_array_ctor_var_strlen (gfc_expr * expr, tree * len)
1499 /* Don't bother if we already know the length is a constant. */
1500 if (*len && INTEGER_CST_P (*len))
1503 ts = &expr->symtree->n.sym->ts;
1504 for (ref = expr->ref; ref; ref = ref->next)
1509 /* Array references don't change the string length. */
1513 /* Use the length of the component. */
1514 ts = &ref->u.c.component->ts;
1518 if (ref->u.ss.start->expr_type != EXPR_CONSTANT
1519 || ref->u.ss.end->expr_type != EXPR_CONSTANT)
1521 mpz_init_set_ui (char_len, 1);
1522 mpz_add (char_len, char_len, ref->u.ss.end->value.integer);
1523 mpz_sub (char_len, char_len, ref->u.ss.start->value.integer);
1524 *len = gfc_conv_mpz_to_tree (char_len, gfc_default_integer_kind);
1525 *len = convert (gfc_charlen_type_node, *len);
1526 mpz_clear (char_len);
1530 /* TODO: Substrings are tricky because we can't evaluate the
1531 expression more than once. For now we just give up, and hope
1532 we can figure it out elsewhere. */
1537 *len = ts->u.cl->backend_decl;
1541 /* A catch-all to obtain the string length for anything that is not a
1542 constant, array or variable. */
1544 get_array_ctor_all_strlen (stmtblock_t *block, gfc_expr *e, tree *len)
1549 /* Don't bother if we already know the length is a constant. */
1550 if (*len && INTEGER_CST_P (*len))
1553 if (!e->ref && e->ts.u.cl && e->ts.u.cl->length
1554 && e->ts.u.cl->length->expr_type == EXPR_CONSTANT)
1557 gfc_conv_const_charlen (e->ts.u.cl);
1558 *len = e->ts.u.cl->backend_decl;
1562 /* Otherwise, be brutal even if inefficient. */
1563 ss = gfc_walk_expr (e);
1564 gfc_init_se (&se, NULL);
1566 /* No function call, in case of side effects. */
1567 se.no_function_call = 1;
1568 if (ss == gfc_ss_terminator)
1569 gfc_conv_expr (&se, e);
1571 gfc_conv_expr_descriptor (&se, e, ss);
1573 /* Fix the value. */
1574 *len = gfc_evaluate_now (se.string_length, &se.pre);
1576 gfc_add_block_to_block (block, &se.pre);
1577 gfc_add_block_to_block (block, &se.post);
1579 e->ts.u.cl->backend_decl = *len;
1584 /* Figure out the string length of a character array constructor.
1585 If len is NULL, don't calculate the length; this happens for recursive calls
1586 when a sub-array-constructor is an element but not at the first position,
1587 so when we're not interested in the length.
1588 Returns TRUE if all elements are character constants. */
1591 get_array_ctor_strlen (stmtblock_t *block, gfc_constructor_base base, tree * len)
1598 if (gfc_constructor_first (base) == NULL)
1601 *len = build_int_cstu (gfc_charlen_type_node, 0);
1605 /* Loop over all constructor elements to find out is_const, but in len we
1606 want to store the length of the first, not the last, element. We can
1607 of course exit the loop as soon as is_const is found to be false. */
1608 for (c = gfc_constructor_first (base);
1609 c && is_const; c = gfc_constructor_next (c))
1611 switch (c->expr->expr_type)
1614 if (len && !(*len && INTEGER_CST_P (*len)))
1615 *len = build_int_cstu (gfc_charlen_type_node,
1616 c->expr->value.character.length);
1620 if (!get_array_ctor_strlen (block, c->expr->value.constructor, len))
1627 get_array_ctor_var_strlen (c->expr, len);
1633 get_array_ctor_all_strlen (block, c->expr, len);
1637 /* After the first iteration, we don't want the length modified. */
1644 /* Check whether the array constructor C consists entirely of constant
1645 elements, and if so returns the number of those elements, otherwise
1646 return zero. Note, an empty or NULL array constructor returns zero. */
1648 unsigned HOST_WIDE_INT
1649 gfc_constant_array_constructor_p (gfc_constructor_base base)
1651 unsigned HOST_WIDE_INT nelem = 0;
1653 gfc_constructor *c = gfc_constructor_first (base);
1657 || c->expr->rank > 0
1658 || c->expr->expr_type != EXPR_CONSTANT)
1660 c = gfc_constructor_next (c);
1667 /* Given EXPR, the constant array constructor specified by an EXPR_ARRAY,
1668 and the tree type of it's elements, TYPE, return a static constant
1669 variable that is compile-time initialized. */
1672 gfc_build_constant_array_constructor (gfc_expr * expr, tree type)
1674 tree tmptype, list, init, tmp;
1675 HOST_WIDE_INT nelem;
1681 /* First traverse the constructor list, converting the constants
1682 to tree to build an initializer. */
1685 c = gfc_constructor_first (expr->value.constructor);
1688 gfc_init_se (&se, NULL);
1689 gfc_conv_constant (&se, c->expr);
1690 if (c->expr->ts.type != BT_CHARACTER)
1691 se.expr = fold_convert (type, se.expr);
1692 else if (POINTER_TYPE_P (type))
1693 se.expr = gfc_build_addr_expr (gfc_get_pchar_type (c->expr->ts.kind),
1695 list = tree_cons (build_int_cst (gfc_array_index_type, nelem),
1697 c = gfc_constructor_next (c);
1701 /* Next determine the tree type for the array. We use the gfortran
1702 front-end's gfc_get_nodesc_array_type in order to create a suitable
1703 GFC_ARRAY_TYPE_P that may be used by the scalarizer. */
1705 memset (&as, 0, sizeof (gfc_array_spec));
1707 as.rank = expr->rank;
1708 as.type = AS_EXPLICIT;
1711 as.lower[0] = gfc_get_int_expr (gfc_default_integer_kind, NULL, 0);
1712 as.upper[0] = gfc_get_int_expr (gfc_default_integer_kind,
1716 for (i = 0; i < expr->rank; i++)
1718 int tmp = (int) mpz_get_si (expr->shape[i]);
1719 as.lower[i] = gfc_get_int_expr (gfc_default_integer_kind, NULL, 0);
1720 as.upper[i] = gfc_get_int_expr (gfc_default_integer_kind,
1724 tmptype = gfc_get_nodesc_array_type (type, &as, PACKED_STATIC, true);
1726 init = build_constructor_from_list (tmptype, nreverse (list));
1728 TREE_CONSTANT (init) = 1;
1729 TREE_STATIC (init) = 1;
1731 tmp = gfc_create_var (tmptype, "A");
1732 TREE_STATIC (tmp) = 1;
1733 TREE_CONSTANT (tmp) = 1;
1734 TREE_READONLY (tmp) = 1;
1735 DECL_INITIAL (tmp) = init;
1741 /* Translate a constant EXPR_ARRAY array constructor for the scalarizer.
1742 This mostly initializes the scalarizer state info structure with the
1743 appropriate values to directly use the array created by the function
1744 gfc_build_constant_array_constructor. */
1747 gfc_trans_constant_array_constructor (gfc_loopinfo * loop,
1748 gfc_ss * ss, tree type)
1754 tmp = gfc_build_constant_array_constructor (ss->expr, type);
1756 info = &ss->data.info;
1758 info->descriptor = tmp;
1759 info->data = gfc_build_addr_expr (NULL_TREE, tmp);
1760 info->offset = gfc_index_zero_node;
1762 for (i = 0; i < info->dimen; i++)
1764 info->delta[i] = gfc_index_zero_node;
1765 info->start[i] = gfc_index_zero_node;
1766 info->end[i] = gfc_index_zero_node;
1767 info->stride[i] = gfc_index_one_node;
1771 if (info->dimen > loop->temp_dim)
1772 loop->temp_dim = info->dimen;
1775 /* Helper routine of gfc_trans_array_constructor to determine if the
1776 bounds of the loop specified by LOOP are constant and simple enough
1777 to use with gfc_trans_constant_array_constructor. Returns the
1778 iteration count of the loop if suitable, and NULL_TREE otherwise. */
1781 constant_array_constructor_loop_size (gfc_loopinfo * loop)
1783 tree size = gfc_index_one_node;
1787 for (i = 0; i < loop->dimen; i++)
1789 /* If the bounds aren't constant, return NULL_TREE. */
1790 if (!INTEGER_CST_P (loop->from[i]) || !INTEGER_CST_P (loop->to[i]))
1792 if (!integer_zerop (loop->from[i]))
1794 /* Only allow nonzero "from" in one-dimensional arrays. */
1795 if (loop->dimen != 1)
1797 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
1798 loop->to[i], loop->from[i]);
1802 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
1803 tmp, gfc_index_one_node);
1804 size = fold_build2 (MULT_EXPR, gfc_array_index_type, size, tmp);
1811 /* Array constructors are handled by constructing a temporary, then using that
1812 within the scalarization loop. This is not optimal, but seems by far the
1816 gfc_trans_array_constructor (gfc_loopinfo * loop, gfc_ss * ss, locus * where)
1818 gfc_constructor_base c;
1824 bool old_first_len, old_typespec_chararray_ctor;
1825 tree old_first_len_val;
1827 /* Save the old values for nested checking. */
1828 old_first_len = first_len;
1829 old_first_len_val = first_len_val;
1830 old_typespec_chararray_ctor = typespec_chararray_ctor;
1832 /* Do bounds-checking here and in gfc_trans_array_ctor_element only if no
1833 typespec was given for the array constructor. */
1834 typespec_chararray_ctor = (ss->expr->ts.u.cl
1835 && ss->expr->ts.u.cl->length_from_typespec);
1837 if ((gfc_option.rtcheck & GFC_RTCHECK_BOUNDS)
1838 && ss->expr->ts.type == BT_CHARACTER && !typespec_chararray_ctor)
1840 first_len_val = gfc_create_var (gfc_charlen_type_node, "len");
1844 ss->data.info.dimen = loop->dimen;
1846 c = ss->expr->value.constructor;
1847 if (ss->expr->ts.type == BT_CHARACTER)
1851 /* get_array_ctor_strlen walks the elements of the constructor, if a
1852 typespec was given, we already know the string length and want the one
1854 if (typespec_chararray_ctor && ss->expr->ts.u.cl->length
1855 && ss->expr->ts.u.cl->length->expr_type != EXPR_CONSTANT)
1859 const_string = false;
1860 gfc_init_se (&length_se, NULL);
1861 gfc_conv_expr_type (&length_se, ss->expr->ts.u.cl->length,
1862 gfc_charlen_type_node);
1863 ss->string_length = length_se.expr;
1864 gfc_add_block_to_block (&loop->pre, &length_se.pre);
1865 gfc_add_block_to_block (&loop->post, &length_se.post);
1868 const_string = get_array_ctor_strlen (&loop->pre, c,
1869 &ss->string_length);
1871 /* Complex character array constructors should have been taken care of
1872 and not end up here. */
1873 gcc_assert (ss->string_length);
1875 ss->expr->ts.u.cl->backend_decl = ss->string_length;
1877 type = gfc_get_character_type_len (ss->expr->ts.kind, ss->string_length);
1879 type = build_pointer_type (type);
1882 type = gfc_typenode_for_spec (&ss->expr->ts);
1884 /* See if the constructor determines the loop bounds. */
1887 if (ss->expr->shape && loop->dimen > 1 && loop->to[0] == NULL_TREE)
1889 /* We have a multidimensional parameter. */
1891 for (n = 0; n < ss->expr->rank; n++)
1893 loop->from[n] = gfc_index_zero_node;
1894 loop->to[n] = gfc_conv_mpz_to_tree (ss->expr->shape [n],
1895 gfc_index_integer_kind);
1896 loop->to[n] = fold_build2 (MINUS_EXPR, gfc_array_index_type,
1897 loop->to[n], gfc_index_one_node);
1901 if (loop->to[0] == NULL_TREE)
1905 /* We should have a 1-dimensional, zero-based loop. */
1906 gcc_assert (loop->dimen == 1);
1907 gcc_assert (integer_zerop (loop->from[0]));
1909 /* Split the constructor size into a static part and a dynamic part.
1910 Allocate the static size up-front and record whether the dynamic
1911 size might be nonzero. */
1913 dynamic = gfc_get_array_constructor_size (&size, c);
1914 mpz_sub_ui (size, size, 1);
1915 loop->to[0] = gfc_conv_mpz_to_tree (size, gfc_index_integer_kind);
1919 /* Special case constant array constructors. */
1922 unsigned HOST_WIDE_INT nelem = gfc_constant_array_constructor_p (c);
1925 tree size = constant_array_constructor_loop_size (loop);
1926 if (size && compare_tree_int (size, nelem) == 0)
1928 gfc_trans_constant_array_constructor (loop, ss, type);
1934 gfc_trans_create_temp_array (&loop->pre, &loop->post, loop, &ss->data.info,
1935 type, NULL_TREE, dynamic, true, false, where);
1937 desc = ss->data.info.descriptor;
1938 offset = gfc_index_zero_node;
1939 offsetvar = gfc_create_var_np (gfc_array_index_type, "offset");
1940 TREE_NO_WARNING (offsetvar) = 1;
1941 TREE_USED (offsetvar) = 0;
1942 gfc_trans_array_constructor_value (&loop->pre, type, desc, c,
1943 &offset, &offsetvar, dynamic);
1945 /* If the array grows dynamically, the upper bound of the loop variable
1946 is determined by the array's final upper bound. */
1948 loop->to[0] = gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[0]);
1950 if (TREE_USED (offsetvar))
1951 pushdecl (offsetvar);
1953 gcc_assert (INTEGER_CST_P (offset));
1955 /* Disable bound checking for now because it's probably broken. */
1956 if (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS)
1963 /* Restore old values of globals. */
1964 first_len = old_first_len;
1965 first_len_val = old_first_len_val;
1966 typespec_chararray_ctor = old_typespec_chararray_ctor;
1970 /* INFO describes a GFC_SS_SECTION in loop LOOP, and this function is
1971 called after evaluating all of INFO's vector dimensions. Go through
1972 each such vector dimension and see if we can now fill in any missing
1976 gfc_set_vector_loop_bounds (gfc_loopinfo * loop, gfc_ss_info * info)
1985 for (n = 0; n < loop->dimen; n++)
1988 if (info->ref->u.ar.dimen_type[dim] == DIMEN_VECTOR
1989 && loop->to[n] == NULL)
1991 /* Loop variable N indexes vector dimension DIM, and we don't
1992 yet know the upper bound of loop variable N. Set it to the
1993 difference between the vector's upper and lower bounds. */
1994 gcc_assert (loop->from[n] == gfc_index_zero_node);
1995 gcc_assert (info->subscript[dim]
1996 && info->subscript[dim]->type == GFC_SS_VECTOR);
1998 gfc_init_se (&se, NULL);
1999 desc = info->subscript[dim]->data.info.descriptor;
2000 zero = gfc_rank_cst[0];
2001 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
2002 gfc_conv_descriptor_ubound_get (desc, zero),
2003 gfc_conv_descriptor_lbound_get (desc, zero));
2004 tmp = gfc_evaluate_now (tmp, &loop->pre);
2011 /* Add the pre and post chains for all the scalar expressions in a SS chain
2012 to loop. This is called after the loop parameters have been calculated,
2013 but before the actual scalarizing loops. */
2016 gfc_add_loop_ss_code (gfc_loopinfo * loop, gfc_ss * ss, bool subscript,
2022 /* TODO: This can generate bad code if there are ordering dependencies,
2023 e.g., a callee allocated function and an unknown size constructor. */
2024 gcc_assert (ss != NULL);
2026 for (; ss != gfc_ss_terminator; ss = ss->loop_chain)
2033 /* Scalar expression. Evaluate this now. This includes elemental
2034 dimension indices, but not array section bounds. */
2035 gfc_init_se (&se, NULL);
2036 gfc_conv_expr (&se, ss->expr);
2037 gfc_add_block_to_block (&loop->pre, &se.pre);
2039 if (ss->expr->ts.type != BT_CHARACTER)
2041 /* Move the evaluation of scalar expressions outside the
2042 scalarization loop, except for WHERE assignments. */
2044 se.expr = convert(gfc_array_index_type, se.expr);
2046 se.expr = gfc_evaluate_now (se.expr, &loop->pre);
2047 gfc_add_block_to_block (&loop->pre, &se.post);
2050 gfc_add_block_to_block (&loop->post, &se.post);
2052 ss->data.scalar.expr = se.expr;
2053 ss->string_length = se.string_length;
2056 case GFC_SS_REFERENCE:
2057 /* Scalar reference. Evaluate this now. */
2058 gfc_init_se (&se, NULL);
2059 gfc_conv_expr_reference (&se, ss->expr);
2060 gfc_add_block_to_block (&loop->pre, &se.pre);
2061 gfc_add_block_to_block (&loop->post, &se.post);
2063 ss->data.scalar.expr = gfc_evaluate_now (se.expr, &loop->pre);
2064 ss->string_length = se.string_length;
2067 case GFC_SS_SECTION:
2068 /* Add the expressions for scalar and vector subscripts. */
2069 for (n = 0; n < GFC_MAX_DIMENSIONS; n++)
2070 if (ss->data.info.subscript[n])
2071 gfc_add_loop_ss_code (loop, ss->data.info.subscript[n], true,
2074 gfc_set_vector_loop_bounds (loop, &ss->data.info);
2078 /* Get the vector's descriptor and store it in SS. */
2079 gfc_init_se (&se, NULL);
2080 gfc_conv_expr_descriptor (&se, ss->expr, gfc_walk_expr (ss->expr));
2081 gfc_add_block_to_block (&loop->pre, &se.pre);
2082 gfc_add_block_to_block (&loop->post, &se.post);
2083 ss->data.info.descriptor = se.expr;
2086 case GFC_SS_INTRINSIC:
2087 gfc_add_intrinsic_ss_code (loop, ss);
2090 case GFC_SS_FUNCTION:
2091 /* Array function return value. We call the function and save its
2092 result in a temporary for use inside the loop. */
2093 gfc_init_se (&se, NULL);
2096 gfc_conv_expr (&se, ss->expr);
2097 gfc_add_block_to_block (&loop->pre, &se.pre);
2098 gfc_add_block_to_block (&loop->post, &se.post);
2099 ss->string_length = se.string_length;
2102 case GFC_SS_CONSTRUCTOR:
2103 if (ss->expr->ts.type == BT_CHARACTER
2104 && ss->string_length == NULL
2105 && ss->expr->ts.u.cl
2106 && ss->expr->ts.u.cl->length)
2108 gfc_init_se (&se, NULL);
2109 gfc_conv_expr_type (&se, ss->expr->ts.u.cl->length,
2110 gfc_charlen_type_node);
2111 ss->string_length = se.expr;
2112 gfc_add_block_to_block (&loop->pre, &se.pre);
2113 gfc_add_block_to_block (&loop->post, &se.post);
2115 gfc_trans_array_constructor (loop, ss, where);
2119 case GFC_SS_COMPONENT:
2120 /* Do nothing. These are handled elsewhere. */
2130 /* Translate expressions for the descriptor and data pointer of a SS. */
2134 gfc_conv_ss_descriptor (stmtblock_t * block, gfc_ss * ss, int base)
2139 /* Get the descriptor for the array to be scalarized. */
2140 gcc_assert (ss->expr->expr_type == EXPR_VARIABLE);
2141 gfc_init_se (&se, NULL);
2142 se.descriptor_only = 1;
2143 gfc_conv_expr_lhs (&se, ss->expr);
2144 gfc_add_block_to_block (block, &se.pre);
2145 ss->data.info.descriptor = se.expr;
2146 ss->string_length = se.string_length;
2150 /* Also the data pointer. */
2151 tmp = gfc_conv_array_data (se.expr);
2152 /* If this is a variable or address of a variable we use it directly.
2153 Otherwise we must evaluate it now to avoid breaking dependency
2154 analysis by pulling the expressions for elemental array indices
2157 || (TREE_CODE (tmp) == ADDR_EXPR
2158 && DECL_P (TREE_OPERAND (tmp, 0)))))
2159 tmp = gfc_evaluate_now (tmp, block);
2160 ss->data.info.data = tmp;
2162 tmp = gfc_conv_array_offset (se.expr);
2163 ss->data.info.offset = gfc_evaluate_now (tmp, block);
2168 /* Initialize a gfc_loopinfo structure. */
2171 gfc_init_loopinfo (gfc_loopinfo * loop)
2175 memset (loop, 0, sizeof (gfc_loopinfo));
2176 gfc_init_block (&loop->pre);
2177 gfc_init_block (&loop->post);
2179 /* Initially scalarize in order. */
2180 for (n = 0; n < GFC_MAX_DIMENSIONS; n++)
2183 loop->ss = gfc_ss_terminator;
2187 /* Copies the loop variable info to a gfc_se structure. Does not copy the SS
2191 gfc_copy_loopinfo_to_se (gfc_se * se, gfc_loopinfo * loop)
2197 /* Return an expression for the data pointer of an array. */
2200 gfc_conv_array_data (tree descriptor)
2204 type = TREE_TYPE (descriptor);
2205 if (GFC_ARRAY_TYPE_P (type))
2207 if (TREE_CODE (type) == POINTER_TYPE)
2211 /* Descriptorless arrays. */
2212 return gfc_build_addr_expr (NULL_TREE, descriptor);
2216 return gfc_conv_descriptor_data_get (descriptor);
2220 /* Return an expression for the base offset of an array. */
2223 gfc_conv_array_offset (tree descriptor)
2227 type = TREE_TYPE (descriptor);
2228 if (GFC_ARRAY_TYPE_P (type))
2229 return GFC_TYPE_ARRAY_OFFSET (type);
2231 return gfc_conv_descriptor_offset_get (descriptor);
2235 /* Get an expression for the array stride. */
2238 gfc_conv_array_stride (tree descriptor, int dim)
2243 type = TREE_TYPE (descriptor);
2245 /* For descriptorless arrays use the array size. */
2246 tmp = GFC_TYPE_ARRAY_STRIDE (type, dim);
2247 if (tmp != NULL_TREE)
2250 tmp = gfc_conv_descriptor_stride_get (descriptor, gfc_rank_cst[dim]);
2255 /* Like gfc_conv_array_stride, but for the lower bound. */
2258 gfc_conv_array_lbound (tree descriptor, int dim)
2263 type = TREE_TYPE (descriptor);
2265 tmp = GFC_TYPE_ARRAY_LBOUND (type, dim);
2266 if (tmp != NULL_TREE)
2269 tmp = gfc_conv_descriptor_lbound_get (descriptor, gfc_rank_cst[dim]);
2274 /* Like gfc_conv_array_stride, but for the upper bound. */
2277 gfc_conv_array_ubound (tree descriptor, int dim)
2282 type = TREE_TYPE (descriptor);
2284 tmp = GFC_TYPE_ARRAY_UBOUND (type, dim);
2285 if (tmp != NULL_TREE)
2288 /* This should only ever happen when passing an assumed shape array
2289 as an actual parameter. The value will never be used. */
2290 if (GFC_ARRAY_TYPE_P (TREE_TYPE (descriptor)))
2291 return gfc_index_zero_node;
2293 tmp = gfc_conv_descriptor_ubound_get (descriptor, gfc_rank_cst[dim]);
2298 /* Generate code to perform an array index bound check. */
2301 gfc_trans_array_bound_check (gfc_se * se, tree descriptor, tree index, int n,
2302 locus * where, bool check_upper)
2305 tree tmp_lo, tmp_up;
2307 const char * name = NULL;
2309 if (!(gfc_option.rtcheck & GFC_RTCHECK_BOUNDS))
2312 index = gfc_evaluate_now (index, &se->pre);
2314 /* We find a name for the error message. */
2316 name = se->ss->expr->symtree->name;
2318 if (!name && se->loop && se->loop->ss && se->loop->ss->expr
2319 && se->loop->ss->expr->symtree)
2320 name = se->loop->ss->expr->symtree->name;
2322 if (!name && se->loop && se->loop->ss && se->loop->ss->loop_chain
2323 && se->loop->ss->loop_chain->expr
2324 && se->loop->ss->loop_chain->expr->symtree)
2325 name = se->loop->ss->loop_chain->expr->symtree->name;
2327 if (!name && se->loop && se->loop->ss && se->loop->ss->loop_chain
2328 && se->loop->ss->loop_chain->expr->symtree)
2329 name = se->loop->ss->loop_chain->expr->symtree->name;
2331 if (!name && se->loop && se->loop->ss && se->loop->ss->expr)
2333 if (se->loop->ss->expr->expr_type == EXPR_FUNCTION
2334 && se->loop->ss->expr->value.function.name)
2335 name = se->loop->ss->expr->value.function.name;
2337 if (se->loop->ss->type == GFC_SS_CONSTRUCTOR
2338 || se->loop->ss->type == GFC_SS_SCALAR)
2339 name = "unnamed constant";
2342 /* If upper bound is present, include both bounds in the error message. */
2345 tmp_lo = gfc_conv_array_lbound (descriptor, n);
2346 tmp_up = gfc_conv_array_ubound (descriptor, n);
2349 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
2350 "outside of expected range (%%ld:%%ld)", n+1, name);
2352 asprintf (&msg, "Index '%%ld' of dimension %d "
2353 "outside of expected range (%%ld:%%ld)", n+1);
2355 fault = fold_build2 (LT_EXPR, boolean_type_node, index, tmp_lo);
2356 gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg,
2357 fold_convert (long_integer_type_node, index),
2358 fold_convert (long_integer_type_node, tmp_lo),
2359 fold_convert (long_integer_type_node, tmp_up));
2360 fault = fold_build2 (GT_EXPR, boolean_type_node, index, tmp_up);
2361 gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg,
2362 fold_convert (long_integer_type_node, index),
2363 fold_convert (long_integer_type_node, tmp_lo),
2364 fold_convert (long_integer_type_node, tmp_up));
2369 tmp_lo = gfc_conv_array_lbound (descriptor, n);
2372 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
2373 "below lower bound of %%ld", n+1, name);
2375 asprintf (&msg, "Index '%%ld' of dimension %d "
2376 "below lower bound of %%ld", n+1);
2378 fault = fold_build2 (LT_EXPR, boolean_type_node, index, tmp_lo);
2379 gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg,
2380 fold_convert (long_integer_type_node, index),
2381 fold_convert (long_integer_type_node, tmp_lo));
2389 /* Return the offset for an index. Performs bound checking for elemental
2390 dimensions. Single element references are processed separately. */
2393 gfc_conv_array_index_offset (gfc_se * se, gfc_ss_info * info, int dim, int i,
2394 gfc_array_ref * ar, tree stride)
2400 /* Get the index into the array for this dimension. */
2403 gcc_assert (ar->type != AR_ELEMENT);
2404 switch (ar->dimen_type[dim])
2407 /* Elemental dimension. */
2408 gcc_assert (info->subscript[dim]
2409 && info->subscript[dim]->type == GFC_SS_SCALAR);
2410 /* We've already translated this value outside the loop. */
2411 index = info->subscript[dim]->data.scalar.expr;
2413 index = gfc_trans_array_bound_check (se, info->descriptor,
2414 index, dim, &ar->where,
2415 ar->as->type != AS_ASSUMED_SIZE
2416 || dim < ar->dimen - 1);
2420 gcc_assert (info && se->loop);
2421 gcc_assert (info->subscript[dim]
2422 && info->subscript[dim]->type == GFC_SS_VECTOR);
2423 desc = info->subscript[dim]->data.info.descriptor;
2425 /* Get a zero-based index into the vector. */
2426 index = fold_build2 (MINUS_EXPR, gfc_array_index_type,
2427 se->loop->loopvar[i], se->loop->from[i]);
2429 /* Multiply the index by the stride. */
2430 index = fold_build2 (MULT_EXPR, gfc_array_index_type,
2431 index, gfc_conv_array_stride (desc, 0));
2433 /* Read the vector to get an index into info->descriptor. */
2434 data = build_fold_indirect_ref_loc (input_location,
2435 gfc_conv_array_data (desc));
2436 index = gfc_build_array_ref (data, index, NULL);
2437 index = gfc_evaluate_now (index, &se->pre);
2439 /* Do any bounds checking on the final info->descriptor index. */
2440 index = gfc_trans_array_bound_check (se, info->descriptor,
2441 index, dim, &ar->where,
2442 ar->as->type != AS_ASSUMED_SIZE
2443 || dim < ar->dimen - 1);
2447 /* Scalarized dimension. */
2448 gcc_assert (info && se->loop);
2450 /* Multiply the loop variable by the stride and delta. */
2451 index = se->loop->loopvar[i];
2452 if (!integer_onep (info->stride[i]))
2453 index = fold_build2 (MULT_EXPR, gfc_array_index_type, index,
2455 if (!integer_zerop (info->delta[i]))
2456 index = fold_build2 (PLUS_EXPR, gfc_array_index_type, index,
2466 /* Temporary array or derived type component. */
2467 gcc_assert (se->loop);
2468 index = se->loop->loopvar[se->loop->order[i]];
2469 if (!integer_zerop (info->delta[i]))
2470 index = fold_build2 (PLUS_EXPR, gfc_array_index_type,
2471 index, info->delta[i]);
2474 /* Multiply by the stride. */
2475 if (!integer_onep (stride))
2476 index = fold_build2 (MULT_EXPR, gfc_array_index_type, index, stride);
2482 /* Build a scalarized reference to an array. */
2485 gfc_conv_scalarized_array_ref (gfc_se * se, gfc_array_ref * ar)
2488 tree decl = NULL_TREE;
2493 info = &se->ss->data.info;
2495 n = se->loop->order[0];
2499 index = gfc_conv_array_index_offset (se, info, info->dim[n], n, ar,
2501 /* Add the offset for this dimension to the stored offset for all other
2503 if (!integer_zerop (info->offset))
2504 index = fold_build2 (PLUS_EXPR, gfc_array_index_type, index, info->offset);
2506 if (se->ss->expr && is_subref_array (se->ss->expr))
2507 decl = se->ss->expr->symtree->n.sym->backend_decl;
2509 tmp = build_fold_indirect_ref_loc (input_location,
2511 se->expr = gfc_build_array_ref (tmp, index, decl);
2515 /* Translate access of temporary array. */
2518 gfc_conv_tmp_array_ref (gfc_se * se)
2520 se->string_length = se->ss->string_length;
2521 gfc_conv_scalarized_array_ref (se, NULL);
2525 /* Build an array reference. se->expr already holds the array descriptor.
2526 This should be either a variable, indirect variable reference or component
2527 reference. For arrays which do not have a descriptor, se->expr will be
2529 a(i, j, k) = base[offset + i * stride[0] + j * stride[1] + k * stride[2]]*/
2532 gfc_conv_array_ref (gfc_se * se, gfc_array_ref * ar, gfc_symbol * sym,
2545 /* Handle scalarized references separately. */
2546 if (ar->type != AR_ELEMENT)
2548 gfc_conv_scalarized_array_ref (se, ar);
2549 gfc_advance_se_ss_chain (se);
2553 index = gfc_index_zero_node;
2555 /* Calculate the offsets from all the dimensions. */
2556 for (n = 0; n < ar->dimen; n++)
2558 /* Calculate the index for this dimension. */
2559 gfc_init_se (&indexse, se);
2560 gfc_conv_expr_type (&indexse, ar->start[n], gfc_array_index_type);
2561 gfc_add_block_to_block (&se->pre, &indexse.pre);
2563 if (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS)
2565 /* Check array bounds. */
2569 /* Evaluate the indexse.expr only once. */
2570 indexse.expr = save_expr (indexse.expr);
2573 tmp = gfc_conv_array_lbound (se->expr, n);
2574 if (sym->attr.temporary)
2576 gfc_init_se (&tmpse, se);
2577 gfc_conv_expr_type (&tmpse, ar->as->lower[n],
2578 gfc_array_index_type);
2579 gfc_add_block_to_block (&se->pre, &tmpse.pre);
2583 cond = fold_build2 (LT_EXPR, boolean_type_node,
2585 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
2586 "below lower bound of %%ld", n+1, sym->name);
2587 gfc_trans_runtime_check (true, false, cond, &se->pre, where, msg,
2588 fold_convert (long_integer_type_node,
2590 fold_convert (long_integer_type_node, tmp));
2593 /* Upper bound, but not for the last dimension of assumed-size
2595 if (n < ar->dimen - 1 || ar->as->type != AS_ASSUMED_SIZE)
2597 tmp = gfc_conv_array_ubound (se->expr, n);
2598 if (sym->attr.temporary)
2600 gfc_init_se (&tmpse, se);
2601 gfc_conv_expr_type (&tmpse, ar->as->upper[n],
2602 gfc_array_index_type);
2603 gfc_add_block_to_block (&se->pre, &tmpse.pre);
2607 cond = fold_build2 (GT_EXPR, boolean_type_node,
2609 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
2610 "above upper bound of %%ld", n+1, sym->name);
2611 gfc_trans_runtime_check (true, false, cond, &se->pre, where, msg,
2612 fold_convert (long_integer_type_node,
2614 fold_convert (long_integer_type_node, tmp));
2619 /* Multiply the index by the stride. */
2620 stride = gfc_conv_array_stride (se->expr, n);
2621 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type, indexse.expr,
2624 /* And add it to the total. */
2625 index = fold_build2 (PLUS_EXPR, gfc_array_index_type, index, tmp);
2628 tmp = gfc_conv_array_offset (se->expr);
2629 if (!integer_zerop (tmp))
2630 index = fold_build2 (PLUS_EXPR, gfc_array_index_type, index, tmp);
2632 /* Access the calculated element. */
2633 tmp = gfc_conv_array_data (se->expr);
2634 tmp = build_fold_indirect_ref (tmp);
2635 se->expr = gfc_build_array_ref (tmp, index, sym->backend_decl);
2639 /* Generate the code to be executed immediately before entering a
2640 scalarization loop. */
2643 gfc_trans_preloop_setup (gfc_loopinfo * loop, int dim, int flag,
2644 stmtblock_t * pblock)
2653 /* This code will be executed before entering the scalarization loop
2654 for this dimension. */
2655 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
2657 if ((ss->useflags & flag) == 0)
2660 if (ss->type != GFC_SS_SECTION
2661 && ss->type != GFC_SS_FUNCTION && ss->type != GFC_SS_CONSTRUCTOR
2662 && ss->type != GFC_SS_COMPONENT)
2665 info = &ss->data.info;
2667 if (dim >= info->dimen)
2670 if (dim == info->dimen - 1)
2672 /* For the outermost loop calculate the offset due to any
2673 elemental dimensions. It will have been initialized with the
2674 base offset of the array. */
2677 for (i = 0; i < info->ref->u.ar.dimen; i++)
2679 if (info->ref->u.ar.dimen_type[i] != DIMEN_ELEMENT)
2682 gfc_init_se (&se, NULL);
2684 se.expr = info->descriptor;
2685 stride = gfc_conv_array_stride (info->descriptor, i);
2686 index = gfc_conv_array_index_offset (&se, info, i, -1,
2689 gfc_add_block_to_block (pblock, &se.pre);
2691 info->offset = fold_build2 (PLUS_EXPR, gfc_array_index_type,
2692 info->offset, index);
2693 info->offset = gfc_evaluate_now (info->offset, pblock);
2697 stride = gfc_conv_array_stride (info->descriptor, info->dim[i]);
2700 stride = gfc_conv_array_stride (info->descriptor, 0);
2702 /* Calculate the stride of the innermost loop. Hopefully this will
2703 allow the backend optimizers to do their stuff more effectively.
2705 info->stride0 = gfc_evaluate_now (stride, pblock);
2709 /* Add the offset for the previous loop dimension. */
2714 ar = &info->ref->u.ar;
2715 i = loop->order[dim + 1];
2723 gfc_init_se (&se, NULL);
2725 se.expr = info->descriptor;
2726 stride = gfc_conv_array_stride (info->descriptor, info->dim[i]);
2727 index = gfc_conv_array_index_offset (&se, info, info->dim[i], i,
2729 gfc_add_block_to_block (pblock, &se.pre);
2730 info->offset = fold_build2 (PLUS_EXPR, gfc_array_index_type,
2731 info->offset, index);
2732 info->offset = gfc_evaluate_now (info->offset, pblock);
2735 /* Remember this offset for the second loop. */
2736 if (dim == loop->temp_dim - 1)
2737 info->saved_offset = info->offset;
2742 /* Start a scalarized expression. Creates a scope and declares loop
2746 gfc_start_scalarized_body (gfc_loopinfo * loop, stmtblock_t * pbody)
2752 gcc_assert (!loop->array_parameter);
2754 for (dim = loop->dimen - 1; dim >= 0; dim--)
2756 n = loop->order[dim];
2758 gfc_start_block (&loop->code[n]);
2760 /* Create the loop variable. */
2761 loop->loopvar[n] = gfc_create_var (gfc_array_index_type, "S");
2763 if (dim < loop->temp_dim)
2767 /* Calculate values that will be constant within this loop. */
2768 gfc_trans_preloop_setup (loop, dim, flags, &loop->code[n]);
2770 gfc_start_block (pbody);
2774 /* Generates the actual loop code for a scalarization loop. */
2777 gfc_trans_scalarized_loop_end (gfc_loopinfo * loop, int n,
2778 stmtblock_t * pbody)
2789 if ((ompws_flags & (OMPWS_WORKSHARE_FLAG | OMPWS_SCALARIZER_WS))
2790 == (OMPWS_WORKSHARE_FLAG | OMPWS_SCALARIZER_WS)
2791 && n == loop->dimen - 1)
2793 /* We create an OMP_FOR construct for the outermost scalarized loop. */
2794 init = make_tree_vec (1);
2795 cond = make_tree_vec (1);
2796 incr = make_tree_vec (1);
2798 /* Cycle statement is implemented with a goto. Exit statement must not
2799 be present for this loop. */
2800 exit_label = gfc_build_label_decl (NULL_TREE);
2801 TREE_USED (exit_label) = 1;
2803 /* Label for cycle statements (if needed). */
2804 tmp = build1_v (LABEL_EXPR, exit_label);
2805 gfc_add_expr_to_block (pbody, tmp);
2807 stmt = make_node (OMP_FOR);
2809 TREE_TYPE (stmt) = void_type_node;
2810 OMP_FOR_BODY (stmt) = loopbody = gfc_finish_block (pbody);
2812 OMP_FOR_CLAUSES (stmt) = build_omp_clause (input_location,
2813 OMP_CLAUSE_SCHEDULE);
2814 OMP_CLAUSE_SCHEDULE_KIND (OMP_FOR_CLAUSES (stmt))
2815 = OMP_CLAUSE_SCHEDULE_STATIC;
2816 if (ompws_flags & OMPWS_NOWAIT)
2817 OMP_CLAUSE_CHAIN (OMP_FOR_CLAUSES (stmt))
2818 = build_omp_clause (input_location, OMP_CLAUSE_NOWAIT);
2820 /* Initialize the loopvar. */
2821 TREE_VEC_ELT (init, 0) = build2_v (MODIFY_EXPR, loop->loopvar[n],
2823 OMP_FOR_INIT (stmt) = init;
2824 /* The exit condition. */
2825 TREE_VEC_ELT (cond, 0) = build2 (LE_EXPR, boolean_type_node,
2826 loop->loopvar[n], loop->to[n]);
2827 OMP_FOR_COND (stmt) = cond;
2828 /* Increment the loopvar. */
2829 tmp = build2 (PLUS_EXPR, gfc_array_index_type,
2830 loop->loopvar[n], gfc_index_one_node);
2831 TREE_VEC_ELT (incr, 0) = fold_build2 (MODIFY_EXPR,
2832 void_type_node, loop->loopvar[n], tmp);
2833 OMP_FOR_INCR (stmt) = incr;
2835 ompws_flags &= ~OMPWS_CURR_SINGLEUNIT;
2836 gfc_add_expr_to_block (&loop->code[n], stmt);
2840 loopbody = gfc_finish_block (pbody);
2842 /* Initialize the loopvar. */
2843 if (loop->loopvar[n] != loop->from[n])
2844 gfc_add_modify (&loop->code[n], loop->loopvar[n], loop->from[n]);
2846 exit_label = gfc_build_label_decl (NULL_TREE);
2848 /* Generate the loop body. */
2849 gfc_init_block (&block);
2851 /* The exit condition. */
2852 cond = fold_build2 (GT_EXPR, boolean_type_node,
2853 loop->loopvar[n], loop->to[n]);
2854 tmp = build1_v (GOTO_EXPR, exit_label);
2855 TREE_USED (exit_label) = 1;
2856 tmp = build3_v (COND_EXPR, cond, tmp, build_empty_stmt (input_location));
2857 gfc_add_expr_to_block (&block, tmp);
2859 /* The main body. */
2860 gfc_add_expr_to_block (&block, loopbody);
2862 /* Increment the loopvar. */
2863 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
2864 loop->loopvar[n], gfc_index_one_node);
2865 gfc_add_modify (&block, loop->loopvar[n], tmp);
2867 /* Build the loop. */
2868 tmp = gfc_finish_block (&block);
2869 tmp = build1_v (LOOP_EXPR, tmp);
2870 gfc_add_expr_to_block (&loop->code[n], tmp);
2872 /* Add the exit label. */
2873 tmp = build1_v (LABEL_EXPR, exit_label);
2874 gfc_add_expr_to_block (&loop->code[n], tmp);
2880 /* Finishes and generates the loops for a scalarized expression. */
2883 gfc_trans_scalarizing_loops (gfc_loopinfo * loop, stmtblock_t * body)
2888 stmtblock_t *pblock;
2892 /* Generate the loops. */
2893 for (dim = 0; dim < loop->dimen; dim++)
2895 n = loop->order[dim];
2896 gfc_trans_scalarized_loop_end (loop, n, pblock);
2897 loop->loopvar[n] = NULL_TREE;
2898 pblock = &loop->code[n];
2901 tmp = gfc_finish_block (pblock);
2902 gfc_add_expr_to_block (&loop->pre, tmp);
2904 /* Clear all the used flags. */
2905 for (ss = loop->ss; ss; ss = ss->loop_chain)
2910 /* Finish the main body of a scalarized expression, and start the secondary
2914 gfc_trans_scalarized_loop_boundary (gfc_loopinfo * loop, stmtblock_t * body)
2918 stmtblock_t *pblock;
2922 /* We finish as many loops as are used by the temporary. */
2923 for (dim = 0; dim < loop->temp_dim - 1; dim++)
2925 n = loop->order[dim];
2926 gfc_trans_scalarized_loop_end (loop, n, pblock);
2927 loop->loopvar[n] = NULL_TREE;
2928 pblock = &loop->code[n];
2931 /* We don't want to finish the outermost loop entirely. */
2932 n = loop->order[loop->temp_dim - 1];
2933 gfc_trans_scalarized_loop_end (loop, n, pblock);
2935 /* Restore the initial offsets. */
2936 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
2938 if ((ss->useflags & 2) == 0)
2941 if (ss->type != GFC_SS_SECTION
2942 && ss->type != GFC_SS_FUNCTION && ss->type != GFC_SS_CONSTRUCTOR
2943 && ss->type != GFC_SS_COMPONENT)
2946 ss->data.info.offset = ss->data.info.saved_offset;
2949 /* Restart all the inner loops we just finished. */
2950 for (dim = loop->temp_dim - 2; dim >= 0; dim--)
2952 n = loop->order[dim];
2954 gfc_start_block (&loop->code[n]);
2956 loop->loopvar[n] = gfc_create_var (gfc_array_index_type, "Q");
2958 gfc_trans_preloop_setup (loop, dim, 2, &loop->code[n]);
2961 /* Start a block for the secondary copying code. */
2962 gfc_start_block (body);
2966 /* Calculate the upper bound of an array section. */
2969 gfc_conv_section_upper_bound (gfc_ss * ss, int n, stmtblock_t * pblock)
2978 gcc_assert (ss->type == GFC_SS_SECTION);
2980 info = &ss->data.info;
2983 if (info->ref->u.ar.dimen_type[dim] == DIMEN_VECTOR)
2984 /* We'll calculate the upper bound once we have access to the
2985 vector's descriptor. */
2988 gcc_assert (info->ref->u.ar.dimen_type[dim] == DIMEN_RANGE);
2989 desc = info->descriptor;
2990 end = info->ref->u.ar.end[dim];
2994 /* The upper bound was specified. */
2995 gfc_init_se (&se, NULL);
2996 gfc_conv_expr_type (&se, end, gfc_array_index_type);
2997 gfc_add_block_to_block (pblock, &se.pre);
3002 /* No upper bound was specified, so use the bound of the array. */
3003 bound = gfc_conv_array_ubound (desc, dim);
3010 /* Calculate the lower bound of an array section. */
3013 gfc_conv_section_startstride (gfc_loopinfo * loop, gfc_ss * ss, int n)
3023 gcc_assert (ss->type == GFC_SS_SECTION);
3025 info = &ss->data.info;
3028 if (info->ref->u.ar.dimen_type[dim] == DIMEN_VECTOR)
3030 /* We use a zero-based index to access the vector. */
3031 info->start[n] = gfc_index_zero_node;
3032 info->end[n] = gfc_index_zero_node;
3033 info->stride[n] = gfc_index_one_node;
3037 gcc_assert (info->ref->u.ar.dimen_type[dim] == DIMEN_RANGE);
3038 desc = info->descriptor;
3039 start = info->ref->u.ar.start[dim];
3040 end = info->ref->u.ar.end[dim];
3041 stride = info->ref->u.ar.stride[dim];
3043 /* Calculate the start of the range. For vector subscripts this will
3044 be the range of the vector. */
3047 /* Specified section start. */
3048 gfc_init_se (&se, NULL);
3049 gfc_conv_expr_type (&se, start, gfc_array_index_type);
3050 gfc_add_block_to_block (&loop->pre, &se.pre);
3051 info->start[n] = se.expr;
3055 /* No lower bound specified so use the bound of the array. */
3056 info->start[n] = gfc_conv_array_lbound (desc, dim);
3058 info->start[n] = gfc_evaluate_now (info->start[n], &loop->pre);
3060 /* Similarly calculate the end. Although this is not used in the
3061 scalarizer, it is needed when checking bounds and where the end
3062 is an expression with side-effects. */
3065 /* Specified section start. */
3066 gfc_init_se (&se, NULL);
3067 gfc_conv_expr_type (&se, end, gfc_array_index_type);
3068 gfc_add_block_to_block (&loop->pre, &se.pre);
3069 info->end[n] = se.expr;
3073 /* No upper bound specified so use the bound of the array. */
3074 info->end[n] = gfc_conv_array_ubound (desc, dim);
3076 info->end[n] = gfc_evaluate_now (info->end[n], &loop->pre);
3078 /* Calculate the stride. */
3080 info->stride[n] = gfc_index_one_node;
3083 gfc_init_se (&se, NULL);
3084 gfc_conv_expr_type (&se, stride, gfc_array_index_type);
3085 gfc_add_block_to_block (&loop->pre, &se.pre);
3086 info->stride[n] = gfc_evaluate_now (se.expr, &loop->pre);
3091 /* Calculates the range start and stride for a SS chain. Also gets the
3092 descriptor and data pointer. The range of vector subscripts is the size
3093 of the vector. Array bounds are also checked. */
3096 gfc_conv_ss_startstride (gfc_loopinfo * loop)
3104 /* Determine the rank of the loop. */
3106 ss != gfc_ss_terminator && loop->dimen == 0; ss = ss->loop_chain)
3110 case GFC_SS_SECTION:
3111 case GFC_SS_CONSTRUCTOR:
3112 case GFC_SS_FUNCTION:
3113 case GFC_SS_COMPONENT:
3114 loop->dimen = ss->data.info.dimen;
3117 /* As usual, lbound and ubound are exceptions!. */
3118 case GFC_SS_INTRINSIC:
3119 switch (ss->expr->value.function.isym->id)
3121 case GFC_ISYM_LBOUND:
3122 case GFC_ISYM_UBOUND:
3123 loop->dimen = ss->data.info.dimen;
3134 /* We should have determined the rank of the expression by now. If
3135 not, that's bad news. */
3136 gcc_assert (loop->dimen != 0);
3138 /* Loop over all the SS in the chain. */
3139 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
3141 if (ss->expr && ss->expr->shape && !ss->shape)
3142 ss->shape = ss->expr->shape;
3146 case GFC_SS_SECTION:
3147 /* Get the descriptor for the array. */
3148 gfc_conv_ss_descriptor (&loop->pre, ss, !loop->array_parameter);
3150 for (n = 0; n < ss->data.info.dimen; n++)
3151 gfc_conv_section_startstride (loop, ss, n);
3154 case GFC_SS_INTRINSIC:
3155 switch (ss->expr->value.function.isym->id)
3157 /* Fall through to supply start and stride. */
3158 case GFC_ISYM_LBOUND:
3159 case GFC_ISYM_UBOUND:
3165 case GFC_SS_CONSTRUCTOR:
3166 case GFC_SS_FUNCTION:
3167 for (n = 0; n < ss->data.info.dimen; n++)
3169 ss->data.info.start[n] = gfc_index_zero_node;
3170 ss->data.info.end[n] = gfc_index_zero_node;
3171 ss->data.info.stride[n] = gfc_index_one_node;
3180 /* The rest is just runtime bound checking. */
3181 if (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS)
3184 tree lbound, ubound;
3186 tree size[GFC_MAX_DIMENSIONS];
3187 tree stride_pos, stride_neg, non_zerosized, tmp2, tmp3;
3192 gfc_start_block (&block);
3194 for (n = 0; n < loop->dimen; n++)
3195 size[n] = NULL_TREE;
3197 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
3201 if (ss->type != GFC_SS_SECTION)
3204 gfc_start_block (&inner);
3206 /* TODO: range checking for mapped dimensions. */
3207 info = &ss->data.info;
3209 /* This code only checks ranges. Elemental and vector
3210 dimensions are checked later. */
3211 for (n = 0; n < loop->dimen; n++)
3216 if (info->ref->u.ar.dimen_type[dim] != DIMEN_RANGE)
3219 if (dim == info->ref->u.ar.dimen - 1
3220 && info->ref->u.ar.as->type == AS_ASSUMED_SIZE)
3221 check_upper = false;
3225 /* Zero stride is not allowed. */
3226 tmp = fold_build2 (EQ_EXPR, boolean_type_node, info->stride[n],
3227 gfc_index_zero_node);
3228 asprintf (&msg, "Zero stride is not allowed, for dimension %d "
3229 "of array '%s'", info->dim[n]+1,
3230 ss->expr->symtree->name);
3231 gfc_trans_runtime_check (true, false, tmp, &inner,
3232 &ss->expr->where, msg);
3235 desc = ss->data.info.descriptor;
3237 /* This is the run-time equivalent of resolve.c's
3238 check_dimension(). The logical is more readable there
3239 than it is here, with all the trees. */
3240 lbound = gfc_conv_array_lbound (desc, dim);
3243 ubound = gfc_conv_array_ubound (desc, dim);
3247 /* non_zerosized is true when the selected range is not
3249 stride_pos = fold_build2 (GT_EXPR, boolean_type_node,
3250 info->stride[n], gfc_index_zero_node);
3251 tmp = fold_build2 (LE_EXPR, boolean_type_node, info->start[n],
3253 stride_pos = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
3256 stride_neg = fold_build2 (LT_EXPR, boolean_type_node,
3257 info->stride[n], gfc_index_zero_node);
3258 tmp = fold_build2 (GE_EXPR, boolean_type_node, info->start[n],
3260 stride_neg = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
3262 non_zerosized = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,
3263 stride_pos, stride_neg);
3265 /* Check the start of the range against the lower and upper
3266 bounds of the array, if the range is not empty.
3267 If upper bound is present, include both bounds in the
3271 tmp = fold_build2 (LT_EXPR, boolean_type_node,
3272 info->start[n], lbound);
3273 tmp = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
3274 non_zerosized, tmp);
3275 tmp2 = fold_build2 (GT_EXPR, boolean_type_node,
3276 info->start[n], ubound);
3277 tmp2 = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
3278 non_zerosized, tmp2);
3279 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
3280 "outside of expected range (%%ld:%%ld)",
3281 info->dim[n]+1, ss->expr->symtree->name);
3282 gfc_trans_runtime_check (true, false, tmp, &inner,
3283 &ss->expr->where, msg,
3284 fold_convert (long_integer_type_node, info->start[n]),
3285 fold_convert (long_integer_type_node, lbound),
3286 fold_convert (long_integer_type_node, ubound));
3287 gfc_trans_runtime_check (true, false, tmp2, &inner,
3288 &ss->expr->where, msg,
3289 fold_convert (long_integer_type_node, info->start[n]),
3290 fold_convert (long_integer_type_node, lbound),
3291 fold_convert (long_integer_type_node, ubound));
3296 tmp = fold_build2 (LT_EXPR, boolean_type_node,
3297 info->start[n], lbound);
3298 tmp = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
3299 non_zerosized, tmp);
3300 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
3301 "below lower bound of %%ld",
3302 info->dim[n]+1, ss->expr->symtree->name);
3303 gfc_trans_runtime_check (true, false, tmp, &inner,
3304 &ss->expr->where, msg,
3305 fold_convert (long_integer_type_node, info->start[n]),
3306 fold_convert (long_integer_type_node, lbound));
3310 /* Compute the last element of the range, which is not
3311 necessarily "end" (think 0:5:3, which doesn't contain 5)
3312 and check it against both lower and upper bounds. */
3314 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, end,
3316 tmp = fold_build2 (TRUNC_MOD_EXPR, gfc_array_index_type, tmp,
3318 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, end,
3320 tmp2 = fold_build2 (LT_EXPR, boolean_type_node, tmp, lbound);
3321 tmp2 = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
3322 non_zerosized, tmp2);
3325 tmp3 = fold_build2 (GT_EXPR, boolean_type_node, tmp, ubound);
3326 tmp3 = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
3327 non_zerosized, tmp3);
3328 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
3329 "outside of expected range (%%ld:%%ld)",
3330 info->dim[n]+1, ss->expr->symtree->name);
3331 gfc_trans_runtime_check (true, false, tmp2, &inner,
3332 &ss->expr->where, msg,
3333 fold_convert (long_integer_type_node, tmp),
3334 fold_convert (long_integer_type_node, ubound),
3335 fold_convert (long_integer_type_node, lbound));
3336 gfc_trans_runtime_check (true, false, tmp3, &inner,
3337 &ss->expr->where, msg,
3338 fold_convert (long_integer_type_node, tmp),
3339 fold_convert (long_integer_type_node, ubound),
3340 fold_convert (long_integer_type_node, lbound));
3345 asprintf (&msg, "Index '%%ld' of dimension %d of array '%s' "
3346 "below lower bound of %%ld",
3347 info->dim[n]+1, ss->expr->symtree->name);
3348 gfc_trans_runtime_check (true, false, tmp2, &inner,
3349 &ss->expr->where, msg,
3350 fold_convert (long_integer_type_node, tmp),
3351 fold_convert (long_integer_type_node, lbound));
3355 /* Check the section sizes match. */
3356 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, end,
3358 tmp = fold_build2 (FLOOR_DIV_EXPR, gfc_array_index_type, tmp,
3360 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
3361 gfc_index_one_node, tmp);
3362 tmp = fold_build2 (MAX_EXPR, gfc_array_index_type, tmp,
3363 build_int_cst (gfc_array_index_type, 0));
3364 /* We remember the size of the first section, and check all the
3365 others against this. */
3368 tmp3 = fold_build2 (NE_EXPR, boolean_type_node, tmp, size[n]);
3369 asprintf (&msg, "%s, size mismatch for dimension %d "
3370 "of array '%s' (%%ld/%%ld)", gfc_msg_bounds,
3371 info->dim[n]+1, ss->expr->symtree->name);
3372 gfc_trans_runtime_check (true, false, tmp3, &inner,
3373 &ss->expr->where, msg,
3374 fold_convert (long_integer_type_node, tmp),
3375 fold_convert (long_integer_type_node, size[n]));
3379 size[n] = gfc_evaluate_now (tmp, &inner);
3382 tmp = gfc_finish_block (&inner);
3384 /* For optional arguments, only check bounds if the argument is
3386 if (ss->expr->symtree->n.sym->attr.optional
3387 || ss->expr->symtree->n.sym->attr.not_always_present)
3388 tmp = build3_v (COND_EXPR,
3389 gfc_conv_expr_present (ss->expr->symtree->n.sym),
3390 tmp, build_empty_stmt (input_location));
3392 gfc_add_expr_to_block (&block, tmp);
3396 tmp = gfc_finish_block (&block);
3397 gfc_add_expr_to_block (&loop->pre, tmp);
3402 /* Return true if the two SS could be aliased, i.e. both point to the same data
3404 /* TODO: resolve aliases based on frontend expressions. */
3407 gfc_could_be_alias (gfc_ss * lss, gfc_ss * rss)
3414 lsym = lss->expr->symtree->n.sym;
3415 rsym = rss->expr->symtree->n.sym;
3416 if (gfc_symbols_could_alias (lsym, rsym))
3419 if (rsym->ts.type != BT_DERIVED
3420 && lsym->ts.type != BT_DERIVED)
3423 /* For derived types we must check all the component types. We can ignore
3424 array references as these will have the same base type as the previous
3426 for (lref = lss->expr->ref; lref != lss->data.info.ref; lref = lref->next)
3428 if (lref->type != REF_COMPONENT)
3431 if (gfc_symbols_could_alias (lref->u.c.sym, rsym))
3434 for (rref = rss->expr->ref; rref != rss->data.info.ref;
3437 if (rref->type != REF_COMPONENT)
3440 if (gfc_symbols_could_alias (lref->u.c.sym, rref->u.c.sym))
3445 for (rref = rss->expr->ref; rref != rss->data.info.ref; rref = rref->next)
3447 if (rref->type != REF_COMPONENT)
3450 if (gfc_symbols_could_alias (rref->u.c.sym, lsym))
3458 /* Resolve array data dependencies. Creates a temporary if required. */
3459 /* TODO: Calc dependencies with gfc_expr rather than gfc_ss, and move to
3463 gfc_conv_resolve_dependencies (gfc_loopinfo * loop, gfc_ss * dest,
3471 loop->temp_ss = NULL;
3473 for (ss = rss; ss != gfc_ss_terminator; ss = ss->next)
3475 if (ss->type != GFC_SS_SECTION)
3478 if (dest->expr->symtree->n.sym != ss->expr->symtree->n.sym)
3480 if (gfc_could_be_alias (dest, ss)
3481 || gfc_are_equivalenced_arrays (dest->expr, ss->expr))
3489 lref = dest->expr->ref;
3490 rref = ss->expr->ref;
3492 nDepend = gfc_dep_resolver (lref, rref);
3496 /* TODO : loop shifting. */
3499 /* Mark the dimensions for LOOP SHIFTING */
3500 for (n = 0; n < loop->dimen; n++)
3502 int dim = dest->data.info.dim[n];
3504 if (lref->u.ar.dimen_type[dim] == DIMEN_VECTOR)
3506 else if (! gfc_is_same_range (&lref->u.ar,
3507 &rref->u.ar, dim, 0))
3511 /* Put all the dimensions with dependencies in the
3514 for (n = 0; n < loop->dimen; n++)
3516 gcc_assert (loop->order[n] == n);
3518 loop->order[dim++] = n;
3520 for (n = 0; n < loop->dimen; n++)
3523 loop->order[dim++] = n;
3526 gcc_assert (dim == loop->dimen);
3535 tree base_type = gfc_typenode_for_spec (&dest->expr->ts);
3536 if (GFC_ARRAY_TYPE_P (base_type)
3537 || GFC_DESCRIPTOR_TYPE_P (base_type))
3538 base_type = gfc_get_element_type (base_type);
3539 loop->temp_ss = gfc_get_ss ();
3540 loop->temp_ss->type = GFC_SS_TEMP;
3541 loop->temp_ss->data.temp.type = base_type;
3542 loop->temp_ss->string_length = dest->string_length;
3543 loop->temp_ss->data.temp.dimen = loop->dimen;
3544 loop->temp_ss->next = gfc_ss_terminator;
3545 gfc_add_ss_to_loop (loop, loop->temp_ss);
3548 loop->temp_ss = NULL;
3552 /* Initialize the scalarization loop. Creates the loop variables. Determines
3553 the range of the loop variables. Creates a temporary if required.
3554 Calculates how to transform from loop variables to array indices for each
3555 expression. Also generates code for scalar expressions which have been
3556 moved outside the loop. */
3559 gfc_conv_loop_setup (gfc_loopinfo * loop, locus * where)
3563 gfc_ss_info *specinfo;
3566 gfc_ss *loopspec[GFC_MAX_DIMENSIONS];
3567 bool dynamic[GFC_MAX_DIMENSIONS];
3572 for (n = 0; n < loop->dimen; n++)
3576 /* We use one SS term, and use that to determine the bounds of the
3577 loop for this dimension. We try to pick the simplest term. */
3578 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
3582 /* The frontend has worked out the size for us. */
3583 if (!loopspec[n] || !loopspec[n]->shape
3584 || !integer_zerop (loopspec[n]->data.info.start[n]))
3585 /* Prefer zero-based descriptors if possible. */
3590 if (ss->type == GFC_SS_CONSTRUCTOR)
3592 gfc_constructor_base base;
3593 /* An unknown size constructor will always be rank one.
3594 Higher rank constructors will either have known shape,
3595 or still be wrapped in a call to reshape. */
3596 gcc_assert (loop->dimen == 1);
3598 /* Always prefer to use the constructor bounds if the size
3599 can be determined at compile time. Prefer not to otherwise,
3600 since the general case involves realloc, and it's better to
3601 avoid that overhead if possible. */
3602 base = ss->expr->value.constructor;
3603 dynamic[n] = gfc_get_array_constructor_size (&i, base);
3604 if (!dynamic[n] || !loopspec[n])
3609 /* TODO: Pick the best bound if we have a choice between a
3610 function and something else. */
3611 if (ss->type == GFC_SS_FUNCTION)
3617 if (ss->type != GFC_SS_SECTION)
3621 specinfo = &loopspec[n]->data.info;
3624 info = &ss->data.info;
3628 /* Criteria for choosing a loop specifier (most important first):
3629 doesn't need realloc
3635 else if (loopspec[n]->type == GFC_SS_CONSTRUCTOR && dynamic[n])
3637 else if (integer_onep (info->stride[n])
3638 && !integer_onep (specinfo->stride[n]))
3640 else if (INTEGER_CST_P (info->stride[n])
3641 && !INTEGER_CST_P (specinfo->stride[n]))
3643 else if (INTEGER_CST_P (info->start[n])
3644 && !INTEGER_CST_P (specinfo->start[n]))
3646 /* We don't work out the upper bound.
3647 else if (INTEGER_CST_P (info->finish[n])
3648 && ! INTEGER_CST_P (specinfo->finish[n]))
3649 loopspec[n] = ss; */
3652 /* We should have found the scalarization loop specifier. If not,
3654 gcc_assert (loopspec[n]);
3656 info = &loopspec[n]->data.info;
3658 /* Set the extents of this range. */
3659 cshape = loopspec[n]->shape;
3660 if (cshape && INTEGER_CST_P (info->start[n])
3661 && INTEGER_CST_P (info->stride[n]))
3663 loop->from[n] = info->start[n];
3664 mpz_set (i, cshape[n]);
3665 mpz_sub_ui (i, i, 1);
3666 /* To = from + (size - 1) * stride. */
3667 tmp = gfc_conv_mpz_to_tree (i, gfc_index_integer_kind);
3668 if (!integer_onep (info->stride[n]))
3669 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type,
3670 tmp, info->stride[n]);
3671 loop->to[n] = fold_build2 (PLUS_EXPR, gfc_array_index_type,
3672 loop->from[n], tmp);
3676 loop->from[n] = info->start[n];
3677 switch (loopspec[n]->type)
3679 case GFC_SS_CONSTRUCTOR:
3680 /* The upper bound is calculated when we expand the
3682 gcc_assert (loop->to[n] == NULL_TREE);
3685 case GFC_SS_SECTION:
3686 /* Use the end expression if it exists and is not constant,
3687 so that it is only evaluated once. */
3688 if (info->end[n] && !INTEGER_CST_P (info->end[n]))
3689 loop->to[n] = info->end[n];
3691 loop->to[n] = gfc_conv_section_upper_bound (loopspec[n], n,
3695 case GFC_SS_FUNCTION:
3696 /* The loop bound will be set when we generate the call. */
3697 gcc_assert (loop->to[n] == NULL_TREE);
3705 /* Transform everything so we have a simple incrementing variable. */
3706 if (integer_onep (info->stride[n]))
3707 info->delta[n] = gfc_index_zero_node;
3710 /* Set the delta for this section. */
3711 info->delta[n] = gfc_evaluate_now (loop->from[n], &loop->pre);
3712 /* Number of iterations is (end - start + step) / step.
3713 with start = 0, this simplifies to
3715 for (i = 0; i<=last; i++){...}; */
3716 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
3717 loop->to[n], loop->from[n]);
3718 tmp = fold_build2 (FLOOR_DIV_EXPR, gfc_array_index_type,
3719 tmp, info->stride[n]);
3720 tmp = fold_build2 (MAX_EXPR, gfc_array_index_type, tmp,
3721 build_int_cst (gfc_array_index_type, -1));
3722 loop->to[n] = gfc_evaluate_now (tmp, &loop->pre);
3723 /* Make the loop variable start at 0. */
3724 loop->from[n] = gfc_index_zero_node;
3728 /* Add all the scalar code that can be taken out of the loops.
3729 This may include calculating the loop bounds, so do it before
3730 allocating the temporary. */
3731 gfc_add_loop_ss_code (loop, loop->ss, false, where);
3733 /* If we want a temporary then create it. */
3734 if (loop->temp_ss != NULL)
3736 gcc_assert (loop->temp_ss->type == GFC_SS_TEMP);
3738 /* Make absolutely sure that this is a complete type. */
3739 if (loop->temp_ss->string_length)
3740 loop->temp_ss->data.temp.type
3741 = gfc_get_character_type_len_for_eltype
3742 (TREE_TYPE (loop->temp_ss->data.temp.type),
3743 loop->temp_ss->string_length);
3745 tmp = loop->temp_ss->data.temp.type;
3746 n = loop->temp_ss->data.temp.dimen;
3747 memset (&loop->temp_ss->data.info, 0, sizeof (gfc_ss_info));
3748 loop->temp_ss->type = GFC_SS_SECTION;
3749 loop->temp_ss->data.info.dimen = n;
3750 gfc_trans_create_temp_array (&loop->pre, &loop->post, loop,
3751 &loop->temp_ss->data.info, tmp, NULL_TREE,
3752 false, true, false, where);
3755 for (n = 0; n < loop->temp_dim; n++)
3756 loopspec[loop->order[n]] = NULL;
3760 /* For array parameters we don't have loop variables, so don't calculate the
3762 if (loop->array_parameter)
3765 /* Calculate the translation from loop variables to array indices. */
3766 for (ss = loop->ss; ss != gfc_ss_terminator; ss = ss->loop_chain)
3768 if (ss->type != GFC_SS_SECTION && ss->type != GFC_SS_COMPONENT
3769 && ss->type != GFC_SS_CONSTRUCTOR)
3773 info = &ss->data.info;
3775 for (n = 0; n < info->dimen; n++)
3777 /* If we are specifying the range the delta is already set. */
3778 if (loopspec[n] != ss)
3780 /* Calculate the offset relative to the loop variable.
3781 First multiply by the stride. */
3782 tmp = loop->from[n];
3783 if (!integer_onep (info->stride[n]))
3784 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type,
3785 tmp, info->stride[n]);
3787 /* Then subtract this from our starting value. */
3788 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
3789 info->start[n], tmp);
3791 info->delta[n] = gfc_evaluate_now (tmp, &loop->pre);
3798 /* Fills in an array descriptor, and returns the size of the array. The size
3799 will be a simple_val, ie a variable or a constant. Also calculates the
3800 offset of the base. Returns the size of the array.
3804 for (n = 0; n < rank; n++)
3806 a.lbound[n] = specified_lower_bound;
3807 offset = offset + a.lbond[n] * stride;
3809 a.ubound[n] = specified_upper_bound;
3810 a.stride[n] = stride;
3811 size = siz >= 0 ? ubound + size : 0; //size = ubound + 1 - lbound
3812 stride = stride * size;
3819 gfc_array_init_size (tree descriptor, int rank, tree * poffset,
3820 gfc_expr ** lower, gfc_expr ** upper,
3821 stmtblock_t * pblock)
3833 stmtblock_t thenblock;
3834 stmtblock_t elseblock;
3839 type = TREE_TYPE (descriptor);
3841 stride = gfc_index_one_node;
3842 offset = gfc_index_zero_node;
3844 /* Set the dtype. */
3845 tmp = gfc_conv_descriptor_dtype (descriptor);
3846 gfc_add_modify (pblock, tmp, gfc_get_dtype (TREE_TYPE (descriptor)));
3848 or_expr = NULL_TREE;
3850 for (n = 0; n < rank; n++)
3852 /* We have 3 possibilities for determining the size of the array:
3853 lower == NULL => lbound = 1, ubound = upper[n]
3854 upper[n] = NULL => lbound = 1, ubound = lower[n]
3855 upper[n] != NULL => lbound = lower[n], ubound = upper[n] */
3858 /* Set lower bound. */
3859 gfc_init_se (&se, NULL);
3861 se.expr = gfc_index_one_node;
3864 gcc_assert (lower[n]);
3867 gfc_conv_expr_type (&se, lower[n], gfc_array_index_type);
3868 gfc_add_block_to_block (pblock, &se.pre);
3872 se.expr = gfc_index_one_node;
3876 gfc_conv_descriptor_lbound_set (pblock, descriptor, gfc_rank_cst[n],
3879 /* Work out the offset for this component. */
3880 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type, se.expr, stride);
3881 offset = fold_build2 (MINUS_EXPR, gfc_array_index_type, offset, tmp);
3883 /* Start the calculation for the size of this dimension. */
3884 size = fold_build2 (MINUS_EXPR, gfc_array_index_type,
3885 gfc_index_one_node, se.expr);
3887 /* Set upper bound. */
3888 gfc_init_se (&se, NULL);
3889 gcc_assert (ubound);
3890 gfc_conv_expr_type (&se, ubound, gfc_array_index_type);
3891 gfc_add_block_to_block (pblock, &se.pre);
3893 gfc_conv_descriptor_ubound_set (pblock, descriptor, gfc_rank_cst[n], se.expr);
3895 /* Store the stride. */
3896 gfc_conv_descriptor_stride_set (pblock, descriptor, gfc_rank_cst[n], stride);
3898 /* Calculate the size of this dimension. */
3899 size = fold_build2 (PLUS_EXPR, gfc_array_index_type, se.expr, size);
3901 /* Check whether the size for this dimension is negative. */
3902 cond = fold_build2 (LE_EXPR, boolean_type_node, size,
3903 gfc_index_zero_node);
3907 or_expr = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, or_expr, cond);
3909 size = fold_build3 (COND_EXPR, gfc_array_index_type, cond,
3910 gfc_index_zero_node, size);
3912 /* Multiply the stride by the number of elements in this dimension. */
3913 stride = fold_build2 (MULT_EXPR, gfc_array_index_type, stride, size);
3914 stride = gfc_evaluate_now (stride, pblock);
3917 /* The stride is the number of elements in the array, so multiply by the
3918 size of an element to get the total size. */
3919 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (type));
3920 size = fold_build2 (MULT_EXPR, gfc_array_index_type, stride,
3921 fold_convert (gfc_array_index_type, tmp));
3923 if (poffset != NULL)
3925 offset = gfc_evaluate_now (offset, pblock);
3929 if (integer_zerop (or_expr))
3931 if (integer_onep (or_expr))
3932 return gfc_index_zero_node;
3934 var = gfc_create_var (TREE_TYPE (size), "size");
3935 gfc_start_block (&thenblock);
3936 gfc_add_modify (&thenblock, var, gfc_index_zero_node);
3937 thencase = gfc_finish_block (&thenblock);
3939 gfc_start_block (&elseblock);
3940 gfc_add_modify (&elseblock, var, size);
3941 elsecase = gfc_finish_block (&elseblock);
3943 tmp = gfc_evaluate_now (or_expr, pblock);
3944 tmp = build3_v (COND_EXPR, tmp, thencase, elsecase);
3945 gfc_add_expr_to_block (pblock, tmp);
3951 /* Initializes the descriptor and generates a call to _gfor_allocate. Does
3952 the work for an ALLOCATE statement. */
3956 gfc_array_allocate (gfc_se * se, gfc_expr * expr, tree pstat)
3964 gfc_ref *ref, *prev_ref = NULL;
3965 bool allocatable_array;
3969 /* Find the last reference in the chain. */
3970 while (ref && ref->next != NULL)
3972 gcc_assert (ref->type != REF_ARRAY || ref->u.ar.type == AR_ELEMENT
3973 || (ref->u.ar.dimen == 0 && ref->u.ar.codimen > 0));
3978 if (ref == NULL || ref->type != REF_ARRAY)
3981 /* Return if this is a scalar coarray. */
3982 if (!prev_ref && !expr->symtree->n.sym->attr.dimension)
3984 gcc_assert (expr->symtree->n.sym->attr.codimension);
3987 else if (prev_ref && !prev_ref->u.c.component->attr.dimension)
3989 gcc_assert (prev_ref->u.c.component->attr.codimension);
3994 allocatable_array = expr->symtree->n.sym->attr.allocatable;
3996 allocatable_array = prev_ref->u.c.component->attr.allocatable;
3998 /* Figure out the size of the array. */
3999 switch (ref->u.ar.type)
4003 upper = ref->u.ar.start;
4007 gcc_assert (ref->u.ar.as->type == AS_EXPLICIT);
4009 lower = ref->u.ar.as->lower;
4010 upper = ref->u.ar.as->upper;
4014 lower = ref->u.ar.start;
4015 upper = ref->u.ar.end;
4023 size = gfc_array_init_size (se->expr, ref->u.ar.as->rank, &offset,
4024 lower, upper, &se->pre);
4026 /* Allocate memory to store the data. */
4027 pointer = gfc_conv_descriptor_data_get (se->expr);
4028 STRIP_NOPS (pointer);
4030 /* The allocate_array variants take the old pointer as first argument. */
4031 if (allocatable_array)
4032 tmp = gfc_allocate_array_with_status (&se->pre, pointer, size, pstat, expr);
4034 tmp = gfc_allocate_with_status (&se->pre, size, pstat);
4035 tmp = fold_build2 (MODIFY_EXPR, void_type_node, pointer, tmp);
4036 gfc_add_expr_to_block (&se->pre, tmp);
4038 gfc_conv_descriptor_offset_set (&se->pre, se->expr, offset);
4040 if (expr->ts.type == BT_DERIVED
4041 && expr->ts.u.derived->attr.alloc_comp)
4043 tmp = gfc_nullify_alloc_comp (expr->ts.u.derived, se->expr,
4044 ref->u.ar.as->rank);
4045 gfc_add_expr_to_block (&se->pre, tmp);
4052 /* Deallocate an array variable. Also used when an allocated variable goes
4057 gfc_array_deallocate (tree descriptor, tree pstat, gfc_expr* expr)
4063 gfc_start_block (&block);
4064 /* Get a pointer to the data. */
4065 var = gfc_conv_descriptor_data_get (descriptor);
4068 /* Parameter is the address of the data component. */
4069 tmp = gfc_deallocate_with_status (var, pstat, false, expr);
4070 gfc_add_expr_to_block (&block, tmp);
4072 /* Zero the data pointer. */
4073 tmp = fold_build2 (MODIFY_EXPR, void_type_node,
4074 var, build_int_cst (TREE_TYPE (var), 0));
4075 gfc_add_expr_to_block (&block, tmp);
4077 return gfc_finish_block (&block);
4081 /* Create an array constructor from an initialization expression.
4082 We assume the frontend already did any expansions and conversions. */
4085 gfc_conv_array_initializer (tree type, gfc_expr * expr)
4092 unsigned HOST_WIDE_INT lo;
4094 VEC(constructor_elt,gc) *v = NULL;
4096 switch (expr->expr_type)
4099 case EXPR_STRUCTURE:
4100 /* A single scalar or derived type value. Create an array with all
4101 elements equal to that value. */
4102 gfc_init_se (&se, NULL);
4104 if (expr->expr_type == EXPR_CONSTANT)
4105 gfc_conv_constant (&se, expr);
4107 gfc_conv_structure (&se, expr, 1);
4109 tmp = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
4110 gcc_assert (tmp && INTEGER_CST_P (tmp));
4111 hi = TREE_INT_CST_HIGH (tmp);
4112 lo = TREE_INT_CST_LOW (tmp);
4116 /* This will probably eat buckets of memory for large arrays. */
4117 while (hi != 0 || lo != 0)
4119 CONSTRUCTOR_APPEND_ELT (v, NULL_TREE, se.expr);
4127 /* Create a vector of all the elements. */
4128 for (c = gfc_constructor_first (expr->value.constructor);
4129 c; c = gfc_constructor_next (c))
4133 /* Problems occur when we get something like
4134 integer :: a(lots) = (/(i, i=1, lots)/) */
4135 gfc_fatal_error ("The number of elements in the array constructor "
4136 "at %L requires an increase of the allowed %d "
4137 "upper limit. See -fmax-array-constructor "
4138 "option", &expr->where,
4139 gfc_option.flag_max_array_constructor);
4142 if (mpz_cmp_si (c->offset, 0) != 0)
4143 index = gfc_conv_mpz_to_tree (c->offset, gfc_index_integer_kind);
4147 if (mpz_cmp_si (c->repeat, 0) != 0)
4151 mpz_set (maxval, c->repeat);
4152 mpz_add (maxval, c->offset, maxval);
4153 mpz_sub_ui (maxval, maxval, 1);
4154 tmp2 = gfc_conv_mpz_to_tree (maxval, gfc_index_integer_kind);
4155 if (mpz_cmp_si (c->offset, 0) != 0)
4157 mpz_add_ui (maxval, c->offset, 1);
4158 tmp1 = gfc_conv_mpz_to_tree (maxval, gfc_index_integer_kind);
4161 tmp1 = gfc_conv_mpz_to_tree (c->offset, gfc_index_integer_kind);
4163 range = fold_build2 (RANGE_EXPR, integer_type_node, tmp1, tmp2);
4169 gfc_init_se (&se, NULL);
4170 switch (c->expr->expr_type)
4173 gfc_conv_constant (&se, c->expr);
4174 if (range == NULL_TREE)
4175 CONSTRUCTOR_APPEND_ELT (v, index, se.expr);
4178 if (index != NULL_TREE)
4179 CONSTRUCTOR_APPEND_ELT (v, index, se.expr);
4180 CONSTRUCTOR_APPEND_ELT (v, range, se.expr);
4184 case EXPR_STRUCTURE:
4185 gfc_conv_structure (&se, c->expr, 1);
4186 CONSTRUCTOR_APPEND_ELT (v, index, se.expr);
4191 /* Catch those occasional beasts that do not simplify
4192 for one reason or another, assuming that if they are
4193 standard defying the frontend will catch them. */
4194 gfc_conv_expr (&se, c->expr);
4195 if (range == NULL_TREE)
4196 CONSTRUCTOR_APPEND_ELT (v, index, se.expr);
4199 if (index != NULL_TREE)
4200 CONSTRUCTOR_APPEND_ELT (v, index, se.expr);
4201 CONSTRUCTOR_APPEND_ELT (v, range, se.expr);
4209 return gfc_build_null_descriptor (type);
4215 /* Create a constructor from the list of elements. */
4216 tmp = build_constructor (type, v);
4217 TREE_CONSTANT (tmp) = 1;
4222 /* Generate code to evaluate non-constant array bounds. Sets *poffset and
4223 returns the size (in elements) of the array. */
4226 gfc_trans_array_bounds (tree type, gfc_symbol * sym, tree * poffset,
4227 stmtblock_t * pblock)
4242 size = gfc_index_one_node;
4243 offset = gfc_index_zero_node;
4244 for (dim = 0; dim < as->rank; dim++)
4246 /* Evaluate non-constant array bound expressions. */
4247 lbound = GFC_TYPE_ARRAY_LBOUND (type, dim);
4248 if (as->lower[dim] && !INTEGER_CST_P (lbound))
4250 gfc_init_se (&se, NULL);
4251 gfc_conv_expr_type (&se, as->lower[dim], gfc_array_index_type);
4252 gfc_add_block_to_block (pblock, &se.pre);
4253 gfc_add_modify (pblock, lbound, se.expr);
4255 ubound = GFC_TYPE_ARRAY_UBOUND (type, dim);
4256 if (as->upper[dim] && !INTEGER_CST_P (ubound))
4258 gfc_init_se (&se, NULL);
4259 gfc_conv_expr_type (&se, as->upper[dim], gfc_array_index_type);
4260 gfc_add_block_to_block (pblock, &se.pre);
4261 gfc_add_modify (pblock, ubound, se.expr);
4263 /* The offset of this dimension. offset = offset - lbound * stride. */
4264 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type, lbound, size);
4265 offset = fold_build2 (MINUS_EXPR, gfc_array_index_type, offset, tmp);
4267 /* The size of this dimension, and the stride of the next. */
4268 if (dim + 1 < as->rank)
4269 stride = GFC_TYPE_ARRAY_STRIDE (type, dim + 1);
4271 stride = GFC_TYPE_ARRAY_SIZE (type);
4273 if (ubound != NULL_TREE && !(stride && INTEGER_CST_P (stride)))
4275 /* Calculate stride = size * (ubound + 1 - lbound). */
4276 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
4277 gfc_index_one_node, lbound);
4278 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type, ubound, tmp);
4279 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type, size, tmp);
4281 gfc_add_modify (pblock, stride, tmp);
4283 stride = gfc_evaluate_now (tmp, pblock);
4285 /* Make sure that negative size arrays are translated
4286 to being zero size. */
4287 tmp = fold_build2 (GE_EXPR, boolean_type_node,
4288 stride, gfc_index_zero_node);
4289 tmp = fold_build3 (COND_EXPR, gfc_array_index_type, tmp,
4290 stride, gfc_index_zero_node);
4291 gfc_add_modify (pblock, stride, tmp);
4297 gfc_trans_vla_type_sizes (sym, pblock);
4304 /* Generate code to initialize/allocate an array variable. */
4307 gfc_trans_auto_array_allocation (tree decl, gfc_symbol * sym, tree fnbody)
4316 gcc_assert (!(sym->attr.pointer || sym->attr.allocatable));
4318 /* Do nothing for USEd variables. */
4319 if (sym->attr.use_assoc)
4322 type = TREE_TYPE (decl);
4323 gcc_assert (GFC_ARRAY_TYPE_P (type));
4324 onstack = TREE_CODE (type) != POINTER_TYPE;
4326 gfc_start_block (&block);
4328 /* Evaluate character string length. */
4329 if (sym->ts.type == BT_CHARACTER
4330 && onstack && !INTEGER_CST_P (sym->ts.u.cl->backend_decl))
4332 gfc_conv_string_length (sym->ts.u.cl, NULL, &block);
4334 gfc_trans_vla_type_sizes (sym, &block);
4336 /* Emit a DECL_EXPR for this variable, which will cause the
4337 gimplifier to allocate storage, and all that good stuff. */
4338 tmp = fold_build1 (DECL_EXPR, TREE_TYPE (decl), decl);
4339 gfc_add_expr_to_block (&block, tmp);
4344 gfc_add_expr_to_block (&block, fnbody);
4345 return gfc_finish_block (&block);
4348 type = TREE_TYPE (type);
4350 gcc_assert (!sym->attr.use_assoc);
4351 gcc_assert (!TREE_STATIC (decl));
4352 gcc_assert (!sym->module);
4354 if (sym->ts.type == BT_CHARACTER
4355 && !INTEGER_CST_P (sym->ts.u.cl->backend_decl))
4356 gfc_conv_string_length (sym->ts.u.cl, NULL, &block);
4358 size = gfc_trans_array_bounds (type, sym, &offset, &block);
4360 /* Don't actually allocate space for Cray Pointees. */
4361 if (sym->attr.cray_pointee)
4363 if (TREE_CODE (GFC_TYPE_ARRAY_OFFSET (type)) == VAR_DECL)
4364 gfc_add_modify (&block, GFC_TYPE_ARRAY_OFFSET (type), offset);
4365 gfc_add_expr_to_block (&block, fnbody);
4366 return gfc_finish_block (&block);
4369 /* The size is the number of elements in the array, so multiply by the
4370 size of an element to get the total size. */
4371 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (type));
4372 size = fold_build2 (MULT_EXPR, gfc_array_index_type, size,
4373 fold_convert (gfc_array_index_type, tmp));
4375 /* Allocate memory to hold the data. */
4376 tmp = gfc_call_malloc (&block, TREE_TYPE (decl), size);
4377 gfc_add_modify (&block, decl, tmp);
4379 /* Set offset of the array. */
4380 if (TREE_CODE (GFC_TYPE_ARRAY_OFFSET (type)) == VAR_DECL)
4381 gfc_add_modify (&block, GFC_TYPE_ARRAY_OFFSET (type), offset);
4384 /* Automatic arrays should not have initializers. */
4385 gcc_assert (!sym->value);
4387 gfc_add_expr_to_block (&block, fnbody);
4389 /* Free the temporary. */
4390 tmp = gfc_call_free (convert (pvoid_type_node, decl));
4391 gfc_add_expr_to_block (&block, tmp);
4393 return gfc_finish_block (&block);
4397 /* Generate entry and exit code for g77 calling convention arrays. */
4400 gfc_trans_g77_array (gfc_symbol * sym, tree body)
4410 gfc_get_backend_locus (&loc);
4411 gfc_set_backend_locus (&sym->declared_at);
4413 /* Descriptor type. */
4414 parm = sym->backend_decl;
4415 type = TREE_TYPE (parm);
4416 gcc_assert (GFC_ARRAY_TYPE_P (type));
4418 gfc_start_block (&block);
4420 if (sym->ts.type == BT_CHARACTER
4421 && TREE_CODE (sym->ts.u.cl->backend_decl) == VAR_DECL)
4422 gfc_conv_string_length (sym->ts.u.cl, NULL, &block);
4424 /* Evaluate the bounds of the array. */
4425 gfc_trans_array_bounds (type, sym, &offset, &block);
4427 /* Set the offset. */
4428 if (TREE_CODE (GFC_TYPE_ARRAY_OFFSET (type)) == VAR_DECL)
4429 gfc_add_modify (&block, GFC_TYPE_ARRAY_OFFSET (type), offset);
4431 /* Set the pointer itself if we aren't using the parameter directly. */
4432 if (TREE_CODE (parm) != PARM_DECL)
4434 tmp = convert (TREE_TYPE (parm), GFC_DECL_SAVED_DESCRIPTOR (parm));
4435 gfc_add_modify (&block, parm, tmp);
4437 stmt = gfc_finish_block (&block);
4439 gfc_set_backend_locus (&loc);
4441 gfc_start_block (&block);
4443 /* Add the initialization code to the start of the function. */
4445 if (sym->attr.optional || sym->attr.not_always_present)
4447 tmp = gfc_conv_expr_present (sym);
4448 stmt = build3_v (COND_EXPR, tmp, stmt, build_empty_stmt (input_location));
4451 gfc_add_expr_to_block (&block, stmt);
4452 gfc_add_expr_to_block (&block, body);
4454 return gfc_finish_block (&block);
4458 /* Modify the descriptor of an array parameter so that it has the
4459 correct lower bound. Also move the upper bound accordingly.
4460 If the array is not packed, it will be copied into a temporary.
4461 For each dimension we set the new lower and upper bounds. Then we copy the
4462 stride and calculate the offset for this dimension. We also work out
4463 what the stride of a packed array would be, and see it the two match.
4464 If the array need repacking, we set the stride to the values we just
4465 calculated, recalculate the offset and copy the array data.
4466 Code is also added to copy the data back at the end of the function.
4470 gfc_trans_dummy_array_bias (gfc_symbol * sym, tree tmpdesc, tree body)
4477 stmtblock_t cleanup;
4485 tree stride, stride2;
4495 /* Do nothing for pointer and allocatable arrays. */
4496 if (sym->attr.pointer || sym->attr.allocatable)
4499 if (sym->attr.dummy && gfc_is_nodesc_array (sym))
4500 return gfc_trans_g77_array (sym, body);
4502 gfc_get_backend_locus (&loc);
4503 gfc_set_backend_locus (&sym->declared_at);
4505 /* Descriptor type. */
4506 type = TREE_TYPE (tmpdesc);
4507 gcc_assert (GFC_ARRAY_TYPE_P (type));
4508 dumdesc = GFC_DECL_SAVED_DESCRIPTOR (tmpdesc);
4509 dumdesc = build_fold_indirect_ref_loc (input_location,
4511 gfc_start_block (&block);
4513 if (sym->ts.type == BT_CHARACTER
4514 && TREE_CODE (sym->ts.u.cl->backend_decl) == VAR_DECL)
4515 gfc_conv_string_length (sym->ts.u.cl, NULL, &block);
4517 checkparm = (sym->as->type == AS_EXPLICIT
4518 && (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS));
4520 no_repack = !(GFC_DECL_PACKED_ARRAY (tmpdesc)
4521 || GFC_DECL_PARTIAL_PACKED_ARRAY (tmpdesc));
4523 if (GFC_DECL_PARTIAL_PACKED_ARRAY (tmpdesc))
4525 /* For non-constant shape arrays we only check if the first dimension
4526 is contiguous. Repacking higher dimensions wouldn't gain us
4527 anything as we still don't know the array stride. */
4528 partial = gfc_create_var (boolean_type_node, "partial");
4529 TREE_USED (partial) = 1;
4530 tmp = gfc_conv_descriptor_stride_get (dumdesc, gfc_rank_cst[0]);
4531 tmp = fold_build2 (EQ_EXPR, boolean_type_node, tmp, gfc_index_one_node);
4532 gfc_add_modify (&block, partial, tmp);
4536 partial = NULL_TREE;
4539 /* The naming of stmt_unpacked and stmt_packed may be counter-intuitive
4540 here, however I think it does the right thing. */
4543 /* Set the first stride. */
4544 stride = gfc_conv_descriptor_stride_get (dumdesc, gfc_rank_cst[0]);
4545 stride = gfc_evaluate_now (stride, &block);
4547 tmp = fold_build2 (EQ_EXPR, boolean_type_node,
4548 stride, gfc_index_zero_node);
4549 tmp = fold_build3 (COND_EXPR, gfc_array_index_type, tmp,
4550 gfc_index_one_node, stride);
4551 stride = GFC_TYPE_ARRAY_STRIDE (type, 0);
4552 gfc_add_modify (&block, stride, tmp);
4554 /* Allow the user to disable array repacking. */
4555 stmt_unpacked = NULL_TREE;
4559 gcc_assert (integer_onep (GFC_TYPE_ARRAY_STRIDE (type, 0)));
4560 /* A library call to repack the array if necessary. */
4561 tmp = GFC_DECL_SAVED_DESCRIPTOR (tmpdesc);
4562 stmt_unpacked = build_call_expr_loc (input_location,
4563 gfor_fndecl_in_pack, 1, tmp);
4565 stride = gfc_index_one_node;
4567 if (gfc_option.warn_array_temp)
4568 gfc_warning ("Creating array temporary at %L", &loc);
4571 /* This is for the case where the array data is used directly without
4572 calling the repack function. */
4573 if (no_repack || partial != NULL_TREE)
4574 stmt_packed = gfc_conv_descriptor_data_get (dumdesc);
4576 stmt_packed = NULL_TREE;
4578 /* Assign the data pointer. */
4579 if (stmt_packed != NULL_TREE && stmt_unpacked != NULL_TREE)
4581 /* Don't repack unknown shape arrays when the first stride is 1. */
4582 tmp = fold_build3 (COND_EXPR, TREE_TYPE (stmt_packed),
4583 partial, stmt_packed, stmt_unpacked);
4586 tmp = stmt_packed != NULL_TREE ? stmt_packed : stmt_unpacked;
4587 gfc_add_modify (&block, tmpdesc, fold_convert (type, tmp));
4589 offset = gfc_index_zero_node;
4590 size = gfc_index_one_node;
4592 /* Evaluate the bounds of the array. */
4593 for (n = 0; n < sym->as->rank; n++)
4595 if (checkparm || !sym->as->upper[n])
4597 /* Get the bounds of the actual parameter. */
4598 dubound = gfc_conv_descriptor_ubound_get (dumdesc, gfc_rank_cst[n]);
4599 dlbound = gfc_conv_descriptor_lbound_get (dumdesc, gfc_rank_cst[n]);
4603 dubound = NULL_TREE;
4604 dlbound = NULL_TREE;
4607 lbound = GFC_TYPE_ARRAY_LBOUND (type, n);
4608 if (!INTEGER_CST_P (lbound))
4610 gfc_init_se (&se, NULL);
4611 gfc_conv_expr_type (&se, sym->as->lower[n],
4612 gfc_array_index_type);
4613 gfc_add_block_to_block (&block, &se.pre);
4614 gfc_add_modify (&block, lbound, se.expr);
4617 ubound = GFC_TYPE_ARRAY_UBOUND (type, n);
4618 /* Set the desired upper bound. */
4619 if (sym->as->upper[n])
4621 /* We know what we want the upper bound to be. */
4622 if (!INTEGER_CST_P (ubound))
4624 gfc_init_se (&se, NULL);
4625 gfc_conv_expr_type (&se, sym->as->upper[n],
4626 gfc_array_index_type);
4627 gfc_add_block_to_block (&block, &se.pre);
4628 gfc_add_modify (&block, ubound, se.expr);
4631 /* Check the sizes match. */
4634 /* Check (ubound(a) - lbound(a) == ubound(b) - lbound(b)). */
4637 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
4639 stride2 = fold_build2 (MINUS_EXPR, gfc_array_index_type,
4641 tmp = fold_build2 (NE_EXPR, gfc_array_index_type, tmp, stride2);
4642 asprintf (&msg, "%s for dimension %d of array '%s'",
4643 gfc_msg_bounds, n+1, sym->name);
4644 gfc_trans_runtime_check (true, false, tmp, &block, &loc, msg);
4650 /* For assumed shape arrays move the upper bound by the same amount
4651 as the lower bound. */
4652 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
4654 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type, tmp, lbound);
4655 gfc_add_modify (&block, ubound, tmp);
4657 /* The offset of this dimension. offset = offset - lbound * stride. */
4658 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type, lbound, stride);
4659 offset = fold_build2 (MINUS_EXPR, gfc_array_index_type, offset, tmp);
4661 /* The size of this dimension, and the stride of the next. */
4662 if (n + 1 < sym->as->rank)
4664 stride = GFC_TYPE_ARRAY_STRIDE (type, n + 1);
4666 if (no_repack || partial != NULL_TREE)
4669 gfc_conv_descriptor_stride_get (dumdesc, gfc_rank_cst[n+1]);
4672 /* Figure out the stride if not a known constant. */
4673 if (!INTEGER_CST_P (stride))
4676 stmt_packed = NULL_TREE;
4679 /* Calculate stride = size * (ubound + 1 - lbound). */
4680 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
4681 gfc_index_one_node, lbound);
4682 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
4684 size = fold_build2 (MULT_EXPR, gfc_array_index_type,
4689 /* Assign the stride. */
4690 if (stmt_packed != NULL_TREE && stmt_unpacked != NULL_TREE)
4691 tmp = fold_build3 (COND_EXPR, gfc_array_index_type, partial,
4692 stmt_unpacked, stmt_packed);
4694 tmp = (stmt_packed != NULL_TREE) ? stmt_packed : stmt_unpacked;
4695 gfc_add_modify (&block, stride, tmp);
4700 stride = GFC_TYPE_ARRAY_SIZE (type);
4702 if (stride && !INTEGER_CST_P (stride))
4704 /* Calculate size = stride * (ubound + 1 - lbound). */
4705 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
4706 gfc_index_one_node, lbound);
4707 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
4709 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type,
4710 GFC_TYPE_ARRAY_STRIDE (type, n), tmp);
4711 gfc_add_modify (&block, stride, tmp);
4716 /* Set the offset. */
4717 if (TREE_CODE (GFC_TYPE_ARRAY_OFFSET (type)) == VAR_DECL)
4718 gfc_add_modify (&block, GFC_TYPE_ARRAY_OFFSET (type), offset);
4720 gfc_trans_vla_type_sizes (sym, &block);
4722 stmt = gfc_finish_block (&block);
4724 gfc_start_block (&block);
4726 /* Only do the entry/initialization code if the arg is present. */
4727 dumdesc = GFC_DECL_SAVED_DESCRIPTOR (tmpdesc);
4728 optional_arg = (sym->attr.optional
4729 || (sym->ns->proc_name->attr.entry_master
4730 && sym->attr.dummy));
4733 tmp = gfc_conv_expr_present (sym);
4734 stmt = build3_v (COND_EXPR, tmp, stmt, build_empty_stmt (input_location));
4736 gfc_add_expr_to_block (&block, stmt);
4738 /* Add the main function body. */
4739 gfc_add_expr_to_block (&block, body);
4744 gfc_start_block (&cleanup);
4746 if (sym->attr.intent != INTENT_IN)
4748 /* Copy the data back. */
4749 tmp = build_call_expr_loc (input_location,
4750 gfor_fndecl_in_unpack, 2, dumdesc, tmpdesc);
4751 gfc_add_expr_to_block (&cleanup, tmp);
4754 /* Free the temporary. */
4755 tmp = gfc_call_free (tmpdesc);
4756 gfc_add_expr_to_block (&cleanup, tmp);
4758 stmt = gfc_finish_block (&cleanup);
4760 /* Only do the cleanup if the array was repacked. */
4761 tmp = build_fold_indirect_ref_loc (input_location,
4763 tmp = gfc_conv_descriptor_data_get (tmp);
4764 tmp = fold_build2 (NE_EXPR, boolean_type_node, tmp, tmpdesc);
4765 stmt = build3_v (COND_EXPR, tmp, stmt, build_empty_stmt (input_location));
4769 tmp = gfc_conv_expr_present (sym);
4770 stmt = build3_v (COND_EXPR, tmp, stmt,
4771 build_empty_stmt (input_location));
4773 gfc_add_expr_to_block (&block, stmt);
4775 /* We don't need to free any memory allocated by internal_pack as it will
4776 be freed at the end of the function by pop_context. */
4777 return gfc_finish_block (&block);
4781 /* Calculate the overall offset, including subreferences. */
4783 gfc_get_dataptr_offset (stmtblock_t *block, tree parm, tree desc, tree offset,
4784 bool subref, gfc_expr *expr)
4794 /* If offset is NULL and this is not a subreferenced array, there is
4796 if (offset == NULL_TREE)
4799 offset = gfc_index_zero_node;
4804 tmp = gfc_conv_array_data (desc);
4805 tmp = build_fold_indirect_ref_loc (input_location,
4807 tmp = gfc_build_array_ref (tmp, offset, NULL);
4809 /* Offset the data pointer for pointer assignments from arrays with
4810 subreferences; e.g. my_integer => my_type(:)%integer_component. */
4813 /* Go past the array reference. */
4814 for (ref = expr->ref; ref; ref = ref->next)
4815 if (ref->type == REF_ARRAY &&
4816 ref->u.ar.type != AR_ELEMENT)
4822 /* Calculate the offset for each subsequent subreference. */
4823 for (; ref; ref = ref->next)
4828 field = ref->u.c.component->backend_decl;
4829 gcc_assert (field && TREE_CODE (field) == FIELD_DECL);
4830 tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field),
4831 tmp, field, NULL_TREE);
4835 gcc_assert (TREE_CODE (TREE_TYPE (tmp)) == ARRAY_TYPE);
4836 gfc_init_se (&start, NULL);
4837 gfc_conv_expr_type (&start, ref->u.ss.start, gfc_charlen_type_node);
4838 gfc_add_block_to_block (block, &start.pre);
4839 tmp = gfc_build_array_ref (tmp, start.expr, NULL);
4843 gcc_assert (TREE_CODE (TREE_TYPE (tmp)) == ARRAY_TYPE
4844 && ref->u.ar.type == AR_ELEMENT);
4846 /* TODO - Add bounds checking. */
4847 stride = gfc_index_one_node;
4848 index = gfc_index_zero_node;
4849 for (n = 0; n < ref->u.ar.dimen; n++)
4854 /* Update the index. */
4855 gfc_init_se (&start, NULL);
4856 gfc_conv_expr_type (&start, ref->u.ar.start[n], gfc_array_index_type);
4857 itmp = gfc_evaluate_now (start.expr, block);
4858 gfc_init_se (&start, NULL);
4859 gfc_conv_expr_type (&start, ref->u.ar.as->lower[n], gfc_array_index_type);
4860 jtmp = gfc_evaluate_now (start.expr, block);
4861 itmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, itmp, jtmp);
4862 itmp = fold_build2 (MULT_EXPR, gfc_array_index_type, itmp, stride);
4863 index = fold_build2 (PLUS_EXPR, gfc_array_index_type, itmp, index);
4864 index = gfc_evaluate_now (index, block);
4866 /* Update the stride. */
4867 gfc_init_se (&start, NULL);
4868 gfc_conv_expr_type (&start, ref->u.ar.as->upper[n], gfc_array_index_type);
4869 itmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, start.expr, jtmp);
4870 itmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
4871 gfc_index_one_node, itmp);
4872 stride = fold_build2 (MULT_EXPR, gfc_array_index_type, stride, itmp);
4873 stride = gfc_evaluate_now (stride, block);
4876 /* Apply the index to obtain the array element. */
4877 tmp = gfc_build_array_ref (tmp, index, NULL);
4887 /* Set the target data pointer. */
4888 offset = gfc_build_addr_expr (gfc_array_dataptr_type (desc), tmp);
4889 gfc_conv_descriptor_data_set (block, parm, offset);
4893 /* gfc_conv_expr_descriptor needs the string length an expression
4894 so that the size of the temporary can be obtained. This is done
4895 by adding up the string lengths of all the elements in the
4896 expression. Function with non-constant expressions have their
4897 string lengths mapped onto the actual arguments using the
4898 interface mapping machinery in trans-expr.c. */
4900 get_array_charlen (gfc_expr *expr, gfc_se *se)
4902 gfc_interface_mapping mapping;
4903 gfc_formal_arglist *formal;
4904 gfc_actual_arglist *arg;
4907 if (expr->ts.u.cl->length
4908 && gfc_is_constant_expr (expr->ts.u.cl->length))
4910 if (!expr->ts.u.cl->backend_decl)
4911 gfc_conv_string_length (expr->ts.u.cl, expr, &se->pre);
4915 switch (expr->expr_type)
4918 get_array_charlen (expr->value.op.op1, se);
4920 /* For parentheses the expression ts.u.cl is identical. */
4921 if (expr->value.op.op == INTRINSIC_PARENTHESES)
4924 expr->ts.u.cl->backend_decl =
4925 gfc_create_var (gfc_charlen_type_node, "sln");
4927 if (expr->value.op.op2)
4929 get_array_charlen (expr->value.op.op2, se);
4931 gcc_assert (expr->value.op.op == INTRINSIC_CONCAT);
4933 /* Add the string lengths and assign them to the expression
4934 string length backend declaration. */
4935 gfc_add_modify (&se->pre, expr->ts.u.cl->backend_decl,
4936 fold_build2 (PLUS_EXPR, gfc_charlen_type_node,
4937 expr->value.op.op1->ts.u.cl->backend_decl,
4938 expr->value.op.op2->ts.u.cl->backend_decl));
4941 gfc_add_modify (&se->pre, expr->ts.u.cl->backend_decl,
4942 expr->value.op.op1->ts.u.cl->backend_decl);
4946 if (expr->value.function.esym == NULL
4947 || expr->ts.u.cl->length->expr_type == EXPR_CONSTANT)
4949 gfc_conv_string_length (expr->ts.u.cl, expr, &se->pre);
4953 /* Map expressions involving the dummy arguments onto the actual
4954 argument expressions. */
4955 gfc_init_interface_mapping (&mapping);
4956 formal = expr->symtree->n.sym->formal;
4957 arg = expr->value.function.actual;
4959 /* Set se = NULL in the calls to the interface mapping, to suppress any
4961 for (; arg != NULL; arg = arg->next, formal = formal ? formal->next : NULL)
4966 gfc_add_interface_mapping (&mapping, formal->sym, NULL, arg->expr);
4969 gfc_init_se (&tse, NULL);
4971 /* Build the expression for the character length and convert it. */
4972 gfc_apply_interface_mapping (&mapping, &tse, expr->ts.u.cl->length);
4974 gfc_add_block_to_block (&se->pre, &tse.pre);
4975 gfc_add_block_to_block (&se->post, &tse.post);
4976 tse.expr = fold_convert (gfc_charlen_type_node, tse.expr);
4977 tse.expr = fold_build2 (MAX_EXPR, gfc_charlen_type_node, tse.expr,
4978 build_int_cst (gfc_charlen_type_node, 0));
4979 expr->ts.u.cl->backend_decl = tse.expr;
4980 gfc_free_interface_mapping (&mapping);
4984 gfc_conv_string_length (expr->ts.u.cl, expr, &se->pre);
4991 /* Convert an array for passing as an actual argument. Expressions and
4992 vector subscripts are evaluated and stored in a temporary, which is then
4993 passed. For whole arrays the descriptor is passed. For array sections
4994 a modified copy of the descriptor is passed, but using the original data.
4996 This function is also used for array pointer assignments, and there
4999 - se->want_pointer && !se->direct_byref
5000 EXPR is an actual argument. On exit, se->expr contains a
5001 pointer to the array descriptor.
5003 - !se->want_pointer && !se->direct_byref
5004 EXPR is an actual argument to an intrinsic function or the
5005 left-hand side of a pointer assignment. On exit, se->expr
5006 contains the descriptor for EXPR.
5008 - !se->want_pointer && se->direct_byref
5009 EXPR is the right-hand side of a pointer assignment and
5010 se->expr is the descriptor for the previously-evaluated
5011 left-hand side. The function creates an assignment from
5012 EXPR to se->expr. */
5015 gfc_conv_expr_descriptor (gfc_se * se, gfc_expr * expr, gfc_ss * ss)
5028 bool subref_array_target = false;
5030 gcc_assert (ss != gfc_ss_terminator);
5032 /* Special case things we know we can pass easily. */
5033 switch (expr->expr_type)
5036 /* If we have a linear array section, we can pass it directly.
5037 Otherwise we need to copy it into a temporary. */
5039 /* Find the SS for the array section. */
5041 while (secss != gfc_ss_terminator && secss->type != GFC_SS_SECTION)
5042 secss = secss->next;
5044 gcc_assert (secss != gfc_ss_terminator);
5045 info = &secss->data.info;
5047 /* Get the descriptor for the array. */
5048 gfc_conv_ss_descriptor (&se->pre, secss, 0);
5049 desc = info->descriptor;
5051 subref_array_target = se->direct_byref && is_subref_array (expr);
5052 need_tmp = gfc_ref_needs_temporary_p (expr->ref)
5053 && !subref_array_target;
5057 else if (GFC_ARRAY_TYPE_P (TREE_TYPE (desc)))
5059 /* Create a new descriptor if the array doesn't have one. */
5062 else if (info->ref->u.ar.type == AR_FULL)
5064 else if (se->direct_byref)
5067 full = gfc_full_array_ref_p (info->ref, NULL);
5071 if (se->direct_byref)
5073 /* Copy the descriptor for pointer assignments. */
5074 gfc_add_modify (&se->pre, se->expr, desc);
5076 /* Add any offsets from subreferences. */
5077 gfc_get_dataptr_offset (&se->pre, se->expr, desc, NULL_TREE,
5078 subref_array_target, expr);
5080 else if (se->want_pointer)
5082 /* We pass full arrays directly. This means that pointers and
5083 allocatable arrays should also work. */
5084 se->expr = gfc_build_addr_expr (NULL_TREE, desc);
5091 if (expr->ts.type == BT_CHARACTER)
5092 se->string_length = gfc_get_expr_charlen (expr);
5099 /* A transformational function return value will be a temporary
5100 array descriptor. We still need to go through the scalarizer
5101 to create the descriptor. Elemental functions ar handled as
5102 arbitrary expressions, i.e. copy to a temporary. */
5104 /* Look for the SS for this function. */
5105 while (secss != gfc_ss_terminator
5106 && (secss->type != GFC_SS_FUNCTION || secss->expr != expr))
5107 secss = secss->next;
5109 if (se->direct_byref)
5111 gcc_assert (secss != gfc_ss_terminator);
5113 /* For pointer assignments pass the descriptor directly. */
5115 se->expr = gfc_build_addr_expr (NULL_TREE, se->expr);
5116 gfc_conv_expr (se, expr);
5120 if (secss == gfc_ss_terminator)
5122 /* Elemental function. */
5124 if (expr->ts.type == BT_CHARACTER
5125 && expr->ts.u.cl->length->expr_type != EXPR_CONSTANT)
5126 get_array_charlen (expr, se);
5132 /* Transformational function. */
5133 info = &secss->data.info;
5139 /* Constant array constructors don't need a temporary. */
5140 if (ss->type == GFC_SS_CONSTRUCTOR
5141 && expr->ts.type != BT_CHARACTER
5142 && gfc_constant_array_constructor_p (expr->value.constructor))
5145 info = &ss->data.info;
5157 /* Something complicated. Copy it into a temporary. */
5164 gfc_init_loopinfo (&loop);
5166 /* Associate the SS with the loop. */
5167 gfc_add_ss_to_loop (&loop, ss);
5169 /* Tell the scalarizer not to bother creating loop variables, etc. */
5171 loop.array_parameter = 1;
5173 /* The right-hand side of a pointer assignment mustn't use a temporary. */
5174 gcc_assert (!se->direct_byref);
5176 /* Setup the scalarizing loops and bounds. */
5177 gfc_conv_ss_startstride (&loop);
5181 /* Tell the scalarizer to make a temporary. */
5182 loop.temp_ss = gfc_get_ss ();
5183 loop.temp_ss->type = GFC_SS_TEMP;
5184 loop.temp_ss->next = gfc_ss_terminator;
5186 if (expr->ts.type == BT_CHARACTER
5187 && !expr->ts.u.cl->backend_decl)
5188 get_array_charlen (expr, se);
5190 loop.temp_ss->data.temp.type = gfc_typenode_for_spec (&expr->ts);
5192 if (expr->ts.type == BT_CHARACTER)
5193 loop.temp_ss->string_length = expr->ts.u.cl->backend_decl;
5195 loop.temp_ss->string_length = NULL;
5197 se->string_length = loop.temp_ss->string_length;
5198 loop.temp_ss->data.temp.dimen = loop.dimen;
5199 gfc_add_ss_to_loop (&loop, loop.temp_ss);
5202 gfc_conv_loop_setup (&loop, & expr->where);
5206 /* Copy into a temporary and pass that. We don't need to copy the data
5207 back because expressions and vector subscripts must be INTENT_IN. */
5208 /* TODO: Optimize passing function return values. */
5212 /* Start the copying loops. */
5213 gfc_mark_ss_chain_used (loop.temp_ss, 1);
5214 gfc_mark_ss_chain_used (ss, 1);
5215 gfc_start_scalarized_body (&loop, &block);
5217 /* Copy each data element. */
5218 gfc_init_se (&lse, NULL);
5219 gfc_copy_loopinfo_to_se (&lse, &loop);
5220 gfc_init_se (&rse, NULL);
5221 gfc_copy_loopinfo_to_se (&rse, &loop);
5223 lse.ss = loop.temp_ss;
5226 gfc_conv_scalarized_array_ref (&lse, NULL);
5227 if (expr->ts.type == BT_CHARACTER)
5229 gfc_conv_expr (&rse, expr);
5230 if (POINTER_TYPE_P (TREE_TYPE (rse.expr)))
5231 rse.expr = build_fold_indirect_ref_loc (input_location,
5235 gfc_conv_expr_val (&rse, expr);
5237 gfc_add_block_to_block (&block, &rse.pre);
5238 gfc_add_block_to_block (&block, &lse.pre);
5240 lse.string_length = rse.string_length;
5241 tmp = gfc_trans_scalar_assign (&lse, &rse, expr->ts, true,
5242 expr->expr_type == EXPR_VARIABLE, true);
5243 gfc_add_expr_to_block (&block, tmp);
5245 /* Finish the copying loops. */
5246 gfc_trans_scalarizing_loops (&loop, &block);
5248 desc = loop.temp_ss->data.info.descriptor;
5250 gcc_assert (is_gimple_lvalue (desc));
5252 else if (expr->expr_type == EXPR_FUNCTION)
5254 desc = info->descriptor;
5255 se->string_length = ss->string_length;
5259 /* We pass sections without copying to a temporary. Make a new
5260 descriptor and point it at the section we want. The loop variable
5261 limits will be the limits of the section.
5262 A function may decide to repack the array to speed up access, but
5263 we're not bothered about that here. */
5272 /* Set the string_length for a character array. */
5273 if (expr->ts.type == BT_CHARACTER)
5274 se->string_length = gfc_get_expr_charlen (expr);
5276 desc = info->descriptor;
5277 gcc_assert (secss && secss != gfc_ss_terminator);
5278 if (se->direct_byref)
5280 /* For pointer assignments we fill in the destination. */
5282 parmtype = TREE_TYPE (parm);
5286 /* Otherwise make a new one. */
5287 parmtype = gfc_get_element_type (TREE_TYPE (desc));
5288 parmtype = gfc_get_array_type_bounds (parmtype, loop.dimen,
5289 loop.from, loop.to, 0,
5290 GFC_ARRAY_UNKNOWN, false);
5291 parm = gfc_create_var (parmtype, "parm");
5294 offset = gfc_index_zero_node;
5297 /* The following can be somewhat confusing. We have two
5298 descriptors, a new one and the original array.
5299 {parm, parmtype, dim} refer to the new one.
5300 {desc, type, n, secss, loop} refer to the original, which maybe
5301 a descriptorless array.
5302 The bounds of the scalarization are the bounds of the section.
5303 We don't have to worry about numeric overflows when calculating
5304 the offsets because all elements are within the array data. */
5306 /* Set the dtype. */
5307 tmp = gfc_conv_descriptor_dtype (parm);
5308 gfc_add_modify (&loop.pre, tmp, gfc_get_dtype (parmtype));
5310 /* Set offset for assignments to pointer only to zero if it is not
5312 if (se->direct_byref
5313 && info->ref && info->ref->u.ar.type != AR_FULL)
5314 base = gfc_index_zero_node;
5315 else if (GFC_ARRAY_TYPE_P (TREE_TYPE (desc)))
5316 base = gfc_evaluate_now (gfc_conv_array_offset (desc), &loop.pre);
5320 ndim = info->ref ? info->ref->u.ar.dimen : info->dimen;
5321 for (n = 0; n < ndim; n++)
5323 stride = gfc_conv_array_stride (desc, n);
5325 /* Work out the offset. */
5327 && info->ref->u.ar.dimen_type[n] == DIMEN_ELEMENT)
5329 gcc_assert (info->subscript[n]
5330 && info->subscript[n]->type == GFC_SS_SCALAR);
5331 start = info->subscript[n]->data.scalar.expr;
5335 /* Check we haven't somehow got out of sync. */
5336 gcc_assert (info->dim[dim] == n);
5338 /* Evaluate and remember the start of the section. */
5339 start = info->start[dim];
5340 stride = gfc_evaluate_now (stride, &loop.pre);
5343 tmp = gfc_conv_array_lbound (desc, n);
5344 tmp = fold_build2 (MINUS_EXPR, TREE_TYPE (tmp), start, tmp);
5346 tmp = fold_build2 (MULT_EXPR, TREE_TYPE (tmp), tmp, stride);
5347 offset = fold_build2 (PLUS_EXPR, TREE_TYPE (tmp), offset, tmp);
5350 && info->ref->u.ar.dimen_type[n] == DIMEN_ELEMENT)
5352 /* For elemental dimensions, we only need the offset. */
5356 /* Vector subscripts need copying and are handled elsewhere. */
5358 gcc_assert (info->ref->u.ar.dimen_type[n] == DIMEN_RANGE);
5360 /* Set the new lower bound. */
5361 from = loop.from[dim];
5364 /* If we have an array section or are assigning make sure that
5365 the lower bound is 1. References to the full
5366 array should otherwise keep the original bounds. */
5368 || info->ref->u.ar.type != AR_FULL)
5369 && !integer_onep (from))
5371 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
5372 gfc_index_one_node, from);
5373 to = fold_build2 (PLUS_EXPR, gfc_array_index_type, to, tmp);
5374 from = gfc_index_one_node;
5376 gfc_conv_descriptor_lbound_set (&loop.pre, parm,
5377 gfc_rank_cst[dim], from);
5379 /* Set the new upper bound. */
5380 gfc_conv_descriptor_ubound_set (&loop.pre, parm,
5381 gfc_rank_cst[dim], to);
5383 /* Multiply the stride by the section stride to get the
5385 stride = fold_build2 (MULT_EXPR, gfc_array_index_type,
5386 stride, info->stride[dim]);
5388 if (se->direct_byref
5390 && info->ref->u.ar.type != AR_FULL)
5392 base = fold_build2 (MINUS_EXPR, TREE_TYPE (base),
5395 else if (GFC_ARRAY_TYPE_P (TREE_TYPE (desc)))
5397 tmp = gfc_conv_array_lbound (desc, n);
5398 tmp = fold_build2 (MINUS_EXPR, TREE_TYPE (base),
5399 tmp, loop.from[dim]);
5400 tmp = fold_build2 (MULT_EXPR, TREE_TYPE (base),
5401 tmp, gfc_conv_array_stride (desc, n));
5402 base = fold_build2 (PLUS_EXPR, TREE_TYPE (base),
5406 /* Store the new stride. */
5407 gfc_conv_descriptor_stride_set (&loop.pre, parm,
5408 gfc_rank_cst[dim], stride);
5413 if (se->data_not_needed)
5414 gfc_conv_descriptor_data_set (&loop.pre, parm,
5415 gfc_index_zero_node);
5417 /* Point the data pointer at the 1st element in the section. */
5418 gfc_get_dataptr_offset (&loop.pre, parm, desc, offset,
5419 subref_array_target, expr);
5421 if ((se->direct_byref || GFC_ARRAY_TYPE_P (TREE_TYPE (desc)))
5422 && !se->data_not_needed)
5424 /* Set the offset. */
5425 gfc_conv_descriptor_offset_set (&loop.pre, parm, base);
5429 /* Only the callee knows what the correct offset it, so just set
5431 gfc_conv_descriptor_offset_set (&loop.pre, parm, gfc_index_zero_node);
5436 if (!se->direct_byref)
5438 /* Get a pointer to the new descriptor. */
5439 if (se->want_pointer)
5440 se->expr = gfc_build_addr_expr (NULL_TREE, desc);
5445 gfc_add_block_to_block (&se->pre, &loop.pre);
5446 gfc_add_block_to_block (&se->post, &loop.post);
5448 /* Cleanup the scalarizer. */
5449 gfc_cleanup_loop (&loop);
5452 /* Helper function for gfc_conv_array_parameter if array size needs to be
5456 array_parameter_size (tree desc, gfc_expr *expr, tree *size)
5459 if (GFC_ARRAY_TYPE_P (TREE_TYPE (desc)))
5460 *size = GFC_TYPE_ARRAY_SIZE (TREE_TYPE (desc));
5461 else if (expr->rank > 1)
5462 *size = build_call_expr_loc (input_location,
5463 gfor_fndecl_size0, 1,
5464 gfc_build_addr_expr (NULL, desc));
5467 tree ubound = gfc_conv_descriptor_ubound_get (desc, gfc_index_zero_node);
5468 tree lbound = gfc_conv_descriptor_lbound_get (desc, gfc_index_zero_node);
5470 *size = fold_build2 (MINUS_EXPR, gfc_array_index_type, ubound, lbound);
5471 *size = fold_build2 (PLUS_EXPR, gfc_array_index_type, *size,
5472 gfc_index_one_node);
5473 *size = fold_build2 (MAX_EXPR, gfc_array_index_type, *size,
5474 gfc_index_zero_node);
5476 elem = TYPE_SIZE_UNIT (gfc_get_element_type (TREE_TYPE (desc)));
5477 *size = fold_build2 (MULT_EXPR, gfc_array_index_type, *size,
5478 fold_convert (gfc_array_index_type, elem));
5481 /* Convert an array for passing as an actual parameter. */
5482 /* TODO: Optimize passing g77 arrays. */
5485 gfc_conv_array_parameter (gfc_se * se, gfc_expr * expr, gfc_ss * ss, bool g77,
5486 const gfc_symbol *fsym, const char *proc_name,
5491 tree tmp = NULL_TREE;
5493 tree parent = DECL_CONTEXT (current_function_decl);
5494 bool full_array_var;
5495 bool this_array_result;
5498 bool array_constructor;
5499 bool good_allocatable;
5500 bool ultimate_ptr_comp;
5501 bool ultimate_alloc_comp;
5506 ultimate_ptr_comp = false;
5507 ultimate_alloc_comp = false;
5508 for (ref = expr->ref; ref; ref = ref->next)
5510 if (ref->next == NULL)
5513 if (ref->type == REF_COMPONENT)
5515 ultimate_ptr_comp = ref->u.c.component->attr.pointer;
5516 ultimate_alloc_comp = ref->u.c.component->attr.allocatable;
5520 full_array_var = false;
5523 if (expr->expr_type == EXPR_VARIABLE && ref && !ultimate_ptr_comp)
5524 full_array_var = gfc_full_array_ref_p (ref, &contiguous);
5526 sym = full_array_var ? expr->symtree->n.sym : NULL;
5528 /* The symbol should have an array specification. */
5529 gcc_assert (!sym || sym->as || ref->u.ar.as);
5531 if (expr->expr_type == EXPR_ARRAY && expr->ts.type == BT_CHARACTER)
5533 get_array_ctor_strlen (&se->pre, expr->value.constructor, &tmp);
5534 expr->ts.u.cl->backend_decl = tmp;
5535 se->string_length = tmp;
5538 /* Is this the result of the enclosing procedure? */
5539 this_array_result = (full_array_var && sym->attr.flavor == FL_PROCEDURE);
5540 if (this_array_result
5541 && (sym->backend_decl != current_function_decl)
5542 && (sym->backend_decl != parent))
5543 this_array_result = false;
5545 /* Passing address of the array if it is not pointer or assumed-shape. */
5546 if (full_array_var && g77 && !this_array_result)
5548 tmp = gfc_get_symbol_decl (sym);
5550 if (sym->ts.type == BT_CHARACTER)
5551 se->string_length = sym->ts.u.cl->backend_decl;
5553 if (sym->ts.type == BT_DERIVED)
5555 gfc_conv_expr_descriptor (se, expr, ss);
5556 se->expr = gfc_conv_array_data (se->expr);
5560 if (!sym->attr.pointer
5562 && sym->as->type != AS_ASSUMED_SHAPE
5563 && !sym->attr.allocatable)
5565 /* Some variables are declared directly, others are declared as
5566 pointers and allocated on the heap. */
5567 if (sym->attr.dummy || POINTER_TYPE_P (TREE_TYPE (tmp)))
5570 se->expr = gfc_build_addr_expr (NULL_TREE, tmp);
5572 array_parameter_size (tmp, expr, size);
5576 if (sym->attr.allocatable)
5578 if (sym->attr.dummy || sym->attr.result)
5580 gfc_conv_expr_descriptor (se, expr, ss);
5584 array_parameter_size (tmp, expr, size);
5585 se->expr = gfc_conv_array_data (tmp);
5590 /* A convenient reduction in scope. */
5591 contiguous = g77 && !this_array_result && contiguous;
5593 /* There is no need to pack and unpack the array, if it is contiguous
5594 and not deferred or assumed shape. */
5595 no_pack = ((sym && sym->as
5596 && !sym->attr.pointer
5597 && sym->as->type != AS_DEFERRED
5598 && sym->as->type != AS_ASSUMED_SHAPE)
5600 (ref && ref->u.ar.as
5601 && ref->u.ar.as->type != AS_DEFERRED
5602 && ref->u.ar.as->type != AS_ASSUMED_SHAPE));
5604 no_pack = contiguous && no_pack;
5606 /* Array constructors are always contiguous and do not need packing. */
5607 array_constructor = g77 && !this_array_result && expr->expr_type == EXPR_ARRAY;
5609 /* Same is true of contiguous sections from allocatable variables. */
5610 good_allocatable = contiguous
5612 && expr->symtree->n.sym->attr.allocatable;
5614 /* Or ultimate allocatable components. */
5615 ultimate_alloc_comp = contiguous && ultimate_alloc_comp;
5617 if (no_pack || array_constructor || good_allocatable || ultimate_alloc_comp)
5619 gfc_conv_expr_descriptor (se, expr, ss);
5620 if (expr->ts.type == BT_CHARACTER)
5621 se->string_length = expr->ts.u.cl->backend_decl;
5623 array_parameter_size (se->expr, expr, size);
5624 se->expr = gfc_conv_array_data (se->expr);
5628 if (this_array_result)
5630 /* Result of the enclosing function. */
5631 gfc_conv_expr_descriptor (se, expr, ss);
5633 array_parameter_size (se->expr, expr, size);
5634 se->expr = gfc_build_addr_expr (NULL_TREE, se->expr);
5636 if (g77 && TREE_TYPE (TREE_TYPE (se->expr)) != NULL_TREE
5637 && GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (TREE_TYPE (se->expr))))
5638 se->expr = gfc_conv_array_data (build_fold_indirect_ref_loc (input_location,
5645 /* Every other type of array. */
5646 se->want_pointer = 1;
5647 gfc_conv_expr_descriptor (se, expr, ss);
5649 array_parameter_size (build_fold_indirect_ref_loc (input_location,
5654 /* Deallocate the allocatable components of structures that are
5656 if (expr->ts.type == BT_DERIVED
5657 && expr->ts.u.derived->attr.alloc_comp
5658 && expr->expr_type != EXPR_VARIABLE)
5660 tmp = build_fold_indirect_ref_loc (input_location,
5662 tmp = gfc_deallocate_alloc_comp (expr->ts.u.derived, tmp, expr->rank);
5663 gfc_add_expr_to_block (&se->post, tmp);
5669 /* Repack the array. */
5670 if (gfc_option.warn_array_temp)
5673 gfc_warning ("Creating array temporary at %L for argument '%s'",
5674 &expr->where, fsym->name);
5676 gfc_warning ("Creating array temporary at %L", &expr->where);
5679 ptr = build_call_expr_loc (input_location,
5680 gfor_fndecl_in_pack, 1, desc);
5682 if (fsym && fsym->attr.optional && sym && sym->attr.optional)
5684 tmp = gfc_conv_expr_present (sym);
5685 ptr = build3 (COND_EXPR, TREE_TYPE (se->expr), tmp,
5686 fold_convert (TREE_TYPE (se->expr), ptr),
5687 fold_convert (TREE_TYPE (se->expr), null_pointer_node));
5690 ptr = gfc_evaluate_now (ptr, &se->pre);
5694 if (gfc_option.rtcheck & GFC_RTCHECK_ARRAY_TEMPS)
5698 if (fsym && proc_name)
5699 asprintf (&msg, "An array temporary was created for argument "
5700 "'%s' of procedure '%s'", fsym->name, proc_name);
5702 asprintf (&msg, "An array temporary was created");
5704 tmp = build_fold_indirect_ref_loc (input_location,
5706 tmp = gfc_conv_array_data (tmp);
5707 tmp = fold_build2 (NE_EXPR, boolean_type_node,
5708 fold_convert (TREE_TYPE (tmp), ptr), tmp);
5710 if (fsym && fsym->attr.optional && sym && sym->attr.optional)
5711 tmp = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
5712 gfc_conv_expr_present (sym), tmp);
5714 gfc_trans_runtime_check (false, true, tmp, &se->pre,
5719 gfc_start_block (&block);
5721 /* Copy the data back. */
5722 if (fsym == NULL || fsym->attr.intent != INTENT_IN)
5724 tmp = build_call_expr_loc (input_location,
5725 gfor_fndecl_in_unpack, 2, desc, ptr);
5726 gfc_add_expr_to_block (&block, tmp);
5729 /* Free the temporary. */
5730 tmp = gfc_call_free (convert (pvoid_type_node, ptr));
5731 gfc_add_expr_to_block (&block, tmp);
5733 stmt = gfc_finish_block (&block);
5735 gfc_init_block (&block);
5736 /* Only if it was repacked. This code needs to be executed before the
5737 loop cleanup code. */
5738 tmp = build_fold_indirect_ref_loc (input_location,
5740 tmp = gfc_conv_array_data (tmp);
5741 tmp = fold_build2 (NE_EXPR, boolean_type_node,
5742 fold_convert (TREE_TYPE (tmp), ptr), tmp);
5744 if (fsym && fsym->attr.optional && sym && sym->attr.optional)
5745 tmp = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
5746 gfc_conv_expr_present (sym), tmp);
5748 tmp = build3_v (COND_EXPR, tmp, stmt, build_empty_stmt (input_location));
5750 gfc_add_expr_to_block (&block, tmp);
5751 gfc_add_block_to_block (&block, &se->post);
5753 gfc_init_block (&se->post);
5754 gfc_add_block_to_block (&se->post, &block);
5759 /* Generate code to deallocate an array, if it is allocated. */
5762 gfc_trans_dealloc_allocated (tree descriptor)
5768 gfc_start_block (&block);
5770 var = gfc_conv_descriptor_data_get (descriptor);
5773 /* Call array_deallocate with an int * present in the second argument.
5774 Although it is ignored here, it's presence ensures that arrays that
5775 are already deallocated are ignored. */
5776 tmp = gfc_deallocate_with_status (var, NULL_TREE, true, NULL);
5777 gfc_add_expr_to_block (&block, tmp);
5779 /* Zero the data pointer. */
5780 tmp = fold_build2 (MODIFY_EXPR, void_type_node,
5781 var, build_int_cst (TREE_TYPE (var), 0));
5782 gfc_add_expr_to_block (&block, tmp);
5784 return gfc_finish_block (&block);
5788 /* This helper function calculates the size in words of a full array. */
5791 get_full_array_size (stmtblock_t *block, tree decl, int rank)
5796 idx = gfc_rank_cst[rank - 1];
5797 nelems = gfc_conv_descriptor_ubound_get (decl, idx);
5798 tmp = gfc_conv_descriptor_lbound_get (decl, idx);
5799 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, nelems, tmp);
5800 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
5801 tmp, gfc_index_one_node);
5802 tmp = gfc_evaluate_now (tmp, block);
5804 nelems = gfc_conv_descriptor_stride_get (decl, idx);
5805 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type, nelems, tmp);
5806 return gfc_evaluate_now (tmp, block);
5810 /* Allocate dest to the same size as src, and copy src -> dest.
5811 If no_malloc is set, only the copy is done. */
5814 duplicate_allocatable(tree dest, tree src, tree type, int rank,
5824 /* If the source is null, set the destination to null. Then,
5825 allocate memory to the destination. */
5826 gfc_init_block (&block);
5830 tmp = null_pointer_node;
5831 tmp = fold_build2 (MODIFY_EXPR, type, dest, tmp);
5832 gfc_add_expr_to_block (&block, tmp);
5833 null_data = gfc_finish_block (&block);
5835 gfc_init_block (&block);
5836 size = TYPE_SIZE_UNIT (type);
5839 tmp = gfc_call_malloc (&block, type, size);
5840 tmp = fold_build2 (MODIFY_EXPR, void_type_node, dest,
5841 fold_convert (type, tmp));
5842 gfc_add_expr_to_block (&block, tmp);
5845 tmp = built_in_decls[BUILT_IN_MEMCPY];
5846 tmp = build_call_expr_loc (input_location, tmp, 3,
5851 gfc_conv_descriptor_data_set (&block, dest, null_pointer_node);
5852 null_data = gfc_finish_block (&block);
5854 gfc_init_block (&block);
5855 nelems = get_full_array_size (&block, src, rank);
5856 tmp = fold_convert (gfc_array_index_type,
5857 TYPE_SIZE_UNIT (gfc_get_element_type (type)));
5858 size = fold_build2 (MULT_EXPR, gfc_array_index_type, nelems, tmp);
5861 tmp = TREE_TYPE (gfc_conv_descriptor_data_get (src));
5862 tmp = gfc_call_malloc (&block, tmp, size);
5863 gfc_conv_descriptor_data_set (&block, dest, tmp);
5866 /* We know the temporary and the value will be the same length,
5867 so can use memcpy. */
5868 tmp = built_in_decls[BUILT_IN_MEMCPY];
5869 tmp = build_call_expr_loc (input_location,
5870 tmp, 3, gfc_conv_descriptor_data_get (dest),
5871 gfc_conv_descriptor_data_get (src), size);
5874 gfc_add_expr_to_block (&block, tmp);
5875 tmp = gfc_finish_block (&block);
5877 /* Null the destination if the source is null; otherwise do
5878 the allocate and copy. */
5882 null_cond = gfc_conv_descriptor_data_get (src);
5884 null_cond = convert (pvoid_type_node, null_cond);
5885 null_cond = fold_build2 (NE_EXPR, boolean_type_node,
5886 null_cond, null_pointer_node);
5887 return build3_v (COND_EXPR, null_cond, tmp, null_data);
5891 /* Allocate dest to the same size as src, and copy data src -> dest. */
5894 gfc_duplicate_allocatable (tree dest, tree src, tree type, int rank)
5896 return duplicate_allocatable(dest, src, type, rank, false);
5900 /* Copy data src -> dest. */
5903 gfc_copy_allocatable_data (tree dest, tree src, tree type, int rank)
5905 return duplicate_allocatable(dest, src, type, rank, true);
5909 /* Recursively traverse an object of derived type, generating code to
5910 deallocate, nullify or copy allocatable components. This is the work horse
5911 function for the functions named in this enum. */
5913 enum {DEALLOCATE_ALLOC_COMP = 1, NULLIFY_ALLOC_COMP, COPY_ALLOC_COMP,
5914 COPY_ONLY_ALLOC_COMP};
5917 structure_alloc_comps (gfc_symbol * der_type, tree decl,
5918 tree dest, int rank, int purpose)
5922 stmtblock_t fnblock;
5923 stmtblock_t loopbody;
5933 tree null_cond = NULL_TREE;
5935 gfc_init_block (&fnblock);
5937 if (POINTER_TYPE_P (TREE_TYPE (decl)) && rank != 0)
5938 decl = build_fold_indirect_ref_loc (input_location,
5941 /* If this an array of derived types with allocatable components
5942 build a loop and recursively call this function. */
5943 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5944 || GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl)))
5946 tmp = gfc_conv_array_data (decl);
5947 var = build_fold_indirect_ref_loc (input_location,
5950 /* Get the number of elements - 1 and set the counter. */
5951 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl)))
5953 /* Use the descriptor for an allocatable array. Since this
5954 is a full array reference, we only need the descriptor
5955 information from dimension = rank. */
5956 tmp = get_full_array_size (&fnblock, decl, rank);
5957 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
5958 tmp, gfc_index_one_node);
5960 null_cond = gfc_conv_descriptor_data_get (decl);
5961 null_cond = fold_build2 (NE_EXPR, boolean_type_node, null_cond,
5962 build_int_cst (TREE_TYPE (null_cond), 0));
5966 /* Otherwise use the TYPE_DOMAIN information. */
5967 tmp = array_type_nelts (TREE_TYPE (decl));
5968 tmp = fold_convert (gfc_array_index_type, tmp);
5971 /* Remember that this is, in fact, the no. of elements - 1. */
5972 nelems = gfc_evaluate_now (tmp, &fnblock);
5973 index = gfc_create_var (gfc_array_index_type, "S");
5975 /* Build the body of the loop. */
5976 gfc_init_block (&loopbody);
5978 vref = gfc_build_array_ref (var, index, NULL);
5980 if (purpose == COPY_ALLOC_COMP)
5982 if (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (dest)))
5984 tmp = gfc_duplicate_allocatable (dest, decl, TREE_TYPE(decl), rank);
5985 gfc_add_expr_to_block (&fnblock, tmp);
5987 tmp = build_fold_indirect_ref_loc (input_location,
5988 gfc_conv_array_data (dest));
5989 dref = gfc_build_array_ref (tmp, index, NULL);
5990 tmp = structure_alloc_comps (der_type, vref, dref, rank, purpose);
5992 else if (purpose == COPY_ONLY_ALLOC_COMP)
5994 tmp = build_fold_indirect_ref_loc (input_location,
5995 gfc_conv_array_data (dest));
5996 dref = gfc_build_array_ref (tmp, index, NULL);
5997 tmp = structure_alloc_comps (der_type, vref, dref, rank,
6001 tmp = structure_alloc_comps (der_type, vref, NULL_TREE, rank, purpose);
6003 gfc_add_expr_to_block (&loopbody, tmp);
6005 /* Build the loop and return. */
6006 gfc_init_loopinfo (&loop);
6008 loop.from[0] = gfc_index_zero_node;
6009 loop.loopvar[0] = index;
6010 loop.to[0] = nelems;
6011 gfc_trans_scalarizing_loops (&loop, &loopbody);
6012 gfc_add_block_to_block (&fnblock, &loop.pre);
6014 tmp = gfc_finish_block (&fnblock);
6015 if (null_cond != NULL_TREE)
6016 tmp = build3_v (COND_EXPR, null_cond, tmp,
6017 build_empty_stmt (input_location));
6022 /* Otherwise, act on the components or recursively call self to
6023 act on a chain of components. */
6024 for (c = der_type->components; c; c = c->next)
6026 bool cmp_has_alloc_comps = (c->ts.type == BT_DERIVED)
6027 && c->ts.u.derived->attr.alloc_comp;
6028 cdecl = c->backend_decl;
6029 ctype = TREE_TYPE (cdecl);
6033 case DEALLOCATE_ALLOC_COMP:
6034 /* Do not deallocate the components of ultimate pointer
6036 if (cmp_has_alloc_comps && !c->attr.pointer)
6038 comp = fold_build3 (COMPONENT_REF, ctype,
6039 decl, cdecl, NULL_TREE);
6040 rank = c->as ? c->as->rank : 0;
6041 tmp = structure_alloc_comps (c->ts.u.derived, comp, NULL_TREE,
6043 gfc_add_expr_to_block (&fnblock, tmp);
6046 if (c->attr.allocatable && c->attr.dimension)
6048 comp = fold_build3 (COMPONENT_REF, ctype,
6049 decl, cdecl, NULL_TREE);
6050 tmp = gfc_trans_dealloc_allocated (comp);
6051 gfc_add_expr_to_block (&fnblock, tmp);
6053 else if (c->attr.allocatable)
6055 /* Allocatable scalar components. */
6056 comp = fold_build3 (COMPONENT_REF, ctype, decl, cdecl, NULL_TREE);
6058 tmp = gfc_deallocate_with_status (comp, NULL_TREE, true, NULL);
6059 gfc_add_expr_to_block (&fnblock, tmp);
6061 tmp = fold_build2 (MODIFY_EXPR, void_type_node, comp,
6062 build_int_cst (TREE_TYPE (comp), 0));
6063 gfc_add_expr_to_block (&fnblock, tmp);
6065 else if (c->ts.type == BT_CLASS
6066 && c->ts.u.derived->components->attr.allocatable)
6068 /* Allocatable scalar CLASS components. */
6069 comp = fold_build3 (COMPONENT_REF, ctype, decl, cdecl, NULL_TREE);
6071 /* Add reference to '$data' component. */
6072 tmp = c->ts.u.derived->components->backend_decl;
6073 comp = fold_build3 (COMPONENT_REF, TREE_TYPE (tmp),
6074 comp, tmp, NULL_TREE);
6076 tmp = gfc_deallocate_with_status (comp, NULL_TREE, true, NULL);
6077 gfc_add_expr_to_block (&fnblock, tmp);
6079 tmp = fold_build2 (MODIFY_EXPR, void_type_node, comp,
6080 build_int_cst (TREE_TYPE (comp), 0));
6081 gfc_add_expr_to_block (&fnblock, tmp);
6085 case NULLIFY_ALLOC_COMP:
6086 if (c->attr.pointer)
6088 else if (c->attr.allocatable && c->attr.dimension)
6090 comp = fold_build3 (COMPONENT_REF, ctype,
6091 decl, cdecl, NULL_TREE);
6092 gfc_conv_descriptor_data_set (&fnblock, comp, null_pointer_node);
6094 else if (c->attr.allocatable)
6096 /* Allocatable scalar components. */
6097 comp = fold_build3 (COMPONENT_REF, ctype, decl, cdecl, NULL_TREE);
6098 tmp = fold_build2 (MODIFY_EXPR, void_type_node, comp,
6099 build_int_cst (TREE_TYPE (comp), 0));
6100 gfc_add_expr_to_block (&fnblock, tmp);
6102 else if (c->ts.type == BT_CLASS
6103 && c->ts.u.derived->components->attr.allocatable)
6105 /* Allocatable scalar CLASS components. */
6106 comp = fold_build3 (COMPONENT_REF, ctype, decl, cdecl, NULL_TREE);
6107 /* Add reference to '$data' component. */
6108 tmp = c->ts.u.derived->components->backend_decl;
6109 comp = fold_build3 (COMPONENT_REF, TREE_TYPE (tmp),
6110 comp, tmp, NULL_TREE);
6111 tmp = fold_build2 (MODIFY_EXPR, void_type_node, comp,
6112 build_int_cst (TREE_TYPE (comp), 0));
6113 gfc_add_expr_to_block (&fnblock, tmp);
6115 else if (cmp_has_alloc_comps)
6117 comp = fold_build3 (COMPONENT_REF, ctype,
6118 decl, cdecl, NULL_TREE);
6119 rank = c->as ? c->as->rank : 0;
6120 tmp = structure_alloc_comps (c->ts.u.derived, comp, NULL_TREE,
6122 gfc_add_expr_to_block (&fnblock, tmp);
6126 case COPY_ALLOC_COMP:
6127 if (c->attr.pointer)
6130 /* We need source and destination components. */
6131 comp = fold_build3 (COMPONENT_REF, ctype, decl, cdecl, NULL_TREE);
6132 dcmp = fold_build3 (COMPONENT_REF, ctype, dest, cdecl, NULL_TREE);
6133 dcmp = fold_convert (TREE_TYPE (comp), dcmp);
6135 if (c->attr.allocatable && !cmp_has_alloc_comps)
6137 rank = c->as ? c->as->rank : 0;
6138 tmp = gfc_duplicate_allocatable(dcmp, comp, ctype, rank);
6139 gfc_add_expr_to_block (&fnblock, tmp);
6142 if (cmp_has_alloc_comps)
6144 rank = c->as ? c->as->rank : 0;
6145 tmp = fold_convert (TREE_TYPE (dcmp), comp);
6146 gfc_add_modify (&fnblock, dcmp, tmp);
6147 tmp = structure_alloc_comps (c->ts.u.derived, comp, dcmp,
6149 gfc_add_expr_to_block (&fnblock, tmp);
6159 return gfc_finish_block (&fnblock);
6162 /* Recursively traverse an object of derived type, generating code to
6163 nullify allocatable components. */
6166 gfc_nullify_alloc_comp (gfc_symbol * der_type, tree decl, int rank)
6168 return structure_alloc_comps (der_type, decl, NULL_TREE, rank,
6169 NULLIFY_ALLOC_COMP);
6173 /* Recursively traverse an object of derived type, generating code to
6174 deallocate allocatable components. */
6177 gfc_deallocate_alloc_comp (gfc_symbol * der_type, tree decl, int rank)
6179 return structure_alloc_comps (der_type, decl, NULL_TREE, rank,
6180 DEALLOCATE_ALLOC_COMP);
6184 /* Recursively traverse an object of derived type, generating code to
6185 copy it and its allocatable components. */
6188 gfc_copy_alloc_comp (gfc_symbol * der_type, tree decl, tree dest, int rank)
6190 return structure_alloc_comps (der_type, decl, dest, rank, COPY_ALLOC_COMP);
6194 /* Recursively traverse an object of derived type, generating code to
6195 copy only its allocatable components. */
6198 gfc_copy_only_alloc_comp (gfc_symbol * der_type, tree decl, tree dest, int rank)
6200 return structure_alloc_comps (der_type, decl, dest, rank, COPY_ONLY_ALLOC_COMP);
6204 /* Check for default initializer; sym->value is not enough as it is also
6205 set for EXPR_NULL of allocatables. */
6208 has_default_initializer (gfc_symbol *der)
6212 gcc_assert (der->attr.flavor == FL_DERIVED);
6213 for (c = der->components; c; c = c->next)
6214 if ((c->ts.type != BT_DERIVED && c->initializer)
6215 || (c->ts.type == BT_DERIVED
6216 && (!c->attr.pointer && has_default_initializer (c->ts.u.derived))))
6223 /* NULLIFY an allocatable/pointer array on function entry, free it on exit.
6224 Do likewise, recursively if necessary, with the allocatable components of
6228 gfc_trans_deferred_array (gfc_symbol * sym, tree body)
6233 stmtblock_t fnblock;
6236 bool sym_has_alloc_comp;
6238 sym_has_alloc_comp = (sym->ts.type == BT_DERIVED)
6239 && sym->ts.u.derived->attr.alloc_comp;
6241 /* Make sure the frontend gets these right. */
6242 if (!(sym->attr.pointer || sym->attr.allocatable || sym_has_alloc_comp))
6243 fatal_error ("Possible frontend bug: Deferred array size without pointer, "
6244 "allocatable attribute or derived type without allocatable "
6247 gfc_init_block (&fnblock);
6249 gcc_assert (TREE_CODE (sym->backend_decl) == VAR_DECL
6250 || TREE_CODE (sym->backend_decl) == PARM_DECL);
6252 if (sym->ts.type == BT_CHARACTER
6253 && !INTEGER_CST_P (sym->ts.u.cl->backend_decl))
6255 gfc_conv_string_length (sym->ts.u.cl, NULL, &fnblock);
6256 gfc_trans_vla_type_sizes (sym, &fnblock);
6259 /* Dummy, use associated and result variables don't need anything special. */
6260 if (sym->attr.dummy || sym->attr.use_assoc || sym->attr.result)
6262 gfc_add_expr_to_block (&fnblock, body);
6264 return gfc_finish_block (&fnblock);
6267 gfc_get_backend_locus (&loc);
6268 gfc_set_backend_locus (&sym->declared_at);
6269 descriptor = sym->backend_decl;
6271 /* Although static, derived types with default initializers and
6272 allocatable components must not be nulled wholesale; instead they
6273 are treated component by component. */
6274 if (TREE_STATIC (descriptor) && !sym_has_alloc_comp)
6276 /* SAVEd variables are not freed on exit. */
6277 gfc_trans_static_array_pointer (sym);
6281 /* Get the descriptor type. */
6282 type = TREE_TYPE (sym->backend_decl);
6284 if (sym_has_alloc_comp && !(sym->attr.pointer || sym->attr.allocatable))
6287 && !(TREE_STATIC (sym->backend_decl) && sym->attr.is_main_program))
6289 if (sym->value == NULL || !has_default_initializer (sym->ts.u.derived))
6291 rank = sym->as ? sym->as->rank : 0;
6292 tmp = gfc_nullify_alloc_comp (sym->ts.u.derived, descriptor, rank);
6293 gfc_add_expr_to_block (&fnblock, tmp);
6297 tmp = gfc_init_default_dt (sym, NULL, false);
6298 gfc_add_expr_to_block (&fnblock, tmp);
6302 else if (!GFC_DESCRIPTOR_TYPE_P (type))
6304 /* If the backend_decl is not a descriptor, we must have a pointer
6306 descriptor = build_fold_indirect_ref_loc (input_location,
6308 type = TREE_TYPE (descriptor);
6311 /* NULLIFY the data pointer. */
6312 if (GFC_DESCRIPTOR_TYPE_P (type) && !sym->attr.save)
6313 gfc_conv_descriptor_data_set (&fnblock, descriptor, null_pointer_node);
6315 gfc_add_expr_to_block (&fnblock, body);
6317 gfc_set_backend_locus (&loc);
6319 /* Allocatable arrays need to be freed when they go out of scope.
6320 The allocatable components of pointers must not be touched. */
6321 if (sym_has_alloc_comp && !(sym->attr.function || sym->attr.result)
6322 && !sym->attr.pointer && !sym->attr.save)
6325 rank = sym->as ? sym->as->rank : 0;
6326 tmp = gfc_deallocate_alloc_comp (sym->ts.u.derived, descriptor, rank);
6327 gfc_add_expr_to_block (&fnblock, tmp);
6330 if (sym->attr.allocatable && sym->attr.dimension
6331 && !sym->attr.save && !sym->attr.result)
6333 tmp = gfc_trans_dealloc_allocated (sym->backend_decl);
6334 gfc_add_expr_to_block (&fnblock, tmp);
6337 return gfc_finish_block (&fnblock);
6340 /************ Expression Walking Functions ******************/
6342 /* Walk a variable reference.
6344 Possible extension - multiple component subscripts.
6345 x(:,:) = foo%a(:)%b(:)
6347 forall (i=..., j=...)
6348 x(i,j) = foo%a(j)%b(i)
6350 This adds a fair amount of complexity because you need to deal with more
6351 than one ref. Maybe handle in a similar manner to vector subscripts.
6352 Maybe not worth the effort. */
6356 gfc_walk_variable_expr (gfc_ss * ss, gfc_expr * expr)
6363 for (ref = expr->ref; ref; ref = ref->next)
6364 if (ref->type == REF_ARRAY && ref->u.ar.type != AR_ELEMENT)
6367 for (; ref; ref = ref->next)
6369 if (ref->type == REF_SUBSTRING)
6371 newss = gfc_get_ss ();
6372 newss->type = GFC_SS_SCALAR;
6373 newss->expr = ref->u.ss.start;
6377 newss = gfc_get_ss ();
6378 newss->type = GFC_SS_SCALAR;
6379 newss->expr = ref->u.ss.end;
6384 /* We're only interested in array sections from now on. */
6385 if (ref->type != REF_ARRAY)
6390 if (ar->as->rank == 0)
6392 /* Scalar coarray. */
6399 for (n = 0; n < ar->dimen; n++)
6401 newss = gfc_get_ss ();
6402 newss->type = GFC_SS_SCALAR;
6403 newss->expr = ar->start[n];
6410 newss = gfc_get_ss ();
6411 newss->type = GFC_SS_SECTION;
6414 newss->data.info.dimen = ar->as->rank;
6415 newss->data.info.ref = ref;
6417 /* Make sure array is the same as array(:,:), this way
6418 we don't need to special case all the time. */
6419 ar->dimen = ar->as->rank;
6420 for (n = 0; n < ar->dimen; n++)
6422 newss->data.info.dim[n] = n;
6423 ar->dimen_type[n] = DIMEN_RANGE;
6425 gcc_assert (ar->start[n] == NULL);
6426 gcc_assert (ar->end[n] == NULL);
6427 gcc_assert (ar->stride[n] == NULL);
6433 newss = gfc_get_ss ();
6434 newss->type = GFC_SS_SECTION;
6437 newss->data.info.dimen = 0;
6438 newss->data.info.ref = ref;
6440 /* We add SS chains for all the subscripts in the section. */
6441 for (n = 0; n < ar->dimen; n++)
6445 switch (ar->dimen_type[n])
6448 /* Add SS for elemental (scalar) subscripts. */
6449 gcc_assert (ar->start[n]);
6450 indexss = gfc_get_ss ();
6451 indexss->type = GFC_SS_SCALAR;
6452 indexss->expr = ar->start[n];
6453 indexss->next = gfc_ss_terminator;
6454 indexss->loop_chain = gfc_ss_terminator;
6455 newss->data.info.subscript[n] = indexss;
6459 /* We don't add anything for sections, just remember this
6460 dimension for later. */
6461 newss->data.info.dim[newss->data.info.dimen] = n;
6462 newss->data.info.dimen++;
6466 /* Create a GFC_SS_VECTOR index in which we can store
6467 the vector's descriptor. */
6468 indexss = gfc_get_ss ();
6469 indexss->type = GFC_SS_VECTOR;
6470 indexss->expr = ar->start[n];
6471 indexss->next = gfc_ss_terminator;
6472 indexss->loop_chain = gfc_ss_terminator;
6473 newss->data.info.subscript[n] = indexss;
6474 newss->data.info.dim[newss->data.info.dimen] = n;
6475 newss->data.info.dimen++;
6479 /* We should know what sort of section it is by now. */
6483 /* We should have at least one non-elemental dimension. */
6484 gcc_assert (newss->data.info.dimen > 0);
6489 /* We should know what sort of section it is by now. */
6498 /* Walk an expression operator. If only one operand of a binary expression is
6499 scalar, we must also add the scalar term to the SS chain. */
6502 gfc_walk_op_expr (gfc_ss * ss, gfc_expr * expr)
6508 head = gfc_walk_subexpr (ss, expr->value.op.op1);
6509 if (expr->value.op.op2 == NULL)
6512 head2 = gfc_walk_subexpr (head, expr->value.op.op2);
6514 /* All operands are scalar. Pass back and let the caller deal with it. */
6518 /* All operands require scalarization. */
6519 if (head != ss && (expr->value.op.op2 == NULL || head2 != head))
6522 /* One of the operands needs scalarization, the other is scalar.
6523 Create a gfc_ss for the scalar expression. */
6524 newss = gfc_get_ss ();
6525 newss->type = GFC_SS_SCALAR;
6528 /* First operand is scalar. We build the chain in reverse order, so
6529 add the scalar SS after the second operand. */
6531 while (head && head->next != ss)
6533 /* Check we haven't somehow broken the chain. */
6537 newss->expr = expr->value.op.op1;
6539 else /* head2 == head */
6541 gcc_assert (head2 == head);
6542 /* Second operand is scalar. */
6543 newss->next = head2;
6545 newss->expr = expr->value.op.op2;
6552 /* Reverse a SS chain. */
6555 gfc_reverse_ss (gfc_ss * ss)
6560 gcc_assert (ss != NULL);
6562 head = gfc_ss_terminator;
6563 while (ss != gfc_ss_terminator)
6566 /* Check we didn't somehow break the chain. */
6567 gcc_assert (next != NULL);
6577 /* Walk the arguments of an elemental function. */
6580 gfc_walk_elemental_function_args (gfc_ss * ss, gfc_actual_arglist *arg,
6588 head = gfc_ss_terminator;
6591 for (; arg; arg = arg->next)
6596 newss = gfc_walk_subexpr (head, arg->expr);
6599 /* Scalar argument. */
6600 newss = gfc_get_ss ();
6602 newss->expr = arg->expr;
6612 while (tail->next != gfc_ss_terminator)
6619 /* If all the arguments are scalar we don't need the argument SS. */
6620 gfc_free_ss_chain (head);
6625 /* Add it onto the existing chain. */
6631 /* Walk a function call. Scalar functions are passed back, and taken out of
6632 scalarization loops. For elemental functions we walk their arguments.
6633 The result of functions returning arrays is stored in a temporary outside
6634 the loop, so that the function is only called once. Hence we do not need
6635 to walk their arguments. */
6638 gfc_walk_function_expr (gfc_ss * ss, gfc_expr * expr)
6641 gfc_intrinsic_sym *isym;
6643 gfc_component *comp = NULL;
6645 isym = expr->value.function.isym;
6647 /* Handle intrinsic functions separately. */
6649 return gfc_walk_intrinsic_function (ss, expr, isym);
6651 sym = expr->value.function.esym;
6653 sym = expr->symtree->n.sym;
6655 /* A function that returns arrays. */
6656 gfc_is_proc_ptr_comp (expr, &comp);
6657 if ((!comp && gfc_return_by_reference (sym) && sym->result->attr.dimension)
6658 || (comp && comp->attr.dimension))
6660 newss = gfc_get_ss ();
6661 newss->type = GFC_SS_FUNCTION;
6664 newss->data.info.dimen = expr->rank;
6668 /* Walk the parameters of an elemental function. For now we always pass
6670 if (sym->attr.elemental)
6671 return gfc_walk_elemental_function_args (ss, expr->value.function.actual,
6674 /* Scalar functions are OK as these are evaluated outside the scalarization
6675 loop. Pass back and let the caller deal with it. */
6680 /* An array temporary is constructed for array constructors. */
6683 gfc_walk_array_constructor (gfc_ss * ss, gfc_expr * expr)
6688 newss = gfc_get_ss ();
6689 newss->type = GFC_SS_CONSTRUCTOR;
6692 newss->data.info.dimen = expr->rank;
6693 for (n = 0; n < expr->rank; n++)
6694 newss->data.info.dim[n] = n;
6700 /* Walk an expression. Add walked expressions to the head of the SS chain.
6701 A wholly scalar expression will not be added. */
6704 gfc_walk_subexpr (gfc_ss * ss, gfc_expr * expr)
6708 switch (expr->expr_type)
6711 head = gfc_walk_variable_expr (ss, expr);
6715 head = gfc_walk_op_expr (ss, expr);
6719 head = gfc_walk_function_expr (ss, expr);
6724 case EXPR_STRUCTURE:
6725 /* Pass back and let the caller deal with it. */
6729 head = gfc_walk_array_constructor (ss, expr);
6732 case EXPR_SUBSTRING:
6733 /* Pass back and let the caller deal with it. */
6737 internal_error ("bad expression type during walk (%d)",
6744 /* Entry point for expression walking.
6745 A return value equal to the passed chain means this is
6746 a scalar expression. It is up to the caller to take whatever action is
6747 necessary to translate these. */
6750 gfc_walk_expr (gfc_expr * expr)
6754 res = gfc_walk_subexpr (gfc_ss_terminator, expr);
6755 return gfc_reverse_ss (res);