1 /* Expression translation
2 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008
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, integer_one_node);
165 tmp = gfc_evaluate_now (tmp, &se->pre);
166 se->expr = build_fold_addr_expr (tmp);
170 tmp = build3 (COND_EXPR, TREE_TYPE (se->expr), present, se->expr,
171 fold_convert (TREE_TYPE (se->expr), integer_zero_node));
172 tmp = gfc_evaluate_now (tmp, &se->pre);
176 if (ts.type == BT_CHARACTER)
178 tmp = build_int_cst (gfc_charlen_type_node, 0);
179 tmp = fold_build3 (COND_EXPR, gfc_charlen_type_node,
180 present, se->string_length, tmp);
181 tmp = gfc_evaluate_now (tmp, &se->pre);
182 se->string_length = tmp;
188 /* Get the character length of an expression, looking through gfc_refs
192 gfc_get_expr_charlen (gfc_expr *e)
197 gcc_assert (e->expr_type == EXPR_VARIABLE
198 && e->ts.type == BT_CHARACTER);
200 length = NULL; /* To silence compiler warning. */
202 if (is_subref_array (e) && e->ts.cl->length)
205 gfc_init_se (&tmpse, NULL);
206 gfc_conv_expr_type (&tmpse, e->ts.cl->length, gfc_charlen_type_node);
207 e->ts.cl->backend_decl = tmpse.expr;
211 /* First candidate: if the variable is of type CHARACTER, the
212 expression's length could be the length of the character
214 if (e->symtree->n.sym->ts.type == BT_CHARACTER)
215 length = e->symtree->n.sym->ts.cl->backend_decl;
217 /* Look through the reference chain for component references. */
218 for (r = e->ref; r; r = r->next)
223 if (r->u.c.component->ts.type == BT_CHARACTER)
224 length = r->u.c.component->ts.cl->backend_decl;
232 /* We should never got substring references here. These will be
233 broken down by the scalarizer. */
239 gcc_assert (length != NULL);
245 /* Generate code to initialize a string length variable. Returns the
249 gfc_conv_string_length (gfc_charlen * cl, stmtblock_t * pblock)
253 gfc_init_se (&se, NULL);
254 gfc_conv_expr_type (&se, cl->length, gfc_charlen_type_node);
255 se.expr = fold_build2 (MAX_EXPR, gfc_charlen_type_node, se.expr,
256 build_int_cst (gfc_charlen_type_node, 0));
257 gfc_add_block_to_block (pblock, &se.pre);
259 if (cl->backend_decl)
260 gfc_add_modify (pblock, cl->backend_decl, se.expr);
262 cl->backend_decl = gfc_evaluate_now (se.expr, pblock);
267 gfc_conv_substring (gfc_se * se, gfc_ref * ref, int kind,
268 const char *name, locus *where)
278 type = gfc_get_character_type (kind, ref->u.ss.length);
279 type = build_pointer_type (type);
282 gfc_init_se (&start, se);
283 gfc_conv_expr_type (&start, ref->u.ss.start, gfc_charlen_type_node);
284 gfc_add_block_to_block (&se->pre, &start.pre);
286 if (integer_onep (start.expr))
287 gfc_conv_string_parameter (se);
290 /* Avoid multiple evaluation of substring start. */
291 if (!CONSTANT_CLASS_P (start.expr) && !DECL_P (start.expr))
292 start.expr = gfc_evaluate_now (start.expr, &se->pre);
294 /* Change the start of the string. */
295 if (TYPE_STRING_FLAG (TREE_TYPE (se->expr)))
298 tmp = build_fold_indirect_ref (se->expr);
299 tmp = gfc_build_array_ref (tmp, start.expr, NULL);
300 se->expr = gfc_build_addr_expr (type, tmp);
303 /* Length = end + 1 - start. */
304 gfc_init_se (&end, se);
305 if (ref->u.ss.end == NULL)
306 end.expr = se->string_length;
309 gfc_conv_expr_type (&end, ref->u.ss.end, gfc_charlen_type_node);
310 gfc_add_block_to_block (&se->pre, &end.pre);
312 if (!CONSTANT_CLASS_P (end.expr) && !DECL_P (end.expr))
313 end.expr = gfc_evaluate_now (end.expr, &se->pre);
315 if (flag_bounds_check)
317 tree nonempty = fold_build2 (LE_EXPR, boolean_type_node,
318 start.expr, end.expr);
320 /* Check lower bound. */
321 fault = fold_build2 (LT_EXPR, boolean_type_node, start.expr,
322 build_int_cst (gfc_charlen_type_node, 1));
323 fault = fold_build2 (TRUTH_ANDIF_EXPR, boolean_type_node,
326 asprintf (&msg, "Substring out of bounds: lower bound (%%ld) of '%s' "
327 "is less than one", name);
329 asprintf (&msg, "Substring out of bounds: lower bound (%%ld)"
331 gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg,
332 fold_convert (long_integer_type_node,
336 /* Check upper bound. */
337 fault = fold_build2 (GT_EXPR, boolean_type_node, end.expr,
339 fault = fold_build2 (TRUTH_ANDIF_EXPR, boolean_type_node,
342 asprintf (&msg, "Substring out of bounds: upper bound (%%ld) of '%s' "
343 "exceeds string length (%%ld)", name);
345 asprintf (&msg, "Substring out of bounds: upper bound (%%ld) "
346 "exceeds string length (%%ld)");
347 gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg,
348 fold_convert (long_integer_type_node, end.expr),
349 fold_convert (long_integer_type_node,
354 tmp = fold_build2 (MINUS_EXPR, gfc_charlen_type_node,
355 build_int_cst (gfc_charlen_type_node, 1),
357 tmp = fold_build2 (PLUS_EXPR, gfc_charlen_type_node, end.expr, tmp);
358 tmp = fold_build2 (MAX_EXPR, gfc_charlen_type_node, tmp,
359 build_int_cst (gfc_charlen_type_node, 0));
360 se->string_length = tmp;
364 /* Convert a derived type component reference. */
367 gfc_conv_component_ref (gfc_se * se, gfc_ref * ref)
374 c = ref->u.c.component;
376 gcc_assert (c->backend_decl);
378 field = c->backend_decl;
379 gcc_assert (TREE_CODE (field) == FIELD_DECL);
381 tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field), decl, field, NULL_TREE);
385 if (c->ts.type == BT_CHARACTER)
387 tmp = c->ts.cl->backend_decl;
388 /* Components must always be constant length. */
389 gcc_assert (tmp && INTEGER_CST_P (tmp));
390 se->string_length = tmp;
393 if (c->attr.pointer && c->attr.dimension == 0 && c->ts.type != BT_CHARACTER)
394 se->expr = build_fold_indirect_ref (se->expr);
398 /* This function deals with component references to components of the
399 parent type for derived type extensons. */
401 conv_parent_component_references (gfc_se * se, gfc_ref * ref)
409 c = ref->u.c.component;
411 /* Build a gfc_ref to recursively call gfc_conv_component_ref. */
412 parent.type = REF_COMPONENT;
415 parent.u.c.component = dt->components;
417 if (dt->attr.extension && dt->components)
419 /* Return if the component is not in the parent type. */
420 for (cmp = dt->components->next; cmp; cmp = cmp->next)
421 if (strcmp (c->name, cmp->name) == 0)
424 /* Otherwise build the reference and call self. */
425 gfc_conv_component_ref (se, &parent);
426 parent.u.c.sym = dt->components->ts.derived;
427 parent.u.c.component = c;
428 conv_parent_component_references (se, &parent);
432 /* Return the contents of a variable. Also handles reference/pointer
433 variables (all Fortran pointer references are implicit). */
436 gfc_conv_variable (gfc_se * se, gfc_expr * expr)
443 bool alternate_entry;
446 sym = expr->symtree->n.sym;
449 /* Check that something hasn't gone horribly wrong. */
450 gcc_assert (se->ss != gfc_ss_terminator);
451 gcc_assert (se->ss->expr == expr);
453 /* A scalarized term. We already know the descriptor. */
454 se->expr = se->ss->data.info.descriptor;
455 se->string_length = se->ss->string_length;
456 for (ref = se->ss->data.info.ref; ref; ref = ref->next)
457 if (ref->type == REF_ARRAY && ref->u.ar.type != AR_ELEMENT)
462 tree se_expr = NULL_TREE;
464 se->expr = gfc_get_symbol_decl (sym);
466 /* Deal with references to a parent results or entries by storing
467 the current_function_decl and moving to the parent_decl. */
468 return_value = sym->attr.function && sym->result == sym;
469 alternate_entry = sym->attr.function && sym->attr.entry
470 && sym->result == sym;
471 entry_master = sym->attr.result
472 && sym->ns->proc_name->attr.entry_master
473 && !gfc_return_by_reference (sym->ns->proc_name);
474 parent_decl = DECL_CONTEXT (current_function_decl);
476 if ((se->expr == parent_decl && return_value)
477 || (sym->ns && sym->ns->proc_name
479 && sym->ns->proc_name->backend_decl == parent_decl
480 && (alternate_entry || entry_master)))
485 /* Special case for assigning the return value of a function.
486 Self recursive functions must have an explicit return value. */
487 if (return_value && (se->expr == current_function_decl || parent_flag))
488 se_expr = gfc_get_fake_result_decl (sym, parent_flag);
490 /* Similarly for alternate entry points. */
491 else if (alternate_entry
492 && (sym->ns->proc_name->backend_decl == current_function_decl
495 gfc_entry_list *el = NULL;
497 for (el = sym->ns->entries; el; el = el->next)
500 se_expr = gfc_get_fake_result_decl (sym, parent_flag);
505 else if (entry_master
506 && (sym->ns->proc_name->backend_decl == current_function_decl
508 se_expr = gfc_get_fake_result_decl (sym, parent_flag);
513 /* Procedure actual arguments. */
514 else if (sym->attr.flavor == FL_PROCEDURE
515 && se->expr != current_function_decl)
517 if (!sym->attr.dummy && !sym->attr.proc_pointer)
519 gcc_assert (TREE_CODE (se->expr) == FUNCTION_DECL);
520 se->expr = build_fold_addr_expr (se->expr);
526 /* Dereference the expression, where needed. Since characters
527 are entirely different from other types, they are treated
529 if (sym->ts.type == BT_CHARACTER)
531 /* Dereference character pointer dummy arguments
533 if ((sym->attr.pointer || sym->attr.allocatable)
535 || sym->attr.function
536 || sym->attr.result))
537 se->expr = build_fold_indirect_ref (se->expr);
540 else if (!sym->attr.value)
542 /* Dereference non-character scalar dummy arguments. */
543 if (sym->attr.dummy && !sym->attr.dimension)
544 se->expr = build_fold_indirect_ref (se->expr);
546 /* Dereference scalar hidden result. */
547 if (gfc_option.flag_f2c && sym->ts.type == BT_COMPLEX
548 && (sym->attr.function || sym->attr.result)
549 && !sym->attr.dimension && !sym->attr.pointer
550 && !sym->attr.always_explicit)
551 se->expr = build_fold_indirect_ref (se->expr);
553 /* Dereference non-character pointer variables.
554 These must be dummies, results, or scalars. */
555 if ((sym->attr.pointer || sym->attr.allocatable)
557 || sym->attr.function
559 || !sym->attr.dimension))
560 se->expr = build_fold_indirect_ref (se->expr);
566 /* For character variables, also get the length. */
567 if (sym->ts.type == BT_CHARACTER)
569 /* If the character length of an entry isn't set, get the length from
570 the master function instead. */
571 if (sym->attr.entry && !sym->ts.cl->backend_decl)
572 se->string_length = sym->ns->proc_name->ts.cl->backend_decl;
574 se->string_length = sym->ts.cl->backend_decl;
575 gcc_assert (se->string_length);
583 /* Return the descriptor if that's what we want and this is an array
584 section reference. */
585 if (se->descriptor_only && ref->u.ar.type != AR_ELEMENT)
587 /* TODO: Pointers to single elements of array sections, eg elemental subs. */
588 /* Return the descriptor for array pointers and allocations. */
590 && ref->next == NULL && (se->descriptor_only))
593 gfc_conv_array_ref (se, &ref->u.ar, sym, &expr->where);
594 /* Return a pointer to an element. */
598 if (ref->u.c.sym->attr.extension)
599 conv_parent_component_references (se, ref);
601 gfc_conv_component_ref (se, ref);
605 gfc_conv_substring (se, ref, expr->ts.kind,
606 expr->symtree->name, &expr->where);
615 /* Pointer assignment, allocation or pass by reference. Arrays are handled
617 if (se->want_pointer)
619 if (expr->ts.type == BT_CHARACTER)
620 gfc_conv_string_parameter (se);
622 se->expr = build_fold_addr_expr (se->expr);
627 /* Unary ops are easy... Or they would be if ! was a valid op. */
630 gfc_conv_unary_op (enum tree_code code, gfc_se * se, gfc_expr * expr)
635 gcc_assert (expr->ts.type != BT_CHARACTER);
636 /* Initialize the operand. */
637 gfc_init_se (&operand, se);
638 gfc_conv_expr_val (&operand, expr->value.op.op1);
639 gfc_add_block_to_block (&se->pre, &operand.pre);
641 type = gfc_typenode_for_spec (&expr->ts);
643 /* TRUTH_NOT_EXPR is not a "true" unary operator in GCC.
644 We must convert it to a compare to 0 (e.g. EQ_EXPR (op1, 0)).
645 All other unary operators have an equivalent GIMPLE unary operator. */
646 if (code == TRUTH_NOT_EXPR)
647 se->expr = fold_build2 (EQ_EXPR, type, operand.expr,
648 build_int_cst (type, 0));
650 se->expr = fold_build1 (code, type, operand.expr);
654 /* Expand power operator to optimal multiplications when a value is raised
655 to a constant integer n. See section 4.6.3, "Evaluation of Powers" of
656 Donald E. Knuth, "Seminumerical Algorithms", Vol. 2, "The Art of Computer
657 Programming", 3rd Edition, 1998. */
659 /* This code is mostly duplicated from expand_powi in the backend.
660 We establish the "optimal power tree" lookup table with the defined size.
661 The items in the table are the exponents used to calculate the index
662 exponents. Any integer n less than the value can get an "addition chain",
663 with the first node being one. */
664 #define POWI_TABLE_SIZE 256
666 /* The table is from builtins.c. */
667 static const unsigned char powi_table[POWI_TABLE_SIZE] =
669 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */
670 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */
671 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */
672 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */
673 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */
674 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */
675 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */
676 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */
677 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */
678 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */
679 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */
680 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */
681 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */
682 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */
683 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */
684 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */
685 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */
686 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */
687 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */
688 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */
689 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */
690 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */
691 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */
692 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */
693 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */
694 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */
695 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */
696 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */
697 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */
698 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */
699 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */
700 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */
703 /* If n is larger than lookup table's max index, we use the "window
705 #define POWI_WINDOW_SIZE 3
707 /* Recursive function to expand the power operator. The temporary
708 values are put in tmpvar. The function returns tmpvar[1] ** n. */
710 gfc_conv_powi (gfc_se * se, unsigned HOST_WIDE_INT n, tree * tmpvar)
717 if (n < POWI_TABLE_SIZE)
722 op0 = gfc_conv_powi (se, n - powi_table[n], tmpvar);
723 op1 = gfc_conv_powi (se, powi_table[n], tmpvar);
727 digit = n & ((1 << POWI_WINDOW_SIZE) - 1);
728 op0 = gfc_conv_powi (se, n - digit, tmpvar);
729 op1 = gfc_conv_powi (se, digit, tmpvar);
733 op0 = gfc_conv_powi (se, n >> 1, tmpvar);
737 tmp = fold_build2 (MULT_EXPR, TREE_TYPE (op0), op0, op1);
738 tmp = gfc_evaluate_now (tmp, &se->pre);
740 if (n < POWI_TABLE_SIZE)
747 /* Expand lhs ** rhs. rhs is a constant integer. If it expands successfully,
748 return 1. Else return 0 and a call to runtime library functions
749 will have to be built. */
751 gfc_conv_cst_int_power (gfc_se * se, tree lhs, tree rhs)
756 tree vartmp[POWI_TABLE_SIZE];
758 unsigned HOST_WIDE_INT n;
761 /* If exponent is too large, we won't expand it anyway, so don't bother
762 with large integer values. */
763 if (!double_int_fits_in_shwi_p (TREE_INT_CST (rhs)))
766 m = double_int_to_shwi (TREE_INT_CST (rhs));
767 /* There's no ABS for HOST_WIDE_INT, so here we go. It also takes care
768 of the asymmetric range of the integer type. */
769 n = (unsigned HOST_WIDE_INT) (m < 0 ? -m : m);
771 type = TREE_TYPE (lhs);
772 sgn = tree_int_cst_sgn (rhs);
774 if (((FLOAT_TYPE_P (type) && !flag_unsafe_math_optimizations)
775 || optimize_size) && (m > 2 || m < -1))
781 se->expr = gfc_build_const (type, integer_one_node);
785 /* If rhs < 0 and lhs is an integer, the result is -1, 0 or 1. */
786 if ((sgn == -1) && (TREE_CODE (type) == INTEGER_TYPE))
788 tmp = fold_build2 (EQ_EXPR, boolean_type_node,
789 lhs, build_int_cst (TREE_TYPE (lhs), -1));
790 cond = fold_build2 (EQ_EXPR, boolean_type_node,
791 lhs, build_int_cst (TREE_TYPE (lhs), 1));
794 result = (lhs == 1 || lhs == -1) ? 1 : 0. */
797 tmp = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, tmp, cond);
798 se->expr = fold_build3 (COND_EXPR, type,
799 tmp, build_int_cst (type, 1),
800 build_int_cst (type, 0));
804 result = (lhs == 1) ? 1 : (lhs == -1) ? -1 : 0. */
805 tmp = fold_build3 (COND_EXPR, type, tmp, build_int_cst (type, -1),
806 build_int_cst (type, 0));
807 se->expr = fold_build3 (COND_EXPR, type,
808 cond, build_int_cst (type, 1), tmp);
812 memset (vartmp, 0, sizeof (vartmp));
816 tmp = gfc_build_const (type, integer_one_node);
817 vartmp[1] = fold_build2 (RDIV_EXPR, type, tmp, vartmp[1]);
820 se->expr = gfc_conv_powi (se, n, vartmp);
826 /* Power op (**). Constant integer exponent has special handling. */
829 gfc_conv_power_op (gfc_se * se, gfc_expr * expr)
831 tree gfc_int4_type_node;
838 gfc_init_se (&lse, se);
839 gfc_conv_expr_val (&lse, expr->value.op.op1);
840 lse.expr = gfc_evaluate_now (lse.expr, &lse.pre);
841 gfc_add_block_to_block (&se->pre, &lse.pre);
843 gfc_init_se (&rse, se);
844 gfc_conv_expr_val (&rse, expr->value.op.op2);
845 gfc_add_block_to_block (&se->pre, &rse.pre);
847 if (expr->value.op.op2->ts.type == BT_INTEGER
848 && expr->value.op.op2->expr_type == EXPR_CONSTANT)
849 if (gfc_conv_cst_int_power (se, lse.expr, rse.expr))
852 gfc_int4_type_node = gfc_get_int_type (4);
854 kind = expr->value.op.op1->ts.kind;
855 switch (expr->value.op.op2->ts.type)
858 ikind = expr->value.op.op2->ts.kind;
863 rse.expr = convert (gfc_int4_type_node, rse.expr);
885 if (expr->value.op.op1->ts.type == BT_INTEGER)
886 lse.expr = convert (gfc_int4_type_node, lse.expr);
911 switch (expr->value.op.op1->ts.type)
914 if (kind == 3) /* Case 16 was not handled properly above. */
916 fndecl = gfor_fndecl_math_powi[kind][ikind].integer;
920 /* Use builtins for real ** int4. */
926 fndecl = built_in_decls[BUILT_IN_POWIF];
930 fndecl = built_in_decls[BUILT_IN_POWI];
935 fndecl = built_in_decls[BUILT_IN_POWIL];
943 fndecl = gfor_fndecl_math_powi[kind][ikind].real;
947 fndecl = gfor_fndecl_math_powi[kind][ikind].cmplx;
959 fndecl = built_in_decls[BUILT_IN_POWF];
962 fndecl = built_in_decls[BUILT_IN_POW];
966 fndecl = built_in_decls[BUILT_IN_POWL];
977 fndecl = built_in_decls[BUILT_IN_CPOWF];
980 fndecl = built_in_decls[BUILT_IN_CPOW];
984 fndecl = built_in_decls[BUILT_IN_CPOWL];
996 se->expr = build_call_expr (fndecl, 2, lse.expr, rse.expr);
1000 /* Generate code to allocate a string temporary. */
1003 gfc_conv_string_tmp (gfc_se * se, tree type, tree len)
1008 gcc_assert (TREE_TYPE (len) == gfc_charlen_type_node);
1010 if (gfc_can_put_var_on_stack (len))
1012 /* Create a temporary variable to hold the result. */
1013 tmp = fold_build2 (MINUS_EXPR, gfc_charlen_type_node, len,
1014 build_int_cst (gfc_charlen_type_node, 1));
1015 tmp = build_range_type (gfc_array_index_type, gfc_index_zero_node, tmp);
1017 if (TREE_CODE (TREE_TYPE (type)) == ARRAY_TYPE)
1018 tmp = build_array_type (TREE_TYPE (TREE_TYPE (type)), tmp);
1020 tmp = build_array_type (TREE_TYPE (type), tmp);
1022 var = gfc_create_var (tmp, "str");
1023 var = gfc_build_addr_expr (type, var);
1027 /* Allocate a temporary to hold the result. */
1028 var = gfc_create_var (type, "pstr");
1029 tmp = gfc_call_malloc (&se->pre, type,
1030 fold_build2 (MULT_EXPR, TREE_TYPE (len), len,
1031 fold_convert (TREE_TYPE (len),
1032 TYPE_SIZE (type))));
1033 gfc_add_modify (&se->pre, var, tmp);
1035 /* Free the temporary afterwards. */
1036 tmp = gfc_call_free (convert (pvoid_type_node, var));
1037 gfc_add_expr_to_block (&se->post, tmp);
1044 /* Handle a string concatenation operation. A temporary will be allocated to
1048 gfc_conv_concat_op (gfc_se * se, gfc_expr * expr)
1051 tree len, type, var, tmp, fndecl;
1053 gcc_assert (expr->value.op.op1->ts.type == BT_CHARACTER
1054 && expr->value.op.op2->ts.type == BT_CHARACTER);
1055 gcc_assert (expr->value.op.op1->ts.kind == expr->value.op.op2->ts.kind);
1057 gfc_init_se (&lse, se);
1058 gfc_conv_expr (&lse, expr->value.op.op1);
1059 gfc_conv_string_parameter (&lse);
1060 gfc_init_se (&rse, se);
1061 gfc_conv_expr (&rse, expr->value.op.op2);
1062 gfc_conv_string_parameter (&rse);
1064 gfc_add_block_to_block (&se->pre, &lse.pre);
1065 gfc_add_block_to_block (&se->pre, &rse.pre);
1067 type = gfc_get_character_type (expr->ts.kind, expr->ts.cl);
1068 len = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
1069 if (len == NULL_TREE)
1071 len = fold_build2 (PLUS_EXPR, TREE_TYPE (lse.string_length),
1072 lse.string_length, rse.string_length);
1075 type = build_pointer_type (type);
1077 var = gfc_conv_string_tmp (se, type, len);
1079 /* Do the actual concatenation. */
1080 if (expr->ts.kind == 1)
1081 fndecl = gfor_fndecl_concat_string;
1082 else if (expr->ts.kind == 4)
1083 fndecl = gfor_fndecl_concat_string_char4;
1087 tmp = build_call_expr (fndecl, 6, len, var, lse.string_length, lse.expr,
1088 rse.string_length, rse.expr);
1089 gfc_add_expr_to_block (&se->pre, tmp);
1091 /* Add the cleanup for the operands. */
1092 gfc_add_block_to_block (&se->pre, &rse.post);
1093 gfc_add_block_to_block (&se->pre, &lse.post);
1096 se->string_length = len;
1099 /* Translates an op expression. Common (binary) cases are handled by this
1100 function, others are passed on. Recursion is used in either case.
1101 We use the fact that (op1.ts == op2.ts) (except for the power
1103 Operators need no special handling for scalarized expressions as long as
1104 they call gfc_conv_simple_val to get their operands.
1105 Character strings get special handling. */
1108 gfc_conv_expr_op (gfc_se * se, gfc_expr * expr)
1110 enum tree_code code;
1119 switch (expr->value.op.op)
1121 case INTRINSIC_PARENTHESES:
1122 if (expr->ts.type == BT_REAL
1123 || expr->ts.type == BT_COMPLEX)
1125 gfc_conv_unary_op (PAREN_EXPR, se, expr);
1126 gcc_assert (FLOAT_TYPE_P (TREE_TYPE (se->expr)));
1131 case INTRINSIC_UPLUS:
1132 gfc_conv_expr (se, expr->value.op.op1);
1135 case INTRINSIC_UMINUS:
1136 gfc_conv_unary_op (NEGATE_EXPR, se, expr);
1140 gfc_conv_unary_op (TRUTH_NOT_EXPR, se, expr);
1143 case INTRINSIC_PLUS:
1147 case INTRINSIC_MINUS:
1151 case INTRINSIC_TIMES:
1155 case INTRINSIC_DIVIDE:
1156 /* If expr is a real or complex expr, use an RDIV_EXPR. If op1 is
1157 an integer, we must round towards zero, so we use a
1159 if (expr->ts.type == BT_INTEGER)
1160 code = TRUNC_DIV_EXPR;
1165 case INTRINSIC_POWER:
1166 gfc_conv_power_op (se, expr);
1169 case INTRINSIC_CONCAT:
1170 gfc_conv_concat_op (se, expr);
1174 code = TRUTH_ANDIF_EXPR;
1179 code = TRUTH_ORIF_EXPR;
1183 /* EQV and NEQV only work on logicals, but since we represent them
1184 as integers, we can use EQ_EXPR and NE_EXPR for them in GIMPLE. */
1186 case INTRINSIC_EQ_OS:
1194 case INTRINSIC_NE_OS:
1195 case INTRINSIC_NEQV:
1202 case INTRINSIC_GT_OS:
1209 case INTRINSIC_GE_OS:
1216 case INTRINSIC_LT_OS:
1223 case INTRINSIC_LE_OS:
1229 case INTRINSIC_USER:
1230 case INTRINSIC_ASSIGN:
1231 /* These should be converted into function calls by the frontend. */
1235 fatal_error ("Unknown intrinsic op");
1239 /* The only exception to this is **, which is handled separately anyway. */
1240 gcc_assert (expr->value.op.op1->ts.type == expr->value.op.op2->ts.type);
1242 if (checkstring && expr->value.op.op1->ts.type != BT_CHARACTER)
1246 gfc_init_se (&lse, se);
1247 gfc_conv_expr (&lse, expr->value.op.op1);
1248 gfc_add_block_to_block (&se->pre, &lse.pre);
1251 gfc_init_se (&rse, se);
1252 gfc_conv_expr (&rse, expr->value.op.op2);
1253 gfc_add_block_to_block (&se->pre, &rse.pre);
1257 gfc_conv_string_parameter (&lse);
1258 gfc_conv_string_parameter (&rse);
1260 lse.expr = gfc_build_compare_string (lse.string_length, lse.expr,
1261 rse.string_length, rse.expr,
1262 expr->value.op.op1->ts.kind);
1263 rse.expr = build_int_cst (TREE_TYPE (lse.expr), 0);
1264 gfc_add_block_to_block (&lse.post, &rse.post);
1267 type = gfc_typenode_for_spec (&expr->ts);
1271 /* The result of logical ops is always boolean_type_node. */
1272 tmp = fold_build2 (code, boolean_type_node, lse.expr, rse.expr);
1273 se->expr = convert (type, tmp);
1276 se->expr = fold_build2 (code, type, lse.expr, rse.expr);
1278 /* Add the post blocks. */
1279 gfc_add_block_to_block (&se->post, &rse.post);
1280 gfc_add_block_to_block (&se->post, &lse.post);
1283 /* If a string's length is one, we convert it to a single character. */
1286 string_to_single_character (tree len, tree str, int kind)
1288 gcc_assert (POINTER_TYPE_P (TREE_TYPE (str)));
1290 if (INTEGER_CST_P (len) && TREE_INT_CST_LOW (len) == 1
1291 && TREE_INT_CST_HIGH (len) == 0)
1293 str = fold_convert (gfc_get_pchar_type (kind), str);
1294 return build_fold_indirect_ref (str);
1302 gfc_conv_scalar_char_value (gfc_symbol *sym, gfc_se *se, gfc_expr **expr)
1305 if (sym->backend_decl)
1307 /* This becomes the nominal_type in
1308 function.c:assign_parm_find_data_types. */
1309 TREE_TYPE (sym->backend_decl) = unsigned_char_type_node;
1310 /* This becomes the passed_type in
1311 function.c:assign_parm_find_data_types. C promotes char to
1312 integer for argument passing. */
1313 DECL_ARG_TYPE (sym->backend_decl) = unsigned_type_node;
1315 DECL_BY_REFERENCE (sym->backend_decl) = 0;
1320 /* If we have a constant character expression, make it into an
1322 if ((*expr)->expr_type == EXPR_CONSTANT)
1327 *expr = gfc_int_expr ((int)(*expr)->value.character.string[0]);
1328 if ((*expr)->ts.kind != gfc_c_int_kind)
1330 /* The expr needs to be compatible with a C int. If the
1331 conversion fails, then the 2 causes an ICE. */
1332 ts.type = BT_INTEGER;
1333 ts.kind = gfc_c_int_kind;
1334 gfc_convert_type (*expr, &ts, 2);
1337 else if (se != NULL && (*expr)->expr_type == EXPR_VARIABLE)
1339 if ((*expr)->ref == NULL)
1341 se->expr = string_to_single_character
1342 (build_int_cst (integer_type_node, 1),
1343 gfc_build_addr_expr (gfc_get_pchar_type ((*expr)->ts.kind),
1345 ((*expr)->symtree->n.sym)),
1350 gfc_conv_variable (se, *expr);
1351 se->expr = string_to_single_character
1352 (build_int_cst (integer_type_node, 1),
1353 gfc_build_addr_expr (gfc_get_pchar_type ((*expr)->ts.kind),
1362 /* Compare two strings. If they are all single characters, the result is the
1363 subtraction of them. Otherwise, we build a library call. */
1366 gfc_build_compare_string (tree len1, tree str1, tree len2, tree str2, int kind)
1372 gcc_assert (POINTER_TYPE_P (TREE_TYPE (str1)));
1373 gcc_assert (POINTER_TYPE_P (TREE_TYPE (str2)));
1375 sc1 = string_to_single_character (len1, str1, kind);
1376 sc2 = string_to_single_character (len2, str2, kind);
1378 if (sc1 != NULL_TREE && sc2 != NULL_TREE)
1380 /* Deal with single character specially. */
1381 sc1 = fold_convert (integer_type_node, sc1);
1382 sc2 = fold_convert (integer_type_node, sc2);
1383 tmp = fold_build2 (MINUS_EXPR, integer_type_node, sc1, sc2);
1387 /* Build a call for the comparison. */
1391 fndecl = gfor_fndecl_compare_string;
1393 fndecl = gfor_fndecl_compare_string_char4;
1397 tmp = build_call_expr (fndecl, 4, len1, str1, len2, str2);
1404 gfc_conv_function_val (gfc_se * se, gfc_symbol * sym)
1408 if (sym->attr.dummy)
1410 tmp = gfc_get_symbol_decl (sym);
1411 if (sym->attr.proc_pointer)
1412 tmp = build_fold_indirect_ref (tmp);
1413 gcc_assert (TREE_CODE (TREE_TYPE (tmp)) == POINTER_TYPE
1414 && TREE_CODE (TREE_TYPE (TREE_TYPE (tmp))) == FUNCTION_TYPE);
1418 if (!sym->backend_decl)
1419 sym->backend_decl = gfc_get_extern_function_decl (sym);
1421 tmp = sym->backend_decl;
1422 if (sym->attr.cray_pointee)
1423 tmp = convert (build_pointer_type (TREE_TYPE (tmp)),
1424 gfc_get_symbol_decl (sym->cp_pointer));
1425 if (!POINTER_TYPE_P (TREE_TYPE (tmp)))
1427 gcc_assert (TREE_CODE (tmp) == FUNCTION_DECL);
1428 tmp = build_fold_addr_expr (tmp);
1435 /* Translate the call for an elemental subroutine call used in an operator
1436 assignment. This is a simplified version of gfc_conv_function_call. */
1439 gfc_conv_operator_assign (gfc_se *lse, gfc_se *rse, gfc_symbol *sym)
1446 /* Only elemental subroutines with two arguments. */
1447 gcc_assert (sym->attr.elemental && sym->attr.subroutine);
1448 gcc_assert (sym->formal->next->next == NULL);
1450 gfc_init_block (&block);
1452 gfc_add_block_to_block (&block, &lse->pre);
1453 gfc_add_block_to_block (&block, &rse->pre);
1455 /* Build the argument list for the call, including hidden string lengths. */
1456 args = gfc_chainon_list (NULL_TREE, build_fold_addr_expr (lse->expr));
1457 args = gfc_chainon_list (args, build_fold_addr_expr (rse->expr));
1458 if (lse->string_length != NULL_TREE)
1459 args = gfc_chainon_list (args, lse->string_length);
1460 if (rse->string_length != NULL_TREE)
1461 args = gfc_chainon_list (args, rse->string_length);
1463 /* Build the function call. */
1464 gfc_init_se (&se, NULL);
1465 gfc_conv_function_val (&se, sym);
1466 tmp = TREE_TYPE (TREE_TYPE (TREE_TYPE (se.expr)));
1467 tmp = build_call_list (tmp, se.expr, args);
1468 gfc_add_expr_to_block (&block, tmp);
1470 gfc_add_block_to_block (&block, &lse->post);
1471 gfc_add_block_to_block (&block, &rse->post);
1473 return gfc_finish_block (&block);
1477 /* Initialize MAPPING. */
1480 gfc_init_interface_mapping (gfc_interface_mapping * mapping)
1482 mapping->syms = NULL;
1483 mapping->charlens = NULL;
1487 /* Free all memory held by MAPPING (but not MAPPING itself). */
1490 gfc_free_interface_mapping (gfc_interface_mapping * mapping)
1492 gfc_interface_sym_mapping *sym;
1493 gfc_interface_sym_mapping *nextsym;
1495 gfc_charlen *nextcl;
1497 for (sym = mapping->syms; sym; sym = nextsym)
1499 nextsym = sym->next;
1500 gfc_free_symbol (sym->new_sym->n.sym);
1501 gfc_free_expr (sym->expr);
1502 gfc_free (sym->new_sym);
1505 for (cl = mapping->charlens; cl; cl = nextcl)
1508 gfc_free_expr (cl->length);
1514 /* Return a copy of gfc_charlen CL. Add the returned structure to
1515 MAPPING so that it will be freed by gfc_free_interface_mapping. */
1517 static gfc_charlen *
1518 gfc_get_interface_mapping_charlen (gfc_interface_mapping * mapping,
1521 gfc_charlen *new_charlen;
1523 new_charlen = gfc_get_charlen ();
1524 new_charlen->next = mapping->charlens;
1525 new_charlen->length = gfc_copy_expr (cl->length);
1527 mapping->charlens = new_charlen;
1532 /* A subroutine of gfc_add_interface_mapping. Return a descriptorless
1533 array variable that can be used as the actual argument for dummy
1534 argument SYM. Add any initialization code to BLOCK. PACKED is as
1535 for gfc_get_nodesc_array_type and DATA points to the first element
1536 in the passed array. */
1539 gfc_get_interface_mapping_array (stmtblock_t * block, gfc_symbol * sym,
1540 gfc_packed packed, tree data)
1545 type = gfc_typenode_for_spec (&sym->ts);
1546 type = gfc_get_nodesc_array_type (type, sym->as, packed);
1548 var = gfc_create_var (type, "ifm");
1549 gfc_add_modify (block, var, fold_convert (type, data));
1555 /* A subroutine of gfc_add_interface_mapping. Set the stride, upper bounds
1556 and offset of descriptorless array type TYPE given that it has the same
1557 size as DESC. Add any set-up code to BLOCK. */
1560 gfc_set_interface_mapping_bounds (stmtblock_t * block, tree type, tree desc)
1567 offset = gfc_index_zero_node;
1568 for (n = 0; n < GFC_TYPE_ARRAY_RANK (type); n++)
1570 dim = gfc_rank_cst[n];
1571 GFC_TYPE_ARRAY_STRIDE (type, n) = gfc_conv_array_stride (desc, n);
1572 if (GFC_TYPE_ARRAY_LBOUND (type, n) == NULL_TREE)
1574 GFC_TYPE_ARRAY_LBOUND (type, n)
1575 = gfc_conv_descriptor_lbound (desc, dim);
1576 GFC_TYPE_ARRAY_UBOUND (type, n)
1577 = gfc_conv_descriptor_ubound (desc, dim);
1579 else if (GFC_TYPE_ARRAY_UBOUND (type, n) == NULL_TREE)
1581 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
1582 gfc_conv_descriptor_ubound (desc, dim),
1583 gfc_conv_descriptor_lbound (desc, dim));
1584 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
1585 GFC_TYPE_ARRAY_LBOUND (type, n),
1587 tmp = gfc_evaluate_now (tmp, block);
1588 GFC_TYPE_ARRAY_UBOUND (type, n) = tmp;
1590 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type,
1591 GFC_TYPE_ARRAY_LBOUND (type, n),
1592 GFC_TYPE_ARRAY_STRIDE (type, n));
1593 offset = fold_build2 (MINUS_EXPR, gfc_array_index_type, offset, tmp);
1595 offset = gfc_evaluate_now (offset, block);
1596 GFC_TYPE_ARRAY_OFFSET (type) = offset;
1600 /* Extend MAPPING so that it maps dummy argument SYM to the value stored
1601 in SE. The caller may still use se->expr and se->string_length after
1602 calling this function. */
1605 gfc_add_interface_mapping (gfc_interface_mapping * mapping,
1606 gfc_symbol * sym, gfc_se * se,
1609 gfc_interface_sym_mapping *sm;
1613 gfc_symbol *new_sym;
1615 gfc_symtree *new_symtree;
1617 /* Create a new symbol to represent the actual argument. */
1618 new_sym = gfc_new_symbol (sym->name, NULL);
1619 new_sym->ts = sym->ts;
1620 new_sym->attr.referenced = 1;
1621 new_sym->attr.dimension = sym->attr.dimension;
1622 new_sym->attr.pointer = sym->attr.pointer;
1623 new_sym->attr.allocatable = sym->attr.allocatable;
1624 new_sym->attr.flavor = sym->attr.flavor;
1625 new_sym->attr.function = sym->attr.function;
1627 /* Create a fake symtree for it. */
1629 new_symtree = gfc_new_symtree (&root, sym->name);
1630 new_symtree->n.sym = new_sym;
1631 gcc_assert (new_symtree == root);
1633 /* Create a dummy->actual mapping. */
1634 sm = XCNEW (gfc_interface_sym_mapping);
1635 sm->next = mapping->syms;
1637 sm->new_sym = new_symtree;
1638 sm->expr = gfc_copy_expr (expr);
1641 /* Stabilize the argument's value. */
1642 if (!sym->attr.function && se)
1643 se->expr = gfc_evaluate_now (se->expr, &se->pre);
1645 if (sym->ts.type == BT_CHARACTER)
1647 /* Create a copy of the dummy argument's length. */
1648 new_sym->ts.cl = gfc_get_interface_mapping_charlen (mapping, sym->ts.cl);
1649 sm->expr->ts.cl = new_sym->ts.cl;
1651 /* If the length is specified as "*", record the length that
1652 the caller is passing. We should use the callee's length
1653 in all other cases. */
1654 if (!new_sym->ts.cl->length && se)
1656 se->string_length = gfc_evaluate_now (se->string_length, &se->pre);
1657 new_sym->ts.cl->backend_decl = se->string_length;
1664 /* Use the passed value as-is if the argument is a function. */
1665 if (sym->attr.flavor == FL_PROCEDURE)
1668 /* If the argument is either a string or a pointer to a string,
1669 convert it to a boundless character type. */
1670 else if (!sym->attr.dimension && sym->ts.type == BT_CHARACTER)
1672 tmp = gfc_get_character_type_len (sym->ts.kind, NULL);
1673 tmp = build_pointer_type (tmp);
1674 if (sym->attr.pointer)
1675 value = build_fold_indirect_ref (se->expr);
1678 value = fold_convert (tmp, value);
1681 /* If the argument is a scalar, a pointer to an array or an allocatable,
1683 else if (!sym->attr.dimension || sym->attr.pointer || sym->attr.allocatable)
1684 value = build_fold_indirect_ref (se->expr);
1686 /* For character(*), use the actual argument's descriptor. */
1687 else if (sym->ts.type == BT_CHARACTER && !new_sym->ts.cl->length)
1688 value = build_fold_indirect_ref (se->expr);
1690 /* If the argument is an array descriptor, use it to determine
1691 information about the actual argument's shape. */
1692 else if (POINTER_TYPE_P (TREE_TYPE (se->expr))
1693 && GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (TREE_TYPE (se->expr))))
1695 /* Get the actual argument's descriptor. */
1696 desc = build_fold_indirect_ref (se->expr);
1698 /* Create the replacement variable. */
1699 tmp = gfc_conv_descriptor_data_get (desc);
1700 value = gfc_get_interface_mapping_array (&se->pre, sym,
1703 /* Use DESC to work out the upper bounds, strides and offset. */
1704 gfc_set_interface_mapping_bounds (&se->pre, TREE_TYPE (value), desc);
1707 /* Otherwise we have a packed array. */
1708 value = gfc_get_interface_mapping_array (&se->pre, sym,
1709 PACKED_FULL, se->expr);
1711 new_sym->backend_decl = value;
1715 /* Called once all dummy argument mappings have been added to MAPPING,
1716 but before the mapping is used to evaluate expressions. Pre-evaluate
1717 the length of each argument, adding any initialization code to PRE and
1718 any finalization code to POST. */
1721 gfc_finish_interface_mapping (gfc_interface_mapping * mapping,
1722 stmtblock_t * pre, stmtblock_t * post)
1724 gfc_interface_sym_mapping *sym;
1728 for (sym = mapping->syms; sym; sym = sym->next)
1729 if (sym->new_sym->n.sym->ts.type == BT_CHARACTER
1730 && !sym->new_sym->n.sym->ts.cl->backend_decl)
1732 expr = sym->new_sym->n.sym->ts.cl->length;
1733 gfc_apply_interface_mapping_to_expr (mapping, expr);
1734 gfc_init_se (&se, NULL);
1735 gfc_conv_expr (&se, expr);
1737 se.expr = gfc_evaluate_now (se.expr, &se.pre);
1738 gfc_add_block_to_block (pre, &se.pre);
1739 gfc_add_block_to_block (post, &se.post);
1741 sym->new_sym->n.sym->ts.cl->backend_decl = se.expr;
1746 /* Like gfc_apply_interface_mapping_to_expr, but applied to
1750 gfc_apply_interface_mapping_to_cons (gfc_interface_mapping * mapping,
1751 gfc_constructor * c)
1753 for (; c; c = c->next)
1755 gfc_apply_interface_mapping_to_expr (mapping, c->expr);
1758 gfc_apply_interface_mapping_to_expr (mapping, c->iterator->start);
1759 gfc_apply_interface_mapping_to_expr (mapping, c->iterator->end);
1760 gfc_apply_interface_mapping_to_expr (mapping, c->iterator->step);
1766 /* Like gfc_apply_interface_mapping_to_expr, but applied to
1770 gfc_apply_interface_mapping_to_ref (gfc_interface_mapping * mapping,
1775 for (; ref; ref = ref->next)
1779 for (n = 0; n < ref->u.ar.dimen; n++)
1781 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.start[n]);
1782 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.end[n]);
1783 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.stride[n]);
1785 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.offset);
1792 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ss.start);
1793 gfc_apply_interface_mapping_to_expr (mapping, ref->u.ss.end);
1799 /* Convert intrinsic function calls into result expressions. */
1801 gfc_map_intrinsic_function (gfc_expr *expr, gfc_interface_mapping * mapping)
1809 arg1 = expr->value.function.actual->expr;
1810 if (expr->value.function.actual->next)
1811 arg2 = expr->value.function.actual->next->expr;
1815 sym = arg1->symtree->n.sym;
1817 if (sym->attr.dummy)
1822 switch (expr->value.function.isym->id)
1825 /* TODO figure out why this condition is necessary. */
1826 if (sym->attr.function
1827 && arg1->ts.cl->length->expr_type != EXPR_CONSTANT
1828 && arg1->ts.cl->length->expr_type != EXPR_VARIABLE)
1831 new_expr = gfc_copy_expr (arg1->ts.cl->length);
1838 if (arg2 && arg2->expr_type == EXPR_CONSTANT)
1840 dup = mpz_get_si (arg2->value.integer);
1845 dup = sym->as->rank;
1849 for (; d < dup; d++)
1852 tmp = gfc_add (gfc_copy_expr (sym->as->upper[d]), gfc_int_expr (1));
1853 tmp = gfc_subtract (tmp, gfc_copy_expr (sym->as->lower[d]));
1855 new_expr = gfc_multiply (new_expr, tmp);
1861 case GFC_ISYM_LBOUND:
1862 case GFC_ISYM_UBOUND:
1863 /* TODO These implementations of lbound and ubound do not limit if
1864 the size < 0, according to F95's 13.14.53 and 13.14.113. */
1869 if (arg2 && arg2->expr_type == EXPR_CONSTANT)
1870 d = mpz_get_si (arg2->value.integer) - 1;
1872 /* TODO: If the need arises, this could produce an array of
1876 if (expr->value.function.isym->id == GFC_ISYM_LBOUND)
1877 new_expr = gfc_copy_expr (sym->as->lower[d]);
1879 new_expr = gfc_copy_expr (sym->as->upper[d]);
1886 gfc_apply_interface_mapping_to_expr (mapping, new_expr);
1890 gfc_replace_expr (expr, new_expr);
1896 gfc_map_fcn_formal_to_actual (gfc_expr *expr, gfc_expr *map_expr,
1897 gfc_interface_mapping * mapping)
1899 gfc_formal_arglist *f;
1900 gfc_actual_arglist *actual;
1902 actual = expr->value.function.actual;
1903 f = map_expr->symtree->n.sym->formal;
1905 for (; f && actual; f = f->next, actual = actual->next)
1910 gfc_add_interface_mapping (mapping, f->sym, NULL, actual->expr);
1913 if (map_expr->symtree->n.sym->attr.dimension)
1918 as = gfc_copy_array_spec (map_expr->symtree->n.sym->as);
1920 for (d = 0; d < as->rank; d++)
1922 gfc_apply_interface_mapping_to_expr (mapping, as->lower[d]);
1923 gfc_apply_interface_mapping_to_expr (mapping, as->upper[d]);
1926 expr->value.function.esym->as = as;
1929 if (map_expr->symtree->n.sym->ts.type == BT_CHARACTER)
1931 expr->value.function.esym->ts.cl->length
1932 = gfc_copy_expr (map_expr->symtree->n.sym->ts.cl->length);
1934 gfc_apply_interface_mapping_to_expr (mapping,
1935 expr->value.function.esym->ts.cl->length);
1940 /* EXPR is a copy of an expression that appeared in the interface
1941 associated with MAPPING. Walk it recursively looking for references to
1942 dummy arguments that MAPPING maps to actual arguments. Replace each such
1943 reference with a reference to the associated actual argument. */
1946 gfc_apply_interface_mapping_to_expr (gfc_interface_mapping * mapping,
1949 gfc_interface_sym_mapping *sym;
1950 gfc_actual_arglist *actual;
1955 /* Copying an expression does not copy its length, so do that here. */
1956 if (expr->ts.type == BT_CHARACTER && expr->ts.cl)
1958 expr->ts.cl = gfc_get_interface_mapping_charlen (mapping, expr->ts.cl);
1959 gfc_apply_interface_mapping_to_expr (mapping, expr->ts.cl->length);
1962 /* Apply the mapping to any references. */
1963 gfc_apply_interface_mapping_to_ref (mapping, expr->ref);
1965 /* ...and to the expression's symbol, if it has one. */
1966 /* TODO Find out why the condition on expr->symtree had to be moved into
1967 the loop rather than being outside it, as originally. */
1968 for (sym = mapping->syms; sym; sym = sym->next)
1969 if (expr->symtree && sym->old == expr->symtree->n.sym)
1971 if (sym->new_sym->n.sym->backend_decl)
1972 expr->symtree = sym->new_sym;
1974 gfc_replace_expr (expr, gfc_copy_expr (sym->expr));
1977 /* ...and to subexpressions in expr->value. */
1978 switch (expr->expr_type)
1983 case EXPR_SUBSTRING:
1987 gfc_apply_interface_mapping_to_expr (mapping, expr->value.op.op1);
1988 gfc_apply_interface_mapping_to_expr (mapping, expr->value.op.op2);
1992 for (actual = expr->value.function.actual; actual; actual = actual->next)
1993 gfc_apply_interface_mapping_to_expr (mapping, actual->expr);
1995 if (expr->value.function.esym == NULL
1996 && expr->value.function.isym != NULL
1997 && expr->value.function.actual->expr->symtree
1998 && gfc_map_intrinsic_function (expr, mapping))
2001 for (sym = mapping->syms; sym; sym = sym->next)
2002 if (sym->old == expr->value.function.esym)
2004 expr->value.function.esym = sym->new_sym->n.sym;
2005 gfc_map_fcn_formal_to_actual (expr, sym->expr, mapping);
2006 expr->value.function.esym->result = sym->new_sym->n.sym;
2011 case EXPR_STRUCTURE:
2012 gfc_apply_interface_mapping_to_cons (mapping, expr->value.constructor);
2020 /* Evaluate interface expression EXPR using MAPPING. Store the result
2024 gfc_apply_interface_mapping (gfc_interface_mapping * mapping,
2025 gfc_se * se, gfc_expr * expr)
2027 expr = gfc_copy_expr (expr);
2028 gfc_apply_interface_mapping_to_expr (mapping, expr);
2029 gfc_conv_expr (se, expr);
2030 se->expr = gfc_evaluate_now (se->expr, &se->pre);
2031 gfc_free_expr (expr);
2035 /* Returns a reference to a temporary array into which a component of
2036 an actual argument derived type array is copied and then returned
2037 after the function call. */
2039 gfc_conv_subref_array_arg (gfc_se * parmse, gfc_expr * expr,
2040 int g77, sym_intent intent)
2056 gcc_assert (expr->expr_type == EXPR_VARIABLE);
2058 gfc_init_se (&lse, NULL);
2059 gfc_init_se (&rse, NULL);
2061 /* Walk the argument expression. */
2062 rss = gfc_walk_expr (expr);
2064 gcc_assert (rss != gfc_ss_terminator);
2066 /* Initialize the scalarizer. */
2067 gfc_init_loopinfo (&loop);
2068 gfc_add_ss_to_loop (&loop, rss);
2070 /* Calculate the bounds of the scalarization. */
2071 gfc_conv_ss_startstride (&loop);
2073 /* Build an ss for the temporary. */
2074 if (expr->ts.type == BT_CHARACTER && !expr->ts.cl->backend_decl)
2075 gfc_conv_string_length (expr->ts.cl, &parmse->pre);
2077 base_type = gfc_typenode_for_spec (&expr->ts);
2078 if (GFC_ARRAY_TYPE_P (base_type)
2079 || GFC_DESCRIPTOR_TYPE_P (base_type))
2080 base_type = gfc_get_element_type (base_type);
2082 loop.temp_ss = gfc_get_ss ();;
2083 loop.temp_ss->type = GFC_SS_TEMP;
2084 loop.temp_ss->data.temp.type = base_type;
2086 if (expr->ts.type == BT_CHARACTER)
2087 loop.temp_ss->string_length = expr->ts.cl->backend_decl;
2089 loop.temp_ss->string_length = NULL;
2091 parmse->string_length = loop.temp_ss->string_length;
2092 loop.temp_ss->data.temp.dimen = loop.dimen;
2093 loop.temp_ss->next = gfc_ss_terminator;
2095 /* Associate the SS with the loop. */
2096 gfc_add_ss_to_loop (&loop, loop.temp_ss);
2098 /* Setup the scalarizing loops. */
2099 gfc_conv_loop_setup (&loop, &expr->where);
2101 /* Pass the temporary descriptor back to the caller. */
2102 info = &loop.temp_ss->data.info;
2103 parmse->expr = info->descriptor;
2105 /* Setup the gfc_se structures. */
2106 gfc_copy_loopinfo_to_se (&lse, &loop);
2107 gfc_copy_loopinfo_to_se (&rse, &loop);
2110 lse.ss = loop.temp_ss;
2111 gfc_mark_ss_chain_used (rss, 1);
2112 gfc_mark_ss_chain_used (loop.temp_ss, 1);
2114 /* Start the scalarized loop body. */
2115 gfc_start_scalarized_body (&loop, &body);
2117 /* Translate the expression. */
2118 gfc_conv_expr (&rse, expr);
2120 gfc_conv_tmp_array_ref (&lse);
2121 gfc_advance_se_ss_chain (&lse);
2123 if (intent != INTENT_OUT)
2125 tmp = gfc_trans_scalar_assign (&lse, &rse, expr->ts, true, false);
2126 gfc_add_expr_to_block (&body, tmp);
2127 gcc_assert (rse.ss == gfc_ss_terminator);
2128 gfc_trans_scalarizing_loops (&loop, &body);
2132 /* Make sure that the temporary declaration survives by merging
2133 all the loop declarations into the current context. */
2134 for (n = 0; n < loop.dimen; n++)
2136 gfc_merge_block_scope (&body);
2137 body = loop.code[loop.order[n]];
2139 gfc_merge_block_scope (&body);
2142 /* Add the post block after the second loop, so that any
2143 freeing of allocated memory is done at the right time. */
2144 gfc_add_block_to_block (&parmse->pre, &loop.pre);
2146 /**********Copy the temporary back again.*********/
2148 gfc_init_se (&lse, NULL);
2149 gfc_init_se (&rse, NULL);
2151 /* Walk the argument expression. */
2152 lss = gfc_walk_expr (expr);
2153 rse.ss = loop.temp_ss;
2156 /* Initialize the scalarizer. */
2157 gfc_init_loopinfo (&loop2);
2158 gfc_add_ss_to_loop (&loop2, lss);
2160 /* Calculate the bounds of the scalarization. */
2161 gfc_conv_ss_startstride (&loop2);
2163 /* Setup the scalarizing loops. */
2164 gfc_conv_loop_setup (&loop2, &expr->where);
2166 gfc_copy_loopinfo_to_se (&lse, &loop2);
2167 gfc_copy_loopinfo_to_se (&rse, &loop2);
2169 gfc_mark_ss_chain_used (lss, 1);
2170 gfc_mark_ss_chain_used (loop.temp_ss, 1);
2172 /* Declare the variable to hold the temporary offset and start the
2173 scalarized loop body. */
2174 offset = gfc_create_var (gfc_array_index_type, NULL);
2175 gfc_start_scalarized_body (&loop2, &body);
2177 /* Build the offsets for the temporary from the loop variables. The
2178 temporary array has lbounds of zero and strides of one in all
2179 dimensions, so this is very simple. The offset is only computed
2180 outside the innermost loop, so the overall transfer could be
2181 optimized further. */
2182 info = &rse.ss->data.info;
2184 tmp_index = gfc_index_zero_node;
2185 for (n = info->dimen - 1; n > 0; n--)
2188 tmp = rse.loop->loopvar[n];
2189 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type,
2190 tmp, rse.loop->from[n]);
2191 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type,
2194 tmp_str = fold_build2 (MINUS_EXPR, gfc_array_index_type,
2195 rse.loop->to[n-1], rse.loop->from[n-1]);
2196 tmp_str = fold_build2 (PLUS_EXPR, gfc_array_index_type,
2197 tmp_str, gfc_index_one_node);
2199 tmp_index = fold_build2 (MULT_EXPR, gfc_array_index_type,
2203 tmp_index = fold_build2 (MINUS_EXPR, gfc_array_index_type,
2204 tmp_index, rse.loop->from[0]);
2205 gfc_add_modify (&rse.loop->code[0], offset, tmp_index);
2207 tmp_index = fold_build2 (PLUS_EXPR, gfc_array_index_type,
2208 rse.loop->loopvar[0], offset);
2210 /* Now use the offset for the reference. */
2211 tmp = build_fold_indirect_ref (info->data);
2212 rse.expr = gfc_build_array_ref (tmp, tmp_index, NULL);
2214 if (expr->ts.type == BT_CHARACTER)
2215 rse.string_length = expr->ts.cl->backend_decl;
2217 gfc_conv_expr (&lse, expr);
2219 gcc_assert (lse.ss == gfc_ss_terminator);
2221 tmp = gfc_trans_scalar_assign (&lse, &rse, expr->ts, false, false);
2222 gfc_add_expr_to_block (&body, tmp);
2224 /* Generate the copying loops. */
2225 gfc_trans_scalarizing_loops (&loop2, &body);
2227 /* Wrap the whole thing up by adding the second loop to the post-block
2228 and following it by the post-block of the first loop. In this way,
2229 if the temporary needs freeing, it is done after use! */
2230 if (intent != INTENT_IN)
2232 gfc_add_block_to_block (&parmse->post, &loop2.pre);
2233 gfc_add_block_to_block (&parmse->post, &loop2.post);
2236 gfc_add_block_to_block (&parmse->post, &loop.post);
2238 gfc_cleanup_loop (&loop);
2239 gfc_cleanup_loop (&loop2);
2241 /* Pass the string length to the argument expression. */
2242 if (expr->ts.type == BT_CHARACTER)
2243 parmse->string_length = expr->ts.cl->backend_decl;
2245 /* We want either the address for the data or the address of the descriptor,
2246 depending on the mode of passing array arguments. */
2248 parmse->expr = gfc_conv_descriptor_data_get (parmse->expr);
2250 parmse->expr = build_fold_addr_expr (parmse->expr);
2256 /* Generate the code for argument list functions. */
2259 conv_arglist_function (gfc_se *se, gfc_expr *expr, const char *name)
2261 /* Pass by value for g77 %VAL(arg), pass the address
2262 indirectly for %LOC, else by reference. Thus %REF
2263 is a "do-nothing" and %LOC is the same as an F95
2265 if (strncmp (name, "%VAL", 4) == 0)
2266 gfc_conv_expr (se, expr);
2267 else if (strncmp (name, "%LOC", 4) == 0)
2269 gfc_conv_expr_reference (se, expr);
2270 se->expr = gfc_build_addr_expr (NULL, se->expr);
2272 else if (strncmp (name, "%REF", 4) == 0)
2273 gfc_conv_expr_reference (se, expr);
2275 gfc_error ("Unknown argument list function at %L", &expr->where);
2279 /* Generate code for a procedure call. Note can return se->post != NULL.
2280 If se->direct_byref is set then se->expr contains the return parameter.
2281 Return nonzero, if the call has alternate specifiers. */
2284 gfc_conv_function_call (gfc_se * se, gfc_symbol * sym,
2285 gfc_actual_arglist * arg, tree append_args)
2287 gfc_interface_mapping mapping;
2301 gfc_formal_arglist *formal;
2302 int has_alternate_specifier = 0;
2303 bool need_interface_mapping;
2310 enum {MISSING = 0, ELEMENTAL, SCALAR, SCALAR_POINTER, ARRAY};
2312 arglist = NULL_TREE;
2313 retargs = NULL_TREE;
2314 stringargs = NULL_TREE;
2319 if (sym->from_intmod == INTMOD_ISO_C_BINDING)
2321 if (sym->intmod_sym_id == ISOCBINDING_LOC)
2323 if (arg->expr->rank == 0)
2324 gfc_conv_expr_reference (se, arg->expr);
2328 /* This is really the actual arg because no formal arglist is
2329 created for C_LOC. */
2330 fsym = arg->expr->symtree->n.sym;
2332 /* We should want it to do g77 calling convention. */
2334 && !(fsym->attr.pointer || fsym->attr.allocatable)
2335 && fsym->as->type != AS_ASSUMED_SHAPE;
2336 f = f || !sym->attr.always_explicit;
2338 argss = gfc_walk_expr (arg->expr);
2339 gfc_conv_array_parameter (se, arg->expr, argss, f, NULL, NULL);
2342 /* TODO -- the following two lines shouldn't be necessary, but
2343 they're removed a bug is exposed later in the codepath.
2344 This is workaround was thus introduced, but will have to be
2345 removed; please see PR 35150 for details about the issue. */
2346 se->expr = convert (pvoid_type_node, se->expr);
2347 se->expr = gfc_evaluate_now (se->expr, &se->pre);
2351 else if (sym->intmod_sym_id == ISOCBINDING_FUNLOC)
2353 arg->expr->ts.type = sym->ts.derived->ts.type;
2354 arg->expr->ts.f90_type = sym->ts.derived->ts.f90_type;
2355 arg->expr->ts.kind = sym->ts.derived->ts.kind;
2356 gfc_conv_expr_reference (se, arg->expr);
2360 else if ((sym->intmod_sym_id == ISOCBINDING_F_POINTER
2361 && arg->next->expr->rank == 0)
2362 || sym->intmod_sym_id == ISOCBINDING_F_PROCPOINTER)
2364 /* Convert c_f_pointer if fptr is a scalar
2365 and convert c_f_procpointer. */
2369 gfc_init_se (&cptrse, NULL);
2370 gfc_conv_expr (&cptrse, arg->expr);
2371 gfc_add_block_to_block (&se->pre, &cptrse.pre);
2372 gfc_add_block_to_block (&se->post, &cptrse.post);
2374 gfc_init_se (&fptrse, NULL);
2375 if (sym->intmod_sym_id == ISOCBINDING_F_POINTER)
2376 fptrse.want_pointer = 1;
2378 gfc_conv_expr (&fptrse, arg->next->expr);
2379 gfc_add_block_to_block (&se->pre, &fptrse.pre);
2380 gfc_add_block_to_block (&se->post, &fptrse.post);
2382 tmp = arg->next->expr->symtree->n.sym->backend_decl;
2383 se->expr = fold_build2 (MODIFY_EXPR, TREE_TYPE (tmp), fptrse.expr,
2384 fold_convert (TREE_TYPE (tmp), cptrse.expr));
2388 else if (sym->intmod_sym_id == ISOCBINDING_ASSOCIATED)
2393 /* Build the addr_expr for the first argument. The argument is
2394 already an *address* so we don't need to set want_pointer in
2396 gfc_init_se (&arg1se, NULL);
2397 gfc_conv_expr (&arg1se, arg->expr);
2398 gfc_add_block_to_block (&se->pre, &arg1se.pre);
2399 gfc_add_block_to_block (&se->post, &arg1se.post);
2401 /* See if we were given two arguments. */
2402 if (arg->next == NULL)
2403 /* Only given one arg so generate a null and do a
2404 not-equal comparison against the first arg. */
2405 se->expr = fold_build2 (NE_EXPR, boolean_type_node, arg1se.expr,
2406 fold_convert (TREE_TYPE (arg1se.expr),
2407 null_pointer_node));
2413 /* Given two arguments so build the arg2se from second arg. */
2414 gfc_init_se (&arg2se, NULL);
2415 gfc_conv_expr (&arg2se, arg->next->expr);
2416 gfc_add_block_to_block (&se->pre, &arg2se.pre);
2417 gfc_add_block_to_block (&se->post, &arg2se.post);
2419 /* Generate test to compare that the two args are equal. */
2420 eq_expr = fold_build2 (EQ_EXPR, boolean_type_node,
2421 arg1se.expr, arg2se.expr);
2422 /* Generate test to ensure that the first arg is not null. */
2423 not_null_expr = fold_build2 (NE_EXPR, boolean_type_node,
2424 arg1se.expr, null_pointer_node);
2426 /* Finally, the generated test must check that both arg1 is not
2427 NULL and that it is equal to the second arg. */
2428 se->expr = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
2429 not_null_expr, eq_expr);
2438 if (!sym->attr.elemental)
2440 gcc_assert (se->ss->type == GFC_SS_FUNCTION);
2441 if (se->ss->useflags)
2443 gcc_assert (gfc_return_by_reference (sym)
2444 && sym->result->attr.dimension);
2445 gcc_assert (se->loop != NULL);
2447 /* Access the previously obtained result. */
2448 gfc_conv_tmp_array_ref (se);
2449 gfc_advance_se_ss_chain (se);
2453 info = &se->ss->data.info;
2458 gfc_init_block (&post);
2459 gfc_init_interface_mapping (&mapping);
2460 need_interface_mapping = ((sym->ts.type == BT_CHARACTER
2461 && sym->ts.cl->length
2462 && sym->ts.cl->length->expr_type
2464 || sym->attr.dimension);
2465 formal = sym->formal;
2466 /* Evaluate the arguments. */
2467 for (; arg != NULL; arg = arg->next, formal = formal ? formal->next : NULL)
2470 fsym = formal ? formal->sym : NULL;
2471 parm_kind = MISSING;
2475 if (se->ignore_optional)
2477 /* Some intrinsics have already been resolved to the correct
2481 else if (arg->label)
2483 has_alternate_specifier = 1;
2488 /* Pass a NULL pointer for an absent arg. */
2489 gfc_init_se (&parmse, NULL);
2490 parmse.expr = null_pointer_node;
2491 if (arg->missing_arg_type == BT_CHARACTER)
2492 parmse.string_length = build_int_cst (gfc_charlen_type_node, 0);
2495 else if (se->ss && se->ss->useflags)
2497 /* An elemental function inside a scalarized loop. */
2498 gfc_init_se (&parmse, se);
2499 gfc_conv_expr_reference (&parmse, e);
2500 parm_kind = ELEMENTAL;
2504 /* A scalar or transformational function. */
2505 gfc_init_se (&parmse, NULL);
2506 argss = gfc_walk_expr (e);
2508 if (argss == gfc_ss_terminator)
2510 if (fsym && fsym->attr.value)
2512 if (fsym->ts.type == BT_CHARACTER
2513 && fsym->ts.is_c_interop
2514 && fsym->ns->proc_name != NULL
2515 && fsym->ns->proc_name->attr.is_bind_c)
2518 gfc_conv_scalar_char_value (fsym, &parmse, &e);
2519 if (parmse.expr == NULL)
2520 gfc_conv_expr (&parmse, e);
2523 gfc_conv_expr (&parmse, e);
2525 else if (arg->name && arg->name[0] == '%')
2526 /* Argument list functions %VAL, %LOC and %REF are signalled
2527 through arg->name. */
2528 conv_arglist_function (&parmse, arg->expr, arg->name);
2529 else if ((e->expr_type == EXPR_FUNCTION)
2530 && e->symtree->n.sym->attr.pointer
2531 && fsym && fsym->attr.target)
2533 gfc_conv_expr (&parmse, e);
2534 parmse.expr = build_fold_addr_expr (parmse.expr);
2538 gfc_conv_expr_reference (&parmse, e);
2539 if (fsym && e->expr_type != EXPR_NULL
2540 && ((fsym->attr.pointer
2541 && fsym->attr.flavor != FL_PROCEDURE)
2542 || fsym->attr.proc_pointer))
2544 /* Scalar pointer dummy args require an extra level of
2545 indirection. The null pointer already contains
2546 this level of indirection. */
2547 parm_kind = SCALAR_POINTER;
2548 parmse.expr = build_fold_addr_expr (parmse.expr);
2554 /* If the procedure requires an explicit interface, the actual
2555 argument is passed according to the corresponding formal
2556 argument. If the corresponding formal argument is a POINTER,
2557 ALLOCATABLE or assumed shape, we do not use g77's calling
2558 convention, and pass the address of the array descriptor
2559 instead. Otherwise we use g77's calling convention. */
2562 && !(fsym->attr.pointer || fsym->attr.allocatable)
2563 && fsym->as->type != AS_ASSUMED_SHAPE;
2564 f = f || !sym->attr.always_explicit;
2566 if (e->expr_type == EXPR_VARIABLE
2567 && is_subref_array (e))
2568 /* The actual argument is a component reference to an
2569 array of derived types. In this case, the argument
2570 is converted to a temporary, which is passed and then
2571 written back after the procedure call. */
2572 gfc_conv_subref_array_arg (&parmse, e, f,
2573 fsym ? fsym->attr.intent : INTENT_INOUT);
2575 gfc_conv_array_parameter (&parmse, e, argss, f, fsym,
2578 /* If an ALLOCATABLE dummy argument has INTENT(OUT) and is
2579 allocated on entry, it must be deallocated. */
2580 if (fsym && fsym->attr.allocatable
2581 && fsym->attr.intent == INTENT_OUT)
2583 tmp = build_fold_indirect_ref (parmse.expr);
2584 tmp = gfc_trans_dealloc_allocated (tmp);
2585 gfc_add_expr_to_block (&se->pre, tmp);
2591 /* The case with fsym->attr.optional is that of a user subroutine
2592 with an interface indicating an optional argument. When we call
2593 an intrinsic subroutine, however, fsym is NULL, but we might still
2594 have an optional argument, so we proceed to the substitution
2596 if (e && (fsym == NULL || fsym->attr.optional))
2598 /* If an optional argument is itself an optional dummy argument,
2599 check its presence and substitute a null if absent. */
2600 if (e->expr_type == EXPR_VARIABLE
2601 && e->symtree->n.sym->attr.optional)
2602 gfc_conv_missing_dummy (&parmse, e, fsym ? fsym->ts : e->ts,
2603 e->representation.length);
2608 /* Obtain the character length of an assumed character length
2609 length procedure from the typespec. */
2610 if (fsym->ts.type == BT_CHARACTER
2611 && parmse.string_length == NULL_TREE
2612 && e->ts.type == BT_PROCEDURE
2613 && e->symtree->n.sym->ts.type == BT_CHARACTER
2614 && e->symtree->n.sym->ts.cl->length != NULL)
2616 gfc_conv_const_charlen (e->symtree->n.sym->ts.cl);
2617 parmse.string_length = e->symtree->n.sym->ts.cl->backend_decl;
2621 if (fsym && need_interface_mapping && e)
2622 gfc_add_interface_mapping (&mapping, fsym, &parmse, e);
2624 gfc_add_block_to_block (&se->pre, &parmse.pre);
2625 gfc_add_block_to_block (&post, &parmse.post);
2627 /* Allocated allocatable components of derived types must be
2628 deallocated for INTENT(OUT) dummy arguments and non-variable
2629 scalars. Non-variable arrays are dealt with in trans-array.c
2630 (gfc_conv_array_parameter). */
2631 if (e && e->ts.type == BT_DERIVED
2632 && e->ts.derived->attr.alloc_comp
2633 && ((formal && formal->sym->attr.intent == INTENT_OUT)
2635 (e->expr_type != EXPR_VARIABLE && !e->rank)))
2638 tmp = build_fold_indirect_ref (parmse.expr);
2639 parm_rank = e->rank;
2647 case (SCALAR_POINTER):
2648 tmp = build_fold_indirect_ref (tmp);
2655 tmp = gfc_deallocate_alloc_comp (e->ts.derived, tmp, parm_rank);
2656 if (e->expr_type == EXPR_VARIABLE && e->symtree->n.sym->attr.optional)
2657 tmp = build3_v (COND_EXPR, gfc_conv_expr_present (e->symtree->n.sym),
2658 tmp, build_empty_stmt ());
2660 if (e->expr_type != EXPR_VARIABLE)
2661 /* Don't deallocate non-variables until they have been used. */
2662 gfc_add_expr_to_block (&se->post, tmp);
2665 gcc_assert (formal && formal->sym->attr.intent == INTENT_OUT);
2666 gfc_add_expr_to_block (&se->pre, tmp);
2670 /* Character strings are passed as two parameters, a length and a
2671 pointer - except for Bind(c) which only passes the pointer. */
2672 if (parmse.string_length != NULL_TREE && !sym->attr.is_bind_c)
2673 stringargs = gfc_chainon_list (stringargs, parmse.string_length);
2675 arglist = gfc_chainon_list (arglist, parmse.expr);
2677 gfc_finish_interface_mapping (&mapping, &se->pre, &se->post);
2680 if (ts.type == BT_CHARACTER && sym->attr.is_bind_c)
2681 se->string_length = build_int_cst (gfc_charlen_type_node, 1);
2682 else if (ts.type == BT_CHARACTER)
2684 if (sym->ts.cl->length == NULL)
2686 /* Assumed character length results are not allowed by 5.1.1.5 of the
2687 standard and are trapped in resolve.c; except in the case of SPREAD
2688 (and other intrinsics?) and dummy functions. In the case of SPREAD,
2689 we take the character length of the first argument for the result.
2690 For dummies, we have to look through the formal argument list for
2691 this function and use the character length found there.*/
2692 if (!sym->attr.dummy)
2693 cl.backend_decl = TREE_VALUE (stringargs);
2696 formal = sym->ns->proc_name->formal;
2697 for (; formal; formal = formal->next)
2698 if (strcmp (formal->sym->name, sym->name) == 0)
2699 cl.backend_decl = formal->sym->ts.cl->backend_decl;
2706 /* Calculate the length of the returned string. */
2707 gfc_init_se (&parmse, NULL);
2708 if (need_interface_mapping)
2709 gfc_apply_interface_mapping (&mapping, &parmse, sym->ts.cl->length);
2711 gfc_conv_expr (&parmse, sym->ts.cl->length);
2712 gfc_add_block_to_block (&se->pre, &parmse.pre);
2713 gfc_add_block_to_block (&se->post, &parmse.post);
2715 tmp = fold_convert (gfc_charlen_type_node, parmse.expr);
2716 tmp = fold_build2 (MAX_EXPR, gfc_charlen_type_node, tmp,
2717 build_int_cst (gfc_charlen_type_node, 0));
2718 cl.backend_decl = tmp;
2721 /* Set up a charlen structure for it. */
2726 len = cl.backend_decl;
2729 byref = gfc_return_by_reference (sym);
2732 if (se->direct_byref)
2734 /* Sometimes, too much indirection can be applied; e.g. for
2735 function_result = array_valued_recursive_function. */
2736 if (TREE_TYPE (TREE_TYPE (se->expr))
2737 && TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr)))
2738 && GFC_DESCRIPTOR_TYPE_P
2739 (TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr)))))
2740 se->expr = build_fold_indirect_ref (se->expr);
2742 retargs = gfc_chainon_list (retargs, se->expr);
2744 else if (sym->result->attr.dimension)
2746 gcc_assert (se->loop && info);
2748 /* Set the type of the array. */
2749 tmp = gfc_typenode_for_spec (&ts);
2750 info->dimen = se->loop->dimen;
2752 /* Evaluate the bounds of the result, if known. */
2753 gfc_set_loop_bounds_from_array_spec (&mapping, se, sym->result->as);
2755 /* Create a temporary to store the result. In case the function
2756 returns a pointer, the temporary will be a shallow copy and
2757 mustn't be deallocated. */
2758 callee_alloc = sym->attr.allocatable || sym->attr.pointer;
2759 gfc_trans_create_temp_array (&se->pre, &se->post, se->loop, info, tmp,
2760 false, !sym->attr.pointer, callee_alloc,
2761 &se->ss->expr->where);
2763 /* Pass the temporary as the first argument. */
2764 tmp = info->descriptor;
2765 tmp = build_fold_addr_expr (tmp);
2766 retargs = gfc_chainon_list (retargs, tmp);
2768 else if (ts.type == BT_CHARACTER)
2770 /* Pass the string length. */
2771 type = gfc_get_character_type (ts.kind, ts.cl);
2772 type = build_pointer_type (type);
2774 /* Return an address to a char[0:len-1]* temporary for
2775 character pointers. */
2776 if (sym->attr.pointer || sym->attr.allocatable)
2778 var = gfc_create_var (type, "pstr");
2780 /* Provide an address expression for the function arguments. */
2781 var = build_fold_addr_expr (var);
2784 var = gfc_conv_string_tmp (se, type, len);
2786 retargs = gfc_chainon_list (retargs, var);
2790 gcc_assert (gfc_option.flag_f2c && ts.type == BT_COMPLEX);
2792 type = gfc_get_complex_type (ts.kind);
2793 var = build_fold_addr_expr (gfc_create_var (type, "cmplx"));
2794 retargs = gfc_chainon_list (retargs, var);
2797 /* Add the string length to the argument list. */
2798 if (ts.type == BT_CHARACTER)
2799 retargs = gfc_chainon_list (retargs, len);
2801 gfc_free_interface_mapping (&mapping);
2803 /* Add the return arguments. */
2804 arglist = chainon (retargs, arglist);
2806 /* Add the hidden string length parameters to the arguments. */
2807 arglist = chainon (arglist, stringargs);
2809 /* We may want to append extra arguments here. This is used e.g. for
2810 calls to libgfortran_matmul_??, which need extra information. */
2811 if (append_args != NULL_TREE)
2812 arglist = chainon (arglist, append_args);
2814 /* Generate the actual call. */
2815 gfc_conv_function_val (se, sym);
2817 /* If there are alternate return labels, function type should be
2818 integer. Can't modify the type in place though, since it can be shared
2819 with other functions. For dummy arguments, the typing is done to
2820 to this result, even if it has to be repeated for each call. */
2821 if (has_alternate_specifier
2822 && TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr))) != integer_type_node)
2824 if (!sym->attr.dummy)
2826 TREE_TYPE (sym->backend_decl)
2827 = build_function_type (integer_type_node,
2828 TYPE_ARG_TYPES (TREE_TYPE (sym->backend_decl)));
2829 se->expr = build_fold_addr_expr (sym->backend_decl);
2832 TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr))) = integer_type_node;
2835 fntype = TREE_TYPE (TREE_TYPE (se->expr));
2836 se->expr = build_call_list (TREE_TYPE (fntype), se->expr, arglist);
2838 /* If we have a pointer function, but we don't want a pointer, e.g.
2841 where f is pointer valued, we have to dereference the result. */
2842 if (!se->want_pointer && !byref && sym->attr.pointer)
2843 se->expr = build_fold_indirect_ref (se->expr);
2845 /* f2c calling conventions require a scalar default real function to
2846 return a double precision result. Convert this back to default
2847 real. We only care about the cases that can happen in Fortran 77.
2849 if (gfc_option.flag_f2c && sym->ts.type == BT_REAL
2850 && sym->ts.kind == gfc_default_real_kind
2851 && !sym->attr.always_explicit)
2852 se->expr = fold_convert (gfc_get_real_type (sym->ts.kind), se->expr);
2854 /* A pure function may still have side-effects - it may modify its
2856 TREE_SIDE_EFFECTS (se->expr) = 1;
2858 if (!sym->attr.pure)
2859 TREE_SIDE_EFFECTS (se->expr) = 1;
2864 /* Add the function call to the pre chain. There is no expression. */
2865 gfc_add_expr_to_block (&se->pre, se->expr);
2866 se->expr = NULL_TREE;
2868 if (!se->direct_byref)
2870 if (sym->attr.dimension)
2872 if (flag_bounds_check)
2874 /* Check the data pointer hasn't been modified. This would
2875 happen in a function returning a pointer. */
2876 tmp = gfc_conv_descriptor_data_get (info->descriptor);
2877 tmp = fold_build2 (NE_EXPR, boolean_type_node,
2879 gfc_trans_runtime_check (true, false, tmp, &se->pre, NULL,
2882 se->expr = info->descriptor;
2883 /* Bundle in the string length. */
2884 se->string_length = len;
2886 else if (sym->ts.type == BT_CHARACTER)
2888 /* Dereference for character pointer results. */
2889 if (sym->attr.pointer || sym->attr.allocatable)
2890 se->expr = build_fold_indirect_ref (var);
2894 se->string_length = len;
2898 gcc_assert (sym->ts.type == BT_COMPLEX && gfc_option.flag_f2c);
2899 se->expr = build_fold_indirect_ref (var);
2904 /* Follow the function call with the argument post block. */
2906 gfc_add_block_to_block (&se->pre, &post);
2908 gfc_add_block_to_block (&se->post, &post);
2910 return has_alternate_specifier;
2914 /* Fill a character string with spaces. */
2917 fill_with_spaces (tree start, tree type, tree size)
2919 stmtblock_t block, loop;
2920 tree i, el, exit_label, cond, tmp;
2922 /* For a simple char type, we can call memset(). */
2923 if (compare_tree_int (TYPE_SIZE_UNIT (type), 1) == 0)
2924 return build_call_expr (built_in_decls[BUILT_IN_MEMSET], 3, start,
2925 build_int_cst (gfc_get_int_type (gfc_c_int_kind),
2926 lang_hooks.to_target_charset (' ')),
2929 /* Otherwise, we use a loop:
2930 for (el = start, i = size; i > 0; el--, i+= TYPE_SIZE_UNIT (type))
2934 /* Initialize variables. */
2935 gfc_init_block (&block);
2936 i = gfc_create_var (sizetype, "i");
2937 gfc_add_modify (&block, i, fold_convert (sizetype, size));
2938 el = gfc_create_var (build_pointer_type (type), "el");
2939 gfc_add_modify (&block, el, fold_convert (TREE_TYPE (el), start));
2940 exit_label = gfc_build_label_decl (NULL_TREE);
2941 TREE_USED (exit_label) = 1;
2945 gfc_init_block (&loop);
2947 /* Exit condition. */
2948 cond = fold_build2 (LE_EXPR, boolean_type_node, i,
2949 fold_convert (sizetype, integer_zero_node));
2950 tmp = build1_v (GOTO_EXPR, exit_label);
2951 tmp = fold_build3 (COND_EXPR, void_type_node, cond, tmp, build_empty_stmt ());
2952 gfc_add_expr_to_block (&loop, tmp);
2955 gfc_add_modify (&loop, fold_build1 (INDIRECT_REF, type, el),
2956 build_int_cst (type,
2957 lang_hooks.to_target_charset (' ')));
2959 /* Increment loop variables. */
2960 gfc_add_modify (&loop, i, fold_build2 (MINUS_EXPR, sizetype, i,
2961 TYPE_SIZE_UNIT (type)));
2962 gfc_add_modify (&loop, el, fold_build2 (POINTER_PLUS_EXPR,
2964 TYPE_SIZE_UNIT (type)));
2966 /* Making the loop... actually loop! */
2967 tmp = gfc_finish_block (&loop);
2968 tmp = build1_v (LOOP_EXPR, tmp);
2969 gfc_add_expr_to_block (&block, tmp);
2971 /* The exit label. */
2972 tmp = build1_v (LABEL_EXPR, exit_label);
2973 gfc_add_expr_to_block (&block, tmp);
2976 return gfc_finish_block (&block);
2980 /* Generate code to copy a string. */
2983 gfc_trans_string_copy (stmtblock_t * block, tree dlength, tree dest,
2984 int dkind, tree slength, tree src, int skind)
2986 tree tmp, dlen, slen;
2995 stmtblock_t tempblock;
2997 gcc_assert (dkind == skind);
2999 if (slength != NULL_TREE)
3001 slen = fold_convert (size_type_node, gfc_evaluate_now (slength, block));
3002 ssc = string_to_single_character (slen, src, skind);
3006 slen = build_int_cst (size_type_node, 1);
3010 if (dlength != NULL_TREE)
3012 dlen = fold_convert (size_type_node, gfc_evaluate_now (dlength, block));
3013 dsc = string_to_single_character (slen, dest, dkind);
3017 dlen = build_int_cst (size_type_node, 1);
3021 if (slength != NULL_TREE && POINTER_TYPE_P (TREE_TYPE (src)))
3022 ssc = string_to_single_character (slen, src, skind);
3023 if (dlength != NULL_TREE && POINTER_TYPE_P (TREE_TYPE (dest)))
3024 dsc = string_to_single_character (dlen, dest, dkind);
3027 /* Assign directly if the types are compatible. */
3028 if (dsc != NULL_TREE && ssc != NULL_TREE
3029 && TREE_TYPE (dsc) == TREE_TYPE (ssc))
3031 gfc_add_modify (block, dsc, ssc);
3035 /* Do nothing if the destination length is zero. */
3036 cond = fold_build2 (GT_EXPR, boolean_type_node, dlen,
3037 build_int_cst (size_type_node, 0));
3039 /* The following code was previously in _gfortran_copy_string:
3041 // The two strings may overlap so we use memmove.
3043 copy_string (GFC_INTEGER_4 destlen, char * dest,
3044 GFC_INTEGER_4 srclen, const char * src)
3046 if (srclen >= destlen)
3048 // This will truncate if too long.
3049 memmove (dest, src, destlen);
3053 memmove (dest, src, srclen);
3055 memset (&dest[srclen], ' ', destlen - srclen);
3059 We're now doing it here for better optimization, but the logic
3062 /* For non-default character kinds, we have to multiply the string
3063 length by the base type size. */
3064 chartype = gfc_get_char_type (dkind);
3065 slen = fold_build2 (MULT_EXPR, size_type_node, slen,
3066 TYPE_SIZE_UNIT (chartype));
3067 dlen = fold_build2 (MULT_EXPR, size_type_node, dlen,
3068 TYPE_SIZE_UNIT (chartype));
3071 dest = fold_convert (pvoid_type_node, dest);
3073 dest = gfc_build_addr_expr (pvoid_type_node, dest);
3076 src = fold_convert (pvoid_type_node, src);
3078 src = gfc_build_addr_expr (pvoid_type_node, src);
3080 /* Truncate string if source is too long. */
3081 cond2 = fold_build2 (GE_EXPR, boolean_type_node, slen, dlen);
3082 tmp2 = build_call_expr (built_in_decls[BUILT_IN_MEMMOVE],
3083 3, dest, src, dlen);
3085 /* Else copy and pad with spaces. */
3086 tmp3 = build_call_expr (built_in_decls[BUILT_IN_MEMMOVE],
3087 3, dest, src, slen);
3089 tmp4 = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (dest), dest,
3090 fold_convert (sizetype, slen));
3091 tmp4 = fill_with_spaces (tmp4, chartype,
3092 fold_build2 (MINUS_EXPR, TREE_TYPE(dlen),
3095 gfc_init_block (&tempblock);
3096 gfc_add_expr_to_block (&tempblock, tmp3);
3097 gfc_add_expr_to_block (&tempblock, tmp4);
3098 tmp3 = gfc_finish_block (&tempblock);
3100 /* The whole copy_string function is there. */
3101 tmp = fold_build3 (COND_EXPR, void_type_node, cond2, tmp2, tmp3);
3102 tmp = fold_build3 (COND_EXPR, void_type_node, cond, tmp, build_empty_stmt ());
3103 gfc_add_expr_to_block (block, tmp);
3107 /* Translate a statement function.
3108 The value of a statement function reference is obtained by evaluating the
3109 expression using the values of the actual arguments for the values of the
3110 corresponding dummy arguments. */
3113 gfc_conv_statement_function (gfc_se * se, gfc_expr * expr)
3117 gfc_formal_arglist *fargs;
3118 gfc_actual_arglist *args;
3121 gfc_saved_var *saved_vars;
3127 sym = expr->symtree->n.sym;
3128 args = expr->value.function.actual;
3129 gfc_init_se (&lse, NULL);
3130 gfc_init_se (&rse, NULL);
3133 for (fargs = sym->formal; fargs; fargs = fargs->next)
3135 saved_vars = (gfc_saved_var *)gfc_getmem (n * sizeof (gfc_saved_var));
3136 temp_vars = (tree *)gfc_getmem (n * sizeof (tree));
3138 for (fargs = sym->formal, n = 0; fargs; fargs = fargs->next, n++)
3140 /* Each dummy shall be specified, explicitly or implicitly, to be
3142 gcc_assert (fargs->sym->attr.dimension == 0);
3145 /* Create a temporary to hold the value. */
3146 type = gfc_typenode_for_spec (&fsym->ts);
3147 temp_vars[n] = gfc_create_var (type, fsym->name);
3149 if (fsym->ts.type == BT_CHARACTER)
3151 /* Copy string arguments. */
3154 gcc_assert (fsym->ts.cl && fsym->ts.cl->length
3155 && fsym->ts.cl->length->expr_type == EXPR_CONSTANT);
3157 arglen = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
3158 tmp = gfc_build_addr_expr (build_pointer_type (type),
3161 gfc_conv_expr (&rse, args->expr);
3162 gfc_conv_string_parameter (&rse);
3163 gfc_add_block_to_block (&se->pre, &lse.pre);
3164 gfc_add_block_to_block (&se->pre, &rse.pre);
3166 gfc_trans_string_copy (&se->pre, arglen, tmp, fsym->ts.kind,
3167 rse.string_length, rse.expr, fsym->ts.kind);
3168 gfc_add_block_to_block (&se->pre, &lse.post);
3169 gfc_add_block_to_block (&se->pre, &rse.post);
3173 /* For everything else, just evaluate the expression. */
3174 gfc_conv_expr (&lse, args->expr);
3176 gfc_add_block_to_block (&se->pre, &lse.pre);
3177 gfc_add_modify (&se->pre, temp_vars[n], lse.expr);
3178 gfc_add_block_to_block (&se->pre, &lse.post);
3184 /* Use the temporary variables in place of the real ones. */
3185 for (fargs = sym->formal, n = 0; fargs; fargs = fargs->next, n++)
3186 gfc_shadow_sym (fargs->sym, temp_vars[n], &saved_vars[n]);
3188 gfc_conv_expr (se, sym->value);
3190 if (sym->ts.type == BT_CHARACTER)
3192 gfc_conv_const_charlen (sym->ts.cl);
3194 /* Force the expression to the correct length. */
3195 if (!INTEGER_CST_P (se->string_length)
3196 || tree_int_cst_lt (se->string_length,
3197 sym->ts.cl->backend_decl))
3199 type = gfc_get_character_type (sym->ts.kind, sym->ts.cl);
3200 tmp = gfc_create_var (type, sym->name);
3201 tmp = gfc_build_addr_expr (build_pointer_type (type), tmp);
3202 gfc_trans_string_copy (&se->pre, sym->ts.cl->backend_decl, tmp,
3203 sym->ts.kind, se->string_length, se->expr,
3207 se->string_length = sym->ts.cl->backend_decl;
3210 /* Restore the original variables. */
3211 for (fargs = sym->formal, n = 0; fargs; fargs = fargs->next, n++)
3212 gfc_restore_sym (fargs->sym, &saved_vars[n]);
3213 gfc_free (saved_vars);
3217 /* Translate a function expression. */
3220 gfc_conv_function_expr (gfc_se * se, gfc_expr * expr)
3224 if (expr->value.function.isym)
3226 gfc_conv_intrinsic_function (se, expr);
3230 /* We distinguish statement functions from general functions to improve
3231 runtime performance. */
3232 if (expr->symtree->n.sym->attr.proc == PROC_ST_FUNCTION)
3234 gfc_conv_statement_function (se, expr);
3238 /* expr.value.function.esym is the resolved (specific) function symbol for
3239 most functions. However this isn't set for dummy procedures. */
3240 sym = expr->value.function.esym;
3242 sym = expr->symtree->n.sym;
3243 gfc_conv_function_call (se, sym, expr->value.function.actual, NULL_TREE);
3248 gfc_conv_array_constructor_expr (gfc_se * se, gfc_expr * expr)
3250 gcc_assert (se->ss != NULL && se->ss != gfc_ss_terminator);
3251 gcc_assert (se->ss->expr == expr && se->ss->type == GFC_SS_CONSTRUCTOR);
3253 gfc_conv_tmp_array_ref (se);
3254 gfc_advance_se_ss_chain (se);
3258 /* Build a static initializer. EXPR is the expression for the initial value.
3259 The other parameters describe the variable of the component being
3260 initialized. EXPR may be null. */
3263 gfc_conv_initializer (gfc_expr * expr, gfc_typespec * ts, tree type,
3264 bool array, bool pointer)
3268 if (!(expr || pointer))
3271 /* Check if we have ISOCBINDING_NULL_PTR or ISOCBINDING_NULL_FUNPTR
3272 (these are the only two iso_c_binding derived types that can be
3273 used as initialization expressions). If so, we need to modify
3274 the 'expr' to be that for a (void *). */
3275 if (expr != NULL && expr->ts.type == BT_DERIVED
3276 && expr->ts.is_iso_c && expr->ts.derived)
3278 gfc_symbol *derived = expr->ts.derived;
3280 expr = gfc_int_expr (0);
3282 /* The derived symbol has already been converted to a (void *). Use
3284 expr->ts.f90_type = derived->ts.f90_type;
3285 expr->ts.kind = derived->ts.kind;
3290 /* Arrays need special handling. */
3292 return gfc_build_null_descriptor (type);
3294 return gfc_conv_array_initializer (type, expr);
3297 return fold_convert (type, null_pointer_node);
3303 gfc_init_se (&se, NULL);
3304 gfc_conv_structure (&se, expr, 1);
3308 return gfc_conv_string_init (ts->cl->backend_decl,expr);
3311 gfc_init_se (&se, NULL);
3312 gfc_conv_constant (&se, expr);
3319 gfc_trans_subarray_assign (tree dest, gfc_component * cm, gfc_expr * expr)
3331 gfc_start_block (&block);
3333 /* Initialize the scalarizer. */
3334 gfc_init_loopinfo (&loop);
3336 gfc_init_se (&lse, NULL);
3337 gfc_init_se (&rse, NULL);
3340 rss = gfc_walk_expr (expr);
3341 if (rss == gfc_ss_terminator)
3343 /* The rhs is scalar. Add a ss for the expression. */
3344 rss = gfc_get_ss ();
3345 rss->next = gfc_ss_terminator;
3346 rss->type = GFC_SS_SCALAR;
3350 /* Create a SS for the destination. */
3351 lss = gfc_get_ss ();
3352 lss->type = GFC_SS_COMPONENT;
3354 lss->shape = gfc_get_shape (cm->as->rank);
3355 lss->next = gfc_ss_terminator;
3356 lss->data.info.dimen = cm->as->rank;
3357 lss->data.info.descriptor = dest;
3358 lss->data.info.data = gfc_conv_array_data (dest);
3359 lss->data.info.offset = gfc_conv_array_offset (dest);
3360 for (n = 0; n < cm->as->rank; n++)
3362 lss->data.info.dim[n] = n;
3363 lss->data.info.start[n] = gfc_conv_array_lbound (dest, n);
3364 lss->data.info.stride[n] = gfc_index_one_node;
3366 mpz_init (lss->shape[n]);
3367 mpz_sub (lss->shape[n], cm->as->upper[n]->value.integer,
3368 cm->as->lower[n]->value.integer);
3369 mpz_add_ui (lss->shape[n], lss->shape[n], 1);
3372 /* Associate the SS with the loop. */
3373 gfc_add_ss_to_loop (&loop, lss);
3374 gfc_add_ss_to_loop (&loop, rss);
3376 /* Calculate the bounds of the scalarization. */
3377 gfc_conv_ss_startstride (&loop);
3379 /* Setup the scalarizing loops. */
3380 gfc_conv_loop_setup (&loop, &expr->where);
3382 /* Setup the gfc_se structures. */
3383 gfc_copy_loopinfo_to_se (&lse, &loop);
3384 gfc_copy_loopinfo_to_se (&rse, &loop);
3387 gfc_mark_ss_chain_used (rss, 1);
3389 gfc_mark_ss_chain_used (lss, 1);
3391 /* Start the scalarized loop body. */
3392 gfc_start_scalarized_body (&loop, &body);
3394 gfc_conv_tmp_array_ref (&lse);
3395 if (cm->ts.type == BT_CHARACTER)
3396 lse.string_length = cm->ts.cl->backend_decl;
3398 gfc_conv_expr (&rse, expr);
3400 tmp = gfc_trans_scalar_assign (&lse, &rse, cm->ts, true, false);
3401 gfc_add_expr_to_block (&body, tmp);
3403 gcc_assert (rse.ss == gfc_ss_terminator);
3405 /* Generate the copying loops. */
3406 gfc_trans_scalarizing_loops (&loop, &body);
3408 /* Wrap the whole thing up. */
3409 gfc_add_block_to_block (&block, &loop.pre);
3410 gfc_add_block_to_block (&block, &loop.post);
3412 for (n = 0; n < cm->as->rank; n++)
3413 mpz_clear (lss->shape[n]);
3414 gfc_free (lss->shape);
3416 gfc_cleanup_loop (&loop);
3418 return gfc_finish_block (&block);
3422 /* Assign a single component of a derived type constructor. */
3425 gfc_trans_subcomponent_assign (tree dest, gfc_component * cm, gfc_expr * expr)
3435 gfc_start_block (&block);
3437 if (cm->attr.pointer)
3439 gfc_init_se (&se, NULL);
3440 /* Pointer component. */
3441 if (cm->attr.dimension)
3443 /* Array pointer. */
3444 if (expr->expr_type == EXPR_NULL)
3445 gfc_conv_descriptor_data_set (&block, dest, null_pointer_node);
3448 rss = gfc_walk_expr (expr);
3449 se.direct_byref = 1;
3451 gfc_conv_expr_descriptor (&se, expr, rss);
3452 gfc_add_block_to_block (&block, &se.pre);
3453 gfc_add_block_to_block (&block, &se.post);
3458 /* Scalar pointers. */
3459 se.want_pointer = 1;
3460 gfc_conv_expr (&se, expr);
3461 gfc_add_block_to_block (&block, &se.pre);
3462 gfc_add_modify (&block, dest,
3463 fold_convert (TREE_TYPE (dest), se.expr));
3464 gfc_add_block_to_block (&block, &se.post);
3467 else if (cm->attr.dimension)
3469 if (cm->attr.allocatable && expr->expr_type == EXPR_NULL)
3470 gfc_conv_descriptor_data_set (&block, dest, null_pointer_node);
3471 else if (cm->attr.allocatable)
3475 gfc_init_se (&se, NULL);
3477 rss = gfc_walk_expr (expr);
3478 se.want_pointer = 0;
3479 gfc_conv_expr_descriptor (&se, expr, rss);
3480 gfc_add_block_to_block (&block, &se.pre);
3482 tmp = fold_convert (TREE_TYPE (dest), se.expr);
3483 gfc_add_modify (&block, dest, tmp);
3485 if (cm->ts.type == BT_DERIVED && cm->ts.derived->attr.alloc_comp)
3486 tmp = gfc_copy_alloc_comp (cm->ts.derived, se.expr, dest,
3489 tmp = gfc_duplicate_allocatable (dest, se.expr,
3490 TREE_TYPE(cm->backend_decl),
3493 gfc_add_expr_to_block (&block, tmp);
3495 gfc_add_block_to_block (&block, &se.post);
3496 gfc_conv_descriptor_data_set (&block, se.expr, null_pointer_node);
3498 /* Shift the lbound and ubound of temporaries to being unity, rather
3499 than zero, based. Calculate the offset for all cases. */
3500 offset = gfc_conv_descriptor_offset (dest);
3501 gfc_add_modify (&block, offset, gfc_index_zero_node);
3502 tmp2 =gfc_create_var (gfc_array_index_type, NULL);
3503 for (n = 0; n < expr->rank; n++)
3505 if (expr->expr_type != EXPR_VARIABLE
3506 && expr->expr_type != EXPR_CONSTANT)
3509 tmp = gfc_conv_descriptor_ubound (dest, gfc_rank_cst[n]);
3510 span = fold_build2 (MINUS_EXPR, gfc_array_index_type, tmp,
3511 gfc_conv_descriptor_lbound (dest, gfc_rank_cst[n]));
3512 gfc_add_modify (&block, tmp,
3513 fold_build2 (PLUS_EXPR,
3514 gfc_array_index_type,
3515 span, gfc_index_one_node));
3516 tmp = gfc_conv_descriptor_lbound (dest, gfc_rank_cst[n]);
3517 gfc_add_modify (&block, tmp, gfc_index_one_node);
3519 tmp = fold_build2 (MULT_EXPR, gfc_array_index_type,
3520 gfc_conv_descriptor_lbound (dest,
3522 gfc_conv_descriptor_stride (dest,
3524 gfc_add_modify (&block, tmp2, tmp);
3525 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, offset, tmp2);
3526 gfc_add_modify (&block, offset, tmp);
3531 tmp = gfc_trans_subarray_assign (dest, cm, expr);
3532 gfc_add_expr_to_block (&block, tmp);
3535 else if (expr->ts.type == BT_DERIVED)
3537 if (expr->expr_type != EXPR_STRUCTURE)
3539 gfc_init_se (&se, NULL);
3540 gfc_conv_expr (&se, expr);
3541 gfc_add_modify (&block, dest,
3542 fold_convert (TREE_TYPE (dest), se.expr));
3546 /* Nested constructors. */
3547 tmp = gfc_trans_structure_assign (dest, expr);
3548 gfc_add_expr_to_block (&block, tmp);
3553 /* Scalar component. */
3554 gfc_init_se (&se, NULL);
3555 gfc_init_se (&lse, NULL);
3557 gfc_conv_expr (&se, expr);
3558 if (cm->ts.type == BT_CHARACTER)
3559 lse.string_length = cm->ts.cl->backend_decl;
3561 tmp = gfc_trans_scalar_assign (&lse, &se, cm->ts, true, false);
3562 gfc_add_expr_to_block (&block, tmp);
3564 return gfc_finish_block (&block);
3567 /* Assign a derived type constructor to a variable. */
3570 gfc_trans_structure_assign (tree dest, gfc_expr * expr)
3578 gfc_start_block (&block);
3579 cm = expr->ts.derived->components;
3580 for (c = expr->value.constructor; c; c = c->next, cm = cm->next)
3582 /* Skip absent members in default initializers. */
3586 /* Update the type/kind of the expression if it represents either
3587 C_NULL_PTR or C_NULL_FUNPTR. This is done here because this may
3588 be the first place reached for initializing output variables that
3589 have components of type C_PTR/C_FUNPTR that are initialized. */
3590 if (c->expr->ts.type == BT_DERIVED && c->expr->ts.derived
3591 && c->expr->ts.derived->attr.is_iso_c)
3593 c->expr->expr_type = EXPR_NULL;
3594 c->expr->ts.type = c->expr->ts.derived->ts.type;
3595 c->expr->ts.f90_type = c->expr->ts.derived->ts.f90_type;
3596 c->expr->ts.kind = c->expr->ts.derived->ts.kind;
3599 field = cm->backend_decl;
3600 tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field),
3601 dest, field, NULL_TREE);
3602 tmp = gfc_trans_subcomponent_assign (tmp, cm, c->expr);
3603 gfc_add_expr_to_block (&block, tmp);
3605 return gfc_finish_block (&block);
3608 /* Build an expression for a constructor. If init is nonzero then
3609 this is part of a static variable initializer. */
3612 gfc_conv_structure (gfc_se * se, gfc_expr * expr, int init)
3619 VEC(constructor_elt,gc) *v = NULL;
3621 gcc_assert (se->ss == NULL);
3622 gcc_assert (expr->expr_type == EXPR_STRUCTURE);
3623 type = gfc_typenode_for_spec (&expr->ts);
3627 /* Create a temporary variable and fill it in. */
3628 se->expr = gfc_create_var (type, expr->ts.derived->name);
3629 tmp = gfc_trans_structure_assign (se->expr, expr);
3630 gfc_add_expr_to_block (&se->pre, tmp);
3634 cm = expr->ts.derived->components;
3636 for (c = expr->value.constructor; c; c = c->next, cm = cm->next)
3638 /* Skip absent members in default initializers and allocatable
3639 components. Although the latter have a default initializer
3640 of EXPR_NULL,... by default, the static nullify is not needed
3641 since this is done every time we come into scope. */
3642 if (!c->expr || cm->attr.allocatable)
3645 val = gfc_conv_initializer (c->expr, &cm->ts,
3646 TREE_TYPE (cm->backend_decl), cm->attr.dimension, cm->attr.pointer);
3648 /* Append it to the constructor list. */
3649 CONSTRUCTOR_APPEND_ELT (v, cm->backend_decl, val);
3651 se->expr = build_constructor (type, v);
3653 TREE_CONSTANT (se->expr) = 1;
3657 /* Translate a substring expression. */
3660 gfc_conv_substring_expr (gfc_se * se, gfc_expr * expr)
3666 gcc_assert (ref == NULL || ref->type == REF_SUBSTRING);
3668 se->expr = gfc_build_wide_string_const (expr->ts.kind,
3669 expr->value.character.length,
3670 expr->value.character.string);
3672 se->string_length = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (se->expr)));
3673 TYPE_STRING_FLAG (TREE_TYPE (se->expr)) = 1;
3676 gfc_conv_substring (se, ref, expr->ts.kind, NULL, &expr->where);
3680 /* Entry point for expression translation. Evaluates a scalar quantity.
3681 EXPR is the expression to be translated, and SE is the state structure if
3682 called from within the scalarized. */
3685 gfc_conv_expr (gfc_se * se, gfc_expr * expr)
3687 if (se->ss && se->ss->expr == expr
3688 && (se->ss->type == GFC_SS_SCALAR || se->ss->type == GFC_SS_REFERENCE))
3690 /* Substitute a scalar expression evaluated outside the scalarization
3692 se->expr = se->ss->data.scalar.expr;
3693 se->string_length = se->ss->string_length;
3694 gfc_advance_se_ss_chain (se);
3698 /* We need to convert the expressions for the iso_c_binding derived types.
3699 C_NULL_PTR and C_NULL_FUNPTR will be made EXPR_NULL, which evaluates to
3700 null_pointer_node. C_PTR and C_FUNPTR are converted to match the
3701 typespec for the C_PTR and C_FUNPTR symbols, which has already been
3702 updated to be an integer with a kind equal to the size of a (void *). */
3703 if (expr->ts.type == BT_DERIVED && expr->ts.derived
3704 && expr->ts.derived->attr.is_iso_c)
3706 if (expr->symtree->n.sym->intmod_sym_id == ISOCBINDING_NULL_PTR
3707 || expr->symtree->n.sym->intmod_sym_id == ISOCBINDING_NULL_FUNPTR)
3709 /* Set expr_type to EXPR_NULL, which will result in
3710 null_pointer_node being used below. */
3711 expr->expr_type = EXPR_NULL;
3715 /* Update the type/kind of the expression to be what the new
3716 type/kind are for the updated symbols of C_PTR/C_FUNPTR. */
3717 expr->ts.type = expr->ts.derived->ts.type;
3718 expr->ts.f90_type = expr->ts.derived->ts.f90_type;
3719 expr->ts.kind = expr->ts.derived->ts.kind;
3723 switch (expr->expr_type)
3726 gfc_conv_expr_op (se, expr);
3730 gfc_conv_function_expr (se, expr);
3734 gfc_conv_constant (se, expr);
3738 gfc_conv_variable (se, expr);
3742 se->expr = null_pointer_node;
3745 case EXPR_SUBSTRING:
3746 gfc_conv_substring_expr (se, expr);
3749 case EXPR_STRUCTURE:
3750 gfc_conv_structure (se, expr, 0);
3754 gfc_conv_array_constructor_expr (se, expr);
3763 /* Like gfc_conv_expr_val, but the value is also suitable for use in the lhs
3764 of an assignment. */
3766 gfc_conv_expr_lhs (gfc_se * se, gfc_expr * expr)
3768 gfc_conv_expr (se, expr);
3769 /* All numeric lvalues should have empty post chains. If not we need to
3770 figure out a way of rewriting an lvalue so that it has no post chain. */
3771 gcc_assert (expr->ts.type == BT_CHARACTER || !se->post.head);
3774 /* Like gfc_conv_expr, but the POST block is guaranteed to be empty for
3775 numeric expressions. Used for scalar values where inserting cleanup code
3778 gfc_conv_expr_val (gfc_se * se, gfc_expr * expr)
3782 gcc_assert (expr->ts.type != BT_CHARACTER);
3783 gfc_conv_expr (se, expr);
3786 val = gfc_create_var (TREE_TYPE (se->expr), NULL);
3787 gfc_add_modify (&se->pre, val, se->expr);
3789 gfc_add_block_to_block (&se->pre, &se->post);
3793 /* Helper to translate an expression and convert it to a particular type. */
3795 gfc_conv_expr_type (gfc_se * se, gfc_expr * expr, tree type)
3797 gfc_conv_expr_val (se, expr);
3798 se->expr = convert (type, se->expr);
3802 /* Converts an expression so that it can be passed by reference. Scalar
3806 gfc_conv_expr_reference (gfc_se * se, gfc_expr * expr)
3810 if (se->ss && se->ss->expr == expr
3811 && se->ss->type == GFC_SS_REFERENCE)
3813 se->expr = se->ss->data.scalar.expr;
3814 se->string_length = se->ss->string_length;
3815 gfc_advance_se_ss_chain (se);
3819 if (expr->ts.type == BT_CHARACTER)
3821 gfc_conv_expr (se, expr);
3822 gfc_conv_string_parameter (se);
3826 if (expr->expr_type == EXPR_VARIABLE)
3828 se->want_pointer = 1;
3829 gfc_conv_expr (se, expr);
3832 var = gfc_create_var (TREE_TYPE (se->expr), NULL);
3833 gfc_add_modify (&se->pre, var, se->expr);
3834 gfc_add_block_to_block (&se->pre, &se->post);
3840 if (expr->expr_type == EXPR_FUNCTION
3841 && expr->symtree->n.sym->attr.pointer
3842 && !expr->symtree->n.sym->attr.dimension)
3844 se->want_pointer = 1;
3845 gfc_conv_expr (se, expr);
3846 var = gfc_create_var (TREE_TYPE (se->expr), NULL);
3847 gfc_add_modify (&se->pre, var, se->expr);
3853 gfc_conv_expr (se, expr);
3855 /* Create a temporary var to hold the value. */
3856 if (TREE_CONSTANT (se->expr))
3858 tree tmp = se->expr;
3859 STRIP_TYPE_NOPS (tmp);
3860 var = build_decl (CONST_DECL, NULL, TREE_TYPE (tmp));
3861 DECL_INITIAL (var) = tmp;
3862 TREE_STATIC (var) = 1;
3867 var = gfc_create_var (TREE_TYPE (se->expr), NULL);
3868 gfc_add_modify (&se->pre, var, se->expr);
3870 gfc_add_block_to_block (&se->pre, &se->post);
3872 /* Take the address of that value. */
3873 se->expr = build_fold_addr_expr (var);
3878 gfc_trans_pointer_assign (gfc_code * code)
3880 return gfc_trans_pointer_assignment (code->expr, code->expr2);
3884 /* Generate code for a pointer assignment. */
3887 gfc_trans_pointer_assignment (gfc_expr * expr1, gfc_expr * expr2)
3899 gfc_start_block (&block);
3901 gfc_init_se (&lse, NULL);
3903 lss = gfc_walk_expr (expr1);
3904 rss = gfc_walk_expr (expr2);
3905 if (lss == gfc_ss_terminator)
3907 /* Scalar pointers. */
3908 lse.want_pointer = 1;
3909 gfc_conv_expr (&lse, expr1);
3910 gcc_assert (rss == gfc_ss_terminator);
3911 gfc_init_se (&rse, NULL);
3912 rse.want_pointer = 1;
3913 gfc_conv_expr (&rse, expr2);
3915 if (expr1->symtree->n.sym->attr.proc_pointer
3916 && expr1->symtree->n.sym->attr.dummy)
3917 lse.expr = build_fold_indirect_ref (lse.expr);
3919 gfc_add_block_to_block (&block, &lse.pre);
3920 gfc_add_block_to_block (&block, &rse.pre);
3921 gfc_add_modify (&block, lse.expr,
3922 fold_convert (TREE_TYPE (lse.expr), rse.expr));
3923 gfc_add_block_to_block (&block, &rse.post);
3924 gfc_add_block_to_block (&block, &lse.post);
3928 /* Array pointer. */
3929 gfc_conv_expr_descriptor (&lse, expr1, lss);
3930 switch (expr2->expr_type)
3933 /* Just set the data pointer to null. */
3934 gfc_conv_descriptor_data_set (&lse.pre, lse.expr, null_pointer_node);
3938 /* Assign directly to the pointer's descriptor. */
3939 lse.direct_byref = 1;
3940 gfc_conv_expr_descriptor (&lse, expr2, rss);
3942 /* If this is a subreference array pointer assignment, use the rhs
3943 descriptor element size for the lhs span. */
3944 if (expr1->symtree->n.sym->attr.subref_array_pointer)
3946 decl = expr1->symtree->n.sym->backend_decl;
3947 gfc_init_se (&rse, NULL);
3948 rse.descriptor_only = 1;
3949 gfc_conv_expr (&rse, expr2);
3950 tmp = gfc_get_element_type (TREE_TYPE (rse.expr));
3951 tmp = fold_convert (gfc_array_index_type, size_in_bytes (tmp));
3952 if (!INTEGER_CST_P (tmp))
3953 gfc_add_block_to_block (&lse.post, &rse.pre);
3954 gfc_add_modify (&lse.post, GFC_DECL_SPAN(decl), tmp);
3960 /* Assign to a temporary descriptor and then copy that
3961 temporary to the pointer. */
3963 tmp = gfc_create_var (TREE_TYPE (desc), "ptrtemp");
3966 lse.direct_byref = 1;
3967 gfc_conv_expr_descriptor (&lse, expr2, rss);
3968 gfc_add_modify (&lse.pre, desc, tmp);
3971 gfc_add_block_to_block (&block, &lse.pre);
3972 gfc_add_block_to_block (&block, &lse.post);
3974 return gfc_finish_block (&block);
3978 /* Makes sure se is suitable for passing as a function string parameter. */
3979 /* TODO: Need to check all callers of this function. It may be abused. */
3982 gfc_conv_string_parameter (gfc_se * se)
3986 if (TREE_CODE (se->expr) == STRING_CST)
3988 type = TREE_TYPE (TREE_TYPE (se->expr));
3989 se->expr = gfc_build_addr_expr (build_pointer_type (type), se->expr);
3993 if (TYPE_STRING_FLAG (TREE_TYPE (se->expr)))
3995 if (TREE_CODE (se->expr) != INDIRECT_REF)
3997 type = TREE_TYPE (se->expr);
3998 se->expr = gfc_build_addr_expr (build_pointer_type (type), se->expr);
4002 type = gfc_get_character_type_len (gfc_default_character_kind,
4004 type = build_pointer_type (type);
4005 se->expr = gfc_build_addr_expr (type, se->expr);
4009 gcc_assert (POINTER_TYPE_P (TREE_TYPE (se->expr)));
4010 gcc_assert (se->string_length
4011 && TREE_CODE (TREE_TYPE (se->string_length)) == INTEGER_TYPE);
4015 /* Generate code for assignment of scalar variables. Includes character
4016 strings and derived types with allocatable components. */
4019 gfc_trans_scalar_assign (gfc_se * lse, gfc_se * rse, gfc_typespec ts,
4020 bool l_is_temp, bool r_is_var)
4026 gfc_init_block (&block);
4028 if (ts.type == BT_CHARACTER)
4033 if (lse->string_length != NULL_TREE)
4035 gfc_conv_string_parameter (lse);
4036 gfc_add_block_to_block (&block, &lse->pre);
4037 llen = lse->string_length;
4040 if (rse->string_length != NULL_TREE)
4042 gcc_assert (rse->string_length != NULL_TREE);
4043 gfc_conv_string_parameter (rse);
4044 gfc_add_block_to_block (&block, &rse->pre);
4045 rlen = rse->string_length;
4048 gfc_trans_string_copy (&block, llen, lse->expr, ts.kind, rlen,
4049 rse->expr, ts.kind);
4051 else if (ts.type == BT_DERIVED && ts.derived->attr.alloc_comp)
4055 /* Are the rhs and the lhs the same? */
4058 cond = fold_build2 (EQ_EXPR, boolean_type_node,
4059 build_fold_addr_expr (lse->expr),
4060 build_fold_addr_expr (rse->expr));
4061 cond = gfc_evaluate_now (cond, &lse->pre);
4064 /* Deallocate the lhs allocated components as long as it is not
4065 the same as the rhs. This must be done following the assignment
4066 to prevent deallocating data that could be used in the rhs
4070 tmp = gfc_evaluate_now (lse->expr, &lse->pre);
4071 tmp = gfc_deallocate_alloc_comp (ts.derived, tmp, 0);
4073 tmp = build3_v (COND_EXPR, cond, build_empty_stmt (), tmp);
4074 gfc_add_expr_to_block (&lse->post, tmp);
4077 gfc_add_block_to_block (&block, &rse->pre);
4078 gfc_add_block_to_block (&block, &lse->pre);
4080 gfc_add_modify (&block, lse->expr,
4081 fold_convert (TREE_TYPE (lse->expr), rse->expr));
4083 /* Do a deep copy if the rhs is a variable, if it is not the
4087 tmp = gfc_copy_alloc_comp (ts.derived, rse->expr, lse->expr, 0);
4088 tmp = build3_v (COND_EXPR, cond, build_empty_stmt (), tmp);
4089 gfc_add_expr_to_block (&block, tmp);
4094 gfc_add_block_to_block (&block, &lse->pre);
4095 gfc_add_block_to_block (&block, &rse->pre);
4097 gfc_add_modify (&block, lse->expr,
4098 fold_convert (TREE_TYPE (lse->expr), rse->expr));
4101 gfc_add_block_to_block (&block, &lse->post);
4102 gfc_add_block_to_block (&block, &rse->post);
4104 return gfc_finish_block (&block);
4108 /* Try to translate array(:) = func (...), where func is a transformational
4109 array function, without using a temporary. Returns NULL is this isn't the
4113 gfc_trans_arrayfunc_assign (gfc_expr * expr1, gfc_expr * expr2)
4118 bool seen_array_ref;
4120 /* The caller has already checked rank>0 and expr_type == EXPR_FUNCTION. */
4121 if (expr2->value.function.isym && !gfc_is_intrinsic_libcall (expr2))
4124 /* Elemental functions don't need a temporary anyway. */
4125 if (expr2->value.function.esym != NULL
4126 && expr2->value.function.esym->attr.elemental)
4129 /* Fail if EXPR1 can't be expressed as a descriptor. */
4130 if (gfc_ref_needs_temporary_p (expr1->ref))
4133 /* Functions returning pointers need temporaries. */
4134 if (expr2->symtree->n.sym->attr.pointer
4135 || expr2->symtree->n.sym->attr.allocatable)
4138 /* Character array functions need temporaries unless the
4139 character lengths are the same. */
4140 if (expr2->ts.type == BT_CHARACTER && expr2->rank > 0)
4142 if (expr1->ts.cl->length == NULL
4143 || expr1->ts.cl->length->expr_type != EXPR_CONSTANT)
4146 if (expr2->ts.cl->length == NULL
4147 || expr2->ts.cl->length->expr_type != EXPR_CONSTANT)
4150 if (mpz_cmp (expr1->ts.cl->length->value.integer,
4151 expr2->ts.cl->length->value.integer) != 0)
4155 /* Check that no LHS component references appear during an array
4156 reference. This is needed because we do not have the means to
4157 span any arbitrary stride with an array descriptor. This check
4158 is not needed for the rhs because the function result has to be
4160 seen_array_ref = false;
4161 for (ref = expr1->ref; ref; ref = ref->next)
4163 if (ref->type == REF_ARRAY)
4164 seen_array_ref= true;
4165 else if (ref->type == REF_COMPONENT && seen_array_ref)
4169 /* Check for a dependency. */
4170 if (gfc_check_fncall_dependency (expr1, INTENT_OUT,
4171 expr2->value.function.esym,
4172 expr2->value.function.actual))
4175 /* The frontend doesn't seem to bother filling in expr->symtree for intrinsic
4177 gcc_assert (expr2->value.function.isym
4178 || (gfc_return_by_reference (expr2->value.function.esym)
4179 && expr2->value.function.esym->result->attr.dimension));
4181 ss = gfc_walk_expr (expr1);
4182 gcc_assert (ss != gfc_ss_terminator);
4183 gfc_init_se (&se, NULL);
4184 gfc_start_block (&se.pre);
4185 se.want_pointer = 1;
4187 gfc_conv_array_parameter (&se, expr1, ss, 0, NULL, NULL);
4189 se.direct_byref = 1;
4190 se.ss = gfc_walk_expr (expr2);
4191 gcc_assert (se.ss != gfc_ss_terminator);
4192 gfc_conv_function_expr (&se, expr2);
4193 gfc_add_block_to_block (&se.pre, &se.post);
4195 return gfc_finish_block (&se.pre);
4198 /* Determine whether the given EXPR_CONSTANT is a zero initializer. */
4201 is_zero_initializer_p (gfc_expr * expr)
4203 if (expr->expr_type != EXPR_CONSTANT)
4206 /* We ignore constants with prescribed memory representations for now. */
4207 if (expr->representation.string)
4210 switch (expr->ts.type)
4213 return mpz_cmp_si (expr->value.integer, 0) == 0;
4216 return mpfr_zero_p (expr->value.real)
4217 && MPFR_SIGN (expr->value.real) >= 0;
4220 return expr->value.logical == 0;
4223 return mpfr_zero_p (expr->value.complex.r)
4224 && MPFR_SIGN (expr->value.complex.r) >= 0
4225 && mpfr_zero_p (expr->value.complex.i)
4226 && MPFR_SIGN (expr->value.complex.i) >= 0;
4234 /* Try to efficiently translate array(:) = 0. Return NULL if this
4238 gfc_trans_zero_assign (gfc_expr * expr)
4240 tree dest, len, type;
4244 sym = expr->symtree->n.sym;
4245 dest = gfc_get_symbol_decl (sym);
4247 type = TREE_TYPE (dest);
4248 if (POINTER_TYPE_P (type))
4249 type = TREE_TYPE (type);
4250 if (!GFC_ARRAY_TYPE_P (type))
4253 /* Determine the length of the array. */
4254 len = GFC_TYPE_ARRAY_SIZE (type);
4255 if (!len || TREE_CODE (len) != INTEGER_CST)
4258 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (type));
4259 len = fold_build2 (MULT_EXPR, gfc_array_index_type, len,
4260 fold_convert (gfc_array_index_type, tmp));
4262 /* Convert arguments to the correct types. */
4263 if (!POINTER_TYPE_P (TREE_TYPE (dest)))
4264 dest = gfc_build_addr_expr (pvoid_type_node, dest);
4266 dest = fold_convert (pvoid_type_node, dest);
4267 len = fold_convert (size_type_node, len);
4269 /* Construct call to __builtin_memset. */
4270 tmp = build_call_expr (built_in_decls[BUILT_IN_MEMSET],
4271 3, dest, integer_zero_node, len);
4272 return fold_convert (void_type_node, tmp);
4276 /* Helper for gfc_trans_array_copy and gfc_trans_array_constructor_copy
4277 that constructs the call to __builtin_memcpy. */
4280 gfc_build_memcpy_call (tree dst, tree src, tree len)
4284 /* Convert arguments to the correct types. */
4285 if (!POINTER_TYPE_P (TREE_TYPE (dst)))
4286 dst = gfc_build_addr_expr (pvoid_type_node, dst);
4288 dst = fold_convert (pvoid_type_node, dst);
4290 if (!POINTER_TYPE_P (TREE_TYPE (src)))
4291 src = gfc_build_addr_expr (pvoid_type_node, src);
4293 src = fold_convert (pvoid_type_node, src);
4295 len = fold_convert (size_type_node, len);
4297 /* Construct call to __builtin_memcpy. */
4298 tmp = build_call_expr (built_in_decls[BUILT_IN_MEMCPY], 3, dst, src, len);
4299 return fold_convert (void_type_node, tmp);
4303 /* Try to efficiently translate dst(:) = src(:). Return NULL if this
4304 can't be done. EXPR1 is the destination/lhs and EXPR2 is the
4305 source/rhs, both are gfc_full_array_ref_p which have been checked for
4309 gfc_trans_array_copy (gfc_expr * expr1, gfc_expr * expr2)
4311 tree dst, dlen, dtype;
4312 tree src, slen, stype;
4315 dst = gfc_get_symbol_decl (expr1->symtree->n.sym);
4316 src = gfc_get_symbol_decl (expr2->symtree->n.sym);
4318 dtype = TREE_TYPE (dst);
4319 if (POINTER_TYPE_P (dtype))
4320 dtype = TREE_TYPE (dtype);
4321 stype = TREE_TYPE (src);
4322 if (POINTER_TYPE_P (stype))
4323 stype = TREE_TYPE (stype);
4325 if (!GFC_ARRAY_TYPE_P (dtype) || !GFC_ARRAY_TYPE_P (stype))
4328 /* Determine the lengths of the arrays. */
4329 dlen = GFC_TYPE_ARRAY_SIZE (dtype);
4330 if (!dlen || TREE_CODE (dlen) != INTEGER_CST)
4332 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (dtype));
4333 dlen = fold_build2 (MULT_EXPR, gfc_array_index_type, dlen,
4334 fold_convert (gfc_array_index_type, tmp));
4336 slen = GFC_TYPE_ARRAY_SIZE (stype);
4337 if (!slen || TREE_CODE (slen) != INTEGER_CST)
4339 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (stype));
4340 slen = fold_build2 (MULT_EXPR, gfc_array_index_type, slen,
4341 fold_convert (gfc_array_index_type, tmp));
4343 /* Sanity check that they are the same. This should always be
4344 the case, as we should already have checked for conformance. */
4345 if (!tree_int_cst_equal (slen, dlen))
4348 return gfc_build_memcpy_call (dst, src, dlen);
4352 /* Try to efficiently translate array(:) = (/ ... /). Return NULL if
4353 this can't be done. EXPR1 is the destination/lhs for which
4354 gfc_full_array_ref_p is true, and EXPR2 is the source/rhs. */
4357 gfc_trans_array_constructor_copy (gfc_expr * expr1, gfc_expr * expr2)
4359 unsigned HOST_WIDE_INT nelem;
4365 nelem = gfc_constant_array_constructor_p (expr2->value.constructor);
4369 dst = gfc_get_symbol_decl (expr1->symtree->n.sym);
4370 dtype = TREE_TYPE (dst);
4371 if (POINTER_TYPE_P (dtype))
4372 dtype = TREE_TYPE (dtype);
4373 if (!GFC_ARRAY_TYPE_P (dtype))
4376 /* Determine the lengths of the array. */
4377 len = GFC_TYPE_ARRAY_SIZE (dtype);
4378 if (!len || TREE_CODE (len) != INTEGER_CST)
4381 /* Confirm that the constructor is the same size. */
4382 if (compare_tree_int (len, nelem) != 0)
4385 tmp = TYPE_SIZE_UNIT (gfc_get_element_type (dtype));
4386 len = fold_build2 (MULT_EXPR, gfc_array_index_type, len,
4387 fold_convert (gfc_array_index_type, tmp));
4389 stype = gfc_typenode_for_spec (&expr2->ts);
4390 src = gfc_build_constant_array_constructor (expr2, stype);
4392 stype = TREE_TYPE (src);
4393 if (POINTER_TYPE_P (stype))
4394 stype = TREE_TYPE (stype);
4396 return gfc_build_memcpy_call (dst, src, len);
4400 /* Subroutine of gfc_trans_assignment that actually scalarizes the
4401 assignment. EXPR1 is the destination/RHS and EXPR2 is the source/LHS. */
4404 gfc_trans_assignment_1 (gfc_expr * expr1, gfc_expr * expr2, bool init_flag)
4409 gfc_ss *lss_section;
4417 /* Assignment of the form lhs = rhs. */
4418 gfc_start_block (&block);
4420 gfc_init_se (&lse, NULL);
4421 gfc_init_se (&rse, NULL);
4424 lss = gfc_walk_expr (expr1);
4426 if (lss != gfc_ss_terminator)
4428 /* The assignment needs scalarization. */
4431 /* Find a non-scalar SS from the lhs. */
4432 while (lss_section != gfc_ss_terminator
4433 && lss_section->type != GFC_SS_SECTION)
4434 lss_section = lss_section->next;
4436 gcc_assert (lss_section != gfc_ss_terminator);
4438 /* Initialize the scalarizer. */
4439 gfc_init_loopinfo (&loop);
4442 rss = gfc_walk_expr (expr2);
4443 if (rss == gfc_ss_terminator)
4445 /* The rhs is scalar. Add a ss for the expression. */
4446 rss = gfc_get_ss ();
4447 rss->next = gfc_ss_terminator;
4448 rss->type = GFC_SS_SCALAR;
4451 /* Associate the SS with the loop. */
4452 gfc_add_ss_to_loop (&loop, lss);
4453 gfc_add_ss_to_loop (&loop, rss);
4455 /* Calculate the bounds of the scalarization. */
4456 gfc_conv_ss_startstride (&loop);
4457 /* Resolve any data dependencies in the statement. */
4458 gfc_conv_resolve_dependencies (&loop, lss, rss);
4459 /* Setup the scalarizing loops. */
4460 gfc_conv_loop_setup (&loop, &expr2->where);
4462 /* Setup the gfc_se structures. */
4463 gfc_copy_loopinfo_to_se (&lse, &loop);
4464 gfc_copy_loopinfo_to_se (&rse, &loop);
4467 gfc_mark_ss_chain_used (rss, 1);
4468 if (loop.temp_ss == NULL)
4471 gfc_mark_ss_chain_used (lss, 1);
4475 lse.ss = loop.temp_ss;
4476 gfc_mark_ss_chain_used (lss, 3);
4477 gfc_mark_ss_chain_used (loop.temp_ss, 3);
4480 /* Start the scalarized loop body. */
4481 gfc_start_scalarized_body (&loop, &body);
4484 gfc_init_block (&body);
4486 l_is_temp = (lss != gfc_ss_terminator && loop.temp_ss != NULL);
4488 /* Translate the expression. */
4489 gfc_conv_expr (&rse, expr2);
4493 gfc_conv_tmp_array_ref (&lse);
4494 gfc_advance_se_ss_chain (&lse);
4497 gfc_conv_expr (&lse, expr1);
4499 tmp = gfc_trans_scalar_assign (&lse, &rse, expr1->ts,
4500 l_is_temp || init_flag,
4501 expr2->expr_type == EXPR_VARIABLE);
4502 gfc_add_expr_to_block (&body, tmp);
4504 if (lss == gfc_ss_terminator)
4506 /* Use the scalar assignment as is. */
4507 gfc_add_block_to_block (&block, &body);
4511 gcc_assert (lse.ss == gfc_ss_terminator
4512 && rse.ss == gfc_ss_terminator);
4516 gfc_trans_scalarized_loop_boundary (&loop, &body);
4518 /* We need to copy the temporary to the actual lhs. */
4519 gfc_init_se (&lse, NULL);
4520 gfc_init_se (&rse, NULL);
4521 gfc_copy_loopinfo_to_se (&lse, &loop);
4522 gfc_copy_loopinfo_to_se (&rse, &loop);
4524 rse.ss = loop.temp_ss;
4527 gfc_conv_tmp_array_ref (&rse);
4528 gfc_advance_se_ss_chain (&rse);
4529 gfc_conv_expr (&lse, expr1);
4531 gcc_assert (lse.ss == gfc_ss_terminator
4532 && rse.ss == gfc_ss_terminator);
4534 tmp = gfc_trans_scalar_assign (&lse, &rse, expr1->ts,
4536 gfc_add_expr_to_block (&body, tmp);
4539 /* Generate the copying loops. */
4540 gfc_trans_scalarizing_loops (&loop, &body);
4542 /* Wrap the whole thing up. */
4543 gfc_add_block_to_block (&block, &loop.pre);
4544 gfc_add_block_to_block (&block, &loop.post);
4546 gfc_cleanup_loop (&loop);
4549 return gfc_finish_block (&block);
4553 /* Check whether EXPR is a copyable array. */
4556 copyable_array_p (gfc_expr * expr)
4558 if (expr->expr_type != EXPR_VARIABLE)
4561 /* First check it's an array. */
4562 if (expr->rank < 1 || !expr->ref || expr->ref->next)
4565 if (!gfc_full_array_ref_p (expr->ref))
4568 /* Next check that it's of a simple enough type. */
4569 switch (expr->ts.type)
4581 return !expr->ts.derived->attr.alloc_comp;
4590 /* Translate an assignment. */
4593 gfc_trans_assignment (gfc_expr * expr1, gfc_expr * expr2, bool init_flag)
4597 /* Special case a single function returning an array. */
4598 if (expr2->expr_type == EXPR_FUNCTION && expr2->rank > 0)
4600 tmp = gfc_trans_arrayfunc_assign (expr1, expr2);
4605 /* Special case assigning an array to zero. */
4606 if (copyable_array_p (expr1)
4607 && is_zero_initializer_p (expr2))
4609 tmp = gfc_trans_zero_assign (expr1);
4614 /* Special case copying one array to another. */
4615 if (copyable_array_p (expr1)
4616 && copyable_array_p (expr2)
4617 && gfc_compare_types (&expr1->ts, &expr2->ts)
4618 && !gfc_check_dependency (expr1, expr2, 0))
4620 tmp = gfc_trans_array_copy (expr1, expr2);
4625 /* Special case initializing an array from a constant array constructor. */
4626 if (copyable_array_p (expr1)
4627 && expr2->expr_type == EXPR_ARRAY
4628 && gfc_compare_types (&expr1->ts, &expr2->ts))
4630 tmp = gfc_trans_array_constructor_copy (expr1, expr2);
4635 /* Fallback to the scalarizer to generate explicit loops. */
4636 return gfc_trans_assignment_1 (expr1, expr2, init_flag);
4640 gfc_trans_init_assign (gfc_code * code)
4642 return gfc_trans_assignment (code->expr, code->expr2, true);
4646 gfc_trans_assign (gfc_code * code)
4648 return gfc_trans_assignment (code->expr, code->expr2, false);