1 /* Routines for manipulation of expression nodes.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008,
4 Free Software Foundation, Inc.
5 Contributed by Andy Vaught
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/>. */
28 #include "target-memory.h" /* for gfc_convert_boz */
29 #include "constructor.h"
32 /* The following set of functions provide access to gfc_expr* of
33 various types - actual all but EXPR_FUNCTION and EXPR_VARIABLE.
35 There are two functions available elsewhere that provide
36 slightly different flavours of variables. Namely:
37 expr.c (gfc_get_variable_expr)
38 symbol.c (gfc_lval_expr_from_sym)
39 TODO: Merge these functions, if possible. */
41 /* Get a new expression node. */
49 gfc_clear_ts (&e->ts);
57 /* Get a new expression node that is an array constructor
58 of given type and kind. */
61 gfc_get_array_expr (bt type, int kind, locus *where)
66 e->expr_type = EXPR_ARRAY;
67 e->value.constructor = NULL;
80 /* Get a new expression node that is the NULL expression. */
83 gfc_get_null_expr (locus *where)
88 e->expr_type = EXPR_NULL;
89 e->ts.type = BT_UNKNOWN;
98 /* Get a new expression node that is an operator expression node. */
101 gfc_get_operator_expr (locus *where, gfc_intrinsic_op op,
102 gfc_expr *op1, gfc_expr *op2)
107 e->expr_type = EXPR_OP;
109 e->value.op.op1 = op1;
110 e->value.op.op2 = op2;
119 /* Get a new expression node that is an structure constructor
120 of given type and kind. */
123 gfc_get_structure_constructor_expr (bt type, int kind, locus *where)
128 e->expr_type = EXPR_STRUCTURE;
129 e->value.constructor = NULL;
140 /* Get a new expression node that is an constant of given type and kind. */
143 gfc_get_constant_expr (bt type, int kind, locus *where)
148 gfc_internal_error ("gfc_get_constant_expr(): locus 'where' cannot be NULL");
152 e->expr_type = EXPR_CONSTANT;
160 mpz_init (e->value.integer);
164 gfc_set_model_kind (kind);
165 mpfr_init (e->value.real);
169 gfc_set_model_kind (kind);
170 mpc_init2 (e->value.complex, mpfr_get_default_prec());
181 /* Get a new expression node that is an string constant.
182 If no string is passed, a string of len is allocated,
183 blanked and null-terminated. */
186 gfc_get_character_expr (int kind, locus *where, const char *src, int len)
193 dest = gfc_get_wide_string (len + 1);
194 gfc_wide_memset (dest, ' ', len);
198 dest = gfc_char_to_widechar (src);
200 e = gfc_get_constant_expr (BT_CHARACTER, kind,
201 where ? where : &gfc_current_locus);
202 e->value.character.string = dest;
203 e->value.character.length = len;
209 /* Get a new expression node that is an integer constant. */
212 gfc_get_int_expr (int kind, locus *where, int value)
215 p = gfc_get_constant_expr (BT_INTEGER, kind,
216 where ? where : &gfc_current_locus);
218 mpz_set_si (p->value.integer, value);
224 /* Get a new expression node that is a logical constant. */
227 gfc_get_logical_expr (int kind, locus *where, bool value)
230 p = gfc_get_constant_expr (BT_LOGICAL, kind,
231 where ? where : &gfc_current_locus);
233 p->value.logical = value;
240 gfc_get_iokind_expr (locus *where, io_kind k)
244 /* Set the types to something compatible with iokind. This is needed to
245 get through gfc_free_expr later since iokind really has no Basic Type,
249 e->expr_type = EXPR_CONSTANT;
250 e->ts.type = BT_LOGICAL;
258 /* Given an expression pointer, return a copy of the expression. This
259 subroutine is recursive. */
262 gfc_copy_expr (gfc_expr *p)
274 switch (q->expr_type)
277 s = gfc_get_wide_string (p->value.character.length + 1);
278 q->value.character.string = s;
279 memcpy (s, p->value.character.string,
280 (p->value.character.length + 1) * sizeof (gfc_char_t));
284 /* Copy target representation, if it exists. */
285 if (p->representation.string)
287 c = XCNEWVEC (char, p->representation.length + 1);
288 q->representation.string = c;
289 memcpy (c, p->representation.string, (p->representation.length + 1));
292 /* Copy the values of any pointer components of p->value. */
296 mpz_init_set (q->value.integer, p->value.integer);
300 gfc_set_model_kind (q->ts.kind);
301 mpfr_init (q->value.real);
302 mpfr_set (q->value.real, p->value.real, GFC_RND_MODE);
306 gfc_set_model_kind (q->ts.kind);
307 mpc_init2 (q->value.complex, mpfr_get_default_prec());
308 mpc_set (q->value.complex, p->value.complex, GFC_MPC_RND_MODE);
312 if (p->representation.string)
313 q->value.character.string
314 = gfc_char_to_widechar (q->representation.string);
317 s = gfc_get_wide_string (p->value.character.length + 1);
318 q->value.character.string = s;
320 /* This is the case for the C_NULL_CHAR named constant. */
321 if (p->value.character.length == 0
322 && (p->ts.is_c_interop || p->ts.is_iso_c))
325 /* Need to set the length to 1 to make sure the NUL
326 terminator is copied. */
327 q->value.character.length = 1;
330 memcpy (s, p->value.character.string,
331 (p->value.character.length + 1) * sizeof (gfc_char_t));
339 break; /* Already done. */
343 /* Should never be reached. */
345 gfc_internal_error ("gfc_copy_expr(): Bad expr node");
352 switch (q->value.op.op)
355 case INTRINSIC_PARENTHESES:
356 case INTRINSIC_UPLUS:
357 case INTRINSIC_UMINUS:
358 q->value.op.op1 = gfc_copy_expr (p->value.op.op1);
361 default: /* Binary operators. */
362 q->value.op.op1 = gfc_copy_expr (p->value.op.op1);
363 q->value.op.op2 = gfc_copy_expr (p->value.op.op2);
370 q->value.function.actual =
371 gfc_copy_actual_arglist (p->value.function.actual);
376 q->value.compcall.actual =
377 gfc_copy_actual_arglist (p->value.compcall.actual);
378 q->value.compcall.tbp = p->value.compcall.tbp;
383 q->value.constructor = gfc_constructor_copy (p->value.constructor);
391 q->shape = gfc_copy_shape (p->shape, p->rank);
393 q->ref = gfc_copy_ref (p->ref);
400 gfc_clear_shape (mpz_t *shape, int rank)
404 for (i = 0; i < rank; i++)
405 mpz_clear (shape[i]);
410 gfc_free_shape (mpz_t **shape, int rank)
415 gfc_clear_shape (*shape, rank);
421 /* Workhorse function for gfc_free_expr() that frees everything
422 beneath an expression node, but not the node itself. This is
423 useful when we want to simplify a node and replace it with
424 something else or the expression node belongs to another structure. */
427 free_expr0 (gfc_expr *e)
429 switch (e->expr_type)
432 /* Free any parts of the value that need freeing. */
436 mpz_clear (e->value.integer);
440 mpfr_clear (e->value.real);
444 free (e->value.character.string);
448 mpc_clear (e->value.complex);
455 /* Free the representation. */
456 free (e->representation.string);
461 if (e->value.op.op1 != NULL)
462 gfc_free_expr (e->value.op.op1);
463 if (e->value.op.op2 != NULL)
464 gfc_free_expr (e->value.op.op2);
468 gfc_free_actual_arglist (e->value.function.actual);
473 gfc_free_actual_arglist (e->value.compcall.actual);
481 gfc_constructor_free (e->value.constructor);
485 free (e->value.character.string);
492 gfc_internal_error ("free_expr0(): Bad expr type");
495 /* Free a shape array. */
496 gfc_free_shape (&e->shape, e->rank);
498 gfc_free_ref_list (e->ref);
500 memset (e, '\0', sizeof (gfc_expr));
504 /* Free an expression node and everything beneath it. */
507 gfc_free_expr (gfc_expr *e)
516 /* Free an argument list and everything below it. */
519 gfc_free_actual_arglist (gfc_actual_arglist *a1)
521 gfc_actual_arglist *a2;
526 gfc_free_expr (a1->expr);
533 /* Copy an arglist structure and all of the arguments. */
536 gfc_copy_actual_arglist (gfc_actual_arglist *p)
538 gfc_actual_arglist *head, *tail, *new_arg;
542 for (; p; p = p->next)
544 new_arg = gfc_get_actual_arglist ();
547 new_arg->expr = gfc_copy_expr (p->expr);
548 new_arg->next = NULL;
553 tail->next = new_arg;
562 /* Free a list of reference structures. */
565 gfc_free_ref_list (gfc_ref *p)
577 for (i = 0; i < GFC_MAX_DIMENSIONS; i++)
579 gfc_free_expr (p->u.ar.start[i]);
580 gfc_free_expr (p->u.ar.end[i]);
581 gfc_free_expr (p->u.ar.stride[i]);
587 gfc_free_expr (p->u.ss.start);
588 gfc_free_expr (p->u.ss.end);
600 /* Graft the *src expression onto the *dest subexpression. */
603 gfc_replace_expr (gfc_expr *dest, gfc_expr *src)
611 /* Try to extract an integer constant from the passed expression node.
612 Returns an error message or NULL if the result is set. It is
613 tempting to generate an error and return SUCCESS or FAILURE, but
614 failure is OK for some callers. */
617 gfc_extract_int (gfc_expr *expr, int *result)
619 if (expr->expr_type != EXPR_CONSTANT)
620 return _("Constant expression required at %C");
622 if (expr->ts.type != BT_INTEGER)
623 return _("Integer expression required at %C");
625 if ((mpz_cmp_si (expr->value.integer, INT_MAX) > 0)
626 || (mpz_cmp_si (expr->value.integer, INT_MIN) < 0))
628 return _("Integer value too large in expression at %C");
631 *result = (int) mpz_get_si (expr->value.integer);
637 /* Recursively copy a list of reference structures. */
640 gfc_copy_ref (gfc_ref *src)
648 dest = gfc_get_ref ();
649 dest->type = src->type;
654 ar = gfc_copy_array_ref (&src->u.ar);
660 dest->u.c = src->u.c;
664 dest->u.ss = src->u.ss;
665 dest->u.ss.start = gfc_copy_expr (src->u.ss.start);
666 dest->u.ss.end = gfc_copy_expr (src->u.ss.end);
670 dest->next = gfc_copy_ref (src->next);
676 /* Detect whether an expression has any vector index array references. */
679 gfc_has_vector_index (gfc_expr *e)
683 for (ref = e->ref; ref; ref = ref->next)
684 if (ref->type == REF_ARRAY)
685 for (i = 0; i < ref->u.ar.dimen; i++)
686 if (ref->u.ar.dimen_type[i] == DIMEN_VECTOR)
692 /* Copy a shape array. */
695 gfc_copy_shape (mpz_t *shape, int rank)
703 new_shape = gfc_get_shape (rank);
705 for (n = 0; n < rank; n++)
706 mpz_init_set (new_shape[n], shape[n]);
712 /* Copy a shape array excluding dimension N, where N is an integer
713 constant expression. Dimensions are numbered in fortran style --
716 So, if the original shape array contains R elements
717 { s1 ... sN-1 sN sN+1 ... sR-1 sR}
718 the result contains R-1 elements:
719 { s1 ... sN-1 sN+1 ... sR-1}
721 If anything goes wrong -- N is not a constant, its value is out
722 of range -- or anything else, just returns NULL. */
725 gfc_copy_shape_excluding (mpz_t *shape, int rank, gfc_expr *dim)
727 mpz_t *new_shape, *s;
733 || dim->expr_type != EXPR_CONSTANT
734 || dim->ts.type != BT_INTEGER)
737 n = mpz_get_si (dim->value.integer);
738 n--; /* Convert to zero based index. */
739 if (n < 0 || n >= rank)
742 s = new_shape = gfc_get_shape (rank - 1);
744 for (i = 0; i < rank; i++)
748 mpz_init_set (*s, shape[i]);
756 /* Return the maximum kind of two expressions. In general, higher
757 kind numbers mean more precision for numeric types. */
760 gfc_kind_max (gfc_expr *e1, gfc_expr *e2)
762 return (e1->ts.kind > e2->ts.kind) ? e1->ts.kind : e2->ts.kind;
766 /* Returns nonzero if the type is numeric, zero otherwise. */
769 numeric_type (bt type)
771 return type == BT_COMPLEX || type == BT_REAL || type == BT_INTEGER;
775 /* Returns nonzero if the typespec is a numeric type, zero otherwise. */
778 gfc_numeric_ts (gfc_typespec *ts)
780 return numeric_type (ts->type);
784 /* Return an expression node with an optional argument list attached.
785 A variable number of gfc_expr pointers are strung together in an
786 argument list with a NULL pointer terminating the list. */
789 gfc_build_conversion (gfc_expr *e)
794 p->expr_type = EXPR_FUNCTION;
796 p->value.function.actual = NULL;
798 p->value.function.actual = gfc_get_actual_arglist ();
799 p->value.function.actual->expr = e;
805 /* Given an expression node with some sort of numeric binary
806 expression, insert type conversions required to make the operands
807 have the same type. Conversion warnings are disabled if wconversion
810 The exception is that the operands of an exponential don't have to
811 have the same type. If possible, the base is promoted to the type
812 of the exponent. For example, 1**2.3 becomes 1.0**2.3, but
813 1.0**2 stays as it is. */
816 gfc_type_convert_binary (gfc_expr *e, int wconversion)
820 op1 = e->value.op.op1;
821 op2 = e->value.op.op2;
823 if (op1->ts.type == BT_UNKNOWN || op2->ts.type == BT_UNKNOWN)
825 gfc_clear_ts (&e->ts);
829 /* Kind conversions of same type. */
830 if (op1->ts.type == op2->ts.type)
832 if (op1->ts.kind == op2->ts.kind)
834 /* No type conversions. */
839 if (op1->ts.kind > op2->ts.kind)
840 gfc_convert_type_warn (op2, &op1->ts, 2, wconversion);
842 gfc_convert_type_warn (op1, &op2->ts, 2, wconversion);
848 /* Integer combined with real or complex. */
849 if (op2->ts.type == BT_INTEGER)
853 /* Special case for ** operator. */
854 if (e->value.op.op == INTRINSIC_POWER)
857 gfc_convert_type_warn (e->value.op.op2, &e->ts, 2, wconversion);
861 if (op1->ts.type == BT_INTEGER)
864 gfc_convert_type_warn (e->value.op.op1, &e->ts, 2, wconversion);
868 /* Real combined with complex. */
869 e->ts.type = BT_COMPLEX;
870 if (op1->ts.kind > op2->ts.kind)
871 e->ts.kind = op1->ts.kind;
873 e->ts.kind = op2->ts.kind;
874 if (op1->ts.type != BT_COMPLEX || op1->ts.kind != e->ts.kind)
875 gfc_convert_type_warn (e->value.op.op1, &e->ts, 2, wconversion);
876 if (op2->ts.type != BT_COMPLEX || op2->ts.kind != e->ts.kind)
877 gfc_convert_type_warn (e->value.op.op2, &e->ts, 2, wconversion);
884 /* Function to determine if an expression is constant or not. This
885 function expects that the expression has already been simplified. */
888 gfc_is_constant_expr (gfc_expr *e)
891 gfc_actual_arglist *arg;
897 switch (e->expr_type)
900 return (gfc_is_constant_expr (e->value.op.op1)
901 && (e->value.op.op2 == NULL
902 || gfc_is_constant_expr (e->value.op.op2)));
910 gcc_assert (e->symtree || e->value.function.esym
911 || e->value.function.isym);
913 /* Call to intrinsic with at least one argument. */
914 if (e->value.function.isym && e->value.function.actual)
916 for (arg = e->value.function.actual; arg; arg = arg->next)
917 if (!gfc_is_constant_expr (arg->expr))
921 /* Specification functions are constant. */
922 /* F95, 7.1.6.2; F2003, 7.1.7 */
925 sym = e->symtree->n.sym;
926 if (e->value.function.esym)
927 sym = e->value.function.esym;
930 && sym->attr.function
932 && !sym->attr.intrinsic
933 && !sym->attr.recursive
934 && sym->attr.proc != PROC_INTERNAL
935 && sym->attr.proc != PROC_ST_FUNCTION
936 && sym->attr.proc != PROC_UNKNOWN
937 && sym->formal == NULL)
940 if (e->value.function.isym
941 && (e->value.function.isym->elemental
942 || e->value.function.isym->pure
943 || e->value.function.isym->inquiry
944 || e->value.function.isym->transformational))
954 return e->ref == NULL || (gfc_is_constant_expr (e->ref->u.ss.start)
955 && gfc_is_constant_expr (e->ref->u.ss.end));
959 c = gfc_constructor_first (e->value.constructor);
960 if ((e->expr_type == EXPR_ARRAY) && c && c->iterator)
961 return gfc_constant_ac (e);
963 for (; c; c = gfc_constructor_next (c))
964 if (!gfc_is_constant_expr (c->expr))
971 gfc_internal_error ("gfc_is_constant_expr(): Unknown expression type");
977 /* Is true if an array reference is followed by a component or substring
980 is_subref_array (gfc_expr * e)
985 if (e->expr_type != EXPR_VARIABLE)
988 if (e->symtree->n.sym->attr.subref_array_pointer)
992 for (ref = e->ref; ref; ref = ref->next)
994 if (ref->type == REF_ARRAY
995 && ref->u.ar.type != AR_ELEMENT)
999 && ref->type != REF_ARRAY)
1006 /* Try to collapse intrinsic expressions. */
1009 simplify_intrinsic_op (gfc_expr *p, int type)
1011 gfc_intrinsic_op op;
1012 gfc_expr *op1, *op2, *result;
1014 if (p->value.op.op == INTRINSIC_USER)
1017 op1 = p->value.op.op1;
1018 op2 = p->value.op.op2;
1019 op = p->value.op.op;
1021 if (gfc_simplify_expr (op1, type) == FAILURE)
1023 if (gfc_simplify_expr (op2, type) == FAILURE)
1026 if (!gfc_is_constant_expr (op1)
1027 || (op2 != NULL && !gfc_is_constant_expr (op2)))
1031 p->value.op.op1 = NULL;
1032 p->value.op.op2 = NULL;
1036 case INTRINSIC_PARENTHESES:
1037 result = gfc_parentheses (op1);
1040 case INTRINSIC_UPLUS:
1041 result = gfc_uplus (op1);
1044 case INTRINSIC_UMINUS:
1045 result = gfc_uminus (op1);
1048 case INTRINSIC_PLUS:
1049 result = gfc_add (op1, op2);
1052 case INTRINSIC_MINUS:
1053 result = gfc_subtract (op1, op2);
1056 case INTRINSIC_TIMES:
1057 result = gfc_multiply (op1, op2);
1060 case INTRINSIC_DIVIDE:
1061 result = gfc_divide (op1, op2);
1064 case INTRINSIC_POWER:
1065 result = gfc_power (op1, op2);
1068 case INTRINSIC_CONCAT:
1069 result = gfc_concat (op1, op2);
1073 case INTRINSIC_EQ_OS:
1074 result = gfc_eq (op1, op2, op);
1078 case INTRINSIC_NE_OS:
1079 result = gfc_ne (op1, op2, op);
1083 case INTRINSIC_GT_OS:
1084 result = gfc_gt (op1, op2, op);
1088 case INTRINSIC_GE_OS:
1089 result = gfc_ge (op1, op2, op);
1093 case INTRINSIC_LT_OS:
1094 result = gfc_lt (op1, op2, op);
1098 case INTRINSIC_LE_OS:
1099 result = gfc_le (op1, op2, op);
1103 result = gfc_not (op1);
1107 result = gfc_and (op1, op2);
1111 result = gfc_or (op1, op2);
1115 result = gfc_eqv (op1, op2);
1118 case INTRINSIC_NEQV:
1119 result = gfc_neqv (op1, op2);
1123 gfc_internal_error ("simplify_intrinsic_op(): Bad operator");
1128 gfc_free_expr (op1);
1129 gfc_free_expr (op2);
1133 result->rank = p->rank;
1134 result->where = p->where;
1135 gfc_replace_expr (p, result);
1141 /* Subroutine to simplify constructor expressions. Mutually recursive
1142 with gfc_simplify_expr(). */
1145 simplify_constructor (gfc_constructor_base base, int type)
1150 for (c = gfc_constructor_first (base); c; c = gfc_constructor_next (c))
1153 && (gfc_simplify_expr (c->iterator->start, type) == FAILURE
1154 || gfc_simplify_expr (c->iterator->end, type) == FAILURE
1155 || gfc_simplify_expr (c->iterator->step, type) == FAILURE))
1160 /* Try and simplify a copy. Replace the original if successful
1161 but keep going through the constructor at all costs. Not
1162 doing so can make a dog's dinner of complicated things. */
1163 p = gfc_copy_expr (c->expr);
1165 if (gfc_simplify_expr (p, type) == FAILURE)
1171 gfc_replace_expr (c->expr, p);
1179 /* Pull a single array element out of an array constructor. */
1182 find_array_element (gfc_constructor_base base, gfc_array_ref *ar,
1183 gfc_constructor **rval)
1185 unsigned long nelemen;
1191 gfc_constructor *cons;
1198 mpz_init_set_ui (offset, 0);
1201 mpz_init_set_ui (span, 1);
1202 for (i = 0; i < ar->dimen; i++)
1204 if (gfc_reduce_init_expr (ar->as->lower[i]) == FAILURE
1205 || gfc_reduce_init_expr (ar->as->upper[i]) == FAILURE)
1212 e = gfc_copy_expr (ar->start[i]);
1213 if (e->expr_type != EXPR_CONSTANT)
1219 gcc_assert (ar->as->upper[i]->expr_type == EXPR_CONSTANT
1220 && ar->as->lower[i]->expr_type == EXPR_CONSTANT);
1222 /* Check the bounds. */
1223 if ((ar->as->upper[i]
1224 && mpz_cmp (e->value.integer,
1225 ar->as->upper[i]->value.integer) > 0)
1226 || (mpz_cmp (e->value.integer,
1227 ar->as->lower[i]->value.integer) < 0))
1229 gfc_error ("Index in dimension %d is out of bounds "
1230 "at %L", i + 1, &ar->c_where[i]);
1236 mpz_sub (delta, e->value.integer, ar->as->lower[i]->value.integer);
1237 mpz_mul (delta, delta, span);
1238 mpz_add (offset, offset, delta);
1240 mpz_set_ui (tmp, 1);
1241 mpz_add (tmp, tmp, ar->as->upper[i]->value.integer);
1242 mpz_sub (tmp, tmp, ar->as->lower[i]->value.integer);
1243 mpz_mul (span, span, tmp);
1246 for (cons = gfc_constructor_first (base), nelemen = mpz_get_ui (offset);
1247 cons && nelemen > 0; cons = gfc_constructor_next (cons), nelemen--)
1268 /* Find a component of a structure constructor. */
1270 static gfc_constructor *
1271 find_component_ref (gfc_constructor_base base, gfc_ref *ref)
1273 gfc_component *comp;
1274 gfc_component *pick;
1275 gfc_constructor *c = gfc_constructor_first (base);
1277 comp = ref->u.c.sym->components;
1278 pick = ref->u.c.component;
1279 while (comp != pick)
1282 c = gfc_constructor_next (c);
1289 /* Replace an expression with the contents of a constructor, removing
1290 the subobject reference in the process. */
1293 remove_subobject_ref (gfc_expr *p, gfc_constructor *cons)
1303 e = gfc_copy_expr (p);
1304 e->ref = p->ref->next;
1305 p->ref->next = NULL;
1306 gfc_replace_expr (p, e);
1310 /* Pull an array section out of an array constructor. */
1313 find_array_section (gfc_expr *expr, gfc_ref *ref)
1320 long unsigned one = 1;
1322 mpz_t start[GFC_MAX_DIMENSIONS];
1323 mpz_t end[GFC_MAX_DIMENSIONS];
1324 mpz_t stride[GFC_MAX_DIMENSIONS];
1325 mpz_t delta[GFC_MAX_DIMENSIONS];
1326 mpz_t ctr[GFC_MAX_DIMENSIONS];
1331 gfc_constructor_base base;
1332 gfc_constructor *cons, *vecsub[GFC_MAX_DIMENSIONS];
1342 base = expr->value.constructor;
1343 expr->value.constructor = NULL;
1345 rank = ref->u.ar.as->rank;
1347 if (expr->shape == NULL)
1348 expr->shape = gfc_get_shape (rank);
1350 mpz_init_set_ui (delta_mpz, one);
1351 mpz_init_set_ui (nelts, one);
1354 /* Do the initialization now, so that we can cleanup without
1355 keeping track of where we were. */
1356 for (d = 0; d < rank; d++)
1358 mpz_init (delta[d]);
1359 mpz_init (start[d]);
1362 mpz_init (stride[d]);
1366 /* Build the counters to clock through the array reference. */
1368 for (d = 0; d < rank; d++)
1370 /* Make this stretch of code easier on the eye! */
1371 begin = ref->u.ar.start[d];
1372 finish = ref->u.ar.end[d];
1373 step = ref->u.ar.stride[d];
1374 lower = ref->u.ar.as->lower[d];
1375 upper = ref->u.ar.as->upper[d];
1377 if (ref->u.ar.dimen_type[d] == DIMEN_VECTOR) /* Vector subscript. */
1379 gfc_constructor *ci;
1382 if (begin->expr_type != EXPR_ARRAY || !gfc_is_constant_expr (begin))
1388 gcc_assert (begin->rank == 1);
1389 /* Zero-sized arrays have no shape and no elements, stop early. */
1392 mpz_init_set_ui (nelts, 0);
1396 vecsub[d] = gfc_constructor_first (begin->value.constructor);
1397 mpz_set (ctr[d], vecsub[d]->expr->value.integer);
1398 mpz_mul (nelts, nelts, begin->shape[0]);
1399 mpz_set (expr->shape[shape_i++], begin->shape[0]);
1402 for (ci = vecsub[d]; ci; ci = gfc_constructor_next (ci))
1404 if (mpz_cmp (ci->expr->value.integer, upper->value.integer) > 0
1405 || mpz_cmp (ci->expr->value.integer,
1406 lower->value.integer) < 0)
1408 gfc_error ("index in dimension %d is out of bounds "
1409 "at %L", d + 1, &ref->u.ar.c_where[d]);
1417 if ((begin && begin->expr_type != EXPR_CONSTANT)
1418 || (finish && finish->expr_type != EXPR_CONSTANT)
1419 || (step && step->expr_type != EXPR_CONSTANT))
1425 /* Obtain the stride. */
1427 mpz_set (stride[d], step->value.integer);
1429 mpz_set_ui (stride[d], one);
1431 if (mpz_cmp_ui (stride[d], 0) == 0)
1432 mpz_set_ui (stride[d], one);
1434 /* Obtain the start value for the index. */
1436 mpz_set (start[d], begin->value.integer);
1438 mpz_set (start[d], lower->value.integer);
1440 mpz_set (ctr[d], start[d]);
1442 /* Obtain the end value for the index. */
1444 mpz_set (end[d], finish->value.integer);
1446 mpz_set (end[d], upper->value.integer);
1448 /* Separate 'if' because elements sometimes arrive with
1450 if (ref->u.ar.dimen_type[d] == DIMEN_ELEMENT)
1451 mpz_set (end [d], begin->value.integer);
1453 /* Check the bounds. */
1454 if (mpz_cmp (ctr[d], upper->value.integer) > 0
1455 || mpz_cmp (end[d], upper->value.integer) > 0
1456 || mpz_cmp (ctr[d], lower->value.integer) < 0
1457 || mpz_cmp (end[d], lower->value.integer) < 0)
1459 gfc_error ("index in dimension %d is out of bounds "
1460 "at %L", d + 1, &ref->u.ar.c_where[d]);
1465 /* Calculate the number of elements and the shape. */
1466 mpz_set (tmp_mpz, stride[d]);
1467 mpz_add (tmp_mpz, end[d], tmp_mpz);
1468 mpz_sub (tmp_mpz, tmp_mpz, ctr[d]);
1469 mpz_div (tmp_mpz, tmp_mpz, stride[d]);
1470 mpz_mul (nelts, nelts, tmp_mpz);
1472 /* An element reference reduces the rank of the expression; don't
1473 add anything to the shape array. */
1474 if (ref->u.ar.dimen_type[d] != DIMEN_ELEMENT)
1475 mpz_set (expr->shape[shape_i++], tmp_mpz);
1478 /* Calculate the 'stride' (=delta) for conversion of the
1479 counter values into the index along the constructor. */
1480 mpz_set (delta[d], delta_mpz);
1481 mpz_sub (tmp_mpz, upper->value.integer, lower->value.integer);
1482 mpz_add_ui (tmp_mpz, tmp_mpz, one);
1483 mpz_mul (delta_mpz, delta_mpz, tmp_mpz);
1487 cons = gfc_constructor_first (base);
1489 /* Now clock through the array reference, calculating the index in
1490 the source constructor and transferring the elements to the new
1492 for (idx = 0; idx < (int) mpz_get_si (nelts); idx++)
1494 if (ref->u.ar.offset)
1495 mpz_set (ptr, ref->u.ar.offset->value.integer);
1497 mpz_init_set_ui (ptr, 0);
1500 for (d = 0; d < rank; d++)
1502 mpz_set (tmp_mpz, ctr[d]);
1503 mpz_sub (tmp_mpz, tmp_mpz, ref->u.ar.as->lower[d]->value.integer);
1504 mpz_mul (tmp_mpz, tmp_mpz, delta[d]);
1505 mpz_add (ptr, ptr, tmp_mpz);
1507 if (!incr_ctr) continue;
1509 if (ref->u.ar.dimen_type[d] == DIMEN_VECTOR) /* Vector subscript. */
1511 gcc_assert(vecsub[d]);
1513 if (!gfc_constructor_next (vecsub[d]))
1514 vecsub[d] = gfc_constructor_first (ref->u.ar.start[d]->value.constructor);
1517 vecsub[d] = gfc_constructor_next (vecsub[d]);
1520 mpz_set (ctr[d], vecsub[d]->expr->value.integer);
1524 mpz_add (ctr[d], ctr[d], stride[d]);
1526 if (mpz_cmp_ui (stride[d], 0) > 0
1527 ? mpz_cmp (ctr[d], end[d]) > 0
1528 : mpz_cmp (ctr[d], end[d]) < 0)
1529 mpz_set (ctr[d], start[d]);
1535 limit = mpz_get_ui (ptr);
1536 if (limit >= gfc_option.flag_max_array_constructor)
1538 gfc_error ("The number of elements in the array constructor "
1539 "at %L requires an increase of the allowed %d "
1540 "upper limit. See -fmax-array-constructor "
1541 "option", &expr->where,
1542 gfc_option.flag_max_array_constructor);
1546 cons = gfc_constructor_lookup (base, limit);
1548 gfc_constructor_append_expr (&expr->value.constructor,
1549 gfc_copy_expr (cons->expr), NULL);
1556 mpz_clear (delta_mpz);
1557 mpz_clear (tmp_mpz);
1559 for (d = 0; d < rank; d++)
1561 mpz_clear (delta[d]);
1562 mpz_clear (start[d]);
1565 mpz_clear (stride[d]);
1567 gfc_constructor_free (base);
1571 /* Pull a substring out of an expression. */
1574 find_substring_ref (gfc_expr *p, gfc_expr **newp)
1581 if (p->ref->u.ss.start->expr_type != EXPR_CONSTANT
1582 || p->ref->u.ss.end->expr_type != EXPR_CONSTANT)
1585 *newp = gfc_copy_expr (p);
1586 free ((*newp)->value.character.string);
1588 end = (int) mpz_get_ui (p->ref->u.ss.end->value.integer);
1589 start = (int) mpz_get_ui (p->ref->u.ss.start->value.integer);
1590 length = end - start + 1;
1592 chr = (*newp)->value.character.string = gfc_get_wide_string (length + 1);
1593 (*newp)->value.character.length = length;
1594 memcpy (chr, &p->value.character.string[start - 1],
1595 length * sizeof (gfc_char_t));
1602 /* Simplify a subobject reference of a constructor. This occurs when
1603 parameter variable values are substituted. */
1606 simplify_const_ref (gfc_expr *p)
1608 gfc_constructor *cons, *c;
1614 switch (p->ref->type)
1617 switch (p->ref->u.ar.type)
1620 /* <type/kind spec>, parameter :: x(<int>) = scalar_expr
1621 will generate this. */
1622 if (p->expr_type != EXPR_ARRAY)
1624 remove_subobject_ref (p, NULL);
1627 if (find_array_element (p->value.constructor, &p->ref->u.ar,
1634 remove_subobject_ref (p, cons);
1638 if (find_array_section (p, p->ref) == FAILURE)
1640 p->ref->u.ar.type = AR_FULL;
1645 if (p->ref->next != NULL
1646 && (p->ts.type == BT_CHARACTER || p->ts.type == BT_DERIVED))
1648 for (c = gfc_constructor_first (p->value.constructor);
1649 c; c = gfc_constructor_next (c))
1651 c->expr->ref = gfc_copy_ref (p->ref->next);
1652 if (simplify_const_ref (c->expr) == FAILURE)
1656 if (p->ts.type == BT_DERIVED
1658 && (c = gfc_constructor_first (p->value.constructor)))
1660 /* There may have been component references. */
1661 p->ts = c->expr->ts;
1665 for (; last_ref->next; last_ref = last_ref->next) {};
1667 if (p->ts.type == BT_CHARACTER
1668 && last_ref->type == REF_SUBSTRING)
1670 /* If this is a CHARACTER array and we possibly took
1671 a substring out of it, update the type-spec's
1672 character length according to the first element
1673 (as all should have the same length). */
1675 if ((c = gfc_constructor_first (p->value.constructor)))
1677 const gfc_expr* first = c->expr;
1678 gcc_assert (first->expr_type == EXPR_CONSTANT);
1679 gcc_assert (first->ts.type == BT_CHARACTER);
1680 string_len = first->value.character.length;
1686 p->ts.u.cl = gfc_new_charlen (p->symtree->n.sym->ns,
1689 gfc_free_expr (p->ts.u.cl->length);
1692 = gfc_get_int_expr (gfc_default_integer_kind,
1696 gfc_free_ref_list (p->ref);
1707 cons = find_component_ref (p->value.constructor, p->ref);
1708 remove_subobject_ref (p, cons);
1712 if (find_substring_ref (p, &newp) == FAILURE)
1715 gfc_replace_expr (p, newp);
1716 gfc_free_ref_list (p->ref);
1726 /* Simplify a chain of references. */
1729 simplify_ref_chain (gfc_ref *ref, int type)
1733 for (; ref; ref = ref->next)
1738 for (n = 0; n < ref->u.ar.dimen; n++)
1740 if (gfc_simplify_expr (ref->u.ar.start[n], type) == FAILURE)
1742 if (gfc_simplify_expr (ref->u.ar.end[n], type) == FAILURE)
1744 if (gfc_simplify_expr (ref->u.ar.stride[n], type) == FAILURE)
1750 if (gfc_simplify_expr (ref->u.ss.start, type) == FAILURE)
1752 if (gfc_simplify_expr (ref->u.ss.end, type) == FAILURE)
1764 /* Try to substitute the value of a parameter variable. */
1767 simplify_parameter_variable (gfc_expr *p, int type)
1772 e = gfc_copy_expr (p->symtree->n.sym->value);
1778 /* Do not copy subobject refs for constant. */
1779 if (e->expr_type != EXPR_CONSTANT && p->ref != NULL)
1780 e->ref = gfc_copy_ref (p->ref);
1781 t = gfc_simplify_expr (e, type);
1783 /* Only use the simplification if it eliminated all subobject references. */
1784 if (t == SUCCESS && !e->ref)
1785 gfc_replace_expr (p, e);
1792 /* Given an expression, simplify it by collapsing constant
1793 expressions. Most simplification takes place when the expression
1794 tree is being constructed. If an intrinsic function is simplified
1795 at some point, we get called again to collapse the result against
1798 We work by recursively simplifying expression nodes, simplifying
1799 intrinsic functions where possible, which can lead to further
1800 constant collapsing. If an operator has constant operand(s), we
1801 rip the expression apart, and rebuild it, hoping that it becomes
1804 The expression type is defined for:
1805 0 Basic expression parsing
1806 1 Simplifying array constructors -- will substitute
1808 Returns FAILURE on error, SUCCESS otherwise.
1809 NOTE: Will return SUCCESS even if the expression can not be simplified. */
1812 gfc_simplify_expr (gfc_expr *p, int type)
1814 gfc_actual_arglist *ap;
1819 switch (p->expr_type)
1826 for (ap = p->value.function.actual; ap; ap = ap->next)
1827 if (gfc_simplify_expr (ap->expr, type) == FAILURE)
1830 if (p->value.function.isym != NULL
1831 && gfc_intrinsic_func_interface (p, 1) == MATCH_ERROR)
1836 case EXPR_SUBSTRING:
1837 if (simplify_ref_chain (p->ref, type) == FAILURE)
1840 if (gfc_is_constant_expr (p))
1846 if (p->ref && p->ref->u.ss.start)
1848 gfc_extract_int (p->ref->u.ss.start, &start);
1849 start--; /* Convert from one-based to zero-based. */
1852 end = p->value.character.length;
1853 if (p->ref && p->ref->u.ss.end)
1854 gfc_extract_int (p->ref->u.ss.end, &end);
1859 s = gfc_get_wide_string (end - start + 2);
1860 memcpy (s, p->value.character.string + start,
1861 (end - start) * sizeof (gfc_char_t));
1862 s[end - start + 1] = '\0'; /* TODO: C-style string. */
1863 free (p->value.character.string);
1864 p->value.character.string = s;
1865 p->value.character.length = end - start;
1866 p->ts.u.cl = gfc_new_charlen (gfc_current_ns, NULL);
1867 p->ts.u.cl->length = gfc_get_int_expr (gfc_default_integer_kind,
1869 p->value.character.length);
1870 gfc_free_ref_list (p->ref);
1872 p->expr_type = EXPR_CONSTANT;
1877 if (simplify_intrinsic_op (p, type) == FAILURE)
1882 /* Only substitute array parameter variables if we are in an
1883 initialization expression, or we want a subsection. */
1884 if (p->symtree->n.sym->attr.flavor == FL_PARAMETER
1885 && (gfc_init_expr_flag || p->ref
1886 || p->symtree->n.sym->value->expr_type != EXPR_ARRAY)
1887 && !p->symtree->n.sym->attr.vtab)
1889 if (simplify_parameter_variable (p, type) == FAILURE)
1896 gfc_simplify_iterator_var (p);
1899 /* Simplify subcomponent references. */
1900 if (simplify_ref_chain (p->ref, type) == FAILURE)
1905 case EXPR_STRUCTURE:
1907 if (simplify_ref_chain (p->ref, type) == FAILURE)
1910 if (simplify_constructor (p->value.constructor, type) == FAILURE)
1913 if (p->expr_type == EXPR_ARRAY && p->ref && p->ref->type == REF_ARRAY
1914 && p->ref->u.ar.type == AR_FULL)
1915 gfc_expand_constructor (p, false);
1917 if (simplify_const_ref (p) == FAILURE)
1932 /* Returns the type of an expression with the exception that iterator
1933 variables are automatically integers no matter what else they may
1939 if (e->expr_type == EXPR_VARIABLE && gfc_check_iter_variable (e) == SUCCESS)
1946 /* Check an intrinsic arithmetic operation to see if it is consistent
1947 with some type of expression. */
1949 static gfc_try check_init_expr (gfc_expr *);
1952 /* Scalarize an expression for an elemental intrinsic call. */
1955 scalarize_intrinsic_call (gfc_expr *e)
1957 gfc_actual_arglist *a, *b;
1958 gfc_constructor_base ctor;
1959 gfc_constructor *args[5];
1960 gfc_constructor *ci, *new_ctor;
1961 gfc_expr *expr, *old;
1962 int n, i, rank[5], array_arg;
1964 /* Find which, if any, arguments are arrays. Assume that the old
1965 expression carries the type information and that the first arg
1966 that is an array expression carries all the shape information.*/
1968 a = e->value.function.actual;
1969 for (; a; a = a->next)
1972 if (a->expr->expr_type != EXPR_ARRAY)
1975 expr = gfc_copy_expr (a->expr);
1982 old = gfc_copy_expr (e);
1984 gfc_constructor_free (expr->value.constructor);
1985 expr->value.constructor = NULL;
1987 expr->where = old->where;
1988 expr->expr_type = EXPR_ARRAY;
1990 /* Copy the array argument constructors into an array, with nulls
1993 a = old->value.function.actual;
1994 for (; a; a = a->next)
1996 /* Check that this is OK for an initialization expression. */
1997 if (a->expr && check_init_expr (a->expr) == FAILURE)
2001 if (a->expr && a->expr->rank && a->expr->expr_type == EXPR_VARIABLE)
2003 rank[n] = a->expr->rank;
2004 ctor = a->expr->symtree->n.sym->value->value.constructor;
2005 args[n] = gfc_constructor_first (ctor);
2007 else if (a->expr && a->expr->expr_type == EXPR_ARRAY)
2010 rank[n] = a->expr->rank;
2013 ctor = gfc_constructor_copy (a->expr->value.constructor);
2014 args[n] = gfc_constructor_first (ctor);
2023 /* Using the array argument as the master, step through the array
2024 calling the function for each element and advancing the array
2025 constructors together. */
2026 for (ci = args[array_arg - 1]; ci; ci = gfc_constructor_next (ci))
2028 new_ctor = gfc_constructor_append_expr (&expr->value.constructor,
2029 gfc_copy_expr (old), NULL);
2031 gfc_free_actual_arglist (new_ctor->expr->value.function.actual);
2033 b = old->value.function.actual;
2034 for (i = 0; i < n; i++)
2037 new_ctor->expr->value.function.actual
2038 = a = gfc_get_actual_arglist ();
2041 a->next = gfc_get_actual_arglist ();
2046 a->expr = gfc_copy_expr (args[i]->expr);
2048 a->expr = gfc_copy_expr (b->expr);
2053 /* Simplify the function calls. If the simplification fails, the
2054 error will be flagged up down-stream or the library will deal
2056 gfc_simplify_expr (new_ctor->expr, 0);
2058 for (i = 0; i < n; i++)
2060 args[i] = gfc_constructor_next (args[i]);
2062 for (i = 1; i < n; i++)
2063 if (rank[i] && ((args[i] != NULL && args[array_arg - 1] == NULL)
2064 || (args[i] == NULL && args[array_arg - 1] != NULL)))
2070 gfc_free_expr (old);
2074 gfc_error_now ("elemental function arguments at %C are not compliant");
2077 gfc_free_expr (expr);
2078 gfc_free_expr (old);
2084 check_intrinsic_op (gfc_expr *e, gfc_try (*check_function) (gfc_expr *))
2086 gfc_expr *op1 = e->value.op.op1;
2087 gfc_expr *op2 = e->value.op.op2;
2089 if ((*check_function) (op1) == FAILURE)
2092 switch (e->value.op.op)
2094 case INTRINSIC_UPLUS:
2095 case INTRINSIC_UMINUS:
2096 if (!numeric_type (et0 (op1)))
2101 case INTRINSIC_EQ_OS:
2103 case INTRINSIC_NE_OS:
2105 case INTRINSIC_GT_OS:
2107 case INTRINSIC_GE_OS:
2109 case INTRINSIC_LT_OS:
2111 case INTRINSIC_LE_OS:
2112 if ((*check_function) (op2) == FAILURE)
2115 if (!(et0 (op1) == BT_CHARACTER && et0 (op2) == BT_CHARACTER)
2116 && !(numeric_type (et0 (op1)) && numeric_type (et0 (op2))))
2118 gfc_error ("Numeric or CHARACTER operands are required in "
2119 "expression at %L", &e->where);
2124 case INTRINSIC_PLUS:
2125 case INTRINSIC_MINUS:
2126 case INTRINSIC_TIMES:
2127 case INTRINSIC_DIVIDE:
2128 case INTRINSIC_POWER:
2129 if ((*check_function) (op2) == FAILURE)
2132 if (!numeric_type (et0 (op1)) || !numeric_type (et0 (op2)))
2137 case INTRINSIC_CONCAT:
2138 if ((*check_function) (op2) == FAILURE)
2141 if (et0 (op1) != BT_CHARACTER || et0 (op2) != BT_CHARACTER)
2143 gfc_error ("Concatenation operator in expression at %L "
2144 "must have two CHARACTER operands", &op1->where);
2148 if (op1->ts.kind != op2->ts.kind)
2150 gfc_error ("Concat operator at %L must concatenate strings of the "
2151 "same kind", &e->where);
2158 if (et0 (op1) != BT_LOGICAL)
2160 gfc_error (".NOT. operator in expression at %L must have a LOGICAL "
2161 "operand", &op1->where);
2170 case INTRINSIC_NEQV:
2171 if ((*check_function) (op2) == FAILURE)
2174 if (et0 (op1) != BT_LOGICAL || et0 (op2) != BT_LOGICAL)
2176 gfc_error ("LOGICAL operands are required in expression at %L",
2183 case INTRINSIC_PARENTHESES:
2187 gfc_error ("Only intrinsic operators can be used in expression at %L",
2195 gfc_error ("Numeric operands are required in expression at %L", &e->where);
2200 /* F2003, 7.1.7 (3): In init expression, allocatable components
2201 must not be data-initialized. */
2203 check_alloc_comp_init (gfc_expr *e)
2205 gfc_component *comp;
2206 gfc_constructor *ctor;
2208 gcc_assert (e->expr_type == EXPR_STRUCTURE);
2209 gcc_assert (e->ts.type == BT_DERIVED);
2211 for (comp = e->ts.u.derived->components,
2212 ctor = gfc_constructor_first (e->value.constructor);
2213 comp; comp = comp->next, ctor = gfc_constructor_next (ctor))
2215 if (comp->attr.allocatable
2216 && ctor->expr->expr_type != EXPR_NULL)
2218 gfc_error("Invalid initialization expression for ALLOCATABLE "
2219 "component '%s' in structure constructor at %L",
2220 comp->name, &ctor->expr->where);
2229 check_init_expr_arguments (gfc_expr *e)
2231 gfc_actual_arglist *ap;
2233 for (ap = e->value.function.actual; ap; ap = ap->next)
2234 if (check_init_expr (ap->expr) == FAILURE)
2240 static gfc_try check_restricted (gfc_expr *);
2242 /* F95, 7.1.6.1, Initialization expressions, (7)
2243 F2003, 7.1.7 Initialization expression, (8) */
2246 check_inquiry (gfc_expr *e, int not_restricted)
2249 const char *const *functions;
2251 static const char *const inquiry_func_f95[] = {
2252 "lbound", "shape", "size", "ubound",
2253 "bit_size", "len", "kind",
2254 "digits", "epsilon", "huge", "maxexponent", "minexponent",
2255 "precision", "radix", "range", "tiny",
2259 static const char *const inquiry_func_f2003[] = {
2260 "lbound", "shape", "size", "ubound",
2261 "bit_size", "len", "kind",
2262 "digits", "epsilon", "huge", "maxexponent", "minexponent",
2263 "precision", "radix", "range", "tiny",
2268 gfc_actual_arglist *ap;
2270 if (!e->value.function.isym
2271 || !e->value.function.isym->inquiry)
2274 /* An undeclared parameter will get us here (PR25018). */
2275 if (e->symtree == NULL)
2278 name = e->symtree->n.sym->name;
2280 functions = (gfc_option.warn_std & GFC_STD_F2003)
2281 ? inquiry_func_f2003 : inquiry_func_f95;
2283 for (i = 0; functions[i]; i++)
2284 if (strcmp (functions[i], name) == 0)
2287 if (functions[i] == NULL)
2290 /* At this point we have an inquiry function with a variable argument. The
2291 type of the variable might be undefined, but we need it now, because the
2292 arguments of these functions are not allowed to be undefined. */
2294 for (ap = e->value.function.actual; ap; ap = ap->next)
2299 if (ap->expr->ts.type == BT_UNKNOWN)
2301 if (ap->expr->symtree->n.sym->ts.type == BT_UNKNOWN
2302 && gfc_set_default_type (ap->expr->symtree->n.sym, 0, gfc_current_ns)
2306 ap->expr->ts = ap->expr->symtree->n.sym->ts;
2309 /* Assumed character length will not reduce to a constant expression
2310 with LEN, as required by the standard. */
2311 if (i == 5 && not_restricted
2312 && ap->expr->symtree->n.sym->ts.type == BT_CHARACTER
2313 && (ap->expr->symtree->n.sym->ts.u.cl->length == NULL
2314 || ap->expr->symtree->n.sym->ts.deferred))
2316 gfc_error ("Assumed or deferred character length variable '%s' "
2317 " in constant expression at %L",
2318 ap->expr->symtree->n.sym->name,
2322 else if (not_restricted && check_init_expr (ap->expr) == FAILURE)
2325 if (not_restricted == 0
2326 && ap->expr->expr_type != EXPR_VARIABLE
2327 && check_restricted (ap->expr) == FAILURE)
2330 if (not_restricted == 0
2331 && ap->expr->expr_type == EXPR_VARIABLE
2332 && ap->expr->symtree->n.sym->attr.dummy
2333 && ap->expr->symtree->n.sym->attr.optional)
2341 /* F95, 7.1.6.1, Initialization expressions, (5)
2342 F2003, 7.1.7 Initialization expression, (5) */
2345 check_transformational (gfc_expr *e)
2347 static const char * const trans_func_f95[] = {
2348 "repeat", "reshape", "selected_int_kind",
2349 "selected_real_kind", "transfer", "trim", NULL
2352 static const char * const trans_func_f2003[] = {
2353 "all", "any", "count", "dot_product", "matmul", "null", "pack",
2354 "product", "repeat", "reshape", "selected_char_kind", "selected_int_kind",
2355 "selected_real_kind", "spread", "sum", "transfer", "transpose",
2356 "trim", "unpack", NULL
2361 const char *const *functions;
2363 if (!e->value.function.isym
2364 || !e->value.function.isym->transformational)
2367 name = e->symtree->n.sym->name;
2369 functions = (gfc_option.allow_std & GFC_STD_F2003)
2370 ? trans_func_f2003 : trans_func_f95;
2372 /* NULL() is dealt with below. */
2373 if (strcmp ("null", name) == 0)
2376 for (i = 0; functions[i]; i++)
2377 if (strcmp (functions[i], name) == 0)
2380 if (functions[i] == NULL)
2382 gfc_error("transformational intrinsic '%s' at %L is not permitted "
2383 "in an initialization expression", name, &e->where);
2387 return check_init_expr_arguments (e);
2391 /* F95, 7.1.6.1, Initialization expressions, (6)
2392 F2003, 7.1.7 Initialization expression, (6) */
2395 check_null (gfc_expr *e)
2397 if (strcmp ("null", e->symtree->n.sym->name) != 0)
2400 return check_init_expr_arguments (e);
2405 check_elemental (gfc_expr *e)
2407 if (!e->value.function.isym
2408 || !e->value.function.isym->elemental)
2411 if (e->ts.type != BT_INTEGER
2412 && e->ts.type != BT_CHARACTER
2413 && gfc_notify_std (GFC_STD_F2003, "Extension: Evaluation of "
2414 "nonstandard initialization expression at %L",
2415 &e->where) == FAILURE)
2418 return check_init_expr_arguments (e);
2423 check_conversion (gfc_expr *e)
2425 if (!e->value.function.isym
2426 || !e->value.function.isym->conversion)
2429 return check_init_expr_arguments (e);
2433 /* Verify that an expression is an initialization expression. A side
2434 effect is that the expression tree is reduced to a single constant
2435 node if all goes well. This would normally happen when the
2436 expression is constructed but function references are assumed to be
2437 intrinsics in the context of initialization expressions. If
2438 FAILURE is returned an error message has been generated. */
2441 check_init_expr (gfc_expr *e)
2449 switch (e->expr_type)
2452 t = check_intrinsic_op (e, check_init_expr);
2454 t = gfc_simplify_expr (e, 0);
2462 gfc_intrinsic_sym* isym;
2465 sym = e->symtree->n.sym;
2466 if (!gfc_is_intrinsic (sym, 0, e->where)
2467 || (m = gfc_intrinsic_func_interface (e, 0)) != MATCH_YES)
2469 gfc_error ("Function '%s' in initialization expression at %L "
2470 "must be an intrinsic function",
2471 e->symtree->n.sym->name, &e->where);
2475 if ((m = check_conversion (e)) == MATCH_NO
2476 && (m = check_inquiry (e, 1)) == MATCH_NO
2477 && (m = check_null (e)) == MATCH_NO
2478 && (m = check_transformational (e)) == MATCH_NO
2479 && (m = check_elemental (e)) == MATCH_NO)
2481 gfc_error ("Intrinsic function '%s' at %L is not permitted "
2482 "in an initialization expression",
2483 e->symtree->n.sym->name, &e->where);
2487 if (m == MATCH_ERROR)
2490 /* Try to scalarize an elemental intrinsic function that has an
2492 isym = gfc_find_function (e->symtree->n.sym->name);
2493 if (isym && isym->elemental
2494 && (t = scalarize_intrinsic_call (e)) == SUCCESS)
2499 t = gfc_simplify_expr (e, 0);
2506 if (gfc_check_iter_variable (e) == SUCCESS)
2509 if (e->symtree->n.sym->attr.flavor == FL_PARAMETER)
2511 /* A PARAMETER shall not be used to define itself, i.e.
2512 REAL, PARAMETER :: x = transfer(0, x)
2514 if (!e->symtree->n.sym->value)
2516 gfc_error("PARAMETER '%s' is used at %L before its definition "
2517 "is complete", e->symtree->n.sym->name, &e->where);
2521 t = simplify_parameter_variable (e, 0);
2526 if (gfc_in_match_data ())
2531 if (e->symtree->n.sym->as)
2533 switch (e->symtree->n.sym->as->type)
2535 case AS_ASSUMED_SIZE:
2536 gfc_error ("Assumed size array '%s' at %L is not permitted "
2537 "in an initialization expression",
2538 e->symtree->n.sym->name, &e->where);
2541 case AS_ASSUMED_SHAPE:
2542 gfc_error ("Assumed shape array '%s' at %L is not permitted "
2543 "in an initialization expression",
2544 e->symtree->n.sym->name, &e->where);
2548 gfc_error ("Deferred array '%s' at %L is not permitted "
2549 "in an initialization expression",
2550 e->symtree->n.sym->name, &e->where);
2554 gfc_error ("Array '%s' at %L is a variable, which does "
2555 "not reduce to a constant expression",
2556 e->symtree->n.sym->name, &e->where);
2564 gfc_error ("Parameter '%s' at %L has not been declared or is "
2565 "a variable, which does not reduce to a constant "
2566 "expression", e->symtree->n.sym->name, &e->where);
2575 case EXPR_SUBSTRING:
2576 t = check_init_expr (e->ref->u.ss.start);
2580 t = check_init_expr (e->ref->u.ss.end);
2582 t = gfc_simplify_expr (e, 0);
2586 case EXPR_STRUCTURE:
2587 t = e->ts.is_iso_c ? SUCCESS : FAILURE;
2591 t = check_alloc_comp_init (e);
2595 t = gfc_check_constructor (e, check_init_expr);
2602 t = gfc_check_constructor (e, check_init_expr);
2606 t = gfc_expand_constructor (e, true);
2610 t = gfc_check_constructor_type (e);
2614 gfc_internal_error ("check_init_expr(): Unknown expression type");
2620 /* Reduces a general expression to an initialization expression (a constant).
2621 This used to be part of gfc_match_init_expr.
2622 Note that this function doesn't free the given expression on FAILURE. */
2625 gfc_reduce_init_expr (gfc_expr *expr)
2629 gfc_init_expr_flag = true;
2630 t = gfc_resolve_expr (expr);
2632 t = check_init_expr (expr);
2633 gfc_init_expr_flag = false;
2638 if (expr->expr_type == EXPR_ARRAY)
2640 if (gfc_check_constructor_type (expr) == FAILURE)
2642 if (gfc_expand_constructor (expr, true) == FAILURE)
2650 /* Match an initialization expression. We work by first matching an
2651 expression, then reducing it to a constant. */
2654 gfc_match_init_expr (gfc_expr **result)
2662 gfc_init_expr_flag = true;
2664 m = gfc_match_expr (&expr);
2667 gfc_init_expr_flag = false;
2671 t = gfc_reduce_init_expr (expr);
2674 gfc_free_expr (expr);
2675 gfc_init_expr_flag = false;
2680 gfc_init_expr_flag = false;
2686 /* Given an actual argument list, test to see that each argument is a
2687 restricted expression and optionally if the expression type is
2688 integer or character. */
2691 restricted_args (gfc_actual_arglist *a)
2693 for (; a; a = a->next)
2695 if (check_restricted (a->expr) == FAILURE)
2703 /************* Restricted/specification expressions *************/
2706 /* Make sure a non-intrinsic function is a specification function. */
2709 external_spec_function (gfc_expr *e)
2713 f = e->value.function.esym;
2715 if (f->attr.proc == PROC_ST_FUNCTION)
2717 gfc_error ("Specification function '%s' at %L cannot be a statement "
2718 "function", f->name, &e->where);
2722 if (f->attr.proc == PROC_INTERNAL)
2724 gfc_error ("Specification function '%s' at %L cannot be an internal "
2725 "function", f->name, &e->where);
2729 if (!f->attr.pure && !f->attr.elemental)
2731 gfc_error ("Specification function '%s' at %L must be PURE", f->name,
2736 if (f->attr.recursive)
2738 gfc_error ("Specification function '%s' at %L cannot be RECURSIVE",
2739 f->name, &e->where);
2743 return restricted_args (e->value.function.actual);
2747 /* Check to see that a function reference to an intrinsic is a
2748 restricted expression. */
2751 restricted_intrinsic (gfc_expr *e)
2753 /* TODO: Check constraints on inquiry functions. 7.1.6.2 (7). */
2754 if (check_inquiry (e, 0) == MATCH_YES)
2757 return restricted_args (e->value.function.actual);
2761 /* Check the expressions of an actual arglist. Used by check_restricted. */
2764 check_arglist (gfc_actual_arglist* arg, gfc_try (*checker) (gfc_expr*))
2766 for (; arg; arg = arg->next)
2767 if (checker (arg->expr) == FAILURE)
2774 /* Check the subscription expressions of a reference chain with a checking
2775 function; used by check_restricted. */
2778 check_references (gfc_ref* ref, gfc_try (*checker) (gfc_expr*))
2788 for (dim = 0; dim != ref->u.ar.dimen; ++dim)
2790 if (checker (ref->u.ar.start[dim]) == FAILURE)
2792 if (checker (ref->u.ar.end[dim]) == FAILURE)
2794 if (checker (ref->u.ar.stride[dim]) == FAILURE)
2800 /* Nothing needed, just proceed to next reference. */
2804 if (checker (ref->u.ss.start) == FAILURE)
2806 if (checker (ref->u.ss.end) == FAILURE)
2815 return check_references (ref->next, checker);
2819 /* Verify that an expression is a restricted expression. Like its
2820 cousin check_init_expr(), an error message is generated if we
2824 check_restricted (gfc_expr *e)
2832 switch (e->expr_type)
2835 t = check_intrinsic_op (e, check_restricted);
2837 t = gfc_simplify_expr (e, 0);
2842 if (e->value.function.esym)
2844 t = check_arglist (e->value.function.actual, &check_restricted);
2846 t = external_spec_function (e);
2850 if (e->value.function.isym && e->value.function.isym->inquiry)
2853 t = check_arglist (e->value.function.actual, &check_restricted);
2856 t = restricted_intrinsic (e);
2861 sym = e->symtree->n.sym;
2864 /* If a dummy argument appears in a context that is valid for a
2865 restricted expression in an elemental procedure, it will have
2866 already been simplified away once we get here. Therefore we
2867 don't need to jump through hoops to distinguish valid from
2869 if (sym->attr.dummy && sym->ns == gfc_current_ns
2870 && sym->ns->proc_name && sym->ns->proc_name->attr.elemental)
2872 gfc_error ("Dummy argument '%s' not allowed in expression at %L",
2873 sym->name, &e->where);
2877 if (sym->attr.optional)
2879 gfc_error ("Dummy argument '%s' at %L cannot be OPTIONAL",
2880 sym->name, &e->where);
2884 if (sym->attr.intent == INTENT_OUT)
2886 gfc_error ("Dummy argument '%s' at %L cannot be INTENT(OUT)",
2887 sym->name, &e->where);
2891 /* Check reference chain if any. */
2892 if (check_references (e->ref, &check_restricted) == FAILURE)
2895 /* gfc_is_formal_arg broadcasts that a formal argument list is being
2896 processed in resolve.c(resolve_formal_arglist). This is done so
2897 that host associated dummy array indices are accepted (PR23446).
2898 This mechanism also does the same for the specification expressions
2899 of array-valued functions. */
2901 || sym->attr.in_common
2902 || sym->attr.use_assoc
2904 || sym->attr.implied_index
2905 || sym->attr.flavor == FL_PARAMETER
2906 || (sym->ns && sym->ns == gfc_current_ns->parent)
2907 || (sym->ns && gfc_current_ns->parent
2908 && sym->ns == gfc_current_ns->parent->parent)
2909 || (sym->ns->proc_name != NULL
2910 && sym->ns->proc_name->attr.flavor == FL_MODULE)
2911 || (gfc_is_formal_arg () && (sym->ns == gfc_current_ns)))
2917 gfc_error ("Variable '%s' cannot appear in the expression at %L",
2918 sym->name, &e->where);
2919 /* Prevent a repetition of the error. */
2928 case EXPR_SUBSTRING:
2929 t = gfc_specification_expr (e->ref->u.ss.start);
2933 t = gfc_specification_expr (e->ref->u.ss.end);
2935 t = gfc_simplify_expr (e, 0);
2939 case EXPR_STRUCTURE:
2940 t = gfc_check_constructor (e, check_restricted);
2944 t = gfc_check_constructor (e, check_restricted);
2948 gfc_internal_error ("check_restricted(): Unknown expression type");
2955 /* Check to see that an expression is a specification expression. If
2956 we return FAILURE, an error has been generated. */
2959 gfc_specification_expr (gfc_expr *e)
2961 gfc_component *comp;
2966 if (e->ts.type != BT_INTEGER)
2968 gfc_error ("Expression at %L must be of INTEGER type, found %s",
2969 &e->where, gfc_basic_typename (e->ts.type));
2973 if (e->expr_type == EXPR_FUNCTION
2974 && !e->value.function.isym
2975 && !e->value.function.esym
2976 && !gfc_pure (e->symtree->n.sym)
2977 && (!gfc_is_proc_ptr_comp (e, &comp)
2978 || !comp->attr.pure))
2980 gfc_error ("Function '%s' at %L must be PURE",
2981 e->symtree->n.sym->name, &e->where);
2982 /* Prevent repeat error messages. */
2983 e->symtree->n.sym->attr.pure = 1;
2989 gfc_error ("Expression at %L must be scalar", &e->where);
2993 if (gfc_simplify_expr (e, 0) == FAILURE)
2996 return check_restricted (e);
3000 /************** Expression conformance checks. *************/
3002 /* Given two expressions, make sure that the arrays are conformable. */
3005 gfc_check_conformance (gfc_expr *op1, gfc_expr *op2, const char *optype_msgid, ...)
3007 int op1_flag, op2_flag, d;
3008 mpz_t op1_size, op2_size;
3014 if (op1->rank == 0 || op2->rank == 0)
3017 va_start (argp, optype_msgid);
3018 vsnprintf (buffer, 240, optype_msgid, argp);
3021 if (op1->rank != op2->rank)
3023 gfc_error ("Incompatible ranks in %s (%d and %d) at %L", _(buffer),
3024 op1->rank, op2->rank, &op1->where);
3030 for (d = 0; d < op1->rank; d++)
3032 op1_flag = gfc_array_dimen_size (op1, d, &op1_size) == SUCCESS;
3033 op2_flag = gfc_array_dimen_size (op2, d, &op2_size) == SUCCESS;
3035 if (op1_flag && op2_flag && mpz_cmp (op1_size, op2_size) != 0)
3037 gfc_error ("Different shape for %s at %L on dimension %d "
3038 "(%d and %d)", _(buffer), &op1->where, d + 1,
3039 (int) mpz_get_si (op1_size),
3040 (int) mpz_get_si (op2_size));
3046 mpz_clear (op1_size);
3048 mpz_clear (op2_size);
3058 /* Given an assignable expression and an arbitrary expression, make
3059 sure that the assignment can take place. */
3062 gfc_check_assign (gfc_expr *lvalue, gfc_expr *rvalue, int conform)
3068 sym = lvalue->symtree->n.sym;
3070 /* See if this is the component or subcomponent of a pointer. */
3071 has_pointer = sym->attr.pointer;
3072 for (ref = lvalue->ref; ref; ref = ref->next)
3073 if (ref->type == REF_COMPONENT && ref->u.c.component->attr.pointer)
3079 /* 12.5.2.2, Note 12.26: The result variable is very similar to any other
3080 variable local to a function subprogram. Its existence begins when
3081 execution of the function is initiated and ends when execution of the
3082 function is terminated...
3083 Therefore, the left hand side is no longer a variable, when it is: */
3084 if (sym->attr.flavor == FL_PROCEDURE && sym->attr.proc != PROC_ST_FUNCTION
3085 && !sym->attr.external)
3090 /* (i) Use associated; */
3091 if (sym->attr.use_assoc)
3094 /* (ii) The assignment is in the main program; or */
3095 if (gfc_current_ns->proc_name->attr.is_main_program)
3098 /* (iii) A module or internal procedure... */
3099 if ((gfc_current_ns->proc_name->attr.proc == PROC_INTERNAL
3100 || gfc_current_ns->proc_name->attr.proc == PROC_MODULE)
3101 && gfc_current_ns->parent
3102 && (!(gfc_current_ns->parent->proc_name->attr.function
3103 || gfc_current_ns->parent->proc_name->attr.subroutine)
3104 || gfc_current_ns->parent->proc_name->attr.is_main_program))
3106 /* ... that is not a function... */
3107 if (!gfc_current_ns->proc_name->attr.function)
3110 /* ... or is not an entry and has a different name. */
3111 if (!sym->attr.entry && sym->name != gfc_current_ns->proc_name->name)
3115 /* (iv) Host associated and not the function symbol or the
3116 parent result. This picks up sibling references, which
3117 cannot be entries. */
3118 if (!sym->attr.entry
3119 && sym->ns == gfc_current_ns->parent
3120 && sym != gfc_current_ns->proc_name
3121 && sym != gfc_current_ns->parent->proc_name->result)
3126 gfc_error ("'%s' at %L is not a VALUE", sym->name, &lvalue->where);
3131 if (rvalue->rank != 0 && lvalue->rank != rvalue->rank)
3133 gfc_error ("Incompatible ranks %d and %d in assignment at %L",
3134 lvalue->rank, rvalue->rank, &lvalue->where);
3138 if (lvalue->ts.type == BT_UNKNOWN)
3140 gfc_error ("Variable type is UNKNOWN in assignment at %L",
3145 if (rvalue->expr_type == EXPR_NULL)
3147 if (has_pointer && (ref == NULL || ref->next == NULL)
3148 && lvalue->symtree->n.sym->attr.data)
3152 gfc_error ("NULL appears on right-hand side in assignment at %L",
3158 /* This is possibly a typo: x = f() instead of x => f(). */
3159 if (gfc_option.warn_surprising
3160 && rvalue->expr_type == EXPR_FUNCTION
3161 && rvalue->symtree->n.sym->attr.pointer)
3162 gfc_warning ("POINTER valued function appears on right-hand side of "
3163 "assignment at %L", &rvalue->where);
3165 /* Check size of array assignments. */
3166 if (lvalue->rank != 0 && rvalue->rank != 0
3167 && gfc_check_conformance (lvalue, rvalue, "array assignment") != SUCCESS)
3170 if (rvalue->is_boz && lvalue->ts.type != BT_INTEGER
3171 && lvalue->symtree->n.sym->attr.data
3172 && gfc_notify_std (GFC_STD_GNU, "Extension: BOZ literal at %L used to "
3173 "initialize non-integer variable '%s'",
3174 &rvalue->where, lvalue->symtree->n.sym->name)
3177 else if (rvalue->is_boz && !lvalue->symtree->n.sym->attr.data
3178 && gfc_notify_std (GFC_STD_GNU, "Extension: BOZ literal at %L outside "
3179 "a DATA statement and outside INT/REAL/DBLE/CMPLX",
3180 &rvalue->where) == FAILURE)
3183 /* Handle the case of a BOZ literal on the RHS. */
3184 if (rvalue->is_boz && lvalue->ts.type != BT_INTEGER)
3187 if (gfc_option.warn_surprising)
3188 gfc_warning ("BOZ literal at %L is bitwise transferred "
3189 "non-integer symbol '%s'", &rvalue->where,
3190 lvalue->symtree->n.sym->name);
3191 if (!gfc_convert_boz (rvalue, &lvalue->ts))
3193 if ((rc = gfc_range_check (rvalue)) != ARITH_OK)
3195 if (rc == ARITH_UNDERFLOW)
3196 gfc_error ("Arithmetic underflow of bit-wise transferred BOZ at %L"
3197 ". This check can be disabled with the option "
3198 "-fno-range-check", &rvalue->where);
3199 else if (rc == ARITH_OVERFLOW)
3200 gfc_error ("Arithmetic overflow of bit-wise transferred BOZ at %L"
3201 ". This check can be disabled with the option "
3202 "-fno-range-check", &rvalue->where);
3203 else if (rc == ARITH_NAN)
3204 gfc_error ("Arithmetic NaN of bit-wise transferred BOZ at %L"
3205 ". This check can be disabled with the option "
3206 "-fno-range-check", &rvalue->where);
3211 /* Warn about type-changing conversions for REAL or COMPLEX constants.
3212 If lvalue and rvalue are mixed REAL and complex, gfc_compare_types
3213 will warn anyway, so there is no need to to so here. */
3215 if (rvalue->expr_type == EXPR_CONSTANT && lvalue->ts.type == rvalue->ts.type
3216 && (lvalue->ts.type == BT_REAL || lvalue->ts.type == BT_COMPLEX))
3218 if (lvalue->ts.kind < rvalue->ts.kind && gfc_option.gfc_warn_conversion)
3220 /* As a special bonus, don't warn about REAL rvalues which are not
3221 changed by the conversion if -Wconversion is specified. */
3222 if (rvalue->ts.type == BT_REAL && mpfr_number_p (rvalue->value.real))
3224 /* Calculate the difference between the constant and the rounded
3225 value and check it against zero. */
3227 gfc_set_model_kind (lvalue->ts.kind);
3229 gfc_set_model_kind (rvalue->ts.kind);
3232 mpfr_set (rv, rvalue->value.real, GFC_RND_MODE);
3233 mpfr_sub (diff, rv, rvalue->value.real, GFC_RND_MODE);
3235 if (!mpfr_zero_p (diff))
3236 gfc_warning ("Change of value in conversion from "
3237 " %s to %s at %L", gfc_typename (&rvalue->ts),
3238 gfc_typename (&lvalue->ts), &rvalue->where);
3244 gfc_warning ("Possible change of value in conversion from %s "
3245 "to %s at %L",gfc_typename (&rvalue->ts),
3246 gfc_typename (&lvalue->ts), &rvalue->where);
3249 else if (gfc_option.warn_conversion_extra
3250 && lvalue->ts.kind > rvalue->ts.kind)
3252 gfc_warning ("Conversion from %s to %s at %L",
3253 gfc_typename (&rvalue->ts),
3254 gfc_typename (&lvalue->ts), &rvalue->where);
3258 if (gfc_compare_types (&lvalue->ts, &rvalue->ts))
3261 /* Only DATA Statements come here. */
3264 /* Numeric can be converted to any other numeric. And Hollerith can be
3265 converted to any other type. */
3266 if ((gfc_numeric_ts (&lvalue->ts) && gfc_numeric_ts (&rvalue->ts))
3267 || rvalue->ts.type == BT_HOLLERITH)
3270 if (lvalue->ts.type == BT_LOGICAL && rvalue->ts.type == BT_LOGICAL)
3273 gfc_error ("Incompatible types in DATA statement at %L; attempted "
3274 "conversion of %s to %s", &lvalue->where,
3275 gfc_typename (&rvalue->ts), gfc_typename (&lvalue->ts));
3280 /* Assignment is the only case where character variables of different
3281 kind values can be converted into one another. */
3282 if (lvalue->ts.type == BT_CHARACTER && rvalue->ts.type == BT_CHARACTER)
3284 if (lvalue->ts.kind != rvalue->ts.kind)
3285 gfc_convert_chartype (rvalue, &lvalue->ts);
3290 return gfc_convert_type (rvalue, &lvalue->ts, 1);
3294 /* Check that a pointer assignment is OK. We first check lvalue, and
3295 we only check rvalue if it's not an assignment to NULL() or a
3296 NULLIFY statement. */
3299 gfc_check_pointer_assign (gfc_expr *lvalue, gfc_expr *rvalue)
3301 symbol_attribute attr;
3303 bool is_pure, is_implicit_pure, rank_remap;
3306 if (lvalue->symtree->n.sym->ts.type == BT_UNKNOWN
3307 && !lvalue->symtree->n.sym->attr.proc_pointer)
3309 gfc_error ("Pointer assignment target is not a POINTER at %L",
3314 if (lvalue->symtree->n.sym->attr.flavor == FL_PROCEDURE
3315 && lvalue->symtree->n.sym->attr.use_assoc
3316 && !lvalue->symtree->n.sym->attr.proc_pointer)
3318 gfc_error ("'%s' in the pointer assignment at %L cannot be an "
3319 "l-value since it is a procedure",
3320 lvalue->symtree->n.sym->name, &lvalue->where);
3324 proc_pointer = lvalue->symtree->n.sym->attr.proc_pointer;
3327 for (ref = lvalue->ref; ref; ref = ref->next)
3329 if (ref->type == REF_COMPONENT)
3330 proc_pointer = ref->u.c.component->attr.proc_pointer;
3332 if (ref->type == REF_ARRAY && ref->next == NULL)
3336 if (ref->u.ar.type == AR_FULL)
3339 if (ref->u.ar.type != AR_SECTION)
3341 gfc_error ("Expected bounds specification for '%s' at %L",
3342 lvalue->symtree->n.sym->name, &lvalue->where);
3346 if (gfc_notify_std (GFC_STD_F2003,"Fortran 2003: Bounds "
3347 "specification for '%s' in pointer assignment "
3348 "at %L", lvalue->symtree->n.sym->name,
3349 &lvalue->where) == FAILURE)
3352 /* When bounds are given, all lbounds are necessary and either all
3353 or none of the upper bounds; no strides are allowed. If the
3354 upper bounds are present, we may do rank remapping. */
3355 for (dim = 0; dim < ref->u.ar.dimen; ++dim)
3357 if (!ref->u.ar.start[dim]
3358 || ref->u.ar.dimen_type[dim] != DIMEN_RANGE)
3360 gfc_error ("Lower bound has to be present at %L",
3364 if (ref->u.ar.stride[dim])
3366 gfc_error ("Stride must not be present at %L",
3372 rank_remap = (ref->u.ar.end[dim] != NULL);
3375 if ((rank_remap && !ref->u.ar.end[dim])
3376 || (!rank_remap && ref->u.ar.end[dim]))
3378 gfc_error ("Either all or none of the upper bounds"
3379 " must be specified at %L", &lvalue->where);
3387 is_pure = gfc_pure (NULL);
3388 is_implicit_pure = gfc_implicit_pure (NULL);
3390 /* If rvalue is a NULL() or NULLIFY, we're done. Otherwise the type,
3391 kind, etc for lvalue and rvalue must match, and rvalue must be a
3392 pure variable if we're in a pure function. */
3393 if (rvalue->expr_type == EXPR_NULL && rvalue->ts.type == BT_UNKNOWN)
3396 /* F2008, C723 (pointer) and C726 (proc-pointer); for PURE also C1283. */
3397 if (lvalue->expr_type == EXPR_VARIABLE
3398 && gfc_is_coindexed (lvalue))
3401 for (ref = lvalue->ref; ref; ref = ref->next)
3402 if (ref->type == REF_ARRAY && ref->u.ar.codimen)
3404 gfc_error ("Pointer object at %L shall not have a coindex",
3410 /* Checks on rvalue for procedure pointer assignments. */
3415 gfc_component *comp;
3418 attr = gfc_expr_attr (rvalue);
3419 if (!((rvalue->expr_type == EXPR_NULL)
3420 || (rvalue->expr_type == EXPR_FUNCTION && attr.proc_pointer)
3421 || (rvalue->expr_type == EXPR_VARIABLE && attr.proc_pointer)
3422 || (rvalue->expr_type == EXPR_VARIABLE
3423 && attr.flavor == FL_PROCEDURE)))
3425 gfc_error ("Invalid procedure pointer assignment at %L",
3431 gfc_error ("Abstract interface '%s' is invalid "
3432 "in procedure pointer assignment at %L",
3433 rvalue->symtree->name, &rvalue->where);
3436 /* Check for F08:C729. */
3437 if (attr.flavor == FL_PROCEDURE)
3439 if (attr.proc == PROC_ST_FUNCTION)
3441 gfc_error ("Statement function '%s' is invalid "
3442 "in procedure pointer assignment at %L",
3443 rvalue->symtree->name, &rvalue->where);
3446 if (attr.proc == PROC_INTERNAL &&
3447 gfc_notify_std (GFC_STD_F2008, "Internal procedure '%s' is "
3448 "invalid in procedure pointer assignment at %L",
3449 rvalue->symtree->name, &rvalue->where) == FAILURE)
3452 /* Check for F08:C730. */
3453 if (attr.elemental && !attr.intrinsic)
3455 gfc_error ("Nonintrinsic elemental procedure '%s' is invalid "
3456 "in procedure pointer assigment at %L",
3457 rvalue->symtree->name, &rvalue->where);
3461 /* Ensure that the calling convention is the same. As other attributes
3462 such as DLLEXPORT may differ, one explicitly only tests for the
3463 calling conventions. */
3464 if (rvalue->expr_type == EXPR_VARIABLE
3465 && lvalue->symtree->n.sym->attr.ext_attr
3466 != rvalue->symtree->n.sym->attr.ext_attr)
3468 symbol_attribute calls;
3471 gfc_add_ext_attribute (&calls, EXT_ATTR_CDECL, NULL);
3472 gfc_add_ext_attribute (&calls, EXT_ATTR_STDCALL, NULL);
3473 gfc_add_ext_attribute (&calls, EXT_ATTR_FASTCALL, NULL);
3475 if ((calls.ext_attr & lvalue->symtree->n.sym->attr.ext_attr)
3476 != (calls.ext_attr & rvalue->symtree->n.sym->attr.ext_attr))
3478 gfc_error ("Mismatch in the procedure pointer assignment "
3479 "at %L: mismatch in the calling convention",
3485 if (gfc_is_proc_ptr_comp (lvalue, &comp))
3486 s1 = comp->ts.interface;
3488 s1 = lvalue->symtree->n.sym;
3490 if (gfc_is_proc_ptr_comp (rvalue, &comp))
3492 s2 = comp->ts.interface;
3495 else if (rvalue->expr_type == EXPR_FUNCTION)
3497 s2 = rvalue->symtree->n.sym->result;
3498 name = rvalue->symtree->n.sym->result->name;
3502 s2 = rvalue->symtree->n.sym;
3503 name = rvalue->symtree->n.sym->name;
3506 if (s1 && s2 && !gfc_compare_interfaces (s1, s2, name, 0, 1,
3509 gfc_error ("Interface mismatch in procedure pointer assignment "
3510 "at %L: %s", &rvalue->where, err);
3517 if (!gfc_compare_types (&lvalue->ts, &rvalue->ts))
3519 gfc_error ("Different types in pointer assignment at %L; attempted "
3520 "assignment of %s to %s", &lvalue->where,
3521 gfc_typename (&rvalue->ts), gfc_typename (&lvalue->ts));
3525 if (lvalue->ts.type != BT_CLASS && lvalue->ts.kind != rvalue->ts.kind)
3527 gfc_error ("Different kind type parameters in pointer "
3528 "assignment at %L", &lvalue->where);
3532 if (lvalue->rank != rvalue->rank && !rank_remap)
3534 gfc_error ("Different ranks in pointer assignment at %L", &lvalue->where);
3538 if (lvalue->ts.type == BT_CLASS && rvalue->ts.type == BT_DERIVED)
3539 /* Make sure the vtab is present. */
3540 gfc_find_derived_vtab (rvalue->ts.u.derived);
3542 /* Check rank remapping. */
3547 /* If this can be determined, check that the target must be at least as
3548 large as the pointer assigned to it is. */
3549 if (gfc_array_size (lvalue, &lsize) == SUCCESS
3550 && gfc_array_size (rvalue, &rsize) == SUCCESS
3551 && mpz_cmp (rsize, lsize) < 0)
3553 gfc_error ("Rank remapping target is smaller than size of the"
3554 " pointer (%ld < %ld) at %L",
3555 mpz_get_si (rsize), mpz_get_si (lsize),
3560 /* The target must be either rank one or it must be simply contiguous
3561 and F2008 must be allowed. */
3562 if (rvalue->rank != 1)
3564 if (!gfc_is_simply_contiguous (rvalue, true))
3566 gfc_error ("Rank remapping target must be rank 1 or"
3567 " simply contiguous at %L", &rvalue->where);
3570 if (gfc_notify_std (GFC_STD_F2008, "Fortran 2008: Rank remapping"
3571 " target is not rank 1 at %L", &rvalue->where)
3577 /* Now punt if we are dealing with a NULLIFY(X) or X = NULL(X). */
3578 if (rvalue->expr_type == EXPR_NULL)
3581 if (lvalue->ts.type == BT_CHARACTER)
3583 gfc_try t = gfc_check_same_strlen (lvalue, rvalue, "pointer assignment");
3588 if (rvalue->expr_type == EXPR_VARIABLE && is_subref_array (rvalue))
3589 lvalue->symtree->n.sym->attr.subref_array_pointer = 1;
3591 attr = gfc_expr_attr (rvalue);
3593 if (rvalue->expr_type == EXPR_FUNCTION && !attr.pointer)
3595 gfc_error ("Target expression in pointer assignment "
3596 "at %L must deliver a pointer result",
3601 if (!attr.target && !attr.pointer)
3603 gfc_error ("Pointer assignment target is neither TARGET "
3604 "nor POINTER at %L", &rvalue->where);
3608 if (is_pure && gfc_impure_variable (rvalue->symtree->n.sym))
3610 gfc_error ("Bad target in pointer assignment in PURE "
3611 "procedure at %L", &rvalue->where);
3614 if (is_implicit_pure && gfc_impure_variable (rvalue->symtree->n.sym))
3615 gfc_current_ns->proc_name->attr.implicit_pure = 0;
3618 if (gfc_has_vector_index (rvalue))
3620 gfc_error ("Pointer assignment with vector subscript "
3621 "on rhs at %L", &rvalue->where);
3625 if (attr.is_protected && attr.use_assoc
3626 && !(attr.pointer || attr.proc_pointer))
3628 gfc_error ("Pointer assignment target has PROTECTED "
3629 "attribute at %L", &rvalue->where);
3633 /* F2008, C725. For PURE also C1283. */
3634 if (rvalue->expr_type == EXPR_VARIABLE
3635 && gfc_is_coindexed (rvalue))
3638 for (ref = rvalue->ref; ref; ref = ref->next)
3639 if (ref->type == REF_ARRAY && ref->u.ar.codimen)
3641 gfc_error ("Data target at %L shall not have a coindex",
3651 /* Relative of gfc_check_assign() except that the lvalue is a single
3652 symbol. Used for initialization assignments. */
3655 gfc_check_assign_symbol (gfc_symbol *sym, gfc_expr *rvalue)
3660 memset (&lvalue, '\0', sizeof (gfc_expr));
3662 lvalue.expr_type = EXPR_VARIABLE;
3663 lvalue.ts = sym->ts;
3665 lvalue.rank = sym->as->rank;
3666 lvalue.symtree = XCNEW (gfc_symtree);
3667 lvalue.symtree->n.sym = sym;
3668 lvalue.where = sym->declared_at;
3670 if (sym->attr.pointer || sym->attr.proc_pointer
3671 || (sym->ts.type == BT_CLASS && CLASS_DATA (sym)->attr.class_pointer
3672 && rvalue->expr_type == EXPR_NULL))
3673 r = gfc_check_pointer_assign (&lvalue, rvalue);
3675 r = gfc_check_assign (&lvalue, rvalue, 1);
3677 free (lvalue.symtree);
3682 if (sym->attr.pointer && rvalue->expr_type != EXPR_NULL)
3684 /* F08:C461. Additional checks for pointer initialization. */
3685 symbol_attribute attr;
3686 attr = gfc_expr_attr (rvalue);
3687 if (attr.allocatable)
3689 gfc_error ("Pointer initialization target at %C "
3690 "must not be ALLOCATABLE ");
3693 if (!attr.target || attr.pointer)
3695 gfc_error ("Pointer initialization target at %C "
3696 "must have the TARGET attribute");
3701 gfc_error ("Pointer initialization target at %C "
3702 "must have the SAVE attribute");
3707 if (sym->attr.proc_pointer && rvalue->expr_type != EXPR_NULL)
3709 /* F08:C1220. Additional checks for procedure pointer initialization. */
3710 symbol_attribute attr = gfc_expr_attr (rvalue);
3711 if (attr.proc_pointer)
3713 gfc_error ("Procedure pointer initialization target at %L "
3714 "may not be a procedure pointer", &rvalue->where);
3723 /* Check for default initializer; sym->value is not enough
3724 as it is also set for EXPR_NULL of allocatables. */
3727 gfc_has_default_initializer (gfc_symbol *der)
3731 gcc_assert (der->attr.flavor == FL_DERIVED);
3732 for (c = der->components; c; c = c->next)
3733 if (c->ts.type == BT_DERIVED)
3735 if (!c->attr.pointer
3736 && gfc_has_default_initializer (c->ts.u.derived))
3748 /* Get an expression for a default initializer. */
3751 gfc_default_initializer (gfc_typespec *ts)
3754 gfc_component *comp;
3756 /* See if we have a default initializer in this, but not in nested
3757 types (otherwise we could use gfc_has_default_initializer()). */
3758 for (comp = ts->u.derived->components; comp; comp = comp->next)
3759 if (comp->initializer || comp->attr.allocatable
3760 || (comp->ts.type == BT_CLASS && CLASS_DATA (comp)->attr.allocatable))
3766 init = gfc_get_structure_constructor_expr (ts->type, ts->kind,
3767 &ts->u.derived->declared_at);
3770 for (comp = ts->u.derived->components; comp; comp = comp->next)
3772 gfc_constructor *ctor = gfc_constructor_get();
3774 if (comp->initializer)
3775 ctor->expr = gfc_copy_expr (comp->initializer);
3777 if (comp->attr.allocatable
3778 || (comp->ts.type == BT_CLASS && CLASS_DATA (comp)->attr.allocatable))
3780 ctor->expr = gfc_get_expr ();
3781 ctor->expr->expr_type = EXPR_NULL;
3782 ctor->expr->ts = comp->ts;
3785 gfc_constructor_append (&init->value.constructor, ctor);
3792 /* Given a symbol, create an expression node with that symbol as a
3793 variable. If the symbol is array valued, setup a reference of the
3797 gfc_get_variable_expr (gfc_symtree *var)
3801 e = gfc_get_expr ();
3802 e->expr_type = EXPR_VARIABLE;
3804 e->ts = var->n.sym->ts;
3806 if (var->n.sym->as != NULL)
3808 e->rank = var->n.sym->as->rank;
3809 e->ref = gfc_get_ref ();
3810 e->ref->type = REF_ARRAY;
3811 e->ref->u.ar.type = AR_FULL;
3819 gfc_lval_expr_from_sym (gfc_symbol *sym)
3822 lval = gfc_get_expr ();
3823 lval->expr_type = EXPR_VARIABLE;
3824 lval->where = sym->declared_at;
3826 lval->symtree = gfc_find_symtree (sym->ns->sym_root, sym->name);
3828 /* It will always be a full array. */
3829 lval->rank = sym->as ? sym->as->rank : 0;
3832 lval->ref = gfc_get_ref ();
3833 lval->ref->type = REF_ARRAY;
3834 lval->ref->u.ar.type = AR_FULL;
3835 lval->ref->u.ar.dimen = lval->rank;
3836 lval->ref->u.ar.where = sym->declared_at;
3837 lval->ref->u.ar.as = sym->as;
3844 /* Returns the array_spec of a full array expression. A NULL is
3845 returned otherwise. */
3847 gfc_get_full_arrayspec_from_expr (gfc_expr *expr)
3852 if (expr->rank == 0)
3855 /* Follow any component references. */
3856 if (expr->expr_type == EXPR_VARIABLE
3857 || expr->expr_type == EXPR_CONSTANT)
3859 as = expr->symtree->n.sym->as;
3860 for (ref = expr->ref; ref; ref = ref->next)
3865 as = ref->u.c.component->as;
3873 switch (ref->u.ar.type)
3896 /* General expression traversal function. */
3899 gfc_traverse_expr (gfc_expr *expr, gfc_symbol *sym,
3900 bool (*func)(gfc_expr *, gfc_symbol *, int*),
3905 gfc_actual_arglist *args;
3912 if ((*func) (expr, sym, &f))
3915 if (expr->ts.type == BT_CHARACTER
3917 && expr->ts.u.cl->length
3918 && expr->ts.u.cl->length->expr_type != EXPR_CONSTANT
3919 && gfc_traverse_expr (expr->ts.u.cl->length, sym, func, f))
3922 switch (expr->expr_type)
3927 for (args = expr->value.function.actual; args; args = args->next)
3929 if (gfc_traverse_expr (args->expr, sym, func, f))
3937 case EXPR_SUBSTRING:
3940 case EXPR_STRUCTURE:
3942 for (c = gfc_constructor_first (expr->value.constructor);
3943 c; c = gfc_constructor_next (c))
3945 if (gfc_traverse_expr (c->expr, sym, func, f))
3949 if (gfc_traverse_expr (c->iterator->var, sym, func, f))
3951 if (gfc_traverse_expr (c->iterator->start, sym, func, f))
3953 if (gfc_traverse_expr (c->iterator->end, sym, func, f))
3955 if (gfc_traverse_expr (c->iterator->step, sym, func, f))
3962 if (gfc_traverse_expr (expr->value.op.op1, sym, func, f))
3964 if (gfc_traverse_expr (expr->value.op.op2, sym, func, f))
3980 for (i = 0; i < GFC_MAX_DIMENSIONS; i++)
3982 if (gfc_traverse_expr (ar.start[i], sym, func, f))
3984 if (gfc_traverse_expr (ar.end[i], sym, func, f))
3986 if (gfc_traverse_expr (ar.stride[i], sym, func, f))
3992 if (gfc_traverse_expr (ref->u.ss.start, sym, func, f))
3994 if (gfc_traverse_expr (ref->u.ss.end, sym, func, f))
3999 if (ref->u.c.component->ts.type == BT_CHARACTER
4000 && ref->u.c.component->ts.u.cl
4001 && ref->u.c.component->ts.u.cl->length
4002 && ref->u.c.component->ts.u.cl->length->expr_type
4004 && gfc_traverse_expr (ref->u.c.component->ts.u.cl->length,
4008 if (ref->u.c.component->as)
4009 for (i = 0; i < ref->u.c.component->as->rank
4010 + ref->u.c.component->as->corank; i++)
4012 if (gfc_traverse_expr (ref->u.c.component->as->lower[i],
4015 if (gfc_traverse_expr (ref->u.c.component->as->upper[i],
4029 /* Traverse expr, marking all EXPR_VARIABLE symbols referenced. */
4032 expr_set_symbols_referenced (gfc_expr *expr,
4033 gfc_symbol *sym ATTRIBUTE_UNUSED,
4034 int *f ATTRIBUTE_UNUSED)
4036 if (expr->expr_type != EXPR_VARIABLE)
4038 gfc_set_sym_referenced (expr->symtree->n.sym);
4043 gfc_expr_set_symbols_referenced (gfc_expr *expr)
4045 gfc_traverse_expr (expr, NULL, expr_set_symbols_referenced, 0);
4049 /* Determine if an expression is a procedure pointer component. If yes, the
4050 argument 'comp' will point to the component (provided that 'comp' was
4054 gfc_is_proc_ptr_comp (gfc_expr *expr, gfc_component **comp)
4059 if (!expr || !expr->ref)
4066 if (ref->type == REF_COMPONENT)
4068 ppc = ref->u.c.component->attr.proc_pointer;
4070 *comp = ref->u.c.component;
4077 /* Walk an expression tree and check each variable encountered for being typed.
4078 If strict is not set, a top-level variable is tolerated untyped in -std=gnu
4079 mode as is a basic arithmetic expression using those; this is for things in
4082 INTEGER :: arr(n), n
4083 INTEGER :: arr(n + 1), n
4085 The namespace is needed for IMPLICIT typing. */
4087 static gfc_namespace* check_typed_ns;
4090 expr_check_typed_help (gfc_expr* e, gfc_symbol* sym ATTRIBUTE_UNUSED,
4091 int* f ATTRIBUTE_UNUSED)
4095 if (e->expr_type != EXPR_VARIABLE)
4098 gcc_assert (e->symtree);
4099 t = gfc_check_symbol_typed (e->symtree->n.sym, check_typed_ns,
4102 return (t == FAILURE);
4106 gfc_expr_check_typed (gfc_expr* e, gfc_namespace* ns, bool strict)
4110 /* If this is a top-level variable or EXPR_OP, do the check with strict given
4114 if (e->expr_type == EXPR_VARIABLE && !e->ref)
4115 return gfc_check_symbol_typed (e->symtree->n.sym, ns, strict, e->where);
4117 if (e->expr_type == EXPR_OP)
4119 gfc_try t = SUCCESS;
4121 gcc_assert (e->value.op.op1);
4122 t = gfc_expr_check_typed (e->value.op.op1, ns, strict);
4124 if (t == SUCCESS && e->value.op.op2)
4125 t = gfc_expr_check_typed (e->value.op.op2, ns, strict);
4131 /* Otherwise, walk the expression and do it strictly. */
4132 check_typed_ns = ns;
4133 error_found = gfc_traverse_expr (e, NULL, &expr_check_typed_help, 0);
4135 return error_found ? FAILURE : SUCCESS;
4139 /* Walk an expression tree and replace all dummy symbols by the corresponding
4140 symbol in the formal_ns of "sym". Needed for copying interfaces in PROCEDURE
4141 statements. The boolean return value is required by gfc_traverse_expr. */
4144 replace_symbol (gfc_expr *expr, gfc_symbol *sym, int *i ATTRIBUTE_UNUSED)
4146 if ((expr->expr_type == EXPR_VARIABLE
4147 || (expr->expr_type == EXPR_FUNCTION
4148 && !gfc_is_intrinsic (expr->symtree->n.sym, 0, expr->where)))
4149 && expr->symtree->n.sym->ns == sym->ts.interface->formal_ns
4150 && expr->symtree->n.sym->attr.dummy)
4152 gfc_symtree *root = sym->formal_ns ? sym->formal_ns->sym_root
4153 : gfc_current_ns->sym_root;
4154 gfc_symtree *stree = gfc_find_symtree (root, expr->symtree->n.sym->name);
4156 stree->n.sym->attr = expr->symtree->n.sym->attr;
4157 expr->symtree = stree;
4163 gfc_expr_replace_symbols (gfc_expr *expr, gfc_symbol *dest)
4165 gfc_traverse_expr (expr, dest, &replace_symbol, 0);
4169 /* The following is analogous to 'replace_symbol', and needed for copying
4170 interfaces for procedure pointer components. The argument 'sym' must formally
4171 be a gfc_symbol, so that the function can be passed to gfc_traverse_expr.
4172 However, it gets actually passed a gfc_component (i.e. the procedure pointer
4173 component in whose formal_ns the arguments have to be). */
4176 replace_comp (gfc_expr *expr, gfc_symbol *sym, int *i ATTRIBUTE_UNUSED)
4178 gfc_component *comp;
4179 comp = (gfc_component *)sym;
4180 if ((expr->expr_type == EXPR_VARIABLE
4181 || (expr->expr_type == EXPR_FUNCTION
4182 && !gfc_is_intrinsic (expr->symtree->n.sym, 0, expr->where)))
4183 && expr->symtree->n.sym->ns == comp->ts.interface->formal_ns)
4186 gfc_namespace *ns = comp->formal_ns;
4187 /* Don't use gfc_get_symtree as we prefer to fail badly if we don't find
4188 the symtree rather than create a new one (and probably fail later). */
4189 stree = gfc_find_symtree (ns ? ns->sym_root : gfc_current_ns->sym_root,
4190 expr->symtree->n.sym->name);
4192 stree->n.sym->attr = expr->symtree->n.sym->attr;
4193 expr->symtree = stree;
4199 gfc_expr_replace_comp (gfc_expr *expr, gfc_component *dest)
4201 gfc_traverse_expr (expr, (gfc_symbol *)dest, &replace_comp, 0);
4206 gfc_ref_this_image (gfc_ref *ref)
4210 gcc_assert (ref->type == REF_ARRAY && ref->u.ar.codimen > 0);
4212 for (n = ref->u.ar.dimen; n < ref->u.ar.dimen + ref->u.ar.codimen; n++)
4213 if (ref->u.ar.dimen_type[n] != DIMEN_THIS_IMAGE)
4221 gfc_is_coindexed (gfc_expr *e)
4225 for (ref = e->ref; ref; ref = ref->next)
4226 if (ref->type == REF_ARRAY && ref->u.ar.codimen > 0)
4227 return !gfc_ref_this_image (ref);
4233 /* Coarrays are variables with a corank but not being coindexed. However, also
4234 the following is a coarray: A subobject of a coarray is a coarray if it does
4235 not have any cosubscripts, vector subscripts, allocatable component
4236 selection, or pointer component selection. (F2008, 2.4.7) */
4239 gfc_is_coarray (gfc_expr *e)
4243 gfc_component *comp;
4248 if (e->expr_type != EXPR_VARIABLE)
4252 sym = e->symtree->n.sym;
4254 if (sym->ts.type == BT_CLASS && sym->attr.class_ok)
4255 coarray = CLASS_DATA (sym)->attr.codimension;
4257 coarray = sym->attr.codimension;
4259 for (ref = e->ref; ref; ref = ref->next)
4263 comp = ref->u.c.component;
4264 if (comp->attr.pointer || comp->attr.allocatable)
4267 if (comp->ts.type == BT_CLASS && comp->attr.class_ok)
4268 coarray = CLASS_DATA (comp)->attr.codimension;
4270 coarray = comp->attr.codimension;
4278 if (ref->u.ar.codimen > 0 && !gfc_ref_this_image (ref))
4284 for (i = 0; i < ref->u.ar.dimen; i++)
4285 if (ref->u.ar.dimen_type[i] == DIMEN_VECTOR)
4296 return coarray && !coindexed;
4301 gfc_get_corank (gfc_expr *e)
4306 if (!gfc_is_coarray (e))
4309 corank = e->symtree->n.sym->as ? e->symtree->n.sym->as->corank : 0;
4311 for (ref = e->ref; ref; ref = ref->next)
4313 if (ref->type == REF_ARRAY)
4314 corank = ref->u.ar.as->corank;
4315 gcc_assert (ref->type != REF_SUBSTRING);
4322 /* Check whether the expression has an ultimate allocatable component.
4323 Being itself allocatable does not count. */
4325 gfc_has_ultimate_allocatable (gfc_expr *e)
4327 gfc_ref *ref, *last = NULL;
4329 if (e->expr_type != EXPR_VARIABLE)
4332 for (ref = e->ref; ref; ref = ref->next)
4333 if (ref->type == REF_COMPONENT)
4336 if (last && last->u.c.component->ts.type == BT_CLASS)
4337 return CLASS_DATA (last->u.c.component)->attr.alloc_comp;
4338 else if (last && last->u.c.component->ts.type == BT_DERIVED)
4339 return last->u.c.component->ts.u.derived->attr.alloc_comp;
4343 if (e->ts.type == BT_CLASS)
4344 return CLASS_DATA (e)->attr.alloc_comp;
4345 else if (e->ts.type == BT_DERIVED)
4346 return e->ts.u.derived->attr.alloc_comp;
4352 /* Check whether the expression has an pointer component.
4353 Being itself a pointer does not count. */
4355 gfc_has_ultimate_pointer (gfc_expr *e)
4357 gfc_ref *ref, *last = NULL;
4359 if (e->expr_type != EXPR_VARIABLE)
4362 for (ref = e->ref; ref; ref = ref->next)
4363 if (ref->type == REF_COMPONENT)
4366 if (last && last->u.c.component->ts.type == BT_CLASS)
4367 return CLASS_DATA (last->u.c.component)->attr.pointer_comp;
4368 else if (last && last->u.c.component->ts.type == BT_DERIVED)
4369 return last->u.c.component->ts.u.derived->attr.pointer_comp;
4373 if (e->ts.type == BT_CLASS)
4374 return CLASS_DATA (e)->attr.pointer_comp;
4375 else if (e->ts.type == BT_DERIVED)
4376 return e->ts.u.derived->attr.pointer_comp;
4382 /* Check whether an expression is "simply contiguous", cf. F2008, 6.5.4.
4383 Note: A scalar is not regarded as "simply contiguous" by the standard.
4384 if bool is not strict, some futher checks are done - for instance,
4385 a "(::1)" is accepted. */
4388 gfc_is_simply_contiguous (gfc_expr *expr, bool strict)
4392 gfc_array_ref *ar = NULL;
4393 gfc_ref *ref, *part_ref = NULL;
4395 if (expr->expr_type == EXPR_FUNCTION)
4396 return expr->value.function.esym
4397 ? expr->value.function.esym->result->attr.contiguous : false;
4398 else if (expr->expr_type != EXPR_VARIABLE)
4401 if (expr->rank == 0)
4404 for (ref = expr->ref; ref; ref = ref->next)
4407 return false; /* Array shall be last part-ref. */
4409 if (ref->type == REF_COMPONENT)
4411 else if (ref->type == REF_SUBSTRING)
4413 else if (ref->u.ar.type != AR_ELEMENT)
4417 if ((part_ref && !part_ref->u.c.component->attr.contiguous
4418 && part_ref->u.c.component->attr.pointer)
4419 || (!part_ref && !expr->symtree->n.sym->attr.contiguous
4420 && (expr->symtree->n.sym->attr.pointer
4421 || expr->symtree->n.sym->as->type == AS_ASSUMED_SHAPE)))
4424 if (!ar || ar->type == AR_FULL)
4427 gcc_assert (ar->type == AR_SECTION);
4429 /* Check for simply contiguous array */
4431 for (i = 0; i < ar->dimen; i++)
4433 if (ar->dimen_type[i] == DIMEN_VECTOR)
4436 if (ar->dimen_type[i] == DIMEN_ELEMENT)
4442 gcc_assert (ar->dimen_type[i] == DIMEN_RANGE);
4445 /* If the previous section was not contiguous, that's an error,
4446 unless we have effective only one element and checking is not
4448 if (!colon && (strict || !ar->start[i] || !ar->end[i]
4449 || ar->start[i]->expr_type != EXPR_CONSTANT
4450 || ar->end[i]->expr_type != EXPR_CONSTANT
4451 || mpz_cmp (ar->start[i]->value.integer,
4452 ar->end[i]->value.integer) != 0))
4455 /* Following the standard, "(::1)" or - if known at compile time -
4456 "(lbound:ubound)" are not simply contigous; if strict
4457 is false, they are regarded as simply contiguous. */
4458 if (ar->stride[i] && (strict || ar->stride[i]->expr_type != EXPR_CONSTANT
4459 || ar->stride[i]->ts.type != BT_INTEGER
4460 || mpz_cmp_si (ar->stride[i]->value.integer, 1) != 0))
4464 && (strict || ar->start[i]->expr_type != EXPR_CONSTANT
4465 || !ar->as->lower[i]
4466 || ar->as->lower[i]->expr_type != EXPR_CONSTANT
4467 || mpz_cmp (ar->start[i]->value.integer,
4468 ar->as->lower[i]->value.integer) != 0))
4472 && (strict || ar->end[i]->expr_type != EXPR_CONSTANT
4473 || !ar->as->upper[i]
4474 || ar->as->upper[i]->expr_type != EXPR_CONSTANT
4475 || mpz_cmp (ar->end[i]->value.integer,
4476 ar->as->upper[i]->value.integer) != 0))
4484 /* Build call to an intrinsic procedure. The number of arguments has to be
4485 passed (rather than ending the list with a NULL value) because we may
4486 want to add arguments but with a NULL-expression. */
4489 gfc_build_intrinsic_call (const char* name, locus where, unsigned numarg, ...)
4492 gfc_actual_arglist* atail;
4493 gfc_intrinsic_sym* isym;
4497 isym = gfc_find_function (name);
4500 result = gfc_get_expr ();
4501 result->expr_type = EXPR_FUNCTION;
4502 result->ts = isym->ts;
4503 result->where = where;
4504 result->value.function.name = name;
4505 result->value.function.isym = isym;
4507 va_start (ap, numarg);
4509 for (i = 0; i < numarg; ++i)
4513 atail->next = gfc_get_actual_arglist ();
4514 atail = atail->next;
4517 atail = result->value.function.actual = gfc_get_actual_arglist ();
4519 atail->expr = va_arg (ap, gfc_expr*);
4527 /* Check if an expression may appear in a variable definition context
4528 (F2008, 16.6.7) or pointer association context (F2008, 16.6.8).
4529 This is called from the various places when resolving
4530 the pieces that make up such a context.
4532 Optionally, a possible error message can be suppressed if context is NULL
4533 and just the return status (SUCCESS / FAILURE) be requested. */
4536 gfc_check_vardef_context (gfc_expr* e, bool pointer, bool alloc_obj,
4537 const char* context)
4539 gfc_symbol* sym = NULL;
4541 bool check_intentin;
4543 symbol_attribute attr;
4546 if (e->expr_type == EXPR_VARIABLE)
4548 gcc_assert (e->symtree);
4549 sym = e->symtree->n.sym;
4551 else if (e->expr_type == EXPR_FUNCTION)
4553 gcc_assert (e->symtree);
4554 sym = e->value.function.esym ? e->value.function.esym : e->symtree->n.sym;
4557 attr = gfc_expr_attr (e);
4558 if (!pointer && e->expr_type == EXPR_FUNCTION && attr.pointer)
4560 if (!(gfc_option.allow_std & GFC_STD_F2008))
4563 gfc_error ("Fortran 2008: Pointer functions in variable definition"
4564 " context (%s) at %L", context, &e->where);
4568 else if (e->expr_type != EXPR_VARIABLE)
4571 gfc_error ("Non-variable expression in variable definition context (%s)"
4572 " at %L", context, &e->where);
4576 if (!pointer && sym->attr.flavor == FL_PARAMETER)
4579 gfc_error ("Named constant '%s' in variable definition context (%s)"
4580 " at %L", sym->name, context, &e->where);
4583 if (!pointer && sym->attr.flavor != FL_VARIABLE
4584 && !(sym->attr.flavor == FL_PROCEDURE && sym == sym->result)
4585 && !(sym->attr.flavor == FL_PROCEDURE && sym->attr.proc_pointer))
4588 gfc_error ("'%s' in variable definition context (%s) at %L is not"
4589 " a variable", sym->name, context, &e->where);
4593 /* Find out whether the expr is a pointer; this also means following
4594 component references to the last one. */
4595 is_pointer = (attr.pointer || attr.proc_pointer);
4596 if (pointer && !is_pointer)
4599 gfc_error ("Non-POINTER in pointer association context (%s)"
4600 " at %L", context, &e->where);
4607 || (e->ts.type == BT_DERIVED
4608 && e->ts.u.derived->from_intmod == INTMOD_ISO_FORTRAN_ENV
4609 && e->ts.u.derived->intmod_sym_id == ISOFORTRAN_LOCK_TYPE)))
4612 gfc_error ("LOCK_TYPE in variable definition context (%s) at %L",
4613 context, &e->where);
4617 /* INTENT(IN) dummy argument. Check this, unless the object itself is
4618 the component of sub-component of a pointer. Obviously,
4619 procedure pointers are of no interest here. */
4620 check_intentin = true;
4621 ptr_component = sym->attr.pointer;
4622 for (ref = e->ref; ref && check_intentin; ref = ref->next)
4624 if (ptr_component && ref->type == REF_COMPONENT)
4625 check_intentin = false;
4626 if (ref->type == REF_COMPONENT && ref->u.c.component->attr.pointer)
4627 ptr_component = true;
4629 if (check_intentin && sym->attr.intent == INTENT_IN)
4631 if (pointer && is_pointer)
4634 gfc_error ("Dummy argument '%s' with INTENT(IN) in pointer"
4635 " association context (%s) at %L",
4636 sym->name, context, &e->where);
4639 if (!pointer && !is_pointer && !sym->attr.pointer)
4642 gfc_error ("Dummy argument '%s' with INTENT(IN) in variable"
4643 " definition context (%s) at %L",
4644 sym->name, context, &e->where);
4649 /* PROTECTED and use-associated. */
4650 if (sym->attr.is_protected && sym->attr.use_assoc && check_intentin)
4652 if (pointer && is_pointer)
4655 gfc_error ("Variable '%s' is PROTECTED and can not appear in a"
4656 " pointer association context (%s) at %L",
4657 sym->name, context, &e->where);
4660 if (!pointer && !is_pointer)
4663 gfc_error ("Variable '%s' is PROTECTED and can not appear in a"
4664 " variable definition context (%s) at %L",
4665 sym->name, context, &e->where);
4670 /* Variable not assignable from a PURE procedure but appears in
4671 variable definition context. */
4672 if (!pointer && gfc_pure (NULL) && gfc_impure_variable (sym))
4675 gfc_error ("Variable '%s' can not appear in a variable definition"
4676 " context (%s) at %L in PURE procedure",
4677 sym->name, context, &e->where);
4681 if (!pointer && gfc_implicit_pure (NULL) && gfc_impure_variable (sym))
4682 gfc_current_ns->proc_name->attr.implicit_pure = 0;
4684 /* Check variable definition context for associate-names. */
4685 if (!pointer && sym->assoc)
4688 gfc_association_list* assoc;
4690 gcc_assert (sym->assoc->target);
4692 /* If this is a SELECT TYPE temporary (the association is used internally
4693 for SELECT TYPE), silently go over to the target. */
4694 if (sym->attr.select_type_temporary)
4696 gfc_expr* t = sym->assoc->target;
4698 gcc_assert (t->expr_type == EXPR_VARIABLE);
4699 name = t->symtree->name;
4701 if (t->symtree->n.sym->assoc)
4702 assoc = t->symtree->n.sym->assoc;
4711 gcc_assert (name && assoc);
4713 /* Is association to a valid variable? */
4714 if (!assoc->variable)
4718 if (assoc->target->expr_type == EXPR_VARIABLE)
4719 gfc_error ("'%s' at %L associated to vector-indexed target can"
4720 " not be used in a variable definition context (%s)",
4721 name, &e->where, context);
4723 gfc_error ("'%s' at %L associated to expression can"
4724 " not be used in a variable definition context (%s)",
4725 name, &e->where, context);
4730 /* Target must be allowed to appear in a variable definition context. */
4731 if (gfc_check_vardef_context (assoc->target, pointer, false, NULL)
4735 gfc_error ("Associate-name '%s' can not appear in a variable"
4736 " definition context (%s) at %L because its target"
4737 " at %L can not, either",
4738 name, context, &e->where,
4739 &assoc->target->where);