1 /* Expression translation
2 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
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-expr.c-- generate GENERIC trees for gfc_expr. */
27 #include "coretypes.h"
34 #include "langhooks.h"
39 #include "trans-const.h"
40 #include "trans-types.h"
41 #include "trans-array.h"
42 /* Only for gfc_trans_assign and gfc_trans_pointer_assign. */
43 #include "trans-stmt.h"
44 #include "dependency.h"
46 static tree gfc_trans_structure_assign (tree dest, gfc_expr * expr);
47 static void gfc_apply_interface_mapping_to_expr (gfc_interface_mapping *,
50 /* Copy the scalarization loop variables. */
53 gfc_copy_se_loopvars (gfc_se * dest, gfc_se * src)
56 dest->loop = src->loop;
60 /* Initialize a simple expression holder.
62 Care must be taken when multiple se are created with the same parent.
63 The child se must be kept in sync. The easiest way is to delay creation
64 of a child se until after after the previous se has been translated. */
67 gfc_init_se (gfc_se * se, gfc_se * parent)
69 memset (se, 0, sizeof (gfc_se));
70 gfc_init_block (&se->pre);
71 gfc_init_block (&se->post);
76 gfc_copy_se_loopvars (se, parent);
80 /* Advances to the next SS in the chain. Use this rather than setting
81 se->ss = se->ss->next because all the parents needs to be kept in sync.
85 gfc_advance_se_ss_chain (gfc_se * se)
89 gcc_assert (se != NULL && se->ss != NULL && se->ss != gfc_ss_terminator);
92 /* Walk down the parent chain. */
95 /* Simple consistency check. */
96 gcc_assert (p->parent == NULL || p->parent->ss == p->ss);
105 /* Ensures the result of the expression as either a temporary variable
106 or a constant so that it can be used repeatedly. */
109 gfc_make_safe_expr (gfc_se * se)
113 if (CONSTANT_CLASS_P (se->expr))
116 /* We need a temporary for this result. */
117 var = gfc_create_var (TREE_TYPE (se->expr), NULL);
118 gfc_add_modify (&se->pre, var, se->expr);
123 /* Return an expression which determines if a dummy parameter is present.
124 Also used for arguments to procedures with multiple entry points. */
127 gfc_conv_expr_present (gfc_symbol * sym)
131 gcc_assert (sym->attr.dummy);
133 decl = gfc_get_symbol_decl (sym);
134 if (TREE_CODE (decl) != PARM_DECL)
136 /* Array parameters use a temporary descriptor, we want the real
138 gcc_assert (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl))
139 || GFC_ARRAY_TYPE_P (TREE_TYPE (decl)));
140 decl = GFC_DECL_SAVED_DESCRIPTOR (decl);
142 return fold_build2 (NE_EXPR, boolean_type_node, decl,
143 fold_convert (TREE_TYPE (decl), null_pointer_node));
147 /* Converts a missing, dummy argument into a null or zero. */
150 gfc_conv_missing_dummy (gfc_se * se, gfc_expr * arg, gfc_typespec ts, int kind)
155 present = gfc_conv_expr_present (arg->symtree->n.sym);
159 /* Create a temporary and convert it to the correct type. */
160 tmp = gfc_get_int_type (kind);
161 tmp = fold_convert (tmp, build_fold_indirect_ref (se->expr));
163 /* Test for a NULL value. */
164 tmp = build3 (COND_EXPR, TREE_TYPE (tmp), present, tmp,
165 fold_convert (TREE_TYPE (tmp), integer_one_node));
166 tmp = gfc_evaluate_now (tmp, &se->pre);
167 se->expr = gfc_build_addr_expr (NULL_TREE, tmp);
171 tmp = build3 (COND_EXPR, TREE_TYPE (se->expr), present, se->expr,
172 fold_convert (TREE_TYPE (se->expr), integer_zero_node));
173 tmp = gfc_evaluate_now (tmp, &se->pre);
177 if (ts.type == BT_CHARACTER)
179 tmp = build_int_cst (gfc_charlen_type_node, 0);
180 tmp = fold_build3 (COND_EXPR, gfc_charlen_type_node,
181 present, se->string_length, tmp);
182 tmp = gfc_evaluate_now (tmp, &se->pre);
183 se->string_length = tmp;
189 /* Get the character length of an expression, looking through gfc_refs
193 gfc_get_expr_charlen (gfc_expr *e)
198 gcc_assert (e->expr_type == EXPR_VARIABLE
199 && e->ts.type == BT_CHARACTER);
201 length = NULL; /* To silence compiler warning. */
203 if (is_subref_array (e) && e->ts.cl->length)
206 gfc_init_se (&tmpse, NULL);
207 gfc_conv_expr_type (&tmpse, e->ts.cl->length, gfc_charlen_type_node);
208 e->ts.cl->backend_decl = tmpse.expr;
212 /* First candidate: if the variable is of type CHARACTER, the
213 expression's length could be the length of the character
215 if (e->symtree->n.sym->ts.type == BT_CHARACTER)
216 length = e->symtree->n.sym->ts.cl->backend_decl;
218 /* Look through the reference chain for component references. */
219 for (r = e->ref; r; r = r->next)
224 if (r->u.c.component->ts.type == BT_CHARACTER)
225 length = r->u.c.component->ts.cl->backend_decl;
233 /* We should never got substring references here. These will be
234 broken down by the scalarizer. */
240 gcc_assert (length != NULL);
245 /* For each character array constructor subexpression without a ts.cl->length,
246 replace it by its first element (if there aren't any elements, the length
247 should already be set to zero). */
250 flatten_array_ctors_without_strlen (gfc_expr* e)
252 gfc_actual_arglist* arg;
258 switch (e->expr_type)
262 flatten_array_ctors_without_strlen (e->value.op.op1);
263 flatten_array_ctors_without_strlen (e->value.op.op2);
267 /* TODO: Implement as with EXPR_FUNCTION when needed. */
271 for (arg = e->value.function.actual; arg; arg = arg->next)
272 flatten_array_ctors_without_strlen (arg->expr);
277 /* We've found what we're looking for. */
278 if (e->ts.type == BT_CHARACTER && !e->ts.cl->length)
281 gcc_assert (e->value.constructor);
283 new_expr = e->value.constructor->expr;
284 e->value.constructor->expr = NULL;
286 flatten_array_ctors_without_strlen (new_expr);
287 gfc_replace_expr (e, new_expr);
291 /* Otherwise, fall through to handle constructor elements. */
293 for (c = e->value.constructor; c; c = c->next)
294 flatten_array_ctors_without_strlen (c->expr);
304 /* Generate code to initialize a string length variable. Returns the
305 value. For array constructors, cl->length might be NULL and in this case,
306 the first element of the constructor is needed. expr is the original
307 expression so we can access it but can be NULL if this is not needed. */
310 gfc_conv_string_length (gfc_charlen * cl, gfc_expr * expr, stmtblock_t * pblock)
314 gfc_init_se (&se, NULL);
316 /* If cl->length is NULL, use gfc_conv_expr to obtain the string length but
317 "flatten" array constructors by taking their first element; all elements
318 should be the same length or a cl->length should be present. */
324 expr_flat = gfc_copy_expr (expr);
325 flatten_array_ctors_without_strlen (expr_flat);
326 gfc_resolve_expr (expr_flat);
328 gfc_conv_expr (&se, expr_flat);
329 gfc_add_block_to_block (pblock, &se.pre);
330 cl->backend_decl = convert (gfc_charlen_type_node, se.string_length);
332 gfc_free_expr (expr_flat);
336 /* Convert cl->length. */
338 gcc_assert (cl->length);
340 gfc_conv_expr_type (&se, cl->length, gfc_charlen_type_node);
341 se.expr = fold_build2 (MAX_EXPR, gfc_charlen_type_node, se.expr,
342 build_int_cst (gfc_charlen_type_node, 0));
343 gfc_add_block_to_block (pblock, &se.pre);
345 if (cl->backend_decl)
346 gfc_add_modify (pblock, cl->backend_decl, se.expr);
348 cl->backend_decl = gfc_evaluate_now (se.expr, pblock);
353 gfc_conv_substring (gfc_se * se, gfc_ref * ref, int kind,
354 const char *name, locus *where)
364 type = gfc_get_character_type (kind, ref->u.ss.length);
365 type = build_pointer_type (type);
368 gfc_init_se (&start, se);
369 gfc_conv_expr_type (&start, ref->u.ss.start, gfc_charlen_type_node);
370 gfc_add_block_to_block (&se->pre, &start.pre);
372 if (integer_onep (start.expr))
373 gfc_conv_string_parameter (se);
376 /* Avoid multiple evaluation of substring start. */
377 if (!CONSTANT_CLASS_P (start.expr) && !DECL_P (start.expr))
378 start.expr = gfc_evaluate_now (start.expr, &se->pre);
380 /* Change the start of the string. */
381 if (TYPE_STRING_FLAG (TREE_TYPE (se->expr)))
384 tmp = build_fold_indirect_ref (se->expr);
385 tmp = gfc_build_array_ref (tmp, start.expr, NULL);
386 se->expr = gfc_build_addr_expr (type, tmp);
389 /* Length = end + 1 - start. */
390 gfc_init_se (&end, se);
391 if (ref->u.ss.end == NULL)
392 end.expr = se->string_length;
395 gfc_conv_expr_type (&end, ref->u.ss.end, gfc_charlen_type_node);
396 gfc_add_block_to_block (&se->pre, &end.pre);
398 if (!CONSTANT_CLASS_P (end.expr) && !DECL_P (end.expr))
399 end.expr = gfc_evaluate_now (end.expr, &se->pre);
401 if (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS)
403 tree nonempty = fold_build2 (LE_EXPR, boolean_type_node,
404 start.expr, end.expr);
406 /* Check lower bound. */
407 fault = fold_build2 (LT_EXPR, boolean_type_node, start.expr,
408 build_int_cst (gfc_charlen_type_node, 1));
409 fault = fold_build2 (TRUTH_ANDIF_EXPR, boolean_type_node,
412 asprintf (&msg, "Substring out of bounds: lower bound (%%ld) of '%s' "
413 "is less than one", name);
415 asprintf (&msg, "Substring out of bounds: lower bound (%%ld)"
417 gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg,
418 fold_convert (long_integer_type_node,
422 /* Check upper bound. */
423 fault = fold_build2 (GT_EXPR, boolean_type_node, end.expr,
425 fault = fold_build2 (TRUTH_ANDIF_EXPR, boolean_type_node,
428 asprintf (&msg, "Substring out of bounds: upper bound (%%ld) of '%s' "
429 "exceeds string length (%%ld)", name);
431 asprintf (&msg, "Substring out of bounds: upper bound (%%ld) "
432 "exceeds string length (%%ld)");
433 gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg,
434 fold_convert (long_integer_type_node, end.expr),
435 fold_convert (long_integer_type_node,
440 tmp = fold_build2 (MINUS_EXPR, gfc_charlen_type_node,
441 build_int_cst (gfc_charlen_type_node, 1),
443 tmp = fold_build2 (PLUS_EXPR, gfc_charlen_type_node, end.expr, tmp);
444 tmp = fold_build2 (MAX_EXPR, gfc_charlen_type_node, tmp,
445 build_int_cst (gfc_charlen_type_node, 0));
446 se->string_length = tmp;
450 /* Convert a derived type component reference. */
453 gfc_conv_component_ref (gfc_se * se, gfc_ref * ref)
460 c = ref->u.c.component;
462 gcc_assert (c->backend_decl);
464 field = c->backend_decl;
465 gcc_assert (TREE_CODE (field) == FIELD_DECL);
467 tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field), decl, field, NULL_TREE);
471 if (c->ts.type == BT_CHARACTER)
473 tmp = c->ts.cl->backend_decl;
474 /* Components must always be constant length. */
475 gcc_assert (tmp && INTEGER_CST_P (tmp));
476 se->string_length = tmp;
479 if ((c->attr.pointer && c->attr.dimension == 0 && c->ts.type != BT_CHARACTER)
480 || c->attr.proc_pointer)
481 se->expr = build_fold_indirect_ref (se->expr);
485 /* This function deals with component references to components of the
486 parent type for derived type extensons. */
488 conv_parent_component_references (gfc_se * se, gfc_ref * ref)
496 c = ref->u.c.component;
498 /* Build a gfc_ref to recursively call gfc_conv_component_ref. */
499 parent.type = REF_COMPONENT;
502 parent.u.c.component = dt->components;
504 if (dt->attr.extension && dt->components)
506 /* Return if the component is not in the parent type. */
507 for (cmp = dt->components->next; cmp; cmp = cmp->next)
508 if (strcmp (c->name, cmp->name) == 0)
511 /* Otherwise build the reference and call self. */
512 gfc_conv_component_ref (se, &parent);
513 parent.u.c.sym = dt->components->ts.derived;
514 parent.u.c.component = c;
515 conv_parent_component_references (se, &parent);
519 /* Return the contents of a variable. Also handles reference/pointer
520 variables (all Fortran pointer references are implicit). */
523 gfc_conv_variable (gfc_se * se, gfc_expr * expr)
530 bool alternate_entry;
533 sym = expr->symtree->n.sym;
536 /* Check that something hasn't gone horribly wrong. */
537 gcc_assert (se->ss != gfc_ss_terminator);
538 gcc_assert (se->ss->expr == expr);
540 /* A scalarized term. We already know the descriptor. */
541 se->expr = se->ss->data.info.descriptor;
542 se->string_length = se->ss->string_length;
543 for (ref = se->ss->data.info.ref; ref; ref = ref->next)
544 if (ref->type == REF_ARRAY && ref->u.ar.type != AR_ELEMENT)
549 tree se_expr = NULL_TREE;
551 se->expr = gfc_get_symbol_decl (sym);
553 /* Deal with references to a parent results or entries by storing
554 the current_function_decl and moving to the parent_decl. */
555 return_value = sym->attr.function && sym->result == sym;
556 alternate_entry = sym->attr.function && sym->attr.entry
557 && sym->result == sym;
558 entry_master = sym->attr.result
559 && sym->ns->proc_name->attr.entry_master
560 && !gfc_return_by_reference (sym->ns->proc_name);
561 parent_decl = DECL_CONTEXT (current_function_decl);
563 if ((se->expr == parent_decl && return_value)
564 || (sym->ns && sym->ns->proc_name
566 && sym->ns->proc_name->backend_decl == parent_decl
567 && (alternate_entry || entry_master)))
572 /* Special case for assigning the return value of a function.
573 Self recursive functions must have an explicit return value. */
574 if (return_value && (se->expr == current_function_decl || parent_flag))
575 se_expr = gfc_get_fake_result_decl (sym, parent_flag);
577 /* Similarly for alternate entry points. */
578 else if (alternate_entry
579 && (sym->ns->proc_name->backend_decl == current_function_decl
582 gfc_entry_list *el = NULL;
584 for (el = sym->ns->entries; el; el = el->next)
587 se_expr = gfc_get_fake_result_decl (sym, parent_flag);
592 else if (entry_master
593 && (sym->ns->proc_name->backend_decl == current_function_decl
595 se_expr = gfc_get_fake_result_decl (sym, parent_flag);
600 /* Procedure actual arguments. */
601 else if (sym->attr.flavor == FL_PROCEDURE
602 && se->expr != current_function_decl)
604 if (!sym->attr.dummy && !sym->attr.proc_pointer)
606 gcc_assert (TREE_CODE (se->expr) == FUNCTION_DECL);
607 se->expr = gfc_build_addr_expr (NULL_TREE, se->expr);
613 /* Dereference the expression, where needed. Since characters
614 are entirely different from other types, they are treated
616 if (sym->ts.type == BT_CHARACTER)
618 /* Dereference character pointer dummy arguments
620 if ((sym->attr.pointer || sym->attr.allocatable)
622 || sym->attr.function
623 || sym->attr.result))
624 se->expr = build_fold_indirect_ref (se->expr);
627 else if (!sym->attr.value)
629 /* Dereference non-character scalar dummy arguments. */
630 if (sym->attr.dummy && !sym->attr.dimension)
631 se->expr = build_fold_indirect_ref (se->expr);
633 /* Dereference scalar hidden result. */
634 if (gfc_option.flag_f2c && sym->ts.type == BT_COMPLEX
635 && (sym->attr.function || sym->attr.result)
636 && !sym->attr.dimension && !sym->attr.pointer
637 && !sym->attr.always_explicit)
638 se->expr = build_fold_indirect_ref (se->expr);
640 /* Dereference non-character pointer variables.
641 These must be dummies, results, or scalars. */
642 if ((sym->attr.pointer || sym->attr.allocatable)
644 || sym->attr.function
646 || !sym->attr.dimension))
647 se->expr = build_fold_indirect_ref (se->expr);
653 /* For character variables, also get the length. */
654 if (sym->ts.type == BT_CHARACTER)
656 /* If the character length of an entry isn't set, get the length from
657 the master function instead. */
658 if (sym->attr.entry && !sym->ts.cl->backend_decl)
659 se->string_length = sym->ns->proc_name->ts.cl->backend_decl;
661 se->string_length = sym->ts.cl->backend_decl;
662 gcc_assert (se->string_length);
670 /* Return the descriptor if that's what we want and this is an array
671 section reference. */
672 if (se->descriptor_only && ref->u.ar.type != AR_ELEMENT)
674 /* TODO: Pointers to single elements of array sections, eg elemental subs. */
675 /* Return the descriptor for array pointers and allocations. */
677 && ref->next == NULL && (se->descriptor_only))
680 gfc_conv_array_ref (se, &ref->u.ar, sym, &expr->where);
681 /* Return a pointer to an element. */
685 if (ref->u.c.sym->attr.extension)
686 conv_parent_component_references (se, ref);
688 gfc_conv_component_ref (se, ref);
692 gfc_conv_substring (se, ref, expr->ts.kind,
693 expr->symtree->name, &expr->where);
702 /* Pointer assignment, allocation or pass by reference. Arrays are handled
704 if (se->want_pointer)
706 if (expr->ts.type == BT_CHARACTER)
707 gfc_conv_string_parameter (se);
709 se->expr = gfc_build_addr_expr (NULL_TREE, se->expr);
714 /* Unary ops are easy... Or they would be if ! was a valid op. */
717 gfc_conv_unary_op (enum tree_code code, gfc_se * se, gfc_expr * expr)
722 gcc_assert (expr->ts.type != BT_CHARACTER);
723 /* Initialize the operand. */
724 gfc_init_se (&operand, se);
725 gfc_conv_expr_val (&operand, expr->value.op.op1);
726 gfc_add_block_to_block (&se->pre, &operand.pre);
728 type = gfc_typenode_for_spec (&expr->ts);
730 /* TRUTH_NOT_EXPR is not a "true" unary operator in GCC.
731 We must convert it to a compare to 0 (e.g. EQ_EXPR (op1, 0)).
732 All other unary operators have an equivalent GIMPLE unary operator. */
733 if (code == TRUTH_NOT_EXPR)
734 se->expr = fold_build2 (EQ_EXPR, type, operand.expr,
735 build_int_cst (type, 0));
737 se->expr = fold_build1 (code, type, operand.expr);
741 /* Expand power operator to optimal multiplications when a value is raised
742 to a constant integer n. See section 4.6.3, "Evaluation of Powers" of
743 Donald E. Knuth, "Seminumerical Algorithms", Vol. 2, "The Art of Computer
744 Programming", 3rd Edition, 1998. */
746 /* This code is mostly duplicated from expand_powi in the backend.
747 We establish the "optimal power tree" lookup table with the defined size.
748 The items in the table are the exponents used to calculate the index
749 exponents. Any integer n less than the value can get an "addition chain",
750 with the first node being one. */
751 #define POWI_TABLE_SIZE 256
753 /* The table is from builtins.c. */
754 static const unsigned char powi_table[POWI_TABLE_SIZE] =
756 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
757 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
758 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
759 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
760 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
761 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
762 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
763 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
764 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
765 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
766 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
767 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
768 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
769 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
770 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
771 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
772 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
773 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
774 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
775 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
776 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
777 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
778 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
779 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
780 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
781 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
782 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
783 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
784 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
785 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
786 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
787 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
790 /* If n is larger than lookup table's max index, we use the "window
792 #define POWI_WINDOW_SIZE 3
794 /* Recursive function to expand the power operator. The temporary
795 values are put in tmpvar. The function returns tmpvar[1] ** n. */
797 gfc_conv_powi (gfc_se * se, unsigned HOST_WIDE_INT n, tree * tmpvar)
804 if (n < POWI_TABLE_SIZE)
809 op0 = gfc_conv_powi (se, n - powi_table[n], tmpvar);
810 op1 = gfc_conv_powi (se, powi_table[n], tmpvar);
814 digit = n & ((1 << POWI_WINDOW_SIZE) - 1);
815 op0 = gfc_conv_powi (se, n - digit, tmpvar);
816 op1 = gfc_conv_powi (se, digit, tmpvar);
820 op0 = gfc_conv_powi (se, n >> 1, tmpvar);
824 tmp = fold_build2 (MULT_EXPR, TREE_TYPE (op0), op0, op1);
825 tmp = gfc_evaluate_now (tmp, &se->pre);
827 if (n < POWI_TABLE_SIZE)
834 /* Expand lhs ** rhs. rhs is a constant integer. If it expands successfully,
835 return 1. Else return 0 and a call to runtime library functions
836 will have to be built. */
838 gfc_conv_cst_int_power (gfc_se * se, tree lhs, tree rhs)
843 tree vartmp[POWI_TABLE_SIZE];
845 unsigned HOST_WIDE_INT n;
848 /* If exponent is too large, we won't expand it anyway, so don't bother
849 with large integer values. */
850 if (!double_int_fits_in_shwi_p (TREE_INT_CST (rhs)))
853 m = double_int_to_shwi (TREE_INT_CST (rhs));
854 /* There's no ABS for HOST_WIDE_INT, so here we go. It also takes care
855 of the asymmetric range of the integer type. */
856 n = (unsigned HOST_WIDE_INT) (m < 0 ? -m : m);
858 type = TREE_TYPE (lhs);
859 sgn = tree_int_cst_sgn (rhs);
861 if (((FLOAT_TYPE_P (type) && !flag_unsafe_math_optimizations)
862 || optimize_size) && (m > 2 || m < -1))
868 se->expr = gfc_build_const (type, integer_one_node);
872 /* If rhs < 0 and lhs is an integer, the result is -1, 0 or 1. */
873 if ((sgn == -1) && (TREE_CODE (type) == INTEGER_TYPE))
875 tmp = fold_build2 (EQ_EXPR, boolean_type_node,
876 lhs, build_int_cst (TREE_TYPE (lhs), -1));
877 cond = fold_build2 (EQ_EXPR, boolean_type_node,
878 lhs, build_int_cst (TREE_TYPE (lhs), 1));
881 result = (lhs == 1 || lhs == -1) ? 1 : 0. */
884 tmp = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, tmp, cond);
885 se->expr = fold_build3 (COND_EXPR, type,
886 tmp, build_int_cst (type, 1),
887 build_int_cst (type, 0));
891 result = (lhs == 1) ? 1 : (lhs == -1) ? -1 : 0. */
892 tmp = fold_build3 (COND_EXPR, type, tmp, build_int_cst (type, -1),
893 build_int_cst (type, 0));
894 se->expr = fold_build3 (COND_EXPR, type,
895 cond, build_int_cst (type, 1), tmp);
899 memset (vartmp, 0, sizeof (vartmp));
903 tmp = gfc_build_const (type, integer_one_node);
904 vartmp[1] = fold_build2 (RDIV_EXPR, type, tmp, vartmp[1]);
907 se->expr = gfc_conv_powi (se, n, vartmp);
913 /* Power op (**). Constant integer exponent has special handling. */
916 gfc_conv_power_op (gfc_se * se, gfc_expr * expr)
918 tree gfc_int4_type_node;
925 gfc_init_se (&lse, se);
926 gfc_conv_expr_val (&lse, expr->value.op.op1);
927 lse.expr = gfc_evaluate_now (lse.expr, &lse.pre);
928 gfc_add_block_to_block (&se->pre, &lse.pre);
930 gfc_init_se (&rse, se);
931 gfc_conv_expr_val (&rse, expr->value.op.op2);
932 gfc_add_block_to_block (&se->pre, &rse.pre);
934 if (expr->value.op.op2->ts.type == BT_INTEGER
935 && expr->value.op.op2->expr_type == EXPR_CONSTANT)
936 if (gfc_conv_cst_int_power (se, lse.expr, rse.expr))
939 gfc_int4_type_node = gfc_get_int_type (4);
941 kind = expr->value.op.op1->ts.kind;
942 switch (expr->value.op.op2->ts.type)
945 ikind = expr->value.op.op2->ts.kind;
950 rse.expr = convert (gfc_int4_type_node, rse.expr);
972 if (expr->value.op.op1->ts.type == BT_INTEGER)
973 lse.expr = convert (gfc_int4_type_node, lse.expr);
998 switch (expr->value.op.op1->ts.type)
1001 if (kind == 3) /* Case 16 was not handled properly above. */
1003 fndecl = gfor_fndecl_math_powi[kind][ikind].integer;
1007 /* Use builtins for real ** int4. */
1013 fndecl = built_in_decls[BUILT_IN_POWIF];
1017 fndecl = built_in_decls[BUILT_IN_POWI];
1022 fndecl = built_in_decls[BUILT_IN_POWIL];
1030 fndecl = gfor_fndecl_math_powi[kind][ikind].real;
1034 fndecl = gfor_fndecl_math_powi[kind][ikind].cmplx;
1046 fndecl = built_in_decls[BUILT_IN_POWF];
1049 fndecl = built_in_decls[BUILT_IN_POW];
1053 fndecl = built_in_decls[BUILT_IN_POWL];
1064 fndecl = built_in_decls[BUILT_IN_CPOWF];
1067 fndecl = built_in_decls[BUILT_IN_CPOW];
1071 fndecl = built_in_decls[BUILT_IN_CPOWL];
1083 se->expr = build_call_expr (fndecl, 2, lse.expr, rse.expr);
1087 /* Generate code to allocate a string temporary. */
1090 gfc_conv_string_tmp (gfc_se * se, tree type, tree len)
1095 gcc_assert (TREE_TYPE (len) == gfc_charlen_type_node);
1097 if (gfc_can_put_var_on_stack (len))
1099 /* Create a temporary variable to hold the result. */
1100 tmp = fold_build2 (MINUS_EXPR, gfc_charlen_type_node, len,
1101 build_int_cst (gfc_charlen_type_node, 1));
1102 tmp = build_range_type (gfc_array_index_type, gfc_index_zero_node, tmp);
1104 if (TREE_CODE (TREE_TYPE (type)) == ARRAY_TYPE)
1105 tmp = build_array_type (TREE_TYPE (TREE_TYPE (type)), tmp);
1107 tmp = build_array_type (TREE_TYPE (type), tmp);
1109 var = gfc_create_var (tmp, "str");
1110 var = gfc_build_addr_expr (type, var);
1114 /* Allocate a temporary to hold the result. */
1115 var = gfc_create_var (type, "pstr");
1116 tmp = gfc_call_malloc (&se->pre, type,
1117 fold_build2 (MULT_EXPR, TREE_TYPE (len), len,
1118 fold_convert (TREE_TYPE (len),
1119 TYPE_SIZE (type))));
1120 gfc_add_modify (&se->pre, var, tmp);
1122 /* Free the temporary afterwards. */
1123 tmp = gfc_call_free (convert (pvoid_type_node, var));
1124 gfc_add_expr_to_block (&se->post, tmp);
1131 /* Handle a string concatenation operation. A temporary will be allocated to
1135 gfc_conv_concat_op (gfc_se * se, gfc_expr * expr)
1138 tree len, type, var, tmp, fndecl;
1140 gcc_assert (expr->value.op.op1->ts.type == BT_CHARACTER
1141 && expr->value.op.op2->ts.type == BT_CHARACTER);
1142 gcc_assert (expr->value.op.op1->ts.kind == expr->value.op.op2->ts.kind);
1144 gfc_init_se (&lse, se);
1145 gfc_conv_expr (&lse, expr->value.op.op1);
1146 gfc_conv_string_parameter (&lse);
1147 gfc_init_se (&rse, se);
1148 gfc_conv_expr (&rse, expr->value.op.op2);
1149 gfc_conv_string_parameter (&rse);
1151 gfc_add_block_to_block (&se->pre, &lse.pre);
1152 gfc_add_block_to_block (&se->pre, &rse.pre);
1154 type = gfc_get_character_type (expr->ts.kind, expr->ts.cl);
1155 len = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
1156 if (len == NULL_TREE)
1158 len = fold_build2 (PLUS_EXPR, TREE_TYPE (lse.string_length),
1159 lse.string_length, rse.string_length);
1162 type = build_pointer_type (type);
1164 var = gfc_conv_string_tmp (se, type, len);
1166 /* Do the actual concatenation. */
1167 if (expr->ts.kind == 1)
1168 fndecl = gfor_fndecl_concat_string;
1169 else if (expr->ts.kind == 4)
1170 fndecl = gfor_fndecl_concat_string_char4;
1174 tmp = build_call_expr (fndecl, 6, len, var, lse.string_length, lse.expr,
1175 rse.string_length, rse.expr);
1176 gfc_add_expr_to_block (&se->pre, tmp);
1178 /* Add the cleanup for the operands. */
1179 gfc_add_block_to_block (&se->pre, &rse.post);
1180 gfc_add_block_to_block (&se->pre, &lse.post);
1183 se->string_length = len;
1186 /* Translates an op expression. Common (binary) cases are handled by this
1187 function, others are passed on. Recursion is used in either case.
1188 We use the fact that (op1.ts == op2.ts) (except for the power
1190 Operators need no special handling for scalarized expressions as long as
1191 they call gfc_conv_simple_val to get their operands.
1192 Character strings get special handling. */
1195 gfc_conv_expr_op (gfc_se * se, gfc_expr * expr)
1197 enum tree_code code;
1206 switch (expr->value.op.op)
1208 case INTRINSIC_PARENTHESES:
1209 if (expr->ts.type == BT_REAL
1210 || expr->ts.type == BT_COMPLEX)
1212 gfc_conv_unary_op (PAREN_EXPR, se, expr);
1213 gcc_assert (FLOAT_TYPE_P (TREE_TYPE (se->expr)));
1218 case INTRINSIC_UPLUS:
1219 gfc_conv_expr (se, expr->value.op.op1);
1222 case INTRINSIC_UMINUS:
1223 gfc_conv_unary_op (NEGATE_EXPR, se, expr);
1227 gfc_conv_unary_op (TRUTH_NOT_EXPR, se, expr);
1230 case INTRINSIC_PLUS:
1234 case INTRINSIC_MINUS:
1238 case INTRINSIC_TIMES:
1242 case INTRINSIC_DIVIDE:
1243 /* If expr is a real or complex expr, use an RDIV_EXPR. If op1 is
1244 an integer, we must round towards zero, so we use a
1246 if (expr->ts.type == BT_INTEGER)
1247 code = TRUNC_DIV_EXPR;
1252 case INTRINSIC_POWER:
1253 gfc_conv_power_op (se, expr);
1256 case INTRINSIC_CONCAT:
1257 gfc_conv_concat_op (se, expr);
1261 code = TRUTH_ANDIF_EXPR;
1266 code = TRUTH_ORIF_EXPR;
1270 /* EQV and NEQV only work on logicals, but since we represent them
1271 as integers, we can use EQ_EXPR and NE_EXPR for them in GIMPLE. */
1273 case INTRINSIC_EQ_OS:
1281 case INTRINSIC_NE_OS:
1282 case INTRINSIC_NEQV:
1289 case INTRINSIC_GT_OS:
1296 case INTRINSIC_GE_OS:
1303 case INTRINSIC_LT_OS:
1310 case INTRINSIC_LE_OS:
1316 case INTRINSIC_USER:
1317 case INTRINSIC_ASSIGN:
1318 /* These should be converted into function calls by the frontend. */
1322 fatal_error ("Unknown intrinsic op");
1326 /* The only exception to this is **, which is handled separately anyway. */
1327 gcc_assert (expr->value.op.op1->ts.type == expr->value.op.op2->ts.type);
1329 if (checkstring && expr->value.op.op1->ts.type != BT_CHARACTER)
1333 gfc_init_se (&lse, se);
1334 gfc_conv_expr (&lse, expr->value.op.op1);
1335 gfc_add_block_to_block (&se->pre, &lse.pre);
1338 gfc_init_se (&rse, se);
1339 gfc_conv_expr (&rse, expr->value.op.op2);
1340 gfc_add_block_to_block (&se->pre, &rse.pre);
1344 gfc_conv_string_parameter (&lse);
1345 gfc_conv_string_parameter (&rse);
1347 lse.expr = gfc_build_compare_string (lse.string_length, lse.expr,
1348 rse.string_length, rse.expr,
1349 expr->value.op.op1->ts.kind);
1350 rse.expr = build_int_cst (TREE_TYPE (lse.expr), 0);
1351 gfc_add_block_to_block (&lse.post, &rse.post);
1354 type = gfc_typenode_for_spec (&expr->ts);
1358 /* The result of logical ops is always boolean_type_node. */
1359 tmp = fold_build2 (code, boolean_type_node, lse.expr, rse.expr);
1360 se->expr = convert (type, tmp);
1363 se->expr = fold_build2 (code, type, lse.expr, rse.expr);
1365 /* Add the post blocks. */
1366 gfc_add_block_to_block (&se->post, &rse.post);
1367 gfc_add_block_to_block (&se->post, &lse.post);
1370 /* If a string's length is one, we convert it to a single character. */
1373 string_to_single_character (tree len, tree str, int kind)
1375 gcc_assert (POINTER_TYPE_P (TREE_TYPE (str)));
1377 if (INTEGER_CST_P (len) && TREE_INT_CST_LOW (len) == 1
1378 && TREE_INT_CST_HIGH (len) == 0)
1380 str = fold_convert (gfc_get_pchar_type (kind), str);
1381 return build_fold_indirect_ref (str);
1389 gfc_conv_scalar_char_value (gfc_symbol *sym, gfc_se *se, gfc_expr **expr)
1392 if (sym->backend_decl)
1394 /* This becomes the nominal_type in
1395 function.c:assign_parm_find_data_types. */
1396 TREE_TYPE (sym->backend_decl) = unsigned_char_type_node;
1397 /* This becomes the passed_type in
1398 function.c:assign_parm_find_data_types. C promotes char to
1399 integer for argument passing. */
1400 DECL_ARG_TYPE (sym->backend_decl) = unsigned_type_node;
1402 DECL_BY_REFERENCE (sym->backend_decl) = 0;
1407 /* If we have a constant character expression, make it into an
1409 if ((*expr)->expr_type == EXPR_CONSTANT)
1414 *expr = gfc_int_expr ((int)(*expr)->value.character.string[0]);
1415 if ((*expr)->ts.kind != gfc_c_int_kind)
1417 /* The expr needs to be compatible with a C int. If the
1418 conversion fails, then the 2 causes an ICE. */
1419 ts.type = BT_INTEGER;
1420 ts.kind = gfc_c_int_kind;
1421 gfc_convert_type (*expr, &ts, 2);
1424 else if (se != NULL && (*expr)->expr_type == EXPR_VARIABLE)
1426 if ((*expr)->ref == NULL)
1428 se->expr = string_to_single_character
1429 (build_int_cst (integer_type_node, 1),
1430 gfc_build_addr_expr (gfc_get_pchar_type ((*expr)->ts.kind),
1432 ((*expr)->symtree->n.sym)),
1437 gfc_conv_variable (se, *expr);
1438 se->expr = string_to_single_character
1439 (build_int_cst (integer_type_node, 1),
1440 gfc_build_addr_expr (gfc_get_pchar_type ((*expr)->ts.kind),
1449 /* Compare two strings. If they are all single characters, the result is the
1450 subtraction of them. Otherwise, we build a library call. */
1453 gfc_build_compare_string (tree len1, tree str1, tree len2, tree str2, int kind)
1459 gcc_assert (POINTER_TYPE_P (TREE_TYPE (str1)));
1460 gcc_assert (POINTER_TYPE_P (TREE_TYPE (str2)));
1462 sc1 = string_to_single_character (len1, str1, kind);
1463 sc2 = string_to_single_character (len2, str2, kind);
1465 if (sc1 != NULL_TREE && sc2 != NULL_TREE)
1467 /* Deal with single character specially. */
1468 sc1 = fold_convert (integer_type_node, sc1);
1469 sc2 = fold_convert (integer_type_node, sc2);
1470 tmp = fold_build2 (MINUS_EXPR, integer_type_node, sc1, sc2);
1474 /* Build a call for the comparison. */
1478 fndecl = gfor_fndecl_compare_string;
1480 fndecl = gfor_fndecl_compare_string_char4;
1484 tmp = build_call_expr (fndecl, 4, len1, str1, len2, str2);
1491 conv_function_val (gfc_se * se, gfc_symbol * sym, gfc_expr * expr)
1495 if (gfc_is_proc_ptr_comp (expr, NULL))
1496 tmp = gfc_get_proc_ptr_comp (se, expr);
1497 else if (sym->attr.dummy)
1499 tmp = gfc_get_symbol_decl (sym);
1500 if (sym->attr.proc_pointer)
1501 tmp = build_fold_indirect_ref (tmp);
1502 gcc_assert (TREE_CODE (TREE_TYPE (tmp)) == POINTER_TYPE
1503 && TREE_CODE (TREE_TYPE (TREE_TYPE (tmp))) == FUNCTION_TYPE);
1507 if (!sym->backend_decl)
1508 sym->backend_decl = gfc_get_extern_function_decl (sym);
1510 tmp = sym->backend_decl;
1512 if (sym->attr.cray_pointee)
1514 /* TODO - make the cray pointee a pointer to a procedure,
1515 assign the pointer to it and use it for the call. This
1517 tmp = convert (build_pointer_type (TREE_TYPE (tmp)),
1518 gfc_get_symbol_decl (sym->cp_pointer));
1519 tmp = gfc_evaluate_now (tmp, &se->pre);
1522 if (!POINTER_TYPE_P (TREE_TYPE (tmp)))
1524 gcc_assert (TREE_CODE (tmp) == FUNCTION_DECL);
1525 tmp = gfc_build_addr_expr (NULL_TREE, tmp);
1532 /* Initialize MAPPING. */
1535 gfc_init_interface_mapping (gfc_interface_mapping * mapping)
1537 mapping->syms = NULL;
1538 mapping->charlens = NULL;
1542 /* Free all memory held by MAPPING (but not MAPPING itself). */
1545 gfc_free_interface_mapping (gfc_interface_mapping * mapping)
1547 gfc_interface_sym_mapping *sym;
1548 gfc_interface_sym_mapping *nextsym;
1550 gfc_charlen *nextcl;
1552 for (sym = mapping->syms; sym; sym = nextsym)
1554 nextsym = sym->next;
1555 sym->new_sym->n.sym->formal = NULL;
1556 gfc_free_symbol (sym->new_sym->n.sym);
1557 gfc_free_expr (sym->expr);
1558 gfc_free (sym->new_sym);
1561 for (cl = mapping->charlens; cl; cl = nextcl)
1564 gfc_free_expr (cl->length);
1570 /* Return a copy of gfc_charlen CL. Add the returned structure to
1571 MAPPING so that it will be freed by gfc_free_interface_mapping. */
1573 static gfc_charlen *
1574 gfc_get_interface_mapping_charlen (gfc_interface_mapping * mapping,
1577 gfc_charlen *new_charlen;
1579 new_charlen = gfc_get_charlen ();
1580 new_charlen->next = mapping->charlens;
1581 new_charlen->length = gfc_copy_expr (cl->length);
1583 mapping->charlens = new_charlen;
1588 /* A subroutine of gfc_add_interface_mapping. Return a descriptorless
1589 array variable that can be used as the actual argument for dummy
1590 argument SYM. Add any initialization code to BLOCK. PACKED is as
1591 for gfc_get_nodesc_array_type and DATA points to the first element
1592 in the passed array. */
1595 gfc_get_interface_mapping_array (stmtblock_t * block, gfc_symbol * sym,
1596 gfc_packed packed, tree data)
1601 type = gfc_typenode_for_spec (&sym->ts);
1602 type = gfc_get_nodesc_array_type (type, sym->as, packed);
1604 var = gfc_create_var (type, "ifm");
1605 gfc_add_modify (block, var, fold_convert (type, data));
1611 /* A subroutine of gfc_add_interface_mapping. Set the stride, upper bounds
1612 and offset of descriptorless array type TYPE given that it has the same
1613 size as DESC. Add any set-up code to BLOCK. */
1616 gfc_set_interface_mapping_bounds (stmtblock_t * block, tree type, tree desc)
1623 offset = gfc_index_zero_node;
1624 for (n = 0; n < GFC_TYPE_ARRAY_RANK (type); n++)
1626 dim = gfc_rank_cst[n];
1627 GFC_TYPE_ARRAY_STRIDE (type, n) = gfc_conv_array_stride (desc, n);
1628 if (GFC_TYPE_ARRAY_LBOUND (type, n) == NULL_TREE)
1630 GFC_TYPE_ARRAY_LBOUND (type, n)
1631 = gfc_conv_descriptor_lbound_get (desc, dim);
1632 GFC_TYPE_ARRAY_UBOUND (type, n)
1633 = gfc_conv_descriptor_ubound_get (desc, dim);
1635 else if (GFC_TYPE_ARRAY_UBOUND (type, n) == NULL_TREE)
1637 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
1638 gfc_conv_descriptor_ubound_get (desc, dim),
1639 gfc_conv_descriptor_lbound_get (desc, dim));
1640 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
1641 GFC_TYPE_ARRAY_LBOUND (type, n),
1643 tmp = gfc_evaluate_now (tmp, block);
1644 GFC_TYPE_ARRAY_UBOUND (type, n) = tmp;
1646 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type,
1647 GFC_TYPE_ARRAY_LBOUND (type, n),
1648 GFC_TYPE_ARRAY_STRIDE (type, n));
1649 offset = fold_build2 (MINUS_EXPR, gfc_array_index_type, offset, tmp);
1651 offset = gfc_evaluate_now (offset, block);
1652 GFC_TYPE_ARRAY_OFFSET (type) = offset;
1656 /* Extend MAPPING so that it maps dummy argument SYM to the value stored
1657 in SE. The caller may still use se->expr and se->string_length after
1658 calling this function. */
1661 gfc_add_interface_mapping (gfc_interface_mapping * mapping,
1662 gfc_symbol * sym, gfc_se * se,
1665 gfc_interface_sym_mapping *sm;
1669 gfc_symbol *new_sym;
1671 gfc_symtree *new_symtree;
1673 /* Create a new symbol to represent the actual argument. */
1674 new_sym = gfc_new_symbol (sym->name, NULL);
1675 new_sym->ts = sym->ts;
1676 new_sym->as = gfc_copy_array_spec (sym->as);
1677 new_sym->attr.referenced = 1;
1678 new_sym->attr.dimension = sym->attr.dimension;
1679 new_sym->attr.pointer = sym->attr.pointer;
1680 new_sym->attr.allocatable = sym->attr.allocatable;
1681 new_sym->attr.flavor = sym->attr.flavor;
1682 new_sym->attr.function = sym->attr.function;
1684 /* Ensure that the interface is available and that
1685 descriptors are passed for array actual arguments. */
1686 if (sym->attr.flavor == FL_PROCEDURE)
1688 new_sym->formal = expr->symtree->n.sym->formal;
1689 new_sym->attr.always_explicit
1690 = expr->symtree->n.sym->attr.always_explicit;
1693 /* Create a fake symtree for it. */
1695 new_symtree = gfc_new_symtree (&root, sym->name);
1696 new_symtree->n.sym = new_sym;
1697 gcc_assert (new_symtree == root);
1699 /* Create a dummy->actual mapping. */
1700 sm = XCNEW (gfc_interface_sym_mapping);
1701 sm->next = mapping->syms;
1703 sm->new_sym = new_symtree;
1704 sm->expr = gfc_copy_expr (expr);
1707 /* Stabilize the argument's value. */
1708 if (!sym->attr.function && se)
1709 se->expr = gfc_evaluate_now (se->expr, &se->pre);
1711 if (sym->ts.type == BT_CHARACTER)
1713 /* Create a copy of the dummy argument's length. */
1714 new_sym->ts.cl = gfc_get_interface_mapping_charlen (mapping, sym->ts.cl);
1715 sm->expr->ts.cl = new_sym->ts.cl;
1717 /* If the length is specified as "*", record the length that
1718 the caller is passing. We should use the callee's length
1719 in all other cases. */
1720 if (!new_sym->ts.cl->length && se)
1722 se->string_length = gfc_evaluate_now (se->string_length, &se->pre);
1723 new_sym->ts.cl->backend_decl = se->string_length;
1730 /* Use the passed value as-is if the argument is a function. */
1731 if (sym->attr.flavor == FL_PROCEDURE)
1734 /* If the argument is either a string or a pointer to a string,
1735 convert it to a boundless character type. */
1736 else if (!sym->attr.dimension && sym->ts.type == BT_CHARACTER)
1738 tmp = gfc_get_character_type_len (sym->ts.kind, NULL);
1739 tmp = build_pointer_type (tmp);
1740 if (sym->attr.pointer)
1741 value = build_fold_indirect_ref (se->expr);
1744 value = fold_convert (tmp, value);
1747 /* If the argument is a scalar, a pointer to an array or an allocatable,
1749 else if (!sym->attr.dimension || sym->attr.pointer || sym->attr.allocatable)
1750 value = build_fold_indirect_ref (se->expr);
1752 /* For character(*), use the actual argument's descriptor. */
1753 else if (sym->ts.type == BT_CHARACTER && !new_sym->ts.cl->length)
1754 value = build_fold_indirect_ref (se->expr);
1756 /* If the argument is an array descriptor, use it to determine
1757 information about the actual argument's shape. */
1758 else if (POINTER_TYPE_P (TREE_TYPE (se->expr))
1759 && GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (TREE_TYPE (se->expr))))
1761 /* Get the actual argument's descriptor. */
1762 desc = build_fold_indirect_ref (se->expr);
1764 /* Create the replacement variable. */
1765 tmp = gfc_conv_descriptor_data_get (desc);
1766 value = gfc_get_interface_mapping_array (&se->pre, sym,
1769 /* Use DESC to work out the upper bounds, strides and offset. */
1770 gfc_set_interface_mapping_bounds (&se->pre, TREE_TYPE (value), desc);
1773 /* Otherwise we have a packed array. */
1774 value = gfc_get_interface_mapping_array (&se->pre, sym,
1775 PACKED_FULL, se->expr);
1777 new_sym->backend_decl = value;
1781 /* Called once all dummy argument mappings have been added to MAPPING,
1782 but before the mapping is used to evaluate expressions. Pre-evaluate
1783 the length of each argument, adding any initialization code to PRE and
1784 any finalization code to POST. */
1787 gfc_finish_interface_mapping (gfc_interface_mapping * mapping,
1788 stmtblock_t * pre, stmtblock_t * post)
1790 gfc_interface_sym_mapping *sym;
1794 for (sym = mapping->syms; sym; sym = sym->next)
1795 if (sym->new_sym->n.sym->ts.type == BT_CHARACTER
1796 && !sym->new_sym->n.sym->ts.cl->backend_decl)
1798 expr = sym->new_sym->n.sym->ts.cl->length;
1799 gfc_apply_interface_mapping_to_expr (mapping, expr);
1800 gfc_init_se (&se, NULL);
1801 gfc_conv_expr (&se, expr);
1802 se.expr = fold_convert (gfc_charlen_type_node, se.expr);
1803 se.expr = gfc_evaluate_now (se.expr, &se.pre);
1804 gfc_add_block_to_block (pre, &se.pre);
1805 gfc_add_block_to_block (post, &se.post);
1807 sym->new_sym->n.sym->ts.cl->backend_decl = se.expr;
1812 /* Like gfc_apply_interface_mapping_to_expr, but applied to
1816 gfc_apply_interface_mapping_to_cons (gfc_interface_mapping * mapping,
1817 gfc_constructor * c)
1819 for (; c; c = c->next)
1821 gfc_apply_interface_mapping_to_expr (mapping, c->expr);
1824 gfc_apply_interface_mapping_to_expr (mapping, c->iterator->start);
1825 gfc_apply_interface_mapping_to_expr (mapping, c->iterator->end);
1826 gfc_apply_interface_mapping_to_expr (mapping, c->iterator->step);
1832 /* Like gfc_apply_interface_mapping_to_expr, but applied to
1836 gfc_apply_interface_mapping_to_ref (gfc_interface_mapping * mapping,
1841 for (; ref; ref = ref->next)
1845 for (n = 0; n < ref->u.ar.dimen; n++)
1847 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.start[n]);
1848 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.end[n]);
1849 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.stride[n]);
1851 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.offset);
1858 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ss.start);
1859 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ss.end);
1865 /* Convert intrinsic function calls into result expressions. */
1868 gfc_map_intrinsic_function (gfc_expr *expr, gfc_interface_mapping *mapping)
1876 arg1 = expr->value.function.actual->expr;
1877 if (expr->value.function.actual->next)
1878 arg2 = expr->value.function.actual->next->expr;
1882 sym = arg1->symtree->n.sym;
1884 if (sym->attr.dummy)
1889 switch (expr->value.function.isym->id)
1892 /* TODO figure out why this condition is necessary. */
1893 if (sym->attr.function
1894 && (arg1->ts.cl->length == NULL
1895 || (arg1->ts.cl->length->expr_type != EXPR_CONSTANT
1896 && arg1->ts.cl->length->expr_type != EXPR_VARIABLE)))
1899 new_expr = gfc_copy_expr (arg1->ts.cl->length);
1906 if (arg2 && arg2->expr_type == EXPR_CONSTANT)
1908 dup = mpz_get_si (arg2->value.integer);
1913 dup = sym->as->rank;
1917 for (; d < dup; d++)
1921 if (!sym->as->upper[d] || !sym->as->lower[d])
1923 gfc_free_expr (new_expr);
1927 tmp = gfc_add (gfc_copy_expr (sym->as->upper[d]), gfc_int_expr (1));
1928 tmp = gfc_subtract (tmp, gfc_copy_expr (sym->as->lower[d]));
1930 new_expr = gfc_multiply (new_expr, tmp);
1936 case GFC_ISYM_LBOUND:
1937 case GFC_ISYM_UBOUND:
1938 /* TODO These implementations of lbound and ubound do not limit if
1939 the size < 0, according to F95's 13.14.53 and 13.14.113. */
1944 if (arg2 && arg2->expr_type == EXPR_CONSTANT)
1945 d = mpz_get_si (arg2->value.integer) - 1;
1947 /* TODO: If the need arises, this could produce an array of
1951 if (expr->value.function.isym->id == GFC_ISYM_LBOUND)
1953 if (sym->as->lower[d])
1954 new_expr = gfc_copy_expr (sym->as->lower[d]);
1958 if (sym->as->upper[d])
1959 new_expr = gfc_copy_expr (sym->as->upper[d]);
1967 gfc_apply_interface_mapping_to_expr (mapping, new_expr);
1971 gfc_replace_expr (expr, new_expr);
1977 gfc_map_fcn_formal_to_actual (gfc_expr *expr, gfc_expr *map_expr,
1978 gfc_interface_mapping * mapping)
1980 gfc_formal_arglist *f;
1981 gfc_actual_arglist *actual;
1983 actual = expr->value.function.actual;
1984 f = map_expr->symtree->n.sym->formal;
1986 for (; f && actual; f = f->next, actual = actual->next)
1991 gfc_add_interface_mapping (mapping, f->sym, NULL, actual->expr);
1994 if (map_expr->symtree->n.sym->attr.dimension)
1999 as = gfc_copy_array_spec (map_expr->symtree->n.sym->as);
2001 for (d = 0; d < as->rank; d++)
2003 gfc_apply_interface_mapping_to_expr (mapping, as->lower[d]);
2004 gfc_apply_interface_mapping_to_expr (mapping, as->upper[d]);
2007 expr->value.function.esym->as = as;
2010 if (map_expr->symtree->n.sym->ts.type == BT_CHARACTER)
2012 expr->value.function.esym->ts.cl->length
2013 = gfc_copy_expr (map_expr->symtree->n.sym->ts.cl->length);
2015 gfc_apply_interface_mapping_to_expr (mapping,
2016 expr->value.function.esym->ts.cl->length);
2021 /* EXPR is a copy of an expression that appeared in the interface
2022 associated with MAPPING. Walk it recursively looking for references to
2023 dummy arguments that MAPPING maps to actual arguments. Replace each such
2024 reference with a reference to the associated actual argument. */
2027 gfc_apply_interface_mapping_to_expr (gfc_interface_mapping * mapping,
2030 gfc_interface_sym_mapping *sym;
2031 gfc_actual_arglist *actual;
2036 /* Copying an expression does not copy its length, so do that here. */
2037 if (expr->ts.type == BT_CHARACTER && expr->ts.cl)
2039 expr->ts.cl = gfc_get_interface_mapping_charlen (mapping, expr->ts.cl);
2040 gfc_apply_interface_mapping_to_expr (mapping, expr->ts.cl->length);
2043 /* Apply the mapping to any references. */
2044 gfc_apply_interface_mapping_to_ref (mapping, expr->ref);
2046 /* ...and to the expression's symbol, if it has one. */
2047 /* TODO Find out why the condition on expr->symtree had to be moved into
2048 the loop rather than being outside it, as originally. */
2049 for (sym = mapping->syms; sym; sym = sym->next)
2050 if (expr->symtree && sym->old == expr->symtree->n.sym)
2052 if (sym->new_sym->n.sym->backend_decl)
2053 expr->symtree = sym->new_sym;
2055 gfc_replace_expr (expr, gfc_copy_expr (sym->expr));
2058 /* ...and to subexpressions in expr->value. */
2059 switch (expr->expr_type)
2064 case EXPR_SUBSTRING:
2068 gfc_apply_interface_mapping_to_expr (mapping, expr->value.op.op1);
2069 gfc_apply_interface_mapping_to_expr (mapping, expr->value.op.op2);
2073 for (actual = expr->value.function.actual; actual; actual = actual->next)
2074 gfc_apply_interface_mapping_to_expr (mapping, actual->expr);
2076 if (expr->value.function.esym == NULL
2077 && expr->value.function.isym != NULL
2078 && expr->value.function.actual->expr->symtree
2079 && gfc_map_intrinsic_function (expr, mapping))
2082 for (sym = mapping->syms; sym; sym = sym->next)
2083 if (sym->old == expr->value.function.esym)
2085 expr->value.function.esym = sym->new_sym->n.sym;
2086 gfc_map_fcn_formal_to_actual (expr, sym->expr, mapping);
2087 expr->value.function.esym->result = sym->new_sym->n.sym;
2092 case EXPR_STRUCTURE:
2093 gfc_apply_interface_mapping_to_cons (mapping, expr->value.constructor);
2106 /* Evaluate interface expression EXPR using MAPPING. Store the result
2110 gfc_apply_interface_mapping (gfc_interface_mapping * mapping,
2111 gfc_se * se, gfc_expr * expr)
2113 expr = gfc_copy_expr (expr);
2114 gfc_apply_interface_mapping_to_expr (mapping, expr);
2115 gfc_conv_expr (se, expr);
2116 se->expr = gfc_evaluate_now (se->expr, &se->pre);
2117 gfc_free_expr (expr);
2121 /* Returns a reference to a temporary array into which a component of
2122 an actual argument derived type array is copied and then returned
2123 after the function call. */
2125 gfc_conv_subref_array_arg (gfc_se * parmse, gfc_expr * expr,
2126 int g77, sym_intent intent)
2142 gcc_assert (expr->expr_type == EXPR_VARIABLE);
2144 gfc_init_se (&lse, NULL);
2145 gfc_init_se (&rse, NULL);
2147 /* Walk the argument expression. */
2148 rss = gfc_walk_expr (expr);
2150 gcc_assert (rss != gfc_ss_terminator);
2152 /* Initialize the scalarizer. */
2153 gfc_init_loopinfo (&loop);
2154 gfc_add_ss_to_loop (&loop, rss);
2156 /* Calculate the bounds of the scalarization. */
2157 gfc_conv_ss_startstride (&loop);
2159 /* Build an ss for the temporary. */
2160 if (expr->ts.type == BT_CHARACTER && !expr->ts.cl->backend_decl)
2161 gfc_conv_string_length (expr->ts.cl, expr, &parmse->pre);
2163 base_type = gfc_typenode_for_spec (&expr->ts);
2164 if (GFC_ARRAY_TYPE_P (base_type)
2165 || GFC_DESCRIPTOR_TYPE_P (base_type))
2166 base_type = gfc_get_element_type (base_type);
2168 loop.temp_ss = gfc_get_ss ();;
2169 loop.temp_ss->type = GFC_SS_TEMP;
2170 loop.temp_ss->data.temp.type = base_type;
2172 if (expr->ts.type == BT_CHARACTER)
2173 loop.temp_ss->string_length = expr->ts.cl->backend_decl;
2175 loop.temp_ss->string_length = NULL;
2177 parmse->string_length = loop.temp_ss->string_length;
2178 loop.temp_ss->data.temp.dimen = loop.dimen;
2179 loop.temp_ss->next = gfc_ss_terminator;
2181 /* Associate the SS with the loop. */
2182 gfc_add_ss_to_loop (&loop, loop.temp_ss);
2184 /* Setup the scalarizing loops. */
2185 gfc_conv_loop_setup (&loop, &expr->where);
2187 /* Pass the temporary descriptor back to the caller. */
2188 info = &loop.temp_ss->data.info;
2189 parmse->expr = info->descriptor;
2191 /* Setup the gfc_se structures. */
2192 gfc_copy_loopinfo_to_se (&lse, &loop);
2193 gfc_copy_loopinfo_to_se (&rse, &loop);
2196 lse.ss = loop.temp_ss;
2197 gfc_mark_ss_chain_used (rss, 1);
2198 gfc_mark_ss_chain_used (loop.temp_ss, 1);
2200 /* Start the scalarized loop body. */
2201 gfc_start_scalarized_body (&loop, &body);
2203 /* Translate the expression. */
2204 gfc_conv_expr (&rse, expr);
2206 gfc_conv_tmp_array_ref (&lse);
2207 gfc_advance_se_ss_chain (&lse);
2209 if (intent != INTENT_OUT)
2211 tmp = gfc_trans_scalar_assign (&lse, &rse, expr->ts, true, false);
2212 gfc_add_expr_to_block (&body, tmp);
2213 gcc_assert (rse.ss == gfc_ss_terminator);
2214 gfc_trans_scalarizing_loops (&loop, &body);
2218 /* Make sure that the temporary declaration survives by merging
2219 all the loop declarations into the current context. */
2220 for (n = 0; n < loop.dimen; n++)
2222 gfc_merge_block_scope (&body);
2223 body = loop.code[loop.order[n]];
2225 gfc_merge_block_scope (&body);
2228 /* Add the post block after the second loop, so that any
2229 freeing of allocated memory is done at the right time. */
2230 gfc_add_block_to_block (&parmse->pre, &loop.pre);
2232 /**********Copy the temporary back again.*********/
2234 gfc_init_se (&lse, NULL);
2235 gfc_init_se (&rse, NULL);
2237 /* Walk the argument expression. */
2238 lss = gfc_walk_expr (expr);
2239 rse.ss = loop.temp_ss;
2242 /* Initialize the scalarizer. */
2243 gfc_init_loopinfo (&loop2);
2244 gfc_add_ss_to_loop (&loop2, lss);
2246 /* Calculate the bounds of the scalarization. */
2247 gfc_conv_ss_startstride (&loop2);
2249 /* Setup the scalarizing loops. */
2250 gfc_conv_loop_setup (&loop2, &expr->where);
2252 gfc_copy_loopinfo_to_se (&lse, &loop2);
2253 gfc_copy_loopinfo_to_se (&rse, &loop2);
2255 gfc_mark_ss_chain_used (lss, 1);
2256 gfc_mark_ss_chain_used (loop.temp_ss, 1);
2258 /* Declare the variable to hold the temporary offset and start the
2259 scalarized loop body. */
2260 offset = gfc_create_var (gfc_array_index_type, NULL);
2261 gfc_start_scalarized_body (&loop2, &body);
2263 /* Build the offsets for the temporary from the loop variables. The
2264 temporary array has lbounds of zero and strides of one in all
2265 dimensions, so this is very simple. The offset is only computed
2266 outside the innermost loop, so the overall transfer could be
2267 optimized further. */
2268 info = &rse.ss->data.info;
2270 tmp_index = gfc_index_zero_node;
2271 for (n = info->dimen - 1; n > 0; n--)
2274 tmp = rse.loop->loopvar[n];
2275 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
2276 tmp, rse.loop->from[n]);
2277 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
2280 tmp_str = fold_build2 (MINUS_EXPR, gfc_array_index_type,
2281 rse.loop->to[n-1], rse.loop->from[n-1]);
2282 tmp_str = fold_build2 (PLUS_EXPR, gfc_array_index_type,
2283 tmp_str, gfc_index_one_node);
2285 tmp_index = fold_build2 (MULT_EXPR, gfc_array_index_type,
2289 tmp_index = fold_build2 (MINUS_EXPR, gfc_array_index_type,
2290 tmp_index, rse.loop->from[0]);
2291 gfc_add_modify (&rse.loop->code[0], offset, tmp_index);
2293 tmp_index = fold_build2 (PLUS_EXPR, gfc_array_index_type,
2294 rse.loop->loopvar[0], offset);
2296 /* Now use the offset for the reference. */
2297 tmp = build_fold_indirect_ref (info->data);
2298 rse.expr = gfc_build_array_ref (tmp, tmp_index, NULL);
2300 if (expr->ts.type == BT_CHARACTER)
2301 rse.string_length = expr->ts.cl->backend_decl;
2303 gfc_conv_expr (&lse, expr);
2305 gcc_assert (lse.ss == gfc_ss_terminator);
2307 tmp = gfc_trans_scalar_assign (&lse, &rse, expr->ts, false, false);
2308 gfc_add_expr_to_block (&body, tmp);
2310 /* Generate the copying loops. */
2311 gfc_trans_scalarizing_loops (&loop2, &body);
2313 /* Wrap the whole thing up by adding the second loop to the post-block
2314 and following it by the post-block of the first loop. In this way,
2315 if the temporary needs freeing, it is done after use! */
2316 if (intent != INTENT_IN)
2318 gfc_add_block_to_block (&parmse->post, &loop2.pre);
2319 gfc_add_block_to_block (&parmse->post, &loop2.post);
2322 gfc_add_block_to_block (&parmse->post, &loop.post);
2324 gfc_cleanup_loop (&loop);
2325 gfc_cleanup_loop (&loop2);
2327 /* Pass the string length to the argument expression. */
2328 if (expr->ts.type == BT_CHARACTER)
2329 parmse->string_length = expr->ts.cl->backend_decl;
2331 /* We want either the address for the data or the address of the descriptor,
2332 depending on the mode of passing array arguments. */
2334 parmse->expr = gfc_conv_descriptor_data_get (parmse->expr);
2336 parmse->expr = gfc_build_addr_expr (NULL_TREE, parmse->expr);
2342 /* Generate the code for argument list functions. */
2345 conv_arglist_function (gfc_se *se, gfc_expr *expr, const char *name)
2347 /* Pass by value for g77 %VAL(arg), pass the address
2348 indirectly for %LOC, else by reference. Thus %REF
2349 is a "do-nothing" and %LOC is the same as an F95
2351 if (strncmp (name, "%VAL", 4) == 0)
2352 gfc_conv_expr (se, expr);
2353 else if (strncmp (name, "%LOC", 4) == 0)
2355 gfc_conv_expr_reference (se, expr);
2356 se->expr = gfc_build_addr_expr (NULL, se->expr);
2358 else if (strncmp (name, "%REF", 4) == 0)
2359 gfc_conv_expr_reference (se, expr);
2361 gfc_error ("Unknown argument list function at %L", &expr->where);
2365 /* Generate code for a procedure call. Note can return se->post != NULL.
2366 If se->direct_byref is set then se->expr contains the return parameter.
2367 Return nonzero, if the call has alternate specifiers.
2368 'expr' is only needed for procedure pointer components. */
2371 gfc_conv_procedure_call (gfc_se * se, gfc_symbol * sym,
2372 gfc_actual_arglist * arg, gfc_expr * expr,
2375 gfc_interface_mapping mapping;
2389 gfc_formal_arglist *formal;
2390 int has_alternate_specifier = 0;
2391 bool need_interface_mapping;
2398 enum {MISSING = 0, ELEMENTAL, SCALAR, SCALAR_POINTER, ARRAY};
2399 gfc_component *comp = NULL;
2401 arglist = NULL_TREE;
2402 retargs = NULL_TREE;
2403 stringargs = NULL_TREE;
2408 if (sym->from_intmod == INTMOD_ISO_C_BINDING)
2410 if (sym->intmod_sym_id == ISOCBINDING_LOC)
2412 if (arg->expr->rank == 0)
2413 gfc_conv_expr_reference (se, arg->expr);
2417 /* This is really the actual arg because no formal arglist is
2418 created for C_LOC. */
2419 fsym = arg->expr->symtree->n.sym;
2421 /* We should want it to do g77 calling convention. */
2423 && !(fsym->attr.pointer || fsym->attr.allocatable)
2424 && fsym->as->type != AS_ASSUMED_SHAPE;
2425 f = f || !sym->attr.always_explicit;
2427 argss = gfc_walk_expr (arg->expr);
2428 gfc_conv_array_parameter (se, arg->expr, argss, f,
2432 /* TODO -- the following two lines shouldn't be necessary, but
2433 they're removed a bug is exposed later in the codepath.
2434 This is workaround was thus introduced, but will have to be
2435 removed; please see PR 35150 for details about the issue. */
2436 se->expr = convert (pvoid_type_node, se->expr);
2437 se->expr = gfc_evaluate_now (se->expr, &se->pre);
2441 else if (sym->intmod_sym_id == ISOCBINDING_FUNLOC)
2443 arg->expr->ts.type = sym->ts.derived->ts.type;
2444 arg->expr->ts.f90_type = sym->ts.derived->ts.f90_type;
2445 arg->expr->ts.kind = sym->ts.derived->ts.kind;
2446 gfc_conv_expr_reference (se, arg->expr);
2450 else if ((sym->intmod_sym_id == ISOCBINDING_F_POINTER
2451 && arg->next->expr->rank == 0)
2452 || sym->intmod_sym_id == ISOCBINDING_F_PROCPOINTER)
2454 /* Convert c_f_pointer if fptr is a scalar
2455 and convert c_f_procpointer. */
2459 gfc_init_se (&cptrse, NULL);
2460 gfc_conv_expr (&cptrse, arg->expr);
2461 gfc_add_block_to_block (&se->pre, &cptrse.pre);
2462 gfc_add_block_to_block (&se->post, &cptrse.post);
2464 gfc_init_se (&fptrse, NULL);
2465 if (sym->intmod_sym_id == ISOCBINDING_F_POINTER
2466 || gfc_is_proc_ptr_comp (arg->next->expr, NULL))
2467 fptrse.want_pointer = 1;
2469 gfc_conv_expr (&fptrse, arg->next->expr);
2470 gfc_add_block_to_block (&se->pre, &fptrse.pre);
2471 gfc_add_block_to_block (&se->post, &fptrse.post);
2473 if (gfc_is_proc_ptr_comp (arg->next->expr, NULL))
2474 tmp = gfc_get_ppc_type (arg->next->expr->ref->u.c.component);
2476 tmp = TREE_TYPE (arg->next->expr->symtree->n.sym->backend_decl);
2477 se->expr = fold_build2 (MODIFY_EXPR, tmp, fptrse.expr,
2478 fold_convert (tmp, cptrse.expr));
2482 else if (sym->intmod_sym_id == ISOCBINDING_ASSOCIATED)
2487 /* Build the addr_expr for the first argument. The argument is
2488 already an *address* so we don't need to set want_pointer in
2490 gfc_init_se (&arg1se, NULL);
2491 gfc_conv_expr (&arg1se, arg->expr);
2492 gfc_add_block_to_block (&se->pre, &arg1se.pre);
2493 gfc_add_block_to_block (&se->post, &arg1se.post);
2495 /* See if we were given two arguments. */
2496 if (arg->next == NULL)
2497 /* Only given one arg so generate a null and do a
2498 not-equal comparison against the first arg. */
2499 se->expr = fold_build2 (NE_EXPR, boolean_type_node, arg1se.expr,
2500 fold_convert (TREE_TYPE (arg1se.expr),
2501 null_pointer_node));
2507 /* Given two arguments so build the arg2se from second arg. */
2508 gfc_init_se (&arg2se, NULL);
2509 gfc_conv_expr (&arg2se, arg->next->expr);
2510 gfc_add_block_to_block (&se->pre, &arg2se.pre);
2511 gfc_add_block_to_block (&se->post, &arg2se.post);
2513 /* Generate test to compare that the two args are equal. */
2514 eq_expr = fold_build2 (EQ_EXPR, boolean_type_node,
2515 arg1se.expr, arg2se.expr);
2516 /* Generate test to ensure that the first arg is not null. */
2517 not_null_expr = fold_build2 (NE_EXPR, boolean_type_node,
2518 arg1se.expr, null_pointer_node);
2520 /* Finally, the generated test must check that both arg1 is not
2521 NULL and that it is equal to the second arg. */
2522 se->expr = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
2523 not_null_expr, eq_expr);
2530 gfc_is_proc_ptr_comp (expr, &comp);
2534 if (!sym->attr.elemental)
2536 gcc_assert (se->ss->type == GFC_SS_FUNCTION);
2537 if (se->ss->useflags)
2539 gcc_assert ((!comp && gfc_return_by_reference (sym)
2540 && sym->result->attr.dimension)
2541 || (comp && comp->attr.dimension));
2542 gcc_assert (se->loop != NULL);
2544 /* Access the previously obtained result. */
2545 gfc_conv_tmp_array_ref (se);
2546 gfc_advance_se_ss_chain (se);
2550 info = &se->ss->data.info;
2555 gfc_init_block (&post);
2556 gfc_init_interface_mapping (&mapping);
2557 need_interface_mapping = ((sym->ts.type == BT_CHARACTER
2558 && sym->ts.cl->length
2559 && sym->ts.cl->length->expr_type
2561 || (comp && comp->attr.dimension)
2562 || (!comp && sym->attr.dimension));
2564 formal = comp->formal;
2566 formal = sym->formal;
2567 /* Evaluate the arguments. */
2568 for (; arg != NULL; arg = arg->next, formal = formal ? formal->next : NULL)
2571 fsym = formal ? formal->sym : NULL;
2572 parm_kind = MISSING;
2576 if (se->ignore_optional)
2578 /* Some intrinsics have already been resolved to the correct
2582 else if (arg->label)
2584 has_alternate_specifier = 1;
2589 /* Pass a NULL pointer for an absent arg. */
2590 gfc_init_se (&parmse, NULL);
2591 parmse.expr = null_pointer_node;
2592 if (arg->missing_arg_type == BT_CHARACTER)
2593 parmse.string_length = build_int_cst (gfc_charlen_type_node, 0);
2596 else if (se->ss && se->ss->useflags)
2598 /* An elemental function inside a scalarized loop. */
2599 gfc_init_se (&parmse, se);
2600 gfc_conv_expr_reference (&parmse, e);
2601 parm_kind = ELEMENTAL;
2605 /* A scalar or transformational function. */
2606 gfc_init_se (&parmse, NULL);
2607 argss = gfc_walk_expr (e);
2609 if (argss == gfc_ss_terminator)
2611 if (e->expr_type == EXPR_VARIABLE
2612 && e->symtree->n.sym->attr.cray_pointee
2613 && fsym && fsym->attr.flavor == FL_PROCEDURE)
2615 /* The Cray pointer needs to be converted to a pointer to
2616 a type given by the expression. */
2617 gfc_conv_expr (&parmse, e);
2618 type = build_pointer_type (TREE_TYPE (parmse.expr));
2619 tmp = gfc_get_symbol_decl (e->symtree->n.sym->cp_pointer);
2620 parmse.expr = convert (type, tmp);
2622 else if (fsym && fsym->attr.value)
2624 if (fsym->ts.type == BT_CHARACTER
2625 && fsym->ts.is_c_interop
2626 && fsym->ns->proc_name != NULL
2627 && fsym->ns->proc_name->attr.is_bind_c)
2630 gfc_conv_scalar_char_value (fsym, &parmse, &e);
2631 if (parmse.expr == NULL)
2632 gfc_conv_expr (&parmse, e);
2635 gfc_conv_expr (&parmse, e);
2637 else if (arg->name && arg->name[0] == '%')
2638 /* Argument list functions %VAL, %LOC and %REF are signalled
2639 through arg->name. */
2640 conv_arglist_function (&parmse, arg->expr, arg->name);
2641 else if ((e->expr_type == EXPR_FUNCTION)
2642 && e->symtree->n.sym->attr.pointer
2643 && fsym && fsym->attr.target)
2645 gfc_conv_expr (&parmse, e);
2646 parmse.expr = gfc_build_addr_expr (NULL_TREE, parmse.expr);
2648 else if (e->expr_type == EXPR_FUNCTION
2649 && e->symtree->n.sym->result
2650 && e->symtree->n.sym->result->attr.proc_pointer)
2652 /* Functions returning procedure pointers. */
2653 gfc_conv_expr (&parmse, e);
2654 if (fsym && fsym->attr.proc_pointer)
2655 parmse.expr = gfc_build_addr_expr (NULL_TREE, parmse.expr);
2659 gfc_conv_expr_reference (&parmse, e);
2660 if (fsym && e->expr_type != EXPR_NULL
2661 && ((fsym->attr.pointer
2662 && fsym->attr.flavor != FL_PROCEDURE)
2663 || (fsym->attr.proc_pointer
2664 && !(e->expr_type == EXPR_VARIABLE
2665 && e->symtree->n.sym->attr.dummy))))
2667 /* Scalar pointer dummy args require an extra level of
2668 indirection. The null pointer already contains
2669 this level of indirection. */
2670 parm_kind = SCALAR_POINTER;
2671 parmse.expr = gfc_build_addr_expr (NULL_TREE, parmse.expr);
2677 /* If the procedure requires an explicit interface, the actual
2678 argument is passed according to the corresponding formal
2679 argument. If the corresponding formal argument is a POINTER,
2680 ALLOCATABLE or assumed shape, we do not use g77's calling
2681 convention, and pass the address of the array descriptor
2682 instead. Otherwise we use g77's calling convention. */
2685 && !(fsym->attr.pointer || fsym->attr.allocatable)
2686 && fsym->as->type != AS_ASSUMED_SHAPE;
2687 f = f || !sym->attr.always_explicit;
2689 if (e->expr_type == EXPR_VARIABLE
2690 && is_subref_array (e))
2691 /* The actual argument is a component reference to an
2692 array of derived types. In this case, the argument
2693 is converted to a temporary, which is passed and then
2694 written back after the procedure call. */
2695 gfc_conv_subref_array_arg (&parmse, e, f,
2696 fsym ? fsym->attr.intent : INTENT_INOUT);
2698 gfc_conv_array_parameter (&parmse, e, argss, f, fsym,
2701 /* If an ALLOCATABLE dummy argument has INTENT(OUT) and is
2702 allocated on entry, it must be deallocated. */
2703 if (fsym && fsym->attr.allocatable
2704 && fsym->attr.intent == INTENT_OUT)
2706 tmp = build_fold_indirect_ref (parmse.expr);
2707 tmp = gfc_trans_dealloc_allocated (tmp);
2708 gfc_add_expr_to_block (&se->pre, tmp);
2714 /* The case with fsym->attr.optional is that of a user subroutine
2715 with an interface indicating an optional argument. When we call
2716 an intrinsic subroutine, however, fsym is NULL, but we might still
2717 have an optional argument, so we proceed to the substitution
2719 if (e && (fsym == NULL || fsym->attr.optional))
2721 /* If an optional argument is itself an optional dummy argument,
2722 check its presence and substitute a null if absent. */
2723 if (e->expr_type == EXPR_VARIABLE
2724 && e->symtree->n.sym->attr.optional)
2725 gfc_conv_missing_dummy (&parmse, e, fsym ? fsym->ts : e->ts,
2726 e->representation.length);
2731 /* Obtain the character length of an assumed character length
2732 length procedure from the typespec. */
2733 if (fsym->ts.type == BT_CHARACTER
2734 && parmse.string_length == NULL_TREE
2735 && e->ts.type == BT_PROCEDURE
2736 && e->symtree->n.sym->ts.type == BT_CHARACTER
2737 && e->symtree->n.sym->ts.cl->length != NULL
2738 && e->symtree->n.sym->ts.cl->length->expr_type == EXPR_CONSTANT)
2740 gfc_conv_const_charlen (e->symtree->n.sym->ts.cl);
2741 parmse.string_length = e->symtree->n.sym->ts.cl->backend_decl;
2745 if (fsym && need_interface_mapping && e)
2746 gfc_add_interface_mapping (&mapping, fsym, &parmse, e);
2748 gfc_add_block_to_block (&se->pre, &parmse.pre);
2749 gfc_add_block_to_block (&post, &parmse.post);
2751 /* Allocated allocatable components of derived types must be
2752 deallocated for non-variable scalars. Non-variable arrays are
2753 dealt with in trans-array.c(gfc_conv_array_parameter). */
2754 if (e && e->ts.type == BT_DERIVED
2755 && e->ts.derived->attr.alloc_comp
2756 && !(e->symtree && e->symtree->n.sym->attr.pointer)
2757 && (e->expr_type != EXPR_VARIABLE && !e->rank))
2760 tmp = build_fold_indirect_ref (parmse.expr);
2761 parm_rank = e->rank;
2769 case (SCALAR_POINTER):
2770 tmp = build_fold_indirect_ref (tmp);
2774 if (e->expr_type == EXPR_OP
2775 && e->value.op.op == INTRINSIC_PARENTHESES
2776 && e->value.op.op1->expr_type == EXPR_VARIABLE)
2779 local_tmp = gfc_evaluate_now (tmp, &se->pre);
2780 local_tmp = gfc_copy_alloc_comp (e->ts.derived, local_tmp, tmp, parm_rank);
2781 gfc_add_expr_to_block (&se->post, local_tmp);
2784 tmp = gfc_deallocate_alloc_comp (e->ts.derived, tmp, parm_rank);
2786 gfc_add_expr_to_block (&se->post, tmp);
2789 /* Add argument checking of passing an unallocated/NULL actual to
2790 a nonallocatable/nonpointer dummy. */
2792 if (gfc_option.rtcheck & GFC_RTCHECK_POINTER && e != NULL)
2794 symbol_attribute *attr;
2798 if (e->expr_type == EXPR_VARIABLE)
2799 attr = &e->symtree->n.sym->attr;
2800 else if (e->expr_type == EXPR_FUNCTION)
2802 /* For intrinsic functions, the gfc_attr are not available. */
2803 if (e->symtree->n.sym->attr.generic && e->value.function.isym)
2804 goto end_pointer_check;
2806 if (e->symtree->n.sym->attr.generic)
2807 attr = &e->value.function.esym->attr;
2809 attr = &e->symtree->n.sym->result->attr;
2812 goto end_pointer_check;
2816 /* If the actual argument is an optional pointer/allocatable and
2817 the formal argument takes an nonpointer optional value,
2818 it is invalid to pass a non-present argument on, even
2819 though there is no technical reason for this in gfortran.
2820 See Fortran 2003, Section 12.4.1.6 item (7)+(8). */
2821 tree present, nullptr, type;
2823 if (attr->allocatable
2824 && (fsym == NULL || !fsym->attr.allocatable))
2825 asprintf (&msg, "Allocatable actual argument '%s' is not "
2826 "allocated or not present", e->symtree->n.sym->name);
2827 else if (attr->pointer
2828 && (fsym == NULL || !fsym->attr.pointer))
2829 asprintf (&msg, "Pointer actual argument '%s' is not "
2830 "associated or not present",
2831 e->symtree->n.sym->name);
2832 else if (attr->proc_pointer
2833 && (fsym == NULL || !fsym->attr.proc_pointer))
2834 asprintf (&msg, "Proc-pointer actual argument '%s' is not "
2835 "associated or not present",
2836 e->symtree->n.sym->name);
2838 goto end_pointer_check;
2840 present = gfc_conv_expr_present (e->symtree->n.sym);
2841 type = TREE_TYPE (present);
2842 present = fold_build2 (EQ_EXPR, boolean_type_node, present,
2843 fold_convert (type, null_pointer_node));
2844 type = TREE_TYPE (parmse.expr);
2845 nullptr = fold_build2 (EQ_EXPR, boolean_type_node, parmse.expr,
2846 fold_convert (type, null_pointer_node));
2847 cond = fold_build2 (TRUTH_ORIF_EXPR, boolean_type_node,
2852 if (attr->allocatable
2853 && (fsym == NULL || !fsym->attr.allocatable))
2854 asprintf (&msg, "Allocatable actual argument '%s' is not "
2855 "allocated", e->symtree->n.sym->name);
2856 else if (attr->pointer
2857 && (fsym == NULL || !fsym->attr.pointer))
2858 asprintf (&msg, "Pointer actual argument '%s' is not "
2859 "associated", e->symtree->n.sym->name);
2860 else if (attr->proc_pointer
2861 && (fsym == NULL || !fsym->attr.proc_pointer))
2862 asprintf (&msg, "Proc-pointer actual argument '%s' is not "
2863 "associated", e->symtree->n.sym->name);
2865 goto end_pointer_check;
2868 cond = fold_build2 (EQ_EXPR, boolean_type_node, parmse.expr,
2869 fold_convert (TREE_TYPE (parmse.expr),
2870 null_pointer_node));
2873 gfc_trans_runtime_check (true, false, cond, &se->pre, &e->where,
2880 /* Character strings are passed as two parameters, a length and a
2881 pointer - except for Bind(c) which only passes the pointer. */
2882 if (parmse.string_length != NULL_TREE && !sym->attr.is_bind_c)
2883 stringargs = gfc_chainon_list (stringargs, parmse.string_length);
2885 arglist = gfc_chainon_list (arglist, parmse.expr);
2887 gfc_finish_interface_mapping (&mapping, &se->pre, &se->post);
2890 if (ts.type == BT_CHARACTER && sym->attr.is_bind_c)
2891 se->string_length = build_int_cst (gfc_charlen_type_node, 1);
2892 else if (ts.type == BT_CHARACTER)
2894 if (sym->ts.cl->length == NULL)
2896 /* Assumed character length results are not allowed by 5.1.1.5 of the
2897 standard and are trapped in resolve.c; except in the case of SPREAD
2898 (and other intrinsics?) and dummy functions. In the case of SPREAD,
2899 we take the character length of the first argument for the result.
2900 For dummies, we have to look through the formal argument list for
2901 this function and use the character length found there.*/
2902 if (!sym->attr.dummy)
2903 cl.backend_decl = TREE_VALUE (stringargs);
2906 formal = sym->ns->proc_name->formal;
2907 for (; formal; formal = formal->next)
2908 if (strcmp (formal->sym->name, sym->name) == 0)
2909 cl.backend_decl = formal->sym->ts.cl->backend_decl;
2916 /* Calculate the length of the returned string. */
2917 gfc_init_se (&parmse, NULL);
2918 if (need_interface_mapping)
2919 gfc_apply_interface_mapping (&mapping, &parmse, sym->ts.cl->length);
2921 gfc_conv_expr (&parmse, sym->ts.cl->length);
2922 gfc_add_block_to_block (&se->pre, &parmse.pre);
2923 gfc_add_block_to_block (&se->post, &parmse.post);
2925 tmp = fold_convert (gfc_charlen_type_node, parmse.expr);
2926 tmp = fold_build2 (MAX_EXPR, gfc_charlen_type_node, tmp,
2927 build_int_cst (gfc_charlen_type_node, 0));
2928 cl.backend_decl = tmp;
2931 /* Set up a charlen structure for it. */
2936 len = cl.backend_decl;
2939 byref = (comp && comp->attr.dimension)
2940 || (!comp && gfc_return_by_reference (sym));
2943 if (se->direct_byref)
2945 /* Sometimes, too much indirection can be applied; e.g. for
2946 function_result = array_valued_recursive_function. */
2947 if (TREE_TYPE (TREE_TYPE (se->expr))
2948 && TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr)))
2949 && GFC_DESCRIPTOR_TYPE_P
2950 (TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr)))))
2951 se->expr = build_fold_indirect_ref (se->expr);
2953 retargs = gfc_chainon_list (retargs, se->expr);
2955 else if (comp && comp->attr.dimension)
2957 gcc_assert (se->loop && info);
2959 /* Set the type of the array. */
2960 tmp = gfc_typenode_for_spec (&comp->ts);
2961 info->dimen = se->loop->dimen;
2963 /* Evaluate the bounds of the result, if known. */
2964 gfc_set_loop_bounds_from_array_spec (&mapping, se, comp->as);
2966 /* Create a temporary to store the result. In case the function
2967 returns a pointer, the temporary will be a shallow copy and
2968 mustn't be deallocated. */
2969 callee_alloc = comp->attr.allocatable || comp->attr.pointer;
2970 gfc_trans_create_temp_array (&se->pre, &se->post, se->loop, info, tmp,
2971 NULL_TREE, false, !comp->attr.pointer,
2972 callee_alloc, &se->ss->expr->where);
2974 /* Pass the temporary as the first argument. */
2975 tmp = info->descriptor;
2976 tmp = gfc_build_addr_expr (NULL_TREE, tmp);
2977 retargs = gfc_chainon_list (retargs, tmp);
2979 else if (sym->result->attr.dimension)
2981 gcc_assert (se->loop && info);
2983 /* Set the type of the array. */
2984 tmp = gfc_typenode_for_spec (&ts);
2985 info->dimen = se->loop->dimen;
2987 /* Evaluate the bounds of the result, if known. */
2988 gfc_set_loop_bounds_from_array_spec (&mapping, se, sym->result->as);
2990 /* Create a temporary to store the result. In case the function
2991 returns a pointer, the temporary will be a shallow copy and
2992 mustn't be deallocated. */
2993 callee_alloc = sym->attr.allocatable || sym->attr.pointer;
2994 gfc_trans_create_temp_array (&se->pre, &se->post, se->loop, info, tmp,
2995 NULL_TREE, false, !sym->attr.pointer,
2996 callee_alloc, &se->ss->expr->where);
2998 /* Pass the temporary as the first argument. */
2999 tmp = info->descriptor;
3000 tmp = gfc_build_addr_expr (NULL_TREE, tmp);
3001 retargs = gfc_chainon_list (retargs, tmp);
3003 else if (ts.type == BT_CHARACTER)
3005 /* Pass the string length. */
3006 type = gfc_get_character_type (ts.kind, ts.cl);
3007 type = build_pointer_type (type);
3009 /* Return an address to a char[0:len-1]* temporary for
3010 character pointers. */
3011 if (sym->attr.pointer || sym->attr.allocatable)
3013 var = gfc_create_var (type, "pstr");
3015 /* Provide an address expression for the function arguments. */
3016 var = gfc_build_addr_expr (NULL_TREE, var);
3019 var = gfc_conv_string_tmp (se, type, len);
3021 retargs = gfc_chainon_list (retargs, var);
3025 gcc_assert (gfc_option.flag_f2c && ts.type == BT_COMPLEX);
3027 type = gfc_get_complex_type (ts.kind);
3028 var = gfc_build_addr_expr (NULL_TREE, gfc_create_var (type, "cmplx"));
3029 retargs = gfc_chainon_list (retargs, var);
3032 /* Add the string length to the argument list. */
3033 if (ts.type == BT_CHARACTER)
3034 retargs = gfc_chainon_list (retargs, len);
3036 gfc_free_interface_mapping (&mapping);
3038 /* Add the return arguments. */
3039 arglist = chainon (retargs, arglist);
3041 /* Add the hidden string length parameters to the arguments. */
3042 arglist = chainon (arglist, stringargs);
3044 /* We may want to append extra arguments here. This is used e.g. for
3045 calls to libgfortran_matmul_??, which need extra information. */
3046 if (append_args != NULL_TREE)
3047 arglist = chainon (arglist, append_args);
3049 /* Generate the actual call. */
3050 conv_function_val (se, sym, expr);
3052 /* If there are alternate return labels, function type should be
3053 integer. Can't modify the type in place though, since it can be shared
3054 with other functions. For dummy arguments, the typing is done to
3055 to this result, even if it has to be repeated for each call. */
3056 if (has_alternate_specifier
3057 && TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr))) != integer_type_node)
3059 if (!sym->attr.dummy)
3061 TREE_TYPE (sym->backend_decl)
3062 = build_function_type (integer_type_node,
3063 TYPE_ARG_TYPES (TREE_TYPE (sym->backend_decl)));
3064 se->expr = gfc_build_addr_expr (NULL_TREE, sym->backend_decl);
3067 TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr))) = integer_type_node;
3070 fntype = TREE_TYPE (TREE_TYPE (se->expr));
3071 se->expr = build_call_list (TREE_TYPE (fntype), se->expr, arglist);
3073 /* If we have a pointer function, but we don't want a pointer, e.g.
3076 where f is pointer valued, we have to dereference the result. */
3077 if (!se->want_pointer && !byref && sym->attr.pointer
3078 && !gfc_is_proc_ptr_comp (expr, NULL))
3079 se->expr = build_fold_indirect_ref (se->expr);
3081 /* f2c calling conventions require a scalar default real function to
3082 return a double precision result. Convert this back to default
3083 real. We only care about the cases that can happen in Fortran 77.
3085 if (gfc_option.flag_f2c && sym->ts.type == BT_REAL
3086 && sym->ts.kind == gfc_default_real_kind
3087 && !sym->attr.always_explicit)
3088 se->expr = fold_convert (gfc_get_real_type (sym->ts.kind), se->expr);
3090 /* A pure function may still have side-effects - it may modify its
3092 TREE_SIDE_EFFECTS (se->expr) = 1;
3094 if (!sym->attr.pure)
3095 TREE_SIDE_EFFECTS (se->expr) = 1;
3100 /* Add the function call to the pre chain. There is no expression. */
3101 gfc_add_expr_to_block (&se->pre, se->expr);
3102 se->expr = NULL_TREE;
3104 if (!se->direct_byref)
3106 if (sym->attr.dimension || (comp && comp->attr.dimension))
3108 if (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS)
3110 /* Check the data pointer hasn't been modified. This would
3111 happen in a function returning a pointer. */
3112 tmp = gfc_conv_descriptor_data_get (info->descriptor);
3113 tmp = fold_build2 (NE_EXPR, boolean_type_node,
3115 gfc_trans_runtime_check (true, false, tmp, &se->pre, NULL,
3118 se->expr = info->descriptor;
3119 /* Bundle in the string length. */
3120 se->string_length = len;
3122 else if (sym->ts.type == BT_CHARACTER)
3124 /* Dereference for character pointer results. */
3125 if (sym->attr.pointer || sym->attr.allocatable)
3126 se->expr = build_fold_indirect_ref (var);
3130 se->string_length = len;
3134 gcc_assert (sym->ts.type == BT_COMPLEX && gfc_option.flag_f2c);
3135 se->expr = build_fold_indirect_ref (var);
3140 /* Follow the function call with the argument post block. */
3142 gfc_add_block_to_block (&se->pre, &post);
3144 gfc_add_block_to_block (&se->post, &post);
3146 return has_alternate_specifier;
3150 /* Fill a character string with spaces. */
3153 fill_with_spaces (tree start, tree type, tree size)
3155 stmtblock_t block, loop;
3156 tree i, el, exit_label, cond, tmp;
3158 /* For a simple char type, we can call memset(). */
3159 if (compare_tree_int (TYPE_SIZE_UNIT (type), 1) == 0)
3160 return build_call_expr (built_in_decls[BUILT_IN_MEMSET], 3, start,
3161 build_int_cst (gfc_get_int_type (gfc_c_int_kind),
3162 lang_hooks.to_target_charset (' ')),
3165 /* Otherwise, we use a loop:
3166 for (el = start, i = size; i > 0; el--, i+= TYPE_SIZE_UNIT (type))
3170 /* Initialize variables. */
3171 gfc_init_block (&block);
3172 i = gfc_create_var (sizetype, "i");
3173 gfc_add_modify (&block, i, fold_convert (sizetype, size));
3174 el = gfc_create_var (build_pointer_type (type), "el");
3175 gfc_add_modify (&block, el, fold_convert (TREE_TYPE (el), start));
3176 exit_label = gfc_build_label_decl (NULL_TREE);
3177 TREE_USED (exit_label) = 1;
3181 gfc_init_block (&loop);
3183 /* Exit condition. */
3184 cond = fold_build2 (LE_EXPR, boolean_type_node, i,
3185 fold_convert (sizetype, integer_zero_node));
3186 tmp = build1_v (GOTO_EXPR, exit_label);
3187 tmp = fold_build3 (COND_EXPR, void_type_node, cond, tmp,
3188 build_empty_stmt (input_location));
3189 gfc_add_expr_to_block (&loop, tmp);
3192 gfc_add_modify (&loop, fold_build1 (INDIRECT_REF, type, el),
3193 build_int_cst (type,
3194 lang_hooks.to_target_charset (' ')));
3196 /* Increment loop variables. */
3197 gfc_add_modify (&loop, i, fold_build2 (MINUS_EXPR, sizetype, i,
3198 TYPE_SIZE_UNIT (type)));
3199 gfc_add_modify (&loop, el, fold_build2 (POINTER_PLUS_EXPR,
3201 TYPE_SIZE_UNIT (type)));
3203 /* Making the loop... actually loop! */
3204 tmp = gfc_finish_block (&loop);
3205 tmp = build1_v (LOOP_EXPR, tmp);
3206 gfc_add_expr_to_block (&block, tmp);
3208 /* The exit label. */
3209 tmp = build1_v (LABEL_EXPR, exit_label);
3210 gfc_add_expr_to_block (&block, tmp);
3213 return gfc_finish_block (&block);
3217 /* Generate code to copy a string. */
3220 gfc_trans_string_copy (stmtblock_t * block, tree dlength, tree dest,
3221 int dkind, tree slength, tree src, int skind)
3223 tree tmp, dlen, slen;
3232 stmtblock_t tempblock;
3234 gcc_assert (dkind == skind);
3236 if (slength != NULL_TREE)
3238 slen = fold_convert (size_type_node, gfc_evaluate_now (slength, block));
3239 ssc = string_to_single_character (slen, src, skind);
3243 slen = build_int_cst (size_type_node, 1);
3247 if (dlength != NULL_TREE)
3249 dlen = fold_convert (size_type_node, gfc_evaluate_now (dlength, block));
3250 dsc = string_to_single_character (slen, dest, dkind);
3254 dlen = build_int_cst (size_type_node, 1);
3258 if (slength != NULL_TREE && POINTER_TYPE_P (TREE_TYPE (src)))
3259 ssc = string_to_single_character (slen, src, skind);
3260 if (dlength != NULL_TREE && POINTER_TYPE_P (TREE_TYPE (dest)))
3261 dsc = string_to_single_character (dlen, dest, dkind);
3264 /* Assign directly if the types are compatible. */
3265 if (dsc != NULL_TREE && ssc != NULL_TREE
3266 && TREE_TYPE (dsc) == TREE_TYPE (ssc))
3268 gfc_add_modify (block, dsc, ssc);
3272 /* Do nothing if the destination length is zero. */
3273 cond = fold_build2 (GT_EXPR, boolean_type_node, dlen,
3274 build_int_cst (size_type_node, 0));
3276 /* The following code was previously in _gfortran_copy_string:
3278 // The two strings may overlap so we use memmove.
3280 copy_string (GFC_INTEGER_4 destlen, char * dest,
3281 GFC_INTEGER_4 srclen, const char * src)
3283 if (srclen >= destlen)
3285 // This will truncate if too long.
3286 memmove (dest, src, destlen);
3290 memmove (dest, src, srclen);
3292 memset (&dest[srclen], ' ', destlen - srclen);
3296 We're now doing it here for better optimization, but the logic
3299 /* For non-default character kinds, we have to multiply the string
3300 length by the base type size. */
3301 chartype = gfc_get_char_type (dkind);
3302 slen = fold_build2 (MULT_EXPR, size_type_node,
3303 fold_convert (size_type_node, slen),
3304 fold_convert (size_type_node, TYPE_SIZE_UNIT (chartype)));
3305 dlen = fold_build2 (MULT_EXPR, size_type_node,
3306 fold_convert (size_type_node, dlen),
3307 fold_convert (size_type_node, TYPE_SIZE_UNIT (chartype)));
3310 dest = fold_convert (pvoid_type_node, dest);
3312 dest = gfc_build_addr_expr (pvoid_type_node, dest);
3315 src = fold_convert (pvoid_type_node, src);
3317 src = gfc_build_addr_expr (pvoid_type_node, src);
3319 /* Truncate string if source is too long. */
3320 cond2 = fold_build2 (GE_EXPR, boolean_type_node, slen, dlen);
3321 tmp2 = build_call_expr (built_in_decls[BUILT_IN_MEMMOVE],
3322 3, dest, src, dlen);
3324 /* Else copy and pad with spaces. */
3325 tmp3 = build_call_expr (built_in_decls[BUILT_IN_MEMMOVE],
3326 3, dest, src, slen);
3328 tmp4 = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (dest), dest,
3329 fold_convert (sizetype, slen));
3330 tmp4 = fill_with_spaces (tmp4, chartype,
3331 fold_build2 (MINUS_EXPR, TREE_TYPE(dlen),
3334 gfc_init_block (&tempblock);
3335 gfc_add_expr_to_block (&tempblock, tmp3);
3336 gfc_add_expr_to_block (&tempblock, tmp4);
3337 tmp3 = gfc_finish_block (&tempblock);
3339 /* The whole copy_string function is there. */
3340 tmp = fold_build3 (COND_EXPR, void_type_node, cond2, tmp2, tmp3);
3341 tmp = fold_build3 (COND_EXPR, void_type_node, cond, tmp,
3342 build_empty_stmt (input_location));
3343 gfc_add_expr_to_block (block, tmp);
3347 /* Translate a statement function.
3348 The value of a statement function reference is obtained by evaluating the
3349 expression using the values of the actual arguments for the values of the
3350 corresponding dummy arguments. */
3353 gfc_conv_statement_function (gfc_se * se, gfc_expr * expr)
3357 gfc_formal_arglist *fargs;
3358 gfc_actual_arglist *args;
3361 gfc_saved_var *saved_vars;
3367 sym = expr->symtree->n.sym;
3368 args = expr->value.function.actual;
3369 gfc_init_se (&lse, NULL);
3370 gfc_init_se (&rse, NULL);
3373 for (fargs = sym->formal; fargs; fargs = fargs->next)
3375 saved_vars = (gfc_saved_var *)gfc_getmem (n * sizeof (gfc_saved_var));
3376 temp_vars = (tree *)gfc_getmem (n * sizeof (tree));
3378 for (fargs = sym->formal, n = 0; fargs; fargs = fargs->next, n++)
3380 /* Each dummy shall be specified, explicitly or implicitly, to be
3382 gcc_assert (fargs->sym->attr.dimension == 0);
3385 /* Create a temporary to hold the value. */
3386 type = gfc_typenode_for_spec (&fsym->ts);
3387 temp_vars[n] = gfc_create_var (type, fsym->name);
3389 if (fsym->ts.type == BT_CHARACTER)
3391 /* Copy string arguments. */
3394 gcc_assert (fsym->ts.cl && fsym->ts.cl->length
3395 && fsym->ts.cl->length->expr_type == EXPR_CONSTANT);
3397 arglen = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
3398 tmp = gfc_build_addr_expr (build_pointer_type (type),
3401 gfc_conv_expr (&rse, args->expr);
3402 gfc_conv_string_parameter (&rse);
3403 gfc_add_block_to_block (&se->pre, &lse.pre);
3404 gfc_add_block_to_block (&se->pre, &rse.pre);
3406 gfc_trans_string_copy (&se->pre, arglen, tmp, fsym->ts.kind,
3407 rse.string_length, rse.expr, fsym->ts.kind);
3408 gfc_add_block_to_block (&se->pre, &lse.post);
3409 gfc_add_block_to_block (&se->pre, &rse.post);
3413 /* For everything else, just evaluate the expression. */
3414 gfc_conv_expr (&lse, args->expr);
3416 gfc_add_block_to_block (&se->pre, &lse.pre);
3417 gfc_add_modify (&se->pre, temp_vars[n], lse.expr);
3418 gfc_add_block_to_block (&se->pre, &lse.post);
3424 /* Use the temporary variables in place of the real ones. */
3425 for (fargs = sym->formal, n = 0; fargs; fargs = fargs->next, n++)
3426 gfc_shadow_sym (fargs->sym, temp_vars[n], &saved_vars[n]);
3428 gfc_conv_expr (se, sym->value);
3430 if (sym->ts.type == BT_CHARACTER)
3432 gfc_conv_const_charlen (sym->ts.cl);
3434 /* Force the expression to the correct length. */
3435 if (!INTEGER_CST_P (se->string_length)
3436 || tree_int_cst_lt (se->string_length,
3437 sym->ts.cl->backend_decl))
3439 type = gfc_get_character_type (sym->ts.kind, sym->ts.cl);
3440 tmp = gfc_create_var (type, sym->name);
3441 tmp = gfc_build_addr_expr (build_pointer_type (type), tmp);
3442 gfc_trans_string_copy (&se->pre, sym->ts.cl->backend_decl, tmp,
3443 sym->ts.kind, se->string_length, se->expr,
3447 se->string_length = sym->ts.cl->backend_decl;
3450 /* Restore the original variables. */
3451 for (fargs = sym->formal, n = 0; fargs; fargs = fargs->next, n++)
3452 gfc_restore_sym (fargs->sym, &saved_vars[n]);
3453 gfc_free (saved_vars);
3457 /* Return the backend_decl for a procedure pointer component. */
3460 gfc_get_proc_ptr_comp (gfc_se *se, gfc_expr *e)
3464 gfc_init_se (&comp_se, NULL);
3465 e2 = gfc_copy_expr (e);
3466 e2->expr_type = EXPR_VARIABLE;
3467 gfc_conv_expr (&comp_se, e2);
3468 comp_se.expr = build_fold_addr_expr (comp_se.expr);
3469 return gfc_evaluate_now (comp_se.expr, &se->pre);
3473 /* Translate a function expression. */
3476 gfc_conv_function_expr (gfc_se * se, gfc_expr * expr)
3480 if (expr->value.function.isym)
3482 gfc_conv_intrinsic_function (se, expr);
3486 /* We distinguish statement functions from general functions to improve
3487 runtime performance. */
3488 if (expr->symtree->n.sym->attr.proc == PROC_ST_FUNCTION)
3490 gfc_conv_statement_function (se, expr);
3494 /* expr.value.function.esym is the resolved (specific) function symbol for
3495 most functions. However this isn't set for dummy procedures. */
3496 sym = expr->value.function.esym;
3498 sym = expr->symtree->n.sym;
3500 gfc_conv_procedure_call (se, sym, expr->value.function.actual, expr,
3506 gfc_conv_array_constructor_expr (gfc_se * se, gfc_expr * expr)
3508 gcc_assert (se->ss != NULL && se->ss != gfc_ss_terminator);
3509 gcc_assert (se->ss->expr == expr && se->ss->type == GFC_SS_CONSTRUCTOR);
3511 gfc_conv_tmp_array_ref (se);
3512 gfc_advance_se_ss_chain (se);
3516 /* Build a static initializer. EXPR is the expression for the initial value.
3517 The other parameters describe the variable of the component being
3518 initialized. EXPR may be null. */
3521 gfc_conv_initializer (gfc_expr * expr, gfc_typespec * ts, tree type,
3522 bool array, bool pointer)
3526 if (!(expr || pointer))
3529 /* Check if we have ISOCBINDING_NULL_PTR or ISOCBINDING_NULL_FUNPTR
3530 (these are the only two iso_c_binding derived types that can be
3531 used as initialization expressions). If so, we need to modify
3532 the 'expr' to be that for a (void *). */
3533 if (expr != NULL && expr->ts.type == BT_DERIVED
3534 && expr->ts.is_iso_c && expr->ts.derived)
3536 gfc_symbol *derived = expr->ts.derived;
3538 expr = gfc_int_expr (0);
3540 /* The derived symbol has already been converted to a (void *). Use
3542 expr->ts.f90_type = derived->ts.f90_type;
3543 expr->ts.kind = derived->ts.kind;
3548 /* Arrays need special handling. */
3550 return gfc_build_null_descriptor (type);
3552 return gfc_conv_array_initializer (type, expr);
3555 return fold_convert (type, null_pointer_node);
3561 gfc_init_se (&se, NULL);
3562 gfc_conv_structure (&se, expr, 1);
3566 return gfc_conv_string_init (ts->cl->backend_decl,expr);
3569 gfc_init_se (&se, NULL);
3570 gfc_conv_constant (&se, expr);
3577 gfc_trans_subarray_assign (tree dest, gfc_component * cm, gfc_expr * expr)
3589 gfc_start_block (&block);
3591 /* Initialize the scalarizer. */
3592 gfc_init_loopinfo (&loop);
3594 gfc_init_se (&lse, NULL);
3595 gfc_init_se (&rse, NULL);
3598 rss = gfc_walk_expr (expr);
3599 if (rss == gfc_ss_terminator)
3601 /* The rhs is scalar. Add a ss for the expression. */
3602 rss = gfc_get_ss ();
3603 rss->next = gfc_ss_terminator;
3604 rss->type = GFC_SS_SCALAR;
3608 /* Create a SS for the destination. */
3609 lss = gfc_get_ss ();
3610 lss->type = GFC_SS_COMPONENT;
3612 lss->shape = gfc_get_shape (cm->as->rank);
3613 lss->next = gfc_ss_terminator;
3614 lss->data.info.dimen = cm->as->rank;
3615 lss->data.info.descriptor = dest;
3616 lss->data.info.data = gfc_conv_array_data (dest);
3617 lss->data.info.offset = gfc_conv_array_offset (dest);
3618 for (n = 0; n < cm->as->rank; n++)
3620 lss->data.info.dim[n] = n;
3621 lss->data.info.start[n] = gfc_conv_array_lbound (dest, n);
3622 lss->data.info.stride[n] = gfc_index_one_node;
3624 mpz_init (lss->shape[n]);
3625 mpz_sub (lss->shape[n], cm->as->upper[n]->value.integer,
3626 cm->as->lower[n]->value.integer);
3627 mpz_add_ui (lss->shape[n], lss->shape[n], 1);
3630 /* Associate the SS with the loop. */
3631 gfc_add_ss_to_loop (&loop, lss);
3632 gfc_add_ss_to_loop (&loop, rss);
3634 /* Calculate the bounds of the scalarization. */
3635 gfc_conv_ss_startstride (&loop);
3637 /* Setup the scalarizing loops. */
3638 gfc_conv_loop_setup (&loop, &expr->where);
3640 /* Setup the gfc_se structures. */
3641 gfc_copy_loopinfo_to_se (&lse, &loop);
3642 gfc_copy_loopinfo_to_se (&rse, &loop);
3645 gfc_mark_ss_chain_used (rss, 1);
3647 gfc_mark_ss_chain_used (lss, 1);
3649 /* Start the scalarized loop body. */
3650 gfc_start_scalarized_body (&loop, &body);
3652 gfc_conv_tmp_array_ref (&lse);
3653 if (cm->ts.type == BT_CHARACTER)
3654 lse.string_length = cm->ts.cl->backend_decl;
3656 gfc_conv_expr (&rse, expr);
3658 tmp = gfc_trans_scalar_assign (&lse, &rse, cm->ts, true, false);
3659 gfc_add_expr_to_block (&body, tmp);
3661 gcc_assert (rse.ss == gfc_ss_terminator);
3663 /* Generate the copying loops. */
3664 gfc_trans_scalarizing_loops (&loop, &body);
3666 /* Wrap the whole thing up. */
3667 gfc_add_block_to_block (&block, &loop.pre);
3668 gfc_add_block_to_block (&block, &loop.post);
3670 for (n = 0; n < cm->as->rank; n++)
3671 mpz_clear (lss->shape[n]);
3672 gfc_free (lss->shape);
3674 gfc_cleanup_loop (&loop);
3676 return gfc_finish_block (&block);
3680 /* Assign a single component of a derived type constructor. */
3683 gfc_trans_subcomponent_assign (tree dest, gfc_component * cm, gfc_expr * expr)
3693 gfc_start_block (&block);
3695 if (cm->attr.pointer)
3697 gfc_init_se (&se, NULL);
3698 /* Pointer component. */
3699 if (cm->attr.dimension)
3701 /* Array pointer. */
3702 if (expr->expr_type == EXPR_NULL)
3703 gfc_conv_descriptor_data_set (&block, dest, null_pointer_node);
3706 rss = gfc_walk_expr (expr);
3707 se.direct_byref = 1;
3709 gfc_conv_expr_descriptor (&se, expr, rss);
3710 gfc_add_block_to_block (&block, &se.pre);
3711 gfc_add_block_to_block (&block, &se.post);
3716 /* Scalar pointers. */
3717 se.want_pointer = 1;
3718 gfc_conv_expr (&se, expr);
3719 gfc_add_block_to_block (&block, &se.pre);
3720 gfc_add_modify (&block, dest,
3721 fold_convert (TREE_TYPE (dest), se.expr));
3722 gfc_add_block_to_block (&block, &se.post);
3725 else if (cm->attr.dimension)
3727 if (cm->attr.allocatable && expr->expr_type == EXPR_NULL)
3728 gfc_conv_descriptor_data_set (&block, dest, null_pointer_node);
3729 else if (cm->attr.allocatable)
3733 gfc_init_se (&se, NULL);
3735 rss = gfc_walk_expr (expr);
3736 se.want_pointer = 0;
3737 gfc_conv_expr_descriptor (&se, expr, rss);
3738 gfc_add_block_to_block (&block, &se.pre);
3740 tmp = fold_convert (TREE_TYPE (dest), se.expr);
3741 gfc_add_modify (&block, dest, tmp);
3743 if (cm->ts.type == BT_DERIVED && cm->ts.derived->attr.alloc_comp)
3744 tmp = gfc_copy_alloc_comp (cm->ts.derived, se.expr, dest,
3747 tmp = gfc_duplicate_allocatable (dest, se.expr,
3748 TREE_TYPE(cm->backend_decl),
3751 gfc_add_expr_to_block (&block, tmp);
3752 gfc_add_block_to_block (&block, &se.post);
3754 if (expr->expr_type != EXPR_VARIABLE)
3755 gfc_conv_descriptor_data_set (&block, se.expr, null_pointer_node);
3757 /* Shift the lbound and ubound of temporaries to being unity, rather
3758 than zero, based. Calculate the offset for all cases. */
3759 offset = gfc_conv_descriptor_offset_get (dest);
3760 gfc_add_modify (&block, offset, gfc_index_zero_node);
3761 tmp2 =gfc_create_var (gfc_array_index_type, NULL);
3762 for (n = 0; n < expr->rank; n++)
3764 if (expr->expr_type != EXPR_VARIABLE
3765 && expr->expr_type != EXPR_CONSTANT)
3768 tmp = gfc_conv_descriptor_ubound_get (dest, gfc_rank_cst[n]);
3769 span = fold_build2 (MINUS_EXPR, gfc_array_index_type, tmp,
3770 gfc_conv_descriptor_lbound_get (dest, gfc_rank_cst[n]));
3771 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
3772 span, gfc_index_one_node);
3773 gfc_conv_descriptor_ubound_set (&block, dest, gfc_rank_cst[n],
3775 gfc_conv_descriptor_lbound_set (&block, dest, gfc_rank_cst[n],
3776 gfc_index_one_node);
3778 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type,
3779 gfc_conv_descriptor_lbound_get (dest,
3781 gfc_conv_descriptor_stride_get (dest,
3783 gfc_add_modify (&block, tmp2, tmp);
3784 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, offset, tmp2);
3785 gfc_conv_descriptor_offset_set (&block, dest, tmp);
3788 if (expr->expr_type == EXPR_FUNCTION
3789 && expr->value.function.isym
3790 && expr->value.function.isym->conversion
3791 && expr->value.function.actual->expr
3792 && expr->value.function.actual->expr->expr_type
3795 /* If a conversion expression has a null data pointer
3796 argument, nullify the allocatable component. */
3800 s = expr->value.function.actual->expr->symtree->n.sym;
3801 if (s->attr.allocatable || s->attr.pointer)
3803 non_null_expr = gfc_finish_block (&block);
3804 gfc_start_block (&block);
3805 gfc_conv_descriptor_data_set (&block, dest,
3807 null_expr = gfc_finish_block (&block);
3808 tmp = gfc_conv_descriptor_data_get (s->backend_decl);
3809 tmp = build2 (EQ_EXPR, boolean_type_node, tmp,
3810 fold_convert (TREE_TYPE (tmp),
3811 null_pointer_node));
3812 return build3_v (COND_EXPR, tmp, null_expr,
3819 tmp = gfc_trans_subarray_assign (dest, cm, expr);
3820 gfc_add_expr_to_block (&block, tmp);
3823 else if (expr->ts.type == BT_DERIVED)
3825 if (expr->expr_type != EXPR_STRUCTURE)
3827 gfc_init_se (&se, NULL);
3828 gfc_conv_expr (&se, expr);
3829 gfc_add_block_to_block (&block, &se.pre);
3830 gfc_add_modify (&block, dest,
3831 fold_convert (TREE_TYPE (dest), se.expr));
3832 gfc_add_block_to_block (&block, &se.post);
3836 /* Nested constructors. */
3837 tmp = gfc_trans_structure_assign (dest, expr);
3838 gfc_add_expr_to_block (&block, tmp);
3843 /* Scalar component. */
3844 gfc_init_se (&se, NULL);
3845 gfc_init_se (&lse, NULL);
3847 gfc_conv_expr (&se, expr);
3848 if (cm->ts.type == BT_CHARACTER)
3849 lse.string_length = cm->ts.cl->backend_decl;
3851 tmp = gfc_trans_scalar_assign (&lse, &se, cm->ts, true, false);
3852 gfc_add_expr_to_block (&block, tmp);
3854 return gfc_finish_block (&block);
3857 /* Assign a derived type constructor to a variable. */
3860 gfc_trans_structure_assign (tree dest, gfc_expr * expr)
3868 gfc_start_block (&block);
3869 cm = expr->ts.derived->components;
3870 for (c = expr->value.constructor; c; c = c->next, cm = cm->next)
3872 /* Skip absent members in default initializers. */
3876 field = cm->backend_decl;
3877 tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field),
3878 dest, field, NULL_TREE);
3879 tmp = gfc_trans_subcomponent_assign (tmp, cm, c->expr);
3880 gfc_add_expr_to_block (&block, tmp);
3882 return gfc_finish_block (&block);
3885 /* Build an expression for a constructor. If init is nonzero then
3886 this is part of a static variable initializer. */
3889 gfc_conv_structure (gfc_se * se, gfc_expr * expr, int init)
3896 VEC(constructor_elt,gc) *v = NULL;
3898 gcc_assert (se->ss == NULL);
3899 gcc_assert (expr->expr_type == EXPR_STRUCTURE);
3900 type = gfc_typenode_for_spec (&expr->ts);
3904 /* Create a temporary variable and fill it in. */
3905 se->expr = gfc_create_var (type, expr->ts.derived->name);
3906 tmp = gfc_trans_structure_assign (se->expr, expr);
3907 gfc_add_expr_to_block (&se->pre, tmp);
3911 cm = expr->ts.derived->components;
3913 for (c = expr->value.constructor; c; c = c->next, cm = cm->next)
3915 /* Skip absent members in default initializers and allocatable
3916 components. Although the latter have a default initializer
3917 of EXPR_NULL,... by default, the static nullify is not needed
3918 since this is done every time we come into scope. */
3919 if (!c->expr || cm->attr.allocatable)
3922 val = gfc_conv_initializer (c->expr, &cm->ts,
3923 TREE_TYPE (cm->backend_decl), cm->attr.dimension,
3924 cm->attr.pointer || cm->attr.proc_pointer);
3926 /* Append it to the constructor list. */
3927 CONSTRUCTOR_APPEND_ELT (v, cm->backend_decl, val);
3929 se->expr = build_constructor (type, v);
3931 TREE_CONSTANT (se->expr) = 1;
3935 /* Translate a substring expression. */
3938 gfc_conv_substring_expr (gfc_se * se, gfc_expr * expr)
3944 gcc_assert (ref == NULL || ref->type == REF_SUBSTRING);
3946 se->expr = gfc_build_wide_string_const (expr->ts.kind,
3947 expr->value.character.length,
3948 expr->value.character.string);
3950 se->string_length = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (se->expr)));
3951 TYPE_STRING_FLAG (TREE_TYPE (se->expr)) = 1;
3954 gfc_conv_substring (se, ref, expr->ts.kind, NULL, &expr->where);
3958 /* Entry point for expression translation. Evaluates a scalar quantity.
3959 EXPR is the expression to be translated, and SE is the state structure if
3960 called from within the scalarized. */
3963 gfc_conv_expr (gfc_se * se, gfc_expr * expr)
3965 if (se->ss && se->ss->expr == expr
3966 && (se->ss->type == GFC_SS_SCALAR || se->ss->type == GFC_SS_REFERENCE))
3968 /* Substitute a scalar expression evaluated outside the scalarization
3970 se->expr = se->ss->data.scalar.expr;
3971 se->string_length = se->ss->string_length;
3972 gfc_advance_se_ss_chain (se);
3976 /* We need to convert the expressions for the iso_c_binding derived types.
3977 C_NULL_PTR and C_NULL_FUNPTR will be made EXPR_NULL, which evaluates to
3978 null_pointer_node. C_PTR and C_FUNPTR are converted to match the
3979 typespec for the C_PTR and C_FUNPTR symbols, which has already been
3980 updated to be an integer with a kind equal to the size of a (void *). */
3981 if (expr->ts.type == BT_DERIVED && expr->ts.derived
3982 && expr->ts.derived->attr.is_iso_c)
3984 if (expr->symtree->n.sym->intmod_sym_id == ISOCBINDING_NULL_PTR
3985 || expr->symtree->n.sym->intmod_sym_id == ISOCBINDING_NULL_FUNPTR)
3987 /* Set expr_type to EXPR_NULL, which will result in
3988 null_pointer_node being used below. */
3989 expr->expr_type = EXPR_NULL;
3993 /* Update the type/kind of the expression to be what the new
3994 type/kind are for the updated symbols of C_PTR/C_FUNPTR. */
3995 expr->ts.type = expr->ts.derived->ts.type;
3996 expr->ts.f90_type = expr->ts.derived->ts.f90_type;
3997 expr->ts.kind = expr->ts.derived->ts.kind;
4001 switch (expr->expr_type)
4004 gfc_conv_expr_op (se, expr);
4008 gfc_conv_function_expr (se, expr);
4012 gfc_conv_constant (se, expr);
4016 gfc_conv_variable (se, expr);
4020 se->expr = null_pointer_node;
4023 case EXPR_SUBSTRING:
4024 gfc_conv_substring_expr (se, expr);
4027 case EXPR_STRUCTURE:
4028 gfc_conv_structure (se, expr, 0);
4032 gfc_conv_array_constructor_expr (se, expr);
4041 /* Like gfc_conv_expr_val, but the value is also suitable for use in the lhs
4042 of an assignment. */
4044 gfc_conv_expr_lhs (gfc_se * se, gfc_expr * expr)
4046 gfc_conv_expr (se, expr);
4047 /* All numeric lvalues should have empty post chains. If not we need to
4048 figure out a way of rewriting an lvalue so that it has no post chain. */
4049 gcc_assert (expr->ts.type == BT_CHARACTER || !se->post.head);
4052 /* Like gfc_conv_expr, but the POST block is guaranteed to be empty for
4053 numeric expressions. Used for scalar values where inserting cleanup code
4056 gfc_conv_expr_val (gfc_se * se, gfc_expr * expr)
4060 gcc_assert (expr->ts.type != BT_CHARACTER);
4061 gfc_conv_expr (se, expr);
4064 val = gfc_create_var (TREE_TYPE (se->expr), NULL);
4065 gfc_add_modify (&se->pre, val, se->expr);
4067 gfc_add_block_to_block (&se->pre, &se->post);
4071 /* Helper to translate an expression and convert it to a particular type. */
4073 gfc_conv_expr_type (gfc_se * se, gfc_expr * expr, tree type)
4075 gfc_conv_expr_val (se, expr);
4076 se->expr = convert (type, se->expr);
4080 /* Converts an expression so that it can be passed by reference. Scalar
4084 gfc_conv_expr_reference (gfc_se * se, gfc_expr * expr)
4088 if (se->ss && se->ss->expr == expr
4089 && se->ss->type == GFC_SS_REFERENCE)
4091 se->expr = se->ss->data.scalar.expr;
4092 se->string_length = se->ss->string_length;
4093 gfc_advance_se_ss_chain (se);
4097 if (expr->ts.type == BT_CHARACTER)
4099 gfc_conv_expr (se, expr);
4100 gfc_conv_string_parameter (se);
4104 if (expr->expr_type == EXPR_VARIABLE)
4106 se->want_pointer = 1;
4107 gfc_conv_expr (se, expr);
4110 var = gfc_create_var (TREE_TYPE (se->expr), NULL);
4111 gfc_add_modify (&se->pre, var, se->expr);
4112 gfc_add_block_to_block (&se->pre, &se->post);
4118 if (expr->expr_type == EXPR_FUNCTION
4119 && expr->symtree->n.sym->attr.pointer
4120 && !expr->symtree->n.sym->attr.dimension)
4122 se->want_pointer = 1;
4123 gfc_conv_expr (se, expr);
4124 var = gfc_create_var (TREE_TYPE (se->expr), NULL);
4125 gfc_add_modify (&se->pre, var, se->expr);
4131 gfc_conv_expr (se, expr);
4133 /* Create a temporary var to hold the value. */
4134 if (TREE_CONSTANT (se->expr))
4136 tree tmp = se->expr;
4137 STRIP_TYPE_NOPS (tmp);
4138 var = build_decl (input_location,
4139 CONST_DECL, NULL, TREE_TYPE (tmp));
4140 DECL_INITIAL (var) = tmp;
4141 TREE_STATIC (var) = 1;
4146 var = gfc_create_var (TREE_TYPE (se->expr), NULL);
4147 gfc_add_modify (&se->pre, var, se->expr);
4149 gfc_add_block_to_block (&se->pre, &se->post);
4151 /* Take the address of that value. */
4152 se->expr = gfc_build_addr_expr (NULL_TREE, var);
4157 gfc_trans_pointer_assign (gfc_code * code)
4159 return gfc_trans_pointer_assignment (code->expr1, code->expr2);
4163 /* Generate code for a pointer assignment. */
4166 gfc_trans_pointer_assignment (gfc_expr * expr1, gfc_expr * expr2)
4177 gfc_start_block (&block);
4179 gfc_init_se (&lse, NULL);
4181 lss = gfc_walk_expr (expr1);
4182 rss = gfc_walk_expr (expr2);
4183 if (lss == gfc_ss_terminator)
4185 /* Scalar pointers. */
4186 lse.want_pointer = 1;
4187 gfc_conv_expr (&lse, expr1);
4188 gcc_assert (rss == gfc_ss_terminator);
4189 gfc_init_se (&rse, NULL);
4190 rse.want_pointer = 1;
4191 gfc_conv_expr (&rse, expr2);
4193 if (expr1->symtree->n.sym->attr.proc_pointer
4194 && expr1->symtree->n.sym->attr.dummy)
4195 lse.expr = build_fold_indirect_ref (lse.expr);
4197 if (expr2->symtree && expr2->symtree->n.sym->attr.proc_pointer
4198 && expr2->symtree->n.sym->attr.dummy)
4199 rse.expr = build_fold_indirect_ref (rse.expr);
4201 gfc_add_block_to_block (&block, &lse.pre);
4202 gfc_add_block_to_block (&block, &rse.pre);
4204 /* Check character lengths if character expression. The test is only
4205 really added if -fbounds-check is enabled. */
4206 if (expr1->ts.type == BT_CHARACTER && expr2->expr_type != EXPR_NULL)
4208 gcc_assert (expr2->ts.type == BT_CHARACTER);
4209 gcc_assert (lse.string_length && rse.string_length);
4210 gfc_trans_same_strlen_check ("pointer assignment", &expr1->where,
4211 lse.string_length, rse.string_length,
4215 gfc_add_modify (&block, lse.expr,
4216 fold_convert (TREE_TYPE (lse.expr), rse.expr));
4218 gfc_add_block_to_block (&block, &rse.post);
4219 gfc_add_block_to_block (&block, &lse.post);
4224 tree strlen_rhs = NULL_TREE;
4226 /* Array pointer. */
4227 gfc_conv_expr_descriptor (&lse, expr1, lss);
4228 strlen_lhs = lse.string_length;
4229 switch (expr2->expr_type)
4232 /* Just set the data pointer to null. */
4233 gfc_conv_descriptor_data_set (&lse.pre, lse.expr, null_pointer_node);
4237 /* Assign directly to the pointer's descriptor. */
4238 lse.direct_byref = 1;
4239 gfc_conv_expr_descriptor (&lse, expr2, rss);
4240 strlen_rhs = lse.string_length;
4242 /* If this is a subreference array pointer assignment, use the rhs
4243 descriptor element size for the lhs span. */
4244 if (expr1->symtree->n.sym->attr.subref_array_pointer)
4246 decl = expr1->symtree->n.sym->backend_decl;
4247 gfc_init_se (&rse, NULL);
4248 rse.descriptor_only = 1;
4249 gfc_conv_expr (&rse, expr2);
4250 tmp = gfc_get_element_type (TREE_TYPE (rse.expr));
4251 tmp = fold_convert (gfc_array_index_type, size_in_bytes (tmp));
4252 if (!INTEGER_CST_P (tmp))
4253 gfc_add_block_to_block (&lse.post, &rse.pre);
4254 gfc_add_modify (&lse.post, GFC_DECL_SPAN(decl), tmp);
4260 /* Assign to a temporary descriptor and then copy that
4261 temporary to the pointer. */
4263 tmp = gfc_create_var (TREE_TYPE (desc), "ptrtemp");
4266 lse.direct_byref = 1;
4267 gfc_conv_expr_descriptor (&lse, expr2, rss);
4268 strlen_rhs = lse.string_length;
4269 gfc_add_modify (&lse.pre, desc, tmp);
4273 gfc_add_block_to_block (&block, &lse.pre);
4275 /* Check string lengths if applicable. The check is only really added
4276 to the output code if -fbounds-check is enabled. */
4277 if (expr1->ts.type == BT_CHARACTER && expr2->expr_type != EXPR_NULL)
4279 gcc_assert (expr2->ts.type == BT_CHARACTER);
4280 gcc_assert (strlen_lhs && strlen_rhs);
4281 gfc_trans_same_strlen_check ("pointer assignment", &expr1->where,
4282 strlen_lhs, strlen_rhs, &block);
4285 gfc_add_block_to_block (&block, &lse.post);
4287 return gfc_finish_block (&block);
4291 /* Makes sure se is suitable for passing as a function string parameter. */
4292 /* TODO: Need to check all callers of this function. It may be abused. */
4295 gfc_conv_string_parameter (gfc_se * se)
4299 if (TREE_CODE (se->expr) == STRING_CST)
4301 type = TREE_TYPE (TREE_TYPE (se->expr));
4302 se->expr = gfc_build_addr_expr (build_pointer_type (type), se->expr);
4306 if (TYPE_STRING_FLAG (TREE_TYPE (se->expr)))
4308 if (TREE_CODE (se->expr) != INDIRECT_REF)
4310 type = TREE_TYPE (se->expr);
4311 se->expr = gfc_build_addr_expr (build_pointer_type (type), se->expr);
4315 type = gfc_get_character_type_len (gfc_default_character_kind,
4317 type = build_pointer_type (type);
4318 se->expr = gfc_build_addr_expr (type, se->expr);
4322 gcc_assert (POINTER_TYPE_P (TREE_TYPE (se->expr)));
4323 gcc_assert (se->string_length
4324 && TREE_CODE (TREE_TYPE (se->string_length)) == INTEGER_TYPE);
4328 /* Generate code for assignment of scalar variables. Includes character
4329 strings and derived types with allocatable components. */
4332 gfc_trans_scalar_assign (gfc_se * lse, gfc_se * rse, gfc_typespec ts,
4333 bool l_is_temp, bool r_is_var)
4339 gfc_init_block (&block);
4341 if (ts.type == BT_CHARACTER)
4346 if (lse->string_length != NULL_TREE)
4348 gfc_conv_string_parameter (lse);
4349 gfc_add_block_to_block (&block, &lse->pre);
4350 llen = lse->string_length;
4353 if (rse->string_length != NULL_TREE)
4355 gcc_assert (rse->string_length != NULL_TREE);
4356 gfc_conv_string_parameter (rse);
4357 gfc_add_block_to_block (&block, &rse->pre);
4358 rlen = rse->string_length;
4361 gfc_trans_string_copy (&block, llen, lse->expr, ts.kind, rlen,
4362 rse->expr, ts.kind);
4364 else if (ts.type == BT_DERIVED && ts.derived->attr.alloc_comp)
4368 /* Are the rhs and the lhs the same? */
4371 cond = fold_build2 (EQ_EXPR, boolean_type_node,
4372 gfc_build_addr_expr (NULL_TREE, lse->expr),
4373 gfc_build_addr_expr (NULL_TREE, rse->expr));
4374 cond = gfc_evaluate_now (cond, &lse->pre);
4377 /* Deallocate the lhs allocated components as long as it is not
4378 the same as the rhs. This must be done following the assignment
4379 to prevent deallocating data that could be used in the rhs
4383 tmp = gfc_evaluate_now (lse->expr, &lse->pre);
4384 tmp = gfc_deallocate_alloc_comp (ts.derived, tmp, 0);
4386 tmp = build3_v (COND_EXPR, cond, build_empty_stmt (input_location),
4388 gfc_add_expr_to_block (&lse->post, tmp);
4391 gfc_add_block_to_block (&block, &rse->pre);
4392 gfc_add_block_to_block (&block, &lse->pre);
4394 gfc_add_modify (&block, lse->expr,
4395 fold_convert (TREE_TYPE (lse->expr), rse->expr));
4397 /* Do a deep copy if the rhs is a variable, if it is not the
4401 tmp = gfc_copy_alloc_comp (ts.derived, rse->expr, lse->expr, 0);
4402 tmp = build3_v (COND_EXPR, cond, build_empty_stmt (input_location),
4404 gfc_add_expr_to_block (&block, tmp);
4409 gfc_add_block_to_block (&block, &lse->pre);
4410 gfc_add_block_to_block (&block, &rse->pre);
4412 gfc_add_modify (&block, lse->expr,
4413 fold_convert (TREE_TYPE (lse->expr), rse->expr));
4416 gfc_add_block_to_block (&block, &lse->post);
4417 gfc_add_block_to_block (&block, &rse->post);
4419 return gfc_finish_block (&block);
4423 /* Try to translate array(:) = func (...), where func is a transformational
4424 array function, without using a temporary. Returns NULL is this isn't the
4428 gfc_trans_arrayfunc_assign (gfc_expr * expr1, gfc_expr * expr2)
4433 bool seen_array_ref;
4435 gfc_component *comp = NULL;
4437 /* The caller has already checked rank>0 and expr_type == EXPR_FUNCTION. */
4438 if (expr2->value.function.isym && !gfc_is_intrinsic_libcall (expr2))
4441 /* Elemental functions don't need a temporary anyway. */
4442 if (expr2->value.function.esym != NULL
4443 && expr2->value.function.esym->attr.elemental)
4446 /* Fail if rhs is not FULL or a contiguous section. */
4447 if (expr1->ref && !(gfc_full_array_ref_p (expr1->ref, &c) || c))
4450 /* Fail if EXPR1 can't be expressed as a descriptor. */
4451 if (gfc_ref_needs_temporary_p (expr1->ref))
4454 /* Functions returning pointers need temporaries. */
4455 if (expr2->symtree->n.sym->attr.pointer
4456 || expr2->symtree->n.sym->attr.allocatable)
4459 /* Character array functions need temporaries unless the
4460 character lengths are the same. */
4461 if (expr2->ts.type == BT_CHARACTER && expr2->rank > 0)
4463 if (expr1->ts.cl->length == NULL
4464 || expr1->ts.cl->length->expr_type != EXPR_CONSTANT)
4467 if (expr2->ts.cl->length == NULL
4468 || expr2->ts.cl->length->expr_type != EXPR_CONSTANT)
4471 if (mpz_cmp (expr1->ts.cl->length->value.integer,
4472 expr2->ts.cl->length->value.integer) != 0)
4476 /* Check that no LHS component references appear during an array
4477 reference. This is needed because we do not have the means to
4478 span any arbitrary stride with an array descriptor. This check
4479 is not needed for the rhs because the function result has to be
4481 seen_array_ref = false;
4482 for (ref = expr1->ref; ref; ref = ref->next)
4484 if (ref->type == REF_ARRAY)
4485 seen_array_ref= true;
4486 else if (ref->type == REF_COMPONENT && seen_array_ref)
4490 /* Check for a dependency. */
4491 if (gfc_check_fncall_dependency (expr1, INTENT_OUT,
4492 expr2->value.function.esym,
4493 expr2->value.function.actual,
4497 /* The frontend doesn't seem to bother filling in expr->symtree for intrinsic
4499 gcc_assert (expr2->value.function.isym
4500 || (gfc_is_proc_ptr_comp (expr2, &comp)
4501 && comp && comp->attr.dimension)
4502 || (!comp && gfc_return_by_reference (expr2->value.function.esym)
4503 && expr2->value.function.esym->result->attr.dimension));
4505 ss = gfc_walk_expr (expr1);
4506 gcc_assert (ss != gfc_ss_terminator);
4507 gfc_init_se (&se, NULL);
4508 gfc_start_block (&se.pre);
4509 se.want_pointer = 1;
4511 gfc_conv_array_parameter (&se, expr1, ss, 0, NULL, NULL, NULL);
4513 se.direct_byref = 1;
4514 se.ss = gfc_walk_expr (expr2);
4515 gcc_assert (se.ss != gfc_ss_terminator);
4516 gfc_conv_function_expr (&se, expr2);
4517 gfc_add_block_to_block (&se.pre, &se.post);
4519 return gfc_finish_block (&se.pre);
4522 /* Determine whether the given EXPR_CONSTANT is a zero initializer. */
4525 is_zero_initializer_p (gfc_expr * expr)
4527 if (expr->expr_type != EXPR_CONSTANT)
4530 /* We ignore constants with prescribed memory representations for now. */
4531 if (expr->representation.string)
4534 switch (expr->ts.type)
4537 return mpz_cmp_si (expr->value.integer, 0) == 0;
4540 return mpfr_zero_p (expr->value.real)
4541 && MPFR_SIGN (expr->value.real) >= 0;
4544 return expr->value.logical == 0;
4547 return mpfr_zero_p (mpc_realref (expr->value.complex))
4548 && MPFR_SIGN (mpc_realref (expr->value.complex)) >= 0
4549 && mpfr_zero_p (mpc_imagref (expr->value.complex))
4550 && MPFR_SIGN (mpc_imagref (expr->value.complex)) >= 0;
4558 /* Try to efficiently translate array(:) = 0. Return NULL if this
4562 gfc_trans_zero_assign (gfc_expr * expr)
4564 tree dest, len, type;
4568 sym = expr->symtree->n.sym;
4569 dest = gfc_get_symbol_decl (sym);
4571 type = TREE_TYPE (dest);
4572 if (POINTER_TYPE_P (type))
4573 type = TREE_TYPE (type);
4574 if (!GFC_ARRAY_TYPE_P (type))
4577 /* Determine the length of the array. */
4578 len = GFC_TYPE_ARRAY_SIZE (type);
4579 if (!len || TREE_CODE (len) != INTEGER_CST)
4582 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (type));
4583 len = fold_build2 (MULT_EXPR, gfc_array_index_type, len,
4584 fold_convert (gfc_array_index_type, tmp));
4586 /* If we are zeroing a local array avoid taking its address by emitting
4588 if (!POINTER_TYPE_P (TREE_TYPE (dest)))
4589 return build2 (MODIFY_EXPR, void_type_node,
4590 dest, build_constructor (TREE_TYPE (dest), NULL));
4592 /* Convert arguments to the correct types. */
4593 dest = fold_convert (pvoid_type_node, dest);
4594 len = fold_convert (size_type_node, len);
4596 /* Construct call to __builtin_memset. */
4597 tmp = build_call_expr (built_in_decls[BUILT_IN_MEMSET],
4598 3, dest, integer_zero_node, len);
4599 return fold_convert (void_type_node, tmp);
4603 /* Helper for gfc_trans_array_copy and gfc_trans_array_constructor_copy
4604 that constructs the call to __builtin_memcpy. */
4607 gfc_build_memcpy_call (tree dst, tree src, tree len)
4611 /* Convert arguments to the correct types. */
4612 if (!POINTER_TYPE_P (TREE_TYPE (dst)))
4613 dst = gfc_build_addr_expr (pvoid_type_node, dst);
4615 dst = fold_convert (pvoid_type_node, dst);
4617 if (!POINTER_TYPE_P (TREE_TYPE (src)))
4618 src = gfc_build_addr_expr (pvoid_type_node, src);
4620 src = fold_convert (pvoid_type_node, src);
4622 len = fold_convert (size_type_node, len);
4624 /* Construct call to __builtin_memcpy. */
4625 tmp = build_call_expr (built_in_decls[BUILT_IN_MEMCPY], 3, dst, src, len);
4626 return fold_convert (void_type_node, tmp);
4630 /* Try to efficiently translate dst(:) = src(:). Return NULL if this
4631 can't be done. EXPR1 is the destination/lhs and EXPR2 is the
4632 source/rhs, both are gfc_full_array_ref_p which have been checked for
4636 gfc_trans_array_copy (gfc_expr * expr1, gfc_expr * expr2)
4638 tree dst, dlen, dtype;
4639 tree src, slen, stype;
4642 dst = gfc_get_symbol_decl (expr1->symtree->n.sym);
4643 src = gfc_get_symbol_decl (expr2->symtree->n.sym);
4645 dtype = TREE_TYPE (dst);
4646 if (POINTER_TYPE_P (dtype))
4647 dtype = TREE_TYPE (dtype);
4648 stype = TREE_TYPE (src);
4649 if (POINTER_TYPE_P (stype))
4650 stype = TREE_TYPE (stype);
4652 if (!GFC_ARRAY_TYPE_P (dtype) || !GFC_ARRAY_TYPE_P (stype))
4655 /* Determine the lengths of the arrays. */
4656 dlen = GFC_TYPE_ARRAY_SIZE (dtype);
4657 if (!dlen || TREE_CODE (dlen) != INTEGER_CST)
4659 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (dtype));
4660 dlen = fold_build2 (MULT_EXPR, gfc_array_index_type, dlen,
4661 fold_convert (gfc_array_index_type, tmp));
4663 slen = GFC_TYPE_ARRAY_SIZE (stype);
4664 if (!slen || TREE_CODE (slen) != INTEGER_CST)
4666 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (stype));
4667 slen = fold_build2 (MULT_EXPR, gfc_array_index_type, slen,
4668 fold_convert (gfc_array_index_type, tmp));
4670 /* Sanity check that they are the same. This should always be
4671 the case, as we should already have checked for conformance. */
4672 if (!tree_int_cst_equal (slen, dlen))
4675 return gfc_build_memcpy_call (dst, src, dlen);
4679 /* Try to efficiently translate array(:) = (/ ... /). Return NULL if
4680 this can't be done. EXPR1 is the destination/lhs for which
4681 gfc_full_array_ref_p is true, and EXPR2 is the source/rhs. */
4684 gfc_trans_array_constructor_copy (gfc_expr * expr1, gfc_expr * expr2)
4686 unsigned HOST_WIDE_INT nelem;
4692 nelem = gfc_constant_array_constructor_p (expr2->value.constructor);
4696 dst = gfc_get_symbol_decl (expr1->symtree->n.sym);
4697 dtype = TREE_TYPE (dst);
4698 if (POINTER_TYPE_P (dtype))
4699 dtype = TREE_TYPE (dtype);
4700 if (!GFC_ARRAY_TYPE_P (dtype))
4703 /* Determine the lengths of the array. */
4704 len = GFC_TYPE_ARRAY_SIZE (dtype);
4705 if (!len || TREE_CODE (len) != INTEGER_CST)
4708 /* Confirm that the constructor is the same size. */
4709 if (compare_tree_int (len, nelem) != 0)
4712 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (dtype));
4713 len = fold_build2 (MULT_EXPR, gfc_array_index_type, len,
4714 fold_convert (gfc_array_index_type, tmp));
4716 stype = gfc_typenode_for_spec (&expr2->ts);
4717 src = gfc_build_constant_array_constructor (expr2, stype);
4719 stype = TREE_TYPE (src);
4720 if (POINTER_TYPE_P (stype))
4721 stype = TREE_TYPE (stype);
4723 return gfc_build_memcpy_call (dst, src, len);
4727 /* Subroutine of gfc_trans_assignment that actually scalarizes the
4728 assignment. EXPR1 is the destination/RHS and EXPR2 is the source/LHS. */
4731 gfc_trans_assignment_1 (gfc_expr * expr1, gfc_expr * expr2, bool init_flag)
4736 gfc_ss *lss_section;
4743 bool scalar_to_array;
4746 /* Assignment of the form lhs = rhs. */
4747 gfc_start_block (&block);
4749 gfc_init_se (&lse, NULL);
4750 gfc_init_se (&rse, NULL);
4753 lss = gfc_walk_expr (expr1);
4755 if (lss != gfc_ss_terminator)
4757 /* Allow the scalarizer to workshare array assignments. */
4758 if (ompws_flags & OMPWS_WORKSHARE_FLAG)
4759 ompws_flags |= OMPWS_SCALARIZER_WS;
4761 /* The assignment needs scalarization. */
4764 /* Find a non-scalar SS from the lhs. */
4765 while (lss_section != gfc_ss_terminator
4766 && lss_section->type != GFC_SS_SECTION)
4767 lss_section = lss_section->next;
4769 gcc_assert (lss_section != gfc_ss_terminator);
4771 /* Initialize the scalarizer. */
4772 gfc_init_loopinfo (&loop);
4775 rss = gfc_walk_expr (expr2);
4776 if (rss == gfc_ss_terminator)
4778 /* The rhs is scalar. Add a ss for the expression. */
4779 rss = gfc_get_ss ();
4780 rss->next = gfc_ss_terminator;
4781 rss->type = GFC_SS_SCALAR;
4784 /* Associate the SS with the loop. */
4785 gfc_add_ss_to_loop (&loop, lss);
4786 gfc_add_ss_to_loop (&loop, rss);
4788 /* Calculate the bounds of the scalarization. */
4789 gfc_conv_ss_startstride (&loop);
4790 /* Resolve any data dependencies in the statement. */
4791 gfc_conv_resolve_dependencies (&loop, lss, rss);
4792 /* Setup the scalarizing loops. */
4793 gfc_conv_loop_setup (&loop, &expr2->where);
4795 /* Setup the gfc_se structures. */
4796 gfc_copy_loopinfo_to_se (&lse, &loop);
4797 gfc_copy_loopinfo_to_se (&rse, &loop);
4800 gfc_mark_ss_chain_used (rss, 1);
4801 if (loop.temp_ss == NULL)
4804 gfc_mark_ss_chain_used (lss, 1);
4808 lse.ss = loop.temp_ss;
4809 gfc_mark_ss_chain_used (lss, 3);
4810 gfc_mark_ss_chain_used (loop.temp_ss, 3);
4813 /* Start the scalarized loop body. */
4814 gfc_start_scalarized_body (&loop, &body);
4817 gfc_init_block (&body);
4819 l_is_temp = (lss != gfc_ss_terminator && loop.temp_ss != NULL);
4821 /* Translate the expression. */
4822 gfc_conv_expr (&rse, expr2);
4824 /* Stabilize a string length for temporaries. */
4825 if (expr2->ts.type == BT_CHARACTER)
4826 string_length = gfc_evaluate_now (rse.string_length, &rse.pre);
4828 string_length = NULL_TREE;
4832 gfc_conv_tmp_array_ref (&lse);
4833 gfc_advance_se_ss_chain (&lse);
4834 if (expr2->ts.type == BT_CHARACTER)
4835 lse.string_length = string_length;
4838 gfc_conv_expr (&lse, expr1);
4840 /* Assignments of scalar derived types with allocatable components
4841 to arrays must be done with a deep copy and the rhs temporary
4842 must have its components deallocated afterwards. */
4843 scalar_to_array = (expr2->ts.type == BT_DERIVED
4844 && expr2->ts.derived->attr.alloc_comp
4845 && expr2->expr_type != EXPR_VARIABLE
4846 && !gfc_is_constant_expr (expr2)
4847 && expr1->rank && !expr2->rank);
4848 if (scalar_to_array)
4850 tmp = gfc_deallocate_alloc_comp (expr2->ts.derived, rse.expr, 0);
4851 gfc_add_expr_to_block (&loop.post, tmp);
4854 tmp = gfc_trans_scalar_assign (&lse, &rse, expr1->ts,
4855 l_is_temp || init_flag,
4856 (expr2->expr_type == EXPR_VARIABLE)
4857 || scalar_to_array);
4858 gfc_add_expr_to_block (&body, tmp);
4860 if (lss == gfc_ss_terminator)
4862 /* Use the scalar assignment as is. */
4863 gfc_add_block_to_block (&block, &body);
4867 gcc_assert (lse.ss == gfc_ss_terminator
4868 && rse.ss == gfc_ss_terminator);
4872 gfc_trans_scalarized_loop_boundary (&loop, &body);
4874 /* We need to copy the temporary to the actual lhs. */
4875 gfc_init_se (&lse, NULL);
4876 gfc_init_se (&rse, NULL);
4877 gfc_copy_loopinfo_to_se (&lse, &loop);
4878 gfc_copy_loopinfo_to_se (&rse, &loop);
4880 rse.ss = loop.temp_ss;
4883 gfc_conv_tmp_array_ref (&rse);
4884 gfc_advance_se_ss_chain (&rse);
4885 gfc_conv_expr (&lse, expr1);
4887 gcc_assert (lse.ss == gfc_ss_terminator
4888 && rse.ss == gfc_ss_terminator);
4890 if (expr2->ts.type == BT_CHARACTER)
4891 rse.string_length = string_length;
4893 tmp = gfc_trans_scalar_assign (&lse, &rse, expr1->ts,
4895 gfc_add_expr_to_block (&body, tmp);
4898 /* Generate the copying loops. */
4899 gfc_trans_scalarizing_loops (&loop, &body);
4901 /* Wrap the whole thing up. */
4902 gfc_add_block_to_block (&block, &loop.pre);
4903 gfc_add_block_to_block (&block, &loop.post);
4905 gfc_cleanup_loop (&loop);
4908 return gfc_finish_block (&block);
4912 /* Check whether EXPR is a copyable array. */
4915 copyable_array_p (gfc_expr * expr)
4917 if (expr->expr_type != EXPR_VARIABLE)
4920 /* First check it's an array. */
4921 if (expr->rank < 1 || !expr->ref || expr->ref->next)
4924 if (!gfc_full_array_ref_p (expr->ref, NULL))
4927 /* Next check that it's of a simple enough type. */
4928 switch (expr->ts.type)
4940 return !expr->ts.derived->attr.alloc_comp;
4949 /* Translate an assignment. */
4952 gfc_trans_assignment (gfc_expr * expr1, gfc_expr * expr2, bool init_flag)
4956 /* Special case a single function returning an array. */
4957 if (expr2->expr_type == EXPR_FUNCTION && expr2->rank > 0)
4959 tmp = gfc_trans_arrayfunc_assign (expr1, expr2);
4964 /* Special case assigning an array to zero. */
4965 if (copyable_array_p (expr1)
4966 && is_zero_initializer_p (expr2))
4968 tmp = gfc_trans_zero_assign (expr1);
4973 /* Special case copying one array to another. */
4974 if (copyable_array_p (expr1)
4975 && copyable_array_p (expr2)
4976 && gfc_compare_types (&expr1->ts, &expr2->ts)
4977 && !gfc_check_dependency (expr1, expr2, 0))
4979 tmp = gfc_trans_array_copy (expr1, expr2);
4984 /* Special case initializing an array from a constant array constructor. */
4985 if (copyable_array_p (expr1)
4986 && expr2->expr_type == EXPR_ARRAY
4987 && gfc_compare_types (&expr1->ts, &expr2->ts))
4989 tmp = gfc_trans_array_constructor_copy (expr1, expr2);
4994 /* Fallback to the scalarizer to generate explicit loops. */
4995 return gfc_trans_assignment_1 (expr1, expr2, init_flag);
4999 gfc_trans_init_assign (gfc_code * code)
5001 return gfc_trans_assignment (code->expr1, code->expr2, true);
5005 gfc_trans_assign (gfc_code * code)
5007 return gfc_trans_assignment (code->expr1, code->expr2, false);