1 /* Routines for manipulation of expression nodes.
2 Copyright (C) 2000-2015 Free Software Foundation, Inc.
3 Contributed by Andy Vaught
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
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 "
153 e
->expr_type
= EXPR_CONSTANT
;
161 mpz_init (e
->value
.integer
);
165 gfc_set_model_kind (kind
);
166 mpfr_init (e
->value
.real
);
170 gfc_set_model_kind (kind
);
171 mpc_init2 (e
->value
.complex, mpfr_get_default_prec());
182 /* Get a new expression node that is an string constant.
183 If no string is passed, a string of len is allocated,
184 blanked and null-terminated. */
187 gfc_get_character_expr (int kind
, locus
*where
, const char *src
, int len
)
194 dest
= gfc_get_wide_string (len
+ 1);
195 gfc_wide_memset (dest
, ' ', len
);
199 dest
= gfc_char_to_widechar (src
);
201 e
= gfc_get_constant_expr (BT_CHARACTER
, kind
,
202 where
? where
: &gfc_current_locus
);
203 e
->value
.character
.string
= dest
;
204 e
->value
.character
.length
= len
;
210 /* Get a new expression node that is an integer constant. */
213 gfc_get_int_expr (int kind
, locus
*where
, int value
)
216 p
= gfc_get_constant_expr (BT_INTEGER
, kind
,
217 where
? where
: &gfc_current_locus
);
219 mpz_set_si (p
->value
.integer
, value
);
225 /* Get a new expression node that is a logical constant. */
228 gfc_get_logical_expr (int kind
, locus
*where
, bool value
)
231 p
= gfc_get_constant_expr (BT_LOGICAL
, kind
,
232 where
? where
: &gfc_current_locus
);
234 p
->value
.logical
= value
;
241 gfc_get_iokind_expr (locus
*where
, io_kind k
)
245 /* Set the types to something compatible with iokind. This is needed to
246 get through gfc_free_expr later since iokind really has no Basic Type,
250 e
->expr_type
= EXPR_CONSTANT
;
251 e
->ts
.type
= BT_LOGICAL
;
259 /* Given an expression pointer, return a copy of the expression. This
260 subroutine is recursive. */
263 gfc_copy_expr (gfc_expr
*p
)
275 switch (q
->expr_type
)
278 s
= gfc_get_wide_string (p
->value
.character
.length
+ 1);
279 q
->value
.character
.string
= s
;
280 memcpy (s
, p
->value
.character
.string
,
281 (p
->value
.character
.length
+ 1) * sizeof (gfc_char_t
));
285 /* Copy target representation, if it exists. */
286 if (p
->representation
.string
)
288 c
= XCNEWVEC (char, p
->representation
.length
+ 1);
289 q
->representation
.string
= c
;
290 memcpy (c
, p
->representation
.string
, (p
->representation
.length
+ 1));
293 /* Copy the values of any pointer components of p->value. */
297 mpz_init_set (q
->value
.integer
, p
->value
.integer
);
301 gfc_set_model_kind (q
->ts
.kind
);
302 mpfr_init (q
->value
.real
);
303 mpfr_set (q
->value
.real
, p
->value
.real
, GFC_RND_MODE
);
307 gfc_set_model_kind (q
->ts
.kind
);
308 mpc_init2 (q
->value
.complex, mpfr_get_default_prec());
309 mpc_set (q
->value
.complex, p
->value
.complex, GFC_MPC_RND_MODE
);
313 if (p
->representation
.string
)
314 q
->value
.character
.string
315 = gfc_char_to_widechar (q
->representation
.string
);
318 s
= gfc_get_wide_string (p
->value
.character
.length
+ 1);
319 q
->value
.character
.string
= s
;
321 /* This is the case for the C_NULL_CHAR named constant. */
322 if (p
->value
.character
.length
== 0
323 && (p
->ts
.is_c_interop
|| p
->ts
.is_iso_c
))
326 /* Need to set the length to 1 to make sure the NUL
327 terminator is copied. */
328 q
->value
.character
.length
= 1;
331 memcpy (s
, p
->value
.character
.string
,
332 (p
->value
.character
.length
+ 1) * sizeof (gfc_char_t
));
341 break; /* Already done. */
345 /* Should never be reached. */
347 gfc_internal_error ("gfc_copy_expr(): Bad expr node");
354 switch (q
->value
.op
.op
)
357 case INTRINSIC_PARENTHESES
:
358 case INTRINSIC_UPLUS
:
359 case INTRINSIC_UMINUS
:
360 q
->value
.op
.op1
= gfc_copy_expr (p
->value
.op
.op1
);
363 default: /* Binary operators. */
364 q
->value
.op
.op1
= gfc_copy_expr (p
->value
.op
.op1
);
365 q
->value
.op
.op2
= gfc_copy_expr (p
->value
.op
.op2
);
372 q
->value
.function
.actual
=
373 gfc_copy_actual_arglist (p
->value
.function
.actual
);
378 q
->value
.compcall
.actual
=
379 gfc_copy_actual_arglist (p
->value
.compcall
.actual
);
380 q
->value
.compcall
.tbp
= p
->value
.compcall
.tbp
;
385 q
->value
.constructor
= gfc_constructor_copy (p
->value
.constructor
);
393 q
->shape
= gfc_copy_shape (p
->shape
, p
->rank
);
395 q
->ref
= gfc_copy_ref (p
->ref
);
402 gfc_clear_shape (mpz_t
*shape
, int rank
)
406 for (i
= 0; i
< rank
; i
++)
407 mpz_clear (shape
[i
]);
412 gfc_free_shape (mpz_t
**shape
, int rank
)
417 gfc_clear_shape (*shape
, rank
);
423 /* Workhorse function for gfc_free_expr() that frees everything
424 beneath an expression node, but not the node itself. This is
425 useful when we want to simplify a node and replace it with
426 something else or the expression node belongs to another structure. */
429 free_expr0 (gfc_expr
*e
)
431 switch (e
->expr_type
)
434 /* Free any parts of the value that need freeing. */
438 mpz_clear (e
->value
.integer
);
442 mpfr_clear (e
->value
.real
);
446 free (e
->value
.character
.string
);
450 mpc_clear (e
->value
.complex);
457 /* Free the representation. */
458 free (e
->representation
.string
);
463 if (e
->value
.op
.op1
!= NULL
)
464 gfc_free_expr (e
->value
.op
.op1
);
465 if (e
->value
.op
.op2
!= NULL
)
466 gfc_free_expr (e
->value
.op
.op2
);
470 gfc_free_actual_arglist (e
->value
.function
.actual
);
475 gfc_free_actual_arglist (e
->value
.compcall
.actual
);
483 gfc_constructor_free (e
->value
.constructor
);
487 free (e
->value
.character
.string
);
494 gfc_internal_error ("free_expr0(): Bad expr type");
497 /* Free a shape array. */
498 gfc_free_shape (&e
->shape
, e
->rank
);
500 gfc_free_ref_list (e
->ref
);
502 memset (e
, '\0', sizeof (gfc_expr
));
506 /* Free an expression node and everything beneath it. */
509 gfc_free_expr (gfc_expr
*e
)
518 /* Free an argument list and everything below it. */
521 gfc_free_actual_arglist (gfc_actual_arglist
*a1
)
523 gfc_actual_arglist
*a2
;
528 gfc_free_expr (a1
->expr
);
535 /* Copy an arglist structure and all of the arguments. */
538 gfc_copy_actual_arglist (gfc_actual_arglist
*p
)
540 gfc_actual_arglist
*head
, *tail
, *new_arg
;
544 for (; p
; p
= p
->next
)
546 new_arg
= gfc_get_actual_arglist ();
549 new_arg
->expr
= gfc_copy_expr (p
->expr
);
550 new_arg
->next
= NULL
;
555 tail
->next
= new_arg
;
564 /* Free a list of reference structures. */
567 gfc_free_ref_list (gfc_ref
*p
)
579 for (i
= 0; i
< GFC_MAX_DIMENSIONS
; i
++)
581 gfc_free_expr (p
->u
.ar
.start
[i
]);
582 gfc_free_expr (p
->u
.ar
.end
[i
]);
583 gfc_free_expr (p
->u
.ar
.stride
[i
]);
589 gfc_free_expr (p
->u
.ss
.start
);
590 gfc_free_expr (p
->u
.ss
.end
);
602 /* Graft the *src expression onto the *dest subexpression. */
605 gfc_replace_expr (gfc_expr
*dest
, gfc_expr
*src
)
613 /* Try to extract an integer constant from the passed expression node.
614 Returns an error message or NULL if the result is set. It is
615 tempting to generate an error and return true or false, but
616 failure is OK for some callers. */
619 gfc_extract_int (gfc_expr
*expr
, int *result
)
621 if (expr
->expr_type
!= EXPR_CONSTANT
)
622 return _("Constant expression required at %C");
624 if (expr
->ts
.type
!= BT_INTEGER
)
625 return _("Integer expression required at %C");
627 if ((mpz_cmp_si (expr
->value
.integer
, INT_MAX
) > 0)
628 || (mpz_cmp_si (expr
->value
.integer
, INT_MIN
) < 0))
630 return _("Integer value too large in expression at %C");
633 *result
= (int) mpz_get_si (expr
->value
.integer
);
639 /* Recursively copy a list of reference structures. */
642 gfc_copy_ref (gfc_ref
*src
)
650 dest
= gfc_get_ref ();
651 dest
->type
= src
->type
;
656 ar
= gfc_copy_array_ref (&src
->u
.ar
);
662 dest
->u
.c
= src
->u
.c
;
666 dest
->u
.ss
= src
->u
.ss
;
667 dest
->u
.ss
.start
= gfc_copy_expr (src
->u
.ss
.start
);
668 dest
->u
.ss
.end
= gfc_copy_expr (src
->u
.ss
.end
);
672 dest
->next
= gfc_copy_ref (src
->next
);
678 /* Detect whether an expression has any vector index array references. */
681 gfc_has_vector_index (gfc_expr
*e
)
685 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
686 if (ref
->type
== REF_ARRAY
)
687 for (i
= 0; i
< ref
->u
.ar
.dimen
; i
++)
688 if (ref
->u
.ar
.dimen_type
[i
] == DIMEN_VECTOR
)
694 /* Copy a shape array. */
697 gfc_copy_shape (mpz_t
*shape
, int rank
)
705 new_shape
= gfc_get_shape (rank
);
707 for (n
= 0; n
< rank
; n
++)
708 mpz_init_set (new_shape
[n
], shape
[n
]);
714 /* Copy a shape array excluding dimension N, where N is an integer
715 constant expression. Dimensions are numbered in Fortran style --
718 So, if the original shape array contains R elements
719 { s1 ... sN-1 sN sN+1 ... sR-1 sR}
720 the result contains R-1 elements:
721 { s1 ... sN-1 sN+1 ... sR-1}
723 If anything goes wrong -- N is not a constant, its value is out
724 of range -- or anything else, just returns NULL. */
727 gfc_copy_shape_excluding (mpz_t
*shape
, int rank
, gfc_expr
*dim
)
729 mpz_t
*new_shape
, *s
;
735 || dim
->expr_type
!= EXPR_CONSTANT
736 || dim
->ts
.type
!= BT_INTEGER
)
739 n
= mpz_get_si (dim
->value
.integer
);
740 n
--; /* Convert to zero based index. */
741 if (n
< 0 || n
>= rank
)
744 s
= new_shape
= gfc_get_shape (rank
- 1);
746 for (i
= 0; i
< rank
; i
++)
750 mpz_init_set (*s
, shape
[i
]);
758 /* Return the maximum kind of two expressions. In general, higher
759 kind numbers mean more precision for numeric types. */
762 gfc_kind_max (gfc_expr
*e1
, gfc_expr
*e2
)
764 return (e1
->ts
.kind
> e2
->ts
.kind
) ? e1
->ts
.kind
: e2
->ts
.kind
;
768 /* Returns nonzero if the type is numeric, zero otherwise. */
771 numeric_type (bt type
)
773 return type
== BT_COMPLEX
|| type
== BT_REAL
|| type
== BT_INTEGER
;
777 /* Returns nonzero if the typespec is a numeric type, zero otherwise. */
780 gfc_numeric_ts (gfc_typespec
*ts
)
782 return numeric_type (ts
->type
);
786 /* Return an expression node with an optional argument list attached.
787 A variable number of gfc_expr pointers are strung together in an
788 argument list with a NULL pointer terminating the list. */
791 gfc_build_conversion (gfc_expr
*e
)
796 p
->expr_type
= EXPR_FUNCTION
;
798 p
->value
.function
.actual
= NULL
;
800 p
->value
.function
.actual
= gfc_get_actual_arglist ();
801 p
->value
.function
.actual
->expr
= e
;
807 /* Given an expression node with some sort of numeric binary
808 expression, insert type conversions required to make the operands
809 have the same type. Conversion warnings are disabled if wconversion
812 The exception is that the operands of an exponential don't have to
813 have the same type. If possible, the base is promoted to the type
814 of the exponent. For example, 1**2.3 becomes 1.0**2.3, but
815 1.0**2 stays as it is. */
818 gfc_type_convert_binary (gfc_expr
*e
, int wconversion
)
822 op1
= e
->value
.op
.op1
;
823 op2
= e
->value
.op
.op2
;
825 if (op1
->ts
.type
== BT_UNKNOWN
|| op2
->ts
.type
== BT_UNKNOWN
)
827 gfc_clear_ts (&e
->ts
);
831 /* Kind conversions of same type. */
832 if (op1
->ts
.type
== op2
->ts
.type
)
834 if (op1
->ts
.kind
== op2
->ts
.kind
)
836 /* No type conversions. */
841 if (op1
->ts
.kind
> op2
->ts
.kind
)
842 gfc_convert_type_warn (op2
, &op1
->ts
, 2, wconversion
);
844 gfc_convert_type_warn (op1
, &op2
->ts
, 2, wconversion
);
850 /* Integer combined with real or complex. */
851 if (op2
->ts
.type
== BT_INTEGER
)
855 /* Special case for ** operator. */
856 if (e
->value
.op
.op
== INTRINSIC_POWER
)
859 gfc_convert_type_warn (e
->value
.op
.op2
, &e
->ts
, 2, wconversion
);
863 if (op1
->ts
.type
== BT_INTEGER
)
866 gfc_convert_type_warn (e
->value
.op
.op1
, &e
->ts
, 2, wconversion
);
870 /* Real combined with complex. */
871 e
->ts
.type
= BT_COMPLEX
;
872 if (op1
->ts
.kind
> op2
->ts
.kind
)
873 e
->ts
.kind
= op1
->ts
.kind
;
875 e
->ts
.kind
= op2
->ts
.kind
;
876 if (op1
->ts
.type
!= BT_COMPLEX
|| op1
->ts
.kind
!= e
->ts
.kind
)
877 gfc_convert_type_warn (e
->value
.op
.op1
, &e
->ts
, 2, wconversion
);
878 if (op2
->ts
.type
!= BT_COMPLEX
|| op2
->ts
.kind
!= e
->ts
.kind
)
879 gfc_convert_type_warn (e
->value
.op
.op2
, &e
->ts
, 2, wconversion
);
886 /* Function to determine if an expression is constant or not. This
887 function expects that the expression has already been simplified. */
890 gfc_is_constant_expr (gfc_expr
*e
)
893 gfc_actual_arglist
*arg
;
899 switch (e
->expr_type
)
902 return (gfc_is_constant_expr (e
->value
.op
.op1
)
903 && (e
->value
.op
.op2
== NULL
904 || gfc_is_constant_expr (e
->value
.op
.op2
)));
912 gcc_assert (e
->symtree
|| e
->value
.function
.esym
913 || e
->value
.function
.isym
);
915 /* Call to intrinsic with at least one argument. */
916 if (e
->value
.function
.isym
&& e
->value
.function
.actual
)
918 for (arg
= e
->value
.function
.actual
; arg
; arg
= arg
->next
)
919 if (!gfc_is_constant_expr (arg
->expr
))
923 /* Specification functions are constant. */
924 /* F95, 7.1.6.2; F2003, 7.1.7 */
927 sym
= e
->symtree
->n
.sym
;
928 if (e
->value
.function
.esym
)
929 sym
= e
->value
.function
.esym
;
932 && sym
->attr
.function
934 && !sym
->attr
.intrinsic
935 && !sym
->attr
.recursive
936 && sym
->attr
.proc
!= PROC_INTERNAL
937 && sym
->attr
.proc
!= PROC_ST_FUNCTION
938 && sym
->attr
.proc
!= PROC_UNKNOWN
939 && gfc_sym_get_dummy_args (sym
) == NULL
)
942 if (e
->value
.function
.isym
943 && (e
->value
.function
.isym
->elemental
944 || e
->value
.function
.isym
->pure
945 || e
->value
.function
.isym
->inquiry
946 || e
->value
.function
.isym
->transformational
))
956 return e
->ref
== NULL
|| (gfc_is_constant_expr (e
->ref
->u
.ss
.start
)
957 && gfc_is_constant_expr (e
->ref
->u
.ss
.end
));
961 c
= gfc_constructor_first (e
->value
.constructor
);
962 if ((e
->expr_type
== EXPR_ARRAY
) && c
&& c
->iterator
)
963 return gfc_constant_ac (e
);
965 for (; c
; c
= gfc_constructor_next (c
))
966 if (!gfc_is_constant_expr (c
->expr
))
973 gfc_internal_error ("gfc_is_constant_expr(): Unknown expression type");
979 /* Is true if an array reference is followed by a component or substring
982 is_subref_array (gfc_expr
* e
)
987 if (e
->expr_type
!= EXPR_VARIABLE
)
990 if (e
->symtree
->n
.sym
->attr
.subref_array_pointer
)
994 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
996 if (ref
->type
== REF_ARRAY
997 && ref
->u
.ar
.type
!= AR_ELEMENT
)
1001 && ref
->type
!= REF_ARRAY
)
1008 /* Try to collapse intrinsic expressions. */
1011 simplify_intrinsic_op (gfc_expr
*p
, int type
)
1013 gfc_intrinsic_op op
;
1014 gfc_expr
*op1
, *op2
, *result
;
1016 if (p
->value
.op
.op
== INTRINSIC_USER
)
1019 op1
= p
->value
.op
.op1
;
1020 op2
= p
->value
.op
.op2
;
1021 op
= p
->value
.op
.op
;
1023 if (!gfc_simplify_expr (op1
, type
))
1025 if (!gfc_simplify_expr (op2
, type
))
1028 if (!gfc_is_constant_expr (op1
)
1029 || (op2
!= NULL
&& !gfc_is_constant_expr (op2
)))
1033 p
->value
.op
.op1
= NULL
;
1034 p
->value
.op
.op2
= NULL
;
1038 case INTRINSIC_PARENTHESES
:
1039 result
= gfc_parentheses (op1
);
1042 case INTRINSIC_UPLUS
:
1043 result
= gfc_uplus (op1
);
1046 case INTRINSIC_UMINUS
:
1047 result
= gfc_uminus (op1
);
1050 case INTRINSIC_PLUS
:
1051 result
= gfc_add (op1
, op2
);
1054 case INTRINSIC_MINUS
:
1055 result
= gfc_subtract (op1
, op2
);
1058 case INTRINSIC_TIMES
:
1059 result
= gfc_multiply (op1
, op2
);
1062 case INTRINSIC_DIVIDE
:
1063 result
= gfc_divide (op1
, op2
);
1066 case INTRINSIC_POWER
:
1067 result
= gfc_power (op1
, op2
);
1070 case INTRINSIC_CONCAT
:
1071 result
= gfc_concat (op1
, op2
);
1075 case INTRINSIC_EQ_OS
:
1076 result
= gfc_eq (op1
, op2
, op
);
1080 case INTRINSIC_NE_OS
:
1081 result
= gfc_ne (op1
, op2
, op
);
1085 case INTRINSIC_GT_OS
:
1086 result
= gfc_gt (op1
, op2
, op
);
1090 case INTRINSIC_GE_OS
:
1091 result
= gfc_ge (op1
, op2
, op
);
1095 case INTRINSIC_LT_OS
:
1096 result
= gfc_lt (op1
, op2
, op
);
1100 case INTRINSIC_LE_OS
:
1101 result
= gfc_le (op1
, op2
, op
);
1105 result
= gfc_not (op1
);
1109 result
= gfc_and (op1
, op2
);
1113 result
= gfc_or (op1
, op2
);
1117 result
= gfc_eqv (op1
, op2
);
1120 case INTRINSIC_NEQV
:
1121 result
= gfc_neqv (op1
, op2
);
1125 gfc_internal_error ("simplify_intrinsic_op(): Bad operator");
1130 gfc_free_expr (op1
);
1131 gfc_free_expr (op2
);
1135 result
->rank
= p
->rank
;
1136 result
->where
= p
->where
;
1137 gfc_replace_expr (p
, result
);
1143 /* Subroutine to simplify constructor expressions. Mutually recursive
1144 with gfc_simplify_expr(). */
1147 simplify_constructor (gfc_constructor_base base
, int type
)
1152 for (c
= gfc_constructor_first (base
); c
; c
= gfc_constructor_next (c
))
1155 && (!gfc_simplify_expr(c
->iterator
->start
, type
)
1156 || !gfc_simplify_expr (c
->iterator
->end
, type
)
1157 || !gfc_simplify_expr (c
->iterator
->step
, type
)))
1162 /* Try and simplify a copy. Replace the original if successful
1163 but keep going through the constructor at all costs. Not
1164 doing so can make a dog's dinner of complicated things. */
1165 p
= gfc_copy_expr (c
->expr
);
1167 if (!gfc_simplify_expr (p
, type
))
1173 gfc_replace_expr (c
->expr
, p
);
1181 /* Pull a single array element out of an array constructor. */
1184 find_array_element (gfc_constructor_base base
, gfc_array_ref
*ar
,
1185 gfc_constructor
**rval
)
1187 unsigned long nelemen
;
1193 gfc_constructor
*cons
;
1200 mpz_init_set_ui (offset
, 0);
1203 mpz_init_set_ui (span
, 1);
1204 for (i
= 0; i
< ar
->dimen
; i
++)
1206 if (!gfc_reduce_init_expr (ar
->as
->lower
[i
])
1207 || !gfc_reduce_init_expr (ar
->as
->upper
[i
]))
1215 if (e
->expr_type
!= EXPR_CONSTANT
)
1221 gcc_assert (ar
->as
->upper
[i
]->expr_type
== EXPR_CONSTANT
1222 && ar
->as
->lower
[i
]->expr_type
== EXPR_CONSTANT
);
1224 /* Check the bounds. */
1225 if ((ar
->as
->upper
[i
]
1226 && mpz_cmp (e
->value
.integer
,
1227 ar
->as
->upper
[i
]->value
.integer
) > 0)
1228 || (mpz_cmp (e
->value
.integer
,
1229 ar
->as
->lower
[i
]->value
.integer
) < 0))
1231 gfc_error ("Index in dimension %d is out of bounds "
1232 "at %L", i
+ 1, &ar
->c_where
[i
]);
1238 mpz_sub (delta
, e
->value
.integer
, ar
->as
->lower
[i
]->value
.integer
);
1239 mpz_mul (delta
, delta
, span
);
1240 mpz_add (offset
, offset
, delta
);
1242 mpz_set_ui (tmp
, 1);
1243 mpz_add (tmp
, tmp
, ar
->as
->upper
[i
]->value
.integer
);
1244 mpz_sub (tmp
, tmp
, ar
->as
->lower
[i
]->value
.integer
);
1245 mpz_mul (span
, span
, tmp
);
1248 for (cons
= gfc_constructor_first (base
), nelemen
= mpz_get_ui (offset
);
1249 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
*pick
= ref
->u
.c
.component
;
1274 gfc_constructor
*c
= gfc_constructor_first (base
);
1276 gfc_symbol
*dt
= ref
->u
.c
.sym
;
1277 int ext
= dt
->attr
.extension
;
1279 /* For extended types, check if the desired component is in one of the
1281 while (ext
> 0 && gfc_find_component (dt
->components
->ts
.u
.derived
,
1282 pick
->name
, true, true))
1284 dt
= dt
->components
->ts
.u
.derived
;
1285 c
= gfc_constructor_first (c
->expr
->value
.constructor
);
1289 gfc_component
*comp
= dt
->components
;
1290 while (comp
!= pick
)
1293 c
= gfc_constructor_next (c
);
1300 /* Replace an expression with the contents of a constructor, removing
1301 the subobject reference in the process. */
1304 remove_subobject_ref (gfc_expr
*p
, gfc_constructor
*cons
)
1314 e
= gfc_copy_expr (p
);
1315 e
->ref
= p
->ref
->next
;
1316 p
->ref
->next
= NULL
;
1317 gfc_replace_expr (p
, e
);
1321 /* Pull an array section out of an array constructor. */
1324 find_array_section (gfc_expr
*expr
, gfc_ref
*ref
)
1331 long unsigned one
= 1;
1333 mpz_t start
[GFC_MAX_DIMENSIONS
];
1334 mpz_t end
[GFC_MAX_DIMENSIONS
];
1335 mpz_t stride
[GFC_MAX_DIMENSIONS
];
1336 mpz_t delta
[GFC_MAX_DIMENSIONS
];
1337 mpz_t ctr
[GFC_MAX_DIMENSIONS
];
1342 gfc_constructor_base base
;
1343 gfc_constructor
*cons
, *vecsub
[GFC_MAX_DIMENSIONS
];
1353 base
= expr
->value
.constructor
;
1354 expr
->value
.constructor
= NULL
;
1356 rank
= ref
->u
.ar
.as
->rank
;
1358 if (expr
->shape
== NULL
)
1359 expr
->shape
= gfc_get_shape (rank
);
1361 mpz_init_set_ui (delta_mpz
, one
);
1362 mpz_init_set_ui (nelts
, one
);
1365 /* Do the initialization now, so that we can cleanup without
1366 keeping track of where we were. */
1367 for (d
= 0; d
< rank
; d
++)
1369 mpz_init (delta
[d
]);
1370 mpz_init (start
[d
]);
1373 mpz_init (stride
[d
]);
1377 /* Build the counters to clock through the array reference. */
1379 for (d
= 0; d
< rank
; d
++)
1381 /* Make this stretch of code easier on the eye! */
1382 begin
= ref
->u
.ar
.start
[d
];
1383 finish
= ref
->u
.ar
.end
[d
];
1384 step
= ref
->u
.ar
.stride
[d
];
1385 lower
= ref
->u
.ar
.as
->lower
[d
];
1386 upper
= ref
->u
.ar
.as
->upper
[d
];
1388 if (ref
->u
.ar
.dimen_type
[d
] == DIMEN_VECTOR
) /* Vector subscript. */
1390 gfc_constructor
*ci
;
1393 if (begin
->expr_type
!= EXPR_ARRAY
|| !gfc_is_constant_expr (begin
))
1399 gcc_assert (begin
->rank
== 1);
1400 /* Zero-sized arrays have no shape and no elements, stop early. */
1403 mpz_init_set_ui (nelts
, 0);
1407 vecsub
[d
] = gfc_constructor_first (begin
->value
.constructor
);
1408 mpz_set (ctr
[d
], vecsub
[d
]->expr
->value
.integer
);
1409 mpz_mul (nelts
, nelts
, begin
->shape
[0]);
1410 mpz_set (expr
->shape
[shape_i
++], begin
->shape
[0]);
1413 for (ci
= vecsub
[d
]; ci
; ci
= gfc_constructor_next (ci
))
1415 if (mpz_cmp (ci
->expr
->value
.integer
, upper
->value
.integer
) > 0
1416 || mpz_cmp (ci
->expr
->value
.integer
,
1417 lower
->value
.integer
) < 0)
1419 gfc_error ("index in dimension %d is out of bounds "
1420 "at %L", d
+ 1, &ref
->u
.ar
.c_where
[d
]);
1428 if ((begin
&& begin
->expr_type
!= EXPR_CONSTANT
)
1429 || (finish
&& finish
->expr_type
!= EXPR_CONSTANT
)
1430 || (step
&& step
->expr_type
!= EXPR_CONSTANT
))
1436 /* Obtain the stride. */
1438 mpz_set (stride
[d
], step
->value
.integer
);
1440 mpz_set_ui (stride
[d
], one
);
1442 if (mpz_cmp_ui (stride
[d
], 0) == 0)
1443 mpz_set_ui (stride
[d
], one
);
1445 /* Obtain the start value for the index. */
1447 mpz_set (start
[d
], begin
->value
.integer
);
1449 mpz_set (start
[d
], lower
->value
.integer
);
1451 mpz_set (ctr
[d
], start
[d
]);
1453 /* Obtain the end value for the index. */
1455 mpz_set (end
[d
], finish
->value
.integer
);
1457 mpz_set (end
[d
], upper
->value
.integer
);
1459 /* Separate 'if' because elements sometimes arrive with
1461 if (ref
->u
.ar
.dimen_type
[d
] == DIMEN_ELEMENT
)
1462 mpz_set (end
[d
], begin
->value
.integer
);
1464 /* Check the bounds. */
1465 if (mpz_cmp (ctr
[d
], upper
->value
.integer
) > 0
1466 || mpz_cmp (end
[d
], upper
->value
.integer
) > 0
1467 || mpz_cmp (ctr
[d
], lower
->value
.integer
) < 0
1468 || mpz_cmp (end
[d
], lower
->value
.integer
) < 0)
1470 gfc_error ("index in dimension %d is out of bounds "
1471 "at %L", d
+ 1, &ref
->u
.ar
.c_where
[d
]);
1476 /* Calculate the number of elements and the shape. */
1477 mpz_set (tmp_mpz
, stride
[d
]);
1478 mpz_add (tmp_mpz
, end
[d
], tmp_mpz
);
1479 mpz_sub (tmp_mpz
, tmp_mpz
, ctr
[d
]);
1480 mpz_div (tmp_mpz
, tmp_mpz
, stride
[d
]);
1481 mpz_mul (nelts
, nelts
, tmp_mpz
);
1483 /* An element reference reduces the rank of the expression; don't
1484 add anything to the shape array. */
1485 if (ref
->u
.ar
.dimen_type
[d
] != DIMEN_ELEMENT
)
1486 mpz_set (expr
->shape
[shape_i
++], tmp_mpz
);
1489 /* Calculate the 'stride' (=delta) for conversion of the
1490 counter values into the index along the constructor. */
1491 mpz_set (delta
[d
], delta_mpz
);
1492 mpz_sub (tmp_mpz
, upper
->value
.integer
, lower
->value
.integer
);
1493 mpz_add_ui (tmp_mpz
, tmp_mpz
, one
);
1494 mpz_mul (delta_mpz
, delta_mpz
, tmp_mpz
);
1498 cons
= gfc_constructor_first (base
);
1500 /* Now clock through the array reference, calculating the index in
1501 the source constructor and transferring the elements to the new
1503 for (idx
= 0; idx
< (int) mpz_get_si (nelts
); idx
++)
1505 mpz_init_set_ui (ptr
, 0);
1508 for (d
= 0; d
< rank
; d
++)
1510 mpz_set (tmp_mpz
, ctr
[d
]);
1511 mpz_sub (tmp_mpz
, tmp_mpz
, ref
->u
.ar
.as
->lower
[d
]->value
.integer
);
1512 mpz_mul (tmp_mpz
, tmp_mpz
, delta
[d
]);
1513 mpz_add (ptr
, ptr
, tmp_mpz
);
1515 if (!incr_ctr
) continue;
1517 if (ref
->u
.ar
.dimen_type
[d
] == DIMEN_VECTOR
) /* Vector subscript. */
1519 gcc_assert(vecsub
[d
]);
1521 if (!gfc_constructor_next (vecsub
[d
]))
1522 vecsub
[d
] = gfc_constructor_first (ref
->u
.ar
.start
[d
]->value
.constructor
);
1525 vecsub
[d
] = gfc_constructor_next (vecsub
[d
]);
1528 mpz_set (ctr
[d
], vecsub
[d
]->expr
->value
.integer
);
1532 mpz_add (ctr
[d
], ctr
[d
], stride
[d
]);
1534 if (mpz_cmp_ui (stride
[d
], 0) > 0
1535 ? mpz_cmp (ctr
[d
], end
[d
]) > 0
1536 : mpz_cmp (ctr
[d
], end
[d
]) < 0)
1537 mpz_set (ctr
[d
], start
[d
]);
1543 limit
= mpz_get_ui (ptr
);
1544 if (limit
>= flag_max_array_constructor
)
1546 gfc_error ("The number of elements in the array constructor "
1547 "at %L requires an increase of the allowed %d "
1548 "upper limit. See -fmax-array-constructor "
1549 "option", &expr
->where
, flag_max_array_constructor
);
1553 cons
= gfc_constructor_lookup (base
, limit
);
1555 gfc_constructor_append_expr (&expr
->value
.constructor
,
1556 gfc_copy_expr (cons
->expr
), NULL
);
1563 mpz_clear (delta_mpz
);
1564 mpz_clear (tmp_mpz
);
1566 for (d
= 0; d
< rank
; d
++)
1568 mpz_clear (delta
[d
]);
1569 mpz_clear (start
[d
]);
1572 mpz_clear (stride
[d
]);
1574 gfc_constructor_free (base
);
1578 /* Pull a substring out of an expression. */
1581 find_substring_ref (gfc_expr
*p
, gfc_expr
**newp
)
1588 if (p
->ref
->u
.ss
.start
->expr_type
!= EXPR_CONSTANT
1589 || p
->ref
->u
.ss
.end
->expr_type
!= EXPR_CONSTANT
)
1592 *newp
= gfc_copy_expr (p
);
1593 free ((*newp
)->value
.character
.string
);
1595 end
= (int) mpz_get_ui (p
->ref
->u
.ss
.end
->value
.integer
);
1596 start
= (int) mpz_get_ui (p
->ref
->u
.ss
.start
->value
.integer
);
1597 length
= end
- start
+ 1;
1599 chr
= (*newp
)->value
.character
.string
= gfc_get_wide_string (length
+ 1);
1600 (*newp
)->value
.character
.length
= length
;
1601 memcpy (chr
, &p
->value
.character
.string
[start
- 1],
1602 length
* sizeof (gfc_char_t
));
1609 /* Simplify a subobject reference of a constructor. This occurs when
1610 parameter variable values are substituted. */
1613 simplify_const_ref (gfc_expr
*p
)
1615 gfc_constructor
*cons
, *c
;
1621 switch (p
->ref
->type
)
1624 switch (p
->ref
->u
.ar
.type
)
1627 /* <type/kind spec>, parameter :: x(<int>) = scalar_expr
1628 will generate this. */
1629 if (p
->expr_type
!= EXPR_ARRAY
)
1631 remove_subobject_ref (p
, NULL
);
1634 if (!find_array_element (p
->value
.constructor
, &p
->ref
->u
.ar
, &cons
))
1640 remove_subobject_ref (p
, cons
);
1644 if (!find_array_section (p
, p
->ref
))
1646 p
->ref
->u
.ar
.type
= AR_FULL
;
1651 if (p
->ref
->next
!= NULL
1652 && (p
->ts
.type
== BT_CHARACTER
|| p
->ts
.type
== BT_DERIVED
))
1654 for (c
= gfc_constructor_first (p
->value
.constructor
);
1655 c
; c
= gfc_constructor_next (c
))
1657 c
->expr
->ref
= gfc_copy_ref (p
->ref
->next
);
1658 if (!simplify_const_ref (c
->expr
))
1662 if (p
->ts
.type
== BT_DERIVED
1664 && (c
= gfc_constructor_first (p
->value
.constructor
)))
1666 /* There may have been component references. */
1667 p
->ts
= c
->expr
->ts
;
1671 for (; last_ref
->next
; last_ref
= last_ref
->next
) {};
1673 if (p
->ts
.type
== BT_CHARACTER
1674 && last_ref
->type
== REF_SUBSTRING
)
1676 /* If this is a CHARACTER array and we possibly took
1677 a substring out of it, update the type-spec's
1678 character length according to the first element
1679 (as all should have the same length). */
1681 if ((c
= gfc_constructor_first (p
->value
.constructor
)))
1683 const gfc_expr
* first
= c
->expr
;
1684 gcc_assert (first
->expr_type
== EXPR_CONSTANT
);
1685 gcc_assert (first
->ts
.type
== BT_CHARACTER
);
1686 string_len
= first
->value
.character
.length
;
1692 p
->ts
.u
.cl
= gfc_new_charlen (p
->symtree
->n
.sym
->ns
,
1695 gfc_free_expr (p
->ts
.u
.cl
->length
);
1698 = gfc_get_int_expr (gfc_default_integer_kind
,
1702 gfc_free_ref_list (p
->ref
);
1713 cons
= find_component_ref (p
->value
.constructor
, p
->ref
);
1714 remove_subobject_ref (p
, cons
);
1718 if (!find_substring_ref (p
, &newp
))
1721 gfc_replace_expr (p
, newp
);
1722 gfc_free_ref_list (p
->ref
);
1732 /* Simplify a chain of references. */
1735 simplify_ref_chain (gfc_ref
*ref
, int type
)
1739 for (; ref
; ref
= ref
->next
)
1744 for (n
= 0; n
< ref
->u
.ar
.dimen
; n
++)
1746 if (!gfc_simplify_expr (ref
->u
.ar
.start
[n
], type
))
1748 if (!gfc_simplify_expr (ref
->u
.ar
.end
[n
], type
))
1750 if (!gfc_simplify_expr (ref
->u
.ar
.stride
[n
], type
))
1756 if (!gfc_simplify_expr (ref
->u
.ss
.start
, type
))
1758 if (!gfc_simplify_expr (ref
->u
.ss
.end
, type
))
1770 /* Try to substitute the value of a parameter variable. */
1773 simplify_parameter_variable (gfc_expr
*p
, int type
)
1778 e
= gfc_copy_expr (p
->symtree
->n
.sym
->value
);
1784 /* Do not copy subobject refs for constant. */
1785 if (e
->expr_type
!= EXPR_CONSTANT
&& p
->ref
!= NULL
)
1786 e
->ref
= gfc_copy_ref (p
->ref
);
1787 t
= gfc_simplify_expr (e
, type
);
1789 /* Only use the simplification if it eliminated all subobject references. */
1791 gfc_replace_expr (p
, e
);
1798 /* Given an expression, simplify it by collapsing constant
1799 expressions. Most simplification takes place when the expression
1800 tree is being constructed. If an intrinsic function is simplified
1801 at some point, we get called again to collapse the result against
1804 We work by recursively simplifying expression nodes, simplifying
1805 intrinsic functions where possible, which can lead to further
1806 constant collapsing. If an operator has constant operand(s), we
1807 rip the expression apart, and rebuild it, hoping that it becomes
1810 The expression type is defined for:
1811 0 Basic expression parsing
1812 1 Simplifying array constructors -- will substitute
1814 Returns false on error, true otherwise.
1815 NOTE: Will return true even if the expression can not be simplified. */
1818 gfc_simplify_expr (gfc_expr
*p
, int type
)
1820 gfc_actual_arglist
*ap
;
1825 switch (p
->expr_type
)
1832 for (ap
= p
->value
.function
.actual
; ap
; ap
= ap
->next
)
1833 if (!gfc_simplify_expr (ap
->expr
, type
))
1836 if (p
->value
.function
.isym
!= NULL
1837 && gfc_intrinsic_func_interface (p
, 1) == MATCH_ERROR
)
1842 case EXPR_SUBSTRING
:
1843 if (!simplify_ref_chain (p
->ref
, type
))
1846 if (gfc_is_constant_expr (p
))
1852 if (p
->ref
&& p
->ref
->u
.ss
.start
)
1854 gfc_extract_int (p
->ref
->u
.ss
.start
, &start
);
1855 start
--; /* Convert from one-based to zero-based. */
1858 end
= p
->value
.character
.length
;
1859 if (p
->ref
&& p
->ref
->u
.ss
.end
)
1860 gfc_extract_int (p
->ref
->u
.ss
.end
, &end
);
1865 s
= gfc_get_wide_string (end
- start
+ 2);
1866 memcpy (s
, p
->value
.character
.string
+ start
,
1867 (end
- start
) * sizeof (gfc_char_t
));
1868 s
[end
- start
+ 1] = '\0'; /* TODO: C-style string. */
1869 free (p
->value
.character
.string
);
1870 p
->value
.character
.string
= s
;
1871 p
->value
.character
.length
= end
- start
;
1872 p
->ts
.u
.cl
= gfc_new_charlen (gfc_current_ns
, NULL
);
1873 p
->ts
.u
.cl
->length
= gfc_get_int_expr (gfc_default_integer_kind
,
1875 p
->value
.character
.length
);
1876 gfc_free_ref_list (p
->ref
);
1878 p
->expr_type
= EXPR_CONSTANT
;
1883 if (!simplify_intrinsic_op (p
, type
))
1888 /* Only substitute array parameter variables if we are in an
1889 initialization expression, or we want a subsection. */
1890 if (p
->symtree
->n
.sym
->attr
.flavor
== FL_PARAMETER
1891 && (gfc_init_expr_flag
|| p
->ref
1892 || p
->symtree
->n
.sym
->value
->expr_type
!= EXPR_ARRAY
))
1894 if (!simplify_parameter_variable (p
, type
))
1901 gfc_simplify_iterator_var (p
);
1904 /* Simplify subcomponent references. */
1905 if (!simplify_ref_chain (p
->ref
, type
))
1910 case EXPR_STRUCTURE
:
1912 if (!simplify_ref_chain (p
->ref
, type
))
1915 if (!simplify_constructor (p
->value
.constructor
, type
))
1918 if (p
->expr_type
== EXPR_ARRAY
&& p
->ref
&& p
->ref
->type
== REF_ARRAY
1919 && p
->ref
->u
.ar
.type
== AR_FULL
)
1920 gfc_expand_constructor (p
, false);
1922 if (!simplify_const_ref (p
))
1936 /* Returns the type of an expression with the exception that iterator
1937 variables are automatically integers no matter what else they may
1943 if (e
->expr_type
== EXPR_VARIABLE
&& gfc_check_iter_variable (e
))
1950 /* Scalarize an expression for an elemental intrinsic call. */
1953 scalarize_intrinsic_call (gfc_expr
*e
)
1955 gfc_actual_arglist
*a
, *b
;
1956 gfc_constructor_base ctor
;
1957 gfc_constructor
*args
[5];
1958 gfc_constructor
*ci
, *new_ctor
;
1959 gfc_expr
*expr
, *old
;
1960 int n
, i
, rank
[5], array_arg
;
1962 /* Find which, if any, arguments are arrays. Assume that the old
1963 expression carries the type information and that the first arg
1964 that is an array expression carries all the shape information.*/
1966 a
= e
->value
.function
.actual
;
1967 for (; a
; a
= a
->next
)
1970 if (!a
->expr
|| a
->expr
->expr_type
!= EXPR_ARRAY
)
1973 expr
= gfc_copy_expr (a
->expr
);
1980 old
= gfc_copy_expr (e
);
1982 gfc_constructor_free (expr
->value
.constructor
);
1983 expr
->value
.constructor
= NULL
;
1985 expr
->where
= old
->where
;
1986 expr
->expr_type
= EXPR_ARRAY
;
1988 /* Copy the array argument constructors into an array, with nulls
1991 a
= old
->value
.function
.actual
;
1992 for (; a
; a
= a
->next
)
1994 /* Check that this is OK for an initialization expression. */
1995 if (a
->expr
&& !gfc_check_init_expr (a
->expr
))
1999 if (a
->expr
&& a
->expr
->rank
&& a
->expr
->expr_type
== EXPR_VARIABLE
)
2001 rank
[n
] = a
->expr
->rank
;
2002 ctor
= a
->expr
->symtree
->n
.sym
->value
->value
.constructor
;
2003 args
[n
] = gfc_constructor_first (ctor
);
2005 else if (a
->expr
&& a
->expr
->expr_type
== EXPR_ARRAY
)
2008 rank
[n
] = a
->expr
->rank
;
2011 ctor
= gfc_constructor_copy (a
->expr
->value
.constructor
);
2012 args
[n
] = gfc_constructor_first (ctor
);
2021 /* Using the array argument as the master, step through the array
2022 calling the function for each element and advancing the array
2023 constructors together. */
2024 for (ci
= args
[array_arg
- 1]; ci
; ci
= gfc_constructor_next (ci
))
2026 new_ctor
= gfc_constructor_append_expr (&expr
->value
.constructor
,
2027 gfc_copy_expr (old
), NULL
);
2029 gfc_free_actual_arglist (new_ctor
->expr
->value
.function
.actual
);
2031 b
= old
->value
.function
.actual
;
2032 for (i
= 0; i
< n
; i
++)
2035 new_ctor
->expr
->value
.function
.actual
2036 = a
= gfc_get_actual_arglist ();
2039 a
->next
= gfc_get_actual_arglist ();
2044 a
->expr
= gfc_copy_expr (args
[i
]->expr
);
2046 a
->expr
= gfc_copy_expr (b
->expr
);
2051 /* Simplify the function calls. If the simplification fails, the
2052 error will be flagged up down-stream or the library will deal
2054 gfc_simplify_expr (new_ctor
->expr
, 0);
2056 for (i
= 0; i
< n
; i
++)
2058 args
[i
] = gfc_constructor_next (args
[i
]);
2060 for (i
= 1; i
< n
; i
++)
2061 if (rank
[i
] && ((args
[i
] != NULL
&& args
[array_arg
- 1] == NULL
)
2062 || (args
[i
] == NULL
&& args
[array_arg
- 1] != NULL
)))
2068 /* Free "expr" but not the pointers it contains. */
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
, bool (*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
))
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
))
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
))
2132 if (!numeric_type (et0 (op1
)) || !numeric_type (et0 (op2
)))
2137 case INTRINSIC_CONCAT
:
2138 if (!(*check_function
)(op2
))
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
))
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
&& ctor
->expr
2216 && ctor
->expr
->expr_type
!= EXPR_NULL
)
2218 gfc_error ("Invalid initialization expression for ALLOCATABLE "
2219 "component %qs 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 (!gfc_check_init_expr (ap
->expr
))
2240 static bool 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 if (e
->symtree
->n
.sym
->from_intmod
)
2280 if (e
->symtree
->n
.sym
->from_intmod
== INTMOD_ISO_FORTRAN_ENV
2281 && e
->symtree
->n
.sym
->intmod_sym_id
!= ISOFORTRAN_COMPILER_OPTIONS
2282 && e
->symtree
->n
.sym
->intmod_sym_id
!= ISOFORTRAN_COMPILER_VERSION
)
2285 if (e
->symtree
->n
.sym
->from_intmod
== INTMOD_ISO_C_BINDING
2286 && e
->symtree
->n
.sym
->intmod_sym_id
!= ISOCBINDING_C_SIZEOF
)
2291 name
= e
->symtree
->n
.sym
->name
;
2293 functions
= (gfc_option
.warn_std
& GFC_STD_F2003
)
2294 ? inquiry_func_f2003
: inquiry_func_f95
;
2296 for (i
= 0; functions
[i
]; i
++)
2297 if (strcmp (functions
[i
], name
) == 0)
2300 if (functions
[i
] == NULL
)
2304 /* At this point we have an inquiry function with a variable argument. The
2305 type of the variable might be undefined, but we need it now, because the
2306 arguments of these functions are not allowed to be undefined. */
2308 for (ap
= e
->value
.function
.actual
; ap
; ap
= ap
->next
)
2313 if (ap
->expr
->ts
.type
== BT_UNKNOWN
)
2315 if (ap
->expr
->symtree
->n
.sym
->ts
.type
== BT_UNKNOWN
2316 && !gfc_set_default_type (ap
->expr
->symtree
->n
.sym
, 0, gfc_current_ns
))
2319 ap
->expr
->ts
= ap
->expr
->symtree
->n
.sym
->ts
;
2322 /* Assumed character length will not reduce to a constant expression
2323 with LEN, as required by the standard. */
2324 if (i
== 5 && not_restricted
2325 && ap
->expr
->symtree
->n
.sym
->ts
.type
== BT_CHARACTER
2326 && (ap
->expr
->symtree
->n
.sym
->ts
.u
.cl
->length
== NULL
2327 || ap
->expr
->symtree
->n
.sym
->ts
.deferred
))
2329 gfc_error ("Assumed or deferred character length variable %qs "
2330 " in constant expression at %L",
2331 ap
->expr
->symtree
->n
.sym
->name
,
2335 else if (not_restricted
&& !gfc_check_init_expr (ap
->expr
))
2338 if (not_restricted
== 0
2339 && ap
->expr
->expr_type
!= EXPR_VARIABLE
2340 && !check_restricted (ap
->expr
))
2343 if (not_restricted
== 0
2344 && ap
->expr
->expr_type
== EXPR_VARIABLE
2345 && ap
->expr
->symtree
->n
.sym
->attr
.dummy
2346 && ap
->expr
->symtree
->n
.sym
->attr
.optional
)
2354 /* F95, 7.1.6.1, Initialization expressions, (5)
2355 F2003, 7.1.7 Initialization expression, (5) */
2358 check_transformational (gfc_expr
*e
)
2360 static const char * const trans_func_f95
[] = {
2361 "repeat", "reshape", "selected_int_kind",
2362 "selected_real_kind", "transfer", "trim", NULL
2365 static const char * const trans_func_f2003
[] = {
2366 "all", "any", "count", "dot_product", "matmul", "null", "pack",
2367 "product", "repeat", "reshape", "selected_char_kind", "selected_int_kind",
2368 "selected_real_kind", "spread", "sum", "transfer", "transpose",
2369 "trim", "unpack", NULL
2374 const char *const *functions
;
2376 if (!e
->value
.function
.isym
2377 || !e
->value
.function
.isym
->transformational
)
2380 name
= e
->symtree
->n
.sym
->name
;
2382 functions
= (gfc_option
.allow_std
& GFC_STD_F2003
)
2383 ? trans_func_f2003
: trans_func_f95
;
2385 /* NULL() is dealt with below. */
2386 if (strcmp ("null", name
) == 0)
2389 for (i
= 0; functions
[i
]; i
++)
2390 if (strcmp (functions
[i
], name
) == 0)
2393 if (functions
[i
] == NULL
)
2395 gfc_error ("transformational intrinsic %qs at %L is not permitted "
2396 "in an initialization expression", name
, &e
->where
);
2400 return check_init_expr_arguments (e
);
2404 /* F95, 7.1.6.1, Initialization expressions, (6)
2405 F2003, 7.1.7 Initialization expression, (6) */
2408 check_null (gfc_expr
*e
)
2410 if (strcmp ("null", e
->symtree
->n
.sym
->name
) != 0)
2413 return check_init_expr_arguments (e
);
2418 check_elemental (gfc_expr
*e
)
2420 if (!e
->value
.function
.isym
2421 || !e
->value
.function
.isym
->elemental
)
2424 if (e
->ts
.type
!= BT_INTEGER
2425 && e
->ts
.type
!= BT_CHARACTER
2426 && !gfc_notify_std (GFC_STD_F2003
, "Evaluation of nonstandard "
2427 "initialization expression at %L", &e
->where
))
2430 return check_init_expr_arguments (e
);
2435 check_conversion (gfc_expr
*e
)
2437 if (!e
->value
.function
.isym
2438 || !e
->value
.function
.isym
->conversion
)
2441 return check_init_expr_arguments (e
);
2445 /* Verify that an expression is an initialization expression. A side
2446 effect is that the expression tree is reduced to a single constant
2447 node if all goes well. This would normally happen when the
2448 expression is constructed but function references are assumed to be
2449 intrinsics in the context of initialization expressions. If
2450 false is returned an error message has been generated. */
2453 gfc_check_init_expr (gfc_expr
*e
)
2461 switch (e
->expr_type
)
2464 t
= check_intrinsic_op (e
, gfc_check_init_expr
);
2466 t
= gfc_simplify_expr (e
, 0);
2474 gfc_intrinsic_sym
* isym
;
2475 gfc_symbol
* sym
= e
->symtree
->n
.sym
;
2477 /* Simplify here the intrinsics from the IEEE_ARITHMETIC and
2478 IEEE_EXCEPTIONS modules. */
2479 int mod
= sym
->from_intmod
;
2480 if (mod
== INTMOD_NONE
&& sym
->generic
)
2481 mod
= sym
->generic
->sym
->from_intmod
;
2482 if (mod
== INTMOD_IEEE_ARITHMETIC
|| mod
== INTMOD_IEEE_EXCEPTIONS
)
2484 gfc_expr
*new_expr
= gfc_simplify_ieee_functions (e
);
2487 gfc_replace_expr (e
, new_expr
);
2493 if (!gfc_is_intrinsic (sym
, 0, e
->where
)
2494 || (m
= gfc_intrinsic_func_interface (e
, 0)) != MATCH_YES
)
2496 gfc_error ("Function %qs in initialization expression at %L "
2497 "must be an intrinsic function",
2498 e
->symtree
->n
.sym
->name
, &e
->where
);
2502 if ((m
= check_conversion (e
)) == MATCH_NO
2503 && (m
= check_inquiry (e
, 1)) == MATCH_NO
2504 && (m
= check_null (e
)) == MATCH_NO
2505 && (m
= check_transformational (e
)) == MATCH_NO
2506 && (m
= check_elemental (e
)) == MATCH_NO
)
2508 gfc_error ("Intrinsic function %qs at %L is not permitted "
2509 "in an initialization expression",
2510 e
->symtree
->n
.sym
->name
, &e
->where
);
2514 if (m
== MATCH_ERROR
)
2517 /* Try to scalarize an elemental intrinsic function that has an
2519 isym
= gfc_find_function (e
->symtree
->n
.sym
->name
);
2520 if (isym
&& isym
->elemental
2521 && (t
= scalarize_intrinsic_call(e
)))
2526 t
= gfc_simplify_expr (e
, 0);
2533 if (gfc_check_iter_variable (e
))
2536 if (e
->symtree
->n
.sym
->attr
.flavor
== FL_PARAMETER
)
2538 /* A PARAMETER shall not be used to define itself, i.e.
2539 REAL, PARAMETER :: x = transfer(0, x)
2541 if (!e
->symtree
->n
.sym
->value
)
2543 gfc_error ("PARAMETER %qs is used at %L before its definition "
2544 "is complete", e
->symtree
->n
.sym
->name
, &e
->where
);
2548 t
= simplify_parameter_variable (e
, 0);
2553 if (gfc_in_match_data ())
2558 if (e
->symtree
->n
.sym
->as
)
2560 switch (e
->symtree
->n
.sym
->as
->type
)
2562 case AS_ASSUMED_SIZE
:
2563 gfc_error ("Assumed size array %qs at %L is not permitted "
2564 "in an initialization expression",
2565 e
->symtree
->n
.sym
->name
, &e
->where
);
2568 case AS_ASSUMED_SHAPE
:
2569 gfc_error ("Assumed shape array %qs at %L is not permitted "
2570 "in an initialization expression",
2571 e
->symtree
->n
.sym
->name
, &e
->where
);
2575 gfc_error ("Deferred array %qs at %L is not permitted "
2576 "in an initialization expression",
2577 e
->symtree
->n
.sym
->name
, &e
->where
);
2581 gfc_error ("Array %qs at %L is a variable, which does "
2582 "not reduce to a constant expression",
2583 e
->symtree
->n
.sym
->name
, &e
->where
);
2591 gfc_error ("Parameter %qs at %L has not been declared or is "
2592 "a variable, which does not reduce to a constant "
2593 "expression", e
->symtree
->n
.sym
->name
, &e
->where
);
2602 case EXPR_SUBSTRING
:
2605 t
= gfc_check_init_expr (e
->ref
->u
.ss
.start
);
2609 t
= gfc_check_init_expr (e
->ref
->u
.ss
.end
);
2611 t
= gfc_simplify_expr (e
, 0);
2617 case EXPR_STRUCTURE
:
2618 t
= e
->ts
.is_iso_c
? true : false;
2622 t
= check_alloc_comp_init (e
);
2626 t
= gfc_check_constructor (e
, gfc_check_init_expr
);
2633 t
= gfc_check_constructor (e
, gfc_check_init_expr
);
2637 t
= gfc_expand_constructor (e
, true);
2641 t
= gfc_check_constructor_type (e
);
2645 gfc_internal_error ("check_init_expr(): Unknown expression type");
2651 /* Reduces a general expression to an initialization expression (a constant).
2652 This used to be part of gfc_match_init_expr.
2653 Note that this function doesn't free the given expression on false. */
2656 gfc_reduce_init_expr (gfc_expr
*expr
)
2660 gfc_init_expr_flag
= true;
2661 t
= gfc_resolve_expr (expr
);
2663 t
= gfc_check_init_expr (expr
);
2664 gfc_init_expr_flag
= false;
2669 if (expr
->expr_type
== EXPR_ARRAY
)
2671 if (!gfc_check_constructor_type (expr
))
2673 if (!gfc_expand_constructor (expr
, true))
2681 /* Match an initialization expression. We work by first matching an
2682 expression, then reducing it to a constant. */
2685 gfc_match_init_expr (gfc_expr
**result
)
2693 gfc_init_expr_flag
= true;
2695 m
= gfc_match_expr (&expr
);
2698 gfc_init_expr_flag
= false;
2702 t
= gfc_reduce_init_expr (expr
);
2705 gfc_free_expr (expr
);
2706 gfc_init_expr_flag
= false;
2711 gfc_init_expr_flag
= false;
2717 /* Given an actual argument list, test to see that each argument is a
2718 restricted expression and optionally if the expression type is
2719 integer or character. */
2722 restricted_args (gfc_actual_arglist
*a
)
2724 for (; a
; a
= a
->next
)
2726 if (!check_restricted (a
->expr
))
2734 /************* Restricted/specification expressions *************/
2737 /* Make sure a non-intrinsic function is a specification function. */
2740 external_spec_function (gfc_expr
*e
)
2744 f
= e
->value
.function
.esym
;
2746 /* IEEE functions allowed are "a reference to a transformational function
2747 from the intrinsic module IEEE_ARITHMETIC or IEEE_EXCEPTIONS", and
2748 "inquiry function from the intrinsic modules IEEE_ARITHMETIC and
2749 IEEE_EXCEPTIONS". */
2750 if (f
->from_intmod
== INTMOD_IEEE_ARITHMETIC
2751 || f
->from_intmod
== INTMOD_IEEE_EXCEPTIONS
)
2753 if (!strcmp (f
->name
, "ieee_selected_real_kind")
2754 || !strcmp (f
->name
, "ieee_support_rounding")
2755 || !strcmp (f
->name
, "ieee_support_flag")
2756 || !strcmp (f
->name
, "ieee_support_halting")
2757 || !strcmp (f
->name
, "ieee_support_datatype")
2758 || !strcmp (f
->name
, "ieee_support_denormal")
2759 || !strcmp (f
->name
, "ieee_support_divide")
2760 || !strcmp (f
->name
, "ieee_support_inf")
2761 || !strcmp (f
->name
, "ieee_support_io")
2762 || !strcmp (f
->name
, "ieee_support_nan")
2763 || !strcmp (f
->name
, "ieee_support_sqrt")
2764 || !strcmp (f
->name
, "ieee_support_standard")
2765 || !strcmp (f
->name
, "ieee_support_underflow_control"))
2766 goto function_allowed
;
2769 if (f
->attr
.proc
== PROC_ST_FUNCTION
)
2771 gfc_error ("Specification function %qs at %L cannot be a statement "
2772 "function", f
->name
, &e
->where
);
2776 if (f
->attr
.proc
== PROC_INTERNAL
)
2778 gfc_error ("Specification function %qs at %L cannot be an internal "
2779 "function", f
->name
, &e
->where
);
2783 if (!f
->attr
.pure
&& !f
->attr
.elemental
)
2785 gfc_error ("Specification function %qs at %L must be PURE", f
->name
,
2790 if (f
->attr
.recursive
)
2792 gfc_error ("Specification function %qs at %L cannot be RECURSIVE",
2793 f
->name
, &e
->where
);
2798 return restricted_args (e
->value
.function
.actual
);
2802 /* Check to see that a function reference to an intrinsic is a
2803 restricted expression. */
2806 restricted_intrinsic (gfc_expr
*e
)
2808 /* TODO: Check constraints on inquiry functions. 7.1.6.2 (7). */
2809 if (check_inquiry (e
, 0) == MATCH_YES
)
2812 return restricted_args (e
->value
.function
.actual
);
2816 /* Check the expressions of an actual arglist. Used by check_restricted. */
2819 check_arglist (gfc_actual_arglist
* arg
, bool (*checker
) (gfc_expr
*))
2821 for (; arg
; arg
= arg
->next
)
2822 if (!checker (arg
->expr
))
2829 /* Check the subscription expressions of a reference chain with a checking
2830 function; used by check_restricted. */
2833 check_references (gfc_ref
* ref
, bool (*checker
) (gfc_expr
*))
2843 for (dim
= 0; dim
!= ref
->u
.ar
.dimen
; ++dim
)
2845 if (!checker (ref
->u
.ar
.start
[dim
]))
2847 if (!checker (ref
->u
.ar
.end
[dim
]))
2849 if (!checker (ref
->u
.ar
.stride
[dim
]))
2855 /* Nothing needed, just proceed to next reference. */
2859 if (!checker (ref
->u
.ss
.start
))
2861 if (!checker (ref
->u
.ss
.end
))
2870 return check_references (ref
->next
, checker
);
2873 /* Return true if ns is a parent of the current ns. */
2876 is_parent_of_current_ns (gfc_namespace
*ns
)
2879 for (p
= gfc_current_ns
->parent
; p
; p
= p
->parent
)
2886 /* Verify that an expression is a restricted expression. Like its
2887 cousin check_init_expr(), an error message is generated if we
2891 check_restricted (gfc_expr
*e
)
2899 switch (e
->expr_type
)
2902 t
= check_intrinsic_op (e
, check_restricted
);
2904 t
= gfc_simplify_expr (e
, 0);
2909 if (e
->value
.function
.esym
)
2911 t
= check_arglist (e
->value
.function
.actual
, &check_restricted
);
2913 t
= external_spec_function (e
);
2917 if (e
->value
.function
.isym
&& e
->value
.function
.isym
->inquiry
)
2920 t
= check_arglist (e
->value
.function
.actual
, &check_restricted
);
2923 t
= restricted_intrinsic (e
);
2928 sym
= e
->symtree
->n
.sym
;
2931 /* If a dummy argument appears in a context that is valid for a
2932 restricted expression in an elemental procedure, it will have
2933 already been simplified away once we get here. Therefore we
2934 don't need to jump through hoops to distinguish valid from
2936 if (sym
->attr
.dummy
&& sym
->ns
== gfc_current_ns
2937 && sym
->ns
->proc_name
&& sym
->ns
->proc_name
->attr
.elemental
)
2939 gfc_error ("Dummy argument %qs not allowed in expression at %L",
2940 sym
->name
, &e
->where
);
2944 if (sym
->attr
.optional
)
2946 gfc_error ("Dummy argument %qs at %L cannot be OPTIONAL",
2947 sym
->name
, &e
->where
);
2951 if (sym
->attr
.intent
== INTENT_OUT
)
2953 gfc_error ("Dummy argument %qs at %L cannot be INTENT(OUT)",
2954 sym
->name
, &e
->where
);
2958 /* Check reference chain if any. */
2959 if (!check_references (e
->ref
, &check_restricted
))
2962 /* gfc_is_formal_arg broadcasts that a formal argument list is being
2963 processed in resolve.c(resolve_formal_arglist). This is done so
2964 that host associated dummy array indices are accepted (PR23446).
2965 This mechanism also does the same for the specification expressions
2966 of array-valued functions. */
2968 || sym
->attr
.in_common
2969 || sym
->attr
.use_assoc
2971 || sym
->attr
.implied_index
2972 || sym
->attr
.flavor
== FL_PARAMETER
2973 || is_parent_of_current_ns (sym
->ns
)
2974 || (sym
->ns
->proc_name
!= NULL
2975 && sym
->ns
->proc_name
->attr
.flavor
== FL_MODULE
)
2976 || (gfc_is_formal_arg () && (sym
->ns
== gfc_current_ns
)))
2982 gfc_error ("Variable %qs cannot appear in the expression at %L",
2983 sym
->name
, &e
->where
);
2984 /* Prevent a repetition of the error. */
2993 case EXPR_SUBSTRING
:
2994 t
= gfc_specification_expr (e
->ref
->u
.ss
.start
);
2998 t
= gfc_specification_expr (e
->ref
->u
.ss
.end
);
3000 t
= gfc_simplify_expr (e
, 0);
3004 case EXPR_STRUCTURE
:
3005 t
= gfc_check_constructor (e
, check_restricted
);
3009 t
= gfc_check_constructor (e
, check_restricted
);
3013 gfc_internal_error ("check_restricted(): Unknown expression type");
3020 /* Check to see that an expression is a specification expression. If
3021 we return false, an error has been generated. */
3024 gfc_specification_expr (gfc_expr
*e
)
3026 gfc_component
*comp
;
3031 if (e
->ts
.type
!= BT_INTEGER
)
3033 gfc_error ("Expression at %L must be of INTEGER type, found %s",
3034 &e
->where
, gfc_basic_typename (e
->ts
.type
));
3038 comp
= gfc_get_proc_ptr_comp (e
);
3039 if (e
->expr_type
== EXPR_FUNCTION
3040 && !e
->value
.function
.isym
3041 && !e
->value
.function
.esym
3042 && !gfc_pure (e
->symtree
->n
.sym
)
3043 && (!comp
|| !comp
->attr
.pure
))
3045 gfc_error ("Function %qs at %L must be PURE",
3046 e
->symtree
->n
.sym
->name
, &e
->where
);
3047 /* Prevent repeat error messages. */
3048 e
->symtree
->n
.sym
->attr
.pure
= 1;
3054 gfc_error ("Expression at %L must be scalar", &e
->where
);
3058 if (!gfc_simplify_expr (e
, 0))
3061 return check_restricted (e
);
3065 /************** Expression conformance checks. *************/
3067 /* Given two expressions, make sure that the arrays are conformable. */
3070 gfc_check_conformance (gfc_expr
*op1
, gfc_expr
*op2
, const char *optype_msgid
, ...)
3072 int op1_flag
, op2_flag
, d
;
3073 mpz_t op1_size
, op2_size
;
3079 if (op1
->rank
== 0 || op2
->rank
== 0)
3082 va_start (argp
, optype_msgid
);
3083 vsnprintf (buffer
, 240, optype_msgid
, argp
);
3086 if (op1
->rank
!= op2
->rank
)
3088 gfc_error ("Incompatible ranks in %s (%d and %d) at %L", _(buffer
),
3089 op1
->rank
, op2
->rank
, &op1
->where
);
3095 for (d
= 0; d
< op1
->rank
; d
++)
3097 op1_flag
= gfc_array_dimen_size(op1
, d
, &op1_size
);
3098 op2_flag
= gfc_array_dimen_size(op2
, d
, &op2_size
);
3100 if (op1_flag
&& op2_flag
&& mpz_cmp (op1_size
, op2_size
) != 0)
3102 gfc_error ("Different shape for %s at %L on dimension %d "
3103 "(%d and %d)", _(buffer
), &op1
->where
, d
+ 1,
3104 (int) mpz_get_si (op1_size
),
3105 (int) mpz_get_si (op2_size
));
3111 mpz_clear (op1_size
);
3113 mpz_clear (op2_size
);
3123 /* Given an assignable expression and an arbitrary expression, make
3124 sure that the assignment can take place. */
3127 gfc_check_assign (gfc_expr
*lvalue
, gfc_expr
*rvalue
, int conform
)
3133 sym
= lvalue
->symtree
->n
.sym
;
3135 /* See if this is the component or subcomponent of a pointer. */
3136 has_pointer
= sym
->attr
.pointer
;
3137 for (ref
= lvalue
->ref
; ref
; ref
= ref
->next
)
3138 if (ref
->type
== REF_COMPONENT
&& ref
->u
.c
.component
->attr
.pointer
)
3144 /* 12.5.2.2, Note 12.26: The result variable is very similar to any other
3145 variable local to a function subprogram. Its existence begins when
3146 execution of the function is initiated and ends when execution of the
3147 function is terminated...
3148 Therefore, the left hand side is no longer a variable, when it is: */
3149 if (sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.proc
!= PROC_ST_FUNCTION
3150 && !sym
->attr
.external
)
3155 /* (i) Use associated; */
3156 if (sym
->attr
.use_assoc
)
3159 /* (ii) The assignment is in the main program; or */
3160 if (gfc_current_ns
->proc_name
3161 && gfc_current_ns
->proc_name
->attr
.is_main_program
)
3164 /* (iii) A module or internal procedure... */
3165 if (gfc_current_ns
->proc_name
3166 && (gfc_current_ns
->proc_name
->attr
.proc
== PROC_INTERNAL
3167 || gfc_current_ns
->proc_name
->attr
.proc
== PROC_MODULE
)
3168 && gfc_current_ns
->parent
3169 && (!(gfc_current_ns
->parent
->proc_name
->attr
.function
3170 || gfc_current_ns
->parent
->proc_name
->attr
.subroutine
)
3171 || gfc_current_ns
->parent
->proc_name
->attr
.is_main_program
))
3173 /* ... that is not a function... */
3174 if (gfc_current_ns
->proc_name
3175 && !gfc_current_ns
->proc_name
->attr
.function
)
3178 /* ... or is not an entry and has a different name. */
3179 if (!sym
->attr
.entry
&& sym
->name
!= gfc_current_ns
->proc_name
->name
)
3183 /* (iv) Host associated and not the function symbol or the
3184 parent result. This picks up sibling references, which
3185 cannot be entries. */
3186 if (!sym
->attr
.entry
3187 && sym
->ns
== gfc_current_ns
->parent
3188 && sym
!= gfc_current_ns
->proc_name
3189 && sym
!= gfc_current_ns
->parent
->proc_name
->result
)
3194 gfc_error ("%qs at %L is not a VALUE", sym
->name
, &lvalue
->where
);
3199 if (rvalue
->rank
!= 0 && lvalue
->rank
!= rvalue
->rank
)
3201 gfc_error ("Incompatible ranks %d and %d in assignment at %L",
3202 lvalue
->rank
, rvalue
->rank
, &lvalue
->where
);
3206 if (lvalue
->ts
.type
== BT_UNKNOWN
)
3208 gfc_error ("Variable type is UNKNOWN in assignment at %L",
3213 if (rvalue
->expr_type
== EXPR_NULL
)
3215 if (has_pointer
&& (ref
== NULL
|| ref
->next
== NULL
)
3216 && lvalue
->symtree
->n
.sym
->attr
.data
)
3220 gfc_error ("NULL appears on right-hand side in assignment at %L",
3226 /* This is possibly a typo: x = f() instead of x => f(). */
3228 && rvalue
->expr_type
== EXPR_FUNCTION
&& gfc_expr_attr (rvalue
).pointer
)
3229 gfc_warning (OPT_Wsurprising
,
3230 "POINTER-valued function appears on right-hand side of "
3231 "assignment at %L", &rvalue
->where
);
3233 /* Check size of array assignments. */
3234 if (lvalue
->rank
!= 0 && rvalue
->rank
!= 0
3235 && !gfc_check_conformance (lvalue
, rvalue
, "array assignment"))
3238 if (rvalue
->is_boz
&& lvalue
->ts
.type
!= BT_INTEGER
3239 && lvalue
->symtree
->n
.sym
->attr
.data
3240 && !gfc_notify_std (GFC_STD_GNU
, "BOZ literal at %L used to "
3241 "initialize non-integer variable %qs",
3242 &rvalue
->where
, lvalue
->symtree
->n
.sym
->name
))
3244 else if (rvalue
->is_boz
&& !lvalue
->symtree
->n
.sym
->attr
.data
3245 && !gfc_notify_std (GFC_STD_GNU
, "BOZ literal at %L outside "
3246 "a DATA statement and outside INT/REAL/DBLE/CMPLX",
3250 /* Handle the case of a BOZ literal on the RHS. */
3251 if (rvalue
->is_boz
&& lvalue
->ts
.type
!= BT_INTEGER
)
3254 if (warn_surprising
)
3255 gfc_warning (OPT_Wsurprising
,
3256 "BOZ literal at %L is bitwise transferred "
3257 "non-integer symbol %qs", &rvalue
->where
,
3258 lvalue
->symtree
->n
.sym
->name
);
3259 if (!gfc_convert_boz (rvalue
, &lvalue
->ts
))
3261 if ((rc
= gfc_range_check (rvalue
)) != ARITH_OK
)
3263 if (rc
== ARITH_UNDERFLOW
)
3264 gfc_error ("Arithmetic underflow of bit-wise transferred BOZ at %L"
3265 ". This check can be disabled with the option "
3266 "%<-fno-range-check%>", &rvalue
->where
);
3267 else if (rc
== ARITH_OVERFLOW
)
3268 gfc_error ("Arithmetic overflow of bit-wise transferred BOZ at %L"
3269 ". This check can be disabled with the option "
3270 "%<-fno-range-check%>", &rvalue
->where
);
3271 else if (rc
== ARITH_NAN
)
3272 gfc_error ("Arithmetic NaN of bit-wise transferred BOZ at %L"
3273 ". This check can be disabled with the option "
3274 "%<-fno-range-check%>", &rvalue
->where
);
3279 if (gfc_compare_types (&lvalue
->ts
, &rvalue
->ts
))
3282 /* Only DATA Statements come here. */
3285 /* Numeric can be converted to any other numeric. And Hollerith can be
3286 converted to any other type. */
3287 if ((gfc_numeric_ts (&lvalue
->ts
) && gfc_numeric_ts (&rvalue
->ts
))
3288 || rvalue
->ts
.type
== BT_HOLLERITH
)
3291 if (lvalue
->ts
.type
== BT_LOGICAL
&& rvalue
->ts
.type
== BT_LOGICAL
)
3294 gfc_error ("Incompatible types in DATA statement at %L; attempted "
3295 "conversion of %s to %s", &lvalue
->where
,
3296 gfc_typename (&rvalue
->ts
), gfc_typename (&lvalue
->ts
));
3301 /* Assignment is the only case where character variables of different
3302 kind values can be converted into one another. */
3303 if (lvalue
->ts
.type
== BT_CHARACTER
&& rvalue
->ts
.type
== BT_CHARACTER
)
3305 if (lvalue
->ts
.kind
!= rvalue
->ts
.kind
)
3306 gfc_convert_chartype (rvalue
, &lvalue
->ts
);
3311 return gfc_convert_type (rvalue
, &lvalue
->ts
, 1);
3315 /* Check that a pointer assignment is OK. We first check lvalue, and
3316 we only check rvalue if it's not an assignment to NULL() or a
3317 NULLIFY statement. */
3320 gfc_check_pointer_assign (gfc_expr
*lvalue
, gfc_expr
*rvalue
)
3322 symbol_attribute attr
, lhs_attr
;
3324 bool is_pure
, is_implicit_pure
, rank_remap
;
3327 lhs_attr
= gfc_expr_attr (lvalue
);
3328 if (lvalue
->ts
.type
== BT_UNKNOWN
&& !lhs_attr
.proc_pointer
)
3330 gfc_error ("Pointer assignment target is not a POINTER at %L",
3335 if (lhs_attr
.flavor
== FL_PROCEDURE
&& lhs_attr
.use_assoc
3336 && !lhs_attr
.proc_pointer
)
3338 gfc_error ("%qs in the pointer assignment at %L cannot be an "
3339 "l-value since it is a procedure",
3340 lvalue
->symtree
->n
.sym
->name
, &lvalue
->where
);
3344 proc_pointer
= lvalue
->symtree
->n
.sym
->attr
.proc_pointer
;
3347 for (ref
= lvalue
->ref
; ref
; ref
= ref
->next
)
3349 if (ref
->type
== REF_COMPONENT
)
3350 proc_pointer
= ref
->u
.c
.component
->attr
.proc_pointer
;
3352 if (ref
->type
== REF_ARRAY
&& ref
->next
== NULL
)
3356 if (ref
->u
.ar
.type
== AR_FULL
)
3359 if (ref
->u
.ar
.type
!= AR_SECTION
)
3361 gfc_error ("Expected bounds specification for %qs at %L",
3362 lvalue
->symtree
->n
.sym
->name
, &lvalue
->where
);
3366 if (!gfc_notify_std (GFC_STD_F2003
, "Bounds specification "
3367 "for %qs in pointer assignment at %L",
3368 lvalue
->symtree
->n
.sym
->name
, &lvalue
->where
))
3371 /* When bounds are given, all lbounds are necessary and either all
3372 or none of the upper bounds; no strides are allowed. If the
3373 upper bounds are present, we may do rank remapping. */
3374 for (dim
= 0; dim
< ref
->u
.ar
.dimen
; ++dim
)
3376 if (!ref
->u
.ar
.start
[dim
]
3377 || ref
->u
.ar
.dimen_type
[dim
] != DIMEN_RANGE
)
3379 gfc_error ("Lower bound has to be present at %L",
3383 if (ref
->u
.ar
.stride
[dim
])
3385 gfc_error ("Stride must not be present at %L",
3391 rank_remap
= (ref
->u
.ar
.end
[dim
] != NULL
);
3394 if ((rank_remap
&& !ref
->u
.ar
.end
[dim
])
3395 || (!rank_remap
&& ref
->u
.ar
.end
[dim
]))
3397 gfc_error ("Either all or none of the upper bounds"
3398 " must be specified at %L", &lvalue
->where
);
3406 is_pure
= gfc_pure (NULL
);
3407 is_implicit_pure
= gfc_implicit_pure (NULL
);
3409 /* If rvalue is a NULL() or NULLIFY, we're done. Otherwise the type,
3410 kind, etc for lvalue and rvalue must match, and rvalue must be a
3411 pure variable if we're in a pure function. */
3412 if (rvalue
->expr_type
== EXPR_NULL
&& rvalue
->ts
.type
== BT_UNKNOWN
)
3415 /* F2008, C723 (pointer) and C726 (proc-pointer); for PURE also C1283. */
3416 if (lvalue
->expr_type
== EXPR_VARIABLE
3417 && gfc_is_coindexed (lvalue
))
3420 for (ref
= lvalue
->ref
; ref
; ref
= ref
->next
)
3421 if (ref
->type
== REF_ARRAY
&& ref
->u
.ar
.codimen
)
3423 gfc_error ("Pointer object at %L shall not have a coindex",
3429 /* Checks on rvalue for procedure pointer assignments. */
3434 gfc_component
*comp
;
3437 attr
= gfc_expr_attr (rvalue
);
3438 if (!((rvalue
->expr_type
== EXPR_NULL
)
3439 || (rvalue
->expr_type
== EXPR_FUNCTION
&& attr
.proc_pointer
)
3440 || (rvalue
->expr_type
== EXPR_VARIABLE
&& attr
.proc_pointer
)
3441 || (rvalue
->expr_type
== EXPR_VARIABLE
3442 && attr
.flavor
== FL_PROCEDURE
)))
3444 gfc_error ("Invalid procedure pointer assignment at %L",
3448 if (rvalue
->expr_type
== EXPR_VARIABLE
&& !attr
.proc_pointer
)
3450 /* Check for intrinsics. */
3451 gfc_symbol
*sym
= rvalue
->symtree
->n
.sym
;
3452 if (!sym
->attr
.intrinsic
3453 && (gfc_is_intrinsic (sym
, 0, sym
->declared_at
)
3454 || gfc_is_intrinsic (sym
, 1, sym
->declared_at
)))
3456 sym
->attr
.intrinsic
= 1;
3457 gfc_resolve_intrinsic (sym
, &rvalue
->where
);
3458 attr
= gfc_expr_attr (rvalue
);
3460 /* Check for result of embracing function. */
3461 if (sym
->attr
.function
&& sym
->result
== sym
)
3465 for (ns
= gfc_current_ns
; ns
; ns
= ns
->parent
)
3466 if (sym
== ns
->proc_name
)
3468 gfc_error ("Function result %qs is invalid as proc-target "
3469 "in procedure pointer assignment at %L",
3470 sym
->name
, &rvalue
->where
);
3477 gfc_error ("Abstract interface %qs is invalid "
3478 "in procedure pointer assignment at %L",
3479 rvalue
->symtree
->name
, &rvalue
->where
);
3482 /* Check for F08:C729. */
3483 if (attr
.flavor
== FL_PROCEDURE
)
3485 if (attr
.proc
== PROC_ST_FUNCTION
)
3487 gfc_error ("Statement function %qs is invalid "
3488 "in procedure pointer assignment at %L",
3489 rvalue
->symtree
->name
, &rvalue
->where
);
3492 if (attr
.proc
== PROC_INTERNAL
&&
3493 !gfc_notify_std(GFC_STD_F2008
, "Internal procedure %qs "
3494 "is invalid in procedure pointer assignment "
3495 "at %L", rvalue
->symtree
->name
, &rvalue
->where
))
3497 if (attr
.intrinsic
&& gfc_intrinsic_actual_ok (rvalue
->symtree
->name
,
3498 attr
.subroutine
) == 0)
3500 gfc_error ("Intrinsic %qs at %L is invalid in procedure pointer "
3501 "assignment", rvalue
->symtree
->name
, &rvalue
->where
);
3505 /* Check for F08:C730. */
3506 if (attr
.elemental
&& !attr
.intrinsic
)
3508 gfc_error ("Nonintrinsic elemental procedure %qs is invalid "
3509 "in procedure pointer assignment at %L",
3510 rvalue
->symtree
->name
, &rvalue
->where
);
3514 /* Ensure that the calling convention is the same. As other attributes
3515 such as DLLEXPORT may differ, one explicitly only tests for the
3516 calling conventions. */
3517 if (rvalue
->expr_type
== EXPR_VARIABLE
3518 && lvalue
->symtree
->n
.sym
->attr
.ext_attr
3519 != rvalue
->symtree
->n
.sym
->attr
.ext_attr
)
3521 symbol_attribute calls
;
3524 gfc_add_ext_attribute (&calls
, EXT_ATTR_CDECL
, NULL
);
3525 gfc_add_ext_attribute (&calls
, EXT_ATTR_STDCALL
, NULL
);
3526 gfc_add_ext_attribute (&calls
, EXT_ATTR_FASTCALL
, NULL
);
3528 if ((calls
.ext_attr
& lvalue
->symtree
->n
.sym
->attr
.ext_attr
)
3529 != (calls
.ext_attr
& rvalue
->symtree
->n
.sym
->attr
.ext_attr
))
3531 gfc_error ("Mismatch in the procedure pointer assignment "
3532 "at %L: mismatch in the calling convention",
3538 comp
= gfc_get_proc_ptr_comp (lvalue
);
3540 s1
= comp
->ts
.interface
;
3543 s1
= lvalue
->symtree
->n
.sym
;
3544 if (s1
->ts
.interface
)
3545 s1
= s1
->ts
.interface
;
3548 comp
= gfc_get_proc_ptr_comp (rvalue
);
3551 if (rvalue
->expr_type
== EXPR_FUNCTION
)
3553 s2
= comp
->ts
.interface
->result
;
3558 s2
= comp
->ts
.interface
;
3562 else if (rvalue
->expr_type
== EXPR_FUNCTION
)
3564 if (rvalue
->value
.function
.esym
)
3565 s2
= rvalue
->value
.function
.esym
->result
;
3567 s2
= rvalue
->symtree
->n
.sym
->result
;
3573 s2
= rvalue
->symtree
->n
.sym
;
3577 if (s2
&& s2
->attr
.proc_pointer
&& s2
->ts
.interface
)
3578 s2
= s2
->ts
.interface
;
3580 if (s1
== s2
|| !s1
|| !s2
)
3583 /* F08:7.2.2.4 (4) */
3584 if (s1
->attr
.if_source
== IFSRC_UNKNOWN
3585 && gfc_explicit_interface_required (s2
, err
, sizeof(err
)))
3587 gfc_error ("Explicit interface required for %qs at %L: %s",
3588 s1
->name
, &lvalue
->where
, err
);
3591 if (s2
->attr
.if_source
== IFSRC_UNKNOWN
3592 && gfc_explicit_interface_required (s1
, err
, sizeof(err
)))
3594 gfc_error ("Explicit interface required for %qs at %L: %s",
3595 s2
->name
, &rvalue
->where
, err
);
3599 if (!gfc_compare_interfaces (s1
, s2
, name
, 0, 1,
3600 err
, sizeof(err
), NULL
, NULL
))
3602 gfc_error ("Interface mismatch in procedure pointer assignment "
3603 "at %L: %s", &rvalue
->where
, err
);
3607 /* Check F2008Cor2, C729. */
3608 if (!s2
->attr
.intrinsic
&& s2
->attr
.if_source
== IFSRC_UNKNOWN
3609 && !s2
->attr
.external
&& !s2
->attr
.subroutine
&& !s2
->attr
.function
)
3611 gfc_error ("Procedure pointer target %qs at %L must be either an "
3612 "intrinsic, host or use associated, referenced or have "
3613 "the EXTERNAL attribute", s2
->name
, &rvalue
->where
);
3620 if (!gfc_compare_types (&lvalue
->ts
, &rvalue
->ts
))
3622 /* Check for F03:C717. */
3623 if (UNLIMITED_POLY (rvalue
)
3624 && !(UNLIMITED_POLY (lvalue
)
3625 || (lvalue
->ts
.type
== BT_DERIVED
3626 && (lvalue
->ts
.u
.derived
->attr
.is_bind_c
3627 || lvalue
->ts
.u
.derived
->attr
.sequence
))))
3628 gfc_error ("Data-pointer-object &L must be unlimited "
3629 "polymorphic, a sequence derived type or of a "
3630 "type with the BIND attribute assignment at %L "
3631 "to be compatible with an unlimited polymorphic "
3632 "target", &lvalue
->where
);
3634 gfc_error ("Different types in pointer assignment at %L; "
3635 "attempted assignment of %s to %s", &lvalue
->where
,
3636 gfc_typename (&rvalue
->ts
),
3637 gfc_typename (&lvalue
->ts
));
3641 if (lvalue
->ts
.type
!= BT_CLASS
&& lvalue
->ts
.kind
!= rvalue
->ts
.kind
)
3643 gfc_error ("Different kind type parameters in pointer "
3644 "assignment at %L", &lvalue
->where
);
3648 if (lvalue
->rank
!= rvalue
->rank
&& !rank_remap
)
3650 gfc_error ("Different ranks in pointer assignment at %L", &lvalue
->where
);
3654 /* Make sure the vtab is present. */
3655 if (lvalue
->ts
.type
== BT_CLASS
&& !UNLIMITED_POLY (rvalue
))
3656 gfc_find_vtab (&rvalue
->ts
);
3658 /* Check rank remapping. */
3663 /* If this can be determined, check that the target must be at least as
3664 large as the pointer assigned to it is. */
3665 if (gfc_array_size (lvalue
, &lsize
)
3666 && gfc_array_size (rvalue
, &rsize
)
3667 && mpz_cmp (rsize
, lsize
) < 0)
3669 gfc_error ("Rank remapping target is smaller than size of the"
3670 " pointer (%ld < %ld) at %L",
3671 mpz_get_si (rsize
), mpz_get_si (lsize
),
3676 /* The target must be either rank one or it must be simply contiguous
3677 and F2008 must be allowed. */
3678 if (rvalue
->rank
!= 1)
3680 if (!gfc_is_simply_contiguous (rvalue
, true))
3682 gfc_error ("Rank remapping target must be rank 1 or"
3683 " simply contiguous at %L", &rvalue
->where
);
3686 if (!gfc_notify_std (GFC_STD_F2008
, "Rank remapping target is not "
3687 "rank 1 at %L", &rvalue
->where
))
3692 /* Now punt if we are dealing with a NULLIFY(X) or X = NULL(X). */
3693 if (rvalue
->expr_type
== EXPR_NULL
)
3696 if (lvalue
->ts
.type
== BT_CHARACTER
)
3698 bool t
= gfc_check_same_strlen (lvalue
, rvalue
, "pointer assignment");
3703 if (rvalue
->expr_type
== EXPR_VARIABLE
&& is_subref_array (rvalue
))
3704 lvalue
->symtree
->n
.sym
->attr
.subref_array_pointer
= 1;
3706 attr
= gfc_expr_attr (rvalue
);
3708 if (rvalue
->expr_type
== EXPR_FUNCTION
&& !attr
.pointer
)
3710 gfc_error ("Target expression in pointer assignment "
3711 "at %L must deliver a pointer result",
3716 if (!attr
.target
&& !attr
.pointer
)
3718 gfc_error ("Pointer assignment target is neither TARGET "
3719 "nor POINTER at %L", &rvalue
->where
);
3723 if (is_pure
&& gfc_impure_variable (rvalue
->symtree
->n
.sym
))
3725 gfc_error ("Bad target in pointer assignment in PURE "
3726 "procedure at %L", &rvalue
->where
);
3729 if (is_implicit_pure
&& gfc_impure_variable (rvalue
->symtree
->n
.sym
))
3730 gfc_unset_implicit_pure (gfc_current_ns
->proc_name
);
3732 if (gfc_has_vector_index (rvalue
))
3734 gfc_error ("Pointer assignment with vector subscript "
3735 "on rhs at %L", &rvalue
->where
);
3739 if (attr
.is_protected
&& attr
.use_assoc
3740 && !(attr
.pointer
|| attr
.proc_pointer
))
3742 gfc_error ("Pointer assignment target has PROTECTED "
3743 "attribute at %L", &rvalue
->where
);
3747 /* F2008, C725. For PURE also C1283. */
3748 if (rvalue
->expr_type
== EXPR_VARIABLE
3749 && gfc_is_coindexed (rvalue
))
3752 for (ref
= rvalue
->ref
; ref
; ref
= ref
->next
)
3753 if (ref
->type
== REF_ARRAY
&& ref
->u
.ar
.codimen
)
3755 gfc_error ("Data target at %L shall not have a coindex",
3761 /* Warn if it is the LHS pointer may lives longer than the RHS target. */
3762 if (warn_target_lifetime
3763 && rvalue
->expr_type
== EXPR_VARIABLE
3764 && !rvalue
->symtree
->n
.sym
->attr
.save
3765 && !attr
.pointer
&& !rvalue
->symtree
->n
.sym
->attr
.host_assoc
3766 && !rvalue
->symtree
->n
.sym
->attr
.in_common
3767 && !rvalue
->symtree
->n
.sym
->attr
.use_assoc
3768 && !rvalue
->symtree
->n
.sym
->attr
.dummy
)
3773 warn
= lvalue
->symtree
->n
.sym
->attr
.dummy
3774 || lvalue
->symtree
->n
.sym
->attr
.result
3775 || lvalue
->symtree
->n
.sym
->attr
.function
3776 || (lvalue
->symtree
->n
.sym
->attr
.host_assoc
3777 && lvalue
->symtree
->n
.sym
->ns
3778 != rvalue
->symtree
->n
.sym
->ns
)
3779 || lvalue
->symtree
->n
.sym
->attr
.use_assoc
3780 || lvalue
->symtree
->n
.sym
->attr
.in_common
;
3782 if (rvalue
->symtree
->n
.sym
->ns
->proc_name
3783 && rvalue
->symtree
->n
.sym
->ns
->proc_name
->attr
.flavor
!= FL_PROCEDURE
3784 && rvalue
->symtree
->n
.sym
->ns
->proc_name
->attr
.flavor
!= FL_PROGRAM
)
3785 for (ns
= rvalue
->symtree
->n
.sym
->ns
;
3786 ns
&& ns
->proc_name
&& ns
->proc_name
->attr
.flavor
!= FL_PROCEDURE
;
3788 if (ns
->parent
== lvalue
->symtree
->n
.sym
->ns
)
3795 gfc_warning (OPT_Wtarget_lifetime
,
3796 "Pointer at %L in pointer assignment might outlive the "
3797 "pointer target", &lvalue
->where
);
3804 /* Relative of gfc_check_assign() except that the lvalue is a single
3805 symbol. Used for initialization assignments. */
3808 gfc_check_assign_symbol (gfc_symbol
*sym
, gfc_component
*comp
, gfc_expr
*rvalue
)
3812 bool pointer
, proc_pointer
;
3814 memset (&lvalue
, '\0', sizeof (gfc_expr
));
3816 lvalue
.expr_type
= EXPR_VARIABLE
;
3817 lvalue
.ts
= sym
->ts
;
3819 lvalue
.rank
= sym
->as
->rank
;
3820 lvalue
.symtree
= XCNEW (gfc_symtree
);
3821 lvalue
.symtree
->n
.sym
= sym
;
3822 lvalue
.where
= sym
->declared_at
;
3826 lvalue
.ref
= gfc_get_ref ();
3827 lvalue
.ref
->type
= REF_COMPONENT
;
3828 lvalue
.ref
->u
.c
.component
= comp
;
3829 lvalue
.ref
->u
.c
.sym
= sym
;
3830 lvalue
.ts
= comp
->ts
;
3831 lvalue
.rank
= comp
->as
? comp
->as
->rank
: 0;
3832 lvalue
.where
= comp
->loc
;
3833 pointer
= comp
->ts
.type
== BT_CLASS
&& CLASS_DATA (comp
)
3834 ? CLASS_DATA (comp
)->attr
.class_pointer
: comp
->attr
.pointer
;
3835 proc_pointer
= comp
->attr
.proc_pointer
;
3839 pointer
= sym
->ts
.type
== BT_CLASS
&& CLASS_DATA (sym
)
3840 ? CLASS_DATA (sym
)->attr
.class_pointer
: sym
->attr
.pointer
;
3841 proc_pointer
= sym
->attr
.proc_pointer
;
3844 if (pointer
|| proc_pointer
)
3845 r
= gfc_check_pointer_assign (&lvalue
, rvalue
);
3847 r
= gfc_check_assign (&lvalue
, rvalue
, 1);
3849 free (lvalue
.symtree
);
3855 if (pointer
&& rvalue
->expr_type
!= EXPR_NULL
)
3857 /* F08:C461. Additional checks for pointer initialization. */
3858 symbol_attribute attr
;
3859 attr
= gfc_expr_attr (rvalue
);
3860 if (attr
.allocatable
)
3862 gfc_error ("Pointer initialization target at %L "
3863 "must not be ALLOCATABLE", &rvalue
->where
);
3866 if (!attr
.target
|| attr
.pointer
)
3868 gfc_error ("Pointer initialization target at %L "
3869 "must have the TARGET attribute", &rvalue
->where
);
3873 if (!attr
.save
&& rvalue
->expr_type
== EXPR_VARIABLE
3874 && rvalue
->symtree
->n
.sym
->ns
->proc_name
3875 && rvalue
->symtree
->n
.sym
->ns
->proc_name
->attr
.is_main_program
)
3877 rvalue
->symtree
->n
.sym
->ns
->proc_name
->attr
.save
= SAVE_IMPLICIT
;
3878 attr
.save
= SAVE_IMPLICIT
;
3883 gfc_error ("Pointer initialization target at %L "
3884 "must have the SAVE attribute", &rvalue
->where
);
3889 if (proc_pointer
&& rvalue
->expr_type
!= EXPR_NULL
)
3891 /* F08:C1220. Additional checks for procedure pointer initialization. */
3892 symbol_attribute attr
= gfc_expr_attr (rvalue
);
3893 if (attr
.proc_pointer
)
3895 gfc_error ("Procedure pointer initialization target at %L "
3896 "may not be a procedure pointer", &rvalue
->where
);
3905 /* Check for default initializer; sym->value is not enough
3906 as it is also set for EXPR_NULL of allocatables. */
3909 gfc_has_default_initializer (gfc_symbol
*der
)
3913 gcc_assert (der
->attr
.flavor
== FL_DERIVED
);
3914 for (c
= der
->components
; c
; c
= c
->next
)
3915 if (c
->ts
.type
== BT_DERIVED
)
3917 if (!c
->attr
.pointer
3918 && gfc_has_default_initializer (c
->ts
.u
.derived
))
3920 if (c
->attr
.pointer
&& c
->initializer
)
3933 /* Get an expression for a default initializer. */
3936 gfc_default_initializer (gfc_typespec
*ts
)
3939 gfc_component
*comp
;
3941 /* See if we have a default initializer in this, but not in nested
3942 types (otherwise we could use gfc_has_default_initializer()). */
3943 for (comp
= ts
->u
.derived
->components
; comp
; comp
= comp
->next
)
3944 if (comp
->initializer
|| comp
->attr
.allocatable
3945 || (comp
->ts
.type
== BT_CLASS
&& CLASS_DATA (comp
)
3946 && CLASS_DATA (comp
)->attr
.allocatable
))
3952 init
= gfc_get_structure_constructor_expr (ts
->type
, ts
->kind
,
3953 &ts
->u
.derived
->declared_at
);
3956 for (comp
= ts
->u
.derived
->components
; comp
; comp
= comp
->next
)
3958 gfc_constructor
*ctor
= gfc_constructor_get();
3960 if (comp
->initializer
)
3962 ctor
->expr
= gfc_copy_expr (comp
->initializer
);
3963 if ((comp
->ts
.type
!= comp
->initializer
->ts
.type
3964 || comp
->ts
.kind
!= comp
->initializer
->ts
.kind
)
3965 && !comp
->attr
.pointer
&& !comp
->attr
.proc_pointer
)
3966 gfc_convert_type_warn (ctor
->expr
, &comp
->ts
, 2, false);
3969 if (comp
->attr
.allocatable
3970 || (comp
->ts
.type
== BT_CLASS
&& CLASS_DATA (comp
)->attr
.allocatable
))
3972 ctor
->expr
= gfc_get_expr ();
3973 ctor
->expr
->expr_type
= EXPR_NULL
;
3974 ctor
->expr
->ts
= comp
->ts
;
3977 gfc_constructor_append (&init
->value
.constructor
, ctor
);
3984 /* Given a symbol, create an expression node with that symbol as a
3985 variable. If the symbol is array valued, setup a reference of the
3989 gfc_get_variable_expr (gfc_symtree
*var
)
3993 e
= gfc_get_expr ();
3994 e
->expr_type
= EXPR_VARIABLE
;
3996 e
->ts
= var
->n
.sym
->ts
;
3998 if (var
->n
.sym
->attr
.flavor
!= FL_PROCEDURE
3999 && ((var
->n
.sym
->as
!= NULL
&& var
->n
.sym
->ts
.type
!= BT_CLASS
)
4000 || (var
->n
.sym
->ts
.type
== BT_CLASS
&& CLASS_DATA (var
->n
.sym
)
4001 && CLASS_DATA (var
->n
.sym
)->as
)))
4003 e
->rank
= var
->n
.sym
->ts
.type
== BT_CLASS
4004 ? CLASS_DATA (var
->n
.sym
)->as
->rank
: var
->n
.sym
->as
->rank
;
4005 e
->ref
= gfc_get_ref ();
4006 e
->ref
->type
= REF_ARRAY
;
4007 e
->ref
->u
.ar
.type
= AR_FULL
;
4008 e
->ref
->u
.ar
.as
= gfc_copy_array_spec (var
->n
.sym
->ts
.type
== BT_CLASS
4009 ? CLASS_DATA (var
->n
.sym
)->as
4017 /* Adds a full array reference to an expression, as needed. */
4020 gfc_add_full_array_ref (gfc_expr
*e
, gfc_array_spec
*as
)
4023 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
4028 ref
->next
= gfc_get_ref ();
4033 e
->ref
= gfc_get_ref ();
4036 ref
->type
= REF_ARRAY
;
4037 ref
->u
.ar
.type
= AR_FULL
;
4038 ref
->u
.ar
.dimen
= e
->rank
;
4039 ref
->u
.ar
.where
= e
->where
;
4045 gfc_lval_expr_from_sym (gfc_symbol
*sym
)
4049 lval
= gfc_get_expr ();
4050 lval
->expr_type
= EXPR_VARIABLE
;
4051 lval
->where
= sym
->declared_at
;
4053 lval
->symtree
= gfc_find_symtree (sym
->ns
->sym_root
, sym
->name
);
4055 /* It will always be a full array. */
4056 as
= IS_CLASS_ARRAY (sym
) ? CLASS_DATA (sym
)->as
: sym
->as
;
4057 lval
->rank
= as
? as
->rank
: 0;
4059 gfc_add_full_array_ref (lval
, as
);
4064 /* Returns the array_spec of a full array expression. A NULL is
4065 returned otherwise. */
4067 gfc_get_full_arrayspec_from_expr (gfc_expr
*expr
)
4072 if (expr
->rank
== 0)
4075 /* Follow any component references. */
4076 if (expr
->expr_type
== EXPR_VARIABLE
4077 || expr
->expr_type
== EXPR_CONSTANT
)
4079 as
= expr
->symtree
->n
.sym
->as
;
4080 for (ref
= expr
->ref
; ref
; ref
= ref
->next
)
4085 as
= ref
->u
.c
.component
->as
;
4093 switch (ref
->u
.ar
.type
)
4116 /* General expression traversal function. */
4119 gfc_traverse_expr (gfc_expr
*expr
, gfc_symbol
*sym
,
4120 bool (*func
)(gfc_expr
*, gfc_symbol
*, int*),
4125 gfc_actual_arglist
*args
;
4132 if ((*func
) (expr
, sym
, &f
))
4135 if (expr
->ts
.type
== BT_CHARACTER
4137 && expr
->ts
.u
.cl
->length
4138 && expr
->ts
.u
.cl
->length
->expr_type
!= EXPR_CONSTANT
4139 && gfc_traverse_expr (expr
->ts
.u
.cl
->length
, sym
, func
, f
))
4142 switch (expr
->expr_type
)
4147 for (args
= expr
->value
.function
.actual
; args
; args
= args
->next
)
4149 if (gfc_traverse_expr (args
->expr
, sym
, func
, f
))
4157 case EXPR_SUBSTRING
:
4160 case EXPR_STRUCTURE
:
4162 for (c
= gfc_constructor_first (expr
->value
.constructor
);
4163 c
; c
= gfc_constructor_next (c
))
4165 if (gfc_traverse_expr (c
->expr
, sym
, func
, f
))
4169 if (gfc_traverse_expr (c
->iterator
->var
, sym
, func
, f
))
4171 if (gfc_traverse_expr (c
->iterator
->start
, sym
, func
, f
))
4173 if (gfc_traverse_expr (c
->iterator
->end
, sym
, func
, f
))
4175 if (gfc_traverse_expr (c
->iterator
->step
, sym
, func
, f
))
4182 if (gfc_traverse_expr (expr
->value
.op
.op1
, sym
, func
, f
))
4184 if (gfc_traverse_expr (expr
->value
.op
.op2
, sym
, func
, f
))
4200 for (i
= 0; i
< GFC_MAX_DIMENSIONS
; i
++)
4202 if (gfc_traverse_expr (ar
.start
[i
], sym
, func
, f
))
4204 if (gfc_traverse_expr (ar
.end
[i
], sym
, func
, f
))
4206 if (gfc_traverse_expr (ar
.stride
[i
], sym
, func
, f
))
4212 if (gfc_traverse_expr (ref
->u
.ss
.start
, sym
, func
, f
))
4214 if (gfc_traverse_expr (ref
->u
.ss
.end
, sym
, func
, f
))
4219 if (ref
->u
.c
.component
->ts
.type
== BT_CHARACTER
4220 && ref
->u
.c
.component
->ts
.u
.cl
4221 && ref
->u
.c
.component
->ts
.u
.cl
->length
4222 && ref
->u
.c
.component
->ts
.u
.cl
->length
->expr_type
4224 && gfc_traverse_expr (ref
->u
.c
.component
->ts
.u
.cl
->length
,
4228 if (ref
->u
.c
.component
->as
)
4229 for (i
= 0; i
< ref
->u
.c
.component
->as
->rank
4230 + ref
->u
.c
.component
->as
->corank
; i
++)
4232 if (gfc_traverse_expr (ref
->u
.c
.component
->as
->lower
[i
],
4235 if (gfc_traverse_expr (ref
->u
.c
.component
->as
->upper
[i
],
4249 /* Traverse expr, marking all EXPR_VARIABLE symbols referenced. */
4252 expr_set_symbols_referenced (gfc_expr
*expr
,
4253 gfc_symbol
*sym ATTRIBUTE_UNUSED
,
4254 int *f ATTRIBUTE_UNUSED
)
4256 if (expr
->expr_type
!= EXPR_VARIABLE
)
4258 gfc_set_sym_referenced (expr
->symtree
->n
.sym
);
4263 gfc_expr_set_symbols_referenced (gfc_expr
*expr
)
4265 gfc_traverse_expr (expr
, NULL
, expr_set_symbols_referenced
, 0);
4269 /* Determine if an expression is a procedure pointer component and return
4270 the component in that case. Otherwise return NULL. */
4273 gfc_get_proc_ptr_comp (gfc_expr
*expr
)
4277 if (!expr
|| !expr
->ref
)
4284 if (ref
->type
== REF_COMPONENT
4285 && ref
->u
.c
.component
->attr
.proc_pointer
)
4286 return ref
->u
.c
.component
;
4292 /* Determine if an expression is a procedure pointer component. */
4295 gfc_is_proc_ptr_comp (gfc_expr
*expr
)
4297 return (gfc_get_proc_ptr_comp (expr
) != NULL
);
4301 /* Determine if an expression is a function with an allocatable class scalar
4304 gfc_is_alloc_class_scalar_function (gfc_expr
*expr
)
4306 if (expr
->expr_type
== EXPR_FUNCTION
4307 && expr
->value
.function
.esym
4308 && expr
->value
.function
.esym
->result
4309 && expr
->value
.function
.esym
->result
->ts
.type
== BT_CLASS
4310 && !CLASS_DATA (expr
->value
.function
.esym
->result
)->attr
.dimension
4311 && CLASS_DATA (expr
->value
.function
.esym
->result
)->attr
.allocatable
)
4318 /* Determine if an expression is a function with an allocatable class array
4321 gfc_is_alloc_class_array_function (gfc_expr
*expr
)
4323 if (expr
->expr_type
== EXPR_FUNCTION
4324 && expr
->value
.function
.esym
4325 && expr
->value
.function
.esym
->result
4326 && expr
->value
.function
.esym
->result
->ts
.type
== BT_CLASS
4327 && CLASS_DATA (expr
->value
.function
.esym
->result
)->attr
.dimension
4328 && CLASS_DATA (expr
->value
.function
.esym
->result
)->attr
.allocatable
)
4335 /* Walk an expression tree and check each variable encountered for being typed.
4336 If strict is not set, a top-level variable is tolerated untyped in -std=gnu
4337 mode as is a basic arithmetic expression using those; this is for things in
4340 INTEGER :: arr(n), n
4341 INTEGER :: arr(n + 1), n
4343 The namespace is needed for IMPLICIT typing. */
4345 static gfc_namespace
* check_typed_ns
;
4348 expr_check_typed_help (gfc_expr
* e
, gfc_symbol
* sym ATTRIBUTE_UNUSED
,
4349 int* f ATTRIBUTE_UNUSED
)
4353 if (e
->expr_type
!= EXPR_VARIABLE
)
4356 gcc_assert (e
->symtree
);
4357 t
= gfc_check_symbol_typed (e
->symtree
->n
.sym
, check_typed_ns
,
4364 gfc_expr_check_typed (gfc_expr
* e
, gfc_namespace
* ns
, bool strict
)
4368 /* If this is a top-level variable or EXPR_OP, do the check with strict given
4372 if (e
->expr_type
== EXPR_VARIABLE
&& !e
->ref
)
4373 return gfc_check_symbol_typed (e
->symtree
->n
.sym
, ns
, strict
, e
->where
);
4375 if (e
->expr_type
== EXPR_OP
)
4379 gcc_assert (e
->value
.op
.op1
);
4380 t
= gfc_expr_check_typed (e
->value
.op
.op1
, ns
, strict
);
4382 if (t
&& e
->value
.op
.op2
)
4383 t
= gfc_expr_check_typed (e
->value
.op
.op2
, ns
, strict
);
4389 /* Otherwise, walk the expression and do it strictly. */
4390 check_typed_ns
= ns
;
4391 error_found
= gfc_traverse_expr (e
, NULL
, &expr_check_typed_help
, 0);
4393 return error_found
? false : true;
4398 gfc_ref_this_image (gfc_ref
*ref
)
4402 gcc_assert (ref
->type
== REF_ARRAY
&& ref
->u
.ar
.codimen
> 0);
4404 for (n
= ref
->u
.ar
.dimen
; n
< ref
->u
.ar
.dimen
+ ref
->u
.ar
.codimen
; n
++)
4405 if (ref
->u
.ar
.dimen_type
[n
] != DIMEN_THIS_IMAGE
)
4413 gfc_is_coindexed (gfc_expr
*e
)
4417 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
4418 if (ref
->type
== REF_ARRAY
&& ref
->u
.ar
.codimen
> 0)
4419 return !gfc_ref_this_image (ref
);
4425 /* Coarrays are variables with a corank but not being coindexed. However, also
4426 the following is a coarray: A subobject of a coarray is a coarray if it does
4427 not have any cosubscripts, vector subscripts, allocatable component
4428 selection, or pointer component selection. (F2008, 2.4.7) */
4431 gfc_is_coarray (gfc_expr
*e
)
4435 gfc_component
*comp
;
4440 if (e
->expr_type
!= EXPR_VARIABLE
)
4444 sym
= e
->symtree
->n
.sym
;
4446 if (sym
->ts
.type
== BT_CLASS
&& sym
->attr
.class_ok
)
4447 coarray
= CLASS_DATA (sym
)->attr
.codimension
;
4449 coarray
= sym
->attr
.codimension
;
4451 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
4455 comp
= ref
->u
.c
.component
;
4456 if (comp
->ts
.type
== BT_CLASS
&& comp
->attr
.class_ok
4457 && (CLASS_DATA (comp
)->attr
.class_pointer
4458 || CLASS_DATA (comp
)->attr
.allocatable
))
4461 coarray
= CLASS_DATA (comp
)->attr
.codimension
;
4463 else if (comp
->attr
.pointer
|| comp
->attr
.allocatable
)
4466 coarray
= comp
->attr
.codimension
;
4474 if (ref
->u
.ar
.codimen
> 0 && !gfc_ref_this_image (ref
))
4480 for (i
= 0; i
< ref
->u
.ar
.dimen
; i
++)
4481 if (ref
->u
.ar
.dimen_type
[i
] == DIMEN_VECTOR
)
4492 return coarray
&& !coindexed
;
4497 gfc_get_corank (gfc_expr
*e
)
4502 if (!gfc_is_coarray (e
))
4505 if (e
->ts
.type
== BT_CLASS
&& e
->ts
.u
.derived
->components
)
4506 corank
= e
->ts
.u
.derived
->components
->as
4507 ? e
->ts
.u
.derived
->components
->as
->corank
: 0;
4509 corank
= e
->symtree
->n
.sym
->as
? e
->symtree
->n
.sym
->as
->corank
: 0;
4511 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
4513 if (ref
->type
== REF_ARRAY
)
4514 corank
= ref
->u
.ar
.as
->corank
;
4515 gcc_assert (ref
->type
!= REF_SUBSTRING
);
4522 /* Check whether the expression has an ultimate allocatable component.
4523 Being itself allocatable does not count. */
4525 gfc_has_ultimate_allocatable (gfc_expr
*e
)
4527 gfc_ref
*ref
, *last
= NULL
;
4529 if (e
->expr_type
!= EXPR_VARIABLE
)
4532 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
4533 if (ref
->type
== REF_COMPONENT
)
4536 if (last
&& last
->u
.c
.component
->ts
.type
== BT_CLASS
)
4537 return CLASS_DATA (last
->u
.c
.component
)->attr
.alloc_comp
;
4538 else if (last
&& last
->u
.c
.component
->ts
.type
== BT_DERIVED
)
4539 return last
->u
.c
.component
->ts
.u
.derived
->attr
.alloc_comp
;
4543 if (e
->ts
.type
== BT_CLASS
)
4544 return CLASS_DATA (e
)->attr
.alloc_comp
;
4545 else if (e
->ts
.type
== BT_DERIVED
)
4546 return e
->ts
.u
.derived
->attr
.alloc_comp
;
4552 /* Check whether the expression has an pointer component.
4553 Being itself a pointer does not count. */
4555 gfc_has_ultimate_pointer (gfc_expr
*e
)
4557 gfc_ref
*ref
, *last
= NULL
;
4559 if (e
->expr_type
!= EXPR_VARIABLE
)
4562 for (ref
= e
->ref
; ref
; ref
= ref
->next
)
4563 if (ref
->type
== REF_COMPONENT
)
4566 if (last
&& last
->u
.c
.component
->ts
.type
== BT_CLASS
)
4567 return CLASS_DATA (last
->u
.c
.component
)->attr
.pointer_comp
;
4568 else if (last
&& last
->u
.c
.component
->ts
.type
== BT_DERIVED
)
4569 return last
->u
.c
.component
->ts
.u
.derived
->attr
.pointer_comp
;
4573 if (e
->ts
.type
== BT_CLASS
)
4574 return CLASS_DATA (e
)->attr
.pointer_comp
;
4575 else if (e
->ts
.type
== BT_DERIVED
)
4576 return e
->ts
.u
.derived
->attr
.pointer_comp
;
4582 /* Check whether an expression is "simply contiguous", cf. F2008, 6.5.4.
4583 Note: A scalar is not regarded as "simply contiguous" by the standard.
4584 if bool is not strict, some further checks are done - for instance,
4585 a "(::1)" is accepted. */
4588 gfc_is_simply_contiguous (gfc_expr
*expr
, bool strict
)
4592 gfc_array_ref
*ar
= NULL
;
4593 gfc_ref
*ref
, *part_ref
= NULL
;
4596 if (expr
->expr_type
== EXPR_FUNCTION
)
4597 return expr
->value
.function
.esym
4598 ? expr
->value
.function
.esym
->result
->attr
.contiguous
: false;
4599 else if (expr
->expr_type
!= EXPR_VARIABLE
)
4602 if (expr
->rank
== 0)
4605 for (ref
= expr
->ref
; ref
; ref
= ref
->next
)
4608 return false; /* Array shall be last part-ref. */
4610 if (ref
->type
== REF_COMPONENT
)
4612 else if (ref
->type
== REF_SUBSTRING
)
4614 else if (ref
->u
.ar
.type
!= AR_ELEMENT
)
4618 sym
= expr
->symtree
->n
.sym
;
4619 if (expr
->ts
.type
!= BT_CLASS
4621 && !part_ref
->u
.c
.component
->attr
.contiguous
4622 && part_ref
->u
.c
.component
->attr
.pointer
)
4624 && !sym
->attr
.contiguous
4625 && (sym
->attr
.pointer
4626 || sym
->as
->type
== AS_ASSUMED_RANK
4627 || sym
->as
->type
== AS_ASSUMED_SHAPE
))))
4630 if (!ar
|| ar
->type
== AR_FULL
)
4633 gcc_assert (ar
->type
== AR_SECTION
);
4635 /* Check for simply contiguous array */
4637 for (i
= 0; i
< ar
->dimen
; i
++)
4639 if (ar
->dimen_type
[i
] == DIMEN_VECTOR
)
4642 if (ar
->dimen_type
[i
] == DIMEN_ELEMENT
)
4648 gcc_assert (ar
->dimen_type
[i
] == DIMEN_RANGE
);
4651 /* If the previous section was not contiguous, that's an error,
4652 unless we have effective only one element and checking is not
4654 if (!colon
&& (strict
|| !ar
->start
[i
] || !ar
->end
[i
]
4655 || ar
->start
[i
]->expr_type
!= EXPR_CONSTANT
4656 || ar
->end
[i
]->expr_type
!= EXPR_CONSTANT
4657 || mpz_cmp (ar
->start
[i
]->value
.integer
,
4658 ar
->end
[i
]->value
.integer
) != 0))
4661 /* Following the standard, "(::1)" or - if known at compile time -
4662 "(lbound:ubound)" are not simply contiguous; if strict
4663 is false, they are regarded as simply contiguous. */
4664 if (ar
->stride
[i
] && (strict
|| ar
->stride
[i
]->expr_type
!= EXPR_CONSTANT
4665 || ar
->stride
[i
]->ts
.type
!= BT_INTEGER
4666 || mpz_cmp_si (ar
->stride
[i
]->value
.integer
, 1) != 0))
4670 && (strict
|| ar
->start
[i
]->expr_type
!= EXPR_CONSTANT
4671 || !ar
->as
->lower
[i
]
4672 || ar
->as
->lower
[i
]->expr_type
!= EXPR_CONSTANT
4673 || mpz_cmp (ar
->start
[i
]->value
.integer
,
4674 ar
->as
->lower
[i
]->value
.integer
) != 0))
4678 && (strict
|| ar
->end
[i
]->expr_type
!= EXPR_CONSTANT
4679 || !ar
->as
->upper
[i
]
4680 || ar
->as
->upper
[i
]->expr_type
!= EXPR_CONSTANT
4681 || mpz_cmp (ar
->end
[i
]->value
.integer
,
4682 ar
->as
->upper
[i
]->value
.integer
) != 0))
4690 /* Build call to an intrinsic procedure. The number of arguments has to be
4691 passed (rather than ending the list with a NULL value) because we may
4692 want to add arguments but with a NULL-expression. */
4695 gfc_build_intrinsic_call (gfc_namespace
*ns
, gfc_isym_id id
, const char* name
,
4696 locus where
, unsigned numarg
, ...)
4699 gfc_actual_arglist
* atail
;
4700 gfc_intrinsic_sym
* isym
;
4703 const char *mangled_name
= gfc_get_string (GFC_PREFIX ("%s"), name
);
4705 isym
= gfc_intrinsic_function_by_id (id
);
4708 result
= gfc_get_expr ();
4709 result
->expr_type
= EXPR_FUNCTION
;
4710 result
->ts
= isym
->ts
;
4711 result
->where
= where
;
4712 result
->value
.function
.name
= mangled_name
;
4713 result
->value
.function
.isym
= isym
;
4715 gfc_get_sym_tree (mangled_name
, ns
, &result
->symtree
, false);
4716 gfc_commit_symbol (result
->symtree
->n
.sym
);
4717 gcc_assert (result
->symtree
4718 && (result
->symtree
->n
.sym
->attr
.flavor
== FL_PROCEDURE
4719 || result
->symtree
->n
.sym
->attr
.flavor
== FL_UNKNOWN
));
4720 result
->symtree
->n
.sym
->intmod_sym_id
= id
;
4721 result
->symtree
->n
.sym
->attr
.flavor
= FL_PROCEDURE
;
4722 result
->symtree
->n
.sym
->attr
.intrinsic
= 1;
4723 result
->symtree
->n
.sym
->attr
.artificial
= 1;
4725 va_start (ap
, numarg
);
4727 for (i
= 0; i
< numarg
; ++i
)
4731 atail
->next
= gfc_get_actual_arglist ();
4732 atail
= atail
->next
;
4735 atail
= result
->value
.function
.actual
= gfc_get_actual_arglist ();
4737 atail
->expr
= va_arg (ap
, gfc_expr
*);
4745 /* Check if an expression may appear in a variable definition context
4746 (F2008, 16.6.7) or pointer association context (F2008, 16.6.8).
4747 This is called from the various places when resolving
4748 the pieces that make up such a context.
4749 If own_scope is true (applies to, e.g., ac-implied-do/data-implied-do
4750 variables), some checks are not performed.
4752 Optionally, a possible error message can be suppressed if context is NULL
4753 and just the return status (true / false) be requested. */
4756 gfc_check_vardef_context (gfc_expr
* e
, bool pointer
, bool alloc_obj
,
4757 bool own_scope
, const char* context
)
4759 gfc_symbol
* sym
= NULL
;
4761 bool check_intentin
;
4763 symbol_attribute attr
;
4767 if (e
->expr_type
== EXPR_VARIABLE
)
4769 gcc_assert (e
->symtree
);
4770 sym
= e
->symtree
->n
.sym
;
4772 else if (e
->expr_type
== EXPR_FUNCTION
)
4774 gcc_assert (e
->symtree
);
4775 sym
= e
->value
.function
.esym
? e
->value
.function
.esym
: e
->symtree
->n
.sym
;
4778 attr
= gfc_expr_attr (e
);
4779 if (!pointer
&& e
->expr_type
== EXPR_FUNCTION
&& attr
.pointer
)
4781 if (!(gfc_option
.allow_std
& GFC_STD_F2008
))
4784 gfc_error ("Fortran 2008: Pointer functions in variable definition"
4785 " context (%s) at %L", context
, &e
->where
);
4789 else if (e
->expr_type
!= EXPR_VARIABLE
)
4792 gfc_error ("Non-variable expression in variable definition context (%s)"
4793 " at %L", context
, &e
->where
);
4797 if (!pointer
&& sym
->attr
.flavor
== FL_PARAMETER
)
4800 gfc_error ("Named constant %qs in variable definition context (%s)"
4801 " at %L", sym
->name
, context
, &e
->where
);
4804 if (!pointer
&& sym
->attr
.flavor
!= FL_VARIABLE
4805 && !(sym
->attr
.flavor
== FL_PROCEDURE
&& sym
== sym
->result
)
4806 && !(sym
->attr
.flavor
== FL_PROCEDURE
&& sym
->attr
.proc_pointer
))
4809 gfc_error ("%qs in variable definition context (%s) at %L is not"
4810 " a variable", sym
->name
, context
, &e
->where
);
4814 /* Find out whether the expr is a pointer; this also means following
4815 component references to the last one. */
4816 is_pointer
= (attr
.pointer
|| attr
.proc_pointer
);
4817 if (pointer
&& !is_pointer
)
4820 gfc_error ("Non-POINTER in pointer association context (%s)"
4821 " at %L", context
, &e
->where
);
4828 || (e
->ts
.type
== BT_DERIVED
4829 && e
->ts
.u
.derived
->from_intmod
== INTMOD_ISO_FORTRAN_ENV
4830 && e
->ts
.u
.derived
->intmod_sym_id
== ISOFORTRAN_LOCK_TYPE
)))
4833 gfc_error ("LOCK_TYPE in variable definition context (%s) at %L",
4834 context
, &e
->where
);
4838 /* INTENT(IN) dummy argument. Check this, unless the object itself is the
4839 component of sub-component of a pointer; we need to distinguish
4840 assignment to a pointer component from pointer-assignment to a pointer
4841 component. Note that (normal) assignment to procedure pointers is not
4843 check_intentin
= !own_scope
;
4844 ptr_component
= (sym
->ts
.type
== BT_CLASS
&& CLASS_DATA (sym
))
4845 ? CLASS_DATA (sym
)->attr
.class_pointer
: sym
->attr
.pointer
;
4846 for (ref
= e
->ref
; ref
&& check_intentin
; ref
= ref
->next
)
4848 if (ptr_component
&& ref
->type
== REF_COMPONENT
)
4849 check_intentin
= false;
4850 if (ref
->type
== REF_COMPONENT
&& ref
->u
.c
.component
->attr
.pointer
)
4852 ptr_component
= true;
4854 check_intentin
= false;
4857 if (check_intentin
&& sym
->attr
.intent
== INTENT_IN
)
4859 if (pointer
&& is_pointer
)
4862 gfc_error ("Dummy argument %qs with INTENT(IN) in pointer"
4863 " association context (%s) at %L",
4864 sym
->name
, context
, &e
->where
);
4867 if (!pointer
&& !is_pointer
&& !sym
->attr
.pointer
)
4870 gfc_error ("Dummy argument %qs with INTENT(IN) in variable"
4871 " definition context (%s) at %L",
4872 sym
->name
, context
, &e
->where
);
4877 /* PROTECTED and use-associated. */
4878 if (sym
->attr
.is_protected
&& sym
->attr
.use_assoc
&& check_intentin
)
4880 if (pointer
&& is_pointer
)
4883 gfc_error ("Variable %qs is PROTECTED and can not appear in a"
4884 " pointer association context (%s) at %L",
4885 sym
->name
, context
, &e
->where
);
4888 if (!pointer
&& !is_pointer
)
4891 gfc_error ("Variable %qs is PROTECTED and can not appear in a"
4892 " variable definition context (%s) at %L",
4893 sym
->name
, context
, &e
->where
);
4898 /* Variable not assignable from a PURE procedure but appears in
4899 variable definition context. */
4900 if (!pointer
&& !own_scope
&& gfc_pure (NULL
) && gfc_impure_variable (sym
))
4903 gfc_error ("Variable %qs can not appear in a variable definition"
4904 " context (%s) at %L in PURE procedure",
4905 sym
->name
, context
, &e
->where
);
4909 if (!pointer
&& context
&& gfc_implicit_pure (NULL
)
4910 && gfc_impure_variable (sym
))
4915 for (ns
= gfc_current_ns
; ns
; ns
= ns
->parent
)
4917 sym
= ns
->proc_name
;
4920 if (sym
->attr
.flavor
== FL_PROCEDURE
)
4922 sym
->attr
.implicit_pure
= 0;
4927 /* Check variable definition context for associate-names. */
4928 if (!pointer
&& sym
->assoc
)
4931 gfc_association_list
* assoc
;
4933 gcc_assert (sym
->assoc
->target
);
4935 /* If this is a SELECT TYPE temporary (the association is used internally
4936 for SELECT TYPE), silently go over to the target. */
4937 if (sym
->attr
.select_type_temporary
)
4939 gfc_expr
* t
= sym
->assoc
->target
;
4941 gcc_assert (t
->expr_type
== EXPR_VARIABLE
);
4942 name
= t
->symtree
->name
;
4944 if (t
->symtree
->n
.sym
->assoc
)
4945 assoc
= t
->symtree
->n
.sym
->assoc
;
4954 gcc_assert (name
&& assoc
);
4956 /* Is association to a valid variable? */
4957 if (!assoc
->variable
)
4961 if (assoc
->target
->expr_type
== EXPR_VARIABLE
)
4962 gfc_error ("%qs at %L associated to vector-indexed target can"
4963 " not be used in a variable definition context (%s)",
4964 name
, &e
->where
, context
);
4966 gfc_error ("%qs at %L associated to expression can"
4967 " not be used in a variable definition context (%s)",
4968 name
, &e
->where
, context
);
4973 /* Target must be allowed to appear in a variable definition context. */
4974 if (!gfc_check_vardef_context (assoc
->target
, pointer
, false, false, NULL
))
4977 gfc_error ("Associate-name %qs can not appear in a variable"
4978 " definition context (%s) at %L because its target"
4979 " at %L can not, either",
4980 name
, context
, &e
->where
,
4981 &assoc
->target
->where
);
4986 /* Check for same value in vector expression subscript. */
4989 for (ref
= e
->ref
; ref
!= NULL
; ref
= ref
->next
)
4990 if (ref
->type
== REF_ARRAY
&& ref
->u
.ar
.type
== AR_SECTION
)
4991 for (i
= 0; i
< GFC_MAX_DIMENSIONS
4992 && ref
->u
.ar
.dimen_type
[i
] != 0; i
++)
4993 if (ref
->u
.ar
.dimen_type
[i
] == DIMEN_VECTOR
)
4995 gfc_expr
*arr
= ref
->u
.ar
.start
[i
];
4996 if (arr
->expr_type
== EXPR_ARRAY
)
4998 gfc_constructor
*c
, *n
;
5001 for (c
= gfc_constructor_first (arr
->value
.constructor
);
5002 c
!= NULL
; c
= gfc_constructor_next (c
))
5004 if (c
== NULL
|| c
->iterator
!= NULL
)
5009 for (n
= gfc_constructor_next (c
); n
!= NULL
;
5010 n
= gfc_constructor_next (n
))
5012 if (n
->iterator
!= NULL
)
5016 if (gfc_dep_compare_expr (ec
, en
) == 0)
5019 gfc_error_now ("Elements with the same value "
5020 "at %L and %L in vector "
5021 "subscript in a variable "
5022 "definition context (%s)",
5023 &(ec
->where
), &(en
->where
),